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_extblk *get_Block_extbb(const ir_node *block)
577 assert(is_Block(block));
578 res = block->attr.block.extblk;
579 assert(res == NULL || is_ir_extbb(res));
583 void set_Block_extbb(ir_node *block, ir_extblk *extblk)
585 assert(is_Block(block));
586 assert(extblk == NULL || is_ir_extbb(extblk));
587 block->attr.block.extblk = extblk;
590 ir_graph *(get_Block_irg)(const ir_node *block)
592 return get_Block_irg_(block);
595 ir_entity *create_Block_entity(ir_node *block)
598 assert(is_Block(block));
600 entity = block->attr.block.entity;
601 if (entity == NULL) {
602 ir_label_t nr = get_irp_next_label_nr();
603 entity = new_label_entity(nr);
604 set_entity_visibility(entity, ir_visibility_local);
605 set_entity_linkage(entity, IR_LINKAGE_CONSTANT);
606 set_entity_compiler_generated(entity, 1);
608 block->attr.block.entity = entity;
613 ir_node *(get_Block_phis)(const ir_node *block)
615 return get_Block_phis_(block);
618 void (set_Block_phis)(ir_node *block, ir_node *phi)
620 set_Block_phis_(block, phi);
623 void (add_Block_phi)(ir_node *block, ir_node *phi)
625 add_Block_phi_(block, phi);
628 unsigned (get_Block_mark)(const ir_node *block)
630 return get_Block_mark_(block);
633 void (set_Block_mark)(ir_node *block, unsigned mark)
635 set_Block_mark_(block, mark);
638 int get_End_n_keepalives(const ir_node *end)
641 return (get_irn_arity(end) - END_KEEPALIVE_OFFSET);
644 ir_node *get_End_keepalive(const ir_node *end, int pos)
647 return get_irn_n(end, pos + END_KEEPALIVE_OFFSET);
650 void add_End_keepalive(ir_node *end, ir_node *ka)
656 void set_End_keepalive(ir_node *end, int pos, ir_node *ka)
659 set_irn_n(end, pos + END_KEEPALIVE_OFFSET, ka);
662 void set_End_keepalives(ir_node *end, int n, ir_node *in[])
666 ir_graph *irg = get_irn_irg(end);
668 /* notify that edges are deleted */
669 for (e = END_KEEPALIVE_OFFSET; e < ARR_LEN(end->in) - 1; ++e) {
670 edges_notify_edge(end, e, NULL, end->in[e + 1], irg);
672 ARR_RESIZE(ir_node *, end->in, n + 1 + END_KEEPALIVE_OFFSET);
674 for (i = 0; i < n; ++i) {
675 end->in[1 + END_KEEPALIVE_OFFSET + i] = in[i];
676 edges_notify_edge(end, END_KEEPALIVE_OFFSET + i, end->in[1 + END_KEEPALIVE_OFFSET + i], NULL, irg);
679 /* update irg flags */
680 clear_irg_state(irg, IR_GRAPH_STATE_CONSISTENT_OUTS);
683 void remove_End_keepalive(ir_node *end, ir_node *irn)
685 int n = get_End_n_keepalives(end);
690 for (i = n -1; i >= 0; --i) {
691 ir_node *old_ka = end->in[1 + END_KEEPALIVE_OFFSET + i];
701 irg = get_irn_irg(end);
703 /* remove the edge */
704 edges_notify_edge(end, idx, NULL, irn, irg);
707 /* exchange with the last one */
708 ir_node *old = end->in[1 + END_KEEPALIVE_OFFSET + n - 1];
709 edges_notify_edge(end, n - 1, NULL, old, irg);
710 end->in[1 + END_KEEPALIVE_OFFSET + idx] = old;
711 edges_notify_edge(end, idx, old, NULL, irg);
713 /* now n - 1 keeps, 1 block input */
714 ARR_RESIZE(ir_node *, end->in, (n - 1) + 1 + END_KEEPALIVE_OFFSET);
716 /* update irg flags */
717 clear_irg_state(irg, IR_GRAPH_STATE_CONSISTENT_OUTS);
720 void remove_End_Bads_and_doublets(ir_node *end)
723 int idx, n = get_End_n_keepalives(end);
725 bool changed = false;
730 irg = get_irn_irg(end);
731 pset_new_init(&keeps);
733 for (idx = n - 1; idx >= 0; --idx) {
734 ir_node *ka = get_End_keepalive(end, idx);
736 if (is_Bad(ka) || is_NoMem(ka) || pset_new_contains(&keeps, ka)) {
738 /* remove the edge */
739 edges_notify_edge(end, idx, NULL, ka, irg);
742 /* exchange with the last one */
743 ir_node *old = end->in[1 + END_KEEPALIVE_OFFSET + n - 1];
744 edges_notify_edge(end, n - 1, NULL, old, irg);
745 end->in[1 + END_KEEPALIVE_OFFSET + idx] = old;
746 edges_notify_edge(end, idx, old, NULL, irg);
750 pset_new_insert(&keeps, ka);
753 /* n keeps, 1 block input */
754 ARR_RESIZE(ir_node *, end->in, n + 1 + END_KEEPALIVE_OFFSET);
756 pset_new_destroy(&keeps);
759 clear_irg_state(irg, IR_GRAPH_STATE_CONSISTENT_OUTS);
763 void free_End(ir_node *end)
768 end->in = NULL; /* @@@ make sure we get an error if we use the
769 in array afterwards ... */
772 size_t get_Return_n_ress(const ir_node *node)
774 assert(is_Return(node));
775 return (size_t)(get_irn_arity(node) - RETURN_RESULT_OFFSET);
778 ir_node **get_Return_res_arr(ir_node *node)
780 assert(is_Return(node));
781 if (get_Return_n_ress(node) > 0)
782 return (ir_node **)&(get_irn_in(node)[1 + RETURN_RESULT_OFFSET]);
787 ir_node *get_Return_res(const ir_node *node, int pos)
789 assert(is_Return(node));
791 assert(get_Return_n_ress(node) > (size_t)pos);
792 return get_irn_n(node, pos + RETURN_RESULT_OFFSET);
795 void set_Return_res(ir_node *node, int pos, ir_node *res)
797 assert(is_Return(node));
798 set_irn_n(node, pos + RETURN_RESULT_OFFSET, res);
801 int (is_Const_null)(const ir_node *node)
803 return is_Const_null_(node);
806 int (is_Const_one)(const ir_node *node)
808 return is_Const_one_(node);
811 int (is_Const_all_one)(const ir_node *node)
813 return is_Const_all_one_(node);
818 symconst_kind get_SymConst_kind(const ir_node *node)
820 assert(is_SymConst(node));
821 return node->attr.symc.kind;
824 void set_SymConst_kind(ir_node *node, symconst_kind kind)
826 assert(is_SymConst(node));
827 node->attr.symc.kind = kind;
830 ir_type *get_SymConst_type(const ir_node *node)
832 /* the cast here is annoying, but we have to compensate for
834 ir_node *irn = (ir_node *)node;
835 assert(is_SymConst(node) &&
836 (SYMCONST_HAS_TYPE(get_SymConst_kind(node))));
837 return irn->attr.symc.sym.type_p;
840 void set_SymConst_type(ir_node *node, ir_type *tp)
842 assert(is_SymConst(node) &&
843 (SYMCONST_HAS_TYPE(get_SymConst_kind(node))));
844 node->attr.symc.sym.type_p = tp;
847 ir_entity *get_SymConst_entity(const ir_node *node)
849 assert(is_SymConst(node) && SYMCONST_HAS_ENT(get_SymConst_kind(node)));
850 return node->attr.symc.sym.entity_p;
853 void set_SymConst_entity(ir_node *node, ir_entity *ent)
855 assert(is_SymConst(node) && SYMCONST_HAS_ENT(get_SymConst_kind(node)));
856 node->attr.symc.sym.entity_p = ent;
859 ir_enum_const *get_SymConst_enum(const ir_node *node)
861 assert(is_SymConst(node) && SYMCONST_HAS_ENUM(get_SymConst_kind(node)));
862 return node->attr.symc.sym.enum_p;
865 void set_SymConst_enum(ir_node *node, ir_enum_const *ec)
867 assert(is_SymConst(node) && SYMCONST_HAS_ENUM(get_SymConst_kind(node)));
868 node->attr.symc.sym.enum_p = ec;
871 union symconst_symbol
872 get_SymConst_symbol(const ir_node *node)
874 assert(is_SymConst(node));
875 return node->attr.symc.sym;
878 void set_SymConst_symbol(ir_node *node, union symconst_symbol sym)
880 assert(is_SymConst(node));
881 node->attr.symc.sym = sym;
884 int get_Sel_n_indexs(const ir_node *node)
886 assert(is_Sel(node));
887 return (get_irn_arity(node) - SEL_INDEX_OFFSET);
890 ir_node **get_Sel_index_arr(ir_node *node)
892 assert(is_Sel(node));
893 if (get_Sel_n_indexs(node) > 0)
894 return (ir_node **)& get_irn_in(node)[SEL_INDEX_OFFSET + 1];
899 ir_node *get_Sel_index(const ir_node *node, int pos)
901 assert(is_Sel(node));
902 return get_irn_n(node, pos + SEL_INDEX_OFFSET);
905 void set_Sel_index(ir_node *node, int pos, ir_node *index)
907 assert(is_Sel(node));
908 set_irn_n(node, pos + SEL_INDEX_OFFSET, index);
911 ir_node **get_Call_param_arr(ir_node *node)
913 assert(is_Call(node));
914 return &get_irn_in(node)[CALL_PARAM_OFFSET + 1];
917 size_t get_Call_n_params(const ir_node *node)
919 assert(is_Call(node));
920 return (size_t) (get_irn_arity(node) - CALL_PARAM_OFFSET);
923 ir_node *get_Call_param(const ir_node *node, int pos)
925 assert(is_Call(node));
926 return get_irn_n(node, pos + CALL_PARAM_OFFSET);
929 void set_Call_param(ir_node *node, int pos, ir_node *param)
931 assert(is_Call(node));
932 set_irn_n(node, pos + CALL_PARAM_OFFSET, param);
935 ir_node **get_Builtin_param_arr(ir_node *node)
937 assert(is_Builtin(node));
938 return &get_irn_in(node)[BUILTIN_PARAM_OFFSET + 1];
941 int get_Builtin_n_params(const ir_node *node)
943 assert(is_Builtin(node));
944 return (get_irn_arity(node) - BUILTIN_PARAM_OFFSET);
947 ir_node *get_Builtin_param(const ir_node *node, int pos)
949 assert(is_Builtin(node));
950 return get_irn_n(node, pos + BUILTIN_PARAM_OFFSET);
953 void set_Builtin_param(ir_node *node, int pos, ir_node *param)
955 assert(is_Builtin(node));
956 set_irn_n(node, pos + BUILTIN_PARAM_OFFSET, param);
959 const char *get_builtin_kind_name(ir_builtin_kind kind)
961 #define X(a) case a: return #a
965 X(ir_bk_return_address);
966 X(ir_bk_frame_address);
976 X(ir_bk_inner_trampoline);
983 int Call_has_callees(const ir_node *node)
985 assert(is_Call(node));
986 return ((get_irg_callee_info_state(get_irn_irg(node)) != irg_callee_info_none) &&
987 (node->attr.call.callee_arr != NULL));
990 size_t get_Call_n_callees(const ir_node *node)
992 assert(is_Call(node) && node->attr.call.callee_arr);
993 return ARR_LEN(node->attr.call.callee_arr);
996 ir_entity *get_Call_callee(const ir_node *node, size_t pos)
998 assert(pos < get_Call_n_callees(node));
999 return node->attr.call.callee_arr[pos];
1002 void set_Call_callee_arr(ir_node *node, size_t n, ir_entity ** arr)
1004 ir_graph *irg = get_irn_irg(node);
1006 assert(is_Call(node));
1007 if (node->attr.call.callee_arr == NULL || get_Call_n_callees(node) != n) {
1008 node->attr.call.callee_arr = NEW_ARR_D(ir_entity *, irg->obst, n);
1010 memcpy(node->attr.call.callee_arr, arr, n * sizeof(ir_entity *));
1013 void remove_Call_callee_arr(ir_node *node)
1015 assert(is_Call(node));
1016 node->attr.call.callee_arr = NULL;
1019 int is_Cast_upcast(ir_node *node)
1021 ir_type *totype = get_Cast_type(node);
1022 ir_type *fromtype = get_irn_typeinfo_type(get_Cast_op(node));
1024 assert(get_irg_typeinfo_state(get_irn_irg(node)) == ir_typeinfo_consistent);
1027 while (is_Pointer_type(totype) && is_Pointer_type(fromtype)) {
1028 totype = get_pointer_points_to_type(totype);
1029 fromtype = get_pointer_points_to_type(fromtype);
1034 if (!is_Class_type(totype)) return 0;
1035 return is_SubClass_of(fromtype, totype);
1038 int is_Cast_downcast(ir_node *node)
1040 ir_type *totype = get_Cast_type(node);
1041 ir_type *fromtype = get_irn_typeinfo_type(get_Cast_op(node));
1043 assert(get_irg_typeinfo_state(get_irn_irg(node)) == ir_typeinfo_consistent);
1046 while (is_Pointer_type(totype) && is_Pointer_type(fromtype)) {
1047 totype = get_pointer_points_to_type(totype);
1048 fromtype = get_pointer_points_to_type(fromtype);
1053 if (!is_Class_type(totype)) return 0;
1054 return is_SubClass_of(totype, fromtype);
1057 int (is_unop)(const ir_node *node)
1059 return is_unop_(node);
1062 ir_node *get_unop_op(const ir_node *node)
1064 if (node->op->opar == oparity_unary)
1065 return get_irn_n(node, node->op->op_index);
1067 assert(node->op->opar == oparity_unary);
1071 void set_unop_op(ir_node *node, ir_node *op)
1073 if (node->op->opar == oparity_unary)
1074 set_irn_n(node, node->op->op_index, op);
1076 assert(node->op->opar == oparity_unary);
1079 int (is_binop)(const ir_node *node)
1081 return is_binop_(node);
1084 ir_node *get_binop_left(const ir_node *node)
1086 assert(node->op->opar == oparity_binary);
1087 return get_irn_n(node, node->op->op_index);
1090 void set_binop_left(ir_node *node, ir_node *left)
1092 assert(node->op->opar == oparity_binary);
1093 set_irn_n(node, node->op->op_index, left);
1096 ir_node *get_binop_right(const ir_node *node)
1098 assert(node->op->opar == oparity_binary);
1099 return get_irn_n(node, node->op->op_index + 1);
1102 void set_binop_right(ir_node *node, ir_node *right)
1104 assert(node->op->opar == oparity_binary);
1105 set_irn_n(node, node->op->op_index + 1, right);
1108 ir_node **get_Phi_preds_arr(ir_node *node)
1110 assert(is_Phi(node));
1111 return (ir_node **)&(get_irn_in(node)[1]);
1114 int get_Phi_n_preds(const ir_node *node)
1116 assert(is_Phi(node));
1117 return get_irn_arity(node);
1120 ir_node *get_Phi_pred(const ir_node *node, int pos)
1122 assert(is_Phi(node));
1123 return get_irn_n(node, pos);
1126 void set_Phi_pred(ir_node *node, int pos, ir_node *pred)
1128 assert(is_Phi(node));
1129 set_irn_n(node, pos, pred);
1132 ir_node *(get_Phi_next)(const ir_node *phi)
1134 return get_Phi_next_(phi);
1137 void (set_Phi_next)(ir_node *phi, ir_node *next)
1139 set_Phi_next_(phi, next);
1142 int is_memop(const ir_node *node)
1144 return is_op_uses_memory(get_irn_op(node));
1147 ir_node *get_memop_mem(const ir_node *node)
1149 const ir_op *op = get_irn_op(node);
1150 assert(is_memop(node));
1151 return get_irn_n(node, op->memory_index);
1154 void set_memop_mem(ir_node *node, ir_node *mem)
1156 const ir_op *op = get_irn_op(node);
1157 assert(is_memop(node));
1158 set_irn_n(node, op->memory_index, mem);
1161 ir_node **get_Sync_preds_arr(ir_node *node)
1163 assert(is_Sync(node));
1164 return (ir_node **)&(get_irn_in(node)[1]);
1167 int get_Sync_n_preds(const ir_node *node)
1169 assert(is_Sync(node));
1170 return (get_irn_arity(node));
1173 ir_node *get_Sync_pred(const ir_node *node, int pos)
1175 assert(is_Sync(node));
1176 return get_irn_n(node, pos);
1179 void set_Sync_pred(ir_node *node, int pos, ir_node *pred)
1181 assert(is_Sync(node));
1182 set_irn_n(node, pos, pred);
1185 void add_Sync_pred(ir_node *node, ir_node *pred)
1187 assert(is_Sync(node));
1188 add_irn_n(node, pred);
1191 int (is_arg_Proj)(const ir_node *node)
1193 return is_arg_Proj_(node);
1196 int is_x_except_Proj(const ir_node *node)
1201 pred = get_Proj_pred(node);
1202 if (!is_fragile_op(pred))
1204 return get_Proj_proj(node) == pred->op->pn_x_except;
1207 int is_x_regular_Proj(const ir_node *node)
1212 pred = get_Proj_pred(node);
1213 if (!is_fragile_op(pred))
1215 return get_Proj_proj(node) == pred->op->pn_x_regular;
1218 void ir_set_throws_exception(ir_node *node, int throws_exception)
1220 except_attr *attr = &node->attr.except;
1221 assert(is_fragile_op(node));
1222 attr->throws_exception = throws_exception;
1225 int ir_throws_exception(const ir_node *node)
1227 const except_attr *attr = &node->attr.except;
1228 assert(is_fragile_op(node));
1229 return attr->throws_exception;
1232 ir_node **get_Tuple_preds_arr(ir_node *node)
1234 assert(is_Tuple(node));
1235 return (ir_node **)&(get_irn_in(node)[1]);
1238 int get_Tuple_n_preds(const ir_node *node)
1240 assert(is_Tuple(node));
1241 return get_irn_arity(node);
1244 ir_node *get_Tuple_pred(const ir_node *node, int pos)
1246 assert(is_Tuple(node));
1247 return get_irn_n(node, pos);
1250 void set_Tuple_pred(ir_node *node, int pos, ir_node *pred)
1252 assert(is_Tuple(node));
1253 set_irn_n(node, pos, pred);
1256 size_t get_ASM_n_input_constraints(const ir_node *node)
1258 assert(is_ASM(node));
1259 return ARR_LEN(node->attr.assem.input_constraints);
1262 size_t get_ASM_n_output_constraints(const ir_node *node)
1264 assert(is_ASM(node));
1265 return ARR_LEN(node->attr.assem.output_constraints);
1268 size_t get_ASM_n_clobbers(const ir_node *node)
1270 assert(is_ASM(node));
1271 return ARR_LEN(node->attr.assem.clobbers);
1274 ir_graph *(get_irn_irg)(const ir_node *node)
1276 return get_irn_irg_(node);
1279 ir_node *skip_Proj(ir_node *node)
1281 /* don't assert node !!! */
1286 node = get_Proj_pred(node);
1292 skip_Proj_const(const ir_node *node)
1294 /* don't assert node !!! */
1299 node = get_Proj_pred(node);
1304 ir_node *skip_Tuple(ir_node *node)
1309 if (is_Proj(node)) {
1310 pred = get_Proj_pred(node);
1312 if (is_Proj(pred)) { /* nested Tuple ? */
1313 pred = skip_Tuple(pred);
1315 if (is_Tuple(pred)) {
1316 node = get_Tuple_pred(pred, get_Proj_proj(node));
1319 } else if (is_Tuple(pred)) {
1320 node = get_Tuple_pred(pred, get_Proj_proj(node));
1327 ir_node *skip_Cast(ir_node *node)
1330 return get_Cast_op(node);
1334 const ir_node *skip_Cast_const(const ir_node *node)
1337 return get_Cast_op(node);
1341 ir_node *skip_Pin(ir_node *node)
1344 return get_Pin_op(node);
1348 ir_node *skip_Confirm(ir_node *node)
1350 if (is_Confirm(node))
1351 return get_Confirm_value(node);
1355 ir_node *skip_HighLevel_ops(ir_node *node)
1357 while (is_op_highlevel(get_irn_op(node))) {
1358 node = get_irn_n(node, 0);
1364 ir_node *skip_Id(ir_node *node)
1366 /* This should compact Id-cycles to self-cycles. It has the same (or less?) complexity
1367 * than any other approach, as Id chains are resolved and all point to the real node, or
1368 * all id's are self loops.
1370 * Note: This function takes 10% of mostly ANY the compiler run, so it's
1371 * a little bit "hand optimized".
1374 /* don't assert node !!! */
1376 if (!node || (node->op != op_Id)) return node;
1378 /* Don't use get_Id_pred(): We get into an endless loop for
1379 self-referencing Ids. */
1380 pred = node->in[0+1];
1382 if (pred->op != op_Id) return pred;
1384 if (node != pred) { /* not a self referencing Id. Resolve Id chain. */
1385 ir_node *rem_pred, *res;
1387 if (pred->op != op_Id) return pred; /* shortcut */
1390 assert(get_irn_arity (node) > 0);
1392 node->in[0+1] = node; /* turn us into a self referencing Id: shorten Id cycles. */
1393 res = skip_Id(rem_pred);
1394 if (is_Id(res)) /* self-loop */ return node;
1396 node->in[0+1] = res; /* Turn Id chain into Ids all referencing the chain end. */
1403 int (is_strictConv)(const ir_node *node)
1405 return is_strictConv_(node);
1408 int (is_SymConst_addr_ent)(const ir_node *node)
1410 return is_SymConst_addr_ent_(node);
1413 int is_cfop(const ir_node *node)
1415 if (is_fragile_op(node) && ir_throws_exception(node))
1418 return is_op_cfopcode(get_irn_op(node));
1421 int is_unknown_jump(const ir_node *node)
1423 return is_op_unknown_jump(get_irn_op(node));
1426 int is_fragile_op(const ir_node *node)
1428 return is_op_fragile(get_irn_op(node));
1431 int (is_irn_forking)(const ir_node *node)
1433 return is_irn_forking_(node);
1436 void (copy_node_attr)(ir_graph *irg, const ir_node *old_node, ir_node *new_node)
1438 copy_node_attr_(irg, old_node, new_node);
1441 ir_type *(get_irn_type_attr)(ir_node *node)
1443 return get_irn_type_attr_(node);
1446 ir_entity *(get_irn_entity_attr)(ir_node *node)
1448 return get_irn_entity_attr_(node);
1451 int (is_irn_constlike)(const ir_node *node)
1453 return is_irn_constlike_(node);
1456 int (is_irn_keep)(const ir_node *node)
1458 return is_irn_keep_(node);
1461 int (is_irn_start_block_placed)(const ir_node *node)
1463 return is_irn_start_block_placed_(node);
1466 int (is_irn_cse_neutral)(const ir_node *node)
1468 return is_irn_cse_neutral_(node);
1471 const char *get_cond_jmp_predicate_name(cond_jmp_predicate pred)
1473 #define X(a) case a: return #a
1475 X(COND_JMP_PRED_NONE);
1476 X(COND_JMP_PRED_TRUE);
1477 X(COND_JMP_PRED_FALSE);
1483 /** Return the attribute type of a SymConst node if exists */
1484 static ir_type *get_SymConst_attr_type(const ir_node *self)
1486 symconst_kind kind = get_SymConst_kind(self);
1487 if (SYMCONST_HAS_TYPE(kind))
1488 return get_SymConst_type(self);
1492 /** Return the attribute entity of a SymConst node if exists */
1493 static ir_entity *get_SymConst_attr_entity(const ir_node *self)
1495 symconst_kind kind = get_SymConst_kind(self);
1496 if (SYMCONST_HAS_ENT(kind))
1497 return get_SymConst_entity(self);
1501 /** the get_type_attr operation must be always implemented */
1502 static ir_type *get_Null_type(const ir_node *n)
1505 return get_unknown_type();
1508 void firm_set_default_get_type_attr(unsigned code, ir_op_ops *ops)
1511 case iro_Alloc: ops->get_type_attr = get_Alloc_type; break;
1512 case iro_Builtin: ops->get_type_attr = get_Builtin_type; break;
1513 case iro_Call: ops->get_type_attr = get_Call_type; break;
1514 case iro_Cast: ops->get_type_attr = get_Cast_type; break;
1515 case iro_CopyB: ops->get_type_attr = get_CopyB_type; break;
1516 case iro_Free: ops->get_type_attr = get_Free_type; break;
1517 case iro_InstOf: ops->get_type_attr = get_InstOf_type; break;
1518 case iro_SymConst: ops->get_type_attr = get_SymConst_attr_type; break;
1520 /* not allowed to be NULL */
1521 if (! ops->get_type_attr)
1522 ops->get_type_attr = get_Null_type;
1527 /** the get_entity_attr operation must be always implemented */
1528 static ir_entity *get_Null_ent(const ir_node *n)
1534 void firm_set_default_get_entity_attr(unsigned code, ir_op_ops *ops)
1537 case iro_SymConst: ops->get_entity_attr = get_SymConst_attr_entity; break;
1538 case iro_Sel: ops->get_entity_attr = get_Sel_entity; break;
1539 case iro_Block: ops->get_entity_attr = get_Block_entity; break;
1541 /* not allowed to be NULL */
1542 if (! ops->get_entity_attr)
1543 ops->get_entity_attr = get_Null_ent;
1548 void (set_irn_dbg_info)(ir_node *n, dbg_info *db)
1550 set_irn_dbg_info_(n, db);
1553 dbg_info *(get_irn_dbg_info)(const ir_node *n)
1555 return get_irn_dbg_info_(n);
1558 ir_switch_table *ir_new_switch_table(ir_graph *irg, size_t n_entries)
1560 struct obstack *obst = get_irg_obstack(irg);
1561 ir_switch_table *res = OALLOCFZ(obst, ir_switch_table, entries, n_entries);
1562 res->n_entries = n_entries;
1566 void ir_switch_table_set(ir_switch_table *table, size_t n,
1567 ir_tarval *min, ir_tarval *max, long pn)
1569 ir_switch_table_entry *entry = ir_switch_table_get_entry(table, n);
1575 size_t (ir_switch_table_get_n_entries)(const ir_switch_table *table)
1577 return ir_switch_table_get_n_entries_(table);
1580 ir_tarval *ir_switch_table_get_max(const ir_switch_table *table, size_t e)
1582 return ir_switch_table_get_entry_const(table, e)->max;
1585 ir_tarval *ir_switch_table_get_min(const ir_switch_table *table, size_t e)
1587 return ir_switch_table_get_entry_const(table, e)->min;
1590 long ir_switch_table_get_pn(const ir_switch_table *table, size_t e)
1592 return ir_switch_table_get_entry_const(table, e)->pn;
1595 ir_switch_table *ir_switch_table_duplicate(ir_graph *irg,
1596 const ir_switch_table *table)
1598 size_t n_entries = ir_switch_table_get_n_entries(table);
1600 ir_switch_table *res = ir_new_switch_table(irg, n_entries);
1601 for (e = 0; e < n_entries; ++e) {
1602 const ir_switch_table_entry *entry
1603 = ir_switch_table_get_entry_const(table, e);
1604 ir_switch_table_entry *new_entry = ir_switch_table_get_entry(res, e);
1605 *new_entry = *entry;
1610 unsigned firm_default_hash(const ir_node *node)
1615 /* hash table value = 9*(9*(9*(9*(9*arity+in[0])+in[1])+ ...)+mode)+code */
1616 h = irn_arity = get_irn_arity(node);
1618 /* consider all in nodes... except the block if not a control flow. */
1619 for (i = is_cfop(node) ? -1 : 0; i < irn_arity; ++i) {
1620 ir_node *pred = get_irn_n(node, i);
1621 if (is_irn_cse_neutral(pred))
1624 h = 9*h + hash_ptr(pred);
1628 h = 9*h + hash_ptr(get_irn_mode(node));
1630 h = 9*h + hash_ptr(get_irn_op(node));
1635 /* include generated code */
1636 #include "gen_irnode.c.inl"