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.23 by root, Sun Jan 29 22:30:21 2006 UTC vs.
Revision 1.43 by root, Mon Jan 3 18:42:58 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 <cstdlib>
5#include <cstring> 5#include <cstring>
6#include <inttypes.h>
7
8using namespace std;
9
10#define ARRAY_LENGTH(v) (sizeof (v) / sizeof ((v)[0]))
6 11
7#define PP_CONCAT_(a, b) a ## b 12#define PP_CONCAT_(a, b) a ## b
8#define PP_CONCAT(a, b) PP_CONCAT_(a, b) 13#define PP_CONCAT(a, b) PP_CONCAT_(a, b)
9#define PP_STRINGIFY_(a) #a 14#define PP_STRINGIFY_(a) #a
10#define PP_STRINGIFY(a) PP_STRINGIFY_(a) 15#define PP_STRINGIFY(a) PP_STRINGIFY_(a)
11 16
12// actually, some gcc-3.x versions work, too 17#define HAVE_GCC_BUILTINS (__GNUC__ >= 4 || (__GNUC__ == 3 && __GNUC_MINOR__ == 4))
13#define HAVE_GCC_BUILTINS (__GNUC__ >= 4)
14 18
15extern class byteorder { 19#if __GNUC__ >= 4
16 static unsigned int e; // at least 32 bits 20# define rxvt_attribute(x) __attribute__(x)
17public: 21# define expect(expr,value) __builtin_expect ((expr),(value))
18 byteorder (); 22#else
23# define rxvt_attribute(x)
24# define expect(expr,value) (expr)
25#endif
19 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
20 static bool big_endian () { return e == 0x11223344; }; 53 static bool big_endian () { return e () == 0x11; };
21 static bool network () { return e == 0x11223344; }; 54 static bool network () { return big_endian (); };
22 static bool little_endian () { return e == 0x44332211; }; 55 static bool little_endian () { return e () == 0x44; };
23 static bool vax () { return e == 0x44332211; }; 56 static bool vax () { return little_endian (); };
24} byteorder; 57};
25 58
26// various utility functions 59// various utility functions
27template<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; }
28template<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; }
29template<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; }
… …
32template<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; }
33template<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; }
34 67
35template<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; }
36 69
70template<typename T> static inline T squared_diff (T a, T b) { return (a-b)*(a-b); }
71
37// linear interpolation 72// linear interpolation
38template<typename T, typename U, typename P> 73template<typename T, typename U, typename P>
39static inline 74static inline
40T lerp (T a, U b, P p) 75T lerp (T a, U b, P p)
41{ 76{
42 return (int(a) * int(p) + int(b) * int(100 - p)) / 100; 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));
43} 97}
44 98
45// some bit functions, xft fuck me plenty 99// some bit functions, xft fuck me plenty
46#if HAVE_GCC_BUILTINS 100#if HAVE_GCC_BUILTINS
101/* netbsd stupidly defines popcount itself and puts it into string.h */
47static inline int ctz (unsigned int x) { return __builtin_ctz (x); } 102static inline int rxvt_ctz (unsigned int x) { return __builtin_ctz (x); }
48static inline int popcount (unsigned int x) { return __builtin_popcount (x); } 103static inline int rxvt_popcount (unsigned int x) { return __builtin_popcount (x); }
49#else 104#else
50// count trailing zero bits and count # of one bits 105// count trailing zero bits and count # of one bits
51int ctz (unsigned int x); 106int rxvt_ctz (unsigned int x) CONST;
52int popcount (unsigned int x); 107int rxvt_popcount (unsigned int x) CONST;
53#endif 108#endif
54 109
55// in range including end 110// in range including end
56#define IN_RANGE_INC(val,beg,end) \ 111#define IN_RANGE_INC(val,beg,end) \
57 ((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))
58 113
59// in range excluding end 114// in range excluding end
60#define IN_RANGE_EXC(val,beg,end) \ 115#define IN_RANGE_EXC(val,beg,end) \
61 ((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))
62 117
118// for m >= -n, ensure remainder lies between 0..n-1
119#define MOD(m,n) (((m) + (n)) % (n))
120
63// makes dynamically allocated objects zero-initialised 121// makes dynamically allocated objects zero-initialised
64struct zero_initialized { 122struct zero_initialized
123{
65 void *operator new (size_t s); 124 void *operator new (size_t s);
66 void operator delete (void *p, size_t s); 125 void operator delete (void *p, size_t s);
67}; 126};
68 127
69/* simplevec taken (and heavily modified), from: 128/* simplevec taken (and heavily modified), from:
70 * 129 *
71 * MICO --- a free CORBA implementation 130 * MICO --- a free CORBA implementation
72 * Copyright (C) 1997-98 Kay Roemer & Arno Puder 131 * Copyright (C) 1997-98 Kay Roemer & Arno Puder
73 */ 132 */
74template<class T> 133template<class T>
75struct simplevec { 134struct simplevec
135{
76 typedef T* iterator; 136 typedef T* iterator;
77 typedef const T* const_iterator; 137 typedef const T* const_iterator;
78 typedef unsigned long size_type; 138 typedef unsigned long size_type;
79 139
80private: 140private:
… …
321} 381}
322 382
323 383
324template<typename T> 384template<typename T>
325struct vector : simplevec<T> 385struct vector : simplevec<T>
326{ }; 386{
387};
388
389struct stringvec : simplevec<char *>
390{
391 ~stringvec ()
392 {
393 for (char **c = begin (); c != end (); c++)
394 free (*c);
395 }
396};
327 397
328#if 0 398#if 0
329template<typename T> 399template<typename T>
330struct rxvt_vec : simplevec<void *> { 400struct rxvt_vec : simplevec<void *>
401{
331 typedef T *iterator; 402 typedef T *iterator;
332 403
333 void push_back (T d) { simplevec<void *>::push_back ((void *)d); } 404 void push_back (T d) { simplevec<void *>::push_back ((void *)d); }
334 T pop_back () { return (T*)simplevec<void *>::pop_back (); } 405 T pop_back () { return (T*)simplevec<void *>::pop_back (); }
335 void erase (int i) { erase (begin () + i); } 406 void erase (int i) { erase (begin () + i); }
… …
339 T &operator [] (int i) { return * (T *) (& ((* (simplevec<void *> *)this)[i])); } 410 T &operator [] (int i) { return * (T *) (& ((* (simplevec<void *> *)this)[i])); }
340 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])); }
341}; 412};
342#endif 413#endif
343 414
344template <typename I, typename T>
345I find (I first, I last, const T& value)
346{
347 while (first != last && *first != value)
348 ++first;
349
350 return first;
351}
352
353template<typename T> 415template<typename T>
354struct auto_ptr { 416struct auto_ptr
417{
355 T *p; 418 T *p;
356 419
357 auto_ptr () : p (0) { } 420 auto_ptr () : p (0) { }
358 auto_ptr (T *a) : p (a) { } 421 auto_ptr (T *a) : p (a) { }
359 422
… …
408 } 471 }
409}; 472};
410 473
411typedef auto_ptr<char> auto_str; 474typedef auto_ptr<char> auto_str;
412 475
413struct stringvec : simplevec<char *>
414{
415 ~stringvec ()
416 {
417 for (char **c = begin (); c != end (); c++)
418 free (*c);
419 }
420};
421
422// return a very temporary (and never deallocated) buffer. keep small.
423void *rxvt_temp_buf (int len);
424
425template<typename T>
426inline T *
427rxvt_temp_buf (int len)
428{
429 return (T *)rxvt_temp_buf (len * sizeof (T));
430}
431
432#endif 476#endif
433 477

Diff Legend

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