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)
533 symconst_kind kind = get_SymConst_kind(n);
534 const char *k_name = "NULL";
538 case symconst_addr_ent:
539 fprintf(f, " sym.entity_p = ENTITY(%s);\n", get_entity_name(get_SymConst_entity(n)));
540 k_name = "symconst_addr_ent";
542 case symconst_addr_name:
543 id = get_SymConst_name(n);
544 str = get_id_str(id);
545 fprintf(f, " sym.ident_p = new_id_from_chars(\"%s\", %d);\n", str, get_id_strlen(id));
546 k_name = "symconst_addr_name";
548 case symconst_type_size:
549 tp = get_SymConst_type(n);
550 fprintf(f, " sym.type_p = %s;\n", get_type_name(tp));
551 k_name = "symconst_type_size";
553 case symconst_type_align:
554 tp = get_SymConst_type(n);
555 fprintf(f, " sym.type_p = %s;\n", get_type_name(tp));
556 k_name = "symconst_type_align";
558 case symconst_type_tag:
559 tp = get_SymConst_type(n);
560 fprintf(f, " sym.type_p = %s;\n", get_type_name(tp));
561 k_name = "symconst_type_tag";
563 case symconst_ofs_ent:
564 ent = get_SymConst_entity(n);
565 fprintf(f, " sym.entity_p = %s;\n", get_entity_name(ent));
566 k_name = "symconst_ofs_ent";
568 case symconst_enum_const:
569 id = get_SymConst_name(n);
570 str = get_id_str(id);
571 fprintf(f, " sym.ident_p = new_id_from_chars(\"%s\", %d);\n", str, get_id_strlen(id));
572 k_name = "symconst_enum_const";
575 name(f, " ", n, " = new_r_SymConst(irg, ");
576 name(f, NULL, get_nodes_block(n), ", sym, ");
577 fprintf(f, "%s);\n", k_name);
581 * Generate code for a Sel.
583 * @param f file handle for output
586 static void generate_code_Sel(FILE *f, ir_node *n)
588 int n_index = get_Sel_n_indexs(n);
591 ir_node *ptr = get_Sel_ptr(n);
592 ir_entity *ent = get_Sel_entity(n);
599 /* try to detect the array entity */
600 op = get_irn_op(ptr);
601 if (op == op_SymConst && get_SymConst_kind(ptr) == symconst_addr_ent) {
602 up_ent = get_SymConst_entity(ptr);
603 tp = get_entity_type(up_ent);
604 if (is_Array_type(tp) && get_array_element_entity(tp) == ent) {
605 name(f, " ent = get_SymConst_entity(", ptr, ");\n");
606 fprintf(f, " ent = get_array_element_entity(get_entity_type(ent));\n");
610 else if (op == op_Sel) {
611 up_ent = get_Sel_entity(ptr);
612 tp = get_entity_type(up_ent);
613 if (is_Array_type(tp) && get_array_element_entity(tp) == ent) {
614 name(f, " ent = get_Sel_entity(", ptr, ");\n");
615 fprintf(f, " ent = get_array_element_entity(get_entity_type(ent));\n");
621 for (i = 0; i < n_index; ++i) {
622 fprintf(f, " in[%d] = ", i);
623 name(f, NULL, get_Sel_index(n, i), ";\n");
627 name(f, " ", n, " = new_r_simpleSel(irg, ");
629 name(f, " ", n, " = new_r_Sel(irg, ");
630 name(f, NULL, get_nodes_block(n), ", ");
631 name(f, NULL, get_Sel_mem(n), ", ");
632 name(f, NULL, ptr, ", ");
634 name(f, "1, &", get_Sel_index(n, 0), ", ");
635 else if (n_index > 0)
636 fprintf(f, "%d, in, ", n_index);
638 ent = get_Sel_entity(n);
640 fprintf(f, "ent);\n");
642 fprintf(f, "ENTITY(%s));\n", get_entity_name(get_Sel_entity(n)));
646 * Generate code for a Block. Break loops here.
648 * @param f file handle for output
651 static void generate_code_Block(fix_ctx *env, ir_node *n)
654 int i, arity = get_irn_arity(n);
655 for (i = 0; i < arity; ++i) {
656 fprintf(f, " in[%d] = ", i);
657 if (is_backedge(n, i)) {
658 fprintf(f, "unknownX;\n");
659 env->has_backedges = 1;
662 name(f, NULL, get_irn_n(n, i), ";\n");
665 name(f, " ", n, " = new_r_Block(irg, ");
666 fprintf(f, "%d, in);\n", arity);
670 * Generate code for a Phi. Break loops here.
672 * @param f file handle for output
675 static void generate_code_Phi(fix_ctx *env, ir_node *n)
678 int i, arity = get_irn_arity(n);
679 ir_mode *mode = get_irn_mode(n);
681 if (has_backedges(n)) {
682 fprintf(f, " unknown = new_r_Unknown(irg, mode_%s);\n", get_mode_name(mode));
683 env->has_backedges = 1;
685 for (i = 0; i < arity; ++i) {
686 fprintf(f, " in[%d] = ", i);
687 if (is_backedge(n, i))
688 fprintf(f, "unknown;\n");
690 name(f, NULL, get_irn_n(n, i), ";\n");
693 name(f, " ", n, " = new_r_Phi(irg, ");
694 fprintf(f, "%d, in, mode_%s);\n", arity, get_mode_name(mode));
698 * Generate code for a Proj(Load).
700 * @param f file handle for output
703 static void generate_code_Proj_Load(FILE *f, ir_node *n)
705 ir_node *pred = get_Proj_pred(n);
706 ir_node *block = get_nodes_block(n);
707 long proj_nr = get_Proj_proj(n);
708 const char *mode = "NULL";
709 const char *proj= "-1";
716 case pn_Load_X_regular:
718 proj = "pn_Load_X_regular";
720 case pn_Load_X_except:
722 proj = "pn_Load_X_except";
726 proj = "pn_Load_res";
727 name(f, " mode = get_Load_mode(", pred, ");\n");
730 name(f, " ", n, " = new_r_Proj(irg, ");
731 name(f, NULL, block, ", ");
732 name(f, NULL, pred, ", ");
733 fprintf(f, "%s, %s);\n", mode, proj);
737 * Generate code for a Proj(Store).
739 * @param f file handle for output
742 static void generate_code_Proj_Store(FILE *f, ir_node *n)
744 ir_node *pred = get_Proj_pred(n);
745 ir_node *block = get_nodes_block(n);
746 long proj_nr = get_Proj_proj(n);
747 const char *mode = "NULL";
748 const char *proj= "-1";
755 case pn_Store_X_regular:
757 proj = "pn_Store_X_regular";
759 case pn_Store_X_except:
761 proj = "pn_Store_X_except";
764 name(f, " ", n, " = new_r_Proj(irg, ");
765 name(f, NULL, block, ", ");
766 name(f, NULL, pred, ", ");
767 fprintf(f, "%s, %s);\n", mode, proj);
771 * Generate code for a Proj(Div).
773 * @param f file handle for output
776 static void generate_code_Proj_Div(FILE *f, ir_node *n)
778 ir_node *pred = get_Proj_pred(n);
779 ir_node *block = get_nodes_block(n);
780 long proj_nr = get_Proj_proj(n);
781 const char *mode = "NULL";
782 const char *proj= "-1";
789 case pn_Div_X_regular:
791 proj = "pn_Div_X_regular";
793 case pn_Div_X_except:
795 proj = "pn_Div_X_except";
800 name(f, " mode = get_Div_resmode(", pred, ");\n");
803 name(f, " ", n, " = new_r_Proj(irg, ");
804 name(f, NULL, block, ", ");
805 name(f, NULL, pred, ", ");
806 fprintf(f, "%s, %s);\n", mode, proj);
810 * Generate code for a Proj(Mod).
812 * @param f file handle for output
815 static void generate_code_Proj_Mod(FILE *f, ir_node *n)
817 ir_node *pred = get_Proj_pred(n);
818 ir_node *block = get_nodes_block(n);
819 long proj_nr = get_Proj_proj(n);
820 const char *mode = "NULL";
821 const char *proj= "-1";
828 case pn_Mod_X_regular:
830 proj = "pn_Mod_X_regular";
832 case pn_Mod_X_except:
834 proj = "pn_Mod_X_except";
839 name(f, " mode = get_Mod_resmode(", pred, ");\n");
842 name(f, " ", n, " = new_r_Proj(irg, ");
843 name(f, NULL, block, ", ");
844 name(f, NULL, pred, ", ");
845 fprintf(f, "%s, %s);\n", mode, proj);
849 * Generate code for a Proj(DivMod).
851 * @param f file handle for output
854 static void generate_code_Proj_DivMod(FILE *f, ir_node *n)
856 ir_node *pred = get_Proj_pred(n);
857 ir_node *block = get_nodes_block(n);
858 long proj_nr = get_Proj_proj(n);
859 const char *mode = "NULL";
860 const char *proj= "-1";
865 proj = "pn_DivMod_M";
867 case pn_DivMod_X_except:
869 proj = "pn_DivMod_X_except";
871 case pn_DivMod_res_div:
873 proj = "pn_DivMod_res_div";
874 name(f, " mode = get_DivMod_resmode(", pred, ");\n");
876 case pn_DivMod_res_mod:
878 proj = "pn_DivMod_res_mod";
879 name(f, " mode = get_DivMod_resmode(", pred, ");\n");
882 name(f, " ", n, " = new_r_Proj(irg, ");
883 name(f, NULL, block, ", ");
884 name(f, NULL, pred, ", ");
885 fprintf(f, "%s, %s);\n", mode, proj);
889 * Generate code for a Proj(Cmp).
891 * @param f file handle for output
894 static void generate_code_Proj_Cmp(FILE *f, ir_node *n)
896 long proj_nr = get_Proj_proj(n);
898 name(f, " ", n, " = new_r_Proj(irg, ");
899 name(f, NULL, get_nodes_block(n), ", ");
900 name(f, NULL, get_Proj_pred(n), ", ");
901 fprintf(f, "mode_b, %s);\n", get_pnc_string(proj_nr));
905 * Generate code for a Proj(Cond).
907 * @param f file handle for output
910 static void generate_code_Proj_Cond(FILE *f, ir_node *n)
912 ir_node *cond = get_Proj_pred(n);
913 ir_node *sel = get_Cond_selector(cond);
914 ir_node *block = get_nodes_block(n);
915 long proj_nr = get_Proj_proj(n);
917 if (get_irn_mode(sel) == mode_b) {
918 name(f, " ", n, " = new_r_Proj(irg, ");
919 name(f, NULL, block, ", ");
920 name(f, NULL, cond, ", ");
921 fprintf(f, "mode_b, %s);\n", proj_nr ? "pn_Cond_true" : "pn_Cond_false");
924 if (proj_nr == get_Cond_default_proj(cond))
925 name(f, " ", n, " = new_r_defaultProj(irg, ");
927 name(f, " ", n, " = new_r_Proj(irg, ");
929 name(f, NULL, block, ", ");
930 name(f, NULL, cond, ", ");
931 fprintf(f, "mode_%s, %ld);\n", get_mode_name(get_irn_mode(n)), proj_nr);
936 * Generate code for a Proj.
938 * @param f file handle for output
941 static void generate_code_Proj(FILE *f, ir_node *n)
943 ir_node *pred = get_Proj_pred(n);
945 switch (get_irn_opcode(pred)) {
947 generate_code_Proj_Load(f, n);
950 generate_code_Proj_Store(f, n);
953 generate_code_Proj_Div(f, n);
956 generate_code_Proj_Mod(f, n);
959 generate_code_Proj_DivMod(f, n);
962 generate_code_Proj_Cmp(f, n);
965 generate_code_Proj_Cond(f, n);
968 const char *mode_name = get_mode_name(get_irn_mode(n));
969 name(f, " ", n, " = new_r_Proj(irg, ");
970 name(f, NULL, get_nodes_block(n), ", ");
971 name(f, NULL, get_Proj_pred(n), ", ");
972 fprintf(f, "mode_%s, %ld);\n", mode_name, get_Proj_proj(n));
978 * Generate code for a Jmp.
980 * @param f file handle for output
983 static void generate_code_Jmp(FILE *f, ir_node *n)
985 name(f, " ", n, " = new_r_Jmp(irg, ");
986 name(f, NULL, get_nodes_block(n), ");\n");
990 * Generate code for a Cond.
992 * @param f file handle for output
995 static void generate_code_Cond(FILE *f, ir_node *n)
997 name(f, " ", n, " = new_r_Cond(irg, ");
998 name(f, NULL, get_nodes_block(n), ", ");
999 name(f, NULL, get_Cond_selector(n), ");\n");
1003 * Generate code for a Call.
1005 * @param f file handle for output
1008 static void generate_code_Call(FILE *f, ir_node *n)
1010 int i, n_param = get_Call_n_params(n);
1011 ir_node *ptr = get_Call_ptr(n);
1012 ir_op *op = get_irn_op(ptr);
1014 ir_type *tp = get_Call_type(n);
1017 /* try to detect the type */
1019 ent = get_Sel_entity(ptr);
1020 if (tp == get_entity_type(ent)) {
1021 name(f, " ent = get_Sel_entity(", ptr, ");\n");
1022 fprintf(f, " tp = get_entity_type(ent);\n");
1026 else if (op == op_SymConst && get_SymConst_kind(ptr) == symconst_addr_ent) {
1027 ent = get_SymConst_entity(ptr);
1028 if (tp == get_entity_type(ent)) {
1029 name(f, " ent = get_SymConst_entity(", ptr, ");\n");
1030 fprintf(f, " tp = get_entity_type(ent);\n");
1035 fprintf(f, " tp = TYPE(%s);\n", get_type_name(tp));
1037 for (i = 0; i < n_param; ++i) {
1038 fprintf(f, " in[%d] = ", i);
1039 name(f, NULL, get_Call_param(n, i), ";\n");
1041 name(f, " ", n, " = ");
1042 fprintf(f, "new_r_Call(irg, ");
1043 name(f, NULL, get_nodes_block(n), ", ");
1044 name(f, NULL, get_Call_mem(n), ", ");
1046 fprintf(f, "%d, in, tp);\n", n_param);
1048 fprintf(f, "0, NULL, tp);\n");
1052 * Create code for the given Alloc node
1054 * @param f file handle for output
1057 static void generate_code_Alloc(FILE *f, ir_node *n)
1059 name(f, " ", n, " = new_r_Alloc(irg, ");
1060 name(f, NULL, get_nodes_block(n), ", ");
1061 name(f, NULL, get_Alloc_mem(n), ", ");
1062 name(f, NULL, get_Alloc_size(n), ", tp, ");
1063 fprintf(f, get_Alloc_where(n) == stack_alloc ? "stack_alloc);\n" : "heap_alloc);\n");
1067 * Create code for the given Free node
1069 * @param f file handle for output
1072 static void generate_code_Free(FILE *f, ir_node *n)
1074 fprintf(f, " tp = TYPE(%s);\n", get_type_name(get_Free_type(n)));
1075 name(f, " ", n, " = new_r_Alloc(irg, ");
1076 name(f, NULL, get_nodes_block(n), ", ");
1077 name(f, NULL, get_Free_ptr(n), ", ");
1078 name(f, NULL, get_Free_size(n), ", tp, ");
1079 fprintf(f, get_Free_where(n) == stack_alloc ? "stack_alloc);\n" : "heap_alloc);\n");
1083 * Create code for the given node constructor.
1085 * @param f file handle for output
1088 static void generate_node(fix_ctx *env, ir_node *n)
1091 ir_op *op = get_irn_op(n);
1093 if (op == op_Div || op == op_Mod || op == op_DivMod || op == op_Quot)
1094 generate_code_Divop(f, n);
1095 else if (op == op_Load)
1096 generate_code_Load(f, n);
1097 else if (op == op_Store)
1098 generate_code_Store(f, n);
1099 else if (op == op_Return)
1100 generate_code_Return(f, n);
1101 else if (op == op_Raise)
1102 generate_code_Raise(f, n);
1103 else if (op == op_Bound)
1104 generate_code_Bound(f, n);
1105 else if (op == op_Unknown)
1106 generate_code_Unknown(f, n);
1107 else if (op == op_Bad)
1108 generate_code_Bad(f, n);
1109 else if (op == op_Const)
1110 generate_code_Const(f, n);
1111 else if (op == op_SymConst)
1112 generate_code_SymConst(f, n);
1113 else if (op == op_Sel)
1114 generate_code_Sel(f, n);
1115 else if (op == op_Block)
1116 generate_code_Block(env, n);
1117 else if (op == op_Phi)
1118 generate_code_Phi(env, n);
1119 else if (op == op_Proj)
1120 generate_code_Proj(f, n);
1121 else if (op == op_Jmp)
1122 generate_code_Jmp(f, n);
1123 else if (op == op_Cond)
1124 generate_code_Cond(f, n);
1125 else if (op == op_Call)
1126 generate_code_Call(f, n);
1127 else if (op == op_Alloc)
1128 generate_code_Alloc(f, n);
1129 else if (op == op_Free)
1130 generate_code_Free(f, n);
1131 else if (is_binop(n))
1132 generate_code_Binop(f, n);
1133 else if (is_unop(n))
1134 generate_code_Unop(f, n);
1136 name(f, " ", n, " = NULL;\n");
1140 * Walker: Create code for the given node.
1142 static void dump_code(ir_node *n, void *ctx)
1146 if (! generate_predef_node(env->f, n))
1147 generate_node(env, n);
1151 * Generate Firm code.
1153 * @param env a fix environment
1154 * @param irg the graph
1156 static void generate_code(fix_ctx *env, ir_graph *irg)
1158 irg_walk_graph(irg, NULL, dump_code, env);
1162 * Generate Firm assembler for a given graph
1164 * @param f the output file handle
1165 * @param irg the graph
1167 static void gen_Firm_assembler_irg(FILE *f, ir_graph *irg)
1175 venv.need_unknown_X = 0;
1176 venv.need_unknown = 0;
1179 fenv.start_block = get_irg_start_block(irg);
1180 fenv.has_backedges = 0;
1182 /* needed to detect loops */
1183 construct_backedges(irg);
1185 generate_header(f, irg);
1186 generate_var_decls(&venv, irg);
1187 generate_prolog(&venv, irg);
1188 generate_code(&fenv, irg);
1189 generate_epilog(&fenv, irg);
1192 void gen_Firm_assembler(const char *input_filename)
1197 (void) input_filename;
1199 f = fopen("firm_output.c", "w");
1201 for (i = 0, n = get_irp_n_irgs(); i < n; ++i) {
1202 irg = get_irp_irg(i);
1203 gen_Firm_assembler_irg(f, irg);
1207 /* report some error here */