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.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 3
4#include <cstdlib>
4#include <cstring> 5#include <cstring>
6
7using namespace std;
5 8
6#define PP_CONCAT_(a, b) a ## b 9#define PP_CONCAT_(a, b) a ## b
7#define PP_CONCAT(a, b) PP_CONCAT_(a, b) 10#define PP_CONCAT(a, b) PP_CONCAT_(a, b)
8#define PP_STRINGIFY_(a) #a 11#define PP_STRINGIFY_(a) #a
9#define PP_STRINGIFY(a) PP_STRINGIFY_(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
10 34
11extern class byteorder { 35extern class byteorder {
12 static unsigned int e; // at least 32 bits 36 static unsigned int e; // at least 32 bits
13public: 37public:
14 byteorder (); 38 byteorder ();
… …
17 static bool network () { return e == 0x11223344; }; 41 static bool network () { return e == 0x11223344; };
18 static bool little_endian () { return e == 0x44332211; }; 42 static bool little_endian () { return e == 0x44332211; };
19 static bool vax () { return e == 0x44332211; }; 43 static bool vax () { return e == 0x44332211; };
20} byteorder; 44} byteorder;
21 45
46// various utility functions
22template<typename T, typename U> static inline T min (T a, U b) { return a < (T)b ? a : (T)b; } 47template<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; } 48template<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; } 49template<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; } 50template<typename T, typename U> static inline void max_it (T &a, U b) { a = a > (T)b ? a : (T)b; }
26 51
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; } 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; }
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; } 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; }
29 54
30template<typename T, typename U> static inline void swap (T& a, U& b) { T t=a; a=(T)b; b=(U)t; } 55template<typename T, typename U> static inline void swap (T& a, U& b) { T t=a; a=(T)b; b=(U)t; }
31 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
67template <typename I, typename T>
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
79template<typename T>
80static inline T *
81rxvt_temp_buf (int len)
82{
83 return (T *)rxvt_temp_buf (len * sizeof (T));
84}
85
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
32// in range including end 96// in range including end
33#define IN_RANGE_INC(val,beg,end) \ 97#define IN_RANGE_INC(val,beg,end) \
34 ((unsigned int)(val) - (unsigned int)(beg) <= (unsigned int)(end) - (unsigned int)(beg)) 98 ((unsigned int)(val) - (unsigned int)(beg) <= (unsigned int)(end) - (unsigned int)(beg))
35 99
36// in range excluding end 100// in range excluding end
37#define IN_RANGE_EXC(val,beg,end) \ 101#define IN_RANGE_EXC(val,beg,end) \
38 ((unsigned int)(val) - (unsigned int)(beg) < (unsigned int)(end) - (unsigned int)(beg)) 102 ((unsigned int)(val) - (unsigned int)(beg) < (unsigned int)(end) - (unsigned int)(beg))
39 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
40struct zero_initialized { 108struct zero_initialized {
41 void *operator new (size_t s); 109 void *operator new (size_t s);
42 void operator delete (void *p, size_t s); 110 void operator delete (void *p, size_t s);
43}; 111};
44 112
45/* simplevec taken (and heavily modified), from: 113/* simplevec taken (and heavily modified), from:
46 * 114 *
47 * MICO --- a free CORBA implementation 115 * MICO --- a free CORBA implementation
48 * Copyright (C) 1997-98 Kay Roemer & Arno Puder 116 * Copyright (C) 1997-98 Kay Roemer & Arno Puder
49 */ 117 */
50template<class T> 118template<class T>
51struct simplevec { 119struct simplevec {
… …
254 return pos; 322 return pos;
255 } 323 }
256 void erase (iterator first, iterator last) 324 void erase (iterator first, iterator last)
257 { 325 {
258 if (last != first) { 326 if (last != first) {
259 memmove (first, last, (end ()-last)*sizeof (T)); 327 memmove (first, last, (end () - last) * sizeof (T));
260 _last -= last - first; 328 _last -= last - first;
261 } 329 }
262 } 330 }
263 void erase (iterator pos) 331 void erase (iterator pos)
264 { 332 {
265 if (pos != end ()) { 333 if (pos != end ()) {
266 memmove (pos, pos+1, (end ()- (pos+1))*sizeof (T)); 334 memmove (pos, pos+1, (end () - (pos+1)) * sizeof (T));
267 --_last; 335 --_last;
268 } 336 }
269 } 337 }
270 void swap (simplevec<T> &t) 338 void swap (simplevec<T> &t)
271 { 339 {
… …
297} 365}
298 366
299 367
300template<typename T> 368template<typename T>
301struct vector : simplevec<T> 369struct vector : simplevec<T>
302{ }; 370{
371};
372
373struct stringvec : simplevec<char *>
374{
375 ~stringvec ()
376 {
377 for (char **c = begin (); c != end (); c++)
378 free (*c);
379 }
380};
303 381
304#if 0 382#if 0
305template<typename T> 383template<typename T>
306struct rxvt_vec : simplevec<void *> { 384struct rxvt_vec : simplevec<void *> {
307 typedef T *iterator; 385 typedef T *iterator;
… …
315 T &operator [] (int i) { return * (T *) (& ((* (simplevec<void *> *)this)[i])); } 393 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])); } 394 const T &operator [] (int i) const { return * (const T *) (& ((* (const simplevec<void *> *)this)[i])); }
317}; 395};
318#endif 396#endif
319 397
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> 398template<typename T>
330struct auto_ptr { 399struct auto_ptr {
331 T *p; 400 T *p;
332 401
333 auto_ptr () : p (0) { } 402 auto_ptr () : p (0) { }
… …
384 } 453 }
385}; 454};
386 455
387typedef auto_ptr<char> auto_str; 456typedef auto_ptr<char> auto_str;
388 457
389struct stringvec : simplevec<char *>
390{
391 ~stringvec ()
392 {
393 for (char **c = begin (); c != end (); c++)
394 delete [] *c;
395 }
396};
397
398#endif 458#endif
399 459

Diff Legend

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