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.13 by root, Wed Dec 21 14:19:19 2005 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
17template<typename T, typename U> static 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; }
18template<typename T, typename U> static inline void min_it (T &a, U b) { a = 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 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; }
20template<typename T, typename U> static inline void max_it (T &a, U b) { a = 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; }
21 59
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; } 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; }
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; } 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; }
24 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
25template<typename T, typename U> 75template <typename I, typename T>
26static 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
27 103
28// in range including end 104// in range including end
29#define IN_RANGE_INC(val,beg,end) \ 105#define IN_RANGE_INC(val,beg,end) \
30 ((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))
31 107
32// in range excluding end 108// in range excluding end
33#define IN_RANGE_EXC(val,beg,end) \ 109#define IN_RANGE_EXC(val,beg,end) \
34 ((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))
35 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
36struct zero_initialized { 116struct zero_initialized {
37 void *operator new (size_t s); 117 void *operator new (size_t s);
38 void operator delete (void *p, size_t s); 118 void operator delete (void *p, size_t s);
39}; 119};
40 120
41/* simplevec taken (and heavily modified), from: 121/* simplevec taken (and heavily modified), from:
42 * 122 *
43 * MICO --- a free CORBA implementation 123 * MICO --- a free CORBA implementation
44 * Copyright (C) 1997-98 Kay Roemer & Arno Puder 124 * Copyright (C) 1997-98 Kay Roemer & Arno Puder
45 */ 125 */
46template<class T> 126template<class T>
47struct simplevec { 127struct simplevec {
… …
250 return pos; 330 return pos;
251 } 331 }
252 void erase (iterator first, iterator last) 332 void erase (iterator first, iterator last)
253 { 333 {
254 if (last != first) { 334 if (last != first) {
255 memmove (first, last, (end ()-last)*sizeof (T)); 335 memmove (first, last, (end () - last) * sizeof (T));
256 _last -= last - first; 336 _last -= last - first;
257 } 337 }
258 } 338 }
259 void erase (iterator pos) 339 void erase (iterator pos)
260 { 340 {
261 if (pos != end ()) { 341 if (pos != end ()) {
262 memmove (pos, pos+1, (end ()- (pos+1))*sizeof (T)); 342 memmove (pos, pos+1, (end () - (pos+1)) * sizeof (T));
263 --_last; 343 --_last;
264 } 344 }
265 } 345 }
266 void swap (simplevec<T> &t) 346 void swap (simplevec<T> &t)
267 { 347 {
… …
293} 373}
294 374
295 375
296template<typename T> 376template<typename T>
297struct vector : simplevec<T> 377struct vector : simplevec<T>
298{ }; 378{
379};
380
381struct stringvec : simplevec<char *>
382{
383 ~stringvec ()
384 {
385 for (char **c = begin (); c != end (); c++)
386 free (*c);
387 }
388};
299 389
300#if 0 390#if 0
301template<typename T> 391template<typename T>
302struct rxvt_vec : simplevec<void *> { 392struct rxvt_vec : simplevec<void *> {
303 typedef T *iterator; 393 typedef T *iterator;
… …
311 T &operator [] (int i) { return * (T *) (& ((* (simplevec<void *> *)this)[i])); } 401 T &operator [] (int i) { return * (T *) (& ((* (simplevec<void *> *)this)[i])); }
312 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])); }
313}; 403};
314#endif 404#endif
315 405
316template <typename I, typename T>
317I find (I first, I last, const T& value)
318{
319 while (first != last && *first != value)
320 ++first;
321
322 return first;
323}
324
325template<typename T> 406template<typename T>
326struct auto_ptr { 407struct auto_ptr {
327 T *p; 408 T *p;
328 409
329 auto_ptr () : p (0) { } 410 auto_ptr () : p (0) { }
… …
380 } 461 }
381}; 462};
382 463
383typedef auto_ptr<char> auto_str; 464typedef auto_ptr<char> auto_str;
384 465
385struct stringvec : simplevec<char *>
386{
387 ~stringvec ()
388 {
389 for (char **c = begin (); c != end (); c++)
390 delete [] *c;
391 }
392};
393
394#endif 466#endif
395 467

Diff Legend

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