Lines Matching refs:words
99 // Calculate the number of words to copy
100 unsigned words = std::min<unsigned>(bigVal.size(), getNumWords());
101 // Copy the words from bigVal to pVal
102 memcpy(U.pVal, bigVal.data(), words * APINT_WORD_SIZE);
125 // If the number of words is the same we can just change the width and stop.
325 // Fill any words between loWord and hiWord with all ones.
378 // Direct copy whole words.
422 static_assert(8 * sizeof(WordType) <= 64, "This code assumes only two words affected");
452 // General case - shift + copy source words directly into place.
485 static_assert(8 * sizeof(WordType) <= 64, "This code assumes only two words affected");
842 // extract the high 52 bits from the correct words in pVal.
872 // Copy full words.
919 // Copy words.
943 // Copy words.
946 // Zero remaining words.
1007 // Fastpath for moving by whole words.
1011 // Move the words containing significant bits.
1480 // First, compose the values into an array of 32-bit words instead of
1481 // 64-bit words. This is a necessity of both the "short division" algorithm
1533 // Now, adjust m and n for the Knuth division. n is the number of words in
1534 // the divisor. m is the number of words by which the dividend exceeds the
1536 // contain any zero words or the Knuth algorithm fails.
1608 // Get some facts about the LHS and RHS number of bits and words
1628 // All high words are zero, just use native divide
1644 // Get some facts about the LHS words.
1661 // All high words are zero, just use native divide
1721 // All high words are zero, just use native remainder
1753 // All high words are zero, just use native remainder
2503 /// no further borrowing is needed or it runs out of "words" in dst. The result
2505 /// exhausted. In other words, if src > dst then this function returns 1,
2719 // Fastpath for moving by whole words.
2747 // Fastpath for moving by whole words.
2968 // In other words, find maximum k such that LowkR <= kR < C.
2980 // to 0, or in other words, out of all parabolas that have solutions,
3073 // Big-endian host - the source is an array of 64 bit words ordered from
3100 // Big-endian - the destination is an array of 64 bit words ordered from