mirror of
https://github.com/libretro/beetle-pce-fast-libretro.git
synced 2024-11-27 01:50:21 +00:00
278 lines
4.8 KiB
C++
278 lines
4.8 KiB
C++
/* RetroArch - A frontend for libretro.
|
|
* Copyright (C) 2010-2012 - Hans-Kristian Arntzen
|
|
*
|
|
* RetroArch is free software: you can redistribute it and/or modify it under the terms
|
|
* of the GNU General Public License as published by the Free Software Found-
|
|
* ation, either version 3 of the License, or (at your option) any later version.
|
|
*
|
|
* RetroArch is distributed in the hope that it will be useful, but WITHOUT ANY WARRANTY;
|
|
* without even the implied warranty of MERCHANTABILITY or FITNESS FOR A PARTICULAR
|
|
* PURPOSE. See the GNU General Public License for more details.
|
|
*
|
|
* You should have received a copy of the GNU General Public License along with RetroArch.
|
|
* If not, see <http://www.gnu.org/licenses/>.
|
|
*/
|
|
|
|
#include "thread.h"
|
|
#include <stdlib.h>
|
|
|
|
#if defined(_WIN32) && !defined(_XBOX)
|
|
#define WIN32_LEAN_AND_MEAN
|
|
#include <windows.h>
|
|
#elif defined(_XBOX)
|
|
#include <xtl.h>
|
|
#else
|
|
#include <pthread.h>
|
|
#include <time.h>
|
|
#endif
|
|
|
|
struct thread_data
|
|
{
|
|
void (*func)(void*);
|
|
void *userdata;
|
|
};
|
|
|
|
#ifdef _WIN32
|
|
|
|
struct sthread
|
|
{
|
|
HANDLE thread;
|
|
};
|
|
|
|
static DWORD CALLBACK thread_wrap(void *data_)
|
|
{
|
|
struct thread_data *data = (struct thread_data*)data_;
|
|
data->func(data->userdata);
|
|
free(data);
|
|
return 0;
|
|
}
|
|
|
|
sthread_t *sthread_create(void (*thread_func)(void*), void *userdata)
|
|
{
|
|
sthread_t *thread = (sthread_t*)calloc(1, sizeof(*thread));
|
|
if (!thread)
|
|
return NULL;
|
|
|
|
struct thread_data *data = (struct thread_data*)calloc(1, sizeof(*data));
|
|
if (!data)
|
|
{
|
|
free(thread);
|
|
return NULL;
|
|
}
|
|
|
|
data->func = thread_func;
|
|
data->userdata = userdata;
|
|
|
|
thread->thread = CreateThread(NULL, 0, thread_wrap, data, 0, NULL);
|
|
if (!thread->thread)
|
|
{
|
|
free(data);
|
|
free(thread);
|
|
return NULL;
|
|
}
|
|
|
|
return thread;
|
|
}
|
|
|
|
void sthread_join(sthread_t *thread)
|
|
{
|
|
WaitForSingleObject(thread->thread, INFINITE);
|
|
CloseHandle(thread->thread);
|
|
free(thread);
|
|
}
|
|
|
|
struct slock
|
|
{
|
|
CRITICAL_SECTION lock;
|
|
};
|
|
|
|
slock_t *slock_new(void)
|
|
{
|
|
slock_t *lock = (slock_t*)calloc(1, sizeof(*lock));
|
|
if (!lock)
|
|
return NULL;
|
|
|
|
InitializeCriticalSection(&lock->lock);
|
|
return lock;
|
|
}
|
|
|
|
void slock_free(slock_t *lock)
|
|
{
|
|
DeleteCriticalSection(&lock->lock);
|
|
free(lock);
|
|
}
|
|
|
|
void slock_lock(slock_t *lock)
|
|
{
|
|
EnterCriticalSection(&lock->lock);
|
|
}
|
|
|
|
void slock_unlock(slock_t *lock)
|
|
{
|
|
LeaveCriticalSection(&lock->lock);
|
|
}
|
|
|
|
struct scond
|
|
{
|
|
HANDLE event;
|
|
};
|
|
|
|
scond_t *scond_new(void)
|
|
{
|
|
scond_t *cond = (scond_t*)calloc(1, sizeof(*cond));
|
|
if (!cond)
|
|
return NULL;
|
|
|
|
cond->event = CreateEvent(NULL, FALSE, FALSE, NULL);
|
|
if (!cond->event)
|
|
{
|
|
free(cond);
|
|
return NULL;
|
|
}
|
|
|
|
return cond;
|
|
}
|
|
|
|
void scond_wait(scond_t *cond, slock_t *lock)
|
|
{
|
|
WaitForSingleObject(cond->event, 0);
|
|
slock_unlock(lock);
|
|
|
|
WaitForSingleObject(cond->event, INFINITE);
|
|
|
|
slock_lock(lock);
|
|
}
|
|
|
|
void scond_signal(scond_t *cond)
|
|
{
|
|
SetEvent(cond->event);
|
|
}
|
|
|
|
void scond_free(scond_t *cond)
|
|
{
|
|
CloseHandle(cond->event);
|
|
free(cond);
|
|
}
|
|
|
|
#else
|
|
|
|
struct sthread
|
|
{
|
|
pthread_t id;
|
|
};
|
|
|
|
static void *thread_wrap(void *data_)
|
|
{
|
|
struct thread_data *data = (struct thread_data*)data_;
|
|
data->func(data->userdata);
|
|
free(data);
|
|
return NULL;
|
|
}
|
|
|
|
sthread_t *sthread_create(void (*thread_func)(void*), void *userdata)
|
|
{
|
|
sthread_t *thr = (sthread_t*)calloc(1, sizeof(*thr));
|
|
if (!thr)
|
|
return NULL;
|
|
|
|
struct thread_data *data = (struct thread_data*)calloc(1, sizeof(*data));
|
|
if (!data)
|
|
{
|
|
free(thr);
|
|
return NULL;
|
|
}
|
|
|
|
data->func = thread_func;
|
|
data->userdata = userdata;
|
|
|
|
if (pthread_create(&thr->id, NULL, thread_wrap, data) < 0)
|
|
{
|
|
free(data);
|
|
free(thr);
|
|
return NULL;
|
|
}
|
|
|
|
return thr;
|
|
}
|
|
|
|
void sthread_join(sthread_t *thread)
|
|
{
|
|
pthread_join(thread->id, NULL);
|
|
free(thread);
|
|
}
|
|
|
|
struct slock
|
|
{
|
|
pthread_mutex_t lock;
|
|
};
|
|
|
|
slock_t *slock_new(void)
|
|
{
|
|
slock_t *lock = (slock_t*)calloc(1, sizeof(*lock));
|
|
if (!lock)
|
|
return NULL;
|
|
|
|
if (pthread_mutex_init(&lock->lock, NULL) < 0)
|
|
{
|
|
free(lock);
|
|
return NULL;
|
|
}
|
|
|
|
return lock;
|
|
}
|
|
|
|
void slock_free(slock_t *lock)
|
|
{
|
|
pthread_mutex_destroy(&lock->lock);
|
|
free(lock);
|
|
}
|
|
|
|
void slock_lock(slock_t *lock)
|
|
{
|
|
pthread_mutex_lock(&lock->lock);
|
|
}
|
|
|
|
void slock_unlock(slock_t *lock)
|
|
{
|
|
pthread_mutex_unlock(&lock->lock);
|
|
}
|
|
|
|
struct scond
|
|
{
|
|
pthread_cond_t cond;
|
|
};
|
|
|
|
scond_t *scond_new(void)
|
|
{
|
|
scond_t *cond = (scond_t*)calloc(1, sizeof(*cond));
|
|
if (!cond)
|
|
return NULL;
|
|
|
|
if (pthread_cond_init(&cond->cond, NULL) < 0)
|
|
{
|
|
free(cond);
|
|
return NULL;
|
|
}
|
|
|
|
return cond;
|
|
}
|
|
|
|
void scond_free(scond_t *cond)
|
|
{
|
|
pthread_cond_destroy(&cond->cond);
|
|
free(cond);
|
|
}
|
|
|
|
void scond_wait(scond_t *cond, slock_t *lock)
|
|
{
|
|
pthread_cond_wait(&cond->cond, &lock->lock);
|
|
}
|
|
|
|
void scond_signal(scond_t *cond)
|
|
{
|
|
pthread_cond_signal(&cond->cond);
|
|
}
|
|
|
|
#endif
|
|
|