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

Diff Legend

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