ViewVC Help
View File | Revision Log | Show Annotations | Download File
/cvs/rxvt-unicode/src/rxvtutil.h
(Generate patch)

Comparing rxvt-unicode/src/rxvtutil.h (file contents):
Revision 1.41 by sf-exg, Sat Dec 18 18:17:39 2010 UTC vs.
Revision 1.57 by sf-exg, Fri May 25 18:49:59 2012 UTC

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>
6 7#include "ecb.h"
7using namespace std; 8#include "estl.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 9
36// increases code size unless -fno-enforce-eh-specs 10// increases code size unless -fno-enforce-eh-specs
37#if __GNUC__ 11#if __GNUC__
38# define NOTHROW 12# define NOTHROW
39# define THROW(x) 13# define THROW(x)
40#else 14#else
41# define NOTHROW throw() 15# define NOTHROW throw()
42# define THROW(x) throw x 16# define THROW(x) throw x
43#endif 17#endif
44 18
45extern class byteorder {
46 static unsigned int e; // at least 32 bits
47public:
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 19// various utility functions
57template<typename T, typename U> static inline T min (T a, U b) { return a < (T)b ? a : (T)b; }
58template<typename T, typename U> static inline void min_it (T &a, U b) { a = a < (T)b ? a : (T)b; } 20template<typename T, typename U> static inline void min_it (T &a, U b) { a = a < (T)b ? a : (T)b; }
59template<typename T, typename U> static inline T max (T a, U b) { return a > (T)b ? a : (T)b; }
60template<typename T, typename U> static inline void max_it (T &a, U b) { a = a > (T)b ? a : (T)b; } 21template<typename T, typename U> static inline void max_it (T &a, U b) { a = a > (T)b ? a : (T)b; }
61 22
62template<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; } 23template<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; }
63template<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; } 24template<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 25
65template<typename T, typename U> static inline void swap (T& a, U& b) { T t=a; a=(T)b; b=(U)t; }
66
67template<typename T> static inline T squared_diff (T a, T b) { return (a-b)*(a-b); } 26template<typename T> static inline T squared_diff (T a, T b) { return (a - b) * (a - b); }
68 27
69// linear interpolation 28// linear interpolation
70template<typename T, typename U, typename P> 29template<typename T, typename U, typename P>
71static inline 30static inline T
72T lerp (T a, U b, P p) 31lerp (T a, U b, P p)
73{ 32{
74 return (long(a) * long(100 - p) + long(b) * long(p) + 50) / 100; 33 return (long(a) * long(100 - p) + long(b) * long(p) + 50) / 100;
75}
76
77template <typename I, typename T>
78I find (I first, I last, const T& value)
79{
80 while (first != last && *first != value)
81 ++first;
82
83 return first;
84} 34}
85 35
86// return a very temporary (and never deallocated) buffer. keep small. 36// return a very temporary (and never deallocated) buffer. keep small.
87void *rxvt_temp_buf (int len); 37void *rxvt_temp_buf (int len);
88 38
… …
90static inline T * 40static inline T *
91rxvt_temp_buf (int len) 41rxvt_temp_buf (int len)
92{ 42{
93 return (T *)rxvt_temp_buf (len * sizeof (T)); 43 return (T *)rxvt_temp_buf (len * sizeof (T));
94} 44}
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 */
99static inline int rxvt_ctz (unsigned int x) { return __builtin_ctz (x); }
100static inline int rxvt_popcount (unsigned int x) { return __builtin_popcount (x); }
101#else
102// count trailing zero bits and count # of one bits
103int rxvt_ctz (unsigned int x) CONST;
104int rxvt_popcount (unsigned int x) CONST;
105#endif
106 45
107// in range including end 46// in range including end
108#define IN_RANGE_INC(val,beg,end) \ 47#define IN_RANGE_INC(val,beg,end) \
109 ((unsigned int)(val) - (unsigned int)(beg) <= (unsigned int)(end) - (unsigned int)(beg)) 48 ((unsigned int)(val) - (unsigned int)(beg) <= (unsigned int)(end) - (unsigned int)(beg))
110 49
… …
118// makes dynamically allocated objects zero-initialised 57// makes dynamically allocated objects zero-initialised
119struct zero_initialized 58struct zero_initialized
120{ 59{
121 void *operator new (size_t s); 60 void *operator new (size_t s);
122 void operator delete (void *p, size_t s); 61 void operator delete (void *p, size_t s);
123};
124
125/* simplevec taken (and heavily modified), from:
126 *
127 * MICO --- a free CORBA implementation
128 * Copyright (C) 1997-98 Kay Roemer & Arno Puder
129 */
130template<class T>
131struct simplevec
132{
133 typedef T* iterator;
134 typedef const T* const_iterator;
135 typedef unsigned long size_type;
136
137private:
138 size_type _last, _size;
139 T *_buf;
140
141public:
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
167private:
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
197public:
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
359template<class T>
360bool 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
367template<class T>
368bool 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
381template<typename T>
382struct vector : simplevec<T>
383{
384}; 62};
385 63
386struct stringvec : simplevec<char *> 64struct stringvec : simplevec<char *>
387{ 65{
388 ~stringvec () 66 ~stringvec ()
… …
407 T &operator [] (int i) { return * (T *) (& ((* (simplevec<void *> *)this)[i])); } 85 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])); } 86 const T &operator [] (int i) const { return * (const T *) (& ((* (const simplevec<void *> *)this)[i])); }
409}; 87};
410#endif 88#endif
411 89
90inline void *
91operator new (size_t size)
92{
93 // TODO: use rxvt_malloc
94 return malloc (size);
95}
96
97inline void
98operator delete (void *p)
99{
100 free (p);
101}
102
412template<typename T> 103template<typename T>
413struct auto_ptr 104struct auto_ptr
414{ 105{
415 T *p; 106 T *p;
416 107
417 auto_ptr () : p (0) { } 108 auto_ptr () : p (0) { }
109
110 explicit
418 auto_ptr (T *a) : p (a) { } 111 auto_ptr (T *a) : p (a) { }
419 112
420 auto_ptr (auto_ptr<T> &a) 113 auto_ptr (auto_ptr &a)
421 { 114 {
422 p = a.p; 115 p = a.p;
423 a.p = 0; 116 a.p = 0;
424 } 117 }
425 118
… …
433 ~auto_ptr () 126 ~auto_ptr ()
434 { 127 {
435 delete p; 128 delete p;
436 } 129 }
437 130
438 // void because it makes sense in our context 131 void reset (T *a)
439 void operator = (T *a)
440 { 132 {
441 delete p; 133 delete p;
442 p = a; 134 p = a;
443 } 135 }
444 136
137 // void because it makes sense in our context
445 void operator = (auto_ptr &a) 138 void operator =(auto_ptr &a)
446 { 139 {
447 *this = a.p; 140 reset (a.release ());
448 a.p = 0;
449 } 141 }
450 142
451 template<typename A> 143 template<typename A>
452 void operator = (auto_ptr<A> &a) 144 void operator =(auto_ptr<A> &a)
453 { 145 {
454 *this = a.p; 146 reset (a.release ());
455 a.p = 0;
456 } 147 }
457 148
149 T *operator ->() const { return p; }
458 operator T * () const { return p; } 150 T &operator *() const { return *p; }
459 151
152 operator T *() { return p; }
460 T *operator -> () const { return p; } 153 T *get () const { return p; }
461 T &operator * () const { return *p; }
462 154
463 T *get () 155 T *release()
464 { 156 {
465 T *r = p; 157 T *r = p;
466 p = 0; 158 p = 0;
467 return r; 159 return r;
468 } 160 }

Diff Legend

– Removed lines
+ Added lines
< Changed lines
> Changed lines