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.28 by ayin, Tue Jun 26 10:46:28 2007 UTC vs.
Revision 1.38 by root, Wed Nov 5 14:43:54 2008 UTC

… …
11#define PP_STRINGIFY_(a) #a 11#define PP_STRINGIFY_(a) #a
12#define PP_STRINGIFY(a) PP_STRINGIFY_(a) 12#define PP_STRINGIFY(a) PP_STRINGIFY_(a)
13 13
14#define HAVE_GCC_BUILTINS (__GNUC__ >= 4 || (__GNUC__ == 3 && __GNUC_MINOR__ == 4)) 14#define HAVE_GCC_BUILTINS (__GNUC__ >= 4 || (__GNUC__ == 3 && __GNUC_MINOR__ == 4))
15 15
16#ifndef __attribute__
17# if __GNUC__ 16#if __GNUC__ >= 4
18# if (__GNUC__ == 2 && __GNUC_MINOR__ < 5) || (__GNUC__ < 2) 17# define rxvt_attribute(x) __attribute__(x)
19# define __attribute__(x) 18# define expect(expr,value) __builtin_expect ((expr),(value))
20# endif 19#else
21# endif
22# define __attribute__(x) 20# define rxvt_attribute(x)
21# define expect(expr,value) (expr)
23#endif 22#endif
24 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
25#define NORETURN __attribute__ ((noreturn)) 30#define NORETURN rxvt_attribute ((noreturn))
26#define UNUSED __attribute__ ((unused)) 31#define UNUSED rxvt_attribute ((unused))
27#define CONST __attribute__ ((const)) 32#define CONST rxvt_attribute ((const))
28 33
29// increases code size unless -fno-enforce-eh-specs 34// increases code size unless -fno-enforce-eh-specs
30#if __GNUC__ 35#if __GNUC__
31# define NOTHROW 36# define NOTHROW
32# define THROW(x) 37# define THROW(x)
… …
65T lerp (T a, U b, P p) 70T lerp (T a, U b, P p)
66{ 71{
67 return (long(a) * long(100 - p) + long(b) * long(p) + 50) / 100; 72 return (long(a) * long(100 - p) + long(b) * long(p) + 50) / 100;
68} 73}
69 74
75template <typename I, typename T>
76I find (I first, I last, const T& value)
77{
78 while (first != last && *first != value)
79 ++first;
80
81 return first;
82}
83
84// return a very temporary (and never deallocated) buffer. keep small.
85void *rxvt_temp_buf (int len);
86
87template<typename T>
88static inline T *
89rxvt_temp_buf (int len)
90{
91 return (T *)rxvt_temp_buf (len * sizeof (T));
92}
93
70// some bit functions, xft fuck me plenty 94// some bit functions, xft fuck me plenty
71#if HAVE_GCC_BUILTINS 95#if HAVE_GCC_BUILTINS
72static inline int ctz (unsigned int x) CONST { return __builtin_ctz (x); } 96static inline int ctz (unsigned int x) { return __builtin_ctz (x); }
73static inline int popcount (unsigned int x) CONST { return __builtin_popcount (x); } 97static inline int popcount (unsigned int x) { return __builtin_popcount (x); }
74#else 98#else
75// count trailing zero bits and count # of one bits 99// count trailing zero bits and count # of one bits
76int ctz (unsigned int x) CONST; 100int ctz (unsigned int x) CONST;
77int popcount (unsigned int x) CONST; 101int popcount (unsigned int x) CONST;
78#endif 102#endif
… …
83 107
84// in range excluding end 108// in range excluding end
85#define IN_RANGE_EXC(val,beg,end) \ 109#define IN_RANGE_EXC(val,beg,end) \
86 ((unsigned int)(val) - (unsigned int)(beg) < (unsigned int)(end) - (unsigned int)(beg)) 110 ((unsigned int)(val) - (unsigned int)(beg) < (unsigned int)(end) - (unsigned int)(beg))
87 111
112// for m >= -n, ensure remainder lies between 0..n-1
113#define MOD(m,n) (((m) + (n)) % (n))
114
88// makes dynamically allocated objects zero-initialised 115// makes dynamically allocated objects zero-initialised
89struct zero_initialized { 116struct zero_initialized
117{
90 void *operator new (size_t s); 118 void *operator new (size_t s);
91 void operator delete (void *p, size_t s); 119 void operator delete (void *p, size_t s);
92}; 120};
93 121
94/* simplevec taken (and heavily modified), from: 122/* simplevec taken (and heavily modified), from:
95 * 123 *
96 * MICO --- a free CORBA implementation 124 * MICO --- a free CORBA implementation
97 * Copyright (C) 1997-98 Kay Roemer & Arno Puder 125 * Copyright (C) 1997-98 Kay Roemer & Arno Puder
98 */ 126 */
99template<class T> 127template<class T>
100struct simplevec { 128struct simplevec
129{
101 typedef T* iterator; 130 typedef T* iterator;
102 typedef const T* const_iterator; 131 typedef const T* const_iterator;
103 typedef unsigned long size_type; 132 typedef unsigned long size_type;
104 133
105private: 134private:
… …
346} 375}
347 376
348 377
349template<typename T> 378template<typename T>
350struct vector : simplevec<T> 379struct vector : simplevec<T>
351{ }; 380{
381};
382
383struct stringvec : simplevec<char *>
384{
385 ~stringvec ()
386 {
387 for (char **c = begin (); c != end (); c++)
388 free (*c);
389 }
390};
352 391
353#if 0 392#if 0
354template<typename T> 393template<typename T>
355struct rxvt_vec : simplevec<void *> { 394struct rxvt_vec : simplevec<void *>
395{
356 typedef T *iterator; 396 typedef T *iterator;
357 397
358 void push_back (T d) { simplevec<void *>::push_back ((void *)d); } 398 void push_back (T d) { simplevec<void *>::push_back ((void *)d); }
359 T pop_back () { return (T*)simplevec<void *>::pop_back (); } 399 T pop_back () { return (T*)simplevec<void *>::pop_back (); }
360 void erase (int i) { erase (begin () + i); } 400 void erase (int i) { erase (begin () + i); }
… …
364 T &operator [] (int i) { return * (T *) (& ((* (simplevec<void *> *)this)[i])); } 404 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])); } 405 const T &operator [] (int i) const { return * (const T *) (& ((* (const simplevec<void *> *)this)[i])); }
366}; 406};
367#endif 407#endif
368 408
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> 409template<typename T>
379struct auto_ptr { 410struct auto_ptr
411{
380 T *p; 412 T *p;
381 413
382 auto_ptr () : p (0) { } 414 auto_ptr () : p (0) { }
383 auto_ptr (T *a) : p (a) { } 415 auto_ptr (T *a) : p (a) { }
384 416
… …
433 } 465 }
434}; 466};
435 467
436typedef auto_ptr<char> auto_str; 468typedef auto_ptr<char> auto_str;
437 469
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 470#endif
458 471

Diff Legend

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