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 | #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 |
5 | |
34 | |
6 | extern class byteorder { |
35 | extern class byteorder { |
7 | static unsigned int e; // at least 32 bits |
36 | static unsigned int e; // at least 32 bits |
8 | public: |
37 | public: |
9 | byteorder (); |
38 | byteorder (); |
… | |
… | |
12 | static bool network () { return e == 0x11223344; }; |
41 | static bool network () { return e == 0x11223344; }; |
13 | static bool little_endian () { return e == 0x44332211; }; |
42 | static bool little_endian () { return e == 0x44332211; }; |
14 | static bool vax () { return e == 0x44332211; }; |
43 | static bool vax () { return e == 0x44332211; }; |
15 | } byteorder; |
44 | } byteorder; |
16 | |
45 | |
|
|
46 | // various utility functions |
|
|
47 | template<typename T, typename U> static inline T min (T a, U b) { return 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; } |
|
|
49 | template<typename T, typename U> static inline T max (T a, U b) { return 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; } |
|
|
51 | |
|
|
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; } |
|
|
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; } |
|
|
54 | |
|
|
55 | template<typename T, typename U> static inline void swap (T& a, U& b) { T t=a; a=(T)b; b=(U)t; } |
|
|
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 | |
17 | template<typename T, typename U> |
67 | template <typename I, typename T> |
18 | static inline T min (T a, U b) { return a < b ? a : (T)b; } |
68 | I find (I first, I last, const T& value) |
19 | template<typename T, typename U> |
69 | { |
20 | static inline T max (T a, U b) { return a > b ? a : (T)b; } |
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 | |
21 | template<typename T> |
79 | template<typename T> |
22 | static inline void swap (T& a, T& b) { T t=a; a=b; b=t; } |
80 | static inline T * |
|
|
81 | rxvt_temp_buf (int len) |
|
|
82 | { |
|
|
83 | return (T *)rxvt_temp_buf (len * sizeof (T)); |
|
|
84 | } |
23 | |
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 |
24 | |
95 | |
|
|
96 | // in range including end |
|
|
97 | #define IN_RANGE_INC(val,beg,end) \ |
|
|
98 | ((unsigned int)(val) - (unsigned int)(beg) <= (unsigned int)(end) - (unsigned int)(beg)) |
|
|
99 | |
|
|
100 | // in range excluding end |
|
|
101 | #define IN_RANGE_EXC(val,beg,end) \ |
|
|
102 | ((unsigned int)(val) - (unsigned int)(beg) < (unsigned int)(end) - (unsigned int)(beg)) |
|
|
103 | |
|
|
104 | // for m >= -n, ensure remainder lies between 0..n-1 |
|
|
105 | #define MOD(m,n) (((m) + (n)) % (n)) |
|
|
106 | |
|
|
107 | // makes dynamically allocated objects zero-initialised |
25 | struct zero_initialized { |
108 | struct zero_initialized { |
26 | void *operator new (size_t s); |
109 | void *operator new (size_t s); |
27 | void operator delete (void *p, size_t s); |
110 | void operator delete (void *p, size_t s); |
28 | }; |
111 | }; |
29 | |
112 | |
30 | /* simplevec taken (and heavily modified), from: |
113 | /* simplevec taken (and heavily modified), from: |
31 | * |
114 | * |
32 | * MICO --- a free CORBA implementation |
115 | * MICO --- a free CORBA implementation |
33 | * Copyright (C) 1997-98 Kay Roemer & Arno Puder |
116 | * Copyright (C) 1997-98 Kay Roemer & Arno Puder |
34 | */ |
117 | */ |
35 | template<class T> |
118 | template<class T> |
36 | struct simplevec { |
119 | struct simplevec { |
… | |
… | |
239 | return pos; |
322 | return pos; |
240 | } |
323 | } |
241 | void erase (iterator first, iterator last) |
324 | void erase (iterator first, iterator last) |
242 | { |
325 | { |
243 | if (last != first) { |
326 | if (last != first) { |
244 | memmove (first, last, (end ()-last)*sizeof (T)); |
327 | memmove (first, last, (end () - last) * sizeof (T)); |
245 | _last -= last - first; |
328 | _last -= last - first; |
246 | } |
329 | } |
247 | } |
330 | } |
248 | void erase (iterator pos) |
331 | void erase (iterator pos) |
249 | { |
332 | { |
250 | if (pos != end ()) { |
333 | if (pos != end ()) { |
251 | memmove (pos, pos+1, (end ()- (pos+1))*sizeof (T)); |
334 | memmove (pos, pos+1, (end () - (pos+1)) * sizeof (T)); |
252 | --_last; |
335 | --_last; |
253 | } |
336 | } |
254 | } |
337 | } |
255 | void swap (simplevec<T> &t) |
338 | void swap (simplevec<T> &t) |
256 | { |
339 | { |
… | |
… | |
282 | } |
365 | } |
283 | |
366 | |
284 | |
367 | |
285 | template<typename T> |
368 | template<typename T> |
286 | struct vector : simplevec<T> |
369 | struct vector : simplevec<T> |
287 | { }; |
370 | { |
|
|
371 | }; |
|
|
372 | |
|
|
373 | struct stringvec : simplevec<char *> |
|
|
374 | { |
|
|
375 | ~stringvec () |
|
|
376 | { |
|
|
377 | for (char **c = begin (); c != end (); c++) |
|
|
378 | free (*c); |
|
|
379 | } |
|
|
380 | }; |
288 | |
381 | |
289 | #if 0 |
382 | #if 0 |
290 | template<typename T> |
383 | template<typename T> |
291 | struct rxvt_vec : simplevec<void *> { |
384 | struct rxvt_vec : simplevec<void *> { |
292 | typedef T *iterator; |
385 | typedef T *iterator; |
… | |
… | |
300 | T &operator [] (int i) { return * (T *) (& ((* (simplevec<void *> *)this)[i])); } |
393 | T &operator [] (int i) { return * (T *) (& ((* (simplevec<void *> *)this)[i])); } |
301 | const T &operator [] (int i) const { return * (const T *) (& ((* (const simplevec<void *> *)this)[i])); } |
394 | const T &operator [] (int i) const { return * (const T *) (& ((* (const simplevec<void *> *)this)[i])); } |
302 | }; |
395 | }; |
303 | #endif |
396 | #endif |
304 | |
397 | |
305 | template <typename I, typename T> |
|
|
306 | I find (I first, I last, const T& value) |
|
|
307 | { |
|
|
308 | while (first != last && *first != value) |
|
|
309 | ++first; |
|
|
310 | |
|
|
311 | return first; |
|
|
312 | } |
|
|
313 | |
|
|
314 | template<typename T> |
398 | template<typename T> |
315 | struct auto_ptr { |
399 | struct auto_ptr { |
316 | T *p; |
400 | T *p; |
317 | |
401 | |
318 | auto_ptr () : p (0) { } |
402 | auto_ptr () : p (0) { } |
… | |
… | |
369 | } |
453 | } |
370 | }; |
454 | }; |
371 | |
455 | |
372 | typedef auto_ptr<char> auto_str; |
456 | typedef auto_ptr<char> auto_str; |
373 | |
457 | |
374 | struct stringvec : simplevec<char *> |
|
|
375 | { |
|
|
376 | ~stringvec () |
|
|
377 | { |
|
|
378 | for (char **c = begin (); c != end (); c++) |
|
|
379 | delete [] *c; |
|
|
380 | } |
|
|
381 | }; |
|
|
382 | |
|
|
383 | #endif |
458 | #endif |
384 | |
459 | |