Lines Matching refs:j
317 int i, j; in MultLong() local
327 for (j = 0; j < rB.nLen; j++) in MultLong()
331 nZ = (sal_uInt32)nNum[i] * (sal_uInt32)rB.nNum[j] + in MultLong()
332 (sal_uInt32)rErg.nNum[i + j] + k; in MultLong()
333 rErg.nNum[i + j] = (sal_uInt16)(nZ & 0xffffUL); in MultLong()
336 rErg.nNum[i + j] = (sal_uInt16)k; in MultLong()
344 int i, j; in DivLong() local
362 for (j = aTmpA.nLen - 1; j >= nLenB; j--) in DivLong()
364 nTmp = ( (long)aTmpA.nNum[j] << 16 ) + aTmpA.nNum[j - 1]; in DivLong()
365 if (aTmpA.nNum[j] == aTmpB.nNum[nLenB1]) in DivLong()
371 ((((sal_uInt32)nTmp) - aTmpB.nNum[nLenB1] * nQ) << 16) + aTmpA.nNum[j - 2]) in DivLong()
378 nTmp = (long)aTmpA.nNum[j - nLenB + i] in DivLong()
381 aTmpA.nNum[j - nLenB + i] = (sal_uInt16)nTmp; in DivLong()
386 unsigned short& rNum( aTmpA.nNum[j - nLenB + i] ); in DivLong()
388 if (aTmpA.nNum[j - nLenB + i] == 0) in DivLong()
389 rErg.nNum[j - nLenB] = nQ; in DivLong()
392 rErg.nNum[j - nLenB] = nQ - 1; in DivLong()
396 nTmp = aTmpA.nNum[j - nLenB + i] + aTmpB.nNum[i] + nK; in DivLong()
397 aTmpA.nNum[j - nLenB + i] = (sal_uInt16)(nTmp & 0xFFFFL); in DivLong()
415 short i, j; in ModLong() local
433 for (j = aTmpA.nLen - 1; j >= nLenB; j--) in ModLong()
435 nTmp = ( (long)aTmpA.nNum[j] << 16 ) + aTmpA.nNum[j - 1]; in ModLong()
436 if (aTmpA.nNum[j] == aTmpB.nNum[nLenB1]) in ModLong()
442 ((((sal_uInt32)nTmp) - aTmpB.nNum[nLenB1] * nQ) << 16) + aTmpA.nNum[j - 2]) in ModLong()
449 nTmp = (long)aTmpA.nNum[j - nLenB + i] in ModLong()
452 aTmpA.nNum[j - nLenB + i] = (sal_uInt16)nTmp; in ModLong()
457 unsigned short& rNum( aTmpA.nNum[j - nLenB + i] ); in ModLong()
459 if (aTmpA.nNum[j - nLenB + i] == 0) in ModLong()
460 rErg.nNum[j - nLenB] = nQ; in ModLong()
463 rErg.nNum[j - nLenB] = nQ - 1; in ModLong()
466 nTmp = aTmpA.nNum[j - nLenB + i] + aTmpB.nNum[i] + nK; in ModLong()
467 aTmpA.nNum[j - nLenB + i] = (sal_uInt16)(nTmp & 0xFFFFL); in ModLong()