diff options
| author | Ondrej Zajicek <santiago@crfreenet.org> | 2008-12-18 23:26:08 +0100 |
|---|---|---|
| committer | Ondrej Zajicek <santiago@crfreenet.org> | 2008-12-18 23:26:08 +0100 |
| commit | b933281ed5efb9ad9375c3ea41ee2412b9f89c15 (patch) | |
| tree | b90240786203e981319e9e1f3e131689e32f6b55 /lib/lists.h | |
| parent | 35164c501722f07beef21178b19090fa9d1930cd (diff) | |
Fixes nasty bug in event processing.
WALK_LIST_DELSAFE (in ev_run_list) is not safe with regard
to deletion of next node. When some events are rescheduled
during event execution, it may lead to deletion of next
node and some events are skipped. Such skipped nodes remain
in temporary list on stack and the last of them contains
'next' pointer to stack area. When this event is later
scheduled, it damages stack area trying to remove it from
the list, which leads to random crashes with funny
backtraces :-) .
Diffstat (limited to 'lib/lists.h')
| -rw-r--r-- | lib/lists.h | 3 |
1 files changed, 3 insertions, 0 deletions
diff --git a/lib/lists.h b/lib/lists.h index 5b36ec83..342dfd62 100644 --- a/lib/lists.h +++ b/lib/lists.h @@ -37,6 +37,9 @@ typedef struct list { /* In fact two overlayed nodes */ n=(void *)((NODE (n))->next)) #define WALK_LIST_DELSAFE(n,nxt,list) \ for(n=HEAD(list); nxt=(void *)((NODE (n))->next); 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) #define WALK_LIST_BACKWARDS(n,list) for(n=TAIL(list);(NODE (n))->prev; \ n=(void *)((NODE (n))->prev)) #define WALK_LIST_BACKWARDS_DELSAFE(n,prv,list) \ |