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.3 by root, Sat Aug 21 05:32:00 2004 UTC vs.
Revision 1.36 by ayin, Fri Dec 14 11:11:31 2007 UTC

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

Diff Legend

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