bit_pos = i * log2_radix;
pos = bit_pos / JS_LIMB_BITS;
shift = bit_pos % JS_LIMB_BITS;
- if (likely((shift + log2_radix) <= JS_LIMB_BITS)) {
- c = r->tab[pos] >> shift;
- } else {
- c = (r->tab[pos] >> shift) |
- (r->tab[pos + 1] << (JS_LIMB_BITS - shift));
+ c = r->tab[pos] >> shift;
+ if ((shift + log2_radix) > JS_LIMB_BITS &&
+ (pos + 1) < r->len) {
+ c |= r->tab[pos + 1] << (JS_LIMB_BITS - shift);
}
c &= (radix - 1);
*--q = digits[c];