From 64feb7599e8ec01c2ec7c8d709df1cc70651c06b Mon Sep 17 00:00:00 2001
From: Colin Davidson <colrdavidson@gmail.com>
Date: Sun, 14 Jul 2024 00:33:40 -0700
Subject: [PATCH] move to isize

---
 src/thread_pool.cpp | 18 +++++++++---------
 src/threading.cpp   |  8 ++++----
 2 files changed, 13 insertions(+), 13 deletions(-)

diff --git a/src/thread_pool.cpp b/src/thread_pool.cpp
index da7e724a8..bf953ddd0 100644
--- a/src/thread_pool.cpp
+++ b/src/thread_pool.cpp
@@ -59,20 +59,20 @@ gb_internal void thread_pool_destroy(ThreadPool *pool) {
 	gb_free(pool->threads_allocator, pool->threads.data);
 }
 
-TaskRingBuffer *taskring_grow(TaskRingBuffer *ring, ssize_t bottom, ssize_t top) {
+TaskRingBuffer *taskring_grow(TaskRingBuffer *ring, isize bottom, isize top) {
 	TaskRingBuffer *new_ring = taskring_init(ring->size * 2);
-	for (ssize_t i = top; i < bottom; i++) {
+	for (isize i = top; i < bottom; i++) {
 		new_ring->buffer[i % new_ring->size] = ring->buffer[i % ring->size];
 	}
 	return new_ring;
 }
 
 void thread_pool_queue_push(Thread *thread, WorkerTask task) {
-	ssize_t bot                = thread->queue.bottom.load(std::memory_order_relaxed);
-	ssize_t top                = thread->queue.top.load(std::memory_order_acquire);
+	isize bot                = thread->queue.bottom.load(std::memory_order_relaxed);
+	isize top                = thread->queue.top.load(std::memory_order_acquire);
 	TaskRingBuffer *cur_ring   = thread->queue.ring.load(std::memory_order_relaxed);
 
-	ssize_t size = bot - top;
+	isize size = bot - top;
 	if (size > (cur_ring->size - 1)) {
 		// Queue is full
 		thread->queue.ring = taskring_grow(thread->queue.ring, bot, top);
@@ -89,12 +89,12 @@ void thread_pool_queue_push(Thread *thread, WorkerTask task) {
 }
 
 GrabState thread_pool_queue_take(Thread *thread, WorkerTask *task) {
-	ssize_t bot = thread->queue.bottom.load(std::memory_order_relaxed) - 1;
+	isize bot = thread->queue.bottom.load(std::memory_order_relaxed) - 1;
 	TaskRingBuffer *cur_ring = thread->queue.ring.load(std::memory_order_relaxed);
 	thread->queue.bottom.store(bot, std::memory_order_relaxed);
 	std::atomic_thread_fence(std::memory_order_seq_cst);
 
-	ssize_t top = thread->queue.top.load(std::memory_order_relaxed);
+	isize top = thread->queue.top.load(std::memory_order_relaxed);
 	if (top <= bot) {
 
 		// Queue is not empty
@@ -121,9 +121,9 @@ GrabState thread_pool_queue_take(Thread *thread, WorkerTask *task) {
 }
 
 GrabState thread_pool_queue_steal(Thread *thread, WorkerTask *task) {
-	ssize_t top = thread->queue.top.load(std::memory_order_acquire);
+	isize top = thread->queue.top.load(std::memory_order_acquire);
 	std::atomic_thread_fence(std::memory_order_seq_cst);
-	ssize_t bot = thread->queue.bottom.load(std::memory_order_acquire);
+	isize bot = thread->queue.bottom.load(std::memory_order_acquire);
 
 	GrabState ret = GrabEmpty;
 	if (top < bot) {
diff --git a/src/threading.cpp b/src/threading.cpp
index dda98631b..ac79efb05 100644
--- a/src/threading.cpp
+++ b/src/threading.cpp
@@ -47,13 +47,13 @@ typedef struct WorkerTask {
 } WorkerTask;
 
 typedef struct TaskRingBuffer {
-	std::atomic<ssize_t> size;
+	std::atomic<isize> size;
 	std::atomic<WorkerTask *> buffer;
 } TaskRingBuffer;
 
 typedef struct TaskQueue {
-	std::atomic<ssize_t> top;
-	std::atomic<ssize_t> bottom;
+	std::atomic<isize> top;
+	std::atomic<isize> bottom;
 
 	std::atomic<TaskRingBuffer *> ring;
 } TaskQueue;
@@ -560,7 +560,7 @@ gb_internal void *internal_thread_proc(void *arg) {
 }
 #endif
 
-TaskRingBuffer *taskring_init(ssize_t size) {
+TaskRingBuffer *taskring_init(isize size) {
 	TaskRingBuffer *ring = (TaskRingBuffer *)gb_alloc(heap_allocator(), sizeof(TaskRingBuffer));
 	ring->size = size;
 	ring->buffer = (WorkerTask *)gb_alloc_array(heap_allocator(), WorkerTask, ring->size);