d8076b9333
Surface rename of the signed integer family: s1..s64 become i1..i64
(u1..u64, usize, isize unchanged). 'string' keeps the s-prefix arm in
name classification; width parsing moves to the i-prefix arm next to
isize.
Internal TypeId tags follow the surface (.s8/.s16/.s32/.s64 ->
.i8/.i16/.i32/.i64), as do mono-key mangle fragments (ptr_i64,
tu_i64_bool) and all display/diagnostic formatting (i{d}).
Migrated in the same sweep: stdlib + examples + issue repros + FFI C
companions (shared symbol names like ffi_id_i64), expected
stdout/stderr/ir snapshots, specs.md, readme.md, CLAUDE.md/AGENTS.md,
implementation_plan.md, docs/, issue writeups. Vendored stb_image and
historical flow state left untouched.
zig build test: 426/426; examples suite: 595/595.
43 lines
1.3 KiB
Plaintext
43 lines
1.3 KiB
Plaintext
// `List(Protocol)` appended from inside a helper function, dispatched
|
|
// repeatedly from `main` after the helper returns. Exercises the heap-copy
|
|
// path for both implicit-erasure-on-append and pre-erased protocol values.
|
|
|
|
#import "modules/std.sx";
|
|
|
|
Sizable :: protocol {
|
|
size :: () -> i64;
|
|
}
|
|
|
|
Leaf :: struct { value: i64; }
|
|
impl Sizable for Leaf {
|
|
size :: (self: *Leaf) -> i64 { self.value }
|
|
}
|
|
|
|
add :: (items: *List(Sizable), w: Leaf) {
|
|
p := w;
|
|
items.append(p); // protocol value created from stack local `p`
|
|
}
|
|
|
|
main :: () -> void {
|
|
// Works: protocol value created in main, appended to list
|
|
out("=== Created in main ===\n");
|
|
list_a : List(Sizable) = .{};
|
|
s : Sizable = Leaf.{ value = 42 };
|
|
list_a.append(s);
|
|
r1 := list_a.items[0].size();
|
|
print("first: {} (expected 42)\n", r1);
|
|
r2 := list_a.items[0].size();
|
|
print("second: {} (expected 42)\n", r2);
|
|
|
|
// BUG: protocol value created in add(), first dispatch works, second crashes
|
|
out("=== Created in add() ===\n");
|
|
list_b : List(Sizable) = .{};
|
|
add(@list_b, Leaf.{ value = 99 });
|
|
r3 := list_b.items[0].size();
|
|
print("first: {} (expected 99)\n", r3); // works (stack not yet clobbered)
|
|
r4 := list_b.items[0].size();
|
|
print("second: {} (expected 99)\n", r4); // CRASH: stack memory reused
|
|
|
|
out("=== OK ===\n");
|
|
}
|