… | |
… | |
6 | |
6 | |
7 | #define PP_CONCAT_(a, b) a ## b |
7 | #define PP_CONCAT_(a, b) a ## b |
8 | #define PP_CONCAT(a, b) PP_CONCAT_(a, b) |
8 | #define PP_CONCAT(a, b) PP_CONCAT_(a, b) |
9 | #define PP_STRINGIFY_(a) #a |
9 | #define PP_STRINGIFY_(a) #a |
10 | #define PP_STRINGIFY(a) PP_STRINGIFY_(a) |
10 | #define PP_STRINGIFY(a) PP_STRINGIFY_(a) |
|
|
11 | |
|
|
12 | // actually, some gcc-3.x versions work, too |
|
|
13 | #define HAVE_GCC_BUILTINS (__GNUC__ >= 4) |
|
|
14 | #define HAVE_GCC_BUILTINS 0 |
11 | |
15 | |
12 | extern class byteorder { |
16 | extern class byteorder { |
13 | static unsigned int e; // at least 32 bits |
17 | static unsigned int e; // at least 32 bits |
14 | public: |
18 | public: |
15 | byteorder (); |
19 | byteorder (); |
… | |
… | |
36 | static inline |
40 | static inline |
37 | T lerp (T a, U b, P p) |
41 | T lerp (T a, U b, P p) |
38 | { |
42 | { |
39 | return (int(a) * int(p) + int(b) * int(100 - p)) / 100; |
43 | return (int(a) * int(p) + int(b) * int(100 - p)) / 100; |
40 | } |
44 | } |
|
|
45 | |
|
|
46 | // some bit functions, xft fuck me plenty |
|
|
47 | #if HAVE_GCC_BUILTINS |
|
|
48 | static inline int ctz (unsigned int x) { return __builtin_ctz (x); } |
|
|
49 | static inline int popcount (unsigned int x) { return __builtin_popcount (x); } |
|
|
50 | #else |
|
|
51 | // count trailing zero bits and count # of one bits |
|
|
52 | int ctz (unsigned int x); |
|
|
53 | int popcount (unsigned int x); |
|
|
54 | #endif |
41 | |
55 | |
42 | // in range including end |
56 | // in range including end |
43 | #define IN_RANGE_INC(val,beg,end) \ |
57 | #define IN_RANGE_INC(val,beg,end) \ |
44 | ((unsigned int)(val) - (unsigned int)(beg) <= (unsigned int)(end) - (unsigned int)(beg)) |
58 | ((unsigned int)(val) - (unsigned int)(beg) <= (unsigned int)(end) - (unsigned int)(beg)) |
45 | |
59 | |