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.12 by root, Wed Dec 21 10:34:24 2005 UTC vs.
Revision 1.33 by root, Sun Dec 2 22:36:42 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
17template<typename T, typename U> 46// various utility functions
18static inline T min (T a, U b) { return a < (T)b ? a : (T)b; } 47template<typename T, typename U> static inline T min (T a, U b) { return a < (T)b ? a : (T)b; }
19template<typename T, typename U> 48template<typename T, typename U> static inline void min_it (T &a, U b) { a = a < (T)b ? a : (T)b; }
20static inline T max (T a, U b) { return 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
21template<typename T, typename U, typename V> 60template<typename T, typename U, typename P>
22static inline T clamp (T v, U a, V b) { return v < (T)a ? a : v >(T)b ? b : v; } 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
23template<typename T, typename U> 67template <typename I, typename T>
24static inline void swap (T& a, U& b) { T t=a; a=(T)b; b=(U)t; } 68I find (I first, I last, const T& value)
69{
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
79template<typename 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
25 95
26// in range including end 96// in range including end
27#define IN_RANGE_INC(val,beg,end) \ 97#define IN_RANGE_INC(val,beg,end) \
28 ((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))
29 99
30// in range excluding end 100// in range excluding end
31#define IN_RANGE_EXC(val,beg,end) \ 101#define IN_RANGE_EXC(val,beg,end) \
32 ((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))
33 103
104// makes dynamically allocated objects zero-initialised
34struct zero_initialized { 105struct zero_initialized {
35 void *operator new (size_t s); 106 void *operator new (size_t s);
36 void operator delete (void *p, size_t s); 107 void operator delete (void *p, size_t s);
37}; 108};
38 109
39/* simplevec taken (and heavily modified), from: 110/* simplevec taken (and heavily modified), from:
40 * 111 *
41 * MICO --- a free CORBA implementation 112 * MICO --- a free CORBA implementation
42 * Copyright (C) 1997-98 Kay Roemer & Arno Puder 113 * Copyright (C) 1997-98 Kay Roemer & Arno Puder
43 */ 114 */
44template<class T> 115template<class T>
45struct simplevec { 116struct simplevec {
… …
248 return pos; 319 return pos;
249 } 320 }
250 void erase (iterator first, iterator last) 321 void erase (iterator first, iterator last)
251 { 322 {
252 if (last != first) { 323 if (last != first) {
253 memmove (first, last, (end ()-last)*sizeof (T)); 324 memmove (first, last, (end () - last) * sizeof (T));
254 _last -= last - first; 325 _last -= last - first;
255 } 326 }
256 } 327 }
257 void erase (iterator pos) 328 void erase (iterator pos)
258 { 329 {
259 if (pos != end ()) { 330 if (pos != end ()) {
260 memmove (pos, pos+1, (end ()- (pos+1))*sizeof (T)); 331 memmove (pos, pos+1, (end () - (pos+1)) * sizeof (T));
261 --_last; 332 --_last;
262 } 333 }
263 } 334 }
264 void swap (simplevec<T> &t) 335 void swap (simplevec<T> &t)
265 { 336 {
… …
293 364
294template<typename T> 365template<typename T>
295struct vector : simplevec<T> 366struct vector : simplevec<T>
296{ }; 367{ };
297 368
298#if 0 369struct stringvec : simplevec<char *>
370{
371 ~stringvec ()
372 {
373 for (char **c = begin (); c != end (); c++)
374 free (*c);
375 }
376};
377
299template<typename T> 378template<typename T>
300struct rxvt_vec : simplevec<void *> { 379struct rxvt_vec : simplevec<void *> {
301 typedef T *iterator; 380 typedef T *iterator;
302 381
303 void push_back (T d) { simplevec<void *>::push_back ((void *)d); } 382 void push_back (T d) { simplevec<void *>::push_back ((void *)d); }
… …
307 iterator begin () const { return (iterator)simplevec<void *>::begin (); } 386 iterator begin () const { return (iterator)simplevec<void *>::begin (); }
308 iterator end () const { return (iterator)simplevec<void *>::end (); } 387 iterator end () const { return (iterator)simplevec<void *>::end (); }
309 T &operator [] (int i) { return * (T *) (& ((* (simplevec<void *> *)this)[i])); } 388 T &operator [] (int i) { return * (T *) (& ((* (simplevec<void *> *)this)[i])); }
310 const T &operator [] (int i) const { return * (const T *) (& ((* (const simplevec<void *> *)this)[i])); } 389 const T &operator [] (int i) const { return * (const T *) (& ((* (const simplevec<void *> *)this)[i])); }
311}; 390};
312#endif
313
314template <typename I, typename T>
315I find (I first, I last, const T& value)
316{
317 while (first != last && *first != value)
318 ++first;
319
320 return first;
321}
322 391
323template<typename T> 392template<typename T>
324struct auto_ptr { 393struct auto_ptr {
325 T *p; 394 T *p;
326 395
… …
378 } 447 }
379}; 448};
380 449
381typedef auto_ptr<char> auto_str; 450typedef auto_ptr<char> auto_str;
382 451
383struct stringvec : simplevec<char *>
384{
385 ~stringvec ()
386 {
387 for (char **c = begin (); c != end (); c++)
388 delete [] *c;
389 }
390};
391
392#endif 452#endif
393 453

Diff Legend

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