gonzui


Format: Advanced Search

SearchGoogle itResults 1 - 1 of 1 for funcall:word0 from t2ex/bsd_source/lib/libc/src_bsd/stdlib/strtodg.c (0.00 seconds)
t2ex
bsd_source/lib/libc/src_bsd/stdlib/strtodg.c - 41.4KB - 1,154 lines
328: #ifdef VAX
329:         L = word0(d) << 16 | word0(d) >> 16 | Exp_msk11;
330: #else
331:         L = word0(d) | Exp_msk1;
332: #endif
615: dval(&adj) = dval(&rv); 616: word0(&adj) -= P*Exp_msk1; 617: /* adj = */ rounded_product(dval(&adj), tens[e2]); 618: if ((word0(&adj) & Exp_mask) 619: > Exp_msk1*(DBL_MAX_EXP+Bias-1-P)) 620: goto rv_notOK; 621: word0(&adj) += P*Exp_msk1; 622: dval(&rv) = dval(&adj);
657: while(e1 >= (1 << (n_bigtens-1))) { 658: e2 += ((word0(&rv) & Exp_mask) 659: >> Exp_shift1) - Bias; 660: word0(&rv) &= ~Exp_mask; 661: word0(&rv) |= Bias << Exp_shift1; 662: dval(&rv) *= bigtens[n_bigtens-1];
664: } 665: e2 += ((word0(&rv) & Exp_mask) >> Exp_shift1) - Bias; 666: word0(&rv) &= ~Exp_mask; 667: word0(&rv) |= Bias << Exp_shift1; 668: for(j = 0; e1 > 0; j++, e1 >>= 1)
679: while(e1 >= (1 << (n_bigtens-1))) { 680: e2 += ((word0(&rv) & Exp_mask) 681: >> Exp_shift1) - Bias; 682: word0(&rv) &= ~Exp_mask; 683: word0(&rv) |= Bias << Exp_shift1; 684: dval(&rv) *= tinytens[n_bigtens-1];
686: } 687: e2 += ((word0(&rv) & Exp_mask) >> Exp_shift1) - Bias; 688: word0(&rv) &= ~Exp_mask; 689: word0(&rv) |= Bias << Exp_shift1; 690: for(j = 0; e1 > 0; j++, e1 >>= 1)