tos = 0;
}
-#if 0
/**
* Frees the stack.
*/
-static INLINE void free_stack(void) {
- if (stack != NULL) {
- DEL_ARR_F(stack);
- stack = NULL;
- }
- tos = 0;
+static void finish_stack(void) {
+ DEL_ARR_F(stack);
+ stack = NULL;
}
-#endif
/**
* push a node onto the stack
*/
}
+static INLINE void finish_scc(void)
+{
+ finish_stack();
+}
+
#ifdef INTERPROCEDURAL_VIEW
static INLINE void init_ip_scc(struct obstack *obst) {
init_scc_common();
inc_irg_visited(irg);
scc(get_irg_end(irg));
+
+ finish_scc();
obstack_free(&temp, NULL);
assert(head_rem == current_loop);
*
* Returns non-zero, if the node n is not changed in the loop block
* belongs to or in inner loops of this blocks loop. */
-int is_loop_invariant(ir_node *n, ir_node *block) {
+int is_loop_invariant(const ir_node *n, const ir_node *block) {
ir_loop *l = get_irn_loop(block);
- ir_node *b = is_Block(n) ? n : get_nodes_block(n);
+ const ir_node *b = is_Block(n) ? n : get_nodes_block(n);
return !is_loop_variant(l, get_irn_loop(b));
}