]>
Commit | Line | Data |
---|---|---|
558ee214 JM |
1 | /* Tree-dumping functionality for C-family languages. |
2 | Copyright (C) 2002 Free Software Foundation, Inc. | |
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" | |
4977bab6 ZW |
24 | #include "coretypes.h" |
25 | #include "tm.h" | |
558ee214 JM |
26 | #include "tree.h" |
27 | #include "c-tree.h" | |
28 | #include "tree-dump.h" | |
29 | ||
30 | /* Dump information common to statements from STMT. */ | |
31 | ||
32 | void | |
33 | dump_stmt (di, t) | |
34 | dump_info_p di; | |
35 | tree t; | |
36 | { | |
37 | dump_int (di, "line", STMT_LINENO (t)); | |
38 | } | |
39 | ||
40 | /* Dump the next statement after STMT. */ | |
41 | ||
42 | void | |
43 | dump_next_stmt (di, t) | |
44 | dump_info_p di; | |
45 | tree t; | |
46 | { | |
47 | dump_child ("next", TREE_CHAIN (t)); | |
48 | } | |
49 | ||
50 | /* Dump any C-specific tree codes and attributes of common codes. */ | |
51 | ||
52 | int | |
53 | c_dump_tree (dump_info, t) | |
54 | void *dump_info; | |
55 | tree t; | |
56 | { | |
57 | enum tree_code code; | |
58 | dump_info_p di = (dump_info_p) dump_info; | |
59 | ||
60 | /* Figure out what kind of node this is. */ | |
61 | code = TREE_CODE (t); | |
62 | ||
63 | switch (code) | |
64 | { | |
65 | case FIELD_DECL: | |
66 | if (DECL_C_BIT_FIELD (t)) | |
67 | dump_string (di, "bitfield"); | |
68 | break; | |
69 | ||
70 | case ASM_STMT: | |
71 | dump_stmt (di, t); | |
72 | if (ASM_VOLATILE_P (t)) | |
73 | dump_string (di, "volatile"); | |
74 | dump_child ("strg", ASM_STRING (t)); | |
75 | dump_child ("outs", ASM_OUTPUTS (t)); | |
76 | dump_child ("ins", ASM_INPUTS (t)); | |
77 | dump_child ("clbr", ASM_CLOBBERS (t)); | |
78 | dump_next_stmt (di, t); | |
79 | break; | |
80 | ||
81 | case BREAK_STMT: | |
82 | case CONTINUE_STMT: | |
83 | dump_stmt (di, t); | |
84 | dump_next_stmt (di, t); | |
85 | break; | |
86 | ||
87 | case CASE_LABEL: | |
88 | /* Note that a case label is not like other statements; there is | |
89 | no way to get the line-number of a case label. */ | |
90 | dump_child ("low", CASE_LOW (t)); | |
91 | dump_child ("high", CASE_HIGH (t)); | |
92 | dump_next_stmt (di, t); | |
93 | break; | |
94 | ||
95 | case CLEANUP_STMT: | |
96 | dump_stmt (di, t); | |
97 | dump_child ("decl", CLEANUP_DECL (t)); | |
98 | dump_child ("expr", CLEANUP_EXPR (t)); | |
99 | dump_next_stmt (di, t); | |
100 | break; | |
101 | ||
102 | case COMPOUND_STMT: | |
103 | dump_stmt (di, t); | |
104 | dump_child ("body", COMPOUND_BODY (t)); | |
105 | dump_next_stmt (di, t); | |
106 | break; | |
107 | ||
108 | case DECL_STMT: | |
109 | dump_stmt (di, t); | |
110 | dump_child ("decl", DECL_STMT_DECL (t)); | |
111 | dump_next_stmt (di, t); | |
112 | break; | |
113 | ||
114 | case DO_STMT: | |
115 | dump_stmt (di, t); | |
116 | dump_child ("body", DO_BODY (t)); | |
117 | dump_child ("cond", DO_COND (t)); | |
118 | dump_next_stmt (di, t); | |
119 | break; | |
120 | ||
121 | case EXPR_STMT: | |
122 | dump_stmt (di, t); | |
123 | dump_child ("expr", EXPR_STMT_EXPR (t)); | |
124 | dump_next_stmt (di, t); | |
125 | break; | |
126 | ||
127 | case FOR_STMT: | |
128 | dump_stmt (di, t); | |
129 | dump_child ("init", FOR_INIT_STMT (t)); | |
130 | dump_child ("cond", FOR_COND (t)); | |
131 | dump_child ("expr", FOR_EXPR (t)); | |
132 | dump_child ("body", FOR_BODY (t)); | |
133 | dump_next_stmt (di, t); | |
134 | break; | |
135 | ||
136 | case GOTO_STMT: | |
137 | dump_stmt (di, t); | |
138 | dump_child ("dest", GOTO_DESTINATION (t)); | |
139 | dump_next_stmt (di, t); | |
140 | break; | |
141 | ||
142 | case IF_STMT: | |
143 | dump_stmt (di, t); | |
144 | dump_child ("cond", IF_COND (t)); | |
145 | dump_child ("then", THEN_CLAUSE (t)); | |
146 | dump_child ("else", ELSE_CLAUSE (t)); | |
147 | dump_next_stmt (di, t); | |
148 | break; | |
149 | ||
150 | case LABEL_STMT: | |
151 | dump_stmt (di, t); | |
152 | dump_child ("labl", LABEL_STMT_LABEL (t)); | |
153 | dump_next_stmt (di, t); | |
154 | break; | |
155 | ||
156 | case RETURN_STMT: | |
157 | dump_stmt (di, t); | |
d65b1d77 | 158 | dump_child ("expr", RETURN_STMT_EXPR (t)); |
558ee214 JM |
159 | dump_next_stmt (di, t); |
160 | break; | |
161 | ||
162 | case SWITCH_STMT: | |
163 | dump_stmt (di, t); | |
164 | dump_child ("cond", SWITCH_COND (t)); | |
165 | dump_child ("body", SWITCH_BODY (t)); | |
166 | dump_next_stmt (di, t); | |
167 | break; | |
168 | ||
169 | case WHILE_STMT: | |
170 | dump_stmt (di, t); | |
171 | dump_child ("cond", WHILE_COND (t)); | |
172 | dump_child ("body", WHILE_BODY (t)); | |
173 | dump_next_stmt (di, t); | |
174 | break; | |
175 | ||
176 | case SCOPE_STMT: | |
177 | dump_stmt (di, t); | |
178 | if (SCOPE_BEGIN_P (t)) | |
179 | dump_string (di, "begn"); | |
180 | else | |
181 | dump_string (di, "end"); | |
182 | if (SCOPE_NULLIFIED_P (t)) | |
183 | dump_string (di, "null"); | |
184 | if (!SCOPE_NO_CLEANUPS_P (t)) | |
185 | dump_string (di, "clnp"); | |
186 | dump_next_stmt (di, t); | |
187 | break; | |
188 | ||
189 | case STMT_EXPR: | |
190 | dump_child ("stmt", STMT_EXPR_STMT (t)); | |
191 | break; | |
192 | ||
193 | default: | |
194 | break; | |
195 | } | |
196 | ||
197 | return 0; | |
198 | } |