lopy4/components/hash-sigs-master/hss_compute.c
/* Count the number of 1 bits at the end (lsbits) of the integer */
/* Do it in the obvious way; straightline code may be faster (no */
/* unpredictable jumps, which are costly), but that would be less scrutable */
/* (and this code is "fast enough") */
Count the number of 1 bits at the end (lsbits) of the integer
Do it in the obvious way; straightline code may be faster (no
unpredictable jumps, which are costly), but that would be less scrutable
(and this code is "fast enough")
Count the number of 1 bits at the end ( lsbits ) of the integer Do it in the obvious way ; straightline code may be faster ( no unpredictable jumps which are costly ) but that would be less scrutable ( and this code is " fast enough " )
static int trailing_1_bits(merkle_index_t n) {
    int i;
    for (i=0; n&1; n>>=1, i++)
        ;
    return i;
}
static int trailing_1_bits ( merkle_index_t n ) { int i ; for ( i = 0 ; n & 1 ; n >>= 1 , i ++ ) ; return i ; }
Count the number of 1 bits at the end (lsbits) of the integer
Do it in the obvious way; straightline code may be faster (no
unpredictable jumps, which are costly), but that would be less scrutable
(and this code is "fast enough")
Count the number of 1 bits at the end ( lsbits ) of the integer Do it in the obvious way ; straightline code may be faster ( no unpredictable jumps which are costly ) but that would be less scrutable ( and this code is " fast enough " )