gmqcc/parser.c
Wolfgang Bumiller a0d78e985c handling return
2012-07-26 23:22:51 +02:00

919 lines
27 KiB
C

#include <stdio.h>
#include <stdarg.h>
#include "gmqcc.h"
#include "lexer.h"
typedef struct {
lex_file *lex;
int tok;
MEM_VECTOR_MAKE(ast_value*, globals);
MEM_VECTOR_MAKE(ast_function*, functions);
MEM_VECTOR_MAKE(ast_value*, imm_float);
ast_function *function;
MEM_VECTOR_MAKE(ast_value*, locals);
size_t blocklocal;
} parser_t;
MEM_VEC_FUNCTIONS(parser_t, ast_value*, globals)
MEM_VEC_FUNCTIONS(parser_t, ast_value*, imm_float)
MEM_VEC_FUNCTIONS(parser_t, ast_value*, locals)
MEM_VEC_FUNCTIONS(parser_t, ast_function*, functions)
void parseerror(parser_t *parser, const char *fmt, ...)
{
va_list ap;
if (parser)
printf("error %s:%lu: ", parser->lex->tok->ctx.file, (unsigned long)parser->lex->tok->ctx.line);
else
printf("error: ");
va_start(ap, fmt);
vprintf(fmt, ap);
va_end(ap);
printf("\n");
}
bool parser_next(parser_t *parser)
{
/* lex_do kills the previous token */
parser->tok = lex_do(parser->lex);
if (parser->tok == TOKEN_EOF || parser->tok >= TOKEN_ERROR)
return false;
return true;
}
/* lift a token out of the parser so it's not destroyed by parser_next */
token *parser_lift(parser_t *parser)
{
token *tok = parser->lex->tok;
parser->lex->tok = NULL;
return tok;
}
#define parser_tokval(p) (p->lex->tok->value)
#define parser_token(p) (p->lex->tok)
#define parser_ctx(p) (p->lex->tok->ctx)
ast_value* parser_const_float(parser_t *parser, double d)
{
size_t i;
ast_value *out;
for (i = 0; i < parser->imm_float_count; ++i) {
if (parser->imm_float[i]->constval.vfloat == d)
return parser->imm_float[i];
}
out = ast_value_new(parser_ctx(parser), "#IMMEDIATE", TYPE_FLOAT);
out->isconst = true;
out->constval.vfloat = d;
if (!parser_t_imm_float_add(parser, out)) {
ast_value_delete(out);
return NULL;
}
return out;
}
ast_value* parser_find_global(parser_t *parser, const char *name)
{
size_t i;
for (i = 0; i < parser->globals_count; ++i) {
if (!strcmp(parser->globals[i]->name, name))
return parser->globals[i];
}
return NULL;
}
ast_value* parser_find_local(parser_t *parser, const char *name, size_t upto)
{
size_t i;
for (i = parser->locals_count; i > upto;) {
--i;
if (!strcmp(parser->locals[i]->name, name))
return parser->locals[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;
MEM_VECTOR_INIT(&params, p);
*isfunc = false;
if (parser->tok == '(') {
*isfunc = true;
while (true) {
ast_value *param;
bool dummy;
if (!parser_next(parser)) {
MEM_VECTOR_CLEAR(&params, p);
return NULL;
}
if (parser->tok == ')')
break;
temptype = parser_token(parser)->constval.t;
if (!parser_next(parser)) {
MEM_VECTOR_CLEAR(&params, p);
return NULL;
}
param = parser_parse_type(parser, temptype, &dummy);
(void)dummy;
if (!param) {
MEM_VECTOR_CLEAR(&params, p);
return NULL;
}
if (!paramlist_t_p_add(&params, param)) {
MEM_VECTOR_CLEAR(&params, p);
parseerror(parser, "Out of memory while parsing typename");
return NULL;
}
if (parser->tok == ',')
continue;
if (parser->tok == ')')
break;
MEM_VECTOR_CLEAR(&params, p);
parseerror(parser, "Unexpected token");
return NULL;
}
if (!parser_next(parser)) {
MEM_VECTOR_CLEAR(&params, p);
return NULL;
}
}
var = ast_value_new(ctx, "<unnamed>", vtype);
if (!var) {
MEM_VECTOR_CLEAR(&params, p);
return NULL;
}
MEM_VECTOR_MOVE(&params, p, var, params);
return var;
}
typedef struct
{
size_t etype; /* 0 = expression, others are operators */
int paren;
ast_expression *out;
ast_value *value; /* need to know if we can assign */
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.value = NULL;
e.ctx = ctx;
e.paren = 0;
return e;
}
static sy_elem syval(lex_ctx ctx, ast_value *v) {
sy_elem e;
e.etype = 0;
e.out = (ast_expression*)v;
e.value = 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.value = NULL;
e.ctx = ctx;
e.paren = 0;
return e;
}
static sy_elem syparen(lex_ctx ctx, int p) {
sy_elem e;
e.etype = 0;
e.out = NULL;
e.value = 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_value *vars[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;
vars[i] = sy->out[sy->out_count+i].value;
}
printf("Applying operator %s\n", op->op);
switch (op->id)
{
default:
parseerror(parser, "internal error: unhandled operand");
return false;
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('='):
if (!vars[0]) {
parseerror(parser, "Cannot assign to non-variable");
return false;
}
out = (ast_expression*)ast_store_new(ctx,
type_store_instr[vars[0]->expression.vtype],
vars[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 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, syval(parser_ctx(parser), var))) {
parseerror(parser, "out of memory");
goto onerr;
}
printf("Added: %s\n", var->name);
}
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;
}
printf("Added: %i\n", parser_token(parser)->constval.i);
}
else if (parser->tok == '(') {
nextwant = false; /* not expecting an operator next */
if (!shunt_ops_add(&sy, syparen(parser_ctx(parser), 1))) {
parseerror(parser, "out of memory");
goto onerr;
}
}
else {
/* TODO: prefix operators */
parseerror(parser, "expected statement");
goto onerr;
}
wantop = nextwant;
parser->lex->flags.noops = !wantop;
} else {
if (parser->tok == ')') {
/* we do expect an operator next */
/* closing an opening paren */
printf("Applying closing paren\n");
if (!sy.ops_count) {
parseerror(parser, "unmatched closing paren");
goto onerr;
}
if (sy.ops[sy.ops_count-1].paren == 1) {
parseerror(parser, "empty parenthesis expression");
goto onerr;
}
while (sy.ops_count) {
if (sy.ops[sy.ops_count-1].paren == 1) {
sy.ops_count--;
break;
}
if (!parser_sy_pop(parser, &sy))
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;
printf("Added op %s\n", op->op);
}
wantop = false;
parser->lex->flags.noops = true;
}
if (!parser_next(parser)) {
goto onerr;
}
if (parser->tok == ';') {
printf("End of statement\n");
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)
{
if (parser->tok == TOKEN_TYPENAME)
{
/* local variable */
if (!parser_variable(parser, block))
return false;
return true;
}
else if (parser->tok == TOKEN_KEYWORD)
{
if (!strcmp(parser_tokval(parser), "return"))
{
ast_expression *exp = parser_expression(parser);
ast_return *ret;
if (!exp)
return false;
ret = ast_return_new(exp->expression.node.context, exp);
if (!ret) {
ast_delete(exp);
return false;
}
if (!ast_block_exprs_add(block, (ast_expression*)ret)) {
ast_delete(ret);
return false;
}
return true;
}
}
else if (parser->tok == '{')
{
/* a block */
parseerror(parser, "TODO: inner blocks");
return false;
}
else
{
ast_expression *exp = parser_expression(parser);
if (!exp)
return false;
if (!ast_block_exprs_add(block, exp)) {
ast_delete(exp);
return false;
}
return true;
}
}
static ast_block* parser_parse_block(parser_t *parser)
{
size_t oldblocklocal;
ast_block *block = NULL;
oldblocklocal = parser->blocklocal;
parser->blocklocal = parser->locals_count;
if (!parser_next(parser)) { /* skip the '{' */
parseerror(parser, "expected function body");
goto cleanup;
}
block = ast_block_new(parser_ctx(parser));
while (parser->tok != TOKEN_EOF && parser->tok < TOKEN_ERROR)
{
if (parser->tok == '}')
break;
if (!parser_body_do(parser, block)) {
ast_block_delete(block);
block = NULL;
goto cleanup;
}
}
if (parser->tok != '}') {
ast_block_delete(block);
block = NULL;
} else {
(void)parser_next(parser);
}
cleanup:
parser->blocklocal = oldblocklocal;
return block;
}
static bool parser_variable(parser_t *parser, ast_block *localblock)
{
bool isfunc = false;
ast_function *func = NULL;
lex_ctx ctx;
ast_value *var;
int basetype = parser_token(parser)->constval.t;
while (true)
{
if (!parser_next(parser)) { /* skip basetype or comma */
parseerror(parser, "expected variable declaration");
return false;
}
isfunc = false;
func = NULL;
ctx = parser_ctx(parser);
var = parser_parse_type(parser, basetype, &isfunc);
if (!var)
return false;
if (parser->tok != TOKEN_IDENT) {
parseerror(parser, "expected variable name\n");
return false;
}
if (!localblock && parser_find_global(parser, parser_tokval(parser))) {
ast_value_delete(var);
parseerror(parser, "global already exists: %s\n", parser_tokval(parser));
return false;
}
if (localblock && parser_find_local(parser, parser_tokval(parser), parser->blocklocal)) {
ast_value_delete(var);
parseerror(parser, "local variable already exists: %s\n", parser_tokval(parser));
return false;
}
if (!ast_value_set_name(var, parser_tokval(parser))) {
parseerror(parser, "failed to set variable name\n");
ast_value_delete(var);
return false;
}
if (isfunc) {
/* a function was defined */
ast_value *fval;
/* turn var into a value of TYPE_FUNCTION, with the old var
* as return type
*/
fval = ast_value_new(ctx, var->name, TYPE_FUNCTION);
func = ast_function_new(ctx, var->name, fval);
if (!fval || !func) {
ast_value_delete(var);
if (fval) ast_value_delete(fval);
if (func) ast_function_delete(func);
return false;
}
fval->expression.next = (ast_expression*)var;
MEM_VECTOR_MOVE(var, params, fval, params);
if (!parser_t_functions_add(parser, func)) {
ast_value_delete(var);
if (fval) ast_value_delete(fval);
if (func) ast_function_delete(func);
return false;
}
var = fval;
}
if ( (!localblock && !parser_t_globals_add(parser, var)) ||
( localblock && !parser_t_locals_add(parser, var)) )
{
ast_value_delete(var);
return false;
}
if (localblock && !ast_block_locals_add(localblock, var))
{
parser->locals_count--;
ast_value_delete(var);
return false;
}
if (!parser_next(parser)) {
ast_value_delete(var);
return false;
}
if (parser->tok == ';') {
if (!parser_next(parser))
return parser->tok == TOKEN_EOF;
return true;
}
if (parser->tok == ',') {
/* another var */
continue;
}
if (parser->tok != '=') {
parseerror(parser, "expected '=' or ';'");
return false;
}
if (!parser_next(parser))
return false;
if (parser->tok == '#') {
if (localblock) {
parseerror(parser, "cannot declare builtins within functions");
return false;
}
if (!isfunc || !func) {
parseerror(parser, "unexpected builtin number, '%s' is not a function", var->name);
return false;
}
if (!parser_next(parser)) {
parseerror(parser, "expected builtin number");
return false;
}
if (parser->tok != TOKEN_INTCONST) {
parseerror(parser, "builtin number must be an integer constant");
return false;
}
if (parser_token(parser)->constval.i <= 0) {
parseerror(parser, "builtin number must be positive integer greater than zero");
return false;
}
func->builtin = -parser_token(parser)->constval.i;
} else if (parser->tok == '{') {
/* function body */
ast_block *block;
ast_function *old = parser->function;
if (localblock) {
parseerror(parser, "cannot declare functions within functions");
return false;
}
parser->function = func;
block = parser_parse_block(parser);
parser->function = old;
if (!block)
return false;
if (!ast_function_blocks_add(func, block)) {
ast_block_delete(block);
return false;
}
return true;
} else {
parseerror(parser, "TODO, const assignment");
}
if (!parser_next(parser))
return false;
if (parser->tok == ',') {
/* another */
continue;
}
if (parser->tok != ';') {
parseerror(parser, "expected semicolon");
return false;
}
(void)parser_next(parser);
return true;
}
}
static bool parser_do(parser_t *parser)
{
if (parser->tok == TOKEN_TYPENAME)
{
return parser_variable(parser, NULL);
}
else if (parser->tok == TOKEN_KEYWORD)
{
/* handle 'var' and 'const' */
return false;
}
else if (parser->tok == '.')
{
/* entity-member declaration */
return false;
}
else
{
parseerror(parser, "unexpected token: %s", parser->lex->tok->value);
return false;
}
return true;
}
bool parser_compile(const char *filename)
{
size_t i;
parser_t *parser;
ir_builder *ir;
parser = (parser_t*)mem_a(sizeof(parser_t));
if (!parser)
return false;
memset(parser, 0, sizeof(parser));
MEM_VECTOR_INIT(parser, globals);
MEM_VECTOR_INIT(parser, locals);
parser->lex = lex_open(filename);
if (!parser->lex) {
printf("failed to open file \"%s\"\n", filename);
return false;
}
/* initial lexer/parser state */
parser->lex->flags.noops = true;
if (parser_next(parser))
{
while (parser->tok != TOKEN_EOF && parser->tok < TOKEN_ERROR)
{
if (!parser_do(parser)) {
if (parser->tok == TOKEN_EOF)
parseerror(parser, "unexpected eof");
else
parseerror(parser, "parse error\n");
lex_close(parser->lex);
mem_d(parser);
return false;
}
}
}
lex_close(parser->lex);
ir = ir_builder_new("gmqcc_out");
if (!ir) {
printf("failed to allocate builder\n");
goto cleanup;
}
for (i = 0; i < parser->imm_float_count; ++i) {
if (!ast_global_codegen(parser->imm_float[i], ir)) {
printf("failed to generate global %s\n", parser->imm_float[i]->name);
}
}
for (i = 0; i < parser->globals_count; ++i) {
if (!ast_global_codegen(parser->globals[i], ir)) {
printf("failed to generate global %s\n", parser->globals[i]->name);
}
}
for (i = 0; i < parser->functions_count; ++i) {
if (!ast_function_codegen(parser->functions[i], ir)) {
printf("failed to generate function %s\n", parser->functions[i]->name);
}
if (!ir_function_finalize(parser->functions[i]->ir_func)) {
printf("failed to finalize function %s\n", parser->functions[i]->name);
}
}
ir_builder_dump(ir, printf);
cleanup:
for (i = 0; i < parser->globals_count; ++i) {
ast_value_delete(parser->globals[i]);
}
MEM_VECTOR_CLEAR(parser, globals);
mem_d(parser);
return true;
}