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);
99 * Indicates, whether additional data can be registered to ir nodes.
100 * If set to 1, this is not possible anymore.
102 static int forbid_new_data = 0;
104 unsigned firm_add_node_size = 0;
107 unsigned firm_register_additional_node_data(unsigned size)
109 assert(!forbid_new_data && "Too late to register additional node data");
114 return firm_add_node_size += size;
118 void init_irnode(void)
120 /* Forbid the addition of new data to an ir node. */
124 struct struct_align {
133 ir_node *new_ir_node(dbg_info *db, ir_graph *irg, ir_node *block, ir_op *op,
134 ir_mode *mode, int arity, ir_node *const *in)
137 unsigned align = offsetof(struct struct_align, s) - 1;
138 unsigned add_node_size = (firm_add_node_size + align) & ~align;
139 size_t node_size = offsetof(ir_node, attr) + op->attr_size + add_node_size;
146 p = (char*)obstack_alloc(irg->obst, node_size);
147 memset(p, 0, node_size);
148 res = (ir_node *)(p + add_node_size);
150 res->kind = k_ir_node;
154 res->node_idx = irg_register_node_idx(irg, res);
159 res->in = NEW_ARR_F(ir_node *, 1); /* 1: space for block */
161 /* not nice but necessary: End and Sync must always have a flexible array */
162 if (op == op_End || op == op_Sync)
163 res->in = NEW_ARR_F(ir_node *, (arity+1));
165 res->in = NEW_ARR_D(ir_node *, irg->obst, (arity+1));
166 memcpy(&res->in[1], in, sizeof(ir_node *) * arity);
170 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)
312 assert(node->deps && "dependency array node yet allocated. use add_irn_dep()");
313 assert(pos >= 0 && pos < (int)ARR_LEN(node->deps) && "dependency index out of range");
315 old = node->deps[pos];
316 node->deps[pos] = dep;
317 irg = get_irn_irg(node);
318 if (edges_activated_kind(irg, EDGE_KIND_DEP))
319 edges_notify_edge_kind(node, pos, dep, old, EDGE_KIND_DEP, irg);
322 void add_irn_dep(ir_node *node, ir_node *dep)
326 if (node->deps == NULL) {
327 node->deps = NEW_ARR_F(ir_node *, 0);
329 ARR_APP1(ir_node*, node->deps, dep);
330 irg = get_irn_irg(node);
331 if (edges_activated_kind(irg, EDGE_KIND_DEP))
332 edges_notify_edge_kind(node, ARR_LEN(node->deps)-1, dep, NULL, EDGE_KIND_DEP, irg);
335 void delete_irn_dep(ir_node *node, ir_node *dep)
339 if (node->deps == NULL)
342 n_deps = ARR_LEN(node->deps);
343 for (i = 0; i < n_deps; ++i) {
344 if (node->deps[i] == dep) {
345 set_irn_dep(node, i, node->deps[n_deps-1]);
346 edges_notify_edge(node, i, NULL, dep, get_irn_irg(node));
347 ARR_SHRINKLEN(node->deps, n_deps-1);
353 void add_irn_deps(ir_node *tgt, ir_node *src)
357 for (i = 0, n = get_irn_deps(src); i < n; ++i)
358 add_irn_dep(tgt, get_irn_dep(src, i));
362 ir_mode *(get_irn_mode)(const ir_node *node)
364 return get_irn_mode_(node);
367 void (set_irn_mode)(ir_node *node, ir_mode *mode)
369 set_irn_mode_(node, mode);
372 ir_op *(get_irn_op)(const ir_node *node)
374 return get_irn_op_(node);
377 void (set_irn_op)(ir_node *node, ir_op *op)
379 set_irn_op_(node, op);
382 unsigned (get_irn_opcode)(const ir_node *node)
384 return get_irn_opcode_(node);
387 const char *get_irn_opname(const ir_node *node)
389 return get_id_str(node->op->name);
392 ident *get_irn_opident(const ir_node *node)
395 return node->op->name;
398 ir_visited_t (get_irn_visited)(const ir_node *node)
400 return get_irn_visited_(node);
403 void (set_irn_visited)(ir_node *node, ir_visited_t visited)
405 set_irn_visited_(node, visited);
408 void (mark_irn_visited)(ir_node *node)
410 mark_irn_visited_(node);
413 int (irn_visited)(const ir_node *node)
415 return irn_visited_(node);
418 int (irn_visited_else_mark)(ir_node *node)
420 return irn_visited_else_mark_(node);
423 void (set_irn_link)(ir_node *node, void *link)
425 set_irn_link_(node, link);
428 void *(get_irn_link)(const ir_node *node)
430 return get_irn_link_(node);
433 op_pin_state (get_irn_pinned)(const ir_node *node)
435 return get_irn_pinned_(node);
438 op_pin_state (is_irn_pinned_in_irg) (const ir_node *node)
440 return is_irn_pinned_in_irg_(node);
443 void set_irn_pinned(ir_node *node, op_pin_state state)
445 /* due to optimization an opt may be turned into a Tuple */
449 assert(node && get_op_pinned(get_irn_op(node)) >= op_pin_state_exc_pinned);
450 assert(state == op_pin_state_pinned || state == op_pin_state_floats);
452 node->attr.except.pin_state = state;
455 long get_irn_node_nr(const ir_node *node)
458 return node->node_nr;
461 void *(get_irn_generic_attr)(ir_node *node)
463 assert(is_ir_node(node));
464 return get_irn_generic_attr_(node);
467 const void *(get_irn_generic_attr_const)(const ir_node *node)
469 assert(is_ir_node(node));
470 return get_irn_generic_attr_const_(node);
473 unsigned (get_irn_idx)(const ir_node *node)
475 assert(is_ir_node(node));
476 return get_irn_idx_(node);
479 int get_irn_pred_pos(ir_node *node, ir_node *arg)
482 for (i = get_irn_arity(node) - 1; i >= 0; i--) {
483 if (get_irn_n(node, i) == arg)
489 ir_node *(get_nodes_block)(const ir_node *node)
491 return get_nodes_block_(node);
494 void set_nodes_block(ir_node *node, ir_node *block)
496 assert(!is_Block(node));
497 set_irn_n(node, -1, block);
500 ir_type *is_frame_pointer(const ir_node *n)
502 if (is_Proj(n) && (get_Proj_proj(n) == pn_Start_P_frame_base)) {
503 ir_node *start = get_Proj_pred(n);
504 if (is_Start(start)) {
505 return get_irg_frame_type(get_irn_irg(start));
511 ir_node **get_Block_cfgpred_arr(ir_node *node)
513 assert(is_Block(node));
514 return (ir_node **)&(get_irn_in(node)[1]);
517 int (get_Block_n_cfgpreds)(const ir_node *node)
519 return get_Block_n_cfgpreds_(node);
522 ir_node *(get_Block_cfgpred)(const ir_node *node, int pos)
524 return get_Block_cfgpred_(node, pos);
527 void set_Block_cfgpred(ir_node *node, int pos, ir_node *pred)
529 assert(is_Block(node));
530 set_irn_n(node, pos, pred);
533 int get_Block_cfgpred_pos(const ir_node *block, const ir_node *pred)
537 for (i = get_Block_n_cfgpreds(block) - 1; i >= 0; --i) {
538 if (get_Block_cfgpred_block(block, i) == pred)
544 ir_node *(get_Block_cfgpred_block)(const ir_node *node, int pos)
546 return get_Block_cfgpred_block_(node, pos);
549 int get_Block_matured(const ir_node *node)
551 assert(is_Block(node));
552 return (int)node->attr.block.is_matured;
555 void set_Block_matured(ir_node *node, int matured)
557 assert(is_Block(node));
558 node->attr.block.is_matured = matured;
561 ir_visited_t (get_Block_block_visited)(const ir_node *node)
563 return get_Block_block_visited_(node);
566 void (set_Block_block_visited)(ir_node *node, ir_visited_t visit)
568 set_Block_block_visited_(node, visit);
571 void (mark_Block_block_visited)(ir_node *node)
573 mark_Block_block_visited_(node);
576 int (Block_block_visited)(const ir_node *node)
578 return Block_block_visited_(node);
581 ir_graph *(get_Block_irg)(const ir_node *block)
583 return get_Block_irg_(block);
586 ir_entity *create_Block_entity(ir_node *block)
589 assert(is_Block(block));
591 entity = block->attr.block.entity;
592 if (entity == NULL) {
593 ir_label_t nr = get_irp_next_label_nr();
594 entity = new_label_entity(nr);
595 set_entity_visibility(entity, ir_visibility_local);
596 set_entity_linkage(entity, IR_LINKAGE_CONSTANT);
597 set_entity_compiler_generated(entity, 1);
599 block->attr.block.entity = entity;
604 ir_node *(get_Block_phis)(const ir_node *block)
606 return get_Block_phis_(block);
609 void (set_Block_phis)(ir_node *block, ir_node *phi)
611 set_Block_phis_(block, phi);
614 void (add_Block_phi)(ir_node *block, ir_node *phi)
616 add_Block_phi_(block, phi);
619 unsigned (get_Block_mark)(const ir_node *block)
621 return get_Block_mark_(block);
624 void (set_Block_mark)(ir_node *block, unsigned mark)
626 set_Block_mark_(block, mark);
629 int get_End_n_keepalives(const ir_node *end)
632 return (get_irn_arity(end) - END_KEEPALIVE_OFFSET);
635 ir_node *get_End_keepalive(const ir_node *end, int pos)
638 return get_irn_n(end, pos + END_KEEPALIVE_OFFSET);
641 void add_End_keepalive(ir_node *end, ir_node *ka)
647 void set_End_keepalive(ir_node *end, int pos, ir_node *ka)
650 set_irn_n(end, pos + END_KEEPALIVE_OFFSET, ka);
653 void set_End_keepalives(ir_node *end, int n, ir_node *in[])
657 ir_graph *irg = get_irn_irg(end);
659 /* notify that edges are deleted */
660 for (e = END_KEEPALIVE_OFFSET; e < ARR_LEN(end->in) - 1; ++e) {
661 edges_notify_edge(end, e, NULL, end->in[e + 1], irg);
663 ARR_RESIZE(ir_node *, end->in, n + 1 + END_KEEPALIVE_OFFSET);
665 for (i = 0; i < n; ++i) {
666 end->in[1 + END_KEEPALIVE_OFFSET + i] = in[i];
667 edges_notify_edge(end, END_KEEPALIVE_OFFSET + i, end->in[1 + END_KEEPALIVE_OFFSET + i], NULL, irg);
670 /* update irg flags */
671 clear_irg_properties(irg, IR_GRAPH_PROPERTY_CONSISTENT_OUTS);
674 void remove_End_keepalive(ir_node *end, ir_node *irn)
676 int n = get_End_n_keepalives(end);
684 ir_node *old_ka = end->in[1 + END_KEEPALIVE_OFFSET + i];
692 irg = get_irn_irg(end);
694 /* remove the edge */
695 edges_notify_edge(end, idx, NULL, irn, irg);
698 /* exchange with the last one */
699 ir_node *old = end->in[1 + END_KEEPALIVE_OFFSET + n - 1];
700 edges_notify_edge(end, n - 1, NULL, old, irg);
701 end->in[1 + END_KEEPALIVE_OFFSET + idx] = old;
702 edges_notify_edge(end, idx, old, NULL, irg);
704 /* now n - 1 keeps, 1 block input */
705 ARR_RESIZE(ir_node *, end->in, (n - 1) + 1 + END_KEEPALIVE_OFFSET);
707 /* update irg flags */
708 clear_irg_properties(irg, IR_GRAPH_PROPERTY_CONSISTENT_OUTS);
711 void remove_End_Bads_and_doublets(ir_node *end)
714 int idx, n = get_End_n_keepalives(end);
716 bool changed = false;
721 irg = get_irn_irg(end);
722 pset_new_init(&keeps);
724 for (idx = n - 1; idx >= 0; --idx) {
725 ir_node *ka = get_End_keepalive(end, idx);
727 if (is_Bad(ka) || is_NoMem(ka) || pset_new_contains(&keeps, ka)) {
729 /* remove the edge */
730 edges_notify_edge(end, idx, NULL, ka, irg);
733 /* exchange with the last one */
734 ir_node *old = end->in[1 + END_KEEPALIVE_OFFSET + n - 1];
735 edges_notify_edge(end, n - 1, NULL, old, irg);
736 end->in[1 + END_KEEPALIVE_OFFSET + idx] = old;
737 edges_notify_edge(end, idx, old, NULL, irg);
741 pset_new_insert(&keeps, ka);
744 /* n keeps, 1 block input */
745 ARR_RESIZE(ir_node *, end->in, n + 1 + END_KEEPALIVE_OFFSET);
747 pset_new_destroy(&keeps);
750 clear_irg_properties(irg, IR_GRAPH_PROPERTY_CONSISTENT_OUTS);
754 void free_End(ir_node *end)
759 end->in = NULL; /* @@@ make sure we get an error if we use the
760 in array afterwards ... */
763 size_t get_Return_n_ress(const ir_node *node)
765 assert(is_Return(node));
766 return (size_t)(get_irn_arity(node) - RETURN_RESULT_OFFSET);
769 ir_node **get_Return_res_arr(ir_node *node)
771 assert(is_Return(node));
772 if (get_Return_n_ress(node) > 0)
773 return (ir_node **)&(get_irn_in(node)[1 + RETURN_RESULT_OFFSET]);
778 ir_node *get_Return_res(const ir_node *node, int pos)
780 assert(is_Return(node));
782 assert(get_Return_n_ress(node) > (size_t)pos);
783 return get_irn_n(node, pos + RETURN_RESULT_OFFSET);
786 void set_Return_res(ir_node *node, int pos, ir_node *res)
788 assert(is_Return(node));
789 set_irn_n(node, pos + RETURN_RESULT_OFFSET, res);
792 int (is_Const_null)(const ir_node *node)
794 return is_Const_null_(node);
797 int (is_Const_one)(const ir_node *node)
799 return is_Const_one_(node);
802 int (is_Const_all_one)(const ir_node *node)
804 return is_Const_all_one_(node);
809 symconst_kind get_SymConst_kind(const ir_node *node)
811 assert(is_SymConst(node));
812 return node->attr.symc.kind;
815 void set_SymConst_kind(ir_node *node, symconst_kind kind)
817 assert(is_SymConst(node));
818 node->attr.symc.kind = kind;
821 ir_type *get_SymConst_type(const ir_node *node)
823 /* the cast here is annoying, but we have to compensate for
825 ir_node *irn = (ir_node *)node;
826 assert(is_SymConst(node) &&
827 (SYMCONST_HAS_TYPE(get_SymConst_kind(node))));
828 return irn->attr.symc.sym.type_p;
831 void set_SymConst_type(ir_node *node, ir_type *tp)
833 assert(is_SymConst(node) &&
834 (SYMCONST_HAS_TYPE(get_SymConst_kind(node))));
835 node->attr.symc.sym.type_p = tp;
838 ir_entity *get_SymConst_entity(const ir_node *node)
840 assert(is_SymConst(node) && SYMCONST_HAS_ENT(get_SymConst_kind(node)));
841 return node->attr.symc.sym.entity_p;
844 void set_SymConst_entity(ir_node *node, ir_entity *ent)
846 assert(is_SymConst(node) && SYMCONST_HAS_ENT(get_SymConst_kind(node)));
847 node->attr.symc.sym.entity_p = ent;
850 ir_enum_const *get_SymConst_enum(const ir_node *node)
852 assert(is_SymConst(node) && SYMCONST_HAS_ENUM(get_SymConst_kind(node)));
853 return node->attr.symc.sym.enum_p;
856 void set_SymConst_enum(ir_node *node, ir_enum_const *ec)
858 assert(is_SymConst(node) && SYMCONST_HAS_ENUM(get_SymConst_kind(node)));
859 node->attr.symc.sym.enum_p = ec;
862 union symconst_symbol
863 get_SymConst_symbol(const ir_node *node)
865 assert(is_SymConst(node));
866 return node->attr.symc.sym;
869 void set_SymConst_symbol(ir_node *node, union symconst_symbol sym)
871 assert(is_SymConst(node));
872 node->attr.symc.sym = sym;
875 int get_Sel_n_indexs(const ir_node *node)
877 assert(is_Sel(node));
878 return (get_irn_arity(node) - SEL_INDEX_OFFSET);
881 ir_node **get_Sel_index_arr(ir_node *node)
883 assert(is_Sel(node));
884 if (get_Sel_n_indexs(node) > 0)
885 return (ir_node **)& get_irn_in(node)[SEL_INDEX_OFFSET + 1];
890 ir_node *get_Sel_index(const ir_node *node, int pos)
892 assert(is_Sel(node));
893 return get_irn_n(node, pos + SEL_INDEX_OFFSET);
896 void set_Sel_index(ir_node *node, int pos, ir_node *index)
898 assert(is_Sel(node));
899 set_irn_n(node, pos + SEL_INDEX_OFFSET, index);
902 ir_node **get_Call_param_arr(ir_node *node)
904 assert(is_Call(node));
905 return &get_irn_in(node)[CALL_PARAM_OFFSET + 1];
908 int get_Call_n_params(const ir_node *node)
910 assert(is_Call(node));
911 return get_irn_arity(node) - CALL_PARAM_OFFSET;
914 ir_node *get_Call_param(const ir_node *node, int pos)
916 assert(is_Call(node));
917 return get_irn_n(node, pos + CALL_PARAM_OFFSET);
920 void set_Call_param(ir_node *node, int pos, ir_node *param)
922 assert(is_Call(node));
923 set_irn_n(node, pos + CALL_PARAM_OFFSET, param);
926 ir_node **get_Builtin_param_arr(ir_node *node)
928 assert(is_Builtin(node));
929 return &get_irn_in(node)[BUILTIN_PARAM_OFFSET + 1];
932 int get_Builtin_n_params(const ir_node *node)
934 assert(is_Builtin(node));
935 return (get_irn_arity(node) - BUILTIN_PARAM_OFFSET);
938 ir_node *get_Builtin_param(const ir_node *node, int pos)
940 assert(is_Builtin(node));
941 return get_irn_n(node, pos + BUILTIN_PARAM_OFFSET);
944 void set_Builtin_param(ir_node *node, int pos, ir_node *param)
946 assert(is_Builtin(node));
947 set_irn_n(node, pos + BUILTIN_PARAM_OFFSET, param);
950 const char *get_builtin_kind_name(ir_builtin_kind kind)
952 #define X(a) case a: return #a
956 X(ir_bk_return_address);
957 X(ir_bk_frame_address);
967 X(ir_bk_inner_trampoline);
974 int Call_has_callees(const ir_node *node)
976 assert(is_Call(node));
977 return ((get_irg_callee_info_state(get_irn_irg(node)) != irg_callee_info_none) &&
978 (node->attr.call.callee_arr != NULL));
981 size_t get_Call_n_callees(const ir_node *node)
983 assert(is_Call(node) && node->attr.call.callee_arr);
984 return ARR_LEN(node->attr.call.callee_arr);
987 ir_entity *get_Call_callee(const ir_node *node, size_t pos)
989 assert(pos < get_Call_n_callees(node));
990 return node->attr.call.callee_arr[pos];
993 void set_Call_callee_arr(ir_node *node, size_t n, ir_entity ** arr)
995 ir_graph *irg = get_irn_irg(node);
997 assert(is_Call(node));
998 if (node->attr.call.callee_arr == NULL || get_Call_n_callees(node) != n) {
999 node->attr.call.callee_arr = NEW_ARR_D(ir_entity *, irg->obst, n);
1001 memcpy(node->attr.call.callee_arr, arr, n * sizeof(ir_entity *));
1004 void remove_Call_callee_arr(ir_node *node)
1006 assert(is_Call(node));
1007 node->attr.call.callee_arr = NULL;
1010 int is_Cast_upcast(ir_node *node)
1012 ir_type *totype = get_Cast_type(node);
1013 ir_type *fromtype = get_irn_typeinfo_type(get_Cast_op(node));
1015 assert(get_irg_typeinfo_state(get_irn_irg(node)) == ir_typeinfo_consistent);
1018 while (is_Pointer_type(totype) && is_Pointer_type(fromtype)) {
1019 totype = get_pointer_points_to_type(totype);
1020 fromtype = get_pointer_points_to_type(fromtype);
1025 if (!is_Class_type(totype)) return 0;
1026 return is_SubClass_of(fromtype, totype);
1029 int is_Cast_downcast(ir_node *node)
1031 ir_type *totype = get_Cast_type(node);
1032 ir_type *fromtype = get_irn_typeinfo_type(get_Cast_op(node));
1034 assert(get_irg_typeinfo_state(get_irn_irg(node)) == ir_typeinfo_consistent);
1037 while (is_Pointer_type(totype) && is_Pointer_type(fromtype)) {
1038 totype = get_pointer_points_to_type(totype);
1039 fromtype = get_pointer_points_to_type(fromtype);
1044 if (!is_Class_type(totype)) return 0;
1045 return is_SubClass_of(totype, fromtype);
1048 int (is_unop)(const ir_node *node)
1050 return is_unop_(node);
1053 ir_node *get_unop_op(const ir_node *node)
1055 if (node->op->opar == oparity_unary)
1056 return get_irn_n(node, node->op->op_index);
1058 assert(node->op->opar == oparity_unary);
1062 void set_unop_op(ir_node *node, ir_node *op)
1064 if (node->op->opar == oparity_unary)
1065 set_irn_n(node, node->op->op_index, op);
1067 assert(node->op->opar == oparity_unary);
1070 int (is_binop)(const ir_node *node)
1072 return is_binop_(node);
1075 ir_node *get_binop_left(const ir_node *node)
1077 assert(node->op->opar == oparity_binary);
1078 return get_irn_n(node, node->op->op_index);
1081 void set_binop_left(ir_node *node, ir_node *left)
1083 assert(node->op->opar == oparity_binary);
1084 set_irn_n(node, node->op->op_index, left);
1087 ir_node *get_binop_right(const ir_node *node)
1089 assert(node->op->opar == oparity_binary);
1090 return get_irn_n(node, node->op->op_index + 1);
1093 void set_binop_right(ir_node *node, ir_node *right)
1095 assert(node->op->opar == oparity_binary);
1096 set_irn_n(node, node->op->op_index + 1, right);
1099 ir_node **get_Phi_preds_arr(ir_node *node)
1101 assert(is_Phi(node));
1102 return (ir_node **)&(get_irn_in(node)[1]);
1105 int get_Phi_n_preds(const ir_node *node)
1107 assert(is_Phi(node));
1108 return get_irn_arity(node);
1111 ir_node *get_Phi_pred(const ir_node *node, int pos)
1113 assert(is_Phi(node));
1114 return get_irn_n(node, pos);
1117 void set_Phi_pred(ir_node *node, int pos, ir_node *pred)
1119 assert(is_Phi(node));
1120 set_irn_n(node, pos, pred);
1123 ir_node *(get_Phi_next)(const ir_node *phi)
1125 return get_Phi_next_(phi);
1128 void (set_Phi_next)(ir_node *phi, ir_node *next)
1130 set_Phi_next_(phi, next);
1133 int is_memop(const ir_node *node)
1135 return is_op_uses_memory(get_irn_op(node));
1138 ir_node *get_memop_mem(const ir_node *node)
1140 const ir_op *op = get_irn_op(node);
1141 assert(is_memop(node));
1142 return get_irn_n(node, op->memory_index);
1145 void set_memop_mem(ir_node *node, ir_node *mem)
1147 const ir_op *op = get_irn_op(node);
1148 assert(is_memop(node));
1149 set_irn_n(node, op->memory_index, mem);
1152 ir_node **get_Sync_preds_arr(ir_node *node)
1154 assert(is_Sync(node));
1155 return (ir_node **)&(get_irn_in(node)[1]);
1158 int get_Sync_n_preds(const ir_node *node)
1160 assert(is_Sync(node));
1161 return (get_irn_arity(node));
1164 ir_node *get_Sync_pred(const ir_node *node, int pos)
1166 assert(is_Sync(node));
1167 return get_irn_n(node, pos);
1170 void set_Sync_pred(ir_node *node, int pos, ir_node *pred)
1172 assert(is_Sync(node));
1173 set_irn_n(node, pos, pred);
1176 void add_Sync_pred(ir_node *node, ir_node *pred)
1178 assert(is_Sync(node));
1179 add_irn_n(node, pred);
1182 int (is_arg_Proj)(const ir_node *node)
1184 return is_arg_Proj_(node);
1187 int is_x_except_Proj(const ir_node *node)
1192 pred = get_Proj_pred(node);
1193 if (!is_fragile_op(pred))
1195 return get_Proj_proj(node) == pred->op->pn_x_except;
1198 int is_x_regular_Proj(const ir_node *node)
1203 pred = get_Proj_pred(node);
1204 if (!is_fragile_op(pred))
1206 return get_Proj_proj(node) == pred->op->pn_x_regular;
1209 void ir_set_throws_exception(ir_node *node, int throws_exception)
1211 except_attr *attr = &node->attr.except;
1212 assert(is_fragile_op(node));
1213 attr->throws_exception = throws_exception;
1216 int ir_throws_exception(const ir_node *node)
1218 const except_attr *attr = &node->attr.except;
1219 assert(is_fragile_op(node));
1220 return attr->throws_exception;
1223 ir_node **get_Tuple_preds_arr(ir_node *node)
1225 assert(is_Tuple(node));
1226 return (ir_node **)&(get_irn_in(node)[1]);
1229 int get_Tuple_n_preds(const ir_node *node)
1231 assert(is_Tuple(node));
1232 return get_irn_arity(node);
1235 ir_node *get_Tuple_pred(const ir_node *node, int pos)
1237 assert(is_Tuple(node));
1238 return get_irn_n(node, pos);
1241 void set_Tuple_pred(ir_node *node, int pos, ir_node *pred)
1243 assert(is_Tuple(node));
1244 set_irn_n(node, pos, pred);
1247 int get_ASM_n_inputs(const ir_node *node)
1249 assert(is_ASM(node));
1250 return get_irn_arity(node) - ASM_PARAM_OFFSET;
1253 ir_node *get_ASM_input(const ir_node *node, int pos)
1255 return get_irn_n(node, ASM_PARAM_OFFSET + pos);
1258 size_t get_ASM_n_output_constraints(const ir_node *node)
1260 assert(is_ASM(node));
1261 return ARR_LEN(node->attr.assem.output_constraints);
1264 size_t get_ASM_n_clobbers(const ir_node *node)
1266 assert(is_ASM(node));
1267 return ARR_LEN(node->attr.assem.clobbers);
1270 ir_graph *(get_irn_irg)(const ir_node *node)
1272 return get_irn_irg_(node);
1275 ir_node *skip_Proj(ir_node *node)
1277 /* don't assert node !!! */
1282 node = get_Proj_pred(node);
1288 skip_Proj_const(const ir_node *node)
1290 /* don't assert node !!! */
1295 node = get_Proj_pred(node);
1300 ir_node *skip_Tuple(ir_node *node)
1305 if (is_Proj(node)) {
1306 pred = get_Proj_pred(node);
1308 if (is_Proj(pred)) { /* nested Tuple ? */
1309 pred = skip_Tuple(pred);
1311 if (is_Tuple(pred)) {
1312 node = get_Tuple_pred(pred, get_Proj_proj(node));
1315 } else if (is_Tuple(pred)) {
1316 node = get_Tuple_pred(pred, get_Proj_proj(node));
1323 ir_node *skip_Cast(ir_node *node)
1326 return get_Cast_op(node);
1330 const ir_node *skip_Cast_const(const ir_node *node)
1333 return get_Cast_op(node);
1337 ir_node *skip_Pin(ir_node *node)
1340 return get_Pin_op(node);
1344 ir_node *skip_Confirm(ir_node *node)
1346 if (is_Confirm(node))
1347 return get_Confirm_value(node);
1351 ir_node *skip_HighLevel_ops(ir_node *node)
1353 while (is_op_highlevel(get_irn_op(node))) {
1354 node = get_irn_n(node, 0);
1360 ir_node *skip_Id(ir_node *node)
1362 /* This should compact Id-cycles to self-cycles. It has the same (or less?) complexity
1363 * than any other approach, as Id chains are resolved and all point to the real node, or
1364 * all id's are self loops.
1366 * Note: This function takes 10% of mostly ANY the compiler run, so it's
1367 * a little bit "hand optimized".
1370 /* don't assert node !!! */
1372 if (!node || (node->op != op_Id)) return node;
1374 /* Don't use get_Id_pred(): We get into an endless loop for
1375 self-referencing Ids. */
1376 pred = node->in[0+1];
1378 if (pred->op != op_Id) return pred;
1380 if (node != pred) { /* not a self referencing Id. Resolve Id chain. */
1381 ir_node *rem_pred, *res;
1383 if (pred->op != op_Id) return pred; /* shortcut */
1386 assert(get_irn_arity (node) > 0);
1388 node->in[0+1] = node; /* turn us into a self referencing Id: shorten Id cycles. */
1389 res = skip_Id(rem_pred);
1390 if (is_Id(res)) /* self-loop */ return node;
1392 node->in[0+1] = res; /* Turn Id chain into Ids all referencing the chain end. */
1399 int (is_SymConst_addr_ent)(const ir_node *node)
1401 return is_SymConst_addr_ent_(node);
1404 int is_cfop(const ir_node *node)
1406 if (is_fragile_op(node) && ir_throws_exception(node))
1409 return is_op_cfopcode(get_irn_op(node));
1412 int is_unknown_jump(const ir_node *node)
1414 return is_op_unknown_jump(get_irn_op(node));
1417 int is_fragile_op(const ir_node *node)
1419 return is_op_fragile(get_irn_op(node));
1422 int (is_irn_forking)(const ir_node *node)
1424 return is_irn_forking_(node);
1427 void (copy_node_attr)(ir_graph *irg, const ir_node *old_node, ir_node *new_node)
1429 copy_node_attr_(irg, old_node, new_node);
1432 ir_type *(get_irn_type_attr)(ir_node *node)
1434 return get_irn_type_attr_(node);
1437 ir_entity *(get_irn_entity_attr)(ir_node *node)
1439 return get_irn_entity_attr_(node);
1442 int (is_irn_constlike)(const ir_node *node)
1444 return is_irn_constlike_(node);
1447 int (is_irn_keep)(const ir_node *node)
1449 return is_irn_keep_(node);
1452 int (is_irn_start_block_placed)(const ir_node *node)
1454 return is_irn_start_block_placed_(node);
1457 int (is_irn_cse_neutral)(const ir_node *node)
1459 return is_irn_cse_neutral_(node);
1462 const char *get_cond_jmp_predicate_name(cond_jmp_predicate pred)
1464 #define X(a) case a: return #a
1466 X(COND_JMP_PRED_NONE);
1467 X(COND_JMP_PRED_TRUE);
1468 X(COND_JMP_PRED_FALSE);
1474 /** Return the attribute type of a SymConst node if exists */
1475 static ir_type *get_SymConst_attr_type(const ir_node *self)
1477 symconst_kind kind = get_SymConst_kind(self);
1478 if (SYMCONST_HAS_TYPE(kind))
1479 return get_SymConst_type(self);
1483 /** Return the attribute entity of a SymConst node if exists */
1484 static ir_entity *get_SymConst_attr_entity(const ir_node *self)
1486 symconst_kind kind = get_SymConst_kind(self);
1487 if (SYMCONST_HAS_ENT(kind))
1488 return get_SymConst_entity(self);
1492 static void register_get_type_func(ir_op *op, get_type_attr_func func)
1494 op->ops.get_type_attr = func;
1497 static void register_get_entity_func(ir_op *op, get_entity_attr_func func)
1499 op->ops.get_entity_attr = func;
1502 void ir_register_getter_ops(void)
1504 register_get_type_func(op_Alloc, get_Alloc_type);
1505 register_get_type_func(op_Builtin, get_Builtin_type);
1506 register_get_type_func(op_Call, get_Call_type);
1507 register_get_type_func(op_Cast, get_Cast_type);
1508 register_get_type_func(op_CopyB, get_CopyB_type);
1509 register_get_type_func(op_Free, get_Free_type);
1510 register_get_type_func(op_InstOf, get_InstOf_type);
1511 register_get_type_func(op_SymConst, get_SymConst_attr_type);
1513 register_get_entity_func(op_SymConst, get_SymConst_attr_entity);
1514 register_get_entity_func(op_Sel, get_Sel_entity);
1515 register_get_entity_func(op_Block, get_Block_entity);
1518 void (set_irn_dbg_info)(ir_node *n, dbg_info *db)
1520 set_irn_dbg_info_(n, db);
1523 dbg_info *(get_irn_dbg_info)(const ir_node *n)
1525 return get_irn_dbg_info_(n);
1528 ir_switch_table *ir_new_switch_table(ir_graph *irg, size_t n_entries)
1530 struct obstack *obst = get_irg_obstack(irg);
1531 ir_switch_table *res = OALLOCFZ(obst, ir_switch_table, entries, n_entries);
1532 res->n_entries = n_entries;
1536 void ir_switch_table_set(ir_switch_table *table, size_t n,
1537 ir_tarval *min, ir_tarval *max, long pn)
1539 ir_switch_table_entry *entry = ir_switch_table_get_entry(table, n);
1545 size_t (ir_switch_table_get_n_entries)(const ir_switch_table *table)
1547 return ir_switch_table_get_n_entries_(table);
1550 ir_tarval *ir_switch_table_get_max(const ir_switch_table *table, size_t e)
1552 return ir_switch_table_get_entry_const(table, e)->max;
1555 ir_tarval *ir_switch_table_get_min(const ir_switch_table *table, size_t e)
1557 return ir_switch_table_get_entry_const(table, e)->min;
1560 long ir_switch_table_get_pn(const ir_switch_table *table, size_t e)
1562 return ir_switch_table_get_entry_const(table, e)->pn;
1565 ir_switch_table *ir_switch_table_duplicate(ir_graph *irg,
1566 const ir_switch_table *table)
1568 size_t n_entries = ir_switch_table_get_n_entries(table);
1570 ir_switch_table *res = ir_new_switch_table(irg, n_entries);
1571 for (e = 0; e < n_entries; ++e) {
1572 const ir_switch_table_entry *entry
1573 = ir_switch_table_get_entry_const(table, e);
1574 ir_switch_table_entry *new_entry = ir_switch_table_get_entry(res, e);
1575 *new_entry = *entry;
1580 /* include generated code */
1581 #include "gen_irnode.c.inl"