That's not nearly the same thing as a PSW overflow bit.
To use that you'd have to catch SIGFPE, decode the instruction to
figure out where the operands are, calculate the overflow bits,
figure out what to do with them such that the mainline will find
it, and find some place to resume execution.
All in all, a grand mess all to save 14 cycles. Thus to even be
considered an option you would want to show that the multiply is
in the center of the processing loop and that operands that would
overflow are exceedingly rare.
If you do decide to go for it, I'd suggest you look at the exception
handling code from the 2.1.x series kernels -- the same sort of
thing could be applied here if the need were demonstrated.
-- To unsubscribe: send e-mail to firstname.lastname@example.org with 'unsubscribe' as the subject. Do not send it to email@example.com
Copyright © 1995-1997 Red Hat Software. Legal notices