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.36 by ayin, Fri Dec 14 11:11:31 2007 UTC vs.
Revision 1.47 by sf-exg, Thu Jan 19 13:33:43 2012 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 <stdlib.h>
5#include <cstring> 5#include <string.h>
6#include "ecb.h"
6 7
7using namespace std; 8using namespace std;
8
9#define PP_CONCAT_(a, b) a ## b
10#define PP_CONCAT(a, b) PP_CONCAT_(a, b)
11#define PP_STRINGIFY_(a) #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#else
19# define rxvt_attribute(x)
20#endif
21
22#define NORETURN rxvt_attribute ((noreturn))
23#define UNUSED rxvt_attribute ((unused))
24#define CONST rxvt_attribute ((const))
25 9
26// increases code size unless -fno-enforce-eh-specs 10// increases code size unless -fno-enforce-eh-specs
27#if __GNUC__ 11#if __GNUC__
28# define NOTHROW 12# define NOTHROW
29# define THROW(x) 13# define THROW(x)
30#else 14#else
31# define NOTHROW throw() 15# define NOTHROW throw()
32# define THROW(x) throw x 16# define THROW(x) throw x
33#endif 17#endif
34 18
35extern class byteorder {
36 static unsigned int e; // at least 32 bits
37public:
38 byteorder ();
39
40 static bool big_endian () { return e == 0x11223344; };
41 static bool network () { return e == 0x11223344; };
42 static bool little_endian () { return e == 0x44332211; };
43 static bool vax () { return e == 0x44332211; };
44} byteorder;
45
46// various utility functions 19// various utility functions
47template<typename T, typename U> static inline T min (T a, U b) { return a < (T)b ? a : (T)b; } 20template<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; } 21template<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; } 22template<typename T, typename U> static inline T max (T a, U b) { return a > (T)b ? a : (T)b; }
50template<typename T, typename U> static inline void max_it (T &a, U b) { a = a > (T)b ? a : (T)b; } 23template<typename T, typename U> static inline void max_it (T &a, U b) { a = a > (T)b ? a : (T)b; }
… …
81rxvt_temp_buf (int len) 54rxvt_temp_buf (int len)
82{ 55{
83 return (T *)rxvt_temp_buf (len * sizeof (T)); 56 return (T *)rxvt_temp_buf (len * sizeof (T));
84} 57}
85 58
86// some bit functions, xft fuck me plenty
87#if HAVE_GCC_BUILTINS
88static inline int ctz (unsigned int x) { return __builtin_ctz (x); }
89static inline int popcount (unsigned int x) { return __builtin_popcount (x); }
90#else
91// count trailing zero bits and count # of one bits
92int ctz (unsigned int x) CONST;
93int popcount (unsigned int x) CONST;
94#endif
95
96// in range including end 59// in range including end
97#define IN_RANGE_INC(val,beg,end) \ 60#define IN_RANGE_INC(val,beg,end) \
98 ((unsigned int)(val) - (unsigned int)(beg) <= (unsigned int)(end) - (unsigned int)(beg)) 61 ((unsigned int)(val) - (unsigned int)(beg) <= (unsigned int)(end) - (unsigned int)(beg))
99 62
100// in range excluding end 63// in range excluding end
… …
103 66
104// for m >= -n, ensure remainder lies between 0..n-1 67// for m >= -n, ensure remainder lies between 0..n-1
105#define MOD(m,n) (((m) + (n)) % (n)) 68#define MOD(m,n) (((m) + (n)) % (n))
106 69
107// makes dynamically allocated objects zero-initialised 70// makes dynamically allocated objects zero-initialised
108struct zero_initialized { 71struct zero_initialized
72{
109 void *operator new (size_t s); 73 void *operator new (size_t s);
110 void operator delete (void *p, size_t s); 74 void operator delete (void *p, size_t s);
111}; 75};
112 76
113/* simplevec taken (and heavily modified), from: 77/* simplevec taken (and heavily modified), from:
114 * 78 *
115 * MICO --- a free CORBA implementation 79 * MICO --- a free CORBA implementation
116 * Copyright (C) 1997-98 Kay Roemer & Arno Puder 80 * Copyright (C) 1997-98 Kay Roemer & Arno Puder
117 */ 81 */
118template<class T> 82template<class T>
119struct simplevec { 83struct simplevec
84{
120 typedef T* iterator; 85 typedef T* iterator;
121 typedef const T* const_iterator; 86 typedef const T* const_iterator;
122 typedef unsigned long size_type; 87 typedef unsigned long size_type;
123 88
124private: 89private:
… …
379 } 344 }
380}; 345};
381 346
382#if 0 347#if 0
383template<typename T> 348template<typename T>
384struct rxvt_vec : simplevec<void *> { 349struct rxvt_vec : simplevec<void *>
350{
385 typedef T *iterator; 351 typedef T *iterator;
386 352
387 void push_back (T d) { simplevec<void *>::push_back ((void *)d); } 353 void push_back (T d) { simplevec<void *>::push_back ((void *)d); }
388 T pop_back () { return (T*)simplevec<void *>::pop_back (); } 354 T pop_back () { return (T*)simplevec<void *>::pop_back (); }
389 void erase (int i) { erase (begin () + i); } 355 void erase (int i) { erase (begin () + i); }
… …
394 const T &operator [] (int i) const { return * (const T *) (& ((* (const simplevec<void *> *)this)[i])); } 360 const T &operator [] (int i) const { return * (const T *) (& ((* (const simplevec<void *> *)this)[i])); }
395}; 361};
396#endif 362#endif
397 363
398template<typename T> 364template<typename T>
399struct auto_ptr { 365struct auto_ptr
366{
400 T *p; 367 T *p;
401 368
402 auto_ptr () : p (0) { } 369 auto_ptr () : p (0) { }
403 auto_ptr (T *a) : p (a) { } 370 auto_ptr (T *a) : p (a) { }
404 371

Diff Legend

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