SRB2/src/dedicated/i_threads.c

// SONIC ROBO BLAST 2
//-----------------------------------------------------------------------------
// Copyright (C) 2020-2023 by James R.
//
// This program is free software distributed under the
// terms of the GNU General Public License, version 2.
// See the 'LICENSE' file for more details.
//-----------------------------------------------------------------------------
/// \file  i_threads.c
/// \brief Multithreading abstraction

#if defined (__unix__) || (!defined(__APPLE__) && defined (UNIXCOMMON))

#include <pthread.h>

#include "../i_threads.h"
#include "../doomdef.h"
#include "../doomtype.h"

typedef struct thread_s thread_t;

struct thread_s
{
	thread_t *next;
	void *userdata;
	I_thread_fn func;
	pthread_t thread;
};

// we use a linked list to avoid moving memory blocks when allocating new threads.
static thread_t *thread_list;
static pthread_mutex_t thread_lock = PTHREAD_MUTEX_INITIALIZER;

static void *HandleThread(void *data)
{
	thread_t *thread = data;
	thread->func(thread->userdata);

	pthread_mutex_lock(&thread_lock);
	thread->func = NULL;
	pthread_mutex_unlock(&thread_lock);
	return NULL;
}

void I_spawn_thread(const char *name, I_thread_fn entry, void *userdata)
{
	thread_t *thread;
	(void)name;
	pthread_mutex_lock(&thread_lock);
	thread = thread_list;
	while (thread != NULL)
	{
		if (thread->func == NULL)
		{
			// join with the exited thread to release it's resources.
			pthread_join(thread->thread, NULL);
			break;
		}
		thread = thread->next;
	}
	if (thread == NULL)
	{
		thread = malloc(sizeof(thread_t));
		thread->next = thread_list;
		thread_list = thread;
	}

	thread->func = entry;
	thread->userdata = userdata;
	pthread_create(&thread->thread, NULL, HandleThread, thread);
	pthread_mutex_unlock(&thread_lock);
}

int I_thread_is_stopped(void)
{
	thread_t *thread;
	pthread_mutex_lock(&thread_lock);
	thread = thread_list;
	while (thread != NULL)
	{
		if (thread->func != NULL)
		{
			pthread_mutex_unlock(&thread_lock);
			return false;
		}
		thread = thread->next;
	}
	pthread_mutex_unlock(&thread_lock);
	return true;
}

void I_start_threads(void)
{
}

void I_stop_threads(void)
{
	thread_t *thread = thread_list;
	while (thread != NULL)
	{
		// join with all threads here, since finished threads haven't been awaited yet.
		pthread_join(thread->thread, NULL);
		thread = thread->next;
	}
}

void I_lock_mutex(I_mutex *anchor)
{
	pthread_mutex_lock(&thread_lock);
	if (*anchor == NULL)
	{
		pthread_mutexattr_t attr;
		pthread_mutexattr_init(&attr);

		// SRB2 relies on lock recursion, so we need a mutex configured for that.
		pthread_mutexattr_settype(&attr, PTHREAD_MUTEX_RECURSIVE);
		*anchor = malloc(sizeof(pthread_mutex_t));
		pthread_mutex_init(*anchor, &attr);
		pthread_mutexattr_destroy(&attr);
	}
	pthread_mutex_unlock(&thread_lock);
	pthread_mutex_lock(*anchor);
}

void I_unlock_mutex(I_mutex id)
{
	pthread_mutex_unlock(id);
}

void I_hold_cond(I_cond *cond_anchor, I_mutex mutex_id)
{
	I_Assert(mutex_id != NULL);
	pthread_mutex_lock(&thread_lock);
	if (*cond_anchor == NULL)
	{
		*cond_anchor = malloc(sizeof(pthread_cond_t));
		pthread_cond_init(*cond_anchor, NULL);
	}
	pthread_mutex_unlock(&thread_lock);
	pthread_cond_wait(*cond_anchor, mutex_id);
}

void I_wake_one_cond(I_cond *anchor)
{
	pthread_mutex_lock(&thread_lock);
	if (*anchor == NULL)
	{
		*anchor = malloc(sizeof(pthread_cond_t));
		pthread_cond_init(*anchor, NULL);
	}
	pthread_mutex_unlock(&thread_lock);
	pthread_cond_signal(*anchor);
}

void I_wake_all_cond(I_cond *anchor)
{
	pthread_mutex_lock(&thread_lock);
	if (*anchor == NULL)
	{
		*anchor = malloc(sizeof(pthread_t));
		pthread_cond_init(*anchor, NULL);
	}
	pthread_mutex_unlock(&thread_lock);
	pthread_cond_broadcast(*anchor);
}
#elif defined (_WIN32)
#include <windows.h>

