Search | Google it | Results 1 - 5 of 5 for funcall:hi0bits (0.01 seconds) |
211: #ifdef IBM 212: if (( j = 11 - hi0bits(word0(&d2) & Frac_mask) )!=0) 213: dval(&d2) /= 1 << j;
73: b->wds = i + 1; 74: *bbits = i*ULbits + 32 - hi0bits(b->x[i]); 75: ret:
236: b->wds = n = x - b->x; 237: n = ULbits*n - hi0bits(L); 238: nbits = fpi->nbits;
669: #endif 670: k = hi0bits(y); 671: *e = 32 - k;
251: j = ULbits - j; 252: if (hi0bits(b->x[b->wds - 1]) != j) { 253: if (!lostbits)