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 | using namespace std; |
|
|
8 | |
|
|
9 | #define ARRAY_LENGTH(v) (sizeof (v) / sizeof ((v)[0])) |
5 | |
10 | |
6 | #define PP_CONCAT_(a, b) a ## b |
11 | #define PP_CONCAT_(a, b) a ## b |
7 | #define PP_CONCAT(a, b) PP_CONCAT_(a, b) |
12 | #define PP_CONCAT(a, b) PP_CONCAT_(a, b) |
8 | #define PP_STRINGIFY_(a) #a |
13 | #define PP_STRINGIFY_(a) #a |
9 | #define PP_STRINGIFY(a) PP_STRINGIFY_(a) |
14 | #define PP_STRINGIFY(a) PP_STRINGIFY_(a) |
|
|
15 | |
|
|
16 | #define HAVE_GCC_BUILTINS (__GNUC__ >= 4 || (__GNUC__ == 3 && __GNUC_MINOR__ == 4)) |
|
|
17 | |
|
|
18 | #if __GNUC__ >= 4 |
|
|
19 | # define rxvt_attribute(x) __attribute__(x) |
|
|
20 | # define expect(expr,value) __builtin_expect ((expr),(value)) |
|
|
21 | #else |
|
|
22 | # define rxvt_attribute(x) |
|
|
23 | # define expect(expr,value) (expr) |
|
|
24 | #endif |
|
|
25 | |
|
|
26 | // put into ifs if you are very sure that the expression |
|
|
27 | // is mostly true or mostly false. note that these return |
|
|
28 | // booleans, not the expression. |
|
|
29 | #define expect_false(expr) expect ((expr) != 0, 0) |
|
|
30 | #define expect_true(expr) expect ((expr) != 0, 1) |
|
|
31 | |
|
|
32 | #define NORETURN rxvt_attribute ((noreturn)) |
|
|
33 | #define UNUSED rxvt_attribute ((unused)) |
|
|
34 | #define CONST rxvt_attribute ((const)) |
|
|
35 | |
|
|
36 | // increases code size unless -fno-enforce-eh-specs |
|
|
37 | #if __GNUC__ |
|
|
38 | # define NOTHROW |
|
|
39 | # define THROW(x) |
|
|
40 | #else |
|
|
41 | # define NOTHROW throw() |
|
|
42 | # define THROW(x) throw x |
|
|
43 | #endif |
10 | |
44 | |
11 | extern class byteorder { |
45 | extern class byteorder { |
12 | static unsigned int e; // at least 32 bits |
46 | static unsigned int e; // at least 32 bits |
13 | public: |
47 | public: |
14 | byteorder (); |
48 | byteorder (); |
… | |
… | |
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; } |
62 | 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; } |
63 | 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 | |
64 | |
31 | template<typename T, typename U> static inline void swap (T& a, U& b) { T t=a; a=(T)b; b=(U)t; } |
65 | template<typename T, typename U> static inline void swap (T& a, U& b) { T t=a; a=(T)b; b=(U)t; } |
32 | |
66 | |
|
|
67 | template<typename T> static inline T squared_diff (T a, T b) { return (a-b)*(a-b); } |
|
|
68 | |
|
|
69 | // linear interpolation |
|
|
70 | template<typename T, typename U, typename P> |
|
|
71 | static inline |
|
|
72 | T lerp (T a, U b, P p) |
|
|
73 | { |
|
|
74 | return (long(a) * long(100 - p) + long(b) * long(p) + 50) / 100; |
|
|
75 | } |
|
|
76 | |
|
|
77 | template <typename I, typename T> |
|
|
78 | I find (I first, I last, const T& value) |
|
|
79 | { |
|
|
80 | while (first != last && *first != value) |
|
|
81 | ++first; |
|
|
82 | |
|
|
83 | return first; |
|
|
84 | } |
|
|
85 | |
|
|
86 | // return a very temporary (and never deallocated) buffer. keep small. |
|
|
87 | void *rxvt_temp_buf (int len); |
|
|
88 | |
|
|
89 | template<typename T> |
|
|
90 | static inline T * |
|
|
91 | rxvt_temp_buf (int len) |
|
|
92 | { |
|
|
93 | return (T *)rxvt_temp_buf (len * sizeof (T)); |
|
|
94 | } |
|
|
95 | |
|
|
96 | // some bit functions, xft fuck me plenty |
|
|
97 | #if HAVE_GCC_BUILTINS |
|
|
98 | /* netbsd stupidly defines popcount itself and puts it into string.h */ |
|
|
99 | static inline int rxvt_ctz (unsigned int x) { return __builtin_ctz (x); } |
|
|
100 | static inline int rxvt_popcount (unsigned int x) { return __builtin_popcount (x); } |
|
|
101 | #else |
|
|
102 | // count trailing zero bits and count # of one bits |
|
|
103 | int rxvt_ctz (unsigned int x) CONST; |
|
|
104 | int rxvt_popcount (unsigned int x) CONST; |
|
|
105 | #endif |
|
|
106 | |
33 | // in range including end |
107 | // in range including end |
34 | #define IN_RANGE_INC(val,beg,end) \ |
108 | #define IN_RANGE_INC(val,beg,end) \ |
35 | ((unsigned int)(val) - (unsigned int)(beg) <= (unsigned int)(end) - (unsigned int)(beg)) |
109 | ((unsigned int)(val) - (unsigned int)(beg) <= (unsigned int)(end) - (unsigned int)(beg)) |
36 | |
110 | |
37 | // in range excluding end |
111 | // in range excluding end |
38 | #define IN_RANGE_EXC(val,beg,end) \ |
112 | #define IN_RANGE_EXC(val,beg,end) \ |
39 | ((unsigned int)(val) - (unsigned int)(beg) < (unsigned int)(end) - (unsigned int)(beg)) |
113 | ((unsigned int)(val) - (unsigned int)(beg) < (unsigned int)(end) - (unsigned int)(beg)) |
40 | |
114 | |
|
|
115 | // for m >= -n, ensure remainder lies between 0..n-1 |
|
|
116 | #define MOD(m,n) (((m) + (n)) % (n)) |
|
|
117 | |
41 | // makes dynamically allocated objects zero-initialised |
118 | // makes dynamically allocated objects zero-initialised |
42 | struct zero_initialized { |
119 | struct zero_initialized |
|
|
120 | { |
43 | void *operator new (size_t s); |
121 | void *operator new (size_t s); |
44 | void operator delete (void *p, size_t s); |
122 | void operator delete (void *p, size_t s); |
45 | }; |
123 | }; |
46 | |
124 | |
47 | /* simplevec taken (and heavily modified), from: |
125 | /* simplevec taken (and heavily modified), from: |
48 | * |
126 | * |
49 | * MICO --- a free CORBA implementation |
127 | * MICO --- a free CORBA implementation |
50 | * Copyright (C) 1997-98 Kay Roemer & Arno Puder |
128 | * Copyright (C) 1997-98 Kay Roemer & Arno Puder |
51 | */ |
129 | */ |
52 | template<class T> |
130 | template<class T> |
53 | struct simplevec { |
131 | struct simplevec |
|
|
132 | { |
54 | typedef T* iterator; |
133 | typedef T* iterator; |
55 | typedef const T* const_iterator; |
134 | typedef const T* const_iterator; |
56 | typedef unsigned long size_type; |
135 | typedef unsigned long size_type; |
57 | |
136 | |
58 | private: |
137 | private: |
… | |
… | |
256 | return pos; |
335 | return pos; |
257 | } |
336 | } |
258 | void erase (iterator first, iterator last) |
337 | void erase (iterator first, iterator last) |
259 | { |
338 | { |
260 | if (last != first) { |
339 | if (last != first) { |
261 | memmove (first, last, (end ()-last)*sizeof (T)); |
340 | memmove (first, last, (end () - last) * sizeof (T)); |
262 | _last -= last - first; |
341 | _last -= last - first; |
263 | } |
342 | } |
264 | } |
343 | } |
265 | void erase (iterator pos) |
344 | void erase (iterator pos) |
266 | { |
345 | { |
267 | if (pos != end ()) { |
346 | if (pos != end ()) { |
268 | memmove (pos, pos+1, (end ()- (pos+1))*sizeof (T)); |
347 | memmove (pos, pos+1, (end () - (pos+1)) * sizeof (T)); |
269 | --_last; |
348 | --_last; |
270 | } |
349 | } |
271 | } |
350 | } |
272 | void swap (simplevec<T> &t) |
351 | void swap (simplevec<T> &t) |
273 | { |
352 | { |
… | |
… | |
299 | } |
378 | } |
300 | |
379 | |
301 | |
380 | |
302 | template<typename T> |
381 | template<typename T> |
303 | struct vector : simplevec<T> |
382 | struct vector : simplevec<T> |
304 | { }; |
383 | { |
|
|
384 | }; |
|
|
385 | |
|
|
386 | struct stringvec : simplevec<char *> |
|
|
387 | { |
|
|
388 | ~stringvec () |
|
|
389 | { |
|
|
390 | for (char **c = begin (); c != end (); c++) |
|
|
391 | free (*c); |
|
|
392 | } |
|
|
393 | }; |
305 | |
394 | |
306 | #if 0 |
395 | #if 0 |
307 | template<typename T> |
396 | template<typename T> |
308 | struct rxvt_vec : simplevec<void *> { |
397 | struct rxvt_vec : simplevec<void *> |
|
|
398 | { |
309 | typedef T *iterator; |
399 | typedef T *iterator; |
310 | |
400 | |
311 | void push_back (T d) { simplevec<void *>::push_back ((void *)d); } |
401 | void push_back (T d) { simplevec<void *>::push_back ((void *)d); } |
312 | T pop_back () { return (T*)simplevec<void *>::pop_back (); } |
402 | T pop_back () { return (T*)simplevec<void *>::pop_back (); } |
313 | void erase (int i) { erase (begin () + i); } |
403 | void erase (int i) { erase (begin () + i); } |
… | |
… | |
317 | T &operator [] (int i) { return * (T *) (& ((* (simplevec<void *> *)this)[i])); } |
407 | T &operator [] (int i) { return * (T *) (& ((* (simplevec<void *> *)this)[i])); } |
318 | const T &operator [] (int i) const { return * (const T *) (& ((* (const simplevec<void *> *)this)[i])); } |
408 | const T &operator [] (int i) const { return * (const T *) (& ((* (const simplevec<void *> *)this)[i])); } |
319 | }; |
409 | }; |
320 | #endif |
410 | #endif |
321 | |
411 | |
322 | template <typename I, typename T> |
|
|
323 | I find (I first, I last, const T& value) |
|
|
324 | { |
|
|
325 | while (first != last && *first != value) |
|
|
326 | ++first; |
|
|
327 | |
|
|
328 | return first; |
|
|
329 | } |
|
|
330 | |
|
|
331 | template<typename T> |
412 | template<typename T> |
332 | struct auto_ptr { |
413 | struct auto_ptr |
|
|
414 | { |
333 | T *p; |
415 | T *p; |
334 | |
416 | |
335 | auto_ptr () : p (0) { } |
417 | auto_ptr () : p (0) { } |
336 | auto_ptr (T *a) : p (a) { } |
418 | auto_ptr (T *a) : p (a) { } |
337 | |
419 | |
… | |
… | |
386 | } |
468 | } |
387 | }; |
469 | }; |
388 | |
470 | |
389 | typedef auto_ptr<char> auto_str; |
471 | typedef auto_ptr<char> auto_str; |
390 | |
472 | |
391 | struct stringvec : simplevec<char *> |
|
|
392 | { |
|
|
393 | ~stringvec () |
|
|
394 | { |
|
|
395 | for (char **c = begin (); c != end (); c++) |
|
|
396 | delete [] *c; |
|
|
397 | } |
|
|
398 | }; |
|
|
399 | |
|
|
400 | #endif |
473 | #endif |
401 | |
474 | |