2 * Copyright (C) 1995-2008 University of Karlsruhe. All right reserved.
4 * This file is part of libFirm.
6 * This file may be distributed and/or modified under the terms of the
7 * GNU General Public License version 2 as published by the Free Software
8 * Foundation and appearing in the file LICENSE.GPL included in the
9 * packaging of this file.
11 * Licensees holding valid libFirm Professional Edition licenses may use
12 * this file in accordance with the libFirm Commercial License.
13 * Agreement provided with the Software.
15 * This file is provided AS IS with NO WARRANTY OF ANY KIND, INCLUDING THE
16 * WARRANTY OF DESIGN, MERCHANTABILITY AND FITNESS FOR A PARTICULAR
22 * @brief Write text representation of firm to file.
23 * @author Martin Trapp, Christian Schaefer, Goetz Lindenmaier, Hubert Schmidt,
35 #include "irgraph_t.h"
47 #include "field_temperature.h"
49 static ir_dump_verbosity_t verbosity = dump_verbosity_max;
51 void ir_set_dump_verbosity(ir_dump_verbosity_t new_verbosity)
53 verbosity = new_verbosity;
56 ir_dump_verbosity_t ir_get_dump_verbosity(void)
61 /* Write the irnode and all its attributes to the file passed. */
62 void dump_irnode_to_file(FILE *F, ir_node *n)
69 dump_node_opcode(F, n);
70 fprintf(F, " %ld\n", get_irn_node_nr(n));
72 fprintf(F, " index: %u\n", get_irn_idx(n));
73 if (ir_get_dump_flags() & ir_dump_flag_analysed_types)
74 fprintf (F, " addr: %p\n", (void *)n);
75 fprintf (F, " mode: %s\n", get_mode_name(get_irn_mode(n)));
76 fprintf (F, " visited: %ld\n", get_irn_visited(n));
78 if (irg != get_const_code_irg())
79 fprintf (F, " irg: %s\n", get_ent_dump_name(get_irg_entity(irg)));
81 if (get_irn_pinned(n) == op_pin_state_floats &&
82 get_irg_pinned(get_irn_irg(n)) == op_pin_state_floats) {
83 fprintf(F, " node was pinned in ");
84 dump_node_opcode(F, get_irn_n(n, -1));
85 fprintf(F, " %ld\n", get_irn_node_nr(get_irn_n(n, -1)));
88 fprintf(F, " arity: %d\n", get_irn_arity(n));
89 /* show all predecessor nodes */
90 fprintf(F, " pred nodes:\n");
93 dump_node_opcode(F, get_irn_n(n, -1));
94 fprintf(F, " %ld\n", get_irn_node_nr(get_irn_n(n, -1)));
96 for ( i = 0; i < get_irn_arity(n); ++i) {
97 fprintf(F, " %d: %s ", i, is_backedge(n, i) ? "be" : " ");
98 dump_node_opcode(F, get_irn_n(n, i));
99 fprintf(F, " %ld\n", get_irn_node_nr(get_irn_n(n, i)));
102 fprintf(F, " Private Attributes:\n");
105 fprintf(F, " proj nr: %ld\n", get_Proj_proj(n));
107 if (is_fragile_op(n)) {
108 fprintf(F, " pinned state: %s\n", get_op_pin_state_name(get_irn_pinned(n)));
109 /* not dumped: frag array */
112 /* This is not nice, output it as a marker in the predecessor list. */
114 get_irn_op(n) == op_Phi) {
115 fprintf(F, " backedges:");
117 for (i = 0; i < get_irn_arity(n); i++)
118 if (is_backedge(n, i)) { fprintf(F, "%c %d", comma, i); comma = ','; }
122 /* Loop node. Someone else please tell me what's wrong ... */
123 if (get_irg_loopinfo_state(irg) & loopinfo_valid) {
124 ir_loop *loop = get_irn_loop(n);
126 fprintf(F, " in loop %d with depth %d\n",
127 get_loop_loop_nr(loop), get_loop_depth(loop));
132 switch (get_irn_opcode(n)) {
134 if (has_Block_entity(n))
135 fprintf(F, " Label: %lu\n", get_entity_label(get_Block_entity(n)));
136 fprintf(F, " block visited: %ld\n", get_Block_block_visited(n));
137 fprintf(F, " block marked: %u\n", get_Block_mark(n));
138 if (get_irg_dom_state(get_irn_irg(n)) != dom_none) {
139 fprintf(F, " dom depth %d\n", get_Block_dom_depth(n));
140 fprintf(F, " tree pre num %d\n", get_Block_dom_tree_pre_num(n));
141 fprintf(F, " max subtree pre num %d\n", get_Block_dom_max_subtree_pre_num(n));
144 fprintf(F, " Execution frequency statistics:\n");
145 if (get_irg_exec_freq_state(get_irn_irg(n)) != exec_freq_none)
146 fprintf(F, " procedure local evaluation: %8.2lf\n", get_irn_exec_freq(n));
148 /* not dumped: graph_arr */
149 /* not dumped: mature */
152 ir_type *tp = get_entity_type(get_irg_entity(get_irn_irg(n)));
153 ir_fprintf(F, " start of method of type %+F\n", tp);
154 for (i = 0; i < get_method_n_params(tp); ++i)
155 ir_fprintf(F, " param %d type: %+F\n", i, get_method_param_type(tp, i));
158 fprintf(F, " default ProjNr: %ld\n", get_Cond_default_proj(n));
159 if (get_Cond_jmp_pred(n) != COND_JMP_PRED_NONE) {
160 fprintf(F, " jump prediction: %s\n",
161 get_cond_jmp_predicate_name(get_Cond_jmp_pred(n)));
165 ir_fprintf(F, " allocating entity of type: %+F\n", get_Alloc_type(n));
166 fprintf(F, " allocating on: the %s\n", (get_Alloc_where(n) == stack_alloc) ? "stack" : "heap");
169 ir_fprintf(F, " freeing entity of type %+F\n", get_Free_type(n));
170 fprintf(F, " allocated on: the %s\n", (get_Free_where(n) == stack_alloc) ? "stack" : "heap");
173 ir_entity *ent = get_Sel_entity(n);
175 fprintf(F, " Selecting entity %s (%ld)\n", get_entity_name(ent), get_entity_nr(ent));
176 ir_fprintf(F, " of type %+F\n", get_entity_type(ent));
177 ir_fprintf(F, " with owner %+F.\n", get_entity_owner(ent));
179 fprintf(F, " <NULL entity>\n");
183 ir_type *tp = get_Call_type(n);
184 if (get_Call_tail_call(n))
185 fprintf(F, " tail call\n");
186 ir_fprintf(F, " calling method of type %+F\n", tp);
187 if (get_unknown_type() != tp) {
188 for (i = 0; i < get_method_n_params(tp); ++i)
189 ir_fprintf(F, " param %d type: %+F\n", i, get_method_param_type(tp, i));
190 for (i = 0; i < get_method_n_ress(tp); ++i)
191 ir_fprintf(F, " result %d type: %+F\n", i, get_method_res_type(tp, i));
193 if (Call_has_callees(n)) {
194 fprintf(F, " possible callees:\n");
195 for (i = 0; i < get_Call_n_callees(n); i++) {
196 fprintf(F, " %d: %s\n", i, get_ent_dump_name(get_Call_callee(n, i)));
201 ir_fprintf(F, " cast to type: %+F\n", get_Cast_type(n));
204 ir_type *tp = get_entity_type(get_irg_entity(get_irn_irg(n)));
205 ir_fprintf(F, " return in method of type %+F\n", tp);
206 for (i = 0; i < get_method_n_ress(tp); ++i) {
207 ir_fprintf(F, " result %d type: %+F\n", i,
208 get_method_res_type(tp, i));
212 assert(get_Const_type(n) != firm_none_type);
213 ir_fprintf(F, " Const of type %+F\n", get_Const_type(n));
216 switch (get_SymConst_kind(n)) {
217 case symconst_addr_ent:
218 fprintf(F, " kind: addr_ent\n");
219 fprintf(F, " entity: ");
220 dump_entity_to_file(F, get_SymConst_entity(n));
222 case symconst_ofs_ent:
223 fprintf(F, " kind: offset\n");
224 fprintf(F, " entity: ");
225 dump_entity_to_file(F, get_SymConst_entity(n));
227 case symconst_type_tag:
228 fprintf(F, " kind: type_tag\n");
229 fprintf(F, " type: ");
230 dump_type_to_file(F, get_SymConst_type(n));
232 case symconst_type_size:
233 fprintf(F, " kind: size\n");
234 fprintf(F, " type: ");
235 dump_type_to_file(F, get_SymConst_type(n));
237 case symconst_type_align:
238 fprintf(F, " kind: alignment\n");
239 fprintf(F, " type: ");
240 dump_type_to_file(F, get_SymConst_type(n));
242 case symconst_enum_const:
243 fprintf(F, " kind: enumeration\n");
244 fprintf(F, " name: %s\n", get_enumeration_const_name(get_SymConst_enum(n)));
247 ir_fprintf(F, " type of value: %+F\n", get_SymConst_value_type(n));
250 fprintf(F, " mode of loaded value: %s\n", get_mode_name_ex(get_Load_mode(n), NULL));
251 fprintf(F, " volatility: %s\n", get_volatility_name(get_Load_volatility(n)));
252 fprintf(F, " align: %s\n", get_align_name(get_Load_align(n)));
255 fprintf(F, " volatility: %s\n", get_volatility_name(get_Store_volatility(n)));
256 fprintf(F, " align: %s\n", get_align_name(get_Store_align(n)));
259 fprintf(F, " compare operation: %s\n", get_pnc_string(get_Confirm_cmp(n)));
262 const ir_asm_constraint *cons;
266 fprintf(F, " assembler text: %s", get_id_str(get_ASM_text(n)));
267 l = get_ASM_n_input_constraints(n);
269 fprintf(F, "\n inputs: ");
270 cons = get_ASM_input_constraints(n);
271 for (i = 0; i < l; ++i)
272 fprintf(F, "%%%u %s ", cons[i].pos, get_id_str(cons[i].constraint));
274 l = get_ASM_n_output_constraints(n);
276 fprintf(F, "\n outputs: ");
277 cons = get_ASM_output_constraints(n);
278 for (i = 0; i < l; ++i)
279 fprintf(F, "%%%u %s ", cons[i].pos, get_id_str(cons[i].constraint));
281 l = get_ASM_n_clobbers(n);
283 fprintf(F, "\n clobber: ");
284 clobber = get_ASM_clobbers(n);
285 for (i = 0; i < l; ++i)
286 fprintf(F, "%s ", get_id_str(clobber[i]));
288 if (get_irn_pinned(n) != op_pin_state_floats)
289 fprintf(F, "\n volatile");
297 vrp_info = vrp_get_info(n);
302 if (get_irg_typeinfo_state(get_irn_irg(n)) == ir_typeinfo_consistent ||
303 get_irg_typeinfo_state(get_irn_irg(n)) == ir_typeinfo_inconsistent )
304 if (get_irn_typeinfo_type(n) != firm_none_type)
305 ir_fprintf (F, " Analysed type: %s\n", get_irn_typeinfo_type(n));
308 void dump_graph_as_text(FILE *out, ir_graph *irg)
310 fprintf(out, "graph %s\n", get_irg_dump_name(irg));
313 /** dumps something like:
315 * "prefix" "Name" (x): node1, ... node7,\n
316 * "prefix" node8, ... node15,\n
317 * "prefix" node16, node17\n
319 static void dump_node_list(FILE *F, firm_kind *k, char *prefix,
320 int (*get_entity_n_nodes)(firm_kind *ent),
321 ir_node *(*get_entity_node)(firm_kind *ent, int pos),
324 int i, n_nodes = get_entity_n_nodes(k);
327 fprintf(F, "%s %s (%d):", prefix, name, n_nodes);
328 for (i = 0; i < n_nodes; ++i) {
329 if (i > 7 && !(i & 7)) { /* line break every eight node. */
330 fprintf(F, ",\n%s ", prefix);
333 fprintf(F, "%s ", comma);
334 dump_node_label(F, get_entity_node(k, i));
340 /** dumps something like:
342 * "prefix" "Name" (x): node1, ... node7,\n
343 * "prefix" node8, ... node15,\n
344 * "prefix" node16, node17\n
346 static void dump_type_list(FILE *F, ir_type *tp, char *prefix,
347 int (*get_n_types)(const ir_type *tp),
348 ir_type *(*get_type)(const ir_type *tp, int pos),
351 int i, n_nodes = get_n_types(tp);
354 fprintf(F, "%s %s (%d):", prefix, name, n_nodes);
355 for (i = 0; i < n_nodes; ++i) {
356 if (i > 7 && !(i & 7)) { /* line break every eight node. */
357 fprintf(F, ",\n%s ", prefix);
360 ir_fprintf(F, "%s %+F", comma, get_type(tp, i));
366 static int need_nl = 1;
371 static void dump_ir_initializers_to_file(FILE *F, const char *prefix,
372 const ir_initializer_t *initializer,
379 fprintf(F, "\n%s ", prefix);
382 switch (get_initializer_kind(initializer)) {
383 case IR_INITIALIZER_NULL:
384 fprintf(F, "\t = <NOT_SET>");
386 case IR_INITIALIZER_TARVAL:
387 tv = get_initializer_tarval_value(initializer);
388 ir_fprintf(F, "\t = <TV>%F", tv);
390 case IR_INITIALIZER_CONST:
391 value = get_initializer_const_value(initializer);
392 fprintf(F, "\t = <CONST>");
393 dump_node_opcode(F, value);
395 case IR_INITIALIZER_COMPOUND:
396 if (is_Array_type(type)) {
397 size_t i, n = get_initializer_compound_n_entries(initializer);
398 ir_type *element_type = get_array_element_type(type);
399 for (i = 0; i < n; ++i) {
400 ir_initializer_t *sub_initializer
401 = get_initializer_compound_value(initializer, i);
404 fprintf(F, "\n%s ", prefix);
407 fprintf(F, "[%d]", (int) i);
408 dump_ir_initializers_to_file(F, prefix, sub_initializer, element_type);
412 assert(is_compound_type(type));
413 n = get_compound_n_members(type);
414 for (i = 0; i < n; ++i) {
415 ir_entity *member = get_compound_member(type, i);
416 ir_type *subtype = get_entity_type(member);
417 ir_initializer_t *sub_initializer;
419 assert(i < get_initializer_compound_n_entries(initializer));
421 = get_initializer_compound_value(initializer, i);
424 fprintf(F, "\n%s ", prefix);
427 ir_fprintf(F, ".%F", member);
428 dump_ir_initializers_to_file(F, prefix, sub_initializer, subtype);
433 panic("invalid ir_initializer kind found");
438 static void dump_entity_linkage(FILE *F, const ir_entity *entity)
440 ir_linkage linkage = get_entity_linkage(entity);
442 if (linkage & IR_LINKAGE_CONSTANT)
443 fprintf(F, " constant");
444 if (linkage & IR_LINKAGE_WEAK)
446 if (linkage & IR_LINKAGE_GARBAGE_COLLECT)
447 fprintf(F, " garbage_collect");
448 if (linkage & IR_LINKAGE_MERGE)
449 fprintf(F, " merge");
450 if (linkage & IR_LINKAGE_HIDDEN_USER)
451 fprintf(F, " hidden_user");
454 static void dump_entity_to_file_prefix(FILE *F, ir_entity *ent, char *prefix)
457 ir_type *owner, *type;
459 assert(is_entity(ent));
460 owner = get_entity_owner(ent);
461 type = get_entity_type(ent);
462 if (verbosity & dump_verbosity_onlynames) {
463 fprintf(F, "%sentity %s.%s (%ld)\n", prefix, get_compound_name(get_entity_owner(ent)),
464 get_entity_name(ent), get_entity_nr(ent));
468 if (verbosity & dump_verbosity_entattrs) {
469 fprintf(F, "%sentity %s (%ld)\n", prefix, get_entity_name(ent), get_entity_nr(ent));
470 ir_fprintf(F, "%s type: %+F\n", prefix, type);
471 ir_fprintf(F, "%s owner: %+F\n", prefix, owner);
473 if (is_Class_type(get_entity_owner(ent))) {
474 if (get_entity_n_overwrites(ent) > 0) {
475 fprintf(F, "%s overwrites:\n", prefix);
476 for (i = 0; i < get_entity_n_overwrites(ent); ++i) {
477 ir_entity *ov = get_entity_overwrites(ent, i);
478 ir_fprintf(F, "%s %d: %s of class %+F\n", prefix, i,
479 get_entity_name(ov), get_entity_owner(ov));
482 fprintf(F, "%s Does not overwrite other entities.\n", prefix);
484 if (get_entity_n_overwrittenby(ent) > 0) {
485 fprintf(F, "%s overwritten by:\n", prefix);
486 for (i = 0; i < get_entity_n_overwrittenby(ent); ++i) {
487 ir_entity *ov = get_entity_overwrittenby(ent, i);
488 ir_fprintf(F, "%s %d: %s of class %+F\n", prefix, i,
489 get_entity_name(ov), get_entity_owner(ov));
492 fprintf(F, "%s Is not overwritten by other entities.\n",
496 if (get_irp_inh_transitive_closure_state() != inh_transitive_closure_none) {
498 fprintf(F, "%s transitive overwrites:\n", prefix);
499 for (ov = get_entity_trans_overwrites_first(ent);
501 ov = get_entity_trans_overwrites_next(ent)) {
502 ir_fprintf(F, "%s : %s of class %+F\n", prefix,
503 get_entity_name(ov), get_entity_owner(ov));
505 fprintf(F, "%s transitive overwritten by:\n", prefix);
506 for (ov = get_entity_trans_overwrittenby_first(ent);
508 ov = get_entity_trans_overwrittenby_next(ent)) {
509 ir_fprintf(F, "%s : %s of class %+F\n", prefix,
510 get_entity_name(ov), get_entity_owner(ov));
515 fprintf(F, "%s linkage:", prefix);
516 dump_entity_linkage(F, ent);
518 if (is_Method_type(get_entity_type(ent))) {
519 unsigned mask = get_entity_additional_properties(ent);
520 unsigned cc = get_method_calling_convention(get_entity_type(ent));
521 ir_graph *irg = get_entity_irg(ent);
524 fprintf(F, "\n%s estimated node count: %u", prefix, get_irg_estimated_node_cnt(irg));
525 fprintf(F, "\n%s maximum node index: %u", prefix, get_irg_last_idx(irg));
529 fprintf(F, "\n%s additional prop: ", prefix);
531 if (mask & mtp_property_const) fputs("const_function, ", F);
532 if (mask & mtp_property_pure) fputs("pure_function, ", F);
533 if (mask & mtp_property_noreturn) fputs("noreturn_function, ", F);
534 if (mask & mtp_property_nothrow) fputs("nothrow_function, ", F);
535 if (mask & mtp_property_naked) fputs("naked_function, ", F);
536 if (mask & mtp_property_malloc) fputs("malloc_function, ", F);
537 if (mask & mtp_property_returns_twice) fputs("weak_function, ", F);
538 if (mask & mtp_property_intrinsic) fputs("intrinsic_function, ", F);
539 if (mask & mtp_property_runtime) fputs("runtime_function, ", F);
540 if (mask & mtp_property_private) fputs("private_function, ", F);
541 if (mask & mtp_property_has_loop) fputs("has_loop_function, ", F);
543 fprintf(F, "\n%s calling convention: ", prefix);
544 if (cc & cc_reg_param) fputs("regparam, ", F);
545 if (cc & cc_this_call) fputs("thiscall, ", F);
546 if (cc & cc_compound_ret) fputs("compound_ret, ", F);
547 if (cc & cc_frame_on_caller_stk) fputs("frame on caller's stack, ", F);
548 cc &= ~(cc_compound_ret|cc_frame_on_caller_stk);
551 else if (IS_STDCALL(cc))
554 fputs(cc & cc_last_on_top ? "last param on top, " : "first param on top, ", F);
555 fputs(cc & cc_callee_clear_stk ? "callee clear stack" : "caller clear stack", F);
557 fprintf(F, "\n%s vtable number: %u", prefix, get_entity_vtable_number(ent));
561 } else { /* no entattrs */
562 ir_fprintf(F, "%s(%3d:%d) %+F: %s", prefix,
563 get_entity_offset(ent), get_entity_offset_bits_remainder(ent),
564 get_entity_type(ent), get_entity_name(ent));
565 if (is_Method_type(get_entity_type(ent))) fputs("(...)", F);
567 if (verbosity & dump_verbosity_accessStats) {
568 dump_entity_linkage(F, ent);
573 if (verbosity & dump_verbosity_entconsts) {
574 if (ent->initializer != NULL) {
575 const ir_initializer_t *initializer = get_entity_initializer(ent);
576 fprintf(F, "\n%s Initializers:", prefix);
578 dump_ir_initializers_to_file(F, prefix, initializer, get_entity_type(ent));
579 } else if (entity_has_compound_ent_values(ent)) {
580 fprintf(F, "%s compound values:", prefix);
581 for (i = 0; i < get_compound_ent_n_values(ent); ++i) {
582 compound_graph_path *path = get_compound_ent_value_path(ent, i);
583 ir_entity *ent0 = get_compound_graph_path_node(path, 0);
584 fprintf(F, "\n%s %3d:%u ", prefix, get_entity_offset(ent0), get_entity_offset_bits_remainder(ent0));
585 if (get_type_state(type) == layout_fixed)
586 fprintf(F, "(%3u:%u) ", get_compound_ent_value_offset_bytes(ent, i), get_compound_ent_value_offset_bit_remainder(ent, i));
587 fprintf(F, "%s", get_entity_name(ent));
588 for (j = 0; j < get_compound_graph_path_length(path); ++j) {
589 ir_entity *node = get_compound_graph_path_node(path, j);
590 fprintf(F, ".%s", get_entity_name(node));
591 if (is_Array_type(get_entity_owner(node)))
592 fprintf(F, "[%d]", get_compound_graph_path_array_index(path, j));
595 dump_node_opcode(F, get_compound_ent_value(ent, i));
601 if (verbosity & dump_verbosity_entattrs) {
602 fprintf(F, "%s linkage:", prefix);
603 dump_entity_linkage(F, ent);
604 fprintf(F, "%s volatility: %s", prefix, get_volatility_name(get_entity_volatility(ent)));
605 fprintf(F, "\n%s aligned: %s", prefix, get_align_name(get_entity_aligned(ent)));
606 fprintf(F, "\n%s alignment: %u", prefix, get_entity_alignment(ent));
607 fprintf(F, "\n%s ld_name: %s", prefix, ent->ld_name ? get_entity_ld_name(ent) : "no yet set");
608 fprintf(F, "\n%s offset: %d bytes, %d rem bits", prefix, get_entity_offset(ent), get_entity_offset_bits_remainder(ent));
609 if (is_Method_type(get_entity_type(ent))) {
610 if (get_entity_irg(ent)) /* can be null */ {
611 fprintf(F, "\n%s irg = %ld", prefix, get_irg_graph_nr(get_entity_irg(ent)));
613 fprintf(F, "\n%s irg = NULL", prefix);
619 if (get_trouts_state()) {
620 fprintf(F, "%s Entity outs:\n", prefix);
621 dump_node_list(F, (firm_kind *)ent, prefix, (int(*)(firm_kind *))get_entity_n_accesses,
622 (ir_node *(*)(firm_kind *, int))get_entity_access, "Accesses");
623 dump_node_list(F, (firm_kind *)ent, prefix, (int(*)(firm_kind *))get_entity_n_references,
624 (ir_node *(*)(firm_kind *, int))get_entity_reference, "References");
628 void dump_entity_to_file(FILE *out, ir_entity *ent)
630 dump_entity_to_file_prefix(out, ent, "");
634 void dump_type_to_file(FILE *F, ir_type *tp)
638 if ((is_Class_type(tp)) && (verbosity & dump_verbosity_noClassTypes)) return;
639 if ((is_Struct_type(tp)) && (verbosity & dump_verbosity_noStructTypes)) return;
640 if ((is_Union_type(tp)) && (verbosity & dump_verbosity_noUnionTypes)) return;
641 if ((is_Array_type(tp)) && (verbosity & dump_verbosity_noArrayTypes)) return;
642 if ((is_Pointer_type(tp)) && (verbosity & dump_verbosity_noPointerTypes)) return;
643 if ((is_Method_type(tp)) && (verbosity & dump_verbosity_noMethodTypes)) return;
644 if ((is_Primitive_type(tp)) && (verbosity & dump_verbosity_noPrimitiveTypes)) return;
645 if ((is_Enumeration_type(tp)) && (verbosity & dump_verbosity_noEnumerationTypes)) return;
647 ir_fprintf(F, "%+F", tp);
648 if (verbosity & dump_verbosity_onlynames) { fprintf(F, "\n"); return; }
650 switch (get_type_tpop_code(tp)) {
653 if ((verbosity & dump_verbosity_methods) || (verbosity & dump_verbosity_fields)) {
654 fprintf(F, "\n members:\n");
656 for (i = 0; i < get_class_n_members(tp); ++i) {
657 ir_entity *mem = get_class_member(tp, i);
658 if (((verbosity & dump_verbosity_methods) && is_Method_type(get_entity_type(mem))) ||
659 ((verbosity & dump_verbosity_fields) && !is_Method_type(get_entity_type(mem))) ) {
660 if (!(verbosity & dump_verbosity_nostatic)) {
661 dump_entity_to_file_prefix(F, mem, " ");
665 if (verbosity & dump_verbosity_typeattrs) {
666 fprintf(F, " supertypes: ");
667 for (i = 0; i < get_class_n_supertypes(tp); ++i) {
668 ir_type *stp = get_class_supertype(tp, i);
669 ir_fprintf(F, "\n %d %+F", i, stp);
671 fprintf(F, "\n subtypes: ");
672 for (i = 0; i < get_class_n_subtypes(tp); ++i) {
673 ir_type *stp = get_class_subtype(tp, i);
674 ir_fprintf(F, "\n %d %+F", i, stp);
677 if (get_irp_inh_transitive_closure_state() != inh_transitive_closure_none) {
679 fprintf(F, "\n transitive supertypes: ");
680 for (stp = get_class_trans_supertype_first(tp);
682 stp = get_class_trans_supertype_next(tp)) {
683 ir_fprintf(F, "\n %+F", stp);
685 fprintf(F, "\n transitive subtypes: ");
686 for (stp = get_class_trans_subtype_first(tp);
688 stp = get_class_trans_subtype_next(tp)) {
689 ir_fprintf(F, "\n %+F", stp);
693 fprintf(F, "\n flags: ");
694 if (is_class_final(tp))
695 fprintf(F, "final, ");
696 if (is_class_interface(tp))
697 fprintf(F, "interface, ");
698 if (is_class_abstract(tp))
699 fprintf(F, "abstract, ");
706 if (verbosity & dump_verbosity_fields) fprintf(F, "\n members: ");
707 for (i = 0; i < get_compound_n_members(tp); ++i) {
708 ir_entity *mem = get_compound_member(tp, i);
709 if (verbosity & dump_verbosity_fields) {
710 dump_entity_to_file_prefix(F, mem, " ");
716 if (verbosity & dump_verbosity_typeattrs) {
718 ir_type *elem_tp = get_array_element_type(tp);
720 fprintf(F, "\n array ");
722 n_dim = get_array_n_dimensions(tp);
723 for (i = 0; i < n_dim; ++i) {
724 ir_node *lower, *upper;
726 lower = get_array_lower_bound(tp, i);
727 upper = get_array_upper_bound(tp, i);
731 if (is_Const(lower)) {
732 fprintf(F, "%ld .. ", get_tarval_long(get_Const_tarval(lower)));
734 dump_node_opcode(F, lower);
735 fprintf(F, " %ld .. ", get_irn_node_nr(lower));
738 if (is_Const(upper)) {
739 fprintf(F, "%ld]", get_tarval_long(get_Const_tarval(lower)));
741 dump_node_opcode(F, upper);
742 fprintf(F, " %ld]", get_irn_node_nr(upper));
745 ir_fprintf(F, " of <%+F>", elem_tp);
747 fprintf(F, "\n order: ");
748 for (i = 0; i < n_dim; ++i)
749 fprintf(F, "<%d>", get_array_order(tp, i));
753 if (verbosity & dump_verbosity_fields) {
754 dump_entity_to_file_prefix(F, get_array_element_entity(tp),
761 if (verbosity & dump_verbosity_typeattrs) {
762 ir_type *tt = get_pointer_points_to_type(tp);
763 ir_fprintf(F, "\n points to %+F\n", tt);
768 if (verbosity & dump_verbosity_typeattrs) {
769 fprintf(F, "\n variadicity: %s", get_variadicity_name(get_method_variadicity(tp)));
770 fprintf(F, "\n return types: %d", get_method_n_ress(tp));
771 for (i = 0; i < get_method_n_ress(tp); ++i) {
772 ir_type *rtp = get_method_res_type(tp, i);
773 ir_fprintf(F, "\n %+F", rtp);
776 fprintf(F, "\n parameter types: %d", get_method_n_params(tp));
777 for (i = 0; i < get_method_n_params(tp); ++i) {
778 ir_type *ptp = get_method_param_type(tp, i);
779 ir_fprintf(F, "\n %+F", ptp);
781 if (get_method_variadicity(tp)) {
782 fprintf(F, "\n ...");
789 if (verbosity & dump_verbosity_typeattrs) {
790 ir_type *base_tp = get_primitive_base_type(tp);
792 ir_fprintf(F, "\n base type: %+F", tp);
803 if (verbosity & dump_verbosity_typeattrs) {
804 fprintf(F, ": details not implemented\n");
808 fprintf(F, " state: %s,\n", get_type_state_name(get_type_state(tp)));
809 fprintf(F, " size: %2u Bytes,\n", get_type_size_bytes(tp));
810 fprintf(F, " alignment: %2u Bytes,\n", get_type_alignment_bytes(tp));
811 if (is_atomic_type(tp) || is_Method_type(tp))
812 fprintf(F, " mode: %s,\n", get_mode_name(get_type_mode(tp)));
814 if (get_trouts_state()) {
815 fprintf(F, "\n Type outs:\n");
816 dump_node_list(F, (firm_kind *)tp, " ", (int(*)(firm_kind *))get_type_n_allocs,
817 (ir_node *(*)(firm_kind *, int))get_type_alloc, "Allocations");
818 dump_node_list(F, (firm_kind *)tp, " ", (int(*)(firm_kind *))get_type_n_casts,
819 (ir_node *(*)(firm_kind *, int))get_type_cast, "Casts");
820 dump_type_list(F, tp, " ", get_type_n_pointertypes_to, get_type_pointertype_to, "PointerTpsTo");
826 void dump_types_as_text(FILE *out)
829 int n_types = get_irp_n_types();
831 for (i = 0; i < n_types; ++i) {
832 ir_type *type = get_irp_type(i);
833 dump_type_to_file(out, type);
837 void dump_globals_as_text(FILE *out)
839 ir_type *global_type = get_glob_type();
840 int n_members = get_class_n_members(global_type);
843 for (i = 0; i < n_members; ++i) {
844 ir_entity *entity = get_class_member(global_type, i);
845 dump_entity_to_file(out, entity);