1 /* Copyright (C) 2010-2018 The RetroArch team
2 *
3 * ---------------------------------------------------------------------------------------
4 * The following license statement only applies to this file (retro_miscellaneous.h).
5 * ---------------------------------------------------------------------------------------
6 *
7 * Permission is hereby granted, free of charge,
8 * to any person obtaining a copy of this software and associated documentation files (the "Software"),
9 * to deal in the Software without restriction, including without limitation the rights to
10 * use, copy, modify, merge, publish, distribute, sublicense, and/or sell copies of the Software,
11 * and to permit persons to whom the Software is furnished to do so, subject to the following conditions:
12 *
13 * The above copyright notice and this permission notice shall be included in all copies or substantial portions of the Software.
14 *
15 * THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR IMPLIED,
16 * INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
17 * FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT.
18 * IN NO EVENT SHALL THE AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER LIABILITY,
19 * WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,
20 * OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE SOFTWARE.
21 */
22
23 #ifndef __RARCH_MISCELLANEOUS_H
24 #define __RARCH_MISCELLANEOUS_H
25
26 #define RARCH_MAX_SUBSYSTEMS 10
27 #define RARCH_MAX_SUBSYSTEM_ROMS 10
28
29 #include <stdint.h>
30 #include <boolean.h>
31 #include <retro_inline.h>
32
33 #if defined(_WIN32) && !defined(_XBOX)
34 #ifndef WIN32_LEAN_AND_MEAN
35 #define WIN32_LEAN_AND_MEAN
36 #endif
37 #include <windows.h>
38 #elif defined(_WIN32) && defined(_XBOX)
39 #include <Xtl.h>
40 #endif
41
42 #if defined(__CELLOS_LV2__)
43 #include <sys/fs_external.h>
44 #endif
45
46 #include <limits.h>
47
48 #ifdef _MSC_VER
49 #include <compat/msvc.h>
50 #endif
51
bits_or_bits(uint32_t * a,uint32_t * b,uint32_t count)52 static INLINE void bits_or_bits(uint32_t *a, uint32_t *b, uint32_t count)
53 {
54 uint32_t i;
55 for (i = 0; i < count;i++)
56 a[i] |= b[i];
57 }
58
bits_clear_bits(uint32_t * a,uint32_t * b,uint32_t count)59 static INLINE void bits_clear_bits(uint32_t *a, uint32_t *b, uint32_t count)
60 {
61 uint32_t i;
62 for (i = 0; i < count;i++)
63 a[i] &= ~b[i];
64 }
65
bits_any_set(uint32_t * ptr,uint32_t count)66 static INLINE bool bits_any_set(uint32_t* ptr, uint32_t count)
67 {
68 uint32_t i;
69 for (i = 0; i < count; i++)
70 {
71 if (ptr[i] != 0)
72 return true;
73 }
74 return false;
75 }
76
77 #ifndef PATH_MAX_LENGTH
78 #if defined(__CELLOS_LV2__)
79 #define PATH_MAX_LENGTH CELL_FS_MAX_FS_PATH_LENGTH
80 #elif defined(_XBOX1) || defined(_3DS) || defined(PSP) || defined(PS2) || defined(GEKKO)|| defined(WIIU) || defined(ORBIS)
81 #define PATH_MAX_LENGTH 512
82 #else
83 #define PATH_MAX_LENGTH 4096
84 #endif
85 #endif
86
87 #ifndef MAX
88 #define MAX(a, b) ((a) > (b) ? (a) : (b))
89 #endif
90
91 #ifndef MIN
92 #define MIN(a, b) ((a) < (b) ? (a) : (b))
93 #endif
94
95 #define ARRAY_SIZE(a) (sizeof(a) / sizeof((a)[0]))
96
97 #define BITS_GET_ELEM(a, i) ((a).data[i])
98 #define BITS_GET_ELEM_PTR(a, i) ((a)->data[i])
99
100 #define BIT_SET(a, bit) ((a)[(bit) >> 3] |= (1 << ((bit) & 7)))
101 #define BIT_CLEAR(a, bit) ((a)[(bit) >> 3] &= ~(1 << ((bit) & 7)))
102 #define BIT_GET(a, bit) (((a)[(bit) >> 3] >> ((bit) & 7)) & 1)
103
104 #define BIT16_SET(a, bit) ((a) |= (1 << ((bit) & 15)))
105 #define BIT16_CLEAR(a, bit) ((a) &= ~(1 << ((bit) & 15)))
106 #define BIT16_GET(a, bit) (((a) >> ((bit) & 15)) & 1)
107 #define BIT16_CLEAR_ALL(a) ((a) = 0)
108
109 #define BIT32_SET(a, bit) ((a) |= (1 << ((bit) & 31)))
110 #define BIT32_CLEAR(a, bit) ((a) &= ~(1 << ((bit) & 31)))
111 #define BIT32_GET(a, bit) (((a) >> ((bit) & 31)) & 1)
112 #define BIT32_CLEAR_ALL(a) ((a) = 0)
113
114 #define BIT64_SET(a, bit) ((a) |= (UINT64_C(1) << ((bit) & 63)))
115 #define BIT64_CLEAR(a, bit) ((a) &= ~(UINT64_C(1) << ((bit) & 63)))
116 #define BIT64_GET(a, bit) (((a) >> ((bit) & 63)) & 1)
117 #define BIT64_CLEAR_ALL(a) ((a) = 0)
118
119 #define BIT128_SET(a, bit) ((a).data[(bit) >> 5] |= (1 << ((bit) & 31)))
120 #define BIT128_CLEAR(a, bit) ((a).data[(bit) >> 5] &= ~(1 << ((bit) & 31)))
121 #define BIT128_GET(a, bit) (((a).data[(bit) >> 5] >> ((bit) & 31)) & 1)
122 #define BIT128_CLEAR_ALL(a) memset(&(a), 0, sizeof(a))
123
124 #define BIT128_SET_PTR(a, bit) BIT128_SET(*a, bit)
125 #define BIT128_CLEAR_PTR(a, bit) BIT128_CLEAR(*a, bit)
126 #define BIT128_GET_PTR(a, bit) BIT128_GET(*a, bit)
127 #define BIT128_CLEAR_ALL_PTR(a) BIT128_CLEAR_ALL(*a)
128
129 #define BIT256_SET(a, bit) BIT128_SET(a, bit)
130 #define BIT256_CLEAR(a, bit) BIT128_CLEAR(a, bit)
131 #define BIT256_GET(a, bit) BIT128_GET(a, bit)
132 #define BIT256_CLEAR_ALL(a) BIT128_CLEAR_ALL(a)
133
134 #define BIT256_SET_PTR(a, bit) BIT256_SET(*a, bit)
135 #define BIT256_CLEAR_PTR(a, bit) BIT256_CLEAR(*a, bit)
136 #define BIT256_GET_PTR(a, bit) BIT256_GET(*a, bit)
137 #define BIT256_CLEAR_ALL_PTR(a) BIT256_CLEAR_ALL(*a)
138
139 #define BITS_COPY16_PTR(a,bits) \
140 { \
141 BIT128_CLEAR_ALL_PTR(a); \
142 BITS_GET_ELEM_PTR(a, 0) = (bits) & 0xffff; \
143 }
144
145 #define BITS_COPY32_PTR(a,bits) \
146 { \
147 BIT128_CLEAR_ALL_PTR(a); \
148 BITS_GET_ELEM_PTR(a, 0) = (bits); \
149 }
150
151 /* Helper macros and struct to keep track of many booleans. */
152 /* This struct has 256 bits. */
153 typedef struct
154 {
155 uint32_t data[8];
156 } retro_bits_t;
157
158 #ifdef _WIN32
159 # ifdef _WIN64
160 # define PRI_SIZET PRIu64
161 # else
162 # if _MSC_VER == 1800
163 # define PRI_SIZET PRIu32
164 # else
165 # define PRI_SIZET "u"
166 # endif
167 # endif
168 #elif PS2
169 # define PRI_SIZET "u"
170 #else
171 # if (SIZE_MAX == 0xFFFF)
172 # define PRI_SIZET "hu"
173 # elif (SIZE_MAX == 0xFFFFFFFF)
174 # define PRI_SIZET "u"
175 # elif (SIZE_MAX == 0xFFFFFFFFFFFFFFFF)
176 # define PRI_SIZET "lu"
177 # else
178 # error PRI_SIZET: unknown SIZE_MAX
179 # endif
180 #endif
181
182 #endif
183