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
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
|
/*
Copyright (C) 2000,2004 Silicon Graphics, Inc. All Rights Reserved.
Portions Copyright 2002-2010 Sun Microsystems, Inc. All rights reserved.
Portions Copyright 2011 David Anderson. All Rights Reserved.
This program is free software; you can redistribute it and/or modify it
under the terms of version 2.1 of the GNU Lesser General Public License
as published by the Free Software Foundation.
This program is distributed in the hope that it would be useful, but
WITHOUT ANY WARRANTY; without even the implied warranty of
MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.
Further, this software is distributed without any warranty that it is
free of the rightful claim of any third person regarding infringement
or the like. Any license provided herein, whether implied or
otherwise, applies only to this software file. Patent licenses, if
any, provided herein do not apply to combinations of this program with
other software, or any other product whatsoever.
You should have received a copy of the GNU Lesser General Public
License along with this program; if not, write the Free Software
Foundation, Inc., 51 Franklin Street - Fifth Floor, Boston MA 02110-1301,
USA.
Contact information: Silicon Graphics, Inc., 1500 Crittenden Lane,
Mountain View, CA 94043, or:
http://www.sgi.com
For further information regarding this notice, see:
http://oss.sgi.com/projects/GenInfo/NoticeExplan
*/
#include "config.h"
#include "pro_incl.h"
#ifdef HAVE_STDLIB_H
#include <stdlib.h>
#endif /* HAVE_STDLIB_H */
#ifdef HAVE_STRING_H
#include <string.h>
#endif /* HAVE_STRING_H */
#include <malloc.h>
/* When each block is allocated, there is a two-word structure
allocated at the beginning so the block can go on a list.
The address returned is the address *after* the two pointers
at the start. But this allows us to be given a pointer to
a generic block, and go backwards to find the list-node. Then
we can remove this block from it's list without the need to search
through a linked list in order to remove the node. It also allows
us to 'delete' a memory block without needing the dbg structure.
We still need the dbg structure on allocation so that we know which
linked list to add the block to.
Only the allocation of the dbg structure itself cannot use
_dwarf_p_get_alloc.
That structure should be set up by hand, and the two list pointers
should be initialized to point at the node itself. That initializes
the doubly linked list. */
#define LIST_TO_BLOCK(lst) ((void*) (((char *)lst) + sizeof(memory_list_t)))
#define BLOCK_TO_LIST(blk) ((memory_list_t*) (((char*)blk) - sizeof(memory_list_t)))
/*
dbg should be NULL only when allocating dbg itself. In that
case we initialize it to an empty circular doubly-linked list.
*/
Dwarf_Ptr
_dwarf_p_get_alloc(Dwarf_P_Debug dbg, Dwarf_Unsigned size)
{
void *sp;
memory_list_t *lp = NULL;
memory_list_t *dbglp = NULL;
memory_list_t *nextblock = NULL;
/* alloc control struct and data block together for performance reasons */
lp = (memory_list_t *) malloc(size + sizeof(memory_list_t));
if (lp == NULL) {
/* should throw an error */
return NULL;
}
/* point to 'size' bytes just beyond lp struct */
sp = LIST_TO_BLOCK(lp);
memset(sp, 0, size);
if (dbg == NULL) {
lp->next = lp->prev = lp;
} else {
/* I always have to draw a picture to understand this part. */
dbglp = BLOCK_TO_LIST(dbg);
nextblock = dbglp->next;
/* Insert between dbglp and nextblock */
dbglp->next = lp;
lp->prev = dbglp;
lp->next = nextblock;
nextblock->prev = lp;
}
return sp;
}
/*
This routine is only here in case a caller of an older version of the
library is calling this for some reason.
We will clean up any stray blocks when the session is closed.
No need to remove this block. In theory the user might be
depending on the fact that we used to just 'free' this.
In theory they might also be
passing a block that they got from libdwarf. So we don't know if we
should try to remove this block from our global list. Safest just to
do nothing at this point.
!!!
This function is deprecated! Don't call it inside libdwarf or outside of it.
!!!
*/
void
dwarf_p_dealloc(Dwarf_Small * ptr)
{
return;
}
/*
The dbg structure is not needed here anymore.
*/
void
_dwarf_p_dealloc(Dwarf_P_Debug dbg, Dwarf_Small * ptr) /* ARGSUSED */
{
memory_list_t *lp;
lp = BLOCK_TO_LIST(ptr);
/*
Remove from a doubly linked, circular list.
Read carefully, use a white board if necessary.
If this is an empty list, the following statements are no-ops, and
will write to the same memory location they read from.
This should only happen when we deallocate the dbg structure itself.
*/
lp->prev->next = lp->next;
lp->next->prev = lp->prev;
free((void*)lp);
}
/*
This routine deallocates all the nodes on the dbg list,
and then deallocates the dbg structure itself.
*/
void
_dwarf_p_dealloc_all(Dwarf_P_Debug dbg)
{
memory_list_t *dbglp;
if (dbg == NULL) {
/* should throw an error */
return;
}
dbglp = BLOCK_TO_LIST(dbg);
while (dbglp->next != dbglp) {
_dwarf_p_dealloc(dbg, LIST_TO_BLOCK(dbglp->next));
}
if (dbglp->next != dbglp ||
dbglp->prev != dbglp) {
/* should throw error */
/* For some reason we couldn't free all the blocks? */
return;
}
_dwarf_p_dealloc(NULL, (void*)dbg);
}
|
