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 END_KEEPALIVE_OFFSET 0
53 static const char *relation_names [] = {
65 "unordered_less_equal",
67 "unordered_greater_equal",
72 const char *get_relation_string(ir_relation relation)
74 assert(relation < (ir_relation)ARRAY_SIZE(relation_names));
75 return relation_names[relation];
78 ir_relation get_negated_relation(ir_relation relation)
80 return relation ^ ir_relation_true;
83 ir_relation get_inversed_relation(ir_relation relation)
85 ir_relation code = relation & ~(ir_relation_less|ir_relation_greater);
86 bool less = relation & ir_relation_less;
87 bool greater = relation & ir_relation_greater;
88 code |= (less ? ir_relation_greater : ir_relation_false)
89 | (greater ? ir_relation_less : ir_relation_false);
93 ir_node *new_ir_node(dbg_info *db, ir_graph *irg, ir_node *block, ir_op *op,
94 ir_mode *mode, int arity, ir_node *const *in)
102 size_t const node_size = offsetof(ir_node, attr) + op->attr_size;
103 ir_node *const res = (ir_node*)OALLOCNZ(get_irg_obstack(irg), char, node_size);
105 res->kind = k_ir_node;
109 res->node_idx = irg_register_node_idx(irg, res);
114 res->in = NEW_ARR_F(ir_node *, 1); /* 1: space for block */
116 /* not nice but necessary: End and Sync must always have a flexible array */
117 if (op == op_End || op == op_Sync)
118 res->in = NEW_ARR_F(ir_node *, (arity+1));
120 res->in = NEW_ARR_D(ir_node*, get_irg_obstack(irg), arity + 1);
121 memcpy(&res->in[1], in, sizeof(ir_node *) * arity);
125 set_irn_dbg_info(res, db);
126 res->node_nr = get_irp_new_node_nr();
128 for (i = 0; i < EDGE_KIND_LAST; ++i) {
129 INIT_LIST_HEAD(&res->edge_info[i].outs_head);
130 /* edges will be build immediately */
131 res->edge_info[i].edges_built = 1;
132 res->edge_info[i].out_count = 0;
135 /* don't put this into the for loop, arity is -1 for some nodes! */
137 edges_notify_edge(res, -1, block, NULL, irg);
138 for (i = 1; i <= arity; ++i)
139 edges_notify_edge(res, i - 1, res->in[i], NULL, irg);
141 hook_new_node(irg, res);
142 if (irg_is_constrained(irg, IR_GRAPH_CONSTRAINT_BACKEND)) {
143 be_info_new_node(irg, res);
149 int (is_ir_node)(const void *thing)
151 return is_ir_node_(thing);
154 int (get_irn_arity)(const ir_node *node)
156 return get_irn_arity_(node);
159 ir_node **get_irn_in(const ir_node *node)
164 void set_irn_in(ir_node *const node, int const arity, ir_node *const *const in)
168 ir_graph *irg = get_irn_irg(node);
173 assert(node != NULL && node->kind == k_ir_node);
175 for (i = 0; i < arity; ++i) {
176 assert(in[i] != NULL && in[0]->kind == k_ir_node);
180 for (i = 0; i < arity; i++) {
181 if (i < (int)ARR_LEN(*pOld_in)-1)
182 edges_notify_edge(node, i, in[i], (*pOld_in)[i+1], irg);
184 edges_notify_edge(node, i, in[i], NULL, irg);
186 for (;i < (int)ARR_LEN(*pOld_in)-1; i++) {
187 edges_notify_edge(node, i, NULL, (*pOld_in)[i+1], irg);
190 if (arity != (int)ARR_LEN(*pOld_in) - 1) {
191 ir_node * block = (*pOld_in)[0];
192 *pOld_in = NEW_ARR_D(ir_node*, get_irg_obstack(irg), arity + 1);
193 (*pOld_in)[0] = block;
195 fix_backedges(get_irg_obstack(irg), node);
197 memcpy((*pOld_in) + 1, in, sizeof(ir_node *) * arity);
199 /* update irg flags */
200 clear_irg_properties(irg, IR_GRAPH_PROPERTY_CONSISTENT_OUTS | IR_GRAPH_PROPERTY_CONSISTENT_LOOPINFO);
203 ir_node *(get_irn_n)(const ir_node *node, int n)
205 return get_irn_n_(node, n);
208 void set_irn_n(ir_node *node, int n, ir_node *in)
210 ir_graph *irg = get_irn_irg(node);
211 assert(node && node->kind == k_ir_node);
213 assert(n < get_irn_arity(node));
214 assert(in && in->kind == k_ir_node);
217 hook_set_irn_n(node, n, in, node->in[n + 1]);
219 /* Here, we rely on src and tgt being in the current ir graph */
220 edges_notify_edge(node, n, in, node->in[n + 1], irg);
222 node->in[n + 1] = in;
224 /* update irg flags */
225 clear_irg_properties(irg, IR_GRAPH_PROPERTY_CONSISTENT_OUTS | IR_GRAPH_PROPERTY_CONSISTENT_LOOPINFO);
228 int add_irn_n(ir_node *node, ir_node *in)
231 ir_graph *irg = get_irn_irg(node);
233 assert(node->op->opar == oparity_dynamic);
234 pos = ARR_LEN(node->in) - 1;
235 ARR_APP1(ir_node *, node->in, in);
236 edges_notify_edge(node, pos, node->in[pos + 1], NULL, irg);
239 hook_set_irn_n(node, pos, node->in[pos + 1], NULL);
241 /* update irg flags */
242 clear_irg_properties(irg, IR_GRAPH_PROPERTY_CONSISTENT_OUTS);
247 static void del_irn_n(ir_node *node, int n)
249 ir_graph *irg = get_irn_irg(node);
251 /* remove the edge */
252 ir_node *pred = node->in[n+1];
253 edges_notify_edge(node, n, NULL, pred, irg);
255 int arity = get_irn_arity(node);
257 /* exchange with the last one */
258 ir_node *old = node->in[arity];
259 edges_notify_edge(node, arity-1, NULL, old, irg);
261 edges_notify_edge(node, n, old, NULL, irg);
263 ARR_SHRINKLEN(node->in, arity);
265 /* update irg flags */
266 clear_irg_properties(irg, IR_GRAPH_PROPERTY_CONSISTENT_OUTS);
269 void del_Sync_n(ir_node *n, int i)
274 int (get_irn_deps)(const ir_node *node)
276 return get_irn_deps_(node);
279 ir_node *(get_irn_dep)(const ir_node *node, int pos)
281 return get_irn_dep_(node, pos);
284 void set_irn_dep(ir_node *node, int pos, ir_node *dep)
289 assert(node->deps && "dependency array node yet allocated. use add_irn_dep()");
290 assert(pos >= 0 && pos < (int)ARR_LEN(node->deps) && "dependency index out of range");
292 old = node->deps[pos];
293 node->deps[pos] = dep;
294 irg = get_irn_irg(node);
295 if (edges_activated_kind(irg, EDGE_KIND_DEP))
296 edges_notify_edge_kind(node, pos, dep, old, EDGE_KIND_DEP, irg);
299 void add_irn_dep(ir_node *node, ir_node *dep)
303 if (node->deps == NULL) {
304 node->deps = NEW_ARR_F(ir_node *, 0);
306 ARR_APP1(ir_node*, node->deps, dep);
307 irg = get_irn_irg(node);
308 if (edges_activated_kind(irg, EDGE_KIND_DEP))
309 edges_notify_edge_kind(node, ARR_LEN(node->deps)-1, dep, NULL, EDGE_KIND_DEP, irg);
312 void delete_irn_dep(ir_node *node, ir_node *dep)
316 if (node->deps == NULL)
319 n_deps = ARR_LEN(node->deps);
320 for (i = 0; i < n_deps; ++i) {
321 if (node->deps[i] == dep) {
322 set_irn_dep(node, i, node->deps[n_deps-1]);
323 edges_notify_edge(node, i, NULL, dep, get_irn_irg(node));
324 ARR_SHRINKLEN(node->deps, n_deps-1);
330 void add_irn_deps(ir_node *tgt, ir_node *src)
334 for (i = 0, n = get_irn_deps(src); i < n; ++i)
335 add_irn_dep(tgt, get_irn_dep(src, i));
339 ir_mode *(get_irn_mode)(const ir_node *node)
341 return get_irn_mode_(node);
344 void (set_irn_mode)(ir_node *node, ir_mode *mode)
346 set_irn_mode_(node, mode);
349 ir_op *(get_irn_op)(const ir_node *node)
351 return get_irn_op_(node);
354 void (set_irn_op)(ir_node *node, ir_op *op)
356 set_irn_op_(node, op);
359 unsigned (get_irn_opcode)(const ir_node *node)
361 return get_irn_opcode_(node);
364 const char *get_irn_opname(const ir_node *node)
366 return get_id_str(node->op->name);
369 ident *get_irn_opident(const ir_node *node)
372 return node->op->name;
375 ir_visited_t (get_irn_visited)(const ir_node *node)
377 return get_irn_visited_(node);
380 void (set_irn_visited)(ir_node *node, ir_visited_t visited)
382 set_irn_visited_(node, visited);
385 void (mark_irn_visited)(ir_node *node)
387 mark_irn_visited_(node);
390 int (irn_visited)(const ir_node *node)
392 return irn_visited_(node);
395 int (irn_visited_else_mark)(ir_node *node)
397 return irn_visited_else_mark_(node);
400 void (set_irn_link)(ir_node *node, void *link)
402 set_irn_link_(node, link);
405 void *(get_irn_link)(const ir_node *node)
407 return get_irn_link_(node);
410 op_pin_state (get_irn_pinned)(const ir_node *node)
412 return get_irn_pinned_(node);
415 op_pin_state (is_irn_pinned_in_irg) (const ir_node *node)
417 return is_irn_pinned_in_irg_(node);
420 void set_irn_pinned(ir_node *node, op_pin_state state)
422 /* due to optimization an opt may be turned into a Tuple */
426 assert(node && get_op_pinned(get_irn_op(node)) >= op_pin_state_exc_pinned);
427 assert(state == op_pin_state_pinned || state == op_pin_state_floats);
429 node->attr.except.pin_state = state;
432 long get_irn_node_nr(const ir_node *node)
435 return node->node_nr;
438 void *(get_irn_generic_attr)(ir_node *node)
440 assert(is_ir_node(node));
441 return get_irn_generic_attr_(node);
444 const void *(get_irn_generic_attr_const)(const ir_node *node)
446 assert(is_ir_node(node));
447 return get_irn_generic_attr_const_(node);
450 unsigned (get_irn_idx)(const ir_node *node)
452 assert(is_ir_node(node));
453 return get_irn_idx_(node);
456 ir_node *(get_nodes_block)(const ir_node *node)
458 return get_nodes_block_(node);
461 void set_nodes_block(ir_node *node, ir_node *block)
463 assert(!is_Block(node));
464 set_irn_n(node, -1, block);
467 ir_type *is_frame_pointer(const ir_node *n)
469 if (is_Proj(n) && (get_Proj_proj(n) == pn_Start_P_frame_base)) {
470 ir_node *start = get_Proj_pred(n);
471 if (is_Start(start)) {
472 return get_irg_frame_type(get_irn_irg(start));
478 int get_Block_cfgpred_pos(const ir_node *block, const ir_node *pred)
482 for (i = get_Block_n_cfgpreds(block) - 1; i >= 0; --i) {
483 if (get_Block_cfgpred_block(block, i) == pred)
489 ir_node *(get_Block_cfgpred_block)(const ir_node *node, int pos)
491 return get_Block_cfgpred_block_(node, pos);
494 int get_Block_matured(const ir_node *node)
496 assert(is_Block(node));
497 return (int)node->attr.block.is_matured;
500 void set_Block_matured(ir_node *node, int matured)
502 assert(is_Block(node));
503 node->attr.block.is_matured = matured;
506 ir_visited_t (get_Block_block_visited)(const ir_node *node)
508 return get_Block_block_visited_(node);
511 void (set_Block_block_visited)(ir_node *node, ir_visited_t visit)
513 set_Block_block_visited_(node, visit);
516 void (mark_Block_block_visited)(ir_node *node)
518 mark_Block_block_visited_(node);
521 int (Block_block_visited)(const ir_node *node)
523 return Block_block_visited_(node);
526 ir_graph *(get_Block_irg)(const ir_node *block)
528 return get_Block_irg_(block);
531 ir_entity *create_Block_entity(ir_node *block)
534 assert(is_Block(block));
536 entity = block->attr.block.entity;
537 if (entity == NULL) {
538 ir_label_t nr = get_irp_next_label_nr();
539 entity = new_label_entity(nr);
540 set_entity_visibility(entity, ir_visibility_local);
541 set_entity_linkage(entity, IR_LINKAGE_CONSTANT);
542 set_entity_compiler_generated(entity, 1);
544 block->attr.block.entity = entity;
549 ir_node *(get_Block_phis)(const ir_node *block)
551 return get_Block_phis_(block);
554 void (set_Block_phis)(ir_node *block, ir_node *phi)
556 set_Block_phis_(block, phi);
559 void (add_Block_phi)(ir_node *block, ir_node *phi)
561 add_Block_phi_(block, phi);
564 unsigned (get_Block_mark)(const ir_node *block)
566 return get_Block_mark_(block);
569 void (set_Block_mark)(ir_node *block, unsigned mark)
571 set_Block_mark_(block, mark);
574 void add_End_keepalive(ir_node *end, ir_node *ka)
580 void set_End_keepalives(ir_node *end, int n, ir_node *in[])
584 ir_graph *irg = get_irn_irg(end);
586 /* notify that edges are deleted */
587 for (e = END_KEEPALIVE_OFFSET; e < ARR_LEN(end->in) - 1; ++e) {
588 edges_notify_edge(end, e, NULL, end->in[e + 1], irg);
590 ARR_RESIZE(ir_node *, end->in, n + 1 + END_KEEPALIVE_OFFSET);
592 for (i = 0; i < n; ++i) {
593 end->in[1 + END_KEEPALIVE_OFFSET + i] = in[i];
594 edges_notify_edge(end, END_KEEPALIVE_OFFSET + i, end->in[1 + END_KEEPALIVE_OFFSET + i], NULL, irg);
597 /* update irg flags */
598 clear_irg_properties(irg, IR_GRAPH_PROPERTY_CONSISTENT_OUTS);
601 void remove_End_keepalive(ir_node *end, ir_node *irn)
603 int n = get_End_n_keepalives(end);
609 ir_node *old_ka = end->in[1 + END_KEEPALIVE_OFFSET + i];
613 idx = END_KEEPALIVE_OFFSET + i;
621 void remove_End_Bads_and_doublets(ir_node *end)
624 int idx, n = get_End_n_keepalives(end);
626 bool changed = false;
631 irg = get_irn_irg(end);
632 pset_new_init(&keeps);
634 for (idx = n - 1; idx >= 0; --idx) {
635 ir_node *ka = get_End_keepalive(end, idx);
637 if (is_Bad(ka) || is_NoMem(ka) || pset_new_contains(&keeps, ka)) {
639 del_irn_n(end, idx - END_KEEPALIVE_OFFSET);
642 pset_new_insert(&keeps, ka);
645 pset_new_destroy(&keeps);
648 clear_irg_properties(irg, IR_GRAPH_PROPERTY_CONSISTENT_OUTS);
652 void free_End(ir_node *end)
657 end->in = NULL; /* @@@ make sure we get an error if we use the
658 in array afterwards ... */
661 int (is_Const_null)(const ir_node *node)
663 return is_Const_null_(node);
666 int (is_Const_one)(const ir_node *node)
668 return is_Const_one_(node);
671 int (is_Const_all_one)(const ir_node *node)
673 return is_Const_all_one_(node);
678 symconst_kind get_SymConst_kind(const ir_node *node)
680 assert(is_SymConst(node));
681 return node->attr.symc.kind;
684 void set_SymConst_kind(ir_node *node, symconst_kind kind)
686 assert(is_SymConst(node));
687 node->attr.symc.kind = kind;
690 ir_type *get_SymConst_type(const ir_node *node)
692 /* the cast here is annoying, but we have to compensate for
694 ir_node *irn = (ir_node *)node;
695 assert(is_SymConst(node) &&
696 (SYMCONST_HAS_TYPE(get_SymConst_kind(node))));
697 return irn->attr.symc.sym.type_p;
700 void set_SymConst_type(ir_node *node, ir_type *tp)
702 assert(is_SymConst(node) &&
703 (SYMCONST_HAS_TYPE(get_SymConst_kind(node))));
704 node->attr.symc.sym.type_p = tp;
707 ir_entity *get_SymConst_entity(const ir_node *node)
709 assert(is_SymConst(node) && SYMCONST_HAS_ENT(get_SymConst_kind(node)));
710 return node->attr.symc.sym.entity_p;
713 void set_SymConst_entity(ir_node *node, ir_entity *ent)
715 assert(is_SymConst(node) && SYMCONST_HAS_ENT(get_SymConst_kind(node)));
716 node->attr.symc.sym.entity_p = ent;
719 ir_enum_const *get_SymConst_enum(const ir_node *node)
721 assert(is_SymConst(node) && SYMCONST_HAS_ENUM(get_SymConst_kind(node)));
722 return node->attr.symc.sym.enum_p;
725 void set_SymConst_enum(ir_node *node, ir_enum_const *ec)
727 assert(is_SymConst(node) && SYMCONST_HAS_ENUM(get_SymConst_kind(node)));
728 node->attr.symc.sym.enum_p = ec;
731 union symconst_symbol
732 get_SymConst_symbol(const ir_node *node)
734 assert(is_SymConst(node));
735 return node->attr.symc.sym;
738 void set_SymConst_symbol(ir_node *node, union symconst_symbol sym)
740 assert(is_SymConst(node));
741 node->attr.symc.sym = sym;
744 const char *get_builtin_kind_name(ir_builtin_kind kind)
746 #define X(a) case a: return #a
750 X(ir_bk_return_address);
751 X(ir_bk_frame_address);
761 X(ir_bk_inner_trampoline);
768 int Call_has_callees(const ir_node *node)
770 assert(is_Call(node));
771 return ((get_irg_callee_info_state(get_irn_irg(node)) != irg_callee_info_none) &&
772 (node->attr.call.callee_arr != NULL));
775 size_t get_Call_n_callees(const ir_node *node)
777 assert(is_Call(node) && node->attr.call.callee_arr);
778 return ARR_LEN(node->attr.call.callee_arr);
781 ir_entity *get_Call_callee(const ir_node *node, size_t pos)
783 assert(pos < get_Call_n_callees(node));
784 return node->attr.call.callee_arr[pos];
787 void set_Call_callee_arr(ir_node *node, size_t n, ir_entity ** arr)
789 assert(is_Call(node));
790 if (node->attr.call.callee_arr == NULL || get_Call_n_callees(node) != n) {
791 ir_graph *const irg = get_irn_irg(node);
792 node->attr.call.callee_arr = NEW_ARR_D(ir_entity*, get_irg_obstack(irg), n);
794 memcpy(node->attr.call.callee_arr, arr, n * sizeof(ir_entity *));
797 void remove_Call_callee_arr(ir_node *node)
799 assert(is_Call(node));
800 node->attr.call.callee_arr = NULL;
803 int (is_unop)(const ir_node *node)
805 return is_unop_(node);
808 ir_node *get_unop_op(const ir_node *node)
810 if (node->op->opar == oparity_unary)
811 return get_irn_n(node, node->op->op_index);
813 assert(node->op->opar == oparity_unary);
817 void set_unop_op(ir_node *node, ir_node *op)
819 if (node->op->opar == oparity_unary)
820 set_irn_n(node, node->op->op_index, op);
822 assert(node->op->opar == oparity_unary);
825 int (is_binop)(const ir_node *node)
827 return is_binop_(node);
830 ir_node *get_binop_left(const ir_node *node)
832 assert(node->op->opar == oparity_binary);
833 return get_irn_n(node, node->op->op_index);
836 void set_binop_left(ir_node *node, ir_node *left)
838 assert(node->op->opar == oparity_binary);
839 set_irn_n(node, node->op->op_index, left);
842 ir_node *get_binop_right(const ir_node *node)
844 assert(node->op->opar == oparity_binary);
845 return get_irn_n(node, node->op->op_index + 1);
848 void set_binop_right(ir_node *node, ir_node *right)
850 assert(node->op->opar == oparity_binary);
851 set_irn_n(node, node->op->op_index + 1, right);
854 ir_node *(get_Phi_next)(const ir_node *phi)
856 return get_Phi_next_(phi);
859 void (set_Phi_next)(ir_node *phi, ir_node *next)
861 set_Phi_next_(phi, next);
864 int is_memop(const ir_node *node)
866 return is_op_uses_memory(get_irn_op(node));
869 ir_node *get_memop_mem(const ir_node *node)
871 const ir_op *op = get_irn_op(node);
872 assert(is_memop(node));
873 return get_irn_n(node, op->memory_index);
876 void set_memop_mem(ir_node *node, ir_node *mem)
878 const ir_op *op = get_irn_op(node);
879 assert(is_memop(node));
880 set_irn_n(node, op->memory_index, mem);
883 void add_Sync_pred(ir_node *node, ir_node *pred)
885 assert(is_Sync(node));
886 add_irn_n(node, pred);
889 int (is_arg_Proj)(const ir_node *node)
891 return is_arg_Proj_(node);
894 int is_x_except_Proj(const ir_node *node)
899 pred = get_Proj_pred(node);
900 if (!is_fragile_op(pred))
902 return get_Proj_proj(node) == pred->op->pn_x_except;
905 int is_x_regular_Proj(const ir_node *node)
910 pred = get_Proj_pred(node);
911 if (!is_fragile_op(pred))
913 return get_Proj_proj(node) == pred->op->pn_x_regular;
916 void ir_set_throws_exception(ir_node *node, int throws_exception)
918 except_attr *attr = &node->attr.except;
919 assert(is_fragile_op(node));
920 attr->throws_exception = throws_exception;
923 int ir_throws_exception(const ir_node *node)
925 const except_attr *attr = &node->attr.except;
926 assert(is_fragile_op(node));
927 return attr->throws_exception;
930 size_t get_ASM_n_output_constraints(const ir_node *node)
932 assert(is_ASM(node));
933 return ARR_LEN(node->attr.assem.output_constraints);
936 size_t get_ASM_n_clobbers(const ir_node *node)
938 assert(is_ASM(node));
939 return ARR_LEN(node->attr.assem.clobbers);
942 ir_graph *(get_irn_irg)(const ir_node *node)
944 return get_irn_irg_(node);
947 ir_node *skip_Proj(ir_node *node)
949 /* don't assert node !!! */
954 node = get_Proj_pred(node);
960 skip_Proj_const(const ir_node *node)
962 /* don't assert node !!! */
967 node = get_Proj_pred(node);
972 ir_node *skip_Tuple(ir_node *node)
978 pred = get_Proj_pred(node);
980 if (is_Proj(pred)) { /* nested Tuple ? */
981 pred = skip_Tuple(pred);
983 if (is_Tuple(pred)) {
984 node = get_Tuple_pred(pred, get_Proj_proj(node));
987 } else if (is_Tuple(pred)) {
988 node = get_Tuple_pred(pred, get_Proj_proj(node));
995 ir_node *skip_Pin(ir_node *node)
998 return get_Pin_op(node);
1002 ir_node *skip_Confirm(ir_node *node)
1004 if (is_Confirm(node))
1005 return get_Confirm_value(node);
1009 ir_node *skip_HighLevel_ops(ir_node *node)
1011 while (is_op_highlevel(get_irn_op(node))) {
1012 node = get_irn_n(node, 0);
1018 ir_node *skip_Id(ir_node *node)
1020 /* This should compact Id-cycles to self-cycles. It has the same (or less?) complexity
1021 * than any other approach, as Id chains are resolved and all point to the real node, or
1022 * all id's are self loops.
1024 * Note: This function takes 10% of mostly ANY the compiler run, so it's
1025 * a little bit "hand optimized".
1028 /* don't assert node !!! */
1030 if (!node || (node->op != op_Id)) return node;
1032 /* Don't use get_Id_pred(): We get into an endless loop for
1033 self-referencing Ids. */
1034 pred = node->in[0+1];
1036 if (pred->op != op_Id) return pred;
1038 if (node != pred) { /* not a self referencing Id. Resolve Id chain. */
1039 ir_node *rem_pred, *res;
1041 if (pred->op != op_Id) return pred; /* shortcut */
1044 assert(get_irn_arity (node) > 0);
1046 node->in[0+1] = node; /* turn us into a self referencing Id: shorten Id cycles. */
1047 res = skip_Id(rem_pred);
1048 if (is_Id(res)) /* self-loop */ return node;
1050 node->in[0+1] = res; /* Turn Id chain into Ids all referencing the chain end. */
1057 int (is_SymConst_addr_ent)(const ir_node *node)
1059 return is_SymConst_addr_ent_(node);
1062 int is_cfop(const ir_node *node)
1064 if (is_fragile_op(node) && ir_throws_exception(node))
1067 return is_op_cfopcode(get_irn_op(node));
1070 int is_unknown_jump(const ir_node *node)
1072 return is_op_unknown_jump(get_irn_op(node));
1075 int is_fragile_op(const ir_node *node)
1077 return is_op_fragile(get_irn_op(node));
1080 int (is_irn_forking)(const ir_node *node)
1082 return is_irn_forking_(node);
1085 void (copy_node_attr)(ir_graph *irg, const ir_node *old_node, ir_node *new_node)
1087 copy_node_attr_(irg, old_node, new_node);
1090 ir_type *(get_irn_type_attr)(ir_node *node)
1092 return get_irn_type_attr_(node);
1095 ir_entity *(get_irn_entity_attr)(ir_node *node)
1097 return get_irn_entity_attr_(node);
1100 int (is_irn_constlike)(const ir_node *node)
1102 return is_irn_constlike_(node);
1105 int (is_irn_keep)(const ir_node *node)
1107 return is_irn_keep_(node);
1110 int (is_irn_start_block_placed)(const ir_node *node)
1112 return is_irn_start_block_placed_(node);
1115 int (is_irn_cse_neutral)(const ir_node *node)
1117 return is_irn_cse_neutral_(node);
1120 const char *get_cond_jmp_predicate_name(cond_jmp_predicate pred)
1122 #define X(a) case a: return #a
1124 X(COND_JMP_PRED_NONE);
1125 X(COND_JMP_PRED_TRUE);
1126 X(COND_JMP_PRED_FALSE);
1132 /** Return the attribute type of a SymConst node if exists */
1133 static ir_type *get_SymConst_attr_type(const ir_node *self)
1135 symconst_kind kind = get_SymConst_kind(self);
1136 if (SYMCONST_HAS_TYPE(kind))
1137 return get_SymConst_type(self);
1141 /** Return the attribute entity of a SymConst node if exists */
1142 static ir_entity *get_SymConst_attr_entity(const ir_node *self)
1144 symconst_kind kind = get_SymConst_kind(self);
1145 if (SYMCONST_HAS_ENT(kind))
1146 return get_SymConst_entity(self);
1150 static void register_get_type_func(ir_op *op, get_type_attr_func func)
1152 op->ops.get_type_attr = func;
1155 static void register_get_entity_func(ir_op *op, get_entity_attr_func func)
1157 op->ops.get_entity_attr = func;
1160 void ir_register_getter_ops(void)
1162 register_get_type_func(op_Alloc, get_Alloc_type);
1163 register_get_type_func(op_Builtin, get_Builtin_type);
1164 register_get_type_func(op_Call, get_Call_type);
1165 register_get_type_func(op_CopyB, get_CopyB_type);
1166 register_get_type_func(op_Free, get_Free_type);
1167 register_get_type_func(op_InstOf, get_InstOf_type);
1168 register_get_type_func(op_SymConst, get_SymConst_attr_type);
1170 register_get_entity_func(op_SymConst, get_SymConst_attr_entity);
1171 register_get_entity_func(op_Sel, get_Sel_entity);
1172 register_get_entity_func(op_Block, get_Block_entity);
1175 void (set_irn_dbg_info)(ir_node *n, dbg_info *db)
1177 set_irn_dbg_info_(n, db);
1180 dbg_info *(get_irn_dbg_info)(const ir_node *n)
1182 return get_irn_dbg_info_(n);
1185 ir_switch_table *ir_new_switch_table(ir_graph *irg, size_t n_entries)
1187 struct obstack *obst = get_irg_obstack(irg);
1188 ir_switch_table *res = OALLOCFZ(obst, ir_switch_table, entries, n_entries);
1189 res->n_entries = n_entries;
1193 void ir_switch_table_set(ir_switch_table *table, size_t n,
1194 ir_tarval *min, ir_tarval *max, long pn)
1196 ir_switch_table_entry *entry = ir_switch_table_get_entry(table, n);
1202 size_t (ir_switch_table_get_n_entries)(const ir_switch_table *table)
1204 return ir_switch_table_get_n_entries_(table);
1207 ir_tarval *ir_switch_table_get_max(const ir_switch_table *table, size_t e)
1209 return ir_switch_table_get_entry_const(table, e)->max;
1212 ir_tarval *ir_switch_table_get_min(const ir_switch_table *table, size_t e)
1214 return ir_switch_table_get_entry_const(table, e)->min;
1217 long ir_switch_table_get_pn(const ir_switch_table *table, size_t e)
1219 return ir_switch_table_get_entry_const(table, e)->pn;
1222 ir_switch_table *ir_switch_table_duplicate(ir_graph *irg,
1223 const ir_switch_table *table)
1225 size_t n_entries = ir_switch_table_get_n_entries(table);
1227 ir_switch_table *res = ir_new_switch_table(irg, n_entries);
1228 for (e = 0; e < n_entries; ++e) {
1229 const ir_switch_table_entry *entry
1230 = ir_switch_table_get_entry_const(table, e);
1231 ir_switch_table_entry *new_entry = ir_switch_table_get_entry(res, e);
1232 *new_entry = *entry;
1237 bool only_used_by_keepalive(const ir_node *node)
1239 foreach_out_edge(node, edge) {
1240 ir_node *succ = get_edge_src_irn(edge);
1243 if (is_Proj(succ) && only_used_by_keepalive(succ))
1245 /* found a real user */
1251 /* include generated code */
1252 #include "gen_irnode.c.inl"