event 0.5.0 → 0.8.1

data/ext/event/{backend → selector}/kqueue.h

@@ -22,6 +22,6 @@
 
 #include <ruby.h>
 
-#define EVENT_BACKEND_KQUEUE
+#define EVENT_SELECTOR_KQUEUE
 
-void Init_Event_Backend_KQueue(VALUE Event_Backend);
+void Init_Event_Selector_KQueue(VALUE Event_Selector);

data/ext/event/selector/selector.c

@@ -0,0 +1,263 @@
+// Copyright, 2021, by Samuel G. D. Williams. <http://www.codeotaku.com>
+// 
+// Permission is hereby granted, free of charge, to any person obtaining a copy
+// of this software and associated documentation files (the "Software"), to deal
+// in the Software without restriction, including without limitation the rights
+// to use, copy, modify, merge, publish, distribute, sublicense, and/or sell
+// copies of the Software, and to permit persons to whom the Software is
+// furnished to do so, subject to the following conditions:
+// 
+// The above copyright notice and this permission notice shall be included in
+// all copies or substantial portions of the Software.
+// 
+// THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
+// IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
+// FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE
+// AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER
+// LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,
+// OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN
+// THE SOFTWARE.
+
+#include "selector.h"
+#include <fcntl.h>
+
+static ID id_transfer, id_alive_p;
+
+#ifndef HAVE__RB_FIBER_TRANSFER
+VALUE Event_Selector_fiber_transfer(VALUE fiber, int argc, VALUE *argv) {
+	return rb_funcallv(fiber, id_transfer, argc, argv);
+}
+#endif
+
+#ifndef HAVE__RB_FIBER_RAISE
+static ID id_raise;
+
+VALUE Event_Selector_fiber_raise(VALUE fiber, int argc, VALUE *argv) {
+	return rb_funcallv(fiber, id_raise, argc, argv);
+}
+#endif
+
+#ifndef HAVE_RB_IO_DESCRIPTOR
+static ID id_fileno;
+
+int Event_Selector_io_descriptor(VALUE io) {
+	return RB_NUM2INT(rb_funcall(io, id_fileno, 0));
+}
+#endif
+
+#ifndef HAVE_RB_PROCESS_STATUS_WAIT
+static ID id_wait;
+static VALUE rb_Process_Status = Qnil;
+
+VALUE Event_Selector_process_status_wait(rb_pid_t pid)
+{
+	return rb_funcall(rb_Process_Status, id_wait, 2, PIDT2NUM(pid), INT2NUM(WNOHANG));
+}
+#endif
+
+int Event_Selector_nonblock_set(int file_descriptor)
+{
+	int flags = fcntl(file_descriptor, F_GETFL, 0);
+	
+	if (!(flags & O_NONBLOCK)) {
+		fcntl(file_descriptor, F_SETFL, flags | O_NONBLOCK);
+	}
+	
+	return flags;
+}
+
+void Event_Selector_nonblock_restore(int file_descriptor, int flags)
+{
+	if (!(flags & O_NONBLOCK)) {
+		fcntl(file_descriptor, F_SETFL, flags & ~flags);
+	}
+}
+
+void Init_Event_Selector(VALUE Event_Selector) {
+	id_transfer = rb_intern("transfer");
+	id_alive_p = rb_intern("alive?");
+	
+#ifndef HAVE__RB_FIBER_RAISE
+	id_raise = rb_intern("raise");
+#endif
+	
+#ifndef HAVE_RB_IO_DESCRIPTOR
+	id_fileno = rb_intern("fileno");
+#endif
+	
+#ifndef HAVE_RB_PROCESS_STATUS_WAIT
+	id_wait = rb_intern("wait");
+	rb_Process_Status = rb_const_get_at(rb_mProcess, rb_intern("Status"));
+#endif
+}
+
+struct wait_and_transfer_arguments {
+	int argc;
+	VALUE *argv;
+	
+	struct Event_Selector *backend;
+	struct Event_Selector_Queue *waiting;
+};
+
+static void queue_pop(struct Event_Selector *backend, struct Event_Selector_Queue *waiting) {
+	if (waiting->behind) {
+		waiting->behind->infront = waiting->infront;
+	} else {
+		backend->waiting = waiting->infront;
+	}
+	
+	if (waiting->infront) {
+		waiting->infront->behind = waiting->behind;
+	} else {
+		backend->ready = waiting->behind;
+	}
+}
+
+static void queue_push(struct Event_Selector *backend, struct Event_Selector_Queue *waiting) {
+	if (backend->waiting) {
+		backend->waiting->behind = waiting;
+		waiting->infront = backend->waiting;
+	} else {
+		backend->ready = waiting;
+	}
+	
+	backend->waiting = waiting;
+}
+
+static VALUE wait_and_transfer(VALUE _arguments) {
+	struct wait_and_transfer_arguments *arguments = (struct wait_and_transfer_arguments *)_arguments;
+	
+	VALUE fiber = arguments->argv[0];
+	int argc = arguments->argc - 1;
+	VALUE *argv = arguments->argv + 1;
+	
+	return Event_Selector_fiber_transfer(fiber, argc, argv);
+}
+
+static VALUE wait_and_transfer_ensure(VALUE _arguments) {
+	struct wait_and_transfer_arguments *arguments = (struct wait_and_transfer_arguments *)_arguments;
+	
+	queue_pop(arguments->backend, arguments->waiting);
+	
+	return Qnil;
+}
+
+VALUE Event_Selector_wait_and_transfer(struct Event_Selector *backend, int argc, VALUE *argv)
+{
+	rb_check_arity(argc, 1, UNLIMITED_ARGUMENTS);
+	
+	struct Event_Selector_Queue waiting = {
+		.behind = NULL,
+		.infront = NULL,
+		.flags = EVENT_SELECTOR_QUEUE_FIBER,
+		.fiber = rb_fiber_current()
+	};
+	
+	queue_push(backend, &waiting);
+	
+	struct wait_and_transfer_arguments arguments = {
+		.argc = argc,
+		.argv = argv,
+		.backend = backend,
+		.waiting = &waiting,
+	};
+	
+	return rb_ensure(wait_and_transfer, (VALUE)&arguments, wait_and_transfer_ensure, (VALUE)&arguments);
+}
+
+static VALUE wait_and_raise(VALUE _arguments) {
+	struct wait_and_transfer_arguments *arguments = (struct wait_and_transfer_arguments *)_arguments;
+	
+	VALUE fiber = arguments->argv[0];
+	int argc = arguments->argc - 1;
+	VALUE *argv = arguments->argv + 1;
+	
+	return Event_Selector_fiber_raise(fiber, argc, argv);
+}
+
+VALUE Event_Selector_wait_and_raise(struct Event_Selector *backend, int argc, VALUE *argv)
+{
+	rb_check_arity(argc, 2, UNLIMITED_ARGUMENTS);
+	
+	struct Event_Selector_Queue waiting = {
+		.behind = NULL,
+		.infront = NULL,
+		.flags = EVENT_SELECTOR_QUEUE_FIBER,
+		.fiber = rb_fiber_current()
+	};
+	
+	queue_push(backend, &waiting);
+	
+	struct wait_and_transfer_arguments arguments = {
+		.argc = argc,
+		.argv = argv,
+		.backend = backend,
+		.waiting = &waiting,
+	};
+	
+	return rb_ensure(wait_and_raise, (VALUE)&arguments, wait_and_transfer_ensure, (VALUE)&arguments);
+}
+
+void Event_Selector_queue_push(struct Event_Selector *backend, VALUE fiber)
+{
+	struct Event_Selector_Queue *waiting = malloc(sizeof(struct Event_Selector_Queue));
+	
+	waiting->behind = NULL;
+	waiting->infront = NULL;
+	waiting->flags = EVENT_SELECTOR_QUEUE_INTERNAL;
+	waiting->fiber = fiber;
+	
+	queue_push(backend, waiting);
+}
+
+static inline
+void Event_Selector_queue_pop(struct Event_Selector *backend, struct Event_Selector_Queue *ready)
+{
+	if (ready->flags & EVENT_SELECTOR_QUEUE_FIBER) {
+		Event_Selector_fiber_transfer(ready->fiber, 0, NULL);
+	} else {
+		VALUE fiber = ready->fiber;
+		queue_pop(backend, ready);
+		free(ready);
+		
+		if (RTEST(rb_funcall(fiber, id_alive_p, 0))) {
+			rb_funcall(fiber, id_transfer, 0);
+		}
+	}
+}
+
+int Event_Selector_queue_flush(struct Event_Selector *backend)
+{
+	int count = 0;
+	
+	// Get the current tail and head of the queue:
+	struct Event_Selector_Queue *waiting = backend->waiting;
+	
+	// Process from head to tail in order:
+	// During this, more items may be appended to tail.
+	while (backend->ready) {
+		struct Event_Selector_Queue *ready = backend->ready;
+		
+		count += 1;
+		Event_Selector_queue_pop(backend, ready);
+		
+		if (ready == waiting) break;
+	}
+	
+	return count;
+}
+
+void Event_Selector_elapsed_time(struct timespec* start, struct timespec* stop, struct timespec *duration)
+{
+	if ((stop->tv_nsec - start->tv_nsec) < 0) {
+		duration->tv_sec = stop->tv_sec - start->tv_sec - 1;
+		duration->tv_nsec = stop->tv_nsec - start->tv_nsec + 1000000000;
+	} else {
+		duration->tv_sec = stop->tv_sec - start->tv_sec;
+		duration->tv_nsec = stop->tv_nsec - start->tv_nsec;
+	}
+}
+
+void Event_Selector_current_time(struct timespec *time) {
+	clock_gettime(CLOCK_MONOTONIC, time);
+}

