| … | |
… | |
| 5 | # define is_constant(c) __builtin_constant_p (c) |
5 | # define is_constant(c) __builtin_constant_p (c) |
| 6 | #else |
6 | #else |
| 7 | # define is_constant(c) 0 |
7 | # define is_constant(c) 0 |
| 8 | #endif |
8 | #endif |
| 9 | |
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 | |
| 10 | // makes dynamically allocated objects zero-initialised |
17 | // makes dynamically allocated objects zero-initialised |
| 11 | struct zero_initialised |
18 | struct zero_initialised |
| 12 | { |
19 | { |
| 13 | void *operator new (size_t s, void *); |
20 | void *operator new (size_t s, void *p) |
|
|
21 | { |
|
|
22 | memset (p, 0, s); |
|
|
23 | return p; |
|
|
24 | } |
|
|
25 | |
| 14 | void *operator new (size_t s); |
26 | void *operator new (size_t s) |
|
|
27 | { |
|
|
28 | return g_slice_alloc0 (s); |
|
|
29 | } |
|
|
30 | |
| 15 | void *operator new [] (size_t s); |
31 | void *operator new[] (size_t s) |
|
|
32 | { |
|
|
33 | return g_slice_alloc0 (s); |
|
|
34 | } |
|
|
35 | |
| 16 | void operator delete (void *p, size_t s); |
36 | void operator delete (void *p, size_t s) |
|
|
37 | { |
|
|
38 | g_slice_free1 (s, p); |
|
|
39 | } |
|
|
40 | |
| 17 | void operator delete [] (void *p, size_t s); |
41 | void operator delete[] (void *p, size_t s) |
|
|
42 | { |
|
|
43 | g_slice_free1 (s, p); |
|
|
44 | } |
|
|
45 | }; |
|
|
46 | |
|
|
47 | // strictly the same as g_slice_alloc, but never returns 0 |
|
|
48 | void *alloc (int s) throw (std::bad_alloc); |
|
|
49 | // for symmetry |
|
|
50 | inline void dealloc (void *p, int s) throw () |
|
|
51 | { |
|
|
52 | g_slice_free1 (s, p); |
|
|
53 | } |
|
|
54 | |
|
|
55 | // a STL-compatible allocator that uses g_slice |
|
|
56 | // boy, this is verbose |
|
|
57 | template<typename Tp> |
|
|
58 | struct slice_allocator |
|
|
59 | { |
|
|
60 | typedef size_t size_type; |
|
|
61 | typedef ptrdiff_t difference_type; |
|
|
62 | typedef Tp *pointer; |
|
|
63 | typedef const Tp *const_pointer; |
|
|
64 | typedef Tp &reference; |
|
|
65 | typedef const Tp &const_reference; |
|
|
66 | typedef Tp value_type; |
|
|
67 | |
|
|
68 | template <class U> |
|
|
69 | struct rebind |
|
|
70 | { |
|
|
71 | typedef slice_allocator<U> other; |
|
|
72 | }; |
|
|
73 | |
|
|
74 | slice_allocator () throw () { } |
|
|
75 | slice_allocator (const slice_allocator &o) throw () { } |
|
|
76 | template<typename Tp2> |
|
|
77 | slice_allocator (const slice_allocator<Tp2> &) throw () { } |
|
|
78 | |
|
|
79 | ~slice_allocator () { } |
|
|
80 | |
|
|
81 | pointer address (reference x) const { return &x; } |
|
|
82 | const_pointer address (const_reference x) const { return &x; } |
|
|
83 | |
|
|
84 | pointer allocate (size_type n, const_pointer = 0) |
|
|
85 | { |
|
|
86 | return static_cast<pointer>(alloc (n * sizeof (Tp))); |
|
|
87 | } |
|
|
88 | |
|
|
89 | void deallocate (pointer p, size_type n) |
|
|
90 | { |
|
|
91 | dealloc (static_cast<void *>(p), n * sizeof (Tp)); |
|
|
92 | } |
|
|
93 | |
|
|
94 | size_type max_size ()const throw () |
|
|
95 | { |
|
|
96 | return size_t (-1) / sizeof (Tp); |
|
|
97 | } |
|
|
98 | |
|
|
99 | void construct (pointer p, const Tp &val) |
|
|
100 | { |
|
|
101 | ::new (p) Tp (val); |
|
|
102 | } |
|
|
103 | |
|
|
104 | void destroy (pointer p) |
|
|
105 | { |
|
|
106 | p->~Tp (); |
|
|
107 | } |
| 18 | }; |
108 | }; |
| 19 | |
109 | |
| 20 | struct refcounted |
110 | struct refcounted |
| 21 | { |
111 | { |
| 22 | mutable int refcnt; |
112 | mutable int refcnt; |
| … | |
… | |
| 92 | }; |
182 | }; |
| 93 | |
183 | |
| 94 | #include <vector> |
184 | #include <vector> |
| 95 | |
185 | |
| 96 | template<class obj> |
186 | template<class obj> |
| 97 | struct unordered_vector : std::vector<obj> |
187 | struct unordered_vector : std::vector<obj, slice_allocator<obj> > |
| 98 | { |
188 | { |
| 99 | typedef typename std::vector<obj>::iterator iterator; |
189 | typedef typename unordered_vector::iterator iterator; |
| 100 | |
190 | |
| 101 | void erase (unsigned int pos) |
191 | void erase (unsigned int pos) |
| 102 | { |
192 | { |
| 103 | if (pos < this->size () - 1) |
193 | if (pos < this->size () - 1) |
| 104 | (*this)[pos] = (*this)[this->size () - 1]; |
194 | (*this)[pos] = (*this)[this->size () - 1]; |
