/*
- * Project: libFIRM
- * File name: ir/ir/distrib.c
- * Purpose: Statistics for Firm. Distribution tables.
- * Author: Michael Beck
- * Created:
- * CVS-ID: $Id$
- * Copyright: (c) 2004 Universität Karlsruhe
- * Licence: This file protected by GPL - GNU GENERAL PUBLIC LICENSE.
- */
-#ifdef HAVE_CONFIG_H
-# include "config.h"
-#endif
+ * Copyright (C) 1995-2011 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. Distribution tables.
+ * @author Michael Beck
+ * @version $Id$
+ */
+#include "config.h"
#include "hashptr.h"
#include "irtools.h"
*/
static unsigned addr_hash(const void *object)
{
- return HASH_PTR(object);
+ return HASH_PTR(object);
}
/**
*/
static unsigned int_hash(const void *object)
{
- return (unsigned)PTR_TO_INT(object);
+ return (unsigned)PTR_TO_INT(object);
}
/**
*/
static int int_cmp_fun(const void *elt, const void *key)
{
- const distrib_entry_t *p1 = elt;
- const distrib_entry_t *p2 = key;
+ const distrib_entry_t *p1 = (const distrib_entry_t*)elt;
+ const distrib_entry_t *p2 = (const distrib_entry_t*)key;
- return (int)(p1->object) - (int)(p2->object);
+ if (p1->object == p2->object)
+ return 0;
+ return p1->object < p2->object ? -1 : 1;
}
/*
*/
distrib_tbl_t *stat_new_distrib_tbl(pset_cmp_fun cmp_func, distrib_hash_fun hash_func)
{
- distrib_tbl_t *res;
-
- res = xmalloc(sizeof(*res));
+ distrib_tbl_t *res = XMALLOC(distrib_tbl_t);
- obstack_init(&res->cnts);
+ obstack_init(&res->cnts);
- /* create the hash-table */
- res->hash_map = new_pset(cmp_func, 8);
- res->hash_func = hash_func ? hash_func : addr_hash;
- res->int_dist = 0;
+ /* create the hash-table */
+ res->hash_map = new_pset(cmp_func, 8);
+ res->hash_func = hash_func ? hash_func : addr_hash;
+ res->int_dist = 0;
- return res;
+ return res;
}
/*
*/
distrib_tbl_t *stat_new_int_distrib_tbl(void)
{
- distrib_tbl_t *res = stat_new_distrib_tbl(int_cmp_fun, int_hash);
+ distrib_tbl_t *res = stat_new_distrib_tbl(int_cmp_fun, int_hash);
- if (res)
- res->int_dist = 1;
+ if (res)
+ res->int_dist = 1;
- return res;
+ return res;
}
/*
*/
void stat_delete_distrib_tbl(distrib_tbl_t *tbl)
{
- if (tbl) {
- /* free all entries */
- obstack_free(&tbl->cnts, NULL);
+ if (tbl) {
+ /* free all entries */
+ obstack_free(&tbl->cnts, NULL);
- /* delete the hash table */
- del_pset(tbl->hash_map);
- }
+ /* delete the hash table */
+ del_pset(tbl->hash_map);
+ }
}
/**
*/
static distrib_entry_t *distrib_get_entry(distrib_tbl_t *tbl, const void *object)
{
- distrib_entry_t key;
- distrib_entry_t *elem;
+ distrib_entry_t key;
+ distrib_entry_t *elem;
- key.object = object;
+ key.object = object;
- elem = pset_find(tbl->hash_map, &key, tbl->hash_func(object));
- if (elem)
- return elem;
+ elem = (distrib_entry_t*)pset_find(tbl->hash_map, &key, tbl->hash_func(object));
+ if (elem)
+ return elem;
- elem = obstack_alloc(&tbl->cnts, sizeof(*elem));
+ elem = OALLOC(&tbl->cnts, distrib_entry_t);
- /* clear counter */
- cnt_clr(&elem->cnt);
+ /* clear counter */
+ cnt_clr(&elem->cnt);
- elem->object = object;
+ elem->object = object;
- return pset_insert(tbl->hash_map, elem, tbl->hash_func(object));
+ return (distrib_entry_t*)pset_insert(tbl->hash_map, elem, tbl->hash_func(object));
}
/*
*/
void stat_add_distrib_tbl(distrib_tbl_t *tbl, const void *object, const counter_t *cnt)
{
- distrib_entry_t *elem = distrib_get_entry(tbl, object);
+ distrib_entry_t *elem = distrib_get_entry(tbl, object);
- cnt_add(&elem->cnt, cnt);
+ cnt_add(&elem->cnt, cnt);
}
-/**
+/*
* adds a new key count into the integer distribution table
*/
void stat_add_int_distrib_tbl(distrib_tbl_t *tbl, int key, const counter_t *cnt)
{
- stat_add_distrib_tbl(tbl, (const void *)key, cnt);
+ stat_add_distrib_tbl(tbl, INT_TO_PTR(key), cnt);
}
/*
- * calculates the mean value of a distribution
+ * increases object count by one
*/
-double stat_calc_mean_distrib_tbl(distrib_tbl_t *tbl)
+void stat_inc_distrib_tbl(distrib_tbl_t *tbl, const void *object)
{
- distrib_entry_t *entry;
- unsigned count;
- double sum;
-
- if (tbl->int_dist) {
- /* integer distribution, need min, max */
- int min, max;
+ distrib_entry_t *elem = distrib_get_entry(tbl, object);
- entry = pset_first(tbl->hash_map);
-
- if (! entry)
- return 0.0;
+ cnt_inc(&elem->cnt);
+}
- min =
- max = (int)entry->object;
- sum = cnt_to_dbl(&entry->cnt);
+/*
+ * increases key count by one
+ */
+void stat_inc_int_distrib_tbl(distrib_tbl_t *tbl, int key)
+{
+ stat_inc_distrib_tbl(tbl, INT_TO_PTR(key));
+}
+/*
+ * inserts a new object with count 0 into the distribution table
+ * if object is already present, nothing happens
+ */
+void stat_insert_distrib_tbl(distrib_tbl_t *tbl, const void *object)
+{
+ /* executed for side effect */
+ (void)distrib_get_entry(tbl, object);
+}
- for (entry = pset_next(tbl->hash_map); entry; entry = pset_next(tbl->hash_map)) {
- int value = (int)entry->object;
+/*
+ * inserts a new key with count 0 into the integer distribution table
+ * if key is already present, nothing happens
+ */
+void stat_insert_int_distrib_tbl(distrib_tbl_t *tbl, int key)
+{
+ stat_insert_distrib_tbl(tbl, INT_TO_PTR(key));
+}
- if (value < min)
- min = value;
- if (value > max);
- max = value;
+/*
+ * returns the sum over all counters in a distribution table
+ */
+int stat_get_count_distrib_tbl(distrib_tbl_t *tbl)
+{
+ distrib_entry_t *entry;
+ counter_t cnt = ZERO_CNT;
- sum += cnt_to_dbl(&entry->cnt);
- }
- count = max - min + 1;
- }
- else {
- sum = 0.0;
- count = 0;
- for (entry = pset_first(tbl->hash_map); entry; entry = pset_next(tbl->hash_map)) {
- sum += cnt_to_dbl(&entry->cnt);
- ++count;
- }
- }
+ foreach_pset(tbl->hash_map, distrib_entry_t*, entry)
+ cnt_add(&cnt, &entry->cnt);
+ return cnt_to_uint(&cnt);
+}
- return count ? sum / (double)count : 0.0;
+/*
+ * calculates the mean value of a distribution
+ */
+double stat_calc_mean_distrib_tbl(distrib_tbl_t *tbl)
+{
+ distrib_entry_t *entry;
+ size_t count;
+ double sum;
+
+ if (tbl->int_dist) {
+ /* integer distribution, need min, max */
+ int min, max;
+
+ entry = (distrib_entry_t*)pset_first(tbl->hash_map);
+
+ if (! entry)
+ return 0.0;
+
+ min =
+ max = PTR_TO_INT(entry->object);
+ sum = cnt_to_dbl(&entry->cnt);
+
+
+ for (entry = (distrib_entry_t*)pset_next(tbl->hash_map); entry != NULL;
+ entry = (distrib_entry_t*)pset_next(tbl->hash_map)) {
+ int value = PTR_TO_INT(entry->object);
+
+ if (value < min)
+ min = value;
+ if (value > max)
+ max = value;
+
+ sum += cnt_to_dbl(&entry->cnt);
+ }
+ count = max - min + 1;
+ } else {
+ sum = 0.0;
+ count = 0;
+ foreach_pset(tbl->hash_map, distrib_entry_t*, entry) {
+ sum += cnt_to_dbl(&entry->cnt);
+ ++count;
+ }
+ }
+
+ return count ? sum / (double)count : 0.0;
}
/*
*/
double stat_calc_avg_distrib_tbl(distrib_tbl_t *tbl)
{
- distrib_entry_t *entry;
- unsigned count = 0;
- double sum = 0.0;
-
- if (tbl->int_dist) {
- entry = pset_first(tbl->hash_map);
-
- if (! entry)
- return 0.0;
-
- sum = cnt_to_dbl(&entry->cnt);
- count = entry->cnt.cnt[0];
-
- for (entry = pset_next(tbl->hash_map); entry; entry = pset_next(tbl->hash_map)) {
- sum += cnt_to_dbl(&entry->cnt) * (int)entry->object;
- count += entry->cnt.cnt[0];
- }
- }
- else {
- for (entry = pset_first(tbl->hash_map); entry; entry = pset_next(tbl->hash_map)) {
- sum += cnt_to_dbl(&entry->cnt);
- ++count;
- }
- }
-
- return count ? sum / (double)count : 0.0;
+ distrib_entry_t *entry;
+ size_t count = 0;
+ double sum = 0.0;
+
+ if (tbl->int_dist) {
+ if (pset_count(tbl->hash_map) <= 0)
+ return 0.0;
+
+ foreach_pset(tbl->hash_map, distrib_entry_t*, entry) {
+ sum += cnt_to_dbl(&entry->cnt) * PTR_TO_INT(entry->object);
+ count += cnt_to_uint(&entry->cnt);
+ }
+ } else {
+ foreach_pset(tbl->hash_map, distrib_entry_t*, entry) {
+ sum += cnt_to_dbl(&entry->cnt);
+ ++count;
+ }
+ }
+
+ return count ? sum / (double)count : 0.0;
}
/**
* iterates over all entries in a distribution table
*/
-void stat_iterate_distrib_tbl(distrib_tbl_t *tbl, eval_distrib_entry_fun eval, void *env)
+void stat_iterate_distrib_tbl(const distrib_tbl_t *tbl, eval_distrib_entry_fun eval, void *env)
{
- distrib_entry_t *entry;
+ distrib_entry_t *entry;
- for (entry = pset_first(tbl->hash_map); entry; entry = pset_next(tbl->hash_map)) {
- eval(entry, env);
- }
+ foreach_pset(tbl->hash_map, distrib_entry_t*, entry)
+ eval(entry, env);
}