Home | History | Annotate | Download | only in Support

Lines Matching defs:dividend

1491   assert(u && "Must provide dividend");
1549 uint64_t dividend = ((uint64_t(u[j+n]) << 32) + u[j+n-1]);
1550 DEBUG(dbgs() << "KnuthDiv: dividend == " << dividend << '\n');
1551 uint64_t qp = dividend / v[n-1];
1552 uint64_t rp = dividend % v[n-1];
1677 // Initialize the dividend
1700 // the divisor. m is the number of words by which the dividend exceeds the
1701 // divisor (i.e. m+n is the length of the dividend). These sizes must not
1927 // Get some size facts about the dividend and divisor