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 : ir_relation_false)
93 | (greater ? ir_relation_less : ir_relation_false);
98 * Indicates, whether additional data can be registered to ir nodes.
99 * If set to 1, this is not possible anymore.
101 static int forbid_new_data = 0;
103 unsigned firm_add_node_size = 0;
106 unsigned firm_register_additional_node_data(unsigned size)
108 assert(!forbid_new_data && "Too late to register additional node data");
113 return firm_add_node_size += size;
117 void init_irnode(void)
119 /* Forbid the addition of new data to an ir node. */
123 struct struct_align {
132 ir_node *new_ir_node(dbg_info *db, ir_graph *irg, ir_node *block, ir_op *op,
133 ir_mode *mode, int arity, ir_node *const *in)
136 unsigned align = offsetof(struct struct_align, s) - 1;
137 unsigned add_node_size = (firm_add_node_size + align) & ~align;
138 size_t node_size = offsetof(ir_node, attr) + op->attr_size + add_node_size;
145 p = (char*)obstack_alloc(irg->obst, node_size);
146 memset(p, 0, node_size);
147 res = (ir_node *)(p + add_node_size);
149 res->kind = k_ir_node;
153 res->node_idx = irg_register_node_idx(irg, res);
158 res->in = NEW_ARR_F(ir_node *, 1); /* 1: space for block */
160 /* not nice but necessary: End and Sync must always have a flexible array */
161 if (op == op_End || op == op_Sync)
162 res->in = NEW_ARR_F(ir_node *, (arity+1));
164 res->in = NEW_ARR_D(ir_node *, irg->obst, (arity+1));
165 memcpy(&res->in[1], in, sizeof(ir_node *) * arity);
169 set_irn_dbg_info(res, db);
171 res->node_nr = get_irp_new_node_nr();
173 for (i = 0; i < EDGE_KIND_LAST; ++i) {
174 INIT_LIST_HEAD(&res->edge_info[i].outs_head);
175 /* edges will be build immediately */
176 res->edge_info[i].edges_built = 1;
177 res->edge_info[i].out_count = 0;
180 /* don't put this into the for loop, arity is -1 for some nodes! */
181 edges_notify_edge(res, -1, res->in[0], NULL, irg);
182 for (i = 1; i <= arity; ++i)
183 edges_notify_edge(res, i - 1, res->in[i], NULL, irg);
185 hook_new_node(irg, res);
186 if (get_irg_phase_state(irg) == phase_backend) {
187 be_info_new_node(irg, res);
193 int (is_ir_node)(const void *thing)
195 return is_ir_node_(thing);
198 int (get_irn_arity)(const ir_node *node)
200 return get_irn_arity_(node);
203 ir_node **get_irn_in(const ir_node *node)
208 void set_irn_in(ir_node *node, int arity, ir_node **in)
212 ir_graph *irg = get_irn_irg(node);
217 assert(node != NULL && node->kind == k_ir_node);
219 for (i = 0; i < arity; ++i) {
220 assert(in[i] != NULL && in[0]->kind == k_ir_node);
224 for (i = 0; i < arity; i++) {
225 if (i < (int)ARR_LEN(*pOld_in)-1)
226 edges_notify_edge(node, i, in[i], (*pOld_in)[i+1], irg);
228 edges_notify_edge(node, i, in[i], NULL, irg);
230 for (;i < (int)ARR_LEN(*pOld_in)-1; i++) {
231 edges_notify_edge(node, i, NULL, (*pOld_in)[i+1], irg);
234 if (arity != (int)ARR_LEN(*pOld_in) - 1) {
235 ir_node * block = (*pOld_in)[0];
236 *pOld_in = NEW_ARR_D(ir_node *, irg->obst, arity + 1);
237 (*pOld_in)[0] = block;
239 fix_backedges(irg->obst, node);
241 memcpy((*pOld_in) + 1, in, sizeof(ir_node *) * arity);
243 /* update irg flags */
244 clear_irg_properties(irg, IR_GRAPH_PROPERTY_CONSISTENT_OUTS | IR_GRAPH_PROPERTY_CONSISTENT_LOOPINFO);
247 ir_node *(get_irn_n)(const ir_node *node, int n)
249 return get_irn_n_(node, n);
252 void set_irn_n(ir_node *node, int n, ir_node *in)
254 ir_graph *irg = get_irn_irg(node);
255 assert(node && node->kind == k_ir_node);
257 assert(n < get_irn_arity(node));
258 assert(in && in->kind == k_ir_node);
261 hook_set_irn_n(node, n, in, node->in[n + 1]);
263 /* Here, we rely on src and tgt being in the current ir graph */
264 edges_notify_edge(node, n, in, node->in[n + 1], irg);
266 node->in[n + 1] = in;
268 /* update irg flags */
269 clear_irg_properties(irg, IR_GRAPH_PROPERTY_CONSISTENT_OUTS | IR_GRAPH_PROPERTY_CONSISTENT_LOOPINFO);
272 int add_irn_n(ir_node *node, ir_node *in)
275 ir_graph *irg = get_irn_irg(node);
277 assert(node->op->opar == oparity_dynamic);
278 pos = ARR_LEN(node->in) - 1;
279 ARR_APP1(ir_node *, node->in, in);
280 edges_notify_edge(node, pos, node->in[pos + 1], NULL, irg);
283 hook_set_irn_n(node, pos, node->in[pos + 1], NULL);
288 void del_Sync_n(ir_node *n, int i)
290 int arity = get_Sync_n_preds(n);
291 ir_node *last_pred = get_Sync_pred(n, arity - 1);
292 set_Sync_pred(n, i, last_pred);
293 edges_notify_edge(n, arity - 1, NULL, last_pred, get_irn_irg(n));
294 ARR_SHRINKLEN(get_irn_in(n), arity);
297 int (get_irn_deps)(const ir_node *node)
299 return get_irn_deps_(node);
302 ir_node *(get_irn_dep)(const ir_node *node, int pos)
304 return get_irn_dep_(node, pos);
307 void (set_irn_dep)(ir_node *node, int pos, ir_node *dep)
309 set_irn_dep_(node, pos, dep);
312 void add_irn_dep(ir_node *node, ir_node *dep)
315 if (node->deps == NULL) {
316 node->deps = NEW_ARR_F(ir_node *, 0);
318 ARR_APP1(ir_node*, node->deps, dep);
319 edges_notify_edge_kind(node, ARR_LEN(node->deps)-1, dep, NULL, EDGE_KIND_DEP, get_irn_irg(node));
322 void delete_irn_dep(ir_node *node, ir_node *dep)
326 if (node->deps == NULL)
329 n_deps = ARR_LEN(node->deps);
330 for (i = 0; i < n_deps; ++i) {
331 if (node->deps[i] == dep) {
332 set_irn_dep(node, i, node->deps[n_deps-1]);
333 edges_notify_edge(node, i, NULL, dep, get_irn_irg(node));
334 ARR_SHRINKLEN(node->deps, n_deps-1);
340 void add_irn_deps(ir_node *tgt, ir_node *src)
344 for (i = 0, n = get_irn_deps(src); i < n; ++i)
345 add_irn_dep(tgt, get_irn_dep(src, i));
349 ir_mode *(get_irn_mode)(const ir_node *node)
351 return get_irn_mode_(node);
354 void (set_irn_mode)(ir_node *node, ir_mode *mode)
356 set_irn_mode_(node, mode);
359 ir_op *(get_irn_op)(const ir_node *node)
361 return get_irn_op_(node);
364 void (set_irn_op)(ir_node *node, ir_op *op)
366 set_irn_op_(node, op);
369 unsigned (get_irn_opcode)(const ir_node *node)
371 return get_irn_opcode_(node);
374 const char *get_irn_opname(const ir_node *node)
376 return get_id_str(node->op->name);
379 ident *get_irn_opident(const ir_node *node)
382 return node->op->name;
385 ir_visited_t (get_irn_visited)(const ir_node *node)
387 return get_irn_visited_(node);
390 void (set_irn_visited)(ir_node *node, ir_visited_t visited)
392 set_irn_visited_(node, visited);
395 void (mark_irn_visited)(ir_node *node)
397 mark_irn_visited_(node);
400 int (irn_visited)(const ir_node *node)
402 return irn_visited_(node);
405 int (irn_visited_else_mark)(ir_node *node)
407 return irn_visited_else_mark_(node);
410 void (set_irn_link)(ir_node *node, void *link)
412 set_irn_link_(node, link);
415 void *(get_irn_link)(const ir_node *node)
417 return get_irn_link_(node);
420 op_pin_state (get_irn_pinned)(const ir_node *node)
422 return get_irn_pinned_(node);
425 op_pin_state (is_irn_pinned_in_irg) (const ir_node *node)
427 return is_irn_pinned_in_irg_(node);
430 void set_irn_pinned(ir_node *node, op_pin_state state)
432 /* due to optimization an opt may be turned into a Tuple */
436 assert(node && get_op_pinned(get_irn_op(node)) >= op_pin_state_exc_pinned);
437 assert(state == op_pin_state_pinned || state == op_pin_state_floats);
439 node->attr.except.pin_state = state;
442 long get_irn_node_nr(const ir_node *node)
445 return node->node_nr;
448 void *(get_irn_generic_attr)(ir_node *node)
450 assert(is_ir_node(node));
451 return get_irn_generic_attr_(node);
454 const void *(get_irn_generic_attr_const)(const ir_node *node)
456 assert(is_ir_node(node));
457 return get_irn_generic_attr_const_(node);
460 unsigned (get_irn_idx)(const ir_node *node)
462 assert(is_ir_node(node));
463 return get_irn_idx_(node);
466 int get_irn_pred_pos(ir_node *node, ir_node *arg)
469 for (i = get_irn_arity(node) - 1; i >= 0; i--) {
470 if (get_irn_n(node, i) == arg)
476 ir_node *(get_nodes_block)(const ir_node *node)
478 return get_nodes_block_(node);
481 void set_nodes_block(ir_node *node, ir_node *block)
483 assert(node->op != op_Block);
484 set_irn_n(node, -1, block);
487 ir_type *is_frame_pointer(const ir_node *n)
489 if (is_Proj(n) && (get_Proj_proj(n) == pn_Start_P_frame_base)) {
490 ir_node *start = get_Proj_pred(n);
491 if (is_Start(start)) {
492 return get_irg_frame_type(get_irn_irg(start));
498 ir_node **get_Block_cfgpred_arr(ir_node *node)
500 assert(is_Block(node));
501 return (ir_node **)&(get_irn_in(node)[1]);
504 int (get_Block_n_cfgpreds)(const ir_node *node)
506 return get_Block_n_cfgpreds_(node);
509 ir_node *(get_Block_cfgpred)(const ir_node *node, int pos)
511 return get_Block_cfgpred_(node, pos);
514 void set_Block_cfgpred(ir_node *node, int pos, ir_node *pred)
516 assert(is_Block(node));
517 set_irn_n(node, pos, pred);
520 int get_Block_cfgpred_pos(const ir_node *block, const ir_node *pred)
524 for (i = get_Block_n_cfgpreds(block) - 1; i >= 0; --i) {
525 if (get_Block_cfgpred_block(block, i) == pred)
531 ir_node *(get_Block_cfgpred_block)(const ir_node *node, int pos)
533 return get_Block_cfgpred_block_(node, pos);
536 int get_Block_matured(const ir_node *node)
538 assert(is_Block(node));
539 return (int)node->attr.block.is_matured;
542 void set_Block_matured(ir_node *node, int matured)
544 assert(is_Block(node));
545 node->attr.block.is_matured = matured;
548 ir_visited_t (get_Block_block_visited)(const ir_node *node)
550 return get_Block_block_visited_(node);
553 void (set_Block_block_visited)(ir_node *node, ir_visited_t visit)
555 set_Block_block_visited_(node, visit);
558 void (mark_Block_block_visited)(ir_node *node)
560 mark_Block_block_visited_(node);
563 int (Block_block_visited)(const ir_node *node)
565 return Block_block_visited_(node);
568 ir_graph *(get_Block_irg)(const ir_node *block)
570 return get_Block_irg_(block);
573 ir_entity *create_Block_entity(ir_node *block)
576 assert(is_Block(block));
578 entity = block->attr.block.entity;
579 if (entity == NULL) {
580 ir_label_t nr = get_irp_next_label_nr();
581 entity = new_label_entity(nr);
582 set_entity_visibility(entity, ir_visibility_local);
583 set_entity_linkage(entity, IR_LINKAGE_CONSTANT);
584 set_entity_compiler_generated(entity, 1);
586 block->attr.block.entity = entity;
591 ir_node *(get_Block_phis)(const ir_node *block)
593 return get_Block_phis_(block);
596 void (set_Block_phis)(ir_node *block, ir_node *phi)
598 set_Block_phis_(block, phi);
601 void (add_Block_phi)(ir_node *block, ir_node *phi)
603 add_Block_phi_(block, phi);
606 unsigned (get_Block_mark)(const ir_node *block)
608 return get_Block_mark_(block);
611 void (set_Block_mark)(ir_node *block, unsigned mark)
613 set_Block_mark_(block, mark);
616 int get_End_n_keepalives(const ir_node *end)
619 return (get_irn_arity(end) - END_KEEPALIVE_OFFSET);
622 ir_node *get_End_keepalive(const ir_node *end, int pos)
625 return get_irn_n(end, pos + END_KEEPALIVE_OFFSET);
628 void add_End_keepalive(ir_node *end, ir_node *ka)
634 void set_End_keepalive(ir_node *end, int pos, ir_node *ka)
637 set_irn_n(end, pos + END_KEEPALIVE_OFFSET, ka);
640 void set_End_keepalives(ir_node *end, int n, ir_node *in[])
644 ir_graph *irg = get_irn_irg(end);
646 /* notify that edges are deleted */
647 for (e = END_KEEPALIVE_OFFSET; e < ARR_LEN(end->in) - 1; ++e) {
648 edges_notify_edge(end, e, NULL, end->in[e + 1], irg);
650 ARR_RESIZE(ir_node *, end->in, n + 1 + END_KEEPALIVE_OFFSET);
652 for (i = 0; i < n; ++i) {
653 end->in[1 + END_KEEPALIVE_OFFSET + i] = in[i];
654 edges_notify_edge(end, END_KEEPALIVE_OFFSET + i, end->in[1 + END_KEEPALIVE_OFFSET + i], NULL, irg);
657 /* update irg flags */
658 clear_irg_properties(irg, IR_GRAPH_PROPERTY_CONSISTENT_OUTS);
661 void remove_End_keepalive(ir_node *end, ir_node *irn)
663 int n = get_End_n_keepalives(end);
668 for (i = n -1; i >= 0; --i) {
669 ir_node *old_ka = end->in[1 + END_KEEPALIVE_OFFSET + i];
679 irg = get_irn_irg(end);
681 /* remove the edge */
682 edges_notify_edge(end, idx, NULL, irn, irg);
685 /* exchange with the last one */
686 ir_node *old = end->in[1 + END_KEEPALIVE_OFFSET + n - 1];
687 edges_notify_edge(end, n - 1, NULL, old, irg);
688 end->in[1 + END_KEEPALIVE_OFFSET + idx] = old;
689 edges_notify_edge(end, idx, old, NULL, irg);
691 /* now n - 1 keeps, 1 block input */
692 ARR_RESIZE(ir_node *, end->in, (n - 1) + 1 + END_KEEPALIVE_OFFSET);
694 /* update irg flags */
695 clear_irg_properties(irg, IR_GRAPH_PROPERTY_CONSISTENT_OUTS);
698 void remove_End_Bads_and_doublets(ir_node *end)
701 int idx, n = get_End_n_keepalives(end);
703 bool changed = false;
708 irg = get_irn_irg(end);
709 pset_new_init(&keeps);
711 for (idx = n - 1; idx >= 0; --idx) {
712 ir_node *ka = get_End_keepalive(end, idx);
714 if (is_Bad(ka) || is_NoMem(ka) || pset_new_contains(&keeps, ka)) {
716 /* remove the edge */
717 edges_notify_edge(end, idx, NULL, ka, irg);
720 /* exchange with the last one */
721 ir_node *old = end->in[1 + END_KEEPALIVE_OFFSET + n - 1];
722 edges_notify_edge(end, n - 1, NULL, old, irg);
723 end->in[1 + END_KEEPALIVE_OFFSET + idx] = old;
724 edges_notify_edge(end, idx, old, NULL, irg);
728 pset_new_insert(&keeps, ka);
731 /* n keeps, 1 block input */
732 ARR_RESIZE(ir_node *, end->in, n + 1 + END_KEEPALIVE_OFFSET);
734 pset_new_destroy(&keeps);
737 clear_irg_properties(irg, IR_GRAPH_PROPERTY_CONSISTENT_OUTS);
741 void free_End(ir_node *end)
746 end->in = NULL; /* @@@ make sure we get an error if we use the
747 in array afterwards ... */
750 size_t get_Return_n_ress(const ir_node *node)
752 assert(is_Return(node));
753 return (size_t)(get_irn_arity(node) - RETURN_RESULT_OFFSET);
756 ir_node **get_Return_res_arr(ir_node *node)
758 assert(is_Return(node));
759 if (get_Return_n_ress(node) > 0)
760 return (ir_node **)&(get_irn_in(node)[1 + RETURN_RESULT_OFFSET]);
765 ir_node *get_Return_res(const ir_node *node, int pos)
767 assert(is_Return(node));
769 assert(get_Return_n_ress(node) > (size_t)pos);
770 return get_irn_n(node, pos + RETURN_RESULT_OFFSET);
773 void set_Return_res(ir_node *node, int pos, ir_node *res)
775 assert(is_Return(node));
776 set_irn_n(node, pos + RETURN_RESULT_OFFSET, res);
779 int (is_Const_null)(const ir_node *node)
781 return is_Const_null_(node);
784 int (is_Const_one)(const ir_node *node)
786 return is_Const_one_(node);
789 int (is_Const_all_one)(const ir_node *node)
791 return is_Const_all_one_(node);
796 symconst_kind get_SymConst_kind(const ir_node *node)
798 assert(is_SymConst(node));
799 return node->attr.symc.kind;
802 void set_SymConst_kind(ir_node *node, symconst_kind kind)
804 assert(is_SymConst(node));
805 node->attr.symc.kind = kind;
808 ir_type *get_SymConst_type(const ir_node *node)
810 /* the cast here is annoying, but we have to compensate for
812 ir_node *irn = (ir_node *)node;
813 assert(is_SymConst(node) &&
814 (SYMCONST_HAS_TYPE(get_SymConst_kind(node))));
815 return irn->attr.symc.sym.type_p;
818 void set_SymConst_type(ir_node *node, ir_type *tp)
820 assert(is_SymConst(node) &&
821 (SYMCONST_HAS_TYPE(get_SymConst_kind(node))));
822 node->attr.symc.sym.type_p = tp;
825 ir_entity *get_SymConst_entity(const ir_node *node)
827 assert(is_SymConst(node) && SYMCONST_HAS_ENT(get_SymConst_kind(node)));
828 return node->attr.symc.sym.entity_p;
831 void set_SymConst_entity(ir_node *node, ir_entity *ent)
833 assert(is_SymConst(node) && SYMCONST_HAS_ENT(get_SymConst_kind(node)));
834 node->attr.symc.sym.entity_p = ent;
837 ir_enum_const *get_SymConst_enum(const ir_node *node)
839 assert(is_SymConst(node) && SYMCONST_HAS_ENUM(get_SymConst_kind(node)));
840 return node->attr.symc.sym.enum_p;
843 void set_SymConst_enum(ir_node *node, ir_enum_const *ec)
845 assert(is_SymConst(node) && SYMCONST_HAS_ENUM(get_SymConst_kind(node)));
846 node->attr.symc.sym.enum_p = ec;
849 union symconst_symbol
850 get_SymConst_symbol(const ir_node *node)
852 assert(is_SymConst(node));
853 return node->attr.symc.sym;
856 void set_SymConst_symbol(ir_node *node, union symconst_symbol sym)
858 assert(is_SymConst(node));
859 node->attr.symc.sym = sym;
862 int get_Sel_n_indexs(const ir_node *node)
864 assert(is_Sel(node));
865 return (get_irn_arity(node) - SEL_INDEX_OFFSET);
868 ir_node **get_Sel_index_arr(ir_node *node)
870 assert(is_Sel(node));
871 if (get_Sel_n_indexs(node) > 0)
872 return (ir_node **)& get_irn_in(node)[SEL_INDEX_OFFSET + 1];
877 ir_node *get_Sel_index(const ir_node *node, int pos)
879 assert(is_Sel(node));
880 return get_irn_n(node, pos + SEL_INDEX_OFFSET);
883 void set_Sel_index(ir_node *node, int pos, ir_node *index)
885 assert(is_Sel(node));
886 set_irn_n(node, pos + SEL_INDEX_OFFSET, index);
889 ir_node **get_Call_param_arr(ir_node *node)
891 assert(is_Call(node));
892 return &get_irn_in(node)[CALL_PARAM_OFFSET + 1];
895 size_t get_Call_n_params(const ir_node *node)
897 assert(is_Call(node));
898 return (size_t) (get_irn_arity(node) - CALL_PARAM_OFFSET);
901 ir_node *get_Call_param(const ir_node *node, int pos)
903 assert(is_Call(node));
904 return get_irn_n(node, pos + CALL_PARAM_OFFSET);
907 void set_Call_param(ir_node *node, int pos, ir_node *param)
909 assert(is_Call(node));
910 set_irn_n(node, pos + CALL_PARAM_OFFSET, param);
913 ir_node **get_Builtin_param_arr(ir_node *node)
915 assert(is_Builtin(node));
916 return &get_irn_in(node)[BUILTIN_PARAM_OFFSET + 1];
919 int get_Builtin_n_params(const ir_node *node)
921 assert(is_Builtin(node));
922 return (get_irn_arity(node) - BUILTIN_PARAM_OFFSET);
925 ir_node *get_Builtin_param(const ir_node *node, int pos)
927 assert(is_Builtin(node));
928 return get_irn_n(node, pos + BUILTIN_PARAM_OFFSET);
931 void set_Builtin_param(ir_node *node, int pos, ir_node *param)
933 assert(is_Builtin(node));
934 set_irn_n(node, pos + BUILTIN_PARAM_OFFSET, param);
937 const char *get_builtin_kind_name(ir_builtin_kind kind)
939 #define X(a) case a: return #a
943 X(ir_bk_return_address);
944 X(ir_bk_frame_address);
954 X(ir_bk_inner_trampoline);
961 int Call_has_callees(const ir_node *node)
963 assert(is_Call(node));
964 return ((get_irg_callee_info_state(get_irn_irg(node)) != irg_callee_info_none) &&
965 (node->attr.call.callee_arr != NULL));
968 size_t get_Call_n_callees(const ir_node *node)
970 assert(is_Call(node) && node->attr.call.callee_arr);
971 return ARR_LEN(node->attr.call.callee_arr);
974 ir_entity *get_Call_callee(const ir_node *node, size_t pos)
976 assert(pos < get_Call_n_callees(node));
977 return node->attr.call.callee_arr[pos];
980 void set_Call_callee_arr(ir_node *node, size_t n, ir_entity ** arr)
982 ir_graph *irg = get_irn_irg(node);
984 assert(is_Call(node));
985 if (node->attr.call.callee_arr == NULL || get_Call_n_callees(node) != n) {
986 node->attr.call.callee_arr = NEW_ARR_D(ir_entity *, irg->obst, n);
988 memcpy(node->attr.call.callee_arr, arr, n * sizeof(ir_entity *));
991 void remove_Call_callee_arr(ir_node *node)
993 assert(is_Call(node));
994 node->attr.call.callee_arr = NULL;
997 int is_Cast_upcast(ir_node *node)
999 ir_type *totype = get_Cast_type(node);
1000 ir_type *fromtype = get_irn_typeinfo_type(get_Cast_op(node));
1002 assert(get_irg_typeinfo_state(get_irn_irg(node)) == ir_typeinfo_consistent);
1005 while (is_Pointer_type(totype) && is_Pointer_type(fromtype)) {
1006 totype = get_pointer_points_to_type(totype);
1007 fromtype = get_pointer_points_to_type(fromtype);
1012 if (!is_Class_type(totype)) return 0;
1013 return is_SubClass_of(fromtype, totype);
1016 int is_Cast_downcast(ir_node *node)
1018 ir_type *totype = get_Cast_type(node);
1019 ir_type *fromtype = get_irn_typeinfo_type(get_Cast_op(node));
1021 assert(get_irg_typeinfo_state(get_irn_irg(node)) == ir_typeinfo_consistent);
1024 while (is_Pointer_type(totype) && is_Pointer_type(fromtype)) {
1025 totype = get_pointer_points_to_type(totype);
1026 fromtype = get_pointer_points_to_type(fromtype);
1031 if (!is_Class_type(totype)) return 0;
1032 return is_SubClass_of(totype, fromtype);
1035 int (is_unop)(const ir_node *node)
1037 return is_unop_(node);
1040 ir_node *get_unop_op(const ir_node *node)
1042 if (node->op->opar == oparity_unary)
1043 return get_irn_n(node, node->op->op_index);
1045 assert(node->op->opar == oparity_unary);
1049 void set_unop_op(ir_node *node, ir_node *op)
1051 if (node->op->opar == oparity_unary)
1052 set_irn_n(node, node->op->op_index, op);
1054 assert(node->op->opar == oparity_unary);
1057 int (is_binop)(const ir_node *node)
1059 return is_binop_(node);
1062 ir_node *get_binop_left(const ir_node *node)
1064 assert(node->op->opar == oparity_binary);
1065 return get_irn_n(node, node->op->op_index);
1068 void set_binop_left(ir_node *node, ir_node *left)
1070 assert(node->op->opar == oparity_binary);
1071 set_irn_n(node, node->op->op_index, left);
1074 ir_node *get_binop_right(const ir_node *node)
1076 assert(node->op->opar == oparity_binary);
1077 return get_irn_n(node, node->op->op_index + 1);
1080 void set_binop_right(ir_node *node, ir_node *right)
1082 assert(node->op->opar == oparity_binary);
1083 set_irn_n(node, node->op->op_index + 1, right);
1086 ir_node **get_Phi_preds_arr(ir_node *node)
1088 assert(is_Phi(node));
1089 return (ir_node **)&(get_irn_in(node)[1]);
1092 int get_Phi_n_preds(const ir_node *node)
1094 assert(is_Phi(node));
1095 return get_irn_arity(node);
1098 ir_node *get_Phi_pred(const ir_node *node, int pos)
1100 assert(is_Phi(node));
1101 return get_irn_n(node, pos);
1104 void set_Phi_pred(ir_node *node, int pos, ir_node *pred)
1106 assert(is_Phi(node));
1107 set_irn_n(node, pos, pred);
1110 ir_node *(get_Phi_next)(const ir_node *phi)
1112 return get_Phi_next_(phi);
1115 void (set_Phi_next)(ir_node *phi, ir_node *next)
1117 set_Phi_next_(phi, next);
1120 int is_memop(const ir_node *node)
1122 return is_op_uses_memory(get_irn_op(node));
1125 ir_node *get_memop_mem(const ir_node *node)
1127 const ir_op *op = get_irn_op(node);
1128 assert(is_memop(node));
1129 return get_irn_n(node, op->memory_index);
1132 void set_memop_mem(ir_node *node, ir_node *mem)
1134 const ir_op *op = get_irn_op(node);
1135 assert(is_memop(node));
1136 set_irn_n(node, op->memory_index, mem);
1139 ir_node **get_Sync_preds_arr(ir_node *node)
1141 assert(is_Sync(node));
1142 return (ir_node **)&(get_irn_in(node)[1]);
1145 int get_Sync_n_preds(const ir_node *node)
1147 assert(is_Sync(node));
1148 return (get_irn_arity(node));
1151 ir_node *get_Sync_pred(const ir_node *node, int pos)
1153 assert(is_Sync(node));
1154 return get_irn_n(node, pos);
1157 void set_Sync_pred(ir_node *node, int pos, ir_node *pred)
1159 assert(is_Sync(node));
1160 set_irn_n(node, pos, pred);
1163 void add_Sync_pred(ir_node *node, ir_node *pred)
1165 assert(is_Sync(node));
1166 add_irn_n(node, pred);
1169 int (is_arg_Proj)(const ir_node *node)
1171 return is_arg_Proj_(node);
1174 int is_x_except_Proj(const ir_node *node)
1179 pred = get_Proj_pred(node);
1180 if (!is_fragile_op(pred))
1182 return get_Proj_proj(node) == pred->op->pn_x_except;
1185 int is_x_regular_Proj(const ir_node *node)
1190 pred = get_Proj_pred(node);
1191 if (!is_fragile_op(pred))
1193 return get_Proj_proj(node) == pred->op->pn_x_regular;
1196 void ir_set_throws_exception(ir_node *node, int throws_exception)
1198 except_attr *attr = &node->attr.except;
1199 assert(is_fragile_op(node));
1200 attr->throws_exception = throws_exception;
1203 int ir_throws_exception(const ir_node *node)
1205 const except_attr *attr = &node->attr.except;
1206 assert(is_fragile_op(node));
1207 return attr->throws_exception;
1210 ir_node **get_Tuple_preds_arr(ir_node *node)
1212 assert(is_Tuple(node));
1213 return (ir_node **)&(get_irn_in(node)[1]);
1216 int get_Tuple_n_preds(const ir_node *node)
1218 assert(is_Tuple(node));
1219 return get_irn_arity(node);
1222 ir_node *get_Tuple_pred(const ir_node *node, int pos)
1224 assert(is_Tuple(node));
1225 return get_irn_n(node, pos);
1228 void set_Tuple_pred(ir_node *node, int pos, ir_node *pred)
1230 assert(is_Tuple(node));
1231 set_irn_n(node, pos, pred);
1234 size_t get_ASM_n_input_constraints(const ir_node *node)
1236 assert(is_ASM(node));
1237 return ARR_LEN(node->attr.assem.input_constraints);
1240 size_t get_ASM_n_output_constraints(const ir_node *node)
1242 assert(is_ASM(node));
1243 return ARR_LEN(node->attr.assem.output_constraints);
1246 size_t get_ASM_n_clobbers(const ir_node *node)
1248 assert(is_ASM(node));
1249 return ARR_LEN(node->attr.assem.clobbers);
1252 ir_graph *(get_irn_irg)(const ir_node *node)
1254 return get_irn_irg_(node);
1257 ir_node *skip_Proj(ir_node *node)
1259 /* don't assert node !!! */
1264 node = get_Proj_pred(node);
1270 skip_Proj_const(const ir_node *node)
1272 /* don't assert node !!! */
1277 node = get_Proj_pred(node);
1282 ir_node *skip_Tuple(ir_node *node)
1287 if (is_Proj(node)) {
1288 pred = get_Proj_pred(node);
1290 if (is_Proj(pred)) { /* nested Tuple ? */
1291 pred = skip_Tuple(pred);
1293 if (is_Tuple(pred)) {
1294 node = get_Tuple_pred(pred, get_Proj_proj(node));
1297 } else if (is_Tuple(pred)) {
1298 node = get_Tuple_pred(pred, get_Proj_proj(node));
1305 ir_node *skip_Cast(ir_node *node)
1308 return get_Cast_op(node);
1312 const ir_node *skip_Cast_const(const ir_node *node)
1315 return get_Cast_op(node);
1319 ir_node *skip_Pin(ir_node *node)
1322 return get_Pin_op(node);
1326 ir_node *skip_Confirm(ir_node *node)
1328 if (is_Confirm(node))
1329 return get_Confirm_value(node);
1333 ir_node *skip_HighLevel_ops(ir_node *node)
1335 while (is_op_highlevel(get_irn_op(node))) {
1336 node = get_irn_n(node, 0);
1342 ir_node *skip_Id(ir_node *node)
1344 /* This should compact Id-cycles to self-cycles. It has the same (or less?) complexity
1345 * than any other approach, as Id chains are resolved and all point to the real node, or
1346 * all id's are self loops.
1348 * Note: This function takes 10% of mostly ANY the compiler run, so it's
1349 * a little bit "hand optimized".
1352 /* don't assert node !!! */
1354 if (!node || (node->op != op_Id)) return node;
1356 /* Don't use get_Id_pred(): We get into an endless loop for
1357 self-referencing Ids. */
1358 pred = node->in[0+1];
1360 if (pred->op != op_Id) return pred;
1362 if (node != pred) { /* not a self referencing Id. Resolve Id chain. */
1363 ir_node *rem_pred, *res;
1365 if (pred->op != op_Id) return pred; /* shortcut */
1368 assert(get_irn_arity (node) > 0);
1370 node->in[0+1] = node; /* turn us into a self referencing Id: shorten Id cycles. */
1371 res = skip_Id(rem_pred);
1372 if (is_Id(res)) /* self-loop */ return node;
1374 node->in[0+1] = res; /* Turn Id chain into Ids all referencing the chain end. */
1381 int (is_strictConv)(const ir_node *node)
1383 return is_strictConv_(node);
1386 int (is_SymConst_addr_ent)(const ir_node *node)
1388 return is_SymConst_addr_ent_(node);
1391 int is_cfop(const ir_node *node)
1393 if (is_fragile_op(node) && ir_throws_exception(node))
1396 return is_op_cfopcode(get_irn_op(node));
1399 int is_unknown_jump(const ir_node *node)
1401 return is_op_unknown_jump(get_irn_op(node));
1404 int is_fragile_op(const ir_node *node)
1406 return is_op_fragile(get_irn_op(node));
1409 int (is_irn_forking)(const ir_node *node)
1411 return is_irn_forking_(node);
1414 void (copy_node_attr)(ir_graph *irg, const ir_node *old_node, ir_node *new_node)
1416 copy_node_attr_(irg, old_node, new_node);
1419 ir_type *(get_irn_type_attr)(ir_node *node)
1421 return get_irn_type_attr_(node);
1424 ir_entity *(get_irn_entity_attr)(ir_node *node)
1426 return get_irn_entity_attr_(node);
1429 int (is_irn_constlike)(const ir_node *node)
1431 return is_irn_constlike_(node);
1434 int (is_irn_keep)(const ir_node *node)
1436 return is_irn_keep_(node);
1439 int (is_irn_start_block_placed)(const ir_node *node)
1441 return is_irn_start_block_placed_(node);
1444 int (is_irn_cse_neutral)(const ir_node *node)
1446 return is_irn_cse_neutral_(node);
1449 const char *get_cond_jmp_predicate_name(cond_jmp_predicate pred)
1451 #define X(a) case a: return #a
1453 X(COND_JMP_PRED_NONE);
1454 X(COND_JMP_PRED_TRUE);
1455 X(COND_JMP_PRED_FALSE);
1461 /** Return the attribute type of a SymConst node if exists */
1462 static ir_type *get_SymConst_attr_type(const ir_node *self)
1464 symconst_kind kind = get_SymConst_kind(self);
1465 if (SYMCONST_HAS_TYPE(kind))
1466 return get_SymConst_type(self);
1470 /** Return the attribute entity of a SymConst node if exists */
1471 static ir_entity *get_SymConst_attr_entity(const ir_node *self)
1473 symconst_kind kind = get_SymConst_kind(self);
1474 if (SYMCONST_HAS_ENT(kind))
1475 return get_SymConst_entity(self);
1479 static void register_get_type_func(ir_op *op, get_type_attr_func func)
1481 op->ops.get_type_attr = func;
1484 static void register_get_entity_func(ir_op *op, get_entity_attr_func func)
1486 op->ops.get_entity_attr = func;
1489 void ir_register_getter_ops(void)
1491 register_get_type_func(op_Alloc, get_Alloc_type);
1492 register_get_type_func(op_Builtin, get_Builtin_type);
1493 register_get_type_func(op_Call, get_Call_type);
1494 register_get_type_func(op_Cast, get_Cast_type);
1495 register_get_type_func(op_CopyB, get_CopyB_type);
1496 register_get_type_func(op_Free, get_Free_type);
1497 register_get_type_func(op_InstOf, get_InstOf_type);
1498 register_get_type_func(op_SymConst, get_SymConst_attr_type);
1500 register_get_entity_func(op_SymConst, get_SymConst_attr_entity);
1501 register_get_entity_func(op_Sel, get_Sel_entity);
1502 register_get_entity_func(op_Block, get_Block_entity);
1505 void (set_irn_dbg_info)(ir_node *n, dbg_info *db)
1507 set_irn_dbg_info_(n, db);
1510 dbg_info *(get_irn_dbg_info)(const ir_node *n)
1512 return get_irn_dbg_info_(n);
1515 ir_switch_table *ir_new_switch_table(ir_graph *irg, size_t n_entries)
1517 struct obstack *obst = get_irg_obstack(irg);
1518 ir_switch_table *res = OALLOCFZ(obst, ir_switch_table, entries, n_entries);
1519 res->n_entries = n_entries;
1523 void ir_switch_table_set(ir_switch_table *table, size_t n,
1524 ir_tarval *min, ir_tarval *max, long pn)
1526 ir_switch_table_entry *entry = ir_switch_table_get_entry(table, n);
1532 size_t (ir_switch_table_get_n_entries)(const ir_switch_table *table)
1534 return ir_switch_table_get_n_entries_(table);
1537 ir_tarval *ir_switch_table_get_max(const ir_switch_table *table, size_t e)
1539 return ir_switch_table_get_entry_const(table, e)->max;
1542 ir_tarval *ir_switch_table_get_min(const ir_switch_table *table, size_t e)
1544 return ir_switch_table_get_entry_const(table, e)->min;
1547 long ir_switch_table_get_pn(const ir_switch_table *table, size_t e)
1549 return ir_switch_table_get_entry_const(table, e)->pn;
1552 ir_switch_table *ir_switch_table_duplicate(ir_graph *irg,
1553 const ir_switch_table *table)
1555 size_t n_entries = ir_switch_table_get_n_entries(table);
1557 ir_switch_table *res = ir_new_switch_table(irg, n_entries);
1558 for (e = 0; e < n_entries; ++e) {
1559 const ir_switch_table_entry *entry
1560 = ir_switch_table_get_entry_const(table, e);
1561 ir_switch_table_entry *new_entry = ir_switch_table_get_entry(res, e);
1562 *new_entry = *entry;
1567 /* include generated code */
1568 #include "gen_irnode.c.inl"