Indeed, it would be hard to consider every possibilities. Still there should be something we could do, as a first step. As I previously said, we could try to monitor compiler performances by identifying some primitive features: if/then/else, case of, division, modulo, pragma inline and optimized proc calls.[...], division, modulo, [...]
The compiler is smarter than I thought. division and modulo is essentially the same. So I thought (cited from current print.jal) digit = byte ( data / digit_divisor ) data = data % digit_divisor digit_divisor = digit_divisor / 10 this would translate to three divisions. It does however only translate to two divisions. The modulo in the second line is already calculated after executing the first line, so this modulo effectively translates to about nothing. Three cheers for the compiler! Greets, Kiste -- You received this message because you are subscribed to the Google Groups "jallib" group. To post to this group, send email to [email protected]. To unsubscribe from this group, send email to [email protected]. For more options, visit this group at http://groups.google.com/group/jallib?hl=en.
