static int
blk_exec(strm_stream* strm, strm_value data)
{
strm_lambda lambda = strm->data;
strm_value ret = strm_nil_value();
node_args* args = (node_args*)lambda->body->args;
node_error* exc;
int n;
strm_state c = {0};
c.prev = lambda->state;
if (args) {
assert(args->len == 1);
strm_var_set(&c, node_to_sym(args->data[0]), data);
}
n = exec_expr(strm, &c, lambda->body->compstmt, &ret);
exc = strm->exc;
if (exc) {
if (exc->type == NODE_ERROR_RETURN) {
ret = exc->arg;
strm_clear_exc(strm);
}
else {
if (strm_option_verbose) {
strm_eprint(strm);
}
return STRM_NG;
}
}
if (n) return STRM_NG;
strm_emit(strm, ret, NULL);
return STRM_OK;
}
static void
blk_exec(strm_task* task, strm_value data)
{
strm_lambda *lambda = task->data;
strm_value ret = strm_nil_value();
node_values* args = (node_values*)lambda->body->args;
int n;
strm_state c = {0};
c.task = task;
c.prev = lambda->state;
assert(args->len == 1);
strm_var_set(&c, (strm_string*)args->data[0], data);
n = exec_expr(&c, lambda->body->compstmt, &ret);
if (n) return;
if (lambda->state->exc) {
if (lambda->state->exc->type == NODE_ERROR_RETURN) {
ret = lambda->state->exc->arg;
free(lambda->state->exc);
lambda->state->exc = NULL;
} else {
return;
}
}
strm_emit(task, ret, NULL);
}
static int
blk_exec(strm_task* task, strm_value data)
{
strm_lambda lambda = task->data;
strm_value ret = strm_nil_value();
node_args* args = (node_args*)lambda->body->args;
int n;
strm_state c = {0};
c.task = task;
c.prev = lambda->state;
if (args) {
assert(args->len == 1);
strm_var_set(&c, node_to_sym(args->data[0]), data);
}
n = exec_expr(&c, lambda->body->compstmt, &ret);
if (n) return STRM_NG;
if (lambda->state->exc) {
if (lambda->state->exc->type == NODE_ERROR_RETURN) {
ret = lambda->state->exc->arg;
free(lambda->state->exc);
lambda->state->exc = NULL;
} else {
return STRM_NG;
}
}
strm_emit(task, ret, NULL);
return STRM_OK;
}
void
strm_task_close(strm_task* task)
{
if (task->close_func) {
(*task->close_func)(task, strm_nil_value());
}
strm_task *d = task->dst;
while (d) {
strm_task_push(strm_queue_task(d, (strm_callback)strm_task_close, strm_nil_value()));
d = d->nextd;
}
if (task->mode == strm_task_prod) {
strm_task_push(strm_queue_task(task, pipeline_finish, strm_nil_value()));
}
}
static int
exec_uniq(strm_stream* strm, int argc, strm_value* args, strm_value* ret)
{
struct uniq_data* d;
strm_value func = strm_nil_value();
strm_get_args(strm, argc, args, "|v", &func);
d = malloc(sizeof(*d));
if (!d) return STRM_NG;
d->last = strm_nil_value();
d->func = func;
d->init = FALSE;
*ret = strm_stream_value(strm_stream_new(strm_filter,
strm_nil_p(func) ? iter_uniq : iter_uniqf,
NULL, (void*)d));
return STRM_OK;
}
static int
exec_minmax(strm_stream* strm, int argc, strm_value* args, strm_value* ret, int min)
{
struct minmax_data* d;
strm_value func = strm_nil_value();
strm_get_args(strm, argc, args, "|v", &func);
d = malloc(sizeof(*d));
if (!d) return STRM_NG;
d->start = TRUE;
d->min = min;
d->num = 0;
d->data = strm_nil_value();
d->func = func;
*ret = strm_stream_value(strm_stream_new(strm_filter, iter_minmax, minmax_finish, (void*)d));
return STRM_OK;
}
strm_value
strm_list_nth(strm_list* list, size_t n)
{
size_t len = list->len;
if (n > len) return strm_nil_value();
for (;;) {
if (n == 0) return list->car;
n--;
list = list->cdr;
if (list->type == STRM_OBJ_ARRAY) {
strm_array *ary = (strm_array*)list;
assert(ary->len > n);
return ary->ptr[n];
}
}
}
void
strm_emit(strm_task* task, strm_value data, strm_callback func)
{
strm_task *d = task->dst;
int tid = task->tid;
if (!strm_nil_p(data)) {
while (d) {
task_push(tid, strm_queue_task(d, d->start_func, data));
d = d->nextd;
tid++;
}
}
if (func) {
strm_task_push(strm_queue_task(task, func, strm_nil_value()));
}
}
static int
exec_reduce(strm_stream* strm, int argc, strm_value* args, strm_value* ret)
{
struct reduce_data* d;
strm_value v1, v2;
strm_get_args(strm, argc, args, "v|v", &v1, &v2);
d = malloc(sizeof(*d));
if (!d) return STRM_NG;
if (argc == 2) {
d->init = TRUE;
d->acc = v1;
d->func = v2;
}
else {
d->init = FALSE;
d->acc = strm_nil_value();
d->func = v1;
}
*ret = strm_stream_value(strm_stream_new(strm_filter, iter_reduce, reduce_finish, (void*)d));
return STRM_OK;
}
static int
exec_sum_avg(strm_stream* strm, int argc, strm_value* args, strm_value* ret, int avg)
{
struct sum_data* d;
strm_value func;
strm_get_args(strm, argc, args, "|v", &func);
d = malloc(sizeof(struct sum_data));
if (!d) return STRM_NG;
d->sum = 0;
d->c = 0;
d->num = 0;
if (argc == 0) {
d->func = strm_nil_value();
*ret = strm_stream_value(strm_stream_new(strm_filter, iter_sum,
avg ? avg_finish : sum_finish, (void*)d));
}
else {
d->func = func;
*ret = strm_stream_value(strm_stream_new(strm_filter, iter_sumf,
avg ? avg_finish : sum_finish, (void*)d));
}
return STRM_OK;
}
int
strm_task_connect(strm_task* src, strm_task* dst)
{
strm_task* s;
assert(dst->mode != strm_task_prod);
s = src->dst;
if (s) {
while (s->nextd) {
s = s->nextd;
}
s->nextd = dst;
}
else {
src->dst = dst;
}
if (src->mode == strm_task_prod) {
task_init();
pipeline_count++;
strm_task_push(strm_queue_task(src, src->start_func, strm_nil_value()));
}
return STRM_OK;
}
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;
}
