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.22 by root, Sun Jan 29 22:27:04 2006 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>
5 6
6#define PP_CONCAT_(a, b) a ## b 7#define PP_CONCAT_(a, b) a ## b
7#define PP_CONCAT(a, b) PP_CONCAT_(a, b) 8#define PP_CONCAT(a, b) PP_CONCAT_(a, b)
8#define PP_STRINGIFY_(a) #a 9#define PP_STRINGIFY_(a) #a
9#define PP_STRINGIFY(a) PP_STRINGIFY_(a) 10#define PP_STRINGIFY(a) PP_STRINGIFY_(a)
11
12// actually, some gcc-3.x versions work, too
13#define HAVE_GCC_BUILTINS (__GNUC__ >= 4)
14#define HAVE_GCC_BUILTINS 0
10 15
11extern class byteorder { 16extern class byteorder {
12 static unsigned int e; // at least 32 bits 17 static unsigned int e; // at least 32 bits
13public: 18public:
14 byteorder (); 19 byteorder ();
… …
17 static bool network () { return e == 0x11223344; }; 22 static bool network () { return e == 0x11223344; };
18 static bool little_endian () { return e == 0x44332211; }; 23 static bool little_endian () { return e == 0x44332211; };
19 static bool vax () { return e == 0x44332211; }; 24 static bool vax () { return e == 0x44332211; };
20} byteorder; 25} byteorder;
21 26
27// various utility functions
22template<typename T, typename U> static inline T min (T a, U b) { return a < (T)b ? a : (T)b; } 28template<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; } 29template<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; } 30template<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; } 31template<typename T, typename U> static inline void max_it (T &a, U b) { a = a > (T)b ? a : (T)b; }
26 32
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; } 33template<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; } 34template<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 35
30template<typename T, typename U> static inline void swap (T& a, U& b) { T t=a; a=(T)b; b=(U)t; } 36template<typename T, typename U> static inline void swap (T& a, U& b) { T t=a; a=(T)b; b=(U)t; }
31 37
38// linear interpolation
39template<typename T, typename U, typename P>
40static inline
41T lerp (T a, U b, P p)
42{
43 return (int(a) * int(p) + int(b) * int(100 - p)) / 100;
44}
45
46// some bit functions, xft fuck me plenty
47#if HAVE_GCC_BUILTINS
48static inline int ctz (unsigned int x) { return __builtin_ctz (x); }
49static inline int popcount (unsigned int x) { return __builtin_popcount (x); }
50#else
51// count trailing zero bits and count # of one bits
52int ctz (unsigned int x);
53int popcount (unsigned int x);
54#endif
55
32// in range including end 56// in range including end
33#define IN_RANGE_INC(val,beg,end) \ 57#define IN_RANGE_INC(val,beg,end) \
34 ((unsigned int)(val) - (unsigned int)(beg) <= (unsigned int)(end) - (unsigned int)(beg)) 58 ((unsigned int)(val) - (unsigned int)(beg) <= (unsigned int)(end) - (unsigned int)(beg))
35 59
36// in range excluding end 60// in range excluding end
37#define IN_RANGE_EXC(val,beg,end) \ 61#define IN_RANGE_EXC(val,beg,end) \
38 ((unsigned int)(val) - (unsigned int)(beg) < (unsigned int)(end) - (unsigned int)(beg)) 62 ((unsigned int)(val) - (unsigned int)(beg) < (unsigned int)(end) - (unsigned int)(beg))
39 63
64// makes dynamically allocated objects zero-initialised
40struct zero_initialized { 65struct zero_initialized {
41 void *operator new (size_t s); 66 void *operator new (size_t s);
42 void operator delete (void *p, size_t s); 67 void operator delete (void *p, size_t s);
43}; 68};
44 69
… …
254 return pos; 279 return pos;
255 } 280 }
256 void erase (iterator first, iterator last) 281 void erase (iterator first, iterator last)
257 { 282 {
258 if (last != first) { 283 if (last != first) {
259 memmove (first, last, (end ()-last)*sizeof (T)); 284 memmove (first, last, (end () - last) * sizeof (T));
260 _last -= last - first; 285 _last -= last - first;
261 } 286 }
262 } 287 }
263 void erase (iterator pos) 288 void erase (iterator pos)
264 { 289 {
265 if (pos != end ()) { 290 if (pos != end ()) {
266 memmove (pos, pos+1, (end ()- (pos+1))*sizeof (T)); 291 memmove (pos, pos+1, (end () - (pos+1)) * sizeof (T));
267 --_last; 292 --_last;
268 } 293 }
269 } 294 }
270 void swap (simplevec<T> &t) 295 void swap (simplevec<T> &t)
271 { 296 {
… …
389struct stringvec : simplevec<char *> 414struct stringvec : simplevec<char *>
390{ 415{
391 ~stringvec () 416 ~stringvec ()
392 { 417 {
393 for (char **c = begin (); c != end (); c++) 418 for (char **c = begin (); c != end (); c++)
394 delete [] *c; 419 free (*c);
395 } 420 }
396}; 421};
397 422
423// return a very temporary (and never deallocated) buffer. keep small.
424void *rxvt_temp_buf (int len);
425
426template<typename T>
427inline T *
428rxvt_temp_buf (int len)
429{
430 return (T *)rxvt_temp_buf (len * sizeof (T));
431}
432
398#endif 433#endif
399 434

Diff Legend

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