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.11 by root, Tue Dec 20 19:30:59 2005 UTC vs.
Revision 1.34 by root, Sun Dec 2 22:37:14 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#if __GNUC__ >= 4
17# define rxvt_attribute(x) __attribute__(x)
18#else
19# define rxvt_attribute(x)
20#endif
21
22#define NORETURN rxvt_attribute ((noreturn))
23#define UNUSED rxvt_attribute ((unused))
24#define CONST rxvt_attribute ((const))
25
26// increases code size unless -fno-enforce-eh-specs
27#if __GNUC__
28# define NOTHROW
29# define THROW(x)
30#else
31# define NOTHROW throw()
32# define THROW(x) throw x
33#endif
5 34
6extern class byteorder { 35extern class byteorder {
7 static unsigned int e; // at least 32 bits 36 static unsigned int e; // at least 32 bits
8public: 37public:
9 byteorder (); 38 byteorder ();
… …
12 static bool network () { return e == 0x11223344; }; 41 static bool network () { return e == 0x11223344; };
13 static bool little_endian () { return e == 0x44332211; }; 42 static bool little_endian () { return e == 0x44332211; };
14 static bool vax () { return e == 0x44332211; }; 43 static bool vax () { return e == 0x44332211; };
15} byteorder; 44} byteorder;
16 45
46// various utility functions
47template<typename T, typename U> static inline T min (T a, U b) { return a < (T)b ? a : (T)b; }
48template<typename T, typename U> static inline void min_it (T &a, U b) { a = a < (T)b ? a : (T)b; }
49template<typename T, typename U> static inline T max (T a, U b) { return a > (T)b ? a : (T)b; }
50template<typename T, typename U> static inline void max_it (T &a, U b) { a = a > (T)b ? a : (T)b; }
51
52template<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; }
53template<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; }
54
55template<typename T, typename U> static inline void swap (T& a, U& b) { T t=a; a=(T)b; b=(U)t; }
56
57template<typename T> static inline T squared_diff (T a, T b) { return (a-b)*(a-b); }
58
59// linear interpolation
60template<typename T, typename U, typename P>
61static inline
62T lerp (T a, U b, P p)
63{
64 return (long(a) * long(100 - p) + long(b) * long(p) + 50) / 100;
65}
66
17template<typename T, typename U> 67template <typename I, typename T>
18static inline T min (T a, U b) { return a < (T)b ? a : (T)b; } 68I find (I first, I last, const T& value)
19template<typename T, typename U> 69{
20static inline T max (T a, U b) { return a > (T)b ? a : (T)b; } 70 while (first != last && *first != value)
71 ++first;
72
73 return first;
74}
75
76// return a very temporary (and never deallocated) buffer. keep small.
77void *rxvt_temp_buf (int len);
78
21template<typename T> 79template<typename T>
22static inline void swap (T& a, T& b) { T t=a; a=b; b=t; } 80static inline T *
81rxvt_temp_buf (int len)
82{
83 return (T *)rxvt_temp_buf (len * sizeof (T));
84}
85
86// some bit functions, xft fuck me plenty
87#if HAVE_GCC_BUILTINS
88static inline int ctz (unsigned int x) { return __builtin_ctz (x); }
89static inline int popcount (unsigned int x) { return __builtin_popcount (x); }
90#else
91// count trailing zero bits and count # of one bits
92int ctz (unsigned int x) CONST;
93int popcount (unsigned int x) CONST;
94#endif
23 95
24// in range including end 96// in range including end
25#define IN_RANGE_INC(val,beg,end) \ 97#define IN_RANGE_INC(val,beg,end) \
26 ((unsigned int)(val) - (unsigned int)(beg) <= (unsigned int)(end) - (unsigned int)(beg)) 98 ((unsigned int)(val) - (unsigned int)(beg) <= (unsigned int)(end) - (unsigned int)(beg))
27 99
28// in range excluding end 100// in range excluding end
29#define IN_RANGE_EXC(val,beg,end) \ 101#define IN_RANGE_EXC(val,beg,end) \
30 ((unsigned int)(val) - (unsigned int)(beg) < (unsigned int)(end) - (unsigned int)(beg)) 102 ((unsigned int)(val) - (unsigned int)(beg) < (unsigned int)(end) - (unsigned int)(beg))
31 103
104// makes dynamically allocated objects zero-initialised
32struct zero_initialized { 105struct zero_initialized {
33 void *operator new (size_t s); 106 void *operator new (size_t s);
34 void operator delete (void *p, size_t s); 107 void operator delete (void *p, size_t s);
35}; 108};
36 109
37/* simplevec taken (and heavily modified), from: 110/* simplevec taken (and heavily modified), from:
38 * 111 *
39 * MICO --- a free CORBA implementation 112 * MICO --- a free CORBA implementation
40 * Copyright (C) 1997-98 Kay Roemer & Arno Puder 113 * Copyright (C) 1997-98 Kay Roemer & Arno Puder
41 */ 114 */
42template<class T> 115template<class T>
43struct simplevec { 116struct simplevec {
… …
246 return pos; 319 return pos;
247 } 320 }
248 void erase (iterator first, iterator last) 321 void erase (iterator first, iterator last)
249 { 322 {
250 if (last != first) { 323 if (last != first) {
251 memmove (first, last, (end ()-last)*sizeof (T)); 324 memmove (first, last, (end () - last) * sizeof (T));
252 _last -= last - first; 325 _last -= last - first;
253 } 326 }
254 } 327 }
255 void erase (iterator pos) 328 void erase (iterator pos)
256 { 329 {
257 if (pos != end ()) { 330 if (pos != end ()) {
258 memmove (pos, pos+1, (end ()- (pos+1))*sizeof (T)); 331 memmove (pos, pos+1, (end () - (pos+1)) * sizeof (T));
259 --_last; 332 --_last;
260 } 333 }
261 } 334 }
262 void swap (simplevec<T> &t) 335 void swap (simplevec<T> &t)
263 { 336 {
… …
290 363
291 364
292template<typename T> 365template<typename T>
293struct vector : simplevec<T> 366struct vector : simplevec<T>
294{ }; 367{ };
368
369struct stringvec : simplevec<char *>
370{
371 ~stringvec ()
372 {
373 for (char **c = begin (); c != end (); c++)
374 free (*c);
375 }
376};
295 377
296#if 0 378#if 0
297template<typename T> 379template<typename T>
298struct rxvt_vec : simplevec<void *> { 380struct rxvt_vec : simplevec<void *> {
299 typedef T *iterator; 381 typedef T *iterator;
… …
307 T &operator [] (int i) { return * (T *) (& ((* (simplevec<void *> *)this)[i])); } 389 T &operator [] (int i) { return * (T *) (& ((* (simplevec<void *> *)this)[i])); }
308 const T &operator [] (int i) const { return * (const T *) (& ((* (const simplevec<void *> *)this)[i])); } 390 const T &operator [] (int i) const { return * (const T *) (& ((* (const simplevec<void *> *)this)[i])); }
309}; 391};
310#endif 392#endif
311 393
312template <typename I, typename T>
313I find (I first, I last, const T& value)
314{
315 while (first != last && *first != value)
316 ++first;
317
318 return first;
319}
320
321template<typename T> 394template<typename T>
322struct auto_ptr { 395struct auto_ptr {
323 T *p; 396 T *p;
324 397
325 auto_ptr () : p (0) { } 398 auto_ptr () : p (0) { }
… …
376 } 449 }
377}; 450};
378 451
379typedef auto_ptr<char> auto_str; 452typedef auto_ptr<char> auto_str;
380 453
381struct stringvec : simplevec<char *>
382{
383 ~stringvec ()
384 {
385 for (char **c = begin (); c != end (); c++)
386 delete [] *c;
387 }
388};
389
390#endif 454#endif
391 455

Diff Legend

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