/*
- * 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.
*/
/**
* @brief Copy node statistics.
* @author Daniel Grund
* @date 19.04.2005
- * @version $Id$
*/
#include "config.h"
#include "beutil.h"
#include "becopyopt_t.h"
#include "becopystat.h"
-#include "beirg.h"
#include "bemodule.h"
#include "beintlive_t.h"
/**
* Holds current values. Values are added till next copystat_reset
*/
-int curr_vals[ASIZE];
+static int curr_vals[ASIZE];
static ir_nodeset_t *all_phi_nodes;
static ir_nodeset_t *all_copy_nodes;
{
const ir_edge_t *edge;
const ir_node *bl_at_pos, *bl_before;
- assert(is_Block(bl));
/* Does bl have several predecessors ?*/
- if (get_irn_arity(bl) <= 1)
+ if (get_Block_n_cfgpreds(bl) <= 1)
return 0;
/* Does the pred have exactly one predecessor */
curr_vals[I_HEUR_TIME] += time;
}
-#ifdef WITH_ILP
-
void copystat_add_ilp_5_sec_costs(int costs)
{
curr_vals[I_COPIES_5SEC] += costs;
curr_vals[I_ILP_ITER] += iters;
}
-#endif /* WITH_ILP */
-
/**
* Opens a file named base.ext with the mode mode.
*/
fprintf(out, "%d\n", (int)ASIZE);
for (i = 0; i < ASIZE; i++) {
-#if 0
- if (i >= I_PHI_ARITY_S && i <= I_PHI_ARITY_E)
- fprintf(out, "%i %i\n", curr_vals[i], curr_vals[I_PHI_CNT]);
- else if (i >= I_CLS_SIZE_S && i <= I_CLS_SIZE_E)
- fprintf(out, "%i %i\n", curr_vals[i], curr_vals[I_CLS_CNT]);
- else
-#endif
- fprintf(out, "%i\n", curr_vals[i]);
+ fprintf(out, "%i\n", curr_vals[i]);
}
fclose(out);