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

Diff Legend

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