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 | #include <inttypes.h> |
6 | |
7 | |
7 | using namespace std; |
8 | using namespace std; |
|
|
9 | |
|
|
10 | #define ARRAY_LENGTH(v) (sizeof (v) / sizeof ((v)[0])) |
8 | |
11 | |
9 | #define PP_CONCAT_(a, b) a ## b |
12 | #define PP_CONCAT_(a, b) a ## b |
10 | #define PP_CONCAT(a, b) PP_CONCAT_(a, b) |
13 | #define PP_CONCAT(a, b) PP_CONCAT_(a, b) |
11 | #define PP_STRINGIFY_(a) #a |
14 | #define PP_STRINGIFY_(a) #a |
12 | #define PP_STRINGIFY(a) PP_STRINGIFY_(a) |
15 | #define PP_STRINGIFY(a) PP_STRINGIFY_(a) |
13 | |
16 | |
14 | #define HAVE_GCC_BUILTINS (__GNUC__ >= 4 || (__GNUC__ == 3 && __GNUC_MINOR__ == 4)) |
17 | #define HAVE_GCC_BUILTINS (__GNUC__ >= 4 || (__GNUC__ == 3 && __GNUC_MINOR__ == 4)) |
15 | |
18 | |
16 | #if __GNUC__ >= 4 |
19 | #if __GNUC__ >= 4 |
17 | # define rxvt_attribute(x) __attribute__(x) |
20 | # define rxvt_attribute(x) __attribute__(x) |
|
|
21 | # define expect(expr,value) __builtin_expect ((expr),(value)) |
18 | #else |
22 | #else |
19 | # define rxvt_attribute(x) |
23 | # define rxvt_attribute(x) |
|
|
24 | # define expect(expr,value) (expr) |
20 | #endif |
25 | #endif |
|
|
26 | |
|
|
27 | // put into ifs if you are very sure that the expression |
|
|
28 | // is mostly true or mostly false. note that these return |
|
|
29 | // booleans, not the expression. |
|
|
30 | #define expect_false(expr) expect ((expr) != 0, 0) |
|
|
31 | #define expect_true(expr) expect ((expr) != 0, 1) |
21 | |
32 | |
22 | #define NORETURN rxvt_attribute ((noreturn)) |
33 | #define NORETURN rxvt_attribute ((noreturn)) |
23 | #define UNUSED rxvt_attribute ((unused)) |
34 | #define UNUSED rxvt_attribute ((unused)) |
24 | #define CONST rxvt_attribute ((const)) |
35 | #define CONST rxvt_attribute ((const)) |
25 | |
36 | |
… | |
… | |
30 | #else |
41 | #else |
31 | # define NOTHROW throw() |
42 | # define NOTHROW throw() |
32 | # define THROW(x) throw x |
43 | # define THROW(x) throw x |
33 | #endif |
44 | #endif |
34 | |
45 | |
35 | extern class byteorder { |
46 | namespace byteorder { |
36 | static unsigned int e; // at least 32 bits |
47 | static unsigned char e () |
37 | public: |
48 | { |
38 | byteorder (); |
49 | const uint32_t u = 0x11223344; |
|
|
50 | return *(unsigned char *)&u; |
|
|
51 | } |
39 | |
52 | |
40 | static bool big_endian () { return e == 0x11223344; }; |
53 | static bool big_endian () { return e () == 0x11; }; |
41 | static bool network () { return e == 0x11223344; }; |
54 | static bool network () { return big_endian (); }; |
42 | static bool little_endian () { return e == 0x44332211; }; |
55 | static bool little_endian () { return e () == 0x44; }; |
43 | static bool vax () { return e == 0x44332211; }; |
56 | static bool vax () { return little_endian (); }; |
44 | } byteorder; |
57 | }; |
45 | |
58 | |
46 | // various utility functions |
59 | // various utility functions |
47 | template<typename T, typename U> static inline T min (T a, U b) { return a < (T)b ? a : (T)b; } |
60 | 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; } |
61 | 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; } |
62 | template<typename T, typename U> static inline T max (T a, U b) { return a > (T)b ? a : (T)b; } |
… | |
… | |
83 | return (T *)rxvt_temp_buf (len * sizeof (T)); |
96 | return (T *)rxvt_temp_buf (len * sizeof (T)); |
84 | } |
97 | } |
85 | |
98 | |
86 | // some bit functions, xft fuck me plenty |
99 | // some bit functions, xft fuck me plenty |
87 | #if HAVE_GCC_BUILTINS |
100 | #if HAVE_GCC_BUILTINS |
|
|
101 | /* netbsd stupidly defines popcount itself and puts it into string.h */ |
88 | static inline int ctz (unsigned int x) { return __builtin_ctz (x); } |
102 | static inline int rxvt_ctz (unsigned int x) { return __builtin_ctz (x); } |
89 | static inline int popcount (unsigned int x) { return __builtin_popcount (x); } |
103 | static inline int rxvt_popcount (unsigned int x) { return __builtin_popcount (x); } |
90 | #else |
104 | #else |
91 | // count trailing zero bits and count # of one bits |
105 | // count trailing zero bits and count # of one bits |
92 | int ctz (unsigned int x) CONST; |
106 | int rxvt_ctz (unsigned int x) CONST; |
93 | int popcount (unsigned int x) CONST; |
107 | int rxvt_popcount (unsigned int x) CONST; |
94 | #endif |
108 | #endif |
95 | |
109 | |
96 | // in range including end |
110 | // in range including end |
97 | #define IN_RANGE_INC(val,beg,end) \ |
111 | #define IN_RANGE_INC(val,beg,end) \ |
98 | ((unsigned int)(val) - (unsigned int)(beg) <= (unsigned int)(end) - (unsigned int)(beg)) |
112 | ((unsigned int)(val) - (unsigned int)(beg) <= (unsigned int)(end) - (unsigned int)(beg)) |
… | |
… | |
103 | |
117 | |
104 | // for m >= -n, ensure remainder lies between 0..n-1 |
118 | // for m >= -n, ensure remainder lies between 0..n-1 |
105 | #define MOD(m,n) (((m) + (n)) % (n)) |
119 | #define MOD(m,n) (((m) + (n)) % (n)) |
106 | |
120 | |
107 | // makes dynamically allocated objects zero-initialised |
121 | // makes dynamically allocated objects zero-initialised |
108 | struct zero_initialized { |
122 | struct zero_initialized |
|
|
123 | { |
109 | void *operator new (size_t s); |
124 | void *operator new (size_t s); |
110 | void operator delete (void *p, size_t s); |
125 | void operator delete (void *p, size_t s); |
111 | }; |
126 | }; |
112 | |
127 | |
113 | /* simplevec taken (and heavily modified), from: |
128 | /* simplevec taken (and heavily modified), from: |
114 | * |
129 | * |
115 | * MICO --- a free CORBA implementation |
130 | * MICO --- a free CORBA implementation |
116 | * Copyright (C) 1997-98 Kay Roemer & Arno Puder |
131 | * Copyright (C) 1997-98 Kay Roemer & Arno Puder |
117 | */ |
132 | */ |
118 | template<class T> |
133 | template<class T> |
119 | struct simplevec { |
134 | struct simplevec |
|
|
135 | { |
120 | typedef T* iterator; |
136 | typedef T* iterator; |
121 | typedef const T* const_iterator; |
137 | typedef const T* const_iterator; |
122 | typedef unsigned long size_type; |
138 | typedef unsigned long size_type; |
123 | |
139 | |
124 | private: |
140 | private: |
… | |
… | |
379 | } |
395 | } |
380 | }; |
396 | }; |
381 | |
397 | |
382 | #if 0 |
398 | #if 0 |
383 | template<typename T> |
399 | template<typename T> |
384 | struct rxvt_vec : simplevec<void *> { |
400 | struct rxvt_vec : simplevec<void *> |
|
|
401 | { |
385 | typedef T *iterator; |
402 | typedef T *iterator; |
386 | |
403 | |
387 | void push_back (T d) { simplevec<void *>::push_back ((void *)d); } |
404 | void push_back (T d) { simplevec<void *>::push_back ((void *)d); } |
388 | T pop_back () { return (T*)simplevec<void *>::pop_back (); } |
405 | T pop_back () { return (T*)simplevec<void *>::pop_back (); } |
389 | void erase (int i) { erase (begin () + i); } |
406 | void erase (int i) { erase (begin () + i); } |
… | |
… | |
394 | const T &operator [] (int i) const { return * (const T *) (& ((* (const simplevec<void *> *)this)[i])); } |
411 | const T &operator [] (int i) const { return * (const T *) (& ((* (const simplevec<void *> *)this)[i])); } |
395 | }; |
412 | }; |
396 | #endif |
413 | #endif |
397 | |
414 | |
398 | template<typename T> |
415 | template<typename T> |
399 | struct auto_ptr { |
416 | struct auto_ptr |
|
|
417 | { |
400 | T *p; |
418 | T *p; |
401 | |
419 | |
402 | auto_ptr () : p (0) { } |
420 | auto_ptr () : p (0) { } |
403 | auto_ptr (T *a) : p (a) { } |
421 | auto_ptr (T *a) : p (a) { } |
404 | |
422 | |