1 /* Simple garbage collection for the GNU compiler.
2 Copyright (C) 1999, 2000 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 /* The FALSE_LABEL_STACK, declared in except.h, has language-dependent
37 semantics. If a front-end needs to mark the false label stack, it
38 should set this pointer to a non-NULL value. Otherwise, no marking
40 void (*lang_mark_false_label_stack) PARAMS ((struct label_node *));
42 /* Trees that have been marked, but whose children still need marking. */
43 varray_type ggc_pending_trees;
45 static void ggc_mark_rtx_ptr PARAMS ((void *));
46 static void ggc_mark_tree_ptr PARAMS ((void *));
47 static void ggc_mark_rtx_varray_ptr PARAMS ((void *));
48 static void ggc_mark_tree_varray_ptr PARAMS ((void *));
49 static void ggc_mark_tree_hash_table_ptr PARAMS ((void *));
50 static void ggc_mark_trees PARAMS ((void));
51 static boolean ggc_mark_tree_hash_table_entry PARAMS ((struct hash_entry *,
54 /* Maintain global roots that are preserved during GC. */
56 /* Global roots that are preserved during calls to gc. */
60 struct ggc_root *next;
64 void (*cb) PARAMS ((void *));
67 static struct ggc_root *roots;
69 /* Add BASE as a new garbage collection root. It is an array of
70 length NELT with each element SIZE bytes long. CB is a
71 function that will be called with a pointer to each element
72 of the array; it is the intention that CB call the appropriate
73 routine to mark gc-able memory for that element. */
76 ggc_add_root (base, nelt, size, cb)
79 void (*cb) PARAMS ((void *));
81 struct ggc_root *x = (struct ggc_root *) xmalloc (sizeof (*x));
92 /* Register an array of rtx as a GC root. */
95 ggc_add_rtx_root (base, nelt)
99 ggc_add_root (base, nelt, sizeof (rtx), ggc_mark_rtx_ptr);
102 /* Register an array of trees as a GC root. */
105 ggc_add_tree_root (base, nelt)
109 ggc_add_root (base, nelt, sizeof (tree), ggc_mark_tree_ptr);
112 /* Register a varray of rtxs as a GC root. */
115 ggc_add_rtx_varray_root (base, nelt)
119 ggc_add_root (base, nelt, sizeof (varray_type),
120 ggc_mark_rtx_varray_ptr);
123 /* Register a varray of trees as a GC root. */
126 ggc_add_tree_varray_root (base, nelt)
130 ggc_add_root (base, nelt, sizeof (varray_type),
131 ggc_mark_tree_varray_ptr);
134 /* Register a hash table of trees as a GC root. */
137 ggc_add_tree_hash_table_root (base, nelt)
138 struct hash_table **base;
141 ggc_add_root (base, nelt, sizeof (struct hash_table *),
142 ggc_mark_tree_hash_table_ptr);
145 /* Remove the previously registered GC root at BASE. */
151 struct ggc_root *x, **p;
153 p = &roots, x = roots;
169 /* Iterate through all registered roots and mark each element. */
176 VARRAY_TREE_INIT (ggc_pending_trees, 4096, "ggc_pending_trees");
178 for (x = roots; x != NULL; x = x->next)
181 int s = x->size, n = x->nelt;
182 void (*cb) PARAMS ((void *)) = x->cb;
185 for (i = 0; i < n; ++i, elt += s)
189 /* Mark all the queued up trees, and their children. */
191 VARRAY_FREE (ggc_pending_trees);
194 /* R had not been previously marked, but has now been marked via
195 ggc_set_mark. Now recurse and process the children. */
198 ggc_mark_rtx_children (r)
207 enum rtx_code code = GET_CODE (r);
208 /* This gets set to a child rtx to eliminate tail recursion. */
211 /* Collect statistics, if appropriate. */
214 ++ggc_stats->num_rtxs[(int) code];
215 ggc_stats->size_rtxs[(int) code] += ggc_get_size (r);
218 /* ??? If (some of) these are really pass-dependent info, do we
219 have any right poking our noses in? */
223 ggc_mark_rtx (JUMP_LABEL (r));
226 ggc_mark_rtx (LABEL_REFS (r));
229 ggc_mark_rtx (LABEL_NEXTREF (r));
230 ggc_mark_rtx (CONTAINING_INSN (r));
233 ggc_mark_tree (ADDRESSOF_DECL (r));
236 ggc_mark_rtx (CONST_DOUBLE_CHAIN (r));
239 switch (NOTE_LINE_NUMBER (r))
241 case NOTE_INSN_RANGE_BEG:
242 case NOTE_INSN_RANGE_END:
244 case NOTE_INSN_EXPECTED_VALUE:
245 ggc_mark_rtx (NOTE_RANGE_INFO (r));
248 case NOTE_INSN_BLOCK_BEG:
249 case NOTE_INSN_BLOCK_END:
250 ggc_mark_tree (NOTE_BLOCK (r));
262 for (fmt = GET_RTX_FORMAT (GET_CODE (r)), i = 0; *fmt ; ++fmt, ++i)
269 if (ggc_test_and_set_mark (exp))
271 if (next_rtx == NULL)
274 ggc_mark_rtx_children (exp);
278 ggc_mark_rtvec (XVEC (r, i));
281 ggc_mark_if_gcable (XSTR (r, i));
286 while ((r = next_rtx) != NULL);
289 /* V had not been previously marked, but has now been marked via
290 ggc_set_mark. Now recurse and process the children. */
293 ggc_mark_rtvec_children (v)
298 i = GET_NUM_ELEM (v);
300 ggc_mark_rtx (RTVEC_ELT (v, i));
303 /* Recursively set marks on all of the children of the
304 GCC_PENDING_TREES. */
309 while (ggc_pending_trees->elements_used)
314 t = VARRAY_TOP_TREE (ggc_pending_trees);
315 VARRAY_POP (ggc_pending_trees);
316 code = TREE_CODE (t);
318 /* Collect statistics, if appropriate. */
321 ++ggc_stats->num_trees[(int) code];
322 ggc_stats->size_trees[(int) code] += ggc_get_size (t);
325 /* Bits from common. */
326 ggc_mark_tree (TREE_TYPE (t));
327 ggc_mark_tree (TREE_CHAIN (t));
329 /* Some nodes require special handling. */
333 ggc_mark_tree (TREE_PURPOSE (t));
334 ggc_mark_tree (TREE_VALUE (t));
339 int i = TREE_VEC_LENGTH (t);
342 ggc_mark_tree (TREE_VEC_ELT (t, i));
347 ggc_mark_tree (TREE_REALPART (t));
348 ggc_mark_tree (TREE_IMAGPART (t));
352 ggc_mark_rtx (DECL_INCOMING_RTL (t));
356 ggc_mark_tree (DECL_FIELD_BIT_OFFSET (t));
359 case IDENTIFIER_NODE:
367 /* But in general we can handle them by class. */
368 switch (TREE_CODE_CLASS (code))
370 case 'd': /* A decl node. */
371 ggc_mark_tree (DECL_SIZE (t));
372 ggc_mark_tree (DECL_SIZE_UNIT (t));
373 ggc_mark_tree (DECL_NAME (t));
374 ggc_mark_tree (DECL_CONTEXT (t));
375 ggc_mark_tree (DECL_ARGUMENTS (t));
376 ggc_mark_tree (DECL_RESULT_FLD (t));
377 ggc_mark_tree (DECL_INITIAL (t));
378 ggc_mark_tree (DECL_ABSTRACT_ORIGIN (t));
379 ggc_mark_tree (DECL_ASSEMBLER_NAME (t));
380 ggc_mark_tree (DECL_SECTION_NAME (t));
381 ggc_mark_tree (DECL_MACHINE_ATTRIBUTES (t));
382 ggc_mark_rtx (DECL_RTL (t));
383 ggc_mark_rtx (DECL_LIVE_RANGE_RTL (t));
384 ggc_mark_tree (DECL_VINDEX (t));
388 case 't': /* A type node. */
389 ggc_mark_tree (TYPE_SIZE (t));
390 ggc_mark_tree (TYPE_SIZE_UNIT (t));
391 ggc_mark_tree (TYPE_ATTRIBUTES (t));
392 ggc_mark_tree (TYPE_VALUES (t));
393 ggc_mark_tree (TYPE_POINTER_TO (t));
394 ggc_mark_tree (TYPE_REFERENCE_TO (t));
395 ggc_mark_tree (TYPE_NAME (t));
396 ggc_mark_tree (TYPE_MIN_VALUE (t));
397 ggc_mark_tree (TYPE_MAX_VALUE (t));
398 ggc_mark_tree (TYPE_NEXT_VARIANT (t));
399 ggc_mark_tree (TYPE_MAIN_VARIANT (t));
400 ggc_mark_tree (TYPE_BINFO (t));
401 ggc_mark_tree (TYPE_NONCOPIED_PARTS (t));
402 ggc_mark_tree (TYPE_CONTEXT (t));
406 case 'b': /* A lexical block. */
407 ggc_mark_tree (BLOCK_VARS (t));
408 ggc_mark_tree (BLOCK_SUBBLOCKS (t));
409 ggc_mark_tree (BLOCK_SUPERCONTEXT (t));
410 ggc_mark_tree (BLOCK_ABSTRACT_ORIGIN (t));
413 case 'c': /* A constant. */
414 ggc_mark_rtx (TREE_CST_RTL (t));
417 case 'r': case '<': case '1':
418 case '2': case 'e': case 's': /* Expressions. */
420 int i = TREE_CODE_LENGTH (TREE_CODE (t));
421 int first_rtl = first_rtl_op (TREE_CODE (t));
426 ggc_mark_rtx ((rtx) TREE_OPERAND (t, i));
428 ggc_mark_tree (TREE_OPERAND (t, i));
440 /* Mark all the elements of the varray V, which contains rtxs. */
443 ggc_mark_rtx_varray (v)
449 for (i = v->num_elements - 1; i >= 0; --i)
450 ggc_mark_rtx (VARRAY_RTX (v, i));
453 /* Mark all the elements of the varray V, which contains trees. */
456 ggc_mark_tree_varray (v)
462 for (i = v->num_elements - 1; i >= 0; --i)
463 ggc_mark_tree (VARRAY_TREE (v, i));
466 /* Mark the hash table-entry HE. It's key field is really a tree. */
469 ggc_mark_tree_hash_table_entry (he, k)
470 struct hash_entry *he;
471 hash_table_key k ATTRIBUTE_UNUSED;
473 ggc_mark_tree ((tree) he->key);
477 /* Mark all the elements of the hash-table H, which contains trees. */
480 ggc_mark_tree_hash_table (ht)
481 struct hash_table *ht;
483 hash_traverse (ht, ggc_mark_tree_hash_table_entry, /*info=*/0);
486 /* Type-correct function to pass to ggc_add_root. It just forwards
487 *ELT (which is an rtx) to ggc_mark_rtx. */
490 ggc_mark_rtx_ptr (elt)
493 ggc_mark_rtx (*(rtx *) elt);
496 /* Type-correct function to pass to ggc_add_root. It just forwards
497 *ELT (which is a tree) to ggc_mark_tree. */
500 ggc_mark_tree_ptr (elt)
503 ggc_mark_tree (*(tree *) elt);
506 /* Type-correct function to pass to ggc_add_root. It just forwards
507 ELT (which is really a varray_type *) to ggc_mark_rtx_varray. */
510 ggc_mark_rtx_varray_ptr (elt)
513 ggc_mark_rtx_varray (*(varray_type *) elt);
516 /* Type-correct function to pass to ggc_add_root. It just forwards
517 ELT (which is really a varray_type *) to ggc_mark_tree_varray. */
520 ggc_mark_tree_varray_ptr (elt)
523 ggc_mark_tree_varray (*(varray_type *) elt);
526 /* Type-correct function to pass to ggc_add_root. It just forwards
527 ELT (which is really a struct hash_table **) to
528 ggc_mark_tree_hash_table. */
531 ggc_mark_tree_hash_table_ptr (elt)
534 ggc_mark_tree_hash_table (*(struct hash_table **) elt);
537 /* Allocate a block of memory, then clear it. */
539 ggc_alloc_cleared (size)
542 void *buf = ggc_alloc (size);
543 memset (buf, 0, size);
547 /* Print statistics that are independent of the collector in use. */
548 #define SCALE(x) ((unsigned long) ((x) < 1024*10 \
550 : ((x) < 1024*1024*10 \
552 : (x) / (1024*1024))))
553 #define LABEL(x) ((x) < 1024*10 ? ' ' : ((x) < 1024*1024*10 ? 'k' : 'M'))
556 ggc_print_common_statistics (stream, stats)
558 ggc_statistics *stats;
562 /* Set the pointer so that during collection we will actually gather
566 /* Then do one collection to fill in the statistics. */
569 /* Total the statistics. */
570 for (code = 0; code < MAX_TREE_CODES; ++code)
572 stats->total_num_trees += stats->num_trees[code];
573 stats->total_size_trees += stats->size_trees[code];
575 for (code = 0; code < NUM_RTX_CODE; ++code)
577 stats->total_num_rtxs += stats->num_rtxs[code];
578 stats->total_size_rtxs += stats->size_rtxs[code];
581 /* Print the statistics for trees. */
582 fprintf (stream, "\n%-17s%10s %16s %10s\n", "Tree",
583 "Number", "Bytes", "% Total");
584 for (code = 0; code < MAX_TREE_CODES; ++code)
585 if (ggc_stats->num_trees[code])
587 fprintf (stream, "%-17s%10u%16ld%c %10.3f\n",
588 tree_code_name[code],
589 ggc_stats->num_trees[code],
590 SCALE (ggc_stats->size_trees[code]),
591 LABEL (ggc_stats->size_trees[code]),
592 (100 * ((double) ggc_stats->size_trees[code])
593 / ggc_stats->total_size_trees));
596 "%-17s%10u%16ld%c\n", "Total",
597 ggc_stats->total_num_trees,
598 SCALE (ggc_stats->total_size_trees),
599 LABEL (ggc_stats->total_size_trees));
601 /* Print the statistics for RTL. */
602 fprintf (stream, "\n%-17s%10s %16s %10s\n", "RTX",
603 "Number", "Bytes", "% Total");
604 for (code = 0; code < NUM_RTX_CODE; ++code)
605 if (ggc_stats->num_rtxs[code])
607 fprintf (stream, "%-17s%10u%16ld%c %10.3f\n",
609 ggc_stats->num_rtxs[code],
610 SCALE (ggc_stats->size_rtxs[code]),
611 LABEL (ggc_stats->size_rtxs[code]),
612 (100 * ((double) ggc_stats->size_rtxs[code])
613 / ggc_stats->total_size_rtxs));
616 "%-17s%10u%16ld%c\n", "Total",
617 ggc_stats->total_num_rtxs,
618 SCALE (ggc_stats->total_size_rtxs),
619 LABEL (ggc_stats->total_size_rtxs));
621 /* Don't gather statistics any more. */