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; |
6 | |
8 | |
7 | #define PP_CONCAT_(a, b) a ## b |
9 | #define PP_CONCAT_(a, b) a ## b |
8 | #define PP_CONCAT(a, b) PP_CONCAT_(a, b) |
10 | #define PP_CONCAT(a, b) PP_CONCAT_(a, b) |
9 | #define PP_STRINGIFY_(a) #a |
11 | #define PP_STRINGIFY_(a) #a |
10 | #define PP_STRINGIFY(a) PP_STRINGIFY_(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 |
11 | |
42 | |
12 | extern class byteorder { |
43 | extern class byteorder { |
13 | static unsigned int e; // at least 32 bits |
44 | static unsigned int e; // at least 32 bits |
14 | public: |
45 | public: |
15 | byteorder (); |
46 | byteorder (); |
… | |
… | |
29 | 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; } |
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; } |
30 | 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; } |
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; } |
31 | |
62 | |
32 | template<typename T, typename U> static inline void swap (T& a, U& b) { T t=a; a=(T)b; b=(U)t; } |
63 | template<typename T, typename U> static inline void swap (T& a, U& b) { T t=a; a=(T)b; b=(U)t; } |
33 | |
64 | |
|
|
65 | template<typename T> static inline T squared_diff (T a, T b) { return (a-b)*(a-b); } |
|
|
66 | |
34 | // linear interpolation |
67 | // linear interpolation |
35 | template<typename T, typename U, typename P> |
68 | template<typename T, typename U, typename P> |
36 | static inline |
69 | static inline |
37 | T lerp (T a, U b, P p) |
70 | T lerp (T a, U b, P p) |
38 | { |
71 | { |
39 | return (int(a) * int(p) + int(b) * int(100 - p)) / 100; |
72 | return (long(a) * long(100 - p) + long(b) * long(p) + 50) / 100; |
40 | } |
73 | } |
|
|
74 | |
|
|
75 | template <typename I, typename T> |
|
|
76 | I find (I first, I last, const T& value) |
|
|
77 | { |
|
|
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 | |
|
|
87 | template<typename T> |
|
|
88 | static inline T * |
|
|
89 | rxvt_temp_buf (int len) |
|
|
90 | { |
|
|
91 | return (T *)rxvt_temp_buf (len * sizeof (T)); |
|
|
92 | } |
|
|
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 |
41 | |
103 | |
42 | // in range including end |
104 | // in range including end |
43 | #define IN_RANGE_INC(val,beg,end) \ |
105 | #define IN_RANGE_INC(val,beg,end) \ |
44 | ((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)) |
45 | |
107 | |
46 | // in range excluding end |
108 | // in range excluding end |
47 | #define IN_RANGE_EXC(val,beg,end) \ |
109 | #define IN_RANGE_EXC(val,beg,end) \ |
48 | ((unsigned int)(val) - (unsigned int)(beg) < (unsigned int)(end) - (unsigned int)(beg)) |
110 | ((unsigned int)(val) - (unsigned int)(beg) < (unsigned int)(end) - (unsigned int)(beg)) |
49 | |
111 | |
|
|
112 | // for m >= -n, ensure remainder lies between 0..n-1 |
|
|
113 | #define MOD(m,n) (((m) + (n)) % (n)) |
|
|
114 | |
50 | // makes dynamically allocated objects zero-initialised |
115 | // makes dynamically allocated objects zero-initialised |
51 | struct zero_initialized { |
116 | struct zero_initialized |
|
|
117 | { |
52 | void *operator new (size_t s); |
118 | void *operator new (size_t s); |
53 | void operator delete (void *p, size_t s); |
119 | void operator delete (void *p, size_t s); |
54 | }; |
120 | }; |
55 | |
121 | |
56 | /* simplevec taken (and heavily modified), from: |
122 | /* simplevec taken (and heavily modified), from: |
57 | * |
123 | * |
58 | * MICO --- a free CORBA implementation |
124 | * MICO --- a free CORBA implementation |
59 | * Copyright (C) 1997-98 Kay Roemer & Arno Puder |
125 | * Copyright (C) 1997-98 Kay Roemer & Arno Puder |
60 | */ |
126 | */ |
61 | template<class T> |
127 | template<class T> |
62 | struct simplevec { |
128 | struct simplevec |
|
|
129 | { |
63 | typedef T* iterator; |
130 | typedef T* iterator; |
64 | typedef const T* const_iterator; |
131 | typedef const T* const_iterator; |
65 | typedef unsigned long size_type; |
132 | typedef unsigned long size_type; |
66 | |
133 | |
67 | private: |
134 | private: |
… | |
… | |
308 | } |
375 | } |
309 | |
376 | |
310 | |
377 | |
311 | template<typename T> |
378 | template<typename T> |
312 | struct vector : simplevec<T> |
379 | struct vector : simplevec<T> |
313 | { }; |
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 | }; |
314 | |
391 | |
315 | #if 0 |
392 | #if 0 |
316 | template<typename T> |
393 | template<typename T> |
317 | struct rxvt_vec : simplevec<void *> { |
394 | struct rxvt_vec : simplevec<void *> |
|
|
395 | { |
318 | typedef T *iterator; |
396 | typedef T *iterator; |
319 | |
397 | |
320 | void push_back (T d) { simplevec<void *>::push_back ((void *)d); } |
398 | void push_back (T d) { simplevec<void *>::push_back ((void *)d); } |
321 | T pop_back () { return (T*)simplevec<void *>::pop_back (); } |
399 | T pop_back () { return (T*)simplevec<void *>::pop_back (); } |
322 | void erase (int i) { erase (begin () + i); } |
400 | void erase (int i) { erase (begin () + i); } |
… | |
… | |
326 | T &operator [] (int i) { return * (T *) (& ((* (simplevec<void *> *)this)[i])); } |
404 | T &operator [] (int i) { return * (T *) (& ((* (simplevec<void *> *)this)[i])); } |
327 | 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])); } |
328 | }; |
406 | }; |
329 | #endif |
407 | #endif |
330 | |
408 | |
331 | template <typename I, typename T> |
|
|
332 | I find (I first, I last, const T& value) |
|
|
333 | { |
|
|
334 | while (first != last && *first != value) |
|
|
335 | ++first; |
|
|
336 | |
|
|
337 | return first; |
|
|
338 | } |
|
|
339 | |
|
|
340 | template<typename T> |
409 | template<typename T> |
341 | struct auto_ptr { |
410 | struct auto_ptr |
|
|
411 | { |
342 | T *p; |
412 | T *p; |
343 | |
413 | |
344 | auto_ptr () : p (0) { } |
414 | auto_ptr () : p (0) { } |
345 | auto_ptr (T *a) : p (a) { } |
415 | auto_ptr (T *a) : p (a) { } |
346 | |
416 | |
… | |
… | |
395 | } |
465 | } |
396 | }; |
466 | }; |
397 | |
467 | |
398 | typedef auto_ptr<char> auto_str; |
468 | typedef auto_ptr<char> auto_str; |
399 | |
469 | |
400 | struct stringvec : simplevec<char *> |
|
|
401 | { |
|
|
402 | ~stringvec () |
|
|
403 | { |
|
|
404 | for (char **c = begin (); c != end (); c++) |
|
|
405 | free (*c); |
|
|
406 | } |
|
|
407 | }; |
|
|
408 | |
|
|
409 | // return a very temporary (and never deallocated) buffer. keep small. |
|
|
410 | void *rxvt_temp_buf (int len); |
|
|
411 | |
|
|
412 | template<typename T> |
|
|
413 | inline T * |
|
|
414 | rxvt_temp_buf (int len) |
|
|
415 | { |
|
|
416 | return (T *)rxvt_temp_buf (len * sizeof (T)); |
|
|
417 | } |
|
|
418 | |
|
|
419 | #endif |
470 | #endif |
420 | |
471 | |