Here are the data structures with brief descriptions:

Cacutest_test_
Cacutest_test_CMDLINE_OPTION_
Cacutest_test_data_
Cfiber_mbox_t
Cgc_dummy
Chashmap_dummy
Chmap_collision_t	A simple alist to manage collision nodes
Chmap_control_t	If we ever want to modify some of these behaviours for a new instance of hashmap, we should use this control type
Chmap_key_t	Note: For key equality we use the memcpy function
Chmap_kv_entry_t
Chmap_node_t
Chmap_t
Cmailbox_t
Cmm_64k
Cmm_dummy
Cseq_dummy
Cseq_lookup_result_t
Cseq_node_t	We have two type of node that both are implemented using the same data structure
Cseq_t
Csrn_alist_t
Csrn_bindings_t
Csrn_block_t
Csrn_closure_t
Csrn_compiler_configuration_t
Csrn_cond_t
Csrn_context_t
Csrn_engine_t	Engine is a structure to own the long living and main pieces of the compiler
Csrn_env_t
Csrn_error_t
Csrn_fiber_ctx_t	The saved context of a suspended fiber is a single word: its stack pointer at the moment it was switched away from
Csrn_fiber_frame	Srn_fiber_frame is the exact frame srn_fiber_swap (switch_x86_64.S) pushes and pops, and that srn_fiber_ctx_make (ctx_x86_64.c) fabricates for a fresh fiber
Csrn_fiber_stack_t	One stack per fiber, mapped with a guard page at the low end so an overflow faults deterministically instead of corrupting a neighbour
Csrn_fiber_t
Csrn_jit_module_t
Csrn_jit_t
Csrn_keyword_t	A keyword: just a name
Csrn_list_node_t	A list is a singly linked sequence of values
Csrn_list_t	Since all the values are immutable and persistent
Csrn_map_t	A persistent, immutable map
Csrn_memory_provider_t	This interface is here to abstract over the allocator
Csrn_metadata_t
Csrn_mm_t	Main memory manager structure that will own all the allocated blocks and data
Csrn_mutex_t
Csrn_namespace_src_buffer_t
Csrn_namespace_t
Csrn_pair_t
Csrn_scheduler_t
Csrn_seq_t	A persistent, immutable, indexed sequence
Csrn_spinlock_t
Csrn_src_location_t
Csrn_string_t
Csrn_symbol_t
Csrn_syntax_t
Csrn_thread_t
Csrn_value_t
Csrn_worker_t	The state one os thread uses to run fibers