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> |
|
|
6 | |
|
|
7 | #define PP_CONCAT_(a, b) a ## b |
|
|
8 | #define PP_CONCAT(a, b) PP_CONCAT_(a, b) |
|
|
9 | #define PP_STRINGIFY_(a) #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 |
5 | |
15 | |
6 | extern class byteorder { |
16 | extern class byteorder { |
7 | static unsigned int e; // at least 32 bits |
17 | static unsigned int e; // at least 32 bits |
8 | public: |
18 | public: |
9 | byteorder (); |
19 | byteorder (); |
… | |
… | |
12 | static bool network () { return e == 0x11223344; }; |
22 | static bool network () { return e == 0x11223344; }; |
13 | static bool little_endian () { return e == 0x44332211; }; |
23 | static bool little_endian () { return e == 0x44332211; }; |
14 | static bool vax () { return e == 0x44332211; }; |
24 | static bool vax () { return e == 0x44332211; }; |
15 | } byteorder; |
25 | } byteorder; |
16 | |
26 | |
|
|
27 | // various utility functions |
|
|
28 | template<typename T, typename U> static inline T min (T a, U b) { return a < (T)b ? a : (T)b; } |
|
|
29 | template<typename T, typename U> static inline void min_it (T &a, U b) { a = a < (T)b ? a : (T)b; } |
|
|
30 | template<typename T, typename U> static inline T max (T a, U b) { return a > (T)b ? a : (T)b; } |
|
|
31 | template<typename T, typename U> static inline void max_it (T &a, U b) { a = a > (T)b ? a : (T)b; } |
|
|
32 | |
|
|
33 | 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; } |
|
|
34 | 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; } |
|
|
35 | |
|
|
36 | template<typename T, typename U> static inline void swap (T& a, U& b) { T t=a; a=(T)b; b=(U)t; } |
|
|
37 | |
|
|
38 | // linear interpolation |
17 | template<typename T, typename U> |
39 | template<typename T, typename U, typename P> |
18 | static inline T min (T a, U b) { return a < (T)b ? a : (T)b; } |
40 | static inline |
19 | template<typename T, typename U> |
41 | T lerp (T a, U b, P p) |
20 | static inline T max (T a, U b) { return a > (T)b ? a : (T)b; } |
42 | { |
21 | template<typename T> |
43 | return (int(a) * int(p) + int(b) * int(100 - p)) / 100; |
22 | static inline void swap (T& a, T& b) { T t=a; a=b; b=t; } |
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 |
23 | |
55 | |
24 | // in range including end |
56 | // in range including end |
25 | #define IN_RANGE_INC(val,beg,end) \ |
57 | #define IN_RANGE_INC(val,beg,end) \ |
26 | ((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)) |
27 | |
59 | |
28 | // in range excluding end |
60 | // in range excluding end |
29 | #define IN_RANGE_EXC(val,beg,end) \ |
61 | #define IN_RANGE_EXC(val,beg,end) \ |
30 | ((unsigned int)(val) - (unsigned int)(beg) < (unsigned int)(end) - (unsigned int)(beg)) |
62 | ((unsigned int)(val) - (unsigned int)(beg) < (unsigned int)(end) - (unsigned int)(beg)) |
31 | |
63 | |
|
|
64 | // makes dynamically allocated objects zero-initialised |
32 | struct zero_initialized { |
65 | struct zero_initialized { |
33 | void *operator new (size_t s); |
66 | void *operator new (size_t s); |
34 | void operator delete (void *p, size_t s); |
67 | void operator delete (void *p, size_t s); |
35 | }; |
68 | }; |
36 | |
69 | |
… | |
… | |
246 | return pos; |
279 | return pos; |
247 | } |
280 | } |
248 | void erase (iterator first, iterator last) |
281 | void erase (iterator first, iterator last) |
249 | { |
282 | { |
250 | if (last != first) { |
283 | if (last != first) { |
251 | memmove (first, last, (end ()-last)*sizeof (T)); |
284 | memmove (first, last, (end () - last) * sizeof (T)); |
252 | _last -= last - first; |
285 | _last -= last - first; |
253 | } |
286 | } |
254 | } |
287 | } |
255 | void erase (iterator pos) |
288 | void erase (iterator pos) |
256 | { |
289 | { |
257 | if (pos != end ()) { |
290 | if (pos != end ()) { |
258 | memmove (pos, pos+1, (end ()- (pos+1))*sizeof (T)); |
291 | memmove (pos, pos+1, (end () - (pos+1)) * sizeof (T)); |
259 | --_last; |
292 | --_last; |
260 | } |
293 | } |
261 | } |
294 | } |
262 | void swap (simplevec<T> &t) |
295 | void swap (simplevec<T> &t) |
263 | { |
296 | { |
… | |
… | |
381 | struct stringvec : simplevec<char *> |
414 | struct stringvec : simplevec<char *> |
382 | { |
415 | { |
383 | ~stringvec () |
416 | ~stringvec () |
384 | { |
417 | { |
385 | for (char **c = begin (); c != end (); c++) |
418 | for (char **c = begin (); c != end (); c++) |
386 | delete [] *c; |
419 | free (*c); |
387 | } |
420 | } |
388 | }; |
421 | }; |
389 | |
422 | |
|
|
423 | // return a very temporary (and never deallocated) buffer. keep small. |
|
|
424 | void *rxvt_temp_buf (int len); |
|
|
425 | |
|
|
426 | template<typename T> |
|
|
427 | inline T * |
|
|
428 | rxvt_temp_buf (int len) |
|
|
429 | { |
|
|
430 | return (T *)rxvt_temp_buf (len * sizeof (T)); |
|
|
431 | } |
|
|
432 | |
390 | #endif |
433 | #endif |
391 | |
434 | |