Several Questions

[Ken Richardson <KCR103@psuvm.psu.edu>]

I have been trying to get info.   lately about integer math routines, but
no one has responded to my posts.  What I would like to know is how many
cycles do integer multiplications require with the present integer math
routines used in the ORCA libraries and toolbox.  Specifically, I am interested
in a 16 by 16 bit multiply with a 16 bit result, a 16 by 16 bit multiply
with a 32 bit result.
Why do I want this information?  I have written a complete set of specific
case multiplication routines and I want to compare my routines to the present
routines used in the GS.  If my routines are faster, I am interested in
doing several things.
1) Creating C and Assembler subroutines for everyone to use in their programs.
2) Creating a toolbox patch to replace the integer routines in the toolbox

With these ideas, I would need help in testing and for the toolbox, how to even
patch the integer routines in the toolbox.

To give you all an idea of how fast (or slow) my math routines are, from
assembly, the slowest 16x16-->16 bit result multiply is 70 cycles.
A 16x16-->32 bit result would require approximately 330 cycles (worst case).

I do not know how much the system software uses the integer routines, or how
much Quickdraw II uses the integer routines, but any information would be
appreciated.  Ken
kcr103@psuvm.psu.edu