ST20-C1 datasheet(183/205 Pages) STMICROELECTRONICS

183 / 205 page

183/205

then the total stack requirement is the larger stack requirement of the individual

expressions. This is only the case if care is taken over the order of evaluation. Note

that

‘infinite’ should be taken as meaning greater than any finite depth - because a

function call does not preserve values on the stack.

Let the function

eval( e, r ) evaluate expression e where there are r registers available

to perform the evaluation. Where this expression is an operation on two sub expres-

sions -

e1 op e2 - it is efficiently evaluated by the following algorithm, where op

commutes is true if aop b is equal to bop a and false otherwise:

if (depth(e1) < r AND depth(e2) < r) /* i.e. depth of both expressions is less

than the number of registers available */

{

if (depth(e2) > depth(e1)) {

if (op commutes) {

eval( e2, r ); eval( e1, r-1 ); op

}

else {

eval( e2, r ); eval( e1, r-1 ); rev; op

(*)

}

else if (depth(e2) <= depth(e1)) {

eval( e1, r ); eval( e2, r-1 ); op

}

else if (depth(e1) >= r OR depth(e2) >= r) {

if (depth(e2) >= depth(e1)) {

if (depth(e1) >= r ){

/* i.e. both depths >= r*/

eval( e2, r ); stl temp; eval( e1, r ); ldl temp; op

}

else {

/* i.e. depth(e1) < r AND depth(e2) >=r */

if (op commutes) {

eval( e2, r ); eval( e1, r-1 ); op

}

else {

/* i.e. operation doesn’t commute */

eval( e2, r ); eval( e1, r-1 ); rev; op

}

else if (depth(e2) < depth(e1)) {

if (depth(e2) >= r) {

/* i.e. both depths >= r*/

if (op commutes){

eval( e1, r ); stl temp; eval( e2, r ); ldl temp; op

}

else {

eval( e2, r ); stl temp; eval( e1, r ); ldl temp; op

}

else {

/* i.e. (depth(e2) < r) AND depth(e1) >= r*/

eval( e1, r ); eval( e2, r-1 ); op

ST20-C1 Folha de dados(PDF) 183 Page - STMicroelectronics

ST20-C1 Folha de dados(HTML) 183 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

Folha de dados Download

Ligação URL