chibicc/type.c

174 lines
4.1 KiB
C
Raw Normal View History

2020-09-04 07:39:06 +03:00
#include "chibicc.h"
2019-08-11 04:18:55 +03:00
Type *ty_void = &(Type){TY_VOID, 1, 1};
Type *ty_bool = &(Type){TY_BOOL, 1, 1};
2019-08-11 04:18:55 +03:00
2020-08-30 11:21:54 +03:00
Type *ty_char = &(Type){TY_CHAR, 1, 1};
2020-09-06 02:10:01 +03:00
Type *ty_short = &(Type){TY_SHORT, 2, 2};
2020-09-06 02:09:09 +03:00
Type *ty_int = &(Type){TY_INT, 4, 4};
2020-08-27 15:51:00 +03:00
Type *ty_long = &(Type){TY_LONG, 8, 8};
2020-08-30 11:21:54 +03:00
static Type *new_type(TypeKind kind, int size, int align) {
Type *ty = calloc(1, sizeof(Type));
ty->kind = kind;
ty->size = size;
ty->align = align;
return ty;
}
2020-09-04 07:39:06 +03:00
bool is_integer(Type *ty) {
2020-08-27 15:51:00 +03:00
TypeKind k = ty->kind;
return k == TY_BOOL || k == TY_CHAR || k == TY_SHORT ||
2019-08-11 13:59:27 +03:00
k == TY_INT || k == TY_LONG || k == TY_ENUM;
2020-09-04 07:39:06 +03:00
}
Type *copy_type(Type *ty) {
Type *ret = calloc(1, sizeof(Type));
*ret = *ty;
return ret;
}
2020-09-04 07:39:06 +03:00
Type *pointer_to(Type *base) {
2020-08-30 11:21:54 +03:00
Type *ty = new_type(TY_PTR, 8, 8);
2020-09-04 07:39:06 +03:00
ty->base = base;
return ty;
}
2020-09-04 13:01:33 +03:00
Type *func_type(Type *return_ty) {
Type *ty = calloc(1, sizeof(Type));
ty->kind = TY_FUNC;
ty->return_ty = return_ty;
return ty;
}
2020-09-26 04:15:32 +03:00
Type *array_of(Type *base, int len) {
2020-08-30 11:21:54 +03:00
Type *ty = new_type(TY_ARRAY, base->size * len, base->align);
2020-09-26 04:15:32 +03:00
ty->base = base;
ty->array_len = len;
return ty;
}
2019-08-11 13:59:27 +03:00
Type *enum_type(void) {
return new_type(TY_ENUM, 4, 4);
}
2020-09-26 04:24:45 +03:00
static Type *get_common_type(Type *ty1, Type *ty2) {
if (ty1->base)
return pointer_to(ty1->base);
if (ty1->size == 8 || ty2->size == 8)
return ty_long;
return ty_int;
}
// For many binary operators, we implicitly promote operands so that
// both operands have the same type. Any integral type smaller than
// int is always promoted to int. If the type of one operand is larger
// than the other's (e.g. "long" vs. "int"), the smaller operand will
// be promoted to match with the other.
//
// This operation is called the "usual arithmetic conversion".
static void usual_arith_conv(Node **lhs, Node **rhs) {
Type *ty = get_common_type((*lhs)->ty, (*rhs)->ty);
*lhs = new_cast(*lhs, ty);
*rhs = new_cast(*rhs, ty);
}
2020-09-04 07:39:06 +03:00
void add_type(Node *node) {
if (!node || node->ty)
return;
add_type(node->lhs);
add_type(node->rhs);
add_type(node->cond);
add_type(node->then);
add_type(node->els);
add_type(node->init);
add_type(node->inc);
for (Node *n = node->body; n; n = n->next)
add_type(n);
for (Node *n = node->args; n; n = n->next)
add_type(n);
2020-09-04 07:39:06 +03:00
switch (node->kind) {
2020-09-26 04:24:45 +03:00
case ND_NUM:
node->ty = (node->val == (int)node->val) ? ty_int : ty_long;
return;
2020-09-04 07:39:06 +03:00
case ND_ADD:
case ND_SUB:
case ND_MUL:
case ND_DIV:
2020-10-07 14:18:57 +03:00
case ND_MOD:
2020-10-07 14:19:35 +03:00
case ND_BITAND:
case ND_BITOR:
case ND_BITXOR:
2020-09-26 04:24:45 +03:00
usual_arith_conv(&node->lhs, &node->rhs);
2020-09-26 04:15:32 +03:00
node->ty = node->lhs->ty;
return;
2020-09-26 04:24:45 +03:00
case ND_NEG: {
Type *ty = get_common_type(ty_int, node->lhs->ty);
node->lhs = new_cast(node->lhs, ty);
node->ty = ty;
return;
}
2020-09-04 07:39:06 +03:00
case ND_ASSIGN:
2020-09-26 04:15:32 +03:00
if (node->lhs->ty->kind == TY_ARRAY)
error_tok(node->lhs->tok, "not an lvalue");
2020-09-26 04:24:45 +03:00
if (node->lhs->ty->kind != TY_STRUCT)
node->rhs = new_cast(node->rhs, node->lhs->ty);
2020-09-04 07:39:06 +03:00
node->ty = node->lhs->ty;
return;
case ND_EQ:
case ND_NE:
case ND_LT:
case ND_LE:
2020-09-26 04:24:45 +03:00
usual_arith_conv(&node->lhs, &node->rhs);
node->ty = ty_int;
return;
2019-08-04 12:25:20 +03:00
case ND_FUNCALL:
2020-08-27 15:51:00 +03:00
node->ty = ty_long;
2020-09-04 07:39:06 +03:00
return;
2019-08-13 13:31:04 +03:00
case ND_NOT:
node->ty = ty_int;
return;
2019-08-13 13:41:11 +03:00
case ND_BITNOT:
node->ty = node->lhs->ty;
return;
case ND_VAR:
node->ty = node->var->ty;
return;
case ND_COMMA:
node->ty = node->rhs->ty;
return;
2019-08-08 16:43:58 +03:00
case ND_MEMBER:
node->ty = node->member->ty;
return;
2020-09-04 07:39:06 +03:00
case ND_ADDR:
2020-09-26 04:15:32 +03:00
if (node->lhs->ty->kind == TY_ARRAY)
node->ty = pointer_to(node->lhs->ty->base);
else
node->ty = pointer_to(node->lhs->ty);
2020-09-04 07:39:06 +03:00
return;
case ND_DEREF:
2020-09-26 04:15:32 +03:00
if (!node->lhs->ty->base)
error_tok(node->tok, "invalid pointer dereference");
2019-08-11 04:18:55 +03:00
if (node->lhs->ty->base->kind == TY_VOID)
error_tok(node->tok, "dereferencing a void pointer");
node->ty = node->lhs->ty->base;
2020-09-04 07:39:06 +03:00
return;
case ND_STMT_EXPR:
if (node->body) {
Node *stmt = node->body;
while (stmt->next)
stmt = stmt->next;
if (stmt->kind == ND_EXPR_STMT) {
node->ty = stmt->lhs->ty;
return;
}
}
error_tok(node->tok, "statement expression returning void is not supported");
return;
2020-09-04 07:39:06 +03:00
}
}