X-Git-Url: http://nsz.repo.hu/git/?a=blobdiff_plain;f=ir%2Fadt%2Fpmap.c;h=a18b49f9f7a1f06cbd595d33108426f911cefadf;hb=3da5ed2598245b896255bc444aaa1768f6098cfe;hp=9cf69a14a5d9485c1a2f16ab456ae07546b967c0;hpb=7115bc91754670de6d9ce740cfa0d95ecbe9a938;p=libfirm

diff --git a/ir/adt/pmap.c b/ir/adt/pmap.c
index 9cf69a14a..a18b49f9f 100644
--- a/ir/adt/pmap.c
+++ b/ir/adt/pmap.c
@@ -1,18 +1,30 @@
 /*
- * Project:     libFIRM
- * File name:   ir/adt/pmap.c
- * Purpose:     Datentyp: Vereinfachte Map (hash-map) zum Speichern von
- *              Zeigern/Adressen -> Zeigern/Adressen.
- * Author:      Hubert Schmid
- * Modified by:
- * Created:     09.06.2002
- * CVS-ID:      $Id$
- * Copyright:   (c) 2002 Universität Karlsruhe
- * Licence:     This file protected by GPL -  GNU GENERAL PUBLIC LICENSE.
+ * 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.
  */
-#ifdef HAVE_CONFIG_H
-# include <config.h>
-#endif
+
+/**
+ * @file
+ * @brief       simplified hashmap for pointer -> pointer mappings
+ * @author      Hubert Schmid
+ * @date        09.06.2002
+ * @version     $Id$
+ */
+#include "config.h"
 
 #include "pmap.h"
 
@@ -34,27 +46,33 @@ struct pmap {
 /**
  * compare the keys of two entry pairs
  */
-static int pmap_entry_cmp(const void *p1, const void *p2, size_t size) {
+static int pmap_entry_cmp(const void *p1, const void *p2, size_t size)
+{
 	const pmap_entry *entry1 = p1;
 	const pmap_entry *entry2 = p2;
+	(void) size;
 
 	return entry1->key != entry2->key;
 }
 
 /* Creates a new empty map with an initial number of slots. */
-pmap *pmap_create_ex(int slots) {
+pmap *pmap_create_ex(int slots)
+{
   	return (pmap *)new_set(pmap_entry_cmp, slots);
 }
 
-pmap *pmap_create(void) {
+pmap *pmap_create(void)
+{
 	return pmap_create_ex(INITIAL_SLOTS);
 }
 
-void pmap_destroy(pmap *map) {
+void pmap_destroy(pmap *map)
+{
 	del_set(M2S(map));
 }
 
-void pmap_insert(pmap *map, const void *key, void *value) {
+void pmap_insert(pmap *map, const void *key, void *value)
+{
 	pmap_entry entry, *p;
 
 	entry.key = key;
@@ -62,32 +80,39 @@ void pmap_insert(pmap *map, const void *key, void *value) {
 	p->value = value;
 }
 
-int pmap_contains(pmap *map, const void *key) {
+int pmap_contains(pmap *map, const void *key)
+{
 	return set_find(M2S(map), &key, sizeof(pmap_entry), HASH_PTR(key)) != NULL;
 }
 
-pmap_entry * pmap_find(pmap *map, const void *key) {
+pmap_entry * pmap_find(pmap *map, const void *key)
+{
 	return (pmap_entry *)set_find(M2S(map), &key, sizeof(pmap_entry), HASH_PTR(key));
 }
 
 
-void * pmap_get(pmap *map, const void *key) {
+void * pmap_get(pmap *map, const void *key)
+{
 	pmap_entry * entry = pmap_find(map, key);
 	return entry == NULL ? NULL : entry->value;
 }
 
-int pmap_count(pmap *map) {
+int pmap_count(pmap *map)
+{
 	return set_count(M2S(map));
 }
 
-pmap_entry *pmap_first(pmap *map) {
+pmap_entry *pmap_first(pmap *map)
+{
 	return (pmap_entry *) set_first(M2S(map));
 }
 
-pmap_entry *pmap_next(pmap *map) {
+pmap_entry *pmap_next(pmap *map)
+{
 	return (pmap_entry *) set_next(M2S(map));
 }
 
-void pmap_break(pmap *map) {
+void pmap_break(pmap *map)
+{
 	set_break(M2S(map));
 }