Messages in this thread |  | | | Date | Mon, 7 Apr 2008 10:43:51 +0200 | | From | Ingo Molnar <> | | Subject | Re: [PATCH] x86: generic versions of find_first_(zero_)bit, convert i386 |
* dean gaudet <dean@arctic.org> wrote:
> On Sun, 6 Apr 2008, Alexander van Heukelum wrote:> > > The current generic implementation of ffz is O(lg(n)) already> > it's O(lg(n)) time... the operations all depend on each other.
> > the implementation i pointed to is O(lg(n)) code space... and the time
> depends on how parallel the machine is, they're not dependent on each
> other.
yep, i'd suggest we gravitate towards such a no-dependencies
implementation for the generic code - especially modern CPUs would be
able to execute them rather efficiently.
Ingo
|  |