+ast_value* parser_find_local(parser_t *parser, const char *name, size_t upto)
+{
+ size_t i;
+ ast_value *fun;
+ for (i = parser->locals_count; i > upto;) {
+ --i;
+ if (!strcmp(parser->locals[i]->name, name))
+ return parser->locals[i];
+ }
+ fun = parser->function->vtype;
+ for (i = 0; i < fun->expression.params_count; ++i) {
+ if (!strcmp(fun->expression.params[i]->name, name))
+ return fun->expression.params[i];
+ }
+ return NULL;
+}
+
+ast_value* parser_find_var(parser_t *parser, const char *name)
+{
+ ast_value *v;
+ v = parser_find_local(parser, name, 0);
+ if (!v) v = parser_find_global(parser, name);
+ return v;
+}
+
+typedef struct {
+ MEM_VECTOR_MAKE(ast_value*, p);
+} paramlist_t;
+MEM_VEC_FUNCTIONS(paramlist_t, ast_value*, p)
+
+static ast_value *parser_parse_type(parser_t *parser, int basetype, bool *isfunc)
+{
+ paramlist_t params;
+ ast_value *var;
+ lex_ctx ctx = parser_ctx(parser);
+ int vtype = basetype;
+ int temptype;
+ size_t i;
+
+ MEM_VECTOR_INIT(¶ms, p);
+
+ *isfunc = false;
+
+ if (parser->tok == '(') {
+ *isfunc = true;
+ while (true) {
+ ast_value *param;
+ bool dummy;
+
+ if (!parser_next(parser))
+ goto on_error;
+
+ if (parser->tok == ')')
+ break;
+
+ temptype = parser_token(parser)->constval.t;
+ if (!parser_next(parser))
+ goto on_error;
+
+ param = parser_parse_type(parser, temptype, &dummy);
+ (void)dummy;
+
+ if (!param)
+ goto on_error;
+
+ if (parser->tok == TOKEN_IDENT) {
+ /* named parameter */
+ if (!ast_value_set_name(param, parser_tokval(parser)))
+ goto on_error;
+ if (!parser_next(parser))
+ goto on_error;
+ }
+
+ if (!paramlist_t_p_add(¶ms, param)) {
+ parseerror(parser, "Out of memory while parsing typename");
+ goto on_error;
+ }
+
+ if (parser->tok == ',')
+ continue;
+ if (parser->tok == ')')
+ break;
+ parseerror(parser, "Unexpected token");
+ goto on_error;
+ }
+ if (!parser_next(parser))
+ goto on_error;
+ }
+
+ var = ast_value_new(ctx, "<unnamed>", vtype);
+ if (!var)
+ goto on_error;
+ MEM_VECTOR_MOVE(¶ms, p, &var->expression, params);
+ return var;
+on_error:
+ for (i = 0; i < params.p_count; ++i)
+ ast_value_delete(params.p[i]);
+ MEM_VECTOR_CLEAR(¶ms, p);
+ return NULL;
+}
+
+typedef struct
+{
+ size_t etype; /* 0 = expression, others are operators */
+ int paren;
+ size_t off;
+ ast_expression *out;
+ ast_block *block; /* for commas and function calls */
+ lex_ctx ctx;
+} sy_elem;
+typedef struct
+{
+ MEM_VECTOR_MAKE(sy_elem, out);
+ MEM_VECTOR_MAKE(sy_elem, ops);
+} shunt;
+MEM_VEC_FUNCTIONS(shunt, sy_elem, out)
+MEM_VEC_FUNCTIONS(shunt, sy_elem, ops)
+
+static sy_elem syexp(lex_ctx ctx, ast_expression *v) {
+ sy_elem e;
+ e.etype = 0;
+ e.out = v;
+ e.block = NULL;
+ e.ctx = ctx;
+ e.paren = 0;
+ return e;
+}
+
+static sy_elem syblock(lex_ctx ctx, ast_block *v) {
+ sy_elem e;
+ e.etype = 0;
+ e.out = (ast_expression*)v;
+ e.block = v;
+ e.ctx = ctx;
+ e.paren = 0;
+ return e;
+}
+
+static sy_elem syop(lex_ctx ctx, const oper_info *op) {
+ sy_elem e;
+ e.etype = 1 + (op - operators);
+ e.out = NULL;
+ e.block = NULL;
+ e.ctx = ctx;
+ e.paren = 0;
+ return e;
+}
+
+static sy_elem syparen(lex_ctx ctx, int p, size_t off) {
+ sy_elem e;
+ e.etype = 0;
+ e.off = off;
+ e.out = NULL;
+ e.block = NULL;
+ e.ctx = ctx;
+ e.paren = p;
+ return e;
+}
+
+static bool parser_sy_pop(parser_t *parser, shunt *sy)
+{
+ const oper_info *op;
+ lex_ctx ctx;
+ ast_expression *out = NULL;
+ ast_expression *exprs[3];
+ ast_block *blocks[3];
+ size_t i;
+
+ if (!sy->ops_count) {
+ parseerror(parser, "internal error: missing operator");
+ return false;
+ }
+
+ if (sy->ops[sy->ops_count-1].paren) {
+ parseerror(parser, "unmatched parenthesis");
+ return false;
+ }
+
+ op = &operators[sy->ops[sy->ops_count-1].etype - 1];
+ ctx = sy->ops[sy->ops_count-1].ctx;
+
+ if (sy->out_count < op->operands) {
+ parseerror(parser, "internal error: not enough operands: %i", sy->out_count);
+ return false;
+ }
+
+ sy->ops_count--;
+
+ sy->out_count -= op->operands;
+ for (i = 0; i < op->operands; ++i) {
+ exprs[i] = sy->out[sy->out_count+i].out;
+ blocks[i] = sy->out[sy->out_count+i].block;
+ }
+
+ if (blocks[0] && !blocks[0]->exprs_count && op->id != opid1(',')) {
+ parseerror(parser, "internal error: operator cannot be applied on empty blocks");
+ return false;
+ }
+
+ switch (op->id)
+ {
+ default:
+ parseerror(parser, "internal error: unhandled operand");
+ return false;
+
+ case opid1(','):
+ if (blocks[0]) {
+ if (!ast_block_exprs_add(blocks[0], exprs[1]))
+ return false;
+ } else {
+ blocks[0] = ast_block_new(ctx);
+ if (!ast_block_exprs_add(blocks[0], exprs[0]) ||
+ !ast_block_exprs_add(blocks[0], exprs[1]))
+ {
+ return false;
+ }
+ }
+ if (!ast_block_set_type(blocks[0], exprs[1]))
+ return false;
+
+ sy->out[sy->out_count++] = syblock(ctx, blocks[0]);
+ return true;
+
+ case opid1('+'):
+ if (exprs[0]->expression.vtype != exprs[1]->expression.vtype) {
+ parseerror(parser, "Cannot add type %s and %s",
+ type_name[exprs[0]->expression.vtype],
+ type_name[exprs[1]->expression.vtype]);
+ return false;
+ }
+ switch (exprs[0]->expression.vtype) {
+ case TYPE_FLOAT:
+ out = (ast_expression*)ast_binary_new(ctx, INSTR_ADD_F, exprs[0], exprs[1]);
+ break;
+ case TYPE_VECTOR:
+ out = (ast_expression*)ast_binary_new(ctx, INSTR_ADD_V, exprs[0], exprs[1]);
+ break;
+ default:
+ parseerror(parser, "Cannot add type %s and %s",
+ type_name[exprs[0]->expression.vtype],
+ type_name[exprs[1]->expression.vtype]);
+ return false;
+ };
+ break;
+ case opid1('-'):
+ if (exprs[0]->expression.vtype != exprs[1]->expression.vtype) {
+ parseerror(parser, "Cannot subtract type %s from %s",
+ type_name[exprs[1]->expression.vtype],
+ type_name[exprs[0]->expression.vtype]);
+ return false;
+ }
+ switch (exprs[0]->expression.vtype) {
+ case TYPE_FLOAT:
+ out = (ast_expression*)ast_binary_new(ctx, INSTR_SUB_F, exprs[0], exprs[1]);
+ break;
+ case TYPE_VECTOR:
+ out = (ast_expression*)ast_binary_new(ctx, INSTR_SUB_V, exprs[0], exprs[1]);
+ break;
+ default:
+ parseerror(parser, "Cannot add type %s from %s",
+ type_name[exprs[1]->expression.vtype],
+ type_name[exprs[0]->expression.vtype]);
+ return false;
+ };
+ break;
+ case opid1('*'):
+ if (exprs[0]->expression.vtype != exprs[1]->expression.vtype &&
+ exprs[0]->expression.vtype != TYPE_VECTOR &&
+ exprs[0]->expression.vtype != TYPE_FLOAT &&
+ exprs[1]->expression.vtype != TYPE_VECTOR &&
+ exprs[1]->expression.vtype != TYPE_FLOAT)
+ {
+ parseerror(parser, "Cannot multiply type %s from %s",
+ type_name[exprs[1]->expression.vtype],
+ type_name[exprs[0]->expression.vtype]);
+ return false;
+ }
+ switch (exprs[0]->expression.vtype) {
+ case TYPE_FLOAT:
+ if (exprs[1]->expression.vtype == TYPE_VECTOR)
+ out = (ast_expression*)ast_binary_new(ctx, INSTR_MUL_FV, exprs[0], exprs[1]);
+ else
+ out = (ast_expression*)ast_binary_new(ctx, INSTR_MUL_F, exprs[0], exprs[1]);
+ break;
+ case TYPE_VECTOR:
+ if (exprs[1]->expression.vtype == TYPE_FLOAT)
+ out = (ast_expression*)ast_binary_new(ctx, INSTR_MUL_VF, exprs[0], exprs[1]);
+ else
+ out = (ast_expression*)ast_binary_new(ctx, INSTR_MUL_V, exprs[0], exprs[1]);
+ break;
+ default:
+ parseerror(parser, "Cannot add type %s from %s",
+ type_name[exprs[1]->expression.vtype],
+ type_name[exprs[0]->expression.vtype]);
+ return false;
+ };
+ break;
+ case opid1('/'):
+ if (exprs[0]->expression.vtype != exprs[1]->expression.vtype ||
+ exprs[0]->expression.vtype != TYPE_FLOAT)
+ {
+ parseerror(parser, "Cannot divide types %s and %s",
+ type_name[exprs[0]->expression.vtype],
+ type_name[exprs[1]->expression.vtype]);
+ return false;
+ }
+ out = (ast_expression*)ast_binary_new(ctx, INSTR_DIV_F, exprs[0], exprs[1]);
+ break;
+
+
+ case opid1('='):
+ out = (ast_expression*)ast_store_new(ctx,
+ type_store_instr[exprs[0]->expression.vtype],
+ exprs[0], exprs[1]);
+ break;
+ }
+
+ if (!out) {
+ parseerror(parser, "failed to apply operand %s", op->op);
+ return false;
+ }
+
+ sy->out[sy->out_count++] = syexp(ctx, out);
+ return true;
+}
+
+static bool parser_close_call(parser_t *parser, shunt *sy)
+{
+ /* was a function call */
+ ast_expression *fun;
+ ast_call *call;
+
+ size_t fid;
+ size_t paramcount;
+
+ sy->ops_count--;
+ fid = sy->ops[sy->ops_count].off;
+
+ /* out[fid] is the function
+ * everything above is parameters...
+ * 0 params = nothing
+ * 1 params = ast_expression
+ * more = ast_block
+ */
+
+ if (sy->out_count < 1 || sy->out_count <= fid) {
+ parseerror(parser, "internal error: function call needs function and parameter list...");
+ return false;
+ }
+
+ fun = sy->out[fid].out;
+
+ call = ast_call_new(sy->ops[sy->ops_count].ctx, fun);
+ if (!call) {
+ parseerror(parser, "out of memory");
+ return false;
+ }
+
+ if (fid+1 == sy->out_count) {
+ /* no arguments */
+ paramcount = 0;
+ } else if (fid+2 == sy->out_count) {
+ ast_block *params;
+ sy->out_count--;
+ params = sy->out[sy->out_count].block;
+ if (!params) {
+ /* 1 param */
+ paramcount = 1;
+ if (!ast_call_params_add(call, sy->out[sy->out_count].out)) {
+ ast_delete(sy->out[sy->out_count].out);
+ parseerror(parser, "out of memory");
+ return false;
+ }
+ } else {
+ paramcount = params->exprs_count;
+ MEM_VECTOR_MOVE(params, exprs, call, params);
+ ast_delete(params);
+ }
+ } else {
+ parseerror(parser, "invalid function call");
+ return false;
+ }
+
+ /* overwrite fid, the function, with a call */
+ sy->out[fid] = syexp(call->expression.node.context, (ast_expression*)call);
+
+ if (fun->expression.vtype != TYPE_FUNCTION) {
+ parseerror(parser, "not a function");
+ return false;
+ }
+
+ if (!fun->expression.next) {
+ parseerror(parser, "could not determine function return type");
+ return false;
+ } else {
+ if (fun->expression.params_count != paramcount) {
+ parseerror(parser, "expected %i parameters, got %i", (int)fun->expression.params_count, paramcount);
+ return false;
+ }
+ }
+
+ return true;
+}
+
+static bool parser_close_paren(parser_t *parser, shunt *sy, bool functions_only)
+{
+ if (!sy->ops_count) {
+ parseerror(parser, "unmatched closing paren");
+ return false;
+ }
+ if (sy->ops[sy->ops_count-1].paren == 1) {
+ parseerror(parser, "empty parenthesis expression");
+ return false;
+ }
+ while (sy->ops_count) {
+ if (sy->ops[sy->ops_count-1].paren == 'f') {
+ if (!parser_close_call(parser, sy))
+ return false;
+ break;
+ }
+ if (sy->ops[sy->ops_count-1].paren == 1) {
+ sy->ops_count--;
+ return !functions_only;
+ }
+ if (!parser_sy_pop(parser, sy))
+ return false;
+ }
+ return true;
+}
+
+static ast_expression* parser_expression(parser_t *parser)
+{
+ ast_expression *expr = NULL;
+ shunt sy;
+ bool wantop = false;
+
+ MEM_VECTOR_INIT(&sy, out);
+ MEM_VECTOR_INIT(&sy, ops);
+
+ while (true)
+ {
+ if (!wantop)
+ {
+ bool nextwant = true;
+ if (parser->tok == TOKEN_IDENT)
+ {
+ /* variable */
+ ast_value *var = parser_find_var(parser, parser_tokval(parser));
+ if (!var) {
+ parseerror(parser, "unexpected ident: %s", parser_tokval(parser));
+ goto onerr;
+ }
+ if (!shunt_out_add(&sy, syexp(parser_ctx(parser), (ast_expression*)var))) {
+ parseerror(parser, "out of memory");
+ goto onerr;
+ }
+ }
+ else if (parser->tok == TOKEN_FLOATCONST) {
+ ast_value *val = parser_const_float(parser, (parser_token(parser)->constval.f));
+ if (!val)
+ return false;
+ if (!shunt_out_add(&sy, syexp(parser_ctx(parser), (ast_expression*)val))) {
+ parseerror(parser, "out of memory");
+ goto onerr;
+ }
+ }
+ else if (parser->tok == TOKEN_INTCONST) {
+ ast_value *val = parser_const_float(parser, (double)(parser_token(parser)->constval.i));
+ if (!val)
+ return false;
+ if (!shunt_out_add(&sy, syexp(parser_ctx(parser), (ast_expression*)val))) {
+ parseerror(parser, "out of memory");
+ goto onerr;
+ }
+ }
+ else if (parser->tok == TOKEN_STRINGCONST) {
+ ast_value *val = parser_const_string(parser, parser_tokval(parser));
+ if (!val)
+ return false;
+ if (!shunt_out_add(&sy, syexp(parser_ctx(parser), (ast_expression*)val))) {
+ parseerror(parser, "out of memory");
+ goto onerr;
+ }
+ }
+ else if (parser->tok == TOKEN_VECTORCONST) {
+ ast_value *val = parser_const_vector(parser, parser_token(parser)->constval.v);
+ if (!val)
+ return false;
+ if (!shunt_out_add(&sy, syexp(parser_ctx(parser), (ast_expression*)val))) {
+ parseerror(parser, "out of memory");
+ goto onerr;
+ }
+ }
+ else if (parser->tok == '(') {
+ nextwant = false; /* not expecting an operator next */
+ if (!shunt_ops_add(&sy, syparen(parser_ctx(parser), 1, 0))) {
+ parseerror(parser, "out of memory");
+ goto onerr;
+ }
+ }
+ else if (parser->tok == ')') {
+ /* allowed for function calls */
+ if (!parser_close_paren(parser, &sy, true))
+ goto onerr;
+ }
+ else {
+ /* TODO: prefix operators */
+ parseerror(parser, "expected statement");
+ goto onerr;
+ }
+ wantop = nextwant;
+ parser->lex->flags.noops = !wantop;
+ } else {
+ if (parser->tok == '(') {
+ /* we expected an operator, this is the function-call operator */
+ if (!shunt_ops_add(&sy, syparen(parser_ctx(parser), 'f', sy.out_count-1))) {
+ parseerror(parser, "out of memory");
+ goto onerr;
+ }
+ }
+ else if (parser->tok == ')') {
+ /* we do expect an operator next */
+ /* closing an opening paren */
+ if (!parser_close_paren(parser, &sy, false))
+ goto onerr;
+ }
+ else if (parser->tok != TOKEN_OPERATOR) {
+ parseerror(parser, "expected operator or end of statement");
+ goto onerr;
+ }
+ else {
+ /* classify the operator */
+ /* TODO: suffix operators */
+ const oper_info *op;
+ const oper_info *olast = NULL;
+ size_t o;
+ for (o = 0; o < operator_count; ++o) {
+ if (!(operators[o].flags & OP_PREFIX) &&
+ !(operators[o].flags & OP_SUFFIX) && /* remove this */
+ !strcmp(parser_tokval(parser), operators[o].op))
+ {
+ break;
+ }
+ }
+ if (o == operator_count) {
+ /* no operator found... must be the end of the statement */
+ break;
+ }
+ /* found an operator */
+ op = &operators[o];
+
+ if (sy.ops_count && !sy.ops[sy.ops_count-1].paren)
+ olast = &operators[sy.ops[sy.ops_count-1].etype-1];
+
+ while (olast && (
+ (op->prec < olast->prec) ||
+ (op->assoc == ASSOC_LEFT && op->prec <= olast->prec) ) )
+ {
+ if (!parser_sy_pop(parser, &sy))
+ goto onerr;
+ if (sy.ops_count && !sy.ops[sy.ops_count-1].paren)
+ olast = &operators[sy.ops[sy.ops_count-1].etype-1];
+ }
+
+ if (!shunt_ops_add(&sy, syop(parser_ctx(parser), op)))
+ goto onerr;
+ }
+ wantop = false;
+ parser->lex->flags.noops = true;
+ }
+ if (!parser_next(parser)) {
+ goto onerr;
+ }
+ if (parser->tok == ';') {
+ break;
+ }
+ }
+ if (!parser_next(parser)) {
+ parseerror(parser, "Unexpected end of file");
+ goto onerr;
+ }
+
+ while (sy.ops_count) {
+ if (!parser_sy_pop(parser, &sy))
+ goto onerr;
+ }
+
+ parser->lex->flags.noops = true;
+ if (!sy.out_count) {
+ parseerror(parser, "empty expression");
+ expr = NULL;
+ } else
+ expr = sy.out[0].out;
+ MEM_VECTOR_CLEAR(&sy, out);
+ MEM_VECTOR_CLEAR(&sy, ops);
+ return expr;
+
+onerr:
+ parser->lex->flags.noops = true;
+ MEM_VECTOR_CLEAR(&sy, out);
+ MEM_VECTOR_CLEAR(&sy, ops);
+ return NULL;
+}
+
+static bool parser_variable(parser_t *parser, ast_block *localblock);
+static bool parser_body_do(parser_t *parser, ast_block *block)