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.21 by root, Sun Jan 29 20:51:28 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 <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)
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
11 42
12extern class byteorder { 43extern class byteorder {
13 static unsigned int e; // at least 32 bits 44 static unsigned int e; // at least 32 bits
14public: 45public:
15 byteorder (); 46 byteorder ();
… …
29template<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; }
30template<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; }
31 62
32template<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; }
33 64
65template<typename T> static inline T squared_diff (T a, T b) { return (a-b)*(a-b); }
66
34// linear interpolation 67// linear interpolation
35template<typename T, typename U, typename P> 68template<typename T, typename U, typename P>
36static inline 69static inline
37T lerp (T a, U b, P p) 70T lerp (T a, U b, P p)
38{ 71{
39 return (int(a) * int(p) + int(b) * int(100 - p)) / 100; 72 return (long(a) * long(100 - p) + long(b) * long(p) + 50) / 100;
40} 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
41 104
42// in range including end 105// in range including end
43#define IN_RANGE_INC(val,beg,end) \ 106#define IN_RANGE_INC(val,beg,end) \
44 ((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))
45 108
46// in range excluding end 109// in range excluding end
47#define IN_RANGE_EXC(val,beg,end) \ 110#define IN_RANGE_EXC(val,beg,end) \
48 ((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))
49 112
113// for m >= -n, ensure remainder lies between 0..n-1
114#define MOD(m,n) (((m) + (n)) % (n))
115
50// makes dynamically allocated objects zero-initialised 116// makes dynamically allocated objects zero-initialised
51struct zero_initialized { 117struct zero_initialized
118{
52 void *operator new (size_t s); 119 void *operator new (size_t s);
53 void operator delete (void *p, size_t s); 120 void operator delete (void *p, size_t s);
54}; 121};
55 122
56/* simplevec taken (and heavily modified), from: 123/* simplevec taken (and heavily modified), from:
57 * 124 *
58 * MICO --- a free CORBA implementation 125 * MICO --- a free CORBA implementation
59 * Copyright (C) 1997-98 Kay Roemer & Arno Puder 126 * Copyright (C) 1997-98 Kay Roemer & Arno Puder
60 */ 127 */
61template<class T> 128template<class T>
62struct simplevec { 129struct simplevec
130{
63 typedef T* iterator; 131 typedef T* iterator;
64 typedef const T* const_iterator; 132 typedef const T* const_iterator;
65 typedef unsigned long size_type; 133 typedef unsigned long size_type;
66 134
67private: 135private:
… …
308} 376}
309 377
310 378
311template<typename T> 379template<typename T>
312struct vector : simplevec<T> 380struct vector : simplevec<T>
313{ }; 381{
382};
383
384struct stringvec : simplevec<char *>
385{
386 ~stringvec ()
387 {
388 for (char **c = begin (); c != end (); c++)
389 free (*c);
390 }
391};
314 392
315#if 0 393#if 0
316template<typename T> 394template<typename T>
317struct rxvt_vec : simplevec<void *> { 395struct rxvt_vec : simplevec<void *>
396{
318 typedef T *iterator; 397 typedef T *iterator;
319 398
320 void push_back (T d) { simplevec<void *>::push_back ((void *)d); } 399 void push_back (T d) { simplevec<void *>::push_back ((void *)d); }
321 T pop_back () { return (T*)simplevec<void *>::pop_back (); } 400 T pop_back () { return (T*)simplevec<void *>::pop_back (); }
322 void erase (int i) { erase (begin () + i); } 401 void erase (int i) { erase (begin () + i); }
… …
326 T &operator [] (int i) { return * (T *) (& ((* (simplevec<void *> *)this)[i])); } 405 T &operator [] (int i) { return * (T *) (& ((* (simplevec<void *> *)this)[i])); }
327 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])); }
328}; 407};
329#endif 408#endif
330 409
331template <typename I, typename T>
332I find (I first, I last, const T& value)
333{
334 while (first != last && *first != value)
335 ++first;
336
337 return first;
338}
339
340template<typename T> 410template<typename T>
341struct auto_ptr { 411struct auto_ptr
412{
342 T *p; 413 T *p;
343 414
344 auto_ptr () : p (0) { } 415 auto_ptr () : p (0) { }
345 auto_ptr (T *a) : p (a) { } 416 auto_ptr (T *a) : p (a) { }
346 417
… …
395 } 466 }
396}; 467};
397 468
398typedef auto_ptr<char> auto_str; 469typedef auto_ptr<char> auto_str;
399 470
400struct stringvec : simplevec<char *>
401{
402 ~stringvec ()
403 {
404 for (char **c = begin (); c != end (); c++)
405 free (*c);
406 }
407};
408
409// return a very temporary (and never deallocated) buffer. keep small.
410void *rxvt_temp_buf (int len);
411
412template<typename T>
413inline T *
414rxvt_temp_buf (int len)
415{
416 return (T *)rxvt_temp_buf (len * sizeof (T));
417}
418
419#endif 471#endif
420 472

Diff Legend

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