1 | #ifndef RXVT_UTIL_H |
1 | #ifndef RXVT_UTIL_H |
2 | #define RXVT_UTIL_H |
2 | #define RXVT_UTIL_H |
3 | |
3 | |
|
|
4 | #include <new> |
4 | #include <cstdlib> |
5 | #include <stdlib.h> |
5 | #include <cstring> |
6 | #include <string.h> |
|
|
7 | #include "ecb.h" |
|
|
8 | #include "estl.h" |
6 | |
9 | |
7 | using namespace std; |
10 | #include "emman.h" |
8 | |
|
|
9 | #define ARRAY_LENGTH(v) (sizeof (v) / sizeof ((v)[0])) |
|
|
10 | |
|
|
11 | #define PP_CONCAT_(a, b) a ## b |
|
|
12 | #define PP_CONCAT(a, b) PP_CONCAT_(a, b) |
|
|
13 | #define PP_STRINGIFY_(a) #a |
|
|
14 | #define PP_STRINGIFY(a) PP_STRINGIFY_(a) |
|
|
15 | |
|
|
16 | #define HAVE_GCC_BUILTINS (__GNUC__ >= 4 || (__GNUC__ == 3 && __GNUC_MINOR__ == 4)) |
|
|
17 | |
|
|
18 | #if __GNUC__ >= 4 |
|
|
19 | # define rxvt_attribute(x) __attribute__(x) |
|
|
20 | # define expect(expr,value) __builtin_expect ((expr),(value)) |
|
|
21 | #else |
|
|
22 | # define rxvt_attribute(x) |
|
|
23 | # define expect(expr,value) (expr) |
|
|
24 | #endif |
|
|
25 | |
|
|
26 | // put into ifs if you are very sure that the expression |
|
|
27 | // is mostly true or mostly false. note that these return |
|
|
28 | // booleans, not the expression. |
|
|
29 | #define expect_false(expr) expect ((expr) != 0, 0) |
|
|
30 | #define expect_true(expr) expect ((expr) != 0, 1) |
|
|
31 | |
|
|
32 | #define NORETURN rxvt_attribute ((noreturn)) |
|
|
33 | #define UNUSED rxvt_attribute ((unused)) |
|
|
34 | #define CONST rxvt_attribute ((const)) |
|
|
35 | |
11 | |
36 | // increases code size unless -fno-enforce-eh-specs |
12 | // increases code size unless -fno-enforce-eh-specs |
37 | #if __GNUC__ |
13 | #if __GNUC__ |
38 | # define NOTHROW |
14 | # define NOTHROW |
39 | # define THROW(x) |
15 | # define THROW(x) |
40 | #else |
16 | #else |
41 | # define NOTHROW throw() |
17 | # define NOTHROW throw() |
42 | # define THROW(x) throw x |
18 | # define THROW(x) throw x |
43 | #endif |
19 | #endif |
44 | |
20 | |
45 | extern class byteorder { |
|
|
46 | static unsigned int e; // at least 32 bits |
|
|
47 | public: |
|
|
48 | byteorder (); |
|
|
49 | |
|
|
50 | static bool big_endian () { return e == 0x11223344; }; |
|
|
51 | static bool network () { return e == 0x11223344; }; |
|
|
52 | static bool little_endian () { return e == 0x44332211; }; |
|
|
53 | static bool vax () { return e == 0x44332211; }; |
|
|
54 | } byteorder; |
|
|
55 | |
|
|
56 | // various utility functions |
21 | // various utility functions |
57 | template<typename T, typename U> static inline T min (T a, U b) { return a < (T)b ? a : (T)b; } |
|
|
58 | template<typename T, typename U> static inline void min_it (T &a, U b) { a = a < (T)b ? a : (T)b; } |
22 | template<typename T, typename U> static inline void min_it (T &a, U b) { a = a < (T)b ? a : (T)b; } |
59 | template<typename T, typename U> static inline T max (T a, U b) { return a > (T)b ? a : (T)b; } |
|
|
60 | template<typename T, typename U> static inline void max_it (T &a, U b) { a = a > (T)b ? a : (T)b; } |
23 | template<typename T, typename U> static inline void max_it (T &a, U b) { a = a > (T)b ? a : (T)b; } |
61 | |
24 | |
62 | 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; } |
25 | 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; } |
63 | 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; } |
26 | 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; } |
64 | |
27 | |
65 | template<typename T, typename U> static inline void swap (T& a, U& b) { T t=a; a=(T)b; b=(U)t; } |
|
|
66 | |
|
|
67 | template<typename T> static inline T squared_diff (T a, T b) { return (a-b)*(a-b); } |
28 | template<typename T> static inline T squared_diff (T a, T b) { return (a - b) * (a - b); } |
68 | |
29 | |
69 | // linear interpolation |
30 | // linear interpolation |
70 | template<typename T, typename U, typename P> |
31 | template<typename T, typename U, typename P> |
71 | static inline |
32 | static inline T |
72 | T lerp (T a, U b, P p) |
33 | lerp (T a, U b, P p) |
73 | { |
34 | { |
74 | return (long(a) * long(100 - p) + long(b) * long(p) + 50) / 100; |
35 | return (long(a) * long(100 - p) + long(b) * long(p) + 50) / 100; |
75 | } |
|
|
76 | |
|
|
77 | template <typename I, typename T> |
|
|
78 | I find (I first, I last, const T& value) |
|
|
79 | { |
|
|
80 | while (first != last && *first != value) |
|
|
81 | ++first; |
|
|
82 | |
|
|
83 | return first; |
|
|
84 | } |
36 | } |
85 | |
37 | |
86 | // return a very temporary (and never deallocated) buffer. keep small. |
38 | // return a very temporary (and never deallocated) buffer. keep small. |
87 | void *rxvt_temp_buf (int len); |
39 | void *rxvt_temp_buf (int len); |
88 | |
40 | |
… | |
… | |
90 | static inline T * |
42 | static inline T * |
91 | rxvt_temp_buf (int len) |
43 | rxvt_temp_buf (int len) |
92 | { |
44 | { |
93 | return (T *)rxvt_temp_buf (len * sizeof (T)); |
45 | return (T *)rxvt_temp_buf (len * sizeof (T)); |
94 | } |
46 | } |
95 | |
|
|
96 | // some bit functions, xft fuck me plenty |
|
|
97 | #if HAVE_GCC_BUILTINS |
|
|
98 | /* netbsd stupidly defines popcount itself and puts it into string.h */ |
|
|
99 | static inline int rxvt_ctz (unsigned int x) { return __builtin_ctz (x); } |
|
|
100 | static inline int rxvt_popcount (unsigned int x) { return __builtin_popcount (x); } |
|
|
101 | #else |
|
|
102 | // count trailing zero bits and count # of one bits |
|
|
103 | int rxvt_ctz (unsigned int x) CONST; |
|
|
104 | int rxvt_popcount (unsigned int x) CONST; |
|
|
105 | #endif |
|
|
106 | |
47 | |
107 | // in range including end |
48 | // in range including end |
108 | #define IN_RANGE_INC(val,beg,end) \ |
49 | #define IN_RANGE_INC(val,beg,end) \ |
109 | ((unsigned int)(val) - (unsigned int)(beg) <= (unsigned int)(end) - (unsigned int)(beg)) |
50 | ((unsigned int)(val) - (unsigned int)(beg) <= (unsigned int)(end) - (unsigned int)(beg)) |
110 | |
51 | |
… | |
… | |
120 | { |
61 | { |
121 | void *operator new (size_t s); |
62 | void *operator new (size_t s); |
122 | void operator delete (void *p, size_t s); |
63 | void operator delete (void *p, size_t s); |
123 | }; |
64 | }; |
124 | |
65 | |
125 | /* simplevec taken (and heavily modified), from: |
66 | // alas new/delete cannot be specified as inline in C++11 (see 17.6.4.6) |
126 | * |
67 | void *operator new (size_t s) throw (std::bad_alloc); |
127 | * MICO --- a free CORBA implementation |
68 | void operator delete (void *p) throw (); |
128 | * Copyright (C) 1997-98 Kay Roemer & Arno Puder |
|
|
129 | */ |
|
|
130 | template<class T> |
|
|
131 | struct simplevec |
|
|
132 | { |
|
|
133 | typedef T* iterator; |
|
|
134 | typedef const T* const_iterator; |
|
|
135 | typedef unsigned long size_type; |
|
|
136 | |
|
|
137 | private: |
|
|
138 | size_type _last, _size; |
|
|
139 | T *_buf; |
|
|
140 | |
|
|
141 | public: |
|
|
142 | const_iterator begin () const |
|
|
143 | { |
|
|
144 | return &_buf[0]; |
|
|
145 | } |
|
|
146 | iterator begin () |
|
|
147 | { |
|
|
148 | return &_buf[0]; |
|
|
149 | } |
|
|
150 | const_iterator end () const |
|
|
151 | { |
|
|
152 | return &_buf[_last]; |
|
|
153 | } |
|
|
154 | iterator end () |
|
|
155 | { |
|
|
156 | return &_buf[_last]; |
|
|
157 | } |
|
|
158 | size_type capacity () const |
|
|
159 | { |
|
|
160 | return _size; |
|
|
161 | } |
|
|
162 | size_type size () const |
|
|
163 | { |
|
|
164 | return _last; |
|
|
165 | } |
|
|
166 | |
|
|
167 | private: |
|
|
168 | static T *alloc (size_type n) |
|
|
169 | { |
|
|
170 | return (T *)::operator new ((size_t) (n * sizeof (T))); |
|
|
171 | } |
|
|
172 | static void dealloc (T *buf) |
|
|
173 | { |
|
|
174 | if (buf) |
|
|
175 | ::operator delete (buf); |
|
|
176 | } |
|
|
177 | |
|
|
178 | void reserve (iterator where, size_type n) |
|
|
179 | { |
|
|
180 | if (_last + n <= _size) { |
|
|
181 | memmove (where+n, where, (end ()-where)*sizeof (T)); |
|
|
182 | } else { |
|
|
183 | size_type sz = _last+n; |
|
|
184 | sz = (_size == 0) ? max (sz, 5) : max (sz, 2*_size); |
|
|
185 | T *nbuf = alloc (sz); |
|
|
186 | if (_buf) { |
|
|
187 | memcpy (nbuf, begin (), (where-begin ())*sizeof (T)); |
|
|
188 | memcpy (nbuf + (where-begin ()) + n, where, |
|
|
189 | (end ()-where)*sizeof (T)); |
|
|
190 | dealloc (_buf); |
|
|
191 | } |
|
|
192 | _buf = nbuf; |
|
|
193 | _size = sz; |
|
|
194 | } |
|
|
195 | } |
|
|
196 | |
|
|
197 | public: |
|
|
198 | void reserve (size_type sz) |
|
|
199 | { |
|
|
200 | if (_size < sz) { |
|
|
201 | sz = (_size == 0) ? max (sz, 5) : max (sz, 2*_size); |
|
|
202 | T *nbuf = alloc (sz); |
|
|
203 | if (_buf) { |
|
|
204 | memcpy (nbuf, begin (), size ()*sizeof (T)); |
|
|
205 | dealloc (_buf); |
|
|
206 | } |
|
|
207 | _buf = nbuf; |
|
|
208 | _size = sz; |
|
|
209 | } |
|
|
210 | } |
|
|
211 | simplevec () |
|
|
212 | : _last(0), _size(0), _buf(0) |
|
|
213 | { |
|
|
214 | } |
|
|
215 | simplevec (size_type n, const T& t = T ()) |
|
|
216 | : _last(0), _size(0), _buf(0) |
|
|
217 | { |
|
|
218 | insert (begin (), n, t); |
|
|
219 | } |
|
|
220 | simplevec (const_iterator first, const_iterator last) |
|
|
221 | : _last(0), _size(0), _buf(0) |
|
|
222 | { |
|
|
223 | insert (begin (), first, last); |
|
|
224 | } |
|
|
225 | simplevec (const simplevec<T> &v) |
|
|
226 | : _last(0), _size(0), _buf(0) |
|
|
227 | { |
|
|
228 | reserve (v._last); |
|
|
229 | memcpy (_buf, v.begin (), v.size ()*sizeof (T)); |
|
|
230 | _last = v._last; |
|
|
231 | } |
|
|
232 | simplevec<T> &operator= (const simplevec<T> &v) |
|
|
233 | { |
|
|
234 | if (this != &v) { |
|
|
235 | _last = 0; |
|
|
236 | reserve (v._last); |
|
|
237 | memcpy (_buf, v.begin (), v.size ()*sizeof (T)); |
|
|
238 | _last = v._last; |
|
|
239 | } |
|
|
240 | return *this; |
|
|
241 | } |
|
|
242 | ~simplevec () |
|
|
243 | { |
|
|
244 | dealloc (_buf); |
|
|
245 | } |
|
|
246 | const T &front () const |
|
|
247 | { |
|
|
248 | //ministl_assert (size () > 0); |
|
|
249 | return _buf[0]; |
|
|
250 | } |
|
|
251 | T &front () |
|
|
252 | { |
|
|
253 | //ministl_assert (size () > 0); |
|
|
254 | return _buf[0]; |
|
|
255 | } |
|
|
256 | const T &back () const |
|
|
257 | { |
|
|
258 | //ministl_assert (size () > 0); |
|
|
259 | return _buf[_last-1]; |
|
|
260 | } |
|
|
261 | T &back () |
|
|
262 | { |
|
|
263 | //ministl_assert (size () > 0); |
|
|
264 | return _buf[_last-1]; |
|
|
265 | } |
|
|
266 | bool empty () const |
|
|
267 | { |
|
|
268 | return _last == 0; |
|
|
269 | } |
|
|
270 | void clear () |
|
|
271 | { |
|
|
272 | _last = 0; |
|
|
273 | } |
|
|
274 | void push_back (const T &t) |
|
|
275 | { |
|
|
276 | reserve (_last+1); |
|
|
277 | *end () = t; |
|
|
278 | ++_last; |
|
|
279 | } |
|
|
280 | void push_back (T &t) |
|
|
281 | { |
|
|
282 | reserve (_last+1); |
|
|
283 | *end () = t; |
|
|
284 | ++_last; |
|
|
285 | } |
|
|
286 | void pop_back () |
|
|
287 | { |
|
|
288 | //ministl_assert (size () > 0); |
|
|
289 | --_last; |
|
|
290 | } |
|
|
291 | const T &operator[] (size_type idx) const |
|
|
292 | { |
|
|
293 | //ministl_assert (idx < size ()); |
|
|
294 | return _buf[idx]; |
|
|
295 | } |
|
|
296 | T &operator[] (size_type idx) |
|
|
297 | { |
|
|
298 | //ministl_assert (idx < size ()); |
|
|
299 | return _buf[idx]; |
|
|
300 | } |
|
|
301 | iterator insert (iterator pos, const T &t) |
|
|
302 | { |
|
|
303 | //ministl_assert (pos <= end ()); |
|
|
304 | long at = pos - begin (); |
|
|
305 | reserve (pos, 1); |
|
|
306 | pos = begin ()+at; |
|
|
307 | *pos = t; |
|
|
308 | ++_last; |
|
|
309 | return pos; |
|
|
310 | } |
|
|
311 | iterator insert (iterator pos, const_iterator first, const_iterator last) |
|
|
312 | { |
|
|
313 | //ministl_assert (pos <= end ()); |
|
|
314 | long n = last - first; |
|
|
315 | long at = pos - begin (); |
|
|
316 | if (n > 0) { |
|
|
317 | reserve (pos, n); |
|
|
318 | pos = begin ()+at; |
|
|
319 | memcpy (pos, first, (last-first)*sizeof (T)); |
|
|
320 | _last += n; |
|
|
321 | } |
|
|
322 | return pos; |
|
|
323 | } |
|
|
324 | iterator insert (iterator pos, size_type n, const T &t) |
|
|
325 | { |
|
|
326 | //ministl_assert (pos <= end ()); |
|
|
327 | long at = pos - begin (); |
|
|
328 | if (n > 0) { |
|
|
329 | reserve (pos, n); |
|
|
330 | pos = begin ()+at; |
|
|
331 | for (int i = 0; i < n; ++i) |
|
|
332 | pos[i] = t; |
|
|
333 | _last += n; |
|
|
334 | } |
|
|
335 | return pos; |
|
|
336 | } |
|
|
337 | void erase (iterator first, iterator last) |
|
|
338 | { |
|
|
339 | if (last != first) { |
|
|
340 | memmove (first, last, (end () - last) * sizeof (T)); |
|
|
341 | _last -= last - first; |
|
|
342 | } |
|
|
343 | } |
|
|
344 | void erase (iterator pos) |
|
|
345 | { |
|
|
346 | if (pos != end ()) { |
|
|
347 | memmove (pos, pos+1, (end () - (pos+1)) * sizeof (T)); |
|
|
348 | --_last; |
|
|
349 | } |
|
|
350 | } |
|
|
351 | void swap (simplevec<T> &t) |
|
|
352 | { |
|
|
353 | ::swap(_last, t._last); |
|
|
354 | ::swap(_size, t._size); |
|
|
355 | ::swap(_buf, t._buf); |
|
|
356 | } |
|
|
357 | }; |
|
|
358 | |
|
|
359 | template<class T> |
|
|
360 | bool operator== (const simplevec<T> &v1, const simplevec<T> &v2) |
|
|
361 | { |
|
|
362 | if (v1.size () != v2.size ()) |
|
|
363 | return false; |
|
|
364 | return !v1.size () || !memcmp (&v1[0], &v2[0], v1.size ()*sizeof (T)); |
|
|
365 | } |
|
|
366 | |
|
|
367 | template<class T> |
|
|
368 | bool operator< (const simplevec<T> &v1, const simplevec<T> &v2) |
|
|
369 | { |
|
|
370 | unsigned long minlast = min (v1.size (), v2.size ()); |
|
|
371 | for (unsigned long i = 0; i < minlast; ++i) { |
|
|
372 | if (v1[i] < v2[i]) |
|
|
373 | return true; |
|
|
374 | if (v2[i] < v1[i]) |
|
|
375 | return false; |
|
|
376 | } |
|
|
377 | return v1.size () < v2.size (); |
|
|
378 | } |
|
|
379 | |
|
|
380 | |
|
|
381 | template<typename T> |
|
|
382 | struct vector : simplevec<T> |
|
|
383 | { |
|
|
384 | }; |
|
|
385 | |
69 | |
386 | struct stringvec : simplevec<char *> |
70 | struct stringvec : simplevec<char *> |
387 | { |
71 | { |
388 | ~stringvec () |
72 | ~stringvec () |
389 | { |
73 | { |
… | |
… | |
407 | T &operator [] (int i) { return * (T *) (& ((* (simplevec<void *> *)this)[i])); } |
91 | T &operator [] (int i) { return * (T *) (& ((* (simplevec<void *> *)this)[i])); } |
408 | const T &operator [] (int i) const { return * (const T *) (& ((* (const simplevec<void *> *)this)[i])); } |
92 | const T &operator [] (int i) const { return * (const T *) (& ((* (const simplevec<void *> *)this)[i])); } |
409 | }; |
93 | }; |
410 | #endif |
94 | #endif |
411 | |
95 | |
412 | template<typename T> |
96 | typedef estl::scoped_array<char> auto_str; |
413 | struct auto_ptr |
|
|
414 | { |
|
|
415 | T *p; |
|
|
416 | |
|
|
417 | auto_ptr () : p (0) { } |
|
|
418 | auto_ptr (T *a) : p (a) { } |
|
|
419 | |
|
|
420 | auto_ptr (auto_ptr<T> &a) |
|
|
421 | { |
|
|
422 | p = a.p; |
|
|
423 | a.p = 0; |
|
|
424 | } |
|
|
425 | |
|
|
426 | template<typename A> |
|
|
427 | auto_ptr (auto_ptr<A> &a) |
|
|
428 | { |
|
|
429 | p = a.p; |
|
|
430 | a.p = 0; |
|
|
431 | } |
|
|
432 | |
|
|
433 | ~auto_ptr () |
|
|
434 | { |
|
|
435 | delete p; |
|
|
436 | } |
|
|
437 | |
|
|
438 | // void because it makes sense in our context |
|
|
439 | void operator = (T *a) |
|
|
440 | { |
|
|
441 | delete p; |
|
|
442 | p = a; |
|
|
443 | } |
|
|
444 | |
|
|
445 | void operator = (auto_ptr &a) |
|
|
446 | { |
|
|
447 | *this = a.p; |
|
|
448 | a.p = 0; |
|
|
449 | } |
|
|
450 | |
|
|
451 | template<typename A> |
|
|
452 | void operator = (auto_ptr<A> &a) |
|
|
453 | { |
|
|
454 | *this = a.p; |
|
|
455 | a.p = 0; |
|
|
456 | } |
|
|
457 | |
|
|
458 | operator T * () const { return p; } |
|
|
459 | |
|
|
460 | T *operator -> () const { return p; } |
|
|
461 | T &operator * () const { return *p; } |
|
|
462 | |
|
|
463 | T *get () |
|
|
464 | { |
|
|
465 | T *r = p; |
|
|
466 | p = 0; |
|
|
467 | return r; |
|
|
468 | } |
|
|
469 | }; |
|
|
470 | |
|
|
471 | typedef auto_ptr<char> auto_str; |
|
|
472 | |
97 | |
473 | #endif |
98 | #endif |
474 | |
99 | |