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.24 by root, Mon Jan 30 16:12:58 2006 UTC vs.
Revision 1.38 by root, Wed Nov 5 14:43:54 2008 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
7using namespace std;
6 8
7#define PP_CONCAT_(a, b) a ## b 9#define PP_CONCAT_(a, b) a ## b
8#define PP_CONCAT(a, b) PP_CONCAT_(a, b) 10#define PP_CONCAT(a, b) PP_CONCAT_(a, b)
9#define PP_STRINGIFY_(a) #a 11#define PP_STRINGIFY_(a) #a
10#define PP_STRINGIFY(a) PP_STRINGIFY_(a) 12#define PP_STRINGIFY(a) PP_STRINGIFY_(a)
11 13
12// actually, some gcc-3.x versions work, too 14#define HAVE_GCC_BUILTINS (__GNUC__ >= 4 || (__GNUC__ == 3 && __GNUC_MINOR__ == 4))
13#define HAVE_GCC_BUILTINS (__GNUC__ >= 4)
14 15
15#ifndef __attribute__
16# if __GNUC__ 16#if __GNUC__ >= 4
17# if (__GNUC__ == 2 && __GNUC_MINOR__ < 5) || (__GNUC__ < 2) 17# define rxvt_attribute(x) __attribute__(x)
18# define __attribute__(x) 18# define expect(expr,value) __builtin_expect ((expr),(value))
19# endif 19#else
20# endif
21# define __attribute__(x) 20# define rxvt_attribute(x)
21# define expect(expr,value) (expr)
22#endif 22#endif
23 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
24#define NORETURN __attribute__ ((noreturn)) 30#define NORETURN rxvt_attribute ((noreturn))
25#define UNUSED __attribute__ ((unused)) 31#define UNUSED rxvt_attribute ((unused))
26#define CONST __attribute__ ((const)) 32#define CONST rxvt_attribute ((const))
27 33
28// increases code size unless -fno-enforce-eh-specs 34// increases code size unless -fno-enforce-eh-specs
29#if __GNUC__ 35#if __GNUC__
30# define NOTHROW 36# define NOTHROW
31# define THROW(x) 37# define THROW(x)
… …
54template<typename T, typename U, typename V> static inline T clamp (T v, U a, V b) { return v < (T)a ? a : v >(T)b ? b : v; } 60template<typename T, typename U, typename V> static inline T clamp (T v, U a, V b) { return v < (T)a ? a : v >(T)b ? b : v; }
55template<typename T, typename U, typename V> static inline void clamp_it (T &v, U a, V b) { v = v < (T)a ? a : v >(T)b ? b : v; } 61template<typename T, typename U, typename V> static inline void clamp_it (T &v, U a, V b) { v = v < (T)a ? a : v >(T)b ? b : v; }
56 62
57template<typename T, typename U> static inline void swap (T& a, U& b) { T t=a; a=(T)b; b=(U)t; } 63template<typename T, typename U> static inline void swap (T& a, U& b) { T t=a; a=(T)b; b=(U)t; }
58 64
65template<typename T> static inline T squared_diff (T a, T b) { return (a-b)*(a-b); }
66
59// linear interpolation 67// linear interpolation
60template<typename T, typename U, typename P> 68template<typename T, typename U, typename P>
61static inline 69static inline
62T lerp (T a, U b, P p) 70T lerp (T a, U b, P p)
63{ 71{
64 return (int(a) * int(p) + int(b) * int(100 - p)) / 100; 72 return (long(a) * long(100 - p) + long(b) * long(p) + 50) / 100;
73}
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));
65} 92}
66 93
67// some bit functions, xft fuck me plenty 94// some bit functions, xft fuck me plenty
68#if HAVE_GCC_BUILTINS 95#if HAVE_GCC_BUILTINS
69static inline int ctz (unsigned int x) CONST { return __builtin_ctz (x); } 96static inline int ctz (unsigned int x) { return __builtin_ctz (x); }
70static inline int popcount (unsigned int x) CONST { return __builtin_popcount (x); } 97static inline int popcount (unsigned int x) { return __builtin_popcount (x); }
71#else 98#else
72// count trailing zero bits and count # of one bits 99// count trailing zero bits and count # of one bits
73int ctz (unsigned int x) CONST; 100int ctz (unsigned int x) CONST;
74int popcount (unsigned int x) CONST; 101int popcount (unsigned int x) CONST;
75#endif 102#endif
… …
80 107
81// in range excluding end 108// in range excluding end
82#define IN_RANGE_EXC(val,beg,end) \ 109#define IN_RANGE_EXC(val,beg,end) \
83 ((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))
84 111
112// for m >= -n, ensure remainder lies between 0..n-1
113#define MOD(m,n) (((m) + (n)) % (n))
114
85// makes dynamically allocated objects zero-initialised 115// makes dynamically allocated objects zero-initialised
86struct zero_initialized { 116struct zero_initialized
117{
87 void *operator new (size_t s); 118 void *operator new (size_t s);
88 void operator delete (void *p, size_t s); 119 void operator delete (void *p, size_t s);
89}; 120};
90 121
91/* simplevec taken (and heavily modified), from: 122/* simplevec taken (and heavily modified), from:
92 * 123 *
93 * MICO --- a free CORBA implementation 124 * MICO --- a free CORBA implementation
94 * Copyright (C) 1997-98 Kay Roemer & Arno Puder 125 * Copyright (C) 1997-98 Kay Roemer & Arno Puder
95 */ 126 */
96template<class T> 127template<class T>
97struct simplevec { 128struct simplevec
129{
98 typedef T* iterator; 130 typedef T* iterator;
99 typedef const T* const_iterator; 131 typedef const T* const_iterator;
100 typedef unsigned long size_type; 132 typedef unsigned long size_type;
101 133
102private: 134private:
… …
343} 375}
344 376
345 377
346template<typename T> 378template<typename T>
347struct vector : simplevec<T> 379struct vector : simplevec<T>
348{ }; 380{
381};
382
383struct stringvec : simplevec<char *>
384{
385 ~stringvec ()
386 {
387 for (char **c = begin (); c != end (); c++)
388 free (*c);
389 }
390};
349 391
350#if 0 392#if 0
351template<typename T> 393template<typename T>
352struct rxvt_vec : simplevec<void *> { 394struct rxvt_vec : simplevec<void *>
395{
353 typedef T *iterator; 396 typedef T *iterator;
354 397
355 void push_back (T d) { simplevec<void *>::push_back ((void *)d); } 398 void push_back (T d) { simplevec<void *>::push_back ((void *)d); }
356 T pop_back () { return (T*)simplevec<void *>::pop_back (); } 399 T pop_back () { return (T*)simplevec<void *>::pop_back (); }
357 void erase (int i) { erase (begin () + i); } 400 void erase (int i) { erase (begin () + i); }
… …
361 T &operator [] (int i) { return * (T *) (& ((* (simplevec<void *> *)this)[i])); } 404 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])); } 405 const T &operator [] (int i) const { return * (const T *) (& ((* (const simplevec<void *> *)this)[i])); }
363}; 406};
364#endif 407#endif
365 408
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> 409template<typename T>
376struct auto_ptr { 410struct auto_ptr
411{
377 T *p; 412 T *p;
378 413
379 auto_ptr () : p (0) { } 414 auto_ptr () : p (0) { }
380 auto_ptr (T *a) : p (a) { } 415 auto_ptr (T *a) : p (a) { }
381 416
… …
430 } 465 }
431}; 466};
432 467
433typedef auto_ptr<char> auto_str; 468typedef auto_ptr<char> auto_str;
434 469
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 470#endif
455 471

Diff Legend

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