| ... | ... | @@ -7,15 +7,25 @@ const EventLoop = @This(); |
| 7 | 7 | |
| 8 | 8 | gpa: Allocator, |
| 9 | 9 | mutex: std.Thread.Mutex, |
| 10 | cond: std.Thread.Condition, |
| 10 | 11 | queue: std.DoublyLinkedList(void), |
| 11 | 12 | free: std.DoublyLinkedList(void), |
| 12 | 13 | main_fiber_buffer: [@sizeOf(Fiber) + max_result_len]u8 align(@alignOf(Fiber)), |
| 14 | exiting: bool, |
| 15 | idle_count: usize, |
| 16 | threads: std.ArrayListUnmanaged(Thread), |
| 13 | 17 | |
| 18 | threadlocal var current_thread: *Thread = undefined; |
| 14 | 19 | threadlocal var current_fiber: *Fiber = undefined; |
| 15 | 20 | |
| 16 | 21 | const max_result_len = 64; |
| 17 | 22 | const min_stack_size = 4 * 1024 * 1024; |
| 18 | 23 | |
| 24 | const Thread = struct { |
| 25 | thread: std.Thread, |
| 26 | idle_fiber: Fiber, |
| 27 | }; |
| 28 | |
| 19 | 29 | const Fiber = struct { |
| 20 | 30 | context: Context, |
| 21 | 31 | awaiter: ?*Fiber, |
| ... | ... | @@ -23,32 +33,58 @@ const Fiber = struct { |
| 23 | 33 | |
| 24 | 34 | const finished: ?*Fiber = @ptrFromInt(std.mem.alignBackward(usize, std.math.maxInt(usize), @alignOf(Fiber))); |
| 25 | 35 | |
| 26 | | fn resultPointer(f: *Fiber) [*]u8 { |
| 27 | | const base: [*]u8 = @ptrCast(f); |
| 28 | | return base + @sizeOf(Fiber); |
| 29 | | } |
| 30 | | |
| 31 | | fn stackEndPointer(f: *Fiber) [*]u8 { |
| 32 | | const base: [*]u8 = @ptrCast(f); |
| 33 | | return base + std.mem.alignForward( |
| 36 | fn allocatedSlice(f: *Fiber) []align(@alignOf(Fiber)) u8 { |
| 37 | const base: [*]align(@alignOf(Fiber)) u8 = @ptrCast(f); |
| 38 | return base[0..std.mem.alignForward( |
| 34 | 39 | usize, |
| 35 | 40 | @sizeOf(Fiber) + max_result_len + min_stack_size, |
| 36 | 41 | std.heap.page_size_max, |
| 37 | | ); |
| 42 | )]; |
| 43 | } |
| 44 | |
| 45 | fn resultSlice(f: *Fiber) []u8 { |
| 46 | const base: [*]align(@alignOf(Fiber)) u8 = @ptrCast(f); |
| 47 | return base[@sizeOf(Fiber)..][0..max_result_len]; |
| 48 | } |
| 49 | |
| 50 | fn stackEndPointer(f: *Fiber) [*]u8 { |
| 51 | const allocated_slice = f.allocatedSlice(); |
| 52 | return allocated_slice[allocated_slice.len..].ptr; |
| 38 | 53 | } |
| 39 | 54 | }; |
| 40 | 55 | |
| 41 | | pub fn init(el: *EventLoop, gpa: Allocator) void { |
| 56 | pub fn init(el: *EventLoop, gpa: Allocator) error{OutOfMemory}!void { |
| 42 | 57 | el.* = .{ |
| 43 | 58 | .gpa = gpa, |
| 44 | 59 | .mutex = .{}, |
| 60 | .cond = .{}, |
| 45 | 61 | .queue = .{}, |
| 46 | 62 | .free = .{}, |
| 47 | 63 | .main_fiber_buffer = undefined, |
| 64 | .exiting = false, |
| 65 | .idle_count = 0, |
| 66 | .threads = try .initCapacity(gpa, @max(std.Thread.getCpuCount() catch 1, 1)), |
| 48 | 67 | }; |
| 68 | current_thread = el.threads.addOneAssumeCapacity(); |
| 49 | 69 | current_fiber = @ptrCast(&el.main_fiber_buffer); |
| 50 | 70 | } |
| 51 | 71 | |
| 72 | pub fn deinit(el: *EventLoop) void { |
| 73 | { |
| 74 | el.mutex.lock(); |
| 75 | defer el.mutex.unlock(); |
| 76 | assert(el.queue.len == 0); // pending async |
| 77 | el.exiting = true; |
| 78 | } |
| 79 | el.cond.broadcast(); |
| 80 | while (el.free.pop()) |free_node| { |
| 81 | const free_fiber: *Fiber = @fieldParentPtr("queue_node", free_node); |
| 82 | el.gpa.free(free_fiber.allocatedSlice()); |
| 83 | } |
| 84 | for (el.threads.items[1..]) |*thread| thread.thread.join(); |
| 85 | el.threads.deinit(el.gpa); |
| 86 | } |
| 87 | |
| 52 | 88 | fn allocateFiber(el: *EventLoop, result_len: usize) error{OutOfMemory}!*Fiber { |
| 53 | 89 | assert(result_len <= max_result_len); |
| 54 | 90 | const free_node = free_node: { |
| ... | ... | @@ -73,10 +109,8 @@ fn yield(el: *EventLoop, optional_fiber: ?*Fiber, register_awaiter: ?*?*Fiber) v |
| 73 | 109 | break :ready_node el.queue.pop(); |
| 74 | 110 | }) |ready_node| |
| 75 | 111 | @fieldParentPtr("queue_node", ready_node) |
| 76 | | else if (register_awaiter) |_| // time to switch to an idle fiber? |
| 77 | | @panic("no other fiber to switch to in order to be able to register this fiber as an awaiter") |
| 78 | | else // nothing to do |
| 79 | | return; |
| 112 | else |
| 113 | &current_thread.idle_fiber; |
| 80 | 114 | const message: SwitchMessage = .{ |
| 81 | 115 | .prev_context = &current_fiber.context, |
| 82 | 116 | .ready_context = &ready_fiber.context, |
| ... | ... | @@ -90,20 +124,44 @@ fn yield(el: *EventLoop, optional_fiber: ?*Fiber, register_awaiter: ?*?*Fiber) v |
| 90 | 124 | } |
| 91 | 125 | |
| 92 | 126 | fn schedule(el: *EventLoop, fiber: *Fiber) void { |
| 93 | | el.mutex.lock(); |
| 94 | | defer el.mutex.unlock(); |
| 95 | | el.queue.append(&fiber.queue_node); |
| 127 | signal: { |
| 128 | el.mutex.lock(); |
| 129 | defer el.mutex.unlock(); |
| 130 | el.queue.append(&fiber.queue_node); |
| 131 | if (el.idle_count > 0) break :signal; |
| 132 | if (el.threads.items.len == el.threads.capacity) return; |
| 133 | const thread = el.threads.addOneAssumeCapacity(); |
| 134 | thread.thread = std.Thread.spawn(.{ |
| 135 | .stack_size = min_stack_size, |
| 136 | .allocator = el.gpa, |
| 137 | }, threadEntry, .{ el, thread }) catch return; |
| 138 | } |
| 139 | el.cond.signal(); |
| 96 | 140 | } |
| 97 | 141 | |
| 98 | 142 | fn recycle(el: *EventLoop, fiber: *Fiber) void { |
| 99 | 143 | std.log.debug("recyling {*}", .{fiber}); |
| 100 | 144 | fiber.awaiter = undefined; |
| 101 | | @memset(fiber.resultPointer()[0..max_result_len], undefined); |
| 145 | @memset(fiber.resultSlice(), undefined); |
| 102 | 146 | el.mutex.lock(); |
| 103 | 147 | defer el.mutex.unlock(); |
| 104 | 148 | el.free.append(&fiber.queue_node); |
| 105 | 149 | } |
| 106 | 150 | |
| 151 | fn threadEntry(el: *EventLoop, thread: *Thread) void { |
| 152 | current_thread = thread; |
| 153 | current_fiber = &thread.idle_fiber; |
| 154 | while (true) { |
| 155 | el.yield(null, null); |
| 156 | el.mutex.lock(); |
| 157 | defer el.mutex.unlock(); |
| 158 | if (el.exiting) return; |
| 159 | el.idle_count += 1; |
| 160 | defer el.idle_count -= 1; |
| 161 | el.cond.wait(&el.mutex); |
| 162 | } |
| 163 | } |
| 164 | |
| 107 | 165 | const SwitchMessage = extern struct { |
| 108 | 166 | prev_context: *Context, |
| 109 | 167 | ready_context: *Context, |
| ... | ... | @@ -209,7 +267,7 @@ const AsyncClosure = struct { |
| 209 | 267 | fn call(closure: *AsyncClosure, message: *const SwitchMessage) callconv(.c) noreturn { |
| 210 | 268 | message.handle(closure.event_loop); |
| 211 | 269 | std.log.debug("{*} performing async", .{closure.fiber}); |
| 212 | | closure.start(closure.context, closure.fiber.resultPointer()); |
| 270 | closure.start(closure.context, closure.fiber.resultSlice().ptr); |
| 213 | 271 | const awaiter = @atomicRmw(?*Fiber, &closure.fiber.awaiter, .Xchg, Fiber.finished, .acq_rel); |
| 214 | 272 | closure.event_loop.yield(awaiter, null); |
| 215 | 273 | unreachable; // switched to dead fiber |
| ... | ... | @@ -219,7 +277,7 @@ const AsyncClosure = struct { |
| 219 | 277 | pub fn @"await"(userdata: ?*anyopaque, any_future: *std.Io.AnyFuture, result: []u8) void { |
| 220 | 278 | const event_loop: *EventLoop = @alignCast(@ptrCast(userdata)); |
| 221 | 279 | const future_fiber: *Fiber = @alignCast(@ptrCast(any_future)); |
| 222 | | const result_src = future_fiber.resultPointer()[0..result.len]; |
| 280 | const result_src = future_fiber.resultSlice()[0..result.len]; |
| 223 | 281 | if (@atomicLoad(?*Fiber, &future_fiber.awaiter, .acquire) != Fiber.finished) event_loop.yield(null, &future_fiber.awaiter); |
| 224 | 282 | @memcpy(result, result_src); |
| 225 | 283 | event_loop.recycle(future_fiber); |