static int exec_call(strm_stream* strm, strm_state* state, strm_string name, int argc, strm_value* argv, strm_value* ret) { int n = STRM_NG; strm_value m; if (argc > 0) { strm_state* ns = strm_value_ns(argv[0]); if (ns) { n = strm_var_get(ns, name, &m); } else if (argc == 1 && strm_array_p(argv[0])) { m = strm_str_value(name); n = ary_get(strm, argv[0], 1, &m, ret); if (n == STRM_OK) return STRM_OK; } } if (n == STRM_NG) { n = strm_var_get(state, name, &m); } if (n == STRM_OK) { return strm_funcall(strm, m, argc, argv, ret); } strm_raise(strm, "function not found"); return STRM_NG; }
static int exec_call(node_ctx* ctx, strm_string *name, int argc, strm_value* args, strm_value* ret) { strm_value m = strm_var_get(name); if (m.type == STRM_VALUE_CFUNC) { return ((exec_cfunc)m.val.p)(ctx, argc, args, ret); } node_raise(ctx, "function not found"); return 1; }
static int exec_call(strm_state* state, strm_string* name, int argc, strm_value* argv, strm_value* ret) { int n; strm_value m; n = strm_var_get(state, name, &m); if (n == 0) { switch (m.type) { case STRM_VALUE_CFUNC: return ((exec_cfunc)m.val.p)(state, argc, argv, ret); case STRM_VALUE_PTR: { strm_lambda* lambda = strm_value_ptr(m); node_lambda* nlbd = lambda->body; node_values* args = (node_values*)nlbd->args; strm_state c = {0}; int i; c.prev = lambda->state; if ((args == NULL && argc != 0) && (args->len != argc)) return STRM_NG; for (i=0; i<argc; i++) { n = strm_var_set(&c, (strm_string*)args->data[i], argv[i]); if (n) return n; } n = exec_expr(&c, nlbd->compstmt, ret); if (c.exc && c.exc->type == NODE_ERROR_RETURN) { *ret = c.exc->arg; return STRM_OK; } return n; } default: break; } } node_raise(state, "function not found"); return STRM_NG; }
strm_string strm_to_str(strm_value v) { char buf[32]; int n; strm_state* ns = strm_value_ns(v); if (ns) { strm_value m; n = strm_var_get(ns, strm_str_intern_lit("string"), &m); if (n == STRM_OK) { n = strm_funcall(NULL, m, 1, &v, &m); if (n == STRM_OK && strm_string_p(m)) return m; } } switch (strm_value_tag(v)) { case STRM_TAG_INT: n = sprintf(buf, "%d", strm_to_int(v)); return strm_str_new(buf, n); case STRM_TAG_BOOL: n = sprintf(buf, strm_to_int(v) ? "true" : "false"); return strm_str_new(buf, n); case STRM_TAG_CFUNC: n = sprintf(buf, "<cfunc:%p>", (void*)strm_value_cfunc(v)); return strm_str_new(buf, n); case STRM_TAG_STRING_I: case STRM_TAG_STRING_6: case STRM_TAG_STRING_O: case STRM_TAG_STRING_F: return strm_value_str(v); case STRM_TAG_ARRAY: case STRM_TAG_STRUCT: return strm_inspect(v); case STRM_TAG_PTR: if (strm_value_val(v) == 0) return strm_str_lit("nil"); else { void *p = strm_ptr(v); switch (strm_ptr_type(p)) { case STRM_PTR_STREAM: n = sprintf(buf, "<stream:%p>", p); break; case STRM_PTR_IO: { strm_io io = (strm_io)p; char *mode; switch (io->mode & 3) { case STRM_IO_READ: mode = "r"; break; case STRM_IO_WRITE: mode = "w"; break; case STRM_IO_READ|STRM_IO_WRITE: mode = "rw"; break; default: mode = "?"; break; } n = sprintf(buf, "<io: fd=%d mode=%s>", io->fd, mode); break; } case STRM_PTR_LAMBDA: n = sprintf(buf, "<lambda:%p>", p); break; case STRM_PTR_AUX: n = sprintf(buf, "<obj:%p>", p); break; } return strm_str_new(buf, n); } default: if (strm_flt_p(v)) { n = sprintf(buf, "%.14g", strm_to_flt(v)); return strm_str_new(buf, n); } n = sprintf(buf, "<%p>", strm_value_vptr(v)); return strm_str_new(buf, n); } /* not reached */ return strm_str_null; }
static int exec_expr(strm_stream* strm, strm_state* state, node* np, strm_value* val) { int n; if (np == NULL) { return STRM_NG; } switch (np->type) { /* case NODE_ARGS: break; */ case NODE_NS: { node_ns* ns = (node_ns*)np; strm_state* s = strm_ns_find(state, node_to_sym(ns->name)); if (!s) { strm_raise(strm, "failed to create namespace"); return STRM_NG; } return exec_expr(strm, s, ns->body, val); } case NODE_IMPORT: { node_import *ns = (node_import*)np; strm_state* s = strm_ns_get(node_to_sym(ns->name)); if (!s) { strm_raise(strm, "no such namespace"); return STRM_NG; } n = strm_env_copy(state, s); if (n) { strm_raise(strm, "failed to import"); return n; } return STRM_OK; } break; case NODE_SKIP: strm_set_exc(strm, NODE_ERROR_SKIP, strm_nil_value()); return STRM_OK; case NODE_EMIT: { int i, n; node_array* v0; v0 = (node_array*)((node_emit*)np)->emit; if (!v0) { strm_emit(strm, strm_nil_value(), NULL); } else { for (i = 0; i < v0->len; i++) { n = exec_expr(strm, state, v0->data[i], val); if (n) return n; strm_emit(strm, *val, NULL); } } return STRM_OK; } break; case NODE_LET: { node_let *nlet = (node_let*)np; n = exec_expr(strm, state, nlet->rhs, val); if (n) { strm_raise(strm, "failed to assign"); return n; } return strm_var_set(state, node_to_sym(nlet->lhs), *val); } case NODE_ARRAY: { node_array* v0 = (node_array*)np; strm_array arr = strm_ary_new(NULL, v0->len); strm_value *ptr = (strm_value*)strm_ary_ptr(arr); int i=0; for (i = 0; i < v0->len; i++, ptr++) { n = exec_expr(strm, state, v0->data[i], ptr); if (n) return n; } if (v0->headers) { strm_ary_headers(arr) = ary_headers(v0->headers, v0->len); } if (v0->ns) { strm_ary_ns(arr) = strm_ns_get(node_to_sym(v0->ns)); } else { strm_ary_ns(arr) = strm_str_null; } *val = strm_ary_value(arr); return STRM_OK; } case NODE_IDENT: { node_ident* ni = (node_ident*)np; n = strm_var_get(state, node_to_sym(ni->name), val); if (n) { strm_raise(strm, "failed to reference variable"); } return n; } case NODE_IF: { strm_value v; node_if* nif = (node_if*)np; n = exec_expr(strm, state, nif->cond, &v); if (n) return n; if (strm_bool_p(v) && strm_value_bool(v)) { return exec_expr(strm, state, nif->then, val); } else if (nif->opt_else != NULL) { return exec_expr(strm, state, nif->opt_else, val); } else { *val = strm_nil_value(); return STRM_OK; } } break; case NODE_OP: { node_op* nop = (node_op*)np; strm_value args[2]; int i=0; if (nop->lhs) { n = exec_expr(strm, state, nop->lhs, &args[i++]); if (n) return n; } if (nop->rhs) { n = exec_expr(strm, state, nop->rhs, &args[i++]); if (n) return n; } return exec_call(strm, state, node_to_sym(nop->op), i, args, val); } break; case NODE_LAMBDA: { strm_lambda lambda = malloc(sizeof(struct strm_lambda)); if (!lambda) return STRM_NG; lambda->type = STRM_PTR_LAMBDA; lambda->body = (node_lambda*)np; lambda->state = state; *val = strm_ptr_value(lambda); return STRM_OK; } break; case NODE_CALL: { /* TODO: wip code of ident */ node_call* ncall = (node_call*)np; int i; node_nodes* v0 = (node_nodes*)ncall->args; strm_value *args = malloc(sizeof(strm_value)*v0->len); for (i = 0; i < v0->len; i++) { n = exec_expr(strm, state, v0->data[i], &args[i]); if (n) return n; } return exec_call(strm, state, node_to_sym(ncall->ident), i, args, val); } break; case NODE_RETURN: { node_return* nreturn = (node_return*)np; node_nodes* args = (node_nodes*)nreturn->rv; strm_value arg; if (!args) { arg = strm_nil_value(); } else { switch (args->len) { case 0: arg = strm_nil_value(); break; case 1: n = exec_expr(strm, state, args->data[0], &arg); if (n) return n; break; default: { strm_array ary = strm_ary_new(NULL, args->len); strm_int i; for (i=0; i<args->len; i++) { n = exec_expr(strm, state, args->data[i], (strm_value*)&strm_ary_ptr(ary)[i]); if (n) return n; } } break; } } strm_set_exc(strm, NODE_ERROR_RETURN, arg); return STRM_OK; } break; case NODE_NODES: { int i; node_nodes* v = (node_nodes*)np; for (i = 0; i < v->len; i++) { n = exec_expr(strm, state, v->data[i], val); if (n) { if (strm) { node_error* exc = strm->exc; if (exc != NULL) { node* n = v->data[i]; exc->fname = n->fname; exc->lineno = n->lineno; } } return n; } } } return STRM_OK; case NODE_INT: *val = strm_int_value(((node_int*)np)->value); return STRM_OK; case NODE_FLOAT: *val = strm_int_value(((node_float*)np)->value); return STRM_OK; case NODE_BOOL: *val = strm_bool_value(((node_bool*)np)->value); return STRM_OK; case NODE_NIL: *val = strm_nil_value(); return STRM_OK; case NODE_STR: *val = strm_str_value(node_to_str(((node_str*)np)->value)); return STRM_OK; default: break; } return STRM_NG; }
static int exec_expr(strm_state* state, node* np, strm_value* val) { int n; if (np == NULL) { return STRM_NG; } switch (np->type) { /* case NODE_ARGS: break; */ case NODE_SKIP: { state->exc = malloc(sizeof(node_error)); state->exc->type = NODE_ERROR_SKIP; state->exc->arg = strm_nil_value(); return STRM_OK; } case NODE_EMIT: { int i, n; node_values* v0; if (!state->task) { node_raise(state, "failed to emit"); } v0 = (node_values*)np->value.v.p; for (i = 0; i < v0->len; i++) { n = exec_expr(state, v0->data[i], val); if (n) return n; strm_emit(state->task, *val, NULL); } return STRM_OK; } break; case NODE_LET: { node_let *nlet = (node_let*)np; n = exec_expr(state, nlet->rhs, val); if (n) { node_raise(state, "failed to assign"); return n; } return strm_var_set(state, nlet->lhs, *val); } case NODE_ARRAY: { node_values* v0 = (node_values*)np; strm_array *arr = strm_ary_new(NULL, v0->len); strm_value *ptr = (strm_value*)arr->ptr; int i=0; for (i = 0; i < v0->len; i++, ptr++) { n = exec_expr(state, v0->data[i], ptr); if (n) return n; } *val = strm_ptr_value(arr); return STRM_OK; } case NODE_MAP: { node_map* v0 = (node_map*)np; strm_value nmap; strm_array* ary; n = exec_expr(state, v0->values, &nmap); if (n) return n; ary = strm_value_ary(nmap); ary->headers = v0->headers; *val = nmap; return STRM_OK; } case NODE_IDENT: n = strm_var_get(state, np->value.v.s, val); if (n) { node_raise(state, "failed to reference variable"); } return n; case NODE_IF: { strm_value v; node_if* nif = (node_if*)np; n = exec_expr(state, nif->cond, &v); if (n) return n; if (strm_value_bool(v) && v.val.i) { return exec_expr(state, nif->then, val); } else if (nif->opt_else != NULL) { return exec_expr(state, nif->opt_else, val); } else { *val = strm_nil_value(); return STRM_OK; } } break; case NODE_OP: { node_op* nop = (node_op*)np; strm_value args[2]; int i=0; if (nop->lhs) { n = exec_expr(state, nop->lhs, &args[i++]); if (n) return n; } if (nop->rhs) { n = exec_expr(state, nop->rhs, &args[i++]); if (n) return n; } return exec_call(state, nop->op, i, args, val); } break; case NODE_LAMBDA: { struct strm_lambda* lambda = malloc(sizeof(strm_lambda)); if (!lambda) return STRM_NG; lambda->type = STRM_OBJ_LAMBDA; lambda->body = (node_lambda*)np; lambda->state = state; *val = strm_ptr_value(lambda); return STRM_OK; } break; case NODE_CALL: { /* TODO: wip code of ident */ node_call* ncall = (node_call*)np; int i; node_values* v0 = (node_values*)ncall->args; strm_value *args = malloc(sizeof(strm_value)*v0->len); for (i = 0; i < v0->len; i++) { n = exec_expr(state, v0->data[i], &args[i]); if (n) return n; } return exec_call(state, ncall->ident, i, args, val); } break; case NODE_RETURN: { node_return* nreturn = (node_return*)np; node_values* args = (node_values*)nreturn->rv; state->exc = malloc(sizeof(node_error)); state->exc->type = NODE_ERROR_RETURN; switch (args->len) { case 0: state->exc->arg = strm_nil_value(); break; case 1: n = exec_expr(state, args->data[0], &state->exc->arg); if (n) return n; break; default: { strm_array* ary = strm_ary_new(NULL, args->len); size_t i; for (i=0; i<args->len; i++) { n = exec_expr(state, args->data[i], (strm_value*)&ary->ptr[i]); if (n) return n; } } break; } return STRM_NG; } break; case NODE_STMTS: { int i; node_values* v = (node_values*)np; for (i = 0; i < v->len; i++) { n = exec_expr(state, v->data[i], val); if (state->exc != NULL) return STRM_NG; if (n) return n; } } return STRM_OK; case NODE_VALUE: switch (np->value.t) { case NODE_VALUE_BOOL: *val = strm_bool_value(np->value.v.b); return STRM_OK; case NODE_VALUE_NIL: *val = strm_nil_value(); return STRM_OK; case NODE_VALUE_STRING: case NODE_VALUE_IDENT: *val = strm_ptr_value(np->value.v.s); return STRM_OK; case NODE_VALUE_DOUBLE: *val = strm_flt_value(np->value.v.d); return STRM_OK; case NODE_VALUE_INT: *val = strm_int_value(np->value.v.i); return STRM_OK; /* following type should not be evaluated */ case NODE_VALUE_ERROR: case NODE_VALUE_USER: default: return STRM_NG; } default: break; } return STRM_NG; }
static int exec_expr(node_ctx* ctx, node* np, strm_value* val) { int n; if (np == NULL) { return 1; } switch (np->type) { /* case NODE_ARGS: break; case NODE_EMIT: break; */ case NODE_IDENT: *val = strm_var_get(np->value.v.s); return 0; case NODE_IF: { strm_value v; node_if* nif = (node_if*)np; n = exec_expr(ctx, nif->cond, &v); if (n) return n; if (strm_value_bool(v)) { return exec_expr(ctx, nif->then, val); } else if (nif->opt_else != NULL) { return exec_expr(ctx, nif->opt_else, val); } else { *val = strm_nil_value(); return 0; } } break; case NODE_OP: { node_op* nop = (node_op*)np; strm_value args[2]; int i=0; if (nop->lhs) { n = exec_expr(ctx, nop->lhs, &args[i++]); if (n) return n; } if (nop->rhs) { n = exec_expr(ctx, nop->rhs, &args[i++]); if (n) return n; } return exec_call(ctx, nop->op, i, args, val); } break; case NODE_CALL: { /* TODO: wip code of ident */ node_call* ncall = (node_call*)np; if (ncall->ident != NULL) { int i; node_values* v0 = (node_values*)ncall->args; strm_value *args = malloc(sizeof(strm_value)*v0->len); for (i = 0; i < v0->len; i++) { n = exec_expr(ctx, v0->data[i], &args[i]); if (n) return n; } return exec_call(ctx, ncall->ident->value.v.s, i, args, val); } else { node_block* nblk = (node_block*)ncall; strm_value v; int n; n = exec_expr(ctx, nblk->compstmt, &v); if (n && ctx->exc->type == NODE_ERROR_RETURN) { *val = ctx->exc->arg; free(ctx->exc); return 0; } } } break; case NODE_RETURN: { node_return* nreturn = (node_return*)np; ctx->exc = malloc(sizeof(node_error)); ctx->exc->type = NODE_ERROR_RETURN; n = exec_expr(ctx, nreturn->rv, &ctx->exc->arg); return n; } break; case NODE_STMTS: { int i, n; node_values* v = (node_values*)np; for (i = 0; i < v->len; i++) { n = exec_expr(ctx, v->data[i], val); if (n) return n; } return 0; } break; case NODE_VALUE: switch (np->value.t) { case NODE_VALUE_BOOL: *val = strm_bool_value(np->value.v.b); return 0; case NODE_VALUE_NIL: *val = strm_nil_value(); return 0; case NODE_VALUE_STRING: case NODE_VALUE_IDENT: *val = strm_ptr_value(np->value.v.s); return 0; case NODE_VALUE_DOUBLE: *val = strm_flt_value(np->value.v.d); return 0; case NODE_VALUE_INT: *val = strm_int_value(np->value.v.i); return 0; /* following type should not be evaluated */ case NODE_VALUE_ERROR: case NODE_VALUE_USER: default: return 1; } default: break; } return 1; }