diff options
| author | Pavel Machek <pavel@ucw.cz> | 1998-07-20 22:05:40 +0200 |
|---|---|---|
| committer | Pavel Machek <pavel@ucw.cz> | 1998-07-20 22:05:40 +0200 |
| commit | a872b0f7dae38cfef574d0d3b30609e968cdf95b (patch) | |
| tree | fc11b50afa96ec701e37119f9990320bf2e08236 /lib/lists.h | |
| parent | c25e90efed6bc76d05370403839640ed05017506 (diff) | |
| download | bird-a872b0f7dae38cfef574d0d3b30609e968cdf95b.tar bird-a872b0f7dae38cfef574d0d3b30609e968cdf95b.zip | |
Reversed buggy patch.
Diffstat (limited to 'lib/lists.h')
| -rw-r--r-- | lib/lists.h | 2 |
1 files changed, 1 insertions, 1 deletions
diff --git a/lib/lists.h b/lib/lists.h index ae02ad4..a60bf16 100644 --- a/lib/lists.h +++ b/lib/lists.h @@ -20,7 +20,7 @@ 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((NODE (n))=HEAD(list);(NODE (n))->next; \ +#define WALK_LIST(n,list) for((n)=HEAD(list);(NODE (n))->next; \ n=(void *)((NODE (n))->next)) #define WALK_LIST_DELSAFE(n,ne,list) \ if ( ((NODE n) = HEAD(list)) ) \ |