Lines Matching refs:result
143 uint64_t result[2];
145 result[0] = minuend[0] - subtrahend[0];
146 result[1] = minuend[1] - subtrahend[1] -
149 difference[0] = result[0];
150 difference[1] = result[1];
156 uint64_t result[2];
158 result[0] = addend1[0] + addend2[0];
159 result[1] = addend1[1] + addend2[1] +
160 (result[0] < addend1[0] || result[0] < addend2[0] ? 1 : 0);
162 sum[0] = result[0];
163 sum[1] = result[1];
208 * subtract and set the appropriate bit in the result. We then shift
214 uint64_t result[2] = { 0, 0 };
243 result[0] |= mask[0];
244 result[1] |= mask[1];
251 quotient[0] = result[0];
252 quotient[1] = result[1];
262 * 3. Subtract the result of the previous step (2 or 4, depending) and
264 * 4. For the result R we have so far, find the largest single-digit number
265 * x such that 2 * R * 10 * x + x^2 is less than the result from step 3.
310 uint64_t result[2] = { 0, 0 };
337 next_try[0] = result[0];
338 next_try[1] = result[1];
344 dt_shift_128(result, 1);
345 dt_add_128(result, one, result);
347 dt_shift_128(result, 1);
353 assert(result[1] == 0);
355 return (result[0]);
2681 * back, any ERROR firing would result in the library's ERROR enabling