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.15 by root, Mon Jan 2 15:35:43 2006 UTC vs.
Revision 1.40 by sf-exg, Mon Jul 26 09:57:53 2010 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;
5 8
6#define PP_CONCAT_(a, b) a ## b 9#define PP_CONCAT_(a, b) a ## b
7#define PP_CONCAT(a, b) PP_CONCAT_(a, b) 10#define PP_CONCAT(a, b) PP_CONCAT_(a, b)
8#define PP_STRINGIFY_(a) #a 11#define PP_STRINGIFY_(a) #a
9#define PP_STRINGIFY(a) PP_STRINGIFY_(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# define expect(expr,value) __builtin_expect ((expr),(value))
19#else
20# define rxvt_attribute(x)
21# define expect(expr,value) (expr)
22#endif
23
24// put into ifs if you are very sure that the expression
25// is mostly true or mostly false. note that these return
26// booleans, not the expression.
27#define expect_false(expr) expect ((expr) != 0, 0)
28#define expect_true(expr) expect ((expr) != 0, 1)
29
30#define NORETURN rxvt_attribute ((noreturn))
31#define UNUSED rxvt_attribute ((unused))
32#define CONST rxvt_attribute ((const))
33
34// increases code size unless -fno-enforce-eh-specs
35#if __GNUC__
36# define NOTHROW
37# define THROW(x)
38#else
39# define NOTHROW throw()
40# define THROW(x) throw x
41#endif
10 42
11extern class byteorder { 43extern class byteorder {
12 static unsigned int e; // at least 32 bits 44 static unsigned int e; // at least 32 bits
13public: 45public:
14 byteorder (); 46 byteorder ();
… …
17 static bool network () { return e == 0x11223344; }; 49 static bool network () { return e == 0x11223344; };
18 static bool little_endian () { return e == 0x44332211; }; 50 static bool little_endian () { return e == 0x44332211; };
19 static bool vax () { return e == 0x44332211; }; 51 static bool vax () { return e == 0x44332211; };
20} byteorder; 52} byteorder;
21 53
54// various utility functions
22template<typename T, typename U> static inline T min (T a, U b) { return a < (T)b ? a : (T)b; } 55template<typename T, typename U> static inline T min (T a, U b) { return a < (T)b ? a : (T)b; }
23template<typename T, typename U> static inline void min_it (T &a, U b) { a = a < (T)b ? a : (T)b; } 56template<typename T, typename U> static inline void min_it (T &a, U b) { a = a < (T)b ? a : (T)b; }
24template<typename T, typename U> static inline T max (T a, U b) { return a > (T)b ? a : (T)b; } 57template<typename T, typename U> static inline T max (T a, U b) { return a > (T)b ? a : (T)b; }
25template<typename T, typename U> static inline void max_it (T &a, U b) { a = a > (T)b ? a : (T)b; } 58template<typename T, typename U> static inline void max_it (T &a, U b) { a = a > (T)b ? a : (T)b; }
26 59
27template<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; } 60template<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; }
28template<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; } 61template<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; }
29 62
30template<typename T, typename U> static inline void swap (T& a, U& b) { T t=a; a=(T)b; b=(U)t; } 63template<typename T, typename U> static inline void swap (T& a, U& b) { T t=a; a=(T)b; b=(U)t; }
31 64
65template<typename T> static inline T squared_diff (T a, T b) { return (a-b)*(a-b); }
66
67// linear interpolation
68template<typename T, typename U, typename P>
69static inline
70T lerp (T a, U b, P p)
71{
72 return (long(a) * long(100 - p) + long(b) * long(p) + 50) / 100;
73}
74
75template <typename I, typename T>
76I find (I first, I last, const T& value)
77{
78 while (first != last && *first != value)
79 ++first;
80
81 return first;
82}
83
84// return a very temporary (and never deallocated) buffer. keep small.
85void *rxvt_temp_buf (int len);
86
87template<typename T>
88static inline T *
89rxvt_temp_buf (int len)
90{
91 return (T *)rxvt_temp_buf (len * sizeof (T));
92}
93
94// some bit functions, xft fuck me plenty
95#if HAVE_GCC_BUILTINS
96/* netbsd stupidly defines popcount itself and puts it into string.h */
97static inline int rxvt_ctz (unsigned int x) { return __builtin_ctz (x); }
98static inline int rxvt_popcount (unsigned int x) { return __builtin_popcount (x); }
99#else
100// count trailing zero bits and count # of one bits
101int rxvt_ctz (unsigned int x) CONST;
102int rxvt_popcount (unsigned int x) CONST;
103#endif
104
32// in range including end 105// in range including end
33#define IN_RANGE_INC(val,beg,end) \ 106#define IN_RANGE_INC(val,beg,end) \
34 ((unsigned int)(val) - (unsigned int)(beg) <= (unsigned int)(end) - (unsigned int)(beg)) 107 ((unsigned int)(val) - (unsigned int)(beg) <= (unsigned int)(end) - (unsigned int)(beg))
35 108
36// in range excluding end 109// in range excluding end
37#define IN_RANGE_EXC(val,beg,end) \ 110#define IN_RANGE_EXC(val,beg,end) \
38 ((unsigned int)(val) - (unsigned int)(beg) < (unsigned int)(end) - (unsigned int)(beg)) 111 ((unsigned int)(val) - (unsigned int)(beg) < (unsigned int)(end) - (unsigned int)(beg))
39 112
113// for m >= -n, ensure remainder lies between 0..n-1
114#define MOD(m,n) (((m) + (n)) % (n))
115
116// makes dynamically allocated objects zero-initialised
40struct zero_initialized { 117struct zero_initialized
118{
41 void *operator new (size_t s); 119 void *operator new (size_t s);
42 void operator delete (void *p, size_t s); 120 void operator delete (void *p, size_t s);
43}; 121};
44 122
45/* simplevec taken (and heavily modified), from: 123/* simplevec taken (and heavily modified), from:
46 * 124 *
47 * MICO --- a free CORBA implementation 125 * MICO --- a free CORBA implementation
48 * Copyright (C) 1997-98 Kay Roemer & Arno Puder 126 * Copyright (C) 1997-98 Kay Roemer & Arno Puder
49 */ 127 */
50template<class T> 128template<class T>
51struct simplevec { 129struct simplevec
130{
52 typedef T* iterator; 131 typedef T* iterator;
53 typedef const T* const_iterator; 132 typedef const T* const_iterator;
54 typedef unsigned long size_type; 133 typedef unsigned long size_type;
55 134
56private: 135private:
… …
254 return pos; 333 return pos;
255 } 334 }
256 void erase (iterator first, iterator last) 335 void erase (iterator first, iterator last)
257 { 336 {
258 if (last != first) { 337 if (last != first) {
259 memmove (first, last, (end ()-last)*sizeof (T)); 338 memmove (first, last, (end () - last) * sizeof (T));
260 _last -= last - first; 339 _last -= last - first;
261 } 340 }
262 } 341 }
263 void erase (iterator pos) 342 void erase (iterator pos)
264 { 343 {
265 if (pos != end ()) { 344 if (pos != end ()) {
266 memmove (pos, pos+1, (end ()- (pos+1))*sizeof (T)); 345 memmove (pos, pos+1, (end () - (pos+1)) * sizeof (T));
267 --_last; 346 --_last;
268 } 347 }
269 } 348 }
270 void swap (simplevec<T> &t) 349 void swap (simplevec<T> &t)
271 { 350 {
… …
297} 376}
298 377
299 378
300template<typename T> 379template<typename T>
301struct vector : simplevec<T> 380struct vector : simplevec<T>
302{ }; 381{
382};
383
384struct stringvec : simplevec<char *>
385{
386 ~stringvec ()
387 {
388 for (char **c = begin (); c != end (); c++)
389 free (*c);
390 }
391};
303 392
304#if 0 393#if 0
305template<typename T> 394template<typename T>
306struct rxvt_vec : simplevec<void *> { 395struct rxvt_vec : simplevec<void *>
396{
307 typedef T *iterator; 397 typedef T *iterator;
308 398
309 void push_back (T d) { simplevec<void *>::push_back ((void *)d); } 399 void push_back (T d) { simplevec<void *>::push_back ((void *)d); }
310 T pop_back () { return (T*)simplevec<void *>::pop_back (); } 400 T pop_back () { return (T*)simplevec<void *>::pop_back (); }
311 void erase (int i) { erase (begin () + i); } 401 void erase (int i) { erase (begin () + i); }
… …
315 T &operator [] (int i) { return * (T *) (& ((* (simplevec<void *> *)this)[i])); } 405 T &operator [] (int i) { return * (T *) (& ((* (simplevec<void *> *)this)[i])); }
316 const T &operator [] (int i) const { return * (const T *) (& ((* (const simplevec<void *> *)this)[i])); } 406 const T &operator [] (int i) const { return * (const T *) (& ((* (const simplevec<void *> *)this)[i])); }
317}; 407};
318#endif 408#endif
319 409
320template <typename I, typename T>
321I find (I first, I last, const T& value)
322{
323 while (first != last && *first != value)
324 ++first;
325
326 return first;
327}
328
329template<typename T> 410template<typename T>
330struct auto_ptr { 411struct auto_ptr
412{
331 T *p; 413 T *p;
332 414
333 auto_ptr () : p (0) { } 415 auto_ptr () : p (0) { }
334 auto_ptr (T *a) : p (a) { } 416 auto_ptr (T *a) : p (a) { }
335 417
… …
384 } 466 }
385}; 467};
386 468
387typedef auto_ptr<char> auto_str; 469typedef auto_ptr<char> auto_str;
388 470
389struct stringvec : simplevec<char *>
390{
391 ~stringvec ()
392 {
393 for (char **c = begin (); c != end (); c++)
394 delete [] *c;
395 }
396};
397
398#endif 471#endif
399 472

Diff Legend

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