Lines Matching refs:TB
2565 word *const TB=T+NA+2;
2568 // copy B into TB and normalize it so that TB has highest bit set to 1
2570 TB[0] = TB[NB-1] = 0;
2571 CopyWords(TB+shiftWords, B, NB-shiftWords);
2572 unsigned shiftBits = WORD_BITS - BitPrecision(TB[NB-1]);
2574 ShiftWordsLeftByBits(TB, NB, shiftBits);
2584 while (TA[NA] || Compare(TA+NA-NB, TB, NB) >= 0)
2586 TA[NA] -= Subtract(TA+NA-NB, TA+NA-NB, TB, NB);
2593 assert(Compare(TA+NA-NB, TB, NB) < 0);
2597 BT[0] = TB[NB-2] + 1;
2598 BT[1] = TB[NB-1] + (BT[0]==0);
2600 // start reducing TA mod TB, 2 words at a time
2604 CorrectQuotientEstimate(TA+i-NB, TP, Q+i-NB, TB, NB);