2 * Generate Firm assembler from Firm graphs.
4 * (C) 2005-2009 Michael Beck beck@ipd.info.uni-karlsruhe.de
8 #include <libfirm/firm.h>
12 * The variable context. Contains information
13 * about needed variables.
15 typedef struct var_ctx {
16 FILE *f; /**< File handle for output. */
17 int max_arity; /**< Maximum arity of in array. */
18 int need_tv; /**< If set, need a tv variable. */
19 int need_unknown_X; /**< If set, need an unknown_X variable. */
20 int need_unknown; /**< If set, need an unknown variable. */
24 * A context for backedge fixes.
26 typedef struct fix_ctx {
27 FILE *f; /**< File handle for output. */
28 ir_node *start_block; /**< The start block of the current graph. */
29 int has_backedges; /**< If set the current graph contains backedges. */
33 * Print the name of an IR-node as <prefix><op>_<idx><suffix>.
35 * @param f the output file handle
36 * @param prefix a prefix to print before the node name
37 * @param n the IR-node
38 * @param suffix a suffix to print after the node name
40 static void name(FILE *f, const char *prefix, ir_node *n, const char *suffix)
42 const char *op_name = get_op_name(get_irn_op(n));
43 unsigned index = get_irn_idx(n);
49 fprintf(f, "%s%s_%u%s", prefix, op_name, index, suffix);
53 * Generate the header of the function.
55 * @param f the output file handle
56 * @param irg the graph
58 static void generate_header(FILE *f, ir_graph *irg)
61 ir_entity *ent = get_irg_entity(irg);
62 ir_type *tp = get_entity_type(ent);
63 const char *s = get_entity_name(ent);
66 " * Generates the Firm code for\n"
69 if (get_method_n_ress(tp) == 0)
72 fputs(get_type_name(get_method_res_type(tp, 0)), f);
73 fprintf(f, " %s(", s);
74 n = get_method_n_params(tp);
76 fputs(get_method_variadicity(tp) == variadicity_variadic ? "" : "void", f);
78 for (i = 0; i < n; ++i) {
81 fputs(get_type_name(get_method_param_type(tp, i)), f);
83 if (get_method_variadicity(tp) == variadicity_variadic)
90 " * @param func the entity for the generated graph\n"
92 "void gen_firm_%s(ir_entity *func)\n"
95 " ir_graph *rem = current_ir_graph;\n");
99 * Generate the function prolog.
101 * @param env a variable context
102 * @param irg the graph
104 static void generate_prolog(var_ctx *env, ir_graph *irg)
109 " irg = new_ir_graph(func, 0);\n"
110 " /* kill the current block */\n"
111 " tmp = get_cur_block();\n"
112 " mature_immBlock(tmp);\n"
113 " set_Block_dead(tmp);\n");
114 if (env->need_unknown_X)
115 fprintf(f, " unknownX = new_r_Unknown(irg, mode_X);\n");
119 * Walker: Fix Block and Phi nodes containing backedges.
121 static void fix_block_and_phi(ir_node *n, void *ctx)
127 if (is_Block(n) || is_Phi(n)) {
128 arity = get_irn_arity(n);
130 /* ignore the start block */
131 if (n == env->start_block)
135 for (i = 0; i < arity; ++i) {
136 if (is_backedge(n, i)) {
137 name(f, " set_irn_n(", n, NULL);
138 fprintf(f, ", %d, ", i);
139 name(f, NULL, get_irn_n(n, i), ");\n");
146 * Generate the function epilog.
148 * @param env the backedge fix context
149 * @param irg the graph
151 static void generate_epilog(fix_ctx *env, ir_graph *irg)
157 /* Fix backedges if there was any */
158 if (env->has_backedges) {
159 fprintf(f, " /* fix Blocks and Phis */\n");
160 env->start_block = get_irg_start_block(irg);
161 irg_walk_graph(irg, NULL, fix_block_and_phi, env);
164 /* create the keep-alives */
165 end = get_irg_end(irg);
166 n = get_End_n_keepalives(end);
167 for (i = 0; i < n; ++i) {
168 name(f, " add_End_keepalive(", end, NULL);
169 name(f, ", ", get_End_keepalive(end, i), ");\n");
171 name(f, " mature_immBlock(", get_irg_end_block(irg), ");\n");
172 fprintf(f, " current_ir_graph = rem;\n");
173 fprintf(f, "} /* gen_firm_%s */\n\n", get_entity_name(get_irg_entity(irg)));
177 * Walker: Create a variable declaration for a given node.
178 * The variable name is <op>_<node idx>, see name().
180 * @param n the current IR-node
181 * @param ctx a variable context
183 static void dump_var_def(ir_node *n, void *ctx)
186 int arity = get_irn_arity(n);
188 name(env->f, " ir_node *", n, " = NULL;\n");
189 if (arity > env->max_arity)
190 env->max_arity = arity;
191 if (get_irn_op(n) == op_Const)
193 if (has_backedges(n)) {
195 env->need_unknown_X = 1;
197 env->need_unknown = 1;
202 * Generate all needed variable declarations for a graph.
204 * @param env a variable context
205 * @param irg the graph
207 static void generate_var_decls(var_ctx *env, ir_graph *irg)
211 irg_walk_graph(irg, NULL, dump_var_def, env);
212 fprintf(f, " ir_node *in[%d];\n", env->max_arity);
214 fprintf(f, " tarval *tv = NULL;\n");
215 fprintf(f, " const char *s = NULL;\n");
216 fprintf(f, " ir_entity *ent = NULL;\n");
217 fprintf(f, " ir_mode *mode = NULL;\n");
218 fprintf(f, " ir_graph *irg = NULL;\n");
219 fprintf(f, " ir_node *tmp = NULL;\n");
220 fprintf(f, " symconst_symbol sym;\n");
221 if (env->need_unknown_X)
222 fprintf(f, " ir_node *unknownX = NULL;\n");
223 if (env->need_unknown)
224 fprintf(f, " ir_node *unknown = NULL;\n");
229 * Generate code for a predefined node.
231 * @param f file handle for output
234 * @return non-zero if n was a predefined node, 0 else
236 static int generate_predef_node(FILE *f, ir_node *n)
238 ir_graph *irg = current_ir_graph;
241 else if (n == code) \
242 name(f, " ", n, " = " #code ";\n");
245 X(get_irg_start(irg))
246 X(get_irg_start_block(irg))
248 X(get_irg_end_block(irg))
249 X(get_irg_initial_exec(irg))
250 X(get_irg_frame(irg))
252 X(get_irg_initial_mem(irg))
253 X(get_irg_no_mem(irg))
262 * Generate code for a Binop node.
264 * @param f file handle for output
267 static void generate_code_Binop(FILE *f, ir_node *n)
269 ir_op *op = get_irn_op(n);
270 ir_node *right = get_binop_right(n);
272 name(f, " ", n, " = ");
273 fprintf(f, "new_r_%s(irg, ", get_op_name(op));
274 name(f, NULL, get_nodes_block(n), ", ");
275 name(f, NULL, right, ", ");
276 name(f, NULL, get_binop_left(n), ", get_irn_mode(");
277 name(f, NULL, right, "));\n");
281 * Generate code for a Divop node.
283 * @param f file handle for output
286 static void generate_code_Divop(FILE *f, ir_node *n)
288 ir_op *op = get_irn_op(n);
289 ir_node *right = get_binop_right(n);
290 ir_mode *mode = get_divop_resmod(n);
292 name(f, " ", n, " = ");
293 fprintf(f, "new_r_%s(irg, ", get_op_name(op));
294 name(f, NULL, get_nodes_block(n), ", ");
295 name(f, NULL, get_fragile_op_mem(n), ", ");
296 name(f, NULL, get_binop_left(n), ", ");
297 name(f, NULL, right, ", ");
299 /* avoid to print the mode name if possible */
300 if (mode == get_irn_mode(right)) {
301 name(f, "get_irn_mode(", right, ");\n");
303 fprintf(f, "mode_%s);\n", get_mode_name(mode));
308 * Generate code for an Unop node.
310 * @param f file handle for output
313 static void generate_code_Unop(FILE *f, ir_node *n)
315 ir_op *op = get_irn_op(n);
316 ir_node *irn = get_unop_op(n);
318 name(f, " ", n, " = ");
319 fprintf(f, "new_r_%s(irg, ", get_op_name(op));
320 name(f, NULL, get_nodes_block(n), ", ");
321 name(f, NULL, irn, ", get_irn_mode(");
322 name(f, NULL, irn, "));\n");
326 * Generate code for a Load.
328 * @param f file handle for output
331 static void generate_code_Load(FILE *f, ir_node *n)
333 ir_node *ptr = get_Load_ptr(n);
334 ir_op *op = get_irn_op(ptr);
337 /* try to detect the mode */
339 name(f, " ent = get_Sel_entity(", ptr, ");\n");
340 fprintf(f, " mode = get_type_mode(get_entity_type(ent));\n");
342 else if (op == op_SymConst && get_SymConst_kind(ptr) == symconst_addr_ent) {
343 name(f, " ent = get_SymConst_entity(", ptr, ");\n");
344 fprintf(f, " mode = get_type_mode(get_entity_type(ent));\n");
347 fprintf(f, " mode = mode_%s;\n", get_mode_name(get_Load_mode(n)));
349 name(f, " ", n, " = ");
350 fprintf(f, "new_r_Load(irg, ");
351 name(f, NULL, get_nodes_block(n), ", ");
352 name(f, NULL, get_Load_mem(n), ", ");
353 name(f, NULL, ptr, ", mode);\n");
354 vol = get_Load_volatility(n);
355 if (vol != volatility_non_volatile) {
356 name(f, " set_Load_volatility(", n, ", ");
357 fprintf(f, "%s);\n", get_volatility_name(vol));
362 * Generate code for a Store.
364 * @param f file handle for output
367 static void generate_code_Store(FILE *f, ir_node *n)
371 name(f, " ", n, " = ");
372 fprintf(f, "new_r_Store(irg, ");
373 name(f, NULL, get_nodes_block(n), ", ");
374 name(f, NULL, get_Store_mem(n), ", ");
375 name(f, NULL, get_Store_ptr(n), ", ");
376 name(f, NULL, get_Store_value(n), ")\n");
377 vol = get_Store_volatility(n);
378 if (vol != volatility_non_volatile) {
379 name(f, " set_Store_volatility(", n, ", ");
380 fprintf(f, "%s);\n", get_volatility_name(vol));
385 * Generate code for a Return.
387 static void generate_code_Return(FILE *f, ir_node *n)
389 int i, n_res = get_Return_n_ress(n);
392 for (i = 0; i < n_res; ++i) {
393 fprintf(f, " in[%d] = ", i);
394 name(f, NULL, get_Return_res(n, i), ";\n");
396 name(f, " ", n, " = ");
397 fprintf(f, "new_r_Return(irg, ");
398 name(f, NULL, get_nodes_block(n), ", ");
399 name(f, NULL, get_Return_mem(n), ", ");
401 fprintf(f, "%d, in);\n", n_res);
403 name(f, "1, &", get_Return_res(n, 0), ");\n");
405 fprintf(f, "0, NULL);\n");
409 * Generate code for a Raise.
411 * @param f file handle for output
414 static void generate_code_Raise(FILE *f, ir_node *n)
416 name(f, " ", n, " = new_r_Return(irg, ");
417 name(f, NULL, get_nodes_block(n), ", ");
418 name(f, NULL, get_Raise_mem(n), ", ");
419 name(f, NULL, get_Raise_exo_ptr(n), ");\n");
423 * Generate code for a Bound.
425 * @param f file handle for output
428 static void generate_code_Bound(FILE *f, ir_node *n)
430 name(f, NULL, get_nodes_block(n), ", ");
431 name(f, NULL, get_Bound_mem(n), ", ");
432 name(f, NULL, get_Bound_index(n), ", ");
433 name(f, NULL, get_Bound_lower(n), ", ");
434 name(f, NULL, get_Bound_upper(n), ");\n");
438 * Generate code for an Unknown.
440 * @param f file handle for output
443 static void generate_code_Unknown(FILE *f, ir_node *n)
445 name(f, " ", n, " = new_r_Unknown(irg, ");
446 fprintf(f, "mode_%s);\n", get_mode_name(get_irn_mode(n)));
450 * Generate code for a Bad.
452 * @param f file handle for output
455 static void generate_code_Bad(FILE *f, ir_node *n)
457 name(f, " ", n, " = new_r_Bad(irg);\n");
461 * Generate code for a Const.
463 * @param f file handle for output
466 static void generate_code_Const(FILE *f, ir_node *n)
468 ir_type *tp = get_Const_type(n);
469 tarval *tv = get_Const_tarval(n);
470 ir_mode *mode = get_irn_mode(n);
473 if (tp == get_unknown_type()) {
474 name(f, " ", n, " = new_r_Const(irg, ");
477 name(f, " ", n, " = new_r_Const_type(irg, ");
479 name(f, NULL, get_nodes_block(n), ", ");
480 fprintf(f, "mode_%s, ", get_mode_name(mode));
482 if (! mode_is_reference(mode)) {
483 if (tv == get_tarval_null(mode))
484 fprintf(f, "get_tarval_null(mode)");
485 else if (tv == get_tarval_one(mode))
486 fprintf(f, "get_tarval_one(mode)");
487 else if (tv == get_tarval_b_false())
488 fprintf(f, "get_tarval_b_false()");
489 else if (tv == get_tarval_b_true())
490 fprintf(f, "get_tarval_b_true()");
491 else if (tv == get_tarval_minus_one(mode))
492 fprintf(f, "get_tarval_minus_one(mode)");
493 else if (mode_is_float(mode)) {
494 if (tv == get_tarval_nan(mode))
495 fprintf(f, "get_tarval_nan(mode)");
496 else if (tv == get_tarval_minus_inf(mode))
497 fprintf(f, "get_tarval_minus_inf(mode)");
498 else if (tv == get_tarval_plus_inf(mode))
499 fprintf(f, "get_tarval_plus_inf(mode)");
507 if (tv == get_tarval_null(mode))
508 fprintf(f, "get_tarval_null(mode)");
511 tarval_snprintf(buf, sizeof(buf), tv);
512 fprintf(f, "new_tarval_from_str(\"%s\", %u, ", buf, (unsigned) strlen(buf));
513 fprintf(f, "mode_%s)", get_mode_name(mode));
517 if (tp != get_unknown_type())
518 fprintf(f, ", %s", get_type_name(tp));
523 * Generate code for a SymConst.
525 * @param f file handle for output
528 static void generate_code_SymConst(FILE *f, ir_node *n)
534 symconst_kind kind = get_SymConst_kind(n);
535 const char *k_name = "NULL";
539 case symconst_addr_ent:
540 fprintf(f, " sym.entity_p = ENTITY(%s);\n", get_entity_name(get_SymConst_entity(n)));
541 k_name = "symconst_addr_ent";
543 case symconst_addr_name:
544 id = get_SymConst_name(n);
545 str = get_id_str(id);
546 fprintf(f, " sym.ident_p = new_id_from_chars(\"%s\", %d);\n", str, get_id_strlen(id));
547 k_name = "symconst_addr_name";
549 case symconst_type_size:
550 tp = get_SymConst_type(n);
551 fprintf(f, " sym.type_p = %s;\n", get_type_name(tp));
552 k_name = "symconst_type_size";
554 case symconst_type_align:
555 tp = get_SymConst_type(n);
556 fprintf(f, " sym.type_p = %s;\n", get_type_name(tp));
557 k_name = "symconst_type_align";
559 case symconst_type_tag:
560 tp = get_SymConst_type(n);
561 fprintf(f, " sym.type_p = %s;\n", get_type_name(tp));
562 k_name = "symconst_type_tag";
564 case symconst_ofs_ent:
565 ent = get_SymConst_entity(n);
566 fprintf(f, " sym.entity_p = %s;\n", get_entity_name(ent));
567 k_name = "symconst_ofs_ent";
569 case symconst_enum_const:
570 id = get_SymConst_name(n);
571 str = get_id_str(id);
572 fprintf(f, " sym.ident_p = new_id_from_chars(\"%s\", %d);\n", str, get_id_strlen(id));
573 k_name = "symconst_enum_const";
576 label = get_SymConst_label(n);
577 fprintf(f, " sym.label = %lu;\n", label);
578 k_name = "symconst_label";
581 name(f, " ", n, " = new_r_SymConst(irg, ");
582 name(f, NULL, get_nodes_block(n), ", sym, ");
583 fprintf(f, "%s);\n", k_name);
587 * Generate code for a Sel.
589 * @param f file handle for output
592 static void generate_code_Sel(FILE *f, ir_node *n)
594 int n_index = get_Sel_n_indexs(n);
597 ir_node *ptr = get_Sel_ptr(n);
598 ir_entity *ent = get_Sel_entity(n);
605 /* try to detect the array entity */
606 op = get_irn_op(ptr);
607 if (op == op_SymConst && get_SymConst_kind(ptr) == symconst_addr_ent) {
608 up_ent = get_SymConst_entity(ptr);
609 tp = get_entity_type(up_ent);
610 if (is_Array_type(tp) && get_array_element_entity(tp) == ent) {
611 name(f, " ent = get_SymConst_entity(", ptr, ");\n");
612 fprintf(f, " ent = get_array_element_entity(get_entity_type(ent));\n");
616 else if (op == op_Sel) {
617 up_ent = get_Sel_entity(ptr);
618 tp = get_entity_type(up_ent);
619 if (is_Array_type(tp) && get_array_element_entity(tp) == ent) {
620 name(f, " ent = get_Sel_entity(", ptr, ");\n");
621 fprintf(f, " ent = get_array_element_entity(get_entity_type(ent));\n");
627 for (i = 0; i < n_index; ++i) {
628 fprintf(f, " in[%d] = ", i);
629 name(f, NULL, get_Sel_index(n, i), ";\n");
633 name(f, " ", n, " = new_r_simpleSel(irg, ");
635 name(f, " ", n, " = new_r_Sel(irg, ");
636 name(f, NULL, get_nodes_block(n), ", ");
637 name(f, NULL, get_Sel_mem(n), ", ");
638 name(f, NULL, ptr, ", ");
640 name(f, "1, &", get_Sel_index(n, 0), ", ");
641 else if (n_index > 0)
642 fprintf(f, "%d, in, ", n_index);
644 ent = get_Sel_entity(n);
646 fprintf(f, "ent);\n");
648 fprintf(f, "ENTITY(%s));\n", get_entity_name(get_Sel_entity(n)));
652 * Generate code for a Block. Break loops here.
654 * @param f file handle for output
657 static void generate_code_Block(fix_ctx *env, ir_node *n)
660 int i, arity = get_irn_arity(n);
661 for (i = 0; i < arity; ++i) {
662 fprintf(f, " in[%d] = ", i);
663 if (is_backedge(n, i)) {
664 fprintf(f, "unknownX;\n");
665 env->has_backedges = 1;
668 name(f, NULL, get_irn_n(n, i), ";\n");
671 name(f, " ", n, " = new_r_Block(irg, ");
672 fprintf(f, "%d, in);\n", arity);
676 * Generate code for a Phi. Break loops here.
678 * @param f file handle for output
681 static void generate_code_Phi(fix_ctx *env, ir_node *n)
684 int i, arity = get_irn_arity(n);
685 ir_mode *mode = get_irn_mode(n);
687 if (has_backedges(n)) {
688 fprintf(f, " unknown = new_r_Unknown(irg, mode_%s);\n", get_mode_name(mode));
689 env->has_backedges = 1;
691 for (i = 0; i < arity; ++i) {
692 fprintf(f, " in[%d] = ", i);
693 if (is_backedge(n, i))
694 fprintf(f, "unknown;\n");
696 name(f, NULL, get_irn_n(n, i), ";\n");
699 name(f, " ", n, " = new_r_Phi(irg, ");
700 fprintf(f, "%d, in, mode_%s);\n", arity, get_mode_name(mode));
704 * Generate code for a Proj(Load).
706 * @param f file handle for output
709 static void generate_code_Proj_Load(FILE *f, ir_node *n)
711 ir_node *pred = get_Proj_pred(n);
712 ir_node *block = get_nodes_block(n);
713 long proj_nr = get_Proj_proj(n);
714 const char *mode = "NULL";
715 const char *proj= "-1";
722 case pn_Load_X_regular:
724 proj = "pn_Load_X_regular";
726 case pn_Load_X_except:
728 proj = "pn_Load_X_except";
732 proj = "pn_Load_res";
733 name(f, " mode = get_Load_mode(", pred, ");\n");
736 name(f, " ", n, " = new_r_Proj(irg, ");
737 name(f, NULL, block, ", ");
738 name(f, NULL, pred, ", ");
739 fprintf(f, "%s, %s);\n", mode, proj);
743 * Generate code for a Proj(Store).
745 * @param f file handle for output
748 static void generate_code_Proj_Store(FILE *f, ir_node *n)
750 ir_node *pred = get_Proj_pred(n);
751 ir_node *block = get_nodes_block(n);
752 long proj_nr = get_Proj_proj(n);
753 const char *mode = "NULL";
754 const char *proj= "-1";
761 case pn_Store_X_regular:
763 proj = "pn_Store_X_regular";
765 case pn_Store_X_except:
767 proj = "pn_Store_X_except";
770 name(f, " ", n, " = new_r_Proj(irg, ");
771 name(f, NULL, block, ", ");
772 name(f, NULL, pred, ", ");
773 fprintf(f, "%s, %s);\n", mode, proj);
777 * Generate code for a Proj(Div).
779 * @param f file handle for output
782 static void generate_code_Proj_Div(FILE *f, ir_node *n)
784 ir_node *pred = get_Proj_pred(n);
785 ir_node *block = get_nodes_block(n);
786 long proj_nr = get_Proj_proj(n);
787 const char *mode = "NULL";
788 const char *proj= "-1";
795 case pn_Div_X_regular:
797 proj = "pn_Div_X_regular";
799 case pn_Div_X_except:
801 proj = "pn_Div_X_except";
806 name(f, " mode = get_Div_resmode(", pred, ");\n");
809 name(f, " ", n, " = new_r_Proj(irg, ");
810 name(f, NULL, block, ", ");
811 name(f, NULL, pred, ", ");
812 fprintf(f, "%s, %s);\n", mode, proj);
816 * Generate code for a Proj(Mod).
818 * @param f file handle for output
821 static void generate_code_Proj_Mod(FILE *f, ir_node *n)
823 ir_node *pred = get_Proj_pred(n);
824 ir_node *block = get_nodes_block(n);
825 long proj_nr = get_Proj_proj(n);
826 const char *mode = "NULL";
827 const char *proj= "-1";
834 case pn_Mod_X_regular:
836 proj = "pn_Mod_X_regular";
838 case pn_Mod_X_except:
840 proj = "pn_Mod_X_except";
845 name(f, " mode = get_Mod_resmode(", pred, ");\n");
848 name(f, " ", n, " = new_r_Proj(irg, ");
849 name(f, NULL, block, ", ");
850 name(f, NULL, pred, ", ");
851 fprintf(f, "%s, %s);\n", mode, proj);
855 * Generate code for a Proj(DivMod).
857 * @param f file handle for output
860 static void generate_code_Proj_DivMod(FILE *f, ir_node *n)
862 ir_node *pred = get_Proj_pred(n);
863 ir_node *block = get_nodes_block(n);
864 long proj_nr = get_Proj_proj(n);
865 const char *mode = "NULL";
866 const char *proj= "-1";
871 proj = "pn_DivMod_M";
873 case pn_DivMod_X_except:
875 proj = "pn_DivMod_X_except";
877 case pn_DivMod_res_div:
879 proj = "pn_DivMod_res_div";
880 name(f, " mode = get_DivMod_resmode(", pred, ");\n");
882 case pn_DivMod_res_mod:
884 proj = "pn_DivMod_res_mod";
885 name(f, " mode = get_DivMod_resmode(", pred, ");\n");
888 name(f, " ", n, " = new_r_Proj(irg, ");
889 name(f, NULL, block, ", ");
890 name(f, NULL, pred, ", ");
891 fprintf(f, "%s, %s);\n", mode, proj);
895 * Generate code for a Proj(Cmp).
897 * @param f file handle for output
900 static void generate_code_Proj_Cmp(FILE *f, ir_node *n)
902 long proj_nr = get_Proj_proj(n);
904 name(f, " ", n, " = new_r_Proj(irg, ");
905 name(f, NULL, get_nodes_block(n), ", ");
906 name(f, NULL, get_Proj_pred(n), ", ");
907 fprintf(f, "mode_b, %s);\n", get_pnc_string(proj_nr));
911 * Generate code for a Proj(Cond).
913 * @param f file handle for output
916 static void generate_code_Proj_Cond(FILE *f, ir_node *n)
918 ir_node *cond = get_Proj_pred(n);
919 ir_node *sel = get_Cond_selector(cond);
920 ir_node *block = get_nodes_block(n);
921 long proj_nr = get_Proj_proj(n);
923 if (get_irn_mode(sel) == mode_b) {
924 name(f, " ", n, " = new_r_Proj(irg, ");
925 name(f, NULL, block, ", ");
926 name(f, NULL, cond, ", ");
927 fprintf(f, "mode_b, %s);\n", proj_nr ? "pn_Cond_true" : "pn_Cond_false");
930 if (proj_nr == get_Cond_default_proj(cond))
931 name(f, " ", n, " = new_r_defaultProj(irg, ");
933 name(f, " ", n, " = new_r_Proj(irg, ");
935 name(f, NULL, block, ", ");
936 name(f, NULL, cond, ", ");
937 fprintf(f, "mode_%s, %ld);\n", get_mode_name(get_irn_mode(n)), proj_nr);
942 * Generate code for a Proj.
944 * @param f file handle for output
947 static void generate_code_Proj(FILE *f, ir_node *n)
949 ir_node *pred = get_Proj_pred(n);
951 switch (get_irn_opcode(pred)) {
953 generate_code_Proj_Load(f, n);
956 generate_code_Proj_Store(f, n);
959 generate_code_Proj_Div(f, n);
962 generate_code_Proj_Mod(f, n);
965 generate_code_Proj_DivMod(f, n);
968 generate_code_Proj_Cmp(f, n);
971 generate_code_Proj_Cond(f, n);
974 const char *mode_name = get_mode_name(get_irn_mode(n));
975 name(f, " ", n, " = new_r_Proj(irg, ");
976 name(f, NULL, get_nodes_block(n), ", ");
977 name(f, NULL, get_Proj_pred(n), ", ");
978 fprintf(f, "mode_%s, %ld);\n", mode_name, get_Proj_proj(n));
984 * Generate code for a Jmp.
986 * @param f file handle for output
989 static void generate_code_Jmp(FILE *f, ir_node *n)
991 name(f, " ", n, " = new_r_Jmp(irg, ");
992 name(f, NULL, get_nodes_block(n), ");\n");
996 * Generate code for a Cond.
998 * @param f file handle for output
1001 static void generate_code_Cond(FILE *f, ir_node *n)
1003 name(f, " ", n, " = new_r_Cond(irg, ");
1004 name(f, NULL, get_nodes_block(n), ", ");
1005 name(f, NULL, get_Cond_selector(n), ");\n");
1009 * Generate code for a Call.
1011 * @param f file handle for output
1014 static void generate_code_Call(FILE *f, ir_node *n)
1016 int i, n_param = get_Call_n_params(n);
1017 ir_node *ptr = get_Call_ptr(n);
1018 ir_op *op = get_irn_op(ptr);
1020 ir_type *tp = get_Call_type(n);
1023 /* try to detect the type */
1025 ent = get_Sel_entity(ptr);
1026 if (tp == get_entity_type(ent)) {
1027 name(f, " ent = get_Sel_entity(", ptr, ");\n");
1028 fprintf(f, " tp = get_entity_type(ent);\n");
1032 else if (op == op_SymConst && get_SymConst_kind(ptr) == symconst_addr_ent) {
1033 ent = get_SymConst_entity(ptr);
1034 if (tp == get_entity_type(ent)) {
1035 name(f, " ent = get_SymConst_entity(", ptr, ");\n");
1036 fprintf(f, " tp = get_entity_type(ent);\n");
1041 fprintf(f, " tp = TYPE(%s);\n", get_type_name(tp));
1043 for (i = 0; i < n_param; ++i) {
1044 fprintf(f, " in[%d] = ", i);
1045 name(f, NULL, get_Call_param(n, i), ";\n");
1047 name(f, " ", n, " = ");
1048 fprintf(f, "new_r_Call(irg, ");
1049 name(f, NULL, get_nodes_block(n), ", ");
1050 name(f, NULL, get_Call_mem(n), ", ");
1052 fprintf(f, "%d, in, tp);\n", n_param);
1054 fprintf(f, "0, NULL, tp);\n");
1058 * Create code for the given Alloc node
1060 * @param f file handle for output
1063 static void generate_code_Alloc(FILE *f, ir_node *n)
1065 name(f, " ", n, " = new_r_Alloc(irg, ");
1066 name(f, NULL, get_nodes_block(n), ", ");
1067 name(f, NULL, get_Alloc_mem(n), ", ");
1068 name(f, NULL, get_Alloc_size(n), ", tp, ");
1069 fprintf(f, get_Alloc_where(n) == stack_alloc ? "stack_alloc);\n" : "heap_alloc);\n");
1073 * Create code for the given Free node
1075 * @param f file handle for output
1078 static void generate_code_Free(FILE *f, ir_node *n)
1080 fprintf(f, " tp = TYPE(%s);\n", get_type_name(get_Free_type(n)));
1081 name(f, " ", n, " = new_r_Alloc(irg, ");
1082 name(f, NULL, get_nodes_block(n), ", ");
1083 name(f, NULL, get_Free_ptr(n), ", ");
1084 name(f, NULL, get_Free_size(n), ", tp, ");
1085 fprintf(f, get_Free_where(n) == stack_alloc ? "stack_alloc);\n" : "heap_alloc);\n");
1089 * Create code for the given node constructor.
1091 * @param f file handle for output
1094 static void generate_node(fix_ctx *env, ir_node *n)
1097 ir_op *op = get_irn_op(n);
1099 if (op == op_Div || op == op_Mod || op == op_DivMod || op == op_Quot)
1100 generate_code_Divop(f, n);
1101 else if (op == op_Load)
1102 generate_code_Load(f, n);
1103 else if (op == op_Store)
1104 generate_code_Store(f, n);
1105 else if (op == op_Return)
1106 generate_code_Return(f, n);
1107 else if (op == op_Raise)
1108 generate_code_Raise(f, n);
1109 else if (op == op_Bound)
1110 generate_code_Bound(f, n);
1111 else if (op == op_Unknown)
1112 generate_code_Unknown(f, n);
1113 else if (op == op_Bad)
1114 generate_code_Bad(f, n);
1115 else if (op == op_Const)
1116 generate_code_Const(f, n);
1117 else if (op == op_SymConst)
1118 generate_code_SymConst(f, n);
1119 else if (op == op_Sel)
1120 generate_code_Sel(f, n);
1121 else if (op == op_Block)
1122 generate_code_Block(env, n);
1123 else if (op == op_Phi)
1124 generate_code_Phi(env, n);
1125 else if (op == op_Proj)
1126 generate_code_Proj(f, n);
1127 else if (op == op_Jmp)
1128 generate_code_Jmp(f, n);
1129 else if (op == op_Cond)
1130 generate_code_Cond(f, n);
1131 else if (op == op_Call)
1132 generate_code_Call(f, n);
1133 else if (op == op_Alloc)
1134 generate_code_Alloc(f, n);
1135 else if (op == op_Free)
1136 generate_code_Free(f, n);
1137 else if (is_binop(n))
1138 generate_code_Binop(f, n);
1139 else if (is_unop(n))
1140 generate_code_Unop(f, n);
1142 name(f, " ", n, " = NULL;\n");
1146 * Walker: Create code for the given node.
1148 static void dump_code(ir_node *n, void *ctx)
1152 if (! generate_predef_node(env->f, n))
1153 generate_node(env, n);
1157 * Generate Firm code.
1159 * @param env a fix environment
1160 * @param irg the graph
1162 static void generate_code(fix_ctx *env, ir_graph *irg)
1164 irg_walk_graph(irg, NULL, dump_code, env);
1168 * Generate Firm assembler for a given graph
1170 * @param f the output file handle
1171 * @param irg the graph
1173 static void gen_Firm_assembler_irg(FILE *f, ir_graph *irg)
1181 venv.need_unknown_X = 0;
1182 venv.need_unknown = 0;
1185 fenv.start_block = get_irg_start_block(irg);
1186 fenv.has_backedges = 0;
1188 /* needed to detect loops */
1189 construct_backedges(irg);
1191 generate_header(f, irg);
1192 generate_var_decls(&venv, irg);
1193 generate_prolog(&venv, irg);
1194 generate_code(&fenv, irg);
1195 generate_epilog(&fenv, irg);
1198 void gen_Firm_assembler(const char *input_filename)
1203 (void) input_filename;
1205 f = fopen("firm_output.c", "w");
1207 for (i = 0, n = get_irp_n_irgs(); i < n; ++i) {
1208 irg = get_irp_irg(i);
1209 gen_Firm_assembler_irg(f, irg);
1213 /* report some error here */