![]() | |||||||||||||
Messages in this thread |
Matt Mackall <mpm@selenic.com> wrote:
>
> + /* search for insertion point in reverse for dynamic allocation */
> + list_for_each_prev(l, list) {
hrmph. Any time we do anything in O(n) time, some smarty comes along with
a workload which blows us out of the water. Although it's hard to think of
any register_blkdev()-intensive workloads.
It's not possible to do this with prio-trees?
-
To unsubscribe from this list: send the line "unsubscribe linux-kernel" in
the body of a message to majordomo@vger.kernel.org
More majordomo info at http://vger.kernel.org/majordomo-info.html
Please read the FAQ at http://www.tux.org/lkml/
| ||||||||||||
| Last update: 2005-03-22 13:10 [W:0.244 / U:0.430 seconds] ©2003-2008 Jasper Spaans | |||||||||||||