fast 64-bit dividend minu remainder calculation

[pshemu]

hi,

is there a way to fast calculate x-x%y (greatest multiplication of y
before x), where x and y are 64-bit integers on a 32-bit machine??
Maybe MMX registers would be useful?? I am writing this with gcc and
gas. Any help would be appreciated and thanks in advance.

Best regards,

Przemek

 

[P.J. Plauger]

is there a way to fast calculate x-x%y (greatest multiplication of y
before x), where x and y are 64-bit integers on a 32-bit machine??
Maybe MMX registers would be useful?? I am writing this with gcc and
gas. Any help would be appreciated and thanks in advance.

If you have long long support, I think (x / y) * y gives you what you want.

P.J. Plauger
Dinkumware, Ltd.
http://www.dinkumware.com