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(pVal, bigVal.data(), words * APINT_WORD_SIZE);
137 // assume case where both are single words is already handled
210 /// In other words, if y > x then this function returns 1, otherwise 0.
300 // Split x into high and low words
544 // Otherwise, compare all words
755 /// non-overlapping, of Words words, by Shift, which must be less than 64.
756 static void lshrNear(uint64_t *Dst, uint64_t *Src, unsigned Words,
759 for (int I = Words - 1; I >= 0; --I) {
913 // extract the high 52 bits from the correct words in pVal.
947 // Copy full words.
972 // Copy full words.
987 // Write remaining full words.
1010 // Copy words.
1015 // Zero remaining words.
1095 // If we are shifting whole words, just move whole words
1097 // Move the words containing significant bits
1106 // Shift the low order words
1131 // Remaining words are 0 or -1, just assign them.
1183 // If we are shifting whole words, just move whole words
1194 // Shift the low order words
1202 // Remaining words are 0
1225 // lshr by the words size in the loop below which can produce incorrect
1249 // If we are shifting whole words, just move whole words
1260 // Copy whole words from this to Result.
1671 // First, compose the values into an array of 32-bit words instead of
1672 // 64-bit words. This is a necessity of both the "short division" algorithm
1725 // Now, adjust m and n for the Knuth division. n is the number of words in
1726 // the divisor. m is the number of words by which the dividend exceeds the
1728 // contain any zero words or the Knuth algorithm fails.
1785 // order words.
1818 // order words.
1852 // Get some facts about the LHS and RHS number of bits and words
1870 // All high words are zero, just use native divide
1918 // All high words are zero, just use native remainder
2885 // higher-order words of the integer and no borrow can occur. Exit early.
