Lines Matching defs:words
97 // Calculate the number of words to copy
98 unsigned words = std::min<unsigned>(bigVal.size(), getNumWords());
99 // Copy the words from bigVal to pVal
100 memcpy(pVal, bigVal.data(), words * APINT_WORD_SIZE);
135 // assume case where both are single words is already handled
208 /// In other words, if y > x then this function returns 1, otherwise 0.
298 // Split x into high and low words
536 // Otherwise, compare all words
766 /// non-overlapping, of Words words, by Shift, which must be less than 64.
767 static void lshrNear(uint64_t *Dst, uint64_t *Src, unsigned Words,
770 for (int I = Words - 1; I >= 0; --I) {
894 // extract the high 52 bits from the correct words in pVal.
928 // Copy full words.
953 // Copy full words.
968 // Write remaining full words.
991 // Copy words.
996 // Zero remaining words.
1076 // If we are shifting whole words, just move whole words
1078 // Move the words
1087 // Shift the low order words
1112 // Remaining words are 0 or -1, just assign them.
1160 // If we are shifting whole words, just move whole words
1169 // Shift the low order words
1177 // Remaining words are 0
1198 // lshr by the words size in the loop below which can produce incorrect
1220 // If we are shifting whole words, just move whole words
1229 // Copy whole words from this to Result.
1672 // First, compose the values into an array of 32-bit words instead of
1673 // 64-bit words. This is a necessity of both the "short division" algorithm
1726 // Now, adjust m and n for the Knuth division. n is the number of words in
1727 // the divisor. m is the number of words by which the dividend exceeds the
1729 // contain any zero words or the Knuth algorithm fails.
1786 // order words.
1817 // order words.
1851 // Get some facts about the LHS and RHS number of bits and words
1869 // All high words are zero, just use native divide
1917 // All high words are zero, just use native remainder
