Thanks, I'll direct future stuff his way. In the mean time, I think I managed to find a clever way around exponents for the time being. I have to hit it once, but outside a loop that runs ~1M times, so 1 pow for a million iterations, I can take that hit 
I might shoot an e-mail anyways. I didn't have a lot of time to examine the code, but I figure either one of 3 things are going on, 1, knowing the suffix would make everything clear, 2, there's a cool binary trick for doing pow calculations, or 3, there's a cool binary trick for approximating pow calculations. If its 2, I'd really like to know, if its 3, its still cool, if its 1, well, at least then I could make total sense of the isa code I see
As I said though, now, the code I added isn't having a significant impact on performance, and since time is always tight, I'll have to leave it alone for at least a little while...
