| examples | |
| fibers | |
| 01_hello.c | |
| 02_yield.c | |
| 03_wait_for.c | |
| 04_suspend_resume.c | |
| 05_parallel.c | |
| 06_request_term.c | |
| 07_sleep.c | |
| 08_pipe.c | |
| 09_tcp_echo.c | |
| 10_drain.c | |
| 11_tcp_ping_pong.c | |
| 12_http_server.c | |
| 13_map_reduce.c | |
| 14_mutex.c | |
| usage | |
| cmake | |
| hello.c | |
| make | |
| hello.c | |
| meson | |
| hello.c | |
| ir | |
| reader.c | |
| jit | |
| jit.c | |
| jit.cpp | |
| rt | |
| fiber | |
| arch | |
| ctx_x86_64.c | X86-64 fabrication of a fresh fiber's saved context |
| switch_x86_64.S | |
| platform | |
| stack_posix.c | |
| thread_posix.c | POSIX implementation of the thread-level operations in serene/rt/fiber/thread.h, realised with pthreads |
| fiber.c | |
| io.c | The fiber side of the reactor: the only layer that knows both fibers and the reactor |
| mutex.c | |
| scheduler.c | |
| impl | |
| array_list.c | |
| hashmap.c | Notes: |
| pqmh.c | |
| seq.c | |
| spsc_ring.c | |
| mm | |
| default.c | |
| reactor | |
| backend | |
| epoll.c | |
| backend.h | Internal reactor backend interface |
| internal.h | |
| reactor.c | |
| abi.c | |
| configuration.c | |
| context.c | |
| core.c | |
| engine.c | |
| errors.c | |
| keywords.c | |
| lists.c | |
| maps.c | |
| namespaces.c | |
| print.c | |
| protocols.c | |
| seqs.c | |
| source_manager.c | |
| strings.c | |
| symbols.c | |
| serene | |
| ir | |
| kleene.h | In admiration of Stephen Cole Kleene |
| reader.h | A simple sexp reader to be used with textual IR |
| jit | |
| jit.h | |
| rt | |
| core | |
| numbers.h | |
| fiber | |
| arch | |
| stack_x86_64.h | |
| io.h | The fiber facing IO API: blocking looking calls a fiber uses to do IO |
| mutex.h | A fiber blocking mutex |
| thread.h | srn_thread_t, srn_mutex_t, and srn_cond_t model the thread-level operations the runtime needs, with semantics defined here rather than borrowed from one OS API |
| impl | |
| alist.h | |
| array_list.h | A bit-partitioned trie with a tail buffer, used as a growable indexed sequence in the runtime |
| hashmap.h | This is an implementation of Compressed Hash-Array Mapped Prefix-tree, which is a bit-partitioned, persistent, immutable Hashed array mapped trie |
| pqmh.h | A generic priority queue backed by a binary min-heap |
| seq.h | This is an implementation of bit - partitioned, persistent, immutable sequence For more information, have a look at Ideal hash trees paper |
| spsc_ring.h | A mutable single producer, single consumer ring of fixed size elements |
| mm | |
| interface.h | Notes: |
| abi.h | |
| closures.h | |
| configuration.h | The single place that holds every runtime knob |
| context.h | |
| core.h | |
| engine.h | |
| environments.h | |
| errors.h | Error handling for the runtime |
| fiber.h | AI Generated (🤦) Fiber subsystem overview |
| keywords.h | |
| lists.h | |
| maps.h | |
| namespaces.h | A namespace is an isolation for names nad technically a compilation unit |
| print.h | |
| protocols.h | |
| reactor.h | Reactor overview |
| seqs.h | |
| source_manager.h | Source manager is what that read the source files and own the buffer that contains the data |
| strings.h | |
| symbols.h | |
| trace.h | Platform neutral static tracepoints |
| utils | |
| srn_dbg_sym.h | Portable symbol resolution for error trace printing |
| srn_mmap.h | |
| runtime.h | |
| utils.h | |
| tests | |
| include | |
| acutest.h | |
| reader | |
| main.c | |
| runtime | |
| fiber | |
| mutex_tests.h | |
| array_list_tests.h | |
| base.h | |
| context_tests.h | |
| engine_tests.h | |
| fiber_tests.h | |
| gc_tests.h | |
| hashmap_tests.h | |
| main.c | |
| mm_tests.h | |
| ns_tests.h | |
| pqmh_tests.h | |
| reactor_io_tests.h | |
| reactor_tests.h | |
| reader_tests.h | |
| seq_tests.h | |
| source_manager_tests.h | |
| spsc_ring_tests.h | |
| symbol_tests.h | |
| value_tests.h | |
| third_party | |
| xxhash.h | |
| utils | |
| posix | |
| srn_dbg_sym.c | |
| srn_mmap.c | |
| win32 | |
| srn_dbg_sym.c | |
| srn_mmap.c | |
| runtime.c | |
| utils.c | |