int/interpret.c

   1 #include <stdio.h>
   2 #include <stdlib.h>
   3
   4 #include "mTaskSymbols.h"
   5 #include "interpret.h"
   6 #include "misc.h"
   7 #include "task.h"
   8 #include "sds.h"
   9
  10 void run_task(struct task *t, int fd)
  11 {
  12         uint8_t *program = t->bc;
  13         int plen = t->tlen;
  14         int pc = 0;
  15         int sp = 0;
  16         char stack[STACKSIZE] = {0};
  17         printf("Running task with length: %d\n", plen);
  18         while(pc != plen){
  19                 printf("program: %d\n", program[pc]);
  20                 printf("stack: %02x %02x %02x %02x %02x %02x %02x %02x %02x %02x\n",
  21                         stack[0], stack[1], stack[2], stack[3], stack[4],
  22                         stack[5], stack[6], stack[7], stack[8], stack[9]);
  23                 switch(program[pc++]){
  24                 case BCNOP: trace("nop\n");
  25                         break;
  26                 case BCPUSH: trace("push %d\n", program[pc]*265+program[pc+1]);
  27                         stack[sp++] = program[pc]*265 + program[pc+1];
  28                         pc+=2;
  29                         break;
  30                 case BCPOP: trace("pop\n");
  31                         sp--;
  32                         break;
  33                 case BCSDSSTORE: trace("sds store\n");
  34                         sds_store(program[pc++], stack[sp-1]);
  35                         break;
  36                 case BCSDSFETCH: trace("sds fetch\n");
  37                         stack[sp++] = sds_fetch(program[pc++]);
  38                         break;
  39                 case BCSDSPUBLISH: trace("sds publish\n");
  40                         sds_publish(program[pc++], fd);
  41                         break;
  42                 case BCNOT: trace("not\n");
  43                         stack[sp] = stack[sp] > 0 ? 0 : 1;
  44                         break;
  45                 case BCADD: trace("add\n");
  46                         stack[sp-2] = stack[sp-1] + stack[sp-2];
  47                         sp -= 1;
  48                         break;
  49                 case BCSUB: trace("sub\n");
  50                         stack[sp-2] = stack[sp-1] - stack[sp-2];
  51                         sp -= 1;
  52                         break;
  53                 case BCMUL: trace("mul\n");
  54                         stack[sp-2] = stack[sp-1] * stack[sp-2];
  55                         sp -= 1;
  56                         break;
  57                 case BCDIV: trace("div\n");
  58                         stack[sp-2] = stack[sp-1] / stack[sp-2];
  59                         sp -= 1;
  60                         break;
  61                 case BCAND: trace("and\n");
  62                         stack[sp-2] = stack[sp-1] && stack[sp-2];
  63                         sp -= 1;
  64                         break;
  65                 case BCOR: trace("or\n");
  66                         stack[sp-2] = stack[sp-1] || stack[sp-2];
  67                         sp -= 1;
  68                         break;
  69                 case BCEQ: trace("eq\n");
  70                         stack[sp-2] = stack[sp-1] == stack[sp-2];
  71                         sp -= 1;
  72                         break;
  73                 case BCNEQ: trace("neq\n");
  74                         stack[sp-2] = stack[sp-1] != stack[sp-2];
  75                         sp -= 1;
  76                         break;
  77                 case BCLES: trace("les\n");
  78                         stack[sp-2] = stack[sp-1] < stack[sp-2];
  79                         sp -= 1;
  80                         break;
  81                 case BCGRE: trace("gre\n");
  82                         stack[sp-2] = stack[sp-1] > stack[sp-2];
  83                         sp -= 1;
  84                         break;
  85                 case BCLEQ: trace("leq\n");
  86                         stack[sp-2] = stack[sp-1] <= stack[sp-2];
  87                         sp -= 1;
  88                         break;
  89                 case BCGEQ: trace("geq\n");
  90                         stack[sp-2] = stack[sp-1] >= stack[sp-2];
  91                         sp -= 1;
  92                         break;
  93                 case BCJMP: trace("jmp to %d\n", program[pc]);
  94                         pc = pc + program[pc];
  95                         break;
  96                 case BCJMPT: trace("jmpt to %d\n", program[pc]);
  97                         pc += stack[sp] ? program[pc] : 1;
  98                         break;
  99                 case BCJMPF: trace("jmpf to %d\n", program[pc]);
 100                         pc += stack[sp] ? 1 : program[pc];
 101                         break;
 102                 case BCSERIALAVAIL: trace("SerialAvailable()\n");
 103                         break;
 104                 case BCSERIALPRINT: trace("SerialPrint()\n");
 105                         break;
 106                 case BCSERIALPRINTLN: trace("SerialPrintln()\n");
 107                         break;
 108                 case BCSERIALREAD: trace("SerialRead()\n");
 109                         break;
 110                 case BCSERIALPARSEINT: trace("SerialParseInt()\n");
 111                         break;
 112                 case BCANALOGREAD: trace("AnalogRead(%d)\n", program[pc]);
 113                         pc++;
 114                         break;
 115                 case BCANALOGWRITE: trace("AnalogWrite(%d)\n", program[pc]);
 116                         pc++;
 117                         break;
 118                 case BCDIGITALREAD: trace("DigitalRead(%d)\n", program[pc]);
 119                         pc++;
 120                         break;
 121                 case BCDIGITALWRITE: trace("DigitalWrite(%d)\n", program[pc]);
 122                         pc++;
 123                         break;
 124                 default:
 125                         die("Unrecognized command: %d\n", program[--pc]);
 126                 }
 127         }
 128         debug("Task terminated\n");
 129 }