Re: Param ordering; < and <= David Feuer 22 Jul 2002 18:18 UTC

On Mon, 22 Jul 2002, Ben Goetter (in the field) wrote:

> Numerically, op< is less expensive than op<=.  Assuming that a fixnum
> (lambda (x y) (< x y)) compiles to a signed-comparison sequence like
> (x86)

> On the x86 and ARM, JL (BLT) tests two flag bits, whereas JLE (BLE)
> tests three.  (For unsigned comparisons, JB (BCC) tests one flag bit,
> whereas JBE (BLS) tests two.)

This seems kinda low-level and architecture-specific.  Does
it really make a significant difference?  What about other
architectures?

David