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;
144 p = obstack_alloc(irg->obst, node_size);
145 memset(p, 0, node_size);
146 res = (ir_node *)(p + firm_add_node_size);
148 res->kind = k_ir_node;
152 res->node_idx = irg_register_node_idx(irg, res);
157 res->in = NEW_ARR_F(ir_node *, 1); /* 1: space for block */
159 /* not nice but necessary: End and Sync must always have a flexible array */
160 if (op == op_End || op == op_Sync)
161 res->in = NEW_ARR_F(ir_node *, (arity+1));
163 res->in = NEW_ARR_D(ir_node *, irg->obst, (arity+1));
164 memcpy(&res->in[1], in, sizeof(ir_node *) * arity);
168 set_irn_dbg_info(res, db);
172 res->node_nr = get_irp_new_node_nr();
175 for (i = 0; i < EDGE_KIND_LAST; ++i)
176 INIT_LIST_HEAD(&res->edge_info[i].outs_head);
178 /* don't put this into the for loop, arity is -1 for some nodes! */
179 edges_notify_edge(res, -1, res->in[0], NULL, irg);
180 for (i = 1; i <= arity; ++i)
181 edges_notify_edge(res, i - 1, res->in[i], NULL, irg);
183 hook_new_node(irg, res);
188 /*-- getting some parameters from ir_nodes --*/
190 int (is_ir_node)(const void *thing) {
191 return _is_ir_node(thing);
194 int (get_irn_intra_arity)(const ir_node *node) {
195 return _get_irn_intra_arity(node);
198 int (get_irn_inter_arity)(const ir_node *node) {
199 return _get_irn_inter_arity(node);
202 int (*_get_irn_arity)(const ir_node *node) = _get_irn_intra_arity;
204 int (get_irn_arity)(const ir_node *node) {
205 return _get_irn_arity(node);
208 /* Returns the array with ins. This array is shifted with respect to the
209 array accessed by get_irn_n: The block operand is at position 0 not -1.
210 (@@@ This should be changed.)
211 The order of the predecessors in this array is not guaranteed, except that
212 lists of operands as predecessors of Block or arguments of a Call are
214 ir_node **get_irn_in(const ir_node *node) {
216 #ifdef INTERPROCEDURAL_VIEW
217 if (get_interprocedural_view()) { /* handle Filter and Block specially */
218 if (get_irn_opcode(node) == iro_Filter) {
219 assert(node->attr.filter.in_cg);
220 return node->attr.filter.in_cg;
221 } else if (get_irn_opcode(node) == iro_Block && node->attr.block.in_cg) {
222 return node->attr.block.in_cg;
224 /* else fall through */
226 #endif /* INTERPROCEDURAL_VIEW */
230 void set_irn_in(ir_node *node, int arity, ir_node **in) {
233 ir_graph *irg = current_ir_graph;
236 #ifdef INTERPROCEDURAL_VIEW
237 if (get_interprocedural_view()) { /* handle Filter and Block specially */
238 ir_opcode code = get_irn_opcode(node);
239 if (code == iro_Filter) {
240 assert(node->attr.filter.in_cg);
241 pOld_in = &node->attr.filter.in_cg;
242 } else if (code == iro_Block && node->attr.block.in_cg) {
243 pOld_in = &node->attr.block.in_cg;
248 #endif /* INTERPROCEDURAL_VIEW */
252 for (i = 0; i < arity; i++) {
253 if (i < ARR_LEN(*pOld_in)-1)
254 edges_notify_edge(node, i, in[i], (*pOld_in)[i+1], irg);
256 edges_notify_edge(node, i, in[i], NULL, irg);
258 for (;i < ARR_LEN(*pOld_in)-1; i++) {
259 edges_notify_edge(node, i, NULL, (*pOld_in)[i+1], irg);
262 if (arity != ARR_LEN(*pOld_in) - 1) {
263 ir_node * block = (*pOld_in)[0];
264 *pOld_in = NEW_ARR_D(ir_node *, irg->obst, arity + 1);
265 (*pOld_in)[0] = block;
267 fix_backedges(irg->obst, node);
269 memcpy((*pOld_in) + 1, in, sizeof(ir_node *) * arity);
272 ir_node *(get_irn_intra_n)(const ir_node *node, int n) {
273 return _get_irn_intra_n (node, n);
276 ir_node *(get_irn_inter_n)(const ir_node *node, int n) {
277 return _get_irn_inter_n (node, n);
280 ir_node *(*_get_irn_n)(const ir_node *node, int n) = _get_irn_intra_n;
282 ir_node *(get_irn_n)(const ir_node *node, int n) {
283 return _get_irn_n(node, n);
286 void set_irn_n(ir_node *node, int n, ir_node *in) {
287 assert(node && node->kind == k_ir_node);
289 assert(n < get_irn_arity(node));
290 assert(in && in->kind == k_ir_node);
292 if ((n == -1) && (get_irn_opcode(node) == iro_Filter)) {
293 /* Change block pred in both views! */
294 node->in[n + 1] = in;
295 assert(node->attr.filter.in_cg);
296 node->attr.filter.in_cg[n + 1] = in;
299 #ifdef INTERPROCEDURAL_VIEW
300 if (get_interprocedural_view()) { /* handle Filter and Block specially */
301 if (get_irn_opcode(node) == iro_Filter) {
302 assert(node->attr.filter.in_cg);
303 node->attr.filter.in_cg[n + 1] = in;
305 } else if (get_irn_opcode(node) == iro_Block && node->attr.block.in_cg) {
306 node->attr.block.in_cg[n + 1] = in;
309 /* else fall through */
311 #endif /* INTERPROCEDURAL_VIEW */
314 hook_set_irn_n(node, n, in, node->in[n + 1]);
316 /* Here, we rely on src and tgt being in the current ir graph */
317 edges_notify_edge(node, n, in, node->in[n + 1], current_ir_graph);
319 node->in[n + 1] = in;
322 int add_irn_n(ir_node *node, ir_node *in) {
324 ir_graph *irg = get_irn_irg(node);
326 assert(node->op->opar == oparity_dynamic);
327 pos = ARR_LEN(node->in) - 1;
328 ARR_APP1(ir_node *, node->in, in);
329 edges_notify_edge(node, pos, node->in[pos + 1], NULL, irg);
332 hook_set_irn_n(node, pos, node->in[pos + 1], NULL);
337 void del_Sync_n(ir_node *n, int i)
339 int arity = get_Sync_n_preds(n);
340 ir_node *last_pred = get_Sync_pred(n, arity - 1);
341 set_Sync_pred(n, i, last_pred);
342 edges_notify_edge(n, arity - 1, NULL, last_pred, get_irn_irg(n));
343 ARR_SHRINKLEN(get_irn_in(n), arity);
346 int (get_irn_deps)(const ir_node *node) {
347 return _get_irn_deps(node);
350 ir_node *(get_irn_dep)(const ir_node *node, int pos) {
351 return _get_irn_dep(node, pos);
354 void (set_irn_dep)(ir_node *node, int pos, ir_node *dep) {
355 _set_irn_dep(node, pos, dep);
358 int add_irn_dep(ir_node *node, ir_node *dep) {
361 /* DEP edges are only allowed in backend phase */
362 assert(get_irg_phase_state(get_irn_irg(node)) == phase_backend);
363 if (node->deps == NULL) {
364 node->deps = NEW_ARR_F(ir_node *, 1);
370 for(i = 0, n = ARR_LEN(node->deps); i < n; ++i) {
371 if(node->deps[i] == NULL)
374 if(node->deps[i] == dep)
378 if (first_zero >= 0) {
379 node->deps[first_zero] = dep;
382 ARR_APP1(ir_node *, node->deps, dep);
387 edges_notify_edge_kind(node, res, dep, NULL, EDGE_KIND_DEP, get_irn_irg(node));
392 void add_irn_deps(ir_node *tgt, ir_node *src) {
395 for (i = 0, n = get_irn_deps(src); i < n; ++i)
396 add_irn_dep(tgt, get_irn_dep(src, i));
400 ir_mode *(get_irn_mode)(const ir_node *node) {
401 return _get_irn_mode(node);
404 void (set_irn_mode)(ir_node *node, ir_mode *mode) {
405 _set_irn_mode(node, mode);
408 ir_modecode get_irn_modecode(const ir_node *node) {
410 return node->mode->code;
413 /** Gets the string representation of the mode .*/
414 const char *get_irn_modename(const ir_node *node) {
416 return get_mode_name(node->mode);
419 ident *get_irn_modeident(const ir_node *node) {
421 return get_mode_ident(node->mode);
424 ir_op *(get_irn_op)(const ir_node *node) {
425 return _get_irn_op(node);
428 /* should be private to the library: */
429 void (set_irn_op)(ir_node *node, ir_op *op) {
430 _set_irn_op(node, op);
433 unsigned (get_irn_opcode)(const ir_node *node) {
434 return _get_irn_opcode(node);
437 const char *get_irn_opname(const ir_node *node) {
439 if (is_Phi0(node)) return "Phi0";
440 return get_id_str(node->op->name);
443 ident *get_irn_opident(const ir_node *node) {
445 return node->op->name;
448 ir_visited_t (get_irn_visited)(const ir_node *node) {
449 return _get_irn_visited(node);
452 void (set_irn_visited)(ir_node *node, ir_visited_t visited) {
453 _set_irn_visited(node, visited);
456 void (mark_irn_visited)(ir_node *node) {
457 _mark_irn_visited(node);
460 int (irn_visited)(const ir_node *node) {
461 return _irn_visited(node);
464 void (set_irn_link)(ir_node *node, void *link) {
465 _set_irn_link(node, link);
468 void *(get_irn_link)(const ir_node *node) {
469 return _get_irn_link(node);
472 op_pin_state (get_irn_pinned)(const ir_node *node) {
473 return _get_irn_pinned(node);
476 op_pin_state (is_irn_pinned_in_irg) (const ir_node *node) {
477 return _is_irn_pinned_in_irg(node);
480 void set_irn_pinned(ir_node *node, op_pin_state state) {
481 /* due to optimization an opt may be turned into a Tuple */
485 assert(node && get_op_pinned(get_irn_op(node)) >= op_pin_state_exc_pinned);
486 assert(state == op_pin_state_pinned || state == op_pin_state_floats);
488 node->attr.except.pin_state = state;
491 #ifdef DO_HEAPANALYSIS
492 /* Access the abstract interpretation information of a node.
493 Returns NULL if no such information is available. */
494 struct abstval *get_irn_abst_value(ir_node *n) {
497 /* Set the abstract interpretation information of a node. */
498 void set_irn_abst_value(ir_node *n, struct abstval *os) {
501 struct section *firm_get_irn_section(ir_node *n) {
504 void firm_set_irn_section(ir_node *n, struct section *s) {
508 /* Dummies needed for firmjni. */
509 struct abstval *get_irn_abst_value(ir_node *n) {
513 void set_irn_abst_value(ir_node *n, struct abstval *os) {
517 struct section *firm_get_irn_section(ir_node *n) {
521 void firm_set_irn_section(ir_node *n, struct section *s) {
525 #endif /* DO_HEAPANALYSIS */
528 /* Outputs a unique number for this node */
529 long get_irn_node_nr(const ir_node *node) {
532 return node->node_nr;
534 return (long)PTR_TO_INT(node);
538 const_attr *get_irn_const_attr(ir_node *node) {
539 assert(is_Const(node));
540 return &node->attr.con;
543 long get_irn_proj_attr(ir_node *node) {
544 /* BEWARE: check for true Proj node here, no Filter */
545 assert(node->op == op_Proj);
546 return node->attr.proj;
549 alloc_attr *get_irn_alloc_attr(ir_node *node) {
550 assert(is_Alloc(node));
551 return &node->attr.alloc;
554 free_attr *get_irn_free_attr(ir_node *node) {
555 assert(is_Free(node));
556 return &node->attr.free;
559 symconst_attr *get_irn_symconst_attr(ir_node *node) {
560 assert(is_SymConst(node));
561 return &node->attr.symc;
564 ir_type *get_irn_call_attr(ir_node *node) {
565 assert(is_Call(node));
566 return node->attr.call.cld_tp = skip_tid(node->attr.call.cld_tp);
569 sel_attr *get_irn_sel_attr(ir_node *node) {
570 assert(is_Sel(node));
571 return &node->attr.sel;
574 phi_attr *get_irn_phi_attr(ir_node *node) {
575 return &node->attr.phi;
578 block_attr *get_irn_block_attr(ir_node *node) {
579 assert(is_Block(node));
580 return &node->attr.block;
583 load_attr *get_irn_load_attr(ir_node *node) {
584 assert(is_Load(node));
585 return &node->attr.load;
588 store_attr *get_irn_store_attr(ir_node *node) {
589 assert(is_Store(node));
590 return &node->attr.store;
593 except_attr *get_irn_except_attr(ir_node *node) {
594 assert(node->op == op_Div || node->op == op_Quot ||
595 node->op == op_DivMod || node->op == op_Mod || node->op == op_Call || node->op == op_Alloc || node->op == op_Bound);
596 return &node->attr.except;
599 divmod_attr *get_irn_divmod_attr(ir_node *node) {
600 assert(node->op == op_Div || node->op == op_Quot ||
601 node->op == op_DivMod || node->op == op_Mod);
602 return &node->attr.divmod;
605 void *(get_irn_generic_attr)(ir_node *node) {
606 assert(is_ir_node(node));
607 return _get_irn_generic_attr(node);
610 const void *(get_irn_generic_attr_const)(const ir_node *node) {
611 assert(is_ir_node(node));
612 return _get_irn_generic_attr_const(node);
615 unsigned (get_irn_idx)(const ir_node *node) {
616 assert(is_ir_node(node));
617 return _get_irn_idx(node);
620 int get_irn_pred_pos(ir_node *node, ir_node *arg) {
622 for (i = get_irn_arity(node) - 1; i >= 0; i--) {
623 if (get_irn_n(node, i) == arg)
629 /** manipulate fields of individual nodes **/
631 /* this works for all except Block */
632 ir_node *get_nodes_block(const ir_node *node) {
633 assert(node->op != op_Block);
634 return get_irn_n(node, -1);
637 void set_nodes_block(ir_node *node, ir_node *block) {
638 assert(node->op != op_Block);
639 set_irn_n(node, -1, block);
642 /* this works for all except Block */
643 ir_node *get_nodes_MacroBlock(const ir_node *node) {
644 assert(node->op != op_Block);
645 return get_Block_MacroBlock(get_irn_n(node, -1));
648 /* Test whether arbitrary node is frame pointer, i.e. Proj(pn_Start_P_frame_base)
649 * from Start. If so returns frame type, else Null. */
650 ir_type *is_frame_pointer(const ir_node *n) {
651 if (is_Proj(n) && (get_Proj_proj(n) == pn_Start_P_frame_base)) {
652 ir_node *start = get_Proj_pred(n);
653 if (is_Start(start)) {
654 return get_irg_frame_type(get_irn_irg(start));
660 /* Test whether arbitrary node is tls pointer, i.e. Proj(pn_Start_P_tls)
661 * from Start. If so returns tls type, else Null. */
662 ir_type *is_tls_pointer(const ir_node *n) {
663 if (is_Proj(n) && (get_Proj_proj(n) == pn_Start_P_tls)) {
664 ir_node *start = get_Proj_pred(n);
665 if (is_Start(start)) {
666 return get_tls_type();
672 /* Test whether arbitrary node is value arg base, i.e. Proj(pn_Start_P_value_arg_base)
673 * from Start. If so returns 1, else 0. */
674 int is_value_arg_pointer(const ir_node *n) {
676 (get_Proj_proj(n) == pn_Start_P_value_arg_base) &&
677 is_Start(get_Proj_pred(n)))
682 /* Returns an array with the predecessors of the Block. Depending on
683 the implementation of the graph data structure this can be a copy of
684 the internal representation of predecessors as well as the internal
685 array itself. Therefore writing to this array might obstruct the ir. */
686 ir_node **get_Block_cfgpred_arr(ir_node *node) {
687 assert(is_Block(node));
688 return (ir_node **)&(get_irn_in(node)[1]);
691 int (get_Block_n_cfgpreds)(const ir_node *node) {
692 return _get_Block_n_cfgpreds(node);
695 ir_node *(get_Block_cfgpred)(const ir_node *node, int pos) {
696 return _get_Block_cfgpred(node, pos);
699 void set_Block_cfgpred(ir_node *node, int pos, ir_node *pred) {
700 assert(is_Block(node));
701 set_irn_n(node, pos, pred);
704 ir_node *(get_Block_cfgpred_block)(const ir_node *node, int pos) {
705 return _get_Block_cfgpred_block(node, pos);
708 int get_Block_matured(const ir_node *node) {
709 assert(is_Block(node));
710 return (int)node->attr.block.is_matured;
713 void set_Block_matured(ir_node *node, int matured) {
714 assert(is_Block(node));
715 node->attr.block.is_matured = matured;
718 ir_visited_t (get_Block_block_visited)(const ir_node *node) {
719 return _get_Block_block_visited(node);
722 void (set_Block_block_visited)(ir_node *node, ir_visited_t visit) {
723 _set_Block_block_visited(node, visit);
726 /* For this current_ir_graph must be set. */
727 void (mark_Block_block_visited)(ir_node *node) {
728 _mark_Block_block_visited(node);
731 int (Block_block_visited)(const ir_node *node) {
732 return _Block_block_visited(node);
735 ir_node *get_Block_graph_arr(ir_node *node, int pos) {
736 assert(is_Block(node));
737 return node->attr.block.graph_arr[pos+1];
740 void set_Block_graph_arr(ir_node *node, int pos, ir_node *value) {
741 assert(is_Block(node));
742 node->attr.block.graph_arr[pos+1] = value;
745 #ifdef INTERPROCEDURAL_VIEW
746 void set_Block_cg_cfgpred_arr(ir_node *node, int arity, ir_node *in[]) {
747 assert(is_Block(node));
748 if (node->attr.block.in_cg == NULL || arity != ARR_LEN(node->attr.block.in_cg) - 1) {
749 node->attr.block.in_cg = NEW_ARR_D(ir_node *, current_ir_graph->obst, arity + 1);
750 node->attr.block.in_cg[0] = NULL;
751 node->attr.block.cg_backedge = new_backedge_arr(current_ir_graph->obst, arity);
753 /* Fix backedge array. fix_backedges() operates depending on
754 interprocedural_view. */
755 int ipv = get_interprocedural_view();
756 set_interprocedural_view(1);
757 fix_backedges(current_ir_graph->obst, node);
758 set_interprocedural_view(ipv);
761 memcpy(node->attr.block.in_cg + 1, in, sizeof(ir_node *) * arity);
764 void set_Block_cg_cfgpred(ir_node *node, int pos, ir_node *pred) {
765 assert(is_Block(node) && node->attr.block.in_cg &&
766 0 <= pos && pos < ARR_LEN(node->attr.block.in_cg) - 1);
767 node->attr.block.in_cg[pos + 1] = pred;
770 ir_node **get_Block_cg_cfgpred_arr(ir_node *node) {
771 assert(is_Block(node));
772 return node->attr.block.in_cg == NULL ? NULL : node->attr.block.in_cg + 1;
775 int get_Block_cg_n_cfgpreds(const ir_node *node) {
776 assert(is_Block(node));
777 return node->attr.block.in_cg == NULL ? 0 : ARR_LEN(node->attr.block.in_cg) - 1;
780 ir_node *get_Block_cg_cfgpred(const ir_node *node, int pos) {
781 assert(is_Block(node) && node->attr.block.in_cg);
782 return node->attr.block.in_cg[pos + 1];
785 void remove_Block_cg_cfgpred_arr(ir_node *node) {
786 assert(is_Block(node));
787 node->attr.block.in_cg = NULL;
789 #endif /* INTERPROCEDURAL_VIEW */
791 ir_node *(set_Block_dead)(ir_node *block) {
792 return _set_Block_dead(block);
795 int (is_Block_dead)(const ir_node *block) {
796 return _is_Block_dead(block);
799 ir_extblk *get_Block_extbb(const ir_node *block) {
801 assert(is_Block(block));
802 res = block->attr.block.extblk;
803 assert(res == NULL || is_ir_extbb(res));
807 void set_Block_extbb(ir_node *block, ir_extblk *extblk) {
808 assert(is_Block(block));
809 assert(extblk == NULL || is_ir_extbb(extblk));
810 block->attr.block.extblk = extblk;
813 /* Returns the macro block header of a block.*/
814 ir_node *get_Block_MacroBlock(const ir_node *block) {
816 assert(is_Block(block));
817 mbh = get_irn_n(block, -1);
818 /* once macro block header is respected by all optimizations,
819 this assert can be removed */
824 /* Sets the macro block header of a block. */
825 void set_Block_MacroBlock(ir_node *block, ir_node *mbh) {
826 assert(is_Block(block));
827 assert(is_Block(mbh));
828 set_irn_n(block, -1, mbh);
831 /* returns the macro block header of a node. */
832 ir_node *get_irn_MacroBlock(const ir_node *n) {
834 n = get_nodes_block(n);
835 /* if the Block is Bad, do NOT try to get it's MB, it will fail. */
839 return get_Block_MacroBlock(n);
842 /* returns the graph of a Block. */
843 ir_graph *get_Block_irg(const ir_node *block) {
844 assert(is_Block(block));
845 return block->attr.block.irg;
848 int has_Block_label(const ir_node *block) {
849 assert(is_Block(block));
850 return block->attr.block.has_label;
853 ir_label_t get_Block_label(const ir_node *block) {
854 assert(is_Block(block));
855 return block->attr.block.label;
858 void set_Block_label(ir_node *block, ir_label_t label) {
859 assert(is_Block(block));
860 block->attr.block.has_label = 1;
861 block->attr.block.label = label;
864 ir_node *(get_Block_phis)(const ir_node *block) {
865 return _get_Block_phis(block);
868 void (set_Block_phis)(ir_node *block, ir_node *phi) {
869 _set_Block_phis(block, phi);
872 void (add_Block_phi)(ir_node *block, ir_node *phi) {
873 _add_Block_phi(block, phi);
876 /* Get the Block mark (single bit). */
877 unsigned (get_Block_mark)(const ir_node *block) {
878 return _get_Block_mark(block);
881 /* Set the Block mark (single bit). */
882 void (set_Block_mark)(ir_node *block, unsigned mark) {
883 _set_Block_mark(block, mark);
886 int get_End_n_keepalives(const ir_node *end) {
888 return (get_irn_arity(end) - END_KEEPALIVE_OFFSET);
891 ir_node *get_End_keepalive(const ir_node *end, int pos) {
893 return get_irn_n(end, pos + END_KEEPALIVE_OFFSET);
896 void add_End_keepalive(ir_node *end, ir_node *ka) {
901 void set_End_keepalive(ir_node *end, int pos, ir_node *ka) {
903 set_irn_n(end, pos + END_KEEPALIVE_OFFSET, ka);
906 /* Set new keep-alives */
907 void set_End_keepalives(ir_node *end, int n, ir_node *in[]) {
909 ir_graph *irg = get_irn_irg(end);
911 /* notify that edges are deleted */
912 for (i = END_KEEPALIVE_OFFSET; i < ARR_LEN(end->in) - 1; ++i) {
913 edges_notify_edge(end, i, NULL, end->in[i + 1], irg);
915 ARR_RESIZE(ir_node *, end->in, n + 1 + END_KEEPALIVE_OFFSET);
917 for (i = 0; i < n; ++i) {
918 end->in[1 + END_KEEPALIVE_OFFSET + i] = in[i];
919 edges_notify_edge(end, END_KEEPALIVE_OFFSET + i, end->in[1 + END_KEEPALIVE_OFFSET + i], NULL, irg);
923 /* Set new keep-alives from old keep-alives, skipping irn */
924 void remove_End_keepalive(ir_node *end, ir_node *irn) {
925 int n = get_End_n_keepalives(end);
930 for (i = n -1; i >= 0; --i) {
931 ir_node *old_ka = end->in[1 + END_KEEPALIVE_OFFSET + i];
941 irg = get_irn_irg(end);
943 /* remove the edge */
944 edges_notify_edge(end, idx, NULL, irn, irg);
947 /* exchange with the last one */
948 ir_node *old = end->in[1 + END_KEEPALIVE_OFFSET + n - 1];
949 edges_notify_edge(end, n - 1, NULL, old, irg);
950 end->in[1 + END_KEEPALIVE_OFFSET + idx] = old;
951 edges_notify_edge(end, idx, old, NULL, irg);
953 ARR_RESIZE(ir_node *, end->in, (n - 1) + 1 + END_KEEPALIVE_OFFSET);
957 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 get_Cond_selector(const ir_node *node) {
1010 assert(is_Cond(node));
1011 return get_irn_n(node, 0);
1015 set_Cond_selector(ir_node *node, ir_node *selector) {
1016 assert(is_Cond(node));
1017 set_irn_n(node, 0, selector);
1021 get_Cond_kind(const ir_node *node) {
1022 assert(is_Cond(node));
1023 return node->attr.cond.kind;
1027 set_Cond_kind(ir_node *node, cond_kind kind) {
1028 assert(is_Cond(node));
1029 node->attr.cond.kind = kind;
1033 get_Cond_defaultProj(const ir_node *node) {
1034 assert(is_Cond(node));
1035 return node->attr.cond.default_proj;
1039 get_Return_mem(const ir_node *node) {
1040 assert(is_Return(node));
1041 return get_irn_n(node, 0);
1045 set_Return_mem(ir_node *node, ir_node *mem) {
1046 assert(is_Return(node));
1047 set_irn_n(node, 0, mem);
1051 get_Return_n_ress(const ir_node *node) {
1052 assert(is_Return(node));
1053 return (get_irn_arity(node) - RETURN_RESULT_OFFSET);
1057 get_Return_res_arr(ir_node *node) {
1058 assert(is_Return(node));
1059 if (get_Return_n_ress(node) > 0)
1060 return (ir_node **)&(get_irn_in(node)[1 + RETURN_RESULT_OFFSET]);
1067 set_Return_n_res(ir_node *node, int results) {
1068 assert(is_Return(node));
1073 get_Return_res(const ir_node *node, int pos) {
1074 assert(is_Return(node));
1075 assert(get_Return_n_ress(node) > pos);
1076 return get_irn_n(node, pos + RETURN_RESULT_OFFSET);
1080 set_Return_res(ir_node *node, int pos, ir_node *res){
1081 assert(is_Return(node));
1082 set_irn_n(node, pos + RETURN_RESULT_OFFSET, res);
1085 tarval *(get_Const_tarval)(const ir_node *node) {
1086 return _get_Const_tarval(node);
1090 set_Const_tarval(ir_node *node, tarval *con) {
1091 assert(is_Const(node));
1092 node->attr.con.tv = con;
1095 int (is_Const_null)(const ir_node *node) {
1096 return _is_Const_null(node);
1099 int (is_Const_one)(const ir_node *node) {
1100 return _is_Const_one(node);
1103 int (is_Const_all_one)(const ir_node *node) {
1104 return _is_Const_all_one(node);
1108 /* The source language type. Must be an atomic type. Mode of type must
1109 be mode of node. For tarvals from entities type must be pointer to
1112 get_Const_type(ir_node *node) {
1113 assert(is_Const(node));
1114 node->attr.con.tp = skip_tid(node->attr.con.tp);
1115 return node->attr.con.tp;
1119 set_Const_type(ir_node *node, ir_type *tp) {
1120 assert(is_Const(node));
1121 if (tp != firm_unknown_type) {
1122 assert(is_atomic_type(tp));
1123 assert(get_type_mode(tp) == get_irn_mode(node));
1125 node->attr.con.tp = tp;
1130 get_SymConst_kind(const ir_node *node) {
1131 assert(is_SymConst(node));
1132 return node->attr.symc.kind;
1136 set_SymConst_kind(ir_node *node, symconst_kind kind) {
1137 assert(is_SymConst(node));
1138 node->attr.symc.kind = kind;
1142 get_SymConst_type(const ir_node *node) {
1143 /* the cast here is annoying, but we have to compensate for
1145 ir_node *irn = (ir_node *)node;
1146 assert(is_SymConst(node) &&
1147 (SYMCONST_HAS_TYPE(get_SymConst_kind(node))));
1148 return irn->attr.symc.sym.type_p = skip_tid(irn->attr.symc.sym.type_p);
1152 set_SymConst_type(ir_node *node, ir_type *tp) {
1153 assert(is_SymConst(node) &&
1154 (SYMCONST_HAS_TYPE(get_SymConst_kind(node))));
1155 node->attr.symc.sym.type_p = tp;
1159 get_SymConst_name(const ir_node *node) {
1160 assert(is_SymConst(node) && SYMCONST_HAS_ID(get_SymConst_kind(node)));
1161 return node->attr.symc.sym.ident_p;
1165 set_SymConst_name(ir_node *node, ident *name) {
1166 assert(is_SymConst(node) && SYMCONST_HAS_ID(get_SymConst_kind(node)));
1167 node->attr.symc.sym.ident_p = name;
1171 /* Only to access SymConst of kind symconst_addr_ent. Else assertion: */
1172 ir_entity *get_SymConst_entity(const ir_node *node) {
1173 assert(is_SymConst(node) && SYMCONST_HAS_ENT(get_SymConst_kind(node)));
1174 return node->attr.symc.sym.entity_p;
1177 void set_SymConst_entity(ir_node *node, ir_entity *ent) {
1178 assert(is_SymConst(node) && SYMCONST_HAS_ENT(get_SymConst_kind(node)));
1179 node->attr.symc.sym.entity_p = ent;
1182 ir_enum_const *get_SymConst_enum(const ir_node *node) {
1183 assert(is_SymConst(node) && SYMCONST_HAS_ENUM(get_SymConst_kind(node)));
1184 return node->attr.symc.sym.enum_p;
1187 void set_SymConst_enum(ir_node *node, ir_enum_const *ec) {
1188 assert(is_SymConst(node) && SYMCONST_HAS_ENUM(get_SymConst_kind(node)));
1189 node->attr.symc.sym.enum_p = ec;
1192 union symconst_symbol
1193 get_SymConst_symbol(const ir_node *node) {
1194 assert(is_SymConst(node));
1195 return node->attr.symc.sym;
1199 set_SymConst_symbol(ir_node *node, union symconst_symbol sym) {
1200 assert(is_SymConst(node));
1201 node->attr.symc.sym = sym;
1204 ir_label_t get_SymConst_label(const ir_node *node) {
1205 assert(is_SymConst(node) && SYMCONST_HAS_LABEL(get_SymConst_kind(node)));
1206 return node->attr.symc.sym.label;
1209 void set_SymConst_label(ir_node *node, ir_label_t label) {
1210 assert(is_SymConst(node) && SYMCONST_HAS_LABEL(get_SymConst_kind(node)));
1211 node->attr.symc.sym.label = label;
1215 get_SymConst_value_type(ir_node *node) {
1216 assert(is_SymConst(node));
1217 if (node->attr.symc.tp) node->attr.symc.tp = skip_tid(node->attr.symc.tp);
1218 return node->attr.symc.tp;
1222 set_SymConst_value_type(ir_node *node, ir_type *tp) {
1223 assert(is_SymConst(node));
1224 node->attr.symc.tp = tp;
1228 get_Sel_mem(const ir_node *node) {
1229 assert(is_Sel(node));
1230 return get_irn_n(node, 0);
1234 set_Sel_mem(ir_node *node, ir_node *mem) {
1235 assert(is_Sel(node));
1236 set_irn_n(node, 0, mem);
1240 get_Sel_ptr(const ir_node *node) {
1241 assert(is_Sel(node));
1242 return get_irn_n(node, 1);
1246 set_Sel_ptr(ir_node *node, ir_node *ptr) {
1247 assert(is_Sel(node));
1248 set_irn_n(node, 1, ptr);
1252 get_Sel_n_indexs(const ir_node *node) {
1253 assert(is_Sel(node));
1254 return (get_irn_arity(node) - SEL_INDEX_OFFSET);
1258 get_Sel_index_arr(ir_node *node) {
1259 assert(is_Sel(node));
1260 if (get_Sel_n_indexs(node) > 0)
1261 return (ir_node **)& get_irn_in(node)[SEL_INDEX_OFFSET + 1];
1267 get_Sel_index(const ir_node *node, int pos) {
1268 assert(is_Sel(node));
1269 return get_irn_n(node, pos + SEL_INDEX_OFFSET);
1273 set_Sel_index(ir_node *node, int pos, ir_node *index) {
1274 assert(is_Sel(node));
1275 set_irn_n(node, pos + SEL_INDEX_OFFSET, index);
1279 get_Sel_entity(const ir_node *node) {
1280 assert(is_Sel(node));
1281 return node->attr.sel.ent;
1284 /* need a version without const to prevent warning */
1285 static ir_entity *_get_Sel_entity(ir_node *node) {
1286 return get_Sel_entity(node);
1290 set_Sel_entity(ir_node *node, ir_entity *ent) {
1291 assert(is_Sel(node));
1292 node->attr.sel.ent = ent;
1296 /* For unary and binary arithmetic operations the access to the
1297 operands can be factored out. Left is the first, right the
1298 second arithmetic value as listed in tech report 0999-33.
1299 unops are: Minus, Abs, Not, Conv, Cast
1300 binops are: Add, Sub, Mul, Quot, DivMod, Div, Mod, And, Or, Eor, Shl,
1301 Shr, Shrs, Rotate, Cmp */
1305 get_Call_mem(const ir_node *node) {
1306 assert(is_Call(node));
1307 return get_irn_n(node, 0);
1311 set_Call_mem(ir_node *node, ir_node *mem) {
1312 assert(is_Call(node));
1313 set_irn_n(node, 0, mem);
1317 get_Call_ptr(const ir_node *node) {
1318 assert(is_Call(node));
1319 return get_irn_n(node, 1);
1323 set_Call_ptr(ir_node *node, ir_node *ptr) {
1324 assert(is_Call(node));
1325 set_irn_n(node, 1, ptr);
1329 get_Call_param_arr(ir_node *node) {
1330 assert(is_Call(node));
1331 return &get_irn_in(node)[CALL_PARAM_OFFSET + 1];
1335 get_Call_n_params(const ir_node *node) {
1336 assert(is_Call(node));
1337 return (get_irn_arity(node) - CALL_PARAM_OFFSET);
1341 get_Call_arity(const ir_node *node) {
1342 assert(is_Call(node));
1343 return get_Call_n_params(node);
1347 set_Call_arity(ir_node *node, ir_node *arity) {
1348 assert(is_Call(node));
1353 get_Call_param(const ir_node *node, int pos) {
1354 assert(is_Call(node));
1355 return get_irn_n(node, pos + CALL_PARAM_OFFSET);
1359 set_Call_param(ir_node *node, int pos, ir_node *param) {
1360 assert(is_Call(node));
1361 set_irn_n(node, pos + CALL_PARAM_OFFSET, param);
1365 get_Call_type(ir_node *node) {
1366 assert(is_Call(node));
1367 return node->attr.call.cld_tp = skip_tid(node->attr.call.cld_tp);
1371 set_Call_type(ir_node *node, ir_type *tp) {
1372 assert(is_Call(node));
1373 assert((get_unknown_type() == tp) || is_Method_type(tp));
1374 node->attr.call.cld_tp = tp;
1377 int Call_has_callees(const ir_node *node) {
1378 assert(is_Call(node));
1379 return ((get_irg_callee_info_state(get_irn_irg(node)) != irg_callee_info_none) &&
1380 (node->attr.call.callee_arr != NULL));
1383 int get_Call_n_callees(const ir_node *node) {
1384 assert(is_Call(node) && node->attr.call.callee_arr);
1385 return ARR_LEN(node->attr.call.callee_arr);
1388 ir_entity *get_Call_callee(const ir_node *node, int pos) {
1389 assert(pos >= 0 && pos < get_Call_n_callees(node));
1390 return node->attr.call.callee_arr[pos];
1393 void set_Call_callee_arr(ir_node *node, const int n, ir_entity ** arr) {
1394 assert(is_Call(node));
1395 if (node->attr.call.callee_arr == NULL || get_Call_n_callees(node) != n) {
1396 node->attr.call.callee_arr = NEW_ARR_D(ir_entity *, current_ir_graph->obst, n);
1398 memcpy(node->attr.call.callee_arr, arr, n * sizeof(ir_entity *));
1401 void remove_Call_callee_arr(ir_node *node) {
1402 assert(is_Call(node));
1403 node->attr.call.callee_arr = NULL;
1406 ir_node *get_CallBegin_ptr(const ir_node *node) {
1407 assert(is_CallBegin(node));
1408 return get_irn_n(node, 0);
1411 void set_CallBegin_ptr(ir_node *node, ir_node *ptr) {
1412 assert(is_CallBegin(node));
1413 set_irn_n(node, 0, ptr);
1416 ir_node *get_CallBegin_call(const ir_node *node) {
1417 assert(is_CallBegin(node));
1418 return node->attr.callbegin.call;
1421 void set_CallBegin_call(ir_node *node, ir_node *call) {
1422 assert(is_CallBegin(node));
1423 node->attr.callbegin.call = call;
1427 * Returns non-zero if a Call is surely a self-recursive Call.
1428 * Beware: if this functions returns 0, the call might be self-recursive!
1430 int is_self_recursive_Call(const ir_node *call) {
1431 const ir_node *callee = get_Call_ptr(call);
1433 if (is_SymConst_addr_ent(callee)) {
1434 const ir_entity *ent = get_SymConst_entity(callee);
1435 const ir_graph *irg = get_entity_irg(ent);
1436 if (irg == get_irn_irg(call))
1443 ir_node * get_##OP##_left(const ir_node *node) { \
1444 assert(is_##OP(node)); \
1445 return get_irn_n(node, node->op->op_index); \
1447 void set_##OP##_left(ir_node *node, ir_node *left) { \
1448 assert(is_##OP(node)); \
1449 set_irn_n(node, node->op->op_index, left); \
1451 ir_node *get_##OP##_right(const ir_node *node) { \
1452 assert(is_##OP(node)); \
1453 return get_irn_n(node, node->op->op_index + 1); \
1455 void set_##OP##_right(ir_node *node, ir_node *right) { \
1456 assert(is_##OP(node)); \
1457 set_irn_n(node, node->op->op_index + 1, right); \
1461 ir_node *get_##OP##_op(const ir_node *node) { \
1462 assert(is_##OP(node)); \
1463 return get_irn_n(node, node->op->op_index); \
1465 void set_##OP##_op(ir_node *node, ir_node *op) { \
1466 assert(is_##OP(node)); \
1467 set_irn_n(node, node->op->op_index, op); \
1470 #define BINOP_MEM(OP) \
1474 get_##OP##_mem(const ir_node *node) { \
1475 assert(is_##OP(node)); \
1476 return get_irn_n(node, 0); \
1480 set_##OP##_mem(ir_node *node, ir_node *mem) { \
1481 assert(is_##OP(node)); \
1482 set_irn_n(node, 0, mem); \
1488 ir_mode *get_##OP##_resmode(const ir_node *node) { \
1489 assert(is_##OP(node)); \
1490 return node->attr.divmod.res_mode; \
1493 void set_##OP##_resmode(ir_node *node, ir_mode *mode) { \
1494 assert(is_##OP(node)); \
1495 node->attr.divmod.res_mode = mode; \
1522 int is_Div_remainderless(const ir_node *node) {
1523 assert(is_Div(node));
1524 return node->attr.divmod.no_remainder;
1527 int get_Conv_strict(const ir_node *node) {
1528 assert(is_Conv(node));
1529 return node->attr.conv.strict;
1532 void set_Conv_strict(ir_node *node, int strict_flag) {
1533 assert(is_Conv(node));
1534 node->attr.conv.strict = (char)strict_flag;
1538 get_Cast_type(ir_node *node) {
1539 assert(is_Cast(node));
1540 node->attr.cast.totype = skip_tid(node->attr.cast.totype);
1541 return node->attr.cast.totype;
1545 set_Cast_type(ir_node *node, ir_type *to_tp) {
1546 assert(is_Cast(node));
1547 node->attr.cast.totype = to_tp;
1551 /* Checks for upcast.
1553 * Returns true if the Cast node casts a class type to a super type.
1555 int is_Cast_upcast(ir_node *node) {
1556 ir_type *totype = get_Cast_type(node);
1557 ir_type *fromtype = get_irn_typeinfo_type(get_Cast_op(node));
1559 assert(get_irg_typeinfo_state(get_irn_irg(node)) == ir_typeinfo_consistent);
1562 while (is_Pointer_type(totype) && is_Pointer_type(fromtype)) {
1563 totype = get_pointer_points_to_type(totype);
1564 fromtype = get_pointer_points_to_type(fromtype);
1569 if (!is_Class_type(totype)) return 0;
1570 return is_SubClass_of(fromtype, totype);
1573 /* Checks for downcast.
1575 * Returns true if the Cast node casts a class type to a sub type.
1577 int is_Cast_downcast(ir_node *node) {
1578 ir_type *totype = get_Cast_type(node);
1579 ir_type *fromtype = get_irn_typeinfo_type(get_Cast_op(node));
1581 assert(get_irg_typeinfo_state(get_irn_irg(node)) == ir_typeinfo_consistent);
1584 while (is_Pointer_type(totype) && is_Pointer_type(fromtype)) {
1585 totype = get_pointer_points_to_type(totype);
1586 fromtype = get_pointer_points_to_type(fromtype);
1591 if (!is_Class_type(totype)) return 0;
1592 return is_SubClass_of(totype, fromtype);
1596 (is_unop)(const ir_node *node) {
1597 return _is_unop(node);
1601 get_unop_op(const ir_node *node) {
1602 if (node->op->opar == oparity_unary)
1603 return get_irn_n(node, node->op->op_index);
1605 assert(node->op->opar == oparity_unary);
1610 set_unop_op(ir_node *node, ir_node *op) {
1611 if (node->op->opar == oparity_unary)
1612 set_irn_n(node, node->op->op_index, op);
1614 assert(node->op->opar == oparity_unary);
1618 (is_binop)(const ir_node *node) {
1619 return _is_binop(node);
1623 get_binop_left(const ir_node *node) {
1624 assert(node->op->opar == oparity_binary);
1625 return get_irn_n(node, node->op->op_index);
1629 set_binop_left(ir_node *node, ir_node *left) {
1630 assert(node->op->opar == oparity_binary);
1631 set_irn_n(node, node->op->op_index, left);
1635 get_binop_right(const ir_node *node) {
1636 assert(node->op->opar == oparity_binary);
1637 return get_irn_n(node, node->op->op_index + 1);
1641 set_binop_right(ir_node *node, ir_node *right) {
1642 assert(node->op->opar == oparity_binary);
1643 set_irn_n(node, node->op->op_index + 1, right);
1647 (is_Phi)(const ir_node *n) {
1651 int is_Phi0(const ir_node *n) {
1654 return ((get_irn_op(n) == op_Phi) &&
1655 (get_irn_arity(n) == 0) &&
1656 (get_irg_phase_state(get_irn_irg(n)) == phase_building));
1660 get_Phi_preds_arr(ir_node *node) {
1661 assert(node->op == op_Phi);
1662 return (ir_node **)&(get_irn_in(node)[1]);
1666 get_Phi_n_preds(const ir_node *node) {
1667 assert(is_Phi(node) || is_Phi0(node));
1668 return (get_irn_arity(node));
1672 void set_Phi_n_preds(ir_node *node, int n_preds) {
1673 assert(node->op == op_Phi);
1678 get_Phi_pred(const ir_node *node, int pos) {
1679 assert(is_Phi(node) || is_Phi0(node));
1680 return get_irn_n(node, pos);
1684 set_Phi_pred(ir_node *node, int pos, ir_node *pred) {
1685 assert(is_Phi(node) || is_Phi0(node));
1686 set_irn_n(node, pos, pred);
1689 ir_node *(get_Phi_next)(const ir_node *phi) {
1690 return _get_Phi_next(phi);
1693 void (set_Phi_next)(ir_node *phi, ir_node *next) {
1694 _set_Phi_next(phi, next);
1697 int is_memop(const ir_node *node) {
1698 ir_opcode code = get_irn_opcode(node);
1699 return (code == iro_Load || code == iro_Store);
1702 ir_node *get_memop_mem(const ir_node *node) {
1703 assert(is_memop(node));
1704 return get_irn_n(node, 0);
1707 void set_memop_mem(ir_node *node, ir_node *mem) {
1708 assert(is_memop(node));
1709 set_irn_n(node, 0, mem);
1712 ir_node *get_memop_ptr(const ir_node *node) {
1713 assert(is_memop(node));
1714 return get_irn_n(node, 1);
1717 void set_memop_ptr(ir_node *node, ir_node *ptr) {
1718 assert(is_memop(node));
1719 set_irn_n(node, 1, ptr);
1723 get_Load_mem(const ir_node *node) {
1724 assert(is_Load(node));
1725 return get_irn_n(node, 0);
1729 set_Load_mem(ir_node *node, ir_node *mem) {
1730 assert(is_Load(node));
1731 set_irn_n(node, 0, mem);
1735 get_Load_ptr(const ir_node *node) {
1736 assert(is_Load(node));
1737 return get_irn_n(node, 1);
1741 set_Load_ptr(ir_node *node, ir_node *ptr) {
1742 assert(is_Load(node));
1743 set_irn_n(node, 1, ptr);
1747 get_Load_mode(const ir_node *node) {
1748 assert(is_Load(node));
1749 return node->attr.load.load_mode;
1753 set_Load_mode(ir_node *node, ir_mode *mode) {
1754 assert(is_Load(node));
1755 node->attr.load.load_mode = mode;
1759 get_Load_volatility(const ir_node *node) {
1760 assert(is_Load(node));
1761 return node->attr.load.volatility;
1765 set_Load_volatility(ir_node *node, ir_volatility volatility) {
1766 assert(is_Load(node));
1767 node->attr.load.volatility = volatility;
1771 get_Load_align(const ir_node *node) {
1772 assert(is_Load(node));
1773 return node->attr.load.aligned;
1777 set_Load_align(ir_node *node, ir_align align) {
1778 assert(is_Load(node));
1779 node->attr.load.aligned = align;
1784 get_Store_mem(const ir_node *node) {
1785 assert(is_Store(node));
1786 return get_irn_n(node, 0);
1790 set_Store_mem(ir_node *node, ir_node *mem) {
1791 assert(is_Store(node));
1792 set_irn_n(node, 0, mem);
1796 get_Store_ptr(const ir_node *node) {
1797 assert(is_Store(node));
1798 return get_irn_n(node, 1);
1802 set_Store_ptr(ir_node *node, ir_node *ptr) {
1803 assert(is_Store(node));
1804 set_irn_n(node, 1, ptr);
1808 get_Store_value(const ir_node *node) {
1809 assert(is_Store(node));
1810 return get_irn_n(node, 2);
1814 set_Store_value(ir_node *node, ir_node *value) {
1815 assert(is_Store(node));
1816 set_irn_n(node, 2, value);
1820 get_Store_volatility(const ir_node *node) {
1821 assert(is_Store(node));
1822 return node->attr.store.volatility;
1826 set_Store_volatility(ir_node *node, ir_volatility volatility) {
1827 assert(is_Store(node));
1828 node->attr.store.volatility = volatility;
1832 get_Store_align(const ir_node *node) {
1833 assert(is_Store(node));
1834 return node->attr.store.aligned;
1838 set_Store_align(ir_node *node, ir_align align) {
1839 assert(is_Store(node));
1840 node->attr.store.aligned = align;
1845 get_Alloc_mem(const ir_node *node) {
1846 assert(is_Alloc(node));
1847 return get_irn_n(node, 0);
1851 set_Alloc_mem(ir_node *node, ir_node *mem) {
1852 assert(is_Alloc(node));
1853 set_irn_n(node, 0, mem);
1857 get_Alloc_size(const ir_node *node) {
1858 assert(is_Alloc(node));
1859 return get_irn_n(node, 1);
1863 set_Alloc_size(ir_node *node, ir_node *size) {
1864 assert(is_Alloc(node));
1865 set_irn_n(node, 1, size);
1869 get_Alloc_type(ir_node *node) {
1870 assert(is_Alloc(node));
1871 return node->attr.alloc.type = skip_tid(node->attr.alloc.type);
1875 set_Alloc_type(ir_node *node, ir_type *tp) {
1876 assert(is_Alloc(node));
1877 node->attr.alloc.type = tp;
1881 get_Alloc_where(const ir_node *node) {
1882 assert(is_Alloc(node));
1883 return node->attr.alloc.where;
1887 set_Alloc_where(ir_node *node, ir_where_alloc where) {
1888 assert(is_Alloc(node));
1889 node->attr.alloc.where = where;
1894 get_Free_mem(const ir_node *node) {
1895 assert(is_Free(node));
1896 return get_irn_n(node, 0);
1900 set_Free_mem(ir_node *node, ir_node *mem) {
1901 assert(is_Free(node));
1902 set_irn_n(node, 0, mem);
1906 get_Free_ptr(const ir_node *node) {
1907 assert(is_Free(node));
1908 return get_irn_n(node, 1);
1912 set_Free_ptr(ir_node *node, ir_node *ptr) {
1913 assert(is_Free(node));
1914 set_irn_n(node, 1, ptr);
1918 get_Free_size(const ir_node *node) {
1919 assert(is_Free(node));
1920 return get_irn_n(node, 2);
1924 set_Free_size(ir_node *node, ir_node *size) {
1925 assert(is_Free(node));
1926 set_irn_n(node, 2, size);
1930 get_Free_type(ir_node *node) {
1931 assert(is_Free(node));
1932 return node->attr.free.type = skip_tid(node->attr.free.type);
1936 set_Free_type(ir_node *node, ir_type *tp) {
1937 assert(is_Free(node));
1938 node->attr.free.type = tp;
1942 get_Free_where(const ir_node *node) {
1943 assert(is_Free(node));
1944 return node->attr.free.where;
1948 set_Free_where(ir_node *node, ir_where_alloc where) {
1949 assert(is_Free(node));
1950 node->attr.free.where = where;
1953 ir_node **get_Sync_preds_arr(ir_node *node) {
1954 assert(is_Sync(node));
1955 return (ir_node **)&(get_irn_in(node)[1]);
1958 int get_Sync_n_preds(const ir_node *node) {
1959 assert(is_Sync(node));
1960 return (get_irn_arity(node));
1964 void set_Sync_n_preds(ir_node *node, int n_preds) {
1965 assert(is_Sync(node));
1969 ir_node *get_Sync_pred(const ir_node *node, int pos) {
1970 assert(is_Sync(node));
1971 return get_irn_n(node, pos);
1974 void set_Sync_pred(ir_node *node, int pos, ir_node *pred) {
1975 assert(is_Sync(node));
1976 set_irn_n(node, pos, pred);
1979 /* Add a new Sync predecessor */
1980 void add_Sync_pred(ir_node *node, ir_node *pred) {
1981 assert(is_Sync(node));
1982 add_irn_n(node, pred);
1985 /* Returns the source language type of a Proj node. */
1986 ir_type *get_Proj_type(ir_node *n) {
1987 ir_type *tp = firm_unknown_type;
1988 ir_node *pred = get_Proj_pred(n);
1990 switch (get_irn_opcode(pred)) {
1993 /* Deal with Start / Call here: we need to know the Proj Nr. */
1994 assert(get_irn_mode(pred) == mode_T);
1995 pred_pred = get_Proj_pred(pred);
1997 if (is_Start(pred_pred)) {
1998 ir_type *mtp = get_entity_type(get_irg_entity(get_irn_irg(pred_pred)));
1999 tp = get_method_param_type(mtp, get_Proj_proj(n));
2000 } else if (is_Call(pred_pred)) {
2001 ir_type *mtp = get_Call_type(pred_pred);
2002 tp = get_method_res_type(mtp, get_Proj_proj(n));
2005 case iro_Start: break;
2006 case iro_Call: break;
2008 ir_node *a = get_Load_ptr(pred);
2010 tp = get_entity_type(get_Sel_entity(a));
2019 get_Proj_pred(const ir_node *node) {
2020 assert(is_Proj(node));
2021 return get_irn_n(node, 0);
2025 set_Proj_pred(ir_node *node, ir_node *pred) {
2026 assert(is_Proj(node));
2027 set_irn_n(node, 0, pred);
2031 get_Proj_proj(const ir_node *node) {
2032 #ifdef INTERPROCEDURAL_VIEW
2033 ir_opcode code = get_irn_opcode(node);
2035 if (code == iro_Proj) {
2036 return node->attr.proj;
2039 assert(code == iro_Filter);
2040 return node->attr.filter.proj;
2043 assert(is_Proj(node));
2044 return node->attr.proj;
2045 #endif /* INTERPROCEDURAL_VIEW */
2049 set_Proj_proj(ir_node *node, long proj) {
2050 #ifdef INTERPROCEDURAL_VIEW
2051 ir_opcode code = get_irn_opcode(node);
2053 if (code == iro_Proj) {
2054 node->attr.proj = proj;
2057 assert(code == iro_Filter);
2058 node->attr.filter.proj = proj;
2061 assert(is_Proj(node));
2062 node->attr.proj = proj;
2063 #endif /* INTERPROCEDURAL_VIEW */
2066 /* Returns non-zero if a node is a routine parameter. */
2067 int (is_arg_Proj)(const ir_node *node) {
2068 return _is_arg_Proj(node);
2072 get_Tuple_preds_arr(ir_node *node) {
2073 assert(is_Tuple(node));
2074 return (ir_node **)&(get_irn_in(node)[1]);
2078 get_Tuple_n_preds(const ir_node *node) {
2079 assert(is_Tuple(node));
2080 return get_irn_arity(node);
2085 set_Tuple_n_preds(ir_node *node, int n_preds) {
2086 assert(is_Tuple(node));
2091 get_Tuple_pred(const ir_node *node, int pos) {
2092 assert(is_Tuple(node));
2093 return get_irn_n(node, pos);
2097 set_Tuple_pred(ir_node *node, int pos, ir_node *pred) {
2098 assert(is_Tuple(node));
2099 set_irn_n(node, pos, pred);
2103 get_Id_pred(const ir_node *node) {
2104 assert(is_Id(node));
2105 return get_irn_n(node, 0);
2109 set_Id_pred(ir_node *node, ir_node *pred) {
2110 assert(is_Id(node));
2111 set_irn_n(node, 0, pred);
2114 ir_node *get_Confirm_value(const ir_node *node) {
2115 assert(is_Confirm(node));
2116 return get_irn_n(node, 0);
2119 void set_Confirm_value(ir_node *node, ir_node *value) {
2120 assert(is_Confirm(node));
2121 set_irn_n(node, 0, value);
2124 ir_node *get_Confirm_bound(const ir_node *node) {
2125 assert(is_Confirm(node));
2126 return get_irn_n(node, 1);
2129 void set_Confirm_bound(ir_node *node, ir_node *bound) {
2130 assert(is_Confirm(node));
2131 set_irn_n(node, 0, bound);
2134 pn_Cmp get_Confirm_cmp(const ir_node *node) {
2135 assert(is_Confirm(node));
2136 return node->attr.confirm.cmp;
2139 void set_Confirm_cmp(ir_node *node, pn_Cmp cmp) {
2140 assert(is_Confirm(node));
2141 node->attr.confirm.cmp = cmp;
2145 get_Filter_pred(ir_node *node) {
2146 assert(is_Filter(node));
2151 set_Filter_pred(ir_node *node, ir_node *pred) {
2152 assert(is_Filter(node));
2157 get_Filter_proj(ir_node *node) {
2158 assert(is_Filter(node));
2159 return node->attr.filter.proj;
2163 set_Filter_proj(ir_node *node, long proj) {
2164 assert(is_Filter(node));
2165 node->attr.filter.proj = proj;
2168 /* Don't use get_irn_arity, get_irn_n in implementation as access
2169 shall work independent of view!!! */
2170 void set_Filter_cg_pred_arr(ir_node *node, int arity, ir_node ** in) {
2171 assert(is_Filter(node));
2172 if (node->attr.filter.in_cg == NULL || arity != ARR_LEN(node->attr.filter.in_cg) - 1) {
2173 ir_graph *irg = get_irn_irg(node);
2174 node->attr.filter.in_cg = NEW_ARR_D(ir_node *, current_ir_graph->obst, arity + 1);
2175 node->attr.filter.backedge = new_backedge_arr(irg->obst, arity);
2176 node->attr.filter.in_cg[0] = node->in[0];
2178 memcpy(node->attr.filter.in_cg + 1, in, sizeof(ir_node *) * arity);
2181 void set_Filter_cg_pred(ir_node * node, int pos, ir_node * pred) {
2182 assert(is_Filter(node) && node->attr.filter.in_cg &&
2183 0 <= pos && pos < ARR_LEN(node->attr.filter.in_cg) - 1);
2184 node->attr.filter.in_cg[pos + 1] = pred;
2187 int get_Filter_n_cg_preds(ir_node *node) {
2188 assert(is_Filter(node) && node->attr.filter.in_cg);
2189 return (ARR_LEN(node->attr.filter.in_cg) - 1);
2192 ir_node *get_Filter_cg_pred(ir_node *node, int pos) {
2194 assert(is_Filter(node) && node->attr.filter.in_cg &&
2196 arity = ARR_LEN(node->attr.filter.in_cg);
2197 assert(pos < arity - 1);
2198 return node->attr.filter.in_cg[pos + 1];
2202 ir_node *get_Mux_sel(const ir_node *node) {
2203 assert(is_Mux(node));
2207 void set_Mux_sel(ir_node *node, ir_node *sel) {
2208 assert(is_Mux(node));
2212 ir_node *get_Mux_false(const ir_node *node) {
2213 assert(is_Mux(node));
2217 void set_Mux_false(ir_node *node, ir_node *ir_false) {
2218 assert(is_Mux(node));
2219 node->in[2] = ir_false;
2222 ir_node *get_Mux_true(const ir_node *node) {
2223 assert(is_Mux(node));
2227 void set_Mux_true(ir_node *node, ir_node *ir_true) {
2228 assert(is_Mux(node));
2229 node->in[3] = ir_true;
2233 ir_node *get_CopyB_mem(const ir_node *node) {
2234 assert(is_CopyB(node));
2235 return get_irn_n(node, 0);
2238 void set_CopyB_mem(ir_node *node, ir_node *mem) {
2239 assert(node->op == op_CopyB);
2240 set_irn_n(node, 0, mem);
2243 ir_node *get_CopyB_dst(const ir_node *node) {
2244 assert(is_CopyB(node));
2245 return get_irn_n(node, 1);
2248 void set_CopyB_dst(ir_node *node, ir_node *dst) {
2249 assert(is_CopyB(node));
2250 set_irn_n(node, 1, dst);
2253 ir_node *get_CopyB_src(const ir_node *node) {
2254 assert(is_CopyB(node));
2255 return get_irn_n(node, 2);
2258 void set_CopyB_src(ir_node *node, ir_node *src) {
2259 assert(is_CopyB(node));
2260 set_irn_n(node, 2, src);
2263 ir_type *get_CopyB_type(ir_node *node) {
2264 assert(is_CopyB(node));
2265 return node->attr.copyb.data_type = skip_tid(node->attr.copyb.data_type);
2268 void set_CopyB_type(ir_node *node, ir_type *data_type) {
2269 assert(is_CopyB(node) && data_type);
2270 node->attr.copyb.data_type = data_type;
2275 get_InstOf_type(ir_node *node) {
2276 assert(node->op == op_InstOf);
2277 return node->attr.instof.type = skip_tid(node->attr.instof.type);
2281 set_InstOf_type(ir_node *node, ir_type *type) {
2282 assert(node->op == op_InstOf);
2283 node->attr.instof.type = type;
2287 get_InstOf_store(const ir_node *node) {
2288 assert(node->op == op_InstOf);
2289 return get_irn_n(node, 0);
2293 set_InstOf_store(ir_node *node, ir_node *obj) {
2294 assert(node->op == op_InstOf);
2295 set_irn_n(node, 0, obj);
2299 get_InstOf_obj(const ir_node *node) {
2300 assert(node->op == op_InstOf);
2301 return get_irn_n(node, 1);
2305 set_InstOf_obj(ir_node *node, ir_node *obj) {
2306 assert(node->op == op_InstOf);
2307 set_irn_n(node, 1, obj);
2310 /* Returns the memory input of a Raise operation. */
2312 get_Raise_mem(const ir_node *node) {
2313 assert(is_Raise(node));
2314 return get_irn_n(node, 0);
2318 set_Raise_mem(ir_node *node, ir_node *mem) {
2319 assert(is_Raise(node));
2320 set_irn_n(node, 0, mem);
2324 get_Raise_exo_ptr(const ir_node *node) {
2325 assert(is_Raise(node));
2326 return get_irn_n(node, 1);
2330 set_Raise_exo_ptr(ir_node *node, ir_node *exo_ptr) {
2331 assert(is_Raise(node));
2332 set_irn_n(node, 1, exo_ptr);
2337 /* Returns the memory input of a Bound operation. */
2338 ir_node *get_Bound_mem(const ir_node *bound) {
2339 assert(is_Bound(bound));
2340 return get_irn_n(bound, 0);
2343 void set_Bound_mem(ir_node *bound, ir_node *mem) {
2344 assert(is_Bound(bound));
2345 set_irn_n(bound, 0, mem);
2348 /* Returns the index input of a Bound operation. */
2349 ir_node *get_Bound_index(const ir_node *bound) {
2350 assert(is_Bound(bound));
2351 return get_irn_n(bound, 1);
2354 void set_Bound_index(ir_node *bound, ir_node *idx) {
2355 assert(is_Bound(bound));
2356 set_irn_n(bound, 1, idx);
2359 /* Returns the lower bound input of a Bound operation. */
2360 ir_node *get_Bound_lower(const ir_node *bound) {
2361 assert(is_Bound(bound));
2362 return get_irn_n(bound, 2);
2365 void set_Bound_lower(ir_node *bound, ir_node *lower) {
2366 assert(is_Bound(bound));
2367 set_irn_n(bound, 2, lower);
2370 /* Returns the upper bound input of a Bound operation. */
2371 ir_node *get_Bound_upper(const ir_node *bound) {
2372 assert(is_Bound(bound));
2373 return get_irn_n(bound, 3);
2376 void set_Bound_upper(ir_node *bound, ir_node *upper) {
2377 assert(is_Bound(bound));
2378 set_irn_n(bound, 3, upper);
2381 /* Return the operand of a Pin node. */
2382 ir_node *get_Pin_op(const ir_node *pin) {
2383 assert(is_Pin(pin));
2384 return get_irn_n(pin, 0);
2387 void set_Pin_op(ir_node *pin, ir_node *node) {
2388 assert(is_Pin(pin));
2389 set_irn_n(pin, 0, node);
2392 /* Return the assembler text of an ASM pseudo node. */
2393 ident *get_ASM_text(const ir_node *node) {
2394 assert(is_ASM(node));
2395 return node->attr.assem.asm_text;
2398 /* Return the number of input constraints for an ASM node. */
2399 int get_ASM_n_input_constraints(const ir_node *node) {
2400 assert(is_ASM(node));
2401 return ARR_LEN(node->attr.assem.inputs);
2404 /* Return the input constraints for an ASM node. This is a flexible array. */
2405 const ir_asm_constraint *get_ASM_input_constraints(const ir_node *node) {
2406 assert(is_ASM(node));
2407 return node->attr.assem.inputs;
2410 /* Return the number of output constraints for an ASM node. */
2411 int get_ASM_n_output_constraints(const ir_node *node) {
2412 assert(is_ASM(node));
2413 return ARR_LEN(node->attr.assem.outputs);
2416 /* Return the output constraints for an ASM node. */
2417 const ir_asm_constraint *get_ASM_output_constraints(const ir_node *node) {
2418 assert(is_ASM(node));
2419 return node->attr.assem.outputs;
2422 /* Return the number of clobbered registers for an ASM node. */
2423 int get_ASM_n_clobbers(const ir_node *node) {
2424 assert(is_ASM(node));
2425 return ARR_LEN(node->attr.assem.clobber);
2428 /* Return the list of clobbered registers for an ASM node. */
2429 ident **get_ASM_clobbers(const ir_node *node) {
2430 assert(is_ASM(node));
2431 return node->attr.assem.clobber;
2434 /* returns the graph of a node */
2436 get_irn_irg(const ir_node *node) {
2438 * Do not use get_nodes_Block() here, because this
2439 * will check the pinned state.
2440 * However even a 'wrong' block is always in the proper
2443 if (! is_Block(node))
2444 node = get_irn_n(node, -1);
2445 if (is_Bad(node)) /* sometimes bad is predecessor of nodes instead of block: in case of optimization */
2446 node = get_irn_n(node, -1);
2447 assert(is_Block(node));
2448 return node->attr.block.irg;
2452 /*----------------------------------------------------------------*/
2453 /* Auxiliary routines */
2454 /*----------------------------------------------------------------*/
2457 skip_Proj(ir_node *node) {
2458 /* don't assert node !!! */
2463 node = get_Proj_pred(node);
2469 skip_Proj_const(const ir_node *node) {
2470 /* don't assert node !!! */
2475 node = get_Proj_pred(node);
2481 skip_Tuple(ir_node *node) {
2485 if (!get_opt_normalize()) return node;
2488 if (get_irn_op(node) == op_Proj) {
2489 pred = get_Proj_pred(node);
2490 op = get_irn_op(pred);
2493 * Looks strange but calls get_irn_op() only once
2494 * in most often cases.
2496 if (op == op_Proj) { /* nested Tuple ? */
2497 pred = skip_Tuple(pred);
2498 op = get_irn_op(pred);
2500 if (op == op_Tuple) {
2501 node = get_Tuple_pred(pred, get_Proj_proj(node));
2504 } else if (op == op_Tuple) {
2505 node = get_Tuple_pred(pred, get_Proj_proj(node));
2512 /* returns operand of node if node is a Cast */
2513 ir_node *skip_Cast(ir_node *node) {
2515 return get_Cast_op(node);
2519 /* returns operand of node if node is a Cast */
2520 const ir_node *skip_Cast_const(const ir_node *node) {
2522 return get_Cast_op(node);
2526 /* returns operand of node if node is a Pin */
2527 ir_node *skip_Pin(ir_node *node) {
2529 return get_Pin_op(node);
2533 /* returns operand of node if node is a Confirm */
2534 ir_node *skip_Confirm(ir_node *node) {
2535 if (is_Confirm(node))
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 */