diff options
Diffstat (limited to 'infer.c')
| -rw-r--r-- | infer.c | 88 |
1 files changed, 59 insertions, 29 deletions
@@ -1,77 +1,107 @@ -static bool infer_from_expr(Expression *match, Expression *to, Identifier *idents, Value *vals, Type *types) { +static bool infer_from_expr(Typer *tr, Expression *match, Expression *to, Identifier *idents, Value *vals, Type *types) { + assert(to->flags & EXPR_FOUND_TYPE); + switch (match->kind) { + case EXPR_IDENT: + /* an identifier! maybe it's one of idents... */ + arr_foreach(idents, Identifier, ident) { + if (*ident == match->ident) { + long idx = ident - idents; + types[idx] = to->type; + if (!eval_expr(tr->evalr, to, &vals[idx])) + return false; + Copier c = copier_create(tr->allocr, tr->block); + Value new_val; + copy_val_full(&c, &new_val, &vals[idx], &to->type); + vals[idx] = new_val; + break; + } + } + break; + default: break; + } return true; } /* if match is not the same kind of type as to, returns true */ -static bool infer_from_type(Type *match, Type *to, Identifier *idents, Value *vals, Type *types) { +static bool infer_from_type(Typer *tr, Type *match, Type *to, Identifier *idents, Value *vals, Type *types) { assert(to->flags & TYPE_IS_RESOLVED); - switch (to->kind) { + switch (match->kind) { case TYPE_VOID: case TYPE_UNKNOWN: case TYPE_BUILTIN: case TYPE_TYPE: break; /* nothing we can do here */ case TYPE_TUPLE: { - if (match->kind != TYPE_TUPLE) return true; + if (to->kind != TYPE_TUPLE) return true; if (arr_len(match->tuple) != arr_len(to->tuple)) return true; Type *b = to->tuple; arr_foreach(match->tuple, Type, a) { - if (!infer_from_type(a, b, idents, vals, types)) + if (!infer_from_type(tr, a, b, idents, vals, types)) return false; ++b; } } break; case TYPE_FN: { - if (match->kind != TYPE_FN) return true; + if (to->kind != TYPE_FN) return true; if (arr_len(match->fn.types) != arr_len(to->fn.types)) return true; size_t i, len = arr_len(match->fn.types); for (i = 0; i < len; ++i) { if (match->fn.constness[i] != to->fn.constness[i]) return true; - if (!infer_from_type(&match->fn.types[i], &to->fn.types[i], idents, vals, types)) + if (!infer_from_type(tr, &match->fn.types[i], &to->fn.types[i], idents, vals, types)) return false; } } break; case TYPE_PTR: - if (match->kind != TYPE_PTR) return true; - if (!infer_from_type(match->ptr, to->ptr, idents, vals, types)) + if (to->kind != TYPE_PTR) return true; + if (!infer_from_type(tr, match->ptr, to->ptr, idents, vals, types)) return false; break; case TYPE_SLICE: - if (match->kind != TYPE_SLICE) return true; - if (!infer_from_type(match->slice, to->slice, idents, vals, types)) + if (to->kind != TYPE_SLICE) return true; + if (!infer_from_type(tr, match->slice, to->slice, idents, vals, types)) return false; break; case TYPE_STRUCT: { - if (match->kind != TYPE_STRUCT) return true; + if (to->kind != TYPE_STRUCT) return true; Field *fields_m = match->struc->fields; Field *fields_t = to->struc->fields; size_t i, len = arr_len(fields_m); if (len != arr_len(fields_t)) return true; for (i = 0; i < len; ++i) { - if (!infer_from_type(fields_m[i].type, fields_t[i].type, idents, vals, types)) + if (!infer_from_type(tr, fields_m[i].type, fields_t[i].type, idents, vals, types)) return false; } } break; - case TYPE_EXPR: - if (to->was_expr) - if (!infer_from_expr(match->expr, to->was_expr, idents, vals, types)) - return false; - break; + case TYPE_EXPR: { + Expression *to_expr = to->was_expr; + Expression e = {0}; + if (!to_expr) { + to_expr = &e; + to_expr->kind = EXPR_TYPE; + to_expr->typeval = *to; + to_expr->flags = EXPR_FOUND_TYPE; + Type *type = &to_expr->type; + type->flags = TYPE_IS_RESOLVED; + type->kind = TYPE_TYPE; + } + if (!infer_from_expr(tr, match->expr, to_expr, idents, vals, types)) + return false; + } break; case TYPE_ARR: { - if (match->kind != TYPE_ARR) return true; - Expression match_n_expr = {0}; - match_n_expr.kind = EXPR_LITERAL_INT; - match_n_expr.intl = match->arr.n; - match_n_expr.flags = EXPR_FOUND_TYPE; - Type *n_type = &match_n_expr.type; + if (to->kind != TYPE_ARR) return true; + Expression to_n_expr = {0}; + to_n_expr.kind = EXPR_LITERAL_INT; + to_n_expr.intl = to->arr.n; + to_n_expr.flags = EXPR_FOUND_TYPE; + Type *n_type = &to_n_expr.type; n_type->kind = TYPE_BUILTIN; n_type->builtin = BUILTIN_I64; n_type->flags = TYPE_IS_RESOLVED; - if (!infer_from_expr(&match_n_expr, to->arr.n_expr, idents, vals, types)) + if (!infer_from_expr(tr, match->arr.n_expr, &to_n_expr, idents, vals, types)) return false; - if (!infer_from_type(match->arr.of, to->slice, idents, vals, types)) + if (!infer_from_type(tr, match->arr.of, to->arr.of, idents, vals, types)) return false; } break; } @@ -80,11 +110,11 @@ static bool infer_from_type(Type *match, Type *to, Identifier *idents, Value *va /* match and to are dynamic arrays of equal size -idents is a dyn array +idents is a dyn array of distinct identifiers find the value of each ident by matching match[i] to to[i], i = 0..arr_len(match)-1 all the types in match must be resolved, and all the types in to must be unresolved */ -static bool infer_ident_vals(Type **match, Type **to, Identifier *idents, Value *vals, Type *types) { +static bool infer_ident_vals(Typer *tr, Type **match, Type **to, Identifier *idents, Value *vals, Type *types) { size_t ntypes = arr_len(match); size_t i; size_t nidents = arr_len(idents); @@ -97,7 +127,7 @@ static bool infer_ident_vals(Type **match, Type **to, Identifier *idents, Value } for (i = 0; i < ntypes; ++i) { - if (!infer_from_type(*match, *to, idents, vals, types)) + if (!infer_from_type(tr, *match, *to, idents, vals, types)) return false; ++match, ++to; } |