🚀 go-pugleaf

I don't know where this request should belong, this is the closest group
I can find.  Anyway, this is my problem (my friend's actually):

Given a bit-string of any size print out the bits set starting with the
least significant bit.  This is an algorithm that I offered him.  But I
think there is much better way of doing it.


static unsigned char binvalue[9]={0x00, 0x01, 0x02, 0x04, 0x08,
                                        0x10, 0x20, 0x40, 0x80 };

int
show_msb(ch, off)
unsigned char ch;
long          off;
{
  int pos;

  if ( ch )
   {
     pos = ilog2( ch );
     printf("position = %d\n",pos+off);
     ch ^= binvalue[pos];         /* could also use: ch -= binvalue[pos]; */
     show_msb(ch, off);           /* recursive call for rest of bits */
   }
  return( 0 );
}

int
ilog2(n)
register unsigned char n;
{
   register long q;

   q = 0;
   while( n )
    {
      n >>= 1;
      q++;
    }
   return( q );
}   /* ilog2 */


Thanks in advance.

Aaron B
aaronb@suhana.analog.ingr.com