]>
Commit | Line | Data |
---|---|---|
74338ff6 | 1 | /* Tree-dumping functionality for intermediate representation. |
dc24ddbd | 2 | Copyright (C) 1999, 2000, 2002, 2003, 2004 Free Software Foundation, Inc. |
74338ff6 | 3 | Written by Mark Mitchell <mark@codesourcery.com> |
4 | ||
5 | This file is part of GCC. | |
6 | ||
7 | GCC is free software; you can redistribute it and/or modify it under | |
8 | the terms of the GNU General Public License as published by the Free | |
9 | Software Foundation; either version 2, or (at your option) any later | |
10 | version. | |
11 | ||
12 | GCC is distributed in the hope that it will be useful, but WITHOUT ANY | |
13 | WARRANTY; without even the implied warranty of MERCHANTABILITY or | |
14 | FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License | |
15 | for more details. | |
16 | ||
17 | You should have received a copy of the GNU General Public License | |
18 | along with GCC; see the file COPYING. If not, write to the Free | |
19 | Software Foundation, 59 Temple Place - Suite 330, Boston, MA | |
20 | 02111-1307, USA. */ | |
21 | ||
22 | #include "config.h" | |
23 | #include "system.h" | |
805e22b2 | 24 | #include "coretypes.h" |
25 | #include "tm.h" | |
74338ff6 | 26 | #include "tree.h" |
74338ff6 | 27 | #include "splay-tree.h" |
28 | #include "diagnostic.h" | |
29 | #include "toplev.h" | |
3119c950 | 30 | #include "tree-dump.h" |
0f9005dd | 31 | #include "tree-pass.h" |
74338ff6 | 32 | #include "langhooks.h" |
e8c5dd3c | 33 | #include "tree-iterator.h" |
74338ff6 | 34 | |
d598ad0d | 35 | static unsigned int queue (dump_info_p, tree, int); |
36 | static void dump_index (dump_info_p, unsigned int); | |
37 | static void dequeue_and_dump (dump_info_p); | |
38 | static void dump_new_line (dump_info_p); | |
39 | static void dump_maybe_newline (dump_info_p); | |
40 | static void dump_string_field (dump_info_p, const char *, const char *); | |
0f9005dd | 41 | static int dump_enable_all (int, int); |
74338ff6 | 42 | |
43 | /* Add T to the end of the queue of nodes to dump. Returns the index | |
44 | assigned to T. */ | |
45 | ||
46 | static unsigned int | |
d598ad0d | 47 | queue (dump_info_p di, tree t, int flags) |
74338ff6 | 48 | { |
49 | dump_queue_p dq; | |
50 | dump_node_info_p dni; | |
51 | unsigned int index; | |
52 | ||
53 | /* Assign the next available index to T. */ | |
54 | index = ++di->index; | |
55 | ||
56 | /* Obtain a new queue node. */ | |
57 | if (di->free_list) | |
58 | { | |
59 | dq = di->free_list; | |
60 | di->free_list = dq->next; | |
61 | } | |
62 | else | |
f0af5a88 | 63 | dq = xmalloc (sizeof (struct dump_queue)); |
74338ff6 | 64 | |
65 | /* Create a new entry in the splay-tree. */ | |
f0af5a88 | 66 | dni = xmalloc (sizeof (struct dump_node_info)); |
74338ff6 | 67 | dni->index = index; |
68 | dni->binfo_p = ((flags & DUMP_BINFO) != 0); | |
40570cc2 | 69 | dq->node = splay_tree_insert (di->nodes, (splay_tree_key) t, |
74338ff6 | 70 | (splay_tree_value) dni); |
71 | ||
72 | /* Add it to the end of the queue. */ | |
73 | dq->next = 0; | |
74 | if (!di->queue_end) | |
75 | di->queue = dq; | |
76 | else | |
77 | di->queue_end->next = dq; | |
78 | di->queue_end = dq; | |
79 | ||
80 | /* Return the index. */ | |
81 | return index; | |
82 | } | |
83 | ||
84 | static void | |
d598ad0d | 85 | dump_index (dump_info_p di, unsigned int index) |
74338ff6 | 86 | { |
87 | fprintf (di->stream, "@%-6u ", index); | |
88 | di->column += 8; | |
89 | } | |
90 | ||
91 | /* If T has not already been output, queue it for subsequent output. | |
92 | FIELD is a string to print before printing the index. Then, the | |
93 | index of T is printed. */ | |
94 | ||
95 | void | |
d598ad0d | 96 | queue_and_dump_index (dump_info_p di, const char *field, tree t, int flags) |
74338ff6 | 97 | { |
98 | unsigned int index; | |
99 | splay_tree_node n; | |
100 | ||
101 | /* If there's no node, just return. This makes for fewer checks in | |
102 | our callers. */ | |
103 | if (!t) | |
104 | return; | |
105 | ||
106 | /* See if we've already queued or dumped this node. */ | |
107 | n = splay_tree_lookup (di->nodes, (splay_tree_key) t); | |
108 | if (n) | |
109 | index = ((dump_node_info_p) n->value)->index; | |
110 | else | |
111 | /* If we haven't, add it to the queue. */ | |
112 | index = queue (di, t, flags); | |
113 | ||
114 | /* Print the index of the node. */ | |
115 | dump_maybe_newline (di); | |
116 | fprintf (di->stream, "%-4s: ", field); | |
117 | di->column += 6; | |
118 | dump_index (di, index); | |
119 | } | |
120 | ||
121 | /* Dump the type of T. */ | |
122 | ||
123 | void | |
d598ad0d | 124 | queue_and_dump_type (dump_info_p di, tree t) |
74338ff6 | 125 | { |
126 | queue_and_dump_index (di, "type", TREE_TYPE (t), DUMP_NONE); | |
127 | } | |
128 | ||
129 | /* Dump column control */ | |
130 | #define SOL_COLUMN 25 /* Start of line column. */ | |
131 | #define EOL_COLUMN 55 /* End of line column. */ | |
132 | #define COLUMN_ALIGNMENT 15 /* Alignment. */ | |
133 | ||
134 | /* Insert a new line in the dump output, and indent to an appropriate | |
135 | place to start printing more fields. */ | |
136 | ||
137 | static void | |
d598ad0d | 138 | dump_new_line (dump_info_p di) |
74338ff6 | 139 | { |
140 | fprintf (di->stream, "\n%*s", SOL_COLUMN, ""); | |
141 | di->column = SOL_COLUMN; | |
142 | } | |
143 | ||
144 | /* If necessary, insert a new line. */ | |
145 | ||
146 | static void | |
d598ad0d | 147 | dump_maybe_newline (dump_info_p di) |
74338ff6 | 148 | { |
149 | int extra; | |
40570cc2 | 150 | |
74338ff6 | 151 | /* See if we need a new line. */ |
152 | if (di->column > EOL_COLUMN) | |
153 | dump_new_line (di); | |
154 | /* See if we need any padding. */ | |
155 | else if ((extra = (di->column - SOL_COLUMN) % COLUMN_ALIGNMENT) != 0) | |
156 | { | |
157 | fprintf (di->stream, "%*s", COLUMN_ALIGNMENT - extra, ""); | |
158 | di->column += COLUMN_ALIGNMENT - extra; | |
159 | } | |
160 | } | |
161 | ||
162 | /* Dump pointer PTR using FIELD to identify it. */ | |
163 | ||
164 | void | |
d598ad0d | 165 | dump_pointer (dump_info_p di, const char *field, void *ptr) |
74338ff6 | 166 | { |
167 | dump_maybe_newline (di); | |
168 | fprintf (di->stream, "%-4s: %-8lx ", field, (long) ptr); | |
169 | di->column += 15; | |
170 | } | |
171 | ||
172 | /* Dump integer I using FIELD to identify it. */ | |
173 | ||
174 | void | |
d598ad0d | 175 | dump_int (dump_info_p di, const char *field, int i) |
74338ff6 | 176 | { |
177 | dump_maybe_newline (di); | |
178 | fprintf (di->stream, "%-4s: %-7d ", field, i); | |
179 | di->column += 14; | |
180 | } | |
181 | ||
182 | /* Dump the string S. */ | |
183 | ||
184 | void | |
d598ad0d | 185 | dump_string (dump_info_p di, const char *string) |
74338ff6 | 186 | { |
187 | dump_maybe_newline (di); | |
188 | fprintf (di->stream, "%-13s ", string); | |
189 | if (strlen (string) > 13) | |
190 | di->column += strlen (string) + 1; | |
191 | else | |
192 | di->column += 14; | |
193 | } | |
194 | ||
195 | /* Dump the string field S. */ | |
196 | ||
197 | static void | |
d598ad0d | 198 | dump_string_field (dump_info_p di, const char *field, const char *string) |
74338ff6 | 199 | { |
200 | dump_maybe_newline (di); | |
201 | fprintf (di->stream, "%-4s: %-7s ", field, string); | |
202 | if (strlen (string) > 7) | |
203 | di->column += 6 + strlen (string) + 1; | |
204 | else | |
205 | di->column += 14; | |
206 | } | |
207 | ||
74338ff6 | 208 | /* Dump the next node in the queue. */ |
209 | ||
40570cc2 | 210 | static void |
d598ad0d | 211 | dequeue_and_dump (dump_info_p di) |
74338ff6 | 212 | { |
213 | dump_queue_p dq; | |
214 | splay_tree_node stn; | |
215 | dump_node_info_p dni; | |
216 | tree t; | |
217 | unsigned int index; | |
218 | enum tree_code code; | |
ce45a448 | 219 | enum tree_code_class code_class; |
74338ff6 | 220 | const char* code_name; |
221 | ||
222 | /* Get the next node from the queue. */ | |
223 | dq = di->queue; | |
224 | stn = dq->node; | |
225 | t = (tree) stn->key; | |
226 | dni = (dump_node_info_p) stn->value; | |
227 | index = dni->index; | |
228 | ||
229 | /* Remove the node from the queue, and put it on the free list. */ | |
230 | di->queue = dq->next; | |
231 | if (!di->queue) | |
232 | di->queue_end = 0; | |
233 | dq->next = di->free_list; | |
234 | di->free_list = dq; | |
235 | ||
236 | /* Print the node index. */ | |
237 | dump_index (di, index); | |
238 | /* And the type of node this is. */ | |
239 | if (dni->binfo_p) | |
240 | code_name = "binfo"; | |
241 | else | |
242 | code_name = tree_code_name[(int) TREE_CODE (t)]; | |
243 | fprintf (di->stream, "%-16s ", code_name); | |
244 | di->column = 25; | |
245 | ||
246 | /* Figure out what kind of node this is. */ | |
247 | code = TREE_CODE (t); | |
248 | code_class = TREE_CODE_CLASS (code); | |
249 | ||
250 | /* Although BINFOs are TREE_VECs, we dump them specially so as to be | |
251 | more informative. */ | |
252 | if (dni->binfo_p) | |
253 | { | |
95f3173a | 254 | unsigned ix; |
f6cc6a08 | 255 | tree base; |
db77fe17 | 256 | VEC (tree) *accesses = BINFO_BASE_ACCESSES (t); |
d598ad0d | 257 | |
95f3173a | 258 | dump_child ("type", BINFO_TYPE (t)); |
259 | ||
57c28194 | 260 | if (BINFO_VIRTUAL_P (t)) |
74338ff6 | 261 | dump_string (di, "virt"); |
40570cc2 | 262 | |
f6cc6a08 | 263 | dump_int (di, "bases", BINFO_N_BASE_BINFOS (t)); |
264 | for (ix = 0; BINFO_BASE_ITERATE (t, ix, base); ix++) | |
95f3173a | 265 | { |
db77fe17 | 266 | tree access = (accesses ? VEC_index (tree, accesses, ix) |
95f3173a | 267 | : access_public_node); |
268 | const char *string = NULL; | |
269 | ||
270 | if (access == access_public_node) | |
271 | string = "pub"; | |
272 | else if (access == access_protected_node) | |
273 | string = "prot"; | |
274 | else if (access == access_private_node) | |
275 | string = "priv"; | |
276 | else | |
8c0963c4 | 277 | gcc_unreachable (); |
d598ad0d | 278 | |
95f3173a | 279 | dump_string (di, string); |
280 | queue_and_dump_index (di, "binf", base, DUMP_BINFO); | |
281 | } | |
d598ad0d | 282 | |
74338ff6 | 283 | goto done; |
284 | } | |
285 | ||
286 | /* We can knock off a bunch of expression nodes in exactly the same | |
287 | way. */ | |
288 | if (IS_EXPR_CODE_CLASS (code_class)) | |
289 | { | |
290 | /* If we're dumping children, dump them now. */ | |
291 | queue_and_dump_type (di, t); | |
292 | ||
293 | switch (code_class) | |
294 | { | |
ce45a448 | 295 | case tcc_unary: |
74338ff6 | 296 | dump_child ("op 0", TREE_OPERAND (t, 0)); |
297 | break; | |
40570cc2 | 298 | |
ce45a448 | 299 | case tcc_binary: |
300 | case tcc_comparison: | |
74338ff6 | 301 | dump_child ("op 0", TREE_OPERAND (t, 0)); |
302 | dump_child ("op 1", TREE_OPERAND (t, 1)); | |
303 | break; | |
40570cc2 | 304 | |
ce45a448 | 305 | case tcc_expression: |
306 | case tcc_reference: | |
307 | case tcc_statement: | |
74338ff6 | 308 | /* These nodes are handled explicitly below. */ |
309 | break; | |
40570cc2 | 310 | |
74338ff6 | 311 | default: |
8c0963c4 | 312 | gcc_unreachable (); |
74338ff6 | 313 | } |
314 | } | |
315 | else if (DECL_P (t)) | |
316 | { | |
2ed8b5d0 | 317 | expanded_location xloc; |
74338ff6 | 318 | /* All declarations have names. */ |
319 | if (DECL_NAME (t)) | |
320 | dump_child ("name", DECL_NAME (t)); | |
40570cc2 | 321 | if (DECL_ASSEMBLER_NAME_SET_P (t) |
74338ff6 | 322 | && DECL_ASSEMBLER_NAME (t) != DECL_NAME (t)) |
323 | dump_child ("mngl", DECL_ASSEMBLER_NAME (t)); | |
324 | /* And types. */ | |
325 | queue_and_dump_type (di, t); | |
326 | dump_child ("scpe", DECL_CONTEXT (t)); | |
327 | /* And a source position. */ | |
2ed8b5d0 | 328 | xloc = expand_location (DECL_SOURCE_LOCATION (t)); |
329 | if (xloc.file) | |
74338ff6 | 330 | { |
2ed8b5d0 | 331 | const char *filename = strrchr (xloc.file, '/'); |
74338ff6 | 332 | if (!filename) |
2ed8b5d0 | 333 | filename = xloc.file; |
74338ff6 | 334 | else |
335 | /* Skip the slash. */ | |
336 | ++filename; | |
337 | ||
338 | dump_maybe_newline (di); | |
40570cc2 | 339 | fprintf (di->stream, "srcp: %s:%-6d ", filename, |
2ed8b5d0 | 340 | xloc.line); |
74338ff6 | 341 | di->column += 6 + strlen (filename) + 8; |
342 | } | |
343 | /* And any declaration can be compiler-generated. */ | |
344 | if (DECL_ARTIFICIAL (t)) | |
345 | dump_string (di, "artificial"); | |
346 | if (TREE_CHAIN (t) && !dump_flag (di, TDF_SLIM, NULL)) | |
347 | dump_child ("chan", TREE_CHAIN (t)); | |
348 | } | |
ce45a448 | 349 | else if (code_class == tcc_type) |
74338ff6 | 350 | { |
351 | /* All types have qualifiers. */ | |
dc24ddbd | 352 | int quals = lang_hooks.tree_dump.type_quals (t); |
40570cc2 | 353 | |
74338ff6 | 354 | if (quals != TYPE_UNQUALIFIED) |
355 | { | |
356 | fprintf (di->stream, "qual: %c%c%c ", | |
357 | (quals & TYPE_QUAL_CONST) ? 'c' : ' ', | |
358 | (quals & TYPE_QUAL_VOLATILE) ? 'v' : ' ', | |
359 | (quals & TYPE_QUAL_RESTRICT) ? 'r' : ' '); | |
360 | di->column += 14; | |
361 | } | |
362 | ||
363 | /* All types have associated declarations. */ | |
364 | dump_child ("name", TYPE_NAME (t)); | |
365 | ||
366 | /* All types have a main variant. */ | |
367 | if (TYPE_MAIN_VARIANT (t) != t) | |
368 | dump_child ("unql", TYPE_MAIN_VARIANT (t)); | |
40570cc2 | 369 | |
74338ff6 | 370 | /* And sizes. */ |
371 | dump_child ("size", TYPE_SIZE (t)); | |
372 | ||
373 | /* All types have alignments. */ | |
374 | dump_int (di, "algn", TYPE_ALIGN (t)); | |
375 | } | |
ce45a448 | 376 | else if (code_class == tcc_constant) |
74338ff6 | 377 | /* All constants can have types. */ |
378 | queue_and_dump_type (di, t); | |
379 | ||
380 | /* Give the language-specific code a chance to print something. If | |
381 | it's completely taken care of things, don't bother printing | |
382 | anything more ourselves. */ | |
dc24ddbd | 383 | if (lang_hooks.tree_dump.dump_tree (di, t)) |
74338ff6 | 384 | goto done; |
385 | ||
386 | /* Now handle the various kinds of nodes. */ | |
387 | switch (code) | |
388 | { | |
389 | int i; | |
390 | ||
391 | case IDENTIFIER_NODE: | |
392 | dump_string_field (di, "strg", IDENTIFIER_POINTER (t)); | |
393 | dump_int (di, "lngt", IDENTIFIER_LENGTH (t)); | |
394 | break; | |
395 | ||
396 | case TREE_LIST: | |
397 | dump_child ("purp", TREE_PURPOSE (t)); | |
398 | dump_child ("valu", TREE_VALUE (t)); | |
399 | dump_child ("chan", TREE_CHAIN (t)); | |
400 | break; | |
401 | ||
e8c5dd3c | 402 | case STATEMENT_LIST: |
403 | { | |
404 | tree_stmt_iterator it; | |
405 | for (i = 0, it = tsi_start (t); !tsi_end_p (it); tsi_next (&it), i++) | |
406 | { | |
407 | char buffer[32]; | |
408 | sprintf (buffer, "%u", i); | |
409 | dump_child (buffer, tsi_stmt (it)); | |
410 | } | |
411 | } | |
412 | break; | |
413 | ||
74338ff6 | 414 | case TREE_VEC: |
415 | dump_int (di, "lngt", TREE_VEC_LENGTH (t)); | |
416 | for (i = 0; i < TREE_VEC_LENGTH (t); ++i) | |
417 | { | |
418 | char buffer[32]; | |
419 | sprintf (buffer, "%u", i); | |
420 | dump_child (buffer, TREE_VEC_ELT (t, i)); | |
421 | } | |
422 | break; | |
423 | ||
424 | case INTEGER_TYPE: | |
425 | case ENUMERAL_TYPE: | |
426 | dump_int (di, "prec", TYPE_PRECISION (t)); | |
78a8ed03 | 427 | if (TYPE_UNSIGNED (t)) |
74338ff6 | 428 | dump_string (di, "unsigned"); |
429 | dump_child ("min", TYPE_MIN_VALUE (t)); | |
430 | dump_child ("max", TYPE_MAX_VALUE (t)); | |
431 | ||
432 | if (code == ENUMERAL_TYPE) | |
433 | dump_child ("csts", TYPE_VALUES (t)); | |
434 | break; | |
435 | ||
436 | case REAL_TYPE: | |
437 | dump_int (di, "prec", TYPE_PRECISION (t)); | |
438 | break; | |
439 | ||
440 | case POINTER_TYPE: | |
441 | dump_child ("ptd", TREE_TYPE (t)); | |
442 | break; | |
443 | ||
444 | case REFERENCE_TYPE: | |
445 | dump_child ("refd", TREE_TYPE (t)); | |
446 | break; | |
447 | ||
448 | case METHOD_TYPE: | |
449 | dump_child ("clas", TYPE_METHOD_BASETYPE (t)); | |
450 | /* Fall through. */ | |
451 | ||
452 | case FUNCTION_TYPE: | |
453 | dump_child ("retn", TREE_TYPE (t)); | |
454 | dump_child ("prms", TYPE_ARG_TYPES (t)); | |
455 | break; | |
456 | ||
457 | case ARRAY_TYPE: | |
458 | dump_child ("elts", TREE_TYPE (t)); | |
459 | dump_child ("domn", TYPE_DOMAIN (t)); | |
460 | break; | |
461 | ||
462 | case RECORD_TYPE: | |
463 | case UNION_TYPE: | |
464 | if (TREE_CODE (t) == RECORD_TYPE) | |
465 | dump_string (di, "struct"); | |
466 | else | |
467 | dump_string (di, "union"); | |
40570cc2 | 468 | |
74338ff6 | 469 | dump_child ("flds", TYPE_FIELDS (t)); |
470 | dump_child ("fncs", TYPE_METHODS (t)); | |
40570cc2 | 471 | queue_and_dump_index (di, "binf", TYPE_BINFO (t), |
74338ff6 | 472 | DUMP_BINFO); |
473 | break; | |
474 | ||
475 | case CONST_DECL: | |
476 | dump_child ("cnst", DECL_INITIAL (t)); | |
477 | break; | |
478 | ||
479 | case VAR_DECL: | |
480 | case PARM_DECL: | |
481 | case FIELD_DECL: | |
482 | case RESULT_DECL: | |
483 | if (TREE_CODE (t) == PARM_DECL) | |
484 | dump_child ("argt", DECL_ARG_TYPE (t)); | |
485 | else | |
486 | dump_child ("init", DECL_INITIAL (t)); | |
487 | dump_child ("size", DECL_SIZE (t)); | |
488 | dump_int (di, "algn", DECL_ALIGN (t)); | |
489 | ||
490 | if (TREE_CODE (t) == FIELD_DECL) | |
491 | { | |
74338ff6 | 492 | if (DECL_FIELD_OFFSET (t)) |
493 | dump_child ("bpos", bit_position (t)); | |
494 | } | |
40570cc2 | 495 | else if (TREE_CODE (t) == VAR_DECL |
74338ff6 | 496 | || TREE_CODE (t) == PARM_DECL) |
497 | { | |
498 | dump_int (di, "used", TREE_USED (t)); | |
499 | if (DECL_REGISTER (t)) | |
500 | dump_string (di, "register"); | |
501 | } | |
502 | break; | |
503 | ||
504 | case FUNCTION_DECL: | |
505 | dump_child ("args", DECL_ARGUMENTS (t)); | |
506 | if (DECL_EXTERNAL (t)) | |
507 | dump_string (di, "undefined"); | |
508 | if (TREE_PUBLIC (t)) | |
509 | dump_string (di, "extern"); | |
510 | else | |
511 | dump_string (di, "static"); | |
512 | if (DECL_LANG_SPECIFIC (t) && !dump_flag (di, TDF_SLIM, t)) | |
513 | dump_child ("body", DECL_SAVED_TREE (t)); | |
514 | break; | |
515 | ||
74338ff6 | 516 | case INTEGER_CST: |
517 | if (TREE_INT_CST_HIGH (t)) | |
518 | dump_int (di, "high", TREE_INT_CST_HIGH (t)); | |
519 | dump_int (di, "low", TREE_INT_CST_LOW (t)); | |
520 | break; | |
521 | ||
522 | case STRING_CST: | |
523 | fprintf (di->stream, "strg: %-7s ", TREE_STRING_POINTER (t)); | |
524 | dump_int (di, "lngt", TREE_STRING_LENGTH (t)); | |
525 | break; | |
526 | ||
527 | case TRUTH_NOT_EXPR: | |
528 | case ADDR_EXPR: | |
529 | case INDIRECT_REF: | |
b056d812 | 530 | case ALIGN_INDIRECT_REF: |
531 | case MISALIGNED_INDIRECT_REF: | |
74338ff6 | 532 | case CLEANUP_POINT_EXPR: |
533 | case SAVE_EXPR: | |
b25de375 | 534 | case REALPART_EXPR: |
535 | case IMAGPART_EXPR: | |
74338ff6 | 536 | /* These nodes are unary, but do not have code class `1'. */ |
537 | dump_child ("op 0", TREE_OPERAND (t, 0)); | |
538 | break; | |
539 | ||
540 | case TRUTH_ANDIF_EXPR: | |
541 | case TRUTH_ORIF_EXPR: | |
542 | case INIT_EXPR: | |
543 | case MODIFY_EXPR: | |
74338ff6 | 544 | case COMPOUND_EXPR: |
74338ff6 | 545 | case PREDECREMENT_EXPR: |
546 | case PREINCREMENT_EXPR: | |
547 | case POSTDECREMENT_EXPR: | |
548 | case POSTINCREMENT_EXPR: | |
549 | /* These nodes are binary, but do not have code class `2'. */ | |
550 | dump_child ("op 0", TREE_OPERAND (t, 0)); | |
551 | dump_child ("op 1", TREE_OPERAND (t, 1)); | |
552 | break; | |
553 | ||
6374121b | 554 | case COMPONENT_REF: |
555 | dump_child ("op 0", TREE_OPERAND (t, 0)); | |
556 | dump_child ("op 1", TREE_OPERAND (t, 1)); | |
557 | dump_child ("op 2", TREE_OPERAND (t, 2)); | |
558 | break; | |
559 | ||
560 | case ARRAY_REF: | |
561 | case ARRAY_RANGE_REF: | |
562 | dump_child ("op 0", TREE_OPERAND (t, 0)); | |
563 | dump_child ("op 1", TREE_OPERAND (t, 1)); | |
564 | dump_child ("op 2", TREE_OPERAND (t, 2)); | |
565 | dump_child ("op 3", TREE_OPERAND (t, 3)); | |
566 | break; | |
567 | ||
74338ff6 | 568 | case COND_EXPR: |
569 | dump_child ("op 0", TREE_OPERAND (t, 0)); | |
570 | dump_child ("op 1", TREE_OPERAND (t, 1)); | |
571 | dump_child ("op 2", TREE_OPERAND (t, 2)); | |
572 | break; | |
573 | ||
574 | case CALL_EXPR: | |
575 | dump_child ("fn", TREE_OPERAND (t, 0)); | |
576 | dump_child ("args", TREE_OPERAND (t, 1)); | |
577 | break; | |
578 | ||
579 | case CONSTRUCTOR: | |
3ad60ec8 | 580 | dump_child ("elts", CONSTRUCTOR_ELTS (t)); |
74338ff6 | 581 | break; |
582 | ||
74338ff6 | 583 | case BIND_EXPR: |
584 | dump_child ("vars", TREE_OPERAND (t, 0)); | |
585 | dump_child ("body", TREE_OPERAND (t, 1)); | |
586 | break; | |
587 | ||
588 | case LOOP_EXPR: | |
589 | dump_child ("body", TREE_OPERAND (t, 0)); | |
590 | break; | |
591 | ||
592 | case EXIT_EXPR: | |
593 | dump_child ("cond", TREE_OPERAND (t, 0)); | |
594 | break; | |
595 | ||
596 | case TARGET_EXPR: | |
597 | dump_child ("decl", TREE_OPERAND (t, 0)); | |
598 | dump_child ("init", TREE_OPERAND (t, 1)); | |
599 | dump_child ("clnp", TREE_OPERAND (t, 2)); | |
600 | /* There really are two possible places the initializer can be. | |
601 | After RTL expansion, the second operand is moved to the | |
602 | position of the fourth operand, and the second operand | |
603 | becomes NULL. */ | |
604 | dump_child ("init", TREE_OPERAND (t, 3)); | |
605 | break; | |
40570cc2 | 606 | |
74338ff6 | 607 | default: |
608 | /* There are no additional fields to print. */ | |
609 | break; | |
610 | } | |
611 | ||
612 | done: | |
613 | if (dump_flag (di, TDF_ADDRESS, NULL)) | |
614 | dump_pointer (di, "addr", (void *)t); | |
40570cc2 | 615 | |
74338ff6 | 616 | /* Terminate the line. */ |
617 | fprintf (di->stream, "\n"); | |
618 | } | |
619 | ||
f712a0dc | 620 | /* Return nonzero if FLAG has been specified for the dump, and NODE |
74338ff6 | 621 | is not the root node of the dump. */ |
622 | ||
d598ad0d | 623 | int dump_flag (dump_info_p di, int flag, tree node) |
74338ff6 | 624 | { |
625 | return (di->flags & flag) && (node != di->node); | |
626 | } | |
627 | ||
628 | /* Dump T, and all its children, on STREAM. */ | |
629 | ||
630 | void | |
d598ad0d | 631 | dump_node (tree t, int flags, FILE *stream) |
74338ff6 | 632 | { |
633 | struct dump_info di; | |
634 | dump_queue_p dq; | |
635 | dump_queue_p next_dq; | |
636 | ||
637 | /* Initialize the dump-information structure. */ | |
638 | di.stream = stream; | |
639 | di.index = 0; | |
640 | di.column = 0; | |
641 | di.queue = 0; | |
642 | di.queue_end = 0; | |
643 | di.free_list = 0; | |
644 | di.flags = flags; | |
645 | di.node = t; | |
40570cc2 | 646 | di.nodes = splay_tree_new (splay_tree_compare_pointers, 0, |
74338ff6 | 647 | (splay_tree_delete_value_fn) &free); |
648 | ||
649 | /* Queue up the first node. */ | |
650 | queue (&di, t, DUMP_NONE); | |
651 | ||
652 | /* Until the queue is empty, keep dumping nodes. */ | |
653 | while (di.queue) | |
654 | dequeue_and_dump (&di); | |
655 | ||
656 | /* Now, clean up. */ | |
657 | for (dq = di.free_list; dq; dq = next_dq) | |
658 | { | |
659 | next_dq = dq->next; | |
660 | free (dq); | |
661 | } | |
662 | splay_tree_delete (di.nodes); | |
663 | } | |
0f9005dd | 664 | \f |
74338ff6 | 665 | |
666 | /* Table of tree dump switches. This must be consistent with the | |
667 | TREE_DUMP_INDEX enumeration in tree.h */ | |
668 | static struct dump_file_info dump_files[TDI_end] = | |
669 | { | |
53907817 | 670 | {NULL, NULL, NULL, 0, 0, 0, 0}, |
671 | {".tu", "translation-unit", NULL, TDF_TREE, 0, 0, 0}, | |
672 | {".class", "class-hierarchy", NULL, TDF_TREE, 0, 1, 0}, | |
673 | {".original", "tree-original", NULL, TDF_TREE, 0, 2, 0}, | |
674 | {".generic", "tree-generic", NULL, TDF_TREE, 0, 3, 0}, | |
675 | {".nested", "tree-nested", NULL, TDF_TREE, 0, 4, 0}, | |
676 | {".inlined", "tree-inlined", NULL, TDF_TREE, 0, 5, 0}, | |
677 | {".vcg", "tree-vcg", NULL, TDF_TREE, 0, 6, 0}, | |
678 | {NULL, "tree-all", NULL, TDF_TREE, 0, 0, 0}, | |
679 | {NULL, "rtl-all", NULL, TDF_RTL, 0, 0, 0}, | |
680 | {NULL, "ipa-all", NULL, TDF_IPA, 0, 0, 0}, | |
681 | ||
682 | { ".cgraph", "ipa-cgraph", NULL, TDF_IPA, 0, 1, 0}, | |
683 | ||
684 | { ".sibling", "rtl-sibling", NULL, TDF_RTL, 0, 1, 'i'}, | |
685 | { ".eh", "rtl-eh", NULL, TDF_RTL, 0, 2, 'h'}, | |
686 | { ".jump", "rtl-jump", NULL, TDF_RTL, 0, 3, 'j'}, | |
687 | { ".cse", "rtl-cse", NULL, TDF_RTL, 0, 4, 's'}, | |
688 | { ".gcse", "rtl-gcse", NULL, TDF_RTL, 0, 5, 'G'}, | |
689 | { ".loop", "rtl-loop", NULL, TDF_RTL, 0, 6, 'L'}, | |
690 | { ".bypass", "rtl-bypass", NULL, TDF_RTL, 0, 7, 'G'}, | |
691 | { ".cfg", "rtl-cfg", NULL, TDF_RTL, 0, 8, 'f'}, | |
692 | { ".bp", "rtl-bp", NULL, TDF_RTL, 0, 9, 'b'}, | |
693 | { ".vpt", "rtl-vpt", NULL, TDF_RTL, 0, 10, 'V'}, | |
694 | { ".ce1", "rtl-ce1", NULL, TDF_RTL, 0, 11, 'C'}, | |
695 | { ".tracer", "rtl-tracer", NULL, TDF_RTL, 0, 12, 'T'}, | |
696 | { ".loop2", "rtl-loop2", NULL, TDF_RTL, 0, 13, 'L'}, | |
697 | { ".web", "rtl-web", NULL, TDF_RTL, 0, 14, 'Z'}, | |
698 | { ".cse2", "rtl-cse2", NULL, TDF_RTL, 0, 15, 't'}, | |
699 | { ".life", "rtl-life", NULL, TDF_RTL, 0, 16, 'f'}, | |
700 | { ".combine", "rtl-combine", NULL, TDF_RTL, 0, 17, 'c'}, | |
701 | { ".ce2", "rtl-ce2", NULL, TDF_RTL, 0, 18, 'C'}, | |
702 | { ".regmove", "rtl-regmove", NULL, TDF_RTL, 0, 19, 'N'}, | |
703 | { ".sms", "rtl-sms", NULL, TDF_RTL, 0, 20, 'm'}, | |
704 | { ".sched", "rtl-sched", NULL, TDF_RTL, 0, 21, 'S'}, | |
705 | { ".lreg", "rtl-lreg", NULL, TDF_RTL, 0, 22, 'l'}, | |
706 | { ".greg", "rtl-greg", NULL, TDF_RTL, 0, 23, 'g'}, | |
707 | { ".postreload", "rtl-postreload", NULL, TDF_RTL, 0, 24, 'o'}, | |
708 | { ".gcse2", "rtl-gcse2", NULL, TDF_RTL, 0, 25, 'J'}, | |
709 | { ".flow2", "rtl-flow2", NULL, TDF_RTL, 0, 26, 'w'}, | |
710 | { ".peephole2", "rtl-peephole2", NULL, TDF_RTL, 0, 27, 'z'}, | |
711 | { ".ce3", "rtl-ce3", NULL, TDF_RTL, 0, 28, 'E'}, | |
712 | { ".rnreg", "rtl-rnreg", NULL, TDF_RTL, 0, 29, 'n'}, | |
713 | { ".bbro", "rtl-bbro", NULL, TDF_RTL, 0, 30, 'B'}, | |
714 | { ".btl", "rtl-btl", NULL, TDF_RTL, 0, 31, 'd'}, | |
715 | { ".sched2", "rtl-sched2", NULL, TDF_RTL, 0, 32, 'R'}, | |
716 | { ".stack", "rtl-stack", NULL, TDF_RTL, 0, 33, 'k'}, | |
717 | { ".vartrack", "rtl-vartrack", NULL, TDF_RTL, 0, 34, 'V'}, | |
718 | { ".mach", "rtl-mach", NULL, TDF_RTL, 0, 35, 'M'}, | |
719 | { ".dbr", "rtl-dbr", NULL, TDF_RTL, 0, 36, 'd'} | |
74338ff6 | 720 | }; |
721 | ||
4ee9c684 | 722 | /* Dynamically registered tree dump files and switches. */ |
723 | static struct dump_file_info *extra_dump_files; | |
724 | static size_t extra_dump_files_in_use; | |
725 | static size_t extra_dump_files_alloced; | |
726 | ||
74338ff6 | 727 | /* Define a name->number mapping for a dump flag value. */ |
728 | struct dump_option_value_info | |
729 | { | |
730 | const char *const name; /* the name of the value */ | |
731 | const int value; /* the value of the name */ | |
732 | }; | |
733 | ||
734 | /* Table of dump options. This must be consistent with the TDF_* flags | |
735 | in tree.h */ | |
736 | static const struct dump_option_value_info dump_options[] = | |
737 | { | |
738 | {"address", TDF_ADDRESS}, | |
739 | {"slim", TDF_SLIM}, | |
4ee9c684 | 740 | {"raw", TDF_RAW}, |
741 | {"details", TDF_DETAILS}, | |
742 | {"stats", TDF_STATS}, | |
743 | {"blocks", TDF_BLOCKS}, | |
744 | {"vops", TDF_VOPS}, | |
745 | {"lineno", TDF_LINENO}, | |
746 | {"uid", TDF_UID}, | |
42016140 | 747 | {"all", ~(TDF_RAW | TDF_SLIM | TDF_LINENO | TDF_TREE | TDF_RTL | TDF_IPA)}, |
74338ff6 | 748 | {NULL, 0} |
749 | }; | |
750 | ||
4ee9c684 | 751 | unsigned int |
53907817 | 752 | dump_register (const char *suffix, const char *swtch, const char *glob, |
753 | int flags, unsigned int num, int letter) | |
4ee9c684 | 754 | { |
755 | size_t this = extra_dump_files_in_use++; | |
756 | ||
757 | if (this >= extra_dump_files_alloced) | |
758 | { | |
759 | if (extra_dump_files_alloced == 0) | |
760 | extra_dump_files_alloced = 32; | |
761 | else | |
762 | extra_dump_files_alloced *= 2; | |
763 | extra_dump_files = xrealloc (extra_dump_files, | |
764 | sizeof (struct dump_file_info) | |
765 | * extra_dump_files_alloced); | |
766 | } | |
767 | ||
768 | memset (&extra_dump_files[this], 0, sizeof (struct dump_file_info)); | |
769 | extra_dump_files[this].suffix = suffix; | |
770 | extra_dump_files[this].swtch = swtch; | |
53907817 | 771 | extra_dump_files[this].glob = glob; |
0f9005dd | 772 | extra_dump_files[this].flags = flags; |
773 | extra_dump_files[this].num = num; | |
774 | extra_dump_files[this].letter = letter; | |
4ee9c684 | 775 | |
776 | return this + TDI_end; | |
777 | } | |
778 | ||
0f9005dd | 779 | |
4ee9c684 | 780 | /* Return the dump_file_info for the given phase. */ |
781 | ||
0f9005dd | 782 | struct dump_file_info * |
4ee9c684 | 783 | get_dump_file_info (enum tree_dump_index phase) |
784 | { | |
785 | if (phase < TDI_end) | |
786 | return &dump_files[phase]; | |
787 | else if (phase - TDI_end >= extra_dump_files_in_use) | |
0f9005dd | 788 | return NULL; |
4ee9c684 | 789 | else |
790 | return extra_dump_files + (phase - TDI_end); | |
791 | } | |
792 | ||
793 | ||
0f9005dd | 794 | /* Return the name of the dump file for the given phase. |
795 | If the dump is not enabled, returns NULL. */ | |
796 | ||
797 | char * | |
798 | get_dump_file_name (enum tree_dump_index phase) | |
799 | { | |
800 | char dump_id[7]; | |
801 | struct dump_file_info *dfi; | |
802 | ||
803 | if (phase == TDI_none) | |
804 | return NULL; | |
805 | ||
806 | dfi = get_dump_file_info (phase); | |
807 | if (dfi->state == 0) | |
808 | return NULL; | |
809 | ||
121f3051 | 810 | if (dfi->num < 0) |
0f9005dd | 811 | dump_id[0] = '\0'; |
121f3051 | 812 | else |
813 | { | |
814 | const char *template; | |
815 | if (dfi->flags & TDF_TREE) | |
816 | template = ".t%02d"; | |
817 | else if (dfi->flags & TDF_IPA) | |
818 | template = ".i%02d"; | |
819 | else | |
820 | template = ".%02d"; | |
821 | ||
822 | if (snprintf (dump_id, sizeof (dump_id), template, dfi->num) < 0) | |
823 | dump_id[0] = '\0'; | |
824 | } | |
0f9005dd | 825 | |
826 | return concat (dump_base_name, dump_id, dfi->suffix, NULL); | |
827 | } | |
828 | ||
74338ff6 | 829 | /* Begin a tree dump for PHASE. Stores any user supplied flag in |
830 | *FLAG_PTR and returns a stream to write to. If the dump is not | |
831 | enabled, returns NULL. | |
832 | Multiple calls will reopen and append to the dump file. */ | |
833 | ||
834 | FILE * | |
d598ad0d | 835 | dump_begin (enum tree_dump_index phase, int *flag_ptr) |
74338ff6 | 836 | { |
74338ff6 | 837 | char *name; |
4ee9c684 | 838 | struct dump_file_info *dfi; |
0f9005dd | 839 | FILE *stream; |
40570cc2 | 840 | |
0f9005dd | 841 | if (phase == TDI_none || !dump_enabled_p (phase)) |
74338ff6 | 842 | return NULL; |
40570cc2 | 843 | |
0f9005dd | 844 | name = get_dump_file_name (phase); |
4ee9c684 | 845 | dfi = get_dump_file_info (phase); |
4ee9c684 | 846 | stream = fopen (name, dfi->state < 0 ? "w" : "a"); |
74338ff6 | 847 | if (!stream) |
eb586f2c | 848 | error ("could not open dump file %qs: %s", name, strerror (errno)); |
74338ff6 | 849 | else |
4ee9c684 | 850 | dfi->state = 1; |
74338ff6 | 851 | free (name); |
4ee9c684 | 852 | |
74338ff6 | 853 | if (flag_ptr) |
4ee9c684 | 854 | *flag_ptr = dfi->flags; |
40570cc2 | 855 | |
74338ff6 | 856 | return stream; |
857 | } | |
858 | ||
f712a0dc | 859 | /* Returns nonzero if tree dump PHASE is enabled. */ |
74338ff6 | 860 | |
861 | int | |
d598ad0d | 862 | dump_enabled_p (enum tree_dump_index phase) |
74338ff6 | 863 | { |
4ee9c684 | 864 | struct dump_file_info *dfi = get_dump_file_info (phase); |
865 | return dfi->state; | |
74338ff6 | 866 | } |
867 | ||
0f9005dd | 868 | /* Returns nonzero if tree dump PHASE has been initialized. */ |
869 | ||
870 | int | |
871 | dump_initialized_p (enum tree_dump_index phase) | |
872 | { | |
873 | struct dump_file_info *dfi = get_dump_file_info (phase); | |
874 | return dfi->state > 0; | |
875 | } | |
876 | ||
74338ff6 | 877 | /* Returns the switch name of PHASE. */ |
878 | ||
879 | const char * | |
d598ad0d | 880 | dump_flag_name (enum tree_dump_index phase) |
74338ff6 | 881 | { |
4ee9c684 | 882 | struct dump_file_info *dfi = get_dump_file_info (phase); |
883 | return dfi->swtch; | |
74338ff6 | 884 | } |
885 | ||
886 | /* Finish a tree dump for PHASE. STREAM is the stream created by | |
887 | dump_begin. */ | |
888 | ||
889 | void | |
d598ad0d | 890 | dump_end (enum tree_dump_index phase ATTRIBUTE_UNUSED, FILE *stream) |
74338ff6 | 891 | { |
892 | fclose (stream); | |
893 | } | |
894 | ||
0f9005dd | 895 | /* Enable all tree dumps. Return number of enabled tree dumps. */ |
4ee9c684 | 896 | |
0f9005dd | 897 | static int |
898 | dump_enable_all (int flags, int letter) | |
4ee9c684 | 899 | { |
0f9005dd | 900 | int n = 0; |
4ee9c684 | 901 | size_t i; |
902 | ||
903 | for (i = TDI_none + 1; i < (size_t) TDI_end; i++) | |
0f9005dd | 904 | if ((dump_files[i].flags & flags) |
905 | && (letter == 0 || letter == dump_files[i].letter)) | |
906 | { | |
907 | dump_files[i].state = -1; | |
908 | dump_files[i].flags = flags; | |
909 | n++; | |
910 | } | |
4ee9c684 | 911 | |
912 | for (i = 0; i < extra_dump_files_in_use; i++) | |
0f9005dd | 913 | if ((extra_dump_files[i].flags & flags) |
914 | && (letter == 0 || letter == extra_dump_files[i].letter)) | |
915 | { | |
916 | extra_dump_files[i].state = -1; | |
917 | extra_dump_files[i].flags = flags; | |
918 | n++; | |
919 | } | |
4ee9c684 | 920 | |
0f9005dd | 921 | return n; |
4ee9c684 | 922 | } |
923 | ||
f712a0dc | 924 | /* Parse ARG as a dump switch. Return nonzero if it is, and store the |
74338ff6 | 925 | relevant details in the dump_files array. */ |
926 | ||
4ee9c684 | 927 | static int |
53907817 | 928 | dump_switch_p_1 (const char *arg, struct dump_file_info *dfi, bool doglob) |
74338ff6 | 929 | { |
74338ff6 | 930 | const char *option_value; |
4ee9c684 | 931 | const char *ptr; |
932 | int flags; | |
53907817 | 933 | |
934 | if (doglob && !dfi->glob) | |
935 | return 0; | |
40570cc2 | 936 | |
53907817 | 937 | option_value = skip_leading_substring (arg, doglob ? dfi->glob : dfi->swtch); |
4ee9c684 | 938 | if (!option_value) |
939 | return 0; | |
40570cc2 | 940 | |
4ee9c684 | 941 | ptr = option_value; |
942 | flags = 0; | |
943 | ||
944 | while (*ptr) | |
945 | { | |
946 | const struct dump_option_value_info *option_ptr; | |
947 | const char *end_ptr; | |
948 | unsigned length; | |
949 | ||
950 | while (*ptr == '-') | |
951 | ptr++; | |
952 | end_ptr = strchr (ptr, '-'); | |
953 | if (!end_ptr) | |
954 | end_ptr = ptr + strlen (ptr); | |
955 | length = end_ptr - ptr; | |
956 | ||
957 | for (option_ptr = dump_options; option_ptr->name; option_ptr++) | |
958 | if (strlen (option_ptr->name) == length | |
959 | && !memcmp (option_ptr->name, ptr, length)) | |
74338ff6 | 960 | { |
4ee9c684 | 961 | flags |= option_ptr->value; |
962 | goto found; | |
74338ff6 | 963 | } |
eb586f2c | 964 | warning ("ignoring unknown option %q.*s in %<-fdump-%s%>", |
4ee9c684 | 965 | length, ptr, dfi->swtch); |
966 | found:; | |
967 | ptr = end_ptr; | |
968 | } | |
969 | ||
970 | dfi->state = -1; | |
0f9005dd | 971 | dfi->flags |= flags; |
4ee9c684 | 972 | |
0f9005dd | 973 | /* Process -fdump-tree-all and -fdump-rtl-all, by enabling all the |
974 | known dumps. */ | |
4ee9c684 | 975 | if (dfi->suffix == NULL) |
0f9005dd | 976 | dump_enable_all (dfi->flags, 0); |
4ee9c684 | 977 | |
978 | return 1; | |
979 | } | |
40570cc2 | 980 | |
4ee9c684 | 981 | int |
982 | dump_switch_p (const char *arg) | |
983 | { | |
984 | size_t i; | |
985 | int any = 0; | |
986 | ||
987 | for (i = TDI_none + 1; i != TDI_end; i++) | |
53907817 | 988 | any |= dump_switch_p_1 (arg, &dump_files[i], false); |
989 | ||
990 | /* Don't glob if we got a hit already */ | |
991 | if (!any) | |
992 | for (i = TDI_none + 1; i != TDI_end; i++) | |
993 | any |= dump_switch_p_1 (arg, &dump_files[i], true); | |
4ee9c684 | 994 | |
995 | for (i = 0; i < extra_dump_files_in_use; i++) | |
53907817 | 996 | any |= dump_switch_p_1 (arg, &extra_dump_files[i], false); |
997 | ||
998 | if (!any) | |
999 | for (i = 0; i < extra_dump_files_in_use; i++) | |
1000 | any |= dump_switch_p_1 (arg, &extra_dump_files[i], true); | |
1001 | ||
4ee9c684 | 1002 | |
1003 | return any; | |
1004 | } | |
40570cc2 | 1005 | |
4ee9c684 | 1006 | /* Dump FUNCTION_DECL FN as tree dump PHASE. */ |
1007 | ||
1008 | void | |
1009 | dump_function (enum tree_dump_index phase, tree fn) | |
1010 | { | |
1011 | FILE *stream; | |
1012 | int flags; | |
1013 | ||
1014 | stream = dump_begin (phase, &flags); | |
1015 | if (stream) | |
1016 | { | |
1017 | dump_function_to_file (fn, stream, flags); | |
1018 | dump_end (phase, stream); | |
1019 | } | |
74338ff6 | 1020 | } |
0f9005dd | 1021 | |
1022 | bool | |
1023 | enable_rtl_dump_file (int letter) | |
1024 | { | |
1025 | if (letter == 'a') | |
1026 | letter = 0; | |
1027 | ||
1028 | return dump_enable_all (TDF_RTL, letter) > 0; | |
1029 | } | |
1030 | ||
1031 |