diff options
| author | 2026-10-14 18:35:03 +0330 | |
|---|---|---|
| committer | 2026-10-14 18:35:03 +0330 | |
| commit | 433fb8cb71e98bbfd579fb43dbc0eac0a60bae73 (patch) | |
| tree | 8504a6c34dbe45059a25ad19a2824d3f94b72893 /src/core/stack.h | |
| parent | merge work/jit2: compiled o3 regions on x86-64 (diff) | |
rt: exact-size heap bounds; n, the words new asked for, lives in bits 32..62 of p[-4]
the bnd recipe and paylen read n instead of the power-of-two block:
bnd: r6 = sub p 3; r6 = ld r6; r7 = xor p 0x2B7E1516; r6 = eq r6 r7;
r7 = sub p 4; r7 = ld r7; r7 = shr r7 32; r7 = mul r7 q;
r8 = mul i m; r8 = ltu r8 r7; r8 = xor r8 1; r0 = and r6 r8
paylen: return p[-4] >> 32
two loads instead of three; osize, bchk, release, recycle and the memdebug
leak report all read n (rt.new(4) has length 4, rt.new(0) has 0).
writers: new_raw and new_k set n; stack.h line 87 and tinyvm.ts (BigInt) set
it on stack segments. release clears n when a block goes into quarantine
(len 0, indexing traps; under memdebug bchk reports a use after free); every
free-list path (fpush, mkblock, bdrop, recycle_leaf, balloc hold) rewrites
the word as k << 16, and an array that grows gets a fresh block. a request over
2^31-1-HDR words stops in new_raw (oom), and the compiler only takes the
new_k fast path for constant sizes that fit, so n is never truncated.
bit users checked (all mask or preserve bits 32..62; none compares or copies
the whole word): gc mark and sweep; release, free, recycle, recycle_leaf;
share and own; isobj, quar, checkptr, obj_base; bclass and the bfree buddy
merge; balloc, mkblock, fpush, funlink, heap_grow; frame_grow; stack_allocate
in src/core/stack.h and src/js/tinyvm.ts; micro.c and core.c (check word
only); the compiler's two p[-4] | F_INTERNAL writes (base.zc, builtins.zc).
32-bit ports: none (baremetal, wasm and micro use int64 Cell).
tests: tests/programs/exactsize.zc (n-1/n for non-power-of-two sizes, new(0),
packed bytes, recycle, grow, stack growth); 8-runtime: exact_size_bounds,
pointer_index_n_minus_1, pointer_index_n_traps, pointer_index_n_traps_memdebug,
new_zero_index_traps, new_too_big_traps, stale_index_after_free_traps,
stale_index_after_free_memdebug. expectations changed: leak report shows n
(tests/test.sh line 169, examples/learn/13-memdebug.out, docs/LEARN.md,
4-statements/memdebug_report_line.zc). programs adjusted to keep test.sh
expectations: quarantine.zc (unbounded), bounds_heap.zc (rt.new(11)).
spec 3.7.4 and 4.11 updated. fixpoint 402204 words (main 402197).
Diffstat (limited to 'src/core/stack.h')
| -rw-r--r-- | src/core/stack.h | 2 |
1 files changed, 1 insertions, 1 deletions
diff --git a/src/core/stack.h b/src/core/stack.h index f699b52..8c7f7a2 100644 --- a/src/core/stack.h +++ b/src/core/stack.h @@ -84,7 +84,7 @@ static Cell stack_allocate(Cell words) m[b + 2] = 0; m[b + 5] = 0; m[b + 6] = 0; continue; } p = b + 5; - m[b] = (Cell)1 << k; m[b + 1] = ((Cell)k << 16) | 1 | 512 | 1024 | (stack_get(SC_GC_ACTIVE) ? 2 : 0); + m[b] = (Cell)1 << k; m[b + 1] = ((Cell)k << 16) | 1 | 512 | 1024 | (stack_get(SC_GC_ACTIVE) ? 2 : 0) | ((Cell)words << 32); /* n, as rt.zc's new_raw */ m[b + 2] = p ^ 0x2B7E1516; m[b + 3] = 0; m[b + 4] = -words - 1; for (i = p; i < b + ((Cell)1 << k); i++) m[i] = 0; return p; |
