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.23 by root, Sun Jan 29 22:30:21 2006 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
7#define PP_CONCAT_(a, b) a ## b 8using namespace std;
8#define PP_CONCAT(a, b) PP_CONCAT_(a, b)
9#define PP_STRINGIFY_(a) #a
10#define PP_STRINGIFY(a) PP_STRINGIFY_(a)
11 9
12// actually, some gcc-3.x versions work, too 10// increases code size unless -fno-enforce-eh-specs
13#define HAVE_GCC_BUILTINS (__GNUC__ >= 4) 11#if __GNUC__
14 12# define NOTHROW
15extern class byteorder { 13# define THROW(x)
16 static unsigned int e; // at least 32 bits 14#else
17public: 15# define NOTHROW throw()
18 byteorder (); 16# define THROW(x) throw x
19 17#endif
20 static bool big_endian () { return e == 0x11223344; };
21 static bool network () { return e == 0x11223344; };
22 static bool little_endian () { return e == 0x44332211; };
23 static bool vax () { return e == 0x44332211; };
24} byteorder;
25 18
26// various utility functions 19// various utility functions
27template<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; }
28template<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; }
29template<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; }
… …
32template<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; } 25template<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; }
33template<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; } 26template<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; }
34 27
35template<typename T, typename U> static inline void swap (T& a, U& b) { T t=a; a=(T)b; b=(U)t; } 28template<typename T, typename U> static inline void swap (T& a, U& b) { T t=a; a=(T)b; b=(U)t; }
36 29
30template<typename T> static inline T squared_diff (T a, T b) { return (a-b)*(a-b); }
31
37// linear interpolation 32// linear interpolation
38template<typename T, typename U, typename P> 33template<typename T, typename U, typename P>
39static inline 34static inline
40T lerp (T a, U b, P p) 35T lerp (T a, U b, P p)
41{ 36{
42 return (int(a) * int(p) + int(b) * int(100 - p)) / 100; 37 return (long(a) * long(100 - p) + long(b) * long(p) + 50) / 100;
43} 38}
44 39
45// some bit functions, xft fuck me plenty 40template <typename I, typename T>
46#if HAVE_GCC_BUILTINS 41I find (I first, I last, const T& value)
47static inline int ctz (unsigned int x) { return __builtin_ctz (x); } 42{
48static inline int popcount (unsigned int x) { return __builtin_popcount (x); } 43 while (first != last && *first != value)
49#else 44 ++first;
50// count trailing zero bits and count # of one bits 45
51int ctz (unsigned int x); 46 return first;
52int popcount (unsigned int x); 47}
53#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}
54 58
55// in range including end 59// in range including end
56#define IN_RANGE_INC(val,beg,end) \ 60#define IN_RANGE_INC(val,beg,end) \
57 ((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))
58 62
59// in range excluding end 63// in range excluding end
60#define IN_RANGE_EXC(val,beg,end) \ 64#define IN_RANGE_EXC(val,beg,end) \
61 ((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))
62 66
67// for m >= -n, ensure remainder lies between 0..n-1
68#define MOD(m,n) (((m) + (n)) % (n))
69
63// makes dynamically allocated objects zero-initialised 70// makes dynamically allocated objects zero-initialised
64struct zero_initialized { 71struct zero_initialized
72{
65 void *operator new (size_t s); 73 void *operator new (size_t s);
66 void operator delete (void *p, size_t s); 74 void operator delete (void *p, size_t s);
67}; 75};
68 76
69/* simplevec taken (and heavily modified), from: 77/* simplevec taken (and heavily modified), from:
70 * 78 *
71 * MICO --- a free CORBA implementation 79 * MICO --- a free CORBA implementation
72 * Copyright (C) 1997-98 Kay Roemer & Arno Puder 80 * Copyright (C) 1997-98 Kay Roemer & Arno Puder
73 */ 81 */
74template<class T> 82template<class T>
75struct simplevec { 83struct simplevec
84{
76 typedef T* iterator; 85 typedef T* iterator;
77 typedef const T* const_iterator; 86 typedef const T* const_iterator;
78 typedef unsigned long size_type; 87 typedef unsigned long size_type;
79 88
80private: 89private:
… …
321} 330}
322 331
323 332
324template<typename T> 333template<typename T>
325struct vector : simplevec<T> 334struct vector : simplevec<T>
326{ }; 335{
336};
337
338struct stringvec : simplevec<char *>
339{
340 ~stringvec ()
341 {
342 for (char **c = begin (); c != end (); c++)
343 free (*c);
344 }
345};
327 346
328#if 0 347#if 0
329template<typename T> 348template<typename T>
330struct rxvt_vec : simplevec<void *> { 349struct rxvt_vec : simplevec<void *>
350{
331 typedef T *iterator; 351 typedef T *iterator;
332 352
333 void push_back (T d) { simplevec<void *>::push_back ((void *)d); } 353 void push_back (T d) { simplevec<void *>::push_back ((void *)d); }
334 T pop_back () { return (T*)simplevec<void *>::pop_back (); } 354 T pop_back () { return (T*)simplevec<void *>::pop_back (); }
335 void erase (int i) { erase (begin () + i); } 355 void erase (int i) { erase (begin () + i); }
… …
339 T &operator [] (int i) { return * (T *) (& ((* (simplevec<void *> *)this)[i])); } 359 T &operator [] (int i) { return * (T *) (& ((* (simplevec<void *> *)this)[i])); }
340 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])); }
341}; 361};
342#endif 362#endif
343 363
344template <typename I, typename T>
345I find (I first, I last, const T& value)
346{
347 while (first != last && *first != value)
348 ++first;
349
350 return first;
351}
352
353template<typename T> 364template<typename T>
354struct auto_ptr { 365struct auto_ptr
366{
355 T *p; 367 T *p;
356 368
357 auto_ptr () : p (0) { } 369 auto_ptr () : p (0) { }
358 auto_ptr (T *a) : p (a) { } 370 auto_ptr (T *a) : p (a) { }
359 371
… …
408 } 420 }
409}; 421};
410 422
411typedef auto_ptr<char> auto_str; 423typedef auto_ptr<char> auto_str;
412 424
413struct stringvec : simplevec<char *>
414{
415 ~stringvec ()
416 {
417 for (char **c = begin (); c != end (); c++)
418 free (*c);
419 }
420};
421
422// return a very temporary (and never deallocated) buffer. keep small.
423void *rxvt_temp_buf (int len);
424
425template<typename T>
426inline T *
427rxvt_temp_buf (int len)
428{
429 return (T *)rxvt_temp_buf (len * sizeof (T));
430}
431
432#endif 425#endif
433 426

Diff Legend

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