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.2 by root, Sun Aug 15 07:20:16 2004 UTC vs.
Revision 1.42 by root, Mon Jan 3 03:05:47 2011 UTC

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

Diff Legend

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