1 |
#ifndef UTIL_H__ |
2 |
#define UTIL_H__ |
3 |
|
4 |
#if __GNUC__ >= 3 |
5 |
# define is_constant(c) __builtin_constant_p (c) |
6 |
#else |
7 |
# define is_constant(c) 0 |
8 |
#endif |
9 |
|
10 |
#include <cstddef> |
11 |
|
12 |
#include <glib.h> |
13 |
|
14 |
// use a gcc extension for auto declarations until ISO C++ sanctifies them |
15 |
#define AUTODECL(var,expr) typeof(expr) var = (expr) |
16 |
|
17 |
// makes dynamically allocated objects zero-initialised |
18 |
struct zero_initialised |
19 |
{ |
20 |
void *operator new (size_t s, void *p) |
21 |
{ |
22 |
memset (p, 0, s); |
23 |
return p; |
24 |
} |
25 |
|
26 |
void *operator new (size_t s) |
27 |
{ |
28 |
return g_slice_alloc0 (s); |
29 |
} |
30 |
|
31 |
void *operator new[] (size_t s) |
32 |
{ |
33 |
return g_slice_alloc0 (s); |
34 |
} |
35 |
|
36 |
void operator delete (void *p, size_t s) |
37 |
{ |
38 |
g_slice_free1 (s, p); |
39 |
} |
40 |
|
41 |
void operator delete[] (void *p, size_t s) |
42 |
{ |
43 |
g_slice_free1 (s, p); |
44 |
} |
45 |
}; |
46 |
|
47 |
void *salloc_ (int n) throw (std::bad_alloc); |
48 |
void *salloc_ (int n, void *src) throw (std::bad_alloc); |
49 |
|
50 |
// strictly the same as g_slice_alloc, but never returns 0 |
51 |
template<typename T> |
52 |
inline T *salloc (int n = 1) throw (std::bad_alloc) { return (T *)salloc_ (n * sizeof (T)); } |
53 |
|
54 |
// also copies src into the new area, like "memdup" |
55 |
// if src is 0, clears the memory |
56 |
template<typename T> |
57 |
inline T *salloc (int n, T *src) throw (std::bad_alloc) { return (T *)salloc_ (n * sizeof (T), (void *)src); } |
58 |
|
59 |
// clears the memory |
60 |
template<typename T> |
61 |
inline T *salloc0(int n = 1) throw (std::bad_alloc) { return (T *)salloc_ (n * sizeof (T), 0); } |
62 |
|
63 |
// for symmetry |
64 |
template<typename T> |
65 |
inline void sfree (T *ptr, int n = 1) throw () |
66 |
{ |
67 |
g_slice_free1 (n * sizeof (T), (void *)ptr); |
68 |
} |
69 |
|
70 |
// a STL-compatible allocator that uses g_slice |
71 |
// boy, this is verbose |
72 |
template<typename Tp> |
73 |
struct slice_allocator |
74 |
{ |
75 |
typedef size_t size_type; |
76 |
typedef ptrdiff_t difference_type; |
77 |
typedef Tp *pointer; |
78 |
typedef const Tp *const_pointer; |
79 |
typedef Tp &reference; |
80 |
typedef const Tp &const_reference; |
81 |
typedef Tp value_type; |
82 |
|
83 |
template <class U> |
84 |
struct rebind |
85 |
{ |
86 |
typedef slice_allocator<U> other; |
87 |
}; |
88 |
|
89 |
slice_allocator () throw () { } |
90 |
slice_allocator (const slice_allocator &o) throw () { } |
91 |
template<typename Tp2> |
92 |
slice_allocator (const slice_allocator<Tp2> &) throw () { } |
93 |
|
94 |
~slice_allocator () { } |
95 |
|
96 |
pointer address (reference x) const { return &x; } |
97 |
const_pointer address (const_reference x) const { return &x; } |
98 |
|
99 |
pointer allocate (size_type n, const_pointer = 0) |
100 |
{ |
101 |
return salloc<Tp> (n); |
102 |
} |
103 |
|
104 |
void deallocate (pointer p, size_type n) |
105 |
{ |
106 |
sfree<Tp> (p, n); |
107 |
} |
108 |
|
109 |
size_type max_size ()const throw () |
110 |
{ |
111 |
return size_t (-1) / sizeof (Tp); |
112 |
} |
113 |
|
114 |
void construct (pointer p, const Tp &val) |
115 |
{ |
116 |
::new (p) Tp (val); |
117 |
} |
118 |
|
119 |
void destroy (pointer p) |
120 |
{ |
121 |
p->~Tp (); |
122 |
} |
123 |
}; |
124 |
|
125 |
struct refcounted |
126 |
{ |
127 |
refcounted () : refcnt (0) { } |
128 |
// virtual ~refcounted (); |
129 |
void refcnt_inc () { ++refcnt; } |
130 |
void refcnt_dec () { --refcnt; } |
131 |
bool dead () { return refcnt == 0; } |
132 |
mutable int refcnt; |
133 |
#if 0 |
134 |
private: |
135 |
static refcounted *rc_first; |
136 |
refcounted *rc_next; |
137 |
#endif |
138 |
}; |
139 |
|
140 |
template<class T> |
141 |
struct refptr |
142 |
{ |
143 |
T *p; |
144 |
|
145 |
refptr () : p(0) { } |
146 |
refptr (const refptr<T> &p) : p(p.p) { if (p) p->refcnt_inc (); } |
147 |
refptr (T *p) : p(p) { if (p) p->refcnt_inc (); } |
148 |
~refptr () { if (p) p->refcnt_dec (); } |
149 |
|
150 |
const refptr<T> &operator =(T *o) |
151 |
{ |
152 |
if (p) p->refcnt_dec (); |
153 |
p = o; |
154 |
if (p) p->refcnt_inc (); |
155 |
|
156 |
return *this; |
157 |
} |
158 |
|
159 |
const refptr<T> &operator =(const refptr<T> o) |
160 |
{ |
161 |
*this = o.p; |
162 |
return *this; |
163 |
} |
164 |
|
165 |
T &operator * () const { return *p; } |
166 |
T *operator ->() const { return p; } |
167 |
|
168 |
operator T *() const { return p; } |
169 |
}; |
170 |
|
171 |
struct str_hash |
172 |
{ |
173 |
std::size_t operator ()(const char *s) const |
174 |
{ |
175 |
unsigned long hash = 0; |
176 |
|
177 |
/* use the one-at-a-time hash function, which supposedly is |
178 |
* better than the djb2-like one used by perl5.005, but |
179 |
* certainly is better then the bug used here before. |
180 |
* see http://burtleburtle.net/bob/hash/doobs.html |
181 |
*/ |
182 |
while (*s) |
183 |
{ |
184 |
hash += *s++; |
185 |
hash += hash << 10; |
186 |
hash ^= hash >> 6; |
187 |
} |
188 |
|
189 |
hash += hash << 3; |
190 |
hash ^= hash >> 11; |
191 |
hash += hash << 15; |
192 |
|
193 |
return hash; |
194 |
} |
195 |
}; |
196 |
|
197 |
struct str_equal |
198 |
{ |
199 |
bool operator ()(const char *a, const char *b) const |
200 |
{ |
201 |
return !strcmp (a, b); |
202 |
} |
203 |
}; |
204 |
|
205 |
#include <vector> |
206 |
|
207 |
template<class obj> |
208 |
struct unordered_vector : std::vector<obj, slice_allocator<obj> > |
209 |
{ |
210 |
typedef typename unordered_vector::iterator iterator; |
211 |
|
212 |
void erase (unsigned int pos) |
213 |
{ |
214 |
if (pos < this->size () - 1) |
215 |
(*this)[pos] = (*this)[this->size () - 1]; |
216 |
|
217 |
this->pop_back (); |
218 |
} |
219 |
|
220 |
void erase (iterator i) |
221 |
{ |
222 |
erase ((unsigned int )(i - this->begin ())); |
223 |
} |
224 |
}; |
225 |
|
226 |
template<typename T, typename U> static inline T min (T a, U b) { return a < (T)b ? a : (T)b; } |
227 |
template<typename T, typename U> static inline T max (T a, U b) { return a > (T)b ? a : (T)b; } |
228 |
template<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; } |
229 |
|
230 |
template<typename T, typename U> static inline void swap (T& a, U& b) { T t=a; a=(T)b; b=(U)t; } |
231 |
|
232 |
// basically does what strncpy should do, but appends "..." to strings exceeding length |
233 |
void assign (char *dst, const char *src, int maxlen); |
234 |
|
235 |
// type-safe version of assign |
236 |
template<int N> |
237 |
inline void assign (char (&dst)[N], const char *src) |
238 |
{ |
239 |
assign ((char *)&dst, src, N); |
240 |
} |
241 |
|
242 |
typedef double tstamp; |
243 |
|
244 |
// return current time as timestampe |
245 |
tstamp now (); |
246 |
|
247 |
#endif |
248 |
|