| ... | ... | @@ -69,19 +69,26 @@ pub const Id = if (InternPool.single_threaded) enum { |
| 69 | 69 | /// will likely involve significant changes to the `InternPool` implementation. |
| 70 | 70 | var available_tids: std.ArrayList(Id) = .empty; |
| 71 | 71 | threadlocal var recursive_depth: usize = 0; |
| 72 | | threadlocal var recursive_tid: Id = .main; |
| 72 | threadlocal var recursive_tid: Id = undefined; |
| 73 | 73 | |
| 74 | 74 | pub fn allocate(arena: Allocator, n: usize) Allocator.Error!void { |
| 75 | 75 | assert(available_tids.items.len == 0); |
| 76 | 76 | try available_tids.ensureTotalCapacityPrecise(arena, n - 1); |
| 77 | 77 | for (1..n) |tid| available_tids.appendAssumeCapacity(@enumFromInt(tid)); |
| 78 | switch (build_options.io_mode) { |
| 79 | .threaded => { |
| 80 | // Called from the main thread, so mark ourselves as such. |
| 81 | recursive_depth = 1; |
| 82 | recursive_tid = .main; |
| 83 | }, |
| 84 | .evented => {}, |
| 85 | } |
| 78 | 86 | } |
| 79 | 87 | pub fn acquire(io: std.Io) Id { |
| 80 | 88 | switch (build_options.io_mode) { |
| 81 | 89 | .threaded => { |
| 82 | 90 | recursive_depth += 1; |
| 83 | 91 | if (recursive_depth > 1) { |
| 84 | | assert(recursive_tid != .main); |
| 85 | 92 | return recursive_tid; |
| 86 | 93 | } |
| 87 | 94 | }, |
| ... | ... | @@ -106,7 +113,6 @@ pub const Id = if (InternPool.single_threaded) enum { |
| 106 | 113 | assert(recursive_tid == tid); |
| 107 | 114 | recursive_depth -= 1; |
| 108 | 115 | if (recursive_depth > 0) return; |
| 109 | | recursive_tid = .main; |
| 110 | 116 | }, |
| 111 | 117 | .evented => {}, |
| 112 | 118 | } |
Matthew Lugg <mlugg@mlugg.co.uk> 2026-03-19 16:48:24+00:00
src