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 ASM_PARAM_OFFSET (n_ASM_max+1)
54 #define SEL_INDEX_OFFSET (n_Sel_max+1)
55 #define RETURN_RESULT_OFFSET (n_Return_max+1)
56 #define END_KEEPALIVE_OFFSET 0
58 static const char *relation_names [] = {
70 "unordered_less_equal",
72 "unordered_greater_equal",
77 const char *get_relation_string(ir_relation relation)
79 assert(relation < (ir_relation)ARRAY_SIZE(relation_names));
80 return relation_names[relation];
83 ir_relation get_negated_relation(ir_relation relation)
85 return relation ^ ir_relation_true;
88 ir_relation get_inversed_relation(ir_relation relation)
90 ir_relation code = relation & ~(ir_relation_less|ir_relation_greater);
91 bool less = relation & ir_relation_less;
92 bool greater = relation & ir_relation_greater;
93 code |= (less ? ir_relation_greater : ir_relation_false)
94 | (greater ? ir_relation_less : ir_relation_false);
98 ir_node *new_ir_node(dbg_info *db, ir_graph *irg, ir_node *block, ir_op *op,
99 ir_mode *mode, int arity, ir_node *const *in)
107 size_t const node_size = offsetof(ir_node, attr) + op->attr_size;
108 ir_node *const res = (ir_node*)OALLOCNZ(irg->obst, char, node_size);
110 res->kind = k_ir_node;
114 res->node_idx = irg_register_node_idx(irg, res);
119 res->in = NEW_ARR_F(ir_node *, 1); /* 1: space for block */
121 /* not nice but necessary: End and Sync must always have a flexible array */
122 if (op == op_End || op == op_Sync)
123 res->in = NEW_ARR_F(ir_node *, (arity+1));
125 res->in = NEW_ARR_D(ir_node *, irg->obst, (arity+1));
126 memcpy(&res->in[1], in, sizeof(ir_node *) * arity);
130 set_irn_dbg_info(res, db);
131 res->node_nr = get_irp_new_node_nr();
133 for (i = 0; i < EDGE_KIND_LAST; ++i) {
134 INIT_LIST_HEAD(&res->edge_info[i].outs_head);
135 /* edges will be build immediately */
136 res->edge_info[i].edges_built = 1;
137 res->edge_info[i].out_count = 0;
140 /* don't put this into the for loop, arity is -1 for some nodes! */
141 edges_notify_edge(res, -1, res->in[0], NULL, irg);
142 for (i = 1; i <= arity; ++i)
143 edges_notify_edge(res, i - 1, res->in[i], NULL, irg);
145 hook_new_node(irg, res);
146 if (irg_is_constrained(irg, IR_GRAPH_CONSTRAINT_BACKEND)) {
147 be_info_new_node(irg, res);
153 int (is_ir_node)(const void *thing)
155 return is_ir_node_(thing);
158 int (get_irn_arity)(const ir_node *node)
160 return get_irn_arity_(node);
163 ir_node **get_irn_in(const ir_node *node)
168 void set_irn_in(ir_node *node, int arity, ir_node **in)
172 ir_graph *irg = get_irn_irg(node);
177 assert(node != NULL && node->kind == k_ir_node);
179 for (i = 0; i < arity; ++i) {
180 assert(in[i] != NULL && in[0]->kind == k_ir_node);
184 for (i = 0; i < arity; i++) {
185 if (i < (int)ARR_LEN(*pOld_in)-1)
186 edges_notify_edge(node, i, in[i], (*pOld_in)[i+1], irg);
188 edges_notify_edge(node, i, in[i], NULL, irg);
190 for (;i < (int)ARR_LEN(*pOld_in)-1; i++) {
191 edges_notify_edge(node, i, NULL, (*pOld_in)[i+1], irg);
194 if (arity != (int)ARR_LEN(*pOld_in) - 1) {
195 ir_node * block = (*pOld_in)[0];
196 *pOld_in = NEW_ARR_D(ir_node *, irg->obst, arity + 1);
197 (*pOld_in)[0] = block;
199 fix_backedges(irg->obst, node);
201 memcpy((*pOld_in) + 1, in, sizeof(ir_node *) * arity);
203 /* update irg flags */
204 clear_irg_properties(irg, IR_GRAPH_PROPERTY_CONSISTENT_OUTS | IR_GRAPH_PROPERTY_CONSISTENT_LOOPINFO);
207 ir_node *(get_irn_n)(const ir_node *node, int n)
209 return get_irn_n_(node, n);
212 void set_irn_n(ir_node *node, int n, ir_node *in)
214 ir_graph *irg = get_irn_irg(node);
215 assert(node && node->kind == k_ir_node);
217 assert(n < get_irn_arity(node));
218 assert(in && in->kind == k_ir_node);
221 hook_set_irn_n(node, n, in, node->in[n + 1]);
223 /* Here, we rely on src and tgt being in the current ir graph */
224 edges_notify_edge(node, n, in, node->in[n + 1], irg);
226 node->in[n + 1] = in;
228 /* update irg flags */
229 clear_irg_properties(irg, IR_GRAPH_PROPERTY_CONSISTENT_OUTS | IR_GRAPH_PROPERTY_CONSISTENT_LOOPINFO);
232 int add_irn_n(ir_node *node, ir_node *in)
235 ir_graph *irg = get_irn_irg(node);
237 assert(node->op->opar == oparity_dynamic);
238 pos = ARR_LEN(node->in) - 1;
239 ARR_APP1(ir_node *, node->in, in);
240 edges_notify_edge(node, pos, node->in[pos + 1], NULL, irg);
243 hook_set_irn_n(node, pos, node->in[pos + 1], NULL);
248 void del_Sync_n(ir_node *n, int i)
250 int arity = get_Sync_n_preds(n);
251 ir_node *last_pred = get_Sync_pred(n, arity - 1);
252 set_Sync_pred(n, i, last_pred);
253 edges_notify_edge(n, arity - 1, NULL, last_pred, get_irn_irg(n));
254 ARR_SHRINKLEN(get_irn_in(n), arity);
257 int (get_irn_deps)(const ir_node *node)
259 return get_irn_deps_(node);
262 ir_node *(get_irn_dep)(const ir_node *node, int pos)
264 return get_irn_dep_(node, pos);
267 void set_irn_dep(ir_node *node, int pos, ir_node *dep)
272 assert(node->deps && "dependency array node yet allocated. use add_irn_dep()");
273 assert(pos >= 0 && pos < (int)ARR_LEN(node->deps) && "dependency index out of range");
275 old = node->deps[pos];
276 node->deps[pos] = dep;
277 irg = get_irn_irg(node);
278 if (edges_activated_kind(irg, EDGE_KIND_DEP))
279 edges_notify_edge_kind(node, pos, dep, old, EDGE_KIND_DEP, irg);
282 void add_irn_dep(ir_node *node, ir_node *dep)
286 if (node->deps == NULL) {
287 node->deps = NEW_ARR_F(ir_node *, 0);
289 ARR_APP1(ir_node*, node->deps, dep);
290 irg = get_irn_irg(node);
291 if (edges_activated_kind(irg, EDGE_KIND_DEP))
292 edges_notify_edge_kind(node, ARR_LEN(node->deps)-1, dep, NULL, EDGE_KIND_DEP, irg);
295 void delete_irn_dep(ir_node *node, ir_node *dep)
299 if (node->deps == NULL)
302 n_deps = ARR_LEN(node->deps);
303 for (i = 0; i < n_deps; ++i) {
304 if (node->deps[i] == dep) {
305 set_irn_dep(node, i, node->deps[n_deps-1]);
306 edges_notify_edge(node, i, NULL, dep, get_irn_irg(node));
307 ARR_SHRINKLEN(node->deps, n_deps-1);
313 void add_irn_deps(ir_node *tgt, ir_node *src)
317 for (i = 0, n = get_irn_deps(src); i < n; ++i)
318 add_irn_dep(tgt, get_irn_dep(src, i));
322 ir_mode *(get_irn_mode)(const ir_node *node)
324 return get_irn_mode_(node);
327 void (set_irn_mode)(ir_node *node, ir_mode *mode)
329 set_irn_mode_(node, mode);
332 ir_op *(get_irn_op)(const ir_node *node)
334 return get_irn_op_(node);
337 void (set_irn_op)(ir_node *node, ir_op *op)
339 set_irn_op_(node, op);
342 unsigned (get_irn_opcode)(const ir_node *node)
344 return get_irn_opcode_(node);
347 const char *get_irn_opname(const ir_node *node)
349 return get_id_str(node->op->name);
352 ident *get_irn_opident(const ir_node *node)
355 return node->op->name;
358 ir_visited_t (get_irn_visited)(const ir_node *node)
360 return get_irn_visited_(node);
363 void (set_irn_visited)(ir_node *node, ir_visited_t visited)
365 set_irn_visited_(node, visited);
368 void (mark_irn_visited)(ir_node *node)
370 mark_irn_visited_(node);
373 int (irn_visited)(const ir_node *node)
375 return irn_visited_(node);
378 int (irn_visited_else_mark)(ir_node *node)
380 return irn_visited_else_mark_(node);
383 void (set_irn_link)(ir_node *node, void *link)
385 set_irn_link_(node, link);
388 void *(get_irn_link)(const ir_node *node)
390 return get_irn_link_(node);
393 op_pin_state (get_irn_pinned)(const ir_node *node)
395 return get_irn_pinned_(node);
398 op_pin_state (is_irn_pinned_in_irg) (const ir_node *node)
400 return is_irn_pinned_in_irg_(node);
403 void set_irn_pinned(ir_node *node, op_pin_state state)
405 /* due to optimization an opt may be turned into a Tuple */
409 assert(node && get_op_pinned(get_irn_op(node)) >= op_pin_state_exc_pinned);
410 assert(state == op_pin_state_pinned || state == op_pin_state_floats);
412 node->attr.except.pin_state = state;
415 long get_irn_node_nr(const ir_node *node)
418 return node->node_nr;
421 void *(get_irn_generic_attr)(ir_node *node)
423 assert(is_ir_node(node));
424 return get_irn_generic_attr_(node);
427 const void *(get_irn_generic_attr_const)(const ir_node *node)
429 assert(is_ir_node(node));
430 return get_irn_generic_attr_const_(node);
433 unsigned (get_irn_idx)(const ir_node *node)
435 assert(is_ir_node(node));
436 return get_irn_idx_(node);
439 int get_irn_pred_pos(ir_node *node, ir_node *arg)
442 for (i = get_irn_arity(node) - 1; i >= 0; i--) {
443 if (get_irn_n(node, i) == arg)
449 ir_node *(get_nodes_block)(const ir_node *node)
451 return get_nodes_block_(node);
454 void set_nodes_block(ir_node *node, ir_node *block)
456 assert(!is_Block(node));
457 set_irn_n(node, -1, block);
460 ir_type *is_frame_pointer(const ir_node *n)
462 if (is_Proj(n) && (get_Proj_proj(n) == pn_Start_P_frame_base)) {
463 ir_node *start = get_Proj_pred(n);
464 if (is_Start(start)) {
465 return get_irg_frame_type(get_irn_irg(start));
471 ir_node **get_Block_cfgpred_arr(ir_node *node)
473 assert(is_Block(node));
474 return (ir_node **)&(get_irn_in(node)[1]);
477 int (get_Block_n_cfgpreds)(const ir_node *node)
479 return get_Block_n_cfgpreds_(node);
482 ir_node *(get_Block_cfgpred)(const ir_node *node, int pos)
484 return get_Block_cfgpred_(node, pos);
487 void set_Block_cfgpred(ir_node *node, int pos, ir_node *pred)
489 assert(is_Block(node));
490 set_irn_n(node, pos, pred);
493 int get_Block_cfgpred_pos(const ir_node *block, const ir_node *pred)
497 for (i = get_Block_n_cfgpreds(block) - 1; i >= 0; --i) {
498 if (get_Block_cfgpred_block(block, i) == pred)
504 ir_node *(get_Block_cfgpred_block)(const ir_node *node, int pos)
506 return get_Block_cfgpred_block_(node, pos);
509 int get_Block_matured(const ir_node *node)
511 assert(is_Block(node));
512 return (int)node->attr.block.is_matured;
515 void set_Block_matured(ir_node *node, int matured)
517 assert(is_Block(node));
518 node->attr.block.is_matured = matured;
521 ir_visited_t (get_Block_block_visited)(const ir_node *node)
523 return get_Block_block_visited_(node);
526 void (set_Block_block_visited)(ir_node *node, ir_visited_t visit)
528 set_Block_block_visited_(node, visit);
531 void (mark_Block_block_visited)(ir_node *node)
533 mark_Block_block_visited_(node);
536 int (Block_block_visited)(const ir_node *node)
538 return Block_block_visited_(node);
541 ir_graph *(get_Block_irg)(const ir_node *block)
543 return get_Block_irg_(block);
546 ir_entity *create_Block_entity(ir_node *block)
549 assert(is_Block(block));
551 entity = block->attr.block.entity;
552 if (entity == NULL) {
553 ir_label_t nr = get_irp_next_label_nr();
554 entity = new_label_entity(nr);
555 set_entity_visibility(entity, ir_visibility_local);
556 set_entity_linkage(entity, IR_LINKAGE_CONSTANT);
557 set_entity_compiler_generated(entity, 1);
559 block->attr.block.entity = entity;
564 ir_node *(get_Block_phis)(const ir_node *block)
566 return get_Block_phis_(block);
569 void (set_Block_phis)(ir_node *block, ir_node *phi)
571 set_Block_phis_(block, phi);
574 void (add_Block_phi)(ir_node *block, ir_node *phi)
576 add_Block_phi_(block, phi);
579 unsigned (get_Block_mark)(const ir_node *block)
581 return get_Block_mark_(block);
584 void (set_Block_mark)(ir_node *block, unsigned mark)
586 set_Block_mark_(block, mark);
589 int get_End_n_keepalives(const ir_node *end)
592 return (get_irn_arity(end) - END_KEEPALIVE_OFFSET);
595 ir_node *get_End_keepalive(const ir_node *end, int pos)
598 return get_irn_n(end, pos + END_KEEPALIVE_OFFSET);
601 void add_End_keepalive(ir_node *end, ir_node *ka)
607 void set_End_keepalive(ir_node *end, int pos, ir_node *ka)
610 set_irn_n(end, pos + END_KEEPALIVE_OFFSET, ka);
613 void set_End_keepalives(ir_node *end, int n, ir_node *in[])
617 ir_graph *irg = get_irn_irg(end);
619 /* notify that edges are deleted */
620 for (e = END_KEEPALIVE_OFFSET; e < ARR_LEN(end->in) - 1; ++e) {
621 edges_notify_edge(end, e, NULL, end->in[e + 1], irg);
623 ARR_RESIZE(ir_node *, end->in, n + 1 + END_KEEPALIVE_OFFSET);
625 for (i = 0; i < n; ++i) {
626 end->in[1 + END_KEEPALIVE_OFFSET + i] = in[i];
627 edges_notify_edge(end, END_KEEPALIVE_OFFSET + i, end->in[1 + END_KEEPALIVE_OFFSET + i], NULL, irg);
630 /* update irg flags */
631 clear_irg_properties(irg, IR_GRAPH_PROPERTY_CONSISTENT_OUTS);
634 void remove_End_keepalive(ir_node *end, ir_node *irn)
636 int n = get_End_n_keepalives(end);
644 ir_node *old_ka = end->in[1 + END_KEEPALIVE_OFFSET + i];
652 irg = get_irn_irg(end);
654 /* remove the edge */
655 edges_notify_edge(end, idx, NULL, irn, irg);
658 /* exchange with the last one */
659 ir_node *old = end->in[1 + END_KEEPALIVE_OFFSET + n - 1];
660 edges_notify_edge(end, n - 1, NULL, old, irg);
661 end->in[1 + END_KEEPALIVE_OFFSET + idx] = old;
662 edges_notify_edge(end, idx, old, NULL, irg);
664 /* now n - 1 keeps, 1 block input */
665 ARR_RESIZE(ir_node *, end->in, (n - 1) + 1 + END_KEEPALIVE_OFFSET);
667 /* update irg flags */
668 clear_irg_properties(irg, IR_GRAPH_PROPERTY_CONSISTENT_OUTS);
671 void remove_End_Bads_and_doublets(ir_node *end)
674 int idx, n = get_End_n_keepalives(end);
676 bool changed = false;
681 irg = get_irn_irg(end);
682 pset_new_init(&keeps);
684 for (idx = n - 1; idx >= 0; --idx) {
685 ir_node *ka = get_End_keepalive(end, idx);
687 if (is_Bad(ka) || is_NoMem(ka) || pset_new_contains(&keeps, ka)) {
689 /* remove the edge */
690 edges_notify_edge(end, idx, NULL, ka, irg);
693 /* exchange with the last one */
694 ir_node *old = end->in[1 + END_KEEPALIVE_OFFSET + n - 1];
695 edges_notify_edge(end, n - 1, NULL, old, irg);
696 end->in[1 + END_KEEPALIVE_OFFSET + idx] = old;
697 edges_notify_edge(end, idx, old, NULL, irg);
701 pset_new_insert(&keeps, ka);
704 /* n keeps, 1 block input */
705 ARR_RESIZE(ir_node *, end->in, n + 1 + END_KEEPALIVE_OFFSET);
707 pset_new_destroy(&keeps);
710 clear_irg_properties(irg, IR_GRAPH_PROPERTY_CONSISTENT_OUTS);
714 void free_End(ir_node *end)
719 end->in = NULL; /* @@@ make sure we get an error if we use the
720 in array afterwards ... */
723 size_t get_Return_n_ress(const ir_node *node)
725 assert(is_Return(node));
726 return (size_t)(get_irn_arity(node) - RETURN_RESULT_OFFSET);
729 ir_node **get_Return_res_arr(ir_node *node)
731 assert(is_Return(node));
732 if (get_Return_n_ress(node) > 0)
733 return (ir_node **)&(get_irn_in(node)[1 + RETURN_RESULT_OFFSET]);
738 ir_node *get_Return_res(const ir_node *node, int pos)
740 assert(is_Return(node));
742 assert(get_Return_n_ress(node) > (size_t)pos);
743 return get_irn_n(node, pos + RETURN_RESULT_OFFSET);
746 void set_Return_res(ir_node *node, int pos, ir_node *res)
748 assert(is_Return(node));
749 set_irn_n(node, pos + RETURN_RESULT_OFFSET, res);
752 int (is_Const_null)(const ir_node *node)
754 return is_Const_null_(node);
757 int (is_Const_one)(const ir_node *node)
759 return is_Const_one_(node);
762 int (is_Const_all_one)(const ir_node *node)
764 return is_Const_all_one_(node);
769 symconst_kind get_SymConst_kind(const ir_node *node)
771 assert(is_SymConst(node));
772 return node->attr.symc.kind;
775 void set_SymConst_kind(ir_node *node, symconst_kind kind)
777 assert(is_SymConst(node));
778 node->attr.symc.kind = kind;
781 ir_type *get_SymConst_type(const ir_node *node)
783 /* the cast here is annoying, but we have to compensate for
785 ir_node *irn = (ir_node *)node;
786 assert(is_SymConst(node) &&
787 (SYMCONST_HAS_TYPE(get_SymConst_kind(node))));
788 return irn->attr.symc.sym.type_p;
791 void set_SymConst_type(ir_node *node, ir_type *tp)
793 assert(is_SymConst(node) &&
794 (SYMCONST_HAS_TYPE(get_SymConst_kind(node))));
795 node->attr.symc.sym.type_p = tp;
798 ir_entity *get_SymConst_entity(const ir_node *node)
800 assert(is_SymConst(node) && SYMCONST_HAS_ENT(get_SymConst_kind(node)));
801 return node->attr.symc.sym.entity_p;
804 void set_SymConst_entity(ir_node *node, ir_entity *ent)
806 assert(is_SymConst(node) && SYMCONST_HAS_ENT(get_SymConst_kind(node)));
807 node->attr.symc.sym.entity_p = ent;
810 ir_enum_const *get_SymConst_enum(const ir_node *node)
812 assert(is_SymConst(node) && SYMCONST_HAS_ENUM(get_SymConst_kind(node)));
813 return node->attr.symc.sym.enum_p;
816 void set_SymConst_enum(ir_node *node, ir_enum_const *ec)
818 assert(is_SymConst(node) && SYMCONST_HAS_ENUM(get_SymConst_kind(node)));
819 node->attr.symc.sym.enum_p = ec;
822 union symconst_symbol
823 get_SymConst_symbol(const ir_node *node)
825 assert(is_SymConst(node));
826 return node->attr.symc.sym;
829 void set_SymConst_symbol(ir_node *node, union symconst_symbol sym)
831 assert(is_SymConst(node));
832 node->attr.symc.sym = sym;
835 int get_Sel_n_indexs(const ir_node *node)
837 assert(is_Sel(node));
838 return (get_irn_arity(node) - SEL_INDEX_OFFSET);
841 ir_node **get_Sel_index_arr(ir_node *node)
843 assert(is_Sel(node));
844 if (get_Sel_n_indexs(node) > 0)
845 return (ir_node **)& get_irn_in(node)[SEL_INDEX_OFFSET + 1];
850 ir_node *get_Sel_index(const ir_node *node, int pos)
852 assert(is_Sel(node));
853 return get_irn_n(node, pos + SEL_INDEX_OFFSET);
856 void set_Sel_index(ir_node *node, int pos, ir_node *index)
858 assert(is_Sel(node));
859 set_irn_n(node, pos + SEL_INDEX_OFFSET, index);
862 ir_node **get_Call_param_arr(ir_node *node)
864 assert(is_Call(node));
865 return &get_irn_in(node)[CALL_PARAM_OFFSET + 1];
868 int get_Call_n_params(const ir_node *node)
870 assert(is_Call(node));
871 return get_irn_arity(node) - CALL_PARAM_OFFSET;
874 ir_node *get_Call_param(const ir_node *node, int pos)
876 assert(is_Call(node));
877 return get_irn_n(node, pos + CALL_PARAM_OFFSET);
880 void set_Call_param(ir_node *node, int pos, ir_node *param)
882 assert(is_Call(node));
883 set_irn_n(node, pos + CALL_PARAM_OFFSET, param);
886 ir_node **get_Builtin_param_arr(ir_node *node)
888 assert(is_Builtin(node));
889 return &get_irn_in(node)[BUILTIN_PARAM_OFFSET + 1];
892 int get_Builtin_n_params(const ir_node *node)
894 assert(is_Builtin(node));
895 return (get_irn_arity(node) - BUILTIN_PARAM_OFFSET);
898 ir_node *get_Builtin_param(const ir_node *node, int pos)
900 assert(is_Builtin(node));
901 return get_irn_n(node, pos + BUILTIN_PARAM_OFFSET);
904 void set_Builtin_param(ir_node *node, int pos, ir_node *param)
906 assert(is_Builtin(node));
907 set_irn_n(node, pos + BUILTIN_PARAM_OFFSET, param);
910 const char *get_builtin_kind_name(ir_builtin_kind kind)
912 #define X(a) case a: return #a
916 X(ir_bk_return_address);
917 X(ir_bk_frame_address);
927 X(ir_bk_inner_trampoline);
934 int Call_has_callees(const ir_node *node)
936 assert(is_Call(node));
937 return ((get_irg_callee_info_state(get_irn_irg(node)) != irg_callee_info_none) &&
938 (node->attr.call.callee_arr != NULL));
941 size_t get_Call_n_callees(const ir_node *node)
943 assert(is_Call(node) && node->attr.call.callee_arr);
944 return ARR_LEN(node->attr.call.callee_arr);
947 ir_entity *get_Call_callee(const ir_node *node, size_t pos)
949 assert(pos < get_Call_n_callees(node));
950 return node->attr.call.callee_arr[pos];
953 void set_Call_callee_arr(ir_node *node, size_t n, ir_entity ** arr)
955 ir_graph *irg = get_irn_irg(node);
957 assert(is_Call(node));
958 if (node->attr.call.callee_arr == NULL || get_Call_n_callees(node) != n) {
959 node->attr.call.callee_arr = NEW_ARR_D(ir_entity *, irg->obst, n);
961 memcpy(node->attr.call.callee_arr, arr, n * sizeof(ir_entity *));
964 void remove_Call_callee_arr(ir_node *node)
966 assert(is_Call(node));
967 node->attr.call.callee_arr = NULL;
970 int is_Cast_upcast(ir_node *node)
972 ir_type *totype = get_Cast_type(node);
973 ir_type *fromtype = get_irn_typeinfo_type(get_Cast_op(node));
975 assert(get_irg_typeinfo_state(get_irn_irg(node)) == ir_typeinfo_consistent);
978 while (is_Pointer_type(totype) && is_Pointer_type(fromtype)) {
979 totype = get_pointer_points_to_type(totype);
980 fromtype = get_pointer_points_to_type(fromtype);
985 if (!is_Class_type(totype)) return 0;
986 return is_SubClass_of(fromtype, totype);
989 int is_Cast_downcast(ir_node *node)
991 ir_type *totype = get_Cast_type(node);
992 ir_type *fromtype = get_irn_typeinfo_type(get_Cast_op(node));
994 assert(get_irg_typeinfo_state(get_irn_irg(node)) == ir_typeinfo_consistent);
997 while (is_Pointer_type(totype) && is_Pointer_type(fromtype)) {
998 totype = get_pointer_points_to_type(totype);
999 fromtype = get_pointer_points_to_type(fromtype);
1004 if (!is_Class_type(totype)) return 0;
1005 return is_SubClass_of(totype, fromtype);
1008 int (is_unop)(const ir_node *node)
1010 return is_unop_(node);
1013 ir_node *get_unop_op(const ir_node *node)
1015 if (node->op->opar == oparity_unary)
1016 return get_irn_n(node, node->op->op_index);
1018 assert(node->op->opar == oparity_unary);
1022 void set_unop_op(ir_node *node, ir_node *op)
1024 if (node->op->opar == oparity_unary)
1025 set_irn_n(node, node->op->op_index, op);
1027 assert(node->op->opar == oparity_unary);
1030 int (is_binop)(const ir_node *node)
1032 return is_binop_(node);
1035 ir_node *get_binop_left(const ir_node *node)
1037 assert(node->op->opar == oparity_binary);
1038 return get_irn_n(node, node->op->op_index);
1041 void set_binop_left(ir_node *node, ir_node *left)
1043 assert(node->op->opar == oparity_binary);
1044 set_irn_n(node, node->op->op_index, left);
1047 ir_node *get_binop_right(const ir_node *node)
1049 assert(node->op->opar == oparity_binary);
1050 return get_irn_n(node, node->op->op_index + 1);
1053 void set_binop_right(ir_node *node, ir_node *right)
1055 assert(node->op->opar == oparity_binary);
1056 set_irn_n(node, node->op->op_index + 1, right);
1059 ir_node **get_Phi_preds_arr(ir_node *node)
1061 assert(is_Phi(node));
1062 return (ir_node **)&(get_irn_in(node)[1]);
1065 int get_Phi_n_preds(const ir_node *node)
1067 assert(is_Phi(node));
1068 return get_irn_arity(node);
1071 ir_node *get_Phi_pred(const ir_node *node, int pos)
1073 assert(is_Phi(node));
1074 return get_irn_n(node, pos);
1077 void set_Phi_pred(ir_node *node, int pos, ir_node *pred)
1079 assert(is_Phi(node));
1080 set_irn_n(node, pos, pred);
1083 ir_node *(get_Phi_next)(const ir_node *phi)
1085 return get_Phi_next_(phi);
1088 void (set_Phi_next)(ir_node *phi, ir_node *next)
1090 set_Phi_next_(phi, next);
1093 int is_memop(const ir_node *node)
1095 return is_op_uses_memory(get_irn_op(node));
1098 ir_node *get_memop_mem(const ir_node *node)
1100 const ir_op *op = get_irn_op(node);
1101 assert(is_memop(node));
1102 return get_irn_n(node, op->memory_index);
1105 void set_memop_mem(ir_node *node, ir_node *mem)
1107 const ir_op *op = get_irn_op(node);
1108 assert(is_memop(node));
1109 set_irn_n(node, op->memory_index, mem);
1112 ir_node **get_Sync_preds_arr(ir_node *node)
1114 assert(is_Sync(node));
1115 return (ir_node **)&(get_irn_in(node)[1]);
1118 int get_Sync_n_preds(const ir_node *node)
1120 assert(is_Sync(node));
1121 return (get_irn_arity(node));
1124 ir_node *get_Sync_pred(const ir_node *node, int pos)
1126 assert(is_Sync(node));
1127 return get_irn_n(node, pos);
1130 void set_Sync_pred(ir_node *node, int pos, ir_node *pred)
1132 assert(is_Sync(node));
1133 set_irn_n(node, pos, pred);
1136 void add_Sync_pred(ir_node *node, ir_node *pred)
1138 assert(is_Sync(node));
1139 add_irn_n(node, pred);
1142 int (is_arg_Proj)(const ir_node *node)
1144 return is_arg_Proj_(node);
1147 int is_x_except_Proj(const ir_node *node)
1152 pred = get_Proj_pred(node);
1153 if (!is_fragile_op(pred))
1155 return get_Proj_proj(node) == pred->op->pn_x_except;
1158 int is_x_regular_Proj(const ir_node *node)
1163 pred = get_Proj_pred(node);
1164 if (!is_fragile_op(pred))
1166 return get_Proj_proj(node) == pred->op->pn_x_regular;
1169 void ir_set_throws_exception(ir_node *node, int throws_exception)
1171 except_attr *attr = &node->attr.except;
1172 assert(is_fragile_op(node));
1173 attr->throws_exception = throws_exception;
1176 int ir_throws_exception(const ir_node *node)
1178 const except_attr *attr = &node->attr.except;
1179 assert(is_fragile_op(node));
1180 return attr->throws_exception;
1183 ir_node **get_Tuple_preds_arr(ir_node *node)
1185 assert(is_Tuple(node));
1186 return (ir_node **)&(get_irn_in(node)[1]);
1189 int get_Tuple_n_preds(const ir_node *node)
1191 assert(is_Tuple(node));
1192 return get_irn_arity(node);
1195 ir_node *get_Tuple_pred(const ir_node *node, int pos)
1197 assert(is_Tuple(node));
1198 return get_irn_n(node, pos);
1201 void set_Tuple_pred(ir_node *node, int pos, ir_node *pred)
1203 assert(is_Tuple(node));
1204 set_irn_n(node, pos, pred);
1207 int get_ASM_n_inputs(const ir_node *node)
1209 assert(is_ASM(node));
1210 return get_irn_arity(node) - ASM_PARAM_OFFSET;
1213 ir_node *get_ASM_input(const ir_node *node, int pos)
1215 return get_irn_n(node, ASM_PARAM_OFFSET + pos);
1218 size_t get_ASM_n_output_constraints(const ir_node *node)
1220 assert(is_ASM(node));
1221 return ARR_LEN(node->attr.assem.output_constraints);
1224 size_t get_ASM_n_clobbers(const ir_node *node)
1226 assert(is_ASM(node));
1227 return ARR_LEN(node->attr.assem.clobbers);
1230 ir_graph *(get_irn_irg)(const ir_node *node)
1232 return get_irn_irg_(node);
1235 ir_node *skip_Proj(ir_node *node)
1237 /* don't assert node !!! */
1242 node = get_Proj_pred(node);
1248 skip_Proj_const(const ir_node *node)
1250 /* don't assert node !!! */
1255 node = get_Proj_pred(node);
1260 ir_node *skip_Tuple(ir_node *node)
1265 if (is_Proj(node)) {
1266 pred = get_Proj_pred(node);
1268 if (is_Proj(pred)) { /* nested Tuple ? */
1269 pred = skip_Tuple(pred);
1271 if (is_Tuple(pred)) {
1272 node = get_Tuple_pred(pred, get_Proj_proj(node));
1275 } else if (is_Tuple(pred)) {
1276 node = get_Tuple_pred(pred, get_Proj_proj(node));
1283 ir_node *skip_Cast(ir_node *node)
1286 return get_Cast_op(node);
1290 const ir_node *skip_Cast_const(const ir_node *node)
1293 return get_Cast_op(node);
1297 ir_node *skip_Pin(ir_node *node)
1300 return get_Pin_op(node);
1304 ir_node *skip_Confirm(ir_node *node)
1306 if (is_Confirm(node))
1307 return get_Confirm_value(node);
1311 ir_node *skip_HighLevel_ops(ir_node *node)
1313 while (is_op_highlevel(get_irn_op(node))) {
1314 node = get_irn_n(node, 0);
1320 ir_node *skip_Id(ir_node *node)
1322 /* This should compact Id-cycles to self-cycles. It has the same (or less?) complexity
1323 * than any other approach, as Id chains are resolved and all point to the real node, or
1324 * all id's are self loops.
1326 * Note: This function takes 10% of mostly ANY the compiler run, so it's
1327 * a little bit "hand optimized".
1330 /* don't assert node !!! */
1332 if (!node || (node->op != op_Id)) return node;
1334 /* Don't use get_Id_pred(): We get into an endless loop for
1335 self-referencing Ids. */
1336 pred = node->in[0+1];
1338 if (pred->op != op_Id) return pred;
1340 if (node != pred) { /* not a self referencing Id. Resolve Id chain. */
1341 ir_node *rem_pred, *res;
1343 if (pred->op != op_Id) return pred; /* shortcut */
1346 assert(get_irn_arity (node) > 0);
1348 node->in[0+1] = node; /* turn us into a self referencing Id: shorten Id cycles. */
1349 res = skip_Id(rem_pred);
1350 if (is_Id(res)) /* self-loop */ return node;
1352 node->in[0+1] = res; /* Turn Id chain into Ids all referencing the chain end. */
1359 int (is_SymConst_addr_ent)(const ir_node *node)
1361 return is_SymConst_addr_ent_(node);
1364 int is_cfop(const ir_node *node)
1366 if (is_fragile_op(node) && ir_throws_exception(node))
1369 return is_op_cfopcode(get_irn_op(node));
1372 int is_unknown_jump(const ir_node *node)
1374 return is_op_unknown_jump(get_irn_op(node));
1377 int is_fragile_op(const ir_node *node)
1379 return is_op_fragile(get_irn_op(node));
1382 int (is_irn_forking)(const ir_node *node)
1384 return is_irn_forking_(node);
1387 void (copy_node_attr)(ir_graph *irg, const ir_node *old_node, ir_node *new_node)
1389 copy_node_attr_(irg, old_node, new_node);
1392 ir_type *(get_irn_type_attr)(ir_node *node)
1394 return get_irn_type_attr_(node);
1397 ir_entity *(get_irn_entity_attr)(ir_node *node)
1399 return get_irn_entity_attr_(node);
1402 int (is_irn_constlike)(const ir_node *node)
1404 return is_irn_constlike_(node);
1407 int (is_irn_keep)(const ir_node *node)
1409 return is_irn_keep_(node);
1412 int (is_irn_start_block_placed)(const ir_node *node)
1414 return is_irn_start_block_placed_(node);
1417 int (is_irn_cse_neutral)(const ir_node *node)
1419 return is_irn_cse_neutral_(node);
1422 const char *get_cond_jmp_predicate_name(cond_jmp_predicate pred)
1424 #define X(a) case a: return #a
1426 X(COND_JMP_PRED_NONE);
1427 X(COND_JMP_PRED_TRUE);
1428 X(COND_JMP_PRED_FALSE);
1434 /** Return the attribute type of a SymConst node if exists */
1435 static ir_type *get_SymConst_attr_type(const ir_node *self)
1437 symconst_kind kind = get_SymConst_kind(self);
1438 if (SYMCONST_HAS_TYPE(kind))
1439 return get_SymConst_type(self);
1443 /** Return the attribute entity of a SymConst node if exists */
1444 static ir_entity *get_SymConst_attr_entity(const ir_node *self)
1446 symconst_kind kind = get_SymConst_kind(self);
1447 if (SYMCONST_HAS_ENT(kind))
1448 return get_SymConst_entity(self);
1452 static void register_get_type_func(ir_op *op, get_type_attr_func func)
1454 op->ops.get_type_attr = func;
1457 static void register_get_entity_func(ir_op *op, get_entity_attr_func func)
1459 op->ops.get_entity_attr = func;
1462 void ir_register_getter_ops(void)
1464 register_get_type_func(op_Alloc, get_Alloc_type);
1465 register_get_type_func(op_Builtin, get_Builtin_type);
1466 register_get_type_func(op_Call, get_Call_type);
1467 register_get_type_func(op_Cast, get_Cast_type);
1468 register_get_type_func(op_CopyB, get_CopyB_type);
1469 register_get_type_func(op_Free, get_Free_type);
1470 register_get_type_func(op_InstOf, get_InstOf_type);
1471 register_get_type_func(op_SymConst, get_SymConst_attr_type);
1473 register_get_entity_func(op_SymConst, get_SymConst_attr_entity);
1474 register_get_entity_func(op_Sel, get_Sel_entity);
1475 register_get_entity_func(op_Block, get_Block_entity);
1478 void (set_irn_dbg_info)(ir_node *n, dbg_info *db)
1480 set_irn_dbg_info_(n, db);
1483 dbg_info *(get_irn_dbg_info)(const ir_node *n)
1485 return get_irn_dbg_info_(n);
1488 ir_switch_table *ir_new_switch_table(ir_graph *irg, size_t n_entries)
1490 struct obstack *obst = get_irg_obstack(irg);
1491 ir_switch_table *res = OALLOCFZ(obst, ir_switch_table, entries, n_entries);
1492 res->n_entries = n_entries;
1496 void ir_switch_table_set(ir_switch_table *table, size_t n,
1497 ir_tarval *min, ir_tarval *max, long pn)
1499 ir_switch_table_entry *entry = ir_switch_table_get_entry(table, n);
1505 size_t (ir_switch_table_get_n_entries)(const ir_switch_table *table)
1507 return ir_switch_table_get_n_entries_(table);
1510 ir_tarval *ir_switch_table_get_max(const ir_switch_table *table, size_t e)
1512 return ir_switch_table_get_entry_const(table, e)->max;
1515 ir_tarval *ir_switch_table_get_min(const ir_switch_table *table, size_t e)
1517 return ir_switch_table_get_entry_const(table, e)->min;
1520 long ir_switch_table_get_pn(const ir_switch_table *table, size_t e)
1522 return ir_switch_table_get_entry_const(table, e)->pn;
1525 ir_switch_table *ir_switch_table_duplicate(ir_graph *irg,
1526 const ir_switch_table *table)
1528 size_t n_entries = ir_switch_table_get_n_entries(table);
1530 ir_switch_table *res = ir_new_switch_table(irg, n_entries);
1531 for (e = 0; e < n_entries; ++e) {
1532 const ir_switch_table_entry *entry
1533 = ir_switch_table_get_entry_const(table, e);
1534 ir_switch_table_entry *new_entry = ir_switch_table_get_entry(res, e);
1535 *new_entry = *entry;
1540 bool only_used_by_keepalive(const ir_node *node)
1542 foreach_out_edge(node, edge) {
1543 ir_node *succ = get_edge_src_irn(edge);
1546 if (is_Proj(succ) && only_used_by_keepalive(succ))
1548 /* found a real user */
1554 /* include generated code */
1555 #include "gen_irnode.c.inl"