X-Git-Url: http://nsz.repo.hu/git/?a=blobdiff_plain;f=include%2Flibfirm%2Fadt%2Fplist.h;h=2f0c0dc8c5d57232fceddd966d8fc2577f2f1a67;hb=ce29d67e4cf75e435dd50b15a294a07a3b3e6309;hp=6a639b4261664cce9c93dee3da784fdaea5039d5;hpb=68f1fef312ea0a037cf9815042ea30e95ce1b619;p=libfirm

diff --git a/include/libfirm/adt/plist.h b/include/libfirm/adt/plist.h
index 6a639b426..2f0c0dc8c 100644
--- a/include/libfirm/adt/plist.h
+++ b/include/libfirm/adt/plist.h
@@ -21,15 +21,11 @@
  * @file
  * @author  Kimon Hoffmann
  * @date    14.07.2005
- * @version $Id$
  * @brief   Simple, non circular, double linked pointer list.
  *          Created because the properties of the standard circular list were
  *          not very well suited for the interference graph implementation.
  *          This list uses an obstack and a free-list to efficiently manage its
  *          elements.
- * @note    Until now the code is entirely untested so it probably contains
- *          plenty of errors. (Matze: Is this still true, the code seems to be
- *          used at some places....)
  * @deprecated
  */
 #ifndef FIRM_ADT_PLIST_H
@@ -47,27 +43,19 @@ typedef struct plist plist_t;
  * The plist data type.
  */
 struct plist {
-	/**
-	 * The obstack used for all allocations.
-	 */
+	/** The obstack used for all allocations. */
 	struct obstack *obst;
 
-	/* Set to 1 if plist uses a foreign obstack  */
+	/** Set to 1 if plist uses a foreign obstack */
 	unsigned foreign_obstack : 1;
 
-	/**
-	 * First element in the list.
-	 */
+	/** First element in the list. */
 	plist_element_t *first_element;
 
-	/**
-	 * Last element in the list.
-	 */
+	/** Last element in the list. */
 	plist_element_t *last_element;
 
-	/**
-	 * Current number of elements in the list.
-	 */
+	/** Current number of elements in the list. */
 	int element_count;
 
 	/**
@@ -82,9 +70,9 @@ struct plist {
  * An element in the pointer list.
  */
 struct plist_element {
-	plist_element_t *next;
-	plist_element_t *prev;
-	void *data;
+	plist_element_t *next; /**< next element in double linked list */
+	plist_element_t *prev; /**< previous element in double linked list */
+	void            *data; /**< element data */
 };
 
 /**