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.10 by root, Mon Nov 28 19:35:04 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
28template<typename T, typename U> static inline T min (T a, U b) { return 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; }
30template<typename T, typename U> static inline T max (T a, U b) { return 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; }
32
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; }
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; }
35
36template<typename T, typename U> static inline void swap (T& a, U& b) { T t=a; a=(T)b; b=(U)t; }
37
38// linear interpolation
17template<typename T, typename U> 39template<typename T, typename U, typename P>
18static inline T min (T a, U b) { return a < (T)b ? a : (T)b; } 40static inline
19template<typename T, typename U> 41T lerp (T a, U b, P p)
20static inline T max (T a, U b) { return a > (T)b ? a : (T)b; } 42{
21template<typename T> 43 return (int(a) * int(p) + int(b) * int(100 - p)) / 100;
22static inline void swap (T& a, T& b) { T t=a; a=b; b=t; } 44}
23 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
56// in range including end
24#define IN_RANGE(val,beg,end) \ 57#define IN_RANGE_INC(val,beg,end) \
25 ((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))
26 59
60// in range excluding end
61#define IN_RANGE_EXC(val,beg,end) \
62 ((unsigned int)(val) - (unsigned int)(beg) < (unsigned int)(end) - (unsigned int)(beg))
63
64// makes dynamically allocated objects zero-initialised
27struct zero_initialized { 65struct zero_initialized {
28 void *operator new (size_t s); 66 void *operator new (size_t s);
29 void operator delete (void *p, size_t s); 67 void operator delete (void *p, size_t s);
30}; 68};
31 69
… …
241 return pos; 279 return pos;
242 } 280 }
243 void erase (iterator first, iterator last) 281 void erase (iterator first, iterator last)
244 { 282 {
245 if (last != first) { 283 if (last != first) {
246 memmove (first, last, (end ()-last)*sizeof (T)); 284 memmove (first, last, (end () - last) * sizeof (T));
247 _last -= last - first; 285 _last -= last - first;
248 } 286 }
249 } 287 }
250 void erase (iterator pos) 288 void erase (iterator pos)
251 { 289 {
252 if (pos != end ()) { 290 if (pos != end ()) {
253 memmove (pos, pos+1, (end ()- (pos+1))*sizeof (T)); 291 memmove (pos, pos+1, (end () - (pos+1)) * sizeof (T));
254 --_last; 292 --_last;
255 } 293 }
256 } 294 }
257 void swap (simplevec<T> &t) 295 void swap (simplevec<T> &t)
258 { 296 {
… …
376struct stringvec : simplevec<char *> 414struct stringvec : simplevec<char *>
377{ 415{
378 ~stringvec () 416 ~stringvec ()
379 { 417 {
380 for (char **c = begin (); c != end (); c++) 418 for (char **c = begin (); c != end (); c++)
381 delete [] *c; 419 free (*c);
382 } 420 }
383}; 421};
384 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
385#endif 433#endif
386 434

Diff Legend

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