Lines Matching defs:B0
352 S DivideThreeWordsByTwo(S *A, S B0, S B1, D *dummy=NULL)
354 // assert {A[2],A[1]} < {B1,B0}, so quotient can fit in a S
355 assert(A[2] < B1 || (A[2]==B1 && A[1] < B0));
365 D p = D::Multiply(B0, Q);
373 while (A[2] || A[1] > B1 || (A[1]==B1 && A[0]>=B0))
375 u = (D) A[0] - B0;
2039 #define B0 B
2070 size_t BN2 = Compare(B0, B1, N2) > 0 ? 0 : N2;
2075 RecursiveMultiply(R0, T2, A0, B0, N2);
2077 // now T[01] holds (A1-A0)*(B0-B1), R[01] holds A0*B0, R[23] holds A1*B1
2134 RecursiveMultiply(R, T, A0, B0, N2);
2135 RecursiveMultiplyBottom(T0, T1, A1, B0, N2);
2161 size_t BN2 = Compare(B0, B1, N2) > 0 ? 0 : N2;
2167 // now T[01] holds (A1-A0)*(B0-B1) = A1*B0+A0*B1-A1*B1-A0*B0, R[01] holds A1*B1
2436 #undef B0
2451 static word SubatomicDivide(word *A, word B0, word B1)
2453 // assert {A[2],A[1]} < {B1,B0}, so quotient can fit in a word
2454 assert(A[2] < B1 || (A[2]==B1 && A[1] < B0));
2464 DWord p = DWord::Multiply(B0, Q);
2472 while (A[2] || A[1] > B1 || (A[1]==B1 && A[0]>=B0))
2474 u = (DWord) A[0] - B0;