/*
- * 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.
*/
/**
static void dump_ifg_nodes(FILE *F, const be_ifg_t *ifg)
{
- nodes_iter_t ifg_iter;
- be_ifg_foreach_node(ifg, &ifg_iter, node) {
+ be_ifg_foreach_node(ifg, node) {
dump_node(F, node);
}
}
static void dump_ifg_edges(FILE *F, const be_ifg_t *ifg)
{
- nodes_iter_t ifg_iter;
-
- be_ifg_foreach_node(ifg, &ifg_iter, node) {
+ be_ifg_foreach_node(ifg, node) {
neighbours_iter_t neigh_iter;
be_ifg_foreach_neighbour(ifg, &neigh_iter, node, neighbour) {