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.14 by root, Wed Dec 21 14:23:30 2005 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>
6
7#define PP_CONCAT_(a, b) a ## b
8#define PP_CONCAT(a, b) PP_CONCAT_(a, b)
9#define PP_STRINGIFY_(a) #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
5 15
6extern class byteorder { 16extern class byteorder {
7 static unsigned int e; // at least 32 bits 17 static unsigned int e; // at least 32 bits
8public: 18public:
9 byteorder (); 19 byteorder ();
… …
12 static bool network () { return e == 0x11223344; }; 22 static bool network () { return e == 0x11223344; };
13 static bool little_endian () { return e == 0x44332211; }; 23 static bool little_endian () { return e == 0x44332211; };
14 static bool vax () { return e == 0x44332211; }; 24 static bool vax () { return e == 0x44332211; };
15} byteorder; 25} byteorder;
16 26
27// various utility functions
17template<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; }
18template<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; }
19template<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; }
20template<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; }
21 32
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; } 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; }
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; } 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; }
24 35
25template<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; }
26 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
27// in range including end 56// in range including end
28#define IN_RANGE_INC(val,beg,end) \ 57#define IN_RANGE_INC(val,beg,end) \
29 ((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))
30 59
31// in range excluding end 60// in range excluding end
32#define IN_RANGE_EXC(val,beg,end) \ 61#define IN_RANGE_EXC(val,beg,end) \
33 ((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))
34 63
64// makes dynamically allocated objects zero-initialised
35struct zero_initialized { 65struct zero_initialized {
36 void *operator new (size_t s); 66 void *operator new (size_t s);
37 void operator delete (void *p, size_t s); 67 void operator delete (void *p, size_t s);
38}; 68};
39 69
… …
249 return pos; 279 return pos;
250 } 280 }
251 void erase (iterator first, iterator last) 281 void erase (iterator first, iterator last)
252 { 282 {
253 if (last != first) { 283 if (last != first) {
254 memmove (first, last, (end ()-last)*sizeof (T)); 284 memmove (first, last, (end () - last) * sizeof (T));
255 _last -= last - first; 285 _last -= last - first;
256 } 286 }
257 } 287 }
258 void erase (iterator pos) 288 void erase (iterator pos)
259 { 289 {
260 if (pos != end ()) { 290 if (pos != end ()) {
261 memmove (pos, pos+1, (end ()- (pos+1))*sizeof (T)); 291 memmove (pos, pos+1, (end () - (pos+1)) * sizeof (T));
262 --_last; 292 --_last;
263 } 293 }
264 } 294 }
265 void swap (simplevec<T> &t) 295 void swap (simplevec<T> &t)
266 { 296 {
… …
384struct stringvec : simplevec<char *> 414struct stringvec : simplevec<char *>
385{ 415{
386 ~stringvec () 416 ~stringvec ()
387 { 417 {
388 for (char **c = begin (); c != end (); c++) 418 for (char **c = begin (); c != end (); c++)
389 delete [] *c; 419 free (*c);
390 } 420 }
391}; 421};
392 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
393#endif 433#endif
394 434

Diff Legend

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