| … | |
… | |
| 44 | template<typename T, typename U> static inline T min (T a, U b) { return (U)a < b ? (U)a : b; } |
44 | template<typename T, typename U> static inline T min (T a, U b) { return (U)a < b ? (U)a : b; } |
| 45 | template<typename T, typename U> static inline T max (T a, U b) { return (U)a > b ? (U)a : b; } |
45 | template<typename T, typename U> static inline T max (T a, U b) { return (U)a > b ? (U)a : b; } |
| 46 | template<typename T, typename U, typename V> static inline T clamp (T v, U a, V b) { return v < (T)a ? (T)a : v >(T)b ? (T)b : v; } |
46 | template<typename T, typename U, typename V> static inline T clamp (T v, U a, V b) { return v < (T)a ? (T)a : v >(T)b ? (T)b : v; } |
| 47 | |
47 | |
| 48 | template<typename T, typename U> static inline void swap (T& a, U& b) { T t=a; a=(T)b; b=(U)t; } |
48 | template<typename T, typename U> static inline void swap (T& a, U& b) { T t=a; a=(T)b; b=(U)t; } |
|
|
49 | |
|
|
50 | // lots of stuff taken from FXT |
|
|
51 | |
|
|
52 | /* Rotate right. This is used in various places for checksumming */ |
|
|
53 | //TODO: that sucks, use a better checksum algo |
|
|
54 | static inline uint32_t |
|
|
55 | rotate_right (uint32_t c, uint32_t count = 1) |
|
|
56 | { |
|
|
57 | return (c << (32 - count)) | (c >> count); |
|
|
58 | } |
|
|
59 | |
|
|
60 | static inline uint32_t |
|
|
61 | rotate_left (uint32_t c, uint32_t count = 1) |
|
|
62 | { |
|
|
63 | return (c >> (32 - count)) | (c << count); |
|
|
64 | } |
|
|
65 | |
|
|
66 | // Return abs(a-b) |
|
|
67 | // Both a and b must not have the most significant bit set |
|
|
68 | static inline uint32_t |
|
|
69 | upos_abs_diff (uint32_t a, uint32_t b) |
|
|
70 | { |
|
|
71 | long d1 = b - a; |
|
|
72 | long d2 = (d1 & (d1 >> 31)) << 1; |
|
|
73 | |
|
|
74 | return d1 - d2; // == (b - d) - (a + d); |
|
|
75 | } |
|
|
76 | |
|
|
77 | // Both a and b must not have the most significant bit set |
|
|
78 | static inline uint32_t |
|
|
79 | upos_min (uint32_t a, uint32_t b) |
|
|
80 | { |
|
|
81 | int32_t d = b - a; |
|
|
82 | d &= d >> 31; |
|
|
83 | return a + d; |
|
|
84 | } |
|
|
85 | |
|
|
86 | // Both a and b must not have the most significant bit set |
|
|
87 | static inline uint32_t |
|
|
88 | upos_max (uint32_t a, uint32_t b) |
|
|
89 | { |
|
|
90 | int32_t d = b - a; |
|
|
91 | d &= d >> 31; |
|
|
92 | return b - d; |
|
|
93 | } |
| 49 | |
94 | |
| 50 | // this is much faster than crossfires original algorithm |
95 | // this is much faster than crossfires original algorithm |
| 51 | // on modern cpus |
96 | // on modern cpus |
| 52 | inline int |
97 | inline int |
| 53 | isqrt (int n) |
98 | isqrt (int n) |
