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

Diff Legend

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