Re: [MI400] Is there an easy way to scan for bits?

["Leif Svalgaard" <leif@xxxxxxxx>]

I used the ILE compiler.
Somebody else answer Steve's question.
Phil, Bob, ... ?

From: Steve Richter <srichter@AutoCoder.com>
> Leaving out the omi, nmi factor, if the OMI C compiler is used it
translates
> the C code to MI correct ?  Then the trusty translator translates the MI
IRP
> code to risc code and optimizes it along the way.  Where would C get its
> advantage from ?
>
> From: "Leif Svalgaard" <leif@leif.org>
> > it will not be faster because the HLL is C.
> > It might be faster because the optimizer does a very good job
> > and is used for C but not for MI. I had the same experience
> > when coding AES in both MI and C.
> >
> > From: Steve Richter <srichter@AutoCoder.com>
> > > I'll bite, Why would it be faster in C ?
> > >
> > > From: "Bob Donovan" <rjd@us.ibm.com>
> > > > I like Leif's binary tree approach.  Another name for the data
> > > > structure he described is a trie.
> > > >
> > > > Bit twiddling in a HLL (like C) might be a "bit" faster than MI.   If
> > > > you go with C or C++, you should be able to find plenty of online
> > > > examples.