2 * Copyright (C) 1995-2008 University of Karlsruhe. All right reserved.
4 * This file is part of libFirm.
6 * This file may be distributed and/or modified under the terms of the
7 * GNU General Public License version 2 as published by the Free Software
8 * Foundation and appearing in the file LICENSE.GPL included in the
9 * packaging of this file.
11 * Licensees holding valid libFirm Professional Edition licenses may use
12 * this file in accordance with the libFirm Commercial License.
13 * Agreement provided with the Software.
15 * This file is provided AS IS with NO WARRANTY OF ANY KIND, INCLUDING THE
16 * WARRANTY OF DESIGN, MERCHANTABILITY AND FITNESS FOR A PARTICULAR
22 * @brief Representation of an intermediate operation.
23 * @author Martin Trapp, Christian Schaefer, Goetz Lindenmaier, Michael Beck
33 #include "irgraph_t.h"
35 #include "irbackedge_t.h"
39 #include "iredgekinds.h"
40 #include "iredges_t.h"
48 /* some constants fixing the positions of nodes predecessors
50 #define CALL_PARAM_OFFSET 2
51 #define BUILDIN_PARAM_OFFSET 1
52 #define SEL_INDEX_OFFSET 2
53 #define RETURN_RESULT_OFFSET 1 /* mem is not a result */
54 #define END_KEEPALIVE_OFFSET 0
56 static const char *pnc_name_arr [] = {
57 "pn_Cmp_False", "pn_Cmp_Eq", "pn_Cmp_Lt", "pn_Cmp_Le",
58 "pn_Cmp_Gt", "pn_Cmp_Ge", "pn_Cmp_Lg", "pn_Cmp_Leg",
59 "pn_Cmp_Uo", "pn_Cmp_Ue", "pn_Cmp_Ul", "pn_Cmp_Ule",
60 "pn_Cmp_Ug", "pn_Cmp_Uge", "pn_Cmp_Ne", "pn_Cmp_True"
64 * returns the pnc name from an pnc constant
66 const char *get_pnc_string(int pnc) {
67 assert(pnc >= 0 && pnc <
68 (int) (sizeof(pnc_name_arr)/sizeof(pnc_name_arr[0])));
69 return pnc_name_arr[pnc];
73 * Calculates the negated (Complement(R)) pnc condition.
75 pn_Cmp get_negated_pnc(long pnc, ir_mode *mode) {
78 /* do NOT add the Uo bit for non-floating point values */
79 if (! mode_is_float(mode))
85 /* Calculates the inversed (R^-1) pnc condition, i.e., "<" --> ">" */
86 pn_Cmp get_inversed_pnc(long pnc) {
87 long code = pnc & ~(pn_Cmp_Lt|pn_Cmp_Gt);
88 long lesser = pnc & pn_Cmp_Lt;
89 long greater = pnc & pn_Cmp_Gt;
91 code |= (lesser ? pn_Cmp_Gt : 0) | (greater ? pn_Cmp_Lt : 0);
97 * Indicates, whether additional data can be registered to ir nodes.
98 * If set to 1, this is not possible anymore.
100 static int forbid_new_data = 0;
103 * The amount of additional space for custom data to be allocated upon
104 * creating a new node.
106 unsigned firm_add_node_size = 0;
109 /* register new space for every node */
110 unsigned firm_register_additional_node_data(unsigned size) {
111 assert(!forbid_new_data && "Too late to register additional node data");
116 return firm_add_node_size += size;
120 void init_irnode(void) {
121 /* Forbid the addition of new data to an ir node. */
126 * irnode constructor.
127 * Create a new irnode in irg, with an op, mode, arity and
128 * some incoming irnodes.
129 * If arity is negative, a node with a dynamic array is created.
132 new_ir_node(dbg_info *db, ir_graph *irg, ir_node *block, ir_op *op, ir_mode *mode,
133 int arity, ir_node **in)
136 size_t node_size = offsetof(ir_node, attr) + op->attr_size + firm_add_node_size;
143 p = obstack_alloc(irg->obst, node_size);
144 memset(p, 0, node_size);
145 res = (ir_node *)(p + firm_add_node_size);
147 res->kind = k_ir_node;
151 res->node_idx = irg_register_node_idx(irg, res);
156 res->in = NEW_ARR_F(ir_node *, 1); /* 1: space for block */
158 /* not nice but necessary: End and Sync must always have a flexible array */
159 if (op == op_End || op == op_Sync)
160 res->in = NEW_ARR_F(ir_node *, (arity+1));
162 res->in = NEW_ARR_D(ir_node *, irg->obst, (arity+1));
163 memcpy(&res->in[1], in, sizeof(ir_node *) * arity);
167 set_irn_dbg_info(res, db);
171 res->node_nr = get_irp_new_node_nr();
174 for (i = 0; i < EDGE_KIND_LAST; ++i)
175 INIT_LIST_HEAD(&res->edge_info[i].outs_head);
177 /* don't put this into the for loop, arity is -1 for some nodes! */
178 edges_notify_edge(res, -1, res->in[0], NULL, irg);
179 for (i = 1; i <= arity; ++i)
180 edges_notify_edge(res, i - 1, res->in[i], NULL, irg);
182 hook_new_node(irg, res);
183 if (get_irg_phase_state(irg) == phase_backend) {
184 be_info_new_node(res);
190 /*-- getting some parameters from ir_nodes --*/
192 int (is_ir_node)(const void *thing) {
193 return _is_ir_node(thing);
196 int (get_irn_intra_arity)(const ir_node *node) {
197 return _get_irn_intra_arity(node);
200 int (get_irn_inter_arity)(const ir_node *node) {
201 return _get_irn_inter_arity(node);
204 int (*_get_irn_arity)(const ir_node *node) = _get_irn_intra_arity;
206 int (get_irn_arity)(const ir_node *node) {
207 return _get_irn_arity(node);
210 /* Returns the array with ins. This array is shifted with respect to the
211 array accessed by get_irn_n: The block operand is at position 0 not -1.
212 (@@@ This should be changed.)
213 The order of the predecessors in this array is not guaranteed, except that
214 lists of operands as predecessors of Block or arguments of a Call are
216 ir_node **get_irn_in(const ir_node *node) {
218 #ifdef INTERPROCEDURAL_VIEW
219 if (get_interprocedural_view()) { /* handle Filter and Block specially */
220 if (get_irn_opcode(node) == iro_Filter) {
221 assert(node->attr.filter.in_cg);
222 return node->attr.filter.in_cg;
223 } else if (get_irn_opcode(node) == iro_Block && node->attr.block.in_cg) {
224 return node->attr.block.in_cg;
226 /* else fall through */
228 #endif /* INTERPROCEDURAL_VIEW */
232 void set_irn_in(ir_node *node, int arity, ir_node **in) {
235 ir_graph *irg = current_ir_graph;
238 #ifdef INTERPROCEDURAL_VIEW
239 if (get_interprocedural_view()) { /* handle Filter and Block specially */
240 ir_opcode code = get_irn_opcode(node);
241 if (code == iro_Filter) {
242 assert(node->attr.filter.in_cg);
243 pOld_in = &node->attr.filter.in_cg;
244 } else if (code == iro_Block && node->attr.block.in_cg) {
245 pOld_in = &node->attr.block.in_cg;
250 #endif /* INTERPROCEDURAL_VIEW */
254 for (i = 0; i < arity; i++) {
255 if (i < ARR_LEN(*pOld_in)-1)
256 edges_notify_edge(node, i, in[i], (*pOld_in)[i+1], irg);
258 edges_notify_edge(node, i, in[i], NULL, irg);
260 for (;i < ARR_LEN(*pOld_in)-1; i++) {
261 edges_notify_edge(node, i, NULL, (*pOld_in)[i+1], irg);
264 if (arity != ARR_LEN(*pOld_in) - 1) {
265 ir_node * block = (*pOld_in)[0];
266 *pOld_in = NEW_ARR_D(ir_node *, irg->obst, arity + 1);
267 (*pOld_in)[0] = block;
269 fix_backedges(irg->obst, node);
271 memcpy((*pOld_in) + 1, in, sizeof(ir_node *) * arity);
274 ir_node *(get_irn_intra_n)(const ir_node *node, int n) {
275 return _get_irn_intra_n (node, n);
278 ir_node *(get_irn_inter_n)(const ir_node *node, int n) {
279 return _get_irn_inter_n (node, n);
282 ir_node *(*_get_irn_n)(const ir_node *node, int n) = _get_irn_intra_n;
284 ir_node *(get_irn_n)(const ir_node *node, int n) {
285 return _get_irn_n(node, n);
288 void set_irn_n(ir_node *node, int n, ir_node *in) {
289 assert(node && node->kind == k_ir_node);
291 assert(n < get_irn_arity(node));
292 assert(in && in->kind == k_ir_node);
294 if ((n == -1) && (get_irn_opcode(node) == iro_Filter)) {
295 /* Change block pred in both views! */
296 node->in[n + 1] = in;
297 assert(node->attr.filter.in_cg);
298 node->attr.filter.in_cg[n + 1] = in;
301 #ifdef INTERPROCEDURAL_VIEW
302 if (get_interprocedural_view()) { /* handle Filter and Block specially */
303 if (get_irn_opcode(node) == iro_Filter) {
304 assert(node->attr.filter.in_cg);
305 node->attr.filter.in_cg[n + 1] = in;
307 } else if (get_irn_opcode(node) == iro_Block && node->attr.block.in_cg) {
308 node->attr.block.in_cg[n + 1] = in;
311 /* else fall through */
313 #endif /* INTERPROCEDURAL_VIEW */
316 hook_set_irn_n(node, n, in, node->in[n + 1]);
318 /* Here, we rely on src and tgt being in the current ir graph */
319 edges_notify_edge(node, n, in, node->in[n + 1], current_ir_graph);
321 node->in[n + 1] = in;
324 int add_irn_n(ir_node *node, ir_node *in) {
326 ir_graph *irg = get_irn_irg(node);
328 assert(node->op->opar == oparity_dynamic);
329 pos = ARR_LEN(node->in) - 1;
330 ARR_APP1(ir_node *, node->in, in);
331 edges_notify_edge(node, pos, node->in[pos + 1], NULL, irg);
334 hook_set_irn_n(node, pos, node->in[pos + 1], NULL);
339 void del_Sync_n(ir_node *n, int i)
341 int arity = get_Sync_n_preds(n);
342 ir_node *last_pred = get_Sync_pred(n, arity - 1);
343 set_Sync_pred(n, i, last_pred);
344 edges_notify_edge(n, arity - 1, NULL, last_pred, get_irn_irg(n));
345 ARR_SHRINKLEN(get_irn_in(n), arity);
348 int (get_irn_deps)(const ir_node *node) {
349 return _get_irn_deps(node);
352 ir_node *(get_irn_dep)(const ir_node *node, int pos) {
353 return _get_irn_dep(node, pos);
356 void (set_irn_dep)(ir_node *node, int pos, ir_node *dep) {
357 _set_irn_dep(node, pos, dep);
360 int add_irn_dep(ir_node *node, ir_node *dep) {
363 /* DEP edges are only allowed in backend phase */
364 assert(get_irg_phase_state(get_irn_irg(node)) == phase_backend);
365 if (node->deps == NULL) {
366 node->deps = NEW_ARR_F(ir_node *, 1);
372 for(i = 0, n = ARR_LEN(node->deps); i < n; ++i) {
373 if(node->deps[i] == NULL)
376 if(node->deps[i] == dep)
380 if (first_zero >= 0) {
381 node->deps[first_zero] = dep;
384 ARR_APP1(ir_node *, node->deps, dep);
389 edges_notify_edge_kind(node, res, dep, NULL, EDGE_KIND_DEP, get_irn_irg(node));
394 void add_irn_deps(ir_node *tgt, ir_node *src) {
397 for (i = 0, n = get_irn_deps(src); i < n; ++i)
398 add_irn_dep(tgt, get_irn_dep(src, i));
402 ir_mode *(get_irn_mode)(const ir_node *node) {
403 return _get_irn_mode(node);
406 void (set_irn_mode)(ir_node *node, ir_mode *mode) {
407 _set_irn_mode(node, mode);
410 ir_modecode get_irn_modecode(const ir_node *node) {
412 return node->mode->code;
415 /** Gets the string representation of the mode .*/
416 const char *get_irn_modename(const ir_node *node) {
418 return get_mode_name(node->mode);
421 ident *get_irn_modeident(const ir_node *node) {
423 return get_mode_ident(node->mode);
426 ir_op *(get_irn_op)(const ir_node *node) {
427 return _get_irn_op(node);
430 /* should be private to the library: */
431 void (set_irn_op)(ir_node *node, ir_op *op) {
432 _set_irn_op(node, op);
435 unsigned (get_irn_opcode)(const ir_node *node) {
436 return _get_irn_opcode(node);
439 const char *get_irn_opname(const ir_node *node) {
441 if (is_Phi0(node)) return "Phi0";
442 return get_id_str(node->op->name);
445 ident *get_irn_opident(const ir_node *node) {
447 return node->op->name;
450 ir_visited_t (get_irn_visited)(const ir_node *node) {
451 return _get_irn_visited(node);
454 void (set_irn_visited)(ir_node *node, ir_visited_t visited) {
455 _set_irn_visited(node, visited);
458 void (mark_irn_visited)(ir_node *node) {
459 _mark_irn_visited(node);
462 int (irn_visited)(const ir_node *node) {
463 return _irn_visited(node);
466 int (irn_visited_else_mark)(ir_node *node) {
467 return _irn_visited_else_mark(node);
470 void (set_irn_link)(ir_node *node, void *link) {
471 _set_irn_link(node, link);
474 void *(get_irn_link)(const ir_node *node) {
475 return _get_irn_link(node);
478 op_pin_state (get_irn_pinned)(const ir_node *node) {
479 return _get_irn_pinned(node);
482 op_pin_state (is_irn_pinned_in_irg) (const ir_node *node) {
483 return _is_irn_pinned_in_irg(node);
486 void set_irn_pinned(ir_node *node, op_pin_state state) {
487 /* due to optimization an opt may be turned into a Tuple */
491 assert(node && get_op_pinned(get_irn_op(node)) >= op_pin_state_exc_pinned);
492 assert(state == op_pin_state_pinned || state == op_pin_state_floats);
494 node->attr.except.pin_state = state;
497 /* Outputs a unique number for this node */
498 long get_irn_node_nr(const ir_node *node) {
501 return node->node_nr;
503 return (long)PTR_TO_INT(node);
507 const_attr *get_irn_const_attr(ir_node *node) {
508 assert(is_Const(node));
509 return &node->attr.con;
512 long get_irn_proj_attr(ir_node *node) {
513 /* BEWARE: check for true Proj node here, no Filter */
514 assert(node->op == op_Proj);
515 return node->attr.proj;
518 alloc_attr *get_irn_alloc_attr(ir_node *node) {
519 assert(is_Alloc(node));
520 return &node->attr.alloc;
523 free_attr *get_irn_free_attr(ir_node *node) {
524 assert(is_Free(node));
525 return &node->attr.free;
528 symconst_attr *get_irn_symconst_attr(ir_node *node) {
529 assert(is_SymConst(node));
530 return &node->attr.symc;
533 ir_type *get_irn_call_attr(ir_node *node) {
534 assert(is_Call(node));
535 return node->attr.call.cld_tp = skip_tid(node->attr.call.cld_tp);
538 sel_attr *get_irn_sel_attr(ir_node *node) {
539 assert(is_Sel(node));
540 return &node->attr.sel;
543 phi_attr *get_irn_phi_attr(ir_node *node) {
544 return &node->attr.phi;
547 block_attr *get_irn_block_attr(ir_node *node) {
548 assert(is_Block(node));
549 return &node->attr.block;
552 load_attr *get_irn_load_attr(ir_node *node) {
553 assert(is_Load(node));
554 return &node->attr.load;
557 store_attr *get_irn_store_attr(ir_node *node) {
558 assert(is_Store(node));
559 return &node->attr.store;
562 except_attr *get_irn_except_attr(ir_node *node) {
563 assert(node->op == op_Div || node->op == op_Quot ||
564 node->op == op_DivMod || node->op == op_Mod || node->op == op_Call || node->op == op_Alloc || node->op == op_Bound);
565 return &node->attr.except;
568 divmod_attr *get_irn_divmod_attr(ir_node *node) {
569 assert(node->op == op_Div || node->op == op_Quot ||
570 node->op == op_DivMod || node->op == op_Mod);
571 return &node->attr.divmod;
574 builtin_attr *get_irn_builtin_attr(ir_node *node) {
575 assert(is_Builtin(node));
576 return &node->attr.builtin;
579 void *(get_irn_generic_attr)(ir_node *node) {
580 assert(is_ir_node(node));
581 return _get_irn_generic_attr(node);
584 const void *(get_irn_generic_attr_const)(const ir_node *node) {
585 assert(is_ir_node(node));
586 return _get_irn_generic_attr_const(node);
589 unsigned (get_irn_idx)(const ir_node *node) {
590 assert(is_ir_node(node));
591 return _get_irn_idx(node);
594 int get_irn_pred_pos(ir_node *node, ir_node *arg) {
596 for (i = get_irn_arity(node) - 1; i >= 0; i--) {
597 if (get_irn_n(node, i) == arg)
603 /** manipulate fields of individual nodes **/
605 /* this works for all except Block */
606 ir_node *get_nodes_block(const ir_node *node) {
607 assert(node->op != op_Block);
608 return get_irn_n(node, -1);
611 void set_nodes_block(ir_node *node, ir_node *block) {
612 assert(node->op != op_Block);
613 set_irn_n(node, -1, block);
616 /* this works for all except Block */
617 ir_node *get_nodes_MacroBlock(const ir_node *node) {
618 assert(node->op != op_Block);
619 return get_Block_MacroBlock(get_irn_n(node, -1));
622 /* Test whether arbitrary node is frame pointer, i.e. Proj(pn_Start_P_frame_base)
623 * from Start. If so returns frame type, else Null. */
624 ir_type *is_frame_pointer(const ir_node *n) {
625 if (is_Proj(n) && (get_Proj_proj(n) == pn_Start_P_frame_base)) {
626 ir_node *start = get_Proj_pred(n);
627 if (is_Start(start)) {
628 return get_irg_frame_type(get_irn_irg(start));
634 /* Test whether arbitrary node is tls pointer, i.e. Proj(pn_Start_P_tls)
635 * from Start. If so returns tls type, else Null. */
636 ir_type *is_tls_pointer(const ir_node *n) {
637 if (is_Proj(n) && (get_Proj_proj(n) == pn_Start_P_tls)) {
638 ir_node *start = get_Proj_pred(n);
639 if (is_Start(start)) {
640 return get_tls_type();
646 /* Test whether arbitrary node is value arg base, i.e. Proj(pn_Start_P_value_arg_base)
647 * from Start. If so returns 1, else 0. */
648 int is_value_arg_pointer(const ir_node *n) {
650 (get_Proj_proj(n) == pn_Start_P_value_arg_base) &&
651 is_Start(get_Proj_pred(n)))
656 /* Returns an array with the predecessors of the Block. Depending on
657 the implementation of the graph data structure this can be a copy of
658 the internal representation of predecessors as well as the internal
659 array itself. Therefore writing to this array might obstruct the ir. */
660 ir_node **get_Block_cfgpred_arr(ir_node *node) {
661 assert(is_Block(node));
662 return (ir_node **)&(get_irn_in(node)[1]);
665 int (get_Block_n_cfgpreds)(const ir_node *node) {
666 return _get_Block_n_cfgpreds(node);
669 ir_node *(get_Block_cfgpred)(const ir_node *node, int pos) {
670 return _get_Block_cfgpred(node, pos);
673 void set_Block_cfgpred(ir_node *node, int pos, ir_node *pred) {
674 assert(is_Block(node));
675 set_irn_n(node, pos, pred);
678 ir_node *(get_Block_cfgpred_block)(const ir_node *node, int pos) {
679 return _get_Block_cfgpred_block(node, pos);
682 int get_Block_matured(const ir_node *node) {
683 assert(is_Block(node));
684 return (int)node->attr.block.is_matured;
687 void set_Block_matured(ir_node *node, int matured) {
688 assert(is_Block(node));
689 node->attr.block.is_matured = matured;
692 ir_visited_t (get_Block_block_visited)(const ir_node *node) {
693 return _get_Block_block_visited(node);
696 void (set_Block_block_visited)(ir_node *node, ir_visited_t visit) {
697 _set_Block_block_visited(node, visit);
700 /* For this current_ir_graph must be set. */
701 void (mark_Block_block_visited)(ir_node *node) {
702 _mark_Block_block_visited(node);
705 int (Block_block_visited)(const ir_node *node) {
706 return _Block_block_visited(node);
709 ir_node *get_Block_graph_arr(ir_node *node, int pos) {
710 assert(is_Block(node));
711 return node->attr.block.graph_arr[pos+1];
714 void set_Block_graph_arr(ir_node *node, int pos, ir_node *value) {
715 assert(is_Block(node));
716 node->attr.block.graph_arr[pos+1] = value;
719 #ifdef INTERPROCEDURAL_VIEW
720 void set_Block_cg_cfgpred_arr(ir_node *node, int arity, ir_node *in[]) {
721 assert(is_Block(node));
722 if (node->attr.block.in_cg == NULL || arity != ARR_LEN(node->attr.block.in_cg) - 1) {
723 node->attr.block.in_cg = NEW_ARR_D(ir_node *, current_ir_graph->obst, arity + 1);
724 node->attr.block.in_cg[0] = NULL;
725 node->attr.block.cg_backedge = new_backedge_arr(current_ir_graph->obst, arity);
727 /* Fix backedge array. fix_backedges() operates depending on
728 interprocedural_view. */
729 int ipv = get_interprocedural_view();
730 set_interprocedural_view(1);
731 fix_backedges(current_ir_graph->obst, node);
732 set_interprocedural_view(ipv);
735 memcpy(node->attr.block.in_cg + 1, in, sizeof(ir_node *) * arity);
738 void set_Block_cg_cfgpred(ir_node *node, int pos, ir_node *pred) {
739 assert(is_Block(node) && node->attr.block.in_cg &&
740 0 <= pos && pos < ARR_LEN(node->attr.block.in_cg) - 1);
741 node->attr.block.in_cg[pos + 1] = pred;
744 ir_node **get_Block_cg_cfgpred_arr(ir_node *node) {
745 assert(is_Block(node));
746 return node->attr.block.in_cg == NULL ? NULL : node->attr.block.in_cg + 1;
749 int get_Block_cg_n_cfgpreds(const ir_node *node) {
750 assert(is_Block(node));
751 return node->attr.block.in_cg == NULL ? 0 : ARR_LEN(node->attr.block.in_cg) - 1;
754 ir_node *get_Block_cg_cfgpred(const ir_node *node, int pos) {
755 assert(is_Block(node) && node->attr.block.in_cg);
756 return node->attr.block.in_cg[pos + 1];
759 void remove_Block_cg_cfgpred_arr(ir_node *node) {
760 assert(is_Block(node));
761 node->attr.block.in_cg = NULL;
763 #endif /* INTERPROCEDURAL_VIEW */
765 ir_node *(set_Block_dead)(ir_node *block) {
766 return _set_Block_dead(block);
769 int (is_Block_dead)(const ir_node *block) {
770 return _is_Block_dead(block);
773 ir_extblk *get_Block_extbb(const ir_node *block) {
775 assert(is_Block(block));
776 res = block->attr.block.extblk;
777 assert(res == NULL || is_ir_extbb(res));
781 void set_Block_extbb(ir_node *block, ir_extblk *extblk) {
782 assert(is_Block(block));
783 assert(extblk == NULL || is_ir_extbb(extblk));
784 block->attr.block.extblk = extblk;
787 /* Returns the macro block header of a block.*/
788 ir_node *get_Block_MacroBlock(const ir_node *block) {
790 assert(is_Block(block));
791 mbh = get_irn_n(block, -1);
792 /* once macro block header is respected by all optimizations,
793 this assert can be removed */
798 /* Sets the macro block header of a block. */
799 void set_Block_MacroBlock(ir_node *block, ir_node *mbh) {
800 assert(is_Block(block));
801 assert(is_Block(mbh));
802 set_irn_n(block, -1, mbh);
805 /* returns the macro block header of a node. */
806 ir_node *get_irn_MacroBlock(const ir_node *n) {
808 n = get_nodes_block(n);
809 /* if the Block is Bad, do NOT try to get it's MB, it will fail. */
813 return get_Block_MacroBlock(n);
816 /* returns the graph of a Block. */
817 ir_graph *get_Block_irg(const ir_node *block) {
818 assert(is_Block(block));
819 return block->attr.block.irg;
822 int has_Block_label(const ir_node *block) {
823 assert(is_Block(block));
824 return block->attr.block.has_label;
827 ir_label_t get_Block_label(const ir_node *block) {
828 assert(is_Block(block));
829 return block->attr.block.label;
832 void set_Block_label(ir_node *block, ir_label_t label) {
833 assert(is_Block(block));
834 block->attr.block.has_label = 1;
835 block->attr.block.label = label;
838 ir_node *(get_Block_phis)(const ir_node *block) {
839 return _get_Block_phis(block);
842 void (set_Block_phis)(ir_node *block, ir_node *phi) {
843 _set_Block_phis(block, phi);
846 void (add_Block_phi)(ir_node *block, ir_node *phi) {
847 _add_Block_phi(block, phi);
850 /* Get the Block mark (single bit). */
851 unsigned (get_Block_mark)(const ir_node *block) {
852 return _get_Block_mark(block);
855 /* Set the Block mark (single bit). */
856 void (set_Block_mark)(ir_node *block, unsigned mark) {
857 _set_Block_mark(block, mark);
860 int get_End_n_keepalives(const ir_node *end) {
862 return (get_irn_arity(end) - END_KEEPALIVE_OFFSET);
865 ir_node *get_End_keepalive(const ir_node *end, int pos) {
867 return get_irn_n(end, pos + END_KEEPALIVE_OFFSET);
870 void add_End_keepalive(ir_node *end, ir_node *ka) {
875 void set_End_keepalive(ir_node *end, int pos, ir_node *ka) {
877 set_irn_n(end, pos + END_KEEPALIVE_OFFSET, ka);
880 /* Set new keep-alives */
881 void set_End_keepalives(ir_node *end, int n, ir_node *in[]) {
883 ir_graph *irg = get_irn_irg(end);
885 /* notify that edges are deleted */
886 for (i = END_KEEPALIVE_OFFSET; i < ARR_LEN(end->in) - 1; ++i) {
887 edges_notify_edge(end, i, NULL, end->in[i + 1], irg);
889 ARR_RESIZE(ir_node *, end->in, n + 1 + END_KEEPALIVE_OFFSET);
891 for (i = 0; i < n; ++i) {
892 end->in[1 + END_KEEPALIVE_OFFSET + i] = in[i];
893 edges_notify_edge(end, END_KEEPALIVE_OFFSET + i, end->in[1 + END_KEEPALIVE_OFFSET + i], NULL, irg);
897 /* Set new keep-alives from old keep-alives, skipping irn */
898 void remove_End_keepalive(ir_node *end, ir_node *irn) {
899 int n = get_End_n_keepalives(end);
904 for (i = n -1; i >= 0; --i) {
905 ir_node *old_ka = end->in[1 + END_KEEPALIVE_OFFSET + i];
915 irg = get_irn_irg(end);
917 /* remove the edge */
918 edges_notify_edge(end, idx, NULL, irn, irg);
921 /* exchange with the last one */
922 ir_node *old = end->in[1 + END_KEEPALIVE_OFFSET + n - 1];
923 edges_notify_edge(end, n - 1, NULL, old, irg);
924 end->in[1 + END_KEEPALIVE_OFFSET + idx] = old;
925 edges_notify_edge(end, idx, old, NULL, irg);
927 /* now n - 1 keeps, 1 block input */
928 ARR_RESIZE(ir_node *, end->in, (n - 1) + 1 + END_KEEPALIVE_OFFSET);
931 /* remove Bads, NoMems and doublets from the keep-alive set */
932 void remove_End_Bads_and_doublets(ir_node *end) {
934 int idx, n = get_End_n_keepalives(end);
940 irg = get_irn_irg(end);
941 pset_new_init(&keeps);
943 for (idx = n - 1; idx >= 0; --idx) {
944 ir_node *ka = get_End_keepalive(end, idx);
946 if (is_Bad(ka) || is_NoMem(ka) || pset_new_contains(&keeps, ka)) {
947 /* remove the edge */
948 edges_notify_edge(end, idx, NULL, ka, irg);
951 /* exchange with the last one */
952 ir_node *old = end->in[1 + END_KEEPALIVE_OFFSET + n - 1];
953 edges_notify_edge(end, n - 1, NULL, old, irg);
954 end->in[1 + END_KEEPALIVE_OFFSET + idx] = old;
955 edges_notify_edge(end, idx, old, NULL, irg);
959 pset_new_insert(&keeps, ka);
962 /* n keeps, 1 block input */
963 ARR_RESIZE(ir_node *, end->in, n + 1 + END_KEEPALIVE_OFFSET);
965 pset_new_destroy(&keeps);
968 void free_End(ir_node *end) {
972 end->in = NULL; /* @@@ make sure we get an error if we use the
973 in array afterwards ... */
976 /* Return the target address of an IJmp */
977 ir_node *get_IJmp_target(const ir_node *ijmp) {
978 assert(is_IJmp(ijmp));
979 return get_irn_n(ijmp, 0);
982 /** Sets the target address of an IJmp */
983 void set_IJmp_target(ir_node *ijmp, ir_node *tgt) {
984 assert(is_IJmp(ijmp));
985 set_irn_n(ijmp, 0, tgt);
989 > Implementing the case construct (which is where the constant Proj node is
990 > important) involves far more than simply determining the constant values.
991 > We could argue that this is more properly a function of the translator from
992 > Firm to the target machine. That could be done if there was some way of
993 > projecting "default" out of the Cond node.
994 I know it's complicated.
995 Basically there are two problems:
996 - determining the gaps between the Projs
997 - determining the biggest case constant to know the proj number for
999 I see several solutions:
1000 1. Introduce a ProjDefault node. Solves both problems.
1001 This means to extend all optimizations executed during construction.
1002 2. Give the Cond node for switch two flavors:
1003 a) there are no gaps in the Projs (existing flavor)
1004 b) gaps may exist, default proj is still the Proj with the largest
1005 projection number. This covers also the gaps.
1006 3. Fix the semantic of the Cond to that of 2b)
1008 Solution 2 seems to be the best:
1009 Computing the gaps in the Firm representation is not too hard, i.e.,
1010 libFIRM can implement a routine that transforms between the two
1011 flavours. This is also possible for 1) but 2) does not require to
1012 change any existing optimization.
1013 Further it should be far simpler to determine the biggest constant than
1014 to compute all gaps.
1015 I don't want to choose 3) as 2a) seems to have advantages for
1016 dataflow analysis and 3) does not allow to convert the representation to
1020 get_Cond_selector(const ir_node *node) {
1021 assert(is_Cond(node));
1022 return get_irn_n(node, 0);
1026 set_Cond_selector(ir_node *node, ir_node *selector) {
1027 assert(is_Cond(node));
1028 set_irn_n(node, 0, selector);
1032 get_Cond_kind(const ir_node *node) {
1033 assert(is_Cond(node));
1034 return node->attr.cond.kind;
1038 set_Cond_kind(ir_node *node, cond_kind kind) {
1039 assert(is_Cond(node));
1040 node->attr.cond.kind = kind;
1044 get_Cond_defaultProj(const ir_node *node) {
1045 assert(is_Cond(node));
1046 return node->attr.cond.default_proj;
1050 get_Return_mem(const ir_node *node) {
1051 assert(is_Return(node));
1052 return get_irn_n(node, 0);
1056 set_Return_mem(ir_node *node, ir_node *mem) {
1057 assert(is_Return(node));
1058 set_irn_n(node, 0, mem);
1062 get_Return_n_ress(const ir_node *node) {
1063 assert(is_Return(node));
1064 return (get_irn_arity(node) - RETURN_RESULT_OFFSET);
1068 get_Return_res_arr(ir_node *node) {
1069 assert(is_Return(node));
1070 if (get_Return_n_ress(node) > 0)
1071 return (ir_node **)&(get_irn_in(node)[1 + RETURN_RESULT_OFFSET]);
1078 set_Return_n_res(ir_node *node, int results) {
1079 assert(is_Return(node));
1084 get_Return_res(const ir_node *node, int pos) {
1085 assert(is_Return(node));
1086 assert(get_Return_n_ress(node) > pos);
1087 return get_irn_n(node, pos + RETURN_RESULT_OFFSET);
1091 set_Return_res(ir_node *node, int pos, ir_node *res){
1092 assert(is_Return(node));
1093 set_irn_n(node, pos + RETURN_RESULT_OFFSET, res);
1096 tarval *(get_Const_tarval)(const ir_node *node) {
1097 return _get_Const_tarval(node);
1101 set_Const_tarval(ir_node *node, tarval *con) {
1102 assert(is_Const(node));
1103 node->attr.con.tv = con;
1106 int (is_Const_null)(const ir_node *node) {
1107 return _is_Const_null(node);
1110 int (is_Const_one)(const ir_node *node) {
1111 return _is_Const_one(node);
1114 int (is_Const_all_one)(const ir_node *node) {
1115 return _is_Const_all_one(node);
1119 /* The source language type. Must be an atomic type. Mode of type must
1120 be mode of node. For tarvals from entities type must be pointer to
1123 get_Const_type(ir_node *node) {
1124 assert(is_Const(node));
1125 node->attr.con.tp = skip_tid(node->attr.con.tp);
1126 return node->attr.con.tp;
1130 set_Const_type(ir_node *node, ir_type *tp) {
1131 assert(is_Const(node));
1132 if (tp != firm_unknown_type) {
1133 assert(is_atomic_type(tp));
1134 assert(get_type_mode(tp) == get_irn_mode(node));
1136 node->attr.con.tp = tp;
1141 get_SymConst_kind(const ir_node *node) {
1142 assert(is_SymConst(node));
1143 return node->attr.symc.kind;
1147 set_SymConst_kind(ir_node *node, symconst_kind kind) {
1148 assert(is_SymConst(node));
1149 node->attr.symc.kind = kind;
1153 get_SymConst_type(const ir_node *node) {
1154 /* the cast here is annoying, but we have to compensate for
1156 ir_node *irn = (ir_node *)node;
1157 assert(is_SymConst(node) &&
1158 (SYMCONST_HAS_TYPE(get_SymConst_kind(node))));
1159 return irn->attr.symc.sym.type_p = skip_tid(irn->attr.symc.sym.type_p);
1163 set_SymConst_type(ir_node *node, ir_type *tp) {
1164 assert(is_SymConst(node) &&
1165 (SYMCONST_HAS_TYPE(get_SymConst_kind(node))));
1166 node->attr.symc.sym.type_p = tp;
1170 get_SymConst_name(const ir_node *node) {
1171 assert(is_SymConst(node) && SYMCONST_HAS_ID(get_SymConst_kind(node)));
1172 return node->attr.symc.sym.ident_p;
1176 set_SymConst_name(ir_node *node, ident *name) {
1177 assert(is_SymConst(node) && SYMCONST_HAS_ID(get_SymConst_kind(node)));
1178 node->attr.symc.sym.ident_p = name;
1182 /* Only to access SymConst of kind symconst_addr_ent. Else assertion: */
1183 ir_entity *get_SymConst_entity(const ir_node *node) {
1184 assert(is_SymConst(node) && SYMCONST_HAS_ENT(get_SymConst_kind(node)));
1185 return node->attr.symc.sym.entity_p;
1188 void set_SymConst_entity(ir_node *node, ir_entity *ent) {
1189 assert(is_SymConst(node) && SYMCONST_HAS_ENT(get_SymConst_kind(node)));
1190 node->attr.symc.sym.entity_p = ent;
1193 ir_enum_const *get_SymConst_enum(const ir_node *node) {
1194 assert(is_SymConst(node) && SYMCONST_HAS_ENUM(get_SymConst_kind(node)));
1195 return node->attr.symc.sym.enum_p;
1198 void set_SymConst_enum(ir_node *node, ir_enum_const *ec) {
1199 assert(is_SymConst(node) && SYMCONST_HAS_ENUM(get_SymConst_kind(node)));
1200 node->attr.symc.sym.enum_p = ec;
1203 union symconst_symbol
1204 get_SymConst_symbol(const ir_node *node) {
1205 assert(is_SymConst(node));
1206 return node->attr.symc.sym;
1210 set_SymConst_symbol(ir_node *node, union symconst_symbol sym) {
1211 assert(is_SymConst(node));
1212 node->attr.symc.sym = sym;
1215 ir_label_t get_SymConst_label(const ir_node *node) {
1216 assert(is_SymConst(node) && SYMCONST_HAS_LABEL(get_SymConst_kind(node)));
1217 return node->attr.symc.sym.label;
1220 void set_SymConst_label(ir_node *node, ir_label_t label) {
1221 assert(is_SymConst(node) && SYMCONST_HAS_LABEL(get_SymConst_kind(node)));
1222 node->attr.symc.sym.label = label;
1226 get_SymConst_value_type(ir_node *node) {
1227 assert(is_SymConst(node));
1228 if (node->attr.symc.tp) node->attr.symc.tp = skip_tid(node->attr.symc.tp);
1229 return node->attr.symc.tp;
1233 set_SymConst_value_type(ir_node *node, ir_type *tp) {
1234 assert(is_SymConst(node));
1235 node->attr.symc.tp = tp;
1239 get_Sel_mem(const ir_node *node) {
1240 assert(is_Sel(node));
1241 return get_irn_n(node, 0);
1245 set_Sel_mem(ir_node *node, ir_node *mem) {
1246 assert(is_Sel(node));
1247 set_irn_n(node, 0, mem);
1251 get_Sel_ptr(const ir_node *node) {
1252 assert(is_Sel(node));
1253 return get_irn_n(node, 1);
1257 set_Sel_ptr(ir_node *node, ir_node *ptr) {
1258 assert(is_Sel(node));
1259 set_irn_n(node, 1, ptr);
1263 get_Sel_n_indexs(const ir_node *node) {
1264 assert(is_Sel(node));
1265 return (get_irn_arity(node) - SEL_INDEX_OFFSET);
1269 get_Sel_index_arr(ir_node *node) {
1270 assert(is_Sel(node));
1271 if (get_Sel_n_indexs(node) > 0)
1272 return (ir_node **)& get_irn_in(node)[SEL_INDEX_OFFSET + 1];
1278 get_Sel_index(const ir_node *node, int pos) {
1279 assert(is_Sel(node));
1280 return get_irn_n(node, pos + SEL_INDEX_OFFSET);
1284 set_Sel_index(ir_node *node, int pos, ir_node *index) {
1285 assert(is_Sel(node));
1286 set_irn_n(node, pos + SEL_INDEX_OFFSET, index);
1290 get_Sel_entity(const ir_node *node) {
1291 assert(is_Sel(node));
1292 return node->attr.sel.ent;
1295 /* need a version without const to prevent warning */
1296 static ir_entity *_get_Sel_entity(ir_node *node) {
1297 return get_Sel_entity(node);
1301 set_Sel_entity(ir_node *node, ir_entity *ent) {
1302 assert(is_Sel(node));
1303 node->attr.sel.ent = ent;
1307 /* For unary and binary arithmetic operations the access to the
1308 operands can be factored out. Left is the first, right the
1309 second arithmetic value as listed in tech report 0999-33.
1310 unops are: Minus, Abs, Not, Conv, Cast
1311 binops are: Add, Sub, Mul, Quot, DivMod, Div, Mod, And, Or, Eor, Shl,
1312 Shr, Shrs, Rotate, Cmp */
1316 get_Call_mem(const ir_node *node) {
1317 assert(is_Call(node));
1318 return get_irn_n(node, 0);
1322 set_Call_mem(ir_node *node, ir_node *mem) {
1323 assert(is_Call(node));
1324 set_irn_n(node, 0, mem);
1328 get_Call_ptr(const ir_node *node) {
1329 assert(is_Call(node));
1330 return get_irn_n(node, 1);
1334 set_Call_ptr(ir_node *node, ir_node *ptr) {
1335 assert(is_Call(node));
1336 set_irn_n(node, 1, ptr);
1340 get_Call_param_arr(ir_node *node) {
1341 assert(is_Call(node));
1342 return &get_irn_in(node)[CALL_PARAM_OFFSET + 1];
1346 get_Call_n_params(const ir_node *node) {
1347 assert(is_Call(node));
1348 return (get_irn_arity(node) - CALL_PARAM_OFFSET);
1352 get_Call_param(const ir_node *node, int pos) {
1353 assert(is_Call(node));
1354 return get_irn_n(node, pos + CALL_PARAM_OFFSET);
1358 set_Call_param(ir_node *node, int pos, ir_node *param) {
1359 assert(is_Call(node));
1360 set_irn_n(node, pos + CALL_PARAM_OFFSET, param);
1364 get_Call_type(ir_node *node) {
1365 assert(is_Call(node));
1366 return node->attr.call.cld_tp = skip_tid(node->attr.call.cld_tp);
1370 set_Call_type(ir_node *node, ir_type *tp) {
1371 assert(is_Call(node));
1372 assert((get_unknown_type() == tp) || is_Method_type(tp));
1373 node->attr.call.cld_tp = tp;
1377 get_Builtin_mem(const ir_node *node) {
1378 assert(is_Builtin(node));
1379 return get_irn_n(node, 0);
1383 set_Builin_mem(ir_node *node, ir_node *mem) {
1384 assert(is_Builtin(node));
1385 set_irn_n(node, 0, mem);
1389 get_Builtin_kind(const ir_node *node) {
1390 assert(is_Builtin(node));
1391 return node->attr.builtin.kind;
1395 set_Builtin_kind(ir_node *node, ir_builtin_kind kind) {
1396 assert(is_Builtin(node));
1397 node->attr.builtin.kind = kind;
1401 get_Builtin_param_arr(ir_node *node) {
1402 assert(is_Builtin(node));
1403 return &get_irn_in(node)[BUILDIN_PARAM_OFFSET + 1];
1407 get_Builtin_n_params(const ir_node *node) {
1408 assert(is_Builtin(node));
1409 return (get_irn_arity(node) - BUILDIN_PARAM_OFFSET);
1413 get_Builtin_param(const ir_node *node, int pos) {
1414 assert(is_Builtin(node));
1415 return get_irn_n(node, pos + BUILDIN_PARAM_OFFSET);
1419 set_Builtin_param(ir_node *node, int pos, ir_node *param) {
1420 assert(is_Builtin(node));
1421 set_irn_n(node, pos + BUILDIN_PARAM_OFFSET, param);
1425 get_Builtin_type(ir_node *node) {
1426 assert(is_Builtin(node));
1427 return node->attr.builtin.builtin_tp = skip_tid(node->attr.builtin.builtin_tp);
1431 set_Builtin_type(ir_node *node, ir_type *tp) {
1432 assert(is_Builtin(node));
1433 assert((get_unknown_type() == tp) || is_Method_type(tp));
1434 node->attr.builtin.builtin_tp = tp;
1437 /* Returns a human readable string for the ir_builtin_kind. */
1438 const char *get_builtin_kind_name(ir_builtin_kind kind) {
1439 #define X(a) case a: return #a + 6;
1442 X(ir_bk_debugbreak);
1443 X(ir_bk_return_address);
1444 X(ir_bk_frame_addess);
1460 int Call_has_callees(const ir_node *node) {
1461 assert(is_Call(node));
1462 return ((get_irg_callee_info_state(get_irn_irg(node)) != irg_callee_info_none) &&
1463 (node->attr.call.callee_arr != NULL));
1466 int get_Call_n_callees(const ir_node *node) {
1467 assert(is_Call(node) && node->attr.call.callee_arr);
1468 return ARR_LEN(node->attr.call.callee_arr);
1471 ir_entity *get_Call_callee(const ir_node *node, int pos) {
1472 assert(pos >= 0 && pos < get_Call_n_callees(node));
1473 return node->attr.call.callee_arr[pos];
1476 void set_Call_callee_arr(ir_node *node, const int n, ir_entity ** arr) {
1477 assert(is_Call(node));
1478 if (node->attr.call.callee_arr == NULL || get_Call_n_callees(node) != n) {
1479 node->attr.call.callee_arr = NEW_ARR_D(ir_entity *, current_ir_graph->obst, n);
1481 memcpy(node->attr.call.callee_arr, arr, n * sizeof(ir_entity *));
1484 void remove_Call_callee_arr(ir_node *node) {
1485 assert(is_Call(node));
1486 node->attr.call.callee_arr = NULL;
1489 ir_node *get_CallBegin_ptr(const ir_node *node) {
1490 assert(is_CallBegin(node));
1491 return get_irn_n(node, 0);
1494 void set_CallBegin_ptr(ir_node *node, ir_node *ptr) {
1495 assert(is_CallBegin(node));
1496 set_irn_n(node, 0, ptr);
1499 ir_node *get_CallBegin_call(const ir_node *node) {
1500 assert(is_CallBegin(node));
1501 return node->attr.callbegin.call;
1504 void set_CallBegin_call(ir_node *node, ir_node *call) {
1505 assert(is_CallBegin(node));
1506 node->attr.callbegin.call = call;
1510 * Returns non-zero if a Call is surely a self-recursive Call.
1511 * Beware: if this functions returns 0, the call might be self-recursive!
1513 int is_self_recursive_Call(const ir_node *call) {
1514 const ir_node *callee = get_Call_ptr(call);
1516 if (is_SymConst_addr_ent(callee)) {
1517 const ir_entity *ent = get_SymConst_entity(callee);
1518 const ir_graph *irg = get_entity_irg(ent);
1519 if (irg == get_irn_irg(call))
1526 ir_node * get_##OP##_left(const ir_node *node) { \
1527 assert(is_##OP(node)); \
1528 return get_irn_n(node, node->op->op_index); \
1530 void set_##OP##_left(ir_node *node, ir_node *left) { \
1531 assert(is_##OP(node)); \
1532 set_irn_n(node, node->op->op_index, left); \
1534 ir_node *get_##OP##_right(const ir_node *node) { \
1535 assert(is_##OP(node)); \
1536 return get_irn_n(node, node->op->op_index + 1); \
1538 void set_##OP##_right(ir_node *node, ir_node *right) { \
1539 assert(is_##OP(node)); \
1540 set_irn_n(node, node->op->op_index + 1, right); \
1544 ir_node *get_##OP##_op(const ir_node *node) { \
1545 assert(is_##OP(node)); \
1546 return get_irn_n(node, node->op->op_index); \
1548 void set_##OP##_op(ir_node *node, ir_node *op) { \
1549 assert(is_##OP(node)); \
1550 set_irn_n(node, node->op->op_index, op); \
1553 #define BINOP_MEM(OP) \
1557 get_##OP##_mem(const ir_node *node) { \
1558 assert(is_##OP(node)); \
1559 return get_irn_n(node, 0); \
1563 set_##OP##_mem(ir_node *node, ir_node *mem) { \
1564 assert(is_##OP(node)); \
1565 set_irn_n(node, 0, mem); \
1571 ir_mode *get_##OP##_resmode(const ir_node *node) { \
1572 assert(is_##OP(node)); \
1573 return node->attr.divmod.res_mode; \
1576 void set_##OP##_resmode(ir_node *node, ir_mode *mode) { \
1577 assert(is_##OP(node)); \
1578 node->attr.divmod.res_mode = mode; \
1605 int is_Div_remainderless(const ir_node *node) {
1606 assert(is_Div(node));
1607 return node->attr.divmod.no_remainder;
1610 int get_Conv_strict(const ir_node *node) {
1611 assert(is_Conv(node));
1612 return node->attr.conv.strict;
1615 void set_Conv_strict(ir_node *node, int strict_flag) {
1616 assert(is_Conv(node));
1617 node->attr.conv.strict = (char)strict_flag;
1621 get_Cast_type(ir_node *node) {
1622 assert(is_Cast(node));
1623 node->attr.cast.totype = skip_tid(node->attr.cast.totype);
1624 return node->attr.cast.totype;
1628 set_Cast_type(ir_node *node, ir_type *to_tp) {
1629 assert(is_Cast(node));
1630 node->attr.cast.totype = to_tp;
1634 /* Checks for upcast.
1636 * Returns true if the Cast node casts a class type to a super type.
1638 int is_Cast_upcast(ir_node *node) {
1639 ir_type *totype = get_Cast_type(node);
1640 ir_type *fromtype = get_irn_typeinfo_type(get_Cast_op(node));
1642 assert(get_irg_typeinfo_state(get_irn_irg(node)) == ir_typeinfo_consistent);
1645 while (is_Pointer_type(totype) && is_Pointer_type(fromtype)) {
1646 totype = get_pointer_points_to_type(totype);
1647 fromtype = get_pointer_points_to_type(fromtype);
1652 if (!is_Class_type(totype)) return 0;
1653 return is_SubClass_of(fromtype, totype);
1656 /* Checks for downcast.
1658 * Returns true if the Cast node casts a class type to a sub type.
1660 int is_Cast_downcast(ir_node *node) {
1661 ir_type *totype = get_Cast_type(node);
1662 ir_type *fromtype = get_irn_typeinfo_type(get_Cast_op(node));
1664 assert(get_irg_typeinfo_state(get_irn_irg(node)) == ir_typeinfo_consistent);
1667 while (is_Pointer_type(totype) && is_Pointer_type(fromtype)) {
1668 totype = get_pointer_points_to_type(totype);
1669 fromtype = get_pointer_points_to_type(fromtype);
1674 if (!is_Class_type(totype)) return 0;
1675 return is_SubClass_of(totype, fromtype);
1679 (is_unop)(const ir_node *node) {
1680 return _is_unop(node);
1684 get_unop_op(const ir_node *node) {
1685 if (node->op->opar == oparity_unary)
1686 return get_irn_n(node, node->op->op_index);
1688 assert(node->op->opar == oparity_unary);
1693 set_unop_op(ir_node *node, ir_node *op) {
1694 if (node->op->opar == oparity_unary)
1695 set_irn_n(node, node->op->op_index, op);
1697 assert(node->op->opar == oparity_unary);
1701 (is_binop)(const ir_node *node) {
1702 return _is_binop(node);
1706 get_binop_left(const ir_node *node) {
1707 assert(node->op->opar == oparity_binary);
1708 return get_irn_n(node, node->op->op_index);
1712 set_binop_left(ir_node *node, ir_node *left) {
1713 assert(node->op->opar == oparity_binary);
1714 set_irn_n(node, node->op->op_index, left);
1718 get_binop_right(const ir_node *node) {
1719 assert(node->op->opar == oparity_binary);
1720 return get_irn_n(node, node->op->op_index + 1);
1724 set_binop_right(ir_node *node, ir_node *right) {
1725 assert(node->op->opar == oparity_binary);
1726 set_irn_n(node, node->op->op_index + 1, right);
1730 (is_Phi)(const ir_node *n) {
1734 int is_Phi0(const ir_node *n) {
1737 return ((get_irn_op(n) == op_Phi) &&
1738 (get_irn_arity(n) == 0) &&
1739 (get_irg_phase_state(get_irn_irg(n)) == phase_building));
1743 get_Phi_preds_arr(ir_node *node) {
1744 assert(node->op == op_Phi);
1745 return (ir_node **)&(get_irn_in(node)[1]);
1749 get_Phi_n_preds(const ir_node *node) {
1750 assert(is_Phi(node) || is_Phi0(node));
1751 return (get_irn_arity(node));
1755 void set_Phi_n_preds(ir_node *node, int n_preds) {
1756 assert(node->op == op_Phi);
1761 get_Phi_pred(const ir_node *node, int pos) {
1762 assert(is_Phi(node) || is_Phi0(node));
1763 return get_irn_n(node, pos);
1767 set_Phi_pred(ir_node *node, int pos, ir_node *pred) {
1768 assert(is_Phi(node) || is_Phi0(node));
1769 set_irn_n(node, pos, pred);
1772 ir_node *(get_Phi_next)(const ir_node *phi) {
1773 return _get_Phi_next(phi);
1776 void (set_Phi_next)(ir_node *phi, ir_node *next) {
1777 _set_Phi_next(phi, next);
1780 int is_memop(const ir_node *node) {
1781 ir_opcode code = get_irn_opcode(node);
1782 return (code == iro_Load || code == iro_Store);
1785 ir_node *get_memop_mem(const ir_node *node) {
1786 assert(is_memop(node));
1787 return get_irn_n(node, 0);
1790 void set_memop_mem(ir_node *node, ir_node *mem) {
1791 assert(is_memop(node));
1792 set_irn_n(node, 0, mem);
1795 ir_node *get_memop_ptr(const ir_node *node) {
1796 assert(is_memop(node));
1797 return get_irn_n(node, 1);
1800 void set_memop_ptr(ir_node *node, ir_node *ptr) {
1801 assert(is_memop(node));
1802 set_irn_n(node, 1, ptr);
1806 get_Load_mem(const ir_node *node) {
1807 assert(is_Load(node));
1808 return get_irn_n(node, 0);
1812 set_Load_mem(ir_node *node, ir_node *mem) {
1813 assert(is_Load(node));
1814 set_irn_n(node, 0, mem);
1818 get_Load_ptr(const ir_node *node) {
1819 assert(is_Load(node));
1820 return get_irn_n(node, 1);
1824 set_Load_ptr(ir_node *node, ir_node *ptr) {
1825 assert(is_Load(node));
1826 set_irn_n(node, 1, ptr);
1830 get_Load_mode(const ir_node *node) {
1831 assert(is_Load(node));
1832 return node->attr.load.load_mode;
1836 set_Load_mode(ir_node *node, ir_mode *mode) {
1837 assert(is_Load(node));
1838 node->attr.load.load_mode = mode;
1842 get_Load_volatility(const ir_node *node) {
1843 assert(is_Load(node));
1844 return node->attr.load.volatility;
1848 set_Load_volatility(ir_node *node, ir_volatility volatility) {
1849 assert(is_Load(node));
1850 node->attr.load.volatility = volatility;
1854 get_Load_align(const ir_node *node) {
1855 assert(is_Load(node));
1856 return node->attr.load.aligned;
1860 set_Load_align(ir_node *node, ir_align align) {
1861 assert(is_Load(node));
1862 node->attr.load.aligned = align;
1867 get_Store_mem(const ir_node *node) {
1868 assert(is_Store(node));
1869 return get_irn_n(node, 0);
1873 set_Store_mem(ir_node *node, ir_node *mem) {
1874 assert(is_Store(node));
1875 set_irn_n(node, 0, mem);
1879 get_Store_ptr(const ir_node *node) {
1880 assert(is_Store(node));
1881 return get_irn_n(node, 1);
1885 set_Store_ptr(ir_node *node, ir_node *ptr) {
1886 assert(is_Store(node));
1887 set_irn_n(node, 1, ptr);
1891 get_Store_value(const ir_node *node) {
1892 assert(is_Store(node));
1893 return get_irn_n(node, 2);
1897 set_Store_value(ir_node *node, ir_node *value) {
1898 assert(is_Store(node));
1899 set_irn_n(node, 2, value);
1903 get_Store_volatility(const ir_node *node) {
1904 assert(is_Store(node));
1905 return node->attr.store.volatility;
1909 set_Store_volatility(ir_node *node, ir_volatility volatility) {
1910 assert(is_Store(node));
1911 node->attr.store.volatility = volatility;
1915 get_Store_align(const ir_node *node) {
1916 assert(is_Store(node));
1917 return node->attr.store.aligned;
1921 set_Store_align(ir_node *node, ir_align align) {
1922 assert(is_Store(node));
1923 node->attr.store.aligned = align;
1928 get_Alloc_mem(const ir_node *node) {
1929 assert(is_Alloc(node));
1930 return get_irn_n(node, 0);
1934 set_Alloc_mem(ir_node *node, ir_node *mem) {
1935 assert(is_Alloc(node));
1936 set_irn_n(node, 0, mem);
1940 get_Alloc_size(const ir_node *node) {
1941 assert(is_Alloc(node));
1942 return get_irn_n(node, 1);
1946 set_Alloc_size(ir_node *node, ir_node *size) {
1947 assert(is_Alloc(node));
1948 set_irn_n(node, 1, size);
1952 get_Alloc_type(ir_node *node) {
1953 assert(is_Alloc(node));
1954 return node->attr.alloc.type = skip_tid(node->attr.alloc.type);
1958 set_Alloc_type(ir_node *node, ir_type *tp) {
1959 assert(is_Alloc(node));
1960 node->attr.alloc.type = tp;
1964 get_Alloc_where(const ir_node *node) {
1965 assert(is_Alloc(node));
1966 return node->attr.alloc.where;
1970 set_Alloc_where(ir_node *node, ir_where_alloc where) {
1971 assert(is_Alloc(node));
1972 node->attr.alloc.where = where;
1977 get_Free_mem(const ir_node *node) {
1978 assert(is_Free(node));
1979 return get_irn_n(node, 0);
1983 set_Free_mem(ir_node *node, ir_node *mem) {
1984 assert(is_Free(node));
1985 set_irn_n(node, 0, mem);
1989 get_Free_ptr(const ir_node *node) {
1990 assert(is_Free(node));
1991 return get_irn_n(node, 1);
1995 set_Free_ptr(ir_node *node, ir_node *ptr) {
1996 assert(is_Free(node));
1997 set_irn_n(node, 1, ptr);
2001 get_Free_size(const ir_node *node) {
2002 assert(is_Free(node));
2003 return get_irn_n(node, 2);
2007 set_Free_size(ir_node *node, ir_node *size) {
2008 assert(is_Free(node));
2009 set_irn_n(node, 2, size);
2013 get_Free_type(ir_node *node) {
2014 assert(is_Free(node));
2015 return node->attr.free.type = skip_tid(node->attr.free.type);
2019 set_Free_type(ir_node *node, ir_type *tp) {
2020 assert(is_Free(node));
2021 node->attr.free.type = tp;
2025 get_Free_where(const ir_node *node) {
2026 assert(is_Free(node));
2027 return node->attr.free.where;
2031 set_Free_where(ir_node *node, ir_where_alloc where) {
2032 assert(is_Free(node));
2033 node->attr.free.where = where;
2036 ir_node **get_Sync_preds_arr(ir_node *node) {
2037 assert(is_Sync(node));
2038 return (ir_node **)&(get_irn_in(node)[1]);
2041 int get_Sync_n_preds(const ir_node *node) {
2042 assert(is_Sync(node));
2043 return (get_irn_arity(node));
2047 void set_Sync_n_preds(ir_node *node, int n_preds) {
2048 assert(is_Sync(node));
2052 ir_node *get_Sync_pred(const ir_node *node, int pos) {
2053 assert(is_Sync(node));
2054 return get_irn_n(node, pos);
2057 void set_Sync_pred(ir_node *node, int pos, ir_node *pred) {
2058 assert(is_Sync(node));
2059 set_irn_n(node, pos, pred);
2062 /* Add a new Sync predecessor */
2063 void add_Sync_pred(ir_node *node, ir_node *pred) {
2064 assert(is_Sync(node));
2065 add_irn_n(node, pred);
2068 /* Returns the source language type of a Proj node. */
2069 ir_type *get_Proj_type(ir_node *n) {
2070 ir_type *tp = firm_unknown_type;
2071 ir_node *pred = get_Proj_pred(n);
2073 switch (get_irn_opcode(pred)) {
2076 /* Deal with Start / Call here: we need to know the Proj Nr. */
2077 assert(get_irn_mode(pred) == mode_T);
2078 pred_pred = get_Proj_pred(pred);
2080 if (is_Start(pred_pred)) {
2081 ir_type *mtp = get_entity_type(get_irg_entity(get_irn_irg(pred_pred)));
2082 tp = get_method_param_type(mtp, get_Proj_proj(n));
2083 } else if (is_Call(pred_pred)) {
2084 ir_type *mtp = get_Call_type(pred_pred);
2085 tp = get_method_res_type(mtp, get_Proj_proj(n));
2088 case iro_Start: break;
2089 case iro_Call: break;
2091 ir_node *a = get_Load_ptr(pred);
2093 tp = get_entity_type(get_Sel_entity(a));
2102 get_Proj_pred(const ir_node *node) {
2103 assert(is_Proj(node));
2104 return get_irn_n(node, 0);
2108 set_Proj_pred(ir_node *node, ir_node *pred) {
2109 assert(is_Proj(node));
2110 set_irn_n(node, 0, pred);
2114 get_Proj_proj(const ir_node *node) {
2115 #ifdef INTERPROCEDURAL_VIEW
2116 ir_opcode code = get_irn_opcode(node);
2118 if (code == iro_Proj) {
2119 return node->attr.proj;
2122 assert(code == iro_Filter);
2123 return node->attr.filter.proj;
2126 assert(is_Proj(node));
2127 return node->attr.proj;
2128 #endif /* INTERPROCEDURAL_VIEW */
2132 set_Proj_proj(ir_node *node, long proj) {
2133 #ifdef INTERPROCEDURAL_VIEW
2134 ir_opcode code = get_irn_opcode(node);
2136 if (code == iro_Proj) {
2137 node->attr.proj = proj;
2140 assert(code == iro_Filter);
2141 node->attr.filter.proj = proj;
2144 assert(is_Proj(node));
2145 node->attr.proj = proj;
2146 #endif /* INTERPROCEDURAL_VIEW */
2149 /* Returns non-zero if a node is a routine parameter. */
2150 int (is_arg_Proj)(const ir_node *node) {
2151 return _is_arg_Proj(node);
2155 get_Tuple_preds_arr(ir_node *node) {
2156 assert(is_Tuple(node));
2157 return (ir_node **)&(get_irn_in(node)[1]);
2161 get_Tuple_n_preds(const ir_node *node) {
2162 assert(is_Tuple(node));
2163 return get_irn_arity(node);
2168 set_Tuple_n_preds(ir_node *node, int n_preds) {
2169 assert(is_Tuple(node));
2174 get_Tuple_pred(const ir_node *node, int pos) {
2175 assert(is_Tuple(node));
2176 return get_irn_n(node, pos);
2180 set_Tuple_pred(ir_node *node, int pos, ir_node *pred) {
2181 assert(is_Tuple(node));
2182 set_irn_n(node, pos, pred);
2186 get_Id_pred(const ir_node *node) {
2187 assert(is_Id(node));
2188 return get_irn_n(node, 0);
2192 set_Id_pred(ir_node *node, ir_node *pred) {
2193 assert(is_Id(node));
2194 set_irn_n(node, 0, pred);
2197 ir_node *get_Confirm_value(const ir_node *node) {
2198 assert(is_Confirm(node));
2199 return get_irn_n(node, 0);
2202 void set_Confirm_value(ir_node *node, ir_node *value) {
2203 assert(is_Confirm(node));
2204 set_irn_n(node, 0, value);
2207 ir_node *get_Confirm_bound(const ir_node *node) {
2208 assert(is_Confirm(node));
2209 return get_irn_n(node, 1);
2212 void set_Confirm_bound(ir_node *node, ir_node *bound) {
2213 assert(is_Confirm(node));
2214 set_irn_n(node, 0, bound);
2217 pn_Cmp get_Confirm_cmp(const ir_node *node) {
2218 assert(is_Confirm(node));
2219 return node->attr.confirm.cmp;
2222 void set_Confirm_cmp(ir_node *node, pn_Cmp cmp) {
2223 assert(is_Confirm(node));
2224 node->attr.confirm.cmp = cmp;
2228 get_Filter_pred(ir_node *node) {
2229 assert(is_Filter(node));
2234 set_Filter_pred(ir_node *node, ir_node *pred) {
2235 assert(is_Filter(node));
2240 get_Filter_proj(ir_node *node) {
2241 assert(is_Filter(node));
2242 return node->attr.filter.proj;
2246 set_Filter_proj(ir_node *node, long proj) {
2247 assert(is_Filter(node));
2248 node->attr.filter.proj = proj;
2251 /* Don't use get_irn_arity, get_irn_n in implementation as access
2252 shall work independent of view!!! */
2253 void set_Filter_cg_pred_arr(ir_node *node, int arity, ir_node ** in) {
2254 assert(is_Filter(node));
2255 if (node->attr.filter.in_cg == NULL || arity != ARR_LEN(node->attr.filter.in_cg) - 1) {
2256 ir_graph *irg = get_irn_irg(node);
2257 node->attr.filter.in_cg = NEW_ARR_D(ir_node *, current_ir_graph->obst, arity + 1);
2258 node->attr.filter.backedge = new_backedge_arr(irg->obst, arity);
2259 node->attr.filter.in_cg[0] = node->in[0];
2261 memcpy(node->attr.filter.in_cg + 1, in, sizeof(ir_node *) * arity);
2264 void set_Filter_cg_pred(ir_node * node, int pos, ir_node * pred) {
2265 assert(is_Filter(node) && node->attr.filter.in_cg &&
2266 0 <= pos && pos < ARR_LEN(node->attr.filter.in_cg) - 1);
2267 node->attr.filter.in_cg[pos + 1] = pred;
2270 int get_Filter_n_cg_preds(ir_node *node) {
2271 assert(is_Filter(node) && node->attr.filter.in_cg);
2272 return (ARR_LEN(node->attr.filter.in_cg) - 1);
2275 ir_node *get_Filter_cg_pred(ir_node *node, int pos) {
2277 assert(is_Filter(node) && node->attr.filter.in_cg &&
2279 arity = ARR_LEN(node->attr.filter.in_cg);
2280 assert(pos < arity - 1);
2281 return node->attr.filter.in_cg[pos + 1];
2285 ir_node *get_Mux_sel(const ir_node *node) {
2286 assert(is_Mux(node));
2290 void set_Mux_sel(ir_node *node, ir_node *sel) {
2291 assert(is_Mux(node));
2295 ir_node *get_Mux_false(const ir_node *node) {
2296 assert(is_Mux(node));
2300 void set_Mux_false(ir_node *node, ir_node *ir_false) {
2301 assert(is_Mux(node));
2302 node->in[2] = ir_false;
2305 ir_node *get_Mux_true(const ir_node *node) {
2306 assert(is_Mux(node));
2310 void set_Mux_true(ir_node *node, ir_node *ir_true) {
2311 assert(is_Mux(node));
2312 node->in[3] = ir_true;
2316 ir_node *get_CopyB_mem(const ir_node *node) {
2317 assert(is_CopyB(node));
2318 return get_irn_n(node, 0);
2321 void set_CopyB_mem(ir_node *node, ir_node *mem) {
2322 assert(node->op == op_CopyB);
2323 set_irn_n(node, 0, mem);
2326 ir_node *get_CopyB_dst(const ir_node *node) {
2327 assert(is_CopyB(node));
2328 return get_irn_n(node, 1);
2331 void set_CopyB_dst(ir_node *node, ir_node *dst) {
2332 assert(is_CopyB(node));
2333 set_irn_n(node, 1, dst);
2336 ir_node *get_CopyB_src(const ir_node *node) {
2337 assert(is_CopyB(node));
2338 return get_irn_n(node, 2);
2341 void set_CopyB_src(ir_node *node, ir_node *src) {
2342 assert(is_CopyB(node));
2343 set_irn_n(node, 2, src);
2346 ir_type *get_CopyB_type(ir_node *node) {
2347 assert(is_CopyB(node));
2348 return node->attr.copyb.data_type = skip_tid(node->attr.copyb.data_type);
2351 void set_CopyB_type(ir_node *node, ir_type *data_type) {
2352 assert(is_CopyB(node) && data_type);
2353 node->attr.copyb.data_type = data_type;
2358 get_InstOf_type(ir_node *node) {
2359 assert(node->op == op_InstOf);
2360 return node->attr.instof.type = skip_tid(node->attr.instof.type);
2364 set_InstOf_type(ir_node *node, ir_type *type) {
2365 assert(node->op == op_InstOf);
2366 node->attr.instof.type = type;
2370 get_InstOf_store(const ir_node *node) {
2371 assert(node->op == op_InstOf);
2372 return get_irn_n(node, 0);
2376 set_InstOf_store(ir_node *node, ir_node *obj) {
2377 assert(node->op == op_InstOf);
2378 set_irn_n(node, 0, obj);
2382 get_InstOf_obj(const ir_node *node) {
2383 assert(node->op == op_InstOf);
2384 return get_irn_n(node, 1);
2388 set_InstOf_obj(ir_node *node, ir_node *obj) {
2389 assert(node->op == op_InstOf);
2390 set_irn_n(node, 1, obj);
2393 /* Returns the memory input of a Raise operation. */
2395 get_Raise_mem(const ir_node *node) {
2396 assert(is_Raise(node));
2397 return get_irn_n(node, 0);
2401 set_Raise_mem(ir_node *node, ir_node *mem) {
2402 assert(is_Raise(node));
2403 set_irn_n(node, 0, mem);
2407 get_Raise_exo_ptr(const ir_node *node) {
2408 assert(is_Raise(node));
2409 return get_irn_n(node, 1);
2413 set_Raise_exo_ptr(ir_node *node, ir_node *exo_ptr) {
2414 assert(is_Raise(node));
2415 set_irn_n(node, 1, exo_ptr);
2420 /* Returns the memory input of a Bound operation. */
2421 ir_node *get_Bound_mem(const ir_node *bound) {
2422 assert(is_Bound(bound));
2423 return get_irn_n(bound, 0);
2426 void set_Bound_mem(ir_node *bound, ir_node *mem) {
2427 assert(is_Bound(bound));
2428 set_irn_n(bound, 0, mem);
2431 /* Returns the index input of a Bound operation. */
2432 ir_node *get_Bound_index(const ir_node *bound) {
2433 assert(is_Bound(bound));
2434 return get_irn_n(bound, 1);
2437 void set_Bound_index(ir_node *bound, ir_node *idx) {
2438 assert(is_Bound(bound));
2439 set_irn_n(bound, 1, idx);
2442 /* Returns the lower bound input of a Bound operation. */
2443 ir_node *get_Bound_lower(const ir_node *bound) {
2444 assert(is_Bound(bound));
2445 return get_irn_n(bound, 2);
2448 void set_Bound_lower(ir_node *bound, ir_node *lower) {
2449 assert(is_Bound(bound));
2450 set_irn_n(bound, 2, lower);
2453 /* Returns the upper bound input of a Bound operation. */
2454 ir_node *get_Bound_upper(const ir_node *bound) {
2455 assert(is_Bound(bound));
2456 return get_irn_n(bound, 3);
2459 void set_Bound_upper(ir_node *bound, ir_node *upper) {
2460 assert(is_Bound(bound));
2461 set_irn_n(bound, 3, upper);
2464 /* Return the operand of a Pin node. */
2465 ir_node *get_Pin_op(const ir_node *pin) {
2466 assert(is_Pin(pin));
2467 return get_irn_n(pin, 0);
2470 void set_Pin_op(ir_node *pin, ir_node *node) {
2471 assert(is_Pin(pin));
2472 set_irn_n(pin, 0, node);
2475 /* Return the assembler text of an ASM pseudo node. */
2476 ident *get_ASM_text(const ir_node *node) {
2477 assert(is_ASM(node));
2478 return node->attr.assem.asm_text;
2481 /* Return the number of input constraints for an ASM node. */
2482 int get_ASM_n_input_constraints(const ir_node *node) {
2483 assert(is_ASM(node));
2484 return ARR_LEN(node->attr.assem.inputs);
2487 /* Return the input constraints for an ASM node. This is a flexible array. */
2488 const ir_asm_constraint *get_ASM_input_constraints(const ir_node *node) {
2489 assert(is_ASM(node));
2490 return node->attr.assem.inputs;
2493 /* Return the number of output constraints for an ASM node. */
2494 int get_ASM_n_output_constraints(const ir_node *node) {
2495 assert(is_ASM(node));
2496 return ARR_LEN(node->attr.assem.outputs);
2499 /* Return the output constraints for an ASM node. */
2500 const ir_asm_constraint *get_ASM_output_constraints(const ir_node *node) {
2501 assert(is_ASM(node));
2502 return node->attr.assem.outputs;
2505 /* Return the number of clobbered registers for an ASM node. */
2506 int get_ASM_n_clobbers(const ir_node *node) {
2507 assert(is_ASM(node));
2508 return ARR_LEN(node->attr.assem.clobber);
2511 /* Return the list of clobbered registers for an ASM node. */
2512 ident **get_ASM_clobbers(const ir_node *node) {
2513 assert(is_ASM(node));
2514 return node->attr.assem.clobber;
2517 /* returns the graph of a node */
2519 get_irn_irg(const ir_node *node) {
2521 * Do not use get_nodes_Block() here, because this
2522 * will check the pinned state.
2523 * However even a 'wrong' block is always in the proper
2526 if (! is_Block(node))
2527 node = get_irn_n(node, -1);
2528 if (is_Bad(node)) /* sometimes bad is predecessor of nodes instead of block: in case of optimization */
2529 node = get_irn_n(node, -1);
2530 assert(is_Block(node));
2531 return node->attr.block.irg;
2535 /*----------------------------------------------------------------*/
2536 /* Auxiliary routines */
2537 /*----------------------------------------------------------------*/
2540 skip_Proj(ir_node *node) {
2541 /* don't assert node !!! */
2546 node = get_Proj_pred(node);
2552 skip_Proj_const(const ir_node *node) {
2553 /* don't assert node !!! */
2558 node = get_Proj_pred(node);
2564 skip_Tuple(ir_node *node) {
2569 if (is_Proj(node)) {
2570 pred = get_Proj_pred(node);
2571 op = get_irn_op(pred);
2574 * Looks strange but calls get_irn_op() only once
2575 * in most often cases.
2577 if (op == op_Proj) { /* nested Tuple ? */
2578 pred = skip_Tuple(pred);
2580 if (is_Tuple(pred)) {
2581 node = get_Tuple_pred(pred, get_Proj_proj(node));
2584 } else if (op == op_Tuple) {
2585 node = get_Tuple_pred(pred, get_Proj_proj(node));
2592 /* returns operand of node if node is a Cast */
2593 ir_node *skip_Cast(ir_node *node) {
2595 return get_Cast_op(node);
2599 /* returns operand of node if node is a Cast */
2600 const ir_node *skip_Cast_const(const ir_node *node) {
2602 return get_Cast_op(node);
2606 /* returns operand of node if node is a Pin */
2607 ir_node *skip_Pin(ir_node *node) {
2609 return get_Pin_op(node);
2613 /* returns operand of node if node is a Confirm */
2614 ir_node *skip_Confirm(ir_node *node) {
2615 if (is_Confirm(node))
2616 return get_Confirm_value(node);
2620 /* skip all high-level ops */
2621 ir_node *skip_HighLevel_ops(ir_node *node) {
2622 while (is_op_highlevel(get_irn_op(node))) {
2623 node = get_irn_n(node, 0);
2629 /* This should compact Id-cycles to self-cycles. It has the same (or less?) complexity
2630 * than any other approach, as Id chains are resolved and all point to the real node, or
2631 * all id's are self loops.
2633 * Note: This function takes 10% of mostly ANY the compiler run, so it's
2634 * a little bit "hand optimized".
2636 * Moreover, it CANNOT be switched off using get_opt_normalize() ...
2639 skip_Id(ir_node *node) {
2641 /* don't assert node !!! */
2643 if (!node || (node->op != op_Id)) return node;
2645 /* Don't use get_Id_pred(): We get into an endless loop for
2646 self-referencing Ids. */
2647 pred = node->in[0+1];
2649 if (pred->op != op_Id) return pred;
2651 if (node != pred) { /* not a self referencing Id. Resolve Id chain. */
2652 ir_node *rem_pred, *res;
2654 if (pred->op != op_Id) return pred; /* shortcut */
2657 assert(get_irn_arity (node) > 0);
2659 node->in[0+1] = node; /* turn us into a self referencing Id: shorten Id cycles. */
2660 res = skip_Id(rem_pred);
2661 if (res->op == op_Id) /* self-loop */ return node;
2663 node->in[0+1] = res; /* Turn Id chain into Ids all referencing the chain end. */
2670 void skip_Id_and_store(ir_node **node) {
2673 if (!n || (n->op != op_Id)) return;
2675 /* Don't use get_Id_pred(): We get into an endless loop for
2676 self-referencing Ids. */
2681 (is_Bad)(const ir_node *node) {
2682 return _is_Bad(node);
2686 (is_NoMem)(const ir_node *node) {
2687 return _is_NoMem(node);
2691 (is_Minus)(const ir_node *node) {
2692 return _is_Minus(node);
2696 (is_Abs)(const ir_node *node) {
2697 return _is_Abs(node);
2701 (is_Mod)(const ir_node *node) {
2702 return _is_Mod(node);
2706 (is_Div)(const ir_node *node) {
2707 return _is_Div(node);
2711 (is_DivMod)(const ir_node *node) {
2712 return _is_DivMod(node);
2716 (is_Quot)(const ir_node *node) {
2717 return _is_Quot(node);
2721 (is_Add)(const ir_node *node) {
2722 return _is_Add(node);
2726 (is_Carry)(const ir_node *node) {
2727 return _is_Carry(node);
2731 (is_And)(const ir_node *node) {
2732 return _is_And(node);
2736 (is_Or)(const ir_node *node) {
2737 return _is_Or(node);
2741 (is_Eor)(const ir_node *node) {
2742 return _is_Eor(node);
2746 (is_Sub)(const ir_node *node) {
2747 return _is_Sub(node);
2751 (is_Shl)(const ir_node *node) {
2752 return _is_Shl(node);
2756 (is_Shr)(const ir_node *node) {
2757 return _is_Shr(node);
2761 (is_Shrs)(const ir_node *node) {
2762 return _is_Shrs(node);
2766 (is_Rotl)(const ir_node *node) {
2767 return _is_Rotl(node);
2771 (is_Not)(const ir_node *node) {
2772 return _is_Not(node);
2776 (is_Id)(const ir_node *node) {
2777 return _is_Id(node);
2781 (is_Tuple)(const ir_node *node) {
2782 return _is_Tuple(node);
2786 (is_Bound)(const ir_node *node) {
2787 return _is_Bound(node);
2791 (is_Start)(const ir_node *node) {
2792 return _is_Start(node);
2796 (is_End)(const ir_node *node) {
2797 return _is_End(node);
2801 (is_Const)(const ir_node *node) {
2802 return _is_Const(node);
2806 (is_Conv)(const ir_node *node) {
2807 return _is_Conv(node);
2811 (is_strictConv)(const ir_node *node) {
2812 return _is_strictConv(node);
2816 (is_Cast)(const ir_node *node) {
2817 return _is_Cast(node);
2821 (is_no_Block)(const ir_node *node) {
2822 return _is_no_Block(node);
2826 (is_Block)(const ir_node *node) {
2827 return _is_Block(node);
2830 /* returns true if node is an Unknown node. */
2832 (is_Unknown)(const ir_node *node) {
2833 return _is_Unknown(node);
2836 /* returns true if node is a Return node. */
2838 (is_Return)(const ir_node *node) {
2839 return _is_Return(node);
2842 /* returns true if node is a Call node. */
2844 (is_Call)(const ir_node *node) {
2845 return _is_Call(node);
2848 /* returns true if node is a Builtin node. */
2850 (is_Builtin)(const ir_node *node) {
2851 return _is_Builtin(node);
2854 /* returns true if node is a CallBegin node. */
2856 (is_CallBegin)(const ir_node *node) {
2857 return _is_CallBegin(node);
2860 /* returns true if node is a Sel node. */
2862 (is_Sel)(const ir_node *node) {
2863 return _is_Sel(node);
2866 /* returns true if node is a Mux node. */
2868 (is_Mux)(const ir_node *node) {
2869 return _is_Mux(node);
2872 /* returns true if node is a Load node. */
2874 (is_Load)(const ir_node *node) {
2875 return _is_Load(node);
2878 /* returns true if node is a Load node. */
2880 (is_Store)(const ir_node *node) {
2881 return _is_Store(node);
2884 /* returns true if node is a Sync node. */
2886 (is_Sync)(const ir_node *node) {
2887 return _is_Sync(node);
2890 /* Returns true if node is a Confirm node. */
2892 (is_Confirm)(const ir_node *node) {
2893 return _is_Confirm(node);
2896 /* Returns true if node is a Pin node. */
2898 (is_Pin)(const ir_node *node) {
2899 return _is_Pin(node);
2902 /* Returns true if node is a SymConst node. */
2904 (is_SymConst)(const ir_node *node) {
2905 return _is_SymConst(node);
2908 /* Returns true if node is a SymConst node with kind symconst_addr_ent. */
2910 (is_SymConst_addr_ent)(const ir_node *node) {
2911 return _is_SymConst_addr_ent(node);
2914 /* Returns true if node is a Cond node. */
2916 (is_Cond)(const ir_node *node) {
2917 return _is_Cond(node);
2921 (is_CopyB)(const ir_node *node) {
2922 return _is_CopyB(node);
2925 /* returns true if node is a Cmp node. */
2927 (is_Cmp)(const ir_node *node) {
2928 return _is_Cmp(node);
2931 /* returns true if node is an Alloc node. */
2933 (is_Alloc)(const ir_node *node) {
2934 return _is_Alloc(node);
2937 /* returns true if node is a Free node. */
2939 (is_Free)(const ir_node *node) {
2940 return _is_Free(node);
2943 /* returns true if a node is a Jmp node. */
2945 (is_Jmp)(const ir_node *node) {
2946 return _is_Jmp(node);
2949 /* returns true if a node is a IJmp node. */
2951 (is_IJmp)(const ir_node *node) {
2952 return _is_IJmp(node);
2955 /* returns true if a node is a Raise node. */
2957 (is_Raise)(const ir_node *node) {
2958 return _is_Raise(node);
2961 /* returns true if a node is an ASM node. */
2963 (is_ASM)(const ir_node *node) {
2964 return _is_ASM(node);
2968 (is_Proj)(const ir_node *node) {
2969 return _is_Proj(node);
2972 /* Returns true if node is a Filter node. */
2974 (is_Filter)(const ir_node *node) {
2975 return _is_Filter(node);
2978 /* Returns true if the operation manipulates control flow. */
2979 int is_cfop(const ir_node *node) {
2980 return is_op_cfopcode(get_irn_op(node));
2983 /* Returns true if the operation manipulates interprocedural control flow:
2984 CallBegin, EndReg, EndExcept */
2985 int is_ip_cfop(const ir_node *node) {
2986 return is_ip_cfopcode(get_irn_op(node));
2989 /* Returns true if the operation can change the control flow because
2992 is_fragile_op(const ir_node *node) {
2993 return is_op_fragile(get_irn_op(node));
2996 /* Returns the memory operand of fragile operations. */
2997 ir_node *get_fragile_op_mem(ir_node *node) {
2998 assert(node && is_fragile_op(node));
3000 switch (get_irn_opcode(node)) {
3011 return get_irn_n(node, pn_Generic_M_regular);
3016 assert(0 && "should not be reached");
3021 /* Returns the result mode of a Div operation. */
3022 ir_mode *get_divop_resmod(const ir_node *node) {
3023 switch (get_irn_opcode(node)) {
3024 case iro_Quot : return get_Quot_resmode(node);
3025 case iro_DivMod: return get_DivMod_resmode(node);
3026 case iro_Div : return get_Div_resmode(node);
3027 case iro_Mod : return get_Mod_resmode(node);
3029 assert(0 && "should not be reached");
3034 /* Returns true if the operation is a forking control flow operation. */
3035 int (is_irn_forking)(const ir_node *node) {
3036 return _is_irn_forking(node);
3039 /* Return the type associated with the value produced by n
3040 * if the node remarks this type as it is the case for
3041 * Cast, Const, SymConst and some Proj nodes. */
3042 ir_type *(get_irn_type)(ir_node *node) {
3043 return _get_irn_type(node);
3046 /* Return the type attribute of a node n (SymConst, Call, Alloc, Free,
3048 ir_type *(get_irn_type_attr)(ir_node *node) {
3049 return _get_irn_type_attr(node);
3052 /* Return the entity attribute of a node n (SymConst, Sel) or NULL. */
3053 ir_entity *(get_irn_entity_attr)(ir_node *node) {
3054 return _get_irn_entity_attr(node);
3057 /* Returns non-zero for constant-like nodes. */
3058 int (is_irn_constlike)(const ir_node *node) {
3059 return _is_irn_constlike(node);
3063 * Returns non-zero for nodes that are allowed to have keep-alives and
3064 * are neither Block nor PhiM.
3066 int (is_irn_keep)(const ir_node *node) {
3067 return _is_irn_keep(node);
3071 * Returns non-zero for nodes that are always placed in the start block.
3073 int (is_irn_start_block_placed)(const ir_node *node) {
3074 return _is_irn_start_block_placed(node);
3077 /* Returns non-zero for nodes that are machine operations. */
3078 int (is_irn_machine_op)(const ir_node *node) {
3079 return _is_irn_machine_op(node);
3082 /* Returns non-zero for nodes that are machine operands. */
3083 int (is_irn_machine_operand)(const ir_node *node) {
3084 return _is_irn_machine_operand(node);
3087 /* Returns non-zero for nodes that have the n'th user machine flag set. */
3088 int (is_irn_machine_user)(const ir_node *node, unsigned n) {
3089 return _is_irn_machine_user(node, n);
3093 /* Gets the string representation of the jump prediction .*/
3094 const char *get_cond_jmp_predicate_name(cond_jmp_predicate pred) {
3097 case COND_JMP_PRED_NONE: return "no prediction";
3098 case COND_JMP_PRED_TRUE: return "true taken";
3099 case COND_JMP_PRED_FALSE: return "false taken";
3103 /* Returns the conditional jump prediction of a Cond node. */
3104 cond_jmp_predicate (get_Cond_jmp_pred)(const ir_node *cond) {
3105 return _get_Cond_jmp_pred(cond);
3108 /* Sets a new conditional jump prediction. */
3109 void (set_Cond_jmp_pred)(ir_node *cond, cond_jmp_predicate pred) {
3110 _set_Cond_jmp_pred(cond, pred);
3113 /** the get_type operation must be always implemented and return a firm type */
3114 static ir_type *get_Default_type(ir_node *n) {
3116 return get_unknown_type();
3119 /* Sets the get_type operation for an ir_op_ops. */
3120 ir_op_ops *firm_set_default_get_type(ir_opcode code, ir_op_ops *ops) {
3122 case iro_Const: ops->get_type = get_Const_type; break;
3123 case iro_SymConst: ops->get_type = get_SymConst_value_type; break;
3124 case iro_Cast: ops->get_type = get_Cast_type; break;
3125 case iro_Proj: ops->get_type = get_Proj_type; break;
3127 /* not allowed to be NULL */
3128 if (! ops->get_type)
3129 ops->get_type = get_Default_type;
3135 /** Return the attribute type of a SymConst node if exists */
3136 static ir_type *get_SymConst_attr_type(ir_node *self) {
3137 symconst_kind kind = get_SymConst_kind(self);
3138 if (SYMCONST_HAS_TYPE(kind))
3139 return get_SymConst_type(self);
3143 /** Return the attribute entity of a SymConst node if exists */
3144 static ir_entity *get_SymConst_attr_entity(ir_node *self) {
3145 symconst_kind kind = get_SymConst_kind(self);
3146 if (SYMCONST_HAS_ENT(kind))
3147 return get_SymConst_entity(self);
3151 /** the get_type_attr operation must be always implemented */
3152 static ir_type *get_Null_type(ir_node *n) {
3154 return firm_unknown_type;
3157 /* Sets the get_type operation for an ir_op_ops. */
3158 ir_op_ops *firm_set_default_get_type_attr(ir_opcode code, ir_op_ops *ops) {
3160 case iro_SymConst: ops->get_type_attr = get_SymConst_attr_type; break;
3161 case iro_Call: ops->get_type_attr = get_Call_type; break;
3162 case iro_Alloc: ops->get_type_attr = get_Alloc_type; break;
3163 case iro_Free: ops->get_type_attr = get_Free_type; break;
3164 case iro_Cast: ops->get_type_attr = get_Cast_type; break;
3166 /* not allowed to be NULL */
3167 if (! ops->get_type_attr)
3168 ops->get_type_attr = get_Null_type;
3174 /** the get_entity_attr operation must be always implemented */
3175 static ir_entity *get_Null_ent(ir_node *n) {
3180 /* Sets the get_type operation for an ir_op_ops. */
3181 ir_op_ops *firm_set_default_get_entity_attr(ir_opcode code, ir_op_ops *ops) {
3183 case iro_SymConst: ops->get_entity_attr = get_SymConst_attr_entity; break;
3184 case iro_Sel: ops->get_entity_attr = _get_Sel_entity; break;
3186 /* not allowed to be NULL */
3187 if (! ops->get_entity_attr)
3188 ops->get_entity_attr = get_Null_ent;
3194 /* Sets the debug information of a node. */
3195 void (set_irn_dbg_info)(ir_node *n, dbg_info *db) {
3196 _set_irn_dbg_info(n, db);
3200 * Returns the debug information of an node.
3202 * @param n The node.
3204 dbg_info *(get_irn_dbg_info)(const ir_node *n) {
3205 return _get_irn_dbg_info(n);
3208 #if 0 /* allow the global pointer */
3210 /* checks whether a node represents a global address */
3211 int is_Global(const ir_node *node) {
3214 if (is_SymConst_addr_ent(node))
3219 ptr = get_Sel_ptr(node);
3220 return is_globals_pointer(ptr) != NULL;
3223 /* returns the entity of a global address */
3224 ir_entity *get_Global_entity(const ir_node *node) {
3225 if (is_SymConst(node))
3226 return get_SymConst_entity(node);
3228 return get_Sel_entity(node);
3232 /* checks whether a node represents a global address */
3233 int is_Global(const ir_node *node) {
3234 return is_SymConst_addr_ent(node);
3237 /* returns the entity of a global address */
3238 ir_entity *get_Global_entity(const ir_node *node) {
3239 return get_SymConst_entity(node);
3244 * Calculate a hash value of a node.
3246 unsigned firm_default_hash(const ir_node *node) {
3250 /* hash table value = 9*(9*(9*(9*(9*arity+in[0])+in[1])+ ...)+mode)+code */
3251 h = irn_arity = get_irn_intra_arity(node);
3253 /* consider all in nodes... except the block if not a control flow. */
3254 for (i = is_cfop(node) ? -1 : 0; i < irn_arity; ++i) {
3255 h = 9*h + HASH_PTR(get_irn_intra_n(node, i));
3259 h = 9*h + HASH_PTR(get_irn_mode(node));
3261 h = 9*h + HASH_PTR(get_irn_op(node));
3264 } /* firm_default_hash */