diff options
| author | 2026-10-15 18:29:55 +0330 | |
|---|---|---|
| committer | 2026-10-15 18:29:55 +0330 | |
| commit | e7fe081efaae893ed46548fdbc3bfa39b2879878 (patch) | |
| tree | ad2e3804bcbc6493d7152f68e91f17d4b357c73e /tests/conformance/6-ownership/drop_gc_cycle_long.zc | |
| parent | constant expressions: c precedence and / % ^ (b.1.3); local const usable in c... (diff) | |
duplicate case labels are an error (b.2.15); unterminated string literal reported where it starts (b.2.11); an unreachable droppable cycle drops whole in one collection (6.15.3)
Diffstat (limited to 'tests/conformance/6-ownership/drop_gc_cycle_long.zc')
| -rw-r--r-- | tests/conformance/6-ownership/drop_gc_cycle_long.zc | 24 |
1 files changed, 24 insertions, 0 deletions
diff --git a/tests/conformance/6-ownership/drop_gc_cycle_long.zc b/tests/conformance/6-ownership/drop_gc_cycle_long.zc new file mode 100644 index 0000000..3de3f1e --- /dev/null +++ b/tests/conformance/6-ownership/drop_gc_cycle_long.zc @@ -0,0 +1,24 @@ +// expect: 0 5 15 5 0/ +// destructors 6.15.3: an unreachable cycle of five values with drops is finalized whole by one collection, each value once, then freed +include rt; +int n, sum; +word g; +struct node { node* next; int v; void drop() { n++; sum = sum + this.v; } } +unchecked fn make() { + node* a = rt.new(node); node* p = a; int i; + a.v = 1; + for (i = 2; i <= 5; i++) { node* q = rt.new(node); q.v = i; p.next = q; p = q; } + p.next = a; + g = a; + return 0; +} +fn main() { + make(); + rt.gc(); rt.put_n(n); rt.put_c(32); + g = 0; + rt.gc(); rt.put_n(n); rt.put_c(32); rt.put_n(sum); rt.put_c(32); + rt.gc(); rt.put_n(n); rt.put_c(32); + rt.put_n(rt.dcount); rt.put_c(10); + return 0; +} +// zc0: skip |
