Messages in this thread | | | Date | Sun, 6 Jan 2002 19:49:09 -0800 (PST) | From | Davide Libenzi <> | Subject | Re: [announce] [patch] ultra-scalable O(1) SMP and UP scheduler |
| |
On Sun, 6 Jan 2002, Linus Torvalds wrote:
> > On Sun, 6 Jan 2002, Davide Libenzi wrote: > > > > 32 bit words lookup can be easily done in few clock cycles in most cpus > > by using tuned assembly code. > > I tried to time "bsfl", it showed up as one cycle more than "nothing" on > my PII. > > It used to be something like 7+n cycles on a i386, if I remember > correctly. It's just not an issue any more - trying to use clever code to > avoid it is just silly.
I think the issue was about architectures that does not have bsfl like ops
- Davide
- 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/
| |