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
36 #include "irgraph_t.h"
38 #include "irbackedge_t.h"
42 #include "iredgekinds.h"
43 #include "iredges_t.h"
49 /* some constants fixing the positions of nodes predecessors
51 #define CALL_PARAM_OFFSET 2
52 #define FUNCCALL_PARAM_OFFSET 1
53 #define SEL_INDEX_OFFSET 2
54 #define RETURN_RESULT_OFFSET 1 /* mem is not a result */
55 #define END_KEEPALIVE_OFFSET 0
57 static const char *pnc_name_arr [] = {
58 "pn_Cmp_False", "pn_Cmp_Eq", "pn_Cmp_Lt", "pn_Cmp_Le",
59 "pn_Cmp_Gt", "pn_Cmp_Ge", "pn_Cmp_Lg", "pn_Cmp_Leg",
60 "pn_Cmp_Uo", "pn_Cmp_Ue", "pn_Cmp_Ul", "pn_Cmp_Ule",
61 "pn_Cmp_Ug", "pn_Cmp_Uge", "pn_Cmp_Ne", "pn_Cmp_True"
65 * returns the pnc name from an pnc constant
67 const char *get_pnc_string(int pnc) {
68 assert(pnc >= 0 && pnc <
69 (int) (sizeof(pnc_name_arr)/sizeof(pnc_name_arr[0])));
70 return pnc_name_arr[pnc];
74 * Calculates the negated (Complement(R)) pnc condition.
76 pn_Cmp get_negated_pnc(long pnc, ir_mode *mode) {
79 /* do NOT add the Uo bit for non-floating point values */
80 if (! mode_is_float(mode))
86 /* Calculates the inversed (R^-1) pnc condition, i.e., "<" --> ">" */
87 pn_Cmp get_inversed_pnc(long pnc) {
88 long code = pnc & ~(pn_Cmp_Lt|pn_Cmp_Gt);
89 long lesser = pnc & pn_Cmp_Lt;
90 long greater = pnc & pn_Cmp_Gt;
92 code |= (lesser ? pn_Cmp_Gt : 0) | (greater ? pn_Cmp_Lt : 0);
98 * Indicates, whether additional data can be registered to ir nodes.
99 * If set to 1, this is not possible anymore.
101 static int forbid_new_data = 0;
104 * The amount of additional space for custom data to be allocated upon
105 * creating a new node.
107 unsigned firm_add_node_size = 0;
110 /* register new space for every node */
111 unsigned firm_register_additional_node_data(unsigned size) {
112 assert(!forbid_new_data && "Too late to register additional node data");
117 return firm_add_node_size += size;
121 void init_irnode(void) {
122 /* Forbid the addition of new data to an ir node. */
127 * irnode constructor.
128 * Create a new irnode in irg, with an op, mode, arity and
129 * some incoming irnodes.
130 * If arity is negative, a node with a dynamic array is created.
133 new_ir_node(dbg_info *db, ir_graph *irg, ir_node *block, ir_op *op, ir_mode *mode,
134 int arity, ir_node **in)
137 size_t node_size = offsetof(ir_node, attr) + op->attr_size + firm_add_node_size;
141 assert(irg && op && mode);
142 p = obstack_alloc(irg->obst, node_size);
143 memset(p, 0, node_size);
144 res = (ir_node *)(p + firm_add_node_size);
146 res->kind = k_ir_node;
150 res->node_idx = irg_register_node_idx(irg, res);
155 res->in = NEW_ARR_F(ir_node *, 1); /* 1: space for block */
157 /* not nice but necessary: End and Sync must always have a flexible array */
158 if (op == op_End || op == op_Sync)
159 res->in = NEW_ARR_F(ir_node *, (arity+1));
161 res->in = NEW_ARR_D(ir_node *, irg->obst, (arity+1));
162 memcpy(&res->in[1], in, sizeof(ir_node *) * arity);
166 set_irn_dbg_info(res, db);
170 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);
176 /* don't put this into the for loop, arity is -1 for some nodes! */
177 edges_notify_edge(res, -1, res->in[0], NULL, irg);
178 for (i = 1; i <= arity; ++i)
179 edges_notify_edge(res, i - 1, res->in[i], NULL, irg);
181 hook_new_node(irg, res);
186 /*-- getting some parameters from ir_nodes --*/
188 int (is_ir_node)(const void *thing) {
189 return _is_ir_node(thing);
192 int (get_irn_intra_arity)(const ir_node *node) {
193 return _get_irn_intra_arity(node);
196 int (get_irn_inter_arity)(const ir_node *node) {
197 return _get_irn_inter_arity(node);
200 int (*_get_irn_arity)(const ir_node *node) = _get_irn_intra_arity;
202 int (get_irn_arity)(const ir_node *node) {
203 return _get_irn_arity(node);
206 /* Returns the array with ins. This array is shifted with respect to the
207 array accessed by get_irn_n: The block operand is at position 0 not -1.
208 (@@@ This should be changed.)
209 The order of the predecessors in this array is not guaranteed, except that
210 lists of operands as predecessors of Block or arguments of a Call are
212 ir_node **get_irn_in(const ir_node *node) {
214 #ifdef INTERPROCEDURAL_VIEW
215 if (get_interprocedural_view()) { /* handle Filter and Block specially */
216 if (get_irn_opcode(node) == iro_Filter) {
217 assert(node->attr.filter.in_cg);
218 return node->attr.filter.in_cg;
219 } else if (get_irn_opcode(node) == iro_Block && node->attr.block.in_cg) {
220 return node->attr.block.in_cg;
222 /* else fall through */
224 #endif /* INTERPROCEDURAL_VIEW */
228 void set_irn_in(ir_node *node, int arity, ir_node **in) {
231 ir_graph *irg = current_ir_graph;
234 #ifdef INTERPROCEDURAL_VIEW
235 if (get_interprocedural_view()) { /* handle Filter and Block specially */
236 ir_opcode code = get_irn_opcode(node);
237 if (code == iro_Filter) {
238 assert(node->attr.filter.in_cg);
239 pOld_in = &node->attr.filter.in_cg;
240 } else if (code == iro_Block && node->attr.block.in_cg) {
241 pOld_in = &node->attr.block.in_cg;
246 #endif /* INTERPROCEDURAL_VIEW */
250 for (i = 0; i < arity; i++) {
251 if (i < ARR_LEN(*pOld_in)-1)
252 edges_notify_edge(node, i, in[i], (*pOld_in)[i+1], irg);
254 edges_notify_edge(node, i, in[i], NULL, irg);
256 for (;i < ARR_LEN(*pOld_in)-1; i++) {
257 edges_notify_edge(node, i, NULL, (*pOld_in)[i+1], irg);
260 if (arity != ARR_LEN(*pOld_in) - 1) {
261 ir_node * block = (*pOld_in)[0];
262 *pOld_in = NEW_ARR_D(ir_node *, irg->obst, arity + 1);
263 (*pOld_in)[0] = block;
265 fix_backedges(irg->obst, node);
267 memcpy((*pOld_in) + 1, in, sizeof(ir_node *) * arity);
270 ir_node *(get_irn_intra_n)(const ir_node *node, int n) {
271 return _get_irn_intra_n (node, n);
274 ir_node *(get_irn_inter_n)(const ir_node *node, int n) {
275 return _get_irn_inter_n (node, n);
278 ir_node *(*_get_irn_n)(const ir_node *node, int n) = _get_irn_intra_n;
280 ir_node *(get_irn_n)(const ir_node *node, int n) {
281 return _get_irn_n(node, n);
284 void set_irn_n(ir_node *node, int n, ir_node *in) {
285 assert(node && node->kind == k_ir_node);
287 assert(n < get_irn_arity(node));
288 assert(in && in->kind == k_ir_node);
290 if ((n == -1) && (get_irn_opcode(node) == iro_Filter)) {
291 /* Change block pred in both views! */
292 node->in[n + 1] = in;
293 assert(node->attr.filter.in_cg);
294 node->attr.filter.in_cg[n + 1] = in;
297 #ifdef INTERPROCEDURAL_VIEW
298 if (get_interprocedural_view()) { /* handle Filter and Block specially */
299 if (get_irn_opcode(node) == iro_Filter) {
300 assert(node->attr.filter.in_cg);
301 node->attr.filter.in_cg[n + 1] = in;
303 } else if (get_irn_opcode(node) == iro_Block && node->attr.block.in_cg) {
304 node->attr.block.in_cg[n + 1] = in;
307 /* else fall through */
309 #endif /* INTERPROCEDURAL_VIEW */
312 hook_set_irn_n(node, n, in, node->in[n + 1]);
314 /* Here, we rely on src and tgt being in the current ir graph */
315 edges_notify_edge(node, n, in, node->in[n + 1], current_ir_graph);
317 node->in[n + 1] = in;
320 int add_irn_n(ir_node *node, ir_node *in) {
322 ir_graph *irg = get_irn_irg(node);
324 assert(node->op->opar == oparity_dynamic);
325 pos = ARR_LEN(node->in) - 1;
326 ARR_APP1(ir_node *, node->in, in);
327 edges_notify_edge(node, pos, node->in[pos + 1], NULL, irg);
330 hook_set_irn_n(node, pos, node->in[pos + 1], NULL);
335 void del_Sync_n(ir_node *n, int i)
337 int arity = get_Sync_n_preds(n);
338 ir_node *last_pred = get_Sync_pred(n, arity - 1);
339 set_Sync_pred(n, i, last_pred);
340 edges_notify_edge(n, arity - 1, NULL, last_pred, get_irn_irg(n));
341 ARR_SHRINKLEN(get_irn_in(n), arity);
344 int (get_irn_deps)(const ir_node *node) {
345 return _get_irn_deps(node);
348 ir_node *(get_irn_dep)(const ir_node *node, int pos) {
349 return _get_irn_dep(node, pos);
352 void (set_irn_dep)(ir_node *node, int pos, ir_node *dep) {
353 _set_irn_dep(node, pos, dep);
356 int add_irn_dep(ir_node *node, ir_node *dep) {
359 /* DEP edges are only allowed in backend phase */
360 assert(get_irg_phase_state(get_irn_irg(node)) == phase_backend);
361 if (node->deps == NULL) {
362 node->deps = NEW_ARR_F(ir_node *, 1);
368 for(i = 0, n = ARR_LEN(node->deps); i < n; ++i) {
369 if(node->deps[i] == NULL)
372 if(node->deps[i] == dep)
376 if (first_zero >= 0) {
377 node->deps[first_zero] = dep;
380 ARR_APP1(ir_node *, node->deps, dep);
385 edges_notify_edge_kind(node, res, dep, NULL, EDGE_KIND_DEP, get_irn_irg(node));
390 void add_irn_deps(ir_node *tgt, ir_node *src) {
393 for (i = 0, n = get_irn_deps(src); i < n; ++i)
394 add_irn_dep(tgt, get_irn_dep(src, i));
398 ir_mode *(get_irn_mode)(const ir_node *node) {
399 return _get_irn_mode(node);
402 void (set_irn_mode)(ir_node *node, ir_mode *mode) {
403 _set_irn_mode(node, mode);
406 ir_modecode get_irn_modecode(const ir_node *node) {
408 return node->mode->code;
411 /** Gets the string representation of the mode .*/
412 const char *get_irn_modename(const ir_node *node) {
414 return get_mode_name(node->mode);
417 ident *get_irn_modeident(const ir_node *node) {
419 return get_mode_ident(node->mode);
422 ir_op *(get_irn_op)(const ir_node *node) {
423 return _get_irn_op(node);
426 /* should be private to the library: */
427 void (set_irn_op)(ir_node *node, ir_op *op) {
428 _set_irn_op(node, op);
431 unsigned (get_irn_opcode)(const ir_node *node) {
432 return _get_irn_opcode(node);
435 const char *get_irn_opname(const ir_node *node) {
437 if (is_Phi0(node)) return "Phi0";
438 return get_id_str(node->op->name);
441 ident *get_irn_opident(const ir_node *node) {
443 return node->op->name;
446 unsigned long (get_irn_visited)(const ir_node *node) {
447 return _get_irn_visited(node);
450 void (set_irn_visited)(ir_node *node, unsigned long visited) {
451 _set_irn_visited(node, visited);
454 void (mark_irn_visited)(ir_node *node) {
455 _mark_irn_visited(node);
458 int (irn_not_visited)(const ir_node *node) {
459 return _irn_not_visited(node);
462 int (irn_visited)(const ir_node *node) {
463 return _irn_visited(node);
466 void (set_irn_link)(ir_node *node, void *link) {
467 _set_irn_link(node, link);
470 void *(get_irn_link)(const ir_node *node) {
471 return _get_irn_link(node);
474 op_pin_state (get_irn_pinned)(const ir_node *node) {
475 return _get_irn_pinned(node);
478 op_pin_state (is_irn_pinned_in_irg) (const ir_node *node) {
479 return _is_irn_pinned_in_irg(node);
482 void set_irn_pinned(ir_node *node, op_pin_state state) {
483 /* due to optimization an opt may be turned into a Tuple */
484 if (get_irn_op(node) == op_Tuple)
487 assert(node && get_op_pinned(get_irn_op(node)) >= op_pin_state_exc_pinned);
488 assert(state == op_pin_state_pinned || state == op_pin_state_floats);
490 node->attr.except.pin_state = state;
493 #ifdef DO_HEAPANALYSIS
494 /* Access the abstract interpretation information of a node.
495 Returns NULL if no such information is available. */
496 struct abstval *get_irn_abst_value(ir_node *n) {
499 /* Set the abstract interpretation information of a node. */
500 void set_irn_abst_value(ir_node *n, struct abstval *os) {
503 struct section *firm_get_irn_section(ir_node *n) {
506 void firm_set_irn_section(ir_node *n, struct section *s) {
510 /* Dummies needed for firmjni. */
511 struct abstval *get_irn_abst_value(ir_node *n) {
515 void set_irn_abst_value(ir_node *n, struct abstval *os) {
519 struct section *firm_get_irn_section(ir_node *n) {
523 void firm_set_irn_section(ir_node *n, struct section *s) {
527 #endif /* DO_HEAPANALYSIS */
530 /* Outputs a unique number for this node */
531 long get_irn_node_nr(const ir_node *node) {
534 return node->node_nr;
536 return (long)PTR_TO_INT(node);
540 const_attr *get_irn_const_attr(ir_node *node) {
541 assert(is_Const(node));
542 return &node->attr.con;
545 long get_irn_proj_attr(ir_node *node) {
546 /* BEWARE: check for true Proj node here, no Filter */
547 assert(node->op == op_Proj);
548 return node->attr.proj;
551 alloc_attr *get_irn_alloc_attr(ir_node *node) {
552 assert(is_Alloc(node));
553 return &node->attr.alloc;
556 free_attr *get_irn_free_attr(ir_node *node) {
557 assert(is_Free(node));
558 return &node->attr.free;
561 symconst_attr *get_irn_symconst_attr(ir_node *node) {
562 assert(is_SymConst(node));
563 return &node->attr.symc;
566 ir_type *get_irn_call_attr(ir_node *node) {
567 assert(is_Call(node));
568 return node->attr.call.cld_tp = skip_tid(node->attr.call.cld_tp);
571 sel_attr *get_irn_sel_attr(ir_node *node) {
572 assert(is_Sel(node));
573 return &node->attr.sel;
576 phi_attr *get_irn_phi_attr(ir_node *node) {
577 return &node->attr.phi;
580 block_attr *get_irn_block_attr(ir_node *node) {
581 assert(is_Block(node));
582 return &node->attr.block;
585 load_attr *get_irn_load_attr(ir_node *node) {
586 assert(is_Load(node));
587 return &node->attr.load;
590 store_attr *get_irn_store_attr(ir_node *node) {
591 assert(is_Store(node));
592 return &node->attr.store;
595 except_attr *get_irn_except_attr(ir_node *node) {
596 assert(node->op == op_Div || node->op == op_Quot ||
597 node->op == op_DivMod || node->op == op_Mod || node->op == op_Call || node->op == op_Alloc || node->op == op_Bound);
598 return &node->attr.except;
601 divmod_attr *get_irn_divmod_attr(ir_node *node) {
602 assert(node->op == op_Div || node->op == op_Quot ||
603 node->op == op_DivMod || node->op == op_Mod);
604 return &node->attr.divmod;
607 void *(get_irn_generic_attr)(ir_node *node) {
608 assert(is_ir_node(node));
609 return _get_irn_generic_attr(node);
612 const void *(get_irn_generic_attr_const)(const ir_node *node) {
613 assert(is_ir_node(node));
614 return _get_irn_generic_attr_const(node);
617 unsigned (get_irn_idx)(const ir_node *node) {
618 assert(is_ir_node(node));
619 return _get_irn_idx(node);
622 int get_irn_pred_pos(ir_node *node, ir_node *arg) {
624 for (i = get_irn_arity(node) - 1; i >= 0; i--) {
625 if (get_irn_n(node, i) == arg)
631 /** manipulate fields of individual nodes **/
633 /* this works for all except Block */
634 ir_node *get_nodes_block(const ir_node *node) {
635 assert(node->op != op_Block);
636 return get_irn_n(node, -1);
639 void set_nodes_block(ir_node *node, ir_node *block) {
640 assert(node->op != op_Block);
641 set_irn_n(node, -1, block);
644 /* this works for all except Block */
645 ir_node *get_nodes_MacroBlock(const ir_node *node) {
646 assert(node->op != op_Block);
647 return get_Block_MacroBlock(get_irn_n(node, -1));
650 /* Test whether arbitrary node is frame pointer, i.e. Proj(pn_Start_P_frame_base)
651 * from Start. If so returns frame type, else Null. */
652 ir_type *is_frame_pointer(const ir_node *n) {
653 if (is_Proj(n) && (get_Proj_proj(n) == pn_Start_P_frame_base)) {
654 ir_node *start = get_Proj_pred(n);
655 if (is_Start(start)) {
656 return get_irg_frame_type(get_irn_irg(start));
662 /* Test whether arbitrary node is tls pointer, i.e. Proj(pn_Start_P_tls)
663 * from Start. If so returns tls type, else Null. */
664 ir_type *is_tls_pointer(const ir_node *n) {
665 if (is_Proj(n) && (get_Proj_proj(n) == pn_Start_P_tls)) {
666 ir_node *start = get_Proj_pred(n);
667 if (is_Start(start)) {
668 return get_tls_type();
674 /* Test whether arbitrary node is value arg base, i.e. Proj(pn_Start_P_value_arg_base)
675 * from Start. If so returns 1, else 0. */
676 int is_value_arg_pointer(const ir_node *n) {
678 (get_Proj_proj(n) == pn_Start_P_value_arg_base) &&
679 is_Start(get_Proj_pred(n)))
684 /* Returns an array with the predecessors of the Block. Depending on
685 the implementation of the graph data structure this can be a copy of
686 the internal representation of predecessors as well as the internal
687 array itself. Therefore writing to this array might obstruct the ir. */
688 ir_node **get_Block_cfgpred_arr(ir_node *node) {
689 assert(is_Block(node));
690 return (ir_node **)&(get_irn_in(node)[1]);
693 int (get_Block_n_cfgpreds)(const ir_node *node) {
694 return _get_Block_n_cfgpreds(node);
697 ir_node *(get_Block_cfgpred)(const ir_node *node, int pos) {
698 return _get_Block_cfgpred(node, pos);
701 void set_Block_cfgpred(ir_node *node, int pos, ir_node *pred) {
702 assert(is_Block(node));
703 set_irn_n(node, pos, pred);
706 ir_node *(get_Block_cfgpred_block)(const ir_node *node, int pos) {
707 return _get_Block_cfgpred_block(node, pos);
710 int get_Block_matured(const ir_node *node) {
711 assert(is_Block(node));
712 return (int)node->attr.block.is_matured;
715 void set_Block_matured(ir_node *node, int matured) {
716 assert(is_Block(node));
717 node->attr.block.is_matured = matured;
720 unsigned long (get_Block_block_visited)(const ir_node *node) {
721 return _get_Block_block_visited(node);
724 void (set_Block_block_visited)(ir_node *node, unsigned long visit) {
725 _set_Block_block_visited(node, visit);
728 /* For this current_ir_graph must be set. */
729 void (mark_Block_block_visited)(ir_node *node) {
730 _mark_Block_block_visited(node);
733 int (Block_not_block_visited)(const ir_node *node) {
734 return _Block_not_block_visited(node);
737 int (Block_block_visited)(const ir_node *node) {
738 return _Block_block_visited(node);
741 ir_node *get_Block_graph_arr(ir_node *node, int pos) {
742 assert(is_Block(node));
743 return node->attr.block.graph_arr[pos+1];
746 void set_Block_graph_arr(ir_node *node, int pos, ir_node *value) {
747 assert(is_Block(node));
748 node->attr.block.graph_arr[pos+1] = value;
751 #ifdef INTERPROCEDURAL_VIEW
752 void set_Block_cg_cfgpred_arr(ir_node *node, int arity, ir_node *in[]) {
753 assert(is_Block(node));
754 if (node->attr.block.in_cg == NULL || arity != ARR_LEN(node->attr.block.in_cg) - 1) {
755 node->attr.block.in_cg = NEW_ARR_D(ir_node *, current_ir_graph->obst, arity + 1);
756 node->attr.block.in_cg[0] = NULL;
757 node->attr.block.cg_backedge = new_backedge_arr(current_ir_graph->obst, arity);
759 /* Fix backedge array. fix_backedges() operates depending on
760 interprocedural_view. */
761 int ipv = get_interprocedural_view();
762 set_interprocedural_view(1);
763 fix_backedges(current_ir_graph->obst, node);
764 set_interprocedural_view(ipv);
767 memcpy(node->attr.block.in_cg + 1, in, sizeof(ir_node *) * arity);
770 void set_Block_cg_cfgpred(ir_node *node, int pos, ir_node *pred) {
771 assert(is_Block(node) && node->attr.block.in_cg &&
772 0 <= pos && pos < ARR_LEN(node->attr.block.in_cg) - 1);
773 node->attr.block.in_cg[pos + 1] = pred;
776 ir_node **get_Block_cg_cfgpred_arr(ir_node *node) {
777 assert(is_Block(node));
778 return node->attr.block.in_cg == NULL ? NULL : node->attr.block.in_cg + 1;
781 int get_Block_cg_n_cfgpreds(const ir_node *node) {
782 assert(is_Block(node));
783 return node->attr.block.in_cg == NULL ? 0 : ARR_LEN(node->attr.block.in_cg) - 1;
786 ir_node *get_Block_cg_cfgpred(const ir_node *node, int pos) {
787 assert(is_Block(node) && node->attr.block.in_cg);
788 return node->attr.block.in_cg[pos + 1];
791 void remove_Block_cg_cfgpred_arr(ir_node *node) {
792 assert(is_Block(node));
793 node->attr.block.in_cg = NULL;
795 #endif /* INTERPROCEDURAL_VIEW */
797 ir_node *(set_Block_dead)(ir_node *block) {
798 return _set_Block_dead(block);
801 int (is_Block_dead)(const ir_node *block) {
802 return _is_Block_dead(block);
805 ir_extblk *get_Block_extbb(const ir_node *block) {
807 assert(is_Block(block));
808 res = block->attr.block.extblk;
809 assert(res == NULL || is_ir_extbb(res));
813 void set_Block_extbb(ir_node *block, ir_extblk *extblk) {
814 assert(is_Block(block));
815 assert(extblk == NULL || is_ir_extbb(extblk));
816 block->attr.block.extblk = extblk;
819 /* Returns the macro block header of a block.*/
820 ir_node *get_Block_MacroBlock(const ir_node *block) {
822 assert(is_Block(block));
823 mbh = get_irn_n(block, -1);
824 /* once macro block header is respected by all optimizations,
825 this assert can be removed */
830 /* Sets the macro block header of a block. */
831 void set_Block_MacroBlock(ir_node *block, ir_node *mbh) {
832 assert(is_Block(block));
833 assert(is_Block(mbh));
834 set_irn_n(block, -1, mbh);
837 /* returns the macro block header of a node. */
838 ir_node *get_irn_MacroBlock(const ir_node *n) {
840 n = get_nodes_block(n);
841 /* if the Block is Bad, do NOT try to get it's MB, it will fail. */
845 return get_Block_MacroBlock(n);
848 /* returns the graph of a Block. */
849 ir_graph *get_Block_irg(const ir_node *block) {
850 assert(is_Block(block));
851 return block->attr.block.irg;
854 int has_Block_label(const ir_node *block) {
855 assert(is_Block(block));
856 return block->attr.block.has_label;
859 ir_label_t get_Block_label(const ir_node *block) {
860 assert(is_Block(block));
861 return block->attr.block.label;
864 void set_Block_label(ir_node *block, ir_label_t label) {
865 assert(is_Block(block));
866 block->attr.block.has_label = 1;
867 block->attr.block.label = label;
870 ir_node *(get_Block_phis)(const ir_node *block) {
871 return _get_Block_phis(block);
874 void (set_Block_phis)(ir_node *block, ir_node *phi) {
875 _set_Block_phis(block, phi);
878 void (add_Block_phi)(ir_node *block, ir_node *phi) {
879 _add_Block_phi(block, phi);
882 /* Get the Block mark (single bit). */
883 unsigned (get_Block_mark)(const ir_node *block) {
884 return _get_Block_mark(block);
887 /* Set the Block mark (single bit). */
888 void (set_Block_mark)(ir_node *block, unsigned mark) {
889 _set_Block_mark(block, mark);
892 int get_End_n_keepalives(const ir_node *end) {
894 return (get_irn_arity(end) - END_KEEPALIVE_OFFSET);
897 ir_node *get_End_keepalive(const ir_node *end, int pos) {
899 return get_irn_n(end, pos + END_KEEPALIVE_OFFSET);
902 void add_End_keepalive(ir_node *end, ir_node *ka) {
904 assert((is_Phi(ka) || is_Proj(ka) || is_Block(ka) || is_irn_keep(ka)) && "Only Phi, Block or Keep nodes can be kept alive!");
908 void set_End_keepalive(ir_node *end, int pos, ir_node *ka) {
910 set_irn_n(end, pos + END_KEEPALIVE_OFFSET, ka);
913 /* Set new keep-alives */
914 void set_End_keepalives(ir_node *end, int n, ir_node *in[]) {
916 ir_graph *irg = get_irn_irg(end);
918 /* notify that edges are deleted */
919 for (i = END_KEEPALIVE_OFFSET; i < ARR_LEN(end->in) - 1; ++i) {
920 edges_notify_edge(end, i, NULL, end->in[i + 1], irg);
922 ARR_RESIZE(ir_node *, end->in, n + 1 + END_KEEPALIVE_OFFSET);
924 for (i = 0; i < n; ++i) {
925 end->in[1 + END_KEEPALIVE_OFFSET + i] = in[i];
926 edges_notify_edge(end, END_KEEPALIVE_OFFSET + i, end->in[1 + END_KEEPALIVE_OFFSET + i], NULL, irg);
930 /* Set new keep-alives from old keep-alives, skipping irn */
931 void remove_End_keepalive(ir_node *end, ir_node *irn) {
932 int n = get_End_n_keepalives(end);
937 for (i = n -1; i >= 0; --i) {
938 ir_node *old_ka = end->in[1 + END_KEEPALIVE_OFFSET + i];
948 irg = get_irn_irg(end);
950 /* remove the edge */
951 edges_notify_edge(end, idx, NULL, irn, irg);
954 /* exchange with the last one */
955 ir_node *old = end->in[1 + END_KEEPALIVE_OFFSET + n - 1];
956 edges_notify_edge(end, n - 1, NULL, old, irg);
957 end->in[1 + END_KEEPALIVE_OFFSET + idx] = old;
958 edges_notify_edge(end, idx, old, NULL, irg);
960 ARR_RESIZE(ir_node *, end->in, (n - 1) + 1 + END_KEEPALIVE_OFFSET);
964 free_End(ir_node *end) {
968 end->in = NULL; /* @@@ make sure we get an error if we use the
969 in array afterwards ... */
972 /* Return the target address of an IJmp */
973 ir_node *get_IJmp_target(const ir_node *ijmp) {
974 assert(is_IJmp(ijmp));
975 return get_irn_n(ijmp, 0);
978 /** Sets the target address of an IJmp */
979 void set_IJmp_target(ir_node *ijmp, ir_node *tgt) {
980 assert(is_IJmp(ijmp));
981 set_irn_n(ijmp, 0, tgt);
985 > Implementing the case construct (which is where the constant Proj node is
986 > important) involves far more than simply determining the constant values.
987 > We could argue that this is more properly a function of the translator from
988 > Firm to the target machine. That could be done if there was some way of
989 > projecting "default" out of the Cond node.
990 I know it's complicated.
991 Basically there are two problems:
992 - determining the gaps between the Projs
993 - determining the biggest case constant to know the proj number for
995 I see several solutions:
996 1. Introduce a ProjDefault node. Solves both problems.
997 This means to extend all optimizations executed during construction.
998 2. Give the Cond node for switch two flavors:
999 a) there are no gaps in the Projs (existing flavor)
1000 b) gaps may exist, default proj is still the Proj with the largest
1001 projection number. This covers also the gaps.
1002 3. Fix the semantic of the Cond to that of 2b)
1004 Solution 2 seems to be the best:
1005 Computing the gaps in the Firm representation is not too hard, i.e.,
1006 libFIRM can implement a routine that transforms between the two
1007 flavours. This is also possible for 1) but 2) does not require to
1008 change any existing optimization.
1009 Further it should be far simpler to determine the biggest constant than
1010 to compute all gaps.
1011 I don't want to choose 3) as 2a) seems to have advantages for
1012 dataflow analysis and 3) does not allow to convert the representation to
1016 get_Cond_selector(const ir_node *node) {
1017 assert(is_Cond(node));
1018 return get_irn_n(node, 0);
1022 set_Cond_selector(ir_node *node, ir_node *selector) {
1023 assert(is_Cond(node));
1024 set_irn_n(node, 0, selector);
1028 get_Cond_kind(const ir_node *node) {
1029 assert(is_Cond(node));
1030 return node->attr.cond.kind;
1034 set_Cond_kind(ir_node *node, cond_kind kind) {
1035 assert(is_Cond(node));
1036 node->attr.cond.kind = kind;
1040 get_Cond_defaultProj(const ir_node *node) {
1041 assert(is_Cond(node));
1042 return node->attr.cond.default_proj;
1046 get_Return_mem(const ir_node *node) {
1047 assert(is_Return(node));
1048 return get_irn_n(node, 0);
1052 set_Return_mem(ir_node *node, ir_node *mem) {
1053 assert(is_Return(node));
1054 set_irn_n(node, 0, mem);
1058 get_Return_n_ress(const ir_node *node) {
1059 assert(is_Return(node));
1060 return (get_irn_arity(node) - RETURN_RESULT_OFFSET);
1064 get_Return_res_arr(ir_node *node) {
1065 assert(is_Return(node));
1066 if (get_Return_n_ress(node) > 0)
1067 return (ir_node **)&(get_irn_in(node)[1 + RETURN_RESULT_OFFSET]);
1074 set_Return_n_res(ir_node *node, int results) {
1075 assert(is_Return(node));
1080 get_Return_res(const ir_node *node, int pos) {
1081 assert(is_Return(node));
1082 assert(get_Return_n_ress(node) > pos);
1083 return get_irn_n(node, pos + RETURN_RESULT_OFFSET);
1087 set_Return_res(ir_node *node, int pos, ir_node *res){
1088 assert(is_Return(node));
1089 set_irn_n(node, pos + RETURN_RESULT_OFFSET, res);
1092 tarval *(get_Const_tarval)(const ir_node *node) {
1093 return _get_Const_tarval(node);
1097 set_Const_tarval(ir_node *node, tarval *con) {
1098 assert(is_Const(node));
1099 node->attr.con.tv = con;
1102 int (is_Const_null)(const ir_node *node) {
1103 return _is_Const_null(node);
1106 int (is_Const_one)(const ir_node *node) {
1107 return _is_Const_one(node);
1110 int (is_Const_all_one)(const ir_node *node) {
1111 return _is_Const_all_one(node);
1115 /* The source language type. Must be an atomic type. Mode of type must
1116 be mode of node. For tarvals from entities type must be pointer to
1119 get_Const_type(ir_node *node) {
1120 assert(is_Const(node));
1121 node->attr.con.tp = skip_tid(node->attr.con.tp);
1122 return node->attr.con.tp;
1126 set_Const_type(ir_node *node, ir_type *tp) {
1127 assert(is_Const(node));
1128 if (tp != firm_unknown_type) {
1129 assert(is_atomic_type(tp));
1130 assert(get_type_mode(tp) == get_irn_mode(node));
1132 node->attr.con.tp = tp;
1137 get_SymConst_kind(const ir_node *node) {
1138 assert(is_SymConst(node));
1139 return node->attr.symc.kind;
1143 set_SymConst_kind(ir_node *node, symconst_kind kind) {
1144 assert(is_SymConst(node));
1145 node->attr.symc.kind = kind;
1149 get_SymConst_type(const ir_node *node) {
1150 /* the cast here is annoying, but we have to compensate for
1152 ir_node *irn = (ir_node *)node;
1153 assert(is_SymConst(node) &&
1154 (SYMCONST_HAS_TYPE(get_SymConst_kind(node))));
1155 return irn->attr.symc.sym.type_p = skip_tid(irn->attr.symc.sym.type_p);
1159 set_SymConst_type(ir_node *node, ir_type *tp) {
1160 assert(is_SymConst(node) &&
1161 (SYMCONST_HAS_TYPE(get_SymConst_kind(node))));
1162 node->attr.symc.sym.type_p = tp;
1166 get_SymConst_name(const ir_node *node) {
1167 assert(is_SymConst(node) && SYMCONST_HAS_ID(get_SymConst_kind(node)));
1168 return node->attr.symc.sym.ident_p;
1172 set_SymConst_name(ir_node *node, ident *name) {
1173 assert(is_SymConst(node) && SYMCONST_HAS_ID(get_SymConst_kind(node)));
1174 node->attr.symc.sym.ident_p = name;
1178 /* Only to access SymConst of kind symconst_addr_ent. Else assertion: */
1179 ir_entity *get_SymConst_entity(const ir_node *node) {
1180 assert(is_SymConst(node) && SYMCONST_HAS_ENT(get_SymConst_kind(node)));
1181 return node->attr.symc.sym.entity_p;
1184 void set_SymConst_entity(ir_node *node, ir_entity *ent) {
1185 assert(is_SymConst(node) && SYMCONST_HAS_ENT(get_SymConst_kind(node)));
1186 node->attr.symc.sym.entity_p = ent;
1189 ir_enum_const *get_SymConst_enum(const ir_node *node) {
1190 assert(is_SymConst(node) && SYMCONST_HAS_ENUM(get_SymConst_kind(node)));
1191 return node->attr.symc.sym.enum_p;
1194 void set_SymConst_enum(ir_node *node, ir_enum_const *ec) {
1195 assert(is_SymConst(node) && SYMCONST_HAS_ENUM(get_SymConst_kind(node)));
1196 node->attr.symc.sym.enum_p = ec;
1199 union symconst_symbol
1200 get_SymConst_symbol(const ir_node *node) {
1201 assert(is_SymConst(node));
1202 return node->attr.symc.sym;
1206 set_SymConst_symbol(ir_node *node, union symconst_symbol sym) {
1207 assert(is_SymConst(node));
1208 node->attr.symc.sym = sym;
1211 ir_label_t get_SymConst_label(const ir_node *node) {
1212 assert(is_SymConst(node) && SYMCONST_HAS_LABEL(get_SymConst_kind(node)));
1213 return node->attr.symc.sym.label;
1216 void set_SymConst_label(ir_node *node, ir_label_t label) {
1217 assert(is_SymConst(node) && SYMCONST_HAS_LABEL(get_SymConst_kind(node)));
1218 node->attr.symc.sym.label = label;
1222 get_SymConst_value_type(ir_node *node) {
1223 assert(is_SymConst(node));
1224 if (node->attr.symc.tp) node->attr.symc.tp = skip_tid(node->attr.symc.tp);
1225 return node->attr.symc.tp;
1229 set_SymConst_value_type(ir_node *node, ir_type *tp) {
1230 assert(is_SymConst(node));
1231 node->attr.symc.tp = tp;
1235 get_Sel_mem(const ir_node *node) {
1236 assert(is_Sel(node));
1237 return get_irn_n(node, 0);
1241 set_Sel_mem(ir_node *node, ir_node *mem) {
1242 assert(is_Sel(node));
1243 set_irn_n(node, 0, mem);
1247 get_Sel_ptr(const ir_node *node) {
1248 assert(is_Sel(node));
1249 return get_irn_n(node, 1);
1253 set_Sel_ptr(ir_node *node, ir_node *ptr) {
1254 assert(is_Sel(node));
1255 set_irn_n(node, 1, ptr);
1259 get_Sel_n_indexs(const ir_node *node) {
1260 assert(is_Sel(node));
1261 return (get_irn_arity(node) - SEL_INDEX_OFFSET);
1265 get_Sel_index_arr(ir_node *node) {
1266 assert(is_Sel(node));
1267 if (get_Sel_n_indexs(node) > 0)
1268 return (ir_node **)& get_irn_in(node)[SEL_INDEX_OFFSET + 1];
1274 get_Sel_index(const ir_node *node, int pos) {
1275 assert(is_Sel(node));
1276 return get_irn_n(node, pos + SEL_INDEX_OFFSET);
1280 set_Sel_index(ir_node *node, int pos, ir_node *index) {
1281 assert(is_Sel(node));
1282 set_irn_n(node, pos + SEL_INDEX_OFFSET, index);
1286 get_Sel_entity(const ir_node *node) {
1287 assert(is_Sel(node));
1288 return node->attr.sel.ent;
1291 /* need a version without const to prevent warning */
1292 static ir_entity *_get_Sel_entity(ir_node *node) {
1293 return get_Sel_entity(node);
1297 set_Sel_entity(ir_node *node, ir_entity *ent) {
1298 assert(is_Sel(node));
1299 node->attr.sel.ent = ent;
1303 /* For unary and binary arithmetic operations the access to the
1304 operands can be factored out. Left is the first, right the
1305 second arithmetic value as listed in tech report 0999-33.
1306 unops are: Minus, Abs, Not, Conv, Cast
1307 binops are: Add, Sub, Mul, Quot, DivMod, Div, Mod, And, Or, Eor, Shl,
1308 Shr, Shrs, Rotate, Cmp */
1312 get_Call_mem(const ir_node *node) {
1313 assert(is_Call(node));
1314 return get_irn_n(node, 0);
1318 set_Call_mem(ir_node *node, ir_node *mem) {
1319 assert(is_Call(node));
1320 set_irn_n(node, 0, mem);
1324 get_Call_ptr(const ir_node *node) {
1325 assert(is_Call(node));
1326 return get_irn_n(node, 1);
1330 set_Call_ptr(ir_node *node, ir_node *ptr) {
1331 assert(is_Call(node));
1332 set_irn_n(node, 1, ptr);
1336 get_Call_param_arr(ir_node *node) {
1337 assert(is_Call(node));
1338 return &get_irn_in(node)[CALL_PARAM_OFFSET + 1];
1342 get_Call_n_params(const ir_node *node) {
1343 assert(is_Call(node));
1344 return (get_irn_arity(node) - CALL_PARAM_OFFSET);
1348 get_Call_arity(const ir_node *node) {
1349 assert(is_Call(node));
1350 return get_Call_n_params(node);
1354 set_Call_arity(ir_node *node, ir_node *arity) {
1355 assert(is_Call(node));
1360 get_Call_param(const ir_node *node, int pos) {
1361 assert(is_Call(node));
1362 return get_irn_n(node, pos + CALL_PARAM_OFFSET);
1366 set_Call_param(ir_node *node, int pos, ir_node *param) {
1367 assert(is_Call(node));
1368 set_irn_n(node, pos + CALL_PARAM_OFFSET, param);
1372 get_Call_type(ir_node *node) {
1373 assert(is_Call(node));
1374 return node->attr.call.cld_tp = skip_tid(node->attr.call.cld_tp);
1378 set_Call_type(ir_node *node, ir_type *tp) {
1379 assert(is_Call(node));
1380 assert((get_unknown_type() == tp) || is_Method_type(tp));
1381 node->attr.call.cld_tp = tp;
1384 int Call_has_callees(const ir_node *node) {
1385 assert(is_Call(node));
1386 return ((get_irg_callee_info_state(get_irn_irg(node)) != irg_callee_info_none) &&
1387 (node->attr.call.callee_arr != NULL));
1390 int get_Call_n_callees(const ir_node *node) {
1391 assert(is_Call(node) && node->attr.call.callee_arr);
1392 return ARR_LEN(node->attr.call.callee_arr);
1395 ir_entity *get_Call_callee(const ir_node *node, int pos) {
1396 assert(pos >= 0 && pos < get_Call_n_callees(node));
1397 return node->attr.call.callee_arr[pos];
1400 void set_Call_callee_arr(ir_node *node, const int n, ir_entity ** arr) {
1401 assert(is_Call(node));
1402 if (node->attr.call.callee_arr == NULL || get_Call_n_callees(node) != n) {
1403 node->attr.call.callee_arr = NEW_ARR_D(ir_entity *, current_ir_graph->obst, n);
1405 memcpy(node->attr.call.callee_arr, arr, n * sizeof(ir_entity *));
1408 void remove_Call_callee_arr(ir_node *node) {
1409 assert(is_Call(node));
1410 node->attr.call.callee_arr = NULL;
1413 ir_node *get_CallBegin_ptr(const ir_node *node) {
1414 assert(is_CallBegin(node));
1415 return get_irn_n(node, 0);
1418 void set_CallBegin_ptr(ir_node *node, ir_node *ptr) {
1419 assert(is_CallBegin(node));
1420 set_irn_n(node, 0, ptr);
1423 ir_node *get_CallBegin_call(const ir_node *node) {
1424 assert(is_CallBegin(node));
1425 return node->attr.callbegin.call;
1428 void set_CallBegin_call(ir_node *node, ir_node *call) {
1429 assert(is_CallBegin(node));
1430 node->attr.callbegin.call = call;
1434 * Returns non-zero if a Call is surely a self-recursive Call.
1435 * Beware: if this functions returns 0, the call might be self-recursive!
1437 int is_self_recursive_Call(const ir_node *call) {
1438 const ir_node *callee = get_Call_ptr(call);
1440 if (is_SymConst_addr_ent(callee)) {
1441 const ir_entity *ent = get_SymConst_entity(callee);
1442 const ir_graph *irg = get_entity_irg(ent);
1443 if (irg == get_irn_irg(call))
1450 ir_node * get_##OP##_left(const ir_node *node) { \
1451 assert(is_##OP(node)); \
1452 return get_irn_n(node, node->op->op_index); \
1454 void set_##OP##_left(ir_node *node, ir_node *left) { \
1455 assert(is_##OP(node)); \
1456 set_irn_n(node, node->op->op_index, left); \
1458 ir_node *get_##OP##_right(const ir_node *node) { \
1459 assert(is_##OP(node)); \
1460 return get_irn_n(node, node->op->op_index + 1); \
1462 void set_##OP##_right(ir_node *node, ir_node *right) { \
1463 assert(is_##OP(node)); \
1464 set_irn_n(node, node->op->op_index + 1, right); \
1468 ir_node *get_##OP##_op(const ir_node *node) { \
1469 assert(is_##OP(node)); \
1470 return get_irn_n(node, node->op->op_index); \
1472 void set_##OP##_op(ir_node *node, ir_node *op) { \
1473 assert(is_##OP(node)); \
1474 set_irn_n(node, node->op->op_index, op); \
1477 #define BINOP_MEM(OP) \
1481 get_##OP##_mem(const ir_node *node) { \
1482 assert(is_##OP(node)); \
1483 return get_irn_n(node, 0); \
1487 set_##OP##_mem(ir_node *node, ir_node *mem) { \
1488 assert(is_##OP(node)); \
1489 set_irn_n(node, 0, mem); \
1495 ir_mode *get_##OP##_resmode(const ir_node *node) { \
1496 assert(is_##OP(node)); \
1497 return node->attr.divmod.res_mode; \
1500 void set_##OP##_resmode(ir_node *node, ir_mode *mode) { \
1501 assert(is_##OP(node)); \
1502 node->attr.divmod.res_mode = mode; \
1529 int is_Div_remainderless(const ir_node *node) {
1530 assert(is_Div(node));
1531 return node->attr.divmod.no_remainder;
1534 int get_Conv_strict(const ir_node *node) {
1535 assert(is_Conv(node));
1536 return node->attr.conv.strict;
1539 void set_Conv_strict(ir_node *node, int strict_flag) {
1540 assert(is_Conv(node));
1541 node->attr.conv.strict = (char)strict_flag;
1545 get_Cast_type(ir_node *node) {
1546 assert(is_Cast(node));
1547 node->attr.cast.totype = skip_tid(node->attr.cast.totype);
1548 return node->attr.cast.totype;
1552 set_Cast_type(ir_node *node, ir_type *to_tp) {
1553 assert(is_Cast(node));
1554 node->attr.cast.totype = to_tp;
1558 /* Checks for upcast.
1560 * Returns true if the Cast node casts a class type to a super type.
1562 int is_Cast_upcast(ir_node *node) {
1563 ir_type *totype = get_Cast_type(node);
1564 ir_type *fromtype = get_irn_typeinfo_type(get_Cast_op(node));
1566 assert(get_irg_typeinfo_state(get_irn_irg(node)) == ir_typeinfo_consistent);
1569 while (is_Pointer_type(totype) && is_Pointer_type(fromtype)) {
1570 totype = get_pointer_points_to_type(totype);
1571 fromtype = get_pointer_points_to_type(fromtype);
1576 if (!is_Class_type(totype)) return 0;
1577 return is_SubClass_of(fromtype, totype);
1580 /* Checks for downcast.
1582 * Returns true if the Cast node casts a class type to a sub type.
1584 int is_Cast_downcast(ir_node *node) {
1585 ir_type *totype = get_Cast_type(node);
1586 ir_type *fromtype = get_irn_typeinfo_type(get_Cast_op(node));
1588 assert(get_irg_typeinfo_state(get_irn_irg(node)) == ir_typeinfo_consistent);
1591 while (is_Pointer_type(totype) && is_Pointer_type(fromtype)) {
1592 totype = get_pointer_points_to_type(totype);
1593 fromtype = get_pointer_points_to_type(fromtype);
1598 if (!is_Class_type(totype)) return 0;
1599 return is_SubClass_of(totype, fromtype);
1603 (is_unop)(const ir_node *node) {
1604 return _is_unop(node);
1608 get_unop_op(const ir_node *node) {
1609 if (node->op->opar == oparity_unary)
1610 return get_irn_n(node, node->op->op_index);
1612 assert(node->op->opar == oparity_unary);
1617 set_unop_op(ir_node *node, ir_node *op) {
1618 if (node->op->opar == oparity_unary)
1619 set_irn_n(node, node->op->op_index, op);
1621 assert(node->op->opar == oparity_unary);
1625 (is_binop)(const ir_node *node) {
1626 return _is_binop(node);
1630 get_binop_left(const ir_node *node) {
1631 assert(node->op->opar == oparity_binary);
1632 return get_irn_n(node, node->op->op_index);
1636 set_binop_left(ir_node *node, ir_node *left) {
1637 assert(node->op->opar == oparity_binary);
1638 set_irn_n(node, node->op->op_index, left);
1642 get_binop_right(const ir_node *node) {
1643 assert(node->op->opar == oparity_binary);
1644 return get_irn_n(node, node->op->op_index + 1);
1648 set_binop_right(ir_node *node, ir_node *right) {
1649 assert(node->op->opar == oparity_binary);
1650 set_irn_n(node, node->op->op_index + 1, right);
1654 (is_Phi)(const ir_node *n) {
1658 int is_Phi0(const ir_node *n) {
1661 return ((get_irn_op(n) == op_Phi) &&
1662 (get_irn_arity(n) == 0) &&
1663 (get_irg_phase_state(get_irn_irg(n)) == phase_building));
1667 get_Phi_preds_arr(ir_node *node) {
1668 assert(node->op == op_Phi);
1669 return (ir_node **)&(get_irn_in(node)[1]);
1673 get_Phi_n_preds(const ir_node *node) {
1674 assert(is_Phi(node) || is_Phi0(node));
1675 return (get_irn_arity(node));
1679 void set_Phi_n_preds(ir_node *node, int n_preds) {
1680 assert(node->op == op_Phi);
1685 get_Phi_pred(const ir_node *node, int pos) {
1686 assert(is_Phi(node) || is_Phi0(node));
1687 return get_irn_n(node, pos);
1691 set_Phi_pred(ir_node *node, int pos, ir_node *pred) {
1692 assert(is_Phi(node) || is_Phi0(node));
1693 set_irn_n(node, pos, pred);
1696 ir_node *(get_Phi_next)(const ir_node *phi) {
1697 return _get_Phi_next(phi);
1700 void (set_Phi_next)(ir_node *phi, ir_node *next) {
1701 _set_Phi_next(phi, next);
1704 int is_memop(const ir_node *node) {
1705 ir_opcode code = get_irn_opcode(node);
1706 return (code == iro_Load || code == iro_Store);
1709 ir_node *get_memop_mem(const ir_node *node) {
1710 assert(is_memop(node));
1711 return get_irn_n(node, 0);
1714 void set_memop_mem(ir_node *node, ir_node *mem) {
1715 assert(is_memop(node));
1716 set_irn_n(node, 0, mem);
1719 ir_node *get_memop_ptr(const ir_node *node) {
1720 assert(is_memop(node));
1721 return get_irn_n(node, 1);
1724 void set_memop_ptr(ir_node *node, ir_node *ptr) {
1725 assert(is_memop(node));
1726 set_irn_n(node, 1, ptr);
1730 get_Load_mem(const ir_node *node) {
1731 assert(is_Load(node));
1732 return get_irn_n(node, 0);
1736 set_Load_mem(ir_node *node, ir_node *mem) {
1737 assert(is_Load(node));
1738 set_irn_n(node, 0, mem);
1742 get_Load_ptr(const ir_node *node) {
1743 assert(is_Load(node));
1744 return get_irn_n(node, 1);
1748 set_Load_ptr(ir_node *node, ir_node *ptr) {
1749 assert(is_Load(node));
1750 set_irn_n(node, 1, ptr);
1754 get_Load_mode(const ir_node *node) {
1755 assert(is_Load(node));
1756 return node->attr.load.load_mode;
1760 set_Load_mode(ir_node *node, ir_mode *mode) {
1761 assert(is_Load(node));
1762 node->attr.load.load_mode = mode;
1766 get_Load_volatility(const ir_node *node) {
1767 assert(is_Load(node));
1768 return node->attr.load.volatility;
1772 set_Load_volatility(ir_node *node, ir_volatility volatility) {
1773 assert(is_Load(node));
1774 node->attr.load.volatility = volatility;
1778 get_Load_align(const ir_node *node) {
1779 assert(is_Load(node));
1780 return node->attr.load.aligned;
1784 set_Load_align(ir_node *node, ir_align align) {
1785 assert(is_Load(node));
1786 node->attr.load.aligned = align;
1791 get_Store_mem(const ir_node *node) {
1792 assert(is_Store(node));
1793 return get_irn_n(node, 0);
1797 set_Store_mem(ir_node *node, ir_node *mem) {
1798 assert(is_Store(node));
1799 set_irn_n(node, 0, mem);
1803 get_Store_ptr(const ir_node *node) {
1804 assert(is_Store(node));
1805 return get_irn_n(node, 1);
1809 set_Store_ptr(ir_node *node, ir_node *ptr) {
1810 assert(is_Store(node));
1811 set_irn_n(node, 1, ptr);
1815 get_Store_value(const ir_node *node) {
1816 assert(is_Store(node));
1817 return get_irn_n(node, 2);
1821 set_Store_value(ir_node *node, ir_node *value) {
1822 assert(is_Store(node));
1823 set_irn_n(node, 2, value);
1827 get_Store_volatility(const ir_node *node) {
1828 assert(is_Store(node));
1829 return node->attr.store.volatility;
1833 set_Store_volatility(ir_node *node, ir_volatility volatility) {
1834 assert(is_Store(node));
1835 node->attr.store.volatility = volatility;
1839 get_Store_align(const ir_node *node) {
1840 assert(is_Store(node));
1841 return node->attr.store.aligned;
1845 set_Store_align(ir_node *node, ir_align align) {
1846 assert(is_Store(node));
1847 node->attr.store.aligned = align;
1852 get_Alloc_mem(const ir_node *node) {
1853 assert(is_Alloc(node));
1854 return get_irn_n(node, 0);
1858 set_Alloc_mem(ir_node *node, ir_node *mem) {
1859 assert(is_Alloc(node));
1860 set_irn_n(node, 0, mem);
1864 get_Alloc_size(const ir_node *node) {
1865 assert(is_Alloc(node));
1866 return get_irn_n(node, 1);
1870 set_Alloc_size(ir_node *node, ir_node *size) {
1871 assert(is_Alloc(node));
1872 set_irn_n(node, 1, size);
1876 get_Alloc_type(ir_node *node) {
1877 assert(is_Alloc(node));
1878 return node->attr.alloc.type = skip_tid(node->attr.alloc.type);
1882 set_Alloc_type(ir_node *node, ir_type *tp) {
1883 assert(is_Alloc(node));
1884 node->attr.alloc.type = tp;
1888 get_Alloc_where(const ir_node *node) {
1889 assert(is_Alloc(node));
1890 return node->attr.alloc.where;
1894 set_Alloc_where(ir_node *node, ir_where_alloc where) {
1895 assert(is_Alloc(node));
1896 node->attr.alloc.where = where;
1901 get_Free_mem(const ir_node *node) {
1902 assert(is_Free(node));
1903 return get_irn_n(node, 0);
1907 set_Free_mem(ir_node *node, ir_node *mem) {
1908 assert(is_Free(node));
1909 set_irn_n(node, 0, mem);
1913 get_Free_ptr(const ir_node *node) {
1914 assert(is_Free(node));
1915 return get_irn_n(node, 1);
1919 set_Free_ptr(ir_node *node, ir_node *ptr) {
1920 assert(is_Free(node));
1921 set_irn_n(node, 1, ptr);
1925 get_Free_size(const ir_node *node) {
1926 assert(is_Free(node));
1927 return get_irn_n(node, 2);
1931 set_Free_size(ir_node *node, ir_node *size) {
1932 assert(is_Free(node));
1933 set_irn_n(node, 2, size);
1937 get_Free_type(ir_node *node) {
1938 assert(is_Free(node));
1939 return node->attr.free.type = skip_tid(node->attr.free.type);
1943 set_Free_type(ir_node *node, ir_type *tp) {
1944 assert(is_Free(node));
1945 node->attr.free.type = tp;
1949 get_Free_where(const ir_node *node) {
1950 assert(is_Free(node));
1951 return node->attr.free.where;
1955 set_Free_where(ir_node *node, ir_where_alloc where) {
1956 assert(is_Free(node));
1957 node->attr.free.where = where;
1960 ir_node **get_Sync_preds_arr(ir_node *node) {
1961 assert(is_Sync(node));
1962 return (ir_node **)&(get_irn_in(node)[1]);
1965 int get_Sync_n_preds(const ir_node *node) {
1966 assert(is_Sync(node));
1967 return (get_irn_arity(node));
1971 void set_Sync_n_preds(ir_node *node, int n_preds) {
1972 assert(is_Sync(node));
1976 ir_node *get_Sync_pred(const ir_node *node, int pos) {
1977 assert(is_Sync(node));
1978 return get_irn_n(node, pos);
1981 void set_Sync_pred(ir_node *node, int pos, ir_node *pred) {
1982 assert(is_Sync(node));
1983 set_irn_n(node, pos, pred);
1986 /* Add a new Sync predecessor */
1987 void add_Sync_pred(ir_node *node, ir_node *pred) {
1988 assert(is_Sync(node));
1989 add_irn_n(node, pred);
1992 /* Returns the source language type of a Proj node. */
1993 ir_type *get_Proj_type(ir_node *n) {
1994 ir_type *tp = firm_unknown_type;
1995 ir_node *pred = get_Proj_pred(n);
1997 switch (get_irn_opcode(pred)) {
2000 /* Deal with Start / Call here: we need to know the Proj Nr. */
2001 assert(get_irn_mode(pred) == mode_T);
2002 pred_pred = get_Proj_pred(pred);
2004 if (is_Start(pred_pred)) {
2005 ir_type *mtp = get_entity_type(get_irg_entity(get_irn_irg(pred_pred)));
2006 tp = get_method_param_type(mtp, get_Proj_proj(n));
2007 } else if (is_Call(pred_pred)) {
2008 ir_type *mtp = get_Call_type(pred_pred);
2009 tp = get_method_res_type(mtp, get_Proj_proj(n));
2012 case iro_Start: break;
2013 case iro_Call: break;
2015 ir_node *a = get_Load_ptr(pred);
2017 tp = get_entity_type(get_Sel_entity(a));
2026 get_Proj_pred(const ir_node *node) {
2027 assert(is_Proj(node));
2028 return get_irn_n(node, 0);
2032 set_Proj_pred(ir_node *node, ir_node *pred) {
2033 assert(is_Proj(node));
2034 set_irn_n(node, 0, pred);
2038 get_Proj_proj(const ir_node *node) {
2039 #ifdef INTERPROCEDURAL_VIEW
2040 ir_opcode code = get_irn_opcode(node);
2042 if (code == iro_Proj) {
2043 return node->attr.proj;
2046 assert(code == iro_Filter);
2047 return node->attr.filter.proj;
2050 assert(is_Proj(node));
2051 return node->attr.proj;
2052 #endif /* INTERPROCEDURAL_VIEW */
2056 set_Proj_proj(ir_node *node, long proj) {
2057 #ifdef INTERPROCEDURAL_VIEW
2058 ir_opcode code = get_irn_opcode(node);
2060 if (code == iro_Proj) {
2061 node->attr.proj = proj;
2064 assert(code == iro_Filter);
2065 node->attr.filter.proj = proj;
2068 assert(is_Proj(node));
2069 node->attr.proj = proj;
2070 #endif /* INTERPROCEDURAL_VIEW */
2073 /* Returns non-zero if a node is a routine parameter. */
2074 int (is_arg_Proj)(const ir_node *node) {
2075 return _is_arg_Proj(node);
2079 get_Tuple_preds_arr(ir_node *node) {
2080 assert(is_Tuple(node));
2081 return (ir_node **)&(get_irn_in(node)[1]);
2085 get_Tuple_n_preds(const ir_node *node) {
2086 assert(is_Tuple(node));
2087 return get_irn_arity(node);
2092 set_Tuple_n_preds(ir_node *node, int n_preds) {
2093 assert(is_Tuple(node));
2098 get_Tuple_pred(const ir_node *node, int pos) {
2099 assert(is_Tuple(node));
2100 return get_irn_n(node, pos);
2104 set_Tuple_pred(ir_node *node, int pos, ir_node *pred) {
2105 assert(is_Tuple(node));
2106 set_irn_n(node, pos, pred);
2110 get_Id_pred(const ir_node *node) {
2111 assert(is_Id(node));
2112 return get_irn_n(node, 0);
2116 set_Id_pred(ir_node *node, ir_node *pred) {
2117 assert(is_Id(node));
2118 set_irn_n(node, 0, pred);
2121 ir_node *get_Confirm_value(const ir_node *node) {
2122 assert(is_Confirm(node));
2123 return get_irn_n(node, 0);
2126 void set_Confirm_value(ir_node *node, ir_node *value) {
2127 assert(is_Confirm(node));
2128 set_irn_n(node, 0, value);
2131 ir_node *get_Confirm_bound(const ir_node *node) {
2132 assert(is_Confirm(node));
2133 return get_irn_n(node, 1);
2136 void set_Confirm_bound(ir_node *node, ir_node *bound) {
2137 assert(is_Confirm(node));
2138 set_irn_n(node, 0, bound);
2141 pn_Cmp get_Confirm_cmp(const ir_node *node) {
2142 assert(is_Confirm(node));
2143 return node->attr.confirm.cmp;
2146 void set_Confirm_cmp(ir_node *node, pn_Cmp cmp) {
2147 assert(is_Confirm(node));
2148 node->attr.confirm.cmp = cmp;
2152 get_Filter_pred(ir_node *node) {
2153 assert(is_Filter(node));
2158 set_Filter_pred(ir_node *node, ir_node *pred) {
2159 assert(is_Filter(node));
2164 get_Filter_proj(ir_node *node) {
2165 assert(is_Filter(node));
2166 return node->attr.filter.proj;
2170 set_Filter_proj(ir_node *node, long proj) {
2171 assert(is_Filter(node));
2172 node->attr.filter.proj = proj;
2175 /* Don't use get_irn_arity, get_irn_n in implementation as access
2176 shall work independent of view!!! */
2177 void set_Filter_cg_pred_arr(ir_node *node, int arity, ir_node ** in) {
2178 assert(is_Filter(node));
2179 if (node->attr.filter.in_cg == NULL || arity != ARR_LEN(node->attr.filter.in_cg) - 1) {
2180 ir_graph *irg = get_irn_irg(node);
2181 node->attr.filter.in_cg = NEW_ARR_D(ir_node *, current_ir_graph->obst, arity + 1);
2182 node->attr.filter.backedge = new_backedge_arr(irg->obst, arity);
2183 node->attr.filter.in_cg[0] = node->in[0];
2185 memcpy(node->attr.filter.in_cg + 1, in, sizeof(ir_node *) * arity);
2188 void set_Filter_cg_pred(ir_node * node, int pos, ir_node * pred) {
2189 assert(is_Filter(node) && node->attr.filter.in_cg &&
2190 0 <= pos && pos < ARR_LEN(node->attr.filter.in_cg) - 1);
2191 node->attr.filter.in_cg[pos + 1] = pred;
2194 int get_Filter_n_cg_preds(ir_node *node) {
2195 assert(is_Filter(node) && node->attr.filter.in_cg);
2196 return (ARR_LEN(node->attr.filter.in_cg) - 1);
2199 ir_node *get_Filter_cg_pred(ir_node *node, int pos) {
2201 assert(is_Filter(node) && node->attr.filter.in_cg &&
2203 arity = ARR_LEN(node->attr.filter.in_cg);
2204 assert(pos < arity - 1);
2205 return node->attr.filter.in_cg[pos + 1];
2209 ir_node *get_Mux_sel(const ir_node *node) {
2210 assert(is_Mux(node));
2214 void set_Mux_sel(ir_node *node, ir_node *sel) {
2215 assert(is_Mux(node));
2219 ir_node *get_Mux_false(const ir_node *node) {
2220 assert(is_Mux(node));
2224 void set_Mux_false(ir_node *node, ir_node *ir_false) {
2225 assert(is_Mux(node));
2226 node->in[2] = ir_false;
2229 ir_node *get_Mux_true(const ir_node *node) {
2230 assert(is_Mux(node));
2234 void set_Mux_true(ir_node *node, ir_node *ir_true) {
2235 assert(is_Mux(node));
2236 node->in[3] = ir_true;
2240 ir_node *get_CopyB_mem(const ir_node *node) {
2241 assert(is_CopyB(node));
2242 return get_irn_n(node, 0);
2245 void set_CopyB_mem(ir_node *node, ir_node *mem) {
2246 assert(node->op == op_CopyB);
2247 set_irn_n(node, 0, mem);
2250 ir_node *get_CopyB_dst(const ir_node *node) {
2251 assert(is_CopyB(node));
2252 return get_irn_n(node, 1);
2255 void set_CopyB_dst(ir_node *node, ir_node *dst) {
2256 assert(is_CopyB(node));
2257 set_irn_n(node, 1, dst);
2260 ir_node *get_CopyB_src(const ir_node *node) {
2261 assert(is_CopyB(node));
2262 return get_irn_n(node, 2);
2265 void set_CopyB_src(ir_node *node, ir_node *src) {
2266 assert(is_CopyB(node));
2267 set_irn_n(node, 2, src);
2270 ir_type *get_CopyB_type(ir_node *node) {
2271 assert(is_CopyB(node));
2272 return node->attr.copyb.data_type = skip_tid(node->attr.copyb.data_type);
2275 void set_CopyB_type(ir_node *node, ir_type *data_type) {
2276 assert(is_CopyB(node) && data_type);
2277 node->attr.copyb.data_type = data_type;
2282 get_InstOf_type(ir_node *node) {
2283 assert(node->op == op_InstOf);
2284 return node->attr.instof.type = skip_tid(node->attr.instof.type);
2288 set_InstOf_type(ir_node *node, ir_type *type) {
2289 assert(node->op == op_InstOf);
2290 node->attr.instof.type = type;
2294 get_InstOf_store(const ir_node *node) {
2295 assert(node->op == op_InstOf);
2296 return get_irn_n(node, 0);
2300 set_InstOf_store(ir_node *node, ir_node *obj) {
2301 assert(node->op == op_InstOf);
2302 set_irn_n(node, 0, obj);
2306 get_InstOf_obj(const ir_node *node) {
2307 assert(node->op == op_InstOf);
2308 return get_irn_n(node, 1);
2312 set_InstOf_obj(ir_node *node, ir_node *obj) {
2313 assert(node->op == op_InstOf);
2314 set_irn_n(node, 1, obj);
2317 /* Returns the memory input of a Raise operation. */
2319 get_Raise_mem(const ir_node *node) {
2320 assert(is_Raise(node));
2321 return get_irn_n(node, 0);
2325 set_Raise_mem(ir_node *node, ir_node *mem) {
2326 assert(is_Raise(node));
2327 set_irn_n(node, 0, mem);
2331 get_Raise_exo_ptr(const ir_node *node) {
2332 assert(is_Raise(node));
2333 return get_irn_n(node, 1);
2337 set_Raise_exo_ptr(ir_node *node, ir_node *exo_ptr) {
2338 assert(is_Raise(node));
2339 set_irn_n(node, 1, exo_ptr);
2344 /* Returns the memory input of a Bound operation. */
2345 ir_node *get_Bound_mem(const ir_node *bound) {
2346 assert(is_Bound(bound));
2347 return get_irn_n(bound, 0);
2350 void set_Bound_mem(ir_node *bound, ir_node *mem) {
2351 assert(is_Bound(bound));
2352 set_irn_n(bound, 0, mem);
2355 /* Returns the index input of a Bound operation. */
2356 ir_node *get_Bound_index(const ir_node *bound) {
2357 assert(is_Bound(bound));
2358 return get_irn_n(bound, 1);
2361 void set_Bound_index(ir_node *bound, ir_node *idx) {
2362 assert(is_Bound(bound));
2363 set_irn_n(bound, 1, idx);
2366 /* Returns the lower bound input of a Bound operation. */
2367 ir_node *get_Bound_lower(const ir_node *bound) {
2368 assert(is_Bound(bound));
2369 return get_irn_n(bound, 2);
2372 void set_Bound_lower(ir_node *bound, ir_node *lower) {
2373 assert(is_Bound(bound));
2374 set_irn_n(bound, 2, lower);
2377 /* Returns the upper bound input of a Bound operation. */
2378 ir_node *get_Bound_upper(const ir_node *bound) {
2379 assert(is_Bound(bound));
2380 return get_irn_n(bound, 3);
2383 void set_Bound_upper(ir_node *bound, ir_node *upper) {
2384 assert(is_Bound(bound));
2385 set_irn_n(bound, 3, upper);
2388 /* Return the operand of a Pin node. */
2389 ir_node *get_Pin_op(const ir_node *pin) {
2390 assert(is_Pin(pin));
2391 return get_irn_n(pin, 0);
2394 void set_Pin_op(ir_node *pin, ir_node *node) {
2395 assert(is_Pin(pin));
2396 set_irn_n(pin, 0, node);
2399 /* Return the assembler text of an ASM pseudo node. */
2400 ident *get_ASM_text(const ir_node *node) {
2401 assert(is_ASM(node));
2402 return node->attr.assem.asm_text;
2405 /* Return the number of input constraints for an ASM node. */
2406 int get_ASM_n_input_constraints(const ir_node *node) {
2407 assert(is_ASM(node));
2408 return ARR_LEN(node->attr.assem.inputs);
2411 /* Return the input constraints for an ASM node. This is a flexible array. */
2412 const ir_asm_constraint *get_ASM_input_constraints(const ir_node *node) {
2413 assert(is_ASM(node));
2414 return node->attr.assem.inputs;
2417 /* Return the number of output constraints for an ASM node. */
2418 int get_ASM_n_output_constraints(const ir_node *node) {
2419 assert(is_ASM(node));
2420 return ARR_LEN(node->attr.assem.outputs);
2423 /* Return the output constraints for an ASM node. */
2424 const ir_asm_constraint *get_ASM_output_constraints(const ir_node *node) {
2425 assert(is_ASM(node));
2426 return node->attr.assem.outputs;
2429 /* Return the number of clobbered registers for an ASM node. */
2430 int get_ASM_n_clobbers(const ir_node *node) {
2431 assert(is_ASM(node));
2432 return ARR_LEN(node->attr.assem.clobber);
2435 /* Return the list of clobbered registers for an ASM node. */
2436 ident **get_ASM_clobbers(const ir_node *node) {
2437 assert(is_ASM(node));
2438 return node->attr.assem.clobber;
2441 /* returns the graph of a node */
2443 get_irn_irg(const ir_node *node) {
2445 * Do not use get_nodes_Block() here, because this
2446 * will check the pinned state.
2447 * However even a 'wrong' block is always in the proper
2450 if (! is_Block(node))
2451 node = get_irn_n(node, -1);
2452 if (is_Bad(node)) /* sometimes bad is predecessor of nodes instead of block: in case of optimization */
2453 node = get_irn_n(node, -1);
2454 assert(get_irn_op(node) == op_Block);
2455 return node->attr.block.irg;
2459 /*----------------------------------------------------------------*/
2460 /* Auxiliary routines */
2461 /*----------------------------------------------------------------*/
2464 skip_Proj(ir_node *node) {
2465 /* don't assert node !!! */
2470 node = get_Proj_pred(node);
2476 skip_Proj_const(const ir_node *node) {
2477 /* don't assert node !!! */
2482 node = get_Proj_pred(node);
2488 skip_Tuple(ir_node *node) {
2492 if (!get_opt_normalize()) return node;
2495 if (get_irn_op(node) == op_Proj) {
2496 pred = get_Proj_pred(node);
2497 op = get_irn_op(pred);
2500 * Looks strange but calls get_irn_op() only once
2501 * in most often cases.
2503 if (op == op_Proj) { /* nested Tuple ? */
2504 pred = skip_Tuple(pred);
2505 op = get_irn_op(pred);
2507 if (op == op_Tuple) {
2508 node = get_Tuple_pred(pred, get_Proj_proj(node));
2511 } else if (op == op_Tuple) {
2512 node = get_Tuple_pred(pred, get_Proj_proj(node));
2519 /* returns operand of node if node is a Cast */
2520 ir_node *skip_Cast(ir_node *node) {
2522 return get_Cast_op(node);
2526 /* returns operand of node if node is a Cast */
2527 const ir_node *skip_Cast_const(const ir_node *node) {
2529 return get_Cast_op(node);
2533 /* returns operand of node if node is a Confirm */
2534 ir_node *skip_Confirm(ir_node *node) {
2535 if (get_irn_op(node) == op_Confirm)
2536 return get_Confirm_value(node);
2540 /* skip all high-level ops */
2541 ir_node *skip_HighLevel_ops(ir_node *node) {
2542 while (is_op_highlevel(get_irn_op(node))) {
2543 node = get_irn_n(node, 0);
2549 /* This should compact Id-cycles to self-cycles. It has the same (or less?) complexity
2550 * than any other approach, as Id chains are resolved and all point to the real node, or
2551 * all id's are self loops.
2553 * Note: This function takes 10% of mostly ANY the compiler run, so it's
2554 * a little bit "hand optimized".
2556 * Moreover, it CANNOT be switched off using get_opt_normalize() ...
2559 skip_Id(ir_node *node) {
2561 /* don't assert node !!! */
2563 if (!node || (node->op != op_Id)) return node;
2565 /* Don't use get_Id_pred(): We get into an endless loop for
2566 self-referencing Ids. */
2567 pred = node->in[0+1];
2569 if (pred->op != op_Id) return pred;
2571 if (node != pred) { /* not a self referencing Id. Resolve Id chain. */
2572 ir_node *rem_pred, *res;
2574 if (pred->op != op_Id) return pred; /* shortcut */
2577 assert(get_irn_arity (node) > 0);
2579 node->in[0+1] = node; /* turn us into a self referencing Id: shorten Id cycles. */
2580 res = skip_Id(rem_pred);
2581 if (res->op == op_Id) /* self-loop */ return node;
2583 node->in[0+1] = res; /* Turn Id chain into Ids all referencing the chain end. */
2590 void skip_Id_and_store(ir_node **node) {
2593 if (!n || (n->op != op_Id)) return;
2595 /* Don't use get_Id_pred(): We get into an endless loop for
2596 self-referencing Ids. */
2601 (is_Bad)(const ir_node *node) {
2602 return _is_Bad(node);
2606 (is_NoMem)(const ir_node *node) {
2607 return _is_NoMem(node);
2611 (is_Minus)(const ir_node *node) {
2612 return _is_Minus(node);
2616 (is_Abs)(const ir_node *node) {
2617 return _is_Abs(node);
2621 (is_Mod)(const ir_node *node) {
2622 return _is_Mod(node);
2626 (is_Div)(const ir_node *node) {
2627 return _is_Div(node);
2631 (is_DivMod)(const ir_node *node) {
2632 return _is_DivMod(node);
2636 (is_Quot)(const ir_node *node) {
2637 return _is_Quot(node);
2641 (is_Add)(const ir_node *node) {
2642 return _is_Add(node);
2646 (is_Carry)(const ir_node *node) {
2647 return _is_Carry(node);
2651 (is_And)(const ir_node *node) {
2652 return _is_And(node);
2656 (is_Or)(const ir_node *node) {
2657 return _is_Or(node);
2661 (is_Eor)(const ir_node *node) {
2662 return _is_Eor(node);
2666 (is_Sub)(const ir_node *node) {
2667 return _is_Sub(node);
2671 (is_Shl)(const ir_node *node) {
2672 return _is_Shl(node);
2676 (is_Shr)(const ir_node *node) {
2677 return _is_Shr(node);
2681 (is_Shrs)(const ir_node *node) {
2682 return _is_Shrs(node);
2686 (is_Rotl)(const ir_node *node) {
2687 return _is_Rotl(node);
2691 (is_Not)(const ir_node *node) {
2692 return _is_Not(node);
2696 (is_Id)(const ir_node *node) {
2697 return _is_Id(node);
2701 (is_Tuple)(const ir_node *node) {
2702 return _is_Tuple(node);
2706 (is_Bound)(const ir_node *node) {
2707 return _is_Bound(node);
2711 (is_Start)(const ir_node *node) {
2712 return _is_Start(node);
2716 (is_End)(const ir_node *node) {
2717 return _is_End(node);
2721 (is_Const)(const ir_node *node) {
2722 return _is_Const(node);
2726 (is_Conv)(const ir_node *node) {
2727 return _is_Conv(node);
2731 (is_strictConv)(const ir_node *node) {
2732 return _is_strictConv(node);
2736 (is_Cast)(const ir_node *node) {
2737 return _is_Cast(node);
2741 (is_no_Block)(const ir_node *node) {
2742 return _is_no_Block(node);
2746 (is_Block)(const ir_node *node) {
2747 return _is_Block(node);
2750 /* returns true if node is an Unknown node. */
2752 (is_Unknown)(const ir_node *node) {
2753 return _is_Unknown(node);
2756 /* returns true if node is a Return node. */
2758 (is_Return)(const ir_node *node) {
2759 return _is_Return(node);
2762 /* returns true if node is a Call node. */
2764 (is_Call)(const ir_node *node) {
2765 return _is_Call(node);
2768 /* returns true if node is a CallBegin node. */
2770 (is_CallBegin)(const ir_node *node) {
2771 return _is_CallBegin(node);
2774 /* returns true if node is a Sel node. */
2776 (is_Sel)(const ir_node *node) {
2777 return _is_Sel(node);
2780 /* returns true if node is a Mux node. */
2782 (is_Mux)(const ir_node *node) {
2783 return _is_Mux(node);
2786 /* returns true if node is a Load node. */
2788 (is_Load)(const ir_node *node) {
2789 return _is_Load(node);
2792 /* returns true if node is a Load node. */
2794 (is_Store)(const ir_node *node) {
2795 return _is_Store(node);
2798 /* returns true if node is a Sync node. */
2800 (is_Sync)(const ir_node *node) {
2801 return _is_Sync(node);
2804 /* Returns true if node is a Confirm node. */
2806 (is_Confirm)(const ir_node *node) {
2807 return _is_Confirm(node);
2810 /* Returns true if node is a Pin node. */
2812 (is_Pin)(const ir_node *node) {
2813 return _is_Pin(node);
2816 /* Returns true if node is a SymConst node. */
2818 (is_SymConst)(const ir_node *node) {
2819 return _is_SymConst(node);
2822 /* Returns true if node is a SymConst node with kind symconst_addr_ent. */
2824 (is_SymConst_addr_ent)(const ir_node *node) {
2825 return _is_SymConst_addr_ent(node);
2828 /* Returns true if node is a Cond node. */
2830 (is_Cond)(const ir_node *node) {
2831 return _is_Cond(node);
2835 (is_CopyB)(const ir_node *node) {
2836 return _is_CopyB(node);
2839 /* returns true if node is a Cmp node. */
2841 (is_Cmp)(const ir_node *node) {
2842 return _is_Cmp(node);
2845 /* returns true if node is an Alloc node. */
2847 (is_Alloc)(const ir_node *node) {
2848 return _is_Alloc(node);
2851 /* returns true if node is a Free node. */
2853 (is_Free)(const ir_node *node) {
2854 return _is_Free(node);
2857 /* returns true if a node is a Jmp node. */
2859 (is_Jmp)(const ir_node *node) {
2860 return _is_Jmp(node);
2863 /* returns true if a node is a IJmp node. */
2865 (is_IJmp)(const ir_node *node) {
2866 return _is_IJmp(node);
2869 /* returns true if a node is a Raise node. */
2871 (is_Raise)(const ir_node *node) {
2872 return _is_Raise(node);
2875 /* returns true if a node is an ASM node. */
2877 (is_ASM)(const ir_node *node) {
2878 return _is_ASM(node);
2882 (is_Proj)(const ir_node *node) {
2883 return _is_Proj(node);
2886 /* Returns true if node is a Filter node. */
2888 (is_Filter)(const ir_node *node) {
2889 return _is_Filter(node);
2892 /* Returns true if the operation manipulates control flow. */
2893 int is_cfop(const ir_node *node) {
2894 return is_op_cfopcode(get_irn_op(node));
2897 /* Returns true if the operation manipulates interprocedural control flow:
2898 CallBegin, EndReg, EndExcept */
2899 int is_ip_cfop(const ir_node *node) {
2900 return is_ip_cfopcode(get_irn_op(node));
2903 /* Returns true if the operation can change the control flow because
2906 is_fragile_op(const ir_node *node) {
2907 return is_op_fragile(get_irn_op(node));
2910 /* Returns the memory operand of fragile operations. */
2911 ir_node *get_fragile_op_mem(ir_node *node) {
2912 assert(node && is_fragile_op(node));
2914 switch (get_irn_opcode(node)) {
2925 return get_irn_n(node, pn_Generic_M_regular);
2930 assert(0 && "should not be reached");
2935 /* Returns the result mode of a Div operation. */
2936 ir_mode *get_divop_resmod(const ir_node *node) {
2937 switch (get_irn_opcode(node)) {
2938 case iro_Quot : return get_Quot_resmode(node);
2939 case iro_DivMod: return get_DivMod_resmode(node);
2940 case iro_Div : return get_Div_resmode(node);
2941 case iro_Mod : return get_Mod_resmode(node);
2943 assert(0 && "should not be reached");
2948 /* Returns true if the operation is a forking control flow operation. */
2949 int (is_irn_forking)(const ir_node *node) {
2950 return _is_irn_forking(node);
2953 /* Return the type associated with the value produced by n
2954 * if the node remarks this type as it is the case for
2955 * Cast, Const, SymConst and some Proj nodes. */
2956 ir_type *(get_irn_type)(ir_node *node) {
2957 return _get_irn_type(node);
2960 /* Return the type attribute of a node n (SymConst, Call, Alloc, Free,
2962 ir_type *(get_irn_type_attr)(ir_node *node) {
2963 return _get_irn_type_attr(node);
2966 /* Return the entity attribute of a node n (SymConst, Sel) or NULL. */
2967 ir_entity *(get_irn_entity_attr)(ir_node *node) {
2968 return _get_irn_entity_attr(node);
2971 /* Returns non-zero for constant-like nodes. */
2972 int (is_irn_constlike)(const ir_node *node) {
2973 return _is_irn_constlike(node);
2977 * Returns non-zero for nodes that are allowed to have keep-alives and
2978 * are neither Block nor PhiM.
2980 int (is_irn_keep)(const ir_node *node) {
2981 return _is_irn_keep(node);
2985 * Returns non-zero for nodes that are always placed in the start block.
2987 int (is_irn_start_block_placed)(const ir_node *node) {
2988 return _is_irn_start_block_placed(node);
2991 /* Returns non-zero for nodes that are machine operations. */
2992 int (is_irn_machine_op)(const ir_node *node) {
2993 return _is_irn_machine_op(node);
2996 /* Returns non-zero for nodes that are machine operands. */
2997 int (is_irn_machine_operand)(const ir_node *node) {
2998 return _is_irn_machine_operand(node);
3001 /* Returns non-zero for nodes that have the n'th user machine flag set. */
3002 int (is_irn_machine_user)(const ir_node *node, unsigned n) {
3003 return _is_irn_machine_user(node, n);
3007 /* Gets the string representation of the jump prediction .*/
3008 const char *get_cond_jmp_predicate_name(cond_jmp_predicate pred) {
3011 case COND_JMP_PRED_NONE: return "no prediction";
3012 case COND_JMP_PRED_TRUE: return "true taken";
3013 case COND_JMP_PRED_FALSE: return "false taken";
3017 /* Returns the conditional jump prediction of a Cond node. */
3018 cond_jmp_predicate (get_Cond_jmp_pred)(const ir_node *cond) {
3019 return _get_Cond_jmp_pred(cond);
3022 /* Sets a new conditional jump prediction. */
3023 void (set_Cond_jmp_pred)(ir_node *cond, cond_jmp_predicate pred) {
3024 _set_Cond_jmp_pred(cond, pred);
3027 /** the get_type operation must be always implemented and return a firm type */
3028 static ir_type *get_Default_type(ir_node *n) {
3030 return get_unknown_type();
3033 /* Sets the get_type operation for an ir_op_ops. */
3034 ir_op_ops *firm_set_default_get_type(ir_opcode code, ir_op_ops *ops) {
3036 case iro_Const: ops->get_type = get_Const_type; break;
3037 case iro_SymConst: ops->get_type = get_SymConst_value_type; break;
3038 case iro_Cast: ops->get_type = get_Cast_type; break;
3039 case iro_Proj: ops->get_type = get_Proj_type; break;
3041 /* not allowed to be NULL */
3042 if (! ops->get_type)
3043 ops->get_type = get_Default_type;
3049 /** Return the attribute type of a SymConst node if exists */
3050 static ir_type *get_SymConst_attr_type(ir_node *self) {
3051 symconst_kind kind = get_SymConst_kind(self);
3052 if (SYMCONST_HAS_TYPE(kind))
3053 return get_SymConst_type(self);
3057 /** Return the attribute entity of a SymConst node if exists */
3058 static ir_entity *get_SymConst_attr_entity(ir_node *self) {
3059 symconst_kind kind = get_SymConst_kind(self);
3060 if (SYMCONST_HAS_ENT(kind))
3061 return get_SymConst_entity(self);
3065 /** the get_type_attr operation must be always implemented */
3066 static ir_type *get_Null_type(ir_node *n) {
3068 return firm_unknown_type;
3071 /* Sets the get_type operation for an ir_op_ops. */
3072 ir_op_ops *firm_set_default_get_type_attr(ir_opcode code, ir_op_ops *ops) {
3074 case iro_SymConst: ops->get_type_attr = get_SymConst_attr_type; break;
3075 case iro_Call: ops->get_type_attr = get_Call_type; break;
3076 case iro_Alloc: ops->get_type_attr = get_Alloc_type; break;
3077 case iro_Free: ops->get_type_attr = get_Free_type; break;
3078 case iro_Cast: ops->get_type_attr = get_Cast_type; break;
3080 /* not allowed to be NULL */
3081 if (! ops->get_type_attr)
3082 ops->get_type_attr = get_Null_type;
3088 /** the get_entity_attr operation must be always implemented */
3089 static ir_entity *get_Null_ent(ir_node *n) {
3094 /* Sets the get_type operation for an ir_op_ops. */
3095 ir_op_ops *firm_set_default_get_entity_attr(ir_opcode code, ir_op_ops *ops) {
3097 case iro_SymConst: ops->get_entity_attr = get_SymConst_attr_entity; break;
3098 case iro_Sel: ops->get_entity_attr = _get_Sel_entity; break;
3100 /* not allowed to be NULL */
3101 if (! ops->get_entity_attr)
3102 ops->get_entity_attr = get_Null_ent;
3108 /* Sets the debug information of a node. */
3109 void (set_irn_dbg_info)(ir_node *n, dbg_info *db) {
3110 _set_irn_dbg_info(n, db);
3114 * Returns the debug information of an node.
3116 * @param n The node.
3118 dbg_info *(get_irn_dbg_info)(const ir_node *n) {
3119 return _get_irn_dbg_info(n);
3122 #if 0 /* allow the global pointer */
3124 /* checks whether a node represents a global address */
3125 int is_Global(const ir_node *node) {
3128 if (is_SymConst_addr_ent(node))
3133 ptr = get_Sel_ptr(node);
3134 return is_globals_pointer(ptr) != NULL;
3137 /* returns the entity of a global address */
3138 ir_entity *get_Global_entity(const ir_node *node) {
3139 if (is_SymConst(node))
3140 return get_SymConst_entity(node);
3142 return get_Sel_entity(node);
3146 /* checks whether a node represents a global address */
3147 int is_Global(const ir_node *node) {
3148 return is_SymConst_addr_ent(node);
3151 /* returns the entity of a global address */
3152 ir_entity *get_Global_entity(const ir_node *node) {
3153 return get_SymConst_entity(node);
3158 * Calculate a hash value of a node.
3160 unsigned firm_default_hash(const ir_node *node) {
3164 /* hash table value = 9*(9*(9*(9*(9*arity+in[0])+in[1])+ ...)+mode)+code */
3165 h = irn_arity = get_irn_intra_arity(node);
3167 /* consider all in nodes... except the block if not a control flow. */
3168 for (i = is_cfop(node) ? -1 : 0; i < irn_arity; ++i) {
3169 h = 9*h + HASH_PTR(get_irn_intra_n(node, i));
3173 h = 9*h + HASH_PTR(get_irn_mode(node));
3175 h = 9*h + HASH_PTR(get_irn_op(node));
3178 } /* firm_default_hash */