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 <stdlib.h> |
5 | #include <cstring> |
5 | #include <string.h> |
6 | |
6 | #include "ecb.h" |
7 | using namespace std; |
7 | #include "estl.h" |
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 | |
8 | |
26 | // increases code size unless -fno-enforce-eh-specs |
9 | // increases code size unless -fno-enforce-eh-specs |
27 | #if __GNUC__ |
10 | #if __GNUC__ |
28 | # define NOTHROW |
11 | # define NOTHROW |
29 | # define THROW(x) |
12 | # define THROW(x) |
30 | #else |
13 | #else |
31 | # define NOTHROW throw() |
14 | # define NOTHROW throw() |
32 | # define THROW(x) throw x |
15 | # define THROW(x) throw x |
33 | #endif |
16 | #endif |
34 | |
17 | |
35 | extern class byteorder { |
|
|
36 | static unsigned int e; // at least 32 bits |
|
|
37 | public: |
|
|
38 | byteorder (); |
|
|
39 | |
|
|
40 | static bool big_endian () { return e == 0x11223344; }; |
|
|
41 | static bool network () { return e == 0x11223344; }; |
|
|
42 | static bool little_endian () { return e == 0x44332211; }; |
|
|
43 | static bool vax () { return e == 0x44332211; }; |
|
|
44 | } byteorder; |
|
|
45 | |
|
|
46 | // various utility functions |
18 | // 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; } |
19 | 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; } |
20 | template<typename T, typename U> static inline void max_it (T &a, U b) { a = a > (T)b ? a : (T)b; } |
51 | |
21 | |
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; } |
22 | 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; } |
23 | 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 | |
24 | |
57 | template<typename T> static inline T squared_diff (T a, T b) { return (a-b)*(a-b); } |
25 | template<typename T> static inline T squared_diff (T a, T b) { return (a-b)*(a-b); } |
58 | |
26 | |
59 | // linear interpolation |
27 | // linear interpolation |
60 | template<typename T, typename U, typename P> |
28 | template<typename T, typename U, typename P> |
61 | static inline |
29 | static inline |
62 | T lerp (T a, U b, P p) |
30 | T lerp (T a, U b, P p) |
63 | { |
31 | { |
64 | return (long(a) * long(100 - p) + long(b) * long(p) + 50) / 100; |
32 | 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 | } |
33 | } |
75 | |
34 | |
76 | // return a very temporary (and never deallocated) buffer. keep small. |
35 | // return a very temporary (and never deallocated) buffer. keep small. |
77 | void *rxvt_temp_buf (int len); |
36 | void *rxvt_temp_buf (int len); |
78 | |
37 | |
… | |
… | |
81 | rxvt_temp_buf (int len) |
40 | rxvt_temp_buf (int len) |
82 | { |
41 | { |
83 | return (T *)rxvt_temp_buf (len * sizeof (T)); |
42 | return (T *)rxvt_temp_buf (len * sizeof (T)); |
84 | } |
43 | } |
85 | |
44 | |
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 | |
|
|
96 | // in range including end |
45 | // in range including end |
97 | #define IN_RANGE_INC(val,beg,end) \ |
46 | #define IN_RANGE_INC(val,beg,end) \ |
98 | ((unsigned int)(val) - (unsigned int)(beg) <= (unsigned int)(end) - (unsigned int)(beg)) |
47 | ((unsigned int)(val) - (unsigned int)(beg) <= (unsigned int)(end) - (unsigned int)(beg)) |
99 | |
48 | |
100 | // in range excluding end |
49 | // in range excluding end |
101 | #define IN_RANGE_EXC(val,beg,end) \ |
50 | #define IN_RANGE_EXC(val,beg,end) \ |
102 | ((unsigned int)(val) - (unsigned int)(beg) < (unsigned int)(end) - (unsigned int)(beg)) |
51 | ((unsigned int)(val) - (unsigned int)(beg) < (unsigned int)(end) - (unsigned int)(beg)) |
103 | |
52 | |
|
|
53 | // for m >= -n, ensure remainder lies between 0..n-1 |
|
|
54 | #define MOD(m,n) (((m) + (n)) % (n)) |
|
|
55 | |
104 | // makes dynamically allocated objects zero-initialised |
56 | // makes dynamically allocated objects zero-initialised |
105 | struct zero_initialized { |
57 | struct zero_initialized |
|
|
58 | { |
106 | void *operator new (size_t s); |
59 | void *operator new (size_t s); |
107 | void operator delete (void *p, size_t s); |
60 | void operator delete (void *p, size_t s); |
108 | }; |
61 | }; |
109 | |
|
|
110 | /* simplevec taken (and heavily modified), from: |
|
|
111 | * |
|
|
112 | * MICO --- a free CORBA implementation |
|
|
113 | * Copyright (C) 1997-98 Kay Roemer & Arno Puder |
|
|
114 | */ |
|
|
115 | template<class T> |
|
|
116 | struct simplevec { |
|
|
117 | typedef T* iterator; |
|
|
118 | typedef const T* const_iterator; |
|
|
119 | typedef unsigned long size_type; |
|
|
120 | |
|
|
121 | private: |
|
|
122 | size_type _last, _size; |
|
|
123 | T *_buf; |
|
|
124 | |
|
|
125 | public: |
|
|
126 | const_iterator begin () const |
|
|
127 | { |
|
|
128 | return &_buf[0]; |
|
|
129 | } |
|
|
130 | iterator begin () |
|
|
131 | { |
|
|
132 | return &_buf[0]; |
|
|
133 | } |
|
|
134 | const_iterator end () const |
|
|
135 | { |
|
|
136 | return &_buf[_last]; |
|
|
137 | } |
|
|
138 | iterator end () |
|
|
139 | { |
|
|
140 | return &_buf[_last]; |
|
|
141 | } |
|
|
142 | size_type capacity () const |
|
|
143 | { |
|
|
144 | return _size; |
|
|
145 | } |
|
|
146 | size_type size () const |
|
|
147 | { |
|
|
148 | return _last; |
|
|
149 | } |
|
|
150 | |
|
|
151 | private: |
|
|
152 | static T *alloc (size_type n) |
|
|
153 | { |
|
|
154 | return (T *)::operator new ((size_t) (n * sizeof (T))); |
|
|
155 | } |
|
|
156 | static void dealloc (T *buf) |
|
|
157 | { |
|
|
158 | if (buf) |
|
|
159 | ::operator delete (buf); |
|
|
160 | } |
|
|
161 | |
|
|
162 | void reserve (iterator where, size_type n) |
|
|
163 | { |
|
|
164 | if (_last + n <= _size) { |
|
|
165 | memmove (where+n, where, (end ()-where)*sizeof (T)); |
|
|
166 | } else { |
|
|
167 | size_type sz = _last+n; |
|
|
168 | sz = (_size == 0) ? max (sz, 5) : max (sz, 2*_size); |
|
|
169 | T *nbuf = alloc (sz); |
|
|
170 | if (_buf) { |
|
|
171 | memcpy (nbuf, begin (), (where-begin ())*sizeof (T)); |
|
|
172 | memcpy (nbuf + (where-begin ()) + n, where, |
|
|
173 | (end ()-where)*sizeof (T)); |
|
|
174 | dealloc (_buf); |
|
|
175 | } |
|
|
176 | _buf = nbuf; |
|
|
177 | _size = sz; |
|
|
178 | } |
|
|
179 | } |
|
|
180 | |
|
|
181 | public: |
|
|
182 | void reserve (size_type sz) |
|
|
183 | { |
|
|
184 | if (_size < sz) { |
|
|
185 | sz = (_size == 0) ? max (sz, 5) : max (sz, 2*_size); |
|
|
186 | T *nbuf = alloc (sz); |
|
|
187 | if (_buf) { |
|
|
188 | memcpy (nbuf, begin (), size ()*sizeof (T)); |
|
|
189 | dealloc (_buf); |
|
|
190 | } |
|
|
191 | _buf = nbuf; |
|
|
192 | _size = sz; |
|
|
193 | } |
|
|
194 | } |
|
|
195 | simplevec () |
|
|
196 | : _last(0), _size(0), _buf(0) |
|
|
197 | { |
|
|
198 | } |
|
|
199 | simplevec (size_type n, const T& t = T ()) |
|
|
200 | : _last(0), _size(0), _buf(0) |
|
|
201 | { |
|
|
202 | insert (begin (), n, t); |
|
|
203 | } |
|
|
204 | simplevec (const_iterator first, const_iterator last) |
|
|
205 | : _last(0), _size(0), _buf(0) |
|
|
206 | { |
|
|
207 | insert (begin (), first, last); |
|
|
208 | } |
|
|
209 | simplevec (const simplevec<T> &v) |
|
|
210 | : _last(0), _size(0), _buf(0) |
|
|
211 | { |
|
|
212 | reserve (v._last); |
|
|
213 | memcpy (_buf, v.begin (), v.size ()*sizeof (T)); |
|
|
214 | _last = v._last; |
|
|
215 | } |
|
|
216 | simplevec<T> &operator= (const simplevec<T> &v) |
|
|
217 | { |
|
|
218 | if (this != &v) { |
|
|
219 | _last = 0; |
|
|
220 | reserve (v._last); |
|
|
221 | memcpy (_buf, v.begin (), v.size ()*sizeof (T)); |
|
|
222 | _last = v._last; |
|
|
223 | } |
|
|
224 | return *this; |
|
|
225 | } |
|
|
226 | ~simplevec () |
|
|
227 | { |
|
|
228 | dealloc (_buf); |
|
|
229 | } |
|
|
230 | const T &front () const |
|
|
231 | { |
|
|
232 | //ministl_assert (size () > 0); |
|
|
233 | return _buf[0]; |
|
|
234 | } |
|
|
235 | T &front () |
|
|
236 | { |
|
|
237 | //ministl_assert (size () > 0); |
|
|
238 | return _buf[0]; |
|
|
239 | } |
|
|
240 | const T &back () const |
|
|
241 | { |
|
|
242 | //ministl_assert (size () > 0); |
|
|
243 | return _buf[_last-1]; |
|
|
244 | } |
|
|
245 | T &back () |
|
|
246 | { |
|
|
247 | //ministl_assert (size () > 0); |
|
|
248 | return _buf[_last-1]; |
|
|
249 | } |
|
|
250 | bool empty () const |
|
|
251 | { |
|
|
252 | return _last == 0; |
|
|
253 | } |
|
|
254 | void clear () |
|
|
255 | { |
|
|
256 | _last = 0; |
|
|
257 | } |
|
|
258 | void push_back (const T &t) |
|
|
259 | { |
|
|
260 | reserve (_last+1); |
|
|
261 | *end () = t; |
|
|
262 | ++_last; |
|
|
263 | } |
|
|
264 | void push_back (T &t) |
|
|
265 | { |
|
|
266 | reserve (_last+1); |
|
|
267 | *end () = t; |
|
|
268 | ++_last; |
|
|
269 | } |
|
|
270 | void pop_back () |
|
|
271 | { |
|
|
272 | //ministl_assert (size () > 0); |
|
|
273 | --_last; |
|
|
274 | } |
|
|
275 | const T &operator[] (size_type idx) const |
|
|
276 | { |
|
|
277 | //ministl_assert (idx < size ()); |
|
|
278 | return _buf[idx]; |
|
|
279 | } |
|
|
280 | T &operator[] (size_type idx) |
|
|
281 | { |
|
|
282 | //ministl_assert (idx < size ()); |
|
|
283 | return _buf[idx]; |
|
|
284 | } |
|
|
285 | iterator insert (iterator pos, const T &t) |
|
|
286 | { |
|
|
287 | //ministl_assert (pos <= end ()); |
|
|
288 | long at = pos - begin (); |
|
|
289 | reserve (pos, 1); |
|
|
290 | pos = begin ()+at; |
|
|
291 | *pos = t; |
|
|
292 | ++_last; |
|
|
293 | return pos; |
|
|
294 | } |
|
|
295 | iterator insert (iterator pos, const_iterator first, const_iterator last) |
|
|
296 | { |
|
|
297 | //ministl_assert (pos <= end ()); |
|
|
298 | long n = last - first; |
|
|
299 | long at = pos - begin (); |
|
|
300 | if (n > 0) { |
|
|
301 | reserve (pos, n); |
|
|
302 | pos = begin ()+at; |
|
|
303 | memcpy (pos, first, (last-first)*sizeof (T)); |
|
|
304 | _last += n; |
|
|
305 | } |
|
|
306 | return pos; |
|
|
307 | } |
|
|
308 | iterator insert (iterator pos, size_type n, const T &t) |
|
|
309 | { |
|
|
310 | //ministl_assert (pos <= end ()); |
|
|
311 | long at = pos - begin (); |
|
|
312 | if (n > 0) { |
|
|
313 | reserve (pos, n); |
|
|
314 | pos = begin ()+at; |
|
|
315 | for (int i = 0; i < n; ++i) |
|
|
316 | pos[i] = t; |
|
|
317 | _last += n; |
|
|
318 | } |
|
|
319 | return pos; |
|
|
320 | } |
|
|
321 | void erase (iterator first, iterator last) |
|
|
322 | { |
|
|
323 | if (last != first) { |
|
|
324 | memmove (first, last, (end () - last) * sizeof (T)); |
|
|
325 | _last -= last - first; |
|
|
326 | } |
|
|
327 | } |
|
|
328 | void erase (iterator pos) |
|
|
329 | { |
|
|
330 | if (pos != end ()) { |
|
|
331 | memmove (pos, pos+1, (end () - (pos+1)) * sizeof (T)); |
|
|
332 | --_last; |
|
|
333 | } |
|
|
334 | } |
|
|
335 | void swap (simplevec<T> &t) |
|
|
336 | { |
|
|
337 | ::swap(_last, t._last); |
|
|
338 | ::swap(_size, t._size); |
|
|
339 | ::swap(_buf, t._buf); |
|
|
340 | } |
|
|
341 | }; |
|
|
342 | |
|
|
343 | template<class T> |
|
|
344 | bool operator== (const simplevec<T> &v1, const simplevec<T> &v2) |
|
|
345 | { |
|
|
346 | if (v1.size () != v2.size ()) |
|
|
347 | return false; |
|
|
348 | return !v1.size () || !memcmp (&v1[0], &v2[0], v1.size ()*sizeof (T)); |
|
|
349 | } |
|
|
350 | |
|
|
351 | template<class T> |
|
|
352 | bool operator< (const simplevec<T> &v1, const simplevec<T> &v2) |
|
|
353 | { |
|
|
354 | unsigned long minlast = min (v1.size (), v2.size ()); |
|
|
355 | for (unsigned long i = 0; i < minlast; ++i) { |
|
|
356 | if (v1[i] < v2[i]) |
|
|
357 | return true; |
|
|
358 | if (v2[i] < v1[i]) |
|
|
359 | return false; |
|
|
360 | } |
|
|
361 | return v1.size () < v2.size (); |
|
|
362 | } |
|
|
363 | |
|
|
364 | |
|
|
365 | template<typename T> |
|
|
366 | struct vector : simplevec<T> |
|
|
367 | { }; |
|
|
368 | |
62 | |
369 | struct stringvec : simplevec<char *> |
63 | struct stringvec : simplevec<char *> |
370 | { |
64 | { |
371 | ~stringvec () |
65 | ~stringvec () |
372 | { |
66 | { |
… | |
… | |
375 | } |
69 | } |
376 | }; |
70 | }; |
377 | |
71 | |
378 | #if 0 |
72 | #if 0 |
379 | template<typename T> |
73 | template<typename T> |
380 | struct rxvt_vec : simplevec<void *> { |
74 | struct rxvt_vec : simplevec<void *> |
|
|
75 | { |
381 | typedef T *iterator; |
76 | typedef T *iterator; |
382 | |
77 | |
383 | void push_back (T d) { simplevec<void *>::push_back ((void *)d); } |
78 | void push_back (T d) { simplevec<void *>::push_back ((void *)d); } |
384 | T pop_back () { return (T*)simplevec<void *>::pop_back (); } |
79 | T pop_back () { return (T*)simplevec<void *>::pop_back (); } |
385 | void erase (int i) { erase (begin () + i); } |
80 | void erase (int i) { erase (begin () + i); } |
… | |
… | |
390 | const T &operator [] (int i) const { return * (const T *) (& ((* (const simplevec<void *> *)this)[i])); } |
85 | const T &operator [] (int i) const { return * (const T *) (& ((* (const simplevec<void *> *)this)[i])); } |
391 | }; |
86 | }; |
392 | #endif |
87 | #endif |
393 | |
88 | |
394 | template<typename T> |
89 | template<typename T> |
395 | struct auto_ptr { |
90 | struct auto_ptr |
|
|
91 | { |
396 | T *p; |
92 | T *p; |
397 | |
93 | |
398 | auto_ptr () : p (0) { } |
94 | auto_ptr () : p (0) { } |
399 | auto_ptr (T *a) : p (a) { } |
95 | auto_ptr (T *a) : p (a) { } |
400 | |
96 | |
… | |
… | |
411 | a.p = 0; |
107 | a.p = 0; |
412 | } |
108 | } |
413 | |
109 | |
414 | ~auto_ptr () |
110 | ~auto_ptr () |
415 | { |
111 | { |
416 | delete p; |
112 | free (p); |
417 | } |
113 | } |
418 | |
114 | |
419 | // void because it makes sense in our context |
115 | // void because it makes sense in our context |
420 | void operator = (T *a) |
116 | void operator = (T *a) |
421 | { |
117 | { |
422 | delete p; |
118 | free (p); |
423 | p = a; |
119 | p = a; |
424 | } |
120 | } |
425 | |
121 | |
426 | void operator = (auto_ptr &a) |
122 | void operator = (auto_ptr &a) |
427 | { |
123 | { |