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

Diff Legend

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