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.37 by root, Mon Jul 21 16:51:31 2008 UTC vs.
Revision 1.48 by root, Thu Jan 19 17:10:51 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 6#include "ecb.h"
7using 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# 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 mosty 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 7
34// increases code size unless -fno-enforce-eh-specs 8// increases code size unless -fno-enforce-eh-specs
35#if __GNUC__ 9#if __GNUC__
36# define NOTHROW 10# define NOTHROW
37# define THROW(x) 11# define THROW(x)
38#else 12#else
39# define NOTHROW throw() 13# define NOTHROW throw()
40# define THROW(x) throw x 14# define THROW(x) throw x
41#endif 15#endif
42 16
43extern class byteorder {
44 static unsigned int e; // at least 32 bits
45public:
46 byteorder ();
47
48 static bool big_endian () { return e == 0x11223344; };
49 static bool network () { return e == 0x11223344; };
50 static bool little_endian () { return e == 0x44332211; };
51 static bool vax () { return e == 0x44332211; };
52} byteorder;
53
54// various utility functions 17// various utility functions
55template<typename T, typename U> static inline T min (T a, U b) { return a < (T)b ? a : (T)b; } 18template<typename T, typename U> static inline T min (T a, U b) { return a < (T)b ? a : (T)b; }
56template<typename T, typename U> static inline void min_it (T &a, U b) { a = a < (T)b ? a : (T)b; } 19template<typename T, typename U> static inline void min_it (T &a, U b) { a = a < (T)b ? a : (T)b; }
57template<typename T, typename U> static inline T max (T a, U b) { return a > (T)b ? a : (T)b; } 20template<typename T, typename U> static inline T max (T a, U b) { return a > (T)b ? a : (T)b; }
58template<typename T, typename U> static inline void max_it (T &a, U b) { a = a > (T)b ? a : (T)b; } 21template<typename T, typename U> static inline void max_it (T &a, U b) { a = a > (T)b ? a : (T)b; }
… …
89rxvt_temp_buf (int len) 52rxvt_temp_buf (int len)
90{ 53{
91 return (T *)rxvt_temp_buf (len * sizeof (T)); 54 return (T *)rxvt_temp_buf (len * sizeof (T));
92} 55}
93 56
94// some bit functions, xft fuck me plenty
95#if HAVE_GCC_BUILTINS
96static inline int ctz (unsigned int x) { return __builtin_ctz (x); }
97static inline int popcount (unsigned int x) { return __builtin_popcount (x); }
98#else
99// count trailing zero bits and count # of one bits
100int ctz (unsigned int x) CONST;
101int popcount (unsigned int x) CONST;
102#endif
103
104// in range including end 57// in range including end
105#define IN_RANGE_INC(val,beg,end) \ 58#define IN_RANGE_INC(val,beg,end) \
106 ((unsigned int)(val) - (unsigned int)(beg) <= (unsigned int)(end) - (unsigned int)(beg)) 59 ((unsigned int)(val) - (unsigned int)(beg) <= (unsigned int)(end) - (unsigned int)(beg))
107 60
108// in range excluding end 61// in range excluding end
… …
111 64
112// for m >= -n, ensure remainder lies between 0..n-1 65// for m >= -n, ensure remainder lies between 0..n-1
113#define MOD(m,n) (((m) + (n)) % (n)) 66#define MOD(m,n) (((m) + (n)) % (n))
114 67
115// makes dynamically allocated objects zero-initialised 68// makes dynamically allocated objects zero-initialised
116struct zero_initialized { 69struct zero_initialized
70{
117 void *operator new (size_t s); 71 void *operator new (size_t s);
118 void operator delete (void *p, size_t s); 72 void operator delete (void *p, size_t s);
119}; 73};
120 74
121/* simplevec taken (and heavily modified), from: 75/* simplevec taken (and heavily modified), from:
122 * 76 *
123 * MICO --- a free CORBA implementation 77 * MICO --- a free CORBA implementation
124 * Copyright (C) 1997-98 Kay Roemer & Arno Puder 78 * Copyright (C) 1997-98 Kay Roemer & Arno Puder
125 */ 79 */
126template<class T> 80template<class T>
127struct simplevec { 81struct simplevec
82{
128 typedef T* iterator; 83 typedef T* iterator;
129 typedef const T* const_iterator; 84 typedef const T* const_iterator;
130 typedef unsigned long size_type; 85 typedef unsigned long size_type;
131 86
132private: 87private:
… …
387 } 342 }
388}; 343};
389 344
390#if 0 345#if 0
391template<typename T> 346template<typename T>
392struct rxvt_vec : simplevec<void *> { 347struct rxvt_vec : simplevec<void *>
348{
393 typedef T *iterator; 349 typedef T *iterator;
394 350
395 void push_back (T d) { simplevec<void *>::push_back ((void *)d); } 351 void push_back (T d) { simplevec<void *>::push_back ((void *)d); }
396 T pop_back () { return (T*)simplevec<void *>::pop_back (); } 352 T pop_back () { return (T*)simplevec<void *>::pop_back (); }
397 void erase (int i) { erase (begin () + i); } 353 void erase (int i) { erase (begin () + i); }
… …
402 const T &operator [] (int i) const { return * (const T *) (& ((* (const simplevec<void *> *)this)[i])); } 358 const T &operator [] (int i) const { return * (const T *) (& ((* (const simplevec<void *> *)this)[i])); }
403}; 359};
404#endif 360#endif
405 361
406template<typename T> 362template<typename T>
407struct auto_ptr { 363struct auto_ptr
364{
408 T *p; 365 T *p;
409 366
410 auto_ptr () : p (0) { } 367 auto_ptr () : p (0) { }
411 auto_ptr (T *a) : p (a) { } 368 auto_ptr (T *a) : p (a) { }
412 369

Diff Legend

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