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
26 #ifndef FIRM_IR_IRNODE_T_H
27 #define FIRM_IR_IRNODE_T_H
32 #include "irgraph_t.h"
35 #include "iredges_t.h"
38 * Returns the array with the ins. The content of the array may not be
40 * Note that this function returns the whole in array including the
41 * block predecessor. So, it is NOT symmetric with set_irn_in().
43 ir_node **get_irn_in (const ir_node *node);
46 * The amount of additional space for custom data to be allocated upon creating a new node.
48 extern unsigned firm_add_node_size;
51 * Sets the get_type_attr operation for an ir_op_ops.
53 * @param code the opcode for the default operation
54 * @param ops the operations initialized
59 ir_op_ops *firm_set_default_get_type_attr(ir_opcode code, ir_op_ops *ops);
62 * Sets the get_entity_attr operation for an ir_op_ops.
64 * @param code the opcode for the default operation
65 * @param ops the operations initialized
70 ir_op_ops *firm_set_default_get_entity_attr(ir_opcode code, ir_op_ops *ops);
73 * Returns an array with the predecessors of the Block. Depending on
74 * the implementation of the graph data structure this can be a copy of
75 * the internal representation of predecessors as well as the internal
76 * array itself. Therefore writing to this array might obstruct the IR.
78 ir_node **get_Block_cfgpred_arr(ir_node *node);
80 /*-------------------------------------------------------------------*/
81 /* These function are most used in libfirm. Give them as static */
82 /* functions so they can be inlined. */
83 /*-------------------------------------------------------------------*/
86 * Checks whether a pointer points to a ir node.
87 * Intern version for libFirm.
89 static inline int _is_ir_node(const void *thing)
91 return (get_kind(thing) == k_ir_node);
95 * Gets the op of a node.
96 * Intern version for libFirm.
98 static inline ir_op *_get_irn_op(const ir_node *node)
104 static inline void _set_irn_op(ir_node *node, ir_op *op)
110 /** Copies all attributes stored in the old node to the new node.
111 Assumes both have the same opcode and sufficient size. */
112 static inline void _copy_node_attr(ir_graph *irg, const ir_node *old_node,
115 ir_op *op = _get_irn_op(old_node);
117 /* must always exist */
118 op->ops.copy_attr(irg, old_node, new_node);
122 * Gets the opcode of a node.
123 * Intern version for libFirm.
125 static inline unsigned _get_irn_opcode(const ir_node *node)
127 assert(k_ir_node == get_kind(node));
129 return node->op->code;
133 * Returns the number of predecessors without the block predecessor.
134 * Intern version for libFirm.
136 static inline int _get_irn_arity(const ir_node *node)
138 return ARR_LEN(node->in) - 1;
142 * Intern version for libFirm.
144 static inline ir_node *_get_irn_n(const ir_node *node, int n)
148 assert(-1 <= n && n < _get_irn_arity(node));
150 nn = node->in[n + 1];
152 /* only block and Anchor inputs are allowed to be NULL */
153 assert((is_Anchor(node) || n == -1) && "NULL input of a node");
156 if (nn->op != op_Id) return nn;
158 return (node->in[n + 1] = skip_Id(nn));
162 * returns a hash value for a node
164 static inline unsigned hash_irn(const ir_node *node)
166 return (unsigned) get_irn_idx(node);
169 static inline int _get_irn_deps(const ir_node *node) {
170 return node->deps ? ARR_LEN(node->deps) : 0;
173 static inline ir_node *_get_irn_dep(const ir_node *node, int pos) {
174 assert(node->deps && "dependency array node yet allocated. use add_irn_dep()");
175 assert(pos >= 0 && pos < ARR_LEN(node->deps) && "dependency index out of range");
176 return node->deps[pos];
179 /* forward declaration outside iredges_t.h to avoid circular include problems */
180 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);
182 static inline void _set_irn_dep(ir_node *node, int pos, ir_node *dep)
186 assert(node->deps && "dependency array node yet allocated. use add_irn_dep()");
187 assert(pos >= 0 && pos < ARR_LEN(node->deps) && "dependency index out of range");
188 old = node->deps[pos];
189 node->deps[pos] = dep;
190 edges_notify_edge_kind(node, pos, dep, old, EDGE_KIND_DEP, get_irn_irg(node));
194 static inline int _get_irn_ins_or_deps(const ir_node *irn)
196 return _get_irn_deps(irn) + _get_irn_arity(irn);
199 static inline ir_node *_get_irn_in_or_dep(const ir_node *irn, int pos)
201 int n_in = get_irn_arity(irn);
202 return pos < n_in ? get_irn_n(irn, pos) : get_irn_dep(irn, pos - n_in);
206 * Gets the mode of a node.
207 * Intern version for libFirm.
209 static inline ir_mode *_get_irn_mode(const ir_node *node)
216 * Sets the mode of a node.
217 * Intern version of libFirm.
219 static inline void _set_irn_mode(ir_node *node, ir_mode *mode)
225 static inline int ir_has_irg_ref(const ir_node *node)
227 return is_Block(node) || is_Bad(node) || is_Anchor(node);
230 static inline ir_graph *_get_irn_irg(const ir_node *node)
233 * Do not use get_nodes_block() here, because this
234 * will check the pinned state.
235 * However even a 'wrong' block is always in the proper irg.
237 if (! is_Block(node))
238 node = get_irn_n(node, -1);
239 assert(ir_has_irg_ref(node));
240 return node->attr.irg.irg;
243 static inline ir_node *_get_nodes_block(const ir_node *node)
245 assert(!is_Block(node));
246 return get_irn_n(node, -1);
250 * Gets the visited counter of a node.
251 * Intern version for libFirm.
253 static inline ir_visited_t _get_irn_visited(const ir_node *node)
256 return node->visited;
260 * Sets the visited counter of a node.
261 * Intern version for libFirm.
263 static inline void _set_irn_visited(ir_node *node, ir_visited_t visited)
266 node->visited = visited;
270 * Mark a node as visited in a graph.
271 * Intern version for libFirm.
273 static inline void _mark_irn_visited(ir_node *node)
275 node->visited = get_irn_irg(node)->visited;
279 * Returns non-zero if a node of was visited.
280 * Intern version for libFirm.
282 static inline int _irn_visited(const ir_node *node)
284 ir_graph *irg = get_irn_irg(node);
285 return node->visited >= irg->visited;
288 static inline int _irn_visited_else_mark(ir_node *node)
290 if (_irn_visited(node))
292 _mark_irn_visited(node);
297 * Sets the link of a node.
298 * Intern version of libFirm.
300 static inline void _set_irn_link(ir_node *node, void *link)
307 * Returns the link of a node.
308 * Intern version of libFirm.
310 static inline void *_get_irn_link(const ir_node *node)
312 assert(node && _is_ir_node(node));
317 * Returns whether the node _always_ must be pinned.
318 * I.e., the node is not floating after global cse.
320 * Intern version of libFirm.
322 static inline op_pin_state _get_irn_pinned(const ir_node *node)
325 assert(node && _is_ir_node(node));
327 state = _get_op_pinned(_get_irn_op(node));
329 if (state >= op_pin_state_exc_pinned)
330 return node->attr.except.pin_state;
335 static inline op_pin_state _is_irn_pinned_in_irg(const ir_node *node)
337 if (get_irg_pinned(get_irn_irg(node)) == op_pin_state_floats)
338 return get_irn_pinned(node);
339 return op_pin_state_pinned;
342 /* include generated code */
343 #include "gen_irnode.h"
345 static inline int _is_unop(const ir_node *node)
347 assert(node && _is_ir_node(node));
348 return (node->op->opar == oparity_unary);
351 static inline int _is_binop(const ir_node *node)
353 assert(node && _is_ir_node(node));
354 return (node->op->opar == oparity_binary);
357 static inline int _is_strictConv(const ir_node *node)
359 return _is_Conv(node) && get_Conv_strict(node);
362 static inline int _is_SymConst_addr_ent(const ir_node *node)
364 return is_SymConst(node) && get_SymConst_kind(node) == symconst_addr_ent;
367 static inline int _get_Block_n_cfgpreds(const ir_node *node)
369 assert(_is_Block(node));
370 return _get_irn_arity(node);
373 static inline ir_node *_get_Block_cfgpred(const ir_node *node, int pos)
375 assert(0 <= pos && pos < get_irn_arity(node));
376 assert(_is_Block(node));
377 return _get_irn_n(node, pos);
380 /* Get the predecessor block.
382 * Returns the block corresponding to the predecessor pos.
384 * There are several ambiguities we resolve with this function:
385 * - The direct predecessor can be a Proj, which is not pinned.
386 * We walk from the predecessor to the next pinned node
387 * (skip_Proj) and return the block that node is in.
388 * - If we encounter the Bad node, this function does not return
389 * the Start block, but the Bad node.
391 static inline ir_node *_get_Block_cfgpred_block(const ir_node *node, int pos)
393 ir_node *res = skip_Proj(get_Block_cfgpred(node, pos));
395 res = get_nodes_block(res);
399 static inline ir_visited_t _get_Block_block_visited(const ir_node *node)
401 assert(is_Block(node));
402 return node->attr.block.block_visited;
405 static inline void _set_Block_block_visited(ir_node *node, ir_visited_t visit)
407 assert(is_Block(node));
408 node->attr.block.block_visited = visit;
411 static inline void _mark_Block_block_visited(ir_node *node)
413 ir_graph *irg = get_Block_irg(node);
414 node->attr.block.block_visited = get_irg_block_visited(irg);
417 static inline int _Block_block_visited(const ir_node *node)
419 ir_graph *irg = get_Block_irg(node);
420 return node->attr.block.block_visited >= get_irg_block_visited(irg);
423 static inline ir_node *_set_Block_dead(ir_node *block)
425 assert(_get_irn_op(block) == op_Block);
426 block->attr.block.dom.dom_depth = -1;
427 block->attr.block.is_dead = 1;
431 static inline int _is_Block_dead(const ir_node *block)
433 ir_op *op = _get_irn_op(block);
435 /* we can have Bad, Anchor and Block nodes as block input */
438 } else if (op == op_Anchor) {
441 assert(op == op_Block);
442 return block->attr.block.is_dead;
446 static inline ir_graph *_get_Block_irg(const ir_node *block)
448 assert(is_Block(block));
449 return block->attr.irg.irg;
452 static inline ir_tarval *_get_Const_tarval(const ir_node *node) {
453 assert(_get_irn_op(node) == op_Const);
454 return node->attr.con.tarval;
457 static inline int _is_Const_null(const ir_node *node) {
458 return tarval_is_null(_get_Const_tarval(node));
461 static inline int _is_Const_one(const ir_node *node) {
462 return tarval_is_one(_get_Const_tarval(node));
465 static inline int _is_Const_all_one(const ir_node *node) {
466 return tarval_is_all_one(_get_Const_tarval(node));
469 static inline int _is_irn_forking(const ir_node *node) {
470 return is_op_forking(_get_irn_op(node));
473 static inline ir_type *_get_irn_type_attr(ir_node *node) {
474 return _get_irn_op(node)->ops.get_type_attr(node);
477 static inline ir_entity *_get_irn_entity_attr(ir_node *node) {
478 return _get_irn_op(node)->ops.get_entity_attr(node);
481 static inline int _is_irn_constlike(const ir_node *node) {
482 return is_op_constlike(_get_irn_op(node));
485 static inline int _is_irn_always_opt(const ir_node *node) {
486 return is_op_always_opt(_get_irn_op(node));
489 static inline int _is_irn_keep(const ir_node *node) {
490 return is_op_keep(_get_irn_op(node));
493 static inline int _is_irn_start_block_placed(const ir_node *node) {
494 return is_op_start_block_placed(_get_irn_op(node));
497 static inline int _is_irn_machine_op(const ir_node *node) {
498 return is_op_machine(_get_irn_op(node));
501 static inline int _is_irn_machine_operand(const ir_node *node) {
502 return is_op_machine_operand(_get_irn_op(node));
505 static inline int _is_irn_machine_user(const ir_node *node, unsigned n) {
506 return is_op_machine_user(_get_irn_op(node), n);
509 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) {
514 assert(_get_irn_op(node) == op_Cond);
515 return node->attr.cond.jmp_pred;
518 static inline void _set_Cond_jmp_pred(ir_node *node, cond_jmp_predicate pred) {
519 assert(_get_irn_op(node) == op_Cond);
520 node->attr.cond.jmp_pred = pred;
523 static inline void *_get_irn_generic_attr(ir_node *node) {
527 static inline const void *_get_irn_generic_attr_const(const ir_node *node) {
531 static inline unsigned _get_irn_idx(const ir_node *node) {
532 return node->node_idx;
535 static inline dbg_info *_get_irn_dbg_info(const ir_node *n) {
537 } /* get_irn_dbg_info */
539 static inline void _set_irn_dbg_info(ir_node *n, dbg_info *db) {
544 * Sets the Phi list of a block.
546 static inline void _set_Block_phis(ir_node *block, ir_node *phi)
548 assert(_is_Block(block));
549 assert(phi == NULL || _is_Phi(phi));
550 block->attr.block.phis = phi;
554 * Returns the link of a node.
555 * Intern version of libFirm.
557 static inline ir_node *_get_Block_phis(const ir_node *block)
559 assert(_is_Block(block));
560 return block->attr.block.phis;
563 static inline void _set_Phi_next(ir_node *phi, ir_node *next)
565 assert(_is_Phi(phi));
566 phi->attr.phi.next = next;
569 static inline ir_node *_get_Phi_next(const ir_node *phi)
571 assert(_is_Phi(phi));
572 return phi->attr.phi.next;
575 /** Add a Phi node to the list of Block Phi's. */
576 static inline void _add_Block_phi(ir_node *block, ir_node *phi)
578 _set_Phi_next(phi, _get_Block_phis(block));
579 _set_Block_phis(block, phi);
582 /** Get the Block mark (single bit). */
583 static inline unsigned _get_Block_mark(const ir_node *block)
585 assert(_is_Block(block));
586 return block->attr.block.marked;
589 /** Set the Block mark (single bit). */
590 static inline void _set_Block_mark(ir_node *block, unsigned mark)
592 assert(_is_Block(block));
593 block->attr.block.marked = mark;
596 /** Returns non-zero if a node is a routine parameter. */
597 static inline int _is_arg_Proj(const ir_node *node)
601 node = get_Proj_pred(node);
604 return pn_Start_T_args == get_Proj_proj(node) && is_Start(get_Proj_pred(node));
607 /** initialize ir_node module */
608 void init_irnode(void);
610 /* this section MUST contain all inline functions */
611 #define is_ir_node(thing) _is_ir_node(thing)
612 #define get_irn_arity(node) _get_irn_arity(node)
613 #define get_irn_n(node, n) _get_irn_n(node, n)
614 #define get_irn_mode(node) _get_irn_mode(node)
615 #define set_irn_mode(node, mode) _set_irn_mode(node, mode)
616 #define get_irn_irg(node) _get_irn_irg(node)
617 #define get_nodes_block(node) _get_nodes_block(node)
618 #define get_irn_op(node) _get_irn_op(node)
619 #define set_irn_op(node, op) _set_irn_op(node, op)
620 #define get_irn_opcode(node) _get_irn_opcode(node)
621 #define get_irn_visited(node) _get_irn_visited(node)
622 #define set_irn_visited(node, v) _set_irn_visited(node, v)
623 #define mark_irn_visited(node) _mark_irn_visited(node)
624 #define irn_visited(node) _irn_visited(node)
625 #define irn_visited_else_mark(node) _irn_visited_else_mark(node)
626 #define set_irn_link(node, link) _set_irn_link(node, link)
627 #define get_irn_link(node) _get_irn_link(node)
628 #define get_irn_pinned(node) _get_irn_pinned(node)
629 #define is_irn_pinned_in_irg(node) _is_irn_pinned_in_irg(node)
630 #define is_unop(node) _is_unop(node)
631 #define is_binop(node) _is_binop(node)
632 #define is_Proj(node) _is_Proj(node)
633 #define is_Phi(node) _is_Phi(node)
634 #define is_strictConv(node) _is_strictConv(node)
635 #define is_SymConst_addr_ent(node) _is_SymConst_addr_ent(node)
636 #define get_Block_n_cfgpreds(node) _get_Block_n_cfgpreds(node)
637 #define get_Block_cfgpred(node, pos) _get_Block_cfgpred(node, pos)
638 #define get_Block_cfgpred_block(node, pos) _get_Block_cfgpred_block(node, pos)
639 #define get_Block_block_visited(node) _get_Block_block_visited(node)
640 #define set_Block_block_visited(node, visit) _set_Block_block_visited(node, visit)
641 #define mark_Block_block_visited(node) _mark_Block_block_visited(node)
642 #define Block_block_visited(node) _Block_block_visited(node)
643 #define set_Block_dead(block) _set_Block_dead(block)
644 #define is_Block_dead(block) _is_Block_dead(block)
645 #define get_Block_irg(block) _get_Block_irg(block)
646 #define get_Const_tarval(node) _get_Const_tarval(node)
647 #define is_Const_null(node) _is_Const_null(node)
648 #define is_Const_one(node) _is_Const_one(node)
649 #define is_Const_all_one(node) _is_Const_all_one(node)
650 #define is_irn_forking(node) _is_irn_forking(node)
651 #define copy_node_attr(irg,oldn,newn) _copy_node_attr(irg,oldn,newn)
652 #define get_irn_type(node) _get_irn_type(node)
653 #define get_irn_type_attr(node) _get_irn_type_attr(node)
654 #define get_irn_entity_attr(node) _get_irn_entity_attr(node)
655 #define is_irn_constlike(node) _is_irn_constlike(node)
656 #define is_irn_always_opt(node) _is_irn_always_opt(node)
657 #define is_irn_keep(node) _is_irn_keep(node)
658 #define is_irn_start_block_placed(node) _is_irn_start_block_placed(node)
659 #define is_irn_machine_op(node) _is_irn_machine_op(node)
660 #define is_irn_machine_operand(node) _is_irn_machine_operand(node)
661 #define is_irn_machine_user(node, n) _is_irn_machine_user(node, n)
662 #define is_irn_cse_neutral(node) _is_irn_cse_neutral(node)
663 #define get_Cond_jmp_pred(node) _get_Cond_jmp_pred(node)
664 #define set_Cond_jmp_pred(node, pred) _set_Cond_jmp_pred(node, pred)
665 #define get_irn_generic_attr(node) _get_irn_generic_attr(node)
666 #define get_irn_generic_attr_const(node) _get_irn_generic_attr_const(node)
667 #define get_irn_idx(node) _get_irn_idx(node)
669 #define get_irn_deps(node) _get_irn_deps(node)
670 #define set_irn_dep(node, pos, dep) _set_irn_dep(node, pos, dep)
671 #define get_irn_dep(node, pos) _get_irn_dep(node, pos)
673 #define get_irn_ins_or_deps(node) _get_irn_ins_or_deps(node)
674 #define get_irn_in_or_dep(node, pos) _get_irn_in_or_dep(node, pos)
676 #define get_irn_dbg_info(node) _get_irn_dbg_info(node)
677 #define set_irn_dbg_info(node, db) _set_irn_dbg_info(node, db)
679 #define set_Block_phis(block, phi) _set_Block_phis(block, phi)
680 #define get_Block_phis(block) _get_Block_phis(block)
681 #define add_Block_phi(block, phi) _add_Block_phi(block, phi)
682 #define get_Block_mark(block) _get_Block_mark(block)
683 #define set_Block_mark(block, mark) _set_Block_mark(block, mark)
685 #define set_Phi_next(node, phi) _set_Phi_next(node, phi)
686 #define get_Phi_next(node) _get_Phi_next(node)
688 #define is_arg_Proj(node) _is_arg_Proj(node)