This is the mail archive of the
gcc@gcc.gnu.org
mailing list for the GCC project.
Re: adding fast bitops to egcs?
- To: rich-paul at rich-paul dot net
- Subject: Re: adding fast bitops to egcs?
- From: Andreas Schwab <schwab at issan dot cs dot uni-dortmund dot de>
- Date: 03 May 1999 10:40:11 +0200
- Cc: Mike Stump <mrs at wrs dot com>, egcs at egcs dot cygnus dot com
- References: <Pine.LNX.4.05.9904302346270.14940-100000@deepthought.rich-paul.net>
rich-paul@rich-paul.net writes:
|> On Tue, 27 Apr 1999, Mike Stump wrote:
|>
|> > > > 2) number of bits set
|> > > True. No good pop count.
|> >
|> > Yes, but one can do it in plain C rather easily and quickly, if one
|> > knows the right algorithm.
|> >
|>
|> OK, I'll bite ... what's your code?
Use a 256-byte lookup table.
--
Andreas Schwab "And now for something
schwab@issan.cs.uni-dortmund.de completely different"
schwab@gnu.org