X-Git-Url: http://nsz.repo.hu/git/?a=blobdiff_plain;f=ir%2Fadt%2Fpset.h;h=8f7d59f2257137e285d87d6b34f928606a214f73;hb=6474dc8e951a231d0bb6c3face8fd75449807bf1;hp=698d7536b6b5b82c366f3e3e2d40fa789f2fd103;hpb=e3e22fa6f927847099c0bff62457003aa81f2518;p=libfirm

diff --git a/ir/adt/pset.h b/ir/adt/pset.h
index 698d7536b..8f7d59f22 100644
--- a/ir/adt/pset.h
+++ b/ir/adt/pset.h
@@ -1,40 +1,134 @@
-/* Declarations for pset.
-   Copyright (C) 1995, 1996 Markus Armbruster */
-
-/* $Id$ */
+/*
+ * Project:     libFIRM
+ * File name:   ir/adt/pset.h
+ * Purpose:     Declarations for pset.
+ * Author:      Markus Armbruster
+ * Modified by:
+ * Created:     1999 by getting from fiasco
+ * CVS-ID:      $Id$
+ * Copyright:   (c) 1995, 1996 Markus Armbruster
+ * Licence:     This file protected by GPL -  GNU GENERAL PUBLIC LICENSE.
+ */
 
 #ifndef _PSET_H
 #define _PSET_H
 
 #include <stddef.h>
 
+/**
+ * The abstract type of a pset (Set of pointers).
+ *
+ * This kind of sets stores only pointer to elements, the elements itself
+ * must be stored somewere else.
+ *
+ * @see set
+ */
 typedef struct pset pset;
 
+/** The entry of a pset, representing an element pointer in the set and it's meta-information */
 typedef struct {
   unsigned hash;
   void *dptr;
 } pset_entry;
 
-
-typedef int (*pset_cmp_fun) (const void *, const void *);
-
-/* Makes new hash table. Needs function to compare two nodes to
-   resolve hash value collision and the size. */
-pset *new_pset (pset_cmp_fun, int slots);
-/* Deletes hash table */
-void del_pset (pset *);
-
-/* Returns the pointer associated with pointer key.  Hash is
-   the hash value computed from key.  Returns Null if key not
-   in hash table.  */
-void *pset_find (pset *, const void *key, unsigned hash);
-void *pset_insert (pset *, const void *key, unsigned hash);
-pset_entry *pset_hinsert (pset *, const void *key, unsigned hash);
-void *pset_remove (pset *, const void *key, unsigned hash);
-
-void *pset_first (pset *);
-void *pset_next (pset *);
-void pset_break (pset *);
+/**
+ * The type of a set compare function.
+ *
+ * @param elt   pointer to an element
+ * @param key   pointer to another element
+ *
+ * @return
+ *    0 if the elements are identically, non-zero else
+ */
+typedef int (*pset_cmp_fun) (const void *elt, const void *key);
+
+/**
+ * Creates a new pset.
+ *
+ * @param func    the compare function of this pset
+ * @param slots   number of slots
+ *
+ * @returns
+ *    created pset
+ */
+pset *new_pset (pset_cmp_fun func, int slots);
+
+/**
+ * Deletes a pset.
+ *
+ * @note
+ *    This does NOT delete the elements of this pset, just it's pointers!
+ */
+void del_pset (pset *pset);
+
+/**
+ * Searches an element pointer in a pset.
+ *
+ * @param pset  the pset to search in
+ * @param key   the element to is searched
+ * @param hash  the hash value of key
+ *
+ * @return
+ *    the pointer of the found element in the pset of NULL if it was not found
+ */
+void *pset_find (pset *pset, const void *key, unsigned hash);
+
+/**
+ * Inserts an element pointer into a pset.
+ *
+ * @param pset  the pset to insert in
+ * @param key   a pointer to the element to be inserted
+ * @param hash  the hash-value of the element
+ *
+ * @return a pointer to the inserted element
+ *
+ * @note
+ *    It is not possible to insert on element more than once. If a element
+ *    that should be inserted is already in the set, this functions does
+ *    nothing but returning its set_entry.
+
+ */
+void *pset_insert (pset *pset, const void *key, unsigned hash);
+
+/**
+ * Inserts an element pointer into a pset and returns its pset_entry.
+ *
+ * @param pset  the pset to insert in
+ * @param key   a pointer to the element to be inserted
+ * @param hash  the hash-value of the element
+ *
+ * @return a pointer to the pset_entry of the inserted element
+ *
+ * @note
+ *    It is not possible to insert on element more than once. If a element
+ *    that should be inserted is already in the pset, this functions does
+ *    nothing but returning its pset_entry.
+ */
+pset_entry *pset_hinsert (pset *pset, const void *key, unsigned hash);
+
+/**
+ * Removes an element from a pset.
+ *
+ * @param pset  the pset to insert in
+ * @param key   a pointer to the element to be inserted
+ * @param hash  the hash-value of the element
+ *
+ * @return
+ *    the pointer to the removed element
+ *
+ * @remark
+ *    The current implementation did not allow to remove non-existing elements
+ */
+void *pset_remove (pset *pset, const void *key, unsigned hash);
+
+/** returns the first element of a pset */
+void *pset_first (pset *pset);
+
+/** returns the next element of a pset */
+void *pset_next (pset *pset);
+
+/** Breaks the iteration of a set. Must be called before the next pset_first() call */
+void pset_break (pset *pset);
 
 #define new_pset(cmp, slots) (PSET_TRACE (new_pset) ((cmp), (slots)))
 #define pset_find(pset, key, hash) \