| commit | 754e801826207fb0c5ff490bbd8c36eb134aae5e | [log] [tgz] |
|---|---|---|
| author | Holger Hans Peter Freyther <zecke@selfish.org> | Fri Apr 09 21:53:35 2010 +0200 |
| committer | Holger Hans Peter Freyther <zecke@selfish.org> | Sat Apr 10 00:00:15 2010 +0200 |
| tree | f0a9b52d256e409dac0c24d7f1b7ba2fcec6ac13 | |
| 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.