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; |
5 | |
8 | |
6 | #define PP_CONCAT_(a, b) a ## b |
9 | #define PP_CONCAT_(a, b) a ## b |
7 | #define PP_CONCAT(a, b) PP_CONCAT_(a, b) |
10 | #define PP_CONCAT(a, b) PP_CONCAT_(a, b) |
8 | #define PP_STRINGIFY_(a) #a |
11 | #define PP_STRINGIFY_(a) #a |
9 | #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 | #else |
|
|
19 | # define rxvt_attribute(x) |
|
|
20 | #endif |
|
|
21 | |
|
|
22 | #define NORETURN rxvt_attribute ((noreturn)) |
|
|
23 | #define UNUSED rxvt_attribute ((unused)) |
|
|
24 | #define CONST rxvt_attribute ((const)) |
|
|
25 | |
|
|
26 | // increases code size unless -fno-enforce-eh-specs |
|
|
27 | #if __GNUC__ |
|
|
28 | # define NOTHROW |
|
|
29 | # define THROW(x) |
|
|
30 | #else |
|
|
31 | # define NOTHROW throw() |
|
|
32 | # define THROW(x) throw x |
|
|
33 | #endif |
10 | |
34 | |
11 | extern class byteorder { |
35 | extern class byteorder { |
12 | static unsigned int e; // at least 32 bits |
36 | static unsigned int e; // at least 32 bits |
13 | public: |
37 | public: |
14 | byteorder (); |
38 | byteorder (); |
… | |
… | |
17 | static bool network () { return e == 0x11223344; }; |
41 | static bool network () { return e == 0x11223344; }; |
18 | static bool little_endian () { return e == 0x44332211; }; |
42 | static bool little_endian () { return e == 0x44332211; }; |
19 | static bool vax () { return e == 0x44332211; }; |
43 | static bool vax () { return e == 0x44332211; }; |
20 | } byteorder; |
44 | } byteorder; |
21 | |
45 | |
|
|
46 | // various utility functions |
22 | template<typename T, typename U> static inline T min (T a, U b) { return a < (T)b ? a : (T)b; } |
47 | template<typename T, typename U> static inline T min (T a, U b) { return a < (T)b ? a : (T)b; } |
23 | template<typename T, typename U> static inline void min_it (T &a, U b) { a = a < (T)b ? a : (T)b; } |
48 | template<typename T, typename U> static inline void min_it (T &a, U b) { a = a < (T)b ? a : (T)b; } |
24 | template<typename T, typename U> static inline T max (T a, U b) { return a > (T)b ? a : (T)b; } |
49 | template<typename T, typename U> static inline T max (T a, U b) { return a > (T)b ? a : (T)b; } |
25 | template<typename T, typename U> static inline void max_it (T &a, U b) { a = a > (T)b ? a : (T)b; } |
50 | template<typename T, typename U> static inline void max_it (T &a, U b) { a = a > (T)b ? a : (T)b; } |
26 | |
51 | |
27 | 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; } |
52 | 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; } |
28 | 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; } |
53 | 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; } |
29 | |
54 | |
30 | template<typename T, typename U> static inline void swap (T& a, U& b) { T t=a; a=(T)b; b=(U)t; } |
55 | template<typename T, typename U> static inline void swap (T& a, U& b) { T t=a; a=(T)b; b=(U)t; } |
31 | |
56 | |
|
|
57 | template<typename T> static inline T squared_diff (T a, T b) { return (a-b)*(a-b); } |
|
|
58 | |
|
|
59 | // linear interpolation |
|
|
60 | template<typename T, typename U, typename P> |
|
|
61 | static inline |
|
|
62 | T lerp (T a, U b, P p) |
|
|
63 | { |
|
|
64 | return (long(a) * long(100 - p) + long(b) * long(p) + 50) / 100; |
|
|
65 | } |
|
|
66 | |
|
|
67 | template <typename I, typename T> |
|
|
68 | I find (I first, I last, const T& value) |
|
|
69 | { |
|
|
70 | while (first != last && *first != value) |
|
|
71 | ++first; |
|
|
72 | |
|
|
73 | return first; |
|
|
74 | } |
|
|
75 | |
|
|
76 | // return a very temporary (and never deallocated) buffer. keep small. |
|
|
77 | void *rxvt_temp_buf (int len); |
|
|
78 | |
|
|
79 | template<typename T> |
|
|
80 | static inline T * |
|
|
81 | rxvt_temp_buf (int len) |
|
|
82 | { |
|
|
83 | return (T *)rxvt_temp_buf (len * sizeof (T)); |
|
|
84 | } |
|
|
85 | |
|
|
86 | // some bit functions, xft fuck me plenty |
|
|
87 | #if HAVE_GCC_BUILTINS |
|
|
88 | static inline int ctz (unsigned int x) { return __builtin_ctz (x); } |
|
|
89 | static inline int popcount (unsigned int x) { return __builtin_popcount (x); } |
|
|
90 | #else |
|
|
91 | // count trailing zero bits and count # of one bits |
|
|
92 | int ctz (unsigned int x) CONST; |
|
|
93 | int popcount (unsigned int x) CONST; |
|
|
94 | #endif |
|
|
95 | |
32 | // in range including end |
96 | // in range including end |
33 | #define IN_RANGE_INC(val,beg,end) \ |
97 | #define IN_RANGE_INC(val,beg,end) \ |
34 | ((unsigned int)(val) - (unsigned int)(beg) <= (unsigned int)(end) - (unsigned int)(beg)) |
98 | ((unsigned int)(val) - (unsigned int)(beg) <= (unsigned int)(end) - (unsigned int)(beg)) |
35 | |
99 | |
36 | // in range excluding end |
100 | // in range excluding end |
37 | #define IN_RANGE_EXC(val,beg,end) \ |
101 | #define IN_RANGE_EXC(val,beg,end) \ |
38 | ((unsigned int)(val) - (unsigned int)(beg) < (unsigned int)(end) - (unsigned int)(beg)) |
102 | ((unsigned int)(val) - (unsigned int)(beg) < (unsigned int)(end) - (unsigned int)(beg)) |
39 | |
103 | |
|
|
104 | // makes dynamically allocated objects zero-initialised |
40 | struct zero_initialized { |
105 | struct zero_initialized { |
41 | void *operator new (size_t s); |
106 | void *operator new (size_t s); |
42 | void operator delete (void *p, size_t s); |
107 | void operator delete (void *p, size_t s); |
43 | }; |
108 | }; |
44 | |
109 | |
45 | /* simplevec taken (and heavily modified), from: |
110 | /* simplevec taken (and heavily modified), from: |
46 | * |
111 | * |
47 | * MICO --- a free CORBA implementation |
112 | * MICO --- a free CORBA implementation |
48 | * Copyright (C) 1997-98 Kay Roemer & Arno Puder |
113 | * Copyright (C) 1997-98 Kay Roemer & Arno Puder |
49 | */ |
114 | */ |
50 | template<class T> |
115 | template<class T> |
51 | struct simplevec { |
116 | struct simplevec { |
… | |
… | |
254 | return pos; |
319 | return pos; |
255 | } |
320 | } |
256 | void erase (iterator first, iterator last) |
321 | void erase (iterator first, iterator last) |
257 | { |
322 | { |
258 | if (last != first) { |
323 | if (last != first) { |
259 | memmove (first, last, (end ()-last)*sizeof (T)); |
324 | memmove (first, last, (end () - last) * sizeof (T)); |
260 | _last -= last - first; |
325 | _last -= last - first; |
261 | } |
326 | } |
262 | } |
327 | } |
263 | void erase (iterator pos) |
328 | void erase (iterator pos) |
264 | { |
329 | { |
265 | if (pos != end ()) { |
330 | if (pos != end ()) { |
266 | memmove (pos, pos+1, (end ()- (pos+1))*sizeof (T)); |
331 | memmove (pos, pos+1, (end () - (pos+1)) * sizeof (T)); |
267 | --_last; |
332 | --_last; |
268 | } |
333 | } |
269 | } |
334 | } |
270 | void swap (simplevec<T> &t) |
335 | void swap (simplevec<T> &t) |
271 | { |
336 | { |
… | |
… | |
298 | |
363 | |
299 | |
364 | |
300 | template<typename T> |
365 | template<typename T> |
301 | struct vector : simplevec<T> |
366 | struct vector : simplevec<T> |
302 | { }; |
367 | { }; |
|
|
368 | |
|
|
369 | struct stringvec : simplevec<char *> |
|
|
370 | { |
|
|
371 | ~stringvec () |
|
|
372 | { |
|
|
373 | for (char **c = begin (); c != end (); c++) |
|
|
374 | free (*c); |
|
|
375 | } |
|
|
376 | }; |
303 | |
377 | |
304 | #if 0 |
378 | #if 0 |
305 | template<typename T> |
379 | template<typename T> |
306 | struct rxvt_vec : simplevec<void *> { |
380 | struct rxvt_vec : simplevec<void *> { |
307 | typedef T *iterator; |
381 | typedef T *iterator; |
… | |
… | |
315 | T &operator [] (int i) { return * (T *) (& ((* (simplevec<void *> *)this)[i])); } |
389 | T &operator [] (int i) { return * (T *) (& ((* (simplevec<void *> *)this)[i])); } |
316 | const T &operator [] (int i) const { return * (const T *) (& ((* (const simplevec<void *> *)this)[i])); } |
390 | const T &operator [] (int i) const { return * (const T *) (& ((* (const simplevec<void *> *)this)[i])); } |
317 | }; |
391 | }; |
318 | #endif |
392 | #endif |
319 | |
393 | |
320 | template <typename I, typename T> |
|
|
321 | I find (I first, I last, const T& value) |
|
|
322 | { |
|
|
323 | while (first != last && *first != value) |
|
|
324 | ++first; |
|
|
325 | |
|
|
326 | return first; |
|
|
327 | } |
|
|
328 | |
|
|
329 | template<typename T> |
394 | template<typename T> |
330 | struct auto_ptr { |
395 | struct auto_ptr { |
331 | T *p; |
396 | T *p; |
332 | |
397 | |
333 | auto_ptr () : p (0) { } |
398 | auto_ptr () : p (0) { } |
… | |
… | |
384 | } |
449 | } |
385 | }; |
450 | }; |
386 | |
451 | |
387 | typedef auto_ptr<char> auto_str; |
452 | typedef auto_ptr<char> auto_str; |
388 | |
453 | |
389 | struct stringvec : simplevec<char *> |
|
|
390 | { |
|
|
391 | ~stringvec () |
|
|
392 | { |
|
|
393 | for (char **c = begin (); c != end (); c++) |
|
|
394 | delete [] *c; |
|
|
395 | } |
|
|
396 | }; |
|
|
397 | |
|
|
398 | #endif |
454 | #endif |
399 | |
455 | |