1 /* Copyright (C) 2010-2020 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)
34
35 #if defined(_XBOX)
36 #include <Xtl.h>
37 #else
38 #ifndef WIN32_LEAN_AND_MEAN
39 #define WIN32_LEAN_AND_MEAN
40 #endif
41 #include <windows.h>
42 #endif
43
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(_XBOX1) || defined(_3DS) || defined(PSP) || defined(PS2) || defined(GEKKO)|| defined(WIIU) || defined(ORBIS) || defined(__PSL1GHT__) || defined(__PS3__)
79 #define PATH_MAX_LENGTH 512
80 #else
81 #define PATH_MAX_LENGTH 4096
82 #endif
83 #endif
84
85 #ifndef MAX
86 #define MAX(a, b) ((a) > (b) ? (a) : (b))
87 #endif
88
89 #ifndef MIN
90 #define MIN(a, b) ((a) < (b) ? (a) : (b))
91 #endif
92
93 #define ARRAY_SIZE(a) (sizeof(a) / sizeof((a)[0]))
94
95 #define BITS_GET_ELEM(a, i) ((a).data[i])
96 #define BITS_GET_ELEM_PTR(a, i) ((a)->data[i])
97
98 #define BIT_SET(a, bit) ((a)[(bit) >> 3] |= (1 << ((bit) & 7)))
99 #define BIT_CLEAR(a, bit) ((a)[(bit) >> 3] &= ~(1 << ((bit) & 7)))
100 #define BIT_GET(a, bit) (((a)[(bit) >> 3] >> ((bit) & 7)) & 1)
101
102 #define BIT16_SET(a, bit) ((a) |= (1 << ((bit) & 15)))
103 #define BIT16_CLEAR(a, bit) ((a) &= ~(1 << ((bit) & 15)))
104 #define BIT16_GET(a, bit) (((a) >> ((bit) & 15)) & 1)
105 #define BIT16_CLEAR_ALL(a) ((a) = 0)
106
107 #define BIT32_SET(a, bit) ((a) |= (UINT32_C(1) << ((bit) & 31)))
108 #define BIT32_CLEAR(a, bit) ((a) &= ~(UINT32_C(1) << ((bit) & 31)))
109 #define BIT32_GET(a, bit) (((a) >> ((bit) & 31)) & 1)
110 #define BIT32_CLEAR_ALL(a) ((a) = 0)
111
112 #define BIT64_SET(a, bit) ((a) |= (UINT64_C(1) << ((bit) & 63)))
113 #define BIT64_CLEAR(a, bit) ((a) &= ~(UINT64_C(1) << ((bit) & 63)))
114 #define BIT64_GET(a, bit) (((a) >> ((bit) & 63)) & 1)
115 #define BIT64_CLEAR_ALL(a) ((a) = 0)
116
117 #define BIT128_SET(a, bit) ((a).data[(bit) >> 5] |= (UINT32_C(1) << ((bit) & 31)))
118 #define BIT128_CLEAR(a, bit) ((a).data[(bit) >> 5] &= ~(UINT32_C(1) << ((bit) & 31)))
119 #define BIT128_GET(a, bit) (((a).data[(bit) >> 5] >> ((bit) & 31)) & 1)
120 #define BIT128_CLEAR_ALL(a) memset(&(a), 0, sizeof(a))
121
122 #define BIT128_SET_PTR(a, bit) BIT128_SET(*a, bit)
123 #define BIT128_CLEAR_PTR(a, bit) BIT128_CLEAR(*a, bit)
124 #define BIT128_GET_PTR(a, bit) BIT128_GET(*a, bit)
125 #define BIT128_CLEAR_ALL_PTR(a) BIT128_CLEAR_ALL(*a)
126
127 #define BIT256_SET(a, bit) BIT128_SET(a, bit)
128 #define BIT256_CLEAR(a, bit) BIT128_CLEAR(a, bit)
129 #define BIT256_GET(a, bit) BIT128_GET(a, bit)
130 #define BIT256_CLEAR_ALL(a) BIT128_CLEAR_ALL(a)
131
132 #define BIT256_SET_PTR(a, bit) BIT256_SET(*a, bit)
133 #define BIT256_CLEAR_PTR(a, bit) BIT256_CLEAR(*a, bit)
134 #define BIT256_GET_PTR(a, bit) BIT256_GET(*a, bit)
135 #define BIT256_CLEAR_ALL_PTR(a) BIT256_CLEAR_ALL(*a)
136
137 #define BIT512_SET(a, bit) BIT256_SET(a, bit)
138 #define BIT512_CLEAR(a, bit) BIT256_CLEAR(a, bit)
139 #define BIT512_GET(a, bit) BIT256_GET(a, bit)
140 #define BIT512_CLEAR_ALL(a) BIT256_CLEAR_ALL(a)
141
142 #define BIT512_SET_PTR(a, bit) BIT512_SET(*a, bit)
143 #define BIT512_CLEAR_PTR(a, bit) BIT512_CLEAR(*a, bit)
144 #define BIT512_GET_PTR(a, bit) BIT512_GET(*a, bit)
145 #define BIT512_CLEAR_ALL_PTR(a) BIT512_CLEAR_ALL(*a)
146
147 #define BITS_COPY16_PTR(a,bits) \
148 { \
149 BIT128_CLEAR_ALL_PTR(a); \
150 BITS_GET_ELEM_PTR(a, 0) = (bits) & 0xffff; \
151 }
152
153 #define BITS_COPY32_PTR(a,bits) \
154 { \
155 BIT128_CLEAR_ALL_PTR(a); \
156 BITS_GET_ELEM_PTR(a, 0) = (bits); \
157 }
158
159 #define BITS_COPY64_PTR(a,bits) \
160 { \
161 BIT128_CLEAR_ALL_PTR(a); \
162 BITS_GET_ELEM_PTR(a, 0) = (bits); \
163 BITS_GET_ELEM_PTR(a, 1) = (bits >> 32); \
164 }
165
166 /* Helper macros and struct to keep track of many booleans. */
167 /* This struct has 256 bits. */
168 typedef struct
169 {
170 uint32_t data[8];
171 } retro_bits_t;
172
173 /* This struct has 512 bits. */
174 typedef struct
175 {
176 uint32_t data[16];
177 } retro_bits_512_t;
178
179 #ifdef _WIN32
180 # ifdef _WIN64
181 # define PRI_SIZET PRIu64
182 # else
183 # if _MSC_VER == 1800
184 # define PRI_SIZET PRIu32
185 # else
186 # define PRI_SIZET "u"
187 # endif
188 # endif
189 #elif defined(PS2)
190 # define PRI_SIZET "u"
191 #else
192 # if (SIZE_MAX == 0xFFFF)
193 # define PRI_SIZET "hu"
194 # elif (SIZE_MAX == 0xFFFFFFFF)
195 # define PRI_SIZET "u"
196 # elif (SIZE_MAX == 0xFFFFFFFFFFFFFFFF)
197 # define PRI_SIZET "lu"
198 # else
199 # error PRI_SIZET: unknown SIZE_MAX
200 # endif
201 #endif
202
203 #endif
204