X-Git-Url: https://codewiz.org/gitweb?a=blobdiff_plain;f=mware%2Flist.h;h=4762c3b2ae81cfd77942ea61de0623151b659da0;hb=32841198fc4373115f71761a05088d10f0826223;hp=0fe471d031073ab7a7eed9c738f979ac23abd0dc;hpb=0ee1d8ff312b2b8fa07932cacc10d95ba3b23498;p=bertos.git diff --git a/mware/list.h b/mware/list.h index 0fe471d0..4762c3b2 100755 --- a/mware/list.h +++ b/mware/list.h @@ -15,6 +15,12 @@ /*#* *#* $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. *#* @@ -47,6 +53,8 @@ #ifndef MWARE_LIST_H #define MWARE_LIST_H +#include // INLINE + /*! * This structure represents a node for bidirectional lists. * @@ -110,9 +118,6 @@ typedef struct _List (l)->tail = (Node *)(&(l)->head); \ } while (0) -/* OBSOLETE */ -#define INITLIST(l) LIST_INIT(l) - /*! Add node to list head. */ #define ADDHEAD(l,n) \ do { \ @@ -165,7 +170,7 @@ typedef struct _List * * \return Pointer to node, or NULL if the list was empty. */ -INLINE Node *REMHEAD(List *l) +INLINE Node *list_remHead(List *l) { Node *n; @@ -183,7 +188,7 @@ INLINE Node *REMHEAD(List *l) * * \return Pointer to node, or NULL if the list was empty. */ -INLINE Node *REMTAIL(List *l) +INLINE Node *list_remTail(List *l) { Node *n; @@ -196,4 +201,8 @@ INLINE Node *REMTAIL(List *l) return n; } +/* OBSOLETE names */ +#define REMHEAD list_remHead +#define REMTAIL list_remTail + #endif /* MWARE_LIST_H */