gonzui


Format: Advanced Search

SearchGoogle itResults 1 - 1 of 1 for funcall:word1 from t2ex/bsd_source/lib/libc/src_bsd/stdlib/strtod.c (0.00 seconds)
t2ex
bsd_source/lib/libc/src_bsd/stdlib/strtod.c - 41.4KB - 1,105 lines
76:         word0(&u) = Exp_1 + (i << Exp_shift);
77:         word1(&u) = 0;
78:         return rv * u.d;
308: word0(&rv) = 0x7ff00000; 309: word1(&rv) = 0; 310: goto ret;
320: word0(&rv) = 0x7ff00000 | bits[1]; 321: word1(&rv) = bits[0]; 322: }
325: word0(&rv) = NAN_WORD0; 326: word1(&rv) = NAN_WORD1; 327: #ifndef No_Hex_NaN
466: word0(&rv) = Big0; 467: word1(&rv) = Big1; 468: break;
470: word0(&rv) = Exp_mask; 471: word1(&rv) = 0; 472: }
474: word0(&rv) = Exp_mask; 475: word1(&rv) = 0; 476: #endif /*Honor_FLT_ROUNDS*/
483: word0(&rv) = Big0; 484: word1(&rv) = Big1; 485: #endif /*IEEE_Arith*/
512: word0(&rv) = Big0; 513: word1(&rv) = Big1; 514: }
535: if (j >= 32) { 536: word1(&rv) = 0; 537: if (j >= 53)
542: else 543: word1(&rv) &= 0xffffffff << j; 544: }
562: word0(&rv) = Tiny0; 563: word1(&rv) = Tiny1; 564: /* The refinement below will clean
706: dval(&adj) = -1.; 707: if (!word1(&rv) 708: && !(word0(&rv) & Frac_mask)) {
773: if (dsign) { 774: if (word0(&rv) == Big0 && word1(&rv) == Big1) 775: goto ovfl;
787: */ 788: if (dsign || word1(&rv) || word0(&rv) & Bndry_mask 789: #ifdef IEEE_Arith
820: if ((word0(&rv) & Bndry_mask1) == Bndry_mask1 821: && word1(&rv) == ( 822: #ifdef Avoid_Underflow
827: /*boundary case -- increment exponent*/ 828: if (word0(&rv) == Big0 && word1(&rv) == Big1) 829: goto ovfl;
835: ; 836: word1(&rv) = 0; 837: #ifdef Avoid_Underflow
842: } 843: else if (!(word0(&rv) & Bndry_mask) && !word1(&rv)) { 844: drop_down:
875: word0(&rv) = L | Bndry_mask1; 876: word1(&rv) = 0xffffffff; 877: #ifdef IBM
888: } 889: else if (!(word1(&rv) & Lsb)) 890: break; 891: #else 892: if (!(word1(&rv) & LSB)) 893: break;
922: aadj = dval(&aadj1) = 1.; 923: else if (word1(&rv) || word0(&rv) & Bndry_mask) { 924: #ifndef Sudden_Underflow 925: if (word1(&rv) == Tiny1 && !word0(&rv)) 926: goto undfl;
969: Exp_msk1*(DBL_MAX_EXP+Bias-P)) { 970: if (word0(&rv0) == Big0 && word1(&rv0) == Big1) 971: goto ovfl; 972: word0(&rv) = Big0; 973: word1(&rv) = Big1; 974: goto cont;
1005: if (word0(&rv0) == Tiny0 1006: && word1(&rv0) == Tiny1) 1007: goto undfl; 1008: word0(&rv) = Tiny0; 1009: word1(&rv) = Tiny1; 1010: goto cont;
1046: /* The tolerances below are conservative. */ 1047: if (dsign || word1(&rv) || word0(&rv) & Bndry_mask) { 1048: if (aadj < .4999999 || aadj > .5000001)
1069: word0(&rv0) = Exp_1 + (70 << Exp_shift); 1070: word1(&rv0) = 0; 1071: dval(&rv0) += 1.;
1079: word0(&rv0) = Exp_1 - 2*P*Exp_msk1; 1080: word1(&rv0) = 0; 1081: dval(&rv) *= dval(&rv0);
1086: #else 1087: if (word0(&rv) == 0 && word1(&rv) == 0) 1088: #endif