Lines Matching defs:words

98     // Calculate the number of words to copy
99     unsigned words = std::min<unsigned>(bigVal.size(), getNumWords());
100     // Copy the words from bigVal to pVal
101     memcpy(U.pVal, bigVal.data(), words * APINT_WORD_SIZE);
122   // If the number of words is the same we can just change the width and stop.
334   // Fill any words between loWord and hiWord with all ones.
406     // Direct copy whole words.
446   static_assert(8 * sizeof(WordType) <= 64, "This code assumes only two words affected");
477   // General case - shift + copy source words directly into place.
504                 "This code assumes only two words affected");
889   // extract the high 52 bits from the correct words in pVal.
922   // Copy full words.
970   // Copy words.
997   // Copy words.
1000   // Zero remaining words.
1049     // Fastpath for moving by whole words.
1053       // Move the words containing significant bits.
1428   // First, compose the values into an array of 32-bit words instead of
1429   // 64-bit words. This is a necessity of both the "short division" algorithm
1481   // Now, adjust m and n for the Knuth division. n is the number of words in
1482   // the divisor. m is the number of words by which the dividend exceeds the
1484   // contain any zero words or the Knuth algorithm fails.
1556   // Get some facts about the LHS and RHS number of bits and words
1576     // All high words are zero, just use native divide
1592   // Get some facts about the LHS words.
1609     // All high words are zero, just use native divide
1669     // All high words are zero, just use native remainder
1701     // All high words are zero, just use native remainder
2471 /// no further borrowing is needed or it runs out of "words" in dst.  The result
2473 /// exhausted. In other words, if src > dst then this function returns 1,
2681   // Fastpath for moving by whole words.
2709   // Fastpath for moving by whole words.
2889     // In other words, find maximum k such that LowkR <= kR < C.
2901       // to 0, or in other words, out of all parabolas that have solutions,
3034     // Big-endian host - the source is an array of 64 bit words ordered from
3061     // Big-endian - the destination is an array of 64 bit words ordered from