2 * Copyright (C) 1995-2011 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 Loop datastructure and access functions -- private stuff.
23 * @author Goetz Lindenmaier
25 * @version $Id: irloop_t.h 17143 2008-01-02 20:56:33Z beck $
36 void add_loop_son(ir_loop *loop, ir_loop *son)
39 assert(loop && loop->kind == k_ir_loop);
40 assert(get_kind(son) == k_ir_loop);
42 ARR_APP1(loop_element, loop->children, lson);
43 loop->flags |= loop_outer_loop;
46 void add_loop_node(ir_loop *loop, ir_node *n)
50 assert(loop && loop->kind == k_ir_loop);
51 ARR_APP1(loop_element, loop->children, ln);
54 void add_loop_irg(ir_loop *loop, ir_graph *irg)
58 assert(loop && loop->kind == k_ir_loop);
59 ARR_APP1(loop_element, loop->children, ln);
63 * Mature all loops by removing the flexible arrays of a loop.
65 * @param loop the loop to mature
66 * @param obst an obstack, where the new arrays are allocated on
68 void mature_loops(ir_loop *loop, struct obstack *obst)
72 loop_element *new_children = DUP_ARR_D(loop_element, obst, loop->children);
73 DEL_ARR_F(loop->children);
74 loop->children = new_children;
76 /* mature child loops */
77 for (i = ARR_LEN(new_children); i > 0;) {
78 loop_element child = new_children[--i];
80 if (*child.kind == k_ir_loop) {
81 mature_loops(child.son, obst);
86 /* Returns outer loop, itself if outermost. */
87 ir_loop *(get_loop_outer_loop)(const ir_loop *loop)
89 return _get_loop_outer_loop(loop);
92 /* Returns nesting depth of this loop */
93 unsigned (get_loop_depth)(const ir_loop *loop)
95 return _get_loop_depth(loop);
98 /* Returns the number of elements contained in loop. */
99 size_t get_loop_n_elements(const ir_loop *loop)
101 assert(loop && loop->kind == k_ir_loop);
102 return(ARR_LEN(loop->children));
105 loop_element get_loop_element(const ir_loop *loop, size_t pos)
107 assert(loop && loop->kind == k_ir_loop && pos < ARR_LEN(loop->children));
108 return(loop -> children[pos]);
112 * Sets the loop for a node.
114 void set_irn_loop(ir_node *n, ir_loop *loop)
119 ir_loop *(get_irn_loop)(const ir_node *n)
121 return _get_irn_loop(n);
124 long get_loop_loop_nr(const ir_loop *loop)
126 assert(loop && loop->kind == k_ir_loop);
128 return loop->loop_nr;
134 void set_loop_link(ir_loop *loop, void *link)
136 assert(loop && loop->kind == k_ir_loop);
140 void *get_loop_link(const ir_loop *loop)
142 assert(loop && loop->kind == k_ir_loop);
146 int (is_ir_loop)(const void *thing)
148 return _is_ir_loop(thing);
151 /* The outermost loop is remarked in the surrounding graph. */
152 void (set_irg_loop)(ir_graph *irg, ir_loop *loop)
154 _set_irg_loop(irg, loop);
157 /* Returns the root loop info (if exists) for an irg. */
158 ir_loop *(get_irg_loop)(const ir_graph *irg)
160 return _get_irg_loop(irg);
164 * Allocates a new loop as son of father on the given obstack.
165 * If father is equal NULL, a new root loop is created.
167 ir_loop *alloc_loop(ir_loop *father, struct obstack *obst)
171 son = OALLOCZ(obst, ir_loop);
172 son->kind = k_ir_loop;
173 son->children = NEW_ARR_F(loop_element, 0);
176 son->outer_loop = father;
177 add_loop_son(father, son);
178 son->depth = father->depth + 1;
179 } else { /* The root loop */
180 son->outer_loop = son;
185 son->loop_nr = get_irp_new_node_nr();