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.30 by root, Tue Nov 20 17:44:44 2007 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>
6 7
7using namespace std; 8using namespace std;
9
10#define ARRAY_LENGTH(v) (sizeof (v) / sizeof ((v)[0]))
8 11
9#define PP_CONCAT_(a, b) a ## b 12#define PP_CONCAT_(a, b) a ## b
10#define PP_CONCAT(a, b) PP_CONCAT_(a, b) 13#define PP_CONCAT(a, b) PP_CONCAT_(a, b)
11#define PP_STRINGIFY_(a) #a 14#define PP_STRINGIFY_(a) #a
12#define PP_STRINGIFY(a) PP_STRINGIFY_(a) 15#define PP_STRINGIFY(a) PP_STRINGIFY_(a)
13 16
14#define HAVE_GCC_BUILTINS (__GNUC__ >= 4 || (__GNUC__ == 3 && __GNUC_MINOR__ == 4)) 17#define HAVE_GCC_BUILTINS (__GNUC__ >= 4 || (__GNUC__ == 3 && __GNUC_MINOR__ == 4))
15 18
16#if __GNUC__ >= 3 19#if __GNUC__ >= 4
17# define rxvt_attribute(x) __attribute__(x) 20# define rxvt_attribute(x) __attribute__(x)
21# define expect(expr,value) __builtin_expect ((expr),(value))
18#else 22#else
19# define rxvt_attribute(x) 23# define rxvt_attribute(x)
24# define expect(expr,value) (expr)
20#endif 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)
21 32
22#define NORETURN rxvt_attribute ((noreturn)) 33#define NORETURN rxvt_attribute ((noreturn))
23#define UNUSED rxvt_attribute ((unused)) 34#define UNUSED rxvt_attribute ((unused))
24#define CONST rxvt_attribute ((const)) 35#define CONST rxvt_attribute ((const))
25 36
… …
30#else 41#else
31# define NOTHROW throw() 42# define NOTHROW throw()
32# define THROW(x) throw x 43# define THROW(x) throw x
33#endif 44#endif
34 45
35extern class byteorder { 46namespace byteorder {
36 static unsigned int e; // at least 32 bits 47 static unsigned char e ()
37public: 48 {
38 byteorder (); 49 const uint32_t u = 0x11223344;
50 return *(unsigned char *)u;
51 }
39 52
40 static bool big_endian () { return e == 0x11223344; }; 53 static bool big_endian () { return e () == 0x11; };
41 static bool network () { return e == 0x11223344; }; 54 static bool network () { return big_endian (); };
42 static bool little_endian () { return e == 0x44332211; }; 55 static bool little_endian () { return e () == 0x44; };
43 static bool vax () { return e == 0x44332211; }; 56 static bool vax () { return little_endian (); };
44} byteorder; 57};
45 58
46// various utility functions 59// various utility functions
47template<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; }
48template<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; }
49template<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; }
… …
62T lerp (T a, U b, P p) 75T lerp (T a, U b, P p)
63{ 76{
64 return (long(a) * long(100 - p) + long(b) * long(p) + 50) / 100; 77 return (long(a) * long(100 - p) + long(b) * long(p) + 50) / 100;
65} 78}
66 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
67// some bit functions, xft fuck me plenty 99// some bit functions, xft fuck me plenty
68#if HAVE_GCC_BUILTINS 100#if HAVE_GCC_BUILTINS
101/* netbsd stupidly defines popcount itself and puts it into string.h */
69static inline int ctz (unsigned int x) { return __builtin_ctz (x); } 102static inline int rxvt_ctz (unsigned int x) { return __builtin_ctz (x); }
70static inline int popcount (unsigned int x) { return __builtin_popcount (x); } 103static inline int rxvt_popcount (unsigned int x) { return __builtin_popcount (x); }
71#else 104#else
72// count trailing zero bits and count # of one bits 105// count trailing zero bits and count # of one bits
73int ctz (unsigned int x) CONST; 106int rxvt_ctz (unsigned int x) CONST;
74int popcount (unsigned int x) CONST; 107int rxvt_popcount (unsigned int x) CONST;
75#endif 108#endif
76 109
77// in range including end 110// in range including end
78#define IN_RANGE_INC(val,beg,end) \ 111#define IN_RANGE_INC(val,beg,end) \
79 ((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))
80 113
81// in range excluding end 114// in range excluding end
82#define IN_RANGE_EXC(val,beg,end) \ 115#define IN_RANGE_EXC(val,beg,end) \
83 ((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))
84 117
118// for m >= -n, ensure remainder lies between 0..n-1
119#define MOD(m,n) (((m) + (n)) % (n))
120
85// makes dynamically allocated objects zero-initialised 121// makes dynamically allocated objects zero-initialised
86struct zero_initialized { 122struct zero_initialized
123{
87 void *operator new (size_t s); 124 void *operator new (size_t s);
88 void operator delete (void *p, size_t s); 125 void operator delete (void *p, size_t s);
89}; 126};
90 127
91/* simplevec taken (and heavily modified), from: 128/* simplevec taken (and heavily modified), from:
92 * 129 *
93 * MICO --- a free CORBA implementation 130 * MICO --- a free CORBA implementation
94 * Copyright (C) 1997-98 Kay Roemer & Arno Puder 131 * Copyright (C) 1997-98 Kay Roemer & Arno Puder
95 */ 132 */
96template<class T> 133template<class T>
97struct simplevec { 134struct simplevec
135{
98 typedef T* iterator; 136 typedef T* iterator;
99 typedef const T* const_iterator; 137 typedef const T* const_iterator;
100 typedef unsigned long size_type; 138 typedef unsigned long size_type;
101 139
102private: 140private:
… …
343} 381}
344 382
345 383
346template<typename T> 384template<typename T>
347struct vector : simplevec<T> 385struct vector : simplevec<T>
348{ }; 386{
387};
388
389struct stringvec : simplevec<char *>
390{
391 ~stringvec ()
392 {
393 for (char **c = begin (); c != end (); c++)
394 free (*c);
395 }
396};
349 397
350#if 0 398#if 0
351template<typename T> 399template<typename T>
352struct rxvt_vec : simplevec<void *> { 400struct rxvt_vec : simplevec<void *>
401{
353 typedef T *iterator; 402 typedef T *iterator;
354 403
355 void push_back (T d) { simplevec<void *>::push_back ((void *)d); } 404 void push_back (T d) { simplevec<void *>::push_back ((void *)d); }
356 T pop_back () { return (T*)simplevec<void *>::pop_back (); } 405 T pop_back () { return (T*)simplevec<void *>::pop_back (); }
357 void erase (int i) { erase (begin () + i); } 406 void erase (int i) { erase (begin () + i); }
… …
361 T &operator [] (int i) { return * (T *) (& ((* (simplevec<void *> *)this)[i])); } 410 T &operator [] (int i) { return * (T *) (& ((* (simplevec<void *> *)this)[i])); }
362 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])); }
363}; 412};
364#endif 413#endif
365 414
366template <typename I, typename T>
367I find (I first, I last, const T& value)
368{
369 while (first != last && *first != value)
370 ++first;
371
372 return first;
373}
374
375template<typename T> 415template<typename T>
376struct auto_ptr { 416struct auto_ptr
417{
377 T *p; 418 T *p;
378 419
379 auto_ptr () : p (0) { } 420 auto_ptr () : p (0) { }
380 auto_ptr (T *a) : p (a) { } 421 auto_ptr (T *a) : p (a) { }
381 422
… …
430 } 471 }
431}; 472};
432 473
433typedef auto_ptr<char> auto_str; 474typedef auto_ptr<char> auto_str;
434 475
435struct stringvec : simplevec<char *>
436{
437 ~stringvec ()
438 {
439 for (char **c = begin (); c != end (); c++)
440 free (*c);
441 }
442};
443
444// return a very temporary (and never deallocated) buffer. keep small.
445void *rxvt_temp_buf (int len);
446
447template<typename T>
448static inline T *
449rxvt_temp_buf (int len)
450{
451 return (T *)rxvt_temp_buf (len * sizeof (T));
452}
453
454#endif 476#endif
455 477

Diff Legend

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