/*
- * Copyright (C) 1995-2007 University of Karlsruhe. All right reserved.
+ * Copyright (C) 1995-2008 University of Karlsruhe. All right reserved.
*
* This file is part of libFirm.
*
ir_node *p;
unsigned max = 0;
unsigned children = 0;
+ (void) data;
for(p = bi->first; p; p = get_dom_info(p)->next) {
unsigned max_p = get_dom_info(p)->max_subtree_pre_num;
ir_node *p;
unsigned max = 0;
unsigned children = 0;
+ (void) data;
for(p = bi->first; p; p = get_pdom_info(p)->next) {
unsigned max_p = get_pdom_info(p)->max_subtree_pre_num;
void free_dom(ir_graph *irg) {
/* Update graph state */
- assert(get_irg_phase_state(current_ir_graph) != phase_building);
- current_ir_graph->dom_state = dom_none;
+ assert(get_irg_phase_state(irg) != phase_building);
+ irg->dom_state = dom_none;
/* With the implementation right now there is nothing to free,
but better call it anyways... */
void free_postdom(ir_graph *irg) {
/* Update graph state */
- assert(get_irg_phase_state(current_ir_graph) != phase_building);
- current_ir_graph->pdom_state = dom_none;
+ assert(get_irg_phase_state(irg) != phase_building);
+ irg->pdom_state = dom_none;
/* With the implementation right now there is nothing to free,
but better call it anyways... */