From d5356072ac18d5b0eb12f14afca6bfbea702dda2 Mon Sep 17 00:00:00 2001 From: Ondrej Zajicek Date: Thu, 4 Nov 2010 17:22:43 +0100 Subject: Fixes a bug in LSA update of large LSAs. --- lib/lists.h | 6 +++--- 1 file changed, 3 insertions(+), 3 deletions(-) (limited to 'lib/lists.h') diff --git a/lib/lists.h b/lib/lists.h index 342dfd62..6fab12c4 100644 --- a/lib/lists.h +++ b/lib/lists.h @@ -33,10 +33,10 @@ typedef struct list { /* In fact two overlayed nodes */ #define NODE (node *) #define HEAD(list) ((void *)((list).head)) #define TAIL(list) ((void *)((list).tail)) -#define WALK_LIST(n,list) for(n=HEAD(list);(NODE (n))->next; \ - n=(void *)((NODE (n))->next)) +#define NODE_NEXT(n) ((void *)((NODE (n))->next)) +#define WALK_LIST(n,list) for(n=HEAD(list);(NODE (n))->next; n=NODE_NEXT(n)) #define WALK_LIST_DELSAFE(n,nxt,list) \ - for(n=HEAD(list); nxt=(void *)((NODE (n))->next); n=(void *) nxt) + for(n=HEAD(list); nxt=NODE_NEXT(n); n=(void *) nxt) /* WALK_LIST_FIRST supposes that called code removes each processed node */ #define WALK_LIST_FIRST(n,list) \ while(n=HEAD(list), (NODE (n))->next) -- cgit v1.2.3