mirror of
https://github.com/CTCaer/RetroArch.git
synced 2024-12-26 12:47:37 +00:00
145 lines
4.0 KiB
C
145 lines
4.0 KiB
C
/* RetroArch - A frontend for libretro.
|
|
* Copyright (C) 2010-2014 - Hans-Kristian Arntzen
|
|
* Copyright (C) 2011-2014 - Daniel De Matteis
|
|
*
|
|
* 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/>.
|
|
*/
|
|
|
|
#ifndef __RARCH_MISCELLANEOUS_H
|
|
#define __RARCH_MISCELLANEOUS_H
|
|
|
|
#if defined(__CELLOS_LV2__) && !defined(__PSL1GHT__)
|
|
#include <sys/timer.h>
|
|
#elif defined(XENON)
|
|
#include <time/time.h>
|
|
#elif defined(GEKKO) || defined(__PSL1GHT__) || defined(__QNX__)
|
|
#include <unistd.h>
|
|
#elif defined(PSP)
|
|
#include <pspthreadman.h>
|
|
#else
|
|
#include <time.h>
|
|
#endif
|
|
|
|
#if defined(_WIN32) && !defined(_XBOX)
|
|
#define WIN32_LEAN_AND_MEAN
|
|
#include <windows.h>
|
|
#elif defined(_WIN32) && defined(_XBOX)
|
|
#include <Xtl.h>
|
|
#endif
|
|
#include "msvc/msvc_compat.h"
|
|
|
|
#include "retroarch_logger.h"
|
|
#include "endianness.h"
|
|
#include <limits.h>
|
|
|
|
/* Some platforms do not set this value.
|
|
* Just assume a value. It's usually 4KiB.
|
|
* Platforms with a known value (like Win32)
|
|
* set this value explicitly in platform specific headers.
|
|
*/
|
|
|
|
#ifndef PATH_MAX
|
|
#define PATH_MAX 4096
|
|
#endif
|
|
|
|
#ifndef max
|
|
#define max(a, b) ((a) > (b) ? (a) : (b))
|
|
#endif
|
|
|
|
#ifndef min
|
|
#define min(a, b) ((a) < (b) ? (a) : (b))
|
|
#endif
|
|
|
|
#define rarch_assert(cond) do { \
|
|
if (!(cond)) { RARCH_ERR("Assertion failed at %s:%d.\n", __FILE__, __LINE__); abort(); } \
|
|
} while(0)
|
|
|
|
#define ARRAY_SIZE(a) (sizeof(a) / sizeof((a)[0]))
|
|
#define RARCH_SCALE_BASE 256
|
|
|
|
static inline void rarch_sleep(unsigned msec)
|
|
{
|
|
#if defined(__CELLOS_LV2__) && !defined(__PSL1GHT__)
|
|
sys_timer_usleep(1000 * msec);
|
|
#elif defined(PSP)
|
|
sceKernelDelayThread(1000 * msec);
|
|
#elif defined(_WIN32)
|
|
Sleep(msec);
|
|
#elif defined(XENON)
|
|
udelay(1000 * msec);
|
|
#elif defined(GEKKO) || defined(__PSL1GHT__) || defined(__QNX__)
|
|
usleep(1000 * msec);
|
|
#else
|
|
struct timespec tv = {0};
|
|
tv.tv_sec = msec / 1000;
|
|
tv.tv_nsec = (msec % 1000) * 1000000;
|
|
nanosleep(&tv, NULL);
|
|
#endif
|
|
}
|
|
|
|
static inline uint32_t next_pow2(uint32_t v)
|
|
{
|
|
v--;
|
|
v |= v >> 1;
|
|
v |= v >> 2;
|
|
v |= v >> 4;
|
|
v |= v >> 8;
|
|
v |= v >> 16;
|
|
v++;
|
|
return v;
|
|
}
|
|
|
|
static inline uint32_t prev_pow2(uint32_t v)
|
|
{
|
|
v |= v >> 1;
|
|
v |= v >> 2;
|
|
v |= v >> 4;
|
|
v |= v >> 8;
|
|
v |= v >> 16;
|
|
return v - (v >> 1);
|
|
}
|
|
|
|
/* Helper macros and struct to keep track of many booleans.
|
|
* To check for multiple bits, use &&, not &.
|
|
* For OR, | can be used. */
|
|
typedef struct
|
|
{
|
|
uint32_t data[8];
|
|
} rarch_bits_t;
|
|
|
|
#define BIT_SET(a, bit) ((a)[(bit) >> 3] |= (1 << ((bit) & 7)))
|
|
#define BIT_CLEAR(a, bit) ((a)[(bit) >> 3] &= ~(1 << ((bit) & 7)))
|
|
#define BIT_GET(a, bit) ((a)[(bit) >> 3] & (1 << ((bit) & 7)))
|
|
|
|
#define BIT16_SET(a, bit) ((a) |= (1 << ((bit) & 15)))
|
|
#define BIT16_CLEAR(a, bit) ((a) &= ~(1 << ((bit) & 15)))
|
|
#define BIT16_GET(a, bit) (!!((a) & (1 << ((bit) & 15))))
|
|
#define BIT16_CLEAR_ALL(a) ((a) = 0)
|
|
|
|
#define BIT32_SET(a, bit) ((a) |= (1 << ((bit) & 31)))
|
|
#define BIT32_CLEAR(a, bit) ((a) &= ~(1 << ((bit) & 31)))
|
|
#define BIT32_GET(a, bit) (!!((a) & (1 << ((bit) & 31))))
|
|
#define BIT32_CLEAR_ALL(a) ((a) = 0)
|
|
|
|
#define BIT64_SET(a, bit) ((a) |= (1ULL << ((bit) & 63)))
|
|
#define BIT64_CLEAR(a, bit) ((a) &= ~(1ULL << ((bit) & 63)))
|
|
#define BIT64_GET(a, bit) (!!((a) & (1ULL << ((bit) & 63))))
|
|
#define BIT64_CLEAR_ALL(a) ((a) = 0)
|
|
|
|
#define BIT128_SET(a, bit) ((a).data[(bit) >> 5] |= (1 << ((bit) & 31))
|
|
#define BIT128_CLEAR(a, bit) ((a).data[(bit) >> 5] &= ~(1 << ((bit) & 31)))
|
|
#define BIT128_GET(a, bit) ((a).data[(bit) >> 5] & (1 << ((bit) & 31)))
|
|
#define BIT128_CLEAR_ALL(a) memset(&(a), 0, sizeof(a));
|
|
|
|
|
|
#endif
|