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"
49 /* some constants fixing the positions of nodes predecessors
51 #define CALL_PARAM_OFFSET 2
52 #define BUILDIN_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)
69 assert(pnc >= 0 && pnc <
70 (int) (sizeof(pnc_name_arr)/sizeof(pnc_name_arr[0])));
71 return pnc_name_arr[pnc];
75 * Calculates the negated (Complement(R)) pnc condition.
77 pn_Cmp get_negated_pnc(long pnc, ir_mode *mode)
81 /* do NOT add the Uo bit for non-floating point values */
82 if (! mode_is_float(mode))
88 /* Calculates the inversed (R^-1) pnc condition, i.e., "<" --> ">" */
89 pn_Cmp get_inversed_pnc(long pnc)
91 long code = pnc & ~(pn_Cmp_Lt|pn_Cmp_Gt);
92 long lesser = pnc & pn_Cmp_Lt;
93 long greater = pnc & pn_Cmp_Gt;
95 code |= (lesser ? pn_Cmp_Gt : 0) | (greater ? pn_Cmp_Lt : 0);
101 * Indicates, whether additional data can be registered to ir nodes.
102 * If set to 1, this is not possible anymore.
104 static int forbid_new_data = 0;
107 * The amount of additional space for custom data to be allocated upon
108 * creating a new node.
110 unsigned firm_add_node_size = 0;
113 /* register new space for every node */
114 unsigned firm_register_additional_node_data(unsigned size)
116 assert(!forbid_new_data && "Too late to register additional node data");
121 return firm_add_node_size += size;
125 void init_irnode(void)
127 /* Forbid the addition of new data to an ir node. */
131 struct struct_align {
141 * irnode constructor.
142 * Create a new irnode in irg, with an op, mode, arity and
143 * some incoming irnodes.
144 * If arity is negative, a node with a dynamic array is created.
146 ir_node *new_ir_node(dbg_info *db, ir_graph *irg, ir_node *block, ir_op *op,
147 ir_mode *mode, int arity, ir_node **in)
150 unsigned align = offsetof(struct struct_align, s) - 1;
151 unsigned add_node_size = (firm_add_node_size + align) & ~align;
152 size_t node_size = offsetof(ir_node, attr) + op->attr_size + add_node_size;
159 p = obstack_alloc(irg->obst, node_size);
160 memset(p, 0, node_size);
161 res = (ir_node *)(p + add_node_size);
163 res->kind = k_ir_node;
167 res->node_idx = irg_register_node_idx(irg, res);
172 res->in = NEW_ARR_F(ir_node *, 1); /* 1: space for block */
174 /* not nice but necessary: End and Sync must always have a flexible array */
175 if (op == op_End || op == op_Sync)
176 res->in = NEW_ARR_F(ir_node *, (arity+1));
178 res->in = NEW_ARR_D(ir_node *, irg->obst, (arity+1));
179 memcpy(&res->in[1], in, sizeof(ir_node *) * arity);
183 set_irn_dbg_info(res, db);
185 res->node_nr = get_irp_new_node_nr();
187 for (i = 0; i < EDGE_KIND_LAST; ++i) {
188 INIT_LIST_HEAD(&res->edge_info[i].outs_head);
189 /* edges will be build immediately */
190 res->edge_info[i].edges_built = 1;
191 res->edge_info[i].out_count = 0;
194 /* don't put this into the for loop, arity is -1 for some nodes! */
195 edges_notify_edge(res, -1, res->in[0], NULL, irg);
196 for (i = 1; i <= arity; ++i)
197 edges_notify_edge(res, i - 1, res->in[i], NULL, irg);
199 hook_new_node(irg, res);
200 if (get_irg_phase_state(irg) == phase_backend) {
201 be_info_new_node(res);
207 /*-- getting some parameters from ir_nodes --*/
209 int (is_ir_node)(const void *thing)
211 return _is_ir_node(thing);
214 int (get_irn_arity)(const ir_node *node)
216 return _get_irn_arity(node);
219 /* Returns the array with ins. This array is shifted with respect to the
220 array accessed by get_irn_n: The block operand is at position 0 not -1.
221 (@@@ This should be changed.)
222 The order of the predecessors in this array is not guaranteed, except that
223 lists of operands as predecessors of Block or arguments of a Call are
225 ir_node **get_irn_in(const ir_node *node)
230 void set_irn_in(ir_node *node, int arity, ir_node **in)
234 ir_graph *irg = get_irn_irg(node);
239 for (i = 0; i < arity; i++) {
240 if (i < ARR_LEN(*pOld_in)-1)
241 edges_notify_edge(node, i, in[i], (*pOld_in)[i+1], irg);
243 edges_notify_edge(node, i, in[i], NULL, irg);
245 for (;i < ARR_LEN(*pOld_in)-1; i++) {
246 edges_notify_edge(node, i, NULL, (*pOld_in)[i+1], irg);
249 if (arity != ARR_LEN(*pOld_in) - 1) {
250 ir_node * block = (*pOld_in)[0];
251 *pOld_in = NEW_ARR_D(ir_node *, irg->obst, arity + 1);
252 (*pOld_in)[0] = block;
254 fix_backedges(irg->obst, node);
256 memcpy((*pOld_in) + 1, in, sizeof(ir_node *) * arity);
259 ir_node *(get_irn_n)(const ir_node *node, int n)
261 return _get_irn_n(node, n);
264 void set_irn_n(ir_node *node, int n, ir_node *in)
266 assert(node && node->kind == k_ir_node);
268 assert(n < get_irn_arity(node));
269 assert(in && in->kind == k_ir_node);
272 hook_set_irn_n(node, n, in, node->in[n + 1]);
274 /* Here, we rely on src and tgt being in the current ir graph */
275 edges_notify_edge(node, n, in, node->in[n + 1], current_ir_graph);
277 node->in[n + 1] = in;
280 int add_irn_n(ir_node *node, ir_node *in)
283 ir_graph *irg = get_irn_irg(node);
285 assert(node->op->opar == oparity_dynamic);
286 pos = ARR_LEN(node->in) - 1;
287 ARR_APP1(ir_node *, node->in, in);
288 edges_notify_edge(node, pos, node->in[pos + 1], NULL, irg);
291 hook_set_irn_n(node, pos, node->in[pos + 1], NULL);
296 void del_Sync_n(ir_node *n, int i)
298 int arity = get_Sync_n_preds(n);
299 ir_node *last_pred = get_Sync_pred(n, arity - 1);
300 set_Sync_pred(n, i, last_pred);
301 edges_notify_edge(n, arity - 1, NULL, last_pred, get_irn_irg(n));
302 ARR_SHRINKLEN(get_irn_in(n), arity);
305 int (get_irn_deps)(const ir_node *node)
307 return _get_irn_deps(node);
310 ir_node *(get_irn_dep)(const ir_node *node, int pos)
312 return _get_irn_dep(node, pos);
315 void (set_irn_dep)(ir_node *node, int pos, ir_node *dep)
317 _set_irn_dep(node, pos, dep);
320 int add_irn_dep(ir_node *node, ir_node *dep)
324 /* DEP edges are only allowed in backend phase */
325 assert(get_irg_phase_state(get_irn_irg(node)) == phase_backend);
326 if (node->deps == NULL) {
327 node->deps = NEW_ARR_F(ir_node *, 1);
333 for (i = 0, n = ARR_LEN(node->deps); i < n; ++i) {
334 if (node->deps[i] == NULL)
337 if (node->deps[i] == dep)
341 if (first_zero >= 0) {
342 node->deps[first_zero] = dep;
345 ARR_APP1(ir_node *, node->deps, dep);
350 edges_notify_edge_kind(node, res, dep, NULL, EDGE_KIND_DEP, get_irn_irg(node));
355 void add_irn_deps(ir_node *tgt, ir_node *src)
359 for (i = 0, n = get_irn_deps(src); i < n; ++i)
360 add_irn_dep(tgt, get_irn_dep(src, i));
364 ir_mode *(get_irn_mode)(const ir_node *node)
366 return _get_irn_mode(node);
369 void (set_irn_mode)(ir_node *node, ir_mode *mode)
371 _set_irn_mode(node, mode);
374 /** Gets the string representation of the mode .*/
375 const char *get_irn_modename(const ir_node *node)
378 return get_mode_name(node->mode);
381 ident *get_irn_modeident(const ir_node *node)
384 return get_mode_ident(node->mode);
387 ir_op *(get_irn_op)(const ir_node *node)
389 return _get_irn_op(node);
392 /* should be private to the library: */
393 void (set_irn_op)(ir_node *node, ir_op *op)
395 _set_irn_op(node, op);
398 unsigned (get_irn_opcode)(const ir_node *node)
400 return _get_irn_opcode(node);
403 const char *get_irn_opname(const ir_node *node)
406 if (is_Phi0(node)) return "Phi0";
407 return get_id_str(node->op->name);
410 ident *get_irn_opident(const ir_node *node)
413 return node->op->name;
416 ir_visited_t (get_irn_visited)(const ir_node *node)
418 return _get_irn_visited(node);
421 void (set_irn_visited)(ir_node *node, ir_visited_t visited)
423 _set_irn_visited(node, visited);
426 void (mark_irn_visited)(ir_node *node)
428 _mark_irn_visited(node);
431 int (irn_visited)(const ir_node *node)
433 return _irn_visited(node);
436 int (irn_visited_else_mark)(ir_node *node)
438 return _irn_visited_else_mark(node);
441 void (set_irn_link)(ir_node *node, void *link)
443 _set_irn_link(node, link);
446 void *(get_irn_link)(const ir_node *node)
448 return _get_irn_link(node);
451 op_pin_state (get_irn_pinned)(const ir_node *node)
453 return _get_irn_pinned(node);
456 op_pin_state (is_irn_pinned_in_irg) (const ir_node *node)
458 return _is_irn_pinned_in_irg(node);
461 void set_irn_pinned(ir_node *node, op_pin_state state)
463 /* due to optimization an opt may be turned into a Tuple */
467 assert(node && get_op_pinned(get_irn_op(node)) >= op_pin_state_exc_pinned);
468 assert(state == op_pin_state_pinned || state == op_pin_state_floats);
470 node->attr.except.pin_state = state;
473 /* Outputs a unique number for this node */
474 long get_irn_node_nr(const ir_node *node)
477 return node->node_nr;
480 void *(get_irn_generic_attr)(ir_node *node)
482 assert(is_ir_node(node));
483 return _get_irn_generic_attr(node);
486 const void *(get_irn_generic_attr_const)(const ir_node *node)
488 assert(is_ir_node(node));
489 return _get_irn_generic_attr_const(node);
492 unsigned (get_irn_idx)(const ir_node *node)
494 assert(is_ir_node(node));
495 return _get_irn_idx(node);
498 int get_irn_pred_pos(ir_node *node, ir_node *arg)
501 for (i = get_irn_arity(node) - 1; i >= 0; i--) {
502 if (get_irn_n(node, i) == arg)
508 /** manipulate fields of individual nodes **/
510 /* this works for all except Block */
511 ir_node *get_nodes_block(const ir_node *node)
513 assert(node->op != op_Block);
514 return get_irn_n(node, -1);
517 void set_nodes_block(ir_node *node, ir_node *block)
519 assert(node->op != op_Block);
520 set_irn_n(node, -1, block);
523 /* this works for all except Block */
524 ir_node *get_nodes_MacroBlock(const ir_node *node)
526 assert(node->op != op_Block);
527 return get_Block_MacroBlock(get_irn_n(node, -1));
530 /* Test whether arbitrary node is frame pointer, i.e. Proj(pn_Start_P_frame_base)
531 * from Start. If so returns frame type, else Null. */
532 ir_type *is_frame_pointer(const ir_node *n)
534 if (is_Proj(n) && (get_Proj_proj(n) == pn_Start_P_frame_base)) {
535 ir_node *start = get_Proj_pred(n);
536 if (is_Start(start)) {
537 return get_irg_frame_type(get_irn_irg(start));
543 /* Test whether arbitrary node is tls pointer, i.e. Proj(pn_Start_P_tls)
544 * from Start. If so returns tls type, else Null. */
545 ir_type *is_tls_pointer(const ir_node *n)
547 if (is_Proj(n) && (get_Proj_proj(n) == pn_Start_P_tls)) {
548 ir_node *start = get_Proj_pred(n);
549 if (is_Start(start)) {
550 return get_tls_type();
556 ir_node **get_Block_cfgpred_arr(ir_node *node)
558 assert(is_Block(node));
559 return (ir_node **)&(get_irn_in(node)[1]);
562 int (get_Block_n_cfgpreds)(const ir_node *node)
564 return _get_Block_n_cfgpreds(node);
567 ir_node *(get_Block_cfgpred)(const ir_node *node, int pos)
569 return _get_Block_cfgpred(node, pos);
572 void set_Block_cfgpred(ir_node *node, int pos, ir_node *pred)
574 assert(is_Block(node));
575 set_irn_n(node, pos, pred);
578 int get_Block_cfgpred_pos(const ir_node *block, const ir_node *pred)
582 for (i = get_Block_n_cfgpreds(block) - 1; i >= 0; --i) {
583 if (get_Block_cfgpred_block(block, i) == pred)
589 ir_node *(get_Block_cfgpred_block)(const ir_node *node, int pos)
591 return _get_Block_cfgpred_block(node, pos);
594 int get_Block_matured(const ir_node *node)
596 assert(is_Block(node));
597 return (int)node->attr.block.is_matured;
600 void set_Block_matured(ir_node *node, int matured)
602 assert(is_Block(node));
603 node->attr.block.is_matured = matured;
606 ir_visited_t (get_Block_block_visited)(const ir_node *node)
608 return _get_Block_block_visited(node);
611 void (set_Block_block_visited)(ir_node *node, ir_visited_t visit)
613 _set_Block_block_visited(node, visit);
616 /* For this current_ir_graph must be set. */
617 void (mark_Block_block_visited)(ir_node *node)
619 _mark_Block_block_visited(node);
622 int (Block_block_visited)(const ir_node *node)
624 return _Block_block_visited(node);
627 ir_node *(set_Block_dead)(ir_node *block)
629 return _set_Block_dead(block);
632 int (is_Block_dead)(const ir_node *block)
634 return _is_Block_dead(block);
637 ir_extblk *get_Block_extbb(const ir_node *block)
640 assert(is_Block(block));
641 res = block->attr.block.extblk;
642 assert(res == NULL || is_ir_extbb(res));
646 void set_Block_extbb(ir_node *block, ir_extblk *extblk)
648 assert(is_Block(block));
649 assert(extblk == NULL || is_ir_extbb(extblk));
650 block->attr.block.extblk = extblk;
653 /* Returns the macro block header of a block.*/
654 ir_node *get_Block_MacroBlock(const ir_node *block)
657 assert(is_Block(block));
658 mbh = get_irn_n(block, -1);
659 /* once macro block header is respected by all optimizations,
660 this assert can be removed */
665 /* Sets the macro block header of a block. */
666 void set_Block_MacroBlock(ir_node *block, ir_node *mbh)
668 assert(is_Block(block));
670 assert(is_Block(mbh));
671 set_irn_n(block, -1, mbh);
674 /* returns the macro block header of a node. */
675 ir_node *get_irn_MacroBlock(const ir_node *n)
678 n = get_nodes_block(n);
679 /* if the Block is Bad, do NOT try to get it's MB, it will fail. */
683 return get_Block_MacroBlock(n);
686 /* returns the graph of a Block. */
687 ir_graph *(get_Block_irg)(const ir_node *block)
689 return _get_Block_irg(block);
692 ir_entity *create_Block_entity(ir_node *block)
695 assert(is_Block(block));
697 entity = block->attr.block.entity;
698 if (entity == NULL) {
702 glob = get_glob_type();
703 entity = new_entity(glob, id_unique("block_%u"), get_code_type());
704 set_entity_visibility(entity, ir_visibility_local);
705 set_entity_linkage(entity, IR_LINKAGE_CONSTANT);
706 nr = get_irp_next_label_nr();
707 set_entity_label(entity, nr);
708 set_entity_compiler_generated(entity, 1);
710 block->attr.block.entity = entity;
715 ir_entity *get_Block_entity(const ir_node *block)
717 assert(is_Block(block));
718 return block->attr.block.entity;
721 void set_Block_entity(ir_node *block, ir_entity *entity)
723 assert(is_Block(block));
724 assert(get_entity_type(entity) == get_code_type());
725 block->attr.block.entity = entity;
728 int has_Block_entity(const ir_node *block)
730 return block->attr.block.entity != NULL;
733 ir_node *(get_Block_phis)(const ir_node *block)
735 return _get_Block_phis(block);
738 void (set_Block_phis)(ir_node *block, ir_node *phi)
740 _set_Block_phis(block, phi);
743 void (add_Block_phi)(ir_node *block, ir_node *phi)
745 _add_Block_phi(block, phi);
748 /* Get the Block mark (single bit). */
749 unsigned (get_Block_mark)(const ir_node *block)
751 return _get_Block_mark(block);
754 /* Set the Block mark (single bit). */
755 void (set_Block_mark)(ir_node *block, unsigned mark)
757 _set_Block_mark(block, mark);
760 int get_End_n_keepalives(const ir_node *end)
763 return (get_irn_arity(end) - END_KEEPALIVE_OFFSET);
766 ir_node *get_End_keepalive(const ir_node *end, int pos)
769 return get_irn_n(end, pos + END_KEEPALIVE_OFFSET);
772 void add_End_keepalive(ir_node *end, ir_node *ka)
778 void set_End_keepalive(ir_node *end, int pos, ir_node *ka)
781 set_irn_n(end, pos + END_KEEPALIVE_OFFSET, ka);
784 /* Set new keep-alives */
785 void set_End_keepalives(ir_node *end, int n, ir_node *in[])
788 ir_graph *irg = get_irn_irg(end);
790 /* notify that edges are deleted */
791 for (i = END_KEEPALIVE_OFFSET; i < ARR_LEN(end->in) - 1; ++i) {
792 edges_notify_edge(end, i, NULL, end->in[i + 1], irg);
794 ARR_RESIZE(ir_node *, end->in, n + 1 + END_KEEPALIVE_OFFSET);
796 for (i = 0; i < n; ++i) {
797 end->in[1 + END_KEEPALIVE_OFFSET + i] = in[i];
798 edges_notify_edge(end, END_KEEPALIVE_OFFSET + i, end->in[1 + END_KEEPALIVE_OFFSET + i], NULL, irg);
802 /* Set new keep-alives from old keep-alives, skipping irn */
803 void remove_End_keepalive(ir_node *end, ir_node *irn)
805 int n = get_End_n_keepalives(end);
810 for (i = n -1; i >= 0; --i) {
811 ir_node *old_ka = end->in[1 + END_KEEPALIVE_OFFSET + i];
821 irg = get_irn_irg(end);
823 /* remove the edge */
824 edges_notify_edge(end, idx, NULL, irn, irg);
827 /* exchange with the last one */
828 ir_node *old = end->in[1 + END_KEEPALIVE_OFFSET + n - 1];
829 edges_notify_edge(end, n - 1, NULL, old, irg);
830 end->in[1 + END_KEEPALIVE_OFFSET + idx] = old;
831 edges_notify_edge(end, idx, old, NULL, irg);
833 /* now n - 1 keeps, 1 block input */
834 ARR_RESIZE(ir_node *, end->in, (n - 1) + 1 + END_KEEPALIVE_OFFSET);
837 /* remove Bads, NoMems and doublets from the keep-alive set */
838 void remove_End_Bads_and_doublets(ir_node *end)
841 int idx, n = get_End_n_keepalives(end);
847 irg = get_irn_irg(end);
848 pset_new_init(&keeps);
850 for (idx = n - 1; idx >= 0; --idx) {
851 ir_node *ka = get_End_keepalive(end, idx);
853 if (is_Bad(ka) || is_NoMem(ka) || pset_new_contains(&keeps, ka)) {
854 /* remove the edge */
855 edges_notify_edge(end, idx, NULL, ka, irg);
858 /* exchange with the last one */
859 ir_node *old = end->in[1 + END_KEEPALIVE_OFFSET + n - 1];
860 edges_notify_edge(end, n - 1, NULL, old, irg);
861 end->in[1 + END_KEEPALIVE_OFFSET + idx] = old;
862 edges_notify_edge(end, idx, old, NULL, irg);
866 pset_new_insert(&keeps, ka);
869 /* n keeps, 1 block input */
870 ARR_RESIZE(ir_node *, end->in, n + 1 + END_KEEPALIVE_OFFSET);
872 pset_new_destroy(&keeps);
875 void free_End(ir_node *end)
880 end->in = NULL; /* @@@ make sure we get an error if we use the
881 in array afterwards ... */
884 int get_Return_n_ress(const ir_node *node)
886 assert(is_Return(node));
887 return (get_irn_arity(node) - RETURN_RESULT_OFFSET);
890 ir_node **get_Return_res_arr(ir_node *node)
892 assert(is_Return(node));
893 if (get_Return_n_ress(node) > 0)
894 return (ir_node **)&(get_irn_in(node)[1 + RETURN_RESULT_OFFSET]);
900 void set_Return_n_res(ir_node *node, int results)
902 assert(is_Return(node));
906 ir_node *get_Return_res(const ir_node *node, int pos)
908 assert(is_Return(node));
909 assert(get_Return_n_ress(node) > pos);
910 return get_irn_n(node, pos + RETURN_RESULT_OFFSET);
913 void set_Return_res(ir_node *node, int pos, ir_node *res)
915 assert(is_Return(node));
916 set_irn_n(node, pos + RETURN_RESULT_OFFSET, res);
919 int (is_Const_null)(const ir_node *node)
921 return _is_Const_null(node);
924 int (is_Const_one)(const ir_node *node)
926 return _is_Const_one(node);
929 int (is_Const_all_one)(const ir_node *node)
931 return _is_Const_all_one(node);
935 /* The source language type. Must be an atomic type. Mode of type must
936 be mode of node. For tarvals from entities type must be pointer to
938 ir_type *get_Const_type(const ir_node *node)
940 assert(is_Const(node));
941 return node->attr.con.tp;
944 void set_Const_type(ir_node *node, ir_type *tp)
946 assert(is_Const(node));
947 if (tp != firm_unknown_type) {
948 assert(is_atomic_type(tp));
949 assert(get_type_mode(tp) == get_irn_mode(node));
951 node->attr.con.tp = tp;
955 symconst_kind get_SymConst_kind(const ir_node *node)
957 assert(is_SymConst(node));
958 return node->attr.symc.kind;
961 void set_SymConst_kind(ir_node *node, symconst_kind kind)
963 assert(is_SymConst(node));
964 node->attr.symc.kind = kind;
967 ir_type *get_SymConst_type(const ir_node *node)
969 /* the cast here is annoying, but we have to compensate for
971 ir_node *irn = (ir_node *)node;
972 assert(is_SymConst(node) &&
973 (SYMCONST_HAS_TYPE(get_SymConst_kind(node))));
974 return irn->attr.symc.sym.type_p;
977 void set_SymConst_type(ir_node *node, ir_type *tp)
979 assert(is_SymConst(node) &&
980 (SYMCONST_HAS_TYPE(get_SymConst_kind(node))));
981 node->attr.symc.sym.type_p = tp;
985 /* Only to access SymConst of kind symconst_addr_ent. Else assertion: */
986 ir_entity *get_SymConst_entity(const ir_node *node)
988 assert(is_SymConst(node) && SYMCONST_HAS_ENT(get_SymConst_kind(node)));
989 return node->attr.symc.sym.entity_p;
992 void set_SymConst_entity(ir_node *node, ir_entity *ent)
994 assert(is_SymConst(node) && SYMCONST_HAS_ENT(get_SymConst_kind(node)));
995 node->attr.symc.sym.entity_p = ent;
998 ir_enum_const *get_SymConst_enum(const ir_node *node)
1000 assert(is_SymConst(node) && SYMCONST_HAS_ENUM(get_SymConst_kind(node)));
1001 return node->attr.symc.sym.enum_p;
1004 void set_SymConst_enum(ir_node *node, ir_enum_const *ec)
1006 assert(is_SymConst(node) && SYMCONST_HAS_ENUM(get_SymConst_kind(node)));
1007 node->attr.symc.sym.enum_p = ec;
1010 union symconst_symbol
1011 get_SymConst_symbol(const ir_node *node)
1013 assert(is_SymConst(node));
1014 return node->attr.symc.sym;
1017 void set_SymConst_symbol(ir_node *node, union symconst_symbol sym)
1019 assert(is_SymConst(node));
1020 node->attr.symc.sym = sym;
1023 ir_type *get_SymConst_value_type(const ir_node *node)
1025 assert(is_SymConst(node));
1026 return node->attr.symc.tp;
1029 void set_SymConst_value_type(ir_node *node, ir_type *tp)
1031 assert(is_SymConst(node));
1032 node->attr.symc.tp = tp;
1035 int get_Sel_n_indexs(const ir_node *node)
1037 assert(is_Sel(node));
1038 return (get_irn_arity(node) - SEL_INDEX_OFFSET);
1041 ir_node **get_Sel_index_arr(ir_node *node)
1043 assert(is_Sel(node));
1044 if (get_Sel_n_indexs(node) > 0)
1045 return (ir_node **)& get_irn_in(node)[SEL_INDEX_OFFSET + 1];
1050 ir_node *get_Sel_index(const ir_node *node, int pos)
1052 assert(is_Sel(node));
1053 return get_irn_n(node, pos + SEL_INDEX_OFFSET);
1056 void set_Sel_index(ir_node *node, int pos, ir_node *index)
1058 assert(is_Sel(node));
1059 set_irn_n(node, pos + SEL_INDEX_OFFSET, index);
1063 /* For unary and binary arithmetic operations the access to the
1064 operands can be factored out. Left is the first, right the
1065 second arithmetic value as listed in tech report 0999-33.
1066 unops are: Minus, Abs, Not, Conv, Cast
1067 binops are: Add, Sub, Mul, Quot, DivMod, Div, Mod, And, Or, Eor, Shl,
1068 Shr, Shrs, Rotate, Cmp */
1071 ir_node **get_Call_param_arr(ir_node *node)
1073 assert(is_Call(node));
1074 return &get_irn_in(node)[CALL_PARAM_OFFSET + 1];
1077 int get_Call_n_params(const ir_node *node)
1079 assert(is_Call(node));
1080 return (get_irn_arity(node) - CALL_PARAM_OFFSET);
1083 ir_node *get_Call_param(const ir_node *node, int pos)
1085 assert(is_Call(node));
1086 return get_irn_n(node, pos + CALL_PARAM_OFFSET);
1089 void set_Call_param(ir_node *node, int pos, ir_node *param)
1091 assert(is_Call(node));
1092 set_irn_n(node, pos + CALL_PARAM_OFFSET, param);
1095 ir_node **get_Builtin_param_arr(ir_node *node)
1097 assert(is_Builtin(node));
1098 return &get_irn_in(node)[BUILDIN_PARAM_OFFSET + 1];
1101 int get_Builtin_n_params(const ir_node *node)
1103 assert(is_Builtin(node));
1104 return (get_irn_arity(node) - BUILDIN_PARAM_OFFSET);
1107 ir_node *get_Builtin_param(const ir_node *node, int pos)
1109 assert(is_Builtin(node));
1110 return get_irn_n(node, pos + BUILDIN_PARAM_OFFSET);
1113 void set_Builtin_param(ir_node *node, int pos, ir_node *param)
1115 assert(is_Builtin(node));
1116 set_irn_n(node, pos + BUILDIN_PARAM_OFFSET, param);
1119 /* Returns a human readable string for the ir_builtin_kind. */
1120 const char *get_builtin_kind_name(ir_builtin_kind kind)
1122 #define X(a) case a: return #a
1125 X(ir_bk_debugbreak);
1126 X(ir_bk_return_address);
1127 X(ir_bk_frame_address);
1137 X(ir_bk_inner_trampoline);
1144 int Call_has_callees(const ir_node *node)
1146 assert(is_Call(node));
1147 return ((get_irg_callee_info_state(get_irn_irg(node)) != irg_callee_info_none) &&
1148 (node->attr.call.callee_arr != NULL));
1151 int get_Call_n_callees(const ir_node *node)
1153 assert(is_Call(node) && node->attr.call.callee_arr);
1154 return ARR_LEN(node->attr.call.callee_arr);
1157 ir_entity *get_Call_callee(const ir_node *node, int pos)
1159 assert(pos >= 0 && pos < get_Call_n_callees(node));
1160 return node->attr.call.callee_arr[pos];
1163 void set_Call_callee_arr(ir_node *node, const int n, ir_entity ** arr)
1165 assert(is_Call(node));
1166 if (node->attr.call.callee_arr == NULL || get_Call_n_callees(node) != n) {
1167 node->attr.call.callee_arr = NEW_ARR_D(ir_entity *, current_ir_graph->obst, n);
1169 memcpy(node->attr.call.callee_arr, arr, n * sizeof(ir_entity *));
1172 void remove_Call_callee_arr(ir_node *node)
1174 assert(is_Call(node));
1175 node->attr.call.callee_arr = NULL;
1179 * Returns non-zero if a Call is surely a self-recursive Call.
1180 * Beware: if this functions returns 0, the call might be self-recursive!
1182 int is_self_recursive_Call(const ir_node *call)
1184 const ir_node *callee = get_Call_ptr(call);
1186 if (is_SymConst_addr_ent(callee)) {
1187 const ir_entity *ent = get_SymConst_entity(callee);
1188 const ir_graph *irg = get_entity_irg(ent);
1189 if (irg == get_irn_irg(call))
1195 /* Checks for upcast.
1197 * Returns true if the Cast node casts a class type to a super type.
1199 int is_Cast_upcast(ir_node *node)
1201 ir_type *totype = get_Cast_type(node);
1202 ir_type *fromtype = get_irn_typeinfo_type(get_Cast_op(node));
1204 assert(get_irg_typeinfo_state(get_irn_irg(node)) == ir_typeinfo_consistent);
1207 while (is_Pointer_type(totype) && is_Pointer_type(fromtype)) {
1208 totype = get_pointer_points_to_type(totype);
1209 fromtype = get_pointer_points_to_type(fromtype);
1214 if (!is_Class_type(totype)) return 0;
1215 return is_SubClass_of(fromtype, totype);
1218 /* Checks for downcast.
1220 * Returns true if the Cast node casts a class type to a sub type.
1222 int is_Cast_downcast(ir_node *node)
1224 ir_type *totype = get_Cast_type(node);
1225 ir_type *fromtype = get_irn_typeinfo_type(get_Cast_op(node));
1227 assert(get_irg_typeinfo_state(get_irn_irg(node)) == ir_typeinfo_consistent);
1230 while (is_Pointer_type(totype) && is_Pointer_type(fromtype)) {
1231 totype = get_pointer_points_to_type(totype);
1232 fromtype = get_pointer_points_to_type(fromtype);
1237 if (!is_Class_type(totype)) return 0;
1238 return is_SubClass_of(totype, fromtype);
1241 int (is_unop)(const ir_node *node)
1243 return _is_unop(node);
1246 ir_node *get_unop_op(const ir_node *node)
1248 if (node->op->opar == oparity_unary)
1249 return get_irn_n(node, node->op->op_index);
1251 assert(node->op->opar == oparity_unary);
1255 void set_unop_op(ir_node *node, ir_node *op)
1257 if (node->op->opar == oparity_unary)
1258 set_irn_n(node, node->op->op_index, op);
1260 assert(node->op->opar == oparity_unary);
1263 int (is_binop)(const ir_node *node)
1265 return _is_binop(node);
1268 ir_node *get_binop_left(const ir_node *node)
1270 assert(node->op->opar == oparity_binary);
1271 return get_irn_n(node, node->op->op_index);
1274 void set_binop_left(ir_node *node, ir_node *left)
1276 assert(node->op->opar == oparity_binary);
1277 set_irn_n(node, node->op->op_index, left);
1280 ir_node *get_binop_right(const ir_node *node)
1282 assert(node->op->opar == oparity_binary);
1283 return get_irn_n(node, node->op->op_index + 1);
1286 void set_binop_right(ir_node *node, ir_node *right)
1288 assert(node->op->opar == oparity_binary);
1289 set_irn_n(node, node->op->op_index + 1, right);
1292 int is_Phi0(const ir_node *n)
1296 return ((get_irn_op(n) == op_Phi) &&
1297 (get_irn_arity(n) == 0) &&
1298 (get_irg_phase_state(get_irn_irg(n)) == phase_building));
1301 ir_node **get_Phi_preds_arr(ir_node *node)
1303 assert(node->op == op_Phi);
1304 return (ir_node **)&(get_irn_in(node)[1]);
1307 int get_Phi_n_preds(const ir_node *node)
1309 assert(is_Phi(node) || is_Phi0(node));
1310 return (get_irn_arity(node));
1314 void set_Phi_n_preds(ir_node *node, int n_preds)
1316 assert(node->op == op_Phi);
1320 ir_node *get_Phi_pred(const ir_node *node, int pos)
1322 assert(is_Phi(node) || is_Phi0(node));
1323 return get_irn_n(node, pos);
1326 void set_Phi_pred(ir_node *node, int pos, ir_node *pred)
1328 assert(is_Phi(node) || is_Phi0(node));
1329 set_irn_n(node, pos, pred);
1332 ir_node *(get_Phi_next)(const ir_node *phi)
1334 return _get_Phi_next(phi);
1337 void (set_Phi_next)(ir_node *phi, ir_node *next)
1339 _set_Phi_next(phi, next);
1342 int is_memop(const ir_node *node)
1344 ir_opcode code = get_irn_opcode(node);
1345 return (code == iro_Load || code == iro_Store);
1348 ir_node *get_memop_mem(const ir_node *node)
1350 assert(is_memop(node));
1351 return get_irn_n(node, 0);
1354 void set_memop_mem(ir_node *node, ir_node *mem)
1356 assert(is_memop(node));
1357 set_irn_n(node, 0, mem);
1360 ir_node *get_memop_ptr(const ir_node *node)
1362 assert(is_memop(node));
1363 return get_irn_n(node, 1);
1366 void set_memop_ptr(ir_node *node, ir_node *ptr)
1368 assert(is_memop(node));
1369 set_irn_n(node, 1, ptr);
1372 ir_volatility get_Load_volatility(const ir_node *node)
1374 assert(is_Load(node));
1375 return node->attr.load.volatility;
1378 void set_Load_volatility(ir_node *node, ir_volatility volatility)
1380 assert(is_Load(node));
1381 node->attr.load.volatility = volatility;
1384 ir_align get_Load_align(const ir_node *node)
1386 assert(is_Load(node));
1387 return node->attr.load.aligned;
1390 void set_Load_align(ir_node *node, ir_align align)
1392 assert(is_Load(node));
1393 node->attr.load.aligned = align;
1397 ir_volatility get_Store_volatility(const ir_node *node)
1399 assert(is_Store(node));
1400 return node->attr.store.volatility;
1403 void set_Store_volatility(ir_node *node, ir_volatility volatility)
1405 assert(is_Store(node));
1406 node->attr.store.volatility = volatility;
1409 ir_align get_Store_align(const ir_node *node)
1411 assert(is_Store(node));
1412 return node->attr.store.aligned;
1415 void set_Store_align(ir_node *node, ir_align align)
1417 assert(is_Store(node));
1418 node->attr.store.aligned = align;
1422 ir_node **get_Sync_preds_arr(ir_node *node)
1424 assert(is_Sync(node));
1425 return (ir_node **)&(get_irn_in(node)[1]);
1428 int get_Sync_n_preds(const ir_node *node)
1430 assert(is_Sync(node));
1431 return (get_irn_arity(node));
1435 void set_Sync_n_preds(ir_node *node, int n_preds)
1437 assert(is_Sync(node));
1441 ir_node *get_Sync_pred(const ir_node *node, int pos)
1443 assert(is_Sync(node));
1444 return get_irn_n(node, pos);
1447 void set_Sync_pred(ir_node *node, int pos, ir_node *pred)
1449 assert(is_Sync(node));
1450 set_irn_n(node, pos, pred);
1453 /* Add a new Sync predecessor */
1454 void add_Sync_pred(ir_node *node, ir_node *pred)
1456 assert(is_Sync(node));
1457 add_irn_n(node, pred);
1460 /* Returns the source language type of a Proj node. */
1461 ir_type *get_Proj_type(const ir_node *n)
1463 ir_type *tp = firm_unknown_type;
1464 ir_node *pred = get_Proj_pred(n);
1466 switch (get_irn_opcode(pred)) {
1469 /* Deal with Start / Call here: we need to know the Proj Nr. */
1470 assert(get_irn_mode(pred) == mode_T);
1471 pred_pred = get_Proj_pred(pred);
1473 if (is_Start(pred_pred)) {
1474 ir_type *mtp = get_entity_type(get_irg_entity(get_irn_irg(pred_pred)));
1475 tp = get_method_param_type(mtp, get_Proj_proj(n));
1476 } else if (is_Call(pred_pred)) {
1477 ir_type *mtp = get_Call_type(pred_pred);
1478 tp = get_method_res_type(mtp, get_Proj_proj(n));
1481 case iro_Start: break;
1482 case iro_Call: break;
1484 ir_node *a = get_Load_ptr(pred);
1486 tp = get_entity_type(get_Sel_entity(a));
1494 long get_Proj_proj(const ir_node *node)
1496 assert(is_Proj(node));
1497 return node->attr.proj;
1500 void set_Proj_proj(ir_node *node, long proj)
1502 assert(is_Proj(node));
1503 node->attr.proj = proj;
1506 int (is_arg_Proj)(const ir_node *node)
1508 return _is_arg_Proj(node);
1511 ir_node **get_Tuple_preds_arr(ir_node *node)
1513 assert(is_Tuple(node));
1514 return (ir_node **)&(get_irn_in(node)[1]);
1517 int get_Tuple_n_preds(const ir_node *node)
1519 assert(is_Tuple(node));
1520 return get_irn_arity(node);
1523 ir_node *get_Tuple_pred(const ir_node *node, int pos)
1525 assert(is_Tuple(node));
1526 return get_irn_n(node, pos);
1529 void set_Tuple_pred(ir_node *node, int pos, ir_node *pred)
1531 assert(is_Tuple(node));
1532 set_irn_n(node, pos, pred);
1535 int get_ASM_n_input_constraints(const ir_node *node)
1537 assert(is_ASM(node));
1538 return ARR_LEN(node->attr.assem.input_constraints);
1541 int get_ASM_n_output_constraints(const ir_node *node)
1543 assert(is_ASM(node));
1544 return ARR_LEN(node->attr.assem.output_constraints);
1547 int get_ASM_n_clobbers(const ir_node *node)
1549 assert(is_ASM(node));
1550 return ARR_LEN(node->attr.assem.clobbers);
1553 /* returns the graph of a node */
1554 ir_graph *(get_irn_irg)(const ir_node *node)
1556 return _get_irn_irg(node);
1560 /*----------------------------------------------------------------*/
1561 /* Auxiliary routines */
1562 /*----------------------------------------------------------------*/
1564 ir_node *skip_Proj(ir_node *node)
1566 /* don't assert node !!! */
1571 node = get_Proj_pred(node);
1577 skip_Proj_const(const ir_node *node)
1579 /* don't assert node !!! */
1584 node = get_Proj_pred(node);
1589 ir_node *skip_Tuple(ir_node *node)
1595 if (is_Proj(node)) {
1596 pred = get_Proj_pred(node);
1597 op = get_irn_op(pred);
1600 * Looks strange but calls get_irn_op() only once
1601 * in most often cases.
1603 if (op == op_Proj) { /* nested Tuple ? */
1604 pred = skip_Tuple(pred);
1606 if (is_Tuple(pred)) {
1607 node = get_Tuple_pred(pred, get_Proj_proj(node));
1610 } else if (op == op_Tuple) {
1611 node = get_Tuple_pred(pred, get_Proj_proj(node));
1618 /* returns operand of node if node is a Cast */
1619 ir_node *skip_Cast(ir_node *node)
1622 return get_Cast_op(node);
1626 /* returns operand of node if node is a Cast */
1627 const ir_node *skip_Cast_const(const ir_node *node)
1630 return get_Cast_op(node);
1634 /* returns operand of node if node is a Pin */
1635 ir_node *skip_Pin(ir_node *node)
1638 return get_Pin_op(node);
1642 /* returns operand of node if node is a Confirm */
1643 ir_node *skip_Confirm(ir_node *node)
1645 if (is_Confirm(node))
1646 return get_Confirm_value(node);
1650 /* skip all high-level ops */
1651 ir_node *skip_HighLevel_ops(ir_node *node)
1653 while (is_op_highlevel(get_irn_op(node))) {
1654 node = get_irn_n(node, 0);
1660 /* This should compact Id-cycles to self-cycles. It has the same (or less?) complexity
1661 * than any other approach, as Id chains are resolved and all point to the real node, or
1662 * all id's are self loops.
1664 * Note: This function takes 10% of mostly ANY the compiler run, so it's
1665 * a little bit "hand optimized".
1667 * Moreover, it CANNOT be switched off using get_opt_normalize() ...
1669 ir_node *skip_Id(ir_node *node)
1672 /* don't assert node !!! */
1674 if (!node || (node->op != op_Id)) return node;
1676 /* Don't use get_Id_pred(): We get into an endless loop for
1677 self-referencing Ids. */
1678 pred = node->in[0+1];
1680 if (pred->op != op_Id) return pred;
1682 if (node != pred) { /* not a self referencing Id. Resolve Id chain. */
1683 ir_node *rem_pred, *res;
1685 if (pred->op != op_Id) return pred; /* shortcut */
1688 assert(get_irn_arity (node) > 0);
1690 node->in[0+1] = node; /* turn us into a self referencing Id: shorten Id cycles. */
1691 res = skip_Id(rem_pred);
1692 if (res->op == op_Id) /* self-loop */ return node;
1694 node->in[0+1] = res; /* Turn Id chain into Ids all referencing the chain end. */
1701 int (is_strictConv)(const ir_node *node)
1703 return _is_strictConv(node);
1706 /* Returns true if node is a SymConst node with kind symconst_addr_ent. */
1707 int (is_SymConst_addr_ent)(const ir_node *node)
1709 return _is_SymConst_addr_ent(node);
1712 /* Returns true if the operation manipulates control flow. */
1713 int is_cfop(const ir_node *node)
1715 return is_op_cfopcode(get_irn_op(node));
1718 /* Returns true if the operation can change the control flow because
1720 int is_fragile_op(const ir_node *node)
1722 return is_op_fragile(get_irn_op(node));
1725 /* Returns the memory operand of fragile operations. */
1726 ir_node *get_fragile_op_mem(ir_node *node)
1728 assert(node && is_fragile_op(node));
1730 switch (get_irn_opcode(node)) {
1741 return get_irn_n(node, pn_Generic_M);
1746 panic("should not be reached");
1750 /* Returns the result mode of a Div operation. */
1751 ir_mode *get_divop_resmod(const ir_node *node)
1753 switch (get_irn_opcode(node)) {
1754 case iro_Quot : return get_Quot_resmode(node);
1755 case iro_DivMod: return get_DivMod_resmode(node);
1756 case iro_Div : return get_Div_resmode(node);
1757 case iro_Mod : return get_Mod_resmode(node);
1759 panic("should not be reached");
1763 /* Returns true if the operation is a forking control flow operation. */
1764 int (is_irn_forking)(const ir_node *node)
1766 return _is_irn_forking(node);
1769 void (copy_node_attr)(ir_graph *irg, const ir_node *old_node, ir_node *new_node)
1771 _copy_node_attr(irg, old_node, new_node);
1774 /* Return the type associated with the value produced by n
1775 * if the node remarks this type as it is the case for
1776 * Cast, Const, SymConst and some Proj nodes. */
1777 ir_type *(get_irn_type)(ir_node *node)
1779 return _get_irn_type(node);
1782 /* Return the type attribute of a node n (SymConst, Call, Alloc, Free,
1784 ir_type *(get_irn_type_attr)(ir_node *node)
1786 return _get_irn_type_attr(node);
1789 /* Return the entity attribute of a node n (SymConst, Sel) or NULL. */
1790 ir_entity *(get_irn_entity_attr)(ir_node *node)
1792 return _get_irn_entity_attr(node);
1795 /* Returns non-zero for constant-like nodes. */
1796 int (is_irn_constlike)(const ir_node *node)
1798 return _is_irn_constlike(node);
1802 * Returns non-zero for nodes that are allowed to have keep-alives and
1803 * are neither Block nor PhiM.
1805 int (is_irn_keep)(const ir_node *node)
1807 return _is_irn_keep(node);
1811 * Returns non-zero for nodes that are always placed in the start block.
1813 int (is_irn_start_block_placed)(const ir_node *node)
1815 return _is_irn_start_block_placed(node);
1818 /* Returns non-zero for nodes that are machine operations. */
1819 int (is_irn_machine_op)(const ir_node *node)
1821 return _is_irn_machine_op(node);
1824 /* Returns non-zero for nodes that are machine operands. */
1825 int (is_irn_machine_operand)(const ir_node *node)
1827 return _is_irn_machine_operand(node);
1830 /* Returns non-zero for nodes that have the n'th user machine flag set. */
1831 int (is_irn_machine_user)(const ir_node *node, unsigned n)
1833 return _is_irn_machine_user(node, n);
1836 /* Returns non-zero for nodes that are CSE neutral to its users. */
1837 int (is_irn_cse_neutral)(const ir_node *node)
1839 return _is_irn_cse_neutral(node);
1842 /* Gets the string representation of the jump prediction .*/
1843 const char *get_cond_jmp_predicate_name(cond_jmp_predicate pred)
1845 #define X(a) case a: return #a
1847 X(COND_JMP_PRED_NONE);
1848 X(COND_JMP_PRED_TRUE);
1849 X(COND_JMP_PRED_FALSE);
1855 /** the get_type operation must be always implemented and return a firm type */
1856 static ir_type *get_Default_type(const ir_node *n)
1859 return get_unknown_type();
1862 /* Sets the get_type operation for an ir_op_ops. */
1863 ir_op_ops *firm_set_default_get_type(ir_opcode code, ir_op_ops *ops)
1866 case iro_Const: ops->get_type = get_Const_type; break;
1867 case iro_SymConst: ops->get_type = get_SymConst_value_type; break;
1868 case iro_Cast: ops->get_type = get_Cast_type; break;
1869 case iro_Proj: ops->get_type = get_Proj_type; break;
1871 /* not allowed to be NULL */
1872 if (! ops->get_type)
1873 ops->get_type = get_Default_type;
1879 /** Return the attribute type of a SymConst node if exists */
1880 static ir_type *get_SymConst_attr_type(const ir_node *self)
1882 symconst_kind kind = get_SymConst_kind(self);
1883 if (SYMCONST_HAS_TYPE(kind))
1884 return get_SymConst_type(self);
1888 /** Return the attribute entity of a SymConst node if exists */
1889 static ir_entity *get_SymConst_attr_entity(const ir_node *self)
1891 symconst_kind kind = get_SymConst_kind(self);
1892 if (SYMCONST_HAS_ENT(kind))
1893 return get_SymConst_entity(self);
1897 /** the get_type_attr operation must be always implemented */
1898 static ir_type *get_Null_type(const ir_node *n)
1901 return firm_unknown_type;
1904 /* Sets the get_type operation for an ir_op_ops. */
1905 ir_op_ops *firm_set_default_get_type_attr(ir_opcode code, ir_op_ops *ops)
1908 case iro_SymConst: ops->get_type_attr = get_SymConst_attr_type; break;
1909 case iro_Call: ops->get_type_attr = get_Call_type; break;
1910 case iro_Alloc: ops->get_type_attr = get_Alloc_type; break;
1911 case iro_Free: ops->get_type_attr = get_Free_type; break;
1912 case iro_Cast: ops->get_type_attr = get_Cast_type; break;
1914 /* not allowed to be NULL */
1915 if (! ops->get_type_attr)
1916 ops->get_type_attr = get_Null_type;
1922 /** the get_entity_attr operation must be always implemented */
1923 static ir_entity *get_Null_ent(const ir_node *n)
1929 /* Sets the get_type operation for an ir_op_ops. */
1930 ir_op_ops *firm_set_default_get_entity_attr(ir_opcode code, ir_op_ops *ops)
1933 case iro_SymConst: ops->get_entity_attr = get_SymConst_attr_entity; break;
1934 case iro_Sel: ops->get_entity_attr = get_Sel_entity; break;
1936 /* not allowed to be NULL */
1937 if (! ops->get_entity_attr)
1938 ops->get_entity_attr = get_Null_ent;
1944 /* Sets the debug information of a node. */
1945 void (set_irn_dbg_info)(ir_node *n, dbg_info *db)
1947 _set_irn_dbg_info(n, db);
1951 * Returns the debug information of an node.
1953 * @param n The node.
1955 dbg_info *(get_irn_dbg_info)(const ir_node *n)
1957 return _get_irn_dbg_info(n);
1960 /* checks whether a node represents a global address */
1961 int is_Global(const ir_node *node)
1963 return is_SymConst_addr_ent(node);
1966 /* returns the entity of a global address */
1967 ir_entity *get_Global_entity(const ir_node *node)
1969 return get_SymConst_entity(node);
1973 * Calculate a hash value of a node.
1975 unsigned firm_default_hash(const ir_node *node)
1980 /* hash table value = 9*(9*(9*(9*(9*arity+in[0])+in[1])+ ...)+mode)+code */
1981 h = irn_arity = get_irn_arity(node);
1983 /* consider all in nodes... except the block if not a control flow. */
1984 for (i = is_cfop(node) ? -1 : 0; i < irn_arity; ++i) {
1985 ir_node *pred = get_irn_n(node, i);
1986 if (is_irn_cse_neutral(pred))
1989 h = 9*h + HASH_PTR(pred);
1993 h = 9*h + HASH_PTR(get_irn_mode(node));
1995 h = 9*h + HASH_PTR(get_irn_op(node));
1998 } /* firm_default_hash */
2000 /* include generated code */
2001 #include "gen_irnode.c.inl"