Lines Matching refs:sIndex
602 for (int sIndex = 0, tIndex = tStart; tIndex < this.nWords; sIndex++, tIndex++) {
603 sum += (td[tIndex] & LONG_MASK) + (sd[sIndex] & LONG_MASK);
811 for (int sIndex = 0; sIndex < subLen && mIndex < minLen; sIndex++, mIndex++) {
812 long diff = (mData[mIndex] & LONG_MASK) - (sData[sIndex] & LONG_MASK) + borrow;
888 int sIndex = 0;
890 for (; sIndex < offsetDiff; sIndex++) {
891 long diff = 0L - (sData[sIndex] & LONG_MASK) + borrow;
892 sData[sIndex] = (int) diff;
895 //@ assert sIndex == offsetDiff;
896 for (int mIndex = 0; mIndex < minLen; sIndex++, mIndex++) {
897 //@ assert sIndex == offsetDiff + mIndex;
898 long diff = (mData[mIndex] & LONG_MASK) - (sData[sIndex] & LONG_MASK) + borrow;
899 sData[sIndex] = (int) diff;
904 subtrahend.nWords = sIndex;
1296 for (int sIndex = 0, tIndex = deltaSize; sIndex < S.nWords; sIndex++, tIndex++) {
1297 diff += (td[tIndex] & LONG_MASK) - q * (sd[sIndex] & LONG_MASK);
1304 int sIndex = 0;
1307 for (; rIndex < deltaSize && sIndex < S.nWords; sIndex++, rIndex++) {
1308 diff -= q * (sd[sIndex] & LONG_MASK);
1314 for (; sIndex < S.nWords; sIndex++, tIndex++, rIndex++) {
1315 diff += (td[tIndex] & LONG_MASK) - q * (sd[sIndex] & LONG_MASK);
