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.29 by ayin, Wed Oct 31 09:55:24 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#ifndef __attribute__
17# if __GNUC__
18# if (__GNUC__ == 2 && __GNUC_MINOR__ < 5) || (__GNUC__ < 2)
19# define __attribute__(x)
20# endif
21# endif
22# define __attribute__(x)
23#endif
24
25#define NORETURN __attribute__ ((noreturn))
26#define UNUSED __attribute__ ((unused))
27#define CONST __attribute__ ((const))
28 9
29// increases code size unless -fno-enforce-eh-specs 10// increases code size unless -fno-enforce-eh-specs
30#if __GNUC__ 11#if __GNUC__
31# define NOTHROW 12# define NOTHROW
32# define THROW(x) 13# define THROW(x)
33#else 14#else
34# define NOTHROW throw() 15# define NOTHROW throw()
35# define THROW(x) throw x 16# define THROW(x) throw x
36#endif 17#endif
37 18
38extern class byteorder {
39 static unsigned int e; // at least 32 bits
40public:
41 byteorder ();
42
43 static bool big_endian () { return e == 0x11223344; };
44 static bool network () { return e == 0x11223344; };
45 static bool little_endian () { return e == 0x44332211; };
46 static bool vax () { return e == 0x44332211; };
47} byteorder;
48
49// various utility functions 19// various utility functions
50template<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; }
51template<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; }
52template<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; }
53template<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; }
… …
65T lerp (T a, U b, P p) 35T lerp (T a, U b, P p)
66{ 36{
67 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;
68} 38}
69 39
70// some bit functions, xft fuck me plenty 40template <typename I, typename T>
71#if HAVE_GCC_BUILTINS 41I find (I first, I last, const T& value)
72static inline int ctz (unsigned int x) CONST { return __builtin_ctz (x); } 42{
73static inline int popcount (unsigned int x) CONST { return __builtin_popcount (x); } 43 while (first != last && *first != value)
74#else 44 ++first;
75// count trailing zero bits and count # of one bits 45
76int ctz (unsigned int x) CONST; 46 return first;
77int popcount (unsigned int x) CONST; 47}
78#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}
79 58
80// in range including end 59// in range including end
81#define IN_RANGE_INC(val,beg,end) \ 60#define IN_RANGE_INC(val,beg,end) \
82 ((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))
83 62
84// in range excluding end 63// in range excluding end
85#define IN_RANGE_EXC(val,beg,end) \ 64#define IN_RANGE_EXC(val,beg,end) \
86 ((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))
87 66
67// for m >= -n, ensure remainder lies between 0..n-1
68#define MOD(m,n) (((m) + (n)) % (n))
69
88// makes dynamically allocated objects zero-initialised 70// makes dynamically allocated objects zero-initialised
89struct zero_initialized { 71struct zero_initialized
72{
90 void *operator new (size_t s); 73 void *operator new (size_t s);
91 void operator delete (void *p, size_t s); 74 void operator delete (void *p, size_t s);
92}; 75};
93 76
94/* simplevec taken (and heavily modified), from: 77/* simplevec taken (and heavily modified), from:
95 * 78 *
96 * MICO --- a free CORBA implementation 79 * MICO --- a free CORBA implementation
97 * Copyright (C) 1997-98 Kay Roemer & Arno Puder 80 * Copyright (C) 1997-98 Kay Roemer & Arno Puder
98 */ 81 */
99template<class T> 82template<class T>
100struct simplevec { 83struct simplevec
84{
101 typedef T* iterator; 85 typedef T* iterator;
102 typedef const T* const_iterator; 86 typedef const T* const_iterator;
103 typedef unsigned long size_type; 87 typedef unsigned long size_type;
104 88
105private: 89private:
… …
346} 330}
347 331
348 332
349template<typename T> 333template<typename T>
350struct vector : simplevec<T> 334struct vector : simplevec<T>
351{ }; 335{
336};
337
338struct stringvec : simplevec<char *>
339{
340 ~stringvec ()
341 {
342 for (char **c = begin (); c != end (); c++)
343 free (*c);
344 }
345};
352 346
353#if 0 347#if 0
354template<typename T> 348template<typename T>
355struct rxvt_vec : simplevec<void *> { 349struct rxvt_vec : simplevec<void *>
350{
356 typedef T *iterator; 351 typedef T *iterator;
357 352
358 void push_back (T d) { simplevec<void *>::push_back ((void *)d); } 353 void push_back (T d) { simplevec<void *>::push_back ((void *)d); }
359 T pop_back () { return (T*)simplevec<void *>::pop_back (); } 354 T pop_back () { return (T*)simplevec<void *>::pop_back (); }
360 void erase (int i) { erase (begin () + i); } 355 void erase (int i) { erase (begin () + i); }
… …
364 T &operator [] (int i) { return * (T *) (& ((* (simplevec<void *> *)this)[i])); } 359 T &operator [] (int i) { return * (T *) (& ((* (simplevec<void *> *)this)[i])); }
365 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])); }
366}; 361};
367#endif 362#endif
368 363
369template <typename I, typename T>
370I find (I first, I last, const T& value)
371{
372 while (first != last && *first != value)
373 ++first;
374
375 return first;
376}
377
378template<typename T> 364template<typename T>
379struct auto_ptr { 365struct auto_ptr
366{
380 T *p; 367 T *p;
381 368
382 auto_ptr () : p (0) { } 369 auto_ptr () : p (0) { }
383 auto_ptr (T *a) : p (a) { } 370 auto_ptr (T *a) : p (a) { }
384 371
… …
433 } 420 }
434}; 421};
435 422
436typedef auto_ptr<char> auto_str; 423typedef auto_ptr<char> auto_str;
437 424
438struct stringvec : simplevec<char *>
439{
440 ~stringvec ()
441 {
442 for (char **c = begin (); c != end (); c++)
443 free (*c);
444 }
445};
446
447// return a very temporary (and never deallocated) buffer. keep small.
448void *rxvt_temp_buf (int len);
449
450template<typename T>
451static inline T *
452rxvt_temp_buf (int len)
453{
454 return (T *)rxvt_temp_buf (len * sizeof (T));
455}
456
457#endif 425#endif
458 426

Diff Legend

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