#include "../i_threads.h"
#include "../doomdef.h"
#include "../doomtype.h"

typedef struct thread_s thread_t;

struct thread_s
{
	thread_t *next;
	void *userdata;
	I_thread_fn func;
	HANDLE thread;
	DWORD thread_id;
};

// we use a linked list to avoid moving memory blocks when allocating new threads.
static thread_t *thread_list;
static CRITICAL_SECTION thread_lock;

static DWORD __stdcall HandleThread(void *data)
{
	thread_t *thread = data;
	thread->func(thread->userdata);

	EnterCriticalSection(&thread_lock);
	thread->func = NULL;
	LeaveCriticalSection(&thread_lock);
	return 0;
}

void I_spawn_thread(const char *name, I_thread_fn entry, void *userdata)
{
	thread_t *thread;
	(void)name;
	EnterCriticalSection(&thread_lock);
	thread = thread_list;
	while (thread != NULL)
	{
		if (thread->func == NULL)
		{
			CloseHandle(thread->thread);
			break;
		}
		thread = thread->next;
	}
	if (thread == NULL)
	{
		thread = malloc(sizeof(thread_t));
		thread->next = thread_list;
		thread_list = thread;
	}

	thread->func = entry;
	thread->userdata = userdata;
	thread->thread = CreateThread(NULL, 0, HandleThread, thread, 0, &thread->thread_id);
	LeaveCriticalSection(&thread_lock);
}

int I_thread_is_stopped(void)
{
	thread_t *thread;
	EnterCriticalSection(&thread_lock);
	thread = thread_list;
	while (thread != NULL)
	{
		if (thread->func != NULL)
		{
			LeaveCriticalSection(&thread_lock);
			return false;
		}
		thread = thread->next;
	}
	LeaveCriticalSection(&thread_lock);
	return true;
}

void I_start_threads(void)
{
	InitializeCriticalSection(&thread_lock);
}

void I_stop_threads(void)
{
	thread_t *thread = thread_list;
	while (thread != NULL)
	{
		WaitForSingleObject(thread->thread, INFINITE);
		CloseHandle(thread->thread);
		thread = thread->next;
	}
	DeleteCriticalSection(&thread_lock);
}

void I_lock_mutex(I_mutex *anchor)
{
	EnterCriticalSection(&thread_lock);
	if (*anchor == NULL)
	{
		*anchor = malloc(sizeof(CRITICAL_SECTION));
		InitializeCriticalSection(*anchor);
	}
	LeaveCriticalSection(&thread_lock);
	EnterCriticalSection(*anchor);
}

void I_unlock_mutex(I_mutex id)
{
	LeaveCriticalSection(id);
}

void I_hold_cond(I_cond *cond_anchor, I_mutex mutex_id)
{
	I_Assert(mutex_id != NULL);
	EnterCriticalSection(&thread_lock);
	if (*cond_anchor == NULL)
	{
		*cond_anchor = malloc(sizeof(CONDITION_VARIABLE));
		InitializeConditionVariable(*cond_anchor);
	}
	LeaveCriticalSection(&thread_lock);
	SleepConditionVariableCS(*cond_anchor, mutex_id, INFINITE);
}

void I_wake_one_cond(I_cond *anchor)
{
	EnterCriticalSection(&thread_lock);
	if (*anchor == NULL)
	{
		*anchor = malloc(sizeof(CONDITION_VARIABLE));
		InitializeConditionVariable(*anchor);
	}
	LeaveCriticalSection(&thread_lock);
	WakeConditionVariable(*anchor);
}

void I_wake_all_cond(I_cond *anchor)
{
	EnterCriticalSection(&thread_lock);
	if (*anchor == NULL)
	{
		*anchor = malloc(sizeof(CONDITION_VARIABLE));
		InitializeConditionVariable(*anchor);
	}
	LeaveCriticalSection(&thread_lock);
	WakeAllConditionVariable(*anchor);
}
#else
void I_spawn_thread(const char *name, I_thread_fn entry, void *userdata)
{
	(void)name;
	entry(userdata);
}

int I_thread_is_stopped(void)
{
}

void I_start_threads(void)
{
}

void I_stop_threads(void)
{
}

void I_lock_mutex(I_mutex *anchor)
{
	(void)anchor;
}

void I_unlock_mutex(I_mutex id)
{
	(void)id;
}

void I_hold_cond(I_cond *cond_anchor, I_mutex mutex_id)
{
	(void)cond_anchor;
	(void)mutex_id;
}

void I_wake_one_cond(I_cond *anchor)
{
	(void)anchor;
}

void I_wake_all_cond(I_cond *anchor)
{
	(void)anchor;
}
#endif