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

Diff Legend

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