1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
|
/*
Copyright (C) 1996, 1997 John W. Eaton
This file is part of Octave.
Octave is free software; you can redistribute it and/or modify it
under the terms of the GNU General Public License as published by the
Free Software Foundation; either version 2, or (at your option) any
later version.
Octave is distributed in the hope that it will be useful, but WITHOUT
ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or
FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License
for more details.
You should have received a copy of the GNU General Public License
along with Octave; see the file COPYING. If not, write to the Free
Software Foundation, Inc., 51 Franklin Street, Fifth Floor, Boston, MA
02110-1301, USA.
*/
#if defined (__GNUG__) && defined (USE_PRAGMA_INTERFACE_IMPLEMENTATION)
#pragma implementation
#endif
#ifdef HAVE_CONFIG_H
#include <config.h>
#endif
#include <new>
#include "oct-alloc.h"
void *
octave_allocator::alloc (size_t size)
{
if (size != item_size)
return ::new char [size];
if (! head)
{
if (! grow ())
return 0;
}
link *tmp = head;
head = head->next;
return tmp;
}
// XXX FIXME XXX -- if we free the last item on the list, shouldn't we
// also free the underlying character array used for storage?
void
octave_allocator::free (void *p, size_t size)
{
if (size != item_size)
::delete [] (static_cast<char *> (p));
else
{
link *tmp = static_cast<link *> (p);
tmp->next = head;
head = tmp;
}
}
// Return TRUE for successful allocation, FALSE otherwise.
bool
octave_allocator::grow (void)
{
bool retval = true;
char *start = new char [grow_size * item_size];
if (start)
{
char *last = &start[(grow_size - 1) * item_size];
char *p = start;
while (p < last)
{
char *next = p + item_size;
(X_CAST (link *, p)) -> next = X_CAST (link *, next);
p = next;
}
(X_CAST (link *, last)) -> next = 0;
head = X_CAST (link *, start);
}
else
{
typedef void (*error_handler_function) (void);
error_handler_function f = std::set_new_handler (0);
std::set_new_handler (f);
if (f)
f ();
retval = false;
}
return retval;
}
/*
;;; Local Variables: ***
;;; mode: C++ ***
;;; End: ***
*/
|
