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 ir_graph *irg = get_irn_irg(node);
267 assert(node && node->kind == k_ir_node);
269 assert(n < get_irn_arity(node));
270 assert(in && in->kind == k_ir_node);
273 hook_set_irn_n(node, n, in, node->in[n + 1]);
275 /* Here, we rely on src and tgt being in the current ir graph */
276 edges_notify_edge(node, n, in, node->in[n + 1], irg);
278 node->in[n + 1] = in;
281 int add_irn_n(ir_node *node, ir_node *in)
284 ir_graph *irg = get_irn_irg(node);
286 assert(node->op->opar == oparity_dynamic);
287 pos = ARR_LEN(node->in) - 1;
288 ARR_APP1(ir_node *, node->in, in);
289 edges_notify_edge(node, pos, node->in[pos + 1], NULL, irg);
292 hook_set_irn_n(node, pos, node->in[pos + 1], NULL);
297 void del_Sync_n(ir_node *n, int i)
299 int arity = get_Sync_n_preds(n);
300 ir_node *last_pred = get_Sync_pred(n, arity - 1);
301 set_Sync_pred(n, i, last_pred);
302 edges_notify_edge(n, arity - 1, NULL, last_pred, get_irn_irg(n));
303 ARR_SHRINKLEN(get_irn_in(n), arity);
306 int (get_irn_deps)(const ir_node *node)
308 return _get_irn_deps(node);
311 ir_node *(get_irn_dep)(const ir_node *node, int pos)
313 return _get_irn_dep(node, pos);
316 void (set_irn_dep)(ir_node *node, int pos, ir_node *dep)
318 _set_irn_dep(node, pos, dep);
321 int add_irn_dep(ir_node *node, ir_node *dep)
325 /* DEP edges are only allowed in backend phase */
326 assert(get_irg_phase_state(get_irn_irg(node)) == phase_backend);
327 if (node->deps == NULL) {
328 node->deps = NEW_ARR_F(ir_node *, 1);
334 for (i = 0, n = ARR_LEN(node->deps); i < n; ++i) {
335 if (node->deps[i] == NULL)
338 if (node->deps[i] == dep)
342 if (first_zero >= 0) {
343 node->deps[first_zero] = dep;
346 ARR_APP1(ir_node *, node->deps, dep);
351 edges_notify_edge_kind(node, res, dep, NULL, EDGE_KIND_DEP, get_irn_irg(node));
356 void add_irn_deps(ir_node *tgt, ir_node *src)
360 for (i = 0, n = get_irn_deps(src); i < n; ++i)
361 add_irn_dep(tgt, get_irn_dep(src, i));
365 ir_mode *(get_irn_mode)(const ir_node *node)
367 return _get_irn_mode(node);
370 void (set_irn_mode)(ir_node *node, ir_mode *mode)
372 _set_irn_mode(node, mode);
375 /** Gets the string representation of the mode .*/
376 const char *get_irn_modename(const ir_node *node)
379 return get_mode_name(node->mode);
382 ident *get_irn_modeident(const ir_node *node)
385 return get_mode_ident(node->mode);
388 ir_op *(get_irn_op)(const ir_node *node)
390 return _get_irn_op(node);
393 /* should be private to the library: */
394 void (set_irn_op)(ir_node *node, ir_op *op)
396 _set_irn_op(node, op);
399 unsigned (get_irn_opcode)(const ir_node *node)
401 return _get_irn_opcode(node);
404 const char *get_irn_opname(const ir_node *node)
407 if (is_Phi0(node)) return "Phi0";
408 return get_id_str(node->op->name);
411 ident *get_irn_opident(const ir_node *node)
414 return node->op->name;
417 ir_visited_t (get_irn_visited)(const ir_node *node)
419 return _get_irn_visited(node);
422 void (set_irn_visited)(ir_node *node, ir_visited_t visited)
424 _set_irn_visited(node, visited);
427 void (mark_irn_visited)(ir_node *node)
429 _mark_irn_visited(node);
432 int (irn_visited)(const ir_node *node)
434 return _irn_visited(node);
437 int (irn_visited_else_mark)(ir_node *node)
439 return _irn_visited_else_mark(node);
442 void (set_irn_link)(ir_node *node, void *link)
444 _set_irn_link(node, link);
447 void *(get_irn_link)(const ir_node *node)
449 return _get_irn_link(node);
452 op_pin_state (get_irn_pinned)(const ir_node *node)
454 return _get_irn_pinned(node);
457 op_pin_state (is_irn_pinned_in_irg) (const ir_node *node)
459 return _is_irn_pinned_in_irg(node);
462 void set_irn_pinned(ir_node *node, op_pin_state state)
464 /* due to optimization an opt may be turned into a Tuple */
468 assert(node && get_op_pinned(get_irn_op(node)) >= op_pin_state_exc_pinned);
469 assert(state == op_pin_state_pinned || state == op_pin_state_floats);
471 node->attr.except.pin_state = state;
474 /* Outputs a unique number for this node */
475 long get_irn_node_nr(const ir_node *node)
478 return node->node_nr;
481 void *(get_irn_generic_attr)(ir_node *node)
483 assert(is_ir_node(node));
484 return _get_irn_generic_attr(node);
487 const void *(get_irn_generic_attr_const)(const ir_node *node)
489 assert(is_ir_node(node));
490 return _get_irn_generic_attr_const(node);
493 unsigned (get_irn_idx)(const ir_node *node)
495 assert(is_ir_node(node));
496 return _get_irn_idx(node);
499 int get_irn_pred_pos(ir_node *node, ir_node *arg)
502 for (i = get_irn_arity(node) - 1; i >= 0; i--) {
503 if (get_irn_n(node, i) == arg)
509 /** manipulate fields of individual nodes **/
511 ir_node *(get_nodes_block)(const ir_node *node)
513 return _get_nodes_block(node);
516 void set_nodes_block(ir_node *node, ir_node *block)
518 assert(node->op != op_Block);
519 set_irn_n(node, -1, block);
522 /* this works for all except Block */
523 ir_node *get_nodes_MacroBlock(const ir_node *node)
525 assert(node->op != op_Block);
526 return get_Block_MacroBlock(get_irn_n(node, -1));
529 /* Test whether arbitrary node is frame pointer, i.e. Proj(pn_Start_P_frame_base)
530 * from Start. If so returns frame type, else Null. */
531 ir_type *is_frame_pointer(const ir_node *n)
533 if (is_Proj(n) && (get_Proj_proj(n) == pn_Start_P_frame_base)) {
534 ir_node *start = get_Proj_pred(n);
535 if (is_Start(start)) {
536 return get_irg_frame_type(get_irn_irg(start));
542 /* Test whether arbitrary node is tls pointer, i.e. Proj(pn_Start_P_tls)
543 * from Start. If so returns tls type, else Null. */
544 ir_type *is_tls_pointer(const ir_node *n)
546 if (is_Proj(n) && (get_Proj_proj(n) == pn_Start_P_tls)) {
547 ir_node *start = get_Proj_pred(n);
548 if (is_Start(start)) {
549 return get_tls_type();
555 ir_node **get_Block_cfgpred_arr(ir_node *node)
557 assert(is_Block(node));
558 return (ir_node **)&(get_irn_in(node)[1]);
561 int (get_Block_n_cfgpreds)(const ir_node *node)
563 return _get_Block_n_cfgpreds(node);
566 ir_node *(get_Block_cfgpred)(const ir_node *node, int pos)
568 return _get_Block_cfgpred(node, pos);
571 void set_Block_cfgpred(ir_node *node, int pos, ir_node *pred)
573 assert(is_Block(node));
574 set_irn_n(node, pos, pred);
577 int get_Block_cfgpred_pos(const ir_node *block, const ir_node *pred)
581 for (i = get_Block_n_cfgpreds(block) - 1; i >= 0; --i) {
582 if (get_Block_cfgpred_block(block, i) == pred)
588 ir_node *(get_Block_cfgpred_block)(const ir_node *node, int pos)
590 return _get_Block_cfgpred_block(node, pos);
593 int get_Block_matured(const ir_node *node)
595 assert(is_Block(node));
596 return (int)node->attr.block.is_matured;
599 void set_Block_matured(ir_node *node, int matured)
601 assert(is_Block(node));
602 node->attr.block.is_matured = matured;
605 ir_visited_t (get_Block_block_visited)(const ir_node *node)
607 return _get_Block_block_visited(node);
610 void (set_Block_block_visited)(ir_node *node, ir_visited_t visit)
612 _set_Block_block_visited(node, visit);
615 void (mark_Block_block_visited)(ir_node *node)
617 _mark_Block_block_visited(node);
620 int (Block_block_visited)(const ir_node *node)
622 return _Block_block_visited(node);
625 ir_node *(set_Block_dead)(ir_node *block)
627 return _set_Block_dead(block);
630 int (is_Block_dead)(const ir_node *block)
632 return _is_Block_dead(block);
635 ir_extblk *get_Block_extbb(const ir_node *block)
638 assert(is_Block(block));
639 res = block->attr.block.extblk;
640 assert(res == NULL || is_ir_extbb(res));
644 void set_Block_extbb(ir_node *block, ir_extblk *extblk)
646 assert(is_Block(block));
647 assert(extblk == NULL || is_ir_extbb(extblk));
648 block->attr.block.extblk = extblk;
651 /* Returns the macro block header of a block.*/
652 ir_node *get_Block_MacroBlock(const ir_node *block)
655 assert(is_Block(block));
656 mbh = get_irn_n(block, -1);
657 /* once macro block header is respected by all optimizations,
658 this assert can be removed */
663 /* Sets the macro block header of a block. */
664 void set_Block_MacroBlock(ir_node *block, ir_node *mbh)
666 assert(is_Block(block));
668 assert(is_Block(mbh));
669 set_irn_n(block, -1, mbh);
672 /* returns the macro block header of a node. */
673 ir_node *get_irn_MacroBlock(const ir_node *n)
676 n = get_nodes_block(n);
677 /* if the Block is Bad, do NOT try to get it's MB, it will fail. */
681 return get_Block_MacroBlock(n);
684 /* returns the graph of a Block. */
685 ir_graph *(get_Block_irg)(const ir_node *block)
687 return _get_Block_irg(block);
690 ir_entity *create_Block_entity(ir_node *block)
693 assert(is_Block(block));
695 entity = block->attr.block.entity;
696 if (entity == NULL) {
700 glob = get_glob_type();
701 entity = new_entity(glob, id_unique("block_%u"), get_code_type());
702 set_entity_visibility(entity, ir_visibility_local);
703 set_entity_linkage(entity, IR_LINKAGE_CONSTANT);
704 nr = get_irp_next_label_nr();
705 set_entity_label(entity, nr);
706 set_entity_compiler_generated(entity, 1);
708 block->attr.block.entity = entity;
713 ir_entity *get_Block_entity(const ir_node *block)
715 assert(is_Block(block));
716 return block->attr.block.entity;
719 void set_Block_entity(ir_node *block, ir_entity *entity)
721 assert(is_Block(block));
722 assert(get_entity_type(entity) == get_code_type());
723 block->attr.block.entity = entity;
726 int has_Block_entity(const ir_node *block)
728 return block->attr.block.entity != NULL;
731 ir_node *(get_Block_phis)(const ir_node *block)
733 return _get_Block_phis(block);
736 void (set_Block_phis)(ir_node *block, ir_node *phi)
738 _set_Block_phis(block, phi);
741 void (add_Block_phi)(ir_node *block, ir_node *phi)
743 _add_Block_phi(block, phi);
746 /* Get the Block mark (single bit). */
747 unsigned (get_Block_mark)(const ir_node *block)
749 return _get_Block_mark(block);
752 /* Set the Block mark (single bit). */
753 void (set_Block_mark)(ir_node *block, unsigned mark)
755 _set_Block_mark(block, mark);
758 int get_End_n_keepalives(const ir_node *end)
761 return (get_irn_arity(end) - END_KEEPALIVE_OFFSET);
764 ir_node *get_End_keepalive(const ir_node *end, int pos)
767 return get_irn_n(end, pos + END_KEEPALIVE_OFFSET);
770 void add_End_keepalive(ir_node *end, ir_node *ka)
776 void set_End_keepalive(ir_node *end, int pos, ir_node *ka)
779 set_irn_n(end, pos + END_KEEPALIVE_OFFSET, ka);
782 /* Set new keep-alives */
783 void set_End_keepalives(ir_node *end, int n, ir_node *in[])
786 ir_graph *irg = get_irn_irg(end);
788 /* notify that edges are deleted */
789 for (i = END_KEEPALIVE_OFFSET; i < ARR_LEN(end->in) - 1; ++i) {
790 edges_notify_edge(end, i, NULL, end->in[i + 1], irg);
792 ARR_RESIZE(ir_node *, end->in, n + 1 + END_KEEPALIVE_OFFSET);
794 for (i = 0; i < n; ++i) {
795 end->in[1 + END_KEEPALIVE_OFFSET + i] = in[i];
796 edges_notify_edge(end, END_KEEPALIVE_OFFSET + i, end->in[1 + END_KEEPALIVE_OFFSET + i], NULL, irg);
800 /* Set new keep-alives from old keep-alives, skipping irn */
801 void remove_End_keepalive(ir_node *end, ir_node *irn)
803 int n = get_End_n_keepalives(end);
808 for (i = n -1; i >= 0; --i) {
809 ir_node *old_ka = end->in[1 + END_KEEPALIVE_OFFSET + i];
819 irg = get_irn_irg(end);
821 /* remove the edge */
822 edges_notify_edge(end, idx, NULL, irn, irg);
825 /* exchange with the last one */
826 ir_node *old = end->in[1 + END_KEEPALIVE_OFFSET + n - 1];
827 edges_notify_edge(end, n - 1, NULL, old, irg);
828 end->in[1 + END_KEEPALIVE_OFFSET + idx] = old;
829 edges_notify_edge(end, idx, old, NULL, irg);
831 /* now n - 1 keeps, 1 block input */
832 ARR_RESIZE(ir_node *, end->in, (n - 1) + 1 + END_KEEPALIVE_OFFSET);
835 /* remove Bads, NoMems and doublets from the keep-alive set */
836 void remove_End_Bads_and_doublets(ir_node *end)
839 int idx, n = get_End_n_keepalives(end);
845 irg = get_irn_irg(end);
846 pset_new_init(&keeps);
848 for (idx = n - 1; idx >= 0; --idx) {
849 ir_node *ka = get_End_keepalive(end, idx);
851 if (is_Bad(ka) || is_NoMem(ka) || pset_new_contains(&keeps, ka)) {
852 /* remove the edge */
853 edges_notify_edge(end, idx, NULL, ka, irg);
856 /* exchange with the last one */
857 ir_node *old = end->in[1 + END_KEEPALIVE_OFFSET + n - 1];
858 edges_notify_edge(end, n - 1, NULL, old, irg);
859 end->in[1 + END_KEEPALIVE_OFFSET + idx] = old;
860 edges_notify_edge(end, idx, old, NULL, irg);
864 pset_new_insert(&keeps, ka);
867 /* n keeps, 1 block input */
868 ARR_RESIZE(ir_node *, end->in, n + 1 + END_KEEPALIVE_OFFSET);
870 pset_new_destroy(&keeps);
873 void free_End(ir_node *end)
878 end->in = NULL; /* @@@ make sure we get an error if we use the
879 in array afterwards ... */
882 int get_Return_n_ress(const ir_node *node)
884 assert(is_Return(node));
885 return (get_irn_arity(node) - RETURN_RESULT_OFFSET);
888 ir_node **get_Return_res_arr(ir_node *node)
890 assert(is_Return(node));
891 if (get_Return_n_ress(node) > 0)
892 return (ir_node **)&(get_irn_in(node)[1 + RETURN_RESULT_OFFSET]);
898 void set_Return_n_res(ir_node *node, int results)
900 assert(is_Return(node));
904 ir_node *get_Return_res(const ir_node *node, int pos)
906 assert(is_Return(node));
907 assert(get_Return_n_ress(node) > pos);
908 return get_irn_n(node, pos + RETURN_RESULT_OFFSET);
911 void set_Return_res(ir_node *node, int pos, ir_node *res)
913 assert(is_Return(node));
914 set_irn_n(node, pos + RETURN_RESULT_OFFSET, res);
917 int (is_Const_null)(const ir_node *node)
919 return _is_Const_null(node);
922 int (is_Const_one)(const ir_node *node)
924 return _is_Const_one(node);
927 int (is_Const_all_one)(const ir_node *node)
929 return _is_Const_all_one(node);
933 /* The source language type. Must be an atomic type. Mode of type must
934 be mode of node. For tarvals from entities type must be pointer to
936 ir_type *get_Const_type(const ir_node *node)
938 assert(is_Const(node));
939 return node->attr.con.tp;
942 void set_Const_type(ir_node *node, ir_type *tp)
944 assert(is_Const(node));
945 if (tp != firm_unknown_type) {
946 assert(is_atomic_type(tp));
947 assert(get_type_mode(tp) == get_irn_mode(node));
949 node->attr.con.tp = tp;
953 symconst_kind get_SymConst_kind(const ir_node *node)
955 assert(is_SymConst(node));
956 return node->attr.symc.kind;
959 void set_SymConst_kind(ir_node *node, symconst_kind kind)
961 assert(is_SymConst(node));
962 node->attr.symc.kind = kind;
965 ir_type *get_SymConst_type(const ir_node *node)
967 /* the cast here is annoying, but we have to compensate for
969 ir_node *irn = (ir_node *)node;
970 assert(is_SymConst(node) &&
971 (SYMCONST_HAS_TYPE(get_SymConst_kind(node))));
972 return irn->attr.symc.sym.type_p;
975 void set_SymConst_type(ir_node *node, ir_type *tp)
977 assert(is_SymConst(node) &&
978 (SYMCONST_HAS_TYPE(get_SymConst_kind(node))));
979 node->attr.symc.sym.type_p = tp;
983 /* Only to access SymConst of kind symconst_addr_ent. Else assertion: */
984 ir_entity *get_SymConst_entity(const ir_node *node)
986 assert(is_SymConst(node) && SYMCONST_HAS_ENT(get_SymConst_kind(node)));
987 return node->attr.symc.sym.entity_p;
990 void set_SymConst_entity(ir_node *node, ir_entity *ent)
992 assert(is_SymConst(node) && SYMCONST_HAS_ENT(get_SymConst_kind(node)));
993 node->attr.symc.sym.entity_p = ent;
996 ir_enum_const *get_SymConst_enum(const ir_node *node)
998 assert(is_SymConst(node) && SYMCONST_HAS_ENUM(get_SymConst_kind(node)));
999 return node->attr.symc.sym.enum_p;
1002 void set_SymConst_enum(ir_node *node, ir_enum_const *ec)
1004 assert(is_SymConst(node) && SYMCONST_HAS_ENUM(get_SymConst_kind(node)));
1005 node->attr.symc.sym.enum_p = ec;
1008 union symconst_symbol
1009 get_SymConst_symbol(const ir_node *node)
1011 assert(is_SymConst(node));
1012 return node->attr.symc.sym;
1015 void set_SymConst_symbol(ir_node *node, union symconst_symbol sym)
1017 assert(is_SymConst(node));
1018 node->attr.symc.sym = sym;
1021 ir_type *get_SymConst_value_type(const ir_node *node)
1023 assert(is_SymConst(node));
1024 return node->attr.symc.tp;
1027 void set_SymConst_value_type(ir_node *node, ir_type *tp)
1029 assert(is_SymConst(node));
1030 node->attr.symc.tp = tp;
1033 int get_Sel_n_indexs(const ir_node *node)
1035 assert(is_Sel(node));
1036 return (get_irn_arity(node) - SEL_INDEX_OFFSET);
1039 ir_node **get_Sel_index_arr(ir_node *node)
1041 assert(is_Sel(node));
1042 if (get_Sel_n_indexs(node) > 0)
1043 return (ir_node **)& get_irn_in(node)[SEL_INDEX_OFFSET + 1];
1048 ir_node *get_Sel_index(const ir_node *node, int pos)
1050 assert(is_Sel(node));
1051 return get_irn_n(node, pos + SEL_INDEX_OFFSET);
1054 void set_Sel_index(ir_node *node, int pos, ir_node *index)
1056 assert(is_Sel(node));
1057 set_irn_n(node, pos + SEL_INDEX_OFFSET, index);
1061 /* For unary and binary arithmetic operations the access to the
1062 operands can be factored out. Left is the first, right the
1063 second arithmetic value as listed in tech report 0999-33.
1064 unops are: Minus, Abs, Not, Conv, Cast
1065 binops are: Add, Sub, Mul, Quot, DivMod, Div, Mod, And, Or, Eor, Shl,
1066 Shr, Shrs, Rotate, Cmp */
1069 ir_node **get_Call_param_arr(ir_node *node)
1071 assert(is_Call(node));
1072 return &get_irn_in(node)[CALL_PARAM_OFFSET + 1];
1075 int get_Call_n_params(const ir_node *node)
1077 assert(is_Call(node));
1078 return (get_irn_arity(node) - CALL_PARAM_OFFSET);
1081 ir_node *get_Call_param(const ir_node *node, int pos)
1083 assert(is_Call(node));
1084 return get_irn_n(node, pos + CALL_PARAM_OFFSET);
1087 void set_Call_param(ir_node *node, int pos, ir_node *param)
1089 assert(is_Call(node));
1090 set_irn_n(node, pos + CALL_PARAM_OFFSET, param);
1093 ir_node **get_Builtin_param_arr(ir_node *node)
1095 assert(is_Builtin(node));
1096 return &get_irn_in(node)[BUILDIN_PARAM_OFFSET + 1];
1099 int get_Builtin_n_params(const ir_node *node)
1101 assert(is_Builtin(node));
1102 return (get_irn_arity(node) - BUILDIN_PARAM_OFFSET);
1105 ir_node *get_Builtin_param(const ir_node *node, int pos)
1107 assert(is_Builtin(node));
1108 return get_irn_n(node, pos + BUILDIN_PARAM_OFFSET);
1111 void set_Builtin_param(ir_node *node, int pos, ir_node *param)
1113 assert(is_Builtin(node));
1114 set_irn_n(node, pos + BUILDIN_PARAM_OFFSET, param);
1117 /* Returns a human readable string for the ir_builtin_kind. */
1118 const char *get_builtin_kind_name(ir_builtin_kind kind)
1120 #define X(a) case a: return #a
1123 X(ir_bk_debugbreak);
1124 X(ir_bk_return_address);
1125 X(ir_bk_frame_address);
1135 X(ir_bk_inner_trampoline);
1142 int Call_has_callees(const ir_node *node)
1144 assert(is_Call(node));
1145 return ((get_irg_callee_info_state(get_irn_irg(node)) != irg_callee_info_none) &&
1146 (node->attr.call.callee_arr != NULL));
1149 int get_Call_n_callees(const ir_node *node)
1151 assert(is_Call(node) && node->attr.call.callee_arr);
1152 return ARR_LEN(node->attr.call.callee_arr);
1155 ir_entity *get_Call_callee(const ir_node *node, int pos)
1157 assert(pos >= 0 && pos < get_Call_n_callees(node));
1158 return node->attr.call.callee_arr[pos];
1161 void set_Call_callee_arr(ir_node *node, const int n, ir_entity ** arr)
1163 ir_graph *irg = get_irn_irg(node);
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 *, irg->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(is_Phi(node));
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));
1313 ir_node *get_Phi_pred(const ir_node *node, int pos)
1315 assert(is_Phi(node) || is_Phi0(node));
1316 return get_irn_n(node, pos);
1319 void set_Phi_pred(ir_node *node, int pos, ir_node *pred)
1321 assert(is_Phi(node) || is_Phi0(node));
1322 set_irn_n(node, pos, pred);
1325 ir_node *(get_Phi_next)(const ir_node *phi)
1327 return _get_Phi_next(phi);
1330 void (set_Phi_next)(ir_node *phi, ir_node *next)
1332 _set_Phi_next(phi, next);
1335 int is_memop(const ir_node *node)
1337 ir_opcode code = get_irn_opcode(node);
1338 return (code == iro_Load || code == iro_Store);
1341 ir_node *get_memop_mem(const ir_node *node)
1343 assert(is_memop(node));
1344 return get_irn_n(node, 0);
1347 void set_memop_mem(ir_node *node, ir_node *mem)
1349 assert(is_memop(node));
1350 set_irn_n(node, 0, mem);
1353 ir_node *get_memop_ptr(const ir_node *node)
1355 assert(is_memop(node));
1356 return get_irn_n(node, 1);
1359 void set_memop_ptr(ir_node *node, ir_node *ptr)
1361 assert(is_memop(node));
1362 set_irn_n(node, 1, ptr);
1365 ir_volatility get_Load_volatility(const ir_node *node)
1367 assert(is_Load(node));
1368 return node->attr.load.volatility;
1371 void set_Load_volatility(ir_node *node, ir_volatility volatility)
1373 assert(is_Load(node));
1374 node->attr.load.volatility = volatility;
1377 ir_align get_Load_align(const ir_node *node)
1379 assert(is_Load(node));
1380 return node->attr.load.aligned;
1383 void set_Load_align(ir_node *node, ir_align align)
1385 assert(is_Load(node));
1386 node->attr.load.aligned = align;
1390 ir_volatility get_Store_volatility(const ir_node *node)
1392 assert(is_Store(node));
1393 return node->attr.store.volatility;
1396 void set_Store_volatility(ir_node *node, ir_volatility volatility)
1398 assert(is_Store(node));
1399 node->attr.store.volatility = volatility;
1402 ir_align get_Store_align(const ir_node *node)
1404 assert(is_Store(node));
1405 return node->attr.store.aligned;
1408 void set_Store_align(ir_node *node, ir_align align)
1410 assert(is_Store(node));
1411 node->attr.store.aligned = align;
1415 ir_node **get_Sync_preds_arr(ir_node *node)
1417 assert(is_Sync(node));
1418 return (ir_node **)&(get_irn_in(node)[1]);
1421 int get_Sync_n_preds(const ir_node *node)
1423 assert(is_Sync(node));
1424 return (get_irn_arity(node));
1428 void set_Sync_n_preds(ir_node *node, int n_preds)
1430 assert(is_Sync(node));
1434 ir_node *get_Sync_pred(const ir_node *node, int pos)
1436 assert(is_Sync(node));
1437 return get_irn_n(node, pos);
1440 void set_Sync_pred(ir_node *node, int pos, ir_node *pred)
1442 assert(is_Sync(node));
1443 set_irn_n(node, pos, pred);
1446 /* Add a new Sync predecessor */
1447 void add_Sync_pred(ir_node *node, ir_node *pred)
1449 assert(is_Sync(node));
1450 add_irn_n(node, pred);
1453 /* Returns the source language type of a Proj node. */
1454 ir_type *get_Proj_type(const ir_node *n)
1456 ir_type *tp = firm_unknown_type;
1457 ir_node *pred = get_Proj_pred(n);
1459 switch (get_irn_opcode(pred)) {
1462 /* Deal with Start / Call here: we need to know the Proj Nr. */
1463 assert(get_irn_mode(pred) == mode_T);
1464 pred_pred = get_Proj_pred(pred);
1466 if (is_Start(pred_pred)) {
1467 ir_type *mtp = get_entity_type(get_irg_entity(get_irn_irg(pred_pred)));
1468 tp = get_method_param_type(mtp, get_Proj_proj(n));
1469 } else if (is_Call(pred_pred)) {
1470 ir_type *mtp = get_Call_type(pred_pred);
1471 tp = get_method_res_type(mtp, get_Proj_proj(n));
1474 case iro_Start: break;
1475 case iro_Call: break;
1477 ir_node *a = get_Load_ptr(pred);
1479 tp = get_entity_type(get_Sel_entity(a));
1487 long get_Proj_proj(const ir_node *node)
1489 assert(is_Proj(node));
1490 return node->attr.proj;
1493 void set_Proj_proj(ir_node *node, long proj)
1495 assert(is_Proj(node));
1496 node->attr.proj = proj;
1499 int (is_arg_Proj)(const ir_node *node)
1501 return _is_arg_Proj(node);
1504 ir_node **get_Tuple_preds_arr(ir_node *node)
1506 assert(is_Tuple(node));
1507 return (ir_node **)&(get_irn_in(node)[1]);
1510 int get_Tuple_n_preds(const ir_node *node)
1512 assert(is_Tuple(node));
1513 return get_irn_arity(node);
1516 ir_node *get_Tuple_pred(const ir_node *node, int pos)
1518 assert(is_Tuple(node));
1519 return get_irn_n(node, pos);
1522 void set_Tuple_pred(ir_node *node, int pos, ir_node *pred)
1524 assert(is_Tuple(node));
1525 set_irn_n(node, pos, pred);
1528 int get_ASM_n_input_constraints(const ir_node *node)
1530 assert(is_ASM(node));
1531 return ARR_LEN(node->attr.assem.input_constraints);
1534 int get_ASM_n_output_constraints(const ir_node *node)
1536 assert(is_ASM(node));
1537 return ARR_LEN(node->attr.assem.output_constraints);
1540 int get_ASM_n_clobbers(const ir_node *node)
1542 assert(is_ASM(node));
1543 return ARR_LEN(node->attr.assem.clobbers);
1546 /* returns the graph of a node */
1547 ir_graph *(get_irn_irg)(const ir_node *node)
1549 return _get_irn_irg(node);
1553 /*----------------------------------------------------------------*/
1554 /* Auxiliary routines */
1555 /*----------------------------------------------------------------*/
1557 ir_node *skip_Proj(ir_node *node)
1559 /* don't assert node !!! */
1564 node = get_Proj_pred(node);
1570 skip_Proj_const(const ir_node *node)
1572 /* don't assert node !!! */
1577 node = get_Proj_pred(node);
1582 ir_node *skip_Tuple(ir_node *node)
1587 if (is_Proj(node)) {
1588 pred = get_Proj_pred(node);
1590 if (is_Proj(pred)) { /* nested Tuple ? */
1591 pred = skip_Tuple(pred);
1593 if (is_Tuple(pred)) {
1594 node = get_Tuple_pred(pred, get_Proj_proj(node));
1597 } else if (is_Tuple(pred)) {
1598 node = get_Tuple_pred(pred, get_Proj_proj(node));
1605 /* returns operand of node if node is a Cast */
1606 ir_node *skip_Cast(ir_node *node)
1609 return get_Cast_op(node);
1613 /* returns operand of node if node is a Cast */
1614 const ir_node *skip_Cast_const(const ir_node *node)
1617 return get_Cast_op(node);
1621 /* returns operand of node if node is a Pin */
1622 ir_node *skip_Pin(ir_node *node)
1625 return get_Pin_op(node);
1629 /* returns operand of node if node is a Confirm */
1630 ir_node *skip_Confirm(ir_node *node)
1632 if (is_Confirm(node))
1633 return get_Confirm_value(node);
1637 /* skip all high-level ops */
1638 ir_node *skip_HighLevel_ops(ir_node *node)
1640 while (is_op_highlevel(get_irn_op(node))) {
1641 node = get_irn_n(node, 0);
1647 /* This should compact Id-cycles to self-cycles. It has the same (or less?) complexity
1648 * than any other approach, as Id chains are resolved and all point to the real node, or
1649 * all id's are self loops.
1651 * Note: This function takes 10% of mostly ANY the compiler run, so it's
1652 * a little bit "hand optimized".
1654 * Moreover, it CANNOT be switched off using get_opt_normalize() ...
1656 ir_node *skip_Id(ir_node *node)
1659 /* don't assert node !!! */
1661 if (!node || (node->op != op_Id)) return node;
1663 /* Don't use get_Id_pred(): We get into an endless loop for
1664 self-referencing Ids. */
1665 pred = node->in[0+1];
1667 if (pred->op != op_Id) return pred;
1669 if (node != pred) { /* not a self referencing Id. Resolve Id chain. */
1670 ir_node *rem_pred, *res;
1672 if (pred->op != op_Id) return pred; /* shortcut */
1675 assert(get_irn_arity (node) > 0);
1677 node->in[0+1] = node; /* turn us into a self referencing Id: shorten Id cycles. */
1678 res = skip_Id(rem_pred);
1679 if (is_Id(res)) /* self-loop */ return node;
1681 node->in[0+1] = res; /* Turn Id chain into Ids all referencing the chain end. */
1688 int (is_strictConv)(const ir_node *node)
1690 return _is_strictConv(node);
1693 /* Returns true if node is a SymConst node with kind symconst_addr_ent. */
1694 int (is_SymConst_addr_ent)(const ir_node *node)
1696 return _is_SymConst_addr_ent(node);
1699 /* Returns true if the operation manipulates control flow. */
1700 int is_cfop(const ir_node *node)
1702 return is_op_cfopcode(get_irn_op(node));
1705 /* Returns true if the operation can change the control flow because
1707 int is_fragile_op(const ir_node *node)
1709 return is_op_fragile(get_irn_op(node));
1712 /* Returns the memory operand of fragile operations. */
1713 ir_node *get_fragile_op_mem(ir_node *node)
1715 assert(node && is_fragile_op(node));
1717 switch (get_irn_opcode(node)) {
1728 return get_irn_n(node, pn_Generic_M);
1733 panic("should not be reached");
1737 /* Returns the result mode of a Div operation. */
1738 ir_mode *get_divop_resmod(const ir_node *node)
1740 switch (get_irn_opcode(node)) {
1741 case iro_Quot : return get_Quot_resmode(node);
1742 case iro_DivMod: return get_DivMod_resmode(node);
1743 case iro_Div : return get_Div_resmode(node);
1744 case iro_Mod : return get_Mod_resmode(node);
1746 panic("should not be reached");
1750 /* Returns true if the operation is a forking control flow operation. */
1751 int (is_irn_forking)(const ir_node *node)
1753 return _is_irn_forking(node);
1756 void (copy_node_attr)(ir_graph *irg, const ir_node *old_node, ir_node *new_node)
1758 _copy_node_attr(irg, old_node, new_node);
1761 /* Return the type associated with the value produced by n
1762 * if the node remarks this type as it is the case for
1763 * Cast, Const, SymConst and some Proj nodes. */
1764 ir_type *(get_irn_type)(ir_node *node)
1766 return _get_irn_type(node);
1769 /* Return the type attribute of a node n (SymConst, Call, Alloc, Free,
1771 ir_type *(get_irn_type_attr)(ir_node *node)
1773 return _get_irn_type_attr(node);
1776 /* Return the entity attribute of a node n (SymConst, Sel) or NULL. */
1777 ir_entity *(get_irn_entity_attr)(ir_node *node)
1779 return _get_irn_entity_attr(node);
1782 /* Returns non-zero for constant-like nodes. */
1783 int (is_irn_constlike)(const ir_node *node)
1785 return _is_irn_constlike(node);
1789 * Returns non-zero for nodes that are allowed to have keep-alives and
1790 * are neither Block nor PhiM.
1792 int (is_irn_keep)(const ir_node *node)
1794 return _is_irn_keep(node);
1798 * Returns non-zero for nodes that are always placed in the start block.
1800 int (is_irn_start_block_placed)(const ir_node *node)
1802 return _is_irn_start_block_placed(node);
1805 /* Returns non-zero for nodes that are machine operations. */
1806 int (is_irn_machine_op)(const ir_node *node)
1808 return _is_irn_machine_op(node);
1811 /* Returns non-zero for nodes that are machine operands. */
1812 int (is_irn_machine_operand)(const ir_node *node)
1814 return _is_irn_machine_operand(node);
1817 /* Returns non-zero for nodes that have the n'th user machine flag set. */
1818 int (is_irn_machine_user)(const ir_node *node, unsigned n)
1820 return _is_irn_machine_user(node, n);
1823 /* Returns non-zero for nodes that are CSE neutral to its users. */
1824 int (is_irn_cse_neutral)(const ir_node *node)
1826 return _is_irn_cse_neutral(node);
1829 /* Gets the string representation of the jump prediction .*/
1830 const char *get_cond_jmp_predicate_name(cond_jmp_predicate pred)
1832 #define X(a) case a: return #a
1834 X(COND_JMP_PRED_NONE);
1835 X(COND_JMP_PRED_TRUE);
1836 X(COND_JMP_PRED_FALSE);
1842 /** the get_type operation must be always implemented and return a firm type */
1843 static ir_type *get_Default_type(const ir_node *n)
1846 return get_unknown_type();
1849 /* Sets the get_type operation for an ir_op_ops. */
1850 ir_op_ops *firm_set_default_get_type(ir_opcode code, ir_op_ops *ops)
1853 case iro_Const: ops->get_type = get_Const_type; break;
1854 case iro_SymConst: ops->get_type = get_SymConst_value_type; break;
1855 case iro_Cast: ops->get_type = get_Cast_type; break;
1856 case iro_Proj: ops->get_type = get_Proj_type; break;
1858 /* not allowed to be NULL */
1859 if (! ops->get_type)
1860 ops->get_type = get_Default_type;
1866 /** Return the attribute type of a SymConst node if exists */
1867 static ir_type *get_SymConst_attr_type(const ir_node *self)
1869 symconst_kind kind = get_SymConst_kind(self);
1870 if (SYMCONST_HAS_TYPE(kind))
1871 return get_SymConst_type(self);
1875 /** Return the attribute entity of a SymConst node if exists */
1876 static ir_entity *get_SymConst_attr_entity(const ir_node *self)
1878 symconst_kind kind = get_SymConst_kind(self);
1879 if (SYMCONST_HAS_ENT(kind))
1880 return get_SymConst_entity(self);
1884 /** the get_type_attr operation must be always implemented */
1885 static ir_type *get_Null_type(const ir_node *n)
1888 return firm_unknown_type;
1891 /* Sets the get_type operation for an ir_op_ops. */
1892 ir_op_ops *firm_set_default_get_type_attr(ir_opcode code, ir_op_ops *ops)
1895 case iro_SymConst: ops->get_type_attr = get_SymConst_attr_type; break;
1896 case iro_Call: ops->get_type_attr = get_Call_type; break;
1897 case iro_Alloc: ops->get_type_attr = get_Alloc_type; break;
1898 case iro_Free: ops->get_type_attr = get_Free_type; break;
1899 case iro_Cast: ops->get_type_attr = get_Cast_type; break;
1901 /* not allowed to be NULL */
1902 if (! ops->get_type_attr)
1903 ops->get_type_attr = get_Null_type;
1909 /** the get_entity_attr operation must be always implemented */
1910 static ir_entity *get_Null_ent(const ir_node *n)
1916 /* Sets the get_type operation for an ir_op_ops. */
1917 ir_op_ops *firm_set_default_get_entity_attr(ir_opcode code, ir_op_ops *ops)
1920 case iro_SymConst: ops->get_entity_attr = get_SymConst_attr_entity; break;
1921 case iro_Sel: ops->get_entity_attr = get_Sel_entity; break;
1923 /* not allowed to be NULL */
1924 if (! ops->get_entity_attr)
1925 ops->get_entity_attr = get_Null_ent;
1931 /* Sets the debug information of a node. */
1932 void (set_irn_dbg_info)(ir_node *n, dbg_info *db)
1934 _set_irn_dbg_info(n, db);
1938 * Returns the debug information of an node.
1940 * @param n The node.
1942 dbg_info *(get_irn_dbg_info)(const ir_node *n)
1944 return _get_irn_dbg_info(n);
1947 /* checks whether a node represents a global address */
1948 int is_Global(const ir_node *node)
1950 return is_SymConst_addr_ent(node);
1953 /* returns the entity of a global address */
1954 ir_entity *get_Global_entity(const ir_node *node)
1956 return get_SymConst_entity(node);
1960 * Calculate a hash value of a node.
1962 unsigned firm_default_hash(const ir_node *node)
1967 /* hash table value = 9*(9*(9*(9*(9*arity+in[0])+in[1])+ ...)+mode)+code */
1968 h = irn_arity = get_irn_arity(node);
1970 /* consider all in nodes... except the block if not a control flow. */
1971 for (i = is_cfop(node) ? -1 : 0; i < irn_arity; ++i) {
1972 ir_node *pred = get_irn_n(node, i);
1973 if (is_irn_cse_neutral(pred))
1976 h = 9*h + HASH_PTR(pred);
1980 h = 9*h + HASH_PTR(get_irn_mode(node));
1982 h = 9*h + HASH_PTR(get_irn_op(node));
1985 } /* firm_default_hash */
1987 /* include generated code */
1988 #include "gen_irnode.c.inl"