-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy pathCommonInclude.h
More file actions
446 lines (418 loc) · 11.1 KB
/
Copy pathCommonInclude.h
File metadata and controls
446 lines (418 loc) · 11.1 KB
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
251
252
253
254
255
256
257
258
259
260
261
262
263
264
265
266
267
268
269
270
271
272
273
274
275
276
277
278
279
280
281
282
283
284
285
286
287
288
289
290
291
292
293
294
295
296
297
298
299
300
301
302
303
304
305
306
307
308
309
310
311
312
313
314
315
316
317
318
319
320
321
322
323
324
325
326
327
328
329
330
331
332
333
334
335
336
337
338
339
340
341
342
343
344
345
346
347
348
349
350
351
352
353
354
355
356
357
358
359
360
361
362
363
364
365
366
367
368
369
370
371
372
373
374
375
376
377
378
379
380
381
382
383
384
385
386
387
388
389
390
391
392
393
394
395
396
397
398
399
400
401
402
403
404
405
406
407
408
409
410
411
412
413
414
415
416
417
418
419
420
421
422
423
424
425
426
427
428
429
430
431
432
433
434
435
436
437
438
439
440
441
442
443
444
445
446
#ifndef Simtary_COMMONINCLUDE_H
#define Simtary_COMMONINCLUDE_H
// This is a helper include file pasted into all engine headers, try to keep it minimal!
// Do not include engine features in this file!
#include <cfloat>
#include <cstdint>
#include <type_traits>
#define arraysize(a) (sizeof(a) / sizeof(a[0]))
#ifndef NOMINMAX
#define NOMINMAX
#endif // NOMINMAX
#if defined(__GNUC__) || defined(__clang__)
#define __forceinline __attribute__((always_inline)) inline
#define NO_SANITIZE(x) __attribute__((no_sanitize(x)))
#else
#define NO_SANITIZE(x)
#endif // defined(__GNUC__) || defined(__clang__)
#ifdef _MSC_VER
#define WI_DISABLE_DEPRECATED_BEGIN __pragma(warning(push)) __pragma(warning(disable: 4996))
#define WI_DISABLE_DEPRECATED_END __pragma(warning(pop))
#else
#define WI_DISABLE_DEPRECATED_BEGIN _Pragma("GCC diagnostic push") _Pragma("GCC diagnostic ignored \"-Wdeprecated-declarations\"")
#define WI_DISABLE_DEPRECATED_END _Pragma("GCC diagnostic pop")
#endif // _MSC_VER
// Simple common math helpers:
template<typename T>
constexpr T align(T value, T alignment)
{
return ((value + alignment - T(1)) / alignment) * alignment;
}
template<typename T>
constexpr bool is_aligned(T value, T alignment)
{
return align(value, alignment) == value;
}
template <typename T>
constexpr T sqr(T x) { return x * x; }
template <typename T>
constexpr T pow4(T x) { return sqr(sqr(x)); }
template <typename T>
constexpr T clamp(T x, T a, T b)
{
return x < a ? a : (x > b ? b : x);
}
template <typename T>
constexpr T saturate(T x)
{
return clamp(x, T(0), T(1));
}
template <typename T>
constexpr T frac(T x)
{
T f = x - T(int(x));
f = f < 0 ? (1 + f) : f;
return f;
}
template <typename T>
constexpr float lerp(T x, T y, T a)
{
return x * (1 - a) + y * a;
}
template <typename T>
constexpr T inverse_lerp(T value1, T value2, T pos)
{
return value2 == value1 ? T(0) : ((pos - value1) / (value2 - value1));
}
template <typename T>
constexpr T smoothstep(T edge0, T edge1, T x)
{
const T t = saturate((x - edge0) / (edge1 - edge0));
return t * t * (T(3) - T(2) * t);
}
template <typename float4, typename float2>
constexpr float bilinear(float4 gather, float2 pixel_frac)
{
const float top_row = lerp(gather.w, gather.z, pixel_frac.x);
const float bottom_row = lerp(gather.x, gather.y, pixel_frac.x);
return lerp(top_row, bottom_row, pixel_frac.y);
}
// Stack allocated string utility:
template <unsigned capacity = 256>
struct StackString
{
char chars[capacity] = {};
unsigned cnt = 0;
static_assert(capacity > 1);
constexpr operator const char* () const { return chars; }
constexpr const char* const c_str() const { return chars; }
constexpr void push_back(const char* str) { while (*str != 0 && (cnt < (capacity - 1))) { chars[cnt++] = *str; str++; } }
constexpr unsigned size() const { return capacity; }
constexpr unsigned length() const { return cnt; }
constexpr bool empty() const { return cnt == 0; }
};
// Stack allocated simplified vector container:
template<typename T, unsigned count>
struct StackVector
{
T items[count] = {};
unsigned last = 0;
constexpr void resize(unsigned size) { last = size; }
constexpr unsigned size() const { return last; }
constexpr bool empty() const { return last == 0; }
constexpr void push_back(const T& item) { items[last++] = item; }
constexpr void push_back(T&& item) { items[last++] = static_cast<T&&>(item); }
constexpr void pop_back() { if (!empty()) items[--last] = {}; }
constexpr void clear() { for (unsigned i = 0; i < count; ++i) items[i] = {}; last = 0; }
constexpr T* data() { return items; }
constexpr const T* data() const { return items; }
constexpr T* begin() { return items; }
constexpr T* end() { return items + last; }
constexpr const T& back() const { return items[last - 1]; }
constexpr T& back() { return items[last - 1]; }
constexpr const T& front() const { return items[0]; }
constexpr T& front() { return items[0]; }
constexpr T& emplace_back() { push_back({}); return back(); }
constexpr const T& operator[](unsigned index) const { return items[index]; }
constexpr T& operator[](unsigned index) { return items[index]; }
};
// CPU intrinsics:
#if defined(_WIN32)
// Windows, Xbox:
#include <intrin.h>
#if defined(_M_ARM64)
#include <arm64intr.h>
#endif // _M_ARM64
inline long AtomicAnd(volatile long* ptr, long mask)
{
return _InterlockedAnd(ptr, mask);
}
inline long long AtomicAnd(volatile long long* ptr, long long mask)
{
return _InterlockedAnd64(ptr, mask);
}
inline long AtomicOr(volatile long* ptr, long mask)
{
return _InterlockedOr(ptr, mask);
}
inline long long AtomicOr(volatile long long* ptr, long long mask)
{
return _InterlockedOr64(ptr, mask);
}
inline long AtomicXor(volatile long* ptr, long mask)
{
return _InterlockedXor(ptr, mask);
}
inline long long AtomicXor(volatile long long* ptr, long long mask)
{
return _InterlockedXor64(ptr, mask);
}
inline long AtomicAdd(volatile long* ptr, long val)
{
return _InterlockedExchangeAdd(ptr, val);
}
inline long long AtomicAdd(volatile long long* ptr, long long val)
{
return _InterlockedExchangeAdd64(ptr, val);
}
inline unsigned int countbits(unsigned int value)
{
return __popcnt(value);
}
inline unsigned long countbits(unsigned long value)
{
return (unsigned long)__popcnt64((unsigned long long)value);
}
inline unsigned long long countbits(unsigned long long value)
{
return __popcnt64(value);
}
inline unsigned int firstbithigh(unsigned int value)
{
unsigned long bit_index;
if (_BitScanReverse(&bit_index, (unsigned long)value))
{
return 31u - (unsigned int)bit_index;
}
return 0;
}
inline unsigned long firstbithigh(unsigned long value)
{
unsigned long bit_index;
if (_BitScanReverse64(&bit_index, (unsigned long long)value))
{
return 31ul - bit_index;
}
return 0;
}
inline unsigned long firstbithigh(unsigned long long value)
{
unsigned long bit_index;
if (_BitScanReverse64(&bit_index, value))
{
return 63ull - bit_index;
}
return 0;
}
inline unsigned int firstbitlow(unsigned int value)
{
unsigned long bit_index;
if (_BitScanForward(&bit_index, value))
{
return (unsigned int)bit_index;
}
return 0;
}
inline unsigned long firstbitlow(unsigned long value)
{
unsigned long bit_index;
if (_BitScanForward64(&bit_index, (unsigned long long)value))
{
return bit_index;
}
return 0;
}
inline unsigned long firstbitlow(unsigned long long value)
{
unsigned long bit_index;
if (_BitScanForward64(&bit_index, value))
{
return bit_index;
}
return 0;
}
#else
// Linux, PlayStation:
inline long AtomicAnd(volatile long* ptr, long mask)
{
return __atomic_fetch_and(ptr, mask, __ATOMIC_SEQ_CST);
}
inline long long AtomicAnd(volatile long long* ptr, long long mask)
{
return __atomic_fetch_and(ptr, mask, __ATOMIC_SEQ_CST);
}
inline long AtomicOr(volatile long* ptr, long mask)
{
return __atomic_fetch_or(ptr, mask, __ATOMIC_SEQ_CST);
}
inline long long AtomicOr(volatile long long* ptr, long long mask)
{
return __atomic_fetch_or(ptr, mask, __ATOMIC_SEQ_CST);
}
inline long AtomicXor(volatile long* ptr, long mask)
{
return __atomic_fetch_xor(ptr, mask, __ATOMIC_SEQ_CST);
}
inline long long AtomicXor(volatile long long* ptr, long long mask)
{
return __atomic_fetch_xor(ptr, mask, __ATOMIC_SEQ_CST);
}
inline long AtomicAdd(volatile long* ptr, long val)
{
return __atomic_fetch_add(ptr, val, __ATOMIC_SEQ_CST);
}
inline long long AtomicAdd(volatile long long* ptr, long long val)
{
return __atomic_fetch_add(ptr, val, __ATOMIC_SEQ_CST);
}
inline unsigned int countbits(unsigned int value)
{
return __builtin_popcount(value);
}
inline unsigned long long countbits(unsigned long value)
{
return __builtin_popcountl(value);
}
inline unsigned long long countbits(unsigned long long value)
{
return __builtin_popcountll(value);
}
inline unsigned long firstbithigh(unsigned int value)
{
if (value == 0)
{
return 0;
}
return __builtin_clz(value);
}
inline unsigned long firstbithigh(unsigned long value)
{
if (value == 0)
{
return 0;
}
return __builtin_clzl(value);
}
inline unsigned long firstbithigh(unsigned long long value)
{
if (value == 0)
{
return 0;
}
return __builtin_clzll(value);
}
inline unsigned long firstbitlow(unsigned int value)
{
if (value == 0)
{
return 0;
}
return __builtin_ctz(value);
}
inline unsigned long firstbitlow(unsigned long value)
{
if (value == 0)
{
return 0;
}
return __builtin_ctzl(value);
}
inline unsigned long firstbitlow(unsigned long long value)
{
if (value == 0)
{
return 0;
}
return __builtin_ctzll(value);
}
#endif // _WIN32
inline long AtomicLoad(const volatile long* ptr)
{
return AtomicOr((volatile long*)ptr, 0);
}
inline long long AtomicLoad(const volatile long long* ptr)
{
return AtomicOr((volatile long long*)ptr, 0);
}
// Enable enum flags:
// https://www.justsoftwaresolutions.co.uk/cplusplus/using-enum-classes-as-bitfields.html
template<typename E>
struct enable_bitmask_operators {
static constexpr bool enable = false;
};
template<typename E>
constexpr typename std::enable_if<enable_bitmask_operators<E>::enable, E>::type operator|(E lhs, E rhs)
{
typedef typename std::underlying_type<E>::type underlying;
return static_cast<E>(
static_cast<underlying>(lhs) | static_cast<underlying>(rhs));
}
template<typename E>
constexpr typename std::enable_if<enable_bitmask_operators<E>::enable, E&>::type operator|=(E& lhs, E rhs)
{
typedef typename std::underlying_type<E>::type underlying;
lhs = static_cast<E>(
static_cast<underlying>(lhs) | static_cast<underlying>(rhs));
return lhs;
}
template<typename E>
constexpr typename std::enable_if<enable_bitmask_operators<E>::enable, E>::type operator&(E lhs, E rhs)
{
typedef typename std::underlying_type<E>::type underlying;
return static_cast<E>(
static_cast<underlying>(lhs) & static_cast<underlying>(rhs));
}
template<typename E>
constexpr typename std::enable_if<enable_bitmask_operators<E>::enable, E&>::type operator&=(E& lhs, E rhs)
{
typedef typename std::underlying_type<E>::type underlying;
lhs = static_cast<E>(
static_cast<underlying>(lhs) & static_cast<underlying>(rhs));
return lhs;
}
template<typename E>
constexpr typename std::enable_if<enable_bitmask_operators<E>::enable, E>::type operator~(E rhs)
{
typedef typename std::underlying_type<E>::type underlying;
rhs = static_cast<E>(
~static_cast<underlying>(rhs));
return rhs;
}
template<typename E>
constexpr bool has_flag(E lhs, E rhs)
{
return (lhs & rhs) == rhs;
}
template<typename T, typename U>
constexpr void set_flag(T& flags, const U flag, const bool set)
{
if (set)
{
flags |= static_cast<T>(flag);
}
else
{
flags &= ~static_cast<T>(flag);
}
}
// Extract file name from a path at compile-time
constexpr const char* relative_path(const char* path)
{
const char* startPosition = path;
for (const char* currentCharacter = path; *currentCharacter != '\0'; ++currentCharacter)
{
if (*currentCharacter == '\\' || *currentCharacter == '/')
{
startPosition = currentCharacter;
}
}
if (startPosition != path)
{
++startPosition;
}
return startPosition;
}
constexpr auto relative_path_storage(const char* path)
{
StackString ret;
ret.push_back(relative_path(path));
return ret;
}
// Extract function name from a string at compile-time
constexpr auto extract_function_name(const char* str)
{
StackString ret;
ret.push_back(str);
return ret;
}
#endif //Simtary_COMMONINCLUDE_H