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 <cstdlib> |
5 | #include <cstring> |
5 | #include <cstring> |
|
|
6 | |
|
|
7 | using namespace std; |
|
|
8 | |
|
|
9 | #define ARRAY_LENGTH(v) (sizeof (v) / sizeof ((v)[0])) |
6 | |
10 | |
7 | #define PP_CONCAT_(a, b) a ## b |
11 | #define PP_CONCAT_(a, b) a ## b |
8 | #define PP_CONCAT(a, b) PP_CONCAT_(a, b) |
12 | #define PP_CONCAT(a, b) PP_CONCAT_(a, b) |
9 | #define PP_STRINGIFY_(a) #a |
13 | #define PP_STRINGIFY_(a) #a |
10 | #define PP_STRINGIFY(a) PP_STRINGIFY_(a) |
14 | #define PP_STRINGIFY(a) PP_STRINGIFY_(a) |
11 | |
15 | |
12 | // actually, some gcc-3.x versions work, too |
16 | #define HAVE_GCC_BUILTINS (__GNUC__ >= 4 || (__GNUC__ == 3 && __GNUC_MINOR__ == 4)) |
13 | #define HAVE_GCC_BUILTINS (__GNUC__ >= 4) |
17 | |
14 | #define HAVE_GCC_BUILTINS 0 |
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 |
15 | |
44 | |
16 | extern class byteorder { |
45 | extern class byteorder { |
17 | static unsigned int e; // at least 32 bits |
46 | static unsigned int e; // at least 32 bits |
18 | public: |
47 | public: |
19 | byteorder (); |
48 | byteorder (); |
… | |
… | |
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; } |
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; } |
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; } |
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; } |
35 | |
64 | |
36 | 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; } |
37 | |
66 | |
|
|
67 | template<typename T> static inline T squared_diff (T a, T b) { return (a-b)*(a-b); } |
|
|
68 | |
38 | // linear interpolation |
69 | // linear interpolation |
39 | template<typename T, typename U, typename P> |
70 | template<typename T, typename U, typename P> |
40 | static inline |
71 | static inline |
41 | T lerp (T a, U b, P p) |
72 | T lerp (T a, U b, P p) |
42 | { |
73 | { |
43 | return (int(a) * int(p) + int(b) * int(100 - p)) / 100; |
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)); |
44 | } |
94 | } |
45 | |
95 | |
46 | // some bit functions, xft fuck me plenty |
96 | // some bit functions, xft fuck me plenty |
47 | #if HAVE_GCC_BUILTINS |
97 | #if HAVE_GCC_BUILTINS |
|
|
98 | /* netbsd stupidly defines popcount itself and puts it into string.h */ |
48 | static inline int ctz (unsigned int x) { return __builtin_ctz (x); } |
99 | static inline int rxvt_ctz (unsigned int x) { return __builtin_ctz (x); } |
49 | static inline int popcount (unsigned int x) { return __builtin_popcount (x); } |
100 | static inline int rxvt_popcount (unsigned int x) { return __builtin_popcount (x); } |
50 | #else |
101 | #else |
51 | // count trailing zero bits and count # of one bits |
102 | // count trailing zero bits and count # of one bits |
52 | int ctz (unsigned int x); |
103 | int rxvt_ctz (unsigned int x) CONST; |
53 | int popcount (unsigned int x); |
104 | int rxvt_popcount (unsigned int x) CONST; |
54 | #endif |
105 | #endif |
55 | |
106 | |
56 | // in range including end |
107 | // in range including end |
57 | #define IN_RANGE_INC(val,beg,end) \ |
108 | #define IN_RANGE_INC(val,beg,end) \ |
58 | ((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)) |
59 | |
110 | |
60 | // in range excluding end |
111 | // in range excluding end |
61 | #define IN_RANGE_EXC(val,beg,end) \ |
112 | #define IN_RANGE_EXC(val,beg,end) \ |
62 | ((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)) |
63 | |
114 | |
|
|
115 | // for m >= -n, ensure remainder lies between 0..n-1 |
|
|
116 | #define MOD(m,n) (((m) + (n)) % (n)) |
|
|
117 | |
64 | // makes dynamically allocated objects zero-initialised |
118 | // makes dynamically allocated objects zero-initialised |
65 | struct zero_initialized { |
119 | struct zero_initialized |
|
|
120 | { |
66 | void *operator new (size_t s); |
121 | void *operator new (size_t s); |
67 | void operator delete (void *p, size_t s); |
122 | void operator delete (void *p, size_t s); |
68 | }; |
123 | }; |
69 | |
124 | |
70 | /* simplevec taken (and heavily modified), from: |
125 | /* simplevec taken (and heavily modified), from: |
71 | * |
126 | * |
72 | * MICO --- a free CORBA implementation |
127 | * MICO --- a free CORBA implementation |
73 | * Copyright (C) 1997-98 Kay Roemer & Arno Puder |
128 | * Copyright (C) 1997-98 Kay Roemer & Arno Puder |
74 | */ |
129 | */ |
75 | template<class T> |
130 | template<class T> |
76 | struct simplevec { |
131 | struct simplevec |
|
|
132 | { |
77 | typedef T* iterator; |
133 | typedef T* iterator; |
78 | typedef const T* const_iterator; |
134 | typedef const T* const_iterator; |
79 | typedef unsigned long size_type; |
135 | typedef unsigned long size_type; |
80 | |
136 | |
81 | private: |
137 | private: |
… | |
… | |
322 | } |
378 | } |
323 | |
379 | |
324 | |
380 | |
325 | template<typename T> |
381 | template<typename T> |
326 | struct vector : simplevec<T> |
382 | struct vector : simplevec<T> |
327 | { }; |
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 | }; |
328 | |
394 | |
329 | #if 0 |
395 | #if 0 |
330 | template<typename T> |
396 | template<typename T> |
331 | struct rxvt_vec : simplevec<void *> { |
397 | struct rxvt_vec : simplevec<void *> |
|
|
398 | { |
332 | typedef T *iterator; |
399 | typedef T *iterator; |
333 | |
400 | |
334 | void push_back (T d) { simplevec<void *>::push_back ((void *)d); } |
401 | void push_back (T d) { simplevec<void *>::push_back ((void *)d); } |
335 | T pop_back () { return (T*)simplevec<void *>::pop_back (); } |
402 | T pop_back () { return (T*)simplevec<void *>::pop_back (); } |
336 | void erase (int i) { erase (begin () + i); } |
403 | void erase (int i) { erase (begin () + i); } |
… | |
… | |
340 | T &operator [] (int i) { return * (T *) (& ((* (simplevec<void *> *)this)[i])); } |
407 | T &operator [] (int i) { return * (T *) (& ((* (simplevec<void *> *)this)[i])); } |
341 | 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])); } |
342 | }; |
409 | }; |
343 | #endif |
410 | #endif |
344 | |
411 | |
345 | template <typename I, typename T> |
|
|
346 | I find (I first, I last, const T& value) |
|
|
347 | { |
|
|
348 | while (first != last && *first != value) |
|
|
349 | ++first; |
|
|
350 | |
|
|
351 | return first; |
|
|
352 | } |
|
|
353 | |
|
|
354 | template<typename T> |
412 | template<typename T> |
355 | struct auto_ptr { |
413 | struct auto_ptr |
|
|
414 | { |
356 | T *p; |
415 | T *p; |
357 | |
416 | |
358 | auto_ptr () : p (0) { } |
417 | auto_ptr () : p (0) { } |
359 | auto_ptr (T *a) : p (a) { } |
418 | auto_ptr (T *a) : p (a) { } |
360 | |
419 | |
… | |
… | |
409 | } |
468 | } |
410 | }; |
469 | }; |
411 | |
470 | |
412 | typedef auto_ptr<char> auto_str; |
471 | typedef auto_ptr<char> auto_str; |
413 | |
472 | |
414 | struct stringvec : simplevec<char *> |
|
|
415 | { |
|
|
416 | ~stringvec () |
|
|
417 | { |
|
|
418 | for (char **c = begin (); c != end (); c++) |
|
|
419 | free (*c); |
|
|
420 | } |
|
|
421 | }; |
|
|
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 | |
|
|
433 | #endif |
473 | #endif |
434 | |
474 | |