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.9 by root, Sun Jun 26 19:59:29 2005 UTC vs.
Revision 1.24 by root, Mon Jan 30 16:12:58 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
15#ifndef __attribute__
16# if __GNUC__
17# if (__GNUC__ == 2 && __GNUC_MINOR__ < 5) || (__GNUC__ < 2)
18# define __attribute__(x)
19# endif
20# endif
21# define __attribute__(x)
22#endif
23
24#define NORETURN __attribute__ ((noreturn))
25#define UNUSED __attribute__ ((unused))
26#define CONST __attribute__ ((const))
27
28// increases code size unless -fno-enforce-eh-specs
29#if __GNUC__
30# define NOTHROW
31# define THROW(x)
32#else
33# define NOTHROW throw()
34# define THROW(x) throw x
35#endif
5 36
6extern class byteorder { 37extern class byteorder {
7 static unsigned int e; // at least 32 bits 38 static unsigned int e; // at least 32 bits
8public: 39public:
9 byteorder (); 40 byteorder ();
… …
12 static bool network () { return e == 0x11223344; }; 43 static bool network () { return e == 0x11223344; };
13 static bool little_endian () { return e == 0x44332211; }; 44 static bool little_endian () { return e == 0x44332211; };
14 static bool vax () { return e == 0x44332211; }; 45 static bool vax () { return e == 0x44332211; };
15} byteorder; 46} byteorder;
16 47
48// various utility functions
49template<typename T, typename U> static inline T min (T a, U b) { return a < (T)b ? a : (T)b; }
50template<typename T, typename U> static inline void min_it (T &a, U b) { a = a < (T)b ? a : (T)b; }
51template<typename T, typename U> static inline T max (T a, U b) { return a > (T)b ? a : (T)b; }
52template<typename T, typename U> static inline void max_it (T &a, U b) { a = a > (T)b ? a : (T)b; }
53
54template<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; }
55template<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; }
56
57template<typename T, typename U> static inline void swap (T& a, U& b) { T t=a; a=(T)b; b=(U)t; }
58
59// linear interpolation
17template<typename T, typename U> 60template<typename T, typename U, typename P>
18static inline T min (T a, U b) { return a < b ? a : (T)b; } 61static inline
19template<typename T, typename U> 62T lerp (T a, U b, P p)
20static inline T max (T a, U b) { return a > b ? a : (T)b; } 63{
21template<typename T> 64 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; } 65}
23 66
67// some bit functions, xft fuck me plenty
68#if HAVE_GCC_BUILTINS
69static inline int ctz (unsigned int x) CONST { return __builtin_ctz (x); }
70static inline int popcount (unsigned int x) CONST { return __builtin_popcount (x); }
71#else
72// count trailing zero bits and count # of one bits
73int ctz (unsigned int x) CONST;
74int popcount (unsigned int x) CONST;
75#endif
76
77// in range including end
24#define IN_RANGE(val,beg,end) \ 78#define IN_RANGE_INC(val,beg,end) \
25 ((unsigned int)(val) - (unsigned int)(beg) <= (unsigned int)(end) - (unsigned int)(beg)) 79 ((unsigned int)(val) - (unsigned int)(beg) <= (unsigned int)(end) - (unsigned int)(beg))
26 80
81// in range excluding end
82#define IN_RANGE_EXC(val,beg,end) \
83 ((unsigned int)(val) - (unsigned int)(beg) < (unsigned int)(end) - (unsigned int)(beg))
84
85// makes dynamically allocated objects zero-initialised
27struct zero_initialized { 86struct zero_initialized {
28 void *operator new (size_t s); 87 void *operator new (size_t s);
29 void operator delete (void *p, size_t s); 88 void operator delete (void *p, size_t s);
30}; 89};
31 90
… …
241 return pos; 300 return pos;
242 } 301 }
243 void erase (iterator first, iterator last) 302 void erase (iterator first, iterator last)
244 { 303 {
245 if (last != first) { 304 if (last != first) {
246 memmove (first, last, (end ()-last)*sizeof (T)); 305 memmove (first, last, (end () - last) * sizeof (T));
247 _last -= last - first; 306 _last -= last - first;
248 } 307 }
249 } 308 }
250 void erase (iterator pos) 309 void erase (iterator pos)
251 { 310 {
252 if (pos != end ()) { 311 if (pos != end ()) {
253 memmove (pos, pos+1, (end ()- (pos+1))*sizeof (T)); 312 memmove (pos, pos+1, (end () - (pos+1)) * sizeof (T));
254 --_last; 313 --_last;
255 } 314 }
256 } 315 }
257 void swap (simplevec<T> &t) 316 void swap (simplevec<T> &t)
258 { 317 {
… …
376struct stringvec : simplevec<char *> 435struct stringvec : simplevec<char *>
377{ 436{
378 ~stringvec () 437 ~stringvec ()
379 { 438 {
380 for (char **c = begin (); c != end (); c++) 439 for (char **c = begin (); c != end (); c++)
381 delete [] *c; 440 free (*c);
382 } 441 }
383}; 442};
384 443
444// return a very temporary (and never deallocated) buffer. keep small.
445void *rxvt_temp_buf (int len);
446
447template<typename T>
448static inline T *
449rxvt_temp_buf (int len)
450{
451 return (T *)rxvt_temp_buf (len * sizeof (T));
452}
453
385#endif 454#endif
386 455

Diff Legend

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