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.37 by root, Mon Jul 21 16:51:31 2008 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
7using namespace std;
6 8
7#define PP_CONCAT_(a, b) a ## b 9#define PP_CONCAT_(a, b) a ## b
8#define PP_CONCAT(a, b) PP_CONCAT_(a, b) 10#define PP_CONCAT(a, b) PP_CONCAT_(a, b)
9#define PP_STRINGIFY_(a) #a 11#define PP_STRINGIFY_(a) #a
10#define PP_STRINGIFY(a) PP_STRINGIFY_(a) 12#define PP_STRINGIFY(a) PP_STRINGIFY_(a)
11 13
12// actually, some gcc-3.x versions work, too 14#define HAVE_GCC_BUILTINS (__GNUC__ >= 4 || (__GNUC__ == 3 && __GNUC_MINOR__ == 4))
13#define HAVE_GCC_BUILTINS (__GNUC__ >= 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 mosty 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
14 42
15extern class byteorder { 43extern class byteorder {
16 static unsigned int e; // at least 32 bits 44 static unsigned int e; // at least 32 bits
17public: 45public:
18 byteorder (); 46 byteorder ();
… …
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; } 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; }
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; } 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; }
34 62
35template<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; }
36 64
65template<typename T> static inline T squared_diff (T a, T b) { return (a-b)*(a-b); }
66
37// linear interpolation 67// linear interpolation
38template<typename T, typename U, typename P> 68template<typename T, typename U, typename P>
39static inline 69static inline
40T lerp (T a, U b, P p) 70T lerp (T a, U b, P p)
41{ 71{
42 return (int(a) * int(p) + int(b) * int(100 - p)) / 100; 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));
43} 92}
44 93
45// some bit functions, xft fuck me plenty 94// some bit functions, xft fuck me plenty
46#if HAVE_GCC_BUILTINS 95#if HAVE_GCC_BUILTINS
47static inline int ctz (unsigned int x) { return __builtin_ctz (x); } 96static inline int ctz (unsigned int x) { return __builtin_ctz (x); }
48static inline int popcount (unsigned int x) { return __builtin_popcount (x); } 97static inline int popcount (unsigned int x) { return __builtin_popcount (x); }
49#else 98#else
50// count trailing zero bits and count # of one bits 99// count trailing zero bits and count # of one bits
51int ctz (unsigned int x); 100int ctz (unsigned int x) CONST;
52int popcount (unsigned int x); 101int popcount (unsigned int x) CONST;
53#endif 102#endif
54 103
55// in range including end 104// in range including end
56#define IN_RANGE_INC(val,beg,end) \ 105#define IN_RANGE_INC(val,beg,end) \
57 ((unsigned int)(val) - (unsigned int)(beg) <= (unsigned int)(end) - (unsigned int)(beg)) 106 ((unsigned int)(val) - (unsigned int)(beg) <= (unsigned int)(end) - (unsigned int)(beg))
58 107
59// in range excluding end 108// in range excluding end
60#define IN_RANGE_EXC(val,beg,end) \ 109#define IN_RANGE_EXC(val,beg,end) \
61 ((unsigned int)(val) - (unsigned int)(beg) < (unsigned int)(end) - (unsigned int)(beg)) 110 ((unsigned int)(val) - (unsigned int)(beg) < (unsigned int)(end) - (unsigned int)(beg))
111
112// for m >= -n, ensure remainder lies between 0..n-1
113#define MOD(m,n) (((m) + (n)) % (n))
62 114
63// makes dynamically allocated objects zero-initialised 115// makes dynamically allocated objects zero-initialised
64struct zero_initialized { 116struct zero_initialized {
65 void *operator new (size_t s); 117 void *operator new (size_t s);
66 void operator delete (void *p, size_t s); 118 void operator delete (void *p, size_t s);
67}; 119};
68 120
69/* simplevec taken (and heavily modified), from: 121/* simplevec taken (and heavily modified), from:
70 * 122 *
71 * MICO --- a free CORBA implementation 123 * MICO --- a free CORBA implementation
72 * Copyright (C) 1997-98 Kay Roemer & Arno Puder 124 * Copyright (C) 1997-98 Kay Roemer & Arno Puder
73 */ 125 */
74template<class T> 126template<class T>
75struct simplevec { 127struct simplevec {
… …
321} 373}
322 374
323 375
324template<typename T> 376template<typename T>
325struct vector : simplevec<T> 377struct vector : simplevec<T>
326{ }; 378{
379};
380
381struct stringvec : simplevec<char *>
382{
383 ~stringvec ()
384 {
385 for (char **c = begin (); c != end (); c++)
386 free (*c);
387 }
388};
327 389
328#if 0 390#if 0
329template<typename T> 391template<typename T>
330struct rxvt_vec : simplevec<void *> { 392struct rxvt_vec : simplevec<void *> {
331 typedef T *iterator; 393 typedef T *iterator;
… …
339 T &operator [] (int i) { return * (T *) (& ((* (simplevec<void *> *)this)[i])); } 401 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])); } 402 const T &operator [] (int i) const { return * (const T *) (& ((* (const simplevec<void *> *)this)[i])); }
341}; 403};
342#endif 404#endif
343 405
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> 406template<typename T>
354struct auto_ptr { 407struct auto_ptr {
355 T *p; 408 T *p;
356 409
357 auto_ptr () : p (0) { } 410 auto_ptr () : p (0) { }
… …
408 } 461 }
409}; 462};
410 463
411typedef auto_ptr<char> auto_str; 464typedef auto_ptr<char> auto_str;
412 465
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 466#endif
433 467

Diff Legend

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