/*
- * Copyright (C) 1995-2008 University of Karlsruhe. All right reserved.
- *
* This file is part of libFirm.
- *
- * This file may be distributed and/or modified under the terms of the
- * GNU General Public License version 2 as published by the Free Software
- * Foundation and appearing in the file LICENSE.GPL included in the
- * packaging of this file.
- *
- * Licensees holding valid libFirm Professional Edition licenses may use
- * this file in accordance with the libFirm Commercial License.
- * Agreement provided with the Software.
- *
- * This file is provided AS IS with NO WARRANTY OF ANY KIND, INCLUDING THE
- * WARRANTY OF DESIGN, MERCHANTABILITY AND FITNESS FOR A PARTICULAR
- * PURPOSE.
+ * Copyright (C) 2012 University of Karlsruhe.
*/
/**
be_ifg_t *ifg = sr->co->cenv->ifg;
neighbours_iter_t iter;
ir_node **all = ALLOCAN(ir_node*, be_ifg_degree(ifg, ifn));
- ir_node *curr;
int size = 0;
int i;
int o;
void sr_remove(size_red_t *sr)
{
- ir_node *irn;
bool redo = true;
const be_ifg_t *ifg = sr->co->cenv->ifg;
nodes_iter_t iter;
ir_graph *irg = sr->co->irg;
be_ifg_t *ifg = sr->co->cenv->ifg;
unsigned n_regs = arch_register_class_n_regs(sr->co->cls);
- unsigned *possible_cols;
- unsigned *allocatable_cols;
- rbitset_alloca(allocatable_cols, n_regs);
+ unsigned *const allocatable_cols = rbitset_alloca(n_regs);
be_set_allocatable_regs(irg, sr->co->cls, allocatable_cols);
- rbitset_alloca(possible_cols, n_regs);
+ unsigned *const possible_cols = rbitset_alloca(n_regs);
neighbours_iter_t iter;
/* color the removed nodes in right order */
for (cs = sr->col_suff; cs; cs = cs->next) {
unsigned free_col;
- ir_node *other;
ir_node *irn = cs->irn;
rbitset_copy(possible_cols, allocatable_cols, n_regs);