1 /* Copyright (C) 2000 Free Software Foundation, Inc.
3 * This program is free software; you can redistribute it and/or modify
4 * it under the terms of the GNU General Public License as published by
5 * the Free Software Foundation; either version 2, or (at your option)
8 * This program is distributed in the hope that it will be useful,
9 * but WITHOUT ANY WARRANTY; without even the implied warranty of
10 * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
11 * GNU General Public License for more details.
13 * You should have received a copy of the GNU General Public License
14 * along with this software; see the file COPYING. If not, write to
15 * the Free Software Foundation, Inc., 59 Temple Place, Suite 330,
16 * Boston, MA 02111-1307 USA
18 * As a special exception, the Free Software Foundation gives permission
19 * for additional uses of the text contained in its release of GUILE.
21 * The exception is that, if you link the GUILE library with other files
22 * to produce an executable, this does not by itself cause the
23 * resulting executable to be covered by the GNU General Public License.
24 * Your use of that executable is in no way restricted on account of
25 * linking the GUILE library code into it.
27 * This exception does not however invalidate any other reasons why
28 * the executable file might be covered by the GNU General Public License.
30 * This exception applies only to the code released by the
31 * Free Software Foundation under the name GUILE. If you copy
32 * code from other Free Software Foundation releases into a copy of
33 * GUILE, as the General Public License permits, the exception does
34 * not apply to the code that you add in this way. To avoid misleading
35 * anyone as to the status of such modified files, you must delete
36 * this exception notice from them.
38 * If you write modifications of your own for GUILE, it is your choice
39 * whether to permit this exception to apply to your modifications.
40 * If you do not wish that, delete this exception notice. */
44 #include "libguile/_scm.h"
45 #include "libguile/alist.h"
46 #include "libguile/strings.h"
48 #include "libguile/debug-malloc.h"
51 * The following code is a hack which I wrote quickly in order to
52 * solve a memory leak problem. Since I wanted to have the
53 * application running at close to normal speed, I prioritized speed
54 * over maintainability. /mdj
57 typedef struct hash_entry
{
64 static int malloc_type_size
= 31;
65 static hash_entry_t
*malloc_type
= 0;
66 static int malloc_object_size
= 8191;
67 static hash_entry_t
*malloc_object
= 0;
69 #define TABLE(table) malloc_ ## table
70 #define SIZE(table) malloc_ ## table ## _size
71 #define HASH(table, key) \
72 &TABLE (table)[((unsigned long) key >> 4UL) * 2654435761UL % SIZE (table)]
74 #define CREATE_HASH_ENTRY_AT(entry, table, h, k, done) \
79 for (i = 0; i < N_SEEK; ++i) \
82 grow (&TABLE (table), &SIZE (table)); \
83 h = HASH (table, k); \
90 #define CREATE_HASH_ENTRY(table, k, d, done) \
93 hash_entry_t *h = HASH (table, k); \
94 hash_entry_t *entry; \
95 CREATE_HASH_ENTRY_AT (entry, table, h, k, done); \
101 #define GET_CREATE_HASH_ENTRY(entry, table, k, done) \
104 hash_entry_t *h = HASH (table, k); \
106 for (i = 0; i < N_SEEK; ++i) \
107 if (h[i].key == (void *) (k)) \
109 CREATE_HASH_ENTRY_AT (entry, table, h, k, gche ## done); \
118 #ifdef MISSING_BZERO_DECL
119 extern void bzero (void *, size_t);
123 grow (hash_entry_t
**table
, int *size
)
125 hash_entry_t
*oldtable
= *table
;
126 int oldsize
= *size
+ N_SEEK
;
127 hash_entry_t
*TABLE (new) = 0;
130 SIZE (new) = 2 * (oldsize
- N_SEEK
+ 1) - 1;
132 TABLE (new) = realloc (TABLE (new),
133 sizeof (hash_entry_t
) * (SIZE (new) + N_SEEK
));
134 bzero (TABLE (new), sizeof (hash_entry_t
) * (SIZE (new) + N_SEEK
));
135 for (i
= 0; i
< oldsize
; ++i
)
138 hash_entry_t
*h
= HASH (new, oldtable
[i
].key
);
139 for (j
= 0; j
< N_SEEK
; ++j
)
150 if (table
== &malloc_type
)
152 /* relocate malloc_object entries */
153 for (i
= 0; i
< oldsize
; ++i
)
156 hash_entry_t
*h
= HASH (new, oldtable
[i
].key
);
157 while (h
->key
!= oldtable
[i
].key
)
159 oldtable
[i
].data
= h
;
161 for (i
= 0; i
< malloc_object_size
+ N_SEEK
; ++i
)
162 if (malloc_object
[i
].key
)
163 malloc_object
[i
].data
164 = ((hash_entry_t
*) malloc_object
[i
].data
)->data
;
167 *table
= TABLE (new);
172 scm_malloc_register (void *obj
, const char *what
)
175 GET_CREATE_HASH_ENTRY (type
, type
, what
, l1
);
176 type
->data
= (void *) ((int) type
->data
+ 1);
177 CREATE_HASH_ENTRY (object
, obj
, type
, l2
);
181 scm_malloc_unregister (void *obj
)
183 hash_entry_t
*object
, *type
;
184 GET_CREATE_HASH_ENTRY (object
, object
, obj
, l1
);
185 type
= (hash_entry_t
*) object
->data
;
189 "scm_must_free called on object not allocated with scm_must_malloc\n");
192 type
->data
= (void *) ((int) type
->data
- 1);
197 scm_malloc_reregister (void *old
, void *new, const char *newwhat
)
199 hash_entry_t
*object
, *type
;
200 GET_CREATE_HASH_ENTRY (object
, object
, old
, l1
);
201 type
= (hash_entry_t
*) object
->data
;
205 "scm_must_realloc called on object not allocated with scm_must_malloc\n");
208 if (strcmp ((char *) type
->key
, newwhat
) != 0)
210 if (strcmp (newwhat
, "vector-set-length!") != 0)
213 "scm_must_realloc called with arg %s, was %s\n",
222 CREATE_HASH_ENTRY (object
, new, type
, l2
);
226 SCM_DEFINE (scm_malloc_stats
, "malloc-stats", 0, 0, 0,
228 "Return an alist ((@var{what} . @var{n}) ...) describing number\n"
229 "of malloced objects.\n"
230 "@var{what} is the second argument to @code{scm_must_malloc},\n"
231 "@var{n} is the number of objects of that type currently\n"
233 #define FUNC_NAME s_scm_malloc_stats
237 for (i
= 0; i
< malloc_type_size
+ N_SEEK
; ++i
)
238 if (malloc_type
[i
].key
)
239 res
= scm_acons (scm_makfrom0str ((char *) malloc_type
[i
].key
),
240 SCM_MAKINUM ((int) malloc_type
[i
].data
),
247 scm_debug_malloc_prehistory ()
249 malloc_type
= malloc (sizeof (hash_entry_t
)
250 * (malloc_type_size
+ N_SEEK
));
251 bzero (malloc_type
, sizeof (hash_entry_t
) * (malloc_type_size
+ N_SEEK
));
252 malloc_object
= malloc (sizeof (hash_entry_t
)
253 * (malloc_object_size
+ N_SEEK
));
254 bzero (malloc_object
, sizeof (hash_entry_t
) * (malloc_object_size
+ N_SEEK
));
258 scm_init_debug_malloc ()
260 #ifndef SCM_MAGIC_SNARFER
261 #include "libguile/debug-malloc.x"