Messages in this thread | | | Date | Wed, 4 Jun 2014 21:47:31 +0200 | From | Peter Zijlstra <> | Subject | Re: [PATCH] smp, ipi: Speed up IPI handling by invoking the callbacks in reverse order |
| |
On Thu, Jun 05, 2014 at 01:09:35AM +0530, Srivatsa S. Bhat wrote: > The current implementation of lockless list (llist) has a drawback: if we > want to traverse the list in FIFO order (oldest to newest), we need to > reverse the list first (and this can be expensive if the list is large, > since this is an O(n) operation).
Have you actually looked at the queue depth of this thing? Large queues are a problem for interrupt latency.
| |