diff options
| author | Pavel Machek <pavel@ucw.cz> | 1998-10-14 15:27:53 +0200 |
|---|---|---|
| committer | Pavel Machek <pavel@ucw.cz> | 1998-10-14 15:27:53 +0200 |
| commit | cf3934c5691ec4a00d54b863576916f9a1dd1f1a (patch) | |
| tree | 9c0248e524ddb2a496f74c7b84c0f02b1a8bbe03 /lib | |
| parent | c93214d442644c9667d69f904d57aef6b4ddd47e (diff) | |
| download | bird-cf3934c5691ec4a00d54b863576916f9a1dd1f1a.tar bird-cf3934c5691ec4a00d54b863576916f9a1dd1f1a.zip | |
Lists: unneccessary test killed, make code friendly to non-gcc.
Diffstat (limited to 'lib')
| -rw-r--r-- | lib/lists.h | 5 |
1 files changed, 2 insertions, 3 deletions
diff --git a/lib/lists.h b/lib/lists.h index a60bf16..7fd697e 100644 --- a/lib/lists.h +++ b/lib/lists.h @@ -23,10 +23,9 @@ typedef struct list { /* In fact two overlayed nodes */ #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)) ) \ - for( (NODE ne) = (NODE n)->next; \ + for( ne = (void *) (NODE n)->next; \ ne; \ - (NODE ne) = (NODE (n=ne))->next ) + ne = (void *) (NODE (n=ne))->next ) #define EMPTY_LIST(list) (!(list).head->next) |