diff options
| author | Holger Hans Peter Freyther <zecke@selfish.org> | 2010-04-09 21:53:35 +0200 |
|---|---|---|
| committer | Holger Hans Peter Freyther <zecke@selfish.org> | 2010-04-10 00:00:15 +0200 |
| commit | 754e801826207fb0c5ff490bbd8c36eb134aae5e (patch) | |
| tree | f0a9b52d256e409dac0c24d7f1b7ba2fcec6ac13 /openbsc/include/openbsc/gsm_data.h | |
| parent | 19722d44116353c14de8cb1f09eb45b9f8ec8ae2 (diff) | |
[paging] Simplify the last request and treat llist as a queue
The current code was overly complex. It tried to iterate over
the list in a round robin and we had to keep track of the last
element, see if we remove that one, check if the list becomes
empty... This can all replaced by treating the double linked
list as a queue. We take the item at the front, do something
on it and then and then put it back to the list at the end.
Diffstat (limited to 'openbsc/include/openbsc/gsm_data.h')
| -rw-r--r-- | openbsc/include/openbsc/gsm_data.h | 1 |
1 files changed, 0 insertions, 1 deletions
diff --git a/openbsc/include/openbsc/gsm_data.h b/openbsc/include/openbsc/gsm_data.h index 8dfa5886b..ef0b50768 100644 --- a/openbsc/include/openbsc/gsm_data.h +++ b/openbsc/include/openbsc/gsm_data.h @@ -368,7 +368,6 @@ struct gsm_paging_request { struct gsm_bts_paging_state { /* pending requests */ struct llist_head pending_requests; - struct gsm_paging_request *last_request; struct gsm_bts *bts; struct timer_list work_timer; |