| 1 |
|
| #include "stackmach.h" |
| 2 |
|
| |
| 3 |
|
| double |
| 4 |
0 |
| i_op_run(int codes[], size_t code_size, double parms[], size_t parm_size) { |
| 5 |
|
| double stack[100]; |
| 6 |
0 |
| double *sp = stack; |
| 7 |
|
| |
| 8 |
|
| /* FIXME: add a function to validate the op codes agains the parms |
| 9 |
|
| list size, and that the stack doesn't overflow or underflow and |
| 10 |
|
| has only a single element at the end. |
| 11 |
|
| */ |
| 12 |
|
| |
| 13 |
0 |
▶ | while (code_size) { |
Branch: 1 branch
| Branch | True | False | Total |
| while (code_size) { |
0 |
0 |
0 |
|
| 14 |
0 |
| switch (*codes++) { |
| 15 |
0 |
| case bcAdd: |
| 16 |
0 |
| sp[-2] += sp[-1]; |
| 17 |
0 |
| --sp; |
| 18 |
0 |
| break; |
| 19 |
|
| |
| 20 |
0 |
| case bcSubtract: |
| 21 |
0 |
| sp[-2] -= sp[-1]; |
| 22 |
0 |
| --sp; |
| 23 |
0 |
| break; |
| 24 |
|
| |
| 25 |
0 |
| case bcDiv: |
| 26 |
0 |
| sp[-2] /= sp[-1]; |
| 27 |
0 |
| --sp; |
| 28 |
0 |
| break; |
| 29 |
|
| |
| 30 |
0 |
| case bcMult: |
| 31 |
0 |
| sp[-2] *= sp[-1]; |
| 32 |
0 |
| --sp; |
| 33 |
0 |
| break; |
| 34 |
|
| |
| 35 |
0 |
| case bcParm: |
| 36 |
0 |
▶ | if (code_size) { |
Branch: 1 branch
| Branch | True | False | Total |
| if (code_size) { |
0 |
0 |
0 |
|
| 37 |
0 |
| size_t index = *codes++; |
| 38 |
0 |
▶ | if (index >= parm_size) |
Branch: 1 branch
| Branch | True | False | Total |
| if (index >= parm_size) |
0 |
0 |
0 |
|
| 39 |
0 |
| return 0.0; |
| 40 |
0 |
| *sp++ = parms[index]; |
| 41 |
0 |
| --code_size; |
| 42 |
|
| } |
| 43 |
|
| else |
| 44 |
0 |
| return 0.0; |
| 45 |
0 |
| break; |
| 46 |
|
| |
| 47 |
0 |
| case bcSin: |
| 48 |
0 |
| sp[-1] = sin(sp[-1]); |
| 49 |
0 |
| break; |
| 50 |
|
| |
| 51 |
0 |
| case bcCos: |
| 52 |
0 |
| sp[-1] = cos(sp[-1]); |
| 53 |
0 |
| break; |
| 54 |
|
| |
| 55 |
|
| } |
| 56 |
0 |
| --code_size; |
| 57 |
|
| } |
| 58 |
|
| |
| 59 |
0 |
| return sp[-1]; |
| 60 |
|
| } |
| 61 |
|
| |