Lines Matching refs:rErg
179 void BigInt::AddLong( BigInt& rB, BigInt& rErg ) in AddLong() argument
210 rErg.nNum[i] = (sal_uInt16)(nZ & 0xffffL); in AddLong()
216 rErg.nNum[i] = 1; in AddLong()
220 rErg.nLen = len; in AddLong()
221 rErg.bIsNeg = bIsNeg && rB.bIsNeg; in AddLong()
222 rErg.bIsBig = sal_True; in AddLong()
229 rB.SubLong(*this, rErg); in AddLong()
235 SubLong(rB, rErg); in AddLong()
242 void BigInt::SubLong( BigInt& rB, BigInt& rErg ) in SubLong() argument
274 rErg.nNum[i] = (sal_uInt16)(nZ & 0xffffL); in SubLong()
276 rErg.bIsNeg = bIsNeg; in SubLong()
287 rErg.nNum[i] = (sal_uInt16)(nZ & 0xffffL); in SubLong()
290 rErg.bIsNeg = !bIsNeg; in SubLong()
292 rErg.nLen = len; in SubLong()
293 rErg.bIsBig = sal_True; in SubLong()
300 AddLong(rB, rErg); in SubLong()
302 rErg.bIsNeg = sal_True; in SubLong()
307 AddLong(rB, rErg); in SubLong()
309 rErg.bIsNeg = sal_False; in SubLong()
315 void BigInt::MultLong( const BigInt& rB, BigInt& rErg ) const in MultLong()
320 rErg.bIsNeg = bIsNeg != rB.bIsNeg; in MultLong()
321 rErg.bIsBig = sal_True; in MultLong()
322 rErg.nLen = nLen + rB.nLen; in MultLong()
324 for (i = 0; i < rErg.nLen; i++) in MultLong()
325 rErg.nNum[i] = 0; 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()
342 void BigInt::DivLong( const BigInt& rB, BigInt& rErg ) const in DivLong()
389 rErg.nNum[j - nLenB] = nQ; in DivLong()
392 rErg.nNum[j - nLenB] = nQ - 1; in DivLong()
406 rErg.bIsNeg = bIsNeg != rB.bIsNeg; in DivLong()
407 rErg.bIsBig = sal_True; in DivLong()
408 rErg.nLen = nLen - rB.nLen + 1; in DivLong()
413 void BigInt::ModLong( const BigInt& rB, BigInt& rErg ) const in ModLong()
460 rErg.nNum[j - nLenB] = nQ; in ModLong()
463 rErg.nNum[j - nLenB] = nQ - 1; in ModLong()
476 rErg = aTmpA; in ModLong()
477 rErg.Div( nMult, nQ ); in ModLong()