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.22 by root, Sun Jan 29 22:27:04 2006 UTC vs.
Revision 1.39 by root, Fri Sep 4 15:40:13 2009 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
14#define HAVE_GCC_BUILTINS 0 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
15 42
16extern class byteorder { 43extern class byteorder {
17 static unsigned int e; // at least 32 bits 44 static unsigned int e; // at least 32 bits
18public: 45public:
19 byteorder (); 46 byteorder ();
… …
33template<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; }
34template<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; }
35 62
36template<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; }
37 64
65template<typename T> static inline T squared_diff (T a, T b) { return (a-b)*(a-b); }
66
38// linear interpolation 67// linear interpolation
39template<typename T, typename U, typename P> 68template<typename T, typename U, typename P>
40static inline 69static inline
41T lerp (T a, U b, P p) 70T lerp (T a, U b, P p)
42{ 71{
43 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));
44} 92}
45 93
46// some bit functions, xft fuck me plenty 94// some bit functions, xft fuck me plenty
47#if HAVE_GCC_BUILTINS 95#if HAVE_GCC_BUILTINS
96/* netbsd stupidly defines popcount itself and puts it into string.h */
48static inline int ctz (unsigned int x) { return __builtin_ctz (x); } 97static inline int rxvt_ctz (unsigned int x) { return __builtin_ctz (x); }
49static inline int popcount (unsigned int x) { return __builtin_popcount (x); } 98static inline int rxvt_popcount (unsigned int x) { return __builtin_popcount (x); }
50#else 99#else
51// count trailing zero bits and count # of one bits 100// count trailing zero bits and count # of one bits
52int ctz (unsigned int x); 101int rxvt_ctz (unsigned int x) CONST;
53int popcount (unsigned int x); 102int rxvt_popcount (unsigned int x) CONST;
54#endif 103#endif
55 104
56// in range including end 105// in range including end
57#define IN_RANGE_INC(val,beg,end) \ 106#define IN_RANGE_INC(val,beg,end) \
58 ((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))
59 108
60// in range excluding end 109// in range excluding end
61#define IN_RANGE_EXC(val,beg,end) \ 110#define IN_RANGE_EXC(val,beg,end) \
62 ((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))
63 112
113// for m >= -n, ensure remainder lies between 0..n-1
114#define MOD(m,n) (((m) + (n)) % (n))
115
64// makes dynamically allocated objects zero-initialised 116// makes dynamically allocated objects zero-initialised
65struct zero_initialized { 117struct zero_initialized
118{
66 void *operator new (size_t s); 119 void *operator new (size_t s);
67 void operator delete (void *p, size_t s); 120 void operator delete (void *p, size_t s);
68}; 121};
69 122
70/* simplevec taken (and heavily modified), from: 123/* simplevec taken (and heavily modified), from:
71 * 124 *
72 * MICO --- a free CORBA implementation 125 * MICO --- a free CORBA implementation
73 * Copyright (C) 1997-98 Kay Roemer & Arno Puder 126 * Copyright (C) 1997-98 Kay Roemer & Arno Puder
74 */ 127 */
75template<class T> 128template<class T>
76struct simplevec { 129struct simplevec
130{
77 typedef T* iterator; 131 typedef T* iterator;
78 typedef const T* const_iterator; 132 typedef const T* const_iterator;
79 typedef unsigned long size_type; 133 typedef unsigned long size_type;
80 134
81private: 135private:
… …
322} 376}
323 377
324 378
325template<typename T> 379template<typename T>
326struct vector : simplevec<T> 380struct vector : simplevec<T>
327{ }; 381{
382};
383
384struct stringvec : simplevec<char *>
385{
386 ~stringvec ()
387 {
388 for (char **c = begin (); c != end (); c++)
389 free (*c);
390 }
391};
328 392
329#if 0 393#if 0
330template<typename T> 394template<typename T>
331struct rxvt_vec : simplevec<void *> { 395struct rxvt_vec : simplevec<void *>
396{
332 typedef T *iterator; 397 typedef T *iterator;
333 398
334 void push_back (T d) { simplevec<void *>::push_back ((void *)d); } 399 void push_back (T d) { simplevec<void *>::push_back ((void *)d); }
335 T pop_back () { return (T*)simplevec<void *>::pop_back (); } 400 T pop_back () { return (T*)simplevec<void *>::pop_back (); }
336 void erase (int i) { erase (begin () + i); } 401 void erase (int i) { erase (begin () + i); }
… …
340 T &operator [] (int i) { return * (T *) (& ((* (simplevec<void *> *)this)[i])); } 405 T &operator [] (int i) { return * (T *) (& ((* (simplevec<void *> *)this)[i])); }
341 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])); }
342}; 407};
343#endif 408#endif
344 409
345template <typename I, typename T>
346I find (I first, I last, const T& value)
347{
348 while (first != last && *first != value)
349 ++first;
350
351 return first;
352}
353
354template<typename T> 410template<typename T>
355struct auto_ptr { 411struct auto_ptr
412{
356 T *p; 413 T *p;
357 414
358 auto_ptr () : p (0) { } 415 auto_ptr () : p (0) { }
359 auto_ptr (T *a) : p (a) { } 416 auto_ptr (T *a) : p (a) { }
360 417
… …
409 } 466 }
410}; 467};
411 468
412typedef auto_ptr<char> auto_str; 469typedef auto_ptr<char> auto_str;
413 470
414struct stringvec : simplevec<char *>
415{
416 ~stringvec ()
417 {
418 for (char **c = begin (); c != end (); c++)
419 free (*c);
420 }
421};
422
423// return a very temporary (and never deallocated) buffer. keep small.
424void *rxvt_temp_buf (int len);
425
426template<typename T>
427inline T *
428rxvt_temp_buf (int len)
429{
430 return (T *)rxvt_temp_buf (len * sizeof (T));
431}
432
433#endif 471#endif
434 472

Diff Legend

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