Lines Matching refs:nNum
57 while ( nLen > 1 && nNum[nLen-1] == 0 ) in MakeBigInt()
74 nNum[0] = (sal_uInt16)(nTmp & 0xffffL); in MakeBigInt()
75 nNum[1] = (sal_uInt16)(nTmp >> 16); in MakeBigInt()
94 while ( nLen > 1 && nNum[nLen-1] == 0 ) in Normalize()
100 nVal = nNum[0]; in Normalize()
101 else if ( nNum[1] & 0x8000 ) in Normalize()
104 nVal = ((long)nNum[1] << 16) + nNum[0]; in Normalize()
127 sal_uInt32 nTmp = (sal_uInt32)rVal.nNum[i] * (sal_uInt32)nMul + nK; in Mult()
129 nNum[i] = (sal_uInt16)nTmp; in Mult()
134 nNum[rVal.nLen] = nK; in Mult()
151 sal_uInt32 nTmp = (sal_uInt32)nNum[i] + (nK << 16); in Div()
152 nNum[i] = (sal_uInt16)(nTmp / nDiv); in Div()
157 if ( nNum[nLen-1] == 0 ) in Div()
171 for ( i = nLen - 1; i > 0 && nNum[i] == rVal.nNum[i]; i-- ) in IsLess()
174 return rVal.nNum[i] < nNum[i]; in IsLess()
192 rB.nNum[i] = 0; in AddLong()
198 nNum[i] = 0; in AddLong()
205 nZ = (long)nNum[i] + (long)rB.nNum[i] + k; in AddLong()
210 rErg.nNum[i] = (sal_uInt16)(nZ & 0xffffL); in AddLong()
216 rErg.nNum[i] = 1; in AddLong()
256 rB.nNum[i] = 0; in SubLong()
262 nNum[i] = 0; in SubLong()
269 nZ = (long)nNum[i] - (long)rB.nNum[i] + k; in SubLong()
274 rErg.nNum[i] = (sal_uInt16)(nZ & 0xffffL); in SubLong()
282 nZ = (long)rB.nNum[i] - (long)nNum[i] + k; in SubLong()
287 rErg.nNum[i] = (sal_uInt16)(nZ & 0xffffL); in SubLong()
325 rErg.nNum[i] = 0; 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()
351 nMult = (sal_uInt16)(0x10000L / ((long)rB.nNum[nLenB1] + 1)); in DivLong()
356 aTmpA.nNum[aTmpA.nLen] = 0; 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()
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()
378 nTmp = (long)aTmpA.nNum[j - nLenB + i] in DivLong()
379 - ((long)aTmpB.nNum[i] * nQ) 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()
422 nMult = (sal_uInt16)(0x10000L / ((long)rB.nNum[nLenB1] + 1)); in ModLong()
427 aTmpA.nNum[aTmpA.nLen] = 0; 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()
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()
449 nTmp = (long)aTmpA.nNum[j - nLenB + i] in ModLong()
450 - ((long)aTmpB.nNum[i] * nQ) 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()
492 for (i = nA.nLen - 1; i > 0 && nA.nNum[i] == nB.nNum[i]; i--) in ABS_IsLess()
495 return nA.nNum[i] < nB.nNum[i]; in ABS_IsLess()
611 nNum[i] = (sal_uInt16) fmod( nValue, 65536.0 ); in BigInt()
612 nValue -= nNum[i]; in BigInt()
617 nNum[i++] = (sal_uInt16) nValue; in BigInt()
635 nNum[0] = (sal_uInt16)(nValue & 0xffffUL); in BigInt()
636 nNum[1] = (sal_uInt16)(nValue >> 16); in BigInt()
655 nRet = ((sal_uInt32)nNum[1]) << 16; in operator sal_uIntPtr()
656 nRet += nNum[0]; in operator sal_uIntPtr()
671 double nRet = (double) ((sal_uInt32)nNum[i]);
677 nRet += (double) ((sal_uInt32)nNum[i]);
1059 for ( i = nA.nLen - 1; i > 0 && nA.nNum[i] == nB.nNum[i]; i-- ) in operator ==()
1063 return nA.nNum[i] == nB.nNum[i]; in operator ==()
1086 for ( i = nA.nLen - 1; i > 0 && nA.nNum[i] == nB.nNum[i]; i-- ) in operator <()
1091 return nA.nNum[i] > nB.nNum[i]; in operator <()
1093 return nA.nNum[i] < nB.nNum[i]; in operator <()
1119 for ( i = nA.nLen - 1; i > 0 && nA.nNum[i] == nB.nNum[i]; i-- ) in operator >()
1124 return nA.nNum[i] < nB.nNum[i]; in operator >()
1126 return nA.nNum[i] > nB.nNum[i]; in operator >()