data/ext/event/selector/selector.h

@@ -0,0 +1,127 @@
+// Copyright, 2021, by Samuel G. D. Williams. <http://www.codeotaku.com>
+// 
+// Permission is hereby granted, free of charge, to any person obtaining a copy
+// of this software and associated documentation files (the "Software"), to deal
+// in the Software without restriction, including without limitation the rights
+// to use, copy, modify, merge, publish, distribute, sublicense, and/or sell
+// copies of the Software, and to permit persons to whom the Software is
+// furnished to do so, subject to the following conditions:
+// 
+// The above copyright notice and this permission notice shall be included in
+// all copies or substantial portions of the Software.
+// 
+// THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
+// IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
+// FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE
+// AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER
+// LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,
+// OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN
+// THE SOFTWARE.
+
+#include <ruby.h>
+#include <ruby/thread.h>
+#include <ruby/io.h>
+
+#ifdef HAVE_RUBY_IO_BUFFER_H
+#include <ruby/io/buffer.h>
+#endif
+
+#include <time.h>
+
+enum Event {
+	EVENT_READABLE = 1,
+	EVENT_PRIORITY = 2,
+	EVENT_WRITABLE = 4,
+	EVENT_ERROR = 8,
+	EVENT_HANGUP = 16
+};
+
+void Init_Event_Selector();
+
+#ifdef HAVE__RB_FIBER_TRANSFER
+#define Event_Selector_fiber_transfer(fiber, argc, argv) rb_fiber_transfer(fiber, argc, argv)
+#else
+VALUE Event_Selector_fiber_transfer(VALUE fiber, int argc, VALUE *argv);
+#endif
+
+#ifdef HAVE__RB_FIBER_RAISE
+#define Event_Selector_fiber_raise(fiber, argc, argv) rb_fiber_raise(fiber, argc, argv)
+#else
+VALUE Event_Selector_fiber_raise(VALUE fiber, int argc, VALUE *argv);
+#endif
+
+#ifdef HAVE_RB_IO_DESCRIPTOR
+#define Event_Selector_io_descriptor(io) rb_io_descriptor(io)
+#else
+int Event_Selector_io_descriptor(VALUE io);
+#endif
+
+#ifdef HAVE_RB_PROCESS_STATUS_WAIT
+#define Event_Selector_process_status_wait(pid) rb_process_status_wait(pid)
+#else
+VALUE Event_Selector_process_status_wait(rb_pid_t pid);
+#endif
+
+int Event_Selector_nonblock_set(int file_descriptor);
+void Event_Selector_nonblock_restore(int file_descriptor, int flags);
+
+enum Event_Selector_Queue_Flags {
+	EVENT_SELECTOR_QUEUE_FIBER = 1,
+	EVENT_SELECTOR_QUEUE_INTERNAL = 2,
+};
+
+struct Event_Selector_Queue {
+	struct Event_Selector_Queue *behind;
+	struct Event_Selector_Queue *infront;
+	
+	enum Event_Selector_Queue_Flags flags;
+	
+	VALUE fiber;
+};
+
+struct Event_Selector {
+	VALUE loop;
+	
+	struct Event_Selector_Queue *free;
+	
+	// Append to waiting.
+	struct Event_Selector_Queue *waiting;
+	// Process from ready.
+	struct Event_Selector_Queue *ready;
+};
+
+static inline
+void Event_Selector_initialize(struct Event_Selector *backend, VALUE loop) {
+	backend->loop = loop;
+	backend->waiting = NULL;
+	backend->ready = NULL;
+}
+
+static inline
+void Event_Selector_mark(struct Event_Selector *backend) {
+	rb_gc_mark(backend->loop);
+	
+	struct Event_Selector_Queue *ready = backend->ready;
+	while (ready) {
+		rb_gc_mark(ready->fiber);
+		ready = ready->behind;
+	}
+}
+
+VALUE Event_Selector_wait_and_transfer(struct Event_Selector *backend, int argc, VALUE *argv);
+VALUE Event_Selector_wait_and_raise(struct Event_Selector *backend, int argc, VALUE *argv);
+
+static inline
+VALUE Event_Selector_yield(struct Event_Selector *backend)
+{
+	return Event_Selector_wait_and_transfer(backend, 1, &backend->loop);
+}
+
+void Event_Selector_queue_push(struct Event_Selector *backend, VALUE fiber);
+int Event_Selector_queue_flush(struct Event_Selector *backend);
+
+void Event_Selector_elapsed_time(struct timespec* start, struct timespec* stop, struct timespec *duration);
+void Event_Selector_current_time(struct timespec *time);
+
+#define PRINTF_TIMESPEC "%lld.%.9ld"
+#define PRINTF_TIMESPEC_ARGS(ts) (long long)((ts).tv_sec), (ts).tv_nsec

