|
2475
|
1 /* |
|
|
2 |
|
11523
|
3 Copyright (C) 1996-2011 John W. Eaton |
|
2475
|
4 |
|
|
5 This file is part of Octave. |
|
|
6 |
|
|
7 Octave is free software; you can redistribute it and/or modify it |
|
|
8 under the terms of the GNU General Public License as published by the |
|
7016
|
9 Free Software Foundation; either version 3 of the License, or (at your |
|
|
10 option) any later version. |
|
2475
|
11 |
|
|
12 Octave is distributed in the hope that it will be useful, but WITHOUT |
|
|
13 ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or |
|
|
14 FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License |
|
|
15 for more details. |
|
|
16 |
|
|
17 You should have received a copy of the GNU General Public License |
|
7016
|
18 along with Octave; see the file COPYING. If not, see |
|
|
19 <http://www.gnu.org/licenses/>. |
|
2475
|
20 |
|
|
21 */ |
|
|
22 |
|
|
23 #if !defined (octave_oct_alloc_h) |
|
|
24 #define octave_oct_alloc_h 1 |
|
|
25 |
|
12414
|
26 #include <cstddef> |
|
|
27 |
|
2475
|
28 class |
|
6108
|
29 OCTAVE_API |
|
2475
|
30 octave_allocator |
|
|
31 { |
|
|
32 public: |
|
|
33 |
|
|
34 octave_allocator (size_t item_sz, int grow_sz = 256) |
|
|
35 : head (0), grow_size (grow_sz), |
|
|
36 item_size (item_sz > sizeof (link *) ? item_sz : sizeof (link *)) |
|
|
37 { } |
|
|
38 |
|
|
39 // Get an object from the free list, possibly increasing the size of |
|
|
40 // the free list. |
|
|
41 void *alloc (size_t size); |
|
|
42 |
|
|
43 // Put objects back on the free list. |
|
|
44 void free (void *p, size_t size); |
|
|
45 |
|
|
46 private: |
|
|
47 |
|
|
48 // Structure for internal free list management. |
|
|
49 struct link { link *next; }; |
|
|
50 |
|
|
51 // Front of the free list. |
|
|
52 link *head; |
|
|
53 |
|
|
54 // How many objects to get each time we call the global operator new. |
|
|
55 int grow_size; |
|
|
56 |
|
|
57 // The size of each item on the list (or, if that is smaller than |
|
|
58 // the size of list*, the size of list*. |
|
|
59 size_t item_size; |
|
|
60 |
|
|
61 // How to grow the free list. |
|
|
62 bool grow (void); |
|
|
63 }; |
|
|
64 |
|
4352
|
65 #if defined (HAVE_PLACEMENT_DELETE) |
|
|
66 #define DECLARE_OCTAVE_ALLOCATOR_PLACEMENT_DELETE \ |
|
|
67 void operator delete (void *p, void *) \ |
|
|
68 { ::operator delete (p, static_cast<void*> (0)); } |
|
|
69 #else |
|
|
70 #define DECLARE_OCTAVE_ALLOCATOR_PLACEMENT_DELETE \ |
|
|
71 void operator delete (void *p, void *) \ |
|
|
72 { ::operator delete (p); } |
|
|
73 #endif |
|
|
74 |
|
3219
|
75 #define DECLARE_OCTAVE_ALLOCATOR \ |
|
|
76 public: \ |
|
4219
|
77 void *operator new (size_t size, void *p) \ |
|
|
78 { return ::operator new (size, p); } \ |
|
4352
|
79 DECLARE_OCTAVE_ALLOCATOR_PLACEMENT_DELETE \ |
|
3219
|
80 void *operator new (size_t size) { return allocator.alloc (size); } \ |
|
|
81 void operator delete (void *p, size_t size) { allocator.free (p, size); } \ |
|
|
82 private: \ |
|
|
83 static octave_allocator allocator; |
|
|
84 |
|
|
85 #define DEFINE_OCTAVE_ALLOCATOR(t) \ |
|
|
86 octave_allocator t::allocator (sizeof (t)) |
|
|
87 |
|
|
88 #define DEFINE_OCTAVE_ALLOCATOR2(t, s) \ |
|
|
89 octave_allocator t::allocator (sizeof (t), s) |
|
|
90 |
|
2475
|
91 #endif |
