[<prev] [next>] [<thread-prev] [thread-next>] [day] [month] [year] [list]
Message-ID: <alpine.DEB.1.10.0804061320470.7751@twinlark.arctic.org>
Date: Sun, 6 Apr 2008 13:22:58 -0700 (PDT)
From: dean gaudet <dean@...tic.org>
To: Alexander van Heukelum <heukelum@...tmail.fm>
cc: Alexander van Heukelum <heukelum@...lshack.com>,
Ingo Molnar <mingo@...e.hu>, Andi Kleen <andi@...stfloor.org>,
LKML <linux-kernel@...r.kernel.org>
Subject: Re: [PATCH] x86: generic versions of find_first_(zero_)bit, convert
i386
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.
-dean
--
To unsubscribe from this list: send the line "unsubscribe linux-kernel" in
the body of a message to majordomo@...r.kernel.org
More majordomo info at http://vger.kernel.org/majordomo-info.html
Please read the FAQ at http://www.tux.org/lkml/
Powered by blists - more mailing lists