summaryrefslogtreecommitdiff
path: root/main.c
diff options
context:
space:
mode:
Diffstat (limited to 'main.c')
-rw-r--r--main.c119
1 files changed, 78 insertions, 41 deletions
diff --git a/main.c b/main.c
index 8265aab..2341c8f 100644
--- a/main.c
+++ b/main.c
@@ -35,7 +35,19 @@ Node *parse_expr(Lexer *l, Proc *p);
void parse_return(Lexer *l, Proc *p) {
lex_next(l);
- Node *n = node_new(p, N_RETURN, p->ctrl, parse_expr(l, p));
+ Node *n;
+ if (p->ret_type.t == T_NONE) {
+ n = node_new(p, N_RETURN, p->ctrl);
+ } else {
+ Node *e = parse_expr(l, p);
+ if (!type_base_eql(&e->val.type, &p->ret_type)) {
+ lex_error_at(l, e->src_pos, LE_ERROR,
+ str_fmt(&p->arena, "incorrect return type (expected %S, got %S)",
+ type_desc(&p->ret_type, &p->arena),
+ type_desc(&e->val.type, &p->arena)));
+ }
+ n = node_new(p, N_RETURN, p->ctrl, e);
+ }
node_add(p, n, p->stop);
p->ctrl = n;
}
@@ -79,36 +91,48 @@ void parse_assign(Lexer *l, Proc *p) {
LexSpan pos = l->pos;
lex_expect(l, TM_ASSIGN);
lex_next(l);
- Node *e = parse_expr(l, p);
- if (!scope_update(&p->scope, name, e, p)) {
+ NameBinding *b = scope_find(&p->scope, name);
+ if (!b) {
lex_error_at(l, pos, LE_ERROR, S("undeclared identifier"));
}
+ Node *e = parse_expr(l, p);
+ if (!type_base_eql(&e->val.type, &b->node->val.type)) {
+ lex_error_at(l, pos, LE_ERROR,
+ str_fmt(&p->arena, "tried to assign value of type %S to variable of type %S",
+ type_desc(&e->val.type, &p->arena),
+ type_desc(&b->node->val.type, &p->arena)));
+ }
+ scope_update(b, e, p);
}
-void merge_scope(Lexer *l, Proc *p, ScopeNameList *na, ScopeNameList *nb) {
- for (ScopeFrame *f = p->scope.tail; f; f = f->prev) {
- for (NameBinding *b = f->latest; b; b = b->prev) {
- int i, j;
- for (i = 0; i < na->len && !str_eql(na->data[i].name, b->name); i++);
- for (j = 0; j < nb->len && !str_eql(nb->data[j].name, b->name); j++);
- if (i >= na->len && j >= nb->len) continue; /* no change */
- Node *phi;
- if (i >= na->len) {
- if (nb->data[j].node == b->node) continue;
- phi = node_new(p, N_PHI, p->ctrl, b->node, nb->data[j].node);
- } else if (j >= na->len) {
- if (na->data[i].node == b->node) continue;
- phi = node_new(p, N_PHI, p->ctrl, b->node, na->data[i].node);
- } else {
- if (na->data[i].node == b->node && nb->data[j].node == b->node) continue;
- phi = node_new(p, N_PHI, p->ctrl, na->data[i].node, nb->data[j].node);
- }
- node_remove(p, b->node, p->keepalive);
- phi = node_peephole(phi, p, l);
- node_add(p, phi, p->keepalive);
- b->node = phi;
+void merge_scope(Lexer *l, Proc *p, ScopeNameList *before, ScopeNameList *ntrue, ScopeNameList *nfalse) {
+ node_add(p, p->ctrl, p->keepalive);
+ for (int i = 0; i < before->len; i++) {
+ int j, k;
+ ScopeName *b4 = &before->data[i];
+ for (j = 0; j < ntrue->len && !str_eql(ntrue->data[j].name, b4->name); j++);
+ for (k = 0; k < nfalse->len && !str_eql(nfalse->data[k].name, b4->name); k++);
+ ScopeName *yes = j < ntrue->len ? &ntrue->data[j] : NULL;
+ ScopeName *no = k < nfalse->len ? &nfalse->data[k] : NULL;
+ if (!yes && !no) continue; /* no change */
+ Node *phi;
+ if (!no) {
+ if (yes->node == b4->node) continue;
+ phi = node_new(p, N_PHI, p->ctrl, yes->node, b4->node);
+ } else if (!yes) {
+ if (no->node == b4->node) continue;
+ phi = node_new(p, N_PHI, p->ctrl, b4->node, no->node);
+ } else {
+ if (yes->node == b4->node && no->node == b4->node) continue;
+ phi = node_new(p, N_PHI, p->ctrl, yes->node, no->node);
}
+ fprintf(stderr, "phi('%.*s', %d, %d)\n", (int)b4->name.n, b4->name.s, phi->in.data[1]->id, phi->in.data[2]->id);
+ phi = node_peephole(phi, p, l);
+ NameBinding *b = scope_find(&p->scope, b4->name);
+ assert(b);
+ scope_update(b, phi, p);
}
+ node_remove(p, p->ctrl, p->keepalive);
}
void parse_if(Lexer *l, Proc *p) {
@@ -120,8 +144,8 @@ void parse_if(Lexer *l, Proc *p) {
.type = { T_TOP, T_TUPLE, NULL },
.tuple = { 0 }
};
- ZDA_PUSH(&p->arena, &if_node->val.tuple, (Value) { .type = { T_CTRL, T_NONE, NULL } });
- ZDA_PUSH(&p->arena, &if_node->val.tuple, (Value) { .type = { T_CTRL, T_NONE, NULL } });
+ ZDA_PUSH(&p->arena, &if_node->val.tuple, (Value) { .type = { .lvl = T_CTRL, .t = T_NONE } });
+ ZDA_PUSH(&p->arena, &if_node->val.tuple, (Value) { .type = { .lvl = T_CTRL, .t = T_NONE } });
if_node = node_peephole(if_node, p, l);
Node *if_true = node_peephole(node_new(p, N_PROJ, if_node), p, l);
Node *if_false = node_peephole(node_new(p, N_PROJ, if_node), p, l);
@@ -149,15 +173,10 @@ void parse_if(Lexer *l, Proc *p) {
});
if (ctrl_else) {
p->ctrl = node_peephole(node_new(p, N_REGION, ctrl_if, ctrl_else), p, l);
- node_add(p, p->ctrl, p->keepalive);
- merge_scope(l, p, &scope_true, &scope_false);
- node_remove(p, p->ctrl, p->keepalive);
} else {
p->ctrl = node_peephole(node_new(p, N_REGION, ctrl_if, if_false), p, l);
- node_add(p, p->ctrl, p->keepalive);
- merge_scope(l, p, &scope_true, &scope_before);
- node_remove(p, p->ctrl, p->keepalive);
}
+ merge_scope(l, p, &scope_before, &scope_true, &scope_false);
scope_uncollect(&p->scope, p, &scope_true);
scope_uncollect(&p->scope, p, &scope_false);
scope_uncollect(&p->scope, p, &scope_before);
@@ -191,10 +210,19 @@ void parse_stmt(Lexer *l, Proc *p) {
Type parse_type(Lexer *l, Proc *proc) {
(void)proc;
Type t = { .lvl = T_BOT };
- if (str_eql(l->ident, S("i64"))) {
- t.t = T_INT;
- } else if (str_eql(l->ident, S("bool"))) {
- t.t = T_BOOL;
+ if (l->tok == TOK_DEREF) {
+ lex_next(l);
+ t.t = T_PTR;
+ t.next = new(&proc->arena, Type);
+ *t.next = parse_type(l, proc);
+ return t;
+ }
+ if (l->tok == TOK_IDENT) {
+ if (str_eql(l->ident, S("i64"))) {
+ t.t = T_INT;
+ } else if (str_eql(l->ident, S("bool"))) {
+ t.t = T_BOOL;
+ }
} else {
lex_error(l, LE_ERROR, S("unknown type"));
}
@@ -219,7 +247,7 @@ void parse_args_list(Lexer *l, Proc *proc) {
idbuf[id].name = l->ident;
idbuf[id].pos = l->pos;
id++;
- lex_expect(l, TM_IDENT | TM_COMMA);
+ lex_next(l);
if (l->tok == TOK_COMMA) continue;
Value v = (Value) { .type = parse_type(l, proc) };
lex_expected(l, TM_RPAREN | TM_COMMA);
@@ -237,6 +265,7 @@ void parse_args_list(Lexer *l, Proc *proc) {
}
Proc *parse_proc(Lexer *l, Unit *u) {
+ int has_ret = l->tok == TOK_FUNC;
DA_FIT(&u->procs, u->procs.len + 1);
Proc *proc = &u->procs.data[u->procs.len++];
lex_expect(l, TM_IDENT);
@@ -246,6 +275,11 @@ Proc *parse_proc(Lexer *l, Unit *u) {
if (l->tok == TOK_LPAREN) {
parse_args_list(l, proc);
}
+ if (has_ret) {
+ proc->ret_type = parse_type(l, proc);
+ } else {
+ proc->ret_type = (Type) { .lvl = T_BOT, .t = T_NONE };
+ }
lex_expected(l, TM_LBRACE);
lex_next(l);
while (l->tok != TOK_RBRACE) {
@@ -339,6 +373,7 @@ Node *parse_expr(Lexer *l, Proc *p) {
LexSpan pos = l->pos;
Node *lhs = parse_term(l, p);
NodeType nt = tok_to_bin_op(l->tok);;
+ if (lhs->refs <= 0) lex_error(l, LE_ERROR, S("dead lhs"));
assert(lhs->refs > 0);
if (nt != N_START) {
lex_next(l);
@@ -357,10 +392,11 @@ Node *parse_expr(Lexer *l, Proc *p) {
void parse_toplevel(Lexer *l, Unit *u) {
switch (l->tok) {
case TOK_PROC:
+ case TOK_FUNC:
parse_proc(l, u);
break;
default:
- lex_expected(l, TM_PROC);
+ lex_expected(l, TM_PROC | TM_FUNC);
break;
}
}
@@ -404,7 +440,7 @@ void node_print(Node *n, Proc *p) {
}
} else if (n->type == N_PROJ) {
Str d = type_desc(&n->in.data[0]->val.tuple.data[n->val.i].type, &p->arena);
- printf("\t%d [label=\"%ld | %.*s\", shape=record]", n->id, n->val.i, (int)d.n, d.s);
+ printf("\t%d [label=\"%.*s(%ld)\", shape=record]", n->id, (int)d.n, d.s, n->val.i);
} else {
printf("\t%d [label=\"%s\", shape=record]", n->id, node_type_name(n->type));
}
@@ -431,7 +467,8 @@ void node_print(Node *n, Proc *p) {
void proc_print(Proc *p) {
if (p->start) {
- printf("\t\"%.*s\" -> %d\n", (int)p->name.n, p->name.s, p->start->id);
+ Str d = type_desc(&p->ret_type, &p->arena);
+ printf("\t\"%.*s %.*s\" -> %d\n", (int)p->name.n, p->name.s, (int)d.n, d.s, p->start->id);
node_print(p->start, p);
if (no_opt) {
for (NameBinding *b = p->scope.free_bind; b; b = b->prev) {
generated by cgit v1.2.3 (git 2.46.0) at 2025-11-15 11:20:10 +0000