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 -- private header.
23 * @author Martin Trapp, Christian Schaefer, Goetz Lindenmaier, Michael Beck
25 #ifndef FIRM_IR_IRNODE_T_H
26 #define FIRM_IR_IRNODE_T_H
31 #include "irgraph_t.h"
34 #include "iredges_t.h"
36 /* This section MUST come first, so the inline functions get used in this header. */
37 #define is_ir_node(thing) is_ir_node_(thing)
38 #define get_irn_arity(node) get_irn_arity_(node)
39 #define get_irn_n(node, n) get_irn_n_(node, n)
40 #define get_irn_mode(node) get_irn_mode_(node)
41 #define set_irn_mode(node, mode) set_irn_mode_(node, mode)
42 #define get_irn_irg(node) get_irn_irg_(node)
43 #define get_nodes_block(node) get_nodes_block_(node)
44 #define get_irn_op(node) get_irn_op_(node)
45 #define set_irn_op(node, op) set_irn_op_(node, op)
46 #define get_irn_opcode(node) get_irn_opcode_(node)
47 #define get_irn_visited(node) get_irn_visited_(node)
48 #define set_irn_visited(node, v) set_irn_visited_(node, v)
49 #define mark_irn_visited(node) mark_irn_visited_(node)
50 #define irn_visited(node) irn_visited_(node)
51 #define irn_visited_else_mark(node) irn_visited_else_mark_(node)
52 #define set_irn_link(node, link) set_irn_link_(node, link)
53 #define get_irn_link(node) get_irn_link_(node)
54 #define get_irn_pinned(node) get_irn_pinned_(node)
55 #define is_irn_pinned_in_irg(node) is_irn_pinned_in_irg_(node)
56 #define is_unop(node) is_unop_(node)
57 #define is_binop(node) is_binop_(node)
58 #define is_Proj(node) is_Proj_(node)
59 #define is_Phi(node) is_Phi_(node)
60 #define is_SymConst_addr_ent(node) is_SymConst_addr_ent_(node)
61 #define get_Block_n_cfgpreds(node) get_Block_n_cfgpreds_(node)
62 #define get_Block_cfgpred(node, pos) get_Block_cfgpred_(node, pos)
63 #define get_Block_cfgpred_block(node, pos) get_Block_cfgpred_block_(node, pos)
64 #define get_Block_block_visited(node) get_Block_block_visited_(node)
65 #define set_Block_block_visited(node, visit) set_Block_block_visited_(node, visit)
66 #define mark_Block_block_visited(node) mark_Block_block_visited_(node)
67 #define Block_block_visited(node) Block_block_visited_(node)
68 #define get_Block_irg(block) get_Block_irg_(block)
69 #define get_Const_tarval(node) get_Const_tarval_(node)
70 #define is_Const_null(node) is_Const_null_(node)
71 #define is_Const_one(node) is_Const_one_(node)
72 #define is_Const_all_one(node) is_Const_all_one_(node)
73 #define is_irn_forking(node) is_irn_forking_(node)
74 #define copy_node_attr(irg,oldn,newn) copy_node_attr_(irg,oldn,newn)
75 #define get_irn_type(node) get_irn_type_(node)
76 #define get_irn_type_attr(node) get_irn_type_attr_(node)
77 #define get_irn_entity_attr(node) get_irn_entity_attr_(node)
78 #define is_irn_constlike(node) is_irn_constlike_(node)
79 #define is_irn_keep(node) is_irn_keep_(node)
80 #define is_irn_start_block_placed(node) is_irn_start_block_placed_(node)
81 #define is_irn_cse_neutral(node) is_irn_cse_neutral_(node)
82 #define get_Cond_jmp_pred(node) get_Cond_jmp_pred_(node)
83 #define set_Cond_jmp_pred(node, pred) set_Cond_jmp_pred_(node, pred)
84 #define get_irn_generic_attr(node) get_irn_generic_attr_(node)
85 #define get_irn_generic_attr_const(node) get_irn_generic_attr_const_(node)
86 #define get_irn_idx(node) get_irn_idx_(node)
88 #define get_irn_deps(node) get_irn_deps_(node)
89 #define get_irn_dep(node, pos) get_irn_dep_(node, pos)
91 #define get_irn_ins_or_deps(node) get_irn_ins_or_deps_(node)
92 #define get_irn_in_or_dep(node, pos) get_irn_in_or_dep_(node, pos)
94 #define get_irn_dbg_info(node) get_irn_dbg_info_(node)
95 #define set_irn_dbg_info(node, db) set_irn_dbg_info_(node, db)
97 #define set_Block_phis(block, phi) set_Block_phis_(block, phi)
98 #define get_Block_phis(block) get_Block_phis_(block)
99 #define add_Block_phi(block, phi) add_Block_phi_(block, phi)
100 #define get_Block_mark(block) get_Block_mark_(block)
101 #define set_Block_mark(block, mark) set_Block_mark_(block, mark)
103 #define set_Phi_next(node, phi) set_Phi_next_(node, phi)
104 #define get_Phi_next(node) get_Phi_next_(node)
106 #define is_arg_Proj(node) is_arg_Proj_(node)
107 #define ir_switch_table_get_n_entries(table) ir_switch_table_get_n_entries_(table)
110 * Returns the array with the ins. The content of the array may not be
112 * Note that this function returns the whole in array including the
113 * block predecessor. So, it is NOT symmetric with set_irn_in().
115 ir_node **get_irn_in(const ir_node *node);
118 * Returns an array with the predecessors of the Block. Depending on
119 * the implementation of the graph data structure this can be a copy of
120 * the internal representation of predecessors as well as the internal
121 * array itself. Therefore writing to this array might obstruct the IR.
123 ir_node **get_Block_cfgpred_arr(ir_node *node);
125 /*-------------------------------------------------------------------*/
126 /* These function are most used in libfirm. Give them as static */
127 /* functions so they can be inlined. */
128 /*-------------------------------------------------------------------*/
131 * Checks whether a pointer points to a ir node.
132 * Intern version for libFirm.
134 static inline int is_ir_node_(const void *thing)
136 return (get_kind(thing) == k_ir_node);
139 static inline unsigned get_irn_idx_(const ir_node *node)
141 return node->node_idx;
145 * Gets the op of a node.
146 * Intern version for libFirm.
148 static inline ir_op *get_irn_op_(const ir_node *node)
154 /* include generated code */
155 #include "gen_irnode.h"
157 static inline void set_irn_op_(ir_node *node, ir_op *op)
163 /** Copies all attributes stored in the old node to the new node.
164 Assumes both have the same opcode and sufficient size. */
165 static inline void copy_node_attr_(ir_graph *irg, const ir_node *old_node,
168 ir_op *op = get_irn_op_(old_node);
170 /* must always exist */
171 op->ops.copy_attr(irg, old_node, new_node);
175 * Gets the opcode of a node.
176 * Intern version for libFirm.
178 static inline unsigned get_irn_opcode_(const ir_node *node)
180 assert(k_ir_node == get_kind(node));
182 return node->op->code;
186 * Returns the number of predecessors without the block predecessor.
187 * Intern version for libFirm.
189 static inline int get_irn_arity_(const ir_node *node)
191 return (int)(ARR_LEN(node->in) - 1);
195 * Intern version for libFirm.
197 static inline ir_node *get_irn_n_(const ir_node *node, int n)
201 assert(-1 <= n && n < get_irn_arity_(node));
203 nn = node->in[n + 1];
204 if (!is_Id(nn)) return nn;
206 return (node->in[n + 1] = skip_Id(nn));
210 * returns a hash value for a node
212 static inline unsigned hash_irn(const ir_node *node)
214 return (unsigned) get_irn_idx(node);
217 static inline int get_irn_deps_(const ir_node *node)
219 return node->deps ? (int)ARR_LEN(node->deps) : 0;
222 static inline ir_node *get_irn_dep_(const ir_node *node, int pos)
224 assert(node->deps && "dependency array node yet allocated. use add_irn_dep()");
225 assert(pos >= 0 && pos < (int)ARR_LEN(node->deps) && "dependency index out of range");
226 return node->deps[pos];
229 /* forward declaration outside iredges_t.h to avoid circular include problems */
230 void edges_notify_edge_kind(ir_node *src, int pos, ir_node *tgt, ir_node *old_tgt, ir_edge_kind_t kind, ir_graph *irg);
232 static inline int get_irn_ins_or_deps_(const ir_node *irn)
234 return get_irn_deps_(irn) + get_irn_arity_(irn);
237 static inline ir_node *get_irn_in_or_dep_(const ir_node *irn, int pos)
239 int n_in = get_irn_arity(irn);
240 return pos < n_in ? get_irn_n(irn, pos) : get_irn_dep(irn, pos - n_in);
244 * Gets the mode of a node.
245 * Intern version for libFirm.
247 static inline ir_mode *get_irn_mode_(const ir_node *node)
254 * Sets the mode of a node.
255 * Intern version of libFirm.
257 static inline void set_irn_mode_(ir_node *node, ir_mode *mode)
263 static inline int ir_has_irg_ref(const ir_node *node)
265 return is_Block(node) || is_Bad(node) || is_Anchor(node);
268 static inline ir_node *get_nodes_block_(const ir_node *node)
270 assert(!is_Block(node));
271 return get_irn_n(node, -1);
274 static inline ir_graph *get_irn_irg_(const ir_node *node)
276 if (! is_Block(node))
277 node = get_nodes_block(node);
278 assert(ir_has_irg_ref(node));
279 return node->attr.irg.irg;
283 * Gets the visited counter of a node.
284 * Intern version for libFirm.
286 static inline ir_visited_t get_irn_visited_(const ir_node *node)
289 return node->visited;
293 * Sets the visited counter of a node.
294 * Intern version for libFirm.
296 static inline void set_irn_visited_(ir_node *node, ir_visited_t visited)
299 node->visited = visited;
303 * Mark a node as visited in a graph.
304 * Intern version for libFirm.
306 static inline void mark_irn_visited_(ir_node *node)
308 node->visited = get_irn_irg(node)->visited;
312 * Returns non-zero if a node of was visited.
313 * Intern version for libFirm.
315 static inline int irn_visited_(const ir_node *node)
317 ir_graph *irg = get_irn_irg(node);
318 return node->visited >= irg->visited;
321 static inline int irn_visited_else_mark_(ir_node *node)
323 if (irn_visited_(node))
325 mark_irn_visited_(node);
330 * Sets the link of a node.
331 * Intern version of libFirm.
333 static inline void set_irn_link_(ir_node *node, void *link)
340 * Returns the link of a node.
341 * Intern version of libFirm.
343 static inline void *get_irn_link_(const ir_node *node)
345 assert(node && is_ir_node_(node));
350 * Returns whether the node _always_ must be pinned.
351 * I.e., the node is not floating after global cse.
353 * Intern version of libFirm.
355 static inline op_pin_state get_irn_pinned_(const ir_node *node)
358 assert(node && is_ir_node_(node));
360 state = get_op_pinned_(get_irn_op_(node));
362 if (state >= op_pin_state_exc_pinned)
363 return (op_pin_state)node->attr.except.pin_state;
368 static inline op_pin_state is_irn_pinned_in_irg_(const ir_node *node)
370 if (get_irg_pinned(get_irn_irg(node)) == op_pin_state_floats)
371 return get_irn_pinned(node);
372 return op_pin_state_pinned;
375 static inline int is_unop_(const ir_node *node)
377 assert(node && is_ir_node_(node));
378 return (node->op->opar == oparity_unary);
381 static inline int is_binop_(const ir_node *node)
383 assert(node && is_ir_node_(node));
384 return (node->op->opar == oparity_binary);
387 static inline int is_SymConst_addr_ent_(const ir_node *node)
389 return is_SymConst(node) && get_SymConst_kind(node) == symconst_addr_ent;
392 static inline int get_Block_n_cfgpreds_(const ir_node *node)
394 assert(is_Block_(node));
395 return get_irn_arity_(node);
398 static inline ir_node *get_Block_cfgpred_(const ir_node *node, int pos)
400 assert(is_Block_(node));
401 return get_irn_n_(node, pos);
404 /* Get the predecessor block.
406 * Returns the block corresponding to the predecessor pos.
408 * There are several ambiguities we resolve with this function:
409 * - The direct predecessor can be a Proj, which is not pinned.
410 * We walk from the predecessor to the next pinned node
411 * (skip_Proj) and return the block that node is in.
412 * - If we encounter the Bad node, this function does not return
413 * the Start block, but the Bad node.
415 static inline ir_node *get_Block_cfgpred_block_(const ir_node *node, int pos)
417 ir_node *res = get_Block_cfgpred(node, pos);
419 /* must return a Bad with mode_BB! */
420 ir_graph *irg = get_irn_irg(node);
421 return new_r_Bad(irg, mode_BB);
423 return get_nodes_block(skip_Proj(res));
427 static inline ir_visited_t get_Block_block_visited_(const ir_node *node)
429 assert(is_Block(node));
430 return node->attr.block.block_visited;
433 static inline void set_Block_block_visited_(ir_node *node, ir_visited_t visit)
435 assert(is_Block(node));
436 node->attr.block.block_visited = visit;
439 static inline ir_graph *get_Block_irg_(const ir_node *block)
441 assert(is_Block(block));
442 return block->attr.irg.irg;
445 static inline void mark_Block_block_visited_(ir_node *node)
447 ir_graph *irg = get_Block_irg(node);
448 node->attr.block.block_visited = get_irg_block_visited(irg);
451 static inline int Block_block_visited_(const ir_node *node)
453 ir_graph *irg = get_Block_irg(node);
454 return node->attr.block.block_visited >= get_irg_block_visited(irg);
457 static inline ir_tarval *get_Const_tarval_(const ir_node *node)
459 assert(is_Const(node));
460 return node->attr.con.tarval;
463 static inline int is_Const_null_(const ir_node *node)
465 return tarval_is_null(get_Const_tarval_(node));
468 static inline int is_Const_one_(const ir_node *node)
470 return tarval_is_one(get_Const_tarval_(node));
473 static inline int is_Const_all_one_(const ir_node *node)
475 return tarval_is_all_one(get_Const_tarval_(node));
478 static inline int is_irn_forking_(const ir_node *node)
480 return is_op_forking(get_irn_op_(node));
483 static inline ir_type *get_irn_type_attr_(ir_node *node)
485 return get_irn_op_(node)->ops.get_type_attr(node);
488 static inline ir_entity *get_irn_entity_attr_(ir_node *node)
490 return get_irn_op_(node)->ops.get_entity_attr(node);
493 static inline int is_irn_constlike_(const ir_node *node)
495 return is_op_constlike(get_irn_op_(node));
498 static inline int is_irn_keep_(const ir_node *node)
500 return is_op_keep(get_irn_op_(node));
503 static inline int is_irn_start_block_placed_(const ir_node *node)
505 return is_op_start_block_placed(get_irn_op_(node));
508 static inline int is_irn_cse_neutral_(const ir_node *node)
510 return is_op_cse_neutral(get_irn_op_(node));
513 static inline cond_jmp_predicate get_Cond_jmp_pred_(const ir_node *node)
515 assert(is_Cond(node));
516 return node->attr.cond.jmp_pred;
519 static inline void set_Cond_jmp_pred_(ir_node *node, cond_jmp_predicate pred)
521 assert(is_Cond(node));
522 node->attr.cond.jmp_pred = pred;
525 static inline void *get_irn_generic_attr_(ir_node *node)
530 static inline const void *get_irn_generic_attr_const_(const ir_node *node)
535 static inline dbg_info *get_irn_dbg_info_(const ir_node *n)
540 static inline void set_irn_dbg_info_(ir_node *n, dbg_info *db)
546 * Sets the Phi list of a block.
548 static inline void set_Block_phis_(ir_node *block, ir_node *phi)
550 assert(is_Block_(block));
551 assert(phi == NULL || is_Phi_(phi));
552 block->attr.block.phis = phi;
556 * Returns the link of a node.
557 * Intern version of libFirm.
559 static inline ir_node *get_Block_phis_(const ir_node *block)
561 assert(is_Block_(block));
562 return block->attr.block.phis;
565 static inline void set_Phi_next_(ir_node *phi, ir_node *next)
567 assert(is_Phi_(phi));
568 phi->attr.phi.next = next;
571 static inline ir_node *get_Phi_next_(const ir_node *phi)
573 assert(is_Phi_(phi));
574 return phi->attr.phi.next;
577 /** Add a Phi node to the list of Block Phi's. */
578 static inline void add_Block_phi_(ir_node *block, ir_node *phi)
580 assert(is_Block_(block));
581 set_Phi_next_(phi, get_Block_phis_(block));
582 set_Block_phis_(block, phi);
585 /** Get the Block mark (single bit). */
586 static inline unsigned get_Block_mark_(const ir_node *block)
588 assert(is_Block_(block));
589 return block->attr.block.marked;
592 /** Set the Block mark (single bit). */
593 static inline void set_Block_mark_(ir_node *block, unsigned mark)
595 assert(is_Block_(block));
596 block->attr.block.marked = mark;
599 /** Returns non-zero if a node is a routine parameter. */
600 static inline int is_arg_Proj_(const ir_node *node)
604 node = get_Proj_pred(node);
607 return pn_Start_T_args == get_Proj_proj(node) && is_Start(get_Proj_pred(node));
610 static inline size_t ir_switch_table_get_n_entries_(const ir_switch_table *table)
612 return table->n_entries;
615 static inline ir_switch_table_entry *ir_switch_table_get_entry(
616 ir_switch_table *table, size_t entry)
618 assert(entry < table->n_entries);
619 return &table->entries[entry];
622 static inline const ir_switch_table_entry *ir_switch_table_get_entry_const(
623 const ir_switch_table *table, size_t entry)
625 assert(entry < table->n_entries);
626 return &table->entries[entry];
629 void ir_register_getter_ops(void);
632 * because firm keepalive edges are a broken concept, we have to make sure that
633 * nodes which are only held by a keepalive edges are never moved again.
634 * This function returns true in this case.
636 bool only_used_by_keepalive(const ir_node *node);