Which conditional expression is faster?

[Acetronics2]

Which of these is faster to execute?

IF A+B+C=0 THEN . . .

or

IF A=0 AND B=0 AND C=0 THEN . . .

Hi, RUSS

A+B+C = 0 has many solutions AS ... you use an ADDITION and not a Bitwise AND !!!

253 + 2 + 1 = 0 .... for Bytes !!!
1 + 1 + 0 = 0 ... for Bits !!!

so, It can't be equivalent to the second line ... Too Bad !


Now, let's suppose A, B, C are BITs ...



so

IF  A | B | C  THEN Z = 1...

Will be the fastest ... with PBP.`( 17 asm Lines ...)

IF  (NOT A & NOT B & NOT C ) THEN Z = 1

is somewhat longer ...

BUT, if A,B,C are inputs ... would be faster to mask the other inputs and test if result is 0

IF ( PORTx & %00000111 ) THEN Z = 1

Only 12 asm lines ...

Alain

[RussMartin]

Thanks to each and all of you. I appreciate especially the warnings about pitfalls in the summation test; I'll remember those.

I failed to provide the limits/boundary conditions. I should have qualified the question and put it this way:

Which of these is faster to execute?

For A, B, C < 2 (and of course not negative!),

IF A+B+C=0 THEN . . .

or

IF A=0 AND B=0 AND C=0 THEN . . .

It looks as if Dave assumed the limits I had in mind.

The reason for my question was that, back in the bad old days, the syntax of conditional statements in FORTRAN IIb (sometimes called "Weather Bureau FORTRAN") was extremely limited, so doing a test like this was easier, if not necessarily faster.

I happened to try it with PBP in an application, and it worked. I just didn't know how economical it was in terms of generated code. Hence my question.