/*#*
*#* $Log$
+ *#* Revision 1.11 2004/12/31 16:44:11 bernie
+ *#* list_remHead(), list_remTail(): Name like normal functions.
+ *#*
+ *#* Revision 1.10 2004/11/28 23:21:05 bernie
+ *#* Remove obsolete INITLIST macro.
+ *#*
*#* Revision 1.9 2004/10/21 09:37:55 bernie
*#* Revamp documentation.
*#*
#ifndef MWARE_LIST_H
#define MWARE_LIST_H
+#include <compiler.h> // INLINE
+
/*!
* This structure represents a node for bidirectional lists.
*
(l)->tail = (Node *)(&(l)->head); \
} while (0)
-/* OBSOLETE */
-#define INITLIST(l) LIST_INIT(l)
-
/*! Add node to list head. */
#define ADDHEAD(l,n) \
do { \
*
* \return Pointer to node, or NULL if the list was empty.
*/
-INLINE Node *REMHEAD(List *l)
+INLINE Node *list_remHead(List *l)
{
Node *n;
*
* \return Pointer to node, or NULL if the list was empty.
*/
-INLINE Node *REMTAIL(List *l)
+INLINE Node *list_remTail(List *l)
{
Node *n;
return n;
}
+/* OBSOLETE names */
+#define REMHEAD list_remHead
+#define REMTAIL list_remTail
+
#endif /* MWARE_LIST_H */