ST20-C1 datasheet(46/205 Pages) STMICROELECTRONICS

46 / 205 page

4.7 Evaluation of boolean expressions

46/205

The following shows the correspondence between C logical expressions and ST20-C1

instructions.

X and Y represent expressions,and K represents a constant. The symbol

‘

¬’ is a logical NOT (see section 4.7.1).

true

ldc 1

false

ldc 0

¬(X)

X== Y

X; Y; sub; eqc 0

X!= Y

¬(X; Y; sub; eqc 0)

X== K

X; eqc K

X!= K

¬(X; eqc K)

X> Y

X; Y; gt

X< Y

Y; X; gt

X>= Y

¬(Y; X; gt)

X<= Y

¬(X; Y; gt)

Further optimizations can be made to the ‘not equals’ comparison when followed by a

conditional jump.

X != Y; cj L

X; Y; sub; cj L

X != 0; cj L

X; cj L

4.7.1

Evaluation of NOT

If zero represents false and 1 represents true, then logical NOT can be performed by

eqc 0.

4.7.2

Evaluation of AND and OR

For evaluation of logical AND and OR operations, the instruction sequence depends

on whether strict or non-strict evaluation is used, i.e. whether both operands are

always evaluated. This is important if side-effects may occur, such as a trap, or if the

second operand is not always defined, as in:

if ((ptr != NULL) && (ptr->tag == TAG_VAL)) ...

In this example, ptr->tag is not defined if ptr is NULL. For languages such as ANSI

C, non-strict evaluation is required, so the following short-cuts must be used:

X OR Y

¬(¬(X); cj L; ¬(Y); L:)

X AND Y

X; cj L; Y; L:

For non-strict evaluation, the following laws should be applied to the compilation of

conditional expressions before code is generated to ensure that the jump is taken as

early as possible:

¬(X AND Y)

(

¬X) OR (¬Y)

¬(X; cj L; Y; L:)]

¬(X OR Y)

(

¬X) AND (¬Y)

¬(X); cj L; ¬(Y); L:]

(X OR Y); cj L

(

¬X); cj M; Y; cj L; M:

(X AND Y); cj L = X; cj L; Y; cj L

ST20-C1 Arkusz danych(PDF) 46 Page - STMicroelectronics

ST20-C1 Arkusz danych(HTML) 46 Page - STMicroelectronics

Html Pages

1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 59 60 61 62 63 64 65 66 67 68 69 70 71 72 73 74 75 76 77 78 79 80 81 82 83 84 85 86 87 88 89 90 91 92 93 94 95 96 97 98 99 100 ...More

Arkusz danych Pobierz

Link URL