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

Diff Legend

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