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

Diff Legend

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