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 %ld with depth %u\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 */
153 ir_type *tp = get_entity_type(get_irg_entity(get_irn_irg(n)));
154 ir_fprintf(F, " start of method of type %+F\n", tp);
155 for (i = 0; i < get_method_n_params(tp); ++i)
156 ir_fprintf(F, " param %d type: %+F\n", i, get_method_param_type(tp, i));
159 fprintf(F, " default ProjNr: %ld\n", get_Cond_default_proj(n));
160 if (get_Cond_jmp_pred(n) != COND_JMP_PRED_NONE) {
161 fprintf(F, " jump prediction: %s\n",
162 get_cond_jmp_predicate_name(get_Cond_jmp_pred(n)));
166 ir_fprintf(F, " allocating entity of type: %+F\n", get_Alloc_type(n));
167 fprintf(F, " allocating on: the %s\n", (get_Alloc_where(n) == stack_alloc) ? "stack" : "heap");
170 ir_fprintf(F, " freeing entity of type %+F\n", get_Free_type(n));
171 fprintf(F, " allocated on: the %s\n", (get_Free_where(n) == stack_alloc) ? "stack" : "heap");
174 ir_entity *ent = get_Sel_entity(n);
176 fprintf(F, " Selecting entity %s (%ld)\n", get_entity_name(ent), get_entity_nr(ent));
177 ir_fprintf(F, " of type %+F\n", get_entity_type(ent));
178 ir_fprintf(F, " with owner %+F.\n", get_entity_owner(ent));
180 fprintf(F, " <NULL entity>\n");
184 ir_type *tp = get_Call_type(n);
185 if (get_Call_tail_call(n))
186 fprintf(F, " tail call\n");
187 ir_fprintf(F, " calling method of type %+F\n", tp);
188 if (get_unknown_type() != tp) {
190 for (i = 0; i < get_method_n_params(tp); ++i)
191 ir_fprintf(F, " param %d type: %+F\n", i, get_method_param_type(tp, i));
192 for (i = 0; i < get_method_n_ress(tp); ++i)
193 ir_fprintf(F, " result %d type: %+F\n", i, get_method_res_type(tp, i));
195 if (Call_has_callees(n)) {
196 fprintf(F, " possible callees:\n");
197 for (i = 0; i < get_Call_n_callees(n); i++) {
198 fprintf(F, " %d: %s\n", i, get_ent_dump_name(get_Call_callee(n, i)));
203 ir_fprintf(F, " cast to type: %+F\n", get_Cast_type(n));
207 ir_type *tp = get_entity_type(get_irg_entity(get_irn_irg(n)));
208 ir_fprintf(F, " return in method of type %+F\n", tp);
209 for (i = 0; i < get_method_n_ress(tp); ++i) {
210 ir_fprintf(F, " result %d type: %+F\n", i,
211 get_method_res_type(tp, i));
215 switch (get_SymConst_kind(n)) {
216 case symconst_addr_ent:
217 fprintf(F, " kind: addr_ent\n");
218 fprintf(F, " entity: ");
219 dump_entity_to_file(F, get_SymConst_entity(n));
221 case symconst_ofs_ent:
222 fprintf(F, " kind: offset\n");
223 fprintf(F, " entity: ");
224 dump_entity_to_file(F, get_SymConst_entity(n));
226 case symconst_type_tag:
227 fprintf(F, " kind: type_tag\n");
228 fprintf(F, " type: ");
229 dump_type_to_file(F, get_SymConst_type(n));
231 case symconst_type_size:
232 fprintf(F, " kind: size\n");
233 fprintf(F, " type: ");
234 dump_type_to_file(F, get_SymConst_type(n));
236 case symconst_type_align:
237 fprintf(F, " kind: alignment\n");
238 fprintf(F, " type: ");
239 dump_type_to_file(F, get_SymConst_type(n));
241 case symconst_enum_const:
242 fprintf(F, " kind: enumeration\n");
243 fprintf(F, " name: %s\n", get_enumeration_const_name(get_SymConst_enum(n)));
248 fprintf(F, " mode of loaded value: %s\n", get_mode_name_ex(get_Load_mode(n), NULL));
249 fprintf(F, " volatility: %s\n", get_volatility_name(get_Load_volatility(n)));
250 fprintf(F, " align: %s\n", get_align_name(get_Load_align(n)));
253 fprintf(F, " volatility: %s\n", get_volatility_name(get_Store_volatility(n)));
254 fprintf(F, " align: %s\n", get_align_name(get_Store_align(n)));
257 fprintf(F, " compare operation: %s\n", get_pnc_string(get_Confirm_cmp(n)));
260 const ir_asm_constraint *cons;
264 fprintf(F, " assembler text: %s", get_id_str(get_ASM_text(n)));
265 l = get_ASM_n_input_constraints(n);
267 fprintf(F, "\n inputs: ");
268 cons = get_ASM_input_constraints(n);
269 for (i = 0; i < l; ++i)
270 fprintf(F, "%%%u %s ", cons[i].pos, get_id_str(cons[i].constraint));
272 l = get_ASM_n_output_constraints(n);
274 fprintf(F, "\n outputs: ");
275 cons = get_ASM_output_constraints(n);
276 for (i = 0; i < l; ++i)
277 fprintf(F, "%%%u %s ", cons[i].pos, get_id_str(cons[i].constraint));
279 l = get_ASM_n_clobbers(n);
281 fprintf(F, "\n clobber: ");
282 clobber = get_ASM_clobbers(n);
283 for (i = 0; i < l; ++i)
284 fprintf(F, "%s ", get_id_str(clobber[i]));
286 if (get_irn_pinned(n) != op_pin_state_floats)
287 fprintf(F, "\n volatile");
295 vrp_info = vrp_get_info(n);
300 if (get_irg_typeinfo_state(get_irn_irg(n)) == ir_typeinfo_consistent ||
301 get_irg_typeinfo_state(get_irn_irg(n)) == ir_typeinfo_inconsistent )
302 if (get_irn_typeinfo_type(n) != firm_none_type)
303 ir_fprintf (F, " Analysed type: %s\n", get_irn_typeinfo_type(n));
306 void dump_graph_as_text(FILE *out, ir_graph *irg)
308 fprintf(out, "graph %s\n", get_irg_dump_name(irg));
311 /** dumps something like:
313 * "prefix" "Name" (x): node1, ... node7,\n
314 * "prefix" node8, ... node15,\n
315 * "prefix" node16, node17\n
317 static void dump_node_list(FILE *F, firm_kind *k, const char *prefix,
318 int (*get_entity_n_nodes)(firm_kind *ent),
319 ir_node *(*get_entity_node)(firm_kind *ent, int pos),
322 int i, n_nodes = get_entity_n_nodes(k);
323 const char *comma = "";
325 fprintf(F, "%s %s (%d):", prefix, name, n_nodes);
326 for (i = 0; i < n_nodes; ++i) {
327 if (i > 7 && !(i & 7)) { /* line break every eight node. */
328 fprintf(F, ",\n%s ", prefix);
331 fprintf(F, "%s ", comma);
332 dump_node_label(F, get_entity_node(k, i));
338 /** dumps something like:
340 * "prefix" "Name" (x): node1, ... node7,\n
341 * "prefix" node8, ... node15,\n
342 * "prefix" node16, node17\n
344 static void dump_type_list(FILE *F, ir_type *tp, const char *prefix,
345 int (*get_n_types)(const ir_type *tp),
346 ir_type *(*get_type)(const ir_type *tp, int pos),
349 int i, n_nodes = get_n_types(tp);
350 const char *comma = "";
352 fprintf(F, "%s %s (%d):", prefix, name, n_nodes);
353 for (i = 0; i < n_nodes; ++i) {
354 if (i > 7 && !(i & 7)) { /* line break every eight node. */
355 fprintf(F, ",\n%s ", prefix);
358 ir_fprintf(F, "%s %+F", comma, get_type(tp, i));
364 static int need_nl = 1;
369 static void dump_ir_initializers_to_file(FILE *F, const char *prefix,
370 const ir_initializer_t *initializer,
377 fprintf(F, "\n%s ", prefix);
380 switch (get_initializer_kind(initializer)) {
381 case IR_INITIALIZER_NULL:
382 fprintf(F, "\t = <NOT_SET>");
384 case IR_INITIALIZER_TARVAL:
385 tv = get_initializer_tarval_value(initializer);
386 ir_fprintf(F, "\t = <TV>%F", tv);
388 case IR_INITIALIZER_CONST:
389 value = get_initializer_const_value(initializer);
390 fprintf(F, "\t = <CONST>");
391 dump_node_opcode(F, value);
393 case IR_INITIALIZER_COMPOUND:
394 if (is_Array_type(type)) {
395 size_t i, n = get_initializer_compound_n_entries(initializer);
396 ir_type *element_type = get_array_element_type(type);
397 for (i = 0; i < n; ++i) {
398 ir_initializer_t *sub_initializer
399 = get_initializer_compound_value(initializer, i);
402 fprintf(F, "\n%s ", prefix);
405 fprintf(F, "[%d]", (int) i);
406 dump_ir_initializers_to_file(F, prefix, sub_initializer, element_type);
410 assert(is_compound_type(type));
411 n = get_compound_n_members(type);
412 for (i = 0; i < n; ++i) {
413 ir_entity *member = get_compound_member(type, i);
414 ir_type *subtype = get_entity_type(member);
415 ir_initializer_t *sub_initializer;
417 assert(i < get_initializer_compound_n_entries(initializer));
419 = get_initializer_compound_value(initializer, i);
422 fprintf(F, "\n%s ", prefix);
425 ir_fprintf(F, ".%F", member);
426 dump_ir_initializers_to_file(F, prefix, sub_initializer, subtype);
431 panic("invalid ir_initializer kind found");
436 static void dump_entity_linkage(FILE *F, const ir_entity *entity)
438 ir_linkage linkage = get_entity_linkage(entity);
440 if (linkage & IR_LINKAGE_CONSTANT)
441 fprintf(F, " constant");
442 if (linkage & IR_LINKAGE_WEAK)
444 if (linkage & IR_LINKAGE_GARBAGE_COLLECT)
445 fprintf(F, " garbage_collect");
446 if (linkage & IR_LINKAGE_MERGE)
447 fprintf(F, " merge");
448 if (linkage & IR_LINKAGE_HIDDEN_USER)
449 fprintf(F, " hidden_user");
452 static void dump_entity_to_file_prefix(FILE *F, ir_entity *ent, const char *prefix)
454 ir_type *owner, *type;
456 assert(is_entity(ent));
457 owner = get_entity_owner(ent);
458 type = get_entity_type(ent);
459 if (verbosity & dump_verbosity_onlynames) {
460 fprintf(F, "%sentity %s.%s (%ld)\n", prefix, get_compound_name(get_entity_owner(ent)),
461 get_entity_name(ent), get_entity_nr(ent));
465 if (verbosity & dump_verbosity_entattrs) {
466 fprintf(F, "%sentity %s (%ld)\n", prefix, get_entity_name(ent), get_entity_nr(ent));
467 ir_fprintf(F, "%s type: %+F\n", prefix, type);
468 ir_fprintf(F, "%s owner: %+F\n", prefix, owner);
470 if (is_Class_type(get_entity_owner(ent))) {
471 if (get_entity_n_overwrites(ent) > 0) {
473 fprintf(F, "%s overwrites:\n", prefix);
474 for (i = 0; i < get_entity_n_overwrites(ent); ++i) {
475 ir_entity *ov = get_entity_overwrites(ent, i);
476 ir_fprintf(F, "%s %d: %s of class %+F\n", prefix, i,
477 get_entity_name(ov), get_entity_owner(ov));
480 fprintf(F, "%s Does not overwrite other entities.\n", prefix);
482 if (get_entity_n_overwrittenby(ent) > 0) {
484 fprintf(F, "%s overwritten by:\n", prefix);
485 for (i = 0; i < get_entity_n_overwrittenby(ent); ++i) {
486 ir_entity *ov = get_entity_overwrittenby(ent, i);
487 ir_fprintf(F, "%s %d: %s of class %+F\n", prefix, i,
488 get_entity_name(ov), get_entity_owner(ov));
491 fprintf(F, "%s Is not overwritten by other entities.\n",
495 if (get_irp_inh_transitive_closure_state() != inh_transitive_closure_none) {
497 fprintf(F, "%s transitive overwrites:\n", prefix);
498 for (ov = get_entity_trans_overwrites_first(ent);
500 ov = get_entity_trans_overwrites_next(ent)) {
501 ir_fprintf(F, "%s : %s of class %+F\n", prefix,
502 get_entity_name(ov), get_entity_owner(ov));
504 fprintf(F, "%s transitive overwritten by:\n", prefix);
505 for (ov = get_entity_trans_overwrittenby_first(ent);
507 ov = get_entity_trans_overwrittenby_next(ent)) {
508 ir_fprintf(F, "%s : %s of class %+F\n", prefix,
509 get_entity_name(ov), get_entity_owner(ov));
514 fprintf(F, "%s linkage:", prefix);
515 dump_entity_linkage(F, ent);
517 if (is_Method_type(get_entity_type(ent))) {
518 unsigned mask = get_entity_additional_properties(ent);
519 unsigned cc = get_method_calling_convention(get_entity_type(ent));
520 ir_graph *irg = get_entity_irg(ent);
523 fprintf(F, "\n%s estimated node count: %u", prefix, get_irg_estimated_node_cnt(irg));
524 fprintf(F, "\n%s maximum node index: %u", prefix, get_irg_last_idx(irg));
528 fprintf(F, "\n%s additional prop: ", prefix);
530 if (mask & mtp_property_const) fputs("const_function, ", F);
531 if (mask & mtp_property_pure) fputs("pure_function, ", F);
532 if (mask & mtp_property_noreturn) fputs("noreturn_function, ", F);
533 if (mask & mtp_property_nothrow) fputs("nothrow_function, ", F);
534 if (mask & mtp_property_naked) fputs("naked_function, ", F);
535 if (mask & mtp_property_malloc) fputs("malloc_function, ", F);
536 if (mask & mtp_property_returns_twice) fputs("weak_function, ", F);
537 if (mask & mtp_property_intrinsic) fputs("intrinsic_function, ", F);
538 if (mask & mtp_property_runtime) fputs("runtime_function, ", F);
539 if (mask & mtp_property_private) fputs("private_function, ", F);
540 if (mask & mtp_property_has_loop) fputs("has_loop_function, ", F);
542 fprintf(F, "\n%s calling convention: ", prefix);
543 if (cc & cc_reg_param) fputs("regparam, ", F);
544 if (cc & cc_this_call) fputs("thiscall, ", F);
545 if (cc & cc_compound_ret) fputs("compound_ret, ", F);
546 if (cc & cc_frame_on_caller_stk) fputs("frame on caller's stack, ", F);
547 cc &= ~(cc_compound_ret|cc_frame_on_caller_stk);
550 else if (IS_STDCALL(cc))
553 fputs(cc & cc_last_on_top ? "last param on top, " : "first param on top, ", F);
554 fputs(cc & cc_callee_clear_stk ? "callee clear stack" : "caller clear stack", F);
556 fprintf(F, "\n%s vtable number: %u", prefix, get_entity_vtable_number(ent));
560 } else { /* no entattrs */
561 ir_fprintf(F, "%s(%3d:%d) %+F: %s", prefix,
562 get_entity_offset(ent), get_entity_offset_bits_remainder(ent),
563 get_entity_type(ent), get_entity_name(ent));
564 if (is_Method_type(get_entity_type(ent))) fputs("(...)", F);
566 if (verbosity & dump_verbosity_accessStats) {
567 dump_entity_linkage(F, ent);
572 if (verbosity & dump_verbosity_entconsts) {
573 if (ent->initializer != NULL) {
574 const ir_initializer_t *initializer = get_entity_initializer(ent);
575 fprintf(F, "\n%s Initializers:", prefix);
577 dump_ir_initializers_to_file(F, prefix, initializer, get_entity_type(ent));
578 } 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) {
583 compound_graph_path *path = get_compound_ent_value_path(ent, i);
584 ir_entity *ent0 = get_compound_graph_path_node(path, 0);
585 fprintf(F, "\n%s %3d:%u ", prefix, get_entity_offset(ent0), get_entity_offset_bits_remainder(ent0));
586 if (get_type_state(type) == layout_fixed)
587 fprintf(F, "(%3u:%u) ", get_compound_ent_value_offset_bytes(ent, i), get_compound_ent_value_offset_bit_remainder(ent, i));
588 fprintf(F, "%s", get_entity_name(ent));
589 for (j = 0; j < get_compound_graph_path_length(path); ++j) {
590 ir_entity *node = get_compound_graph_path_node(path, j);
591 fprintf(F, ".%s", get_entity_name(node));
592 if (is_Array_type(get_entity_owner(node)))
593 fprintf(F, "[%ld]", get_compound_graph_path_array_index(path, j));
596 dump_node_opcode(F, get_compound_ent_value(ent, i));
602 if (verbosity & dump_verbosity_entattrs) {
603 fprintf(F, "%s linkage:", prefix);
604 dump_entity_linkage(F, ent);
605 fprintf(F, "%s volatility: %s", prefix, get_volatility_name(get_entity_volatility(ent)));
606 fprintf(F, "\n%s aligned: %s", prefix, get_align_name(get_entity_aligned(ent)));
607 fprintf(F, "\n%s alignment: %u", prefix, get_entity_alignment(ent));
608 fprintf(F, "\n%s ld_name: %s", prefix, ent->ld_name ? get_entity_ld_name(ent) : "no yet set");
609 fprintf(F, "\n%s offset: %d bytes, %d rem bits", prefix, get_entity_offset(ent), get_entity_offset_bits_remainder(ent));
610 if (is_Method_type(get_entity_type(ent))) {
611 if (get_entity_irg(ent)) /* can be null */ {
612 fprintf(F, "\n%s irg = %ld", prefix, get_irg_graph_nr(get_entity_irg(ent)));
614 fprintf(F, "\n%s irg = NULL", prefix);
620 if (get_trouts_state()) {
621 fprintf(F, "%s Entity outs:\n", prefix);
622 dump_node_list(F, (firm_kind *)ent, prefix, (int(*)(firm_kind *))get_entity_n_accesses,
623 (ir_node *(*)(firm_kind *, int))get_entity_access, "Accesses");
624 dump_node_list(F, (firm_kind *)ent, prefix, (int(*)(firm_kind *))get_entity_n_references,
625 (ir_node *(*)(firm_kind *, int))get_entity_reference, "References");
629 void dump_entity_to_file(FILE *out, ir_entity *ent)
631 dump_entity_to_file_prefix(out, ent, "");
635 void dump_type_to_file(FILE *F, ir_type *tp)
639 if ((is_Class_type(tp)) && (verbosity & dump_verbosity_noClassTypes)) return;
640 if ((is_Struct_type(tp)) && (verbosity & dump_verbosity_noStructTypes)) return;
641 if ((is_Union_type(tp)) && (verbosity & dump_verbosity_noUnionTypes)) return;
642 if ((is_Array_type(tp)) && (verbosity & dump_verbosity_noArrayTypes)) return;
643 if ((is_Pointer_type(tp)) && (verbosity & dump_verbosity_noPointerTypes)) return;
644 if ((is_Method_type(tp)) && (verbosity & dump_verbosity_noMethodTypes)) return;
645 if ((is_Primitive_type(tp)) && (verbosity & dump_verbosity_noPrimitiveTypes)) return;
646 if ((is_Enumeration_type(tp)) && (verbosity & dump_verbosity_noEnumerationTypes)) return;
648 ir_fprintf(F, "%+F", tp);
649 if (verbosity & dump_verbosity_onlynames) { fprintf(F, "\n"); return; }
651 switch (get_type_tpop_code(tp)) {
654 if ((verbosity & dump_verbosity_methods) || (verbosity & dump_verbosity_fields)) {
655 fprintf(F, "\n members:\n");
657 for (i = 0; i < get_class_n_members(tp); ++i) {
658 ir_entity *mem = get_class_member(tp, i);
659 if (((verbosity & dump_verbosity_methods) && is_Method_type(get_entity_type(mem))) ||
660 ((verbosity & dump_verbosity_fields) && !is_Method_type(get_entity_type(mem))) ) {
661 if (!(verbosity & dump_verbosity_nostatic)) {
662 dump_entity_to_file_prefix(F, mem, " ");
666 if (verbosity & dump_verbosity_typeattrs) {
667 fprintf(F, " supertypes: ");
668 for (i = 0; i < get_class_n_supertypes(tp); ++i) {
669 ir_type *stp = get_class_supertype(tp, i);
670 ir_fprintf(F, "\n %d %+F", i, stp);
672 fprintf(F, "\n subtypes: ");
673 for (i = 0; i < get_class_n_subtypes(tp); ++i) {
674 ir_type *stp = get_class_subtype(tp, i);
675 ir_fprintf(F, "\n %d %+F", i, stp);
678 if (get_irp_inh_transitive_closure_state() != inh_transitive_closure_none) {
680 fprintf(F, "\n transitive supertypes: ");
681 for (stp = get_class_trans_supertype_first(tp);
683 stp = get_class_trans_supertype_next(tp)) {
684 ir_fprintf(F, "\n %+F", stp);
686 fprintf(F, "\n transitive subtypes: ");
687 for (stp = get_class_trans_subtype_first(tp);
689 stp = get_class_trans_subtype_next(tp)) {
690 ir_fprintf(F, "\n %+F", stp);
694 fprintf(F, "\n flags: ");
695 if (is_class_final(tp))
696 fprintf(F, "final, ");
697 if (is_class_interface(tp))
698 fprintf(F, "interface, ");
699 if (is_class_abstract(tp))
700 fprintf(F, "abstract, ");
707 if (verbosity & dump_verbosity_fields) fprintf(F, "\n members: ");
708 for (i = 0; i < get_compound_n_members(tp); ++i) {
709 ir_entity *mem = get_compound_member(tp, i);
710 if (verbosity & dump_verbosity_fields) {
711 dump_entity_to_file_prefix(F, mem, " ");
717 if (verbosity & dump_verbosity_typeattrs) {
719 ir_type *elem_tp = get_array_element_type(tp);
721 fprintf(F, "\n array ");
723 n_dim = get_array_n_dimensions(tp);
724 for (i = 0; i < n_dim; ++i) {
725 ir_node *lower, *upper;
727 lower = get_array_lower_bound(tp, i);
728 upper = get_array_upper_bound(tp, i);
732 if (is_Const(lower)) {
733 fprintf(F, "%ld .. ", get_tarval_long(get_Const_tarval(lower)));
735 dump_node_opcode(F, lower);
736 fprintf(F, " %ld .. ", get_irn_node_nr(lower));
739 if (is_Const(upper)) {
740 fprintf(F, "%ld]", get_tarval_long(get_Const_tarval(lower)));
742 dump_node_opcode(F, upper);
743 fprintf(F, " %ld]", get_irn_node_nr(upper));
746 ir_fprintf(F, " of <%+F>", elem_tp);
748 fprintf(F, "\n order: ");
749 for (i = 0; i < n_dim; ++i)
750 fprintf(F, "<%d>", get_array_order(tp, i));
754 if (verbosity & dump_verbosity_fields) {
755 dump_entity_to_file_prefix(F, get_array_element_entity(tp),
762 if (verbosity & dump_verbosity_typeattrs) {
763 ir_type *tt = get_pointer_points_to_type(tp);
764 ir_fprintf(F, "\n points to %+F\n", tt);
769 if (verbosity & dump_verbosity_typeattrs) {
770 fprintf(F, "\n variadicity: %s", get_variadicity_name(get_method_variadicity(tp)));
771 fprintf(F, "\n return types: %lu",
772 (unsigned long) get_method_n_ress(tp));
773 for (i = 0; i < get_method_n_ress(tp); ++i) {
774 ir_type *rtp = get_method_res_type(tp, i);
775 ir_fprintf(F, "\n %+F", rtp);
778 fprintf(F, "\n parameter types: %lu",
779 (unsigned long) get_method_n_params(tp));
780 for (i = 0; i < get_method_n_params(tp); ++i) {
781 ir_type *ptp = get_method_param_type(tp, i);
782 ir_fprintf(F, "\n %+F", ptp);
784 if (get_method_variadicity(tp)) {
785 fprintf(F, "\n ...");
792 if (verbosity & dump_verbosity_typeattrs) {
793 ir_type *base_tp = get_primitive_base_type(tp);
795 ir_fprintf(F, "\n base type: %+F", tp);
806 if (verbosity & dump_verbosity_typeattrs) {
807 fprintf(F, ": details not implemented\n");
811 fprintf(F, " state: %s,\n", get_type_state_name(get_type_state(tp)));
812 fprintf(F, " size: %2u Bytes,\n", get_type_size_bytes(tp));
813 fprintf(F, " alignment: %2u Bytes,\n", get_type_alignment_bytes(tp));
814 if (is_atomic_type(tp) || is_Method_type(tp))
815 fprintf(F, " mode: %s,\n", get_mode_name(get_type_mode(tp)));
817 if (get_trouts_state()) {
818 fprintf(F, "\n Type outs:\n");
819 dump_node_list(F, (firm_kind *)tp, " ", (int(*)(firm_kind *))get_type_n_allocs,
820 (ir_node *(*)(firm_kind *, int))get_type_alloc, "Allocations");
821 dump_node_list(F, (firm_kind *)tp, " ", (int(*)(firm_kind *))get_type_n_casts,
822 (ir_node *(*)(firm_kind *, int))get_type_cast, "Casts");
823 dump_type_list(F, tp, " ", get_type_n_pointertypes_to, get_type_pointertype_to, "PointerTpsTo");
829 void dump_types_as_text(FILE *out)
832 int n_types = get_irp_n_types();
834 for (i = 0; i < n_types; ++i) {
835 ir_type *type = get_irp_type(i);
836 dump_type_to_file(out, type);
840 void dump_globals_as_text(FILE *out)
842 ir_type *global_type = get_glob_type();
843 int n_members = get_class_n_members(global_type);
846 for (i = 0; i < n_members; ++i) {
847 ir_entity *entity = get_class_member(global_type, i);
848 dump_entity_to_file(out, entity);