| 1 | #ifndef RXVT_UTIL_H |
1 | #ifndef RXVT_UTIL_H |
| 2 | #define RXVT_UTIL_H |
2 | #define RXVT_UTIL_H |
| 3 | |
3 | |
|
|
4 | #include <cstdlib> |
| 4 | #include <cstring> |
5 | #include <cstring> |
| 5 | |
6 | |
| 6 | #define PP_CONCAT_(a, b) a ## b |
7 | #define PP_CONCAT_(a, b) a ## b |
| 7 | #define PP_CONCAT(a, b) PP_CONCAT_(a, b) |
8 | #define PP_CONCAT(a, b) PP_CONCAT_(a, b) |
| 8 | #define PP_STRINGIFY_(a) #a |
9 | #define PP_STRINGIFY_(a) #a |
| 9 | #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 | |
|
|
15 | #ifndef __attribute__ |
|
|
16 | # if __GNUC__ |
|
|
17 | # if (__GNUC__ == 2 && __GNUC_MINOR__ < 5) || (__GNUC__ < 2) |
|
|
18 | # define __attribute__(x) |
|
|
19 | # endif |
|
|
20 | # endif |
|
|
21 | # define __attribute__(x) |
|
|
22 | #endif |
|
|
23 | |
|
|
24 | #define NORETURN __attribute__ ((noreturn)) |
|
|
25 | #define UNUSED __attribute__ ((unused)) |
|
|
26 | #define CONST __attribute__ ((const)) |
|
|
27 | |
|
|
28 | // increases code size unless -fno-enforce-eh-specs |
|
|
29 | #if __GNUC__ |
|
|
30 | # define NOTHROW |
|
|
31 | # define THROW(x) |
|
|
32 | #else |
|
|
33 | # define NOTHROW throw() |
|
|
34 | # define THROW(x) throw x |
|
|
35 | #endif |
| 10 | |
36 | |
| 11 | extern class byteorder { |
37 | extern class byteorder { |
| 12 | static unsigned int e; // at least 32 bits |
38 | static unsigned int e; // at least 32 bits |
| 13 | public: |
39 | public: |
| 14 | byteorder (); |
40 | byteorder (); |
| … | |
… | |
| 27 | |
53 | |
| 28 | template<typename T, typename U, typename V> static inline T clamp (T v, U a, V b) { return v < (T)a ? a : v >(T)b ? b : v; } |
54 | template<typename T, typename U, typename V> static inline T clamp (T v, U a, V b) { return v < (T)a ? a : v >(T)b ? b : v; } |
| 29 | template<typename T, typename U, typename V> static inline void clamp_it (T &v, U a, V b) { v = v < (T)a ? a : v >(T)b ? b : v; } |
55 | template<typename T, typename U, typename V> static inline void clamp_it (T &v, U a, V b) { v = v < (T)a ? a : v >(T)b ? b : v; } |
| 30 | |
56 | |
| 31 | template<typename T, typename U> static inline void swap (T& a, U& b) { T t=a; a=(T)b; b=(U)t; } |
57 | template<typename T, typename U> static inline void swap (T& a, U& b) { T t=a; a=(T)b; b=(U)t; } |
|
|
58 | |
|
|
59 | template<typename T> static inline T squared_diff (T a, T b) { return (a-b)*(a-b); } |
|
|
60 | |
|
|
61 | // linear interpolation |
|
|
62 | template<typename T, typename U, typename P> |
|
|
63 | static inline |
|
|
64 | T lerp (T a, U b, P p) |
|
|
65 | { |
|
|
66 | return (int(a) * int(p) + int(b) * int(100 - p)) / 100; |
|
|
67 | } |
|
|
68 | |
|
|
69 | // some bit functions, xft fuck me plenty |
|
|
70 | #if HAVE_GCC_BUILTINS |
|
|
71 | static inline int ctz (unsigned int x) CONST { return __builtin_ctz (x); } |
|
|
72 | static inline int popcount (unsigned int x) CONST { return __builtin_popcount (x); } |
|
|
73 | #else |
|
|
74 | // count trailing zero bits and count # of one bits |
|
|
75 | int ctz (unsigned int x) CONST; |
|
|
76 | int popcount (unsigned int x) CONST; |
|
|
77 | #endif |
| 32 | |
78 | |
| 33 | // in range including end |
79 | // in range including end |
| 34 | #define IN_RANGE_INC(val,beg,end) \ |
80 | #define IN_RANGE_INC(val,beg,end) \ |
| 35 | ((unsigned int)(val) - (unsigned int)(beg) <= (unsigned int)(end) - (unsigned int)(beg)) |
81 | ((unsigned int)(val) - (unsigned int)(beg) <= (unsigned int)(end) - (unsigned int)(beg)) |
| 36 | |
82 | |
| … | |
… | |
| 256 | return pos; |
302 | return pos; |
| 257 | } |
303 | } |
| 258 | void erase (iterator first, iterator last) |
304 | void erase (iterator first, iterator last) |
| 259 | { |
305 | { |
| 260 | if (last != first) { |
306 | if (last != first) { |
| 261 | memmove (first, last, (end ()-last)*sizeof (T)); |
307 | memmove (first, last, (end () - last) * sizeof (T)); |
| 262 | _last -= last - first; |
308 | _last -= last - first; |
| 263 | } |
309 | } |
| 264 | } |
310 | } |
| 265 | void erase (iterator pos) |
311 | void erase (iterator pos) |
| 266 | { |
312 | { |
| 267 | if (pos != end ()) { |
313 | if (pos != end ()) { |
| 268 | memmove (pos, pos+1, (end ()- (pos+1))*sizeof (T)); |
314 | memmove (pos, pos+1, (end () - (pos+1)) * sizeof (T)); |
| 269 | --_last; |
315 | --_last; |
| 270 | } |
316 | } |
| 271 | } |
317 | } |
| 272 | void swap (simplevec<T> &t) |
318 | void swap (simplevec<T> &t) |
| 273 | { |
319 | { |
| … | |
… | |
| 391 | struct stringvec : simplevec<char *> |
437 | struct stringvec : simplevec<char *> |
| 392 | { |
438 | { |
| 393 | ~stringvec () |
439 | ~stringvec () |
| 394 | { |
440 | { |
| 395 | for (char **c = begin (); c != end (); c++) |
441 | for (char **c = begin (); c != end (); c++) |
| 396 | delete [] *c; |
442 | free (*c); |
| 397 | } |
443 | } |
| 398 | }; |
444 | }; |
| 399 | |
445 | |
|
|
446 | // return a very temporary (and never deallocated) buffer. keep small. |
|
|
447 | void *rxvt_temp_buf (int len); |
|
|
448 | |
|
|
449 | template<typename T> |
|
|
450 | static inline T * |
|
|
451 | rxvt_temp_buf (int len) |
|
|
452 | { |
|
|
453 | return (T *)rxvt_temp_buf (len * sizeof (T)); |
|
|
454 | } |
|
|
455 | |
| 400 | #endif |
456 | #endif |
| 401 | |
457 | |
