Lines Matching defs:result
201 uint64_t result[2];
203 result[0] = minuend[0] - subtrahend[0];
204 result[1] = minuend[1] - subtrahend[1] -
207 difference[0] = result[0];
208 difference[1] = result[1];
214 uint64_t result[2];
216 result[0] = addend1[0] + addend2[0];
217 result[1] = addend1[1] + addend2[1] +
218 (result[0] < addend1[0] || result[0] < addend2[0] ? 1 : 0);
220 sum[0] = result[0];
221 sum[1] = result[1];
266 * subtract and set the appropriate bit in the result. We then shift
272 uint64_t result[2] = { 0, 0 };
301 result[0] |= mask[0];
302 result[1] |= mask[1];
309 quotient[0] = result[0];
310 quotient[1] = result[1];
320 * 3. Subtract the result of the previous step (2 or 4, depending) and
322 * 4. For the result R we have so far, find the largest single-digit number
323 * x such that 2 * R * 10 * x + x^2 is less than the result from step 3.
368 uint64_t result[2] = { 0, 0 };
395 next_try[0] = result[0];
396 next_try[1] = result[1];
402 dt_shift_128(result, 1);
403 dt_add_128(result, one, result);
405 dt_shift_128(result, 1);
411 assert(result[1] == 0);
413 return (result[0]);
3893 * back, any ERROR firing would result in the library's ERROR enabling