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.46 by sf-exg, Thu Jun 2 13:07:28 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 "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__ >= 3
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; }
… …
62T lerp (T a, U b, P p) 35T lerp (T a, U b, P p)
63{ 36{
64 return (long(a) * long(100 - p) + long(b) * long(p) + 50) / 100; 37 return (long(a) * long(100 - p) + long(b) * long(p) + 50) / 100;
65} 38}
66 39
67// some bit functions, xft fuck me plenty 40template <typename I, typename T>
68#if HAVE_GCC_BUILTINS 41I find (I first, I last, const T& value)
69static inline int ctz (unsigned int x) { return __builtin_ctz (x); } 42{
70static inline int popcount (unsigned int x) { return __builtin_popcount (x); } 43 while (first != last && *first != value)
71#else 44 ++first;
72// count trailing zero bits and count # of one bits 45
73int ctz (unsigned int x) CONST; 46 return first;
74int popcount (unsigned int x) CONST; 47}
75#endif 48
49// return a very temporary (and never deallocated) buffer. keep small.
50void *rxvt_temp_buf (int len);
51
52template<typename T>
53static inline T *
54rxvt_temp_buf (int len)
55{
56 return (T *)rxvt_temp_buf (len * sizeof (T));
57}
76 58
77// in range including end 59// in range including end
78#define IN_RANGE_INC(val,beg,end) \ 60#define IN_RANGE_INC(val,beg,end) \
79 ((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))
80 62
81// in range excluding end 63// in range excluding end
82#define IN_RANGE_EXC(val,beg,end) \ 64#define IN_RANGE_EXC(val,beg,end) \
83 ((unsigned int)(val) - (unsigned int)(beg) < (unsigned int)(end) - (unsigned int)(beg)) 65 ((unsigned int)(val) - (unsigned int)(beg) < (unsigned int)(end) - (unsigned int)(beg))
84 66
67// for m >= -n, ensure remainder lies between 0..n-1
68#define MOD(m,n) (((m) + (n)) % (n))
69
85// makes dynamically allocated objects zero-initialised 70// makes dynamically allocated objects zero-initialised
86struct zero_initialized { 71struct zero_initialized
72{
87 void *operator new (size_t s); 73 void *operator new (size_t s);
88 void operator delete (void *p, size_t s); 74 void operator delete (void *p, size_t s);
89}; 75};
90 76
91/* simplevec taken (and heavily modified), from: 77/* simplevec taken (and heavily modified), from:
92 * 78 *
93 * MICO --- a free CORBA implementation 79 * MICO --- a free CORBA implementation
94 * Copyright (C) 1997-98 Kay Roemer & Arno Puder 80 * Copyright (C) 1997-98 Kay Roemer & Arno Puder
95 */ 81 */
96template<class T> 82template<class T>
97struct simplevec { 83struct simplevec
84{
98 typedef T* iterator; 85 typedef T* iterator;
99 typedef const T* const_iterator; 86 typedef const T* const_iterator;
100 typedef unsigned long size_type; 87 typedef unsigned long size_type;
101 88
102private: 89private:
… …
343} 330}
344 331
345 332
346template<typename T> 333template<typename T>
347struct vector : simplevec<T> 334struct vector : simplevec<T>
348{ }; 335{
336};
337
338struct stringvec : simplevec<char *>
339{
340 ~stringvec ()
341 {
342 for (char **c = begin (); c != end (); c++)
343 free (*c);
344 }
345};
349 346
350#if 0 347#if 0
351template<typename T> 348template<typename T>
352struct rxvt_vec : simplevec<void *> { 349struct rxvt_vec : simplevec<void *>
350{
353 typedef T *iterator; 351 typedef T *iterator;
354 352
355 void push_back (T d) { simplevec<void *>::push_back ((void *)d); } 353 void push_back (T d) { simplevec<void *>::push_back ((void *)d); }
356 T pop_back () { return (T*)simplevec<void *>::pop_back (); } 354 T pop_back () { return (T*)simplevec<void *>::pop_back (); }
357 void erase (int i) { erase (begin () + i); } 355 void erase (int i) { erase (begin () + i); }
… …
361 T &operator [] (int i) { return * (T *) (& ((* (simplevec<void *> *)this)[i])); } 359 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])); } 360 const T &operator [] (int i) const { return * (const T *) (& ((* (const simplevec<void *> *)this)[i])); }
363}; 361};
364#endif 362#endif
365 363
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> 364template<typename T>
376struct auto_ptr { 365struct auto_ptr
366{
377 T *p; 367 T *p;
378 368
379 auto_ptr () : p (0) { } 369 auto_ptr () : p (0) { }
380 auto_ptr (T *a) : p (a) { } 370 auto_ptr (T *a) : p (a) { }
381 371
… …
430 } 420 }
431}; 421};
432 422
433typedef auto_ptr<char> auto_str; 423typedef auto_ptr<char> auto_str;
434 424
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 425#endif
455 426

Diff Legend

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