Path: utzoo!utgpu!attcan!uunet!seismo!sundc!pitstop!sun!quintus!ok
From: ok@quintus.uucp (Richard A. O'Keefe)
Newsgroups: comp.arch
Subject: Re: RISC v. CISC --more misconceptions
Message-ID: <625@quintus.UUCP>
Date: 4 Nov 88 08:53:35 GMT
References: <156@gloom.UUCP> <18931@apple.Apple.COM> <40@sopwith.UUCP> <998@l.cc.purdue.edu> <7575@aw.sei.cmu.edu> <23449@amdcad.AMD.COM> <232@taux02.UUCP>
Sender: news@quintus.UUCP
Reply-To: ok@quintus.UUCP (Richard A. O'Keefe)
Organization: Quintus Computer Systems, Inc.
Lines: 6

In article <232@taux02.UUCP> yuval@taux02.UUCP (Gideon Yuval) writes:
[That finding the first bit in a machine word requires NO special
 hardware -- his emphasis.  His formula, for a 32-bit machine, is]
>	table[(X xor (X-1)) mod 37] 

But this *DOES* require a fast modulo-37 operator!