Orkuncakilkaya
bca8f126fc
Implement the rest of NETWORKING-DESIGN.md (N2–N6) and eliminate every
`.c` file from the repo. clang remains only the LLVM-IR assembler; no C
is compiled anywhere.
Networking (selfhost/emit_net.ludic + parser/emit changes):
- N2 @Sync: per-model serialize/apply + by-kind dispatchers; POD-scalar
compile error and empty-participation warning; selective replication.
- N3 @Owned: @L_owner array + owner/set_owner/is_owner; owners snapshot.
- N4 @ToServer/@ToClients remote events: framed net_send + net_pump re-emit.
- N5 @Server/@Predicted role guards + drivable sim (tick_fixed/tick_render,
entry-owns-the-loop).
- Built-in loopback transport so multiplayer runs with zero foreign code;
extern fn net_send/net_poll still overrides it for a real socket.
- N6 blessed runtime (examples/net_rt.ludic) + end-to-end demo (net_demo).
- Fix: llty("entity") is now i32 (entities are i32 handles), so let e = self().
C elimination:
- Networking + foreign-mod-ABI tests rewritten as self-contained pure-Ludic
programs (examples/net_*, world_*, mod_events, scoped); tests/ removed.
- Reflection ABI exposed to Ludic as world_* builtins (Ludic-to-Ludic modding).
- Formatter rewritten C→Ludic: tools/ludic-tools/fmt.ludic.
- Language server rewritten C→Ludic: tools/ludic-tools/lsp.ludic (lexer, index
parser, cross-file workspace resolver, JSON, all LSP handlers).
- Obsolete migrate_*.c codemods deleted; ludic_syntax.h kept as vocabulary data.
Suites: ./test.sh 44/44, ./tools/test-tools.sh 28/28 (LSP 42/42), fixpoint holds.
Co-Authored-By: Claude Opus 4.8 <noreply@anthropic.com>
21 lines
731 B
Text
21 lines
731 B
Text
# recurse.ludic — EV6: re-entrant emit is bounded. Ping's listener emits Pong,
|
|
# Pong's listener emits Ping — an event cycle that would hang the frame forever.
|
|
# The depth bound (EV_DEPTH_CAP) makes the nesting trap as an early return, so the
|
|
# program terminates with a bounded count instead of spinning. This is the "no
|
|
# runaway event cycle" guarantee.
|
|
#
|
|
# Running it prints: 16 (the cycle bottoms out at the depth cap, deterministically)
|
|
program Recurse {
|
|
var n: int = 0
|
|
|
|
event Ping { }
|
|
event Pong { }
|
|
|
|
@On(Ping) handler A { n = n + 1; emit Pong() } # each Ping deepens by one Pong
|
|
@On(Pong) handler B { emit Ping() } # ...and each Pong by one Ping
|
|
|
|
entry {
|
|
emit Ping()
|
|
print(n)
|
|
}
|
|
}
|