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! */
142 edges_notify_edge(res, -1, block, NULL, irg);
143 for (i = 1; i <= arity; ++i)
144 edges_notify_edge(res, i - 1, res->in[i], NULL, irg);
146 hook_new_node(irg, res);
147 if (irg_is_constrained(irg, IR_GRAPH_CONSTRAINT_BACKEND)) {
148 be_info_new_node(irg, res);
154 int (is_ir_node)(const void *thing)
156 return is_ir_node_(thing);
159 int (get_irn_arity)(const ir_node *node)
161 return get_irn_arity_(node);
164 ir_node **get_irn_in(const ir_node *node)
169 void set_irn_in(ir_node *node, int arity, ir_node **in)
173 ir_graph *irg = get_irn_irg(node);
178 assert(node != NULL && node->kind == k_ir_node);
180 for (i = 0; i < arity; ++i) {
181 assert(in[i] != NULL && in[0]->kind == k_ir_node);
185 for (i = 0; i < arity; i++) {
186 if (i < (int)ARR_LEN(*pOld_in)-1)
187 edges_notify_edge(node, i, in[i], (*pOld_in)[i+1], irg);
189 edges_notify_edge(node, i, in[i], NULL, irg);
191 for (;i < (int)ARR_LEN(*pOld_in)-1; i++) {
192 edges_notify_edge(node, i, NULL, (*pOld_in)[i+1], irg);
195 if (arity != (int)ARR_LEN(*pOld_in) - 1) {
196 ir_node * block = (*pOld_in)[0];
197 *pOld_in = NEW_ARR_D(ir_node *, irg->obst, arity + 1);
198 (*pOld_in)[0] = block;
200 fix_backedges(irg->obst, node);
202 memcpy((*pOld_in) + 1, in, sizeof(ir_node *) * arity);
204 /* update irg flags */
205 clear_irg_properties(irg, IR_GRAPH_PROPERTY_CONSISTENT_OUTS | IR_GRAPH_PROPERTY_CONSISTENT_LOOPINFO);
208 ir_node *(get_irn_n)(const ir_node *node, int n)
210 return get_irn_n_(node, n);
213 void set_irn_n(ir_node *node, int n, ir_node *in)
215 ir_graph *irg = get_irn_irg(node);
216 assert(node && node->kind == k_ir_node);
218 assert(n < get_irn_arity(node));
219 assert(in && in->kind == k_ir_node);
222 hook_set_irn_n(node, n, in, node->in[n + 1]);
224 /* Here, we rely on src and tgt being in the current ir graph */
225 edges_notify_edge(node, n, in, node->in[n + 1], irg);
227 node->in[n + 1] = in;
229 /* update irg flags */
230 clear_irg_properties(irg, IR_GRAPH_PROPERTY_CONSISTENT_OUTS | IR_GRAPH_PROPERTY_CONSISTENT_LOOPINFO);
233 int add_irn_n(ir_node *node, ir_node *in)
236 ir_graph *irg = get_irn_irg(node);
238 assert(node->op->opar == oparity_dynamic);
239 pos = ARR_LEN(node->in) - 1;
240 ARR_APP1(ir_node *, node->in, in);
241 edges_notify_edge(node, pos, node->in[pos + 1], NULL, irg);
244 hook_set_irn_n(node, pos, node->in[pos + 1], NULL);
246 /* update irg flags */
247 clear_irg_properties(irg, IR_GRAPH_PROPERTY_CONSISTENT_OUTS);
252 static void del_irn_n(ir_node *node, int n)
254 ir_graph *irg = get_irn_irg(node);
256 /* remove the edge */
257 ir_node *pred = node->in[n+1];
258 edges_notify_edge(node, n, NULL, pred, irg);
260 int arity = get_irn_arity(node);
262 /* exchange with the last one */
263 ir_node *old = node->in[arity];
264 edges_notify_edge(node, arity-1, NULL, old, irg);
266 edges_notify_edge(node, n, old, NULL, irg);
268 ARR_SHRINKLEN(node->in, arity);
270 /* update irg flags */
271 clear_irg_properties(irg, IR_GRAPH_PROPERTY_CONSISTENT_OUTS);
274 void del_Sync_n(ir_node *n, int i)
279 int (get_irn_deps)(const ir_node *node)
281 return get_irn_deps_(node);
284 ir_node *(get_irn_dep)(const ir_node *node, int pos)
286 return get_irn_dep_(node, pos);
289 void set_irn_dep(ir_node *node, int pos, ir_node *dep)
294 assert(node->deps && "dependency array node yet allocated. use add_irn_dep()");
295 assert(pos >= 0 && pos < (int)ARR_LEN(node->deps) && "dependency index out of range");
297 old = node->deps[pos];
298 node->deps[pos] = dep;
299 irg = get_irn_irg(node);
300 if (edges_activated_kind(irg, EDGE_KIND_DEP))
301 edges_notify_edge_kind(node, pos, dep, old, EDGE_KIND_DEP, irg);
304 void add_irn_dep(ir_node *node, ir_node *dep)
308 if (node->deps == NULL) {
309 node->deps = NEW_ARR_F(ir_node *, 0);
311 ARR_APP1(ir_node*, node->deps, dep);
312 irg = get_irn_irg(node);
313 if (edges_activated_kind(irg, EDGE_KIND_DEP))
314 edges_notify_edge_kind(node, ARR_LEN(node->deps)-1, dep, NULL, EDGE_KIND_DEP, irg);
317 void delete_irn_dep(ir_node *node, ir_node *dep)
321 if (node->deps == NULL)
324 n_deps = ARR_LEN(node->deps);
325 for (i = 0; i < n_deps; ++i) {
326 if (node->deps[i] == dep) {
327 set_irn_dep(node, i, node->deps[n_deps-1]);
328 edges_notify_edge(node, i, NULL, dep, get_irn_irg(node));
329 ARR_SHRINKLEN(node->deps, n_deps-1);
335 void add_irn_deps(ir_node *tgt, ir_node *src)
339 for (i = 0, n = get_irn_deps(src); i < n; ++i)
340 add_irn_dep(tgt, get_irn_dep(src, i));
344 ir_mode *(get_irn_mode)(const ir_node *node)
346 return get_irn_mode_(node);
349 void (set_irn_mode)(ir_node *node, ir_mode *mode)
351 set_irn_mode_(node, mode);
354 ir_op *(get_irn_op)(const ir_node *node)
356 return get_irn_op_(node);
359 void (set_irn_op)(ir_node *node, ir_op *op)
361 set_irn_op_(node, op);
364 unsigned (get_irn_opcode)(const ir_node *node)
366 return get_irn_opcode_(node);
369 const char *get_irn_opname(const ir_node *node)
371 return get_id_str(node->op->name);
374 ident *get_irn_opident(const ir_node *node)
377 return node->op->name;
380 ir_visited_t (get_irn_visited)(const ir_node *node)
382 return get_irn_visited_(node);
385 void (set_irn_visited)(ir_node *node, ir_visited_t visited)
387 set_irn_visited_(node, visited);
390 void (mark_irn_visited)(ir_node *node)
392 mark_irn_visited_(node);
395 int (irn_visited)(const ir_node *node)
397 return irn_visited_(node);
400 int (irn_visited_else_mark)(ir_node *node)
402 return irn_visited_else_mark_(node);
405 void (set_irn_link)(ir_node *node, void *link)
407 set_irn_link_(node, link);
410 void *(get_irn_link)(const ir_node *node)
412 return get_irn_link_(node);
415 op_pin_state (get_irn_pinned)(const ir_node *node)
417 return get_irn_pinned_(node);
420 op_pin_state (is_irn_pinned_in_irg) (const ir_node *node)
422 return is_irn_pinned_in_irg_(node);
425 void set_irn_pinned(ir_node *node, op_pin_state state)
427 /* due to optimization an opt may be turned into a Tuple */
431 assert(node && get_op_pinned(get_irn_op(node)) >= op_pin_state_exc_pinned);
432 assert(state == op_pin_state_pinned || state == op_pin_state_floats);
434 node->attr.except.pin_state = state;
437 long get_irn_node_nr(const ir_node *node)
440 return node->node_nr;
443 void *(get_irn_generic_attr)(ir_node *node)
445 assert(is_ir_node(node));
446 return get_irn_generic_attr_(node);
449 const void *(get_irn_generic_attr_const)(const ir_node *node)
451 assert(is_ir_node(node));
452 return get_irn_generic_attr_const_(node);
455 unsigned (get_irn_idx)(const ir_node *node)
457 assert(is_ir_node(node));
458 return get_irn_idx_(node);
461 ir_node *(get_nodes_block)(const ir_node *node)
463 return get_nodes_block_(node);
466 void set_nodes_block(ir_node *node, ir_node *block)
468 assert(!is_Block(node));
469 set_irn_n(node, -1, block);
472 ir_type *is_frame_pointer(const ir_node *n)
474 if (is_Proj(n) && (get_Proj_proj(n) == pn_Start_P_frame_base)) {
475 ir_node *start = get_Proj_pred(n);
476 if (is_Start(start)) {
477 return get_irg_frame_type(get_irn_irg(start));
483 ir_node **get_Block_cfgpred_arr(ir_node *node)
485 assert(is_Block(node));
486 return (ir_node **)&(get_irn_in(node)[1]);
489 int (get_Block_n_cfgpreds)(const ir_node *node)
491 return get_Block_n_cfgpreds_(node);
494 ir_node *(get_Block_cfgpred)(const ir_node *node, int pos)
496 return get_Block_cfgpred_(node, pos);
499 void set_Block_cfgpred(ir_node *node, int pos, ir_node *pred)
501 assert(is_Block(node));
502 set_irn_n(node, pos, pred);
505 int get_Block_cfgpred_pos(const ir_node *block, const ir_node *pred)
509 for (i = get_Block_n_cfgpreds(block) - 1; i >= 0; --i) {
510 if (get_Block_cfgpred_block(block, i) == pred)
516 ir_node *(get_Block_cfgpred_block)(const ir_node *node, int pos)
518 return get_Block_cfgpred_block_(node, pos);
521 int get_Block_matured(const ir_node *node)
523 assert(is_Block(node));
524 return (int)node->attr.block.is_matured;
527 void set_Block_matured(ir_node *node, int matured)
529 assert(is_Block(node));
530 node->attr.block.is_matured = matured;
533 ir_visited_t (get_Block_block_visited)(const ir_node *node)
535 return get_Block_block_visited_(node);
538 void (set_Block_block_visited)(ir_node *node, ir_visited_t visit)
540 set_Block_block_visited_(node, visit);
543 void (mark_Block_block_visited)(ir_node *node)
545 mark_Block_block_visited_(node);
548 int (Block_block_visited)(const ir_node *node)
550 return Block_block_visited_(node);
553 ir_graph *(get_Block_irg)(const ir_node *block)
555 return get_Block_irg_(block);
558 ir_entity *create_Block_entity(ir_node *block)
561 assert(is_Block(block));
563 entity = block->attr.block.entity;
564 if (entity == NULL) {
565 ir_label_t nr = get_irp_next_label_nr();
566 entity = new_label_entity(nr);
567 set_entity_visibility(entity, ir_visibility_local);
568 set_entity_linkage(entity, IR_LINKAGE_CONSTANT);
569 set_entity_compiler_generated(entity, 1);
571 block->attr.block.entity = entity;
576 ir_node *(get_Block_phis)(const ir_node *block)
578 return get_Block_phis_(block);
581 void (set_Block_phis)(ir_node *block, ir_node *phi)
583 set_Block_phis_(block, phi);
586 void (add_Block_phi)(ir_node *block, ir_node *phi)
588 add_Block_phi_(block, phi);
591 unsigned (get_Block_mark)(const ir_node *block)
593 return get_Block_mark_(block);
596 void (set_Block_mark)(ir_node *block, unsigned mark)
598 set_Block_mark_(block, mark);
601 int get_End_n_keepalives(const ir_node *end)
604 return (get_irn_arity(end) - END_KEEPALIVE_OFFSET);
607 ir_node *get_End_keepalive(const ir_node *end, int pos)
610 return get_irn_n(end, pos + END_KEEPALIVE_OFFSET);
613 void add_End_keepalive(ir_node *end, ir_node *ka)
619 void set_End_keepalive(ir_node *end, int pos, ir_node *ka)
622 set_irn_n(end, pos + END_KEEPALIVE_OFFSET, ka);
625 void set_End_keepalives(ir_node *end, int n, ir_node *in[])
629 ir_graph *irg = get_irn_irg(end);
631 /* notify that edges are deleted */
632 for (e = END_KEEPALIVE_OFFSET; e < ARR_LEN(end->in) - 1; ++e) {
633 edges_notify_edge(end, e, NULL, end->in[e + 1], irg);
635 ARR_RESIZE(ir_node *, end->in, n + 1 + END_KEEPALIVE_OFFSET);
637 for (i = 0; i < n; ++i) {
638 end->in[1 + END_KEEPALIVE_OFFSET + i] = in[i];
639 edges_notify_edge(end, END_KEEPALIVE_OFFSET + i, end->in[1 + END_KEEPALIVE_OFFSET + i], NULL, irg);
642 /* update irg flags */
643 clear_irg_properties(irg, IR_GRAPH_PROPERTY_CONSISTENT_OUTS);
646 void remove_End_keepalive(ir_node *end, ir_node *irn)
648 int n = get_End_n_keepalives(end);
654 ir_node *old_ka = end->in[1 + END_KEEPALIVE_OFFSET + i];
658 idx = END_KEEPALIVE_OFFSET + i;
666 void remove_End_Bads_and_doublets(ir_node *end)
669 int idx, n = get_End_n_keepalives(end);
671 bool changed = false;
676 irg = get_irn_irg(end);
677 pset_new_init(&keeps);
679 for (idx = n - 1; idx >= 0; --idx) {
680 ir_node *ka = get_End_keepalive(end, idx);
682 if (is_Bad(ka) || is_NoMem(ka) || pset_new_contains(&keeps, ka)) {
684 del_irn_n(end, idx - END_KEEPALIVE_OFFSET);
687 pset_new_insert(&keeps, ka);
690 pset_new_destroy(&keeps);
693 clear_irg_properties(irg, IR_GRAPH_PROPERTY_CONSISTENT_OUTS);
697 void free_End(ir_node *end)
702 end->in = NULL; /* @@@ make sure we get an error if we use the
703 in array afterwards ... */
706 size_t get_Return_n_ress(const ir_node *node)
708 assert(is_Return(node));
709 return (size_t)(get_irn_arity(node) - RETURN_RESULT_OFFSET);
712 ir_node **get_Return_res_arr(ir_node *node)
714 assert(is_Return(node));
715 if (get_Return_n_ress(node) > 0)
716 return (ir_node **)&(get_irn_in(node)[1 + RETURN_RESULT_OFFSET]);
721 ir_node *get_Return_res(const ir_node *node, int pos)
723 assert(is_Return(node));
725 assert(get_Return_n_ress(node) > (size_t)pos);
726 return get_irn_n(node, pos + RETURN_RESULT_OFFSET);
729 void set_Return_res(ir_node *node, int pos, ir_node *res)
731 assert(is_Return(node));
732 set_irn_n(node, pos + RETURN_RESULT_OFFSET, res);
735 int (is_Const_null)(const ir_node *node)
737 return is_Const_null_(node);
740 int (is_Const_one)(const ir_node *node)
742 return is_Const_one_(node);
745 int (is_Const_all_one)(const ir_node *node)
747 return is_Const_all_one_(node);
752 symconst_kind get_SymConst_kind(const ir_node *node)
754 assert(is_SymConst(node));
755 return node->attr.symc.kind;
758 void set_SymConst_kind(ir_node *node, symconst_kind kind)
760 assert(is_SymConst(node));
761 node->attr.symc.kind = kind;
764 ir_type *get_SymConst_type(const ir_node *node)
766 /* the cast here is annoying, but we have to compensate for
768 ir_node *irn = (ir_node *)node;
769 assert(is_SymConst(node) &&
770 (SYMCONST_HAS_TYPE(get_SymConst_kind(node))));
771 return irn->attr.symc.sym.type_p;
774 void set_SymConst_type(ir_node *node, ir_type *tp)
776 assert(is_SymConst(node) &&
777 (SYMCONST_HAS_TYPE(get_SymConst_kind(node))));
778 node->attr.symc.sym.type_p = tp;
781 ir_entity *get_SymConst_entity(const ir_node *node)
783 assert(is_SymConst(node) && SYMCONST_HAS_ENT(get_SymConst_kind(node)));
784 return node->attr.symc.sym.entity_p;
787 void set_SymConst_entity(ir_node *node, ir_entity *ent)
789 assert(is_SymConst(node) && SYMCONST_HAS_ENT(get_SymConst_kind(node)));
790 node->attr.symc.sym.entity_p = ent;
793 ir_enum_const *get_SymConst_enum(const ir_node *node)
795 assert(is_SymConst(node) && SYMCONST_HAS_ENUM(get_SymConst_kind(node)));
796 return node->attr.symc.sym.enum_p;
799 void set_SymConst_enum(ir_node *node, ir_enum_const *ec)
801 assert(is_SymConst(node) && SYMCONST_HAS_ENUM(get_SymConst_kind(node)));
802 node->attr.symc.sym.enum_p = ec;
805 union symconst_symbol
806 get_SymConst_symbol(const ir_node *node)
808 assert(is_SymConst(node));
809 return node->attr.symc.sym;
812 void set_SymConst_symbol(ir_node *node, union symconst_symbol sym)
814 assert(is_SymConst(node));
815 node->attr.symc.sym = sym;
818 int get_Sel_n_indexs(const ir_node *node)
820 assert(is_Sel(node));
821 return (get_irn_arity(node) - SEL_INDEX_OFFSET);
824 ir_node **get_Sel_index_arr(ir_node *node)
826 assert(is_Sel(node));
827 if (get_Sel_n_indexs(node) > 0)
828 return (ir_node **)& get_irn_in(node)[SEL_INDEX_OFFSET + 1];
833 ir_node *get_Sel_index(const ir_node *node, int pos)
835 assert(is_Sel(node));
836 return get_irn_n(node, pos + SEL_INDEX_OFFSET);
839 void set_Sel_index(ir_node *node, int pos, ir_node *index)
841 assert(is_Sel(node));
842 set_irn_n(node, pos + SEL_INDEX_OFFSET, index);
845 ir_node **get_Call_param_arr(ir_node *node)
847 assert(is_Call(node));
848 return &get_irn_in(node)[CALL_PARAM_OFFSET + 1];
851 int get_Call_n_params(const ir_node *node)
853 assert(is_Call(node));
854 return get_irn_arity(node) - CALL_PARAM_OFFSET;
857 ir_node *get_Call_param(const ir_node *node, int pos)
859 assert(is_Call(node));
860 return get_irn_n(node, pos + CALL_PARAM_OFFSET);
863 void set_Call_param(ir_node *node, int pos, ir_node *param)
865 assert(is_Call(node));
866 set_irn_n(node, pos + CALL_PARAM_OFFSET, param);
869 ir_node **get_Builtin_param_arr(ir_node *node)
871 assert(is_Builtin(node));
872 return &get_irn_in(node)[BUILTIN_PARAM_OFFSET + 1];
875 int get_Builtin_n_params(const ir_node *node)
877 assert(is_Builtin(node));
878 return (get_irn_arity(node) - BUILTIN_PARAM_OFFSET);
881 ir_node *get_Builtin_param(const ir_node *node, int pos)
883 assert(is_Builtin(node));
884 return get_irn_n(node, pos + BUILTIN_PARAM_OFFSET);
887 void set_Builtin_param(ir_node *node, int pos, ir_node *param)
889 assert(is_Builtin(node));
890 set_irn_n(node, pos + BUILTIN_PARAM_OFFSET, param);
893 const char *get_builtin_kind_name(ir_builtin_kind kind)
895 #define X(a) case a: return #a
899 X(ir_bk_return_address);
900 X(ir_bk_frame_address);
910 X(ir_bk_inner_trampoline);
917 int Call_has_callees(const ir_node *node)
919 assert(is_Call(node));
920 return ((get_irg_callee_info_state(get_irn_irg(node)) != irg_callee_info_none) &&
921 (node->attr.call.callee_arr != NULL));
924 size_t get_Call_n_callees(const ir_node *node)
926 assert(is_Call(node) && node->attr.call.callee_arr);
927 return ARR_LEN(node->attr.call.callee_arr);
930 ir_entity *get_Call_callee(const ir_node *node, size_t pos)
932 assert(pos < get_Call_n_callees(node));
933 return node->attr.call.callee_arr[pos];
936 void set_Call_callee_arr(ir_node *node, size_t n, ir_entity ** arr)
938 ir_graph *irg = get_irn_irg(node);
940 assert(is_Call(node));
941 if (node->attr.call.callee_arr == NULL || get_Call_n_callees(node) != n) {
942 node->attr.call.callee_arr = NEW_ARR_D(ir_entity *, irg->obst, n);
944 memcpy(node->attr.call.callee_arr, arr, n * sizeof(ir_entity *));
947 void remove_Call_callee_arr(ir_node *node)
949 assert(is_Call(node));
950 node->attr.call.callee_arr = NULL;
953 int is_Cast_upcast(ir_node *node)
955 ir_type *totype = get_Cast_type(node);
956 ir_type *fromtype = get_irn_typeinfo_type(get_Cast_op(node));
958 assert(get_irg_typeinfo_state(get_irn_irg(node)) == ir_typeinfo_consistent);
961 while (is_Pointer_type(totype) && is_Pointer_type(fromtype)) {
962 totype = get_pointer_points_to_type(totype);
963 fromtype = get_pointer_points_to_type(fromtype);
968 if (!is_Class_type(totype)) return 0;
969 return is_SubClass_of(fromtype, totype);
972 int is_Cast_downcast(ir_node *node)
974 ir_type *totype = get_Cast_type(node);
975 ir_type *fromtype = get_irn_typeinfo_type(get_Cast_op(node));
977 assert(get_irg_typeinfo_state(get_irn_irg(node)) == ir_typeinfo_consistent);
980 while (is_Pointer_type(totype) && is_Pointer_type(fromtype)) {
981 totype = get_pointer_points_to_type(totype);
982 fromtype = get_pointer_points_to_type(fromtype);
987 if (!is_Class_type(totype)) return 0;
988 return is_SubClass_of(totype, fromtype);
991 int (is_unop)(const ir_node *node)
993 return is_unop_(node);
996 ir_node *get_unop_op(const ir_node *node)
998 if (node->op->opar == oparity_unary)
999 return get_irn_n(node, node->op->op_index);
1001 assert(node->op->opar == oparity_unary);
1005 void set_unop_op(ir_node *node, ir_node *op)
1007 if (node->op->opar == oparity_unary)
1008 set_irn_n(node, node->op->op_index, op);
1010 assert(node->op->opar == oparity_unary);
1013 int (is_binop)(const ir_node *node)
1015 return is_binop_(node);
1018 ir_node *get_binop_left(const ir_node *node)
1020 assert(node->op->opar == oparity_binary);
1021 return get_irn_n(node, node->op->op_index);
1024 void set_binop_left(ir_node *node, ir_node *left)
1026 assert(node->op->opar == oparity_binary);
1027 set_irn_n(node, node->op->op_index, left);
1030 ir_node *get_binop_right(const ir_node *node)
1032 assert(node->op->opar == oparity_binary);
1033 return get_irn_n(node, node->op->op_index + 1);
1036 void set_binop_right(ir_node *node, ir_node *right)
1038 assert(node->op->opar == oparity_binary);
1039 set_irn_n(node, node->op->op_index + 1, right);
1042 ir_node **get_Phi_preds_arr(ir_node *node)
1044 assert(is_Phi(node));
1045 return (ir_node **)&(get_irn_in(node)[1]);
1048 int get_Phi_n_preds(const ir_node *node)
1050 assert(is_Phi(node));
1051 return get_irn_arity(node);
1054 ir_node *get_Phi_pred(const ir_node *node, int pos)
1056 assert(is_Phi(node));
1057 return get_irn_n(node, pos);
1060 void set_Phi_pred(ir_node *node, int pos, ir_node *pred)
1062 assert(is_Phi(node));
1063 set_irn_n(node, pos, pred);
1066 ir_node *(get_Phi_next)(const ir_node *phi)
1068 return get_Phi_next_(phi);
1071 void (set_Phi_next)(ir_node *phi, ir_node *next)
1073 set_Phi_next_(phi, next);
1076 int is_memop(const ir_node *node)
1078 return is_op_uses_memory(get_irn_op(node));
1081 ir_node *get_memop_mem(const ir_node *node)
1083 const ir_op *op = get_irn_op(node);
1084 assert(is_memop(node));
1085 return get_irn_n(node, op->memory_index);
1088 void set_memop_mem(ir_node *node, ir_node *mem)
1090 const ir_op *op = get_irn_op(node);
1091 assert(is_memop(node));
1092 set_irn_n(node, op->memory_index, mem);
1095 ir_node **get_Sync_preds_arr(ir_node *node)
1097 assert(is_Sync(node));
1098 return (ir_node **)&(get_irn_in(node)[1]);
1101 int get_Sync_n_preds(const ir_node *node)
1103 assert(is_Sync(node));
1104 return (get_irn_arity(node));
1107 ir_node *get_Sync_pred(const ir_node *node, int pos)
1109 assert(is_Sync(node));
1110 return get_irn_n(node, pos);
1113 void set_Sync_pred(ir_node *node, int pos, ir_node *pred)
1115 assert(is_Sync(node));
1116 set_irn_n(node, pos, pred);
1119 void add_Sync_pred(ir_node *node, ir_node *pred)
1121 assert(is_Sync(node));
1122 add_irn_n(node, pred);
1125 int (is_arg_Proj)(const ir_node *node)
1127 return is_arg_Proj_(node);
1130 int is_x_except_Proj(const ir_node *node)
1135 pred = get_Proj_pred(node);
1136 if (!is_fragile_op(pred))
1138 return get_Proj_proj(node) == pred->op->pn_x_except;
1141 int is_x_regular_Proj(const ir_node *node)
1146 pred = get_Proj_pred(node);
1147 if (!is_fragile_op(pred))
1149 return get_Proj_proj(node) == pred->op->pn_x_regular;
1152 void ir_set_throws_exception(ir_node *node, int throws_exception)
1154 except_attr *attr = &node->attr.except;
1155 assert(is_fragile_op(node));
1156 attr->throws_exception = throws_exception;
1159 int ir_throws_exception(const ir_node *node)
1161 const except_attr *attr = &node->attr.except;
1162 assert(is_fragile_op(node));
1163 return attr->throws_exception;
1166 ir_node **get_Tuple_preds_arr(ir_node *node)
1168 assert(is_Tuple(node));
1169 return (ir_node **)&(get_irn_in(node)[1]);
1172 int get_Tuple_n_preds(const ir_node *node)
1174 assert(is_Tuple(node));
1175 return get_irn_arity(node);
1178 ir_node *get_Tuple_pred(const ir_node *node, int pos)
1180 assert(is_Tuple(node));
1181 return get_irn_n(node, pos);
1184 void set_Tuple_pred(ir_node *node, int pos, ir_node *pred)
1186 assert(is_Tuple(node));
1187 set_irn_n(node, pos, pred);
1190 int get_ASM_n_inputs(const ir_node *node)
1192 assert(is_ASM(node));
1193 return get_irn_arity(node) - ASM_PARAM_OFFSET;
1196 ir_node *get_ASM_input(const ir_node *node, int pos)
1198 return get_irn_n(node, ASM_PARAM_OFFSET + pos);
1201 size_t get_ASM_n_output_constraints(const ir_node *node)
1203 assert(is_ASM(node));
1204 return ARR_LEN(node->attr.assem.output_constraints);
1207 size_t get_ASM_n_clobbers(const ir_node *node)
1209 assert(is_ASM(node));
1210 return ARR_LEN(node->attr.assem.clobbers);
1213 ir_graph *(get_irn_irg)(const ir_node *node)
1215 return get_irn_irg_(node);
1218 ir_node *skip_Proj(ir_node *node)
1220 /* don't assert node !!! */
1225 node = get_Proj_pred(node);
1231 skip_Proj_const(const ir_node *node)
1233 /* don't assert node !!! */
1238 node = get_Proj_pred(node);
1243 ir_node *skip_Tuple(ir_node *node)
1248 if (is_Proj(node)) {
1249 pred = get_Proj_pred(node);
1251 if (is_Proj(pred)) { /* nested Tuple ? */
1252 pred = skip_Tuple(pred);
1254 if (is_Tuple(pred)) {
1255 node = get_Tuple_pred(pred, get_Proj_proj(node));
1258 } else if (is_Tuple(pred)) {
1259 node = get_Tuple_pred(pred, get_Proj_proj(node));
1266 ir_node *skip_Cast(ir_node *node)
1269 return get_Cast_op(node);
1273 const ir_node *skip_Cast_const(const ir_node *node)
1276 return get_Cast_op(node);
1280 ir_node *skip_Pin(ir_node *node)
1283 return get_Pin_op(node);
1287 ir_node *skip_Confirm(ir_node *node)
1289 if (is_Confirm(node))
1290 return get_Confirm_value(node);
1294 ir_node *skip_HighLevel_ops(ir_node *node)
1296 while (is_op_highlevel(get_irn_op(node))) {
1297 node = get_irn_n(node, 0);
1303 ir_node *skip_Id(ir_node *node)
1305 /* This should compact Id-cycles to self-cycles. It has the same (or less?) complexity
1306 * than any other approach, as Id chains are resolved and all point to the real node, or
1307 * all id's are self loops.
1309 * Note: This function takes 10% of mostly ANY the compiler run, so it's
1310 * a little bit "hand optimized".
1313 /* don't assert node !!! */
1315 if (!node || (node->op != op_Id)) return node;
1317 /* Don't use get_Id_pred(): We get into an endless loop for
1318 self-referencing Ids. */
1319 pred = node->in[0+1];
1321 if (pred->op != op_Id) return pred;
1323 if (node != pred) { /* not a self referencing Id. Resolve Id chain. */
1324 ir_node *rem_pred, *res;
1326 if (pred->op != op_Id) return pred; /* shortcut */
1329 assert(get_irn_arity (node) > 0);
1331 node->in[0+1] = node; /* turn us into a self referencing Id: shorten Id cycles. */
1332 res = skip_Id(rem_pred);
1333 if (is_Id(res)) /* self-loop */ return node;
1335 node->in[0+1] = res; /* Turn Id chain into Ids all referencing the chain end. */
1342 int (is_SymConst_addr_ent)(const ir_node *node)
1344 return is_SymConst_addr_ent_(node);
1347 int is_cfop(const ir_node *node)
1349 if (is_fragile_op(node) && ir_throws_exception(node))
1352 return is_op_cfopcode(get_irn_op(node));
1355 int is_unknown_jump(const ir_node *node)
1357 return is_op_unknown_jump(get_irn_op(node));
1360 int is_fragile_op(const ir_node *node)
1362 return is_op_fragile(get_irn_op(node));
1365 int (is_irn_forking)(const ir_node *node)
1367 return is_irn_forking_(node);
1370 void (copy_node_attr)(ir_graph *irg, const ir_node *old_node, ir_node *new_node)
1372 copy_node_attr_(irg, old_node, new_node);
1375 ir_type *(get_irn_type_attr)(ir_node *node)
1377 return get_irn_type_attr_(node);
1380 ir_entity *(get_irn_entity_attr)(ir_node *node)
1382 return get_irn_entity_attr_(node);
1385 int (is_irn_constlike)(const ir_node *node)
1387 return is_irn_constlike_(node);
1390 int (is_irn_keep)(const ir_node *node)
1392 return is_irn_keep_(node);
1395 int (is_irn_start_block_placed)(const ir_node *node)
1397 return is_irn_start_block_placed_(node);
1400 int (is_irn_cse_neutral)(const ir_node *node)
1402 return is_irn_cse_neutral_(node);
1405 const char *get_cond_jmp_predicate_name(cond_jmp_predicate pred)
1407 #define X(a) case a: return #a
1409 X(COND_JMP_PRED_NONE);
1410 X(COND_JMP_PRED_TRUE);
1411 X(COND_JMP_PRED_FALSE);
1417 /** Return the attribute type of a SymConst node if exists */
1418 static ir_type *get_SymConst_attr_type(const ir_node *self)
1420 symconst_kind kind = get_SymConst_kind(self);
1421 if (SYMCONST_HAS_TYPE(kind))
1422 return get_SymConst_type(self);
1426 /** Return the attribute entity of a SymConst node if exists */
1427 static ir_entity *get_SymConst_attr_entity(const ir_node *self)
1429 symconst_kind kind = get_SymConst_kind(self);
1430 if (SYMCONST_HAS_ENT(kind))
1431 return get_SymConst_entity(self);
1435 static void register_get_type_func(ir_op *op, get_type_attr_func func)
1437 op->ops.get_type_attr = func;
1440 static void register_get_entity_func(ir_op *op, get_entity_attr_func func)
1442 op->ops.get_entity_attr = func;
1445 void ir_register_getter_ops(void)
1447 register_get_type_func(op_Alloc, get_Alloc_type);
1448 register_get_type_func(op_Builtin, get_Builtin_type);
1449 register_get_type_func(op_Call, get_Call_type);
1450 register_get_type_func(op_Cast, get_Cast_type);
1451 register_get_type_func(op_CopyB, get_CopyB_type);
1452 register_get_type_func(op_Free, get_Free_type);
1453 register_get_type_func(op_InstOf, get_InstOf_type);
1454 register_get_type_func(op_SymConst, get_SymConst_attr_type);
1456 register_get_entity_func(op_SymConst, get_SymConst_attr_entity);
1457 register_get_entity_func(op_Sel, get_Sel_entity);
1458 register_get_entity_func(op_Block, get_Block_entity);
1461 void (set_irn_dbg_info)(ir_node *n, dbg_info *db)
1463 set_irn_dbg_info_(n, db);
1466 dbg_info *(get_irn_dbg_info)(const ir_node *n)
1468 return get_irn_dbg_info_(n);
1471 ir_switch_table *ir_new_switch_table(ir_graph *irg, size_t n_entries)
1473 struct obstack *obst = get_irg_obstack(irg);
1474 ir_switch_table *res = OALLOCFZ(obst, ir_switch_table, entries, n_entries);
1475 res->n_entries = n_entries;
1479 void ir_switch_table_set(ir_switch_table *table, size_t n,
1480 ir_tarval *min, ir_tarval *max, long pn)
1482 ir_switch_table_entry *entry = ir_switch_table_get_entry(table, n);
1488 size_t (ir_switch_table_get_n_entries)(const ir_switch_table *table)
1490 return ir_switch_table_get_n_entries_(table);
1493 ir_tarval *ir_switch_table_get_max(const ir_switch_table *table, size_t e)
1495 return ir_switch_table_get_entry_const(table, e)->max;
1498 ir_tarval *ir_switch_table_get_min(const ir_switch_table *table, size_t e)
1500 return ir_switch_table_get_entry_const(table, e)->min;
1503 long ir_switch_table_get_pn(const ir_switch_table *table, size_t e)
1505 return ir_switch_table_get_entry_const(table, e)->pn;
1508 ir_switch_table *ir_switch_table_duplicate(ir_graph *irg,
1509 const ir_switch_table *table)
1511 size_t n_entries = ir_switch_table_get_n_entries(table);
1513 ir_switch_table *res = ir_new_switch_table(irg, n_entries);
1514 for (e = 0; e < n_entries; ++e) {
1515 const ir_switch_table_entry *entry
1516 = ir_switch_table_get_entry_const(table, e);
1517 ir_switch_table_entry *new_entry = ir_switch_table_get_entry(res, e);
1518 *new_entry = *entry;
1523 bool only_used_by_keepalive(const ir_node *node)
1525 foreach_out_edge(node, edge) {
1526 ir_node *succ = get_edge_src_irn(edge);
1529 if (is_Proj(succ) && only_used_by_keepalive(succ))
1531 /* found a real user */
1537 /* include generated code */
1538 #include "gen_irnode.c.inl"