Lines Matching refs:aTmpB
349 BigInt aTmpA, aTmpB; in DivLong() local
360 aTmpB.Mult( rB, nMult ); in DivLong()
365 if (aTmpA.nNum[j] == aTmpB.nNum[nLenB1]) in DivLong()
368 nQ = (sal_uInt16)(((sal_uInt32)nTmp) / aTmpB.nNum[nLenB1]); in DivLong()
370 if ( ((sal_uInt32)aTmpB.nNum[nLenB1 - 1] * nQ) > in DivLong()
371 ((((sal_uInt32)nTmp) - aTmpB.nNum[nLenB1] * nQ) << 16) + aTmpA.nNum[j - 2]) in DivLong()
379 - ((long)aTmpB.nNum[i] * nQ) in DivLong()
396 nTmp = aTmpA.nNum[j - nLenB + i] + aTmpB.nNum[i] + nK; in DivLong()
420 BigInt aTmpA, aTmpB; in ModLong() local
431 aTmpB.Mult( rB, nMult); in ModLong()
436 if (aTmpA.nNum[j] == aTmpB.nNum[nLenB1]) in ModLong()
439 nQ = (sal_uInt16)(((sal_uInt32)nTmp) / aTmpB.nNum[nLenB1]); in ModLong()
441 if ( ((sal_uInt32)aTmpB.nNum[nLenB1 - 1] * nQ) > in ModLong()
442 ((((sal_uInt32)nTmp) - aTmpB.nNum[nLenB1] * nQ) << 16) + aTmpA.nNum[j - 2]) in ModLong()
450 - ((long)aTmpB.nNum[i] * nQ) in ModLong()
466 nTmp = aTmpA.nNum[j - nLenB + i] + aTmpB.nNum[i] + nK; in ModLong()