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.12 by root, Wed Dec 21 10:34:24 2005 UTC vs.
Revision 1.38 by root, Wed Nov 5 14:43:54 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
17template<typename T, typename U> 54// various utility functions
18static inline T min (T a, U b) { return a < (T)b ? a : (T)b; } 55template<typename T, typename U> static inline T min (T a, U b) { return a < (T)b ? a : (T)b; }
19template<typename T, typename U> 56template<typename T, typename U> static inline void min_it (T &a, U b) { a = a < (T)b ? a : (T)b; }
20static inline T max (T a, U b) { return 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
21template<typename T, typename U, typename V> 68template<typename T, typename U, typename P>
22static inline T clamp (T v, U a, V b) { return v < (T)a ? a : v >(T)b ? b : v; } 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
23template<typename T, typename U> 75template <typename I, typename T>
24static inline void swap (T& a, U& b) { T t=a; a=(T)b; b=(U)t; } 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
87template<typename T>
88static inline T *
89rxvt_temp_buf (int len)
90{
91 return (T *)rxvt_temp_buf (len * sizeof (T));
92}
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
25 103
26// in range including end 104// in range including end
27#define IN_RANGE_INC(val,beg,end) \ 105#define IN_RANGE_INC(val,beg,end) \
28 ((unsigned int)(val) - (unsigned int)(beg) <= (unsigned int)(end) - (unsigned int)(beg)) 106 ((unsigned int)(val) - (unsigned int)(beg) <= (unsigned int)(end) - (unsigned int)(beg))
29 107
30// in range excluding end 108// in range excluding end
31#define IN_RANGE_EXC(val,beg,end) \ 109#define IN_RANGE_EXC(val,beg,end) \
32 ((unsigned int)(val) - (unsigned int)(beg) < (unsigned int)(end) - (unsigned int)(beg)) 110 ((unsigned int)(val) - (unsigned int)(beg) < (unsigned int)(end) - (unsigned int)(beg))
33 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
34struct zero_initialized { 116struct zero_initialized
117{
35 void *operator new (size_t s); 118 void *operator new (size_t s);
36 void operator delete (void *p, size_t s); 119 void operator delete (void *p, size_t s);
37}; 120};
38 121
39/* simplevec taken (and heavily modified), from: 122/* simplevec taken (and heavily modified), from:
40 * 123 *
41 * MICO --- a free CORBA implementation 124 * MICO --- a free CORBA implementation
42 * Copyright (C) 1997-98 Kay Roemer & Arno Puder 125 * Copyright (C) 1997-98 Kay Roemer & Arno Puder
43 */ 126 */
44template<class T> 127template<class T>
45struct simplevec { 128struct simplevec
129{
46 typedef T* iterator; 130 typedef T* iterator;
47 typedef const T* const_iterator; 131 typedef const T* const_iterator;
48 typedef unsigned long size_type; 132 typedef unsigned long size_type;
49 133
50private: 134private:
… …
248 return pos; 332 return pos;
249 } 333 }
250 void erase (iterator first, iterator last) 334 void erase (iterator first, iterator last)
251 { 335 {
252 if (last != first) { 336 if (last != first) {
253 memmove (first, last, (end ()-last)*sizeof (T)); 337 memmove (first, last, (end () - last) * sizeof (T));
254 _last -= last - first; 338 _last -= last - first;
255 } 339 }
256 } 340 }
257 void erase (iterator pos) 341 void erase (iterator pos)
258 { 342 {
259 if (pos != end ()) { 343 if (pos != end ()) {
260 memmove (pos, pos+1, (end ()- (pos+1))*sizeof (T)); 344 memmove (pos, pos+1, (end () - (pos+1)) * sizeof (T));
261 --_last; 345 --_last;
262 } 346 }
263 } 347 }
264 void swap (simplevec<T> &t) 348 void swap (simplevec<T> &t)
265 { 349 {
… …
291} 375}
292 376
293 377
294template<typename T> 378template<typename T>
295struct vector : simplevec<T> 379struct vector : simplevec<T>
296{ }; 380{
381};
382
383struct stringvec : simplevec<char *>
384{
385 ~stringvec ()
386 {
387 for (char **c = begin (); c != end (); c++)
388 free (*c);
389 }
390};
297 391
298#if 0 392#if 0
299template<typename T> 393template<typename T>
300struct rxvt_vec : simplevec<void *> { 394struct rxvt_vec : simplevec<void *>
395{
301 typedef T *iterator; 396 typedef T *iterator;
302 397
303 void push_back (T d) { simplevec<void *>::push_back ((void *)d); } 398 void push_back (T d) { simplevec<void *>::push_back ((void *)d); }
304 T pop_back () { return (T*)simplevec<void *>::pop_back (); } 399 T pop_back () { return (T*)simplevec<void *>::pop_back (); }
305 void erase (int i) { erase (begin () + i); } 400 void erase (int i) { erase (begin () + i); }
… …
309 T &operator [] (int i) { return * (T *) (& ((* (simplevec<void *> *)this)[i])); } 404 T &operator [] (int i) { return * (T *) (& ((* (simplevec<void *> *)this)[i])); }
310 const T &operator [] (int i) const { return * (const T *) (& ((* (const simplevec<void *> *)this)[i])); } 405 const T &operator [] (int i) const { return * (const T *) (& ((* (const simplevec<void *> *)this)[i])); }
311}; 406};
312#endif 407#endif
313 408
314template <typename I, typename T>
315I find (I first, I last, const T& value)
316{
317 while (first != last && *first != value)
318 ++first;
319
320 return first;
321}
322
323template<typename T> 409template<typename T>
324struct auto_ptr { 410struct auto_ptr
411{
325 T *p; 412 T *p;
326 413
327 auto_ptr () : p (0) { } 414 auto_ptr () : p (0) { }
328 auto_ptr (T *a) : p (a) { } 415 auto_ptr (T *a) : p (a) { }
329 416
… …
378 } 465 }
379}; 466};
380 467
381typedef auto_ptr<char> auto_str; 468typedef auto_ptr<char> auto_str;
382 469
383struct stringvec : simplevec<char *>
384{
385 ~stringvec ()
386 {
387 for (char **c = begin (); c != end (); c++)
388 delete [] *c;
389 }
390};
391
392#endif 470#endif
393 471

Diff Legend

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