Lines Matching refs:result
132 uint64_t result[2];
134 result[0] = minuend[0] - subtrahend[0];
135 result[1] = minuend[1] - subtrahend[1] -
138 difference[0] = result[0];
139 difference[1] = result[1];
145 uint64_t result[2];
147 result[0] = addend1[0] + addend2[0];
148 result[1] = addend1[1] + addend2[1] +
149 (result[0] < addend1[0] || result[0] < addend2[0] ? 1 : 0);
151 sum[0] = result[0];
152 sum[1] = result[1];
197 * subtract and set the appropriate bit in the result. We then shift
203 uint64_t result[2] = { 0, 0 };
232 result[0] |= mask[0];
233 result[1] |= mask[1];
240 quotient[0] = result[0];
241 quotient[1] = result[1];
251 * 3. Subtract the result of the previous step (2 or 4, depending) and
253 * 4. For the result R we have so far, find the largest single-digit number
254 * x such that 2 * R * 10 * x + x^2 is less than the result from step 3.
299 uint64_t result[2] = { 0, 0 };
326 next_try[0] = result[0];
327 next_try[1] = result[1];
333 dt_shift_128(result, 1);
334 dt_add_128(result, one, result);
336 dt_shift_128(result, 1);
342 assert(result[1] == 0);
344 return (result[0]);
2054 * back, any ERROR firing would result in the library's ERROR enabling