X-Git-Url: https://codewiz.org/gitweb?a=blobdiff_plain;f=mware%2Flist.h;h=a0451eb5794308febaa48d49003708ccf40f1c9f;hb=0e46cbbbd56d4a79f41cec484f19048370e6df80;hp=8f57f448bced6c4952401ec058d54cae4082e23c;hpb=8eb928a7c1e446a2a0606a48a93ab732e5e14229;p=bertos.git diff --git a/mware/list.h b/mware/list.h index 8f57f448..a0451eb5 100755 --- a/mware/list.h +++ b/mware/list.h @@ -11,21 +11,31 @@ * \brief General pourpose double-linked lists */ -/* - * $Log$ - * Revision 1.4 2004/07/18 22:12:53 bernie - * Fix warnings with GCC 3.3.2. - * - * Revision 1.3 2004/07/18 22:01:43 bernie - * REMHEAD(), REMTAIL(): Move to list.h as inline functions. - * - * Revision 1.2 2004/06/03 11:27:09 bernie - * Add dual-license information. - * - * Revision 1.1 2004/05/23 15:43:16 bernie - * Import mware modules. - * - */ +/*#* + *#* $Log$ + *#* Revision 1.7 2004/08/25 14:12:09 rasky + *#* Aggiornato il comment block dei log RCS + *#* + *#* Revision 1.6 2004/07/30 14:34:10 rasky + *#* Vari fix per documentazione e commenti + *#* Aggiunte PP_CATn e STATIC_ASSERT + *#* + *#* Revision 1.5 2004/07/20 23:45:01 bernie + *#* Finally remove redundant protos. + *#* + *#* Revision 1.4 2004/07/18 22:12:53 bernie + *#* Fix warnings with GCC 3.3.2. + *#* + *#* Revision 1.3 2004/07/18 22:01:43 bernie + *#* REMHEAD(), REMTAIL(): Move to list.h as inline functions. + *#* + *#* Revision 1.2 2004/06/03 11:27:09 bernie + *#* Add dual-license information. + *#* + *#* Revision 1.1 2004/05/23 15:43:16 bernie + *#* Import mware modules. + *#* + *#*/ #ifndef MWARE_LIST_H #define MWARE_LIST_H @@ -118,10 +128,9 @@ typedef struct _List #define ISLISTEMPTY(l) ( (l)->head == (Node *)(&(l)->null) ) /*! - * \name Unlink a node from the head of the list \a l. + * Unlink a node from the head of the list \a l. * \return Pointer to node, or NULL if the list was empty. */ -INLINE Node *REMHEAD(List *l); INLINE Node *REMHEAD(List *l) { Node *n; @@ -136,10 +145,9 @@ INLINE Node *REMHEAD(List *l) } /*! - * \name Unlink a node from the tail of the list \a l. + * Unlink a node from the tail of the list \a l. * \return Pointer to node, or NULL if the list was empty. */ -INLINE Node *REMTAIL(List *l); INLINE Node *REMTAIL(List *l) { Node *n;