[BACK]Return to linklist.h CVS log [TXT] [DIR] Up to [ELWIX - Embedded LightWeight unIX -] / embedaddon / quagga / lib

Diff for /embedaddon/quagga/lib/linklist.h between versions 1.1.1.1 and 1.1.1.2

version 1.1.1.1, 2012/02/21 17:26:12 version 1.1.1.2, 2012/10/09 09:22:28
Line 54  struct list  Line 54  struct list 
   void (*del) (void *val);    void (*del) (void *val);
 };  };
   
#define listnextnode(X) ((X)->next)#define listnextnode(X) ((X) ? ((X)->next) : NULL)
#define listhead(X) ((X)->head)#define listhead(X) ((X) ? ((X)->head) : NULL)
#define listtail(X) ((X)->tail)#define listtail(X) ((X) ? ((X)->tail) : NULL)
 #define listcount(X) ((X)->count)  #define listcount(X) ((X)->count)
 #define list_isempty(X) ((X)->head == NULL && (X)->tail == NULL)  #define list_isempty(X) ((X)->head == NULL && (X)->tail == NULL)
 #define listgetdata(X) (assert((X)->data != NULL), (X)->data)  #define listgetdata(X) (assert((X)->data != NULL), (X)->data)
Line 88  extern void list_add_list (struct list *, struct list  Line 88  extern void list_add_list (struct list *, struct list 
  * It is safe to delete the listnode using this macro.   * It is safe to delete the listnode using this macro.
  */   */
 #define ALL_LIST_ELEMENTS(list,node,nextnode,data) \  #define ALL_LIST_ELEMENTS(list,node,nextnode,data) \
  (node) = listhead(list); \  (node) = listhead(list), ((data) = NULL); \
   (node) != NULL && \    (node) != NULL && \
     ((data) = listgetdata(node),(nextnode) = listnextnode(node), 1); \      ((data) = listgetdata(node),(nextnode) = listnextnode(node), 1); \
  (node) = (nextnode)  (node) = (nextnode), ((data) = NULL)
   
 /* read-only list iteration macro.  /* read-only list iteration macro.
  * Usage: as per ALL_LIST_ELEMENTS, but not safe to delete the listnode Only   * Usage: as per ALL_LIST_ELEMENTS, but not safe to delete the listnode Only
Line 100  extern void list_add_list (struct list *, struct list  Line 100  extern void list_add_list (struct list *, struct list 
  * of previous macro.   * of previous macro.
  */   */
 #define ALL_LIST_ELEMENTS_RO(list,node,data) \  #define ALL_LIST_ELEMENTS_RO(list,node,data) \
  (node) = listhead(list); \  (node) = listhead(list), ((data) = NULL);\
   (node) != NULL && ((data) = listgetdata(node), 1); \    (node) != NULL && ((data) = listgetdata(node), 1); \
  (node) = listnextnode(node)  (node) = listnextnode(node), ((data) = NULL)
   
 /* these *do not* cleanup list nodes and referenced data, as the functions  /* these *do not* cleanup list nodes and referenced data, as the functions
  * do - these macros simply {de,at}tach a listnode from/to a list.   * do - these macros simply {de,at}tach a listnode from/to a list.
Removed from v.1.1.1.1  
changed lines
  Added in v.1.1.1.2

FreeBSD-CVSweb <freebsd-cvsweb@FreeBSD.org>