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 | using namespace std; |
9 | using 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 | #define HAVE_GCC_BUILTINS (__GNUC__ >= 4 || (__GNUC__ == 3 && __GNUC_MINOR__ == 4)) |
|
|
15 | |
|
|
16 | #if __GNUC__ >= 4 |
|
|
17 | # define rxvt_attribute(x) __attribute__(x) |
|
|
18 | #else |
|
|
19 | # define rxvt_attribute(x) |
|
|
20 | #endif |
|
|
21 | |
|
|
22 | #define NORETURN rxvt_attribute ((noreturn)) |
|
|
23 | #define UNUSED rxvt_attribute ((unused)) |
|
|
24 | #define CONST rxvt_attribute ((const)) |
|
|
25 | |
10 | |
26 | // increases code size unless -fno-enforce-eh-specs |
11 | // increases code size unless -fno-enforce-eh-specs |
27 | #if __GNUC__ |
12 | #if __GNUC__ |
28 | # define NOTHROW |
13 | # define NOTHROW |
29 | # define THROW(x) |
14 | # define THROW(x) |
30 | #else |
15 | #else |
31 | # define NOTHROW throw() |
16 | # define NOTHROW throw() |
32 | # define THROW(x) throw x |
17 | # define THROW(x) throw x |
33 | #endif |
18 | #endif |
34 | |
19 | |
35 | extern class byteorder { |
|
|
36 | static unsigned int e; // at least 32 bits |
|
|
37 | public: |
|
|
38 | byteorder (); |
|
|
39 | |
|
|
40 | static bool big_endian () { return e == 0x11223344; }; |
|
|
41 | static bool network () { return e == 0x11223344; }; |
|
|
42 | static bool little_endian () { return e == 0x44332211; }; |
|
|
43 | static bool vax () { return e == 0x44332211; }; |
|
|
44 | } byteorder; |
|
|
45 | |
|
|
46 | // various utility functions |
20 | // various utility functions |
47 | template<typename T, typename U> static inline T min (T a, U b) { return a < (T)b ? a : (T)b; } |
21 | template<typename T, typename U> static inline T min (T a, U b) { return a < (T)b ? a : (T)b; } |
48 | template<typename T, typename U> static inline void min_it (T &a, U b) { a = a < (T)b ? a : (T)b; } |
22 | template<typename T, typename U> static inline void min_it (T &a, U b) { a = a < (T)b ? a : (T)b; } |
49 | template<typename T, typename U> static inline T max (T a, U b) { return a > (T)b ? a : (T)b; } |
23 | template<typename T, typename U> static inline T max (T a, U b) { return a > (T)b ? a : (T)b; } |
50 | template<typename T, typename U> static inline void max_it (T &a, U b) { a = a > (T)b ? a : (T)b; } |
24 | template<typename T, typename U> static inline void max_it (T &a, U b) { a = a > (T)b ? a : (T)b; } |
… | |
… | |
81 | rxvt_temp_buf (int len) |
55 | rxvt_temp_buf (int len) |
82 | { |
56 | { |
83 | return (T *)rxvt_temp_buf (len * sizeof (T)); |
57 | return (T *)rxvt_temp_buf (len * sizeof (T)); |
84 | } |
58 | } |
85 | |
59 | |
86 | // some bit functions, xft fuck me plenty |
|
|
87 | #if HAVE_GCC_BUILTINS |
|
|
88 | static inline int ctz (unsigned int x) { return __builtin_ctz (x); } |
|
|
89 | static inline int popcount (unsigned int x) { return __builtin_popcount (x); } |
|
|
90 | #else |
|
|
91 | // count trailing zero bits and count # of one bits |
|
|
92 | int ctz (unsigned int x) CONST; |
|
|
93 | int popcount (unsigned int x) CONST; |
|
|
94 | #endif |
|
|
95 | |
|
|
96 | // in range including end |
60 | // in range including end |
97 | #define IN_RANGE_INC(val,beg,end) \ |
61 | #define IN_RANGE_INC(val,beg,end) \ |
98 | ((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)) |
99 | |
63 | |
100 | // in range excluding end |
64 | // in range excluding end |
101 | #define IN_RANGE_EXC(val,beg,end) \ |
65 | #define IN_RANGE_EXC(val,beg,end) \ |
102 | ((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)) |
103 | |
67 | |
|
|
68 | // for m >= -n, ensure remainder lies between 0..n-1 |
|
|
69 | #define MOD(m,n) (((m) + (n)) % (n)) |
|
|
70 | |
104 | // makes dynamically allocated objects zero-initialised |
71 | // makes dynamically allocated objects zero-initialised |
105 | struct zero_initialized { |
72 | struct zero_initialized |
|
|
73 | { |
106 | void *operator new (size_t s); |
74 | void *operator new (size_t s); |
107 | void operator delete (void *p, size_t s); |
75 | void operator delete (void *p, size_t s); |
108 | }; |
76 | }; |
109 | |
77 | |
110 | /* simplevec taken (and heavily modified), from: |
78 | /* simplevec taken (and heavily modified), from: |
111 | * |
79 | * |
112 | * MICO --- a free CORBA implementation |
80 | * MICO --- a free CORBA implementation |
113 | * Copyright (C) 1997-98 Kay Roemer & Arno Puder |
81 | * Copyright (C) 1997-98 Kay Roemer & Arno Puder |
114 | */ |
82 | */ |
115 | template<class T> |
83 | template<class T> |
116 | struct simplevec { |
84 | struct simplevec |
|
|
85 | { |
117 | typedef T* iterator; |
86 | typedef T* iterator; |
118 | typedef const T* const_iterator; |
87 | typedef const T* const_iterator; |
119 | typedef unsigned long size_type; |
88 | typedef unsigned long size_type; |
120 | |
89 | |
121 | private: |
90 | private: |
… | |
… | |
362 | } |
331 | } |
363 | |
332 | |
364 | |
333 | |
365 | template<typename T> |
334 | template<typename T> |
366 | struct vector : simplevec<T> |
335 | struct vector : simplevec<T> |
367 | { }; |
336 | { |
|
|
337 | }; |
368 | |
338 | |
369 | struct stringvec : simplevec<char *> |
339 | struct stringvec : simplevec<char *> |
370 | { |
340 | { |
371 | ~stringvec () |
341 | ~stringvec () |
372 | { |
342 | { |
373 | for (char **c = begin (); c != end (); c++) |
343 | for (char **c = begin (); c != end (); c++) |
374 | free (*c); |
344 | free (*c); |
375 | } |
345 | } |
376 | }; |
346 | }; |
377 | |
347 | |
|
|
348 | #if 0 |
378 | template<typename T> |
349 | template<typename T> |
379 | struct rxvt_vec : simplevec<void *> { |
350 | struct rxvt_vec : simplevec<void *> |
|
|
351 | { |
380 | typedef T *iterator; |
352 | typedef T *iterator; |
381 | |
353 | |
382 | void push_back (T d) { simplevec<void *>::push_back ((void *)d); } |
354 | void push_back (T d) { simplevec<void *>::push_back ((void *)d); } |
383 | T pop_back () { return (T*)simplevec<void *>::pop_back (); } |
355 | T pop_back () { return (T*)simplevec<void *>::pop_back (); } |
384 | void erase (int i) { erase (begin () + i); } |
356 | void erase (int i) { erase (begin () + i); } |
… | |
… | |
386 | iterator begin () const { return (iterator)simplevec<void *>::begin (); } |
358 | iterator begin () const { return (iterator)simplevec<void *>::begin (); } |
387 | iterator end () const { return (iterator)simplevec<void *>::end (); } |
359 | iterator end () const { return (iterator)simplevec<void *>::end (); } |
388 | T &operator [] (int i) { return * (T *) (& ((* (simplevec<void *> *)this)[i])); } |
360 | T &operator [] (int i) { return * (T *) (& ((* (simplevec<void *> *)this)[i])); } |
389 | 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])); } |
390 | }; |
362 | }; |
|
|
363 | #endif |
391 | |
364 | |
392 | template<typename T> |
365 | template<typename T> |
393 | struct auto_ptr { |
366 | struct auto_ptr |
|
|
367 | { |
394 | T *p; |
368 | T *p; |
395 | |
369 | |
396 | auto_ptr () : p (0) { } |
370 | auto_ptr () : p (0) { } |
397 | auto_ptr (T *a) : p (a) { } |
371 | auto_ptr (T *a) : p (a) { } |
398 | |
372 | |