-
- #if 1
- i = 0; // Shut up
- P[0] = Num;
- P[1] = Den;
- __asm__ __volatile__ (
- "fildq %2\n\t" // Num
- "fildq %1\n\t" // Den
- "fdivp\n\t"
- "fistpq %0"
- : "=m" (q)
- : "m" (P[0]), "m" (P[1])
- );
-
- //Log("%llx / %llx = %llx\n", Num, Den, q);
- #else
- // Restoring division, from wikipedia
- // http://en.wikipedia.org/wiki/Division_(digital)
- P[0] = Num; P[1] = 0;
- for( i = 64; i--; )
- {
- // P <<= 1;
- P[1] = (P[1] << 1) | (P[0] >> 63);
- P[0] = P[0] << 1;
-
- // P -= Den << 64
- P[1] -= Den;
-
- // P >= 0
- if( !(P[1] & (1ULL<<63)) ) {
- q |= (Uint64)1 << (63-i);
- }
- else {
- //q |= 0 << (63-i);
- P[1] += Den;
- }
- }
- #endif
-
- return q;