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
33 #include "irgraph_t.h"
35 #include "irbackedge_t.h"
39 #include "iredgekinds.h"
40 #include "iredges_t.h"
48 /* some constants fixing the positions of nodes predecessors
50 #define CALL_PARAM_OFFSET 2
51 #define BUILDIN_PARAM_OFFSET 1
52 #define SEL_INDEX_OFFSET 2
53 #define RETURN_RESULT_OFFSET 1 /* mem is not a result */
54 #define END_KEEPALIVE_OFFSET 0
56 static const char *pnc_name_arr [] = {
57 "pn_Cmp_False", "pn_Cmp_Eq", "pn_Cmp_Lt", "pn_Cmp_Le",
58 "pn_Cmp_Gt", "pn_Cmp_Ge", "pn_Cmp_Lg", "pn_Cmp_Leg",
59 "pn_Cmp_Uo", "pn_Cmp_Ue", "pn_Cmp_Ul", "pn_Cmp_Ule",
60 "pn_Cmp_Ug", "pn_Cmp_Uge", "pn_Cmp_Ne", "pn_Cmp_True"
64 * returns the pnc name from an pnc constant
66 const char *get_pnc_string(int pnc) {
67 assert(pnc >= 0 && pnc <
68 (int) (sizeof(pnc_name_arr)/sizeof(pnc_name_arr[0])));
69 return pnc_name_arr[pnc];
73 * Calculates the negated (Complement(R)) pnc condition.
75 pn_Cmp get_negated_pnc(long pnc, ir_mode *mode) {
78 /* do NOT add the Uo bit for non-floating point values */
79 if (! mode_is_float(mode))
85 /* Calculates the inversed (R^-1) pnc condition, i.e., "<" --> ">" */
86 pn_Cmp get_inversed_pnc(long pnc) {
87 long code = pnc & ~(pn_Cmp_Lt|pn_Cmp_Gt);
88 long lesser = pnc & pn_Cmp_Lt;
89 long greater = pnc & pn_Cmp_Gt;
91 code |= (lesser ? pn_Cmp_Gt : 0) | (greater ? pn_Cmp_Lt : 0);
97 * Indicates, whether additional data can be registered to ir nodes.
98 * If set to 1, this is not possible anymore.
100 static int forbid_new_data = 0;
103 * The amount of additional space for custom data to be allocated upon
104 * creating a new node.
106 unsigned firm_add_node_size = 0;
109 /* register new space for every node */
110 unsigned firm_register_additional_node_data(unsigned size) {
111 assert(!forbid_new_data && "Too late to register additional node data");
116 return firm_add_node_size += size;
120 void init_irnode(void) {
121 /* Forbid the addition of new data to an ir node. */
126 * irnode constructor.
127 * Create a new irnode in irg, with an op, mode, arity and
128 * some incoming irnodes.
129 * If arity is negative, a node with a dynamic array is created.
132 new_ir_node(dbg_info *db, ir_graph *irg, ir_node *block, ir_op *op, ir_mode *mode,
133 int arity, ir_node **in)
136 size_t node_size = offsetof(ir_node, attr) + op->attr_size + firm_add_node_size;
143 p = obstack_alloc(irg->obst, node_size);
144 memset(p, 0, node_size);
145 res = (ir_node *)(p + firm_add_node_size);
147 res->kind = k_ir_node;
151 res->node_idx = irg_register_node_idx(irg, res);
156 res->in = NEW_ARR_F(ir_node *, 1); /* 1: space for block */
158 /* not nice but necessary: End and Sync must always have a flexible array */
159 if (op == op_End || op == op_Sync)
160 res->in = NEW_ARR_F(ir_node *, (arity+1));
162 res->in = NEW_ARR_D(ir_node *, irg->obst, (arity+1));
163 memcpy(&res->in[1], in, sizeof(ir_node *) * arity);
167 set_irn_dbg_info(res, db);
169 res->node_nr = get_irp_new_node_nr();
171 for (i = 0; i < EDGE_KIND_LAST; ++i)
172 INIT_LIST_HEAD(&res->edge_info[i].outs_head);
174 /* don't put this into the for loop, arity is -1 for some nodes! */
175 edges_notify_edge(res, -1, res->in[0], NULL, irg);
176 for (i = 1; i <= arity; ++i)
177 edges_notify_edge(res, i - 1, res->in[i], NULL, irg);
179 hook_new_node(irg, res);
180 if (get_irg_phase_state(irg) == phase_backend) {
181 be_info_new_node(res);
187 /*-- getting some parameters from ir_nodes --*/
189 int (is_ir_node)(const void *thing) {
190 return _is_ir_node(thing);
193 int (get_irn_intra_arity)(const ir_node *node) {
194 return _get_irn_intra_arity(node);
197 int (get_irn_inter_arity)(const ir_node *node) {
198 return _get_irn_inter_arity(node);
201 int (*_get_irn_arity)(const ir_node *node) = _get_irn_intra_arity;
203 int (get_irn_arity)(const ir_node *node) {
204 return _get_irn_arity(node);
207 /* Returns the array with ins. This array is shifted with respect to the
208 array accessed by get_irn_n: The block operand is at position 0 not -1.
209 (@@@ This should be changed.)
210 The order of the predecessors in this array is not guaranteed, except that
211 lists of operands as predecessors of Block or arguments of a Call are
213 ir_node **get_irn_in(const ir_node *node) {
215 #ifdef INTERPROCEDURAL_VIEW
216 if (get_interprocedural_view()) { /* handle Filter and Block specially */
217 if (get_irn_opcode(node) == iro_Filter) {
218 assert(node->attr.filter.in_cg);
219 return node->attr.filter.in_cg;
220 } else if (get_irn_opcode(node) == iro_Block && node->attr.block.in_cg) {
221 return node->attr.block.in_cg;
223 /* else fall through */
225 #endif /* INTERPROCEDURAL_VIEW */
229 void set_irn_in(ir_node *node, int arity, ir_node **in) {
232 ir_graph *irg = current_ir_graph;
235 #ifdef INTERPROCEDURAL_VIEW
236 if (get_interprocedural_view()) { /* handle Filter and Block specially */
237 ir_opcode code = get_irn_opcode(node);
238 if (code == iro_Filter) {
239 assert(node->attr.filter.in_cg);
240 pOld_in = &node->attr.filter.in_cg;
241 } else if (code == iro_Block && node->attr.block.in_cg) {
242 pOld_in = &node->attr.block.in_cg;
247 #endif /* INTERPROCEDURAL_VIEW */
251 for (i = 0; i < arity; i++) {
252 if (i < ARR_LEN(*pOld_in)-1)
253 edges_notify_edge(node, i, in[i], (*pOld_in)[i+1], irg);
255 edges_notify_edge(node, i, in[i], NULL, irg);
257 for (;i < ARR_LEN(*pOld_in)-1; i++) {
258 edges_notify_edge(node, i, NULL, (*pOld_in)[i+1], irg);
261 if (arity != ARR_LEN(*pOld_in) - 1) {
262 ir_node * block = (*pOld_in)[0];
263 *pOld_in = NEW_ARR_D(ir_node *, irg->obst, arity + 1);
264 (*pOld_in)[0] = block;
266 fix_backedges(irg->obst, node);
268 memcpy((*pOld_in) + 1, in, sizeof(ir_node *) * arity);
271 ir_node *(get_irn_intra_n)(const ir_node *node, int n) {
272 return _get_irn_intra_n (node, n);
275 ir_node *(get_irn_inter_n)(const ir_node *node, int n) {
276 return _get_irn_inter_n (node, n);
279 ir_node *(*_get_irn_n)(const ir_node *node, int n) = _get_irn_intra_n;
281 ir_node *(get_irn_n)(const ir_node *node, int n) {
282 return _get_irn_n(node, n);
285 void set_irn_n(ir_node *node, int n, ir_node *in) {
286 assert(node && node->kind == k_ir_node);
288 assert(n < get_irn_arity(node));
289 assert(in && in->kind == k_ir_node);
291 if ((n == -1) && (get_irn_opcode(node) == iro_Filter)) {
292 /* Change block pred in both views! */
293 node->in[n + 1] = in;
294 assert(node->attr.filter.in_cg);
295 node->attr.filter.in_cg[n + 1] = in;
298 #ifdef INTERPROCEDURAL_VIEW
299 if (get_interprocedural_view()) { /* handle Filter and Block specially */
300 if (get_irn_opcode(node) == iro_Filter) {
301 assert(node->attr.filter.in_cg);
302 node->attr.filter.in_cg[n + 1] = in;
304 } else if (get_irn_opcode(node) == iro_Block && node->attr.block.in_cg) {
305 node->attr.block.in_cg[n + 1] = in;
308 /* else fall through */
310 #endif /* INTERPROCEDURAL_VIEW */
313 hook_set_irn_n(node, n, in, node->in[n + 1]);
315 /* Here, we rely on src and tgt being in the current ir graph */
316 edges_notify_edge(node, n, in, node->in[n + 1], current_ir_graph);
318 node->in[n + 1] = in;
321 int add_irn_n(ir_node *node, ir_node *in) {
323 ir_graph *irg = get_irn_irg(node);
325 assert(node->op->opar == oparity_dynamic);
326 pos = ARR_LEN(node->in) - 1;
327 ARR_APP1(ir_node *, node->in, in);
328 edges_notify_edge(node, pos, node->in[pos + 1], NULL, irg);
331 hook_set_irn_n(node, pos, node->in[pos + 1], NULL);
336 void del_Sync_n(ir_node *n, int i)
338 int arity = get_Sync_n_preds(n);
339 ir_node *last_pred = get_Sync_pred(n, arity - 1);
340 set_Sync_pred(n, i, last_pred);
341 edges_notify_edge(n, arity - 1, NULL, last_pred, get_irn_irg(n));
342 ARR_SHRINKLEN(get_irn_in(n), arity);
345 int (get_irn_deps)(const ir_node *node) {
346 return _get_irn_deps(node);
349 ir_node *(get_irn_dep)(const ir_node *node, int pos) {
350 return _get_irn_dep(node, pos);
353 void (set_irn_dep)(ir_node *node, int pos, ir_node *dep) {
354 _set_irn_dep(node, pos, dep);
357 int add_irn_dep(ir_node *node, ir_node *dep) {
360 /* DEP edges are only allowed in backend phase */
361 assert(get_irg_phase_state(get_irn_irg(node)) == phase_backend);
362 if (node->deps == NULL) {
363 node->deps = NEW_ARR_F(ir_node *, 1);
369 for(i = 0, n = ARR_LEN(node->deps); i < n; ++i) {
370 if(node->deps[i] == NULL)
373 if(node->deps[i] == dep)
377 if (first_zero >= 0) {
378 node->deps[first_zero] = dep;
381 ARR_APP1(ir_node *, node->deps, dep);
386 edges_notify_edge_kind(node, res, dep, NULL, EDGE_KIND_DEP, get_irn_irg(node));
391 void add_irn_deps(ir_node *tgt, ir_node *src) {
394 for (i = 0, n = get_irn_deps(src); i < n; ++i)
395 add_irn_dep(tgt, get_irn_dep(src, i));
399 ir_mode *(get_irn_mode)(const ir_node *node) {
400 return _get_irn_mode(node);
403 void (set_irn_mode)(ir_node *node, ir_mode *mode) {
404 _set_irn_mode(node, mode);
407 ir_modecode get_irn_modecode(const ir_node *node) {
409 return node->mode->code;
412 /** Gets the string representation of the mode .*/
413 const char *get_irn_modename(const ir_node *node) {
415 return get_mode_name(node->mode);
418 ident *get_irn_modeident(const ir_node *node) {
420 return get_mode_ident(node->mode);
423 ir_op *(get_irn_op)(const ir_node *node) {
424 return _get_irn_op(node);
427 /* should be private to the library: */
428 void (set_irn_op)(ir_node *node, ir_op *op) {
429 _set_irn_op(node, op);
432 unsigned (get_irn_opcode)(const ir_node *node) {
433 return _get_irn_opcode(node);
436 const char *get_irn_opname(const ir_node *node) {
438 if (is_Phi0(node)) return "Phi0";
439 return get_id_str(node->op->name);
442 ident *get_irn_opident(const ir_node *node) {
444 return node->op->name;
447 ir_visited_t (get_irn_visited)(const ir_node *node) {
448 return _get_irn_visited(node);
451 void (set_irn_visited)(ir_node *node, ir_visited_t visited) {
452 _set_irn_visited(node, visited);
455 void (mark_irn_visited)(ir_node *node) {
456 _mark_irn_visited(node);
459 int (irn_visited)(const ir_node *node) {
460 return _irn_visited(node);
463 int (irn_visited_else_mark)(ir_node *node) {
464 return _irn_visited_else_mark(node);
467 void (set_irn_link)(ir_node *node, void *link) {
468 _set_irn_link(node, link);
471 void *(get_irn_link)(const ir_node *node) {
472 return _get_irn_link(node);
475 op_pin_state (get_irn_pinned)(const ir_node *node) {
476 return _get_irn_pinned(node);
479 op_pin_state (is_irn_pinned_in_irg) (const ir_node *node) {
480 return _is_irn_pinned_in_irg(node);
483 void set_irn_pinned(ir_node *node, op_pin_state state) {
484 /* due to optimization an opt may be turned into a Tuple */
488 assert(node && get_op_pinned(get_irn_op(node)) >= op_pin_state_exc_pinned);
489 assert(state == op_pin_state_pinned || state == op_pin_state_floats);
491 node->attr.except.pin_state = state;
494 /* Outputs a unique number for this node */
495 long get_irn_node_nr(const ir_node *node) {
497 return node->node_nr;
500 const_attr *get_irn_const_attr(ir_node *node) {
501 assert(is_Const(node));
502 return &node->attr.con;
505 long get_irn_proj_attr(ir_node *node) {
506 /* BEWARE: check for true Proj node here, no Filter */
507 assert(node->op == op_Proj);
508 return node->attr.proj;
511 alloc_attr *get_irn_alloc_attr(ir_node *node) {
512 assert(is_Alloc(node));
513 return &node->attr.alloc;
516 free_attr *get_irn_free_attr(ir_node *node) {
517 assert(is_Free(node));
518 return &node->attr.free;
521 symconst_attr *get_irn_symconst_attr(ir_node *node) {
522 assert(is_SymConst(node));
523 return &node->attr.symc;
526 ir_type *get_irn_call_attr(ir_node *node) {
527 assert(is_Call(node));
528 return node->attr.call.type = skip_tid(node->attr.call.type);
531 sel_attr *get_irn_sel_attr(ir_node *node) {
532 assert(is_Sel(node));
533 return &node->attr.sel;
536 phi_attr *get_irn_phi_attr(ir_node *node) {
537 return &node->attr.phi;
540 block_attr *get_irn_block_attr(ir_node *node) {
541 assert(is_Block(node));
542 return &node->attr.block;
545 load_attr *get_irn_load_attr(ir_node *node) {
546 assert(is_Load(node));
547 return &node->attr.load;
550 store_attr *get_irn_store_attr(ir_node *node) {
551 assert(is_Store(node));
552 return &node->attr.store;
555 except_attr *get_irn_except_attr(ir_node *node) {
556 assert(node->op == op_Div || node->op == op_Quot ||
557 node->op == op_DivMod || node->op == op_Mod || node->op == op_Call || node->op == op_Alloc || node->op == op_Bound);
558 return &node->attr.except;
561 divmod_attr *get_irn_divmod_attr(ir_node *node) {
562 assert(node->op == op_Div || node->op == op_Quot ||
563 node->op == op_DivMod || node->op == op_Mod);
564 return &node->attr.divmod;
567 builtin_attr *get_irn_builtin_attr(ir_node *node) {
568 assert(is_Builtin(node));
569 return &node->attr.builtin;
572 void *(get_irn_generic_attr)(ir_node *node) {
573 assert(is_ir_node(node));
574 return _get_irn_generic_attr(node);
577 const void *(get_irn_generic_attr_const)(const ir_node *node) {
578 assert(is_ir_node(node));
579 return _get_irn_generic_attr_const(node);
582 unsigned (get_irn_idx)(const ir_node *node) {
583 assert(is_ir_node(node));
584 return _get_irn_idx(node);
587 int get_irn_pred_pos(ir_node *node, ir_node *arg) {
589 for (i = get_irn_arity(node) - 1; i >= 0; i--) {
590 if (get_irn_n(node, i) == arg)
596 /** manipulate fields of individual nodes **/
598 /* this works for all except Block */
599 ir_node *get_nodes_block(const ir_node *node) {
600 assert(node->op != op_Block);
601 return get_irn_n(node, -1);
604 void set_nodes_block(ir_node *node, ir_node *block) {
605 assert(node->op != op_Block);
606 set_irn_n(node, -1, block);
609 /* this works for all except Block */
610 ir_node *get_nodes_MacroBlock(const ir_node *node) {
611 assert(node->op != op_Block);
612 return get_Block_MacroBlock(get_irn_n(node, -1));
615 /* Test whether arbitrary node is frame pointer, i.e. Proj(pn_Start_P_frame_base)
616 * from Start. If so returns frame type, else Null. */
617 ir_type *is_frame_pointer(const ir_node *n) {
618 if (is_Proj(n) && (get_Proj_proj(n) == pn_Start_P_frame_base)) {
619 ir_node *start = get_Proj_pred(n);
620 if (is_Start(start)) {
621 return get_irg_frame_type(get_irn_irg(start));
627 /* Test whether arbitrary node is tls pointer, i.e. Proj(pn_Start_P_tls)
628 * from Start. If so returns tls type, else Null. */
629 ir_type *is_tls_pointer(const ir_node *n) {
630 if (is_Proj(n) && (get_Proj_proj(n) == pn_Start_P_tls)) {
631 ir_node *start = get_Proj_pred(n);
632 if (is_Start(start)) {
633 return get_tls_type();
639 ir_node **get_Block_cfgpred_arr(ir_node *node) {
640 assert(is_Block(node));
641 return (ir_node **)&(get_irn_in(node)[1]);
644 int (get_Block_n_cfgpreds)(const ir_node *node) {
645 return _get_Block_n_cfgpreds(node);
648 ir_node *(get_Block_cfgpred)(const ir_node *node, int pos) {
649 return _get_Block_cfgpred(node, pos);
652 void set_Block_cfgpred(ir_node *node, int pos, ir_node *pred) {
653 assert(is_Block(node));
654 set_irn_n(node, pos, pred);
657 int get_Block_cfgpred_pos(const ir_node *block, const ir_node *pred) {
660 for (i = get_Block_n_cfgpreds(block) - 1; i >= 0; --i) {
661 if (get_Block_cfgpred_block(block, i) == pred)
667 ir_node *(get_Block_cfgpred_block)(const ir_node *node, int pos) {
668 return _get_Block_cfgpred_block(node, pos);
671 int get_Block_matured(const ir_node *node) {
672 assert(is_Block(node));
673 return (int)node->attr.block.is_matured;
676 void set_Block_matured(ir_node *node, int matured) {
677 assert(is_Block(node));
678 node->attr.block.is_matured = matured;
681 ir_visited_t (get_Block_block_visited)(const ir_node *node) {
682 return _get_Block_block_visited(node);
685 void (set_Block_block_visited)(ir_node *node, ir_visited_t visit) {
686 _set_Block_block_visited(node, visit);
689 /* For this current_ir_graph must be set. */
690 void (mark_Block_block_visited)(ir_node *node) {
691 _mark_Block_block_visited(node);
694 int (Block_block_visited)(const ir_node *node) {
695 return _Block_block_visited(node);
698 ir_node *get_Block_graph_arr(ir_node *node, int pos) {
699 assert(is_Block(node));
700 return node->attr.block.graph_arr[pos+1];
703 void set_Block_graph_arr(ir_node *node, int pos, ir_node *value) {
704 assert(is_Block(node));
705 node->attr.block.graph_arr[pos+1] = value;
708 #ifdef INTERPROCEDURAL_VIEW
709 void set_Block_cg_cfgpred_arr(ir_node *node, int arity, ir_node *in[]) {
710 assert(is_Block(node));
711 if (node->attr.block.in_cg == NULL || arity != ARR_LEN(node->attr.block.in_cg) - 1) {
712 node->attr.block.in_cg = NEW_ARR_D(ir_node *, current_ir_graph->obst, arity + 1);
713 node->attr.block.in_cg[0] = NULL;
714 node->attr.block.cg_backedge = new_backedge_arr(current_ir_graph->obst, arity);
716 /* Fix backedge array. fix_backedges() operates depending on
717 interprocedural_view. */
718 int ipv = get_interprocedural_view();
719 set_interprocedural_view(1);
720 fix_backedges(current_ir_graph->obst, node);
721 set_interprocedural_view(ipv);
724 memcpy(node->attr.block.in_cg + 1, in, sizeof(ir_node *) * arity);
727 void set_Block_cg_cfgpred(ir_node *node, int pos, ir_node *pred) {
728 assert(is_Block(node) && node->attr.block.in_cg &&
729 0 <= pos && pos < ARR_LEN(node->attr.block.in_cg) - 1);
730 node->attr.block.in_cg[pos + 1] = pred;
733 ir_node **get_Block_cg_cfgpred_arr(ir_node *node) {
734 assert(is_Block(node));
735 return node->attr.block.in_cg == NULL ? NULL : node->attr.block.in_cg + 1;
738 int get_Block_cg_n_cfgpreds(const ir_node *node) {
739 assert(is_Block(node));
740 return node->attr.block.in_cg == NULL ? 0 : ARR_LEN(node->attr.block.in_cg) - 1;
743 ir_node *get_Block_cg_cfgpred(const ir_node *node, int pos) {
744 assert(is_Block(node) && node->attr.block.in_cg);
745 return node->attr.block.in_cg[pos + 1];
748 void remove_Block_cg_cfgpred_arr(ir_node *node) {
749 assert(is_Block(node));
750 node->attr.block.in_cg = NULL;
752 #endif /* INTERPROCEDURAL_VIEW */
754 ir_node *(set_Block_dead)(ir_node *block) {
755 return _set_Block_dead(block);
758 int (is_Block_dead)(const ir_node *block) {
759 return _is_Block_dead(block);
762 ir_extblk *get_Block_extbb(const ir_node *block) {
764 assert(is_Block(block));
765 res = block->attr.block.extblk;
766 assert(res == NULL || is_ir_extbb(res));
770 void set_Block_extbb(ir_node *block, ir_extblk *extblk) {
771 assert(is_Block(block));
772 assert(extblk == NULL || is_ir_extbb(extblk));
773 block->attr.block.extblk = extblk;
776 /* Returns the macro block header of a block.*/
777 ir_node *get_Block_MacroBlock(const ir_node *block) {
779 assert(is_Block(block));
780 mbh = get_irn_n(block, -1);
781 /* once macro block header is respected by all optimizations,
782 this assert can be removed */
787 /* Sets the macro block header of a block. */
788 void set_Block_MacroBlock(ir_node *block, ir_node *mbh) {
789 assert(is_Block(block));
790 assert(is_Block(mbh));
791 set_irn_n(block, -1, mbh);
794 /* returns the macro block header of a node. */
795 ir_node *get_irn_MacroBlock(const ir_node *n) {
797 n = get_nodes_block(n);
798 /* if the Block is Bad, do NOT try to get it's MB, it will fail. */
802 return get_Block_MacroBlock(n);
805 /* returns the graph of a Block. */
806 ir_graph *get_Block_irg(const ir_node *block) {
807 assert(is_Block(block));
808 return block->attr.block.irg;
811 int has_Block_label(const ir_node *block) {
812 assert(is_Block(block));
813 return block->attr.block.has_label;
816 ir_label_t get_Block_label(const ir_node *block) {
817 assert(is_Block(block));
818 return block->attr.block.label;
821 void set_Block_label(ir_node *block, ir_label_t label) {
822 assert(is_Block(block));
823 block->attr.block.has_label = 1;
824 block->attr.block.label = label;
827 ir_node *(get_Block_phis)(const ir_node *block) {
828 return _get_Block_phis(block);
831 void (set_Block_phis)(ir_node *block, ir_node *phi) {
832 _set_Block_phis(block, phi);
835 void (add_Block_phi)(ir_node *block, ir_node *phi) {
836 _add_Block_phi(block, phi);
839 /* Get the Block mark (single bit). */
840 unsigned (get_Block_mark)(const ir_node *block) {
841 return _get_Block_mark(block);
844 /* Set the Block mark (single bit). */
845 void (set_Block_mark)(ir_node *block, unsigned mark) {
846 _set_Block_mark(block, mark);
849 int get_End_n_keepalives(const ir_node *end) {
851 return (get_irn_arity(end) - END_KEEPALIVE_OFFSET);
854 ir_node *get_End_keepalive(const ir_node *end, int pos) {
856 return get_irn_n(end, pos + END_KEEPALIVE_OFFSET);
859 void add_End_keepalive(ir_node *end, ir_node *ka) {
864 void set_End_keepalive(ir_node *end, int pos, ir_node *ka) {
866 set_irn_n(end, pos + END_KEEPALIVE_OFFSET, ka);
869 /* Set new keep-alives */
870 void set_End_keepalives(ir_node *end, int n, ir_node *in[]) {
872 ir_graph *irg = get_irn_irg(end);
874 /* notify that edges are deleted */
875 for (i = END_KEEPALIVE_OFFSET; i < ARR_LEN(end->in) - 1; ++i) {
876 edges_notify_edge(end, i, NULL, end->in[i + 1], irg);
878 ARR_RESIZE(ir_node *, end->in, n + 1 + END_KEEPALIVE_OFFSET);
880 for (i = 0; i < n; ++i) {
881 end->in[1 + END_KEEPALIVE_OFFSET + i] = in[i];
882 edges_notify_edge(end, END_KEEPALIVE_OFFSET + i, end->in[1 + END_KEEPALIVE_OFFSET + i], NULL, irg);
886 /* Set new keep-alives from old keep-alives, skipping irn */
887 void remove_End_keepalive(ir_node *end, ir_node *irn) {
888 int n = get_End_n_keepalives(end);
893 for (i = n -1; i >= 0; --i) {
894 ir_node *old_ka = end->in[1 + END_KEEPALIVE_OFFSET + i];
904 irg = get_irn_irg(end);
906 /* remove the edge */
907 edges_notify_edge(end, idx, NULL, irn, irg);
910 /* exchange with the last one */
911 ir_node *old = end->in[1 + END_KEEPALIVE_OFFSET + n - 1];
912 edges_notify_edge(end, n - 1, NULL, old, irg);
913 end->in[1 + END_KEEPALIVE_OFFSET + idx] = old;
914 edges_notify_edge(end, idx, old, NULL, irg);
916 /* now n - 1 keeps, 1 block input */
917 ARR_RESIZE(ir_node *, end->in, (n - 1) + 1 + END_KEEPALIVE_OFFSET);
920 /* remove Bads, NoMems and doublets from the keep-alive set */
921 void remove_End_Bads_and_doublets(ir_node *end) {
923 int idx, n = get_End_n_keepalives(end);
929 irg = get_irn_irg(end);
930 pset_new_init(&keeps);
932 for (idx = n - 1; idx >= 0; --idx) {
933 ir_node *ka = get_End_keepalive(end, idx);
935 if (is_Bad(ka) || is_NoMem(ka) || pset_new_contains(&keeps, ka)) {
936 /* remove the edge */
937 edges_notify_edge(end, idx, NULL, ka, irg);
940 /* exchange with the last one */
941 ir_node *old = end->in[1 + END_KEEPALIVE_OFFSET + n - 1];
942 edges_notify_edge(end, n - 1, NULL, old, irg);
943 end->in[1 + END_KEEPALIVE_OFFSET + idx] = old;
944 edges_notify_edge(end, idx, old, NULL, irg);
948 pset_new_insert(&keeps, ka);
951 /* n keeps, 1 block input */
952 ARR_RESIZE(ir_node *, end->in, n + 1 + END_KEEPALIVE_OFFSET);
954 pset_new_destroy(&keeps);
957 void free_End(ir_node *end) {
961 end->in = NULL; /* @@@ make sure we get an error if we use the
962 in array afterwards ... */
965 /* Return the target address of an IJmp */
966 ir_node *get_IJmp_target(const ir_node *ijmp) {
967 assert(is_IJmp(ijmp));
968 return get_irn_n(ijmp, 0);
971 /** Sets the target address of an IJmp */
972 void set_IJmp_target(ir_node *ijmp, ir_node *tgt) {
973 assert(is_IJmp(ijmp));
974 set_irn_n(ijmp, 0, tgt);
978 > Implementing the case construct (which is where the constant Proj node is
979 > important) involves far more than simply determining the constant values.
980 > We could argue that this is more properly a function of the translator from
981 > Firm to the target machine. That could be done if there was some way of
982 > projecting "default" out of the Cond node.
983 I know it's complicated.
984 Basically there are two problems:
985 - determining the gaps between the Projs
986 - determining the biggest case constant to know the proj number for
988 I see several solutions:
989 1. Introduce a ProjDefault node. Solves both problems.
990 This means to extend all optimizations executed during construction.
991 2. Give the Cond node for switch two flavors:
992 a) there are no gaps in the Projs (existing flavor)
993 b) gaps may exist, default proj is still the Proj with the largest
994 projection number. This covers also the gaps.
995 3. Fix the semantic of the Cond to that of 2b)
997 Solution 2 seems to be the best:
998 Computing the gaps in the Firm representation is not too hard, i.e.,
999 libFIRM can implement a routine that transforms between the two
1000 flavours. This is also possible for 1) but 2) does not require to
1001 change any existing optimization.
1002 Further it should be far simpler to determine the biggest constant than
1003 to compute all gaps.
1004 I don't want to choose 3) as 2a) seems to have advantages for
1005 dataflow analysis and 3) does not allow to convert the representation to
1009 const char *get_cond_kind_name(cond_kind kind)
1011 #define X(a) case a: return #a;
1021 get_Cond_selector(const ir_node *node) {
1022 assert(is_Cond(node));
1023 return get_irn_n(node, 0);
1027 set_Cond_selector(ir_node *node, ir_node *selector) {
1028 assert(is_Cond(node));
1029 set_irn_n(node, 0, selector);
1033 get_Cond_kind(const ir_node *node) {
1034 assert(is_Cond(node));
1035 return node->attr.cond.kind;
1039 set_Cond_kind(ir_node *node, cond_kind kind) {
1040 assert(is_Cond(node));
1041 node->attr.cond.kind = kind;
1045 get_Cond_default_proj(const ir_node *node) {
1046 assert(is_Cond(node));
1047 return node->attr.cond.default_proj;
1050 void set_Cond_default_proj(ir_node *node, long defproj) {
1051 assert(is_Cond(node));
1052 node->attr.cond.default_proj = defproj;
1056 get_Return_mem(const ir_node *node) {
1057 assert(is_Return(node));
1058 return get_irn_n(node, 0);
1062 set_Return_mem(ir_node *node, ir_node *mem) {
1063 assert(is_Return(node));
1064 set_irn_n(node, 0, mem);
1068 get_Return_n_ress(const ir_node *node) {
1069 assert(is_Return(node));
1070 return (get_irn_arity(node) - RETURN_RESULT_OFFSET);
1074 get_Return_res_arr(ir_node *node) {
1075 assert(is_Return(node));
1076 if (get_Return_n_ress(node) > 0)
1077 return (ir_node **)&(get_irn_in(node)[1 + RETURN_RESULT_OFFSET]);
1084 set_Return_n_res(ir_node *node, int results) {
1085 assert(is_Return(node));
1090 get_Return_res(const ir_node *node, int pos) {
1091 assert(is_Return(node));
1092 assert(get_Return_n_ress(node) > pos);
1093 return get_irn_n(node, pos + RETURN_RESULT_OFFSET);
1097 set_Return_res(ir_node *node, int pos, ir_node *res){
1098 assert(is_Return(node));
1099 set_irn_n(node, pos + RETURN_RESULT_OFFSET, res);
1102 tarval *(get_Const_tarval)(const ir_node *node) {
1103 return _get_Const_tarval(node);
1107 set_Const_tarval(ir_node *node, tarval *con) {
1108 assert(is_Const(node));
1109 node->attr.con.tv = con;
1112 int (is_Const_null)(const ir_node *node) {
1113 return _is_Const_null(node);
1116 int (is_Const_one)(const ir_node *node) {
1117 return _is_Const_one(node);
1120 int (is_Const_all_one)(const ir_node *node) {
1121 return _is_Const_all_one(node);
1125 /* The source language type. Must be an atomic type. Mode of type must
1126 be mode of node. For tarvals from entities type must be pointer to
1129 get_Const_type(ir_node *node) {
1130 assert(is_Const(node));
1131 node->attr.con.tp = skip_tid(node->attr.con.tp);
1132 return node->attr.con.tp;
1136 set_Const_type(ir_node *node, ir_type *tp) {
1137 assert(is_Const(node));
1138 if (tp != firm_unknown_type) {
1139 assert(is_atomic_type(tp));
1140 assert(get_type_mode(tp) == get_irn_mode(node));
1142 node->attr.con.tp = tp;
1147 get_SymConst_kind(const ir_node *node) {
1148 assert(is_SymConst(node));
1149 return node->attr.symc.kind;
1153 set_SymConst_kind(ir_node *node, symconst_kind kind) {
1154 assert(is_SymConst(node));
1155 node->attr.symc.kind = kind;
1159 get_SymConst_type(const ir_node *node) {
1160 /* the cast here is annoying, but we have to compensate for
1162 ir_node *irn = (ir_node *)node;
1163 assert(is_SymConst(node) &&
1164 (SYMCONST_HAS_TYPE(get_SymConst_kind(node))));
1165 return irn->attr.symc.sym.type_p = skip_tid(irn->attr.symc.sym.type_p);
1169 set_SymConst_type(ir_node *node, ir_type *tp) {
1170 assert(is_SymConst(node) &&
1171 (SYMCONST_HAS_TYPE(get_SymConst_kind(node))));
1172 node->attr.symc.sym.type_p = tp;
1176 get_SymConst_name(const ir_node *node) {
1177 assert(is_SymConst(node) && SYMCONST_HAS_ID(get_SymConst_kind(node)));
1178 return node->attr.symc.sym.ident_p;
1182 set_SymConst_name(ir_node *node, ident *name) {
1183 assert(is_SymConst(node) && SYMCONST_HAS_ID(get_SymConst_kind(node)));
1184 node->attr.symc.sym.ident_p = name;
1188 /* Only to access SymConst of kind symconst_addr_ent. Else assertion: */
1189 ir_entity *get_SymConst_entity(const ir_node *node) {
1190 assert(is_SymConst(node) && SYMCONST_HAS_ENT(get_SymConst_kind(node)));
1191 return node->attr.symc.sym.entity_p;
1194 void set_SymConst_entity(ir_node *node, ir_entity *ent) {
1195 assert(is_SymConst(node) && SYMCONST_HAS_ENT(get_SymConst_kind(node)));
1196 node->attr.symc.sym.entity_p = ent;
1199 ir_enum_const *get_SymConst_enum(const ir_node *node) {
1200 assert(is_SymConst(node) && SYMCONST_HAS_ENUM(get_SymConst_kind(node)));
1201 return node->attr.symc.sym.enum_p;
1204 void set_SymConst_enum(ir_node *node, ir_enum_const *ec) {
1205 assert(is_SymConst(node) && SYMCONST_HAS_ENUM(get_SymConst_kind(node)));
1206 node->attr.symc.sym.enum_p = ec;
1209 union symconst_symbol
1210 get_SymConst_symbol(const ir_node *node) {
1211 assert(is_SymConst(node));
1212 return node->attr.symc.sym;
1216 set_SymConst_symbol(ir_node *node, union symconst_symbol sym) {
1217 assert(is_SymConst(node));
1218 node->attr.symc.sym = sym;
1221 ir_label_t get_SymConst_label(const ir_node *node) {
1222 assert(is_SymConst(node) && SYMCONST_HAS_LABEL(get_SymConst_kind(node)));
1223 return node->attr.symc.sym.label;
1226 void set_SymConst_label(ir_node *node, ir_label_t label) {
1227 assert(is_SymConst(node) && SYMCONST_HAS_LABEL(get_SymConst_kind(node)));
1228 node->attr.symc.sym.label = label;
1232 get_SymConst_value_type(ir_node *node) {
1233 assert(is_SymConst(node));
1234 if (node->attr.symc.tp) node->attr.symc.tp = skip_tid(node->attr.symc.tp);
1235 return node->attr.symc.tp;
1239 set_SymConst_value_type(ir_node *node, ir_type *tp) {
1240 assert(is_SymConst(node));
1241 node->attr.symc.tp = tp;
1245 get_Sel_mem(const ir_node *node) {
1246 assert(is_Sel(node));
1247 return get_irn_n(node, 0);
1251 set_Sel_mem(ir_node *node, ir_node *mem) {
1252 assert(is_Sel(node));
1253 set_irn_n(node, 0, mem);
1257 get_Sel_ptr(const ir_node *node) {
1258 assert(is_Sel(node));
1259 return get_irn_n(node, 1);
1263 set_Sel_ptr(ir_node *node, ir_node *ptr) {
1264 assert(is_Sel(node));
1265 set_irn_n(node, 1, ptr);
1269 get_Sel_n_indexs(const ir_node *node) {
1270 assert(is_Sel(node));
1271 return (get_irn_arity(node) - SEL_INDEX_OFFSET);
1275 get_Sel_index_arr(ir_node *node) {
1276 assert(is_Sel(node));
1277 if (get_Sel_n_indexs(node) > 0)
1278 return (ir_node **)& get_irn_in(node)[SEL_INDEX_OFFSET + 1];
1284 get_Sel_index(const ir_node *node, int pos) {
1285 assert(is_Sel(node));
1286 return get_irn_n(node, pos + SEL_INDEX_OFFSET);
1290 set_Sel_index(ir_node *node, int pos, ir_node *index) {
1291 assert(is_Sel(node));
1292 set_irn_n(node, pos + SEL_INDEX_OFFSET, index);
1296 get_Sel_entity(const ir_node *node) {
1297 assert(is_Sel(node));
1298 return node->attr.sel.entity;
1301 /* need a version without const to prevent warning */
1302 static ir_entity *_get_Sel_entity(ir_node *node) {
1303 return get_Sel_entity(node);
1307 set_Sel_entity(ir_node *node, ir_entity *ent) {
1308 assert(is_Sel(node));
1309 node->attr.sel.entity = ent;
1313 /* For unary and binary arithmetic operations the access to the
1314 operands can be factored out. Left is the first, right the
1315 second arithmetic value as listed in tech report 0999-33.
1316 unops are: Minus, Abs, Not, Conv, Cast
1317 binops are: Add, Sub, Mul, Quot, DivMod, Div, Mod, And, Or, Eor, Shl,
1318 Shr, Shrs, Rotate, Cmp */
1322 get_Call_mem(const ir_node *node) {
1323 assert(is_Call(node));
1324 return get_irn_n(node, 0);
1328 set_Call_mem(ir_node *node, ir_node *mem) {
1329 assert(is_Call(node));
1330 set_irn_n(node, 0, mem);
1334 get_Call_ptr(const ir_node *node) {
1335 assert(is_Call(node));
1336 return get_irn_n(node, 1);
1340 set_Call_ptr(ir_node *node, ir_node *ptr) {
1341 assert(is_Call(node));
1342 set_irn_n(node, 1, ptr);
1346 get_Call_param_arr(ir_node *node) {
1347 assert(is_Call(node));
1348 return &get_irn_in(node)[CALL_PARAM_OFFSET + 1];
1352 get_Call_n_params(const ir_node *node) {
1353 assert(is_Call(node));
1354 return (get_irn_arity(node) - CALL_PARAM_OFFSET);
1358 get_Call_param(const ir_node *node, int pos) {
1359 assert(is_Call(node));
1360 return get_irn_n(node, pos + CALL_PARAM_OFFSET);
1364 set_Call_param(ir_node *node, int pos, ir_node *param) {
1365 assert(is_Call(node));
1366 set_irn_n(node, pos + CALL_PARAM_OFFSET, param);
1370 get_Call_type(ir_node *node) {
1371 assert(is_Call(node));
1372 return node->attr.call.type = skip_tid(node->attr.call.type);
1376 set_Call_type(ir_node *node, ir_type *tp) {
1377 assert(is_Call(node));
1378 assert((get_unknown_type() == tp) || is_Method_type(tp));
1379 node->attr.call.type = tp;
1383 get_Builtin_mem(const ir_node *node) {
1384 assert(is_Builtin(node));
1385 return get_irn_n(node, 0);
1389 set_Builin_mem(ir_node *node, ir_node *mem) {
1390 assert(is_Builtin(node));
1391 set_irn_n(node, 0, mem);
1395 get_Builtin_kind(const ir_node *node) {
1396 assert(is_Builtin(node));
1397 return node->attr.builtin.kind;
1401 set_Builtin_kind(ir_node *node, ir_builtin_kind kind) {
1402 assert(is_Builtin(node));
1403 node->attr.builtin.kind = kind;
1407 get_Builtin_param_arr(ir_node *node) {
1408 assert(is_Builtin(node));
1409 return &get_irn_in(node)[BUILDIN_PARAM_OFFSET + 1];
1413 get_Builtin_n_params(const ir_node *node) {
1414 assert(is_Builtin(node));
1415 return (get_irn_arity(node) - BUILDIN_PARAM_OFFSET);
1419 get_Builtin_param(const ir_node *node, int pos) {
1420 assert(is_Builtin(node));
1421 return get_irn_n(node, pos + BUILDIN_PARAM_OFFSET);
1425 set_Builtin_param(ir_node *node, int pos, ir_node *param) {
1426 assert(is_Builtin(node));
1427 set_irn_n(node, pos + BUILDIN_PARAM_OFFSET, param);
1431 get_Builtin_type(ir_node *node) {
1432 assert(is_Builtin(node));
1433 return node->attr.builtin.type = skip_tid(node->attr.builtin.type);
1437 set_Builtin_type(ir_node *node, ir_type *tp) {
1438 assert(is_Builtin(node));
1439 assert((get_unknown_type() == tp) || is_Method_type(tp));
1440 node->attr.builtin.type = tp;
1443 /* Returns a human readable string for the ir_builtin_kind. */
1444 const char *get_builtin_kind_name(ir_builtin_kind kind) {
1445 #define X(a) case a: return #a;
1448 X(ir_bk_debugbreak);
1449 X(ir_bk_return_address);
1450 X(ir_bk_frame_address);
1460 X(ir_bk_inner_trampoline);
1467 int Call_has_callees(const ir_node *node) {
1468 assert(is_Call(node));
1469 return ((get_irg_callee_info_state(get_irn_irg(node)) != irg_callee_info_none) &&
1470 (node->attr.call.callee_arr != NULL));
1473 int get_Call_n_callees(const ir_node *node) {
1474 assert(is_Call(node) && node->attr.call.callee_arr);
1475 return ARR_LEN(node->attr.call.callee_arr);
1478 ir_entity *get_Call_callee(const ir_node *node, int pos) {
1479 assert(pos >= 0 && pos < get_Call_n_callees(node));
1480 return node->attr.call.callee_arr[pos];
1483 void set_Call_callee_arr(ir_node *node, const int n, ir_entity ** arr) {
1484 assert(is_Call(node));
1485 if (node->attr.call.callee_arr == NULL || get_Call_n_callees(node) != n) {
1486 node->attr.call.callee_arr = NEW_ARR_D(ir_entity *, current_ir_graph->obst, n);
1488 memcpy(node->attr.call.callee_arr, arr, n * sizeof(ir_entity *));
1491 void remove_Call_callee_arr(ir_node *node) {
1492 assert(is_Call(node));
1493 node->attr.call.callee_arr = NULL;
1496 ir_node *get_CallBegin_ptr(const ir_node *node) {
1497 assert(is_CallBegin(node));
1498 return get_irn_n(node, 0);
1501 void set_CallBegin_ptr(ir_node *node, ir_node *ptr) {
1502 assert(is_CallBegin(node));
1503 set_irn_n(node, 0, ptr);
1506 ir_node *get_CallBegin_call(const ir_node *node) {
1507 assert(is_CallBegin(node));
1508 return node->attr.callbegin.call;
1511 void set_CallBegin_call(ir_node *node, ir_node *call) {
1512 assert(is_CallBegin(node));
1513 node->attr.callbegin.call = call;
1517 * Returns non-zero if a Call is surely a self-recursive Call.
1518 * Beware: if this functions returns 0, the call might be self-recursive!
1520 int is_self_recursive_Call(const ir_node *call) {
1521 const ir_node *callee = get_Call_ptr(call);
1523 if (is_SymConst_addr_ent(callee)) {
1524 const ir_entity *ent = get_SymConst_entity(callee);
1525 const ir_graph *irg = get_entity_irg(ent);
1526 if (irg == get_irn_irg(call))
1533 ir_node * get_##OP##_left(const ir_node *node) { \
1534 assert(is_##OP(node)); \
1535 return get_irn_n(node, node->op->op_index); \
1537 void set_##OP##_left(ir_node *node, ir_node *left) { \
1538 assert(is_##OP(node)); \
1539 set_irn_n(node, node->op->op_index, left); \
1541 ir_node *get_##OP##_right(const ir_node *node) { \
1542 assert(is_##OP(node)); \
1543 return get_irn_n(node, node->op->op_index + 1); \
1545 void set_##OP##_right(ir_node *node, ir_node *right) { \
1546 assert(is_##OP(node)); \
1547 set_irn_n(node, node->op->op_index + 1, right); \
1551 ir_node *get_##OP##_op(const ir_node *node) { \
1552 assert(is_##OP(node)); \
1553 return get_irn_n(node, node->op->op_index); \
1555 void set_##OP##_op(ir_node *node, ir_node *op) { \
1556 assert(is_##OP(node)); \
1557 set_irn_n(node, node->op->op_index, op); \
1560 #define BINOP_MEM(OP) \
1564 get_##OP##_mem(const ir_node *node) { \
1565 assert(is_##OP(node)); \
1566 return get_irn_n(node, 0); \
1570 set_##OP##_mem(ir_node *node, ir_node *mem) { \
1571 assert(is_##OP(node)); \
1572 set_irn_n(node, 0, mem); \
1578 ir_mode *get_##OP##_resmode(const ir_node *node) { \
1579 assert(is_##OP(node)); \
1580 return node->attr.divmod.resmode; \
1583 void set_##OP##_resmode(ir_node *node, ir_mode *mode) { \
1584 assert(is_##OP(node)); \
1585 node->attr.divmod.resmode = mode; \
1613 int get_Div_no_remainder(const ir_node *node) {
1614 assert(is_Div(node));
1615 return node->attr.divmod.no_remainder;
1618 void set_Div_no_remainder(ir_node *node, int no_remainder) {
1619 assert(is_Div(node));
1620 node->attr.divmod.no_remainder = no_remainder;
1623 int get_Conv_strict(const ir_node *node) {
1624 assert(is_Conv(node));
1625 return node->attr.conv.strict;
1628 void set_Conv_strict(ir_node *node, int strict_flag) {
1629 assert(is_Conv(node));
1630 node->attr.conv.strict = (char)strict_flag;
1634 get_Cast_type(ir_node *node) {
1635 assert(is_Cast(node));
1636 node->attr.cast.type = skip_tid(node->attr.cast.type);
1637 return node->attr.cast.type;
1641 set_Cast_type(ir_node *node, ir_type *to_tp) {
1642 assert(is_Cast(node));
1643 node->attr.cast.type = to_tp;
1647 /* Checks for upcast.
1649 * Returns true if the Cast node casts a class type to a super type.
1651 int is_Cast_upcast(ir_node *node) {
1652 ir_type *totype = get_Cast_type(node);
1653 ir_type *fromtype = get_irn_typeinfo_type(get_Cast_op(node));
1655 assert(get_irg_typeinfo_state(get_irn_irg(node)) == ir_typeinfo_consistent);
1658 while (is_Pointer_type(totype) && is_Pointer_type(fromtype)) {
1659 totype = get_pointer_points_to_type(totype);
1660 fromtype = get_pointer_points_to_type(fromtype);
1665 if (!is_Class_type(totype)) return 0;
1666 return is_SubClass_of(fromtype, totype);
1669 /* Checks for downcast.
1671 * Returns true if the Cast node casts a class type to a sub type.
1673 int is_Cast_downcast(ir_node *node) {
1674 ir_type *totype = get_Cast_type(node);
1675 ir_type *fromtype = get_irn_typeinfo_type(get_Cast_op(node));
1677 assert(get_irg_typeinfo_state(get_irn_irg(node)) == ir_typeinfo_consistent);
1680 while (is_Pointer_type(totype) && is_Pointer_type(fromtype)) {
1681 totype = get_pointer_points_to_type(totype);
1682 fromtype = get_pointer_points_to_type(fromtype);
1687 if (!is_Class_type(totype)) return 0;
1688 return is_SubClass_of(totype, fromtype);
1692 (is_unop)(const ir_node *node) {
1693 return _is_unop(node);
1697 get_unop_op(const ir_node *node) {
1698 if (node->op->opar == oparity_unary)
1699 return get_irn_n(node, node->op->op_index);
1701 assert(node->op->opar == oparity_unary);
1706 set_unop_op(ir_node *node, ir_node *op) {
1707 if (node->op->opar == oparity_unary)
1708 set_irn_n(node, node->op->op_index, op);
1710 assert(node->op->opar == oparity_unary);
1714 (is_binop)(const ir_node *node) {
1715 return _is_binop(node);
1719 get_binop_left(const ir_node *node) {
1720 assert(node->op->opar == oparity_binary);
1721 return get_irn_n(node, node->op->op_index);
1725 set_binop_left(ir_node *node, ir_node *left) {
1726 assert(node->op->opar == oparity_binary);
1727 set_irn_n(node, node->op->op_index, left);
1731 get_binop_right(const ir_node *node) {
1732 assert(node->op->opar == oparity_binary);
1733 return get_irn_n(node, node->op->op_index + 1);
1737 set_binop_right(ir_node *node, ir_node *right) {
1738 assert(node->op->opar == oparity_binary);
1739 set_irn_n(node, node->op->op_index + 1, right);
1743 (is_Phi)(const ir_node *n) {
1747 int is_Phi0(const ir_node *n) {
1750 return ((get_irn_op(n) == op_Phi) &&
1751 (get_irn_arity(n) == 0) &&
1752 (get_irg_phase_state(get_irn_irg(n)) == phase_building));
1756 get_Phi_preds_arr(ir_node *node) {
1757 assert(node->op == op_Phi);
1758 return (ir_node **)&(get_irn_in(node)[1]);
1762 get_Phi_n_preds(const ir_node *node) {
1763 assert(is_Phi(node) || is_Phi0(node));
1764 return (get_irn_arity(node));
1768 void set_Phi_n_preds(ir_node *node, int n_preds) {
1769 assert(node->op == op_Phi);
1774 get_Phi_pred(const ir_node *node, int pos) {
1775 assert(is_Phi(node) || is_Phi0(node));
1776 return get_irn_n(node, pos);
1780 set_Phi_pred(ir_node *node, int pos, ir_node *pred) {
1781 assert(is_Phi(node) || is_Phi0(node));
1782 set_irn_n(node, pos, pred);
1785 ir_node *(get_Phi_next)(const ir_node *phi) {
1786 return _get_Phi_next(phi);
1789 void (set_Phi_next)(ir_node *phi, ir_node *next) {
1790 _set_Phi_next(phi, next);
1793 int is_memop(const ir_node *node) {
1794 ir_opcode code = get_irn_opcode(node);
1795 return (code == iro_Load || code == iro_Store);
1798 ir_node *get_memop_mem(const ir_node *node) {
1799 assert(is_memop(node));
1800 return get_irn_n(node, 0);
1803 void set_memop_mem(ir_node *node, ir_node *mem) {
1804 assert(is_memop(node));
1805 set_irn_n(node, 0, mem);
1808 ir_node *get_memop_ptr(const ir_node *node) {
1809 assert(is_memop(node));
1810 return get_irn_n(node, 1);
1813 void set_memop_ptr(ir_node *node, ir_node *ptr) {
1814 assert(is_memop(node));
1815 set_irn_n(node, 1, ptr);
1819 get_Load_mem(const ir_node *node) {
1820 assert(is_Load(node));
1821 return get_irn_n(node, 0);
1825 set_Load_mem(ir_node *node, ir_node *mem) {
1826 assert(is_Load(node));
1827 set_irn_n(node, 0, mem);
1831 get_Load_ptr(const ir_node *node) {
1832 assert(is_Load(node));
1833 return get_irn_n(node, 1);
1837 set_Load_ptr(ir_node *node, ir_node *ptr) {
1838 assert(is_Load(node));
1839 set_irn_n(node, 1, ptr);
1843 get_Load_mode(const ir_node *node) {
1844 assert(is_Load(node));
1845 return node->attr.load.mode;
1849 set_Load_mode(ir_node *node, ir_mode *mode) {
1850 assert(is_Load(node));
1851 node->attr.load.mode = mode;
1855 get_Load_volatility(const ir_node *node) {
1856 assert(is_Load(node));
1857 return node->attr.load.volatility;
1861 set_Load_volatility(ir_node *node, ir_volatility volatility) {
1862 assert(is_Load(node));
1863 node->attr.load.volatility = volatility;
1867 get_Load_align(const ir_node *node) {
1868 assert(is_Load(node));
1869 return node->attr.load.aligned;
1873 set_Load_align(ir_node *node, ir_align align) {
1874 assert(is_Load(node));
1875 node->attr.load.aligned = align;
1880 get_Store_mem(const ir_node *node) {
1881 assert(is_Store(node));
1882 return get_irn_n(node, 0);
1886 set_Store_mem(ir_node *node, ir_node *mem) {
1887 assert(is_Store(node));
1888 set_irn_n(node, 0, mem);
1892 get_Store_ptr(const ir_node *node) {
1893 assert(is_Store(node));
1894 return get_irn_n(node, 1);
1898 set_Store_ptr(ir_node *node, ir_node *ptr) {
1899 assert(is_Store(node));
1900 set_irn_n(node, 1, ptr);
1904 get_Store_value(const ir_node *node) {
1905 assert(is_Store(node));
1906 return get_irn_n(node, 2);
1910 set_Store_value(ir_node *node, ir_node *value) {
1911 assert(is_Store(node));
1912 set_irn_n(node, 2, value);
1916 get_Store_volatility(const ir_node *node) {
1917 assert(is_Store(node));
1918 return node->attr.store.volatility;
1922 set_Store_volatility(ir_node *node, ir_volatility volatility) {
1923 assert(is_Store(node));
1924 node->attr.store.volatility = volatility;
1928 get_Store_align(const ir_node *node) {
1929 assert(is_Store(node));
1930 return node->attr.store.aligned;
1934 set_Store_align(ir_node *node, ir_align align) {
1935 assert(is_Store(node));
1936 node->attr.store.aligned = align;
1941 get_Alloc_mem(const ir_node *node) {
1942 assert(is_Alloc(node));
1943 return get_irn_n(node, 0);
1947 set_Alloc_mem(ir_node *node, ir_node *mem) {
1948 assert(is_Alloc(node));
1949 set_irn_n(node, 0, mem);
1953 get_Alloc_size(const ir_node *node) {
1954 assert(is_Alloc(node));
1955 return get_irn_n(node, 1);
1959 set_Alloc_size(ir_node *node, ir_node *size) {
1960 assert(is_Alloc(node));
1961 set_irn_n(node, 1, size);
1965 get_Alloc_type(ir_node *node) {
1966 assert(is_Alloc(node));
1967 return node->attr.alloc.type = skip_tid(node->attr.alloc.type);
1971 set_Alloc_type(ir_node *node, ir_type *tp) {
1972 assert(is_Alloc(node));
1973 node->attr.alloc.type = tp;
1977 get_Alloc_where(const ir_node *node) {
1978 assert(is_Alloc(node));
1979 return node->attr.alloc.where;
1983 set_Alloc_where(ir_node *node, ir_where_alloc where) {
1984 assert(is_Alloc(node));
1985 node->attr.alloc.where = where;
1990 get_Free_mem(const ir_node *node) {
1991 assert(is_Free(node));
1992 return get_irn_n(node, 0);
1996 set_Free_mem(ir_node *node, ir_node *mem) {
1997 assert(is_Free(node));
1998 set_irn_n(node, 0, mem);
2002 get_Free_ptr(const ir_node *node) {
2003 assert(is_Free(node));
2004 return get_irn_n(node, 1);
2008 set_Free_ptr(ir_node *node, ir_node *ptr) {
2009 assert(is_Free(node));
2010 set_irn_n(node, 1, ptr);
2014 get_Free_size(const ir_node *node) {
2015 assert(is_Free(node));
2016 return get_irn_n(node, 2);
2020 set_Free_size(ir_node *node, ir_node *size) {
2021 assert(is_Free(node));
2022 set_irn_n(node, 2, size);
2026 get_Free_type(ir_node *node) {
2027 assert(is_Free(node));
2028 return node->attr.free.type = skip_tid(node->attr.free.type);
2032 set_Free_type(ir_node *node, ir_type *tp) {
2033 assert(is_Free(node));
2034 node->attr.free.type = tp;
2038 get_Free_where(const ir_node *node) {
2039 assert(is_Free(node));
2040 return node->attr.free.where;
2044 set_Free_where(ir_node *node, ir_where_alloc where) {
2045 assert(is_Free(node));
2046 node->attr.free.where = where;
2049 ir_node **get_Sync_preds_arr(ir_node *node) {
2050 assert(is_Sync(node));
2051 return (ir_node **)&(get_irn_in(node)[1]);
2054 int get_Sync_n_preds(const ir_node *node) {
2055 assert(is_Sync(node));
2056 return (get_irn_arity(node));
2060 void set_Sync_n_preds(ir_node *node, int n_preds) {
2061 assert(is_Sync(node));
2065 ir_node *get_Sync_pred(const ir_node *node, int pos) {
2066 assert(is_Sync(node));
2067 return get_irn_n(node, pos);
2070 void set_Sync_pred(ir_node *node, int pos, ir_node *pred) {
2071 assert(is_Sync(node));
2072 set_irn_n(node, pos, pred);
2075 /* Add a new Sync predecessor */
2076 void add_Sync_pred(ir_node *node, ir_node *pred) {
2077 assert(is_Sync(node));
2078 add_irn_n(node, pred);
2081 /* Returns the source language type of a Proj node. */
2082 ir_type *get_Proj_type(ir_node *n) {
2083 ir_type *tp = firm_unknown_type;
2084 ir_node *pred = get_Proj_pred(n);
2086 switch (get_irn_opcode(pred)) {
2089 /* Deal with Start / Call here: we need to know the Proj Nr. */
2090 assert(get_irn_mode(pred) == mode_T);
2091 pred_pred = get_Proj_pred(pred);
2093 if (is_Start(pred_pred)) {
2094 ir_type *mtp = get_entity_type(get_irg_entity(get_irn_irg(pred_pred)));
2095 tp = get_method_param_type(mtp, get_Proj_proj(n));
2096 } else if (is_Call(pred_pred)) {
2097 ir_type *mtp = get_Call_type(pred_pred);
2098 tp = get_method_res_type(mtp, get_Proj_proj(n));
2101 case iro_Start: break;
2102 case iro_Call: break;
2104 ir_node *a = get_Load_ptr(pred);
2106 tp = get_entity_type(get_Sel_entity(a));
2115 get_Proj_pred(const ir_node *node) {
2116 assert(is_Proj(node));
2117 return get_irn_n(node, 0);
2121 set_Proj_pred(ir_node *node, ir_node *pred) {
2122 assert(is_Proj(node));
2123 set_irn_n(node, 0, pred);
2127 get_Proj_proj(const ir_node *node) {
2128 #ifdef INTERPROCEDURAL_VIEW
2129 ir_opcode code = get_irn_opcode(node);
2131 if (code == iro_Proj) {
2132 return node->attr.proj;
2135 assert(code == iro_Filter);
2136 return node->attr.filter.proj;
2139 assert(is_Proj(node));
2140 return node->attr.proj;
2141 #endif /* INTERPROCEDURAL_VIEW */
2145 set_Proj_proj(ir_node *node, long proj) {
2146 #ifdef INTERPROCEDURAL_VIEW
2147 ir_opcode code = get_irn_opcode(node);
2149 if (code == iro_Proj) {
2150 node->attr.proj = proj;
2153 assert(code == iro_Filter);
2154 node->attr.filter.proj = proj;
2157 assert(is_Proj(node));
2158 node->attr.proj = proj;
2159 #endif /* INTERPROCEDURAL_VIEW */
2162 /* Returns non-zero if a node is a routine parameter. */
2163 int (is_arg_Proj)(const ir_node *node) {
2164 return _is_arg_Proj(node);
2168 get_Tuple_preds_arr(ir_node *node) {
2169 assert(is_Tuple(node));
2170 return (ir_node **)&(get_irn_in(node)[1]);
2174 get_Tuple_n_preds(const ir_node *node) {
2175 assert(is_Tuple(node));
2176 return get_irn_arity(node);
2181 set_Tuple_n_preds(ir_node *node, int n_preds) {
2182 assert(is_Tuple(node));
2187 get_Tuple_pred(const ir_node *node, int pos) {
2188 assert(is_Tuple(node));
2189 return get_irn_n(node, pos);
2193 set_Tuple_pred(ir_node *node, int pos, ir_node *pred) {
2194 assert(is_Tuple(node));
2195 set_irn_n(node, pos, pred);
2199 get_Id_pred(const ir_node *node) {
2200 assert(is_Id(node));
2201 return get_irn_n(node, 0);
2205 set_Id_pred(ir_node *node, ir_node *pred) {
2206 assert(is_Id(node));
2207 set_irn_n(node, 0, pred);
2210 ir_node *get_Confirm_value(const ir_node *node) {
2211 assert(is_Confirm(node));
2212 return get_irn_n(node, 0);
2215 void set_Confirm_value(ir_node *node, ir_node *value) {
2216 assert(is_Confirm(node));
2217 set_irn_n(node, 0, value);
2220 ir_node *get_Confirm_bound(const ir_node *node) {
2221 assert(is_Confirm(node));
2222 return get_irn_n(node, 1);
2225 void set_Confirm_bound(ir_node *node, ir_node *bound) {
2226 assert(is_Confirm(node));
2227 set_irn_n(node, 0, bound);
2230 pn_Cmp get_Confirm_cmp(const ir_node *node) {
2231 assert(is_Confirm(node));
2232 return node->attr.confirm.cmp;
2235 void set_Confirm_cmp(ir_node *node, pn_Cmp cmp) {
2236 assert(is_Confirm(node));
2237 node->attr.confirm.cmp = cmp;
2241 get_Filter_pred(ir_node *node) {
2242 assert(is_Filter(node));
2247 set_Filter_pred(ir_node *node, ir_node *pred) {
2248 assert(is_Filter(node));
2253 get_Filter_proj(ir_node *node) {
2254 assert(is_Filter(node));
2255 return node->attr.filter.proj;
2259 set_Filter_proj(ir_node *node, long proj) {
2260 assert(is_Filter(node));
2261 node->attr.filter.proj = proj;
2264 /* Don't use get_irn_arity, get_irn_n in implementation as access
2265 shall work independent of view!!! */
2266 void set_Filter_cg_pred_arr(ir_node *node, int arity, ir_node ** in) {
2267 assert(is_Filter(node));
2268 if (node->attr.filter.in_cg == NULL || arity != ARR_LEN(node->attr.filter.in_cg) - 1) {
2269 ir_graph *irg = get_irn_irg(node);
2270 node->attr.filter.in_cg = NEW_ARR_D(ir_node *, current_ir_graph->obst, arity + 1);
2271 node->attr.filter.backedge = new_backedge_arr(irg->obst, arity);
2272 node->attr.filter.in_cg[0] = node->in[0];
2274 memcpy(node->attr.filter.in_cg + 1, in, sizeof(ir_node *) * arity);
2277 void set_Filter_cg_pred(ir_node * node, int pos, ir_node * pred) {
2278 assert(is_Filter(node) && node->attr.filter.in_cg &&
2279 0 <= pos && pos < ARR_LEN(node->attr.filter.in_cg) - 1);
2280 node->attr.filter.in_cg[pos + 1] = pred;
2283 int get_Filter_n_cg_preds(ir_node *node) {
2284 assert(is_Filter(node) && node->attr.filter.in_cg);
2285 return (ARR_LEN(node->attr.filter.in_cg) - 1);
2288 ir_node *get_Filter_cg_pred(ir_node *node, int pos) {
2290 assert(is_Filter(node) && node->attr.filter.in_cg &&
2292 arity = ARR_LEN(node->attr.filter.in_cg);
2293 assert(pos < arity - 1);
2294 return node->attr.filter.in_cg[pos + 1];
2298 ir_node *get_Mux_sel(const ir_node *node) {
2299 assert(is_Mux(node));
2303 void set_Mux_sel(ir_node *node, ir_node *sel) {
2304 assert(is_Mux(node));
2308 ir_node *get_Mux_false(const ir_node *node) {
2309 assert(is_Mux(node));
2313 void set_Mux_false(ir_node *node, ir_node *ir_false) {
2314 assert(is_Mux(node));
2315 node->in[2] = ir_false;
2318 ir_node *get_Mux_true(const ir_node *node) {
2319 assert(is_Mux(node));
2323 void set_Mux_true(ir_node *node, ir_node *ir_true) {
2324 assert(is_Mux(node));
2325 node->in[3] = ir_true;
2329 ir_node *get_CopyB_mem(const ir_node *node) {
2330 assert(is_CopyB(node));
2331 return get_irn_n(node, 0);
2334 void set_CopyB_mem(ir_node *node, ir_node *mem) {
2335 assert(node->op == op_CopyB);
2336 set_irn_n(node, 0, mem);
2339 ir_node *get_CopyB_dst(const ir_node *node) {
2340 assert(is_CopyB(node));
2341 return get_irn_n(node, 1);
2344 void set_CopyB_dst(ir_node *node, ir_node *dst) {
2345 assert(is_CopyB(node));
2346 set_irn_n(node, 1, dst);
2349 ir_node *get_CopyB_src(const ir_node *node) {
2350 assert(is_CopyB(node));
2351 return get_irn_n(node, 2);
2354 void set_CopyB_src(ir_node *node, ir_node *src) {
2355 assert(is_CopyB(node));
2356 set_irn_n(node, 2, src);
2359 ir_type *get_CopyB_type(ir_node *node) {
2360 assert(is_CopyB(node));
2361 return node->attr.copyb.type = skip_tid(node->attr.copyb.type);
2364 void set_CopyB_type(ir_node *node, ir_type *data_type) {
2365 assert(is_CopyB(node) && data_type);
2366 node->attr.copyb.type = data_type;
2371 get_InstOf_type(ir_node *node) {
2372 assert(node->op == op_InstOf);
2373 return node->attr.instof.type = skip_tid(node->attr.instof.type);
2377 set_InstOf_type(ir_node *node, ir_type *type) {
2378 assert(node->op == op_InstOf);
2379 node->attr.instof.type = type;
2383 get_InstOf_store(const ir_node *node) {
2384 assert(node->op == op_InstOf);
2385 return get_irn_n(node, 0);
2389 set_InstOf_store(ir_node *node, ir_node *obj) {
2390 assert(node->op == op_InstOf);
2391 set_irn_n(node, 0, obj);
2395 get_InstOf_obj(const ir_node *node) {
2396 assert(node->op == op_InstOf);
2397 return get_irn_n(node, 1);
2401 set_InstOf_obj(ir_node *node, ir_node *obj) {
2402 assert(node->op == op_InstOf);
2403 set_irn_n(node, 1, obj);
2406 /* Returns the memory input of a Raise operation. */
2408 get_Raise_mem(const ir_node *node) {
2409 assert(is_Raise(node));
2410 return get_irn_n(node, 0);
2414 set_Raise_mem(ir_node *node, ir_node *mem) {
2415 assert(is_Raise(node));
2416 set_irn_n(node, 0, mem);
2420 get_Raise_exo_ptr(const ir_node *node) {
2421 assert(is_Raise(node));
2422 return get_irn_n(node, 1);
2426 set_Raise_exo_ptr(ir_node *node, ir_node *exo_ptr) {
2427 assert(is_Raise(node));
2428 set_irn_n(node, 1, exo_ptr);
2433 /* Returns the memory input of a Bound operation. */
2434 ir_node *get_Bound_mem(const ir_node *bound) {
2435 assert(is_Bound(bound));
2436 return get_irn_n(bound, 0);
2439 void set_Bound_mem(ir_node *bound, ir_node *mem) {
2440 assert(is_Bound(bound));
2441 set_irn_n(bound, 0, mem);
2444 /* Returns the index input of a Bound operation. */
2445 ir_node *get_Bound_index(const ir_node *bound) {
2446 assert(is_Bound(bound));
2447 return get_irn_n(bound, 1);
2450 void set_Bound_index(ir_node *bound, ir_node *idx) {
2451 assert(is_Bound(bound));
2452 set_irn_n(bound, 1, idx);
2455 /* Returns the lower bound input of a Bound operation. */
2456 ir_node *get_Bound_lower(const ir_node *bound) {
2457 assert(is_Bound(bound));
2458 return get_irn_n(bound, 2);
2461 void set_Bound_lower(ir_node *bound, ir_node *lower) {
2462 assert(is_Bound(bound));
2463 set_irn_n(bound, 2, lower);
2466 /* Returns the upper bound input of a Bound operation. */
2467 ir_node *get_Bound_upper(const ir_node *bound) {
2468 assert(is_Bound(bound));
2469 return get_irn_n(bound, 3);
2472 void set_Bound_upper(ir_node *bound, ir_node *upper) {
2473 assert(is_Bound(bound));
2474 set_irn_n(bound, 3, upper);
2477 /* Return the operand of a Pin node. */
2478 ir_node *get_Pin_op(const ir_node *pin) {
2479 assert(is_Pin(pin));
2480 return get_irn_n(pin, 0);
2483 void set_Pin_op(ir_node *pin, ir_node *node) {
2484 assert(is_Pin(pin));
2485 set_irn_n(pin, 0, node);
2488 /* Return the assembler text of an ASM pseudo node. */
2489 ident *get_ASM_text(const ir_node *node) {
2490 assert(is_ASM(node));
2491 return node->attr.assem.asm_text;
2494 /* Return the number of input constraints for an ASM node. */
2495 int get_ASM_n_input_constraints(const ir_node *node) {
2496 assert(is_ASM(node));
2497 return ARR_LEN(node->attr.assem.inputs);
2500 /* Return the input constraints for an ASM node. This is a flexible array. */
2501 const ir_asm_constraint *get_ASM_input_constraints(const ir_node *node) {
2502 assert(is_ASM(node));
2503 return node->attr.assem.inputs;
2506 /* Return the number of output constraints for an ASM node. */
2507 int get_ASM_n_output_constraints(const ir_node *node) {
2508 assert(is_ASM(node));
2509 return ARR_LEN(node->attr.assem.outputs);
2512 /* Return the output constraints for an ASM node. */
2513 const ir_asm_constraint *get_ASM_output_constraints(const ir_node *node) {
2514 assert(is_ASM(node));
2515 return node->attr.assem.outputs;
2518 /* Return the number of clobbered registers for an ASM node. */
2519 int get_ASM_n_clobbers(const ir_node *node) {
2520 assert(is_ASM(node));
2521 return ARR_LEN(node->attr.assem.clobber);
2524 /* Return the list of clobbered registers for an ASM node. */
2525 ident **get_ASM_clobbers(const ir_node *node) {
2526 assert(is_ASM(node));
2527 return node->attr.assem.clobber;
2530 /* returns the graph of a node */
2532 get_irn_irg(const ir_node *node) {
2534 * Do not use get_nodes_Block() here, because this
2535 * will check the pinned state.
2536 * However even a 'wrong' block is always in the proper
2539 if (! is_Block(node))
2540 node = get_irn_n(node, -1);
2541 if (is_Bad(node)) /* sometimes bad is predecessor of nodes instead of block: in case of optimization */
2542 node = get_irn_n(node, -1);
2543 assert(is_Block(node));
2544 return node->attr.block.irg;
2548 /*----------------------------------------------------------------*/
2549 /* Auxiliary routines */
2550 /*----------------------------------------------------------------*/
2553 skip_Proj(ir_node *node) {
2554 /* don't assert node !!! */
2559 node = get_Proj_pred(node);
2565 skip_Proj_const(const ir_node *node) {
2566 /* don't assert node !!! */
2571 node = get_Proj_pred(node);
2577 skip_Tuple(ir_node *node) {
2582 if (is_Proj(node)) {
2583 pred = get_Proj_pred(node);
2584 op = get_irn_op(pred);
2587 * Looks strange but calls get_irn_op() only once
2588 * in most often cases.
2590 if (op == op_Proj) { /* nested Tuple ? */
2591 pred = skip_Tuple(pred);
2593 if (is_Tuple(pred)) {
2594 node = get_Tuple_pred(pred, get_Proj_proj(node));
2597 } else if (op == op_Tuple) {
2598 node = get_Tuple_pred(pred, get_Proj_proj(node));
2605 /* returns operand of node if node is a Cast */
2606 ir_node *skip_Cast(ir_node *node) {
2608 return get_Cast_op(node);
2612 /* returns operand of node if node is a Cast */
2613 const ir_node *skip_Cast_const(const ir_node *node) {
2615 return get_Cast_op(node);
2619 /* returns operand of node if node is a Pin */
2620 ir_node *skip_Pin(ir_node *node) {
2622 return get_Pin_op(node);
2626 /* returns operand of node if node is a Confirm */
2627 ir_node *skip_Confirm(ir_node *node) {
2628 if (is_Confirm(node))
2629 return get_Confirm_value(node);
2633 /* skip all high-level ops */
2634 ir_node *skip_HighLevel_ops(ir_node *node) {
2635 while (is_op_highlevel(get_irn_op(node))) {
2636 node = get_irn_n(node, 0);
2642 /* This should compact Id-cycles to self-cycles. It has the same (or less?) complexity
2643 * than any other approach, as Id chains are resolved and all point to the real node, or
2644 * all id's are self loops.
2646 * Note: This function takes 10% of mostly ANY the compiler run, so it's
2647 * a little bit "hand optimized".
2649 * Moreover, it CANNOT be switched off using get_opt_normalize() ...
2652 skip_Id(ir_node *node) {
2654 /* don't assert node !!! */
2656 if (!node || (node->op != op_Id)) return node;
2658 /* Don't use get_Id_pred(): We get into an endless loop for
2659 self-referencing Ids. */
2660 pred = node->in[0+1];
2662 if (pred->op != op_Id) return pred;
2664 if (node != pred) { /* not a self referencing Id. Resolve Id chain. */
2665 ir_node *rem_pred, *res;
2667 if (pred->op != op_Id) return pred; /* shortcut */
2670 assert(get_irn_arity (node) > 0);
2672 node->in[0+1] = node; /* turn us into a self referencing Id: shorten Id cycles. */
2673 res = skip_Id(rem_pred);
2674 if (res->op == op_Id) /* self-loop */ return node;
2676 node->in[0+1] = res; /* Turn Id chain into Ids all referencing the chain end. */
2683 void skip_Id_and_store(ir_node **node) {
2686 if (!n || (n->op != op_Id)) return;
2688 /* Don't use get_Id_pred(): We get into an endless loop for
2689 self-referencing Ids. */
2694 (is_Bad)(const ir_node *node) {
2695 return _is_Bad(node);
2699 (is_NoMem)(const ir_node *node) {
2700 return _is_NoMem(node);
2704 (is_Minus)(const ir_node *node) {
2705 return _is_Minus(node);
2709 (is_Abs)(const ir_node *node) {
2710 return _is_Abs(node);
2714 (is_Mod)(const ir_node *node) {
2715 return _is_Mod(node);
2719 (is_Div)(const ir_node *node) {
2720 return _is_Div(node);
2724 (is_DivMod)(const ir_node *node) {
2725 return _is_DivMod(node);
2729 (is_Quot)(const ir_node *node) {
2730 return _is_Quot(node);
2734 (is_Add)(const ir_node *node) {
2735 return _is_Add(node);
2739 (is_Carry)(const ir_node *node) {
2740 return _is_Carry(node);
2744 (is_And)(const ir_node *node) {
2745 return _is_And(node);
2749 (is_Or)(const ir_node *node) {
2750 return _is_Or(node);
2754 (is_Eor)(const ir_node *node) {
2755 return _is_Eor(node);
2759 (is_Sub)(const ir_node *node) {
2760 return _is_Sub(node);
2764 (is_Shl)(const ir_node *node) {
2765 return _is_Shl(node);
2769 (is_Shr)(const ir_node *node) {
2770 return _is_Shr(node);
2774 (is_Shrs)(const ir_node *node) {
2775 return _is_Shrs(node);
2779 (is_Rotl)(const ir_node *node) {
2780 return _is_Rotl(node);
2784 (is_Not)(const ir_node *node) {
2785 return _is_Not(node);
2789 (is_Id)(const ir_node *node) {
2790 return _is_Id(node);
2794 (is_Tuple)(const ir_node *node) {
2795 return _is_Tuple(node);
2799 (is_Bound)(const ir_node *node) {
2800 return _is_Bound(node);
2804 (is_Start)(const ir_node *node) {
2805 return _is_Start(node);
2809 (is_End)(const ir_node *node) {
2810 return _is_End(node);
2814 (is_Const)(const ir_node *node) {
2815 return _is_Const(node);
2819 (is_Conv)(const ir_node *node) {
2820 return _is_Conv(node);
2824 (is_strictConv)(const ir_node *node) {
2825 return _is_strictConv(node);
2829 (is_Cast)(const ir_node *node) {
2830 return _is_Cast(node);
2834 (is_no_Block)(const ir_node *node) {
2835 return _is_no_Block(node);
2839 (is_Block)(const ir_node *node) {
2840 return _is_Block(node);
2843 /* returns true if node is an Unknown node. */
2845 (is_Unknown)(const ir_node *node) {
2846 return _is_Unknown(node);
2849 /* returns true if node is a Return node. */
2851 (is_Return)(const ir_node *node) {
2852 return _is_Return(node);
2855 /* returns true if node is a Call node. */
2857 (is_Call)(const ir_node *node) {
2858 return _is_Call(node);
2861 /* returns true if node is a Builtin node. */
2863 (is_Builtin)(const ir_node *node) {
2864 return _is_Builtin(node);
2867 /* returns true if node is a CallBegin node. */
2869 (is_CallBegin)(const ir_node *node) {
2870 return _is_CallBegin(node);
2873 /* returns true if node is a Sel node. */
2875 (is_Sel)(const ir_node *node) {
2876 return _is_Sel(node);
2879 /* returns true if node is a Mux node. */
2881 (is_Mux)(const ir_node *node) {
2882 return _is_Mux(node);
2885 /* returns true if node is a Load node. */
2887 (is_Load)(const ir_node *node) {
2888 return _is_Load(node);
2891 /* returns true if node is a Load node. */
2893 (is_Store)(const ir_node *node) {
2894 return _is_Store(node);
2897 /* returns true if node is a Sync node. */
2899 (is_Sync)(const ir_node *node) {
2900 return _is_Sync(node);
2903 /* Returns true if node is a Confirm node. */
2905 (is_Confirm)(const ir_node *node) {
2906 return _is_Confirm(node);
2909 /* Returns true if node is a Pin node. */
2911 (is_Pin)(const ir_node *node) {
2912 return _is_Pin(node);
2915 /* Returns true if node is a SymConst node. */
2917 (is_SymConst)(const ir_node *node) {
2918 return _is_SymConst(node);
2921 /* Returns true if node is a SymConst node with kind symconst_addr_ent. */
2923 (is_SymConst_addr_ent)(const ir_node *node) {
2924 return _is_SymConst_addr_ent(node);
2927 /* Returns true if node is a Cond node. */
2929 (is_Cond)(const ir_node *node) {
2930 return _is_Cond(node);
2934 (is_CopyB)(const ir_node *node) {
2935 return _is_CopyB(node);
2938 /* returns true if node is a Cmp node. */
2940 (is_Cmp)(const ir_node *node) {
2941 return _is_Cmp(node);
2944 /* returns true if node is an Alloc node. */
2946 (is_Alloc)(const ir_node *node) {
2947 return _is_Alloc(node);
2950 /* returns true if node is a Free node. */
2952 (is_Free)(const ir_node *node) {
2953 return _is_Free(node);
2956 /* returns true if a node is a Jmp node. */
2958 (is_Jmp)(const ir_node *node) {
2959 return _is_Jmp(node);
2962 /* returns true if a node is a IJmp node. */
2964 (is_IJmp)(const ir_node *node) {
2965 return _is_IJmp(node);
2968 /* returns true if a node is a Raise node. */
2970 (is_Raise)(const ir_node *node) {
2971 return _is_Raise(node);
2974 /* returns true if a node is an ASM node. */
2976 (is_ASM)(const ir_node *node) {
2977 return _is_ASM(node);
2980 /* returns true if a node is an Dummy node. */
2982 (is_Dummy)(const ir_node *node) {
2983 return _is_Dummy(node);
2987 (is_Proj)(const ir_node *node) {
2988 return _is_Proj(node);
2991 /* Returns true if node is a Filter node. */
2993 (is_Filter)(const ir_node *node) {
2994 return _is_Filter(node);
2997 /* Returns true if the operation manipulates control flow. */
2998 int is_cfop(const ir_node *node) {
2999 return is_op_cfopcode(get_irn_op(node));
3002 /* Returns true if the operation manipulates interprocedural control flow:
3003 CallBegin, EndReg, EndExcept */
3004 int is_ip_cfop(const ir_node *node) {
3005 return is_ip_cfopcode(get_irn_op(node));
3008 /* Returns true if the operation can change the control flow because
3011 is_fragile_op(const ir_node *node) {
3012 return is_op_fragile(get_irn_op(node));
3015 /* Returns the memory operand of fragile operations. */
3016 ir_node *get_fragile_op_mem(ir_node *node) {
3017 assert(node && is_fragile_op(node));
3019 switch (get_irn_opcode(node)) {
3030 return get_irn_n(node, pn_Generic_M_regular);
3035 assert(0 && "should not be reached");
3040 /* Returns the result mode of a Div operation. */
3041 ir_mode *get_divop_resmod(const ir_node *node) {
3042 switch (get_irn_opcode(node)) {
3043 case iro_Quot : return get_Quot_resmode(node);
3044 case iro_DivMod: return get_DivMod_resmode(node);
3045 case iro_Div : return get_Div_resmode(node);
3046 case iro_Mod : return get_Mod_resmode(node);
3048 assert(0 && "should not be reached");
3053 /* Returns true if the operation is a forking control flow operation. */
3054 int (is_irn_forking)(const ir_node *node) {
3055 return _is_irn_forking(node);
3058 /* Return the type associated with the value produced by n
3059 * if the node remarks this type as it is the case for
3060 * Cast, Const, SymConst and some Proj nodes. */
3061 ir_type *(get_irn_type)(ir_node *node) {
3062 return _get_irn_type(node);
3065 /* Return the type attribute of a node n (SymConst, Call, Alloc, Free,
3067 ir_type *(get_irn_type_attr)(ir_node *node) {
3068 return _get_irn_type_attr(node);
3071 /* Return the entity attribute of a node n (SymConst, Sel) or NULL. */
3072 ir_entity *(get_irn_entity_attr)(ir_node *node) {
3073 return _get_irn_entity_attr(node);
3076 /* Returns non-zero for constant-like nodes. */
3077 int (is_irn_constlike)(const ir_node *node) {
3078 return _is_irn_constlike(node);
3082 * Returns non-zero for nodes that are allowed to have keep-alives and
3083 * are neither Block nor PhiM.
3085 int (is_irn_keep)(const ir_node *node) {
3086 return _is_irn_keep(node);
3090 * Returns non-zero for nodes that are always placed in the start block.
3092 int (is_irn_start_block_placed)(const ir_node *node) {
3093 return _is_irn_start_block_placed(node);
3096 /* Returns non-zero for nodes that are machine operations. */
3097 int (is_irn_machine_op)(const ir_node *node) {
3098 return _is_irn_machine_op(node);
3101 /* Returns non-zero for nodes that are machine operands. */
3102 int (is_irn_machine_operand)(const ir_node *node) {
3103 return _is_irn_machine_operand(node);
3106 /* Returns non-zero for nodes that have the n'th user machine flag set. */
3107 int (is_irn_machine_user)(const ir_node *node, unsigned n) {
3108 return _is_irn_machine_user(node, n);
3112 /* Gets the string representation of the jump prediction .*/
3113 const char *get_cond_jmp_predicate_name(cond_jmp_predicate pred) {
3114 #define X(a) case a: return #a;
3116 X(COND_JMP_PRED_NONE);
3117 X(COND_JMP_PRED_TRUE);
3118 X(COND_JMP_PRED_FALSE);
3124 /* Returns the conditional jump prediction of a Cond node. */
3125 cond_jmp_predicate (get_Cond_jmp_pred)(const ir_node *cond) {
3126 return _get_Cond_jmp_pred(cond);
3129 /* Sets a new conditional jump prediction. */
3130 void (set_Cond_jmp_pred)(ir_node *cond, cond_jmp_predicate pred) {
3131 _set_Cond_jmp_pred(cond, pred);
3134 /** the get_type operation must be always implemented and return a firm type */
3135 static ir_type *get_Default_type(ir_node *n) {
3137 return get_unknown_type();
3140 /* Sets the get_type operation for an ir_op_ops. */
3141 ir_op_ops *firm_set_default_get_type(ir_opcode code, ir_op_ops *ops) {
3143 case iro_Const: ops->get_type = get_Const_type; break;
3144 case iro_SymConst: ops->get_type = get_SymConst_value_type; break;
3145 case iro_Cast: ops->get_type = get_Cast_type; break;
3146 case iro_Proj: ops->get_type = get_Proj_type; break;
3148 /* not allowed to be NULL */
3149 if (! ops->get_type)
3150 ops->get_type = get_Default_type;
3156 /** Return the attribute type of a SymConst node if exists */
3157 static ir_type *get_SymConst_attr_type(ir_node *self) {
3158 symconst_kind kind = get_SymConst_kind(self);
3159 if (SYMCONST_HAS_TYPE(kind))
3160 return get_SymConst_type(self);
3164 /** Return the attribute entity of a SymConst node if exists */
3165 static ir_entity *get_SymConst_attr_entity(ir_node *self) {
3166 symconst_kind kind = get_SymConst_kind(self);
3167 if (SYMCONST_HAS_ENT(kind))
3168 return get_SymConst_entity(self);
3172 /** the get_type_attr operation must be always implemented */
3173 static ir_type *get_Null_type(ir_node *n) {
3175 return firm_unknown_type;
3178 /* Sets the get_type operation for an ir_op_ops. */
3179 ir_op_ops *firm_set_default_get_type_attr(ir_opcode code, ir_op_ops *ops) {
3181 case iro_SymConst: ops->get_type_attr = get_SymConst_attr_type; break;
3182 case iro_Call: ops->get_type_attr = get_Call_type; break;
3183 case iro_Alloc: ops->get_type_attr = get_Alloc_type; break;
3184 case iro_Free: ops->get_type_attr = get_Free_type; break;
3185 case iro_Cast: ops->get_type_attr = get_Cast_type; break;
3187 /* not allowed to be NULL */
3188 if (! ops->get_type_attr)
3189 ops->get_type_attr = get_Null_type;
3195 /** the get_entity_attr operation must be always implemented */
3196 static ir_entity *get_Null_ent(ir_node *n) {
3201 /* Sets the get_type operation for an ir_op_ops. */
3202 ir_op_ops *firm_set_default_get_entity_attr(ir_opcode code, ir_op_ops *ops) {
3204 case iro_SymConst: ops->get_entity_attr = get_SymConst_attr_entity; break;
3205 case iro_Sel: ops->get_entity_attr = _get_Sel_entity; break;
3207 /* not allowed to be NULL */
3208 if (! ops->get_entity_attr)
3209 ops->get_entity_attr = get_Null_ent;
3215 /* Sets the debug information of a node. */
3216 void (set_irn_dbg_info)(ir_node *n, dbg_info *db) {
3217 _set_irn_dbg_info(n, db);
3221 * Returns the debug information of an node.
3223 * @param n The node.
3225 dbg_info *(get_irn_dbg_info)(const ir_node *n) {
3226 return _get_irn_dbg_info(n);
3229 /* checks whether a node represents a global address */
3230 int is_Global(const ir_node *node) {
3231 return is_SymConst_addr_ent(node);
3234 /* returns the entity of a global address */
3235 ir_entity *get_Global_entity(const ir_node *node) {
3236 return get_SymConst_entity(node);
3240 * Calculate a hash value of a node.
3242 unsigned firm_default_hash(const ir_node *node) {
3246 /* hash table value = 9*(9*(9*(9*(9*arity+in[0])+in[1])+ ...)+mode)+code */
3247 h = irn_arity = get_irn_intra_arity(node);
3249 /* consider all in nodes... except the block if not a control flow. */
3250 for (i = is_cfop(node) ? -1 : 0; i < irn_arity; ++i) {
3251 h = 9*h + HASH_PTR(get_irn_intra_n(node, i));
3255 h = 9*h + HASH_PTR(get_irn_mode(node));
3257 h = 9*h + HASH_PTR(get_irn_op(node));
3260 } /* firm_default_hash */