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.15 by root, Mon Jan 2 15:35:43 2006 UTC vs.
Revision 1.41 by sf-exg, Sat Dec 18 18:17:39 2010 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 ARRAY_LENGTH(v) (sizeof (v) / sizeof ((v)[0]))
5 10
6#define PP_CONCAT_(a, b) a ## b 11#define PP_CONCAT_(a, b) a ## b
7#define PP_CONCAT(a, b) PP_CONCAT_(a, b) 12#define PP_CONCAT(a, b) PP_CONCAT_(a, b)
8#define PP_STRINGIFY_(a) #a 13#define PP_STRINGIFY_(a) #a
9#define PP_STRINGIFY(a) PP_STRINGIFY_(a) 14#define PP_STRINGIFY(a) PP_STRINGIFY_(a)
15
16#define HAVE_GCC_BUILTINS (__GNUC__ >= 4 || (__GNUC__ == 3 && __GNUC_MINOR__ == 4))
17
18#if __GNUC__ >= 4
19# define rxvt_attribute(x) __attribute__(x)
20# define expect(expr,value) __builtin_expect ((expr),(value))
21#else
22# define rxvt_attribute(x)
23# define expect(expr,value) (expr)
24#endif
25
26// put into ifs if you are very sure that the expression
27// is mostly true or mostly false. note that these return
28// booleans, not the expression.
29#define expect_false(expr) expect ((expr) != 0, 0)
30#define expect_true(expr) expect ((expr) != 0, 1)
31
32#define NORETURN rxvt_attribute ((noreturn))
33#define UNUSED rxvt_attribute ((unused))
34#define CONST rxvt_attribute ((const))
35
36// increases code size unless -fno-enforce-eh-specs
37#if __GNUC__
38# define NOTHROW
39# define THROW(x)
40#else
41# define NOTHROW throw()
42# define THROW(x) throw x
43#endif
10 44
11extern class byteorder { 45extern class byteorder {
12 static unsigned int e; // at least 32 bits 46 static unsigned int e; // at least 32 bits
13public: 47public:
14 byteorder (); 48 byteorder ();
… …
17 static bool network () { return e == 0x11223344; }; 51 static bool network () { return e == 0x11223344; };
18 static bool little_endian () { return e == 0x44332211; }; 52 static bool little_endian () { return e == 0x44332211; };
19 static bool vax () { return e == 0x44332211; }; 53 static bool vax () { return e == 0x44332211; };
20} byteorder; 54} byteorder;
21 55
56// various utility functions
22template<typename T, typename U> static inline T min (T a, U b) { return a < (T)b ? a : (T)b; } 57template<typename T, typename U> static inline T min (T a, U b) { return a < (T)b ? a : (T)b; }
23template<typename T, typename U> static inline void min_it (T &a, U b) { a = a < (T)b ? a : (T)b; } 58template<typename T, typename U> static inline void min_it (T &a, U b) { a = a < (T)b ? a : (T)b; }
24template<typename T, typename U> static inline T max (T a, U b) { return a > (T)b ? a : (T)b; } 59template<typename T, typename U> static inline T max (T a, U b) { return a > (T)b ? a : (T)b; }
25template<typename T, typename U> static inline void max_it (T &a, U b) { a = a > (T)b ? a : (T)b; } 60template<typename T, typename U> static inline void max_it (T &a, U b) { a = a > (T)b ? a : (T)b; }
26 61
27template<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; } 62template<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; }
28template<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; } 63template<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; }
29 64
30template<typename T, typename U> static inline void swap (T& a, U& b) { T t=a; a=(T)b; b=(U)t; } 65template<typename T, typename U> static inline void swap (T& a, U& b) { T t=a; a=(T)b; b=(U)t; }
31 66
67template<typename T> static inline T squared_diff (T a, T b) { return (a-b)*(a-b); }
68
69// linear interpolation
70template<typename T, typename U, typename P>
71static inline
72T lerp (T a, U b, P p)
73{
74 return (long(a) * long(100 - p) + long(b) * long(p) + 50) / 100;
75}
76
77template <typename I, typename T>
78I find (I first, I last, const T& value)
79{
80 while (first != last && *first != value)
81 ++first;
82
83 return first;
84}
85
86// return a very temporary (and never deallocated) buffer. keep small.
87void *rxvt_temp_buf (int len);
88
89template<typename T>
90static inline T *
91rxvt_temp_buf (int len)
92{
93 return (T *)rxvt_temp_buf (len * sizeof (T));
94}
95
96// some bit functions, xft fuck me plenty
97#if HAVE_GCC_BUILTINS
98/* netbsd stupidly defines popcount itself and puts it into string.h */
99static inline int rxvt_ctz (unsigned int x) { return __builtin_ctz (x); }
100static inline int rxvt_popcount (unsigned int x) { return __builtin_popcount (x); }
101#else
102// count trailing zero bits and count # of one bits
103int rxvt_ctz (unsigned int x) CONST;
104int rxvt_popcount (unsigned int x) CONST;
105#endif
106
32// in range including end 107// in range including end
33#define IN_RANGE_INC(val,beg,end) \ 108#define IN_RANGE_INC(val,beg,end) \
34 ((unsigned int)(val) - (unsigned int)(beg) <= (unsigned int)(end) - (unsigned int)(beg)) 109 ((unsigned int)(val) - (unsigned int)(beg) <= (unsigned int)(end) - (unsigned int)(beg))
35 110
36// in range excluding end 111// in range excluding end
37#define IN_RANGE_EXC(val,beg,end) \ 112#define IN_RANGE_EXC(val,beg,end) \
38 ((unsigned int)(val) - (unsigned int)(beg) < (unsigned int)(end) - (unsigned int)(beg)) 113 ((unsigned int)(val) - (unsigned int)(beg) < (unsigned int)(end) - (unsigned int)(beg))
39 114
115// for m >= -n, ensure remainder lies between 0..n-1
116#define MOD(m,n) (((m) + (n)) % (n))
117
118// makes dynamically allocated objects zero-initialised
40struct zero_initialized { 119struct zero_initialized
120{
41 void *operator new (size_t s); 121 void *operator new (size_t s);
42 void operator delete (void *p, size_t s); 122 void operator delete (void *p, size_t s);
43}; 123};
44 124
45/* simplevec taken (and heavily modified), from: 125/* simplevec taken (and heavily modified), from:
46 * 126 *
47 * MICO --- a free CORBA implementation 127 * MICO --- a free CORBA implementation
48 * Copyright (C) 1997-98 Kay Roemer & Arno Puder 128 * Copyright (C) 1997-98 Kay Roemer & Arno Puder
49 */ 129 */
50template<class T> 130template<class T>
51struct simplevec { 131struct simplevec
132{
52 typedef T* iterator; 133 typedef T* iterator;
53 typedef const T* const_iterator; 134 typedef const T* const_iterator;
54 typedef unsigned long size_type; 135 typedef unsigned long size_type;
55 136
56private: 137private:
… …
254 return pos; 335 return pos;
255 } 336 }
256 void erase (iterator first, iterator last) 337 void erase (iterator first, iterator last)
257 { 338 {
258 if (last != first) { 339 if (last != first) {
259 memmove (first, last, (end ()-last)*sizeof (T)); 340 memmove (first, last, (end () - last) * sizeof (T));
260 _last -= last - first; 341 _last -= last - first;
261 } 342 }
262 } 343 }
263 void erase (iterator pos) 344 void erase (iterator pos)
264 { 345 {
265 if (pos != end ()) { 346 if (pos != end ()) {
266 memmove (pos, pos+1, (end ()- (pos+1))*sizeof (T)); 347 memmove (pos, pos+1, (end () - (pos+1)) * sizeof (T));
267 --_last; 348 --_last;
268 } 349 }
269 } 350 }
270 void swap (simplevec<T> &t) 351 void swap (simplevec<T> &t)
271 { 352 {
… …
297} 378}
298 379
299 380
300template<typename T> 381template<typename T>
301struct vector : simplevec<T> 382struct vector : simplevec<T>
302{ }; 383{
384};
385
386struct stringvec : simplevec<char *>
387{
388 ~stringvec ()
389 {
390 for (char **c = begin (); c != end (); c++)
391 free (*c);
392 }
393};
303 394
304#if 0 395#if 0
305template<typename T> 396template<typename T>
306struct rxvt_vec : simplevec<void *> { 397struct rxvt_vec : simplevec<void *>
398{
307 typedef T *iterator; 399 typedef T *iterator;
308 400
309 void push_back (T d) { simplevec<void *>::push_back ((void *)d); } 401 void push_back (T d) { simplevec<void *>::push_back ((void *)d); }
310 T pop_back () { return (T*)simplevec<void *>::pop_back (); } 402 T pop_back () { return (T*)simplevec<void *>::pop_back (); }
311 void erase (int i) { erase (begin () + i); } 403 void erase (int i) { erase (begin () + i); }
… …
315 T &operator [] (int i) { return * (T *) (& ((* (simplevec<void *> *)this)[i])); } 407 T &operator [] (int i) { return * (T *) (& ((* (simplevec<void *> *)this)[i])); }
316 const T &operator [] (int i) const { return * (const T *) (& ((* (const simplevec<void *> *)this)[i])); } 408 const T &operator [] (int i) const { return * (const T *) (& ((* (const simplevec<void *> *)this)[i])); }
317}; 409};
318#endif 410#endif
319 411
320template <typename I, typename T>
321I find (I first, I last, const T& value)
322{
323 while (first != last && *first != value)
324 ++first;
325
326 return first;
327}
328
329template<typename T> 412template<typename T>
330struct auto_ptr { 413struct auto_ptr
414{
331 T *p; 415 T *p;
332 416
333 auto_ptr () : p (0) { } 417 auto_ptr () : p (0) { }
334 auto_ptr (T *a) : p (a) { } 418 auto_ptr (T *a) : p (a) { }
335 419
… …
384 } 468 }
385}; 469};
386 470
387typedef auto_ptr<char> auto_str; 471typedef auto_ptr<char> auto_str;
388 472
389struct stringvec : simplevec<char *>
390{
391 ~stringvec ()
392 {
393 for (char **c = begin (); c != end (); c++)
394 delete [] *c;
395 }
396};
397
398#endif 473#endif
399 474

Diff Legend

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