data/ext/event/selector/uring.c

@@ -0,0 +1,638 @@
+// Copyright, 2021, by Samuel G. D. Williams. <http://www.codeotaku.com>
+// 
+// Permission is hereby granted, free of charge, to any person obtaining a copy
+// of this software and associated documentation files (the "Software"), to deal
+// in the Software without restriction, including without limitation the rights
+// to use, copy, modify, merge, publish, distribute, sublicense, and/or sell
+// copies of the Software, and to permit persons to whom the Software is
+// furnished to do so, subject to the following conditions:
+// 
+// The above copyright notice and this permission notice shall be included in
+// all copies or substantial portions of the Software.
+// 
+// THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
+// IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
+// FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE
+// AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER
+// LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,
+// OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN
+// THE SOFTWARE.
+
+#include "uring.h"
+#include "selector.h"
+
+#include <liburing.h>
+#include <poll.h>
+#include <time.h>
+
+#include "pidfd.c"
+
+static const int DEBUG = 0;
+
+static VALUE Event_Selector_URing = Qnil;
+
+enum {URING_ENTRIES = 64};
+
+struct Event_Selector_URing {
+	struct Event_Selector backend;
+	struct io_uring ring;
+	size_t pending;
+};
+
+void Event_Selector_URing_Type_mark(void *_data)
+{
+	struct Event_Selector_URing *data = _data;
+	Event_Selector_mark(&data->backend);
+}
+
+static
+void close_internal(struct Event_Selector_URing *data) {
+	if (data->ring.ring_fd >= 0) {
+		io_uring_queue_exit(&data->ring);
+		data->ring.ring_fd = -1;
+	}
+}
+
+void Event_Selector_URing_Type_free(void *_data)
+{
+	struct Event_Selector_URing *data = _data;
+	
+	close_internal(data);
+	
+	free(data);
+}
+
+size_t Event_Selector_URing_Type_size(const void *data)
+{
+	return sizeof(struct Event_Selector_URing);
+}
+
+static const rb_data_type_t Event_Selector_URing_Type = {
+	.wrap_struct_name = "Event::Backend::URing",
+	.function = {
+		.dmark = Event_Selector_URing_Type_mark,
+		.dfree = Event_Selector_URing_Type_free,
+		.dsize = Event_Selector_URing_Type_size,
+	},
+	.data = NULL,
+	.flags = RUBY_TYPED_FREE_IMMEDIATELY,
+};
+
+VALUE Event_Selector_URing_allocate(VALUE self) {
+	struct Event_Selector_URing *data = NULL;
+	VALUE instance = TypedData_Make_Struct(self, struct Event_Selector_URing, &Event_Selector_URing_Type, data);
+	
+	Event_Selector_initialize(&data->backend, Qnil);
+	data->ring.ring_fd = -1;
+	
+	data->pending = 0;
+
+	return instance;
+}
+
+VALUE Event_Selector_URing_initialize(VALUE self, VALUE loop) {
+	struct Event_Selector_URing *data = NULL;
+	TypedData_Get_Struct(self, struct Event_Selector_URing, &Event_Selector_URing_Type, data);
+	
+	Event_Selector_initialize(&data->backend, loop);
+	int result = io_uring_queue_init(URING_ENTRIES, &data->ring, 0);
+	
+	if (result < 0) {
+		rb_syserr_fail(-result, "io_uring_queue_init");
+	}
+	
+	rb_update_max_fd(data->ring.ring_fd);
+	
+	return self;
+}
+
+VALUE Event_Selector_URing_close(VALUE self) {
+	struct Event_Selector_URing *data = NULL;
+	TypedData_Get_Struct(self, struct Event_Selector_URing, &Event_Selector_URing_Type, data);
+	
+	close_internal(data);
+	
+	return Qnil;
+}
+
+VALUE Event_Selector_URing_transfer(int argc, VALUE *argv, VALUE self)
+{
+	struct Event_Selector_URing *data = NULL;
+	TypedData_Get_Struct(self, struct Event_Selector_URing, &Event_Selector_URing_Type, data);
+	
+	Event_Selector_wait_and_transfer(&data->backend, argc, argv);
+	
+	return Qnil;
+}
+
+VALUE Event_Selector_URing_yield(VALUE self)
+{
+	struct Event_Selector_URing *data = NULL;
+	TypedData_Get_Struct(self, struct Event_Selector_URing, &Event_Selector_URing_Type, data);
+	
+	Event_Selector_yield(&data->backend);
+	
+	return Qnil;
+}
+
+VALUE Event_Selector_URing_push(VALUE self, VALUE fiber)
+{
+	struct Event_Selector_URing *data = NULL;
+	TypedData_Get_Struct(self, struct Event_Selector_URing, &Event_Selector_URing_Type, data);
+	
+	Event_Selector_queue_push(&data->backend, fiber);
+	
+	return Qnil;
+}
+
+VALUE Event_Selector_URing_raise(int argc, VALUE *argv, VALUE self)
+{
+	struct Event_Selector_URing *data = NULL;
+	TypedData_Get_Struct(self, struct Event_Selector_URing, &Event_Selector_URing_Type, data);
+	
+	return Event_Selector_wait_and_raise(&data->backend, argc, argv);
+}
+
+VALUE Event_Selector_URing_ready_p(VALUE self) {
+	struct Event_Selector_URing *data = NULL;
+	TypedData_Get_Struct(self, struct Event_Selector_URing, &Event_Selector_URing_Type, data);
+	
+	return data->backend.ready ? Qtrue : Qfalse;
+}
+
+static
+int io_uring_submit_flush(struct Event_Selector_URing *data) {
+	if (data->pending) {
+		if (DEBUG) fprintf(stderr, "io_uring_submit_flush(pending=%ld)\n", data->pending);
+		
+		// Try to submit:
+		int result = io_uring_submit(&data->ring);
+
+		if (result >= 0) {
+			// If it was submitted, reset pending count:
+			data->pending = 0;
+		} else if (result != -EBUSY && result != -EAGAIN) {
+			rb_syserr_fail(-result, "io_uring_submit_flush");
+		}
+
+		return result;
+	}
+	
+	return 0;
+}
+
+static
+int io_uring_submit_now(struct Event_Selector_URing *data) {
+	while (true) {
+		int result = io_uring_submit(&data->ring);
+		
+		if (result >= 0) {
+			data->pending = 0;
+			return result;
+		}
+
+		if (result == -EBUSY || result == -EAGAIN) {
+			Event_Selector_yield(&data->backend);
+		} else {
+			rb_syserr_fail(-result, "io_uring_submit_now");
+		}
+	}
+}
+
+static
+void io_uring_submit_pending(struct Event_Selector_URing *data) {
+	data->pending += 1;
+}
+
+struct io_uring_sqe * io_get_sqe(struct Event_Selector_URing *data) {
+	struct io_uring_sqe *sqe = io_uring_get_sqe(&data->ring);
+	
+	while (sqe == NULL) {
+		// The submit queue is full, we need to drain it:	
+		io_uring_submit_now(data);
+
+		sqe = io_uring_get_sqe(&data->ring);
+	}
+	
+	return sqe;
+}
+
+struct process_wait_arguments {
+	struct Event_Selector_URing *data;
+	pid_t pid;
+	int flags;
+	int descriptor;
+};
+
+static
+VALUE process_wait_transfer(VALUE _arguments) {
+	struct process_wait_arguments *arguments = (struct process_wait_arguments *)_arguments;
+	
+	Event_Selector_fiber_transfer(arguments->data->backend.loop, 0, NULL);
+	
+	return Event_Selector_process_status_wait(arguments->pid);
+}
+
+static
+VALUE process_wait_ensure(VALUE _arguments) {
+	struct process_wait_arguments *arguments = (struct process_wait_arguments *)_arguments;
+	
+	close(arguments->descriptor);
+	
+	return Qnil;
+}
+
+VALUE Event_Selector_URing_process_wait(VALUE self, VALUE fiber, VALUE pid, VALUE flags) {
+	struct Event_Selector_URing *data = NULL;
+	TypedData_Get_Struct(self, struct Event_Selector_URing, &Event_Selector_URing_Type, data);
+	
+	struct process_wait_arguments process_wait_arguments = {
+		.data = data,
+		.pid = NUM2PIDT(pid),
+		.flags = NUM2INT(flags),
+	};
+	
+	process_wait_arguments.descriptor = pidfd_open(process_wait_arguments.pid, 0);
+	rb_update_max_fd(process_wait_arguments.descriptor);
+	
+	struct io_uring_sqe *sqe = io_get_sqe(data);
+
+	if (DEBUG) fprintf(stderr, "Event_Selector_URing_process_wait:io_uring_prep_poll_add(%p)\n", (void*)fiber);
+	io_uring_prep_poll_add(sqe, process_wait_arguments.descriptor, POLLIN|POLLHUP|POLLERR);
+	io_uring_sqe_set_data(sqe, (void*)fiber);
+	io_uring_submit_pending(data);
+
+	return rb_ensure(process_wait_transfer, (VALUE)&process_wait_arguments, process_wait_ensure, (VALUE)&process_wait_arguments);
+}
+
+static inline
+short poll_flags_from_events(int events) {
+	short flags = 0;
+	
+	if (events & EVENT_READABLE) flags |= POLLIN;
+	if (events & EVENT_PRIORITY) flags |= POLLPRI;
+	if (events & EVENT_WRITABLE) flags |= POLLOUT;
+	
+	flags |= POLLERR;
+	flags |= POLLHUP;
+	
+	return flags;
+}
+
+static inline
+int events_from_poll_flags(short flags) {
+	int events = 0;
+	
+	if (flags & POLLIN) events |= EVENT_READABLE;
+	if (flags & POLLPRI) events |= EVENT_PRIORITY;
+	if (flags & POLLOUT) events |= EVENT_WRITABLE;
+	
+	return events;
+}
+
+struct io_wait_arguments {
+	struct Event_Selector_URing *data;
+	VALUE fiber;
+	short flags;
+};
+
+static
+VALUE io_wait_rescue(VALUE _arguments, VALUE exception) {
+	struct io_wait_arguments *arguments = (struct io_wait_arguments *)_arguments;
+	struct Event_Selector_URing *data = arguments->data;
+	
+	struct io_uring_sqe *sqe = io_get_sqe(data);
+	
+	if (DEBUG) fprintf(stderr, "io_wait_rescue:io_uring_prep_poll_remove(%p)\n", (void*)arguments->fiber);
+	
+	io_uring_prep_poll_remove(sqe, (void*)arguments->fiber);
+	io_uring_submit_now(data);
+
+	rb_exc_raise(exception);
+};
+
+static
+VALUE io_wait_transfer(VALUE _arguments) {
+	struct io_wait_arguments *arguments = (struct io_wait_arguments *)_arguments;
+	struct Event_Selector_URing *data = arguments->data;
+
+	VALUE result = Event_Selector_fiber_transfer(data->backend.loop, 0, NULL);
+	if (DEBUG) fprintf(stderr, "io_wait:Event_Selector_fiber_transfer -> %d\n", RB_NUM2INT(result));
+
+	// We explicitly filter the resulting events based on the requested events.
+	// In some cases, poll will report events we didn't ask for.
+	short flags = arguments->flags & NUM2INT(result);
+	
+	return INT2NUM(events_from_poll_flags(flags));
+};
+
+VALUE Event_Selector_URing_io_wait(VALUE self, VALUE fiber, VALUE io, VALUE events) {
+	struct Event_Selector_URing *data = NULL;
+	TypedData_Get_Struct(self, struct Event_Selector_URing, &Event_Selector_URing_Type, data);
+	
+	int descriptor = Event_Selector_io_descriptor(io);
+	struct io_uring_sqe *sqe = io_get_sqe(data);
+	
+	short flags = poll_flags_from_events(NUM2INT(events));
+	
+	if (DEBUG) fprintf(stderr, "Event_Selector_URing_io_wait:io_uring_prep_poll_add(descriptor=%d, flags=%d, fiber=%p)\n", descriptor, flags, (void*)fiber);
+	
+	io_uring_prep_poll_add(sqe, descriptor, flags);
+	io_uring_sqe_set_data(sqe, (void*)fiber);
+	
+	// If we are going to wait, we assume that we are waiting for a while:
+	io_uring_submit_pending(data);
+	
+	struct io_wait_arguments io_wait_arguments = {
+		.data = data,
+		.fiber = fiber,
+		.flags = flags
+	};
+	
+	return rb_rescue(io_wait_transfer, (VALUE)&io_wait_arguments, io_wait_rescue, (VALUE)&io_wait_arguments);
+}
+
+#ifdef HAVE_RUBY_IO_BUFFER_H
+
+static int io_read(struct Event_Selector_URing *data, VALUE fiber, int descriptor, char *buffer, size_t length) {
+	struct io_uring_sqe *sqe = io_get_sqe(data);
+
+	if (DEBUG) fprintf(stderr, "io_read:io_uring_prep_read(fiber=%p)\n", (void*)fiber);
+
+	io_uring_prep_read(sqe, descriptor, buffer, length, 0);
+	io_uring_sqe_set_data(sqe, (void*)fiber);
+	io_uring_submit_now(data);
+	
+	VALUE result = Event_Selector_fiber_transfer(data->backend.loop, 0, NULL);
+	if (DEBUG) fprintf(stderr, "io_read:Event_Selector_fiber_transfer -> %d\n", RB_NUM2INT(result));
+
+	return RB_NUM2INT(result);
+}
+
+VALUE Event_Selector_URing_io_read(VALUE self, VALUE fiber, VALUE io, VALUE buffer, VALUE _length) {
+	struct Event_Selector_URing *data = NULL;
+	TypedData_Get_Struct(self, struct Event_Selector_URing, &Event_Selector_URing_Type, data);
+	
+	int descriptor = Event_Selector_io_descriptor(io);
+	
+	void *base;
+	size_t size;
+	rb_io_buffer_get_mutable(buffer, &base, &size);
+	
+	size_t offset = 0;
+	size_t length = NUM2SIZET(_length);
+	
+	while (length > 0) {
+		size_t maximum_size = size - offset;
+		int result = io_read(data, fiber, descriptor, (char*)base+offset, maximum_size);
+		
+		if (result == 0) {
+			break;
+		} else if (result > 0) {
+			offset += result;
+			if ((size_t)result >= length) break;
+			length -= result;
+		} else if (-result == EAGAIN || -result == EWOULDBLOCK) {
+			Event_Selector_URing_io_wait(self, fiber, io, RB_INT2NUM(EVENT_READABLE));
+		} else {
+			rb_syserr_fail(-result, strerror(-result));
+		}
+	}
+	
+	return SIZET2NUM(offset);
+}
+
+static
+int io_write(struct Event_Selector_URing *data, VALUE fiber, int descriptor, char *buffer, size_t length) {
+	struct io_uring_sqe *sqe = io_get_sqe(data);
+	
+	if (DEBUG) fprintf(stderr, "io_write:io_uring_prep_write(fiber=%p)\n", (void*)fiber);
+
+	io_uring_prep_write(sqe, descriptor, buffer, length, 0);
+	io_uring_sqe_set_data(sqe, (void*)fiber);
+	io_uring_submit_pending(data);
+	
+	int result = RB_NUM2INT(Event_Selector_fiber_transfer(data->backend.loop, 0, NULL));
+	if (DEBUG) fprintf(stderr, "io_write:Event_Selector_fiber_transfer -> %d\n", result);
+
+	return result;
+}
+
+VALUE Event_Selector_URing_io_write(VALUE self, VALUE fiber, VALUE io, VALUE buffer, VALUE _length) {
+	struct Event_Selector_URing *data = NULL;
+	TypedData_Get_Struct(self, struct Event_Selector_URing, &Event_Selector_URing_Type, data);
+	
+	int descriptor = Event_Selector_io_descriptor(io);
+	
+	const void *base;
+	size_t size;
+	rb_io_buffer_get_immutable(buffer, &base, &size);
+	
+	size_t offset = 0;
+	size_t length = NUM2SIZET(_length);
+	
+	if (length > size) {
+		rb_raise(rb_eRuntimeError, "Length exceeds size of buffer!");
+	}
+	
+	while (length > 0) {
+		int result = io_write(data, fiber, descriptor, (char*)base+offset, length);
+		
+		if (result >= 0) {
+			offset += result;
+			if ((size_t)result >= length) break;
+			length -= result;
+		} else if (-result == EAGAIN || -result == EWOULDBLOCK) {
+			Event_Selector_URing_io_wait(self, fiber, io, RB_INT2NUM(EVENT_WRITABLE));
+		} else {
+			rb_syserr_fail(-result, strerror(-result));
+		}
+	}
+	
+	return SIZET2NUM(offset);
+}
+
+#endif
+
+static const int ASYNC_CLOSE = 1;
+
+VALUE Event_Selector_URing_io_close(VALUE self, VALUE io) {
+	struct Event_Selector_URing *data = NULL;
+	TypedData_Get_Struct(self, struct Event_Selector_URing, &Event_Selector_URing_Type, data);
+	
+	int descriptor = Event_Selector_io_descriptor(io);
+
+	if (ASYNC_CLOSE) {
+		struct io_uring_sqe *sqe = io_get_sqe(data);
+		
+		io_uring_prep_close(sqe, descriptor);
+		io_uring_sqe_set_data(sqe, NULL);
+		io_uring_submit_now(data);
+	} else {
+		close(descriptor);
+	}
+
+	// We don't wait for the result of close since it has no use in pratice:
+	return Qtrue;
+}
+
+static
+struct __kernel_timespec * make_timeout(VALUE duration, struct __kernel_timespec *storage) {
+	if (duration == Qnil) {
+		return NULL;
+	}
+	
+	if (FIXNUM_P(duration)) {
+		storage->tv_sec = NUM2TIMET(duration);
+		storage->tv_nsec = 0;
+		
+		return storage;
+	}
+	
+	else if (RB_FLOAT_TYPE_P(duration)) {
+		double value = RFLOAT_VALUE(duration);
+		time_t seconds = value;
+		
+		storage->tv_sec = seconds;
+		storage->tv_nsec = (value - seconds) * 1000000000L;
+		
+		return storage;
+	}
+	
+	rb_raise(rb_eRuntimeError, "unable to convert timeout");
+}
+
+static
+int timeout_nonblocking(struct __kernel_timespec *timespec) {
+	return timespec && timespec->tv_sec == 0 && timespec->tv_nsec == 0;
+}
+
+struct select_arguments {
+	struct Event_Selector_URing *data;
+	
+	int result;
+	
+	struct __kernel_timespec storage;
+	struct __kernel_timespec *timeout;
+};
+
+static
+void * select_internal(void *_arguments) {
+	struct select_arguments * arguments = (struct select_arguments *)_arguments;
+
+	io_uring_submit_flush(arguments->data);
+
+	struct io_uring_cqe *cqe = NULL;
+	arguments->result = io_uring_wait_cqe_timeout(&arguments->data->ring, &cqe, arguments->timeout);
+	
+	return NULL;
+}
+
+static
+int select_internal_without_gvl(struct select_arguments *arguments) {
+	rb_thread_call_without_gvl(select_internal, (void *)arguments, RUBY_UBF_IO, 0);
+	
+	if (arguments->result == -ETIME) {
+		arguments->result = 0;
+	} else if (arguments->result < 0) {
+		rb_syserr_fail(-arguments->result, "select_internal_without_gvl:io_uring_wait_cqes");
+	} else {
+		// At least 1 event is waiting:
+		arguments->result = 1;
+	}
+	
+	return arguments->result;
+}
+
+static inline
+unsigned select_process_completions(struct io_uring *ring) {
+	unsigned completed = 0;
+	unsigned head;
+	struct io_uring_cqe *cqe;
+	
+	io_uring_for_each_cqe(ring, head, cqe) {
+		++completed;
+		
+		// If the operation was cancelled, or the operation has no user data (fiber):
+		if (cqe->res == -ECANCELED || cqe->user_data == 0 || cqe->user_data == LIBURING_UDATA_TIMEOUT) {
+			io_uring_cq_advance(ring, 1);
+			continue;
+		}
+		
+		VALUE fiber = (VALUE)cqe->user_data;
+		VALUE result = RB_INT2NUM(cqe->res);
+		
+		if (DEBUG) fprintf(stderr, "cqe res=%d user_data=%p\n", cqe->res, (void*)cqe->user_data);
+		
+		io_uring_cq_advance(ring, 1);
+		
+		Event_Selector_fiber_transfer(fiber, 1, &result);
+	}
+	
+	// io_uring_cq_advance(ring, completed);
+	
+	if (DEBUG) fprintf(stderr, "select_process_completions(completed=%d)\n", completed);
+	
+	return completed;
+}
+
+VALUE Event_Selector_URing_select(VALUE self, VALUE duration) {
+	struct Event_Selector_URing *data = NULL;
+	TypedData_Get_Struct(self, struct Event_Selector_URing, &Event_Selector_URing_Type, data);
+	
+	int ready = Event_Selector_queue_flush(&data->backend);
+	
+	int result = select_process_completions(&data->ring);
+
+	// If the ready list was empty and we didn't process any completions:
+	if (!ready && result == 0) {
+		// We might need to wait for events:
+		struct select_arguments arguments = {
+			.data = data,
+			.timeout = NULL,
+		};
+		
+		arguments.timeout = make_timeout(duration, &arguments.storage);
+		
+		if (!data->backend.ready && !timeout_nonblocking(arguments.timeout)) {
+			// This is a blocking operation, we wait for events:
+			result = select_internal_without_gvl(&arguments);
+		} else {
+			// The timeout specified required "nonblocking" behaviour so we just flush the SQ if required:
+			io_uring_submit_flush(data);
+		}
+
+		// After waiting/flushing the SQ, check if there are any completions:
+		result = select_process_completions(&data->ring);
+	}
+	
+	return RB_INT2NUM(result);
+}
+
+void Init_Event_Selector_URing(VALUE Event_Selector) {
+	Event_Selector_URing = rb_define_class_under(Event_Selector, "URing", rb_cObject);
+	
+	rb_define_alloc_func(Event_Selector_URing, Event_Selector_URing_allocate);
+	rb_define_method(Event_Selector_URing, "initialize", Event_Selector_URing_initialize, 1);
+	
+	rb_define_method(Event_Selector_URing, "transfer", Event_Selector_URing_transfer, -1);
+	rb_define_method(Event_Selector_URing, "yield", Event_Selector_URing_yield, 0);
+	rb_define_method(Event_Selector_URing, "push", Event_Selector_URing_push, 1);
+	rb_define_method(Event_Selector_URing, "raise", Event_Selector_URing_raise, -1);
+	
+	rb_define_method(Event_Selector_URing, "ready?", Event_Selector_URing_ready_p, 0);
+	
+	rb_define_method(Event_Selector_URing, "select", Event_Selector_URing_select, 1);
+	rb_define_method(Event_Selector_URing, "close", Event_Selector_URing_close, 0);
+	
+	rb_define_method(Event_Selector_URing, "io_wait", Event_Selector_URing_io_wait, 3);
+	
+#ifdef HAVE_RUBY_IO_BUFFER_H
+	rb_define_method(Event_Selector_URing, "io_read", Event_Selector_URing_io_read, 4);
+	rb_define_method(Event_Selector_URing, "io_write", Event_Selector_URing_io_write, 4);
+#endif
+	
+	rb_define_method(Event_Selector_URing, "io_close", Event_Selector_URing_io_close, 1);
+	
+	rb_define_method(Event_Selector_URing, "process_wait", Event_Selector_URing_process_wait, 3);
+}