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

Diff Legend

Removed lines
+ Added lines
< Changed lines
> Changed lines