On Thursday 02 May 2002 21:38, William Lee Irwin III wrote:
> In the more general case, avoiding an O(fragments) (or sometimes even
> O(mem)) iteration in favor of, say, O(lg(fragments)) or O(cpus)
> iteration when fragments is very large would be an excellent optimization.
In general, config_nonlinear gets it down to O(NR_ZONES), i.e., O(1), by
eliminating the loops across nodes in the non-numa case.
Yes, teaching for_each_* about the 'list length equals one' case would be
-- Daniel - To unsubscribe from this list: send the line "unsubscribe linux-kernel" in the body of a message to email@example.com More majordomo info at http://vger.kernel.org/majordomo-info.html Please read the FAQ at http://www.tux.org/lkml/
This archive was generated by hypermail 2b29 : Tue May 07 2002 - 22:00:16 EST