1 /* Simple garbage collection for the GNU compiler.
2 Copyright (C) 1999 Free Software Foundation, Inc.
4 This file is part of GNU CC.
6 GNU CC is free software; you can redistribute it and/or modify it
7 under the terms of the GNU General Public License as published by the
8 Free Software Foundation; either version 2, or (at your option) any
11 GNU CC is distributed in the hope that it will be useful, but WITHOUT
12 ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or
13 FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License
16 You should have received a copy of the GNU General Public License
17 along with GNU CC; see the file COPYING. If not, write to the Free
18 Software Foundation, 59 Temple Place - Suite 330, Boston, MA
21 /* Generic garbage collection (GC) functions and data, not specific to
22 any particular GC implementation. */
33 /* Statistics about the allocation. */
34 static ggc_statistics *ggc_stats;
36 static void ggc_mark_rtx_ptr PARAMS ((void *));
37 static void ggc_mark_tree_ptr PARAMS ((void *));
38 static void ggc_mark_tree_varray_ptr PARAMS ((void *));
39 static void ggc_mark_tree_hash_table_ptr PARAMS ((void *));
40 static void ggc_mark_string_ptr PARAMS ((void *));
41 static boolean ggc_mark_tree_hash_table_entry PARAMS ((struct hash_entry *,
44 /* Maintain global roots that are preserved during GC. */
46 /* Global roots that are preserved during calls to gc. */
50 struct ggc_root *next;
54 void (*cb) PROTO ((void *));
57 static struct ggc_root *roots;
59 /* Type-correct function to pass to ggc_add_root. It just forwards
60 *ELT (which is an rtx) to ggc_mark_tree_varray. */
63 ggc_mark_rtx_ptr (elt)
66 ggc_mark_rtx (*(rtx *) elt);
69 /* Type-correct function to pass to ggc_add_root. It just forwards
70 *ELT (which is a tree) to ggc_mark_tree. */
73 ggc_mark_tree_ptr (elt)
76 ggc_mark_tree (*(tree *) elt);
79 /* Type-correct function to pass to ggc_add_root. It just forwards
80 ELT (which is really a varray_type *) to ggc_mark_tree_varray. */
83 ggc_mark_tree_varray_ptr (elt)
86 ggc_mark_tree_varray (*(varray_type *) elt);
89 /* Type-correct function to pass to ggc_add_root. It just forwards
90 ELT (which is really a struct hash_table **) to
91 ggc_mark_tree_hash_table. */
94 ggc_mark_tree_hash_table_ptr (elt)
97 ggc_mark_tree_hash_table (*(struct hash_table **) elt);
100 /* Type-correct function to pass to ggc_add_root. It just forwards
101 ELT (which is really a char **) to ggc_mark_string. */
104 ggc_mark_string_ptr (elt)
107 ggc_mark_string (*(char **) elt);
110 /* Add BASE as a new garbage collection root. It is an array of
111 length NELT with each element SIZE bytes long. CB is a
112 function that will be called with a pointer to each element
113 of the array; it is the intention that CB call the appropriate
114 routine to mark gc-able memory for that element. */
117 ggc_add_root (base, nelt, size, cb)
120 void (*cb) PROTO ((void *));
122 struct ggc_root *x = (struct ggc_root *) xmalloc (sizeof (*x));
133 /* Register an array of rtx as a GC root. */
136 ggc_add_rtx_root (base, nelt)
140 ggc_add_root (base, nelt, sizeof(rtx), ggc_mark_rtx_ptr);
143 /* Register an array of trees as a GC root. */
146 ggc_add_tree_root (base, nelt)
150 ggc_add_root (base, nelt, sizeof(tree), ggc_mark_tree_ptr);
153 /* Register a varray of trees as a GC root. */
156 ggc_add_tree_varray_root (base, nelt)
160 ggc_add_root (base, nelt, sizeof (varray_type),
161 ggc_mark_tree_varray_ptr);
164 /* Register a hash table of trees as a GC root. */
167 ggc_add_tree_hash_table_root (base, nelt)
168 struct hash_table **base;
171 ggc_add_root (base, nelt, sizeof (struct hash_table *),
172 ggc_mark_tree_hash_table_ptr);
175 /* Register an array of strings as a GC root. */
178 ggc_add_string_root (base, nelt)
182 ggc_add_root (base, nelt, sizeof (char *), ggc_mark_string_ptr);
185 /* Remove the previously registered GC root at BASE. */
191 struct ggc_root *x, **p;
193 p = &roots, x = roots;
209 /* Iterate through all registered roots and mark each element. */
216 for (x = roots; x != NULL; x = x->next)
219 int s = x->size, n = x->nelt;
220 void (*cb) PROTO ((void *)) = x->cb;
223 for (i = 0; i < n; ++i, elt += s)
228 /* R had not been previously marked, but has now been marked via
229 ggc_set_mark. Now recurse and process the children. */
232 ggc_mark_rtx_children (r)
237 enum rtx_code code = GET_CODE (r);
239 /* Collect statistics, if appropriate. */
242 ++ggc_stats->num_rtxs[(int) code];
243 ggc_stats->size_rtxs[(int) code] += ggc_get_size (r);
246 /* ??? If (some of) these are really pass-dependant info, do we have
247 any right poking our noses in? */
251 ggc_mark_rtx (JUMP_LABEL (r));
254 ggc_mark_rtx (LABEL_REFS (r));
255 ggc_mark_string (LABEL_ALTERNATE_NAME (r));
258 ggc_mark_rtx (LABEL_NEXTREF (r));
259 ggc_mark_rtx (CONTAINING_INSN (r));
262 ggc_mark_tree (ADDRESSOF_DECL (r));
265 ggc_mark_rtx (CONST_DOUBLE_CHAIN (r));
268 switch (NOTE_LINE_NUMBER (r))
270 case NOTE_INSN_RANGE_START:
271 case NOTE_INSN_RANGE_END:
273 ggc_mark_rtx (NOTE_RANGE_INFO (r));
276 case NOTE_INSN_BLOCK_BEG:
277 case NOTE_INSN_BLOCK_END:
278 ggc_mark_tree (NOTE_BLOCK (r));
282 if (NOTE_LINE_NUMBER (r) >= 0)
283 ggc_mark_string (NOTE_SOURCE_FILE (r));
292 for (fmt = GET_RTX_FORMAT (GET_CODE (r)), i = 0; *fmt ; ++fmt, ++i)
297 ggc_mark_rtx (XEXP (r, i));
300 ggc_mark_rtvec (XVEC (r, i));
303 ggc_mark_if_gcable (XSTR (r, i));
309 /* V had not been previously marked, but has now been marked via
310 ggc_set_mark. Now recurse and process the children. */
313 ggc_mark_rtvec_children (v)
318 i = GET_NUM_ELEM (v);
320 ggc_mark_rtx (RTVEC_ELT (v, i));
323 /* T had not been previously marked, but has now been marked via
324 ggc_set_mark. Now recurse and process the children. */
327 ggc_mark_tree_children (t)
330 enum tree_code code = TREE_CODE (t);
332 /* Collect statistics, if appropriate. */
335 ++ggc_stats->num_trees[(int) code];
336 ggc_stats->size_trees[(int) code] += ggc_get_size (t);
339 /* Bits from common. */
340 ggc_mark_tree (TREE_TYPE (t));
341 ggc_mark_tree (TREE_CHAIN (t));
343 /* Some nodes require special handling. */
347 ggc_mark_tree (TREE_PURPOSE (t));
348 ggc_mark_tree (TREE_VALUE (t));
353 int i = TREE_VEC_LENGTH (t);
355 ggc_mark_tree (TREE_VEC_ELT (t, i));
360 ggc_mark_tree (TREE_OPERAND (t, 0));
361 ggc_mark_tree (SAVE_EXPR_CONTEXT (t));
362 ggc_mark_rtx (SAVE_EXPR_RTL (t));
366 ggc_mark_rtx (RTL_EXPR_SEQUENCE (t));
367 ggc_mark_rtx (RTL_EXPR_RTL (t));
371 ggc_mark_tree (TREE_OPERAND (t, 0));
372 ggc_mark_tree (TREE_OPERAND (t, 1));
373 ggc_mark_rtx (CALL_EXPR_RTL (t));
377 ggc_mark_tree (TREE_REALPART (t));
378 ggc_mark_tree (TREE_IMAGPART (t));
382 ggc_mark_string (TREE_STRING_POINTER (t));
386 ggc_mark_rtx (DECL_INCOMING_RTL (t));
389 case IDENTIFIER_NODE:
390 ggc_mark_string (IDENTIFIER_POINTER (t));
398 /* But in general we can handle them by class. */
399 switch (TREE_CODE_CLASS (code))
401 case 'd': /* A decl node. */
402 ggc_mark_string (DECL_SOURCE_FILE (t));
403 ggc_mark_tree (DECL_SIZE (t));
404 ggc_mark_tree (DECL_NAME (t));
405 ggc_mark_tree (DECL_CONTEXT (t));
406 ggc_mark_tree (DECL_ARGUMENTS (t));
407 ggc_mark_tree (DECL_RESULT (t));
408 ggc_mark_tree (DECL_INITIAL (t));
409 ggc_mark_tree (DECL_ABSTRACT_ORIGIN (t));
410 ggc_mark_tree (DECL_ASSEMBLER_NAME (t));
411 ggc_mark_tree (DECL_SECTION_NAME (t));
412 ggc_mark_tree (DECL_MACHINE_ATTRIBUTES (t));
413 ggc_mark_rtx (DECL_RTL (t));
414 ggc_mark_rtx (DECL_LIVE_RANGE_RTL (t));
415 ggc_mark_tree (DECL_VINDEX (t));
419 case 't': /* A type node. */
420 ggc_mark_tree (TYPE_SIZE (t));
421 ggc_mark_tree (TYPE_SIZE_UNIT (t));
422 ggc_mark_tree (TYPE_ATTRIBUTES (t));
423 ggc_mark_tree (TYPE_VALUES (t));
424 ggc_mark_tree (TYPE_POINTER_TO (t));
425 ggc_mark_tree (TYPE_REFERENCE_TO (t));
426 ggc_mark_tree (TYPE_NAME (t));
427 ggc_mark_tree (TYPE_MIN_VALUE (t));
428 ggc_mark_tree (TYPE_MAX_VALUE (t));
429 ggc_mark_tree (TYPE_NEXT_VARIANT (t));
430 ggc_mark_tree (TYPE_MAIN_VARIANT (t));
431 ggc_mark_tree (TYPE_BINFO (t));
432 ggc_mark_tree (TYPE_NONCOPIED_PARTS (t));
433 ggc_mark_tree (TYPE_CONTEXT (t));
437 case 'b': /* A lexical block. */
438 ggc_mark_tree (BLOCK_VARS (t));
439 ggc_mark_tree (BLOCK_SUBBLOCKS (t));
440 ggc_mark_tree (BLOCK_SUPERCONTEXT (t));
441 ggc_mark_tree (BLOCK_ABSTRACT_ORIGIN (t));
444 case 'c': /* A constant. */
445 ggc_mark_rtx (TREE_CST_RTL (t));
448 case 'r': case '<': case '1':
449 case '2': case 'e': case 's': /* Expressions. */
451 int i = tree_code_length[TREE_CODE (t)];
453 ggc_mark_tree (TREE_OPERAND (t, i));
463 /* Mark all the elements of the varray V, which contains trees. */
466 ggc_mark_tree_varray (v)
472 for (i = v->num_elements - 1; i >= 0; --i)
473 ggc_mark_tree (VARRAY_TREE (v, i));
476 /* Mark the hash table-entry HE. It's key field is really a tree. */
479 ggc_mark_tree_hash_table_entry (he, k)
480 struct hash_entry *he;
481 hash_table_key k ATTRIBUTE_UNUSED;
483 ggc_mark_tree ((tree) he->key);
487 /* Mark all the elements of the hash-table H, which contains trees. */
490 ggc_mark_tree_hash_table (ht)
491 struct hash_table *ht;
493 hash_traverse (ht, ggc_mark_tree_hash_table_entry, /*info=*/0);
496 /* Allocate a gc-able string. If CONTENTS is null, then the memory will
497 be uninitialized. If LENGTH is -1, then CONTENTS is assumed to be a
498 null-terminated string and the memory sized accordingly. Otherwise,
499 the memory is filled with LENGTH bytes from CONTENTS. */
502 ggc_alloc_string (contents, length)
503 const char *contents;
510 if (contents == NULL)
512 length = strlen (contents);
515 string = (char *) ggc_alloc_obj (length + 1, 0);
516 if (contents != NULL)
517 memcpy (string, contents, length);
523 /* Print statistics that are independent of the collector in use. */
526 ggc_print_statistics (stream, stats)
528 ggc_statistics *stats;
532 /* Set the pointer so that during collection we will actually gather
536 /* Then do one collection to fill in the statistics. */
539 /* Total the statistics. */
540 for (code = 0; code < MAX_TREE_CODES; ++code)
542 stats->total_num_trees += stats->num_trees[code];
543 stats->total_size_trees += stats->size_trees[code];
545 for (code = 0; code < NUM_RTX_CODE; ++code)
547 stats->total_num_rtxs += stats->num_rtxs[code];
548 stats->total_size_rtxs += stats->size_rtxs[code];
551 /* Print the statistics for trees. */
552 fprintf (stream, "%-22s%-16s%-16s%-7s\n", "Code",
553 "Number", "Bytes", "% Total");
554 for (code = 0; code < MAX_TREE_CODES; ++code)
555 if (ggc_stats->num_trees[code])
557 fprintf (stream, "%s%*s%-15u %-15lu %7.3f\n",
558 tree_code_name[code],
559 22 - (int) strlen (tree_code_name[code]), "",
560 ggc_stats->num_trees[code],
561 (unsigned long) ggc_stats->size_trees[code],
562 (100 * ((double) ggc_stats->size_trees[code])
563 / ggc_stats->total_size_trees));
566 "%-22s%-15u %-15lu\n", "Total",
567 ggc_stats->total_num_trees,
568 (unsigned long) ggc_stats->total_size_trees);
570 /* Print the statistics for RTL. */
571 fprintf (stream, "\n%-22s%-16s%-16s%-7s\n", "Code",
572 "Number", "Bytes", "% Total");
573 for (code = 0; code < NUM_RTX_CODE; ++code)
574 if (ggc_stats->num_rtxs[code])
576 fprintf (stream, "%s%*s%-15u %-15lu %7.3f\n",
578 22 - (int) strlen (rtx_name[code]), "",
579 ggc_stats->num_rtxs[code],
580 (unsigned long) ggc_stats->size_rtxs[code],
581 (100 * ((double) ggc_stats->size_rtxs[code])
582 / ggc_stats->total_size_rtxs));
585 "%-22s%-15u %-15lu\n", "Total",
586 ggc_stats->total_num_rtxs,
587 (unsigned long) ggc_stats->total_size_rtxs);
590 /* Don't gather statistics any more. */