Lines Matching refs:i
125 for ( int i = 0; i < rVal.nLen; i++ ) in Mult() local
127 sal_uInt32 nTmp = (sal_uInt32)rVal.nNum[i] * (sal_uInt32)nMul + nK; in Mult()
129 nNum[i] = (sal_uInt16)nTmp; in Mult()
149 for ( int i = nLen - 1; i >= 0; i-- ) in Div() local
151 sal_uInt32 nTmp = (sal_uInt32)nNum[i] + (nK << 16); in Div()
152 nNum[i] = (sal_uInt16)(nTmp / nDiv); in Div()
170 int i; in IsLess() local
171 for ( i = nLen - 1; i > 0 && nNum[i] == rVal.nNum[i]; i-- ) in IsLess()
174 return rVal.nNum[i] < nNum[i]; in IsLess()
183 int i; in AddLong() local
191 for (i = rB.nLen; i < len; i++) in AddLong()
192 rB.nNum[i] = 0; in AddLong()
197 for (i = nLen; i < len; i++) in AddLong()
198 nNum[i] = 0; in AddLong()
204 for (i = 0, k = 0; i < len; i++) { 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()
246 int i; in SubLong() local
255 for (i = rB.nLen; i < len; i++) in SubLong()
256 rB.nNum[i] = 0; in SubLong()
261 for (i = nLen; i < len; i++) in SubLong()
262 nNum[i] = 0; in SubLong()
267 for (i = 0, k = 0; i < len; i++) in SubLong()
269 nZ = (long)nNum[i] - (long)rB.nNum[i] + k; in SubLong()
274 rErg.nNum[i] = (sal_uInt16)(nZ & 0xffffL); in SubLong()
280 for (i = 0, k = 0; i < len; i++) in SubLong()
282 nZ = (long)rB.nNum[i] - (long)nNum[i] + k; in SubLong()
287 rErg.nNum[i] = (sal_uInt16)(nZ & 0xffffL); in SubLong()
317 int i, j; in MultLong() local
324 for (i = 0; i < rErg.nLen; i++) in MultLong()
325 rErg.nNum[i] = 0; in MultLong()
329 for (i = 0, k = 0; i < nLen; i++) 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
376 for (i = 0; i < nLenB; i++) 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()
394 for (i = 0; i < nLenB; i++) 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
447 for (i = 0; i < nLenB; i++) 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()
465 for (i = 0; i < nLenB; i++) { 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()
491 int i; in ABS_IsLess() local
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()
607 int i=0; in BigInt() local
609 while ( ( nValue > 65536.0 ) && ( i < MAX_DIGITS ) ) in BigInt()
611 nNum[i] = (sal_uInt16) fmod( nValue, 65536.0 ); in BigInt()
612 nValue -= nNum[i]; in BigInt()
614 i++; in BigInt()
616 if ( i < MAX_DIGITS ) in BigInt()
617 nNum[i++] = (sal_uInt16) nValue; in BigInt()
619 nLen = i; in BigInt()
621 if ( i < 3 ) in BigInt()
670 int i = nLen-1; variable
671 double nRet = (double) ((sal_uInt32)nNum[i]);
673 while ( i )
676 i--;
677 nRet += (double) ((sal_uInt32)nNum[i]);
1058 int i; in operator ==() local
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 ==()
1085 int i; in operator <() local
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 <()
1118 int i; in operator >() local
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 >()