io-event 1.2.3 → 1.3.0

checksums.yaml

@@ -1,7 +1,7 @@
 ---
 SHA256:
-  metadata.gz: 41757dbe8c584fbdf66a0d7adb6b4e7f3ab377aed137c65b49eed48e7ff1d223
-  data.tar.gz: 84672d42c12a9db38d901a7f4ab4d8f3d74bc98d398fb615d95c6780533bb2bb
+  metadata.gz: 0743271de82b1b4324953fadd2f5da09cb79609c1153ae8637e4f23f31f0615c
+  data.tar.gz: e90309751d3bc2716362d596b07a477a0f9b1c6ef27443f06469547bce10cb40
 SHA512:
-  metadata.gz: 2d32bce07ae295fecd57c67920ec2c0f3796313d80154179290116eb8ad8fd3b58e440c5531a23186bb9cfe2dfdd87fccd709742742559d8d151ae9b0cdb1419
-  data.tar.gz: e6a6476decc497fab325b047ec7c90c235e505356cf07e145c5ed9e00443b9273743a8180c6e12e5a2d496b8e8d4b42a781438e175d3768f3d6f86ce3b84c9fc
+  metadata.gz: f1fe9c27d9ed25969eaca758565f99346dea63f397e32e8bec027312b0936b61b6677a520cbacb4f0c3e976979ff3ee4cfac93ea766d92cd8b88fa19cab1ad7c
+  data.tar.gz: 4c476754268f03564134fc461bdeee26c0989fc6673cd27235ccc6d1a6df4d03b680f677469db531e8b1613622bd356ffa762d35b2b39ab455d522c6d624d45e

data/ext/extconf.rb

@@ -35,6 +35,10 @@ extension_name = 'IO_Event'
 
 $CFLAGS << " -Wall -Wno-unknown-pragmas -std=c99"
 
+if ENV.key?('RUBY_DEBUG')
+	$CFLAGS << " -DRUBY_DEBUG -O0"
+end
+
 $srcs = ["io/event/event.c", "io/event/selector/selector.c"]
 $VPATH << "$(srcdir)/io/event"
 $VPATH << "$(srcdir)/io/event/selector"
@@ -50,9 +54,7 @@ if have_header('sys/epoll.h')
 	$srcs << "io/event/selector/epoll.c"
 end
 
-# The order matters, because we MUST have EV_UDATA_SPECIFIC.
-# The `have_header` call is just to add the -D to the compiler flags.
-if have_const('EV_UDATA_SPECIFIC', 'sys/event.h') and have_header('sys/event.h')
+if have_header('sys/event.h')
 	$srcs << "io/event/selector/kqueue.c"
 end
 

data/ext/io/event/selector/array.h

@@ -0,0 +1,135 @@
+// Released under the MIT License.
+// Copyright, 2023, by Samuel Williams.
+
+// Provides a simple implementation of unique pointers to elements of the given size.
+
+#include <stdlib.h>
+#include <errno.h>
+#include <assert.h>
+
+struct IO_Event_Array {
+	// The array of pointers to elements:
+	void **base;
+	
+	// The allocated size of the array:
+	size_t count;
+	
+	// The biggest item we've seen so far:
+	size_t limit;
+	
+	// The size of each element that is allocated:
+	size_t element_size;
+	
+	void (*element_initialize)(void*);
+	void (*element_free)(void*);
+};
+
+inline static void IO_Event_Array_allocate(struct IO_Event_Array *array, size_t count, size_t element_size)
+{
+	if (count) {
+		array->base = (void**)calloc(count, sizeof(void*));
+		array->count = count;
+	} else {
+		array->base = NULL;
+		array->count = 0;
+	}
+	
+	array->limit = 0;
+	array->element_size = element_size;
+}
+
+inline static size_t IO_Event_Array_memory_size(const struct IO_Event_Array *array)
+{
+	// Upper bound.
+	return array->count * (sizeof(void*) + array->element_size);
+}
+
+inline static void IO_Event_Array_free(struct IO_Event_Array *array)
+{
+	for (size_t i = 0; i < array->limit; i += 1) {
+		void *element = array->base[i];
+		if (element) {
+			array->element_free(element);
+			free(element);
+		}
+	}
+	
+	if (array->base)
+		free(array->base);
+	
+	array->base = NULL;
+	array->count = 0;
+	array->limit = 0;
+}
+
+inline static int IO_Event_Array_resize(struct IO_Event_Array *array, size_t count)
+{
+	if (count <= array->count) {
+		return 0;
+	}
+	
+	// Compute the next multiple (ideally a power of 2):
+	size_t new_count = array->count;
+	while (new_count < count) {
+		new_count *= 2;
+	}
+	
+	void **new_base = (void**)realloc(array->base, new_count * sizeof(void*));
+	
+	if (new_base == NULL) {
+		return -1;
+	}
+	
+	// Zero out the new memory:
+	memset(new_base + array->count, 0, (new_count - array->count) * sizeof(void*));
+	
+	array->base = (void**)new_base;
+	array->count = new_count;
+	
+	return 1;
+}
+
+inline static void* IO_Event_Array_lookup(struct IO_Event_Array *array, size_t index)
+{
+	size_t count = index + 1;
+	
+	// Resize the array if necessary:
+	if (count > array->count) {
+		if (IO_Event_Array_resize(array, count) == -1) {
+			return NULL;
+		}
+	}
+	
+	// Get the element:
+	void **element = array->base + index;
+	
+	// Allocate the element if it doesn't exist:
+	if (*element == NULL) {
+		*element = malloc(array->element_size);
+		
+		if (array->element_initialize) {
+			array->element_initialize(*element);
+		}
+		
+		// Update the limit:
+		if (count > array->limit) array->limit = count;
+	}
+	
+	return *element;
+}
+
+// Push a new element onto the end of the array.
+inline static void* IO_Event_Array_push(struct IO_Event_Array *array)
+{
+	return IO_Event_Array_lookup(array, array->limit);
+}
+
+inline static void IO_Event_Array_each(struct IO_Event_Array *array, void (*callback)(void*))
+{
+	for (size_t i = 0; i < array->limit; i += 1) {
+		void *element = array->base[i];
+		if (element) {
+			callback(element);
+		}
+	}
+}