src/doer.c


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

#include "include/doer.h"
#include "include/tree.h"
#include "include/util.h"

/* Creates a new doer from a tree.  */
doer_t* doer_init(tree_t* tree) {
   doer_t* doer;

   doer = emalloc(sizeof(doer_t));

   doer->tree = tree;

   return doer;
}

/*
   Destroys a doer.
   - Does not destroy the `tree`.
*/
void doer_destroy(doer_t* doer) {
   free(doer);
}

void doer_do_blin_print(doer_t* doer) {
   printf(
      "%s",
      doer->tree->data.call.arg->data.carg.val->data.lstr.val
   );
}

void doer_do_blin_printl(doer_t* doer) {
   printf(
      "%s\n",
      doer->tree->data.call.arg->data.carg.val->data.lstr.val
   );
}

void doer_do_block(doer_t* doer) {
   if (!doer->tree) return;
   
   tree_t* tree_root = doer->tree;

   doer->tree = doer->tree->data.block.val;
   doer_do_expr(doer);
   doer->tree = tree_root->data.block.nxt;
   doer_do_block(doer);
}

void doer_do_expr(doer_t* doer) {
   switch (doer->tree->type) {
      case TREE_TYPE_CALL:
         /* Assume only call is `print` for now. */
         doer_do_call(doer);
         break;
      default:
         LOG_WARF("unknown tree type: %d", doer->tree->type);
   }
}

void doer_do_call(doer_t* doer) {
   /* Search through built-in functions first. */
   for (int i = 0; i < sizeof(blinfs) / sizeof(blinf_t); i++) {
      if (!strcmp(blinfs[i].name, doer->tree->data.call.target)) {
         (blinfs[i].fp)(doer);
         break;
      }
   }
}