bdd0e96d78
A block's value is now its last statement ONLY when that statement is a trailing expression with no `;`. A trailing `;` discards the value, leaving the block void. This makes value-vs-statement explicit and lets the compiler reject "this block was supposed to produce a value". Compiler: - Parser records `Block.produces_value` (last stmt is a no-`;` trailing expression) + `Block.discarded_semi` (the `;` that discarded a value), via `expectSemicolonAfter`. A trailing expression before `}` may now omit its `;` (previously a parse error). Match-arm and else-arm bodies are built value-producing regardless of the arm `;` (arms are exempt — the `;` is an arm terminator). - Lowering: `lowerBlockValue` / the block-expr path / `inferExprType` respect `produces_value`. A value-position block that discards its value is a hard error (`lowerValueBody` for function bodies; the value-context `.block` path for if/else branches, `catch` bodies, value bindings, match arms). Pure-failable `-> !` bodies (value rides the error channel) and a value-if whose branches are void are handled without false errors. - `defer`/`onfail` cleanup bodies lower as statements (void), so a trailing `;` there is fine. Migration (behavior-preserving — output unchanged): - stdlib + ~210 examples: dropped the trailing `;` on value-position last expressions. `format` now ends with an explicit `#insert "return result;"` (it relied on `#insert`-as-block-value, which `;` discards). - Two `main :: () -> s32` examples that relied on the old silent default-return got an explicit trailing `0`. - Rejection snapshots 0412 / 1013 regenerated (their quoted source lines lost a `;`); the diagnostics themselves are unchanged. Docs/tests: specs.md "Block values" section; examples 0040 (rules) + 0041 (rejection); 3 parser unit tests. Filed issue 0066 (pre-existing match-arm negated-literal phi-width quirk, surfaced not caused here). Gates: zig build, zig build test, run_examples.sh -> 343 passed, cross_compile.sh -> 7 passed (also refreshed its stale example names).
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 :: () -> s64;
|
|
}
|
|
|
|
Leaf :: struct { value: s64; }
|
|
impl Sizable for Leaf {
|
|
size :: (self: *Leaf) -> s64 { 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");
|
|
}
|