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 Representation of an intermediate operation.
23 * @author Martin Trapp, Christian Schaefer, Goetz Lindenmaier, Michael Beck
32 #include "irgraph_t.h"
34 #include "irbackedge_t.h"
38 #include "iredgekinds.h"
39 #include "iredges_t.h"
49 /* some constants fixing the positions of nodes predecessors
51 #define CALL_PARAM_OFFSET (n_Call_max+1)
52 #define BUILTIN_PARAM_OFFSET (n_Builtin_max+1)
53 #define SEL_INDEX_OFFSET (n_Sel_max+1)
54 #define RETURN_RESULT_OFFSET (n_Return_max+1)
55 #define END_KEEPALIVE_OFFSET 0
57 static const char *relation_names [] = {
69 "unordered_less_equal",
71 "unordered_greater_equal",
76 const char *get_relation_string(ir_relation relation)
78 assert(relation < (ir_relation)ARRAY_SIZE(relation_names));
79 return relation_names[relation];
82 ir_relation get_negated_relation(ir_relation relation)
84 return relation ^ ir_relation_true;
87 ir_relation get_inversed_relation(ir_relation relation)
89 ir_relation code = relation & ~(ir_relation_less|ir_relation_greater);
90 bool less = relation & ir_relation_less;
91 bool greater = relation & ir_relation_greater;
92 code |= (less ? ir_relation_greater : 0) | (greater ? ir_relation_less : 0);
97 * Indicates, whether additional data can be registered to ir nodes.
98 * If set to 1, this is not possible anymore.
100 static int forbid_new_data = 0;
102 unsigned firm_add_node_size = 0;
105 unsigned firm_register_additional_node_data(unsigned size)
107 assert(!forbid_new_data && "Too late to register additional node data");
112 return firm_add_node_size += size;
116 void init_irnode(void)
118 /* Forbid the addition of new data to an ir node. */
122 struct struct_align {
131 ir_node *new_ir_node(dbg_info *db, ir_graph *irg, ir_node *block, ir_op *op,
132 ir_mode *mode, int arity, ir_node *const *in)
135 unsigned align = offsetof(struct struct_align, s) - 1;
136 unsigned add_node_size = (firm_add_node_size + align) & ~align;
137 size_t node_size = offsetof(ir_node, attr) + op->attr_size + add_node_size;
144 p = (char*)obstack_alloc(irg->obst, node_size);
145 memset(p, 0, node_size);
146 res = (ir_node *)(p + add_node_size);
148 res->kind = k_ir_node;
152 res->node_idx = irg_register_node_idx(irg, res);
157 res->in = NEW_ARR_F(ir_node *, 1); /* 1: space for block */
159 /* not nice but necessary: End and Sync must always have a flexible array */
160 if (op == op_End || op == op_Sync)
161 res->in = NEW_ARR_F(ir_node *, (arity+1));
163 res->in = NEW_ARR_D(ir_node *, irg->obst, (arity+1));
164 memcpy(&res->in[1], in, sizeof(ir_node *) * arity);
168 set_irn_dbg_info(res, db);
170 res->node_nr = get_irp_new_node_nr();
172 for (i = 0; i < EDGE_KIND_LAST; ++i) {
173 INIT_LIST_HEAD(&res->edge_info[i].outs_head);
174 /* edges will be build immediately */
175 res->edge_info[i].edges_built = 1;
176 res->edge_info[i].out_count = 0;
179 /* don't put this into the for loop, arity is -1 for some nodes! */
180 edges_notify_edge(res, -1, res->in[0], NULL, irg);
181 for (i = 1; i <= arity; ++i)
182 edges_notify_edge(res, i - 1, res->in[i], NULL, irg);
184 hook_new_node(irg, res);
185 if (get_irg_phase_state(irg) == phase_backend) {
186 be_info_new_node(irg, res);
192 int (is_ir_node)(const void *thing)
194 return is_ir_node_(thing);
197 int (get_irn_arity)(const ir_node *node)
199 return get_irn_arity_(node);
202 ir_node **get_irn_in(const ir_node *node)
207 void set_irn_in(ir_node *node, int arity, ir_node **in)
211 ir_graph *irg = get_irn_irg(node);
216 assert(node != NULL && node->kind == k_ir_node);
218 for (i = 0; i < arity; ++i) {
219 assert(in[i] != NULL && in[0]->kind == k_ir_node);
223 for (i = 0; i < arity; i++) {
224 if (i < (int)ARR_LEN(*pOld_in)-1)
225 edges_notify_edge(node, i, in[i], (*pOld_in)[i+1], irg);
227 edges_notify_edge(node, i, in[i], NULL, irg);
229 for (;i < (int)ARR_LEN(*pOld_in)-1; i++) {
230 edges_notify_edge(node, i, NULL, (*pOld_in)[i+1], irg);
233 if (arity != (int)ARR_LEN(*pOld_in) - 1) {
234 ir_node * block = (*pOld_in)[0];
235 *pOld_in = NEW_ARR_D(ir_node *, irg->obst, arity + 1);
236 (*pOld_in)[0] = block;
238 fix_backedges(irg->obst, node);
240 memcpy((*pOld_in) + 1, in, sizeof(ir_node *) * arity);
242 /* update irg flags */
243 clear_irg_state(irg, IR_GRAPH_STATE_CONSISTENT_OUTS | IR_GRAPH_STATE_CONSISTENT_LOOPINFO);
246 ir_node *(get_irn_n)(const ir_node *node, int n)
248 return get_irn_n_(node, n);
251 void set_irn_n(ir_node *node, int n, ir_node *in)
253 ir_graph *irg = get_irn_irg(node);
254 assert(node && node->kind == k_ir_node);
256 assert(n < get_irn_arity(node));
257 assert(in && in->kind == k_ir_node);
260 hook_set_irn_n(node, n, in, node->in[n + 1]);
262 /* Here, we rely on src and tgt being in the current ir graph */
263 edges_notify_edge(node, n, in, node->in[n + 1], irg);
265 node->in[n + 1] = in;
267 /* update irg flags */
268 clear_irg_state(irg, IR_GRAPH_STATE_CONSISTENT_OUTS | IR_GRAPH_STATE_CONSISTENT_LOOPINFO);
271 int add_irn_n(ir_node *node, ir_node *in)
274 ir_graph *irg = get_irn_irg(node);
276 assert(node->op->opar == oparity_dynamic);
277 pos = ARR_LEN(node->in) - 1;
278 ARR_APP1(ir_node *, node->in, in);
279 edges_notify_edge(node, pos, node->in[pos + 1], NULL, irg);
282 hook_set_irn_n(node, pos, node->in[pos + 1], NULL);
287 void del_Sync_n(ir_node *n, int i)
289 int arity = get_Sync_n_preds(n);
290 ir_node *last_pred = get_Sync_pred(n, arity - 1);
291 set_Sync_pred(n, i, last_pred);
292 edges_notify_edge(n, arity - 1, NULL, last_pred, get_irn_irg(n));
293 ARR_SHRINKLEN(get_irn_in(n), arity);
296 int (get_irn_deps)(const ir_node *node)
298 return get_irn_deps_(node);
301 ir_node *(get_irn_dep)(const ir_node *node, int pos)
303 return get_irn_dep_(node, pos);
306 void (set_irn_dep)(ir_node *node, int pos, ir_node *dep)
308 set_irn_dep_(node, pos, dep);
311 int add_irn_dep(ir_node *node, ir_node *dep)
315 /* DEP edges are only allowed in backend phase */
316 assert(get_irg_phase_state(get_irn_irg(node)) == phase_backend);
317 if (node->deps == NULL) {
318 node->deps = NEW_ARR_F(ir_node *, 1);
324 for (i = 0, n = ARR_LEN(node->deps); i < n; ++i) {
325 if (node->deps[i] == NULL)
328 if (node->deps[i] == dep)
332 if (first_zero >= 0) {
333 node->deps[first_zero] = dep;
336 ARR_APP1(ir_node *, node->deps, dep);
341 edges_notify_edge_kind(node, res, dep, NULL, EDGE_KIND_DEP, get_irn_irg(node));
346 void add_irn_deps(ir_node *tgt, ir_node *src)
350 for (i = 0, n = get_irn_deps(src); i < n; ++i)
351 add_irn_dep(tgt, get_irn_dep(src, i));
355 ir_mode *(get_irn_mode)(const ir_node *node)
357 return get_irn_mode_(node);
360 void (set_irn_mode)(ir_node *node, ir_mode *mode)
362 set_irn_mode_(node, mode);
365 ir_op *(get_irn_op)(const ir_node *node)
367 return get_irn_op_(node);
370 void (set_irn_op)(ir_node *node, ir_op *op)
372 set_irn_op_(node, op);
375 unsigned (get_irn_opcode)(const ir_node *node)
377 return get_irn_opcode_(node);
380 const char *get_irn_opname(const ir_node *node)
382 return get_id_str(node->op->name);
385 ident *get_irn_opident(const ir_node *node)
388 return node->op->name;
391 ir_visited_t (get_irn_visited)(const ir_node *node)
393 return get_irn_visited_(node);
396 void (set_irn_visited)(ir_node *node, ir_visited_t visited)
398 set_irn_visited_(node, visited);
401 void (mark_irn_visited)(ir_node *node)
403 mark_irn_visited_(node);
406 int (irn_visited)(const ir_node *node)
408 return irn_visited_(node);
411 int (irn_visited_else_mark)(ir_node *node)
413 return irn_visited_else_mark_(node);
416 void (set_irn_link)(ir_node *node, void *link)
418 set_irn_link_(node, link);
421 void *(get_irn_link)(const ir_node *node)
423 return get_irn_link_(node);
426 op_pin_state (get_irn_pinned)(const ir_node *node)
428 return get_irn_pinned_(node);
431 op_pin_state (is_irn_pinned_in_irg) (const ir_node *node)
433 return is_irn_pinned_in_irg_(node);
436 void set_irn_pinned(ir_node *node, op_pin_state state)
438 /* due to optimization an opt may be turned into a Tuple */
442 assert(node && get_op_pinned(get_irn_op(node)) >= op_pin_state_exc_pinned);
443 assert(state == op_pin_state_pinned || state == op_pin_state_floats);
445 node->attr.except.pin_state = state;
448 long get_irn_node_nr(const ir_node *node)
451 return node->node_nr;
454 void *(get_irn_generic_attr)(ir_node *node)
456 assert(is_ir_node(node));
457 return get_irn_generic_attr_(node);
460 const void *(get_irn_generic_attr_const)(const ir_node *node)
462 assert(is_ir_node(node));
463 return get_irn_generic_attr_const_(node);
466 unsigned (get_irn_idx)(const ir_node *node)
468 assert(is_ir_node(node));
469 return get_irn_idx_(node);
472 int get_irn_pred_pos(ir_node *node, ir_node *arg)
475 for (i = get_irn_arity(node) - 1; i >= 0; i--) {
476 if (get_irn_n(node, i) == arg)
482 ir_node *(get_nodes_block)(const ir_node *node)
484 return get_nodes_block_(node);
487 void set_nodes_block(ir_node *node, ir_node *block)
489 assert(node->op != op_Block);
490 set_irn_n(node, -1, block);
493 ir_type *is_frame_pointer(const ir_node *n)
495 if (is_Proj(n) && (get_Proj_proj(n) == pn_Start_P_frame_base)) {
496 ir_node *start = get_Proj_pred(n);
497 if (is_Start(start)) {
498 return get_irg_frame_type(get_irn_irg(start));
504 ir_node **get_Block_cfgpred_arr(ir_node *node)
506 assert(is_Block(node));
507 return (ir_node **)&(get_irn_in(node)[1]);
510 int (get_Block_n_cfgpreds)(const ir_node *node)
512 return get_Block_n_cfgpreds_(node);
515 ir_node *(get_Block_cfgpred)(const ir_node *node, int pos)
517 return get_Block_cfgpred_(node, pos);
520 void set_Block_cfgpred(ir_node *node, int pos, ir_node *pred)
522 assert(is_Block(node));
523 set_irn_n(node, pos, pred);
526 int get_Block_cfgpred_pos(const ir_node *block, const ir_node *pred)
530 for (i = get_Block_n_cfgpreds(block) - 1; i >= 0; --i) {
531 if (get_Block_cfgpred_block(block, i) == pred)
537 ir_node *(get_Block_cfgpred_block)(const ir_node *node, int pos)
539 return get_Block_cfgpred_block_(node, pos);
542 int get_Block_matured(const ir_node *node)
544 assert(is_Block(node));
545 return (int)node->attr.block.is_matured;
548 void set_Block_matured(ir_node *node, int matured)
550 assert(is_Block(node));
551 node->attr.block.is_matured = matured;
554 ir_visited_t (get_Block_block_visited)(const ir_node *node)
556 return get_Block_block_visited_(node);
559 void (set_Block_block_visited)(ir_node *node, ir_visited_t visit)
561 set_Block_block_visited_(node, visit);
564 void (mark_Block_block_visited)(ir_node *node)
566 mark_Block_block_visited_(node);
569 int (Block_block_visited)(const ir_node *node)
571 return Block_block_visited_(node);
574 ir_graph *(get_Block_irg)(const ir_node *block)
576 return get_Block_irg_(block);
579 ir_entity *create_Block_entity(ir_node *block)
582 assert(is_Block(block));
584 entity = block->attr.block.entity;
585 if (entity == NULL) {
586 ir_label_t nr = get_irp_next_label_nr();
587 entity = new_label_entity(nr);
588 set_entity_visibility(entity, ir_visibility_local);
589 set_entity_linkage(entity, IR_LINKAGE_CONSTANT);
590 set_entity_compiler_generated(entity, 1);
592 block->attr.block.entity = entity;
597 ir_node *(get_Block_phis)(const ir_node *block)
599 return get_Block_phis_(block);
602 void (set_Block_phis)(ir_node *block, ir_node *phi)
604 set_Block_phis_(block, phi);
607 void (add_Block_phi)(ir_node *block, ir_node *phi)
609 add_Block_phi_(block, phi);
612 unsigned (get_Block_mark)(const ir_node *block)
614 return get_Block_mark_(block);
617 void (set_Block_mark)(ir_node *block, unsigned mark)
619 set_Block_mark_(block, mark);
622 int get_End_n_keepalives(const ir_node *end)
625 return (get_irn_arity(end) - END_KEEPALIVE_OFFSET);
628 ir_node *get_End_keepalive(const ir_node *end, int pos)
631 return get_irn_n(end, pos + END_KEEPALIVE_OFFSET);
634 void add_End_keepalive(ir_node *end, ir_node *ka)
640 void set_End_keepalive(ir_node *end, int pos, ir_node *ka)
643 set_irn_n(end, pos + END_KEEPALIVE_OFFSET, ka);
646 void set_End_keepalives(ir_node *end, int n, ir_node *in[])
650 ir_graph *irg = get_irn_irg(end);
652 /* notify that edges are deleted */
653 for (e = END_KEEPALIVE_OFFSET; e < ARR_LEN(end->in) - 1; ++e) {
654 edges_notify_edge(end, e, NULL, end->in[e + 1], irg);
656 ARR_RESIZE(ir_node *, end->in, n + 1 + END_KEEPALIVE_OFFSET);
658 for (i = 0; i < n; ++i) {
659 end->in[1 + END_KEEPALIVE_OFFSET + i] = in[i];
660 edges_notify_edge(end, END_KEEPALIVE_OFFSET + i, end->in[1 + END_KEEPALIVE_OFFSET + i], NULL, irg);
663 /* update irg flags */
664 clear_irg_state(irg, IR_GRAPH_STATE_CONSISTENT_OUTS);
667 void remove_End_keepalive(ir_node *end, ir_node *irn)
669 int n = get_End_n_keepalives(end);
674 for (i = n -1; i >= 0; --i) {
675 ir_node *old_ka = end->in[1 + END_KEEPALIVE_OFFSET + i];
685 irg = get_irn_irg(end);
687 /* remove the edge */
688 edges_notify_edge(end, idx, NULL, irn, irg);
691 /* exchange with the last one */
692 ir_node *old = end->in[1 + END_KEEPALIVE_OFFSET + n - 1];
693 edges_notify_edge(end, n - 1, NULL, old, irg);
694 end->in[1 + END_KEEPALIVE_OFFSET + idx] = old;
695 edges_notify_edge(end, idx, old, NULL, irg);
697 /* now n - 1 keeps, 1 block input */
698 ARR_RESIZE(ir_node *, end->in, (n - 1) + 1 + END_KEEPALIVE_OFFSET);
700 /* update irg flags */
701 clear_irg_state(irg, IR_GRAPH_STATE_CONSISTENT_OUTS);
704 void remove_End_Bads_and_doublets(ir_node *end)
707 int idx, n = get_End_n_keepalives(end);
709 bool changed = false;
714 irg = get_irn_irg(end);
715 pset_new_init(&keeps);
717 for (idx = n - 1; idx >= 0; --idx) {
718 ir_node *ka = get_End_keepalive(end, idx);
720 if (is_Bad(ka) || is_NoMem(ka) || pset_new_contains(&keeps, ka)) {
722 /* remove the edge */
723 edges_notify_edge(end, idx, NULL, ka, irg);
726 /* exchange with the last one */
727 ir_node *old = end->in[1 + END_KEEPALIVE_OFFSET + n - 1];
728 edges_notify_edge(end, n - 1, NULL, old, irg);
729 end->in[1 + END_KEEPALIVE_OFFSET + idx] = old;
730 edges_notify_edge(end, idx, old, NULL, irg);
734 pset_new_insert(&keeps, ka);
737 /* n keeps, 1 block input */
738 ARR_RESIZE(ir_node *, end->in, n + 1 + END_KEEPALIVE_OFFSET);
740 pset_new_destroy(&keeps);
743 clear_irg_state(irg, IR_GRAPH_STATE_CONSISTENT_OUTS);
747 void free_End(ir_node *end)
752 end->in = NULL; /* @@@ make sure we get an error if we use the
753 in array afterwards ... */
756 size_t get_Return_n_ress(const ir_node *node)
758 assert(is_Return(node));
759 return (size_t)(get_irn_arity(node) - RETURN_RESULT_OFFSET);
762 ir_node **get_Return_res_arr(ir_node *node)
764 assert(is_Return(node));
765 if (get_Return_n_ress(node) > 0)
766 return (ir_node **)&(get_irn_in(node)[1 + RETURN_RESULT_OFFSET]);
771 ir_node *get_Return_res(const ir_node *node, int pos)
773 assert(is_Return(node));
775 assert(get_Return_n_ress(node) > (size_t)pos);
776 return get_irn_n(node, pos + RETURN_RESULT_OFFSET);
779 void set_Return_res(ir_node *node, int pos, ir_node *res)
781 assert(is_Return(node));
782 set_irn_n(node, pos + RETURN_RESULT_OFFSET, res);
785 int (is_Const_null)(const ir_node *node)
787 return is_Const_null_(node);
790 int (is_Const_one)(const ir_node *node)
792 return is_Const_one_(node);
795 int (is_Const_all_one)(const ir_node *node)
797 return is_Const_all_one_(node);
802 symconst_kind get_SymConst_kind(const ir_node *node)
804 assert(is_SymConst(node));
805 return node->attr.symc.kind;
808 void set_SymConst_kind(ir_node *node, symconst_kind kind)
810 assert(is_SymConst(node));
811 node->attr.symc.kind = kind;
814 ir_type *get_SymConst_type(const ir_node *node)
816 /* the cast here is annoying, but we have to compensate for
818 ir_node *irn = (ir_node *)node;
819 assert(is_SymConst(node) &&
820 (SYMCONST_HAS_TYPE(get_SymConst_kind(node))));
821 return irn->attr.symc.sym.type_p;
824 void set_SymConst_type(ir_node *node, ir_type *tp)
826 assert(is_SymConst(node) &&
827 (SYMCONST_HAS_TYPE(get_SymConst_kind(node))));
828 node->attr.symc.sym.type_p = tp;
831 ir_entity *get_SymConst_entity(const ir_node *node)
833 assert(is_SymConst(node) && SYMCONST_HAS_ENT(get_SymConst_kind(node)));
834 return node->attr.symc.sym.entity_p;
837 void set_SymConst_entity(ir_node *node, ir_entity *ent)
839 assert(is_SymConst(node) && SYMCONST_HAS_ENT(get_SymConst_kind(node)));
840 node->attr.symc.sym.entity_p = ent;
843 ir_enum_const *get_SymConst_enum(const ir_node *node)
845 assert(is_SymConst(node) && SYMCONST_HAS_ENUM(get_SymConst_kind(node)));
846 return node->attr.symc.sym.enum_p;
849 void set_SymConst_enum(ir_node *node, ir_enum_const *ec)
851 assert(is_SymConst(node) && SYMCONST_HAS_ENUM(get_SymConst_kind(node)));
852 node->attr.symc.sym.enum_p = ec;
855 union symconst_symbol
856 get_SymConst_symbol(const ir_node *node)
858 assert(is_SymConst(node));
859 return node->attr.symc.sym;
862 void set_SymConst_symbol(ir_node *node, union symconst_symbol sym)
864 assert(is_SymConst(node));
865 node->attr.symc.sym = sym;
868 int get_Sel_n_indexs(const ir_node *node)
870 assert(is_Sel(node));
871 return (get_irn_arity(node) - SEL_INDEX_OFFSET);
874 ir_node **get_Sel_index_arr(ir_node *node)
876 assert(is_Sel(node));
877 if (get_Sel_n_indexs(node) > 0)
878 return (ir_node **)& get_irn_in(node)[SEL_INDEX_OFFSET + 1];
883 ir_node *get_Sel_index(const ir_node *node, int pos)
885 assert(is_Sel(node));
886 return get_irn_n(node, pos + SEL_INDEX_OFFSET);
889 void set_Sel_index(ir_node *node, int pos, ir_node *index)
891 assert(is_Sel(node));
892 set_irn_n(node, pos + SEL_INDEX_OFFSET, index);
895 ir_node **get_Call_param_arr(ir_node *node)
897 assert(is_Call(node));
898 return &get_irn_in(node)[CALL_PARAM_OFFSET + 1];
901 size_t get_Call_n_params(const ir_node *node)
903 assert(is_Call(node));
904 return (size_t) (get_irn_arity(node) - CALL_PARAM_OFFSET);
907 ir_node *get_Call_param(const ir_node *node, int pos)
909 assert(is_Call(node));
910 return get_irn_n(node, pos + CALL_PARAM_OFFSET);
913 void set_Call_param(ir_node *node, int pos, ir_node *param)
915 assert(is_Call(node));
916 set_irn_n(node, pos + CALL_PARAM_OFFSET, param);
919 ir_node **get_Builtin_param_arr(ir_node *node)
921 assert(is_Builtin(node));
922 return &get_irn_in(node)[BUILTIN_PARAM_OFFSET + 1];
925 int get_Builtin_n_params(const ir_node *node)
927 assert(is_Builtin(node));
928 return (get_irn_arity(node) - BUILTIN_PARAM_OFFSET);
931 ir_node *get_Builtin_param(const ir_node *node, int pos)
933 assert(is_Builtin(node));
934 return get_irn_n(node, pos + BUILTIN_PARAM_OFFSET);
937 void set_Builtin_param(ir_node *node, int pos, ir_node *param)
939 assert(is_Builtin(node));
940 set_irn_n(node, pos + BUILTIN_PARAM_OFFSET, param);
943 const char *get_builtin_kind_name(ir_builtin_kind kind)
945 #define X(a) case a: return #a
949 X(ir_bk_return_address);
950 X(ir_bk_frame_address);
960 X(ir_bk_inner_trampoline);
967 int Call_has_callees(const ir_node *node)
969 assert(is_Call(node));
970 return ((get_irg_callee_info_state(get_irn_irg(node)) != irg_callee_info_none) &&
971 (node->attr.call.callee_arr != NULL));
974 size_t get_Call_n_callees(const ir_node *node)
976 assert(is_Call(node) && node->attr.call.callee_arr);
977 return ARR_LEN(node->attr.call.callee_arr);
980 ir_entity *get_Call_callee(const ir_node *node, size_t pos)
982 assert(pos < get_Call_n_callees(node));
983 return node->attr.call.callee_arr[pos];
986 void set_Call_callee_arr(ir_node *node, size_t n, ir_entity ** arr)
988 ir_graph *irg = get_irn_irg(node);
990 assert(is_Call(node));
991 if (node->attr.call.callee_arr == NULL || get_Call_n_callees(node) != n) {
992 node->attr.call.callee_arr = NEW_ARR_D(ir_entity *, irg->obst, n);
994 memcpy(node->attr.call.callee_arr, arr, n * sizeof(ir_entity *));
997 void remove_Call_callee_arr(ir_node *node)
999 assert(is_Call(node));
1000 node->attr.call.callee_arr = NULL;
1003 int is_Cast_upcast(ir_node *node)
1005 ir_type *totype = get_Cast_type(node);
1006 ir_type *fromtype = get_irn_typeinfo_type(get_Cast_op(node));
1008 assert(get_irg_typeinfo_state(get_irn_irg(node)) == ir_typeinfo_consistent);
1011 while (is_Pointer_type(totype) && is_Pointer_type(fromtype)) {
1012 totype = get_pointer_points_to_type(totype);
1013 fromtype = get_pointer_points_to_type(fromtype);
1018 if (!is_Class_type(totype)) return 0;
1019 return is_SubClass_of(fromtype, totype);
1022 int is_Cast_downcast(ir_node *node)
1024 ir_type *totype = get_Cast_type(node);
1025 ir_type *fromtype = get_irn_typeinfo_type(get_Cast_op(node));
1027 assert(get_irg_typeinfo_state(get_irn_irg(node)) == ir_typeinfo_consistent);
1030 while (is_Pointer_type(totype) && is_Pointer_type(fromtype)) {
1031 totype = get_pointer_points_to_type(totype);
1032 fromtype = get_pointer_points_to_type(fromtype);
1037 if (!is_Class_type(totype)) return 0;
1038 return is_SubClass_of(totype, fromtype);
1041 int (is_unop)(const ir_node *node)
1043 return is_unop_(node);
1046 ir_node *get_unop_op(const ir_node *node)
1048 if (node->op->opar == oparity_unary)
1049 return get_irn_n(node, node->op->op_index);
1051 assert(node->op->opar == oparity_unary);
1055 void set_unop_op(ir_node *node, ir_node *op)
1057 if (node->op->opar == oparity_unary)
1058 set_irn_n(node, node->op->op_index, op);
1060 assert(node->op->opar == oparity_unary);
1063 int (is_binop)(const ir_node *node)
1065 return is_binop_(node);
1068 ir_node *get_binop_left(const ir_node *node)
1070 assert(node->op->opar == oparity_binary);
1071 return get_irn_n(node, node->op->op_index);
1074 void set_binop_left(ir_node *node, ir_node *left)
1076 assert(node->op->opar == oparity_binary);
1077 set_irn_n(node, node->op->op_index, left);
1080 ir_node *get_binop_right(const ir_node *node)
1082 assert(node->op->opar == oparity_binary);
1083 return get_irn_n(node, node->op->op_index + 1);
1086 void set_binop_right(ir_node *node, ir_node *right)
1088 assert(node->op->opar == oparity_binary);
1089 set_irn_n(node, node->op->op_index + 1, right);
1092 ir_node **get_Phi_preds_arr(ir_node *node)
1094 assert(is_Phi(node));
1095 return (ir_node **)&(get_irn_in(node)[1]);
1098 int get_Phi_n_preds(const ir_node *node)
1100 assert(is_Phi(node));
1101 return get_irn_arity(node);
1104 ir_node *get_Phi_pred(const ir_node *node, int pos)
1106 assert(is_Phi(node));
1107 return get_irn_n(node, pos);
1110 void set_Phi_pred(ir_node *node, int pos, ir_node *pred)
1112 assert(is_Phi(node));
1113 set_irn_n(node, pos, pred);
1116 ir_node *(get_Phi_next)(const ir_node *phi)
1118 return get_Phi_next_(phi);
1121 void (set_Phi_next)(ir_node *phi, ir_node *next)
1123 set_Phi_next_(phi, next);
1126 int is_memop(const ir_node *node)
1128 return is_op_uses_memory(get_irn_op(node));
1131 ir_node *get_memop_mem(const ir_node *node)
1133 const ir_op *op = get_irn_op(node);
1134 assert(is_memop(node));
1135 return get_irn_n(node, op->memory_index);
1138 void set_memop_mem(ir_node *node, ir_node *mem)
1140 const ir_op *op = get_irn_op(node);
1141 assert(is_memop(node));
1142 set_irn_n(node, op->memory_index, mem);
1145 ir_node **get_Sync_preds_arr(ir_node *node)
1147 assert(is_Sync(node));
1148 return (ir_node **)&(get_irn_in(node)[1]);
1151 int get_Sync_n_preds(const ir_node *node)
1153 assert(is_Sync(node));
1154 return (get_irn_arity(node));
1157 ir_node *get_Sync_pred(const ir_node *node, int pos)
1159 assert(is_Sync(node));
1160 return get_irn_n(node, pos);
1163 void set_Sync_pred(ir_node *node, int pos, ir_node *pred)
1165 assert(is_Sync(node));
1166 set_irn_n(node, pos, pred);
1169 void add_Sync_pred(ir_node *node, ir_node *pred)
1171 assert(is_Sync(node));
1172 add_irn_n(node, pred);
1175 int (is_arg_Proj)(const ir_node *node)
1177 return is_arg_Proj_(node);
1180 int is_x_except_Proj(const ir_node *node)
1185 pred = get_Proj_pred(node);
1186 if (!is_fragile_op(pred))
1188 return get_Proj_proj(node) == pred->op->pn_x_except;
1191 int is_x_regular_Proj(const ir_node *node)
1196 pred = get_Proj_pred(node);
1197 if (!is_fragile_op(pred))
1199 return get_Proj_proj(node) == pred->op->pn_x_regular;
1202 void ir_set_throws_exception(ir_node *node, int throws_exception)
1204 except_attr *attr = &node->attr.except;
1205 assert(is_fragile_op(node));
1206 attr->throws_exception = throws_exception;
1209 int ir_throws_exception(const ir_node *node)
1211 const except_attr *attr = &node->attr.except;
1212 assert(is_fragile_op(node));
1213 return attr->throws_exception;
1216 ir_node **get_Tuple_preds_arr(ir_node *node)
1218 assert(is_Tuple(node));
1219 return (ir_node **)&(get_irn_in(node)[1]);
1222 int get_Tuple_n_preds(const ir_node *node)
1224 assert(is_Tuple(node));
1225 return get_irn_arity(node);
1228 ir_node *get_Tuple_pred(const ir_node *node, int pos)
1230 assert(is_Tuple(node));
1231 return get_irn_n(node, pos);
1234 void set_Tuple_pred(ir_node *node, int pos, ir_node *pred)
1236 assert(is_Tuple(node));
1237 set_irn_n(node, pos, pred);
1240 size_t get_ASM_n_input_constraints(const ir_node *node)
1242 assert(is_ASM(node));
1243 return ARR_LEN(node->attr.assem.input_constraints);
1246 size_t get_ASM_n_output_constraints(const ir_node *node)
1248 assert(is_ASM(node));
1249 return ARR_LEN(node->attr.assem.output_constraints);
1252 size_t get_ASM_n_clobbers(const ir_node *node)
1254 assert(is_ASM(node));
1255 return ARR_LEN(node->attr.assem.clobbers);
1258 ir_graph *(get_irn_irg)(const ir_node *node)
1260 return get_irn_irg_(node);
1263 ir_node *skip_Proj(ir_node *node)
1265 /* don't assert node !!! */
1270 node = get_Proj_pred(node);
1276 skip_Proj_const(const ir_node *node)
1278 /* don't assert node !!! */
1283 node = get_Proj_pred(node);
1288 ir_node *skip_Tuple(ir_node *node)
1293 if (is_Proj(node)) {
1294 pred = get_Proj_pred(node);
1296 if (is_Proj(pred)) { /* nested Tuple ? */
1297 pred = skip_Tuple(pred);
1299 if (is_Tuple(pred)) {
1300 node = get_Tuple_pred(pred, get_Proj_proj(node));
1303 } else if (is_Tuple(pred)) {
1304 node = get_Tuple_pred(pred, get_Proj_proj(node));
1311 ir_node *skip_Cast(ir_node *node)
1314 return get_Cast_op(node);
1318 const ir_node *skip_Cast_const(const ir_node *node)
1321 return get_Cast_op(node);
1325 ir_node *skip_Pin(ir_node *node)
1328 return get_Pin_op(node);
1332 ir_node *skip_Confirm(ir_node *node)
1334 if (is_Confirm(node))
1335 return get_Confirm_value(node);
1339 ir_node *skip_HighLevel_ops(ir_node *node)
1341 while (is_op_highlevel(get_irn_op(node))) {
1342 node = get_irn_n(node, 0);
1348 ir_node *skip_Id(ir_node *node)
1350 /* This should compact Id-cycles to self-cycles. It has the same (or less?) complexity
1351 * than any other approach, as Id chains are resolved and all point to the real node, or
1352 * all id's are self loops.
1354 * Note: This function takes 10% of mostly ANY the compiler run, so it's
1355 * a little bit "hand optimized".
1358 /* don't assert node !!! */
1360 if (!node || (node->op != op_Id)) return node;
1362 /* Don't use get_Id_pred(): We get into an endless loop for
1363 self-referencing Ids. */
1364 pred = node->in[0+1];
1366 if (pred->op != op_Id) return pred;
1368 if (node != pred) { /* not a self referencing Id. Resolve Id chain. */
1369 ir_node *rem_pred, *res;
1371 if (pred->op != op_Id) return pred; /* shortcut */
1374 assert(get_irn_arity (node) > 0);
1376 node->in[0+1] = node; /* turn us into a self referencing Id: shorten Id cycles. */
1377 res = skip_Id(rem_pred);
1378 if (is_Id(res)) /* self-loop */ return node;
1380 node->in[0+1] = res; /* Turn Id chain into Ids all referencing the chain end. */
1387 int (is_strictConv)(const ir_node *node)
1389 return is_strictConv_(node);
1392 int (is_SymConst_addr_ent)(const ir_node *node)
1394 return is_SymConst_addr_ent_(node);
1397 int is_cfop(const ir_node *node)
1399 if (is_fragile_op(node) && ir_throws_exception(node))
1402 return is_op_cfopcode(get_irn_op(node));
1405 int is_unknown_jump(const ir_node *node)
1407 return is_op_unknown_jump(get_irn_op(node));
1410 int is_fragile_op(const ir_node *node)
1412 return is_op_fragile(get_irn_op(node));
1415 int (is_irn_forking)(const ir_node *node)
1417 return is_irn_forking_(node);
1420 void (copy_node_attr)(ir_graph *irg, const ir_node *old_node, ir_node *new_node)
1422 copy_node_attr_(irg, old_node, new_node);
1425 ir_type *(get_irn_type_attr)(ir_node *node)
1427 return get_irn_type_attr_(node);
1430 ir_entity *(get_irn_entity_attr)(ir_node *node)
1432 return get_irn_entity_attr_(node);
1435 int (is_irn_constlike)(const ir_node *node)
1437 return is_irn_constlike_(node);
1440 int (is_irn_keep)(const ir_node *node)
1442 return is_irn_keep_(node);
1445 int (is_irn_start_block_placed)(const ir_node *node)
1447 return is_irn_start_block_placed_(node);
1450 int (is_irn_cse_neutral)(const ir_node *node)
1452 return is_irn_cse_neutral_(node);
1455 const char *get_cond_jmp_predicate_name(cond_jmp_predicate pred)
1457 #define X(a) case a: return #a
1459 X(COND_JMP_PRED_NONE);
1460 X(COND_JMP_PRED_TRUE);
1461 X(COND_JMP_PRED_FALSE);
1467 /** Return the attribute type of a SymConst node if exists */
1468 static ir_type *get_SymConst_attr_type(const ir_node *self)
1470 symconst_kind kind = get_SymConst_kind(self);
1471 if (SYMCONST_HAS_TYPE(kind))
1472 return get_SymConst_type(self);
1476 /** Return the attribute entity of a SymConst node if exists */
1477 static ir_entity *get_SymConst_attr_entity(const ir_node *self)
1479 symconst_kind kind = get_SymConst_kind(self);
1480 if (SYMCONST_HAS_ENT(kind))
1481 return get_SymConst_entity(self);
1485 /** the get_type_attr operation must be always implemented */
1486 static ir_type *get_Null_type(const ir_node *n)
1489 return get_unknown_type();
1492 void firm_set_default_get_type_attr(unsigned code, ir_op_ops *ops)
1495 case iro_Alloc: ops->get_type_attr = get_Alloc_type; break;
1496 case iro_Builtin: ops->get_type_attr = get_Builtin_type; break;
1497 case iro_Call: ops->get_type_attr = get_Call_type; break;
1498 case iro_Cast: ops->get_type_attr = get_Cast_type; break;
1499 case iro_CopyB: ops->get_type_attr = get_CopyB_type; break;
1500 case iro_Free: ops->get_type_attr = get_Free_type; break;
1501 case iro_InstOf: ops->get_type_attr = get_InstOf_type; break;
1502 case iro_SymConst: ops->get_type_attr = get_SymConst_attr_type; break;
1504 /* not allowed to be NULL */
1505 if (! ops->get_type_attr)
1506 ops->get_type_attr = get_Null_type;
1511 /** the get_entity_attr operation must be always implemented */
1512 static ir_entity *get_Null_ent(const ir_node *n)
1518 void firm_set_default_get_entity_attr(unsigned code, ir_op_ops *ops)
1521 case iro_SymConst: ops->get_entity_attr = get_SymConst_attr_entity; break;
1522 case iro_Sel: ops->get_entity_attr = get_Sel_entity; break;
1523 case iro_Block: ops->get_entity_attr = get_Block_entity; break;
1525 /* not allowed to be NULL */
1526 if (! ops->get_entity_attr)
1527 ops->get_entity_attr = get_Null_ent;
1532 void (set_irn_dbg_info)(ir_node *n, dbg_info *db)
1534 set_irn_dbg_info_(n, db);
1537 dbg_info *(get_irn_dbg_info)(const ir_node *n)
1539 return get_irn_dbg_info_(n);
1542 ir_switch_table *ir_new_switch_table(ir_graph *irg, size_t n_entries)
1544 struct obstack *obst = get_irg_obstack(irg);
1545 ir_switch_table *res = OALLOCFZ(obst, ir_switch_table, entries, n_entries);
1546 res->n_entries = n_entries;
1550 void ir_switch_table_set(ir_switch_table *table, size_t n,
1551 ir_tarval *min, ir_tarval *max, long pn)
1553 ir_switch_table_entry *entry = ir_switch_table_get_entry(table, n);
1559 size_t (ir_switch_table_get_n_entries)(const ir_switch_table *table)
1561 return ir_switch_table_get_n_entries_(table);
1564 ir_tarval *ir_switch_table_get_max(const ir_switch_table *table, size_t e)
1566 return ir_switch_table_get_entry_const(table, e)->max;
1569 ir_tarval *ir_switch_table_get_min(const ir_switch_table *table, size_t e)
1571 return ir_switch_table_get_entry_const(table, e)->min;
1574 long ir_switch_table_get_pn(const ir_switch_table *table, size_t e)
1576 return ir_switch_table_get_entry_const(table, e)->pn;
1579 ir_switch_table *ir_switch_table_duplicate(ir_graph *irg,
1580 const ir_switch_table *table)
1582 size_t n_entries = ir_switch_table_get_n_entries(table);
1584 ir_switch_table *res = ir_new_switch_table(irg, n_entries);
1585 for (e = 0; e < n_entries; ++e) {
1586 const ir_switch_table_entry *entry
1587 = ir_switch_table_get_entry_const(table, e);
1588 ir_switch_table_entry *new_entry = ir_switch_table_get_entry(res, e);
1589 *new_entry = *entry;
1594 unsigned firm_default_hash(const ir_node *node)
1599 /* hash table value = 9*(9*(9*(9*(9*arity+in[0])+in[1])+ ...)+mode)+code */
1600 h = irn_arity = get_irn_arity(node);
1602 /* consider all in nodes... except the block if not a control flow. */
1603 for (i = is_cfop(node) ? -1 : 0; i < irn_arity; ++i) {
1604 ir_node *pred = get_irn_n(node, i);
1605 if (is_irn_cse_neutral(pred))
1608 h = 9*h + hash_ptr(pred);
1612 h = 9*h + hash_ptr(get_irn_mode(node));
1614 h = 9*h + hash_ptr(get_irn_op(node));
1619 /* include generated code */
1620 #include "gen_irnode.c.inl"