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

Diff Legend

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