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 PP_CONCAT_(a, b) a ## b |
|
|
10 | #define PP_CONCAT(a, b) PP_CONCAT_(a, b) |
|
|
11 | #define PP_STRINGIFY_(a) #a |
|
|
12 | #define PP_STRINGIFY(a) PP_STRINGIFY_(a) |
|
|
13 | |
|
|
14 | #define HAVE_GCC_BUILTINS (__GNUC__ >= 4 || (__GNUC__ == 3 && __GNUC_MINOR__ == 4)) |
|
|
15 | |
|
|
16 | #if __GNUC__ >= 4 |
|
|
17 | # define rxvt_attribute(x) __attribute__(x) |
|
|
18 | # define expect(expr,value) __builtin_expect ((expr),(value)) |
|
|
19 | #else |
|
|
20 | # define rxvt_attribute(x) |
|
|
21 | # define expect(expr,value) (expr) |
|
|
22 | #endif |
|
|
23 | |
|
|
24 | // put into ifs if you are very sure that the expression |
|
|
25 | // is mostly true or mosty false. note that these return |
|
|
26 | // booleans, not the expression. |
|
|
27 | #define expect_false(expr) expect ((expr) != 0, 0) |
|
|
28 | #define expect_true(expr) expect ((expr) != 0, 1) |
|
|
29 | |
|
|
30 | #define NORETURN rxvt_attribute ((noreturn)) |
|
|
31 | #define UNUSED rxvt_attribute ((unused)) |
|
|
32 | #define CONST rxvt_attribute ((const)) |
|
|
33 | |
|
|
34 | // increases code size unless -fno-enforce-eh-specs |
|
|
35 | #if __GNUC__ |
|
|
36 | # define NOTHROW |
|
|
37 | # define THROW(x) |
|
|
38 | #else |
|
|
39 | # define NOTHROW throw() |
|
|
40 | # define THROW(x) throw x |
|
|
41 | #endif |
5 | |
42 | |
6 | extern class byteorder { |
43 | extern class byteorder { |
7 | static unsigned int e; // at least 32 bits |
44 | static unsigned int e; // at least 32 bits |
8 | public: |
45 | public: |
9 | byteorder (); |
46 | byteorder (); |
… | |
… | |
12 | static bool network () { return e == 0x11223344; }; |
49 | static bool network () { return e == 0x11223344; }; |
13 | static bool little_endian () { return e == 0x44332211; }; |
50 | static bool little_endian () { return e == 0x44332211; }; |
14 | static bool vax () { return e == 0x44332211; }; |
51 | static bool vax () { return e == 0x44332211; }; |
15 | } byteorder; |
52 | } byteorder; |
16 | |
53 | |
|
|
54 | // various utility functions |
|
|
55 | template<typename T, typename U> static inline T min (T a, U b) { return a < (T)b ? a : (T)b; } |
|
|
56 | template<typename T, typename U> static inline void min_it (T &a, U b) { a = a < (T)b ? a : (T)b; } |
|
|
57 | template<typename T, typename U> static inline T max (T a, U b) { return a > (T)b ? a : (T)b; } |
|
|
58 | template<typename T, typename U> static inline void max_it (T &a, U b) { a = a > (T)b ? a : (T)b; } |
|
|
59 | |
|
|
60 | 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; } |
|
|
61 | 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; } |
|
|
62 | |
|
|
63 | template<typename T, typename U> static inline void swap (T& a, U& b) { T t=a; a=(T)b; b=(U)t; } |
|
|
64 | |
|
|
65 | template<typename T> static inline T squared_diff (T a, T b) { return (a-b)*(a-b); } |
|
|
66 | |
|
|
67 | // linear interpolation |
|
|
68 | template<typename T, typename U, typename P> |
|
|
69 | static inline |
|
|
70 | T lerp (T a, U b, P p) |
|
|
71 | { |
|
|
72 | return (long(a) * long(100 - p) + long(b) * long(p) + 50) / 100; |
|
|
73 | } |
|
|
74 | |
17 | template<typename T, typename U> |
75 | template <typename I, typename T> |
18 | static inline T min (T a, U b) { return a < b ? a : (T)b; } |
76 | I find (I first, I last, const T& value) |
19 | template<typename T, typename U> |
77 | { |
20 | static inline T max (T a, U b) { return a > b ? a : (T)b; } |
78 | while (first != last && *first != value) |
|
|
79 | ++first; |
|
|
80 | |
|
|
81 | return first; |
|
|
82 | } |
|
|
83 | |
|
|
84 | // return a very temporary (and never deallocated) buffer. keep small. |
|
|
85 | void *rxvt_temp_buf (int len); |
|
|
86 | |
21 | template<typename T> |
87 | template<typename T> |
22 | static inline void swap (T& a, T& b) { T t=a; a=b; b=t; } |
88 | static inline T * |
|
|
89 | rxvt_temp_buf (int len) |
|
|
90 | { |
|
|
91 | return (T *)rxvt_temp_buf (len * sizeof (T)); |
|
|
92 | } |
23 | |
93 | |
|
|
94 | // some bit functions, xft fuck me plenty |
|
|
95 | #if HAVE_GCC_BUILTINS |
|
|
96 | static inline int ctz (unsigned int x) { return __builtin_ctz (x); } |
|
|
97 | static inline int popcount (unsigned int x) { return __builtin_popcount (x); } |
|
|
98 | #else |
|
|
99 | // count trailing zero bits and count # of one bits |
|
|
100 | int ctz (unsigned int x) CONST; |
|
|
101 | int popcount (unsigned int x) CONST; |
|
|
102 | #endif |
|
|
103 | |
|
|
104 | // in range including end |
24 | #define IN_RANGE(val,beg,end) \ |
105 | #define IN_RANGE_INC(val,beg,end) \ |
25 | ((unsigned int)(val) - (unsigned int)(beg) <= (unsigned int)(end) - (unsigned int)(beg)) |
106 | ((unsigned int)(val) - (unsigned int)(beg) <= (unsigned int)(end) - (unsigned int)(beg)) |
26 | |
107 | |
|
|
108 | // in range excluding end |
|
|
109 | #define IN_RANGE_EXC(val,beg,end) \ |
|
|
110 | ((unsigned int)(val) - (unsigned int)(beg) < (unsigned int)(end) - (unsigned int)(beg)) |
|
|
111 | |
|
|
112 | // for m >= -n, ensure remainder lies between 0..n-1 |
|
|
113 | #define MOD(m,n) (((m) + (n)) % (n)) |
|
|
114 | |
|
|
115 | // makes dynamically allocated objects zero-initialised |
27 | struct zero_initialized { |
116 | struct zero_initialized |
|
|
117 | { |
28 | void *operator new (size_t s); |
118 | void *operator new (size_t s); |
29 | void operator delete (void *p, size_t s); |
119 | void operator delete (void *p, size_t s); |
30 | }; |
120 | }; |
31 | |
121 | |
32 | /* simplevec taken (and heavily modified), from: |
122 | /* simplevec taken (and heavily modified), from: |
33 | * |
123 | * |
34 | * MICO --- a free CORBA implementation |
124 | * MICO --- a free CORBA implementation |
35 | * Copyright (C) 1997-98 Kay Roemer & Arno Puder |
125 | * Copyright (C) 1997-98 Kay Roemer & Arno Puder |
36 | */ |
126 | */ |
37 | template<class T> |
127 | template<class T> |
38 | struct simplevec { |
128 | struct simplevec |
|
|
129 | { |
39 | typedef T* iterator; |
130 | typedef T* iterator; |
40 | typedef const T* const_iterator; |
131 | typedef const T* const_iterator; |
41 | typedef unsigned long size_type; |
132 | typedef unsigned long size_type; |
42 | |
133 | |
43 | private: |
134 | private: |
… | |
… | |
241 | return pos; |
332 | return pos; |
242 | } |
333 | } |
243 | void erase (iterator first, iterator last) |
334 | void erase (iterator first, iterator last) |
244 | { |
335 | { |
245 | if (last != first) { |
336 | if (last != first) { |
246 | memmove (first, last, (end ()-last)*sizeof (T)); |
337 | memmove (first, last, (end () - last) * sizeof (T)); |
247 | _last -= last - first; |
338 | _last -= last - first; |
248 | } |
339 | } |
249 | } |
340 | } |
250 | void erase (iterator pos) |
341 | void erase (iterator pos) |
251 | { |
342 | { |
252 | if (pos != end ()) { |
343 | if (pos != end ()) { |
253 | memmove (pos, pos+1, (end ()- (pos+1))*sizeof (T)); |
344 | memmove (pos, pos+1, (end () - (pos+1)) * sizeof (T)); |
254 | --_last; |
345 | --_last; |
255 | } |
346 | } |
256 | } |
347 | } |
257 | void swap (simplevec<T> &t) |
348 | void swap (simplevec<T> &t) |
258 | { |
349 | { |
… | |
… | |
284 | } |
375 | } |
285 | |
376 | |
286 | |
377 | |
287 | template<typename T> |
378 | template<typename T> |
288 | struct vector : simplevec<T> |
379 | struct vector : simplevec<T> |
289 | { }; |
380 | { |
|
|
381 | }; |
|
|
382 | |
|
|
383 | struct stringvec : simplevec<char *> |
|
|
384 | { |
|
|
385 | ~stringvec () |
|
|
386 | { |
|
|
387 | for (char **c = begin (); c != end (); c++) |
|
|
388 | free (*c); |
|
|
389 | } |
|
|
390 | }; |
290 | |
391 | |
291 | #if 0 |
392 | #if 0 |
292 | template<typename T> |
393 | template<typename T> |
293 | struct rxvt_vec : simplevec<void *> { |
394 | struct rxvt_vec : simplevec<void *> |
|
|
395 | { |
294 | typedef T *iterator; |
396 | typedef T *iterator; |
295 | |
397 | |
296 | void push_back (T d) { simplevec<void *>::push_back ((void *)d); } |
398 | void push_back (T d) { simplevec<void *>::push_back ((void *)d); } |
297 | T pop_back () { return (T*)simplevec<void *>::pop_back (); } |
399 | T pop_back () { return (T*)simplevec<void *>::pop_back (); } |
298 | void erase (int i) { erase (begin () + i); } |
400 | void erase (int i) { erase (begin () + i); } |
… | |
… | |
302 | T &operator [] (int i) { return * (T *) (& ((* (simplevec<void *> *)this)[i])); } |
404 | T &operator [] (int i) { return * (T *) (& ((* (simplevec<void *> *)this)[i])); } |
303 | const T &operator [] (int i) const { return * (const T *) (& ((* (const simplevec<void *> *)this)[i])); } |
405 | const T &operator [] (int i) const { return * (const T *) (& ((* (const simplevec<void *> *)this)[i])); } |
304 | }; |
406 | }; |
305 | #endif |
407 | #endif |
306 | |
408 | |
307 | template <typename I, typename T> |
|
|
308 | I find (I first, I last, const T& value) |
|
|
309 | { |
|
|
310 | while (first != last && *first != value) |
|
|
311 | ++first; |
|
|
312 | |
|
|
313 | return first; |
|
|
314 | } |
|
|
315 | |
|
|
316 | template<typename T> |
409 | template<typename T> |
317 | struct auto_ptr { |
410 | struct auto_ptr |
|
|
411 | { |
318 | T *p; |
412 | T *p; |
319 | |
413 | |
320 | auto_ptr () : p (0) { } |
414 | auto_ptr () : p (0) { } |
321 | auto_ptr (T *a) : p (a) { } |
415 | auto_ptr (T *a) : p (a) { } |
322 | |
416 | |
… | |
… | |
371 | } |
465 | } |
372 | }; |
466 | }; |
373 | |
467 | |
374 | typedef auto_ptr<char> auto_str; |
468 | typedef auto_ptr<char> auto_str; |
375 | |
469 | |
376 | struct stringvec : simplevec<char *> |
|
|
377 | { |
|
|
378 | ~stringvec () |
|
|
379 | { |
|
|
380 | for (char **c = begin (); c != end (); c++) |
|
|
381 | delete [] *c; |
|
|
382 | } |
|
|
383 | }; |
|
|
384 | |
|
|
385 | #endif |
470 | #endif |
386 | |
471 | |