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

Diff Legend

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