Lines Matching refs: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(pVal, bigVal.data(), words * APINT_WORD_SIZE);
136 // assume case where both are single words is already handled
209 /// In other words, if y > x then this function returns 1, otherwise 0.
299 // Split x into high and low words
541 // Otherwise, compare all words
779 /// non-overlapping, of Words words, by Shift, which must be less than 64.
780 static void lshrNear(uint64_t *Dst, uint64_t *Src, unsigned Words,
783 for (int I = Words - 1; I >= 0; --I) {
907 // extract the high 52 bits from the correct words in pVal.
941 // Copy full words.
966 // Copy full words.
981 // Write remaining full words.
1004 // Copy words.
1009 // Zero remaining words.
1089 // If we are shifting whole words, just move whole words
1091 // Move the words containing significant bits
1100 // Shift the low order words
1125 // Remaining words are 0 or -1, just assign them.
1177 // If we are shifting whole words, just move whole words
1188 // Shift the low order words
1196 // Remaining words are 0
1219 // lshr by the words size in the loop below which can produce incorrect
1243 // If we are shifting whole words, just move whole words
1254 // Copy whole words from this to Result.
1677 // First, compose the values into an array of 32-bit words instead of
1678 // 64-bit words. This is a necessity of both the "short division" algorithm
1731 // Now, adjust m and n for the Knuth division. n is the number of words in
1732 // the divisor. m is the number of words by which the dividend exceeds the
1734 // contain any zero words or the Knuth algorithm fails.
1791 // order words.
1824 // order words.
1858 // Get some facts about the LHS and RHS number of bits and words
1876 // All high words are zero, just use native divide
1924 // All high words are zero, just use native remainder
2889 // higher-order words of the integer and no borrow can occur. Exit early.
