adding assertion to prevent recursive compound types

[libfirm] / ir / tr / type_identify.c

diff --git a/ir/tr/type_identify.c b/ir/tr/type_identify.c
index 96eb358..bdd1127 100644 (file)
--- a/ir/tr/type_identify.c
+++ b/ir/tr/type_identify.c
@@ -19,10 +19,10 @@
  */
 
 #ifdef HAVE_CONFIG_H
-# include <config.h>
+# include "config.h"
 #endif
 
-#include "type_identify.h"
+#include "type_identify_t.h"
 
 #include <stdlib.h>
 #include <stddef.h>
@@ -61,7 +61,7 @@ int compare_strict (const void *tp1, const void *tp2) {
 }
 
 /* stuff to compute a hash value for a type. */
-int hash_name (type *tp) {
+int firm_hash_name (type *tp) {
   unsigned h = (unsigned)tp->type_op;
   h = 9*h + (unsigned)tp->name;
   return h;
@@ -116,9 +116,9 @@ type *mature_type_free_entities(type *tp) {
 }
 
 /* initialize this module */
-void init_type_identify(compare_types_func_t *cmp, hash_types_func_t *hash) {
-  compare_types_func = cmp  ? cmp  : compare_strict;
-  hash_types_func    = hash ? hash : hash_name;
+void init_type_identify(type_identify_if_t *ti_if) {
+  compare_types_func = ti_if && ti_if->cmp  ? ti_if->cmp  : compare_strict;
+  hash_types_func    = ti_if && ti_if->hash ? ti_if->hash : firm_hash_name;
 
   type_table = new_pset (compare_types_func, 8);
 }