beifg: Factorise code to count interference components.

[libfirm] / ir / adt / cpset.c

diff --git a/ir/adt/cpset.c b/ir/adt/cpset.c
index 0edffd7..dc5a08c 100644 (file)
--- a/ir/adt/cpset.c
+++ b/ir/adt/cpset.c
@@ -1,27 +1,12 @@
 /*
- * 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.
  */
 
 /**
  * @file
  * @brief   Custom pointer set
  * @author  Matthias Braun
- * @version $Id$
  *
  * This implements a set of pointers which allows to specify custom callbacks
  * for comparing and hashing its elements.
@@ -54,7 +39,7 @@ void cpset_init_size_(cpset_t *self, size_t expected_elems);
 #define hashset_iterator_next   cpset_iterator_next
 #define hashset_remove_iterator cpset_remove_iterator
 
-#include "hashset.c"
+#include "hashset.c.inl"
 
 void cpset_init(cpset_t *this_, cpset_hash_function hash_function,
                 cpset_cmp_function cmp_function)