/*
- * pattern history
+ * 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.
+ */
+
+/**
+ * @file
+ * @brief Statistics for Firm. Pattern history.
+ * @author Michael Beck
+ * @version $Id$
*/
+#ifdef HAVE_CONFIG_H
+# include "config.h"
+#endif
+
#include <assert.h>
#include <stdlib.h>
#include <limits.h>
#include "pattern_dmp.h"
#include "hashptr.h"
+#ifdef FIRM_STATISTICS
+
/*
* just be make some things clear :-), the
* poor man "generics"
static int addr_cmp(const void *p1, const void *p2, size_t size) {
const addr_entry_t *e1 = p1;
const addr_entry_t *e2 = p2;
+ (void) size;
return e1->addr != e2->addr;
} /* addr_cmp */
int i, preds;
int res, depth;
- opcode code = get_irn_opcode(node);
+ ir_opcode code = get_irn_opcode(node);
/* insert the node into our ID map */
entry.addr = node;
*/
void stat_calc_pattern_history(ir_graph *irg) {
pattern_env_t env;
- int i;
+ unsigned i;
if (! status->enable)
return;
* Finish the pattern history.
*/
void stat_finish_pattern_history(const char *fname) {
+ (void) fname;
if (! status->enable)
return;
status->enable = 0;
} /* stat_finish_pattern_history */
+
+#endif /* FIRM_STATISTICS */