mirror of
https://github.com/odin-lang/Odin.git
synced 2026-10-09 14:22:18 -04:00
8100 lines
245 KiB
C++
8100 lines
245 KiB
C++
#define DEBUG_CHECK_ALL_PROCEDURES 1
|
|
|
|
#include "entity.cpp"
|
|
#include "types.cpp"
|
|
|
|
|
|
gb_internal u64 type_hash_canonical_type(Type *type);
|
|
|
|
gb_internal String get_final_microarchitecture();
|
|
|
|
gb_internal void check_expr(CheckerContext *c, Operand *operand, Ast *expression);
|
|
gb_internal void check_expr_or_type(CheckerContext *c, Operand *operand, Ast *expression, Type *type_hint=nullptr);
|
|
gb_internal void add_comparison_procedures_for_fields(CheckerContext *c, Type *t);
|
|
gb_internal Type *check_type(CheckerContext *ctx, Ast *e);
|
|
gb_internal void check_procedure_later(Checker *c, ProcInfo *info);
|
|
|
|
gb_internal bool is_operand_value(Operand o) {
|
|
switch (o.mode) {
|
|
case Addressing_Value:
|
|
case Addressing_Context:
|
|
case Addressing_Variable:
|
|
case Addressing_Constant:
|
|
case Addressing_MapIndex:
|
|
case Addressing_OptionalOk:
|
|
case Addressing_OptionalOkPtr:
|
|
case Addressing_SoaVariable:
|
|
case Addressing_SwizzleValue:
|
|
case Addressing_SwizzleVariable:
|
|
return true;
|
|
}
|
|
return false;
|
|
}
|
|
gb_internal bool is_operand_nil(Operand o) {
|
|
return o.mode == Addressing_Value && o.type == t_untyped_nil;
|
|
}
|
|
gb_internal bool is_operand_uninit(Operand o) {
|
|
return o.mode == Addressing_Value && o.type == t_untyped_uninit;
|
|
}
|
|
|
|
gb_internal bool check_rtti_type_disallowed(Token const &token, Type *type, char const *format) {
|
|
if (build_context.no_rtti && type) {
|
|
if (is_type_any(type)) {
|
|
gbString t = type_to_string(type);
|
|
error(token, format, t);
|
|
gb_string_free(t);
|
|
return true;
|
|
}
|
|
}
|
|
return false;
|
|
}
|
|
|
|
gb_internal bool check_rtti_type_disallowed(Ast *expr, Type *type, char const *format) {
|
|
GB_ASSERT(expr != nullptr);
|
|
return check_rtti_type_disallowed(ast_token(expr), type, format);
|
|
}
|
|
|
|
|
|
gb_internal void scope_reserve(Scope *scope, isize count) {
|
|
scope_map_reserve(&scope->elements, 2*count);
|
|
// string_map_reserve(&scope->elements, 2*count);
|
|
}
|
|
|
|
gb_internal void entity_graph_node_set_destroy(EntityGraphNodeSet *s) {
|
|
ptr_set_destroy(s);
|
|
}
|
|
|
|
gb_internal void entity_graph_node_set_add(EntityGraphNodeSet *s, EntityGraphNode *n) {
|
|
ptr_set_add(s, n);
|
|
}
|
|
|
|
// gb_internal bool entity_graph_node_set_exists(EntityGraphNodeSet *s, EntityGraphNode *n) {
|
|
// return ptr_set_exists(s, n);
|
|
// }
|
|
|
|
gb_internal void entity_graph_node_set_remove(EntityGraphNodeSet *s, EntityGraphNode *n) {
|
|
ptr_set_remove(s, n);
|
|
}
|
|
|
|
gb_internal void entity_graph_node_destroy(EntityGraphNode *n, gbAllocator a) {
|
|
entity_graph_node_set_destroy(&n->succ);
|
|
gb_free(a, n);
|
|
}
|
|
|
|
|
|
gb_internal int entity_source_order_cmp(Entity *x, Entity *y) {
|
|
if (x == y) {
|
|
return 0;
|
|
}
|
|
int cmp = 0;
|
|
if (x->pkg != y->pkg) {
|
|
isize order_x = x->pkg ? x->pkg->order : 0;
|
|
isize order_y = y->pkg ? y->pkg->order : 0;
|
|
cmp = isize_cmp(order_x, order_y);
|
|
if (cmp) {
|
|
return cmp;
|
|
}
|
|
}
|
|
if (x->file != y->file) {
|
|
if (x->file != nullptr && y->file != nullptr && x->file->pkg != nullptr && x->file->pkg == y->file->pkg) {
|
|
// NOTE(bill): the same order as by name, as a package's files are sorted by it
|
|
cmp = i32_cmp(x->file->index_in_pkg, y->file->index_in_pkg);
|
|
} else {
|
|
String fullpath_x = x->file ? x->file->fullpath : (String{});
|
|
String fullpath_y = y->file ? y->file->fullpath : (String{});
|
|
String file_x = filename_from_path(fullpath_x);
|
|
String file_y = filename_from_path(fullpath_y);
|
|
|
|
cmp = string_compare(file_x, file_y);
|
|
}
|
|
if (cmp) {
|
|
return cmp;
|
|
}
|
|
}
|
|
|
|
cmp = u64_cmp(x->order_in_src, y->order_in_src);
|
|
if (cmp) {
|
|
return cmp;
|
|
}
|
|
return i32_cmp(x->token.pos.offset, y->token.pos.offset);
|
|
}
|
|
|
|
gb_internal int entity_graph_node_cmp(EntityGraphNode **data, isize i, isize j) {
|
|
EntityGraphNode *x = data[i];
|
|
EntityGraphNode *y = data[j];
|
|
if (x->dep_count != y->dep_count) {
|
|
return x->dep_count < y->dep_count ? -1 : +1;
|
|
}
|
|
return entity_source_order_cmp(x->entity, y->entity);
|
|
}
|
|
|
|
gb_internal int entity_graph_node_source_order_cmp(EntityGraphNode **data, isize i, isize j) {
|
|
return entity_source_order_cmp(data[i]->entity, data[j]->entity);
|
|
}
|
|
|
|
gb_internal void entity_graph_node_swap(EntityGraphNode **data, isize i, isize j) {
|
|
EntityGraphNode *x = data[i];
|
|
EntityGraphNode *y = data[j];
|
|
data[i] = y;
|
|
data[j] = x;
|
|
x->index = j;
|
|
y->index = i;
|
|
}
|
|
|
|
|
|
|
|
gb_internal void import_graph_node_set_destroy(ImportGraphNodeSet *s) {
|
|
ptr_set_destroy(s);
|
|
}
|
|
|
|
gb_internal void import_graph_node_set_add(ImportGraphNodeSet *s, ImportGraphNode *n) {
|
|
ptr_set_add(s, n);
|
|
}
|
|
|
|
// gb_internal bool import_graph_node_set_exists(ImportGraphNodeSet *s, ImportGraphNode *n) {
|
|
// return ptr_set_exists(s, n);
|
|
// }
|
|
|
|
// gb_internal void import_graph_node_set_remove(ImportGraphNodeSet *s, ImportGraphNode *n) {
|
|
// ptr_set_remove(s, n);
|
|
// }
|
|
|
|
gb_internal ImportGraphNode *import_graph_node_create(gbAllocator a, AstPackage *pkg) {
|
|
ImportGraphNode *n = permanent_alloc_item<ImportGraphNode>();
|
|
n->pkg = pkg;
|
|
n->scope = pkg->scope;
|
|
return n;
|
|
}
|
|
|
|
gb_internal void import_graph_node_destroy(ImportGraphNode *n, gbAllocator a) {
|
|
import_graph_node_set_destroy(&n->pred);
|
|
import_graph_node_set_destroy(&n->succ);
|
|
gb_free(a, n);
|
|
}
|
|
|
|
|
|
gb_internal int import_graph_node_cmp(ImportGraphNode **data, isize i, isize j) {
|
|
ImportGraphNode *x = data[i];
|
|
ImportGraphNode *y = data[j];
|
|
GB_ASSERT(x != y);
|
|
|
|
GB_ASSERT(x->scope != y->scope);
|
|
|
|
bool xg = (x->scope->flags&ScopeFlag_Global) != 0;
|
|
bool yg = (y->scope->flags&ScopeFlag_Global) != 0;
|
|
if (xg != yg) return xg ? -1 : +1;
|
|
if (x->dep_count < y->dep_count) return -1;
|
|
if (x->dep_count > y->dep_count) return +1;
|
|
// NOTE: a total order, so the package order does not depend on parsing or hashing order
|
|
return string_compare(x->pkg->fullpath, y->pkg->fullpath);
|
|
}
|
|
|
|
gb_internal void import_graph_node_swap(ImportGraphNode **data, isize i, isize j) {
|
|
ImportGraphNode *x = data[i];
|
|
ImportGraphNode *y = data[j];
|
|
data[i] = y;
|
|
data[j] = x;
|
|
x->index = j;
|
|
y->index = i;
|
|
}
|
|
|
|
|
|
gb_internal void init_decl_info(DeclInfo *d, Scope *scope, DeclInfo *parent) {
|
|
if (parent) {
|
|
mutex_lock(&parent->next_mutex);
|
|
d->next_sibling = parent->next_child;
|
|
parent->next_child = d;
|
|
mutex_unlock(&parent->next_mutex);
|
|
}
|
|
d->parent = parent;
|
|
d->scope = scope;
|
|
ptr_set_init(&d->deps, 0);
|
|
type_set_init(&d->type_info_deps, 0);
|
|
d->labels.allocator = heap_allocator();
|
|
d->nested_to_check.allocator = heap_allocator();
|
|
d->variadic_reuses.allocator = heap_allocator();
|
|
d->variadic_reuse_max_bytes = 0;
|
|
d->variadic_reuse_max_align = 1;
|
|
}
|
|
|
|
gb_internal DeclInfo *make_decl_info(Scope *scope, DeclInfo *parent) {
|
|
DeclInfo *d = permanent_alloc_item<DeclInfo>();
|
|
init_decl_info(d, scope, parent);
|
|
return d;
|
|
}
|
|
|
|
// gb_internal void destroy_declaration_info(DeclInfo *d) {
|
|
// mutex_destroy(&d->proc_checked_mutex);
|
|
// ptr_set_destroy(&d->deps);
|
|
// array_free(&d->labels);
|
|
// }
|
|
|
|
// gb_internal bool decl_info_has_init(DeclInfo *d) {
|
|
// if (d->init_expr != nullptr) {
|
|
// return true;
|
|
// }
|
|
// if (d->proc_lit != nullptr) {
|
|
// switch (d->proc_lit->kind) {
|
|
// case_ast_node(pl, ProcLit, d->proc_lit);
|
|
// if (pl->body != nullptr) {
|
|
// return true;
|
|
// }
|
|
// case_end;
|
|
// }
|
|
// }
|
|
|
|
// return false;
|
|
// }
|
|
|
|
|
|
|
|
|
|
|
|
gb_internal Scope *create_scope(CheckerInfo *info, Scope *parent) {
|
|
Scope *s = permanent_alloc_item<Scope>();
|
|
scope_map_init(&s->elements);
|
|
s->parent = parent;
|
|
|
|
if (parent != nullptr && parent != builtin_pkg->scope) {
|
|
Scope *prev_head_child = parent->head_child.load(std::memory_order_acquire);
|
|
do {
|
|
s->next.store(prev_head_child, std::memory_order_relaxed);
|
|
} while (!parent->head_child.compare_exchange_weak(prev_head_child, s, std::memory_order_acq_rel, std::memory_order_acquire));
|
|
}
|
|
|
|
if (parent != nullptr && parent->flags & ScopeFlag_ContextDefined) {
|
|
s->flags |= ScopeFlag_ContextDefined;
|
|
}
|
|
|
|
return s;
|
|
}
|
|
|
|
gb_internal Scope *create_scope_from_file(CheckerInfo *info, AstFile *f) {
|
|
GB_ASSERT(f != nullptr);
|
|
GB_ASSERT(f->pkg != nullptr);
|
|
GB_ASSERT(f->pkg->scope != nullptr);
|
|
|
|
isize init_elements_capacity = gb_max(DEFAULT_SCOPE_CAPACITY, 2*f->total_file_decl_count);
|
|
Scope *s = create_scope(info, f->pkg->scope);
|
|
scope_reserve(s, init_elements_capacity);
|
|
|
|
s->flags |= ScopeFlag_File;
|
|
s->file = f;
|
|
f->scope = s;
|
|
|
|
bool global_context = f->feature_flags_set && (f->feature_flags & OptInFeatureFlag_GlobalContext) != 0;
|
|
if (global_context) {
|
|
s->flags |= ScopeFlag_ContextDefined;
|
|
} else {
|
|
s->flags &= ~ScopeFlag_ContextDefined;
|
|
}
|
|
|
|
return s;
|
|
}
|
|
|
|
gb_internal Scope *create_scope_from_package(CheckerContext *c, AstPackage *pkg) {
|
|
GB_ASSERT(pkg != nullptr);
|
|
|
|
isize total_pkg_decl_count = 0;
|
|
for (AstFile *file : pkg->files) {
|
|
total_pkg_decl_count += file->total_file_decl_count;
|
|
}
|
|
|
|
// isize init_elements_capacity = gb_max(DEFAULT_SCOPE_CAPACITY, 2*total_pkg_decl_count);
|
|
Scope *s = create_scope(c->info, builtin_pkg->scope);
|
|
scope_map_reserve(&s->elements, 2*total_pkg_decl_count);
|
|
// string_map_init(&s->elements, init_elements_capacity);
|
|
|
|
s->flags |= ScopeFlag_Pkg;
|
|
s->pkg = pkg;
|
|
pkg->scope = s;
|
|
|
|
if (pkg->fullpath == c->checker->parser->init_fullpath || pkg->kind == Package_Init) {
|
|
s->flags |= ScopeFlag_Init;
|
|
}
|
|
|
|
if (pkg->kind == Package_Runtime) {
|
|
s->flags |= ScopeFlag_Global;
|
|
}
|
|
|
|
if (s->flags & (ScopeFlag_Init|ScopeFlag_Global)) {
|
|
s->flags |= ScopeFlag_HasBeenImported;
|
|
}
|
|
s->flags |= ScopeFlag_ContextDefined;
|
|
|
|
return s;
|
|
}
|
|
|
|
gb_internal void destroy_scope(Scope *scope) {
|
|
for (Scope *child = scope->head_child; child != nullptr; child = child->next) {
|
|
destroy_scope(child);
|
|
}
|
|
|
|
// string_map_destroy(&scope->elements);
|
|
ptr_set_destroy(&scope->imported);
|
|
|
|
// NOTE(bill): No need to free scope as it "should" be allocated in an arena (except for the global scope)
|
|
}
|
|
|
|
|
|
gb_internal void add_scope(CheckerContext *c, Ast *node, Scope *scope) {
|
|
GB_ASSERT(node != nullptr);
|
|
GB_ASSERT(scope != nullptr);
|
|
scope->node = node;
|
|
switch (node->kind) {
|
|
case Ast_BlockStmt: node->BlockStmt.scope = scope; break;
|
|
case Ast_IfStmt: node->IfStmt.scope = scope; break;
|
|
case Ast_ForStmt: node->ForStmt.scope = scope; break;
|
|
case Ast_RangeStmt: node->RangeStmt.scope = scope; break;
|
|
case Ast_UnrollRangeStmt: node->UnrollRangeStmt.scope = scope; break;
|
|
case Ast_CaseClause: node->CaseClause.scope = scope; break;
|
|
case Ast_SwitchStmt: node->SwitchStmt.scope = scope; break;
|
|
case Ast_TypeSwitchStmt: node->TypeSwitchStmt.scope = scope; break;
|
|
case Ast_ProcType: node->ProcType.scope = scope; break;
|
|
case Ast_StructType: node->StructType.scope = scope; break;
|
|
case Ast_UnionType: node->UnionType.scope = scope; break;
|
|
case Ast_EnumType: node->EnumType.scope = scope; break;
|
|
case Ast_BitFieldType: node->BitFieldType.scope = scope; break;
|
|
default: GB_PANIC("Invalid node for add_scope: %.*s", LIT(ast_strings[node->kind]));
|
|
}
|
|
}
|
|
|
|
gb_internal Scope *scope_of_node(Ast *node) {
|
|
if (node == nullptr) {
|
|
return nullptr;
|
|
}
|
|
switch (node->kind) {
|
|
case Ast_BlockStmt: return node->BlockStmt.scope;
|
|
case Ast_IfStmt: return node->IfStmt.scope;
|
|
case Ast_ForStmt: return node->ForStmt.scope;
|
|
case Ast_RangeStmt: return node->RangeStmt.scope;
|
|
case Ast_UnrollRangeStmt: return node->UnrollRangeStmt.scope;
|
|
case Ast_CaseClause: return node->CaseClause.scope;
|
|
case Ast_SwitchStmt: return node->SwitchStmt.scope;
|
|
case Ast_TypeSwitchStmt: return node->TypeSwitchStmt.scope;
|
|
case Ast_ProcType: return node->ProcType.scope;
|
|
case Ast_StructType: return node->StructType.scope;
|
|
case Ast_UnionType: return node->UnionType.scope;
|
|
case Ast_EnumType: return node->EnumType.scope;
|
|
case Ast_BitFieldType: return node->BitFieldType.scope;
|
|
}
|
|
GB_PANIC("Invalid node for add_scope: %.*s", LIT(ast_strings[node->kind]));
|
|
return nullptr;
|
|
}
|
|
|
|
|
|
gb_internal void check_open_scope(CheckerContext *c, Ast *node) {
|
|
node = unparen_expr(node);
|
|
GB_ASSERT(node != nullptr);
|
|
GB_ASSERT(node->kind == Ast_Invalid ||
|
|
is_ast_stmt(node) ||
|
|
is_ast_type(node));
|
|
Scope *scope = create_scope(c->info, c->scope);
|
|
add_scope(c, node, scope);
|
|
switch (node->kind) {
|
|
case Ast_ProcType:
|
|
scope->flags |= ScopeFlag_Proc;
|
|
break;
|
|
case Ast_StructType:
|
|
case Ast_EnumType:
|
|
case Ast_UnionType:
|
|
case Ast_BitSetType:
|
|
case Ast_BitFieldType:
|
|
scope->flags |= ScopeFlag_Type;
|
|
break;
|
|
}
|
|
if (c->decl && c->decl->proc_lit) {
|
|
// NOTE(bill): numbered by position rather than in checking order, as that order varies
|
|
// (e.g. with which caller instantiates a record first); 0 is the procedure's own scope
|
|
scope->index = node->kind == Ast_ProcType ? 0 : 1 + ast_token(node).pos.offset;
|
|
}
|
|
c->scope = scope;
|
|
c->state_flags |= StateFlag_bounds_check;
|
|
}
|
|
|
|
gb_internal void check_close_scope(CheckerContext *c) {
|
|
c->scope = c->scope->parent;
|
|
}
|
|
|
|
|
|
gb_internal Entity *force_scope_placeholders(Scope *s, InternedString name, u32 hash);
|
|
|
|
struct GlobalWhenTrial;
|
|
gb_global GlobalWhenTrial *global_when_trial;
|
|
gb_internal Entity *global_when_trial_lookup(Scope *s, InternedString name, u32 hash, Entity *found);
|
|
|
|
gb_internal Entity *scope_lookup_current(Scope *s, InternedString name, u32 hash) {
|
|
// Entity **found = string_map_get(&s->elements, name);
|
|
if (hash == 0) {
|
|
hash = name.hash();
|
|
}
|
|
Entity *found = scope_map_get(&s->elements, name, hash);
|
|
if (global_when_trial != nullptr) {
|
|
found = global_when_trial_lookup(s, name, hash, found);
|
|
}
|
|
if (found) {
|
|
return found;
|
|
}
|
|
if (s->placeholders != nullptr) {
|
|
return force_scope_placeholders(s, name, hash);
|
|
}
|
|
return nullptr;
|
|
}
|
|
|
|
|
|
gb_internal void scope_lookup_parent(Scope *scope, InternedString name, Scope **scope_, Entity **entity_, u32 hash) {
|
|
if (scope != nullptr) {
|
|
bool gone_thru_proc = false;
|
|
bool gone_thru_package = false;
|
|
if (!hash) {
|
|
hash = name.hash();
|
|
}
|
|
for (Scope *s = scope; s != nullptr; s = s->parent) {
|
|
Entity *found = nullptr;
|
|
if (s->flags & ScopeFlag_ReadOnly) {
|
|
found = scope_map_get(&s->elements, name, hash);
|
|
} else {
|
|
rw_mutex_shared_lock(&s->mutex);
|
|
found = scope_map_get(&s->elements, name, hash);
|
|
rw_mutex_shared_unlock(&s->mutex);
|
|
}
|
|
if (global_when_trial != nullptr) {
|
|
found = global_when_trial_lookup(s, name, hash, found);
|
|
}
|
|
if (found == nullptr && s->placeholders != nullptr) {
|
|
found = force_scope_placeholders(s, name, hash);
|
|
}
|
|
if (found) {
|
|
Entity *e = found;
|
|
if (gone_thru_proc) {
|
|
if (e->kind == Entity_Label) {
|
|
continue;
|
|
}
|
|
if (e->kind == Entity_Variable) {
|
|
if (e->scope->flags&ScopeFlag_File) {
|
|
// Global variables are file to access
|
|
} else if (e->flags&EntityFlag_Static) {
|
|
// Allow static/thread_local variables to be referenced
|
|
} else {
|
|
continue;
|
|
}
|
|
}
|
|
}
|
|
|
|
if (entity_) *entity_ = e;
|
|
if (scope_) *scope_ = s;
|
|
return;
|
|
}
|
|
|
|
if (s->flags&ScopeFlag_Proc) {
|
|
gone_thru_proc = true;
|
|
}
|
|
if (s->flags&ScopeFlag_Pkg) {
|
|
gone_thru_package = true;
|
|
}
|
|
}
|
|
}
|
|
if (entity_) *entity_ = nullptr;
|
|
if (scope_) *scope_ = nullptr;
|
|
}
|
|
|
|
gb_internal Entity *scope_lookup(Scope *s, InternedString interned, u32 hash) {
|
|
Entity *entity = nullptr;
|
|
scope_lookup_parent(s, interned, nullptr, &entity, hash);
|
|
return entity;
|
|
}
|
|
|
|
gb_internal Entity *scope_insert_with_name_no_mutex(Scope *s, InternedString name, u32 hash, Entity *entity) {
|
|
if (name.value == 0) {
|
|
return nullptr;
|
|
}
|
|
GB_ASSERT_MSG((s->flags & ScopeFlag_ReadOnly) == 0, "%.*s", LIT(entity->token.string));
|
|
Entity *found = nullptr;
|
|
Entity *result = nullptr;
|
|
|
|
found = scope_map_get(&s->elements, name, hash);
|
|
|
|
if (found) {
|
|
if (entity != found) {
|
|
result = found;
|
|
}
|
|
goto end;
|
|
}
|
|
if (s->parent != nullptr && (s->parent->flags & ScopeFlag_Proc) != 0) {
|
|
found = scope_map_get(&s->parent->elements, name, hash);
|
|
if (found) {
|
|
if (found->flags & EntityFlag_Result) {
|
|
if (entity != found) {
|
|
result = found;
|
|
}
|
|
goto end;
|
|
}
|
|
}
|
|
}
|
|
|
|
scope_map_insert(&s->elements, name, hash, entity);
|
|
if (entity->scope == nullptr) {
|
|
entity->scope = s;
|
|
}
|
|
end:;
|
|
return result;
|
|
}
|
|
|
|
|
|
gb_internal Entity *scope_insert_with_name(Scope *s, InternedString name, u32 hash, Entity *entity) {
|
|
if (name.value == 0) {
|
|
return nullptr;
|
|
}
|
|
GB_ASSERT_MSG((s->flags & ScopeFlag_ReadOnly) == 0, "%.*s", LIT(entity->token.string));
|
|
Entity *found = nullptr;
|
|
Entity *result = nullptr;
|
|
|
|
rw_mutex_lock(&s->mutex);
|
|
|
|
found = scope_map_get(&s->elements, name, hash);
|
|
|
|
if (found) {
|
|
if (entity != found) {
|
|
result = found;
|
|
}
|
|
goto end;
|
|
}
|
|
if (s->parent != nullptr && (s->parent->flags & ScopeFlag_Proc) != 0) {
|
|
rw_mutex_shared_lock(&s->parent->mutex);
|
|
found = scope_map_get(&s->parent->elements, name, hash);
|
|
if (found) {
|
|
if (found->flags & EntityFlag_Result) {
|
|
if (entity != found) {
|
|
result = found;
|
|
}
|
|
rw_mutex_shared_unlock(&s->parent->mutex);
|
|
goto end;
|
|
}
|
|
}
|
|
rw_mutex_shared_unlock(&s->parent->mutex);
|
|
}
|
|
|
|
scope_map_insert(&s->elements, name, hash, entity);
|
|
if (entity->scope == nullptr) {
|
|
entity->scope = s;
|
|
}
|
|
end:;
|
|
rw_mutex_unlock(&s->mutex);
|
|
|
|
return result;
|
|
}
|
|
|
|
gb_internal Entity *scope_insert(Scope *s, Entity *entity) {
|
|
auto name = entity_interned_name(entity);
|
|
u32 hash = entity->interned_name_hash.load(std::memory_order_relaxed);
|
|
GB_ASSERT(hash != 0);
|
|
return scope_insert_with_name(s, name, hash, entity);
|
|
}
|
|
|
|
gb_internal Entity *scope_insert_no_mutex(Scope *s, Entity *entity) {
|
|
auto name = string_interner_insert(entity->token.string);
|
|
u32 hash = entity->interned_name_hash.load(std::memory_order_relaxed);
|
|
GB_ASSERT(hash != 0);
|
|
return scope_insert_with_name_no_mutex(s, name, hash, entity);
|
|
}
|
|
|
|
|
|
gb_internal GB_COMPARE_PROC(entity_variable_pos_cmp) {
|
|
Entity *x = *cast(Entity **)a;
|
|
Entity *y = *cast(Entity **)b;
|
|
|
|
return token_pos_cmp(x->token.pos, y->token.pos);
|
|
}
|
|
|
|
|
|
|
|
gb_internal u64 check_vet_flags(CheckerContext *c) {
|
|
AstFile *file = c->file;
|
|
if (file == nullptr &&
|
|
c->curr_proc_decl &&
|
|
c->curr_proc_decl->proc_lit) {
|
|
file = c->curr_proc_decl->proc_lit->file();
|
|
}
|
|
|
|
return ast_file_vet_flags(file);
|
|
}
|
|
|
|
gb_internal u64 check_vet_flags(Ast *node) {
|
|
AstFile *file = node->file();
|
|
return ast_file_vet_flags(file);
|
|
}
|
|
|
|
gb_internal u64 check_feature_flags(CheckerContext *c, Ast *node) {
|
|
AstFile *file = c->file;
|
|
if (file == nullptr &&
|
|
c->curr_proc_decl &&
|
|
c->curr_proc_decl->proc_lit) {
|
|
file = c->curr_proc_decl->proc_lit->file();
|
|
}
|
|
if (file == nullptr) {
|
|
file = node->file();
|
|
}
|
|
if (file != nullptr && file->feature_flags_set) {
|
|
return file->feature_flags;
|
|
}
|
|
return 0;
|
|
}
|
|
|
|
gb_internal u64 check_feature_flags(Entity *e) {
|
|
if (e == nullptr) {
|
|
return 0;
|
|
}
|
|
AstFile *file = nullptr;
|
|
if (e->file == nullptr) {
|
|
file = e->file;
|
|
}
|
|
if (file == nullptr) {
|
|
if (e->decl_info && e->decl_info->decl_node) {
|
|
file = e->decl_info->decl_node->file();
|
|
}
|
|
}
|
|
if (file != nullptr && file->feature_flags_set) {
|
|
return file->feature_flags;
|
|
}
|
|
return 0;
|
|
}
|
|
|
|
|
|
|
|
enum VettedEntityKind {
|
|
VettedEntity_Invalid,
|
|
|
|
VettedEntity_Unused,
|
|
VettedEntity_Shadowed,
|
|
VettedEntity_Shadowed_And_Unused,
|
|
};
|
|
struct VettedEntity {
|
|
VettedEntityKind kind;
|
|
Entity *entity;
|
|
Entity *other;
|
|
};
|
|
|
|
|
|
gb_internal GB_COMPARE_PROC(vetted_entity_variable_pos_cmp) {
|
|
Entity *x = (cast(VettedEntity *)a)->entity;
|
|
Entity *y = (cast(VettedEntity *)b)->entity;
|
|
GB_ASSERT(x != nullptr);
|
|
GB_ASSERT(y != nullptr);
|
|
|
|
return token_pos_cmp(x->token.pos, y->token.pos);
|
|
}
|
|
|
|
gb_internal bool check_vet_shadowing_assignment(Checker *c, Entity *shadowed, Ast *expr) {
|
|
Ast *init = unparen_expr(expr);
|
|
if (init == nullptr) {
|
|
return false;
|
|
}
|
|
if (init->kind == Ast_Ident) {
|
|
// TODO(bill): Which logic is better? Same name or same entity
|
|
// bool ignore = init->Ident.token.string == name;
|
|
bool ignore = init->Ident.entity == shadowed;
|
|
if (ignore) {
|
|
return true;
|
|
}
|
|
} else if (init->kind == Ast_TernaryIfExpr) {
|
|
bool x = check_vet_shadowing_assignment(c, shadowed, init->TernaryIfExpr.x);
|
|
bool y = check_vet_shadowing_assignment(c, shadowed, init->TernaryIfExpr.y);
|
|
if (x || y) {
|
|
return true;
|
|
}
|
|
}
|
|
|
|
return false;
|
|
}
|
|
|
|
|
|
gb_internal bool check_vet_shadowing(Checker *c, Entity *e, VettedEntity *ve) {
|
|
if (e->kind != Entity_Variable) {
|
|
return false;
|
|
}
|
|
String name = e->token.string;
|
|
if (name == "_") {
|
|
return false;
|
|
}
|
|
if (e->flags & EntityFlag_Param) {
|
|
return false;
|
|
}
|
|
|
|
if (e->scope->flags & (ScopeFlag_Global|ScopeFlag_File|ScopeFlag_Proc)) {
|
|
return false;
|
|
}
|
|
|
|
Scope *parent = e->scope->parent;
|
|
if (parent->flags & (ScopeFlag_Global|ScopeFlag_File)) {
|
|
return false;
|
|
}
|
|
|
|
auto interned = entity_interned_name(e);
|
|
Entity *shadowed = scope_lookup(parent, interned, e->interned_name_hash.load());
|
|
if (shadowed == nullptr) {
|
|
return false;
|
|
}
|
|
if (shadowed->kind != Entity_Variable) {
|
|
return false;
|
|
}
|
|
|
|
if (shadowed->scope->flags & (ScopeFlag_Global|ScopeFlag_File)) {
|
|
// return false;
|
|
}
|
|
|
|
// NOTE(bill): The entities must be in the same file
|
|
if (e->token.pos.file_id != shadowed->token.pos.file_id) {
|
|
return false;
|
|
}
|
|
// NOTE(bill): The shaded identifier must appear before this one to be an
|
|
// instance of shadowing
|
|
if (token_pos_cmp(shadowed->token.pos, e->token.pos) > 0) {
|
|
return false;
|
|
}
|
|
// NOTE(bill): If the types differ, don't complain
|
|
if (!are_types_identical(e->type, shadowed->type)) {
|
|
return false;
|
|
}
|
|
|
|
// NOTE(bill): Ignore intentional redeclaration
|
|
// x := x
|
|
// Suggested in issue #637 (2020-05-11)
|
|
// Also allow the following
|
|
// x := x if cond else y
|
|
// x := z if cond else x
|
|
if ((e->flags & EntityFlag_Using) == 0 && e->kind == Entity_Variable) {
|
|
if (check_vet_shadowing_assignment(c, shadowed, e->Variable.init_expr)) {
|
|
return false;
|
|
}
|
|
}
|
|
|
|
gb_zero_item(ve);
|
|
ve->kind = VettedEntity_Shadowed;
|
|
ve->entity = e;
|
|
ve->other = shadowed;
|
|
return true;
|
|
}
|
|
|
|
gb_internal bool check_vet_unused(Checker *c, Entity *e, VettedEntity *ve) {
|
|
if ((e->flags&EntityFlag_Used) == 0) {
|
|
switch (e->kind) {
|
|
case Entity_Variable:
|
|
if (e->scope->flags & (ScopeFlag_Global|ScopeFlag_Type|ScopeFlag_File)) {
|
|
return false;
|
|
} else if (e->flags & EntityFlag_Static) {
|
|
// ignore these for the time being
|
|
return false;
|
|
}
|
|
case Entity_ImportName:
|
|
case Entity_LibraryName:
|
|
gb_zero_item(ve);
|
|
ve->kind = VettedEntity_Unused;
|
|
ve->entity = e;
|
|
return true;
|
|
}
|
|
}
|
|
return false;
|
|
}
|
|
|
|
gb_internal void check_scope_usage_internal(Checker *c, Scope *scope, u64 vet_flags, bool per_entity) {
|
|
u64 original_vet_flags = vet_flags;
|
|
|
|
TEMPORARY_ALLOCATOR_GUARD();
|
|
Array<VettedEntity> vetted_entities = {};
|
|
array_init(&vetted_entities, temporary_allocator());
|
|
|
|
rw_mutex_shared_lock(&scope->mutex);
|
|
for (auto const &entry : scope->elements) {
|
|
Entity *e = entry.value;
|
|
if (e == nullptr) continue;
|
|
|
|
vet_flags = original_vet_flags;
|
|
if (per_entity) {
|
|
vet_flags = ast_file_vet_flags(e->file);
|
|
}
|
|
|
|
bool vet_unused = (vet_flags & VetFlag_Unused) != 0;
|
|
bool vet_shadowing = (vet_flags & (VetFlag_Shadowing|VetFlag_Using)) != 0;
|
|
bool vet_unused_procedures = (vet_flags & VetFlag_UnusedProcedures) != 0;
|
|
if (vet_unused_procedures && e->pkg && e->pkg->kind == Package_Runtime) {
|
|
vet_unused_procedures = false;
|
|
}
|
|
|
|
VettedEntity ve_unused = {};
|
|
VettedEntity ve_shadowed = {};
|
|
bool is_unused = false;
|
|
if (vet_unused && check_vet_unused(c, e, &ve_unused)) {
|
|
is_unused = true;
|
|
} else if (vet_unused_procedures && e->kind == Entity_Procedure) {
|
|
if (e->flags&EntityFlag_Used) {
|
|
is_unused = false;
|
|
} else if (e->flags & EntityFlag_Require) {
|
|
is_unused = false;
|
|
} else if (e->flags & EntityFlag_Init) {
|
|
is_unused = false;
|
|
} else if (e->flags & EntityFlag_Fini) {
|
|
is_unused = false;
|
|
} else if (e->Procedure.is_export) {
|
|
is_unused = false;
|
|
} else if (e->pkg && e->pkg->kind == Package_Init && e->token.string == "main") {
|
|
is_unused = false;
|
|
} else {
|
|
is_unused = true;
|
|
ve_unused.kind = VettedEntity_Unused;
|
|
ve_unused.entity = e;
|
|
}
|
|
}
|
|
bool is_shadowed = vet_shadowing && check_vet_shadowing(c, e, &ve_shadowed);
|
|
if (is_unused && is_shadowed) {
|
|
VettedEntity ve_both = ve_shadowed;
|
|
ve_both.kind = VettedEntity_Shadowed_And_Unused;
|
|
array_add(&vetted_entities, ve_both);
|
|
} else if (is_unused) {
|
|
array_add(&vetted_entities, ve_unused);
|
|
} else if (is_shadowed) {
|
|
array_add(&vetted_entities, ve_shadowed);
|
|
} else if (e->kind == Entity_Variable &&
|
|
((e->flags & (EntityFlag_Param|EntityFlag_Using|EntityFlag_Static|EntityFlag_Field)) == 0 ||
|
|
(e->flags & EntityFlag_Result) != 0) &&
|
|
!e->Variable.is_global) {
|
|
i64 sz = type_size_of(e->type);
|
|
// TODO(bill): When is a good size warn?
|
|
// Is >256 KiB good enough?
|
|
if (sz > 1ll<<18) {
|
|
bool is_ref = false;
|
|
if ((e->flags & EntityFlag_ForValue) != 0) {
|
|
is_ref = type_deref(e->Variable.for_loop_parent_type) != NULL;
|
|
} else if ((e->flags & EntityFlag_SwitchValue) != 0) {
|
|
is_ref = !(e->flags & EntityFlag_Value);
|
|
}
|
|
if(!is_ref) {
|
|
gbString type_str = type_to_string(e->type);
|
|
warning(e->token, "Declaration of '%.*s' may cause a stack overflow due to its type '%s' having a size of %lld bytes", LIT(e->token.string), type_str, cast(long long)sz);
|
|
gb_string_free(type_str);
|
|
}
|
|
}
|
|
}
|
|
}
|
|
rw_mutex_shared_unlock(&scope->mutex);
|
|
|
|
array_sort(vetted_entities, vetted_entity_variable_pos_cmp);
|
|
|
|
for (auto const &ve : vetted_entities) {
|
|
Entity *e = ve.entity;
|
|
Entity *other = ve.other;
|
|
String name = e->token.string;
|
|
|
|
vet_flags = original_vet_flags;
|
|
if (per_entity) {
|
|
vet_flags = ast_file_vet_flags(e->file);
|
|
}
|
|
|
|
if (ve.kind == VettedEntity_Shadowed_And_Unused) {
|
|
error(e->token, "'%.*s' declared but not used, possibly shadows declaration at line %d", LIT(name), other->token.pos.line);
|
|
} else if (vet_flags) {
|
|
switch (ve.kind) {
|
|
case VettedEntity_Unused:
|
|
if (e->kind == Entity_Variable && (vet_flags & VetFlag_UnusedVariables) != 0) {
|
|
error(e->token, "'%.*s' declared but not used", LIT(name));
|
|
}
|
|
if (e->kind == Entity_Procedure && (vet_flags & VetFlag_UnusedProcedures) != 0) {
|
|
error(e->token, "'%.*s' declared but not used", LIT(name));
|
|
}
|
|
if ((e->kind == Entity_ImportName || e->kind == Entity_LibraryName) && (vet_flags & VetFlag_UnusedImports) != 0) {
|
|
error(e->token, "'%.*s' declared but not used", LIT(name));
|
|
}
|
|
break;
|
|
case VettedEntity_Shadowed:
|
|
if ((vet_flags & (VetFlag_Shadowing|VetFlag_Using)) != 0 && e->flags&EntityFlag_Using) {
|
|
error(e->token, "Declaration of '%.*s' from 'using' shadows declaration at line %d", LIT(name), other->token.pos.line);
|
|
} else if ((vet_flags & (VetFlag_Shadowing)) != 0) {
|
|
error(e->token, "Declaration of '%.*s' shadows declaration at line %d", LIT(name), other->token.pos.line);
|
|
}
|
|
break;
|
|
default:
|
|
break;
|
|
}
|
|
}
|
|
}
|
|
|
|
}
|
|
|
|
|
|
gb_internal void check_scope_usage(Checker *c, Scope *scope, u64 vet_flags) {
|
|
check_scope_usage_internal(c, scope, vet_flags, false);
|
|
|
|
for (Scope *child = scope->head_child; child != nullptr; child = child->next) {
|
|
if (child->flags & (ScopeFlag_Proc|ScopeFlag_Type|ScopeFlag_File)) {
|
|
// Ignore these
|
|
} else {
|
|
check_scope_usage(c, child, vet_flags);
|
|
}
|
|
}
|
|
}
|
|
|
|
|
|
gb_internal void add_dependency(CheckerInfo *info, DeclInfo *d, Entity *e) {
|
|
rw_mutex_lock(&d->deps_mutex);
|
|
ptr_set_add(&d->deps, e);
|
|
rw_mutex_unlock(&d->deps_mutex);
|
|
}
|
|
gb_internal void add_type_info_dependency(CheckerInfo *info, DeclInfo *d, Type *type) {
|
|
if (d == nullptr || type == nullptr) {
|
|
return;
|
|
}
|
|
if (type->kind == Type_Named) {
|
|
Entity *e = type->Named.type_name;
|
|
if (e->TypeName.is_type_alias) {
|
|
type = type->Named.base;
|
|
}
|
|
}
|
|
rw_mutex_lock(&d->type_info_deps_mutex);
|
|
type_set_add(&d->type_info_deps, type);
|
|
rw_mutex_unlock(&d->type_info_deps_mutex);
|
|
}
|
|
|
|
|
|
gb_internal AstPackage *get_runtime_package(CheckerInfo *info) {
|
|
String name = str_lit("runtime");
|
|
gbAllocator a = heap_allocator();
|
|
String path = get_fullpath_base_collection(a, name, nullptr);
|
|
defer (gb_free(a, path.text));
|
|
auto found = string_map_get(&info->packages, path);
|
|
if (found == nullptr) {
|
|
gb_printf_err("Name: %.*s\n", LIT(name));
|
|
gb_printf_err("Fullpath: %.*s\n", LIT(path));
|
|
|
|
for (auto const &entry : info->packages) {
|
|
gb_printf_err("%.*s\n", LIT(entry.key));
|
|
}
|
|
GB_ASSERT_MSG(found != nullptr, "Missing core package %.*s", LIT(name));
|
|
}
|
|
return *found;
|
|
}
|
|
|
|
gb_internal AstPackage *get_core_package(CheckerInfo *info, String name) {
|
|
if (name == "runtime") {
|
|
return get_runtime_package(info);
|
|
}
|
|
|
|
gbAllocator a = heap_allocator();
|
|
String path = get_fullpath_core_collection(a, name, nullptr);
|
|
defer (gb_free(a, path.text));
|
|
auto found = string_map_get(&info->packages, path);
|
|
if (found == nullptr) {
|
|
gb_printf_err("Name: %.*s\n", LIT(name));
|
|
gb_printf_err("Fullpath: %.*s\n", LIT(path));
|
|
|
|
for (auto const &entry : info->packages) {
|
|
gb_printf_err("%.*s\n", LIT(entry.key));
|
|
}
|
|
GB_ASSERT_MSG(found != nullptr, "Missing core package %.*s", LIT(name));
|
|
}
|
|
return *found;
|
|
}
|
|
|
|
|
|
gb_internal AstPackage *try_get_core_package(CheckerInfo *info, String name) {
|
|
if (name == "runtime") {
|
|
return get_runtime_package(info);
|
|
}
|
|
|
|
gbAllocator a = heap_allocator();
|
|
String path = get_fullpath_core_collection(a, name, nullptr);
|
|
defer (gb_free(a, path.text));
|
|
auto found = string_map_get(&info->packages, path);
|
|
if (found == nullptr) {
|
|
return nullptr;
|
|
}
|
|
return *found;
|
|
}
|
|
|
|
gb_internal void add_package_dependency(CheckerContext *c, char const *package_name, char const *name, bool required=false) {
|
|
String n = make_string_c(name);
|
|
u32 hash = 0;
|
|
InternedString key = string_interner_insert(n, 0, &hash);
|
|
AstPackage *p = get_core_package(&c->checker->info, make_string_c(package_name));
|
|
Entity *e = scope_lookup(p->scope, key, hash);
|
|
GB_ASSERT_MSG(e != nullptr, "%s", name);
|
|
GB_ASSERT(c->decl != nullptr);
|
|
e->flags |= EntityFlag_Used;
|
|
if (required) {
|
|
e->flags |= EntityFlag_Require;
|
|
}
|
|
add_dependency(c->info, c->decl, e);
|
|
}
|
|
|
|
gb_internal void try_to_add_package_dependency(CheckerContext *c, char const *package_name, char const *name) {
|
|
String n = make_string_c(name);
|
|
u32 hash = 0;
|
|
InternedString key = string_interner_insert(n, 0, &hash);
|
|
AstPackage *p = get_core_package(&c->checker->info, make_string_c(package_name));
|
|
Entity *e = scope_lookup(p->scope, key, hash);
|
|
if (e == nullptr) {
|
|
return;
|
|
}
|
|
GB_ASSERT(c->decl != nullptr);
|
|
e->flags |= EntityFlag_Used;
|
|
add_dependency(c->info, c->decl, e);
|
|
}
|
|
|
|
gb_internal char const *runtime_default_hasher_fixed_name(CheckerInfo *info) {
|
|
Entity *e = scope_lookup_current(info->runtime_package->scope, string_interner_insert(str_lit("default_hasher_fixed")));
|
|
return e != nullptr ? "default_hasher_fixed" : "default_hasher";
|
|
}
|
|
|
|
gb_internal void add_declaration_dependency(CheckerContext *c, Entity *e) {
|
|
if (e == nullptr) {
|
|
return;
|
|
}
|
|
if (e->flags & EntityFlag_Disabled) {
|
|
// ignore the dependencies if it has been `@(disabled=true)`
|
|
return;
|
|
}
|
|
if (e->decl_info == nullptr && e->scope != nullptr && (e->scope->flags & (ScopeFlag_File|ScopeFlag_Pkg|ScopeFlag_Global)) == 0) {
|
|
// NOTE(bill): local variables, constants, or labels (most of what are used) has no declaration and thus depends on nothing
|
|
switch (e->kind) {
|
|
case Entity_Variable:
|
|
if (e->flags & EntityFlag_Static) {
|
|
break;
|
|
}
|
|
if (e->Variable.is_global || e->Variable.thread_local_model.len != 0) {
|
|
break;
|
|
}
|
|
|
|
if (!e->Variable.is_foreign) { // as its library is needed
|
|
return;
|
|
}
|
|
break;
|
|
case Entity_Constant:
|
|
case Entity_Label:
|
|
return;
|
|
}
|
|
}
|
|
if (c->decl != nullptr) {
|
|
add_dependency(c->info, c->decl, e);
|
|
}
|
|
}
|
|
|
|
|
|
gb_internal Entity *add_global_entity(Entity *entity, Scope *scope=builtin_pkg->scope) {
|
|
String name = entity->token.string;
|
|
defer (entity->state = EntityState_Resolved);
|
|
|
|
if (gb_memchr(name.text, ' ', name.len)) {
|
|
return entity; // NOTE(bill): Usually an 'untyped thing'
|
|
}
|
|
if (scope_insert(scope, entity)) {
|
|
compiler_error("double declaration");
|
|
}
|
|
return entity;
|
|
}
|
|
|
|
gb_internal void add_global_constant(char const *name, Type *type, ExactValue value) {
|
|
Entity *entity = alloc_entity(Entity_Constant, nullptr, make_token_ident(name), type);
|
|
entity->Constant.value = value;
|
|
add_global_entity(entity);
|
|
}
|
|
|
|
|
|
gb_internal void add_global_string_constant(char const *name, String const &value) {
|
|
add_global_constant(name, t_untyped_string, exact_value_string(value));
|
|
}
|
|
|
|
gb_internal void add_global_bool_constant(char const *name, bool value) {
|
|
add_global_constant(name, t_untyped_bool, exact_value_bool(value));
|
|
}
|
|
|
|
gb_internal void add_global_type_entity(String name, Type *type) {
|
|
add_global_entity(alloc_entity_type_name(nullptr, make_token_ident(name), type));
|
|
}
|
|
|
|
|
|
gb_internal AstPackage *create_builtin_package(char const *name) {
|
|
gbAllocator a = permanent_allocator();
|
|
AstPackage *pkg = permanent_alloc_item<AstPackage>();
|
|
pkg->name = make_string_c(name);
|
|
pkg->kind = Package_Builtin;
|
|
|
|
pkg->scope = create_scope(nullptr, nullptr);
|
|
pkg->scope->flags |= ScopeFlag_Pkg | ScopeFlag_Global | ScopeFlag_Builtin;
|
|
pkg->scope->pkg = pkg;
|
|
return pkg;
|
|
}
|
|
|
|
struct GlobalEnumValue {
|
|
char const *name;
|
|
i64 value;
|
|
};
|
|
|
|
gb_internal Slice<Entity *> add_global_enum_type(String const &type_name, GlobalEnumValue *values, isize value_count, Type **enum_type_ = nullptr, Type *backing_type = nullptr) {
|
|
Scope *scope = create_scope(nullptr, builtin_pkg->scope);
|
|
Entity *entity = alloc_entity_type_name(scope, make_token_ident(type_name), nullptr, EntityState_Resolved);
|
|
|
|
Type *enum_type = alloc_type_enum();
|
|
Type *named_type = alloc_type_named(type_name, enum_type, entity);
|
|
set_base_type(named_type, enum_type);
|
|
enum_type->Enum.base_type = backing_type ? backing_type : t_int;
|
|
enum_type->Enum.scope = scope;
|
|
entity->type = named_type;
|
|
|
|
auto fields = array_make<Entity *>(permanent_allocator(), value_count);
|
|
for (isize i = 0; i < value_count; i++) {
|
|
i64 value = values[i].value;
|
|
Entity *e = alloc_entity_constant(scope, make_token_ident(values[i].name), named_type, exact_value_i64(value));
|
|
e->flags |= EntityFlag_Visited;
|
|
e->state = EntityState_Resolved;
|
|
fields[i] = e;
|
|
|
|
Entity *ie = scope_insert(scope, e);
|
|
GB_ASSERT(ie == nullptr);
|
|
}
|
|
|
|
|
|
enum_type->Enum.fields = fields;
|
|
enum_type->Enum.min_value_index = 0;
|
|
enum_type->Enum.max_value_index = value_count-1;
|
|
enum_type->Enum.min_value = &enum_type->Enum.fields[enum_type->Enum.min_value_index]->Constant.value;
|
|
enum_type->Enum.max_value = &enum_type->Enum.fields[enum_type->Enum.max_value_index]->Constant.value;
|
|
|
|
|
|
if (enum_type_) *enum_type_ = named_type;
|
|
|
|
return slice_from_array(fields);
|
|
}
|
|
gb_internal void add_global_enum_constant(Slice<Entity *> const &fields, char const *name, i64 value) {
|
|
for (Entity *field : fields) {
|
|
GB_ASSERT(field->kind == Entity_Constant);
|
|
if (value == exact_value_to_i64(field->Constant.value)) {
|
|
add_global_constant(name, field->type, field->Constant.value);
|
|
return;
|
|
}
|
|
}
|
|
GB_PANIC("Unfound enum value for global constant: %s %lld", name, cast(long long)value);
|
|
}
|
|
|
|
gb_internal Type *add_global_type_name(Scope *scope, String const &type_name, Type *backing_type) {
|
|
Entity *e = alloc_entity_type_name(scope, make_token_ident(type_name), nullptr, EntityState_Resolved);
|
|
Type *named_type = alloc_type_named(type_name, backing_type, e);
|
|
e->type = named_type;
|
|
set_base_type(named_type, backing_type);
|
|
if (scope_insert(scope, e)) {
|
|
compiler_error("double declaration of %.*s", LIT(e->token.string));
|
|
}
|
|
return named_type;
|
|
}
|
|
|
|
gb_internal i64 odin_compile_timestamp(void) {
|
|
i64 us_after_1601 = cast(i64)gb_utc_time_now();
|
|
i64 us_after_1970 = us_after_1601 - 11644473600000000ll;
|
|
i64 ns_after_1970 = us_after_1970*1000ll;
|
|
return ns_after_1970;
|
|
}
|
|
|
|
|
|
gb_internal void init_universal(void) {
|
|
BuildContext *bc = &build_context;
|
|
|
|
builtin_pkg = create_builtin_package("builtin");
|
|
intrinsics_pkg = create_builtin_package("intrinsics");
|
|
config_pkg = create_builtin_package("config");
|
|
|
|
// Types
|
|
for (isize i = 0; i < gb_count_of(basic_types); i++) {
|
|
String const &name = basic_types[i].Basic.name;
|
|
if (build_context.bedrock) {
|
|
if ((basic_types[i].Basic.flags & BasicFlag_Integer) != 0 &&
|
|
basic_types[i].Basic.size == 16) {
|
|
// disallow 128-bit integers
|
|
continue;
|
|
}
|
|
}
|
|
|
|
add_global_type_entity(name, &basic_types[i]);
|
|
}
|
|
add_global_type_entity(str_lit("byte"), &basic_types[Basic_u8]);
|
|
|
|
{
|
|
Type *equal_args[2] = {t_rawptr, t_rawptr};
|
|
t_equal_proc = alloc_type_proc_from_types(equal_args, gb_count_of(equal_args), t_bool, false, ProcCC_Contextless);
|
|
|
|
Type *hasher_args[2] = {t_rawptr, t_uintptr};
|
|
t_hasher_proc = alloc_type_proc_from_types(hasher_args, gb_count_of(hasher_args), t_uintptr, false, ProcCC_Contextless);
|
|
|
|
Type *map_get_args[3] = {/*map*/t_rawptr, /*hash*/t_uintptr, /*key*/t_rawptr};
|
|
t_map_get_proc = alloc_type_proc_from_types(map_get_args, gb_count_of(map_get_args), t_rawptr, false, ProcCC_Contextless);
|
|
}
|
|
|
|
// Constants
|
|
add_global_entity(alloc_entity_nil(str_lit("nil"), t_untyped_nil));
|
|
|
|
add_global_bool_constant("true", true);
|
|
add_global_bool_constant("false", false);
|
|
|
|
add_global_string_constant("ODIN_VENDOR", bc->ODIN_VENDOR);
|
|
add_global_string_constant("ODIN_VERSION", bc->ODIN_VERSION);
|
|
add_global_string_constant("ODIN_ROOT", bc->ODIN_ROOT);
|
|
add_global_string_constant("ODIN_BUILD_PROJECT_NAME", bc->ODIN_BUILD_PROJECT_NAME);
|
|
|
|
add_global_bool_constant("ODIN_BEDROCK", bc->bedrock);
|
|
|
|
{
|
|
GlobalEnumValue values[Windows_Subsystem_COUNT] = {
|
|
{"Unknown", Windows_Subsystem_UNKNOWN},
|
|
{"Boot_Application", Windows_Subsystem_BOOT_APPLICATION},
|
|
{"Console", Windows_Subsystem_CONSOLE},
|
|
{"EFI_Application", Windows_Subsystem_EFI_APPLICATION},
|
|
{"EFI_Boot_Service_Driver", Windows_Subsystem_EFI_BOOT_SERVICE_DRIVER},
|
|
{"EFI_Rom", Windows_Subsystem_EFI_ROM},
|
|
{"EFI_Runtime_Driver", Windows_Subsystem_EFI_RUNTIME_DRIVER},
|
|
{"Native", Windows_Subsystem_NATIVE},
|
|
{"Posix", Windows_Subsystem_POSIX},
|
|
{"Windows", Windows_Subsystem_WINDOWS},
|
|
{"Windows_CE", Windows_Subsystem_WINDOWSCE},
|
|
};
|
|
|
|
auto fields = add_global_enum_type(str_lit("Odin_Windows_Subsystem_Type"), values, gb_count_of(values));
|
|
add_global_enum_constant(fields, "ODIN_WINDOWS_SUBSYSTEM", bc->ODIN_WINDOWS_SUBSYSTEM);
|
|
add_global_string_constant("ODIN_WINDOWS_SUBSYSTEM_STRING", windows_subsystem_names[bc->ODIN_WINDOWS_SUBSYSTEM]);
|
|
}
|
|
|
|
{
|
|
GlobalEnumValue values[TargetOs_COUNT] = {
|
|
{"Unknown", TargetOs_Invalid},
|
|
{"Windows", TargetOs_windows},
|
|
{"Darwin", TargetOs_darwin},
|
|
{"Linux", TargetOs_linux},
|
|
{"FreeBSD", TargetOs_freebsd},
|
|
{"OpenBSD", TargetOs_openbsd},
|
|
{"NetBSD", TargetOs_netbsd},
|
|
{"WASI", TargetOs_wasi},
|
|
{"JS", TargetOs_js},
|
|
{"Orca", TargetOs_orca},
|
|
{"Freestanding", TargetOs_freestanding},
|
|
};
|
|
|
|
auto fields = add_global_enum_type(str_lit("Odin_OS_Type"), values, gb_count_of(values));
|
|
add_global_enum_constant(fields, "ODIN_OS", bc->metrics.os);
|
|
add_global_string_constant("ODIN_OS_STRING", target_os_names[bc->metrics.os]);
|
|
}
|
|
|
|
{
|
|
GlobalEnumValue values[TargetArch_COUNT] = {
|
|
{"Unknown", TargetArch_Invalid},
|
|
{"amd64", TargetArch_amd64},
|
|
{"i386", TargetArch_i386},
|
|
{"arm32", TargetArch_arm32},
|
|
{"arm64", TargetArch_arm64},
|
|
{"wasm32", TargetArch_wasm32},
|
|
{"wasm64p32", TargetArch_wasm64p32},
|
|
{"riscv64", TargetArch_riscv64},
|
|
};
|
|
|
|
auto fields = add_global_enum_type(str_lit("Odin_Arch_Type"), values, gb_count_of(values));
|
|
add_global_enum_constant(fields, "ODIN_ARCH", bc->metrics.arch);
|
|
add_global_string_constant("ODIN_ARCH_STRING", target_arch_names[bc->metrics.arch]);
|
|
}
|
|
|
|
add_global_string_constant("ODIN_MICROARCH_STRING", get_final_microarchitecture());
|
|
|
|
{
|
|
GlobalEnumValue values[BuildMode_COUNT] = {
|
|
{"Executable", BuildMode_Executable},
|
|
{"Dynamic", BuildMode_DynamicLibrary},
|
|
{"Static", BuildMode_StaticLibrary},
|
|
{"Object", BuildMode_Object},
|
|
{"Assembly", BuildMode_Assembly},
|
|
{"LLVM_IR", BuildMode_LLVM_IR},
|
|
};
|
|
|
|
auto fields = add_global_enum_type(str_lit("Odin_Build_Mode_Type"), values, gb_count_of(values));
|
|
add_global_enum_constant(fields, "ODIN_BUILD_MODE", bc->build_mode);
|
|
}
|
|
|
|
{
|
|
GlobalEnumValue values[TargetEndian_COUNT] = {
|
|
{"Little", TargetEndian_Little},
|
|
{"Big", TargetEndian_Big},
|
|
};
|
|
|
|
auto fields = add_global_enum_type(str_lit("Odin_Endian_Type"), values, gb_count_of(values));
|
|
add_global_enum_constant(fields, "ODIN_ENDIAN", target_endians[bc->metrics.arch]);
|
|
add_global_string_constant("ODIN_ENDIAN_STRING", target_endian_names[target_endians[bc->metrics.arch]]);
|
|
}
|
|
|
|
{
|
|
GlobalEnumValue values[Subtarget_COUNT] = {
|
|
{"Default", Subtarget_Default},
|
|
{"iPhone", Subtarget_iPhone},
|
|
{"iPhoneSimulator", Subtarget_iPhoneSimulator},
|
|
{"Android", Subtarget_Android},
|
|
{"Playdate", Subtarget_Playdate},
|
|
};
|
|
|
|
auto fields = add_global_enum_type(str_lit("Odin_Platform_Subtarget_Type"), values, gb_count_of(values));
|
|
add_global_enum_constant(fields, "ODIN_PLATFORM_SUBTARGET", selected_subtarget);
|
|
}
|
|
|
|
{
|
|
GlobalEnumValue values[ErrorPosStyle_COUNT] = {
|
|
{"Default", ErrorPosStyle_Default},
|
|
{"Unix", ErrorPosStyle_Unix},
|
|
};
|
|
|
|
auto fields = add_global_enum_type(str_lit("Odin_Error_Pos_Style_Type"), values, gb_count_of(values));
|
|
add_global_enum_constant(fields, "ODIN_ERROR_POS_STYLE", build_context.ODIN_ERROR_POS_STYLE);
|
|
}
|
|
|
|
{
|
|
GlobalEnumValue values[OdinFastMath_COUNT] = {};
|
|
for (unsigned i = 0; i < OdinFastMath_COUNT; i++) {
|
|
values[i] = {OdinFastMathFlag_strings[i], i};
|
|
}
|
|
|
|
auto fields = add_global_enum_type(str_lit("Fast_Math_Flag"), values, gb_count_of(values), &t_fast_math_flag, t_u8);
|
|
|
|
GB_ASSERT(t_fast_math_flag->kind == Type_Named);
|
|
scope_insert(intrinsics_pkg->scope, t_fast_math_flag->Named.type_name);
|
|
|
|
Type *bs = alloc_type_bit_set();
|
|
bs->BitSet.elem = t_fast_math_flag;
|
|
bs->BitSet.underlying = t_u32;
|
|
bs->BitSet.lower = 0;
|
|
bs->BitSet.upper = OdinFastMath_COUNT-1;
|
|
bs->BitSet.node = nullptr;
|
|
|
|
|
|
{
|
|
String type_name = str_lit("Fast_Math_Flags");
|
|
|
|
Scope *scope = create_scope(nullptr, builtin_pkg->scope);
|
|
Entity *entity = alloc_entity_type_name(scope, make_token_ident(type_name), nullptr, EntityState_Resolved);
|
|
|
|
Type *named_type = alloc_type_named(type_name, bs, entity);
|
|
set_base_type(named_type, bs);
|
|
entity->type = named_type;
|
|
|
|
t_fast_math_flags = named_type;
|
|
|
|
scope_insert(intrinsics_pkg->scope, entity);
|
|
}
|
|
}
|
|
|
|
{
|
|
GlobalEnumValue values[OdinAtomicMemoryOrder_COUNT] = {
|
|
{OdinAtomicMemoryOrder_strings[OdinAtomicMemoryOrder_relaxed], OdinAtomicMemoryOrder_relaxed},
|
|
{OdinAtomicMemoryOrder_strings[OdinAtomicMemoryOrder_consume], OdinAtomicMemoryOrder_consume},
|
|
{OdinAtomicMemoryOrder_strings[OdinAtomicMemoryOrder_acquire], OdinAtomicMemoryOrder_acquire},
|
|
{OdinAtomicMemoryOrder_strings[OdinAtomicMemoryOrder_release], OdinAtomicMemoryOrder_release},
|
|
{OdinAtomicMemoryOrder_strings[OdinAtomicMemoryOrder_acq_rel], OdinAtomicMemoryOrder_acq_rel},
|
|
{OdinAtomicMemoryOrder_strings[OdinAtomicMemoryOrder_seq_cst], OdinAtomicMemoryOrder_seq_cst},
|
|
};
|
|
|
|
add_global_enum_type(str_lit("Atomic_Memory_Order"), values, gb_count_of(values), &t_atomic_memory_order);
|
|
GB_ASSERT(t_atomic_memory_order->kind == Type_Named);
|
|
scope_insert(intrinsics_pkg->scope, t_atomic_memory_order->Named.type_name);
|
|
}
|
|
|
|
{
|
|
GlobalEnumValue values[ProcCC_MAX] = {
|
|
{"Invalid", ProcCC_Invalid},
|
|
{"Odin", ProcCC_Odin},
|
|
{"Contextless", ProcCC_Contextless},
|
|
{"CDecl", ProcCC_CDecl},
|
|
{"Std_Call", ProcCC_StdCall},
|
|
{"Fast_Call", ProcCC_FastCall},
|
|
|
|
{"None", ProcCC_None},
|
|
{"Naked", ProcCC_Naked},
|
|
|
|
{"_", ProcCC_InlineAsm},
|
|
|
|
{"Win64", ProcCC_Win64},
|
|
{"SysV", ProcCC_SysV},
|
|
|
|
{"PreserveNone", ProcCC_PreserveNone},
|
|
{"PreserveMost", ProcCC_PreserveMost},
|
|
{"PreserveAll", ProcCC_PreserveAll},
|
|
};
|
|
|
|
auto fields = add_global_enum_type(str_lit("Odin_Calling_Convention"), values, gb_count_of(values), &t_odin_calling_convention, t_u8);
|
|
add_global_enum_constant(fields, "ODIN_DEFAULT_CALLING_CONVENTION", default_calling_convention());
|
|
}
|
|
|
|
{
|
|
int minimum_os_version = 0;
|
|
if (build_context.minimum_os_version_string != "") {
|
|
int major, minor, revision = 0;
|
|
#if defined(GB_SYSTEM_WINDOWS)
|
|
sscanf_s(cast(const char *)(build_context.minimum_os_version_string.text), "%d.%d.%d", &major, &minor, &revision);
|
|
#else
|
|
sscanf(cast(const char *)(build_context.minimum_os_version_string.text), "%d.%d.%d", &major, &minor, &revision);
|
|
#endif
|
|
minimum_os_version = (major*10000)+(minor*100)+revision;
|
|
}
|
|
add_global_constant("ODIN_MINIMUM_OS_VERSION", t_untyped_integer, exact_value_i64(minimum_os_version));
|
|
}
|
|
|
|
add_global_bool_constant("ODIN_DEBUG", bc->ODIN_DEBUG);
|
|
add_global_bool_constant("ODIN_DISABLE_ASSERT", bc->ODIN_DISABLE_ASSERT);
|
|
add_global_bool_constant("ODIN_DEFAULT_TO_NIL_ALLOCATOR", bc->ODIN_DEFAULT_TO_NIL_ALLOCATOR);
|
|
add_global_bool_constant("ODIN_NO_BOUNDS_CHECK", build_context.no_bounds_check);
|
|
add_global_bool_constant("ODIN_NO_TYPE_ASSERT", build_context.no_type_assert);
|
|
add_global_bool_constant("ODIN_DEFAULT_TO_PANIC_ALLOCATOR", bc->ODIN_DEFAULT_TO_PANIC_ALLOCATOR);
|
|
add_global_bool_constant("ODIN_NO_CRT", bc->no_crt);
|
|
add_global_bool_constant("ODIN_USE_SEPARATE_MODULES", bc->use_separate_modules);
|
|
add_global_bool_constant("ODIN_TEST", bc->command_kind == Command_test);
|
|
add_global_bool_constant("ODIN_NO_ENTRY_POINT", bc->no_entry_point);
|
|
add_global_bool_constant("ODIN_FOREIGN_ERROR_PROCEDURES", bc->ODIN_FOREIGN_ERROR_PROCEDURES);
|
|
add_global_bool_constant("ODIN_NO_RTTI", bc->no_rtti);
|
|
|
|
add_global_bool_constant("ODIN_VALGRIND_SUPPORT", bc->ODIN_VALGRIND_SUPPORT);
|
|
|
|
add_global_constant("ODIN_COMPILE_TIMESTAMP", t_untyped_integer, exact_value_i64(odin_compile_timestamp()));
|
|
|
|
{
|
|
String version = {};
|
|
|
|
#ifdef GIT_SHA
|
|
version.text = cast(u8 *)GIT_SHA;
|
|
version.len = gb_strlen(GIT_SHA);
|
|
#endif
|
|
|
|
add_global_string_constant("ODIN_VERSION_HASH", version);
|
|
}
|
|
|
|
{
|
|
// Available since LLVM 17 / new pass system, which is the minimum now.
|
|
bool f16_supported = true;
|
|
if (is_arch_wasm()) {
|
|
f16_supported = false;
|
|
} else if (build_context.metrics.os == TargetOs_darwin && build_context.metrics.arch == TargetArch_amd64) {
|
|
// NOTE(laytan): See #3222 for my ramblings on this.
|
|
f16_supported = false;
|
|
}
|
|
add_global_bool_constant("__ODIN_LLVM_F16_SUPPORTED", f16_supported);
|
|
}
|
|
|
|
{
|
|
GlobalEnumValue values[3] = {
|
|
{"Address", 0},
|
|
{"Memory", 1},
|
|
{"Thread", 2},
|
|
};
|
|
|
|
Type *enum_type = nullptr;
|
|
auto flags = add_global_enum_type(str_lit("Odin_Sanitizer_Flag"), values, gb_count_of(values), &enum_type);
|
|
Type *bit_set_type = alloc_type_bit_set();
|
|
bit_set_type->BitSet.elem = enum_type;
|
|
bit_set_type->BitSet.underlying = t_u32;
|
|
bit_set_type->BitSet.lower = 0;
|
|
bit_set_type->BitSet.upper = 2;
|
|
type_size_of(bit_set_type);
|
|
|
|
String type_name = str_lit("Odin_Sanitizer_Flags");
|
|
Scope *scope = create_scope(nullptr, builtin_pkg->scope);
|
|
Entity *entity = alloc_entity_type_name(scope, make_token_ident(type_name), nullptr, EntityState_Resolved);
|
|
|
|
Type *named_type = alloc_type_named(type_name, bit_set_type, entity);
|
|
set_base_type(named_type, bit_set_type);
|
|
|
|
add_global_constant("ODIN_SANITIZER_FLAGS", named_type, exact_value_u64(bc->sanitizer_flags));
|
|
}
|
|
|
|
{
|
|
GlobalEnumValue values[5] = {
|
|
{"None", -1},
|
|
{"Minimal", 0},
|
|
{"Size", 1},
|
|
{"Speed", 2},
|
|
{"Aggressive", 3},
|
|
};
|
|
|
|
auto fields = add_global_enum_type(str_lit("Odin_Optimization_Mode"), values, gb_count_of(values));
|
|
add_global_enum_constant(fields, "ODIN_OPTIMIZATION_MODE", bc->optimization_level);
|
|
}
|
|
|
|
|
|
// Builtin Procedures
|
|
for (isize i = 0; i < gb_count_of(builtin_procs); i++) {
|
|
BuiltinProcId id = cast(BuiltinProcId)i;
|
|
String name = builtin_procs[i].name;
|
|
if (name != "") {
|
|
u32 hash = 0;
|
|
InternedString interned = string_interner_insert(name, 0, &hash);
|
|
|
|
Entity *entity = alloc_entity(Entity_Builtin, nullptr, make_token_ident(name), t_invalid);
|
|
entity->Builtin.id = id;
|
|
switch (builtin_procs[i].pkg) {
|
|
case BuiltinProcPkg_builtin:
|
|
add_global_entity(entity, builtin_pkg->scope);
|
|
break;
|
|
case BuiltinProcPkg_intrinsics:
|
|
add_global_entity(entity, intrinsics_pkg->scope);
|
|
GB_ASSERT(scope_lookup_current(intrinsics_pkg->scope, interned, hash) != nullptr);
|
|
break;
|
|
}
|
|
}
|
|
}
|
|
{
|
|
BuiltinProcId id = BuiltinProc_expand_values;
|
|
String name = str_lit("expand_to_tuple");
|
|
Entity *entity = alloc_entity(Entity_Builtin, nullptr, make_token_ident(name), t_invalid);
|
|
entity->Builtin.id = id;
|
|
add_global_entity(entity, builtin_pkg->scope);
|
|
}
|
|
|
|
bool defined_values_double_declaration = false;
|
|
for (auto const &entry : bc->defined_values) {
|
|
char const *name = entry.key;
|
|
ExactValue value = entry.value;
|
|
GB_ASSERT(value.kind != ExactValue_Invalid);
|
|
|
|
Type *type = nullptr;
|
|
switch (value.kind) {
|
|
case ExactValue_Bool:
|
|
type = t_untyped_bool;
|
|
break;
|
|
case ExactValue_String:
|
|
type = t_untyped_string;
|
|
break;
|
|
case ExactValue_Integer:
|
|
type = t_untyped_integer;
|
|
break;
|
|
case ExactValue_Float:
|
|
case ExactValue_Rational:
|
|
type = t_untyped_float;
|
|
break;
|
|
}
|
|
GB_ASSERT(type != nullptr);
|
|
|
|
Entity *entity = alloc_entity_constant(nullptr, make_token_ident(name), type, value);
|
|
entity->state = EntityState_Resolved;
|
|
if (scope_insert(config_pkg->scope, entity)) {
|
|
error(entity->token, "'%s' defined as an argument is already declared at the global scope", name);
|
|
defined_values_double_declaration = true;
|
|
// NOTE(bill): Just exit early before anything, even though the compiler will do that anyway
|
|
}
|
|
}
|
|
|
|
if (defined_values_double_declaration) {
|
|
exit_with_errors();
|
|
}
|
|
|
|
|
|
t_u8_ptr = alloc_type_pointer(t_u8);
|
|
t_u8_multi_ptr = alloc_type_multi_pointer(t_u8);
|
|
t_u16_ptr = alloc_type_pointer(t_u16);
|
|
t_u16_multi_ptr = alloc_type_multi_pointer(t_u16);
|
|
t_int_ptr = alloc_type_pointer(t_int);
|
|
t_i64_ptr = alloc_type_pointer(t_i64);
|
|
t_f64_ptr = alloc_type_pointer(t_f64);
|
|
t_u8_slice = alloc_type_slice(t_u8);
|
|
t_string_slice = alloc_type_slice(t_string);
|
|
|
|
// intrinsics types for objective-c stuff
|
|
{
|
|
t_objc_object = add_global_type_name(intrinsics_pkg->scope, str_lit("objc_object"), alloc_type_struct_complete());
|
|
t_objc_selector = add_global_type_name(intrinsics_pkg->scope, str_lit("objc_selector"), alloc_type_struct_complete());
|
|
t_objc_class = add_global_type_name(intrinsics_pkg->scope, str_lit("objc_class"), alloc_type_struct_complete());
|
|
t_objc_ivar = add_global_type_name(intrinsics_pkg->scope, str_lit("objc_ivar"), alloc_type_struct_complete());
|
|
|
|
t_objc_id = alloc_type_pointer(t_objc_object);
|
|
t_objc_SEL = alloc_type_pointer(t_objc_selector);
|
|
t_objc_Class = alloc_type_pointer(t_objc_class);
|
|
t_objc_Ivar = alloc_type_pointer(t_objc_ivar);
|
|
|
|
t_objc_instancetype = add_global_type_name(intrinsics_pkg->scope, str_lit("objc_instancetype"), t_objc_id);
|
|
}
|
|
|
|
// intrinsics types for C stuff
|
|
{
|
|
Scope *scope = create_scope(nullptr, nullptr);
|
|
|
|
auto dummy_field = [](Scope *scope, Type *type, i32 field_index, char const *name = nullptr) -> Entity * {
|
|
auto token = blank_token;
|
|
if (name) {
|
|
token.string = make_string_c(name);
|
|
}
|
|
return alloc_entity_field(scope, token, type, false, 0, EntityState_Resolved);
|
|
};
|
|
|
|
auto fields = array_make<Entity *>(permanent_allocator(), 0, 8);
|
|
|
|
switch (build_context.metrics.arch) {
|
|
case TargetArch_amd64:
|
|
switch (build_context.metrics.os) {
|
|
case TargetOs_freestanding:
|
|
/*check*/
|
|
case TargetOs_linux:
|
|
case TargetOs_freebsd:
|
|
case TargetOs_netbsd:
|
|
case TargetOs_openbsd:
|
|
array_add(&fields, dummy_field(scope, t_u32, 0, "gp_offset"));
|
|
array_add(&fields, dummy_field(scope, t_u32, 1, "fp_offset"));
|
|
array_add(&fields, dummy_field(scope, t_rawptr, 2, "overflow_arg_area"));
|
|
array_add(&fields, dummy_field(scope, t_rawptr, 3, "reg_save_area"));
|
|
break;
|
|
}
|
|
break;
|
|
|
|
case TargetArch_arm64:
|
|
switch (build_context.metrics.os) {
|
|
case TargetOs_darwin:
|
|
// AARCH64 architecture is different to other arm64 platforms
|
|
array_add(&fields, dummy_field(scope, t_rawptr, 0));
|
|
break;
|
|
|
|
case TargetOs_freestanding:
|
|
case TargetOs_linux:
|
|
case TargetOs_freebsd:
|
|
case TargetOs_netbsd:
|
|
case TargetOs_openbsd: // Not sure if this is correct
|
|
array_add(&fields, dummy_field(scope, t_rawptr, 0, "__stack"));
|
|
array_add(&fields, dummy_field(scope, t_rawptr, 1, "__gr_top"));
|
|
array_add(&fields, dummy_field(scope, t_rawptr, 2, "__vr_top"));
|
|
array_add(&fields, dummy_field(scope, t_i32, 3, "__gr_offs"));
|
|
array_add(&fields, dummy_field(scope, t_i32, 4, "__vr_offs"));
|
|
break;
|
|
}
|
|
break;
|
|
}
|
|
|
|
if (fields.count == 0) {
|
|
array_add(&fields, dummy_field(scope, t_rawptr, 0));
|
|
}
|
|
|
|
Type *va_list_struct = alloc_type_struct_complete();
|
|
va_list_struct->Struct.scope = scope;
|
|
va_list_struct->Struct.fields = slice_from_array(fields);
|
|
GB_ASSERT(type_size_of(va_list_struct) > 0);
|
|
|
|
t_c_va_list = add_global_type_name(intrinsics_pkg->scope, str_lit("c_va_list"), va_list_struct);
|
|
t_c_va_list_ptr = alloc_type_pointer(t_c_va_list);
|
|
}
|
|
}
|
|
|
|
|
|
|
|
|
|
gb_internal void init_checker_info(CheckerInfo *i) {
|
|
gbAllocator a = heap_allocator();
|
|
|
|
TIME_SECTION("checker info: general");
|
|
|
|
array_init(&i->definitions, a);
|
|
array_init(&i->entities, a);
|
|
map_init(&i->global_untyped);
|
|
array_init(&i->link_names, heap_allocator());
|
|
|
|
per_thread_array_init(&i->min_dep_type_info_queue, global_thread_pool.threads.count);
|
|
map_init(&i->min_dep_type_info_index_map);
|
|
|
|
string_map_init(&i->files);
|
|
string_map_init(&i->packages);
|
|
array_init(&i->variable_init_order, a);
|
|
array_init(&i->testing_procedures, a, 0, 0);
|
|
array_init(&i->init_procedures, a, 0, 0);
|
|
array_init(&i->fini_procedures, a, 0, 0);
|
|
array_init(&i->required_foreign_imports_through_force, a, 0, 0);
|
|
array_init(&i->defineables, a);
|
|
|
|
map_init(&i->objc_msgSend_types);
|
|
mpsc_init(&i->objc_class_implementations, a);
|
|
string_set_init(&i->obcj_class_name_set, 0);
|
|
map_init(&i->objc_method_implementations);
|
|
|
|
string_map_init(&i->load_file_cache);
|
|
array_init(&i->all_procedures, a);
|
|
mpsc_init(&i->all_procedures_queue, a);
|
|
|
|
per_thread_array_init(&i->entity_queue, global_thread_pool.threads.count);
|
|
per_thread_array_init(&i->definition_queue, global_thread_pool.threads.count);
|
|
mpsc_init(&i->required_global_variable_queue, a); // 1<<10);
|
|
mpsc_init(&i->required_foreign_imports_through_force_queue, a); // 1<<10);
|
|
mpsc_init(&i->foreign_imports_to_check_fullpaths, a); // 1<<10);
|
|
mpsc_init(&i->foreign_decls_to_check, a); // 1<<10);
|
|
mpsc_init(&i->intrinsics_entry_point_usage, a); // 1<<10); // just waste some memory here, even if it probably never used
|
|
|
|
mpsc_init(&i->raddbg_type_views_queue, a);
|
|
array_init(&i->raddbg_type_views, a);
|
|
|
|
string_map_init(&i->load_directory_cache);
|
|
map_init(&i->load_directory_map);
|
|
}
|
|
|
|
gb_internal void destroy_checker_info(CheckerInfo *i) {
|
|
array_free(&i->definitions);
|
|
array_free(&i->entities);
|
|
map_destroy(&i->global_untyped);
|
|
array_free(&i->link_names);
|
|
|
|
per_thread_array_destroy(&i->min_dep_type_info_queue);
|
|
map_destroy(&i->min_dep_type_info_index_map);
|
|
|
|
string_map_destroy(&i->files);
|
|
string_map_destroy(&i->packages);
|
|
array_free(&i->variable_init_order);
|
|
array_free(&i->required_foreign_imports_through_force);
|
|
array_free(&i->defineables);
|
|
|
|
array_free(&i->all_procedures);
|
|
|
|
mpsc_destroy(&i->all_procedures_queue);
|
|
|
|
per_thread_array_destroy(&i->entity_queue);
|
|
per_thread_array_destroy(&i->definition_queue);
|
|
mpsc_destroy(&i->required_global_variable_queue);
|
|
mpsc_destroy(&i->required_foreign_imports_through_force_queue);
|
|
mpsc_destroy(&i->foreign_imports_to_check_fullpaths);
|
|
mpsc_destroy(&i->foreign_decls_to_check);
|
|
|
|
mpsc_destroy(&i->raddbg_type_views_queue);
|
|
array_free(&i->raddbg_type_views);
|
|
|
|
map_destroy(&i->objc_msgSend_types);
|
|
string_set_destroy(&i->obcj_class_name_set);
|
|
map_destroy(&i->objc_method_implementations);
|
|
|
|
// NOTE(harold): Disabling this: It can cause the 'count == 0' assert to trigger
|
|
// when there's checker errors and the queue is still full as it did not reach the generation stage.
|
|
// mpsc_destroy(&i->objc_class_implementations);
|
|
|
|
string_map_destroy(&i->load_file_cache);
|
|
string_map_destroy(&i->load_directory_cache);
|
|
map_destroy(&i->load_directory_map);
|
|
}
|
|
|
|
gb_internal void init_checker_context(CheckerContext *ctx, Checker *c) {
|
|
ctx->checker = c;
|
|
ctx->info = &c->info;
|
|
ctx->scope = builtin_pkg->scope;
|
|
ctx->pkg = builtin_pkg;
|
|
|
|
ctx->type_path = new_checker_type_path();
|
|
ctx->type_level = 0;
|
|
}
|
|
|
|
gb_internal void destroy_checker_context(CheckerContext *ctx) {
|
|
destroy_checker_type_path(ctx->type_path);
|
|
}
|
|
|
|
gb_internal bool add_curr_ast_file(CheckerContext *ctx, AstFile *file) {
|
|
if (file != nullptr) {
|
|
ctx->file = file;
|
|
ctx->decl = file->pkg->decl_info;
|
|
ctx->scope = file->scope;
|
|
ctx->pkg = file->pkg;
|
|
return true;
|
|
}
|
|
return false;
|
|
}
|
|
gb_internal void reset_checker_context(CheckerContext *ctx, AstFile *file, UntypedExprInfoMap *untyped) {
|
|
if (ctx == nullptr) {
|
|
return;
|
|
}
|
|
GB_ASSERT(ctx->checker != nullptr);
|
|
mutex_lock(&ctx->mutex);
|
|
|
|
auto type_path = ctx->type_path;
|
|
array_clear(type_path);
|
|
|
|
gb_zero_size(&ctx->pkg, gb_size_of(CheckerContext) - gb_offset_of(CheckerContext, pkg));
|
|
|
|
ctx->file = nullptr;
|
|
ctx->scope = builtin_pkg->scope;
|
|
ctx->pkg = builtin_pkg;
|
|
ctx->decl = nullptr;
|
|
|
|
ctx->type_path = type_path;
|
|
ctx->type_level = 0;
|
|
|
|
add_curr_ast_file(ctx, file);
|
|
|
|
ctx->untyped = untyped;
|
|
|
|
mutex_unlock(&ctx->mutex);
|
|
}
|
|
|
|
|
|
|
|
|
|
gb_internal void init_checker(Checker *c) {
|
|
gbAllocator a = heap_allocator();
|
|
|
|
TIME_SECTION("init checker info");
|
|
init_checker_info(&c->info);
|
|
|
|
c->info.checker = c;
|
|
|
|
TIME_SECTION("init proc queues");
|
|
mpsc_init(&c->procs_with_deferred_to_check, a); //, 1<<10);
|
|
mpsc_init(&c->procs_with_objc_context_provider_to_check, a);
|
|
|
|
|
|
// NOTE(bill): 1 Mi elements should be enough on average
|
|
array_init(&c->procs_to_check, heap_allocator(), 0, 1<<20);
|
|
array_init(&c->nested_proc_lits, heap_allocator(), 0, 1<<20);
|
|
|
|
per_thread_array_init(&c->global_untyped_queue, global_thread_pool.threads.count);
|
|
mpsc_init(&c->soa_types_to_complete, a); // , 1<<20);
|
|
|
|
init_checker_context(&c->builtin_ctx, c);
|
|
}
|
|
|
|
gb_internal void destroy_checker(Checker *c) {
|
|
destroy_checker_info(&c->info);
|
|
|
|
destroy_checker_context(&c->builtin_ctx);
|
|
|
|
array_free(&c->nested_proc_lits);
|
|
array_free(&c->procs_to_check);
|
|
per_thread_array_destroy(&c->global_untyped_queue);
|
|
mpsc_destroy(&c->soa_types_to_complete);
|
|
}
|
|
|
|
|
|
gb_internal TypeAndValue type_and_value_of_expr(Ast *expr) {
|
|
TypeAndValue tav = {};
|
|
if (expr != nullptr) {
|
|
tav = expr->tav;
|
|
}
|
|
return tav;
|
|
}
|
|
|
|
gb_internal Type *type_of_expr(Ast *expr) {
|
|
TypeAndValue tav = expr->tav;
|
|
if (tav.mode != Addressing_Invalid) {
|
|
return tav.type;
|
|
}
|
|
{
|
|
Entity *entity = entity_of_node(expr);
|
|
if (entity) {
|
|
return entity->type;
|
|
}
|
|
}
|
|
|
|
return nullptr;
|
|
}
|
|
|
|
gb_internal Entity *implicit_entity_of_node(Ast *clause) {
|
|
if (clause != nullptr && clause->kind == Ast_CaseClause) {
|
|
return clause->CaseClause.implicit_entity;
|
|
}
|
|
return nullptr;
|
|
}
|
|
|
|
gb_internal Entity *entity_of_node(Ast *expr) {
|
|
retry:;
|
|
expr = unparen_expr(expr);
|
|
switch (expr->kind) {
|
|
case_ast_node(ident, Ident, expr);
|
|
Entity *e = ident->entity;
|
|
if (e && e->flags & EntityFlag_Overridden) {
|
|
// GB_PANIC("use of an overriden entity: %.*s", LIT(e->token.string));
|
|
}
|
|
return e;
|
|
case_end;
|
|
case_ast_node(se, SelectorExpr, expr);
|
|
Ast *s = unselector_expr(se->selector);
|
|
return entity_of_node(s);
|
|
case_end;
|
|
case_ast_node(cc, CaseClause, expr);
|
|
return cc->implicit_entity;
|
|
case_end;
|
|
|
|
case_ast_node(ce, CallExpr, expr);
|
|
return ce->entity_procedure_of;
|
|
case_end;
|
|
|
|
case_ast_node(we, TernaryWhenExpr, expr);
|
|
if (we->cond == nullptr) {
|
|
break;
|
|
}
|
|
if (we->cond->tav.value.kind != ExactValue_Bool) {
|
|
break;
|
|
}
|
|
expr = we->cond->tav.value.value_bool ? we->x : we->y;
|
|
goto retry;
|
|
case_end;
|
|
case_ast_node(label, AsmLabelDecl, expr);
|
|
return entity_of_node(label->name);
|
|
case_end;
|
|
case_ast_node(at, AsmTemplate, expr);
|
|
return at->anonymous_entity;
|
|
case_end;
|
|
}
|
|
return nullptr;
|
|
}
|
|
|
|
gb_internal DeclInfo *decl_info_of_entity(Entity *e) {
|
|
if (e != nullptr) {
|
|
return e->decl_info;
|
|
}
|
|
return nullptr;
|
|
}
|
|
|
|
gb_internal Type *proc_entity_full_type(Entity *e) {
|
|
if (e->kind == Entity_Procedure && e->decl_info != nullptr && e->decl_info->gen_proc_type != nullptr) {
|
|
return e->decl_info->gen_proc_type;
|
|
}
|
|
return e->type;
|
|
}
|
|
|
|
// gb_internal DeclInfo *decl_info_of_ident(Ast *ident) {
|
|
// return decl_info_of_entity(entity_of_node(ident));
|
|
// }
|
|
|
|
// gb_internal AstFile *ast_file_of_filename(CheckerInfo *i, String filename) {
|
|
// AstFile **found = string_map_get(&i->files, filename);
|
|
// if (found != nullptr) {
|
|
// return *found;
|
|
// }
|
|
// return nullptr;
|
|
// }
|
|
gb_internal ExprInfo *check_get_expr_info(CheckerContext *c, Ast *expr) {
|
|
if (c->untyped != nullptr) {
|
|
ExprInfo **found = map_get(c->untyped, expr);
|
|
if (found) {
|
|
return *found;
|
|
}
|
|
return nullptr;
|
|
} else {
|
|
// NOTE: read under the lock, as another thread's insert may move the entries
|
|
rw_mutex_shared_lock(&c->info->global_untyped_mutex);
|
|
ExprInfo **found = map_get(&c->info->global_untyped, expr);
|
|
ExprInfo *info = found ? *found : nullptr;
|
|
rw_mutex_shared_unlock(&c->info->global_untyped_mutex);
|
|
return info;
|
|
}
|
|
}
|
|
|
|
gb_internal void check_set_expr_info(CheckerContext *c, Ast *expr, AddressingMode mode, Type *type, ExactValue value) {
|
|
if (c->untyped != nullptr) {
|
|
map_set(c->untyped, expr, make_expr_info(mode, type, value, false));
|
|
} else {
|
|
rw_mutex_lock(&c->info->global_untyped_mutex);
|
|
map_set(&c->info->global_untyped, expr, make_expr_info(mode, type, value, false));
|
|
rw_mutex_unlock(&c->info->global_untyped_mutex);
|
|
}
|
|
}
|
|
|
|
gb_internal void check_remove_expr_info(CheckerContext *c, Ast *e) {
|
|
if (c->untyped != nullptr) {
|
|
map_remove(c->untyped, e);
|
|
GB_ASSERT(map_get(c->untyped, e) == nullptr);
|
|
} else {
|
|
auto *untyped = &c->info->global_untyped;
|
|
rw_mutex_lock(&c->info->global_untyped_mutex);
|
|
map_remove(untyped, e);
|
|
GB_ASSERT(map_get(untyped, e) == nullptr);
|
|
rw_mutex_unlock(&c->info->global_untyped_mutex);
|
|
}
|
|
}
|
|
|
|
gb_internal isize type_info_index(CheckerInfo *info, TypeInfoPair pair, bool error_on_failure) {
|
|
rw_mutex_shared_lock(&info->minimum_dependency_type_info_mutex);
|
|
|
|
isize entry_index = -1;
|
|
u64 hash = pair.hash;
|
|
isize *found_entry_index = map_get(&info->min_dep_type_info_index_map, hash);
|
|
if (found_entry_index) {
|
|
entry_index = *found_entry_index;
|
|
}
|
|
rw_mutex_shared_unlock(&info->minimum_dependency_type_info_mutex);
|
|
|
|
if (error_on_failure && entry_index < 0) {
|
|
compiler_error("Type_Info for '%s' could not be found", type_to_string(pair.type));
|
|
}
|
|
return entry_index;
|
|
}
|
|
|
|
|
|
gb_internal isize type_info_index(CheckerInfo *info, Type *type, bool error_on_failure) {
|
|
type = default_type(type);
|
|
if (type == t_llvm_bool) {
|
|
type = t_bool;
|
|
}
|
|
|
|
u64 hash = type_hash_canonical_type(type);
|
|
return type_info_index(info, {type, hash}, error_on_failure);
|
|
}
|
|
|
|
|
|
|
|
gb_internal void add_untyped(CheckerContext *c, Ast *expr, AddressingMode mode, Type *type, ExactValue const &value) {
|
|
if (expr == nullptr) {
|
|
return;
|
|
}
|
|
if (mode == Addressing_Invalid) {
|
|
return;
|
|
}
|
|
|
|
if (mode == Addressing_Constant && type == t_invalid) {
|
|
compiler_error("add_untyped - invalid type: %s", type_to_string(type));
|
|
}
|
|
if (!is_type_untyped(type)) {
|
|
return;
|
|
}
|
|
check_set_expr_info(c, expr, mode, type, value);
|
|
}
|
|
|
|
struct alignas(GB_CACHE_LINE_SIZE) TypeAndValueMutexStripes {
|
|
BlockingMutex mutex;
|
|
u8 padding[GB_CACHE_LINE_SIZE - gb_size_of(BlockingMutex)];
|
|
};
|
|
|
|
enum { TypeAndValueMutexStripes_COUNT = 128 };
|
|
gb_global TypeAndValueMutexStripes tav_mutex_stripes[TypeAndValueMutexStripes_COUNT];
|
|
|
|
gb_internal BlockingMutex *tav_mutex_for_node(Ast *node) {
|
|
GB_ASSERT(node != nullptr);
|
|
uintptr h = cast(uintptr)node;
|
|
h ^= h >> 6;
|
|
return &tav_mutex_stripes[h % TypeAndValueMutexStripes_COUNT].mutex;
|
|
}
|
|
|
|
gb_internal void add_type_and_value(CheckerContext *ctx, Ast *expr, AddressingMode mode, Type *type, ExactValue const &value) {
|
|
if (expr == nullptr) {
|
|
return;
|
|
}
|
|
if (mode == Addressing_Invalid) {
|
|
return;
|
|
}
|
|
if (mode == Addressing_Constant && type == t_invalid) {
|
|
return;
|
|
}
|
|
|
|
/* Previous logic:
|
|
BlockingMutex *mutex = &ctx->info->type_and_value_mutex;
|
|
if (ctx->decl) {
|
|
mutex = &ctx->decl->type_and_value_mutex;
|
|
} else if (ctx->pkg) {
|
|
mutex = &ctx->pkg->type_and_value_mutex;
|
|
}
|
|
*/
|
|
|
|
Ast *prev_expr = nullptr;
|
|
while (prev_expr != expr) {
|
|
prev_expr = expr;
|
|
BlockingMutex *mutex = tav_mutex_for_node(expr);
|
|
mutex_lock(mutex);
|
|
expr->tav.mode = mode;
|
|
if (type != nullptr && expr->tav.type != nullptr &&
|
|
is_type_any(type) && is_type_untyped(expr->tav.type)) {
|
|
// ignore
|
|
} else {
|
|
expr->tav.type = type;
|
|
}
|
|
|
|
if (mode == Addressing_Constant || mode == Addressing_Invalid) {
|
|
expr->tav.value = value;
|
|
} else if (mode == Addressing_Value && type != nullptr && is_type_typeid(type)) {
|
|
expr->tav.value = value;
|
|
} else if (mode == Addressing_Value && type != nullptr && is_type_proc(type)) {
|
|
expr->tav.value = value;
|
|
}
|
|
mutex_unlock(mutex);
|
|
|
|
expr = unparen_expr(expr);
|
|
if (expr == nullptr) {
|
|
break;
|
|
};
|
|
}
|
|
}
|
|
|
|
gb_internal void add_entity_definition(CheckerInfo *i, Ast *identifier, Entity *entity) {
|
|
GB_ASSERT(identifier != nullptr);
|
|
if (identifier->kind != Ast_Ident) {
|
|
return;
|
|
}
|
|
if (identifier->Ident.entity != nullptr) {
|
|
// NOTE(bill): Identifier has already been handled
|
|
return;
|
|
}
|
|
GB_ASSERT(entity != nullptr);
|
|
identifier->Ident.entity = entity;
|
|
entity->identifier = identifier;
|
|
per_thread_array_add(&i->definition_queue, entity);
|
|
}
|
|
|
|
gb_internal bool redeclaration_error(String name, Entity *prev, Entity *found) {
|
|
TokenPos pos = found->token.pos;
|
|
Entity *up = found->using_parent;
|
|
if (up != nullptr) {
|
|
if (pos == up->token.pos) {
|
|
// NOTE(bill): Error should have been handled already
|
|
return false;
|
|
}
|
|
if (found->flags & EntityFlag_Result) {
|
|
error(prev->token,
|
|
"Direct shadowing of the named return value '%.*s' in this scope through 'using'\n"
|
|
"\tat %s",
|
|
LIT(name),
|
|
token_pos_to_string(up->token.pos));
|
|
} else {
|
|
error(prev->token,
|
|
"Redeclaration of '%.*s' in this scope through 'using'\n"
|
|
"\tat %s",
|
|
LIT(name),
|
|
token_pos_to_string(up->token.pos));
|
|
}
|
|
} else {
|
|
if (pos == prev->token.pos) {
|
|
// NOTE(bill): Error should have been handled already
|
|
return false;
|
|
}
|
|
// NOTE(bill): the insertion order is a race between the files of a package, so order the pair by position;
|
|
// the later declaration stays the anchor, as it is the one being reported
|
|
TokenPos first = prev->token.pos;
|
|
TokenPos second = pos;
|
|
if (second < first) {
|
|
first = pos;
|
|
second = prev->token.pos;
|
|
}
|
|
if (found->flags & EntityFlag_Result) {
|
|
error(second,
|
|
"Direct shadowing of the named return value '%.*s' in this scope\n"
|
|
"\tat %s",
|
|
LIT(name),
|
|
token_pos_to_string(first));
|
|
} else {
|
|
error(second,
|
|
"Redeclaration of '%.*s' in this scope\n"
|
|
"\tat %s",
|
|
LIT(name),
|
|
token_pos_to_string(first));
|
|
}
|
|
}
|
|
return false;
|
|
}
|
|
|
|
gb_internal void add_entity_flags_from_file(CheckerContext *c, Entity *e, Scope *scope) {
|
|
if (c->file != nullptr && (c->file->flags & AstFile_IsLazy) != 0 && scope->flags & ScopeFlag_File) {
|
|
AstPackage *pkg = c->file->pkg;
|
|
if (pkg->kind == Package_Init && e->kind == Entity_Procedure && e->token.string == "main") {
|
|
// Do nothing
|
|
} else if (e->flags & (EntityFlag_Test|EntityFlag_Init|EntityFlag_Fini)) {
|
|
// Do nothing
|
|
} else {
|
|
e->flags |= EntityFlag_Lazy;
|
|
}
|
|
}
|
|
}
|
|
|
|
gb_internal bool add_entity_with_name(CheckerContext *c, Scope *scope, Ast *identifier, Entity *entity, String name) {
|
|
if (scope == nullptr) {
|
|
return false;
|
|
}
|
|
|
|
|
|
if (!is_blank_ident(name)) {
|
|
Entity *ie = scope_insert(scope, entity);
|
|
if (ie != nullptr) {
|
|
return redeclaration_error(name, entity, ie);
|
|
}
|
|
}
|
|
if (identifier != nullptr) {
|
|
if (entity->file == nullptr) {
|
|
entity->file = c->file;
|
|
}
|
|
add_entity_definition(c->info, identifier, entity);
|
|
}
|
|
return true;
|
|
}
|
|
|
|
gb_internal bool add_entity_with_name(CheckerInfo *info, Scope *scope, Ast *identifier, Entity *entity, String name) {
|
|
if (scope == nullptr) {
|
|
return false;
|
|
}
|
|
|
|
|
|
if (!is_blank_ident(name)) {
|
|
Entity *ie = scope_insert(scope, entity);
|
|
if (ie != nullptr) {
|
|
return redeclaration_error(name, entity, ie);
|
|
}
|
|
}
|
|
if (identifier != nullptr) {
|
|
GB_ASSERT(entity->file != nullptr);
|
|
add_entity_definition(info, identifier, entity);
|
|
}
|
|
return true;
|
|
}
|
|
|
|
gb_internal bool add_entity(CheckerContext *c, Scope *scope, Ast *identifier, Entity *entity) {
|
|
return add_entity_with_name(c, scope, identifier, entity, entity->token.string);
|
|
}
|
|
|
|
gb_internal void add_entity_use(CheckerContext *c, Ast *identifier, Entity *entity) {
|
|
if (entity == nullptr) {
|
|
return;
|
|
}
|
|
add_declaration_dependency(c, entity);
|
|
entity->flags |= EntityFlag_Used;
|
|
if (entity->kind == Entity_Procedure && entity->Procedure.generated_from_polymorphic) {
|
|
// Check the specialization body later
|
|
DeclInfo *decl = entity->decl_info;
|
|
if (decl != nullptr) {
|
|
ProcInfo *pi = decl->gen_proc_info.exchange(nullptr);
|
|
if (pi != nullptr) {
|
|
check_procedure_later(c->checker, pi);
|
|
}
|
|
}
|
|
}
|
|
if (entity_has_deferred_procedure(entity)) {
|
|
Entity *deferred = entity->Procedure.deferred_procedure.entity;
|
|
if (deferred != entity) {
|
|
add_entity_use(c, nullptr, deferred);
|
|
}
|
|
}
|
|
if (identifier == nullptr || identifier->kind != Ast_Ident) {
|
|
return;
|
|
}
|
|
// NOTE: only set it once, as `$` procedure arguments are matched by this identifier
|
|
Ast *empty_ident = nullptr;
|
|
entity->identifier.compare_exchange_strong(empty_ident, identifier);
|
|
|
|
identifier->Ident.entity = entity;
|
|
|
|
String dmsg = entity->deprecated_message;
|
|
if (dmsg.len > 0) {
|
|
warning(identifier, "%.*s is deprecated: %.*s", LIT(entity->token.string), LIT(dmsg));
|
|
}
|
|
String wmsg = entity->warning_message;
|
|
if (wmsg.len > 0) {
|
|
warning(identifier, "%.*s: %.*s", LIT(entity->token.string), LIT(wmsg));
|
|
}
|
|
}
|
|
|
|
|
|
gb_internal bool could_entity_be_lazy(Entity *e, DeclInfo *d) {
|
|
if ((e->flags & EntityFlag_Lazy) == 0) {
|
|
return false;
|
|
}
|
|
|
|
if (e->flags & (EntityFlag_Test|EntityFlag_Init|EntityFlag_Fini)) {
|
|
return false;
|
|
} else if (e->kind == Entity_Variable && e->Variable.is_export) {
|
|
return false;
|
|
} else if (e->kind == Entity_Procedure && e->Procedure.is_export) {
|
|
return false;
|
|
}
|
|
|
|
for (Ast *attr : d->attributes) {
|
|
if (attr->kind != Ast_Attribute) continue;
|
|
for (Ast *elem : attr->Attribute.elems) {
|
|
String name = {};
|
|
|
|
switch (elem->kind) {
|
|
case_ast_node(i, Ident, elem);
|
|
name = i->token.string;
|
|
case_end;
|
|
case_ast_node(i, Implicit, elem);
|
|
name = i->string;
|
|
case_end;
|
|
case_ast_node(fv, FieldValue, elem);
|
|
if (fv->field->kind == Ast_Ident) {
|
|
name = fv->field->Ident.token.string;
|
|
}
|
|
case_end;
|
|
}
|
|
|
|
if (name.len != 0) {
|
|
if (name == "test") {
|
|
return false;
|
|
} else if (name == "export") {
|
|
return false;
|
|
} else if (name == "init") {
|
|
return false;
|
|
} else if (name == "linkage") {
|
|
return false;
|
|
}
|
|
}
|
|
}
|
|
}
|
|
|
|
return true;
|
|
}
|
|
|
|
gb_internal void add_entity_and_decl_info(CheckerContext *c, Ast *identifier, Entity *e, DeclInfo *d, bool is_exported) {
|
|
if (identifier == nullptr) {
|
|
// NOTE(bill): Should only happen on errors
|
|
error(e->token, "Invalid variable declaration");
|
|
return;
|
|
}
|
|
if (identifier->kind != Ast_Ident) {
|
|
// NOTE(bill): This is a safety check
|
|
gbString s = expr_to_string(identifier);
|
|
error(identifier, "A variable declaration must be an identifer, got %s", s);
|
|
gb_string_free(s);
|
|
return;
|
|
}
|
|
GB_ASSERT(e != nullptr && d != nullptr);
|
|
GB_ASSERT(identifier->Ident.token.string == e->token.string);
|
|
|
|
if (!could_entity_be_lazy(e, d)) {
|
|
e->flags &= ~EntityFlag_Lazy;
|
|
}
|
|
|
|
if (c->trial_entities != nullptr) {
|
|
// NOTE(bill): a scratch copy for a global 'when' trial, put in no scope or queue
|
|
e->flags &= ~EntityFlag_Lazy;
|
|
e->file = c->file;
|
|
e->decl_info = d;
|
|
e->pkg = c->pkg;
|
|
d->entity.store(e);
|
|
identifier->Ident.entity = e;
|
|
e->identifier = identifier;
|
|
array_add(c->trial_entities, e);
|
|
return;
|
|
}
|
|
|
|
if (e->scope != nullptr) {
|
|
Scope *scope = e->scope;
|
|
|
|
if (scope->flags & ScopeFlag_File && is_entity_kind_exported(e->kind) && is_exported) {
|
|
AstPackage *pkg = scope->file->pkg;
|
|
GB_ASSERT(pkg->scope == scope->parent);
|
|
GB_ASSERT(c->pkg == pkg);
|
|
|
|
// NOTE(bill): as multiple threads could be accessing this, it needs to be wrapped
|
|
// The current hash map for scopes is not thread safe
|
|
AstPackageExportedEntity ee = {identifier, e};
|
|
mpmc_enqueue(&pkg->exported_entity_queue, ee);
|
|
|
|
// mutex_lock(&c->info->scope_mutex);
|
|
// add_entity(c, pkg->scope, identifier, e);
|
|
// mutex_unlock(&c->info->scope_mutex);
|
|
} else {
|
|
add_entity(c, scope, identifier, e);
|
|
}
|
|
}
|
|
|
|
CheckerInfo *info = c->info;
|
|
add_entity_definition(info, identifier, e);
|
|
GB_ASSERT(e->decl_info == nullptr);
|
|
e->decl_info = d;
|
|
e->pkg = c->pkg;
|
|
d->entity.store(e);
|
|
|
|
bool is_lazy = (e->flags & EntityFlag_Lazy) == EntityFlag_Lazy;
|
|
if (!is_lazy) {
|
|
per_thread_array_add(&info->entity_queue, e);
|
|
}
|
|
|
|
if (e->token.pos.file_id != 0) {
|
|
e->order_in_src = cast(u64)(e->token.pos.file_id)<<32 | u32(e->token.pos.offset);
|
|
} else {
|
|
GB_ASSERT(!is_lazy);
|
|
e->order_in_src = 1 + info->entities_without_file.fetch_add(1);
|
|
}
|
|
}
|
|
|
|
|
|
gb_internal void add_implicit_entity(CheckerContext *c, Ast *clause, Entity *e) {
|
|
GB_ASSERT(clause != nullptr);
|
|
GB_ASSERT(e != nullptr);
|
|
GB_ASSERT(clause->kind == Ast_CaseClause);
|
|
clause->CaseClause.implicit_entity = e;
|
|
}
|
|
|
|
gb_internal void add_type_info_type_internal(CheckerContext *c, Type *t);
|
|
gb_internal void add_type_info_type(CheckerContext *c, Type *t) {
|
|
if (build_context.no_rtti) {
|
|
return;
|
|
}
|
|
if (t == nullptr) {
|
|
return;
|
|
}
|
|
t = default_type(t);
|
|
if (is_type_untyped(t)) {
|
|
return; // Could be nil
|
|
}
|
|
if (is_type_polymorphic(t)) {
|
|
return;
|
|
}
|
|
|
|
add_type_info_type_internal(c, t);
|
|
}
|
|
|
|
gb_internal void add_type_info_type_internal(CheckerContext *c, Type *t) {
|
|
if (t == nullptr || c == nullptr) {
|
|
return;
|
|
}
|
|
|
|
add_type_info_dependency(c->info, c->decl, t);
|
|
#if 0
|
|
MUTEX_GUARD_BLOCK(&c->info->type_info_mutex) {
|
|
if (type_set_update(&c->info->type_info_set, t)) {
|
|
// return;
|
|
}
|
|
|
|
auto found = map_get(&c->info->type_info_map, t);
|
|
if (found != nullptr) {
|
|
// Types have already been added
|
|
return;
|
|
}
|
|
|
|
bool prev = false;
|
|
isize ti_index = -1;
|
|
// NOTE(bill): this is a linear lookup, and is most likely very costly
|
|
// as this map keeps growing linearly
|
|
for (auto const &e : c->info->type_info_map) {
|
|
if (are_types_identical_unique_tuples(t, e.key)) {
|
|
// Duplicate entry
|
|
ti_index = e.value;
|
|
prev = true;
|
|
break;
|
|
}
|
|
}
|
|
if (ti_index < 0) {
|
|
// Unique entry
|
|
// NOTE(bill): map entries grow linearly and in order
|
|
ti_index = c->info->type_info_types.count;
|
|
TypeInfoPair tt = {t, type_hash_canonical_type(t)};
|
|
array_add(&c->info->type_info_types, tt);
|
|
}
|
|
map_set(&c->checker->info.type_info_map, t, ti_index);
|
|
|
|
if (prev) {
|
|
// NOTE(bill): If a previous one exists already, no need to continue
|
|
return;
|
|
}
|
|
}
|
|
|
|
// Add nested types
|
|
|
|
if (t->kind == Type_Named) {
|
|
// NOTE(bill): Just in case
|
|
add_type_info_type_internal(c, t->Named.base);
|
|
return;
|
|
}
|
|
|
|
Type *bt = base_type(t);
|
|
add_type_info_type_internal(c, bt);
|
|
|
|
switch (bt->kind) {
|
|
case Type_Invalid:
|
|
break;
|
|
case Type_Basic:
|
|
switch (bt->Basic.kind) {
|
|
case Basic_cstring:
|
|
add_type_info_type_internal(c, t_u8_ptr);
|
|
break;
|
|
case Basic_string:
|
|
add_type_info_type_internal(c, t_u8_ptr);
|
|
add_type_info_type_internal(c, t_int);
|
|
break;
|
|
case Basic_any:
|
|
add_type_info_type_internal(c, t_type_info_ptr);
|
|
add_type_info_type_internal(c, t_rawptr);
|
|
break;
|
|
case Basic_typeid:
|
|
break;
|
|
|
|
case Basic_complex64:
|
|
add_type_info_type_internal(c, t_type_info_float);
|
|
add_type_info_type_internal(c, t_f32);
|
|
break;
|
|
case Basic_complex128:
|
|
add_type_info_type_internal(c, t_type_info_float);
|
|
add_type_info_type_internal(c, t_f64);
|
|
break;
|
|
case Basic_quaternion128:
|
|
add_type_info_type_internal(c, t_type_info_float);
|
|
add_type_info_type_internal(c, t_f32);
|
|
break;
|
|
case Basic_quaternion256:
|
|
add_type_info_type_internal(c, t_type_info_float);
|
|
add_type_info_type_internal(c, t_f64);
|
|
break;
|
|
}
|
|
break;
|
|
|
|
case Type_BitSet:
|
|
add_type_info_type_internal(c, bt->BitSet.elem);
|
|
add_type_info_type_internal(c, bit_set_to_int(bt));
|
|
break;
|
|
|
|
case Type_Pointer:
|
|
add_type_info_type_internal(c, bt->Pointer.elem);
|
|
break;
|
|
|
|
case Type_MultiPointer:
|
|
add_type_info_type_internal(c, bt->MultiPointer.elem);
|
|
break;
|
|
|
|
case Type_Array:
|
|
add_type_info_type_internal(c, bt->Array.elem);
|
|
add_type_info_type_internal(c, alloc_type_pointer(bt->Array.elem));
|
|
add_type_info_type_internal(c, t_int);
|
|
break;
|
|
|
|
case Type_EnumeratedArray:
|
|
add_type_info_type_internal(c, bt->EnumeratedArray.index);
|
|
add_type_info_type_internal(c, t_int);
|
|
add_type_info_type_internal(c, bt->EnumeratedArray.elem);
|
|
add_type_info_type_internal(c, alloc_type_pointer(bt->EnumeratedArray.elem));
|
|
break;
|
|
|
|
case Type_DynamicArray:
|
|
add_type_info_type_internal(c, bt->DynamicArray.elem);
|
|
add_type_info_type_internal(c, alloc_type_pointer(bt->DynamicArray.elem));
|
|
add_type_info_type_internal(c, t_int);
|
|
add_type_info_type_internal(c, t_allocator);
|
|
break;
|
|
case Type_Slice:
|
|
add_type_info_type_internal(c, bt->Slice.elem);
|
|
add_type_info_type_internal(c, alloc_type_pointer(bt->Slice.elem));
|
|
add_type_info_type_internal(c, t_int);
|
|
break;
|
|
|
|
case Type_FixedCapacityDynamicArray:
|
|
add_type_info_type_internal(c, bt->FixedCapacityDynamicArray.elem);
|
|
add_type_info_type_internal(c, t_int);
|
|
break;
|
|
|
|
case Type_Enum:
|
|
add_type_info_type_internal(c, bt->Enum.base_type);
|
|
break;
|
|
|
|
case Type_Union:
|
|
if (bt->Union.variants_wait_signal.futex.load() == 0)
|
|
return;
|
|
if (union_tag_size(t) > 0) {
|
|
add_type_info_type_internal(c, union_tag_type(t));
|
|
} else {
|
|
add_type_info_type_internal(c, t_type_info_ptr);
|
|
}
|
|
add_type_info_type_internal(c, bt->Union.polymorphic_params);
|
|
for_array(i, bt->Union.variants) {
|
|
add_type_info_type_internal(c, bt->Union.variants[i]);
|
|
}
|
|
if (bt->Union.scope != nullptr) {
|
|
for (auto const &entry : bt->Union.scope->elements) {
|
|
Entity *e = entry.value;
|
|
add_type_info_type_internal(c, e->type);
|
|
}
|
|
}
|
|
break;
|
|
|
|
case Type_Struct:
|
|
if (bt->Struct.fields_wait_signal.futex.load() == 0)
|
|
return;
|
|
if (bt->Struct.scope != nullptr) {
|
|
for (auto const &entry : bt->Struct.scope->elements) {
|
|
Entity *e = entry.value;
|
|
switch (bt->Struct.soa_kind) {
|
|
case StructSoa_Dynamic:
|
|
add_type_info_type_internal(c, t_allocator);
|
|
/*fallthrough*/
|
|
case StructSoa_Slice:
|
|
case StructSoa_Fixed:
|
|
add_type_info_type_internal(c, alloc_type_pointer(e->type));
|
|
break;
|
|
default:
|
|
add_type_info_type_internal(c, e->type);
|
|
break;
|
|
}
|
|
}
|
|
}
|
|
add_type_info_type_internal(c, bt->Struct.polymorphic_params);
|
|
for_array(i, bt->Struct.fields) {
|
|
Entity *f = bt->Struct.fields[i];
|
|
if (f && f->type) {
|
|
add_type_info_type_internal(c, f->type);
|
|
}
|
|
}
|
|
add_comparison_procedures_for_fields(c, bt);
|
|
break;
|
|
|
|
case Type_Map:
|
|
init_map_internal_types(bt);
|
|
add_type_info_type_internal(c, bt->Map.key);
|
|
add_type_info_type_internal(c, bt->Map.value);
|
|
add_type_info_type_internal(c, t_uintptr); // hash value
|
|
add_type_info_type_internal(c, t_allocator);
|
|
break;
|
|
|
|
case Type_Tuple:
|
|
for_array(i, bt->Tuple.variables) {
|
|
Entity *var = bt->Tuple.variables[i];
|
|
add_type_info_type_internal(c, var->type);
|
|
}
|
|
break;
|
|
|
|
case Type_Proc:
|
|
add_type_info_type_internal(c, bt->Proc.params);
|
|
add_type_info_type_internal(c, bt->Proc.results);
|
|
break;
|
|
|
|
case Type_SimdVector:
|
|
add_type_info_type_internal(c, bt->SimdVector.elem);
|
|
break;
|
|
|
|
case Type_Matrix:
|
|
add_type_info_type_internal(c, bt->Matrix.elem);
|
|
break;
|
|
|
|
case Type_SoaPointer:
|
|
add_type_info_type_internal(c, bt->SoaPointer.elem);
|
|
break;
|
|
|
|
case Type_BitField:
|
|
add_type_info_type_internal(c, bt->BitField.backing_type);
|
|
for (Entity *f : bt->BitField.fields) {
|
|
add_type_info_type_internal(c, f->type);
|
|
}
|
|
break;
|
|
|
|
case Type_Generic:
|
|
break;
|
|
|
|
default:
|
|
GB_PANIC("Unhandled type: %*.s %d", LIT(type_strings[bt->kind]), bt->kind);
|
|
break;
|
|
}
|
|
#endif
|
|
}
|
|
|
|
|
|
|
|
gb_global std::atomic<bool> global_procedure_body_in_worker_queue;
|
|
gb_global std::atomic<bool> global_after_checking_procedure_bodies;
|
|
|
|
gb_internal WORKER_TASK_PROC(check_proc_info_worker_proc);
|
|
|
|
gb_internal void check_procedure_later(Checker *c, ProcInfo *info) {
|
|
GB_ASSERT(info != nullptr);
|
|
GB_ASSERT(info->decl != nullptr);
|
|
|
|
if (global_after_checking_procedure_bodies) {
|
|
Entity *e = info->decl->entity;
|
|
debugf("CHECK PROCEDURE LATER! %.*s :: %s {...}\n", LIT(e->token.string), type_to_string(e->type));
|
|
}
|
|
|
|
if (global_procedure_body_in_worker_queue.load()) {
|
|
thread_pool_add_task(check_proc_info_worker_proc, info);
|
|
} else {
|
|
mutex_lock(&c->procs_to_check_mutex);
|
|
array_add(&c->procs_to_check, info);
|
|
mutex_unlock(&c->procs_to_check_mutex);
|
|
}
|
|
|
|
if (DEBUG_CHECK_ALL_PROCEDURES) {
|
|
GB_ASSERT(info != nullptr);
|
|
GB_ASSERT(info->decl != nullptr);
|
|
mpsc_enqueue(&c->info.all_procedures_queue, info);
|
|
}
|
|
}
|
|
|
|
gb_internal void check_procedure_later(Checker *c, AstFile *file, Token token, DeclInfo *decl, Type *type, Ast *body, u64 tags) {
|
|
ProcInfo *info = permanent_alloc_item<ProcInfo>();
|
|
info->file = file;
|
|
info->token = token;
|
|
info->decl = decl;
|
|
info->type = type;
|
|
info->body = body;
|
|
info->tags = tags;
|
|
check_procedure_later(c, info);
|
|
}
|
|
|
|
|
|
gb_global Entity *min_dep_basic_equal_procs[Basic_COUNT];
|
|
|
|
gb_internal void add_dependency_to_set_threaded(Checker *c, Entity *entity);
|
|
|
|
gb_internal void add_min_dep_equal_procedures(Checker *c, Type *t) {
|
|
t = base_type(t);
|
|
if (t == nullptr || !is_type_comparable(t)) {
|
|
return;
|
|
}
|
|
switch (t->kind) {
|
|
case Type_Basic:
|
|
add_dependency_to_set_threaded(c, min_dep_basic_equal_procs[t->Basic.kind]);
|
|
break;
|
|
case Type_Struct:
|
|
for (Entity *f : t->Struct.fields) {
|
|
add_min_dep_equal_procedures(c, f->type);
|
|
}
|
|
break;
|
|
case Type_Union:
|
|
for (Type *v : t->Union.variants) {
|
|
add_min_dep_equal_procedures(c, v);
|
|
}
|
|
break;
|
|
case Type_Array:
|
|
add_min_dep_equal_procedures(c, t->Array.elem);
|
|
break;
|
|
case Type_EnumeratedArray:
|
|
add_min_dep_equal_procedures(c, t->EnumeratedArray.elem);
|
|
break;
|
|
}
|
|
}
|
|
|
|
gb_internal void add_min_dep_type_info(Checker *c, Type *t) {
|
|
if (t == nullptr) {
|
|
return;
|
|
}
|
|
t = default_type(t);
|
|
if (is_type_untyped(t)) {
|
|
return; // Could be nil
|
|
}
|
|
if (is_type_polymorphic(base_type(t))) {
|
|
return;
|
|
}
|
|
|
|
// Each `Type *` is claimed once and collected per thread, as the shared set's lock was most of the time; identical
|
|
// types are walked once for each `Type *` and deduplicated after the walk
|
|
if (t->flags.load(std::memory_order_relaxed) & TypeFlag_InMinDepTypeInfoSet) {
|
|
return;
|
|
}
|
|
if (t->flags.fetch_or(TypeFlag_InMinDepTypeInfoSet, std::memory_order_relaxed) & TypeFlag_InMinDepTypeInfoSet) {
|
|
return;
|
|
}
|
|
per_thread_array_add(&c->info.min_dep_type_info_queue, TypeInfoPair{t, 0});
|
|
|
|
// Add nested types
|
|
if (t->kind == Type_Named) {
|
|
// NOTE(bill): Just in case
|
|
add_min_dep_type_info(c, t->Named.base);
|
|
return;
|
|
}
|
|
|
|
Type *bt = base_type(t);
|
|
add_min_dep_type_info(c, bt);
|
|
|
|
switch (bt->kind) {
|
|
case Type_Invalid:
|
|
break;
|
|
case Type_Basic:
|
|
switch (bt->Basic.kind) {
|
|
case Basic_string:
|
|
add_min_dep_type_info(c, t_u8_ptr);
|
|
add_min_dep_type_info(c, t_int);
|
|
break;
|
|
case Basic_any:
|
|
add_min_dep_type_info(c, t_rawptr);
|
|
add_min_dep_type_info(c, t_typeid);
|
|
break;
|
|
|
|
case Basic_complex64:
|
|
add_min_dep_type_info(c, t_type_info_float);
|
|
add_min_dep_type_info(c, t_f32);
|
|
break;
|
|
case Basic_complex128:
|
|
add_min_dep_type_info(c, t_type_info_float);
|
|
add_min_dep_type_info(c, t_f64);
|
|
break;
|
|
case Basic_quaternion128:
|
|
add_min_dep_type_info(c, t_type_info_float);
|
|
add_min_dep_type_info(c, t_f32);
|
|
break;
|
|
case Basic_quaternion256:
|
|
add_min_dep_type_info(c, t_type_info_float);
|
|
add_min_dep_type_info(c, t_f64);
|
|
break;
|
|
}
|
|
break;
|
|
|
|
case Type_BitSet:
|
|
add_min_dep_type_info(c, bt->BitSet.elem);
|
|
add_min_dep_type_info(c, bit_set_to_int(bt));
|
|
break;
|
|
|
|
case Type_Pointer:
|
|
add_min_dep_type_info(c, bt->Pointer.elem);
|
|
break;
|
|
|
|
case Type_MultiPointer:
|
|
add_min_dep_type_info(c, bt->MultiPointer.elem);
|
|
break;
|
|
|
|
case Type_Array:
|
|
add_min_dep_type_info(c, bt->Array.elem);
|
|
add_min_dep_type_info(c, alloc_type_pointer(bt->Array.elem));
|
|
add_min_dep_type_info(c, t_int);
|
|
break;
|
|
case Type_EnumeratedArray:
|
|
add_min_dep_type_info(c, bt->EnumeratedArray.index);
|
|
add_min_dep_type_info(c, t_int);
|
|
add_min_dep_type_info(c, bt->EnumeratedArray.elem);
|
|
add_min_dep_type_info(c, alloc_type_pointer(bt->EnumeratedArray.elem));
|
|
break;
|
|
|
|
case Type_DynamicArray:
|
|
add_min_dep_type_info(c, bt->DynamicArray.elem);
|
|
add_min_dep_type_info(c, alloc_type_pointer(bt->DynamicArray.elem));
|
|
add_min_dep_type_info(c, t_int);
|
|
add_min_dep_type_info(c, t_allocator);
|
|
break;
|
|
case Type_Slice:
|
|
add_min_dep_type_info(c, bt->Slice.elem);
|
|
add_min_dep_type_info(c, alloc_type_pointer(bt->Slice.elem));
|
|
add_min_dep_type_info(c, t_int);
|
|
break;
|
|
|
|
case Type_FixedCapacityDynamicArray:
|
|
add_min_dep_type_info(c, bt->FixedCapacityDynamicArray.elem);
|
|
add_min_dep_type_info(c, alloc_type_pointer(bt->FixedCapacityDynamicArray.elem));
|
|
add_min_dep_type_info(c, alloc_type_array(bt->FixedCapacityDynamicArray.elem, bt->FixedCapacityDynamicArray.capacity));
|
|
add_min_dep_type_info(c, t_int);
|
|
break;
|
|
|
|
case Type_Enum:
|
|
add_min_dep_type_info(c, bt->Enum.base_type);
|
|
break;
|
|
|
|
case Type_Union:
|
|
if (union_tag_size(t) > 0) {
|
|
add_min_dep_type_info(c, union_tag_type(t));
|
|
} else {
|
|
add_min_dep_type_info(c, t_type_info_ptr);
|
|
}
|
|
for_array(i, bt->Union.variants) {
|
|
add_min_dep_type_info(c, bt->Union.variants[i]);
|
|
}
|
|
if (is_type_comparable(bt) && !is_type_simple_compare(bt)) {
|
|
add_min_dep_equal_procedures(c, bt);
|
|
}
|
|
break;
|
|
|
|
case Type_Struct:
|
|
if (bt->Struct.scope != nullptr) {
|
|
for (auto const &entry : bt->Struct.scope->elements) {
|
|
Entity *e = entry.value;
|
|
if (bt->Struct.soa_kind == StructSoa_None && e->kind != Entity_Variable) {
|
|
continue; // polymorphic parameters, which no type info refers to
|
|
}
|
|
switch (bt->Struct.soa_kind) {
|
|
case StructSoa_Dynamic:
|
|
add_min_dep_type_info(c, t_type_info_ptr); // append_soa
|
|
|
|
add_min_dep_type_info(c, t_allocator);
|
|
/*fallthrough*/
|
|
case StructSoa_Slice:
|
|
add_min_dep_type_info(c, t_int);
|
|
add_min_dep_type_info(c, t_uint);
|
|
/*fallthrough*/
|
|
case StructSoa_Fixed:
|
|
add_min_dep_type_info(c, alloc_type_pointer(e->type));
|
|
break;
|
|
default:
|
|
add_min_dep_type_info(c, e->type);
|
|
break;
|
|
}
|
|
}
|
|
}
|
|
for_array(i, bt->Struct.fields) {
|
|
Entity *f = bt->Struct.fields[i];
|
|
add_min_dep_type_info(c, f->type);
|
|
}
|
|
if (is_type_comparable(bt) && !is_type_simple_compare(bt)) {
|
|
add_min_dep_equal_procedures(c, bt);
|
|
}
|
|
break;
|
|
|
|
case Type_Map:
|
|
init_map_internal_types(bt);
|
|
add_min_dep_equal_procedures(c, bt->Map.key);
|
|
add_min_dep_type_info(c, bt->Map.key);
|
|
add_min_dep_type_info(c, bt->Map.value);
|
|
add_min_dep_type_info(c, t_uintptr); // hash value
|
|
add_min_dep_type_info(c, t_allocator);
|
|
break;
|
|
|
|
case Type_Tuple:
|
|
for_array(i, bt->Tuple.variables) {
|
|
Entity *var = bt->Tuple.variables[i];
|
|
add_min_dep_type_info(c, var->type);
|
|
}
|
|
break;
|
|
|
|
case Type_Proc:
|
|
add_min_dep_type_info(c, bt->Proc.params);
|
|
add_min_dep_type_info(c, bt->Proc.results);
|
|
break;
|
|
|
|
case Type_SimdVector:
|
|
add_min_dep_type_info(c, bt->SimdVector.elem);
|
|
break;
|
|
|
|
case Type_Matrix:
|
|
add_min_dep_type_info(c, bt->Matrix.elem);
|
|
break;
|
|
|
|
case Type_SoaPointer:
|
|
add_min_dep_type_info(c, bt->SoaPointer.elem);
|
|
break;
|
|
|
|
case Type_BitField:
|
|
add_min_dep_type_info(c, bt->BitField.backing_type);
|
|
for (Entity *f : bt->BitField.fields) {
|
|
add_min_dep_type_info(c, f->type);
|
|
}
|
|
break;
|
|
|
|
default:
|
|
GB_PANIC("Unhandled type: %*.s", LIT(type_strings[bt->kind]));
|
|
break;
|
|
}
|
|
}
|
|
|
|
gb_internal void add_dependency_to_set_threaded(Checker *c, Entity *entity);
|
|
|
|
gb_global std::atomic<Checker *> global_checker_ptr;
|
|
|
|
gb_internal void add_dependency_to_set(Checker *c, Entity *entity) {
|
|
if (entity == nullptr) {
|
|
return;
|
|
}
|
|
|
|
if (entity->type != nullptr &&
|
|
is_type_polymorphic(entity->type)) {
|
|
DeclInfo *decl = decl_info_of_entity(entity);
|
|
if (decl != nullptr && decl->gen_proc_type == nullptr) {
|
|
return;
|
|
}
|
|
}
|
|
|
|
if (entity->min_dep_count.fetch_add(1, std::memory_order_relaxed) > 0) {
|
|
return;
|
|
}
|
|
|
|
DeclInfo *decl = decl_info_of_entity(entity);
|
|
if (decl == nullptr) {
|
|
return;
|
|
}
|
|
for (TypeInfoPair const tt : decl->type_info_deps) {
|
|
add_min_dep_type_info(c, tt.type);
|
|
}
|
|
FOR_PTR_SET(e, decl->deps) {
|
|
switch (e->kind) {
|
|
case Entity_Procedure:
|
|
if (e->Procedure.is_foreign) {
|
|
Entity *fl = e->Procedure.foreign_library;
|
|
if (fl != nullptr) {
|
|
GB_ASSERT_MSG(fl->kind == Entity_LibraryName &&
|
|
(fl->flags&EntityFlag_Used),
|
|
"%.*s", LIT(entity->token.string));
|
|
add_dependency_to_set(c, fl);
|
|
}
|
|
}
|
|
break;
|
|
case Entity_Variable:
|
|
if (e->Variable.is_foreign) {
|
|
Entity *fl = e->Variable.foreign_library;
|
|
if (fl != nullptr) {
|
|
GB_ASSERT_MSG(fl->kind == Entity_LibraryName &&
|
|
(fl->flags&EntityFlag_Used),
|
|
"%.*s", LIT(entity->token.string));
|
|
add_dependency_to_set(c, fl);
|
|
}
|
|
}
|
|
break;
|
|
}
|
|
}
|
|
|
|
FOR_PTR_SET(e, decl->deps) {
|
|
add_dependency_to_set(c, e);
|
|
}
|
|
|
|
}
|
|
gb_internal bool min_dep_visit(Entity *entity) {
|
|
if (entity->type != nullptr &&
|
|
is_type_polymorphic(entity->type)) {
|
|
DeclInfo *decl = decl_info_of_entity(entity);
|
|
if (decl != nullptr && decl->gen_proc_type == nullptr) {
|
|
return false;
|
|
}
|
|
}
|
|
return entity->min_dep_count.fetch_add(1, std::memory_order_relaxed) == 0;
|
|
}
|
|
|
|
gb_internal void min_dep_push(Array<Entity *> *stack, Entity *e) {
|
|
if (e->min_dep_count.load(std::memory_order_relaxed) != 0) {
|
|
return;
|
|
}
|
|
if (e->decl_info == nullptr) {
|
|
(void)min_dep_visit(e);
|
|
} else {
|
|
array_add(stack, e);
|
|
}
|
|
}
|
|
|
|
|
|
gb_internal WORKER_TASK_PROC(add_dependency_to_set_worker) {
|
|
// NOTE(bill): a task walks from its own stack of entities, and hands half of it to a new task once it is large,
|
|
// as with a task for each dependency, adding the tasks was most of the work
|
|
enum { MIN_DEP_TASK_SPLIT = 16 };
|
|
|
|
Checker *c = global_checker_ptr.load(std::memory_order_relaxed);
|
|
Array<Entity *> *stack = cast(Array<Entity *> *)data;
|
|
|
|
while (stack->count > 0) {
|
|
Entity *entity = array_pop(stack);
|
|
if (entity == nullptr || !min_dep_visit(entity)) {
|
|
continue;
|
|
}
|
|
DeclInfo *decl = decl_info_of_entity(entity);
|
|
if (decl == nullptr) {
|
|
continue;
|
|
}
|
|
for (TypeInfoPair const tt : decl->type_info_deps) {
|
|
add_min_dep_type_info(c, tt.type);
|
|
}
|
|
|
|
FOR_PTR_SET(e, decl->deps) {
|
|
Entity *fl = nullptr;
|
|
switch (e->kind) {
|
|
case Entity_Procedure:
|
|
if (e->Procedure.is_foreign) {
|
|
fl = e->Procedure.foreign_library;
|
|
}
|
|
break;
|
|
case Entity_Variable:
|
|
if (e->Variable.is_foreign) {
|
|
fl = e->Variable.foreign_library;
|
|
}
|
|
break;
|
|
}
|
|
if (fl != nullptr) {
|
|
GB_ASSERT_MSG(fl->kind == Entity_LibraryName &&
|
|
(fl->flags&EntityFlag_Used),
|
|
"%.*s", LIT(entity->token.string));
|
|
min_dep_push(stack, fl);
|
|
}
|
|
min_dep_push(stack, e);
|
|
}
|
|
|
|
if (stack->count >= MIN_DEP_TASK_SPLIT) {
|
|
isize half = stack->count/2;
|
|
Array<Entity *> *other = gb_alloc_item(heap_allocator(), Array<Entity *>);
|
|
array_init(other, heap_allocator(), 0, MIN_DEP_TASK_SPLIT);
|
|
array_add_elems(other, stack->data, half);
|
|
gb_memmove(stack->data, stack->data + half, (stack->count - half)*gb_size_of(Entity *));
|
|
stack->count -= half;
|
|
thread_pool_add_task(add_dependency_to_set_worker, other);
|
|
}
|
|
}
|
|
|
|
array_free(stack);
|
|
gb_free(heap_allocator(), stack);
|
|
return 0;
|
|
}
|
|
|
|
|
|
gb_internal void add_dependency_to_set_threaded(Checker *c, Entity *entity) {
|
|
if (entity == nullptr || entity->min_dep_count.load(std::memory_order_relaxed) > 0) {
|
|
return;
|
|
}
|
|
Array<Entity *> *stack = gb_alloc_item(heap_allocator(), Array<Entity *>);
|
|
array_init(stack, heap_allocator(), 0, 64);
|
|
array_add(stack, entity);
|
|
thread_pool_add_task(add_dependency_to_set_worker, stack);
|
|
}
|
|
|
|
|
|
gb_internal void force_add_dependency_entity(Checker *c, Scope *scope, String const &name) {
|
|
u32 hash = 0;
|
|
auto interned = string_interner_insert(name, 0, &hash);
|
|
Entity *e = scope_lookup(scope, interned, hash);
|
|
if (e == nullptr) {
|
|
return;
|
|
}
|
|
GB_ASSERT_MSG(e != nullptr, "unable to find %.*s", LIT(name));
|
|
e->flags |= EntityFlag_Used;
|
|
add_dependency_to_set(c, e);
|
|
}
|
|
|
|
gb_internal void collect_testing_procedures_of_package(Checker *c, AstPackage *pkg) {
|
|
AstPackage *testing_package = get_core_package(&c->info, str_lit("testing"));
|
|
Scope *testing_scope = testing_package->scope;
|
|
u32 hash = 0;
|
|
InternedString interned = string_interner_insert(str_lit("Test_Signature"), 0, &hash);
|
|
Entity *test_signature = scope_lookup_current(testing_scope, interned, hash);
|
|
|
|
for_array(i, c->info.entities) {
|
|
Entity *e = c->info.entities[i];
|
|
if (e->pkg != pkg) {
|
|
continue;
|
|
}
|
|
if (e->kind != Entity_Procedure) {
|
|
continue;
|
|
}
|
|
|
|
if ((e->flags & EntityFlag_Test) == 0) {
|
|
continue;
|
|
}
|
|
|
|
String name = e->token.string;
|
|
|
|
bool is_tester = true;
|
|
|
|
Type *t = base_type(e->type);
|
|
GB_ASSERT(t->kind == Type_Proc);
|
|
if (are_types_identical(t, base_type(test_signature->type))) {
|
|
// Good
|
|
} else {
|
|
gbString str = type_to_string(t);
|
|
error(e->token, "Testing procedures must have a signature type of proc(^testing.T), got %s", str);
|
|
gb_string_free(str);
|
|
is_tester = false;
|
|
}
|
|
|
|
if (is_tester) {
|
|
add_dependency_to_set(c, e);
|
|
array_add(&c->info.testing_procedures, e);
|
|
}
|
|
}
|
|
}
|
|
|
|
gb_internal WORKER_TASK_PROC(add_definitions_to_set_worker) {
|
|
Checker *c = global_checker_ptr.load(std::memory_order_relaxed);
|
|
Scope *builtin_scope = builtin_pkg->scope;
|
|
for (Entity *e : *cast(Slice<Entity *> *)data) {
|
|
if (e->scope == builtin_scope) {
|
|
if (e->type == nullptr) {
|
|
add_dependency_to_set_threaded(c, e);
|
|
}
|
|
} else if (e->kind == Entity_Procedure) {
|
|
if (e->Procedure.is_export) {
|
|
add_dependency_to_set_threaded(c, e);
|
|
}
|
|
} else if (e->kind == Entity_Variable) {
|
|
if (e->Variable.is_export) {
|
|
add_dependency_to_set_threaded(c, e);
|
|
}
|
|
}
|
|
}
|
|
return 0;
|
|
}
|
|
|
|
gb_internal void generate_minimum_dependency_set_internal(Checker *c, Entity *start) {
|
|
// auto const &add_to_set = add_dependency_to_set;
|
|
auto const &add_to_set = add_dependency_to_set_threaded;
|
|
|
|
for (Entity *e; mpsc_dequeue(&c->info.required_foreign_imports_through_force_queue, &e); /**/) {
|
|
array_add(&c->info.required_foreign_imports_through_force, e);
|
|
add_to_set(c, e);
|
|
}
|
|
|
|
for (Entity *e; mpsc_dequeue(&c->info.required_global_variable_queue, &e); /**/) {
|
|
e->flags |= EntityFlag_Used;
|
|
add_to_set(c, e);
|
|
}
|
|
|
|
for_array(i, c->info.entities) {
|
|
Entity *e = c->info.entities[i];
|
|
switch (e->kind) {
|
|
case Entity_Variable:
|
|
if (e->Variable.is_export) {
|
|
add_to_set(c, e);
|
|
} else if (e->flags & EntityFlag_Require) {
|
|
add_to_set(c, e);
|
|
}
|
|
break;
|
|
case Entity_Procedure:
|
|
if (e->Procedure.is_export) {
|
|
add_to_set(c, e);
|
|
} else if (e->flags & EntityFlag_Require) {
|
|
add_to_set(c, e);
|
|
}
|
|
if (e->flags & EntityFlag_Init) {
|
|
Type *t = base_type(e->type);
|
|
GB_ASSERT(t->kind == Type_Proc);
|
|
|
|
bool is_init = true;
|
|
|
|
if (t->Proc.param_count != 0 || t->Proc.result_count != 0) {
|
|
gbString str = type_to_string(t);
|
|
error(e->token, "@(init) procedures must have a signature type with no parameters nor results, got %s", str);
|
|
gb_string_free(str);
|
|
is_init = false;
|
|
}
|
|
|
|
u64 feature_flags = check_feature_flags(e);
|
|
if ((feature_flags & OptInFeatureFlag_GlobalContext) == 0) {
|
|
if (t->Proc.calling_convention != ProcCC_Contextless) {
|
|
ERROR_BLOCK();
|
|
error(e->token, "@(init) procedures must be declared as \"contextless\"");
|
|
error_line("\tSuggestion: this can be bypassed, for the time being, with '#+feature global-context'");
|
|
}
|
|
}
|
|
|
|
if ((e->scope->flags & (ScopeFlag_File|ScopeFlag_Pkg)) == 0) {
|
|
error(e->token, "@(init) procedures must be declared at the file scope");
|
|
is_init = false;
|
|
}
|
|
|
|
if ((e->flags & EntityFlag_Disabled) != 0) {
|
|
warning(e->token, "This @(init) procedure is disabled; you must call it manually");
|
|
is_init = false;
|
|
}
|
|
|
|
if (is_blank_ident(e->token)) {
|
|
error(e->token, "An @(init) procedure must not use a blank identifier as its name");
|
|
}
|
|
|
|
|
|
if (is_init) {
|
|
add_to_set(c, e);
|
|
array_add(&c->info.init_procedures, e);
|
|
}
|
|
} else if (e->flags & EntityFlag_Fini) {
|
|
Type *t = base_type(e->type);
|
|
GB_ASSERT(t->kind == Type_Proc);
|
|
|
|
bool is_fini = true;
|
|
|
|
if (t->Proc.param_count != 0 || t->Proc.result_count != 0) {
|
|
gbString str = type_to_string(t);
|
|
error(e->token, "@(fini) procedures must have a signature type with no parameters nor results, got %s", str);
|
|
gb_string_free(str);
|
|
is_fini = false;
|
|
}
|
|
|
|
u64 feature_flags = check_feature_flags(e);
|
|
if ((feature_flags & OptInFeatureFlag_GlobalContext) == 0) {
|
|
if (t->Proc.calling_convention != ProcCC_Contextless) {
|
|
ERROR_BLOCK();
|
|
error(e->token, "@(fini) procedures must be declared as \"contextless\"");
|
|
error_line("\tSuggestion: this can be bypassed, for the time being, with '#+feature global-context'");
|
|
}
|
|
}
|
|
|
|
if ((e->scope->flags & (ScopeFlag_File|ScopeFlag_Pkg)) == 0) {
|
|
error(e->token, "@(fini) procedures must be declared at the file scope");
|
|
is_fini = false;
|
|
}
|
|
|
|
if (is_blank_ident(e->token)) {
|
|
error(e->token, "An @(fini) procedure must not use a blank identifier as its name");
|
|
}
|
|
|
|
if (is_fini) {
|
|
add_to_set(c, e);
|
|
array_add(&c->info.fini_procedures, e);
|
|
}
|
|
}
|
|
break;
|
|
}
|
|
}
|
|
|
|
if (build_context.command_kind == Command_test) {
|
|
AstPackage *testing_package = get_core_package(&c->info, str_lit("testing"));
|
|
Scope *testing_scope = testing_package->scope;
|
|
|
|
// Add all of testing library as a dependency
|
|
for (auto const &entry : testing_scope->elements) {
|
|
Entity *e = entry.value;
|
|
if (e != nullptr) {
|
|
e->flags |= EntityFlag_Used;
|
|
add_to_set(c, e);
|
|
}
|
|
}
|
|
|
|
AstPackage *pkg = c->info.init_package;
|
|
collect_testing_procedures_of_package(c, pkg);
|
|
|
|
if (build_context.test_all_packages) {
|
|
for (auto const &entry : c->info.packages) {
|
|
AstPackage *pkg = entry.value;
|
|
collect_testing_procedures_of_package(c, pkg);
|
|
}
|
|
}
|
|
} else if (start != nullptr) {
|
|
start->flags |= EntityFlag_Used;
|
|
add_to_set(c, start);
|
|
}
|
|
}
|
|
|
|
gb_internal void generate_minimum_dependency_set(Checker *c, Entity *start) {
|
|
#define FORCE_ADD_RUNTIME_ENTITIES(condition, ...) do { \
|
|
if (condition) { \
|
|
String entities[] = {__VA_ARGS__}; \
|
|
for (isize i = 0; i < gb_count_of(entities); i++) { \
|
|
force_add_dependency_entity(c, c->info.runtime_package->scope, entities[i]); \
|
|
} \
|
|
} \
|
|
} while (0)
|
|
|
|
// required runtime entities
|
|
FORCE_ADD_RUNTIME_ENTITIES(true,
|
|
// Odin types
|
|
str_lit("Source_Code_Location"),
|
|
str_lit("Context"),
|
|
str_lit("Allocator"),
|
|
str_lit("Logger"),
|
|
|
|
// Odin internal procedures
|
|
str_lit("__init_context"),
|
|
// str_lit("cstring_to_string"),
|
|
str_lit("_cleanup_runtime"),
|
|
|
|
// Pseudo-CRT required procedures
|
|
str_lit("memset"),
|
|
|
|
// Utility procedures
|
|
str_lit("memory_equal"),
|
|
str_lit("memory_compare"),
|
|
str_lit("memory_compare_zero"),
|
|
);
|
|
|
|
// Only required if no CRT is present
|
|
FORCE_ADD_RUNTIME_ENTITIES(build_context.no_crt,
|
|
str_lit("memcpy"),
|
|
str_lit("memmove"),
|
|
);
|
|
|
|
FORCE_ADD_RUNTIME_ENTITIES(build_context.metrics.arch == TargetArch_arm32,
|
|
str_lit("aeabi_d2h")
|
|
);
|
|
|
|
FORCE_ADD_RUNTIME_ENTITIES(is_arch_wasm(),
|
|
// // Extended data type internal procedures
|
|
// str_lit("umodti3"),
|
|
// str_lit("udivti3"),
|
|
// str_lit("modti3"),
|
|
// str_lit("divti3"),
|
|
// str_lit("fixdfti"),
|
|
// str_lit("fixunsdfti"),
|
|
// str_lit("fixunsdfdi"),
|
|
// str_lit("floattidf"),
|
|
// str_lit("floattidf_unsigned"),
|
|
// str_lit("truncsfhf2"),
|
|
// str_lit("truncdfhf2"),
|
|
// str_lit("gnu_h2f_ieee"),
|
|
// str_lit("gnu_f2h_ieee"),
|
|
// str_lit("extendhfsf2"),
|
|
|
|
// WASM Specific
|
|
str_lit("__ashlti3"),
|
|
str_lit("__multi3"),
|
|
str_lit("__lshrti3"),
|
|
);
|
|
|
|
FORCE_ADD_RUNTIME_ENTITIES(!build_context.no_rtti,
|
|
// Odin types
|
|
str_lit("Type_Info"),
|
|
|
|
// Global variables
|
|
str_lit("type_table"),
|
|
str_lit("__type_info_of"),
|
|
);
|
|
|
|
FORCE_ADD_RUNTIME_ENTITIES(!build_context.no_entry_point,
|
|
// Global variables
|
|
str_lit("args__"),
|
|
);
|
|
|
|
FORCE_ADD_RUNTIME_ENTITIES((build_context.no_crt && !is_arch_wasm()),
|
|
// NOTE(bill): Only if these exist
|
|
str_lit("_tls_index"),
|
|
str_lit("_fltused"),
|
|
);
|
|
|
|
FORCE_ADD_RUNTIME_ENTITIES(!build_context.no_bounds_check,
|
|
// Bounds checking related procedures
|
|
str_lit("bounds_check_error"),
|
|
str_lit("matrix_bounds_check_error"),
|
|
str_lit("slice_expr_error_hi"),
|
|
str_lit("slice_expr_error_lo_hi"),
|
|
str_lit("multi_pointer_slice_expr_error"),
|
|
);
|
|
|
|
FORCE_ADD_RUNTIME_ENTITIES(c->info.objc_class_implementations.count.load(std::memory_order_relaxed) > 0,
|
|
str_lit("objc_lookUpClass"),
|
|
str_lit("sel_registerName"),
|
|
str_lit("objc_allocateClassPair"),
|
|
str_lit("objc_registerClassPair"),
|
|
str_lit("class_addMethod"),
|
|
str_lit("class_addIvar"),
|
|
str_lit("class_getInstanceVariable"),
|
|
str_lit("ivar_getOffset"),
|
|
str_lit("object_getClass"),
|
|
);
|
|
|
|
|
|
{ // init min dep basic equal procs
|
|
struct { BasicKind kind; char const *name; } const procs[] = {
|
|
{Basic_complex32, "complex32_eq"},
|
|
{Basic_complex64, "complex64_eq"},
|
|
{Basic_complex128, "complex128_eq"},
|
|
{Basic_quaternion64, "quaternion64_eq"},
|
|
{Basic_quaternion128, "quaternion128_eq"},
|
|
{Basic_quaternion256, "quaternion256_eq"},
|
|
{Basic_cstring, "cstring_eq"},
|
|
{Basic_string, "string_eq"},
|
|
{Basic_cstring16, "cstring16_eq"},
|
|
{Basic_string16, "string16_eq"},
|
|
};
|
|
for (auto const &p : procs) {
|
|
u32 hash = 0;
|
|
InternedString key = string_interner_insert(make_string_c(p.name), 0, &hash);
|
|
min_dep_basic_equal_procs[p.kind] = scope_lookup(c->info.runtime_package->scope, key, hash);
|
|
}
|
|
}
|
|
|
|
|
|
add_dependency_to_set(c, c->info.instrumentation_enter_entity);
|
|
add_dependency_to_set(c, c->info.instrumentation_exit_entity);
|
|
|
|
// NOTE(bill): This can be done in parallel as nearly all definitions are of locals which add nothing
|
|
isize const CHUNK_SIZE = 4096;
|
|
auto chunks = array_make<Slice<Entity *> >(heap_allocator(), 0, c->info.definitions.count/CHUNK_SIZE + 1);
|
|
defer (array_free(&chunks));
|
|
for (isize i = 0; i < c->info.definitions.count; i += CHUNK_SIZE) {
|
|
array_add(&chunks, slice(slice_from_array(c->info.definitions), i, gb_min(i + CHUNK_SIZE, c->info.definitions.count)));
|
|
}
|
|
for (Slice<Entity *> &chunk : chunks) {
|
|
thread_pool_add_task(add_definitions_to_set_worker, &chunk);
|
|
}
|
|
|
|
generate_minimum_dependency_set_internal(c, start);
|
|
|
|
thread_pool_wait();
|
|
|
|
|
|
#undef FORCE_ADD_RUNTIME_ENTITIES
|
|
}
|
|
|
|
gb_internal gb_inline bool is_entity_a_dependency(Entity *e) {
|
|
switch (e->kind) {
|
|
case Entity_Procedure:
|
|
return true;
|
|
case Entity_Constant:
|
|
case Entity_Variable:
|
|
return e->pkg != nullptr;
|
|
case Entity_TypeName:
|
|
return false;
|
|
}
|
|
return false;
|
|
}
|
|
|
|
struct EntityGraphEdgesWork {
|
|
PtrMap<Entity *, EntityGraphNode *> *vars;
|
|
Slice<EntityGraphNode *> nodes;
|
|
std::atomic<isize> next;
|
|
};
|
|
|
|
// NOTE(bill): A variable depends on every variable reachable from its declaration through procedures and constants,
|
|
// as its initializer may read any of them. Variables are not walked through, as they are ordered by their own edges.
|
|
// Each node's search only reads, and only writes its own successors, so the searches run in parallel.
|
|
gb_internal WORKER_TASK_PROC(generate_entity_dependency_graph_edges_worker) {
|
|
EntityGraphEdgesWork *work = cast(EntityGraphEdgesWork *)data;
|
|
|
|
PtrSet<Entity *> visited = {};
|
|
defer (ptr_set_destroy(&visited));
|
|
auto visited_list = array_make<Entity *>(heap_allocator(), 0, 64);
|
|
auto visited_slots = array_make<isize>(heap_allocator(), 0, 64);
|
|
defer (array_free(&visited_list));
|
|
defer (array_free(&visited_slots));
|
|
auto stack = array_make<Entity *>(heap_allocator(), 0, 64);
|
|
defer (array_free(&stack));
|
|
|
|
for (;;) {
|
|
isize index = work->next.fetch_add(1, std::memory_order_relaxed);
|
|
if (index >= work->nodes.count) {
|
|
break;
|
|
}
|
|
EntityGraphNode *n = work->nodes[index];
|
|
|
|
if (visited_list.count*4 < cast(isize)visited.capacity) {
|
|
array_clear(&visited_slots);
|
|
for (Entity *e : visited_list) {
|
|
array_add(&visited_slots, ptr_set__find(&visited, e));
|
|
}
|
|
for (isize slot : visited_slots) {
|
|
visited.keys[slot] = nullptr;
|
|
}
|
|
visited.count = 0;
|
|
} else {
|
|
ptr_set_clear(&visited);
|
|
}
|
|
array_clear(&visited_list);
|
|
array_clear(&stack);
|
|
|
|
DeclInfo *decl = decl_info_of_entity(n->entity);
|
|
if (decl == nullptr) {
|
|
continue;
|
|
}
|
|
FOR_PTR_SET(dep, decl->deps) {
|
|
array_add(&stack, dep);
|
|
}
|
|
|
|
while (stack.count > 0) {
|
|
Entity *dep = array_pop(&stack);
|
|
GB_ASSERT(dep != nullptr);
|
|
if (dep->flags & EntityFlag_Field) {
|
|
continue;
|
|
}
|
|
if (!is_entity_a_dependency(dep)) {
|
|
continue;
|
|
}
|
|
if (dep->kind == Entity_Variable) {
|
|
EntityGraphNode **m = map_get(work->vars, dep);
|
|
// NOTE(bill): a variable naming itself, e.g. `t: struct { next: ^type_of(t) }`, is not an initialization cycle
|
|
if (m != nullptr && *m != n) {
|
|
entity_graph_node_set_add(&n->succ, *m);
|
|
}
|
|
continue;
|
|
}
|
|
if (ptr_set_update(&visited, dep)) {
|
|
continue;
|
|
}
|
|
array_add(&visited_list, dep);
|
|
DeclInfo *dep_decl = decl_info_of_entity(dep);
|
|
if (dep_decl != nullptr) {
|
|
FOR_PTR_SET(next, dep_decl->deps) {
|
|
array_add(&stack, next);
|
|
}
|
|
}
|
|
}
|
|
}
|
|
return 0;
|
|
}
|
|
|
|
struct EntityGraphVariablesChunk {
|
|
Slice<Entity *> entities;
|
|
Array<Entity *> variables;
|
|
};
|
|
|
|
gb_internal WORKER_TASK_PROC(generate_entity_dependency_graph_variables_worker) {
|
|
EntityGraphVariablesChunk *chunk = cast(EntityGraphVariablesChunk *)data;
|
|
for (Entity *e : chunk->entities) {
|
|
if (e != nullptr && e->kind == Entity_Variable && is_entity_a_dependency(e)) {
|
|
array_add(&chunk->variables, e);
|
|
}
|
|
}
|
|
return 0;
|
|
}
|
|
|
|
struct EntityGraph {
|
|
PtrMap<Entity *, EntityGraphNode *> vars;
|
|
Array<EntityGraphNode *> nodes;
|
|
EntityGraphEdgesWork edges_work;
|
|
TaskGroup edges;
|
|
};
|
|
|
|
// The nodes, one for each global variable, in the order of the entities
|
|
gb_internal void generate_entity_dependency_graph_nodes(EntityGraph *g, CheckerInfo *info, Arena *arena) {
|
|
// NOTE: the entities are looked through in parallel, as reading each to find the few variables was most of the
|
|
// time, and the nodes are then made in the same order as before
|
|
isize const CHUNK_SIZE = 1024;
|
|
auto chunks = array_make<EntityGraphVariablesChunk>(heap_allocator(), 0, info->entities.count/CHUNK_SIZE + 1);
|
|
defer (array_free(&chunks));
|
|
for (isize i = 0; i < info->entities.count; i += CHUNK_SIZE) {
|
|
Slice<Entity *> entities = slice(slice_from_array(info->entities), i, gb_min(i + CHUNK_SIZE, info->entities.count));
|
|
array_add(&chunks, EntityGraphVariablesChunk{entities, array_make<Entity *>(heap_allocator())});
|
|
}
|
|
{
|
|
TaskGroup group = {};
|
|
for (EntityGraphVariablesChunk &chunk : chunks) {
|
|
thread_pool_add_task(&group, generate_entity_dependency_graph_variables_worker, &chunk);
|
|
}
|
|
thread_pool_wait(&group);
|
|
}
|
|
|
|
isize variable_count = 0;
|
|
for (EntityGraphVariablesChunk const &chunk : chunks) {
|
|
variable_count += chunk.variables.count;
|
|
}
|
|
|
|
map_init(&g->vars, variable_count);
|
|
g->nodes = array_make<EntityGraphNode *>(arena_allocator(arena), 0, variable_count);
|
|
for (EntityGraphVariablesChunk &chunk : chunks) {
|
|
for (Entity *e : chunk.variables) {
|
|
EntityGraphNode *n = arena_alloc_item<EntityGraphNode>(arena);
|
|
n->entity = e;
|
|
map_set(&g->vars, e, n);
|
|
array_add(&g->nodes, n);
|
|
}
|
|
array_free(&chunk.variables);
|
|
}
|
|
}
|
|
|
|
// NOTE: only started, so the edges' tasks can be first in the queue, and so first to be stolen, before other work
|
|
gb_internal void start_generate_entity_dependency_graph_edges(EntityGraph *g) {
|
|
TIME_SECTION("generate_entity_dependency_graph: Calculate edges");
|
|
|
|
g->edges_work.vars = &g->vars;
|
|
g->edges_work.nodes = slice_from_array(g->nodes);
|
|
isize task_count = gb_min(global_thread_pool.threads.count, g->nodes.count);
|
|
for (isize i = 0; i < task_count; i++) {
|
|
thread_pool_add_task(&g->edges, generate_entity_dependency_graph_edges_worker, &g->edges_work);
|
|
}
|
|
}
|
|
|
|
gb_internal void finish_generate_entity_dependency_graph_edges(EntityGraph *g) {
|
|
thread_pool_wait(&g->edges);
|
|
map_destroy(&g->vars);
|
|
}
|
|
|
|
|
|
gb_internal void check_single_global_entity(Checker *c, Entity *e, DeclInfo *d, UntypedExprInfoMap *untyped=nullptr);
|
|
|
|
|
|
gb_internal Entity *find_core_entity(Checker *c, String name) {
|
|
u32 hash = 0;
|
|
InternedString interned = string_interner_insert(name, 0, &hash);
|
|
Entity *e = scope_lookup_current(c->info.runtime_package->scope, interned, hash);
|
|
if (e == nullptr) {
|
|
compiler_error("Could not find type declaration for '%.*s'\n"
|
|
, LIT(name));
|
|
// NOTE(bill): This will exit the program as it's cannot continue without it!
|
|
}
|
|
return e;
|
|
}
|
|
|
|
gb_internal Type *find_core_type(Checker *c, String name) {
|
|
u32 hash = 0;
|
|
InternedString interned = string_interner_insert(name, 0, &hash);
|
|
Entity *e = scope_lookup_current(c->info.runtime_package->scope, interned, hash);
|
|
if (e == nullptr) {
|
|
compiler_error("Could not find type declaration for '%.*s'\n"
|
|
, LIT(name));
|
|
// NOTE(bill): This will exit the program as it's cannot continue without it!
|
|
}
|
|
if (e->type == nullptr) {
|
|
check_single_global_entity(c, e, e->decl_info);
|
|
}
|
|
GB_ASSERT(e->type != nullptr);
|
|
return e->type;
|
|
}
|
|
|
|
|
|
gb_internal Entity *find_entity_in_pkg(CheckerInfo *info, String const &pkg, String const &name) {
|
|
u32 hash = 0;
|
|
InternedString interned = string_interner_insert(name, 0, &hash);
|
|
AstPackage *package = get_core_package(info, pkg);
|
|
Entity *e = scope_lookup_current(package->scope, interned, hash);
|
|
if (e == nullptr) {
|
|
compiler_error("Could not find type declaration for '%.*s.%.*s'\n", LIT(pkg), LIT(name));
|
|
// NOTE(bill): This will exit the program as it's cannot continue without it!
|
|
}
|
|
return e;
|
|
}
|
|
|
|
gb_internal Type *find_type_in_pkg(CheckerInfo *info, String const &pkg, String const &name) {
|
|
u32 hash = 0;
|
|
InternedString interned = string_interner_insert(name, 0, &hash);
|
|
AstPackage *package = get_core_package(info, pkg);
|
|
Entity *e = scope_lookup_current(package->scope, interned, hash);
|
|
if (e == nullptr) {
|
|
compiler_error("Could not find type declaration for '%.*s.%.*s'\n", LIT(pkg), LIT(name));
|
|
// NOTE(bill): This will exit the program as it's cannot continue without it!
|
|
}
|
|
GB_ASSERT(e->type != nullptr);
|
|
return e->type;
|
|
}
|
|
|
|
gb_internal gb_thread_local std::atomic<AtomicFreelist<CheckerTypePath> *> checker_type_path_free_list;
|
|
|
|
gb_internal CheckerTypePath *new_checker_type_path() {
|
|
// TODO(bill): Cache to reuse `CheckerTypePath
|
|
|
|
auto *tp = atomic_freelist_get(checker_type_path_free_list);
|
|
if (tp == nullptr) {
|
|
tp = permanent_alloc_item<AtomicFreelist<CheckerTypePath> >();
|
|
array_init(&tp->value, permanent_allocator(), 0, 16);
|
|
}
|
|
return &tp->value;
|
|
}
|
|
|
|
gb_internal void destroy_checker_type_path(CheckerTypePath *path) {
|
|
auto *tp = cast(AtomicFreelist<CheckerTypePath> *)path;
|
|
array_clear(&tp->value);
|
|
|
|
atomic_freelist_put(checker_type_path_free_list, tp);
|
|
}
|
|
|
|
gb_internal void check_type_path_push(CheckerContext *c, Entity *e) {
|
|
GB_ASSERT(c->type_path != nullptr);
|
|
GB_ASSERT(e != nullptr);
|
|
array_add(c->type_path, e);
|
|
}
|
|
gb_internal Entity *check_type_path_pop(CheckerContext *c) {
|
|
GB_ASSERT(c->type_path != nullptr);
|
|
return array_pop(c->type_path);
|
|
}
|
|
|
|
|
|
|
|
gb_internal Array<Entity *> proc_group_entities(CheckerContext *c, Operand o) {
|
|
Array<Entity *> procs = {};
|
|
if (o.mode == Addressing_ProcGroup) {
|
|
GB_ASSERT(o.proc_group != nullptr);
|
|
if (o.proc_group->kind == Entity_ProcGroup) {
|
|
check_entity_decl(c, o.proc_group, nullptr, nullptr);
|
|
return o.proc_group->ProcGroup.entities;
|
|
}
|
|
}
|
|
return procs;
|
|
}
|
|
|
|
gb_internal Array<Entity *> proc_group_entities_cloned(CheckerContext *c, Operand o) {
|
|
auto entities = proc_group_entities(c, o);
|
|
if (entities.count == 0) {
|
|
return {};
|
|
}
|
|
return array_clone(permanent_allocator(), entities);
|
|
}
|
|
|
|
|
|
|
|
|
|
gb_internal void init_core_type_info(Checker *c) {
|
|
if (t_type_info != nullptr) {
|
|
return;
|
|
}
|
|
Entity *type_info_entity = find_core_entity(c, str_lit("Type_Info"));
|
|
GB_ASSERT(type_info_entity != nullptr);
|
|
if (type_info_entity->type == nullptr) {
|
|
check_single_global_entity(c, type_info_entity, type_info_entity->decl_info);
|
|
}
|
|
GB_ASSERT(type_info_entity->type != nullptr);
|
|
|
|
t_type_info = type_info_entity->type;
|
|
t_type_info_ptr = alloc_type_pointer(t_type_info);
|
|
GB_ASSERT(is_type_struct(type_info_entity->type));
|
|
TypeStruct *tis = &base_type(type_info_entity->type)->Struct;
|
|
|
|
Entity *type_info_enum_value = find_core_entity(c, str_lit("Type_Info_Enum_Value"));
|
|
|
|
t_type_info_enum_value = type_info_enum_value->type;
|
|
t_type_info_enum_value_ptr = alloc_type_pointer(t_type_info_enum_value);
|
|
|
|
GB_ASSERT(tis->fields.count == 5);
|
|
|
|
Entity *type_info_string_encoding_kind = find_core_entity(c, str_lit("Type_Info_String_Encoding_Kind"));
|
|
t_type_info_string_encoding_kind = type_info_string_encoding_kind->type;
|
|
|
|
Entity *type_info_variant = tis->fields[4];
|
|
Type *tiv_type = type_info_variant->type;
|
|
GB_ASSERT(is_type_union(tiv_type));
|
|
|
|
t_type_info_named = find_core_type(c, str_lit("Type_Info_Named"));
|
|
t_type_info_integer = find_core_type(c, str_lit("Type_Info_Integer"));
|
|
t_type_info_rune = find_core_type(c, str_lit("Type_Info_Rune"));
|
|
t_type_info_float = find_core_type(c, str_lit("Type_Info_Float"));
|
|
t_type_info_quaternion = find_core_type(c, str_lit("Type_Info_Quaternion"));
|
|
t_type_info_complex = find_core_type(c, str_lit("Type_Info_Complex"));
|
|
t_type_info_string = find_core_type(c, str_lit("Type_Info_String"));
|
|
t_type_info_boolean = find_core_type(c, str_lit("Type_Info_Boolean"));
|
|
t_type_info_any = find_core_type(c, str_lit("Type_Info_Any"));
|
|
t_type_info_typeid = find_core_type(c, str_lit("Type_Info_Type_Id"));
|
|
t_type_info_pointer = find_core_type(c, str_lit("Type_Info_Pointer"));
|
|
t_type_info_multi_pointer = find_core_type(c, str_lit("Type_Info_Multi_Pointer"));
|
|
t_type_info_procedure = find_core_type(c, str_lit("Type_Info_Procedure"));
|
|
t_type_info_array = find_core_type(c, str_lit("Type_Info_Array"));
|
|
t_type_info_enumerated_array = find_core_type(c, str_lit("Type_Info_Enumerated_Array"));
|
|
t_type_info_dynamic_array = find_core_type(c, str_lit("Type_Info_Dynamic_Array"));
|
|
t_type_info_slice = find_core_type(c, str_lit("Type_Info_Slice"));
|
|
t_type_info_parameters = find_core_type(c, str_lit("Type_Info_Parameters"));
|
|
t_type_info_struct = find_core_type(c, str_lit("Type_Info_Struct"));
|
|
t_type_info_union = find_core_type(c, str_lit("Type_Info_Union"));
|
|
t_type_info_enum = find_core_type(c, str_lit("Type_Info_Enum"));
|
|
t_type_info_map = find_core_type(c, str_lit("Type_Info_Map"));
|
|
t_type_info_bit_set = find_core_type(c, str_lit("Type_Info_Bit_Set"));
|
|
t_type_info_simd_vector = find_core_type(c, str_lit("Type_Info_Simd_Vector"));
|
|
t_type_info_matrix = find_core_type(c, str_lit("Type_Info_Matrix"));
|
|
t_type_info_soa_pointer = find_core_type(c, str_lit("Type_Info_Soa_Pointer"));
|
|
t_type_info_bit_field = find_core_type(c, str_lit("Type_Info_Bit_Field"));
|
|
t_type_info_fixed_capacity_dynamic_array = find_core_type(c, str_lit("Type_Info_Fixed_Capacity_Dynamic_Array"));
|
|
|
|
t_type_info_named_ptr = alloc_type_pointer(t_type_info_named);
|
|
t_type_info_integer_ptr = alloc_type_pointer(t_type_info_integer);
|
|
t_type_info_rune_ptr = alloc_type_pointer(t_type_info_rune);
|
|
t_type_info_float_ptr = alloc_type_pointer(t_type_info_float);
|
|
t_type_info_quaternion_ptr = alloc_type_pointer(t_type_info_quaternion);
|
|
t_type_info_complex_ptr = alloc_type_pointer(t_type_info_complex);
|
|
t_type_info_string_ptr = alloc_type_pointer(t_type_info_string);
|
|
t_type_info_boolean_ptr = alloc_type_pointer(t_type_info_boolean);
|
|
t_type_info_any_ptr = alloc_type_pointer(t_type_info_any);
|
|
t_type_info_typeid_ptr = alloc_type_pointer(t_type_info_typeid);
|
|
t_type_info_pointer_ptr = alloc_type_pointer(t_type_info_pointer);
|
|
t_type_info_multi_pointer_ptr = alloc_type_pointer(t_type_info_multi_pointer);
|
|
t_type_info_procedure_ptr = alloc_type_pointer(t_type_info_procedure);
|
|
t_type_info_array_ptr = alloc_type_pointer(t_type_info_array);
|
|
t_type_info_enumerated_array_ptr = alloc_type_pointer(t_type_info_enumerated_array);
|
|
t_type_info_dynamic_array_ptr = alloc_type_pointer(t_type_info_dynamic_array);
|
|
t_type_info_slice_ptr = alloc_type_pointer(t_type_info_slice);
|
|
t_type_info_parameters_ptr = alloc_type_pointer(t_type_info_parameters);
|
|
t_type_info_struct_ptr = alloc_type_pointer(t_type_info_struct);
|
|
t_type_info_union_ptr = alloc_type_pointer(t_type_info_union);
|
|
t_type_info_enum_ptr = alloc_type_pointer(t_type_info_enum);
|
|
t_type_info_map_ptr = alloc_type_pointer(t_type_info_map);
|
|
t_type_info_bit_set_ptr = alloc_type_pointer(t_type_info_bit_set);
|
|
t_type_info_simd_vector_ptr = alloc_type_pointer(t_type_info_simd_vector);
|
|
t_type_info_matrix_ptr = alloc_type_pointer(t_type_info_matrix);
|
|
t_type_info_soa_pointer_ptr = alloc_type_pointer(t_type_info_soa_pointer);
|
|
t_type_info_bit_field_ptr = alloc_type_pointer(t_type_info_bit_field);
|
|
t_type_info_fixed_capacity_dynamic_array_ptr = alloc_type_pointer(t_type_info_fixed_capacity_dynamic_array);
|
|
}
|
|
|
|
gb_internal void init_mem_allocator(Checker *c) {
|
|
if (t_allocator != nullptr) {
|
|
return;
|
|
}
|
|
t_allocator = find_core_type(c, str_lit("Allocator"));
|
|
t_allocator_ptr = alloc_type_pointer(t_allocator);
|
|
t_allocator_error = find_core_type(c, str_lit("Allocator_Error"));
|
|
}
|
|
|
|
gb_internal void init_core_context(Checker *c) {
|
|
if (t_context != nullptr) {
|
|
return;
|
|
}
|
|
t_context = find_core_type(c, str_lit("Context"));
|
|
t_context_ptr = alloc_type_pointer(t_context);
|
|
}
|
|
|
|
gb_internal void init_core_source_code_location(Checker *c) {
|
|
if (t_source_code_location != nullptr) {
|
|
return;
|
|
}
|
|
t_source_code_location = find_core_type(c, str_lit("Source_Code_Location"));
|
|
t_source_code_location_ptr = alloc_type_pointer(t_source_code_location);
|
|
}
|
|
|
|
gb_internal void init_core_load_directory_file(Checker *c) {
|
|
if (t_load_directory_file != nullptr) {
|
|
return;
|
|
}
|
|
t_load_directory_file = find_core_type(c, str_lit("Load_Directory_File"));
|
|
t_load_directory_file_ptr = alloc_type_pointer(t_load_directory_file);
|
|
t_load_directory_file_slice = alloc_type_slice(t_load_directory_file);
|
|
}
|
|
|
|
|
|
gb_internal void init_core_map_type(Checker *c) {
|
|
if (t_map_info != nullptr) {
|
|
return;
|
|
}
|
|
init_mem_allocator(c);
|
|
t_map_info = find_core_type(c, str_lit("Map_Info"));
|
|
t_map_cell_info = find_core_type(c, str_lit("Map_Cell_Info"));
|
|
t_raw_map = find_core_type(c, str_lit("Raw_Map"));
|
|
|
|
t_map_info_ptr = alloc_type_pointer(t_map_info);
|
|
t_map_cell_info_ptr = alloc_type_pointer(t_map_cell_info);
|
|
t_raw_map_ptr = alloc_type_pointer(t_raw_map);
|
|
}
|
|
|
|
gb_internal void init_core_objc_c(Checker *c) {
|
|
if (build_context.metrics.os == TargetOs_darwin) {
|
|
t_objc_super = find_core_type(c, str_lit("objc_super"));
|
|
t_objc_super_ptr = alloc_type_pointer(t_objc_super);
|
|
}
|
|
}
|
|
|
|
gb_internal void init_preload(Checker *c) {
|
|
init_core_type_info(c);
|
|
init_mem_allocator(c);
|
|
init_core_context(c);
|
|
init_core_source_code_location(c);
|
|
init_core_map_type(c);
|
|
init_core_objc_c(c);
|
|
}
|
|
|
|
gb_internal void check_expr_with_type_hint(CheckerContext *c, Operand *o, Ast *e, Type *t);
|
|
|
|
gb_internal ExactValue check_decl_attribute_value(CheckerContext *c, Ast *value, Type *type_hint = nullptr) {
|
|
ExactValue ev = {};
|
|
if (value != nullptr) {
|
|
Operand op = {};
|
|
if (type_hint != nullptr) {
|
|
check_expr_with_type_hint(c, &op, value, type_hint);
|
|
} else {
|
|
check_expr(c, &op, value);
|
|
}
|
|
if (op.mode) {
|
|
if (op.mode == Addressing_Constant) {
|
|
ev = op.value;
|
|
} else {
|
|
error(value, "Expected a constant attribute element");
|
|
}
|
|
}
|
|
}
|
|
return ev;
|
|
}
|
|
|
|
gb_internal bool is_foreign_name_valid(String const &name) {
|
|
if (name.len == 0) {
|
|
return false;
|
|
}
|
|
isize offset = 0;
|
|
while (offset < name.len) {
|
|
Rune rune;
|
|
isize remaining = name.len - offset;
|
|
isize width = utf8_decode(name.text+offset, remaining, &rune);
|
|
if (rune == GB_RUNE_INVALID && width == 1) {
|
|
return false;
|
|
} else if (rune == GB_RUNE_BOM && remaining > 0) {
|
|
return false;
|
|
}
|
|
|
|
// TODO(bill, 2026-06-02): This entire logic needs to be completely figured out
|
|
// as to what should be allowed or not
|
|
// The original limitations of `-$._ +` and alphanumeric was more of an assumption
|
|
// than the actual technical limitations of all linkers.
|
|
if (offset == 0) {
|
|
switch (rune) {
|
|
case '-':
|
|
case '$':
|
|
case '.':
|
|
case '_':
|
|
case ':':
|
|
break;
|
|
default:
|
|
if (!gb_char_is_alpha(cast(char)rune))
|
|
return false;
|
|
break;
|
|
}
|
|
} else {
|
|
int n = utf8proc_charwidth(rune);
|
|
if (n <= 0) {
|
|
// not a printable character
|
|
return false;
|
|
}
|
|
}
|
|
|
|
offset += width;
|
|
}
|
|
|
|
return true;
|
|
}
|
|
|
|
|
|
#define ATTRIBUTE_USER_TAG_NAME "tag"
|
|
|
|
|
|
gb_internal DECL_ATTRIBUTE_PROC(foreign_block_decl_attribute) {
|
|
ExactValue ev = check_decl_attribute_value(c, value);
|
|
|
|
if (name == ATTRIBUTE_USER_TAG_NAME) {
|
|
if (ev.kind != ExactValue_String) {
|
|
error(elem, "Expected a string value for '%.*s'", LIT(name));
|
|
}
|
|
return true;
|
|
} else if (name == "default_calling_convention") {
|
|
if (ev.kind == ExactValue_String) {
|
|
auto cc = string_to_calling_convention(ev.value_string);
|
|
if (cc == ProcCC_Invalid) {
|
|
error(elem, "Unknown procedure calling convention: '%.*s'", LIT(ev.value_string));
|
|
} else {
|
|
c->foreign_context.default_cc = cc;
|
|
}
|
|
} else {
|
|
error(elem, "Expected a string value for '%.*s'", LIT(name));
|
|
}
|
|
return true;
|
|
} else if (name == "link_prefix") {
|
|
if (ev.kind == ExactValue_String) {
|
|
String link_prefix = string_trim_whitespace(ev.value_string);
|
|
if (link_prefix.len != 0 && !is_foreign_name_valid(link_prefix)) {
|
|
error(elem, "Invalid link prefix: '%.*s'", LIT(link_prefix));
|
|
} else {
|
|
c->foreign_context.link_prefix = link_prefix;
|
|
}
|
|
} else {
|
|
error(elem, "Expected a string value for '%.*s'", LIT(name));
|
|
}
|
|
return true;
|
|
} else if (name == "link_suffix") {
|
|
if (ev.kind == ExactValue_String) {
|
|
String link_suffix = string_trim_whitespace(ev.value_string);
|
|
if (link_suffix.len != 0 && !is_foreign_name_valid(link_suffix)) {
|
|
error(elem, "Invalid link suffix: '%.*s'", LIT(link_suffix));
|
|
} else {
|
|
c->foreign_context.link_suffix = link_suffix;
|
|
}
|
|
} else {
|
|
error(elem, "Expected a string value for '%.*s'", LIT(name));
|
|
}
|
|
return true;
|
|
} else if (name == "private") {
|
|
EntityVisiblityKind kind = EntityVisiblity_PrivateToPackage;
|
|
if (ev.kind == ExactValue_Invalid) {
|
|
// Okay
|
|
} else if (ev.kind == ExactValue_String) {
|
|
String v = ev.value_string;
|
|
if (v == "file") {
|
|
kind = EntityVisiblity_PrivateToFile;
|
|
} else if (v == "package") {
|
|
kind = EntityVisiblity_PrivateToPackage;
|
|
} else {
|
|
error(value, "'%.*s' expects no parameter, or a string literal containing \"file\" or \"package\"", LIT(name));
|
|
}
|
|
} else {
|
|
error(value, "'%.*s' expects no parameter, or a string literal containing \"file\" or \"package\"", LIT(name));
|
|
}
|
|
c->foreign_context.visibility_kind = kind;
|
|
return true;
|
|
} else if (name == "require_results") {
|
|
if (value != nullptr) {
|
|
error(elem, "Expected no value for '%.*s'", LIT(name));
|
|
}
|
|
c->foreign_context.require_results = true;
|
|
return true;
|
|
}
|
|
|
|
return false;
|
|
}
|
|
|
|
gb_internal DECL_ATTRIBUTE_PROC(proc_group_attribute) {
|
|
if (name == ATTRIBUTE_USER_TAG_NAME) {
|
|
ExactValue ev = check_decl_attribute_value(c, value);
|
|
if (ev.kind != ExactValue_String) {
|
|
error(elem, "Expected a string value for '%.*s'", LIT(name));
|
|
}
|
|
return true;
|
|
} else if (name == "objc_name") {
|
|
ExactValue ev = check_decl_attribute_value(c, value);
|
|
if (ev.kind == ExactValue_String) {
|
|
if (string_is_valid_identifier(ev.value_string)) {
|
|
ac->objc_name = ev.value_string;
|
|
} else {
|
|
error(elem, "Invalid identifier for '%.*s', got '%.*s'", LIT(name), LIT(ev.value_string));
|
|
}
|
|
} else {
|
|
error(elem, "Expected a string value for '%.*s'", LIT(name));
|
|
}
|
|
return true;
|
|
} else if (name == "objc_is_class_method") {
|
|
ExactValue ev = check_decl_attribute_value(c, value);
|
|
if (ev.kind == ExactValue_Bool) {
|
|
ac->objc_is_class_method = ev.value_bool;
|
|
} else {
|
|
error(elem, "Expected a boolean value for '%.*s'", LIT(name));
|
|
}
|
|
return true;
|
|
} else if (name == "objc_type") {
|
|
if (value == nullptr) {
|
|
error(elem, "Expected a type for '%.*s'", LIT(name));
|
|
} else {
|
|
Type *objc_type = check_type(c, value);
|
|
if (objc_type != nullptr) {
|
|
if (!has_type_got_objc_class_attribute(objc_type)) {
|
|
gbString t = type_to_string(objc_type);
|
|
error(value, "'%.*s' expected a named type with the attribute @(obj_class=<string>), got type %s", LIT(name), t);
|
|
gb_string_free(t);
|
|
} else {
|
|
ac->objc_type = objc_type;
|
|
}
|
|
}
|
|
}
|
|
return true;
|
|
} else if (name == "require_results") {
|
|
if (value != nullptr) {
|
|
error(elem, "Expected no value for '%.*s'", LIT(name));
|
|
}
|
|
ac->require_results = true;
|
|
return true;
|
|
}
|
|
return false;
|
|
}
|
|
|
|
|
|
gb_internal DECL_ATTRIBUTE_PROC(proc_decl_attribute) {
|
|
if (name == ATTRIBUTE_USER_TAG_NAME) {
|
|
ExactValue ev = check_decl_attribute_value(c, value);
|
|
if (ev.kind != ExactValue_String) {
|
|
error(elem, "Expected a string value for '%.*s'", LIT(name));
|
|
}
|
|
return true;
|
|
} else if (name == "test") {
|
|
if (value != nullptr) {
|
|
error(value, "Expected no value for '%.*s'", LIT(name));
|
|
}
|
|
ac->test = true;
|
|
return true;
|
|
} else if (name == "export") {
|
|
ExactValue ev = check_decl_attribute_value(c, value);
|
|
if (ev.kind == ExactValue_Invalid) {
|
|
ac->is_export = true;
|
|
} else if (ev.kind == ExactValue_Bool) {
|
|
ac->is_export = ev.value_bool;
|
|
} else {
|
|
error(value, "Expected either a boolean or no parameter for 'export'");
|
|
return false;
|
|
}
|
|
return true;
|
|
} else if (name == "linkage") {
|
|
ExactValue ev = check_decl_attribute_value(c, value);
|
|
if (ev.kind != ExactValue_String) {
|
|
error(value, "Expected either a string 'linkage'");
|
|
return false;
|
|
}
|
|
String linkage = ev.value_string;
|
|
if (linkage == "internal" ||
|
|
linkage == "strong" ||
|
|
linkage == "weak" ||
|
|
linkage == "link_once") {
|
|
ac->linkage = linkage;
|
|
} else {
|
|
ERROR_BLOCK();
|
|
error(elem, "Invalid linkage '%.*s'. Valid kinds:", LIT(linkage));
|
|
error_line("\tinternal\n");
|
|
error_line("\tstrong\n");
|
|
error_line("\tweak\n");
|
|
error_line("\tlink_once\n");
|
|
}
|
|
return true;
|
|
} else if (name == "require") {
|
|
ExactValue ev = check_decl_attribute_value(c, value);
|
|
if (ev.kind == ExactValue_Invalid) {
|
|
ac->require_declaration = true;
|
|
} else if (ev.kind == ExactValue_Bool) {
|
|
ac->require_declaration = ev.value_bool;
|
|
} else {
|
|
error(value, "Expected either a boolean or no parameter for 'require'");
|
|
}
|
|
return true;
|
|
} else if (name == "init") {
|
|
if (value != nullptr) {
|
|
error(value, "Expected no value for '%.*s'", LIT(name));
|
|
}
|
|
ac->init = true;
|
|
return true;
|
|
} else if (name == "fini") {
|
|
if (value != nullptr) {
|
|
error(value, "Expected no value for '%.*s'", LIT(name));
|
|
}
|
|
ac->fini = true;
|
|
return true;
|
|
} else if (name == "deferred") {
|
|
if (value != nullptr) {
|
|
Operand o = {};
|
|
check_expr(c, &o, value);
|
|
Entity *e = entity_of_node(o.expr);
|
|
if (e != nullptr && e->kind == Entity_Procedure) {
|
|
error(elem, "'%.*s' is not allowed any more, please use one of the following instead: 'deferred_none', 'deferred_in', 'deferred_out'", LIT(name));
|
|
if (ac->deferred_procedure.entity != nullptr) {
|
|
error(elem, "Previous usage of a 'deferred_*' attribute");
|
|
}
|
|
ac->deferred_procedure.kind = DeferredProcedure_out;
|
|
ac->deferred_procedure.entity = e;
|
|
return true;
|
|
}
|
|
}
|
|
error(elem, "Expected a procedure entity for '%.*s'", LIT(name));
|
|
return false;
|
|
} else if (name == "deferred_none") {
|
|
if (value != nullptr) {
|
|
Operand o = {};
|
|
check_expr(c, &o, value);
|
|
Entity *e = entity_of_node(o.expr);
|
|
if (e != nullptr && e->kind == Entity_Procedure) {
|
|
ac->deferred_procedure.kind = DeferredProcedure_none;
|
|
ac->deferred_procedure.entity = e;
|
|
return true;
|
|
}
|
|
}
|
|
error(elem, "Expected a procedure entity for '%.*s'", LIT(name));
|
|
return false;
|
|
} else if (name == "deferred_in") {
|
|
if (value != nullptr) {
|
|
Operand o = {};
|
|
check_expr(c, &o, value);
|
|
Entity *e = entity_of_node(o.expr);
|
|
if (e != nullptr && e->kind == Entity_Procedure) {
|
|
if (ac->deferred_procedure.entity != nullptr) {
|
|
error(elem, "Previous usage of a 'deferred_*' attribute");
|
|
}
|
|
ac->deferred_procedure.kind = DeferredProcedure_in;
|
|
ac->deferred_procedure.entity = e;
|
|
return true;
|
|
}
|
|
}
|
|
error(elem, "Expected a procedure entity for '%.*s'", LIT(name));
|
|
return false;
|
|
} else if (name == "deferred_out") {
|
|
if (value != nullptr) {
|
|
Operand o = {};
|
|
check_expr(c, &o, value);
|
|
Entity *e = entity_of_node(o.expr);
|
|
if (e != nullptr && e->kind == Entity_Procedure) {
|
|
if (ac->deferred_procedure.entity != nullptr) {
|
|
error(elem, "Previous usage of a 'deferred_*' attribute");
|
|
}
|
|
ac->deferred_procedure.kind = DeferredProcedure_out;
|
|
ac->deferred_procedure.entity = e;
|
|
return true;
|
|
}
|
|
}
|
|
error(elem, "Expected a procedure entity for '%.*s'", LIT(name));
|
|
return false;
|
|
} else if (name == "deferred_in_out") {
|
|
if (value != nullptr) {
|
|
Operand o = {};
|
|
check_expr(c, &o, value);
|
|
Entity *e = entity_of_node(o.expr);
|
|
if (e != nullptr && e->kind == Entity_Procedure) {
|
|
if (ac->deferred_procedure.entity != nullptr) {
|
|
error(elem, "Previous usage of a 'deferred_*' attribute");
|
|
}
|
|
ac->deferred_procedure.kind = DeferredProcedure_in_out;
|
|
ac->deferred_procedure.entity = e;
|
|
return true;
|
|
}
|
|
}
|
|
error(elem, "Expected a procedure entity for '%.*s'", LIT(name));
|
|
return false;
|
|
} else if (name == "deferred_in_by_ptr") {
|
|
if (value != nullptr) {
|
|
Operand o = {};
|
|
check_expr(c, &o, value);
|
|
Entity *e = entity_of_node(o.expr);
|
|
if (e != nullptr && e->kind == Entity_Procedure) {
|
|
if (ac->deferred_procedure.entity != nullptr) {
|
|
error(elem, "Previous usage of a 'deferred_*' attribute");
|
|
}
|
|
ac->deferred_procedure.kind = DeferredProcedure_in_by_ptr;
|
|
ac->deferred_procedure.entity = e;
|
|
return true;
|
|
}
|
|
}
|
|
error(elem, "Expected a procedure entity for '%.*s'", LIT(name));
|
|
return false;
|
|
} else if (name == "deferred_out_by_ptr") {
|
|
if (value != nullptr) {
|
|
Operand o = {};
|
|
check_expr(c, &o, value);
|
|
Entity *e = entity_of_node(o.expr);
|
|
if (e != nullptr && e->kind == Entity_Procedure) {
|
|
if (ac->deferred_procedure.entity != nullptr) {
|
|
error(elem, "Previous usage of a 'deferred_*' attribute");
|
|
}
|
|
ac->deferred_procedure.kind = DeferredProcedure_out_by_ptr;
|
|
ac->deferred_procedure.entity = e;
|
|
return true;
|
|
}
|
|
}
|
|
error(elem, "Expected a procedure entity for '%.*s'", LIT(name));
|
|
return false;
|
|
} else if (name == "deferred_in_out_by_ptr") {
|
|
if (value != nullptr) {
|
|
Operand o = {};
|
|
check_expr(c, &o, value);
|
|
Entity *e = entity_of_node(o.expr);
|
|
if (e != nullptr && e->kind == Entity_Procedure) {
|
|
if (ac->deferred_procedure.entity != nullptr) {
|
|
error(elem, "Previous usage of a 'deferred_*' attribute");
|
|
}
|
|
ac->deferred_procedure.kind = DeferredProcedure_in_out_by_ptr;
|
|
ac->deferred_procedure.entity = e;
|
|
return true;
|
|
}
|
|
}
|
|
error(elem, "Expected a procedure entity for '%.*s'", LIT(name));
|
|
return false;
|
|
} else if (name == "link_name") {
|
|
ExactValue ev = check_decl_attribute_value(c, value);
|
|
|
|
if (ev.kind == ExactValue_String) {
|
|
ac->link_name = ev.value_string;
|
|
if (!is_foreign_name_valid(ac->link_name)) {
|
|
error(elem, "Invalid link name: %.*s", LIT(ac->link_name));
|
|
}
|
|
} else {
|
|
error(elem, "Expected a string value for '%.*s'", LIT(name));
|
|
}
|
|
return true;
|
|
} else if (name == "link_prefix") {
|
|
ExactValue ev = check_decl_attribute_value(c, value);
|
|
|
|
if (ev.kind == ExactValue_String) {
|
|
ac->link_prefix = ev.value_string;
|
|
if (ac->link_prefix.len != 0 && !is_foreign_name_valid(ac->link_prefix)) {
|
|
error(elem, "Invalid link prefix: %.*s", LIT(ac->link_prefix));
|
|
}
|
|
} else {
|
|
error(elem, "Expected a string value for '%.*s'", LIT(name));
|
|
}
|
|
return true;
|
|
} else if (name == "link_suffix") {
|
|
ExactValue ev = check_decl_attribute_value(c, value);
|
|
|
|
if (ev.kind == ExactValue_String) {
|
|
ac->link_suffix = ev.value_string;
|
|
if (ac->link_suffix.len != 0 && !is_foreign_name_valid(ac->link_suffix)) {
|
|
error(elem, "Invalid link suffix: %.*s", LIT(ac->link_suffix));
|
|
}
|
|
} else {
|
|
error(elem, "Expected a string value for '%.*s'", LIT(name));
|
|
}
|
|
return true;
|
|
} else if (name == "link_section") {
|
|
ExactValue ev = check_decl_attribute_value(c, value);
|
|
if (ev.kind == ExactValue_String) {
|
|
ac->link_section = ev.value_string;
|
|
if (!is_foreign_name_valid(ac->link_section)) {
|
|
error(elem, "Invalid link section: %.*s", LIT(ac->link_section));
|
|
}
|
|
} else {
|
|
error(elem, "Expected a string value for '%.*s'", LIT(name));
|
|
}
|
|
return true;
|
|
} else if (name == "deprecated") {
|
|
ExactValue ev = check_decl_attribute_value(c, value);
|
|
|
|
if (ev.kind == ExactValue_String) {
|
|
String msg = ev.value_string;
|
|
if (msg.len == 0) {
|
|
error(elem, "Deprecation message cannot be an empty string");
|
|
} else {
|
|
ac->deprecated_message = msg;
|
|
}
|
|
} else {
|
|
error(elem, "Expected a string value for '%.*s'", LIT(name));
|
|
}
|
|
return true;
|
|
} else if (name == "require_results") {
|
|
if (value != nullptr) {
|
|
error(elem, "Expected no value for '%.*s'", LIT(name));
|
|
}
|
|
ac->require_results = true;
|
|
return true;
|
|
} else if (name == "disabled") {
|
|
ExactValue ev = check_decl_attribute_value(c, value);
|
|
|
|
if (ev.kind == ExactValue_Bool) {
|
|
ac->has_disabled_proc = true;
|
|
ac->disabled_proc = ev.value_bool;
|
|
} else {
|
|
error(elem, "Expected a boolean value for '%.*s'", LIT(name));
|
|
}
|
|
return true;
|
|
} else if (name == "cold") {
|
|
if (value == nullptr) {
|
|
ac->set_cold = true;
|
|
} else {
|
|
ExactValue ev = check_decl_attribute_value(c, value);
|
|
if (ev.kind == ExactValue_Bool) {
|
|
ac->set_cold = ev.value_bool;
|
|
} else {
|
|
error(elem, "Expected a boolean value for '%.*s' or no value whatsoever", LIT(name));
|
|
}
|
|
}
|
|
return true;
|
|
} else if (name == "optimization_mode") {
|
|
ExactValue ev = check_decl_attribute_value(c, value);
|
|
if (ev.kind == ExactValue_String) {
|
|
String mode = ev.value_string;
|
|
if (mode == "none") {
|
|
ac->optimization_mode = ProcedureOptimizationMode_None;
|
|
} else if (mode == "favor_size") {
|
|
ac->optimization_mode = ProcedureOptimizationMode_FavorSize;
|
|
} else if (mode == "minimal") {
|
|
error(elem, "Invalid optimization_mode 'minimal' for '%.*s', mode has been removed due to confusion, but 'none' has the same behaviour", LIT(name));
|
|
} else if (mode == "size") {
|
|
error(elem, "Invalid optimization_mode 'size' for '%.*s', mode has been removed due to confusion, but 'favor_size' has the same behaviour", LIT(name));
|
|
} else if (mode == "speed") {
|
|
error(elem, "Invalid optimization_mode 'speed' for '%.*s', mode has been removed due to confusion, but 'favor_size' has the same behaviour", LIT(name));
|
|
} else {
|
|
ERROR_BLOCK();
|
|
error(elem, "Invalid optimization_mode for '%.*s'. Valid modes:", LIT(name));
|
|
error_line("\tnone\n");
|
|
error_line("\tfavor_size\n");
|
|
}
|
|
} else {
|
|
error(elem, "Expected a string for '%.*s'", LIT(name));
|
|
}
|
|
return true;
|
|
} else if (name == "objc_name") {
|
|
ExactValue ev = check_decl_attribute_value(c, value);
|
|
if (ev.kind == ExactValue_String) {
|
|
if (string_is_valid_identifier(ev.value_string)) {
|
|
ac->objc_name = ev.value_string;
|
|
} else {
|
|
error(elem, "Invalid identifier for '%.*s', got '%.*s'", LIT(name), LIT(ev.value_string));
|
|
}
|
|
} else {
|
|
error(elem, "Expected a string value for '%.*s'", LIT(name));
|
|
}
|
|
return true;
|
|
} else if (name == "objc_is_class_method") {
|
|
ExactValue ev = check_decl_attribute_value(c, value);
|
|
if (ev.kind == ExactValue_Bool) {
|
|
ac->objc_is_class_method = ev.value_bool;
|
|
} else {
|
|
error(elem, "Expected a boolean value for '%.*s'", LIT(name));
|
|
}
|
|
return true;
|
|
} else if (name == "objc_type") {
|
|
if (value == nullptr) {
|
|
error(elem, "Expected a type for '%.*s'", LIT(name));
|
|
} else {
|
|
Type *objc_type = check_type(c, value);
|
|
if (objc_type != nullptr) {
|
|
if (!has_type_got_objc_class_attribute(objc_type)) {
|
|
gbString t = type_to_string(objc_type);
|
|
error(value, "'%.*s' expected a named type with the attribute @(obj_class=<string>), got type %s", LIT(name), t);
|
|
gb_string_free(t);
|
|
} else {
|
|
ac->objc_type = objc_type;
|
|
}
|
|
}
|
|
}
|
|
return true;
|
|
} else if (name == "objc_implement") {
|
|
ExactValue ev = check_decl_attribute_value(c, value);
|
|
if (ev.kind == ExactValue_Bool) {
|
|
ac->objc_is_implementation = ev.value_bool;
|
|
|
|
if (!ac->objc_is_implementation) {
|
|
ac->objc_is_disabled_implement = true;
|
|
}
|
|
} else if (ev.kind == ExactValue_Invalid) {
|
|
ac->objc_is_implementation = true;
|
|
} else {
|
|
error(elem, "Expected a boolean value, or no value, for '%.*s'", LIT(name));
|
|
}
|
|
|
|
return true;
|
|
} else if (name == "objc_selector") {
|
|
ExactValue ev = check_decl_attribute_value(c, value);
|
|
if (ev.kind == ExactValue_String) {
|
|
if (string_is_valid_identifier(ev.value_string)) {
|
|
ac->objc_selector = ev.value_string;
|
|
} else {
|
|
error(elem, "Invalid identifier for '%.*s', got '%.*s'", LIT(name), LIT(ev.value_string));
|
|
}
|
|
} else {
|
|
error(elem, "Expected a string value for '%.*s'", LIT(name));
|
|
}
|
|
return true;
|
|
} else if (name == "require_target_feature") {
|
|
ExactValue ev = check_decl_attribute_value(c, value);
|
|
if (ev.kind == ExactValue_String) {
|
|
ac->require_target_feature = ev.value_string;
|
|
} else {
|
|
error(elem, "Expected a string value for '%.*s'", LIT(name));
|
|
}
|
|
return true;
|
|
} else if (name == "enable_target_feature") {
|
|
ExactValue ev = check_decl_attribute_value(c, value);
|
|
if (ev.kind == ExactValue_String) {
|
|
ac->enable_target_feature = ev.value_string;
|
|
} else {
|
|
error(elem, "Expected a string value for '%.*s'", LIT(name));
|
|
}
|
|
return true;
|
|
} else if (name == "entry_point_only") {
|
|
if (value != nullptr) {
|
|
error(value, "'%.*s' expects no parameter", LIT(name));
|
|
}
|
|
ac->entry_point_only = true;
|
|
return true;
|
|
} else if (name == "no_instrumentation") {
|
|
ExactValue ev = check_decl_attribute_value(c, value);
|
|
if (ev.kind == ExactValue_Invalid) {
|
|
ac->no_instrumentation = Instrumentation_Disabled;
|
|
} else if (ev.kind == ExactValue_Bool) {
|
|
if (ev.value_bool) {
|
|
ac->no_instrumentation = Instrumentation_Disabled;
|
|
} else {
|
|
ac->no_instrumentation = Instrumentation_Enabled;
|
|
}
|
|
} else {
|
|
error(value, "Expected either a boolean or no parameter for '%.*s'", LIT(name));
|
|
return false;
|
|
}
|
|
return true;
|
|
} else if (name == "instrumentation_enter") {
|
|
if (value != nullptr) {
|
|
error(value, "'%.*s' expects no parameter", LIT(name));
|
|
}
|
|
ac->instrumentation_enter = true;
|
|
return true;
|
|
} else if (name == "instrumentation_exit") {
|
|
if (value != nullptr) {
|
|
error(value, "'%.*s' expects no parameter", LIT(name));
|
|
}
|
|
ac->instrumentation_exit = true;
|
|
return true;
|
|
} else if (name == "no_sanitize_address") {
|
|
if (value != nullptr) {
|
|
error(value, "'%.*s' expects no parameter", LIT(name));
|
|
}
|
|
ac->no_sanitize_address = true;
|
|
return true;
|
|
} else if (name == "no_sanitize_memory") {
|
|
if (value != nullptr) {
|
|
error(value, "'%.*s' expects no parameter", LIT(name));
|
|
}
|
|
ac->no_sanitize_memory = true;
|
|
return true;
|
|
} else if (name == "no_sanitize_thread") {
|
|
if (value != nullptr) {
|
|
error(value, "'%.*s' expects no parameter", LIT(name));
|
|
}
|
|
ac->no_sanitize_thread = true;
|
|
return true;
|
|
} else if (name == "fast_math") {
|
|
if (value == nullptr) {
|
|
error(elem, "Expected a constant bit_set of type 'intrinsics.Fast_Math_Flags' for '%.*s'", LIT(name));
|
|
} else {
|
|
ExactValue ev = check_decl_attribute_value(c, value, t_fast_math_flags);
|
|
if (ev.kind != ExactValue_Integer) {
|
|
error(elem, "Expected a constant bit_set of type 'intrinsics.Fast_Math_Flags' for '%.*s'", LIT(name));
|
|
} else {
|
|
ac->fast_math_flags = exact_value_to_u64(ev);
|
|
}
|
|
}
|
|
return true;
|
|
}
|
|
return false;
|
|
}
|
|
|
|
gb_internal DECL_ATTRIBUTE_PROC(var_decl_attribute) {
|
|
if (name == ATTRIBUTE_USER_TAG_NAME) {
|
|
ExactValue ev = check_decl_attribute_value(c, value);
|
|
if (ev.kind != ExactValue_String) {
|
|
error(elem, "Expected a string value for '%.*s'", LIT(name));
|
|
}
|
|
return true;
|
|
} else if (name == "static") {
|
|
if (value != nullptr) {
|
|
error(elem, "'static' does not have any parameters");
|
|
}
|
|
ac->is_static = true;
|
|
return true;
|
|
} else if (name == "rodata") {
|
|
if (value != nullptr) {
|
|
error(elem, "'rodata' does not have any parameters");
|
|
}
|
|
ac->rodata = true;
|
|
return true;
|
|
} else if (name == "thread_local") {
|
|
ExactValue ev = check_decl_attribute_value(c, value);
|
|
if (ac->init_expr_list_count > 0) {
|
|
error(elem, "A thread local variable declaration cannot have initialization values");
|
|
} else if (c->foreign_context.curr_library) {
|
|
error(elem, "A foreign block variable cannot be thread local");
|
|
} else if (ac->is_export) {
|
|
error(elem, "An exported variable cannot be thread local");
|
|
} else if (ev.kind == ExactValue_Invalid) {
|
|
ac->thread_local_model = str_lit("default");
|
|
} else if (ev.kind == ExactValue_String) {
|
|
String model = ev.value_string;
|
|
if (model == "default" ||
|
|
model == "globaldynamic" ||
|
|
model == "localdynamic" ||
|
|
model == "initialexec" ||
|
|
model == "localexec") {
|
|
ac->thread_local_model = model;
|
|
} else {
|
|
ERROR_BLOCK();
|
|
error(elem, "Invalid thread local model '%.*s'. Valid models:", LIT(model));
|
|
error_line("\tdefault\n");
|
|
error_line("\tglobaldynamic\n");
|
|
error_line("\tlocaldynamic\n");
|
|
error_line("\tinitialexec\n");
|
|
error_line("\tlocalexec\n");
|
|
}
|
|
} else {
|
|
error(elem, "Expected either no value or a string for '%.*s'", LIT(name));
|
|
}
|
|
return true;
|
|
}
|
|
|
|
if (c->curr_proc_decl != nullptr) {
|
|
error(elem, "Only a variable at file scope can have a '%.*s'", LIT(name));
|
|
return true;
|
|
}
|
|
|
|
if (name == "require") {
|
|
if (value != nullptr) {
|
|
error(elem, "'require' does not have any parameters");
|
|
}
|
|
ac->require_declaration = true;
|
|
return true;
|
|
} else if (name == "export") {
|
|
ExactValue ev = check_decl_attribute_value(c, value);
|
|
if (ev.kind == ExactValue_Invalid) {
|
|
ac->is_export = true;
|
|
} else if (ev.kind == ExactValue_Bool) {
|
|
ac->is_export = ev.value_bool;
|
|
} else {
|
|
error(value, "Expected either a boolean or no parameter for 'export'");
|
|
return false;
|
|
}
|
|
if (ac->thread_local_model != "") {
|
|
error(elem, "An exported variable cannot be thread local");
|
|
}
|
|
return true;
|
|
} else if (name == "linkage") {
|
|
ExactValue ev = check_decl_attribute_value(c, value);
|
|
if (ev.kind != ExactValue_String) {
|
|
error(value, "Expected either a string 'linkage'");
|
|
return false;
|
|
}
|
|
String linkage = ev.value_string;
|
|
if (linkage == "internal" ||
|
|
linkage == "strong" ||
|
|
linkage == "weak" ||
|
|
linkage == "link_once") {
|
|
ac->linkage = linkage;
|
|
} else {
|
|
ERROR_BLOCK();
|
|
error(elem, "Invalid linkage '%.*s'. Valid kinds:", LIT(linkage));
|
|
error_line("\tinternal\n");
|
|
error_line("\tstrong\n");
|
|
error_line("\tweak\n");
|
|
error_line("\tlink_once\n");
|
|
}
|
|
return true;
|
|
} else if (name == "link_name") {
|
|
ExactValue ev = check_decl_attribute_value(c, value);
|
|
if (ev.kind == ExactValue_String) {
|
|
ac->link_name = ev.value_string;
|
|
if (!is_foreign_name_valid(ac->link_name)) {
|
|
error(elem, "Invalid link name: %.*s", LIT(ac->link_name));
|
|
}
|
|
} else {
|
|
error(elem, "Expected a string value for '%.*s'", LIT(name));
|
|
}
|
|
return true;
|
|
} else if (name == "link_prefix") {
|
|
ExactValue ev = check_decl_attribute_value(c, value);
|
|
if (ev.kind == ExactValue_String) {
|
|
ac->link_prefix = ev.value_string;
|
|
if (ac->link_prefix.len != 0 && !is_foreign_name_valid(ac->link_prefix)) {
|
|
error(elem, "Invalid link prefix: %.*s", LIT(ac->link_prefix));
|
|
}
|
|
} else {
|
|
error(elem, "Expected a string value for '%.*s'", LIT(name));
|
|
}
|
|
return true;
|
|
} else if (name == "link_suffix") {
|
|
ExactValue ev = check_decl_attribute_value(c, value);
|
|
if (ev.kind == ExactValue_String) {
|
|
ac->link_suffix = ev.value_string;
|
|
if (ac->link_suffix.len != 0 && !is_foreign_name_valid(ac->link_suffix)) {
|
|
error(elem, "Invalid link suffix: %.*s", LIT(ac->link_suffix));
|
|
}
|
|
} else {
|
|
error(elem, "Expected a string value for '%.*s'", LIT(name));
|
|
}
|
|
return true;
|
|
} else if (name == "link_section") {
|
|
ExactValue ev = check_decl_attribute_value(c, value);
|
|
if (ev.kind == ExactValue_String) {
|
|
ac->link_section = ev.value_string;
|
|
if (!is_foreign_name_valid(ac->link_section)) {
|
|
error(elem, "Invalid link section: %.*s", LIT(ac->link_section));
|
|
}
|
|
} else {
|
|
error(elem, "Expected a string value for '%.*s'", LIT(name));
|
|
}
|
|
return true;
|
|
}
|
|
return false;
|
|
}
|
|
|
|
gb_internal DECL_ATTRIBUTE_PROC(const_decl_attribute) {
|
|
if (name == ATTRIBUTE_USER_TAG_NAME) {
|
|
ExactValue ev = check_decl_attribute_value(c, value);
|
|
if (ev.kind != ExactValue_String) {
|
|
error(elem, "Expected a string value for '%.*s'", LIT(name));
|
|
}
|
|
return true;
|
|
} else if (name == "private") {
|
|
// NOTE(bill): Handled elsewhere `check_collect_value_decl`
|
|
return true;
|
|
} else if (name == "static" ||
|
|
name == "thread_local" ||
|
|
name == "require" ||
|
|
name == "linkage" ||
|
|
name == "link_name" ||
|
|
name == "link_prefix" ||
|
|
name == "link_suffix" ||
|
|
name == "rodata" ||
|
|
false) {
|
|
error(elem, "@(%.*s) is not supported for compile time constant value declarations", LIT(name));
|
|
return true;
|
|
}
|
|
return false;
|
|
}
|
|
|
|
gb_internal DECL_ATTRIBUTE_PROC(type_decl_attribute) {
|
|
if (name == ATTRIBUTE_USER_TAG_NAME) {
|
|
ExactValue ev = check_decl_attribute_value(c, value);
|
|
if (ev.kind != ExactValue_String) {
|
|
error(elem, "Expected a string value for '%.*s'", LIT(name));
|
|
}
|
|
return true;
|
|
} else if (name == "private") {
|
|
// NOTE(bill): Handled elsewhere `check_collect_value_decl`
|
|
return true;
|
|
} else if (name == "objc_class") {
|
|
ExactValue ev = check_decl_attribute_value(c, value);
|
|
if (ev.kind != ExactValue_String || ev.value_string == "") {
|
|
error(elem, "Expected a non-empty string value for '%.*s'", LIT(name));
|
|
} else {
|
|
ac->objc_class = ev.value_string;
|
|
}
|
|
return true;
|
|
} else if (name == "objc_implement") {
|
|
ExactValue ev = check_decl_attribute_value(c, value);
|
|
if (ev.kind == ExactValue_Bool) {
|
|
ac->objc_is_implementation = ev.value_bool;
|
|
} else if (ev.kind == ExactValue_Invalid) {
|
|
ac->objc_is_implementation = true;
|
|
} else {
|
|
error(elem, "Expected a boolean value, or no value, for '%.*s'", LIT(name));
|
|
}
|
|
return true;
|
|
} else if (name == "objc_superclass") {
|
|
Type *objc_superclass = check_type(c, value);
|
|
|
|
if (objc_superclass != nullptr) {
|
|
ac->objc_superclass = objc_superclass;
|
|
} else {
|
|
error(value, "'%.*s' expected a named type", LIT(name));
|
|
}
|
|
return true;
|
|
} else if (name == "objc_ivar") {
|
|
Type *objc_ivar = check_type(c, value);
|
|
|
|
if (objc_ivar != nullptr && objc_ivar->kind == Type_Named) {
|
|
ac->objc_ivar = objc_ivar;
|
|
} else {
|
|
error(value, "'%.*s' expected a named type", LIT(name));
|
|
}
|
|
return true;
|
|
} else if (name == "objc_context_provider") {
|
|
Operand o = {};
|
|
check_expr(c, &o, value);
|
|
Entity *e = entity_of_node(o.expr);
|
|
|
|
if (e != nullptr) {
|
|
if (ac->objc_context_provider != nullptr) {
|
|
error(elem, "Previous usage of a 'objc_context_provider' attribute");
|
|
}
|
|
if (e->kind != Entity_Procedure) {
|
|
error(elem, "'objc_context_provider' must refer to a procedure");
|
|
} else {
|
|
ac->objc_context_provider = e;
|
|
}
|
|
|
|
return true;
|
|
}
|
|
} else if (name == "raddbg_type_view") {
|
|
ExactValue ev = check_decl_attribute_value(c, value);
|
|
if (ev.kind == ExactValue_Invalid) {
|
|
ac->raddbg_type_view = true;
|
|
} else if (ev.kind == ExactValue_String) {
|
|
ac->raddbg_type_view = true;
|
|
ac->raddbg_type_view_string = ev.value_string;
|
|
|
|
if (ev.value_string.len == 0) {
|
|
error(elem, "Expected a non-empty string for '%.*s'", LIT(name));
|
|
}
|
|
} else {
|
|
error(elem, "Expected a string or no value for '%.*s'", LIT(name));
|
|
}
|
|
return true;
|
|
} else if (name == "deprecated") {
|
|
ExactValue ev = check_decl_attribute_value(c, value);
|
|
|
|
if (ev.kind == ExactValue_String) {
|
|
String msg = ev.value_string;
|
|
if (msg.len == 0) {
|
|
error(elem, "Deprecation message cannot be an empty string");
|
|
} else {
|
|
ac->deprecated_message = msg;
|
|
}
|
|
} else {
|
|
error(elem, "Expected a string value for '%.*s'", LIT(name));
|
|
}
|
|
return true;
|
|
}
|
|
return false;
|
|
}
|
|
|
|
gb_internal DECL_ATTRIBUTE_PROC(asm_decl_attribute) {
|
|
if (name == ATTRIBUTE_USER_TAG_NAME) {
|
|
ExactValue ev = check_decl_attribute_value(c, value);
|
|
if (ev.kind != ExactValue_String) {
|
|
error(elem, "Expected a string value for '%.*s'", LIT(name));
|
|
}
|
|
return true;
|
|
} else if (name == "private") {
|
|
// NOTE(bill): Handled elsewhere `check_collect_value_decl`
|
|
return true;
|
|
} else if (name == "require_target_feature") {
|
|
ExactValue ev = check_decl_attribute_value(c, value);
|
|
if (ev.kind == ExactValue_String) {
|
|
ac->require_target_feature = ev.value_string;
|
|
} else {
|
|
error(elem, "Expected a string value for '%.*s'", LIT(name));
|
|
}
|
|
return true;
|
|
} else if (name == "enable_target_feature") {
|
|
ExactValue ev = check_decl_attribute_value(c, value);
|
|
if (ev.kind == ExactValue_String) {
|
|
ac->enable_target_feature = ev.value_string;
|
|
} else {
|
|
error(elem, "Expected a string value for '%.*s'", LIT(name));
|
|
}
|
|
return true;
|
|
}
|
|
return false;
|
|
}
|
|
|
|
#include "check_expr.cpp"
|
|
#include "check_builtin.cpp"
|
|
#include "check_type.cpp"
|
|
#include "name_canonicalization.cpp"
|
|
#include "check_decl.cpp"
|
|
#include "check_stmt.cpp"
|
|
|
|
|
|
|
|
gb_internal void check_decl_attributes(CheckerContext *c, Array<Ast *> const &attributes, DeclAttributeProc *proc, AttributeContext *ac) {
|
|
if (attributes.count == 0) return;
|
|
|
|
String original_link_prefix = {};
|
|
String original_link_suffix = {};
|
|
if (ac) {
|
|
original_link_prefix = ac->link_prefix;
|
|
original_link_suffix = ac->link_suffix;
|
|
}
|
|
|
|
StringSet set = {};
|
|
defer (string_set_destroy(&set));
|
|
|
|
bool is_runtime = false;
|
|
if (c->scope && c->scope->file && (c->scope->flags & ScopeFlag_File) &&
|
|
c->scope->file->pkg &&
|
|
c->scope->file->pkg->kind == Package_Runtime) {
|
|
is_runtime = true;
|
|
} else if (c->scope && c->scope->parent &&
|
|
(c->scope->flags & ScopeFlag_Proc) &&
|
|
(c->scope->parent->flags & ScopeFlag_File) &&
|
|
c->scope->parent->file->pkg &&
|
|
c->scope->parent->file->pkg->kind == Package_Runtime) {
|
|
is_runtime = true;
|
|
}
|
|
|
|
for_array(i, attributes) {
|
|
Ast *attr = attributes[i];
|
|
if (attr->kind != Ast_Attribute) continue;
|
|
for_array(j, attr->Attribute.elems) {
|
|
Ast *elem = attr->Attribute.elems[j];
|
|
String name = {};
|
|
Ast *value = nullptr;
|
|
|
|
switch (elem->kind) {
|
|
case_ast_node(i, Ident, elem);
|
|
name = i->token.string;
|
|
case_end;
|
|
case_ast_node(i, Implicit, elem);
|
|
name = i->string;
|
|
case_end;
|
|
case_ast_node(fv, FieldValue, elem);
|
|
if (fv->field->kind == Ast_Ident) {
|
|
name = fv->field->Ident.token.string;
|
|
} else if (fv->field->kind == Ast_Implicit) {
|
|
name = fv->field->Implicit.string;
|
|
} else {
|
|
GB_PANIC("Unknown Field Value name");
|
|
}
|
|
value = fv->value;
|
|
case_end;
|
|
default:
|
|
error(elem, "Invalid attribute element");
|
|
continue;
|
|
}
|
|
|
|
if (string_set_update(&set, name)) {
|
|
error(elem, "Previous declaration of '%.*s'", LIT(name));
|
|
continue;
|
|
}
|
|
|
|
if (name == "builtin" && is_runtime) {
|
|
continue;
|
|
}
|
|
|
|
if (!proc(c, elem, name, value, ac)) {
|
|
if (!build_context.ignore_unknown_attributes &&
|
|
!string_set_exists(&build_context.custom_attributes, name)) {
|
|
ERROR_BLOCK();
|
|
error(elem, "Unknown attribute element name '%.*s'", LIT(name));
|
|
error_line("\tDid you forget to use the build flag '-ignore-unknown-attributes' or '-custom-attribute:%.*s'?\n", LIT(name));
|
|
}
|
|
}
|
|
}
|
|
}
|
|
|
|
if (ac) {
|
|
if (ac->link_prefix.text == original_link_prefix.text) {
|
|
if (ac->link_name.len > 0) {
|
|
ac->link_prefix.text = nullptr;
|
|
ac->link_prefix.len = 0;
|
|
}
|
|
}
|
|
if (ac->link_suffix.text == original_link_suffix.text) {
|
|
if (ac->link_name.len > 0) {
|
|
ac->link_suffix.text = nullptr;
|
|
ac->link_suffix.len = 0;
|
|
}
|
|
}
|
|
}
|
|
}
|
|
|
|
|
|
gb_internal isize get_total_value_count(Slice<Ast *> const &values) {
|
|
isize count = 0;
|
|
for_array(i, values) {
|
|
Type *t = type_of_expr(values[i]);
|
|
if (t == nullptr) {
|
|
count += 1;
|
|
continue;
|
|
}
|
|
t = core_type(t);
|
|
if (t->kind == Type_Tuple) {
|
|
count += t->Tuple.variables.count;
|
|
} else {
|
|
count += 1;
|
|
}
|
|
}
|
|
return count;
|
|
}
|
|
|
|
gb_internal bool check_arity_match(CheckerContext *c, AstValueDecl *vd, bool is_global) {
|
|
isize lhs = vd->names.count;
|
|
isize rhs = 0;
|
|
if (is_global) {
|
|
// NOTE(bill): Disallow global variables to be multi-valued for a few reasons
|
|
rhs = vd->values.count;
|
|
} else {
|
|
rhs = get_total_value_count(vd->values);
|
|
}
|
|
|
|
if (rhs == 0) {
|
|
if (vd->type == nullptr) {
|
|
error(vd->names[0], "Missing type or initial expression");
|
|
return false;
|
|
}
|
|
} else if (lhs < rhs) {
|
|
if (lhs < vd->values.count) {
|
|
Ast *n = vd->values[lhs];
|
|
gbString str = expr_to_string(n);
|
|
error(n, "Extra initial expression '%s'", str);
|
|
gb_string_free(str);
|
|
} else {
|
|
error(vd->names[0], "Extra initial expression");
|
|
}
|
|
return false;
|
|
} else if (lhs > rhs) {
|
|
if (!is_global && rhs != 1) {
|
|
Ast *n = vd->names[rhs];
|
|
gbString str = expr_to_string(n);
|
|
error(n, "Missing expression for '%s'", str);
|
|
gb_string_free(str);
|
|
return false;
|
|
} else if (is_global) {
|
|
ERROR_BLOCK();
|
|
|
|
Ast *n = vd->values[rhs-1];
|
|
error(n, "Expected %td expressions on the right hand side, got %td", lhs, rhs);
|
|
error_line("Note: Global declarations do not allow for multi-valued expressions");
|
|
return false;
|
|
}
|
|
}
|
|
|
|
return true;
|
|
}
|
|
|
|
gb_internal void check_collect_entities_from_when_stmt(CheckerContext *c, AstWhenStmt *ws) {
|
|
Operand operand = {Addressing_Invalid};
|
|
if (!ws->is_cond_determined) {
|
|
check_expr(c, &operand, ws->cond);
|
|
if (operand.mode != Addressing_Invalid && !is_type_boolean(operand.type)) {
|
|
error(ws->cond, "Non-boolean condition in 'when' statement");
|
|
}
|
|
if (operand.mode != Addressing_Constant) {
|
|
error(ws->cond, "Non-constant condition in 'when' statement");
|
|
}
|
|
|
|
ws->is_cond_determined = true;
|
|
ws->determined_cond = operand.value.kind == ExactValue_Bool && operand.value.value_bool;
|
|
}
|
|
|
|
if (ws->body == nullptr || ws->body->kind != Ast_BlockStmt) {
|
|
error(ws->cond, "Invalid body for 'when' statement");
|
|
} else {
|
|
if (ws->determined_cond) {
|
|
check_collect_entities(c, ws->body->BlockStmt.stmts);
|
|
} else if (ws->else_stmt) {
|
|
switch (ws->else_stmt->kind) {
|
|
case Ast_BlockStmt:
|
|
check_collect_entities(c, ws->else_stmt->BlockStmt.stmts);
|
|
break;
|
|
case Ast_WhenStmt:
|
|
check_collect_entities_from_when_stmt(c, &ws->else_stmt->WhenStmt);
|
|
break;
|
|
default:
|
|
error(ws->else_stmt, "Invalid 'else' statement in 'when' statement");
|
|
break;
|
|
}
|
|
}
|
|
}
|
|
}
|
|
|
|
gb_internal void check_builtin_attributes(CheckerContext *ctx, Entity *e, Array<Ast *> *attributes) {
|
|
switch (e->kind) {
|
|
case Entity_ProcGroup:
|
|
case Entity_Procedure:
|
|
case Entity_TypeName:
|
|
case Entity_Constant:
|
|
// Okay
|
|
break;
|
|
default:
|
|
return;
|
|
}
|
|
if (!((ctx->scope->flags&ScopeFlag_File) && ctx->scope->file->pkg->kind == Package_Runtime)) {
|
|
return;
|
|
}
|
|
|
|
for_array(j, *attributes) {
|
|
Ast *attr = (*attributes)[j];
|
|
if (attr->kind != Ast_Attribute) continue;
|
|
for (isize k = 0; k < attr->Attribute.elems.count; k++) {
|
|
Ast *elem = attr->Attribute.elems[k];
|
|
String name = {};
|
|
Ast *value = nullptr;
|
|
|
|
switch (elem->kind) {
|
|
case_ast_node(i, Ident, elem);
|
|
name = i->token.string;
|
|
case_end;
|
|
case_ast_node(fv, FieldValue, elem);
|
|
GB_ASSERT(fv->field->kind == Ast_Ident);
|
|
name = fv->field->Ident.token.string;
|
|
value = fv->value;
|
|
case_end;
|
|
default:
|
|
continue;
|
|
}
|
|
|
|
if (name == "builtin") {
|
|
mutex_lock(&ctx->info->builtin_mutex);
|
|
add_entity(ctx, builtin_pkg->scope, nullptr, e);
|
|
auto interned = entity_interned_name(e);
|
|
u32 hash = e->interned_name_hash.load();
|
|
GB_ASSERT(scope_lookup(builtin_pkg->scope, interned, hash) != nullptr);
|
|
if (value != nullptr) {
|
|
error(value, "'builtin' cannot have a field value");
|
|
}
|
|
// Remove the builtin tag
|
|
// attr->Attribute.elems[k] = attr->Attribute.elems[attr->Attribute.elems.count-1];
|
|
// attr->Attribute.elems.count -= 1;
|
|
// k--;
|
|
|
|
mutex_unlock(&ctx->info->builtin_mutex);
|
|
}
|
|
}
|
|
}
|
|
|
|
for (isize i = 0; i < attributes->count; i++) {
|
|
Ast *attr = (*attributes)[i];
|
|
if (attr->kind != Ast_Attribute) continue;
|
|
if (attr->Attribute.elems.count == 0) {
|
|
(*attributes)[i] = (*attributes)[attributes->count-1];
|
|
attributes->count--;
|
|
i--;
|
|
}
|
|
}
|
|
}
|
|
|
|
gb_internal void check_collect_value_decl(CheckerContext *c, Ast *decl) {
|
|
if (decl->state_flags & StateFlag_BeenHandled) return;
|
|
decl->state_flags |= StateFlag_BeenHandled;
|
|
|
|
ast_node(vd, ValueDecl, decl);
|
|
|
|
EntityVisiblityKind entity_visibility_kind = c->foreign_context.visibility_kind;
|
|
bool is_test = false;
|
|
bool is_init = false;
|
|
bool is_fini = false;
|
|
bool is_priv = false;
|
|
|
|
for_array(i, vd->attributes) {
|
|
Ast *attr = vd->attributes[i];
|
|
if (attr->kind != Ast_Attribute) continue;
|
|
auto *elems = &attr->Attribute.elems;
|
|
for (isize j = 0; j < elems->count; j++) {
|
|
Ast *elem = (*elems)[j];
|
|
String name = {};
|
|
Ast *value = nullptr;
|
|
switch (elem->kind) {
|
|
case_ast_node(i, Ident, elem);
|
|
name = i->token.string;
|
|
case_end;
|
|
case_ast_node(fv, FieldValue, elem);
|
|
GB_ASSERT(fv->field->kind == Ast_Ident);
|
|
name = fv->field->Ident.token.string;
|
|
value = fv->value;
|
|
case_end;
|
|
default:
|
|
continue;
|
|
}
|
|
|
|
if (name == "private") {
|
|
EntityVisiblityKind kind = EntityVisiblity_PrivateToPackage;
|
|
bool success = false;
|
|
if (value != nullptr) {
|
|
if (value->kind == Ast_BasicLit && value->BasicLit.token.kind == Token_String) {
|
|
String v = {};
|
|
if (value->tav.value.kind == ExactValue_String) {
|
|
v = value->tav.value.value_string;
|
|
}
|
|
if (v == "file") {
|
|
kind = EntityVisiblity_PrivateToFile;
|
|
success = true;
|
|
} else if (v == "package") {
|
|
kind = EntityVisiblity_PrivateToPackage;
|
|
success = true;
|
|
}
|
|
}
|
|
} else {
|
|
success = true;
|
|
}
|
|
if (!success) {
|
|
error(value, "'%.*s' expects no parameter, or a string literal containing \"file\" or \"package\"", LIT(name));
|
|
} else {
|
|
is_priv = true;
|
|
}
|
|
|
|
|
|
|
|
if (entity_visibility_kind >= kind) {
|
|
error(elem, "Previous declaration of '%.*s'", LIT(name));
|
|
} else {
|
|
entity_visibility_kind = kind;
|
|
}
|
|
slice_unordered_remove(elems, j);
|
|
j -= 1;
|
|
} else if (name == "test") {
|
|
is_test = true;
|
|
} else if (name == "init") {
|
|
is_init = true;
|
|
} else if (name == "fini") {
|
|
is_fini = true;
|
|
}
|
|
}
|
|
}
|
|
|
|
if (is_priv && is_test) {
|
|
error(decl, "Attribute 'private' is not allowed on a test case");
|
|
return;
|
|
}
|
|
|
|
if (entity_visibility_kind == EntityVisiblity_Public &&
|
|
(c->scope->flags&ScopeFlag_File) &&
|
|
c->scope->file) {
|
|
if (c->scope->file->flags & AstFile_IsPrivateFile) {
|
|
entity_visibility_kind = EntityVisiblity_PrivateToFile;
|
|
} else if (c->scope->file->flags & AstFile_IsPrivatePkg) {
|
|
entity_visibility_kind = EntityVisiblity_PrivateToPackage;
|
|
}
|
|
}
|
|
|
|
if (entity_visibility_kind != EntityVisiblity_Public && !(c->scope->flags&ScopeFlag_File)) {
|
|
error(decl, "Attribute 'private' is not allowed on a non file scope entity");
|
|
}
|
|
|
|
|
|
if (vd->is_mutable) {
|
|
if (!(c->scope->flags&ScopeFlag_File)) {
|
|
// NOTE(bill): local scope -> handle later and in order
|
|
return;
|
|
}
|
|
|
|
for_array(i, vd->names) {
|
|
Ast *name = vd->names[i];
|
|
Ast *value = nullptr;
|
|
if (i < vd->values.count) {
|
|
value = vd->values[i];
|
|
}
|
|
if (name->kind != Ast_Ident) {
|
|
error(name, "A declaration's name must be an identifier, got %.*s", LIT(ast_strings[name->kind]));
|
|
continue;
|
|
}
|
|
Entity *e = alloc_entity_variable(c->scope, name->Ident.token, nullptr);
|
|
e->identifier = name;
|
|
e->file = c->file;
|
|
e->Variable.is_global = true;
|
|
|
|
if (entity_visibility_kind != EntityVisiblity_Public) {
|
|
e->flags |= EntityFlag_NotExported;
|
|
}
|
|
|
|
if (vd->is_using) {
|
|
vd->is_using = false; // NOTE(bill): This error will be only caught once
|
|
error(name, "'using' is not allowed at the file scope");
|
|
}
|
|
|
|
Ast *fl = c->foreign_context.curr_library;
|
|
if (fl != nullptr) {
|
|
GB_ASSERT(fl->kind == Ast_Ident);
|
|
e->Variable.is_foreign = true;
|
|
e->Variable.foreign_library_ident = fl;
|
|
|
|
e->Variable.link_prefix = c->foreign_context.link_prefix;
|
|
e->Variable.link_suffix = c->foreign_context.link_suffix;
|
|
}
|
|
|
|
Ast *init_expr = value;
|
|
DeclInfo *d = make_decl_info(c->scope, c->decl);
|
|
d->decl_node = decl;
|
|
d->comment = vd->comment;
|
|
d->docs = vd->docs;
|
|
d->entity = e;
|
|
d->type_expr = vd->type;
|
|
d->init_expr = init_expr;
|
|
d->attributes = vd->attributes;
|
|
|
|
bool is_exported = entity_visibility_kind != EntityVisiblity_PrivateToFile;
|
|
add_entity_and_decl_info(c, name, e, d, is_exported);
|
|
}
|
|
|
|
check_arity_match(c, vd, true);
|
|
} else {
|
|
for_array(i, vd->names) {
|
|
Ast *name = vd->names[i];
|
|
if (name->kind != Ast_Ident) {
|
|
error(name, "A declaration's name must be an identifier, got %.*s", LIT(ast_strings[name->kind]));
|
|
continue;
|
|
}
|
|
|
|
Ast *init = unparen_expr(vd->values[i]);
|
|
if (init == nullptr) {
|
|
error(name, "Expected a value for this constant value declaration");
|
|
continue;
|
|
}
|
|
|
|
Token token = name->Ident.token;
|
|
|
|
Ast *fl = c->foreign_context.curr_library;
|
|
Entity *e = nullptr;
|
|
DeclInfo *d = make_decl_info(c->scope, c->decl);
|
|
|
|
d->decl_node = decl;
|
|
d->comment = vd->comment;
|
|
d->docs = vd->docs;
|
|
d->attributes = vd->attributes;
|
|
d->type_expr = vd->type;
|
|
d->init_expr = init;
|
|
|
|
|
|
if (is_ast_type(init)) {
|
|
e = alloc_entity_type_name(d->scope, token, nullptr);
|
|
} else if (init->kind == Ast_ProcLit) {
|
|
if (c->scope->flags&ScopeFlag_Type) {
|
|
error(name, "Procedure declarations are not allowed within a struct");
|
|
continue;
|
|
}
|
|
ast_node(pl, ProcLit, init);
|
|
e = alloc_entity_procedure(d->scope, token, nullptr, pl->tags);
|
|
d->foreign_require_results = c->foreign_context.require_results;
|
|
if (fl != nullptr) {
|
|
GB_ASSERT(fl->kind == Ast_Ident);
|
|
e->Procedure.foreign_library_ident = fl;
|
|
e->Procedure.is_foreign = true;
|
|
|
|
GB_ASSERT(pl->type->kind == Ast_ProcType);
|
|
auto cc = pl->type->ProcType.calling_convention;
|
|
if (cc == ProcCC_ForeignBlockDefault) {
|
|
cc = ProcCC_CDecl;
|
|
if (c->foreign_context.default_cc > 0) {
|
|
cc = c->foreign_context.default_cc;
|
|
} else if (is_arch_wasm()) {
|
|
ERROR_BLOCK();
|
|
error(init, "For wasm related targets, it is required that you either define the"
|
|
" @(default_calling_convention=<string>) on the foreign block or"
|
|
" explicitly assign it on the procedure signature");
|
|
error_line("\tSuggestion: when dealing with normal Odin code (e.g. js_wasm32), use \"contextless\"; when dealing with Emscripten like code, use \"c\"\n");
|
|
}
|
|
}
|
|
e->Procedure.link_prefix = c->foreign_context.link_prefix;
|
|
e->Procedure.link_suffix = c->foreign_context.link_suffix;
|
|
|
|
GB_ASSERT(cc != ProcCC_Invalid);
|
|
pl->type->ProcType.calling_convention = cc;
|
|
}
|
|
d->proc_lit = init;
|
|
d->init_expr = init;
|
|
|
|
if (is_test) {
|
|
e->flags |= EntityFlag_Test;
|
|
}
|
|
if (is_init && is_fini) {
|
|
error(name, "A procedure cannot be both declared as @(init) and @(fini)");
|
|
} else if (is_init) {
|
|
e->flags |= EntityFlag_Init;
|
|
} else if (is_fini) {
|
|
e->flags |= EntityFlag_Fini;
|
|
}
|
|
} else if (init->kind == Ast_ProcGroup) {
|
|
ast_node(pg, ProcGroup, init);
|
|
e = alloc_entity_proc_group(d->scope, token, nullptr);
|
|
if (fl != nullptr) {
|
|
error(name, "Procedure groups are not allowed within a foreign block");
|
|
}
|
|
} else if (init->kind == Ast_AsmGroup) {
|
|
ast_node(ag, AsmGroup, init);
|
|
e = alloc_entity_proc_group(d->scope, token, nullptr);
|
|
e->ProcGroup.is_asm_group = true;
|
|
if (fl != nullptr) {
|
|
error(name, "Asm template groups are not allowed within a foreign block");
|
|
}
|
|
}else if (init->kind == Ast_AsmTemplate) {
|
|
if (c->scope->flags&ScopeFlag_Type) {
|
|
error(name, "Asm templates are not allowed within a struct");
|
|
continue;
|
|
}
|
|
ast_node(at, AsmTemplate, init);
|
|
e = alloc_entity_asm_template(d->scope, token, nullptr, init);
|
|
if (fl != nullptr) {
|
|
error(name, "Asm templates are not allowed within a foreign block");
|
|
}
|
|
d->init_expr = init;
|
|
} else {
|
|
e = alloc_entity_constant(d->scope, token, nullptr, empty_exact_value);
|
|
}
|
|
e->identifier = name;
|
|
|
|
if (entity_visibility_kind != EntityVisiblity_Public) {
|
|
e->flags |= EntityFlag_NotExported;
|
|
}
|
|
add_entity_flags_from_file(c, e, c->scope);
|
|
|
|
if (vd->is_using) {
|
|
if (e->kind == Entity_TypeName && init->kind == Ast_EnumType) {
|
|
d->is_using = true;
|
|
} else {
|
|
error(name, "'using' is not allowed on this constant value declaration");
|
|
}
|
|
}
|
|
|
|
if (e->kind != Entity_Procedure) {
|
|
if (fl != nullptr) {
|
|
ERROR_BLOCK();
|
|
|
|
AstKind kind = init->kind;
|
|
error(name, "Only procedures and variables are allowed to be in a foreign block, got %.*s", LIT(ast_strings[kind]));
|
|
if (kind == Ast_ProcType) {
|
|
error_line("\tDid you forget to append '---' to the procedure?\n");
|
|
}
|
|
}
|
|
}
|
|
|
|
if (c->trial_entities == nullptr) {
|
|
check_builtin_attributes(c, e, &d->attributes);
|
|
}
|
|
|
|
bool is_exported = entity_visibility_kind != EntityVisiblity_PrivateToFile;
|
|
add_entity_and_decl_info(c, name, e, d, is_exported);
|
|
}
|
|
|
|
check_arity_match(c, vd, true);
|
|
}
|
|
}
|
|
|
|
gb_internal void check_add_foreign_block_decl(CheckerContext *ctx, Ast *decl) {
|
|
ast_node(fb, ForeignBlockDecl, decl);
|
|
Ast *foreign_library = fb->foreign_library;
|
|
|
|
CheckerContext c = *ctx;
|
|
if (foreign_library->kind == Ast_Ident) {
|
|
c.foreign_context.curr_library = foreign_library;
|
|
} else {
|
|
error(foreign_library, "Foreign block name must be an identifier or 'export'");
|
|
c.foreign_context.curr_library = nullptr;
|
|
}
|
|
|
|
check_decl_attributes(&c, fb->attributes, foreign_block_decl_attribute, nullptr);
|
|
|
|
ast_node(block, BlockStmt, fb->body);
|
|
check_collect_entities(&c, block->stmts);
|
|
}
|
|
|
|
gb_internal bool correct_single_type_alias(CheckerContext *c, Entity *e) {
|
|
if (e->kind == Entity_Constant) {
|
|
DeclInfo *d = e->decl_info;
|
|
if (d != nullptr && d->init_expr != nullptr) {
|
|
Ast *init = d->init_expr;
|
|
// NOTE: in the scope of its own file, as a package's files may bind a name differently
|
|
Scope *prev_scope = c->scope;
|
|
c->scope = d->scope;
|
|
Entity *alias_of = check_entity_from_ident_or_selector(c, init, true);
|
|
c->scope = prev_scope;
|
|
if (alias_of != nullptr && alias_of->kind == Entity_TypeName) {
|
|
e->kind = Entity_TypeName;
|
|
return true;
|
|
}
|
|
}
|
|
}
|
|
return false;
|
|
}
|
|
|
|
gb_internal void correct_type_aliases_in_package(CheckerContext *c, AstPackage *pkg) {
|
|
// NOTE(bill, 2022-02-04): This is used to solve the problem caused by type aliases
|
|
// of type aliases being "confused" as constants
|
|
//
|
|
// A :: C
|
|
// B :: A
|
|
// C :: struct {b: ^B}
|
|
//
|
|
// See @TypeAliasingProblem for more information
|
|
TEMPORARY_ALLOCATOR_GUARD();
|
|
|
|
// NOTE(bill): Only a constant of an identifier can be corrected and a correction never changes what an identifier names
|
|
// This means that those are gathered once and corrected until a pass corrects none
|
|
auto candidates = array_make<Entity *>(temporary_allocator());
|
|
auto add_candidates = [&candidates](Scope *s) {
|
|
for (auto const &entry : s->elements) {
|
|
Entity *e = entry.value;
|
|
if (e != nullptr && e->kind == Entity_Constant && e->decl_info != nullptr &&
|
|
e->decl_info->init_expr != nullptr && e->decl_info->init_expr->kind == Ast_Ident) {
|
|
array_add(&candidates, e);
|
|
}
|
|
}
|
|
};
|
|
add_candidates(pkg->scope);
|
|
for (AstFile *f : pkg->files) {
|
|
add_candidates(f->scope);
|
|
}
|
|
|
|
for (bool corrected = true; corrected; /**/) {
|
|
corrected = false;
|
|
for (isize i = 0; i < candidates.count; /**/) {
|
|
if (correct_single_type_alias(c, candidates[i])) {
|
|
array_unordered_remove(&candidates, i);
|
|
corrected = true;
|
|
} else {
|
|
i += 1;
|
|
}
|
|
}
|
|
}
|
|
}
|
|
|
|
// NOTE(bill): If file_scopes == nullptr, this will act like a local scope
|
|
gb_internal void check_collect_entities(CheckerContext *c, Slice<Ast *> const &nodes) {
|
|
AstFile *curr_file = nullptr;
|
|
if ((c->scope->flags&ScopeFlag_File) != 0) {
|
|
curr_file = c->scope->file;
|
|
GB_ASSERT(curr_file != nullptr);
|
|
}
|
|
|
|
|
|
for_array(decl_index, nodes) {
|
|
Ast *decl = nodes[decl_index];
|
|
if (!is_ast_decl(decl) && !is_ast_when_stmt(decl)) {
|
|
// NOTE: global directives such as '#assert' are queued by `scan_global_decl_sources`
|
|
continue;
|
|
}
|
|
|
|
switch (decl->kind) {
|
|
case_ast_node(bd, BadDecl, decl);
|
|
case_end;
|
|
|
|
case_ast_node(ws, WhenStmt, decl);
|
|
// Will be handled later
|
|
case_end;
|
|
|
|
case_ast_node(vd, ValueDecl, decl);
|
|
check_collect_value_decl(c, decl);
|
|
case_end;
|
|
|
|
case_ast_node(id, ImportDecl, decl);
|
|
if (curr_file == nullptr) {
|
|
error(decl, "import declarations are only allowed in the file scope");
|
|
// NOTE(bill): _Should_ be caught by the parser
|
|
continue;
|
|
}
|
|
// Will be handled later
|
|
array_add(&curr_file->delayed_decls_queues[AstDelayQueue_Import], decl);
|
|
case_end;
|
|
|
|
case_ast_node(fl, ForeignImportDecl, decl);
|
|
if ((c->scope->flags&ScopeFlag_File) == 0) {
|
|
error(decl, "%.*s declarations are only allowed in the file scope", LIT(fl->token.string));
|
|
// NOTE(bill): _Should_ be caught by the parser
|
|
continue;
|
|
}
|
|
check_add_foreign_import_decl(c, decl);
|
|
case_end;
|
|
|
|
case_ast_node(fb, ForeignBlockDecl, decl);
|
|
// NOTE: global ones are resolved like global 'when's, see `resolve_global_decl_sources`
|
|
case_end;
|
|
|
|
default:
|
|
if (c->scope->flags&ScopeFlag_File) {
|
|
error(decl, "Only declarations are allowed at file scope");
|
|
}
|
|
break;
|
|
}
|
|
}
|
|
|
|
// correct_type_aliases(c);
|
|
|
|
// NOTE(bill): 'when' stmts need to be handled after the other as the condition may refer to something
|
|
// declared after this stmt in source
|
|
if (curr_file == nullptr) {
|
|
// For 'foreign' block statements that are not in file scope.
|
|
for_array(decl_index, nodes) {
|
|
Ast *decl = nodes[decl_index];
|
|
if (decl->kind == Ast_ForeignBlockDecl) {
|
|
check_add_foreign_block_decl(c, decl);
|
|
}
|
|
}
|
|
|
|
for_array(decl_index, nodes) {
|
|
Ast *decl = nodes[decl_index];
|
|
if (decl->kind == Ast_WhenStmt) {
|
|
check_collect_entities_from_when_stmt(c, &decl->WhenStmt);
|
|
}
|
|
}
|
|
}
|
|
}
|
|
|
|
gb_internal CheckerContext *create_checker_context(Checker *c) {
|
|
CheckerContext *ctx = permanent_alloc_item<CheckerContext>();
|
|
init_checker_context(ctx, c);
|
|
return ctx;
|
|
}
|
|
|
|
gb_internal void check_single_global_entity(Checker *c, Entity *e, DeclInfo *d, UntypedExprInfoMap *untyped) {
|
|
GB_ASSERT(e != nullptr);
|
|
if (e->state == EntityState_Resolved) {
|
|
// NOTE: also an alias already overridden by what it aliases, which may have no `DeclInfo`
|
|
return;
|
|
}
|
|
GB_ASSERT(d != nullptr);
|
|
|
|
if (d->scope != e->scope) {
|
|
return;
|
|
}
|
|
|
|
CheckerContext *ctx = create_checker_context(c);
|
|
|
|
GB_ASSERT(d->scope->flags&ScopeFlag_File);
|
|
AstFile *file = d->scope->file;
|
|
add_curr_ast_file(ctx, file);
|
|
AstPackage *pkg = file->pkg;
|
|
|
|
GB_ASSERT(ctx->pkg != nullptr);
|
|
GB_ASSERT(e->pkg != nullptr);
|
|
ctx->decl = d;
|
|
ctx->scope = d->scope;
|
|
ctx->untyped = untyped;
|
|
|
|
if (pkg->kind == Package_Init) {
|
|
if (e->kind != Entity_Procedure && e->token.string == "main") {
|
|
error(e->token, "'main' is reserved as the entry point procedure in the initial scope");
|
|
return;
|
|
}
|
|
}
|
|
|
|
check_entity_decl(ctx, e, d, nullptr);
|
|
}
|
|
|
|
|
|
gb_internal bool is_string_an_identifier(String s) {
|
|
isize offset = 0;
|
|
if (s.len < 1) {
|
|
return false;
|
|
}
|
|
while (offset < s.len) {
|
|
bool ok = false;
|
|
Rune r = -1;
|
|
isize size = utf8_decode(s.text+offset, s.len-offset, &r);
|
|
if (offset == 0) {
|
|
ok = rune_is_letter(r);
|
|
} else {
|
|
ok = rune_is_letter(r) || rune_is_digit(r);
|
|
}
|
|
|
|
if (!ok) {
|
|
return false;
|
|
}
|
|
offset += size;
|
|
}
|
|
|
|
return offset == s.len;
|
|
}
|
|
|
|
gb_internal String path_to_entity_name(String name, String fullpath, bool strip_extension=true) {
|
|
if (name.len != 0) {
|
|
return name;
|
|
}
|
|
// NOTE(bill): use file name (without extension) as the identifier
|
|
// If it is a valid identifier
|
|
String filename = fullpath;
|
|
isize slash = 0;
|
|
isize dot = 0;
|
|
for (isize i = filename.len-1; i >= 0; i--) {
|
|
u8 c = filename[i];
|
|
if (c == '/' || c == '\\') {
|
|
break;
|
|
}
|
|
slash = i;
|
|
}
|
|
|
|
filename = substring(filename, slash, filename.len);
|
|
|
|
if (strip_extension) {
|
|
dot = filename.len;
|
|
while (dot --> 0) {
|
|
u8 c = filename[dot];
|
|
if (c == '.') {
|
|
break;
|
|
}
|
|
}
|
|
|
|
if (dot > 0) {
|
|
filename = substring(filename, 0, dot);
|
|
}
|
|
}
|
|
|
|
if (is_string_an_identifier(filename)) {
|
|
return filename;
|
|
} else {
|
|
return str_lit("_");
|
|
}
|
|
}
|
|
|
|
|
|
|
|
|
|
|
|
#if 1
|
|
|
|
gb_internal void add_import_dependency_node(Checker *c, Ast *decl, PtrMap<AstPackage *, ImportGraphNode *> *M) {
|
|
AstPackage *parent_pkg = decl->file()->pkg;
|
|
|
|
switch (decl->kind) {
|
|
case_ast_node(id, ImportDecl, decl);
|
|
String path = id->fullpath;
|
|
if (is_package_name_reserved(path)) {
|
|
return;
|
|
}
|
|
AstPackage **found = string_map_get(&c->info.packages, path);
|
|
if (found == nullptr) {
|
|
Token token = ast_token(decl);
|
|
error(token, "Unable to find package: %.*s", LIT(path));
|
|
exit_with_errors();
|
|
}
|
|
AstPackage *child_pkg = *found;
|
|
GB_ASSERT(child_pkg->scope != nullptr);
|
|
|
|
id->package = child_pkg;
|
|
|
|
ImportGraphNode **found_node = map_get(M, child_pkg);
|
|
GB_ASSERT(found_node != nullptr);
|
|
ImportGraphNode *child = *found_node;
|
|
|
|
found_node = map_get(M, parent_pkg);
|
|
GB_ASSERT(found_node != nullptr);
|
|
ImportGraphNode *parent = *found_node;
|
|
|
|
import_graph_node_set_add(&parent->succ, child);
|
|
import_graph_node_set_add(&child->pred, parent);
|
|
ptr_set_add(&parent->scope->imported, child->scope);
|
|
case_end;
|
|
|
|
case_ast_node(ws, WhenStmt, decl);
|
|
if (ws->body != nullptr) {
|
|
auto stmts = ws->body->BlockStmt.stmts;
|
|
for_array(i, stmts) {
|
|
add_import_dependency_node(c, stmts[i], M);
|
|
}
|
|
}
|
|
|
|
if (ws->else_stmt != nullptr) {
|
|
switch (ws->else_stmt->kind) {
|
|
case Ast_BlockStmt: {
|
|
auto stmts = ws->else_stmt->BlockStmt.stmts;
|
|
for_array(i, stmts) {
|
|
add_import_dependency_node(c, stmts[i], M);
|
|
}
|
|
|
|
break;
|
|
}
|
|
case Ast_WhenStmt:
|
|
add_import_dependency_node(c, ws->else_stmt, M);
|
|
break;
|
|
}
|
|
}
|
|
case_end;
|
|
}
|
|
}
|
|
|
|
gb_internal Array<ImportGraphNode *> generate_import_dependency_graph(Checker *c, gbAllocator allocator) {
|
|
PtrMap<AstPackage *, ImportGraphNode *> M = {};
|
|
map_init(&M, 2*c->parser->packages.count);
|
|
defer (map_destroy(&M));
|
|
|
|
for_array(i, c->parser->packages) {
|
|
AstPackage *pkg = c->parser->packages[i];
|
|
ImportGraphNode *n = import_graph_node_create(allocator, pkg);
|
|
map_set(&M, pkg, n);
|
|
}
|
|
|
|
// Calculate edges for graph M
|
|
for_array(i, c->parser->packages) {
|
|
AstPackage *p = c->parser->packages[i];
|
|
for_array(j, p->files) {
|
|
AstFile *f = p->files[j];
|
|
for_array(k, f->decls) {
|
|
Ast *decl = f->decls[k];
|
|
add_import_dependency_node(c, decl, &M);
|
|
}
|
|
}
|
|
}
|
|
|
|
Array<ImportGraphNode *> G = {};
|
|
array_init(&G, allocator, 0, M.count);
|
|
|
|
isize i = 0;
|
|
for (auto const &entry : M) {
|
|
auto n = entry.value;
|
|
n->index = i++;
|
|
n->dep_count = n->succ.count;
|
|
GB_ASSERT(n->dep_count >= 0);
|
|
array_add(&G, n);
|
|
}
|
|
|
|
return G;
|
|
}
|
|
|
|
struct ImportPathItem {
|
|
AstPackage *pkg;
|
|
Ast * decl;
|
|
};
|
|
|
|
gb_internal Array<ImportPathItem> find_import_path(Checker *c, AstPackage *start, AstPackage *end, PtrSet<AstPackage *> *visited, gbAllocator allocator) {
|
|
Array<ImportPathItem> empty_path = {};
|
|
|
|
if (ptr_set_update(visited, start)) {
|
|
return empty_path;
|
|
}
|
|
|
|
String path = start->fullpath;
|
|
AstPackage **found = string_map_get(&c->info.packages, path);
|
|
if (found) {
|
|
AstPackage *pkg = *found;
|
|
GB_ASSERT(pkg != nullptr);
|
|
|
|
for_array(i, pkg->files) {
|
|
AstFile *f = pkg->files[i];
|
|
for_array(j, f->imports) {
|
|
AstPackage *pkg = nullptr;
|
|
Ast *decl = f->imports[j];
|
|
if (decl->kind == Ast_ImportDecl) {
|
|
pkg = decl->ImportDecl.package;
|
|
} else {
|
|
continue;
|
|
}
|
|
if (pkg == nullptr || pkg->scope == nullptr) {
|
|
continue;
|
|
}
|
|
|
|
// if (pkg->kind == Package_Runtime) {
|
|
// // NOTE(bill): Allow cyclic imports within the runtime package for the time being
|
|
// continue;
|
|
// }
|
|
|
|
ImportPathItem item = {pkg, decl};
|
|
if (pkg == end) {
|
|
auto path = array_make<ImportPathItem>(allocator);
|
|
array_add(&path, item);
|
|
return path;
|
|
}
|
|
auto next_path = find_import_path(c, pkg, end, visited, allocator);
|
|
if (next_path.count > 0) {
|
|
array_add(&next_path, item);
|
|
return next_path;
|
|
}
|
|
}
|
|
}
|
|
}
|
|
return empty_path;
|
|
}
|
|
#endif
|
|
|
|
gb_internal String get_invalid_import_name(String input) {
|
|
isize slash = 0;
|
|
for (isize i = input.len-1; i >= 0; i--) {
|
|
if (input[i] == '/' || input[i] == '\\') {
|
|
break;
|
|
}
|
|
slash = i;
|
|
}
|
|
input = substring(input, slash, input.len);
|
|
return input;
|
|
}
|
|
|
|
gb_internal DECL_ATTRIBUTE_PROC(import_decl_attribute) {
|
|
if (name == ATTRIBUTE_USER_TAG_NAME) {
|
|
ExactValue ev = check_decl_attribute_value(c, value);
|
|
if (ev.kind != ExactValue_String) {
|
|
error(elem, "Expected a string value for '%.*s'", LIT(name));
|
|
}
|
|
return true;
|
|
} else if (name == "require") {
|
|
if (value != nullptr) {
|
|
error(elem, "Expected no parameter for '%.*s'", LIT(name));
|
|
}
|
|
ac->require_declaration = true;
|
|
return true;
|
|
}
|
|
return false;
|
|
}
|
|
|
|
gb_internal void check_add_import_decl(CheckerContext *ctx, Ast *decl) {
|
|
if (decl->state_flags & StateFlag_BeenHandled) return;
|
|
decl->state_flags |= StateFlag_BeenHandled;
|
|
|
|
ast_node(id, ImportDecl, decl);
|
|
Token token = id->relpath;
|
|
|
|
Scope *parent_scope = ctx->scope;
|
|
GB_ASSERT(parent_scope->flags&ScopeFlag_File);
|
|
|
|
auto *pkgs = &ctx->checker->info.packages;
|
|
|
|
Scope *scope = nullptr;
|
|
|
|
bool force_use = false;
|
|
|
|
if (id->fullpath == "builtin") {
|
|
scope = builtin_pkg->scope;
|
|
force_use = true;
|
|
} else if (id->fullpath == "intrinsics") {
|
|
scope = intrinsics_pkg->scope;
|
|
force_use = true;
|
|
} else {
|
|
AstPackage **found = string_map_get(pkgs, id->fullpath);
|
|
if (found == nullptr) {
|
|
for (auto const &entry : *pkgs) {
|
|
AstPackage *pkg = entry.value;
|
|
gb_printf_err("%.*s\n", LIT(pkg->fullpath));
|
|
}
|
|
gb_printf_err("%s\n", token_pos_to_string(token.pos));
|
|
GB_PANIC("Unable to find scope for package: %.*s", LIT(id->fullpath));
|
|
} else {
|
|
AstPackage *pkg = *found;
|
|
scope = pkg->scope;
|
|
}
|
|
}
|
|
GB_ASSERT(scope->flags&ScopeFlag_Pkg);
|
|
|
|
|
|
ptr_set_add(&parent_scope->imported, scope);
|
|
// if (ptr_set_update(&parent_scope->imported, scope)) {
|
|
// // error(token, "Multiple import of the same file within this scope");
|
|
// }
|
|
|
|
String import_name = path_to_entity_name(id->import_name.string, id->fullpath, false);
|
|
if (is_blank_ident(import_name)) {
|
|
force_use = true;
|
|
}
|
|
|
|
AttributeContext ac = {};
|
|
check_decl_attributes(ctx, id->attributes, import_decl_attribute, &ac);
|
|
if (ac.require_declaration) {
|
|
force_use = true;
|
|
}
|
|
|
|
|
|
if (is_blank_ident(import_name) && !is_blank_ident(id->import_name.string)) {
|
|
String invalid_name = id->fullpath;
|
|
invalid_name = get_invalid_import_name(invalid_name);
|
|
|
|
ERROR_BLOCK();
|
|
|
|
if (id->import_name.string.len > 0) {
|
|
error(token, "Import name '%.*s' is not a valid identifier", LIT(id->import_name.string));
|
|
} else {
|
|
error(id->token, "Import name '%.*s' is not a valid identifier", LIT(invalid_name));
|
|
error_line("\tSuggestion: Rename the directory or explicitly set an import name like this 'import <new_name> %.*s'", LIT(id->relpath.string));
|
|
}
|
|
} else {
|
|
GB_ASSERT(id->import_name.pos.line != 0);
|
|
id->import_name.string = import_name;
|
|
Entity *e = alloc_entity_import_name(parent_scope, id->import_name, t_invalid,
|
|
id->fullpath, id->import_name.string,
|
|
scope);
|
|
|
|
add_entity(ctx, parent_scope, nullptr, e);
|
|
if (force_use) {
|
|
add_entity_use(ctx, nullptr, e);
|
|
}
|
|
}
|
|
|
|
scope->flags |= ScopeFlag_HasBeenImported;
|
|
}
|
|
|
|
gb_internal DECL_ATTRIBUTE_PROC(foreign_import_decl_attribute) {
|
|
if (name == ATTRIBUTE_USER_TAG_NAME) {
|
|
ExactValue ev = check_decl_attribute_value(c, value);
|
|
if (ev.kind != ExactValue_String) {
|
|
error(elem, "Expected a string value for '%.*s'", LIT(name));
|
|
}
|
|
return true;
|
|
} else if (name == "export") {
|
|
ac->is_export = true;
|
|
return true;
|
|
} else if (name == "force" || name == "require") {
|
|
if (value != nullptr) {
|
|
error(elem, "Expected no parameter for '%.*s'", LIT(name));
|
|
} else if (name == "force") {
|
|
error(elem, "'force' was replaced with 'require'");
|
|
}
|
|
ac->require_declaration = true;
|
|
return true;
|
|
} else if (name == "priority_index") {
|
|
ExactValue ev = check_decl_attribute_value(c, value);
|
|
if (ev.kind != ExactValue_Integer) {
|
|
error(elem, "Expected an integer value for '%.*s'", LIT(name));
|
|
} else {
|
|
ac->foreign_import_priority_index = exact_value_to_i64(ev);
|
|
}
|
|
return true;
|
|
} else if (name == "extra_linker_flags") {
|
|
ExactValue ev = check_decl_attribute_value(c, value);
|
|
if (ev.kind != ExactValue_String) {
|
|
error(elem, "Expected a string value for '%.*s'", LIT(name));
|
|
} else {
|
|
ac->extra_linker_flags = ev.value_string;
|
|
}
|
|
return true;
|
|
} else if (name == "ignore_duplicates") {
|
|
if (value != nullptr) {
|
|
error(elem, "Expected no parameter for '%.*s'", LIT(name));
|
|
}
|
|
ac->ignore_duplicates = true;
|
|
return true;
|
|
}
|
|
return false;
|
|
}
|
|
|
|
gb_internal void check_foreign_import_fullpaths(Checker *c) {
|
|
CheckerContext ctx = {};
|
|
init_checker_context(&ctx, c);
|
|
|
|
UntypedExprInfoMap untyped = {};
|
|
defer (map_destroy(&untyped));
|
|
|
|
for (Entity *e = nullptr; mpsc_dequeue(&c->info.foreign_imports_to_check_fullpaths, &e); /**/) {
|
|
GB_ASSERT(e != nullptr);
|
|
GB_ASSERT(e->kind == Entity_LibraryName);
|
|
Ast *decl = e->LibraryName.decl;
|
|
ast_node(fl, ForeignImportDecl, decl);
|
|
|
|
AstFile *f = decl->file();
|
|
|
|
reset_checker_context(&ctx, f, &untyped);
|
|
|
|
GB_ASSERT(ctx.scope == e->scope);
|
|
|
|
AttributeContext ac = {};
|
|
check_decl_attributes(&ctx, fl->attributes, foreign_import_decl_attribute, &ac);
|
|
if (ac.require_declaration) {
|
|
mpsc_enqueue(&ctx.info->required_foreign_imports_through_force_queue, e);
|
|
add_entity_use(&ctx, nullptr, e);
|
|
}
|
|
if (ac.foreign_import_priority_index != 0) {
|
|
e->LibraryName.priority_index = ac.foreign_import_priority_index;
|
|
}
|
|
if (ac.ignore_duplicates) {
|
|
e->LibraryName.ignore_duplicates = true;
|
|
}
|
|
String extra_linker_flags = string_trim_whitespace(ac.extra_linker_flags);
|
|
if (extra_linker_flags.len != 0) {
|
|
e->LibraryName.extra_linker_flags = extra_linker_flags;
|
|
}
|
|
|
|
if (fl->fullpaths.count == 0) {
|
|
String base_dir = dir_from_path(decl->file()->fullpath);
|
|
|
|
auto fullpaths = array_make<String>(permanent_allocator(), 0, fl->filepaths.count);
|
|
|
|
for (Ast *fp_node : fl->filepaths) {
|
|
Operand op = {};
|
|
check_expr(&ctx, &op, fp_node);
|
|
if (op.mode != Addressing_Constant && op.value.kind != ExactValue_String) {
|
|
gbString s = expr_to_string(op.expr);
|
|
error(fp_node, "Expected a constant string value, got '%s'", s);
|
|
gb_string_free(s);
|
|
continue;
|
|
}
|
|
if (!is_type_string(op.type)) {
|
|
gbString s = type_to_string(op.type);
|
|
error(fp_node, "Expected a constant string value, got value of type '%s'", s);
|
|
gb_string_free(s);
|
|
continue;
|
|
}
|
|
|
|
String file_str = op.value.value_string;
|
|
file_str = string_trim_whitespace(file_str);
|
|
String fullpath = file_str;
|
|
if (!is_arch_wasm() || string_ends_with(file_str, str_lit(".o"))) {
|
|
String foreign_path = {};
|
|
bool ok = determine_path_from_string(true, decl, base_dir, file_str, &foreign_path, /*use error not syntax_error*/true);
|
|
if (ok) {
|
|
fullpath = foreign_path;
|
|
}
|
|
}
|
|
array_add(&fullpaths, fullpath);
|
|
}
|
|
fl->fullpaths = slice_from_array(fullpaths);
|
|
}
|
|
|
|
for (String const &path : fl->fullpaths) {
|
|
String ext = path_extension(path);
|
|
if (str_eq_ignore_case(ext, ".c") ||
|
|
str_eq_ignore_case(ext, ".cpp") ||
|
|
str_eq_ignore_case(ext, ".cxx") ||
|
|
str_eq_ignore_case(ext, ".h") ||
|
|
str_eq_ignore_case(ext, ".hpp") ||
|
|
str_eq_ignore_case(ext, ".hxx") ||
|
|
false
|
|
) {
|
|
error(fl->token, "With 'foreign import', you cannot import a %.*s file/directory, you must precompile the library and link against that", LIT(ext));
|
|
break;
|
|
}
|
|
}
|
|
|
|
add_untyped_expressions(ctx.info, &untyped);
|
|
|
|
e->LibraryName.paths = fl->fullpaths;
|
|
}
|
|
|
|
for (Entity *e = nullptr; mpsc_dequeue(&c->info.foreign_decls_to_check, &e); /**/) {
|
|
GB_ASSERT(e != nullptr);
|
|
if (e->kind != Entity_Procedure) {
|
|
continue;
|
|
}
|
|
if (!is_arch_wasm()) {
|
|
continue;
|
|
}
|
|
Entity *foreign_library = e->Procedure.foreign_library;
|
|
GB_ASSERT(foreign_library != nullptr);
|
|
|
|
String name = e->Procedure.link_name;
|
|
|
|
String module_name = str_lit("env");
|
|
GB_ASSERT (foreign_library->kind == Entity_LibraryName);
|
|
if (foreign_library->LibraryName.paths.count != 1) {
|
|
error(foreign_library->token, "'foreign import' for '%.*s' architecture may only have one path, got %td",
|
|
LIT(target_arch_names[build_context.metrics.arch]), foreign_library->LibraryName.paths.count);
|
|
}
|
|
|
|
if (foreign_library->LibraryName.paths.count >= 1) {
|
|
module_name = foreign_library->LibraryName.paths[0];
|
|
}
|
|
|
|
if (!string_ends_with(module_name, str_lit(".o"))) {
|
|
name = concatenate3_strings(permanent_allocator(), module_name, WASM_MODULE_NAME_SEPARATOR, name);
|
|
}
|
|
e->Procedure.link_name = name;
|
|
|
|
check_foreign_procedure(&ctx, e, e->decl_info);
|
|
}
|
|
}
|
|
|
|
gb_internal void check_add_foreign_import_decl(CheckerContext *ctx, Ast *decl) {
|
|
if (decl->state_flags & StateFlag_BeenHandled) return;
|
|
decl->state_flags |= StateFlag_BeenHandled;
|
|
|
|
ast_node(fl, ForeignImportDecl, decl);
|
|
|
|
Scope *parent_scope = ctx->scope;
|
|
GB_ASSERT(parent_scope->flags&ScopeFlag_File);
|
|
|
|
String library_name = fl->library_name.string;
|
|
if (library_name.len == 0 && fl->fullpaths.count != 0) {
|
|
String fullpath = fl->fullpaths[0];
|
|
library_name = path_to_entity_name(fl->library_name.string, fullpath);
|
|
}
|
|
if (library_name.len == 0 || is_blank_ident(library_name)) {
|
|
error(fl->token, "File name, '%.*s', cannot be as a library name as it is not a valid identifier", LIT(library_name));
|
|
return;
|
|
}
|
|
|
|
|
|
GB_ASSERT(fl->library_name.pos.line != 0);
|
|
fl->library_name.string = library_name;
|
|
|
|
// NOTE(bill): Only 'export' is needed to declare the entity; the attribute values are evaluated in
|
|
// `check_foreign_import_fullpaths` as the globals they may name are not all collected yet
|
|
bool is_export = false;
|
|
for (Ast *attr : fl->attributes) {
|
|
if (attr->kind != Ast_Attribute) continue;
|
|
for (Ast *elem : attr->Attribute.elems) {
|
|
Ast *name = elem->kind == Ast_FieldValue ? elem->FieldValue.field : elem;
|
|
if (name->kind == Ast_Ident && name->Ident.token.string == "export") {
|
|
is_export = true;
|
|
}
|
|
}
|
|
}
|
|
|
|
Scope *scope = parent_scope;
|
|
if (is_export) {
|
|
scope = parent_scope->parent;
|
|
}
|
|
|
|
Entity *e = alloc_entity_library_name(parent_scope, fl->library_name, t_invalid,
|
|
fl->fullpaths, library_name);
|
|
e->LibraryName.decl = decl;
|
|
add_entity_flags_from_file(ctx, e, parent_scope);
|
|
add_entity(ctx, scope, nullptr, e);
|
|
|
|
mpsc_enqueue(&ctx->info->foreign_imports_to_check_fullpaths, e);
|
|
|
|
}
|
|
|
|
gb_internal GB_COMPARE_PROC(sort_file_by_name) {
|
|
AstFile const *x = *cast(AstFile const **)a;
|
|
AstFile const *y = *cast(AstFile const **)b;
|
|
String x_name = filename_from_path(x->fullpath);
|
|
String y_name = filename_from_path(y->fullpath);
|
|
return string_compare(x_name, y_name);
|
|
}
|
|
|
|
gb_internal void check_create_file_scopes(Checker *c) {
|
|
for_array(i, c->parser->packages) {
|
|
AstPackage *pkg = c->parser->packages[i];
|
|
|
|
array_sort(pkg->files, sort_file_by_name);
|
|
|
|
isize total_pkg_decl_count = 0;
|
|
for_array(j, pkg->files) {
|
|
AstFile *f = pkg->files[j];
|
|
f->index_in_pkg = cast(i32)j;
|
|
string_map_set(&c->info.files, f->fullpath, f);
|
|
|
|
create_scope_from_file(nullptr, f);
|
|
total_pkg_decl_count += f->total_file_decl_count;
|
|
}
|
|
|
|
mpmc_init(&pkg->exported_entity_queue, total_pkg_decl_count);
|
|
}
|
|
}
|
|
|
|
struct CollectEntityWorkerData {
|
|
Checker *c;
|
|
CheckerContext ctx;
|
|
UntypedExprInfoMap untyped;
|
|
};
|
|
|
|
gb_global CollectEntityWorkerData *collect_entity_worker_data;
|
|
|
|
gb_internal WORKER_TASK_PROC(check_collect_entities_all_worker_proc) {
|
|
CollectEntityWorkerData *wd = &collect_entity_worker_data[current_thread_index()];
|
|
|
|
Checker *c = wd->c;
|
|
CheckerContext *ctx = &wd->ctx;
|
|
UntypedExprInfoMap *untyped = &wd->untyped;
|
|
|
|
AstFile *f = cast(AstFile *)data;
|
|
reset_checker_context(ctx, f, untyped);
|
|
|
|
check_collect_entities(ctx, f->decls);
|
|
|
|
add_untyped_expressions(&c->info, ctx->untyped);
|
|
|
|
return 0;
|
|
}
|
|
|
|
gb_internal void check_collect_entities_all(Checker *c) {
|
|
isize thread_count = global_thread_pool.threads.count;
|
|
|
|
collect_entity_worker_data = gb_alloc_array(permanent_allocator(), CollectEntityWorkerData, thread_count);
|
|
for (isize i = 0; i < thread_count; i++) {
|
|
auto *wd = &collect_entity_worker_data[i];
|
|
wd->c = c;
|
|
init_checker_context(&wd->ctx, c);
|
|
map_init(&wd->untyped);
|
|
}
|
|
|
|
for (auto const &entry : c->info.files) {
|
|
AstFile *f = entry.value;
|
|
thread_pool_add_task(check_collect_entities_all_worker_proc, f);
|
|
}
|
|
thread_pool_wait();
|
|
}
|
|
|
|
gb_internal void check_export_entities_in_pkg(CheckerContext *ctx, AstPackage *pkg, UntypedExprInfoMap *untyped) {
|
|
if (pkg->files.count != 0) {
|
|
AstPackageExportedEntity item = {};
|
|
while (mpmc_dequeue(&pkg->exported_entity_queue, &item)) {
|
|
AstFile *f = item.entity->file;
|
|
if (ctx->file != f) {
|
|
reset_checker_context(ctx, f, untyped);
|
|
}
|
|
add_entity(ctx, pkg->scope, item.identifier, item.entity);
|
|
add_untyped_expressions(ctx->info, untyped);
|
|
}
|
|
}
|
|
}
|
|
|
|
gb_internal WORKER_TASK_PROC(check_export_entities_worker_proc) {
|
|
AstPackage *pkg = (AstPackage *)data;
|
|
auto *wd = &collect_entity_worker_data[current_thread_index()];
|
|
check_export_entities_in_pkg(&wd->ctx, pkg, &wd->untyped);
|
|
return 0;
|
|
}
|
|
|
|
|
|
gb_internal void check_export_entities(Checker *c) {
|
|
isize thread_count = global_thread_pool.threads.count;
|
|
|
|
// NOTE(bill): reuse `collect_entity_worker_data`
|
|
|
|
for (isize i = 0; i < thread_count; i++) {
|
|
auto *wd = &collect_entity_worker_data[i];
|
|
map_clear(&wd->untyped);
|
|
init_checker_context(&wd->ctx, c);
|
|
}
|
|
|
|
for (auto const &entry : c->info.packages) {
|
|
AstPackage *pkg = entry.value;
|
|
thread_pool_add_task(check_export_entities_worker_proc, pkg);
|
|
}
|
|
thread_pool_wait();
|
|
}
|
|
|
|
#include "checker_global.cpp"
|
|
|
|
gb_internal WORKER_TASK_PROC(correct_type_aliases_worker_proc) {
|
|
AstPackage *pkg = cast(AstPackage *)data;
|
|
auto *wd = &collect_entity_worker_data[current_thread_index()];
|
|
correct_type_aliases_in_package(&wd->ctx, pkg);
|
|
return 0;
|
|
}
|
|
|
|
gb_internal void check_import_entities(Checker *c) {
|
|
TEMPORARY_ALLOCATOR_GUARD();
|
|
|
|
Array<ImportGraphNode *> dep_graph = generate_import_dependency_graph(c, temporary_allocator());
|
|
|
|
TIME_SECTION("check_import_entities - sort packages");
|
|
// NOTE(bill): Priority queue
|
|
auto pq = priority_queue_create(dep_graph, import_graph_node_cmp, import_graph_node_swap);
|
|
|
|
PtrSet<AstPackage *> emitted = {};
|
|
defer (ptr_set_destroy(&emitted));
|
|
|
|
Array<ImportGraphNode *> package_order = {};
|
|
array_init(&package_order, temporary_allocator(), 0, c->parser->packages.count);
|
|
|
|
while (pq.queue.count > 0) {
|
|
ImportGraphNode *n = priority_queue_pop(&pq);
|
|
|
|
AstPackage *pkg = n->pkg;
|
|
|
|
if (n->dep_count > 0) {
|
|
TEMPORARY_ALLOCATOR_GUARD();
|
|
|
|
PtrSet<AstPackage *> visited = {};
|
|
defer (ptr_set_destroy(&visited));
|
|
|
|
auto path = find_import_path(c, pkg, pkg, &visited, temporary_allocator());
|
|
|
|
if (path.count > 1) {
|
|
ImportPathItem item = path[path.count-1];
|
|
String pkg_name = item.pkg->name;
|
|
error(item.decl, "Cyclic importation of '%.*s'", LIT(pkg_name));
|
|
for (isize i = 0; i < path.count; i++) {
|
|
error(item.decl, "'%.*s' refers to", LIT(pkg_name));
|
|
item = path[i];
|
|
pkg_name = item.pkg->name;
|
|
}
|
|
error(item.decl, "'%.*s'", LIT(pkg_name));
|
|
}
|
|
}
|
|
|
|
FOR_PTR_SET(p, n->pred) {
|
|
p->dep_count = gb_max(p->dep_count-1, 0);
|
|
priority_queue_fix(&pq, p->index);
|
|
}
|
|
|
|
if (pkg == nullptr) {
|
|
continue;
|
|
}
|
|
if (ptr_set_update(&emitted, pkg)) {
|
|
continue;
|
|
}
|
|
|
|
array_add(&package_order, n);
|
|
}
|
|
|
|
CheckerContext ctx = {};
|
|
init_checker_context(&ctx, c);
|
|
defer (destroy_checker_context(&ctx));
|
|
|
|
UntypedExprInfoMap untyped = {};
|
|
defer (map_destroy(&untyped));
|
|
|
|
TIME_SECTION("check_import_entities - imports");
|
|
// NOTE(bill): every import first, as resolving a 'when' may check declarations in any package
|
|
u64 stage_start = global_import_stage_begin();
|
|
for (isize pkg_index = 0; pkg_index < package_order.count; pkg_index++) {
|
|
AstPackage *pkg = package_order[pkg_index]->pkg;
|
|
pkg->order = 1+pkg_index;
|
|
|
|
for (AstFile *f : pkg->files) {
|
|
reset_checker_context(&ctx, f, &untyped);
|
|
for (Ast *decl : f->delayed_decls_queues[AstDelayQueue_Import]) {
|
|
check_add_import_decl(&ctx, decl);
|
|
}
|
|
array_clear(&f->delayed_decls_queues[AstDelayQueue_Import]);
|
|
add_untyped_expressions(ctx.info, &untyped);
|
|
}
|
|
}
|
|
global_import_stage_end(GlobalImportStage_Imports, stage_start);
|
|
|
|
TIME_SECTION("check_import_entities - resolve 'when' and 'foreign' blocks");
|
|
resolve_global_decl_sources(c, package_order);
|
|
|
|
TIME_SECTION("check_import_entities - correct type aliases");
|
|
stage_start = global_import_stage_begin();
|
|
|
|
for (ImportGraphNode *node : package_order) {
|
|
GB_ASSERT(node->scope->flags&ScopeFlag_Pkg);
|
|
thread_pool_add_task(correct_type_aliases_worker_proc, node->scope->pkg);
|
|
}
|
|
thread_pool_wait();
|
|
global_import_stage_end(GlobalImportStage_TypeAliases, stage_start);
|
|
}
|
|
|
|
gb_internal WORKER_TASK_PROC(check_file_directives_worker_proc) {
|
|
AstFile *f = cast(AstFile *)data;
|
|
auto *wd = &collect_entity_worker_data[current_thread_index()];
|
|
reset_checker_context(&wd->ctx, f, &wd->untyped);
|
|
|
|
for (Ast *expr : f->delayed_decls_queues[AstDelayQueue_Expr]) {
|
|
Operand o = {};
|
|
check_expr(&wd->ctx, &o, expr);
|
|
}
|
|
array_clear(&f->delayed_decls_queues[AstDelayQueue_Expr]);
|
|
|
|
add_untyped_expressions(wd->ctx.info, &wd->untyped);
|
|
return 0;
|
|
}
|
|
|
|
// NOTE(bill): Any file scope directive call (`#assert`, `#panic`, etc) declares nothing (currently)
|
|
// All get checked once every global entity has been in parallel
|
|
gb_internal void check_file_directives(Checker *c) {
|
|
for (auto const &entry : c->info.files) {
|
|
AstFile *f = entry.value;
|
|
if (f->delayed_decls_queues[AstDelayQueue_Expr].count != 0) {
|
|
thread_pool_add_task(check_file_directives_worker_proc, f);
|
|
}
|
|
}
|
|
thread_pool_wait();
|
|
}
|
|
|
|
|
|
gb_internal Array<Entity *> find_entity_path(Entity *start, Entity *end, gbAllocator allocator, PtrSet<Entity *> *visited = nullptr);
|
|
|
|
gb_internal bool find_entity_path_tuple(Type *tuple, Entity *end, gbAllocator allocator, PtrSet<Entity *> *visited, Array<Entity *> *path_) {
|
|
GB_ASSERT(path_ != nullptr);
|
|
if (tuple == nullptr) {
|
|
return false;
|
|
}
|
|
GB_ASSERT(tuple->kind == Type_Tuple);
|
|
for_array(i, tuple->Tuple.variables) {
|
|
Entity *var = tuple->Tuple.variables[i];
|
|
DeclInfo *var_decl = var->decl_info;
|
|
if (var_decl == nullptr) {
|
|
continue;
|
|
}
|
|
|
|
FOR_PTR_SET(dep, var_decl->deps) {
|
|
if (dep == end) {
|
|
auto path = array_make<Entity *>(allocator);
|
|
array_add(&path, dep);
|
|
*path_ = path;
|
|
return true;
|
|
}
|
|
auto next_path = find_entity_path(dep, end, allocator, visited);
|
|
if (next_path.count > 0) {
|
|
array_add(&next_path, dep);
|
|
*path_ = next_path;
|
|
return true;
|
|
}
|
|
}
|
|
}
|
|
|
|
return false;
|
|
}
|
|
|
|
gb_internal Array<Entity *> find_entity_path(Entity *start, Entity *end, gbAllocator allocator, PtrSet<Entity *> *visited) {
|
|
PtrSet<Entity *> visited_ = {};
|
|
bool made_visited = false;
|
|
if (visited == nullptr) {
|
|
made_visited = true;
|
|
visited = &visited_;
|
|
}
|
|
defer (if (made_visited) {
|
|
ptr_set_destroy(&visited_);
|
|
});
|
|
|
|
Array<Entity *> empty_path = {};
|
|
|
|
if (ptr_set_update(visited, start)) {
|
|
return empty_path;
|
|
}
|
|
|
|
DeclInfo *decl = start->decl_info;
|
|
if (decl) {
|
|
if (start->kind == Entity_Procedure) {
|
|
Type *t = base_type(start->type);
|
|
GB_ASSERT(t->kind == Type_Proc);
|
|
|
|
Array<Entity *> path = {};
|
|
if (find_entity_path_tuple(t->Proc.params, end, allocator, visited, &path)) {
|
|
return path;
|
|
}
|
|
if (find_entity_path_tuple(t->Proc.results, end, allocator, visited, &path)) {
|
|
return path;
|
|
}
|
|
} else {
|
|
FOR_PTR_SET(dep, decl->deps) {
|
|
if (dep == end) {
|
|
auto path = array_make<Entity *>(allocator);
|
|
array_add(&path, dep);
|
|
return path;
|
|
}
|
|
auto next_path = find_entity_path(dep, end, allocator, visited);
|
|
if (next_path.count > 0) {
|
|
array_add(&next_path, dep);
|
|
return next_path;
|
|
}
|
|
}
|
|
}
|
|
}
|
|
return empty_path;
|
|
}
|
|
|
|
|
|
struct GlobalInitOrderData {
|
|
CheckerInfo * info;
|
|
Array<EntityGraphNode *> dep_graph;
|
|
};
|
|
|
|
gb_internal WORKER_TASK_PROC(calculate_global_init_order_worker) {
|
|
GlobalInitOrderData *order = cast(GlobalInitOrderData *)data;
|
|
CheckerInfo *info = order->info;
|
|
Array<EntityGraphNode *> const &G = order->dep_graph;
|
|
|
|
isize edge_count = 0;
|
|
for (EntityGraphNode *n : G) {
|
|
n->index = 0;
|
|
n->dep_count = n->succ.count;
|
|
edge_count += n->succ.count;
|
|
FOR_PTR_SET(m, n->succ) {
|
|
m->pred.count += 1;
|
|
}
|
|
}
|
|
auto preds = array_make<EntityGraphNode *>(heap_allocator(), edge_count);
|
|
defer (array_free(&preds));
|
|
isize pred_offset = 0;
|
|
for (EntityGraphNode *n : G) {
|
|
n->pred.data = preds.data + pred_offset;
|
|
pred_offset += n->pred.count;
|
|
n->pred.count = 0;
|
|
}
|
|
for (EntityGraphNode *n : G) {
|
|
FOR_PTR_SET(m, n->succ) {
|
|
m->pred.data[m->pred.count++] = n;
|
|
}
|
|
}
|
|
|
|
PtrSet<DeclInfo *> emitted = {};
|
|
ptr_set_init(&emitted, G.count);
|
|
defer (ptr_set_destroy(&emitted));
|
|
array_reserve(&info->variable_init_order, G.count);
|
|
|
|
isize emitted_count = 0;
|
|
auto const emit = [&](EntityGraphNode *n) {
|
|
n->index = -1;
|
|
emitted_count += 1;
|
|
|
|
Entity *e = n->entity;
|
|
DeclInfo *d = decl_info_of_entity(e);
|
|
if (e->kind != Entity_Variable) {
|
|
return;
|
|
}
|
|
// IMPORTANT NOTE(bill, 2019-08-29): Just add it regardless of the ordering
|
|
// because it does not need any initialization other than zero
|
|
// if (!decl_info_has_init(d)) {
|
|
// return;
|
|
// }
|
|
if (ptr_set_update(&emitted, d)) {
|
|
return;
|
|
}
|
|
|
|
array_add(&info->variable_init_order, d);
|
|
};
|
|
|
|
// NOTE(bill, 2022-10-05): The order is by the dependencies left, then by the source.
|
|
// So without a cycle the next is the first in the source of those with none left:
|
|
// those with none to begin with are sorted once, and those which reach none later go into a heap rather than every node being in a priority queue
|
|
auto ready = array_make<EntityGraphNode *>(heap_allocator(), 0, G.count);
|
|
defer (array_free(&ready));
|
|
for (EntityGraphNode *n : G) {
|
|
if (n->dep_count == 0) {
|
|
array_add(&ready, n);
|
|
}
|
|
}
|
|
natural_merge_sort(ready.data, ready.count, [](EntityGraphNode *const &x, EntityGraphNode *const &y) -> int {
|
|
return entity_source_order_cmp(x->entity, y->entity);
|
|
});
|
|
|
|
auto later = priority_queue_create(array_make<EntityGraphNode *>(heap_allocator()), entity_graph_node_source_order_cmp, entity_graph_node_swap);
|
|
defer (array_free(&later.queue));
|
|
for (isize next_ready = 0; /**/; /**/) {
|
|
EntityGraphNode *n = nullptr;
|
|
if (next_ready < ready.count && (later.queue.count == 0 || entity_source_order_cmp(ready[next_ready]->entity, later.queue[0]->entity) < 0)) {
|
|
n = ready[next_ready++];
|
|
} else if (later.queue.count > 0) {
|
|
n = priority_queue_pop(&later);
|
|
} else {
|
|
break;
|
|
}
|
|
for (EntityGraphNode *p : n->pred) {
|
|
p->dep_count -= 1;
|
|
if (p->dep_count == 0) {
|
|
priority_queue_push(&later, p);
|
|
}
|
|
}
|
|
emit(n);
|
|
}
|
|
|
|
if (emitted_count < G.count) {
|
|
auto rest = array_make<EntityGraphNode *>(heap_allocator(), 0, G.count - emitted_count);
|
|
for (EntityGraphNode *n : G) {
|
|
if (n->index >= 0) {
|
|
n->index = rest.count;
|
|
array_add(&rest, n);
|
|
}
|
|
}
|
|
// NOTE(bill): Priority queue
|
|
auto pq = priority_queue_create(rest, entity_graph_node_cmp, entity_graph_node_swap);
|
|
defer (array_free(&pq.queue));
|
|
|
|
while (pq.queue.count > 0) {
|
|
EntityGraphNode *n = priority_queue_pop(&pq);
|
|
Entity *e = n->entity;
|
|
|
|
if (n->dep_count > 0) {
|
|
TEMPORARY_ALLOCATOR_GUARD();
|
|
auto path = find_entity_path(e, e, temporary_allocator());
|
|
|
|
if (path.count > 0) {
|
|
Entity *e = path[0];
|
|
error(e->token, "Cyclic initialization of '%.*s'", LIT(e->token.string));
|
|
for (isize i = path.count-1; i >= 0; i--) {
|
|
error(e->token, "\t'%.*s' refers to", LIT(e->token.string));
|
|
e = path[i];
|
|
}
|
|
error(e->token, "\t'%.*s'", LIT(e->token.string));
|
|
}
|
|
}
|
|
|
|
for (EntityGraphNode *p : n->pred) {
|
|
p->dep_count -= 1;
|
|
p->dep_count = gb_max(p->dep_count, 0);
|
|
priority_queue_fix(&pq, p->index);
|
|
}
|
|
emit(n);
|
|
}
|
|
}
|
|
|
|
if (false) {
|
|
gb_printf("Variable Initialization Order:\n");
|
|
for_array(i, info->variable_init_order) {
|
|
DeclInfo *d = info->variable_init_order[i];
|
|
Entity *e = d->entity;
|
|
gb_printf("\t'%.*s' %llu\n", LIT(e->token.string), cast(unsigned long long)e->order_in_src);
|
|
}
|
|
gb_printf("\n");
|
|
}
|
|
return 0;
|
|
}
|
|
|
|
gb_internal bool check_proc_info(Checker *c, ProcInfo *pi, UntypedExprInfoMap *untyped) {
|
|
if (pi == nullptr) {
|
|
return false;
|
|
}
|
|
if (pi->type == nullptr) {
|
|
return false;
|
|
}
|
|
|
|
if (!mutex_try_lock(&pi->decl->proc_checked_mutex)) {
|
|
return false;
|
|
}
|
|
defer (mutex_unlock(&pi->decl->proc_checked_mutex));
|
|
|
|
Entity *e = pi->decl->entity;
|
|
switch (pi->decl->proc_checked_state.load()) {
|
|
case ProcCheckedState_InProgress:
|
|
if (e) {
|
|
GB_ASSERT(global_procedure_body_in_worker_queue.load() != 0);
|
|
}
|
|
return false;
|
|
case ProcCheckedState_Checked:
|
|
if (e != nullptr) {
|
|
GB_ASSERT(e->flags & EntityFlag_ProcBodyChecked);
|
|
}
|
|
return true;
|
|
case ProcCheckedState_Unchecked:
|
|
// okay
|
|
break;
|
|
}
|
|
pi->decl->proc_checked_state.store(ProcCheckedState_InProgress);
|
|
|
|
GB_ASSERT(pi->type->kind == Type_Proc);
|
|
TypeProc *pt = &pi->type->Proc;
|
|
String name = pi->token.string;
|
|
|
|
if (pt->is_polymorphic && !pt->is_poly_specialized) {
|
|
Token token = pi->token;
|
|
if (pi->poly_def_node != nullptr) {
|
|
token = ast_token(pi->poly_def_node);
|
|
}
|
|
error(token, "Unspecialized polymorphic procedure '%.*s'", LIT(name));
|
|
pi->decl->proc_checked_state.store(ProcCheckedState_Unchecked);
|
|
return false;
|
|
}
|
|
|
|
if (pt->is_polymorphic && pt->is_poly_specialized) {
|
|
Entity *e = pi->decl->entity;
|
|
GB_ASSERT(e != nullptr);
|
|
GB_ASSERT_MSG((e->flags & EntityFlag_Used) != 0, "unused specialization '%.*s' queued for checking", LIT(name));
|
|
}
|
|
|
|
CheckerContext ctx = {};
|
|
init_checker_context(&ctx, c);
|
|
defer (destroy_checker_context(&ctx));
|
|
reset_checker_context(&ctx, pi->file, untyped);
|
|
ctx.decl = pi->decl;
|
|
|
|
bool bounds_check = (pi->tags & ProcTag_bounds_check) != 0;
|
|
bool no_bounds_check = (pi->tags & ProcTag_no_bounds_check) != 0;
|
|
|
|
bool type_assert = (pi->tags & ProcTag_type_assert) != 0;
|
|
bool no_type_assert = (pi->tags & ProcTag_no_type_assert) != 0;
|
|
|
|
if (bounds_check) {
|
|
ctx.state_flags |= StateFlag_bounds_check;
|
|
ctx.state_flags &= ~StateFlag_no_bounds_check;
|
|
} else if (no_bounds_check) {
|
|
ctx.state_flags |= StateFlag_no_bounds_check;
|
|
ctx.state_flags &= ~StateFlag_bounds_check;
|
|
}
|
|
|
|
if (type_assert) {
|
|
ctx.state_flags |= StateFlag_type_assert;
|
|
ctx.state_flags &= ~StateFlag_no_type_assert;
|
|
} else if (no_type_assert) {
|
|
ctx.state_flags |= StateFlag_no_type_assert;
|
|
ctx.state_flags &= ~StateFlag_type_assert;
|
|
}
|
|
|
|
bool body_was_checked = check_proc_body(&ctx, pi->token, pi->decl, pi->type, pi->body);
|
|
|
|
if (body_was_checked) {
|
|
pi->decl->proc_checked_state.store(ProcCheckedState_Checked);
|
|
if (pi->body) {
|
|
Entity *e = pi->decl->entity;
|
|
if (e != nullptr) {
|
|
e->flags |= EntityFlag_ProcBodyChecked;
|
|
}
|
|
}
|
|
} else {
|
|
pi->decl->proc_checked_state.store(ProcCheckedState_Unchecked);
|
|
if (pi->body) {
|
|
Entity *e = pi->decl->entity;
|
|
if (e != nullptr) {
|
|
e->flags &= ~EntityFlag_ProcBodyChecked;
|
|
}
|
|
}
|
|
}
|
|
|
|
// NOTE(bill): the nested procedures that waited for this body, see `check_proc_info_worker_proc`
|
|
mutex_lock(&pi->decl->next_mutex);
|
|
Array<ProcInfo *> nested = pi->decl->nested_to_check;
|
|
pi->decl->nested_to_check = {};
|
|
pi->decl->nested_to_check.allocator = heap_allocator();
|
|
mutex_unlock(&pi->decl->next_mutex);
|
|
for (ProcInfo *nested_pi : nested) {
|
|
thread_pool_add_task(check_proc_info_worker_proc, nested_pi);
|
|
}
|
|
array_free(&nested);
|
|
|
|
add_untyped_expressions(&c->info, ctx.untyped);
|
|
|
|
return true;
|
|
}
|
|
|
|
GB_STATIC_ASSERT(sizeof(isize) == sizeof(void *));
|
|
|
|
gb_internal bool consume_proc_info(Checker *c, ProcInfo *pi, UntypedExprInfoMap *untyped);
|
|
|
|
gb_internal void check_min_dep_bodies_were_checked(Checker *c) {
|
|
GB_ASSERT(c->procs_to_check.count == 0);
|
|
global_after_checking_procedure_bodies = true;
|
|
|
|
if (any_errors()) {
|
|
// e.g. a body is not checked when its `where` clauses fail
|
|
return;
|
|
}
|
|
|
|
for (Entity *e : c->info.entities) {
|
|
if (e->kind != Entity_Procedure || e->min_dep_count.load(std::memory_order_relaxed) == 0) {
|
|
continue;
|
|
}
|
|
Entity *original = e;
|
|
while ((e->flags & EntityFlag_Overridden) && e->aliased_of != nullptr) {
|
|
e = e->aliased_of;
|
|
}
|
|
if (e->Procedure.is_foreign || (e->flags & EntityFlag_ProcBodyChecked) != 0) {
|
|
continue;
|
|
}
|
|
Type *type = base_type(e->type);
|
|
if (type == t_invalid || (is_type_polymorphic(type) && !type->Proc.is_poly_specialized)) {
|
|
continue;
|
|
}
|
|
DeclInfo *decl = e->decl_info;
|
|
if (decl == nullptr || decl->proc_lit == nullptr || decl->proc_lit->ProcLit.body == nullptr) {
|
|
continue;
|
|
}
|
|
GB_PANIC("the body of '%.*s' :: %s was never checked (%s)",
|
|
LIT(original->token.string), type_to_string(e->type), token_pos_to_string(e->token.pos));
|
|
}
|
|
}
|
|
|
|
gb_internal void check_safety_all_procedures_for_unchecked(Checker *c) {
|
|
GB_ASSERT(DEBUG_CHECK_ALL_PROCEDURES);
|
|
UntypedExprInfoMap untyped = {};
|
|
defer (map_destroy(&untyped));
|
|
|
|
|
|
array_reserve(&c->info.all_procedures, c->info.all_procedures_queue.count.load());
|
|
|
|
for (ProcInfo *pi = nullptr; mpsc_dequeue(&c->info.all_procedures_queue, &pi); /**/) {
|
|
GB_ASSERT(pi != nullptr);
|
|
GB_ASSERT(pi->decl != nullptr);
|
|
Entity *e = pi->decl->entity;
|
|
auto proc_checked_state = pi->decl->proc_checked_state.load();
|
|
gb_unused(proc_checked_state);
|
|
if (e && ((e->flags & EntityFlag_ProcBodyChecked) == 0)) {
|
|
if ((e->flags & EntityFlag_Used) != 0) {
|
|
// debugf("%.*s :: %s\n", LIT(e->token.string), type_to_string(e->type));
|
|
// debugf("proc body unchecked\n");
|
|
// debugf("Checked State: %s\n\n", ProcCheckedState_strings[proc_checked_state]);
|
|
|
|
consume_proc_info(c, pi, &untyped);
|
|
}
|
|
}
|
|
|
|
array_add(&c->info.all_procedures, pi);
|
|
}
|
|
}
|
|
|
|
gb_internal GB_COMPARE_PROC(init_procedures_cmp);
|
|
gb_internal GB_COMPARE_PROC(fini_procedures_cmp);
|
|
|
|
gb_internal void remove_neighbouring_duplicate_entires_from_sorted_array(Array<Entity *> *array) {
|
|
Entity *prev = nullptr;
|
|
|
|
for (isize i = 0; i < array->count; /**/) {
|
|
Entity *curr = array->data[i];
|
|
if (prev == curr) {
|
|
array_ordered_remove(array, i);
|
|
} else {
|
|
prev = curr;
|
|
i += 1;
|
|
}
|
|
}
|
|
}
|
|
|
|
|
|
gb_internal void check_test_procedures(Checker *c) {
|
|
array_sort(c->info.testing_procedures, init_procedures_cmp);
|
|
remove_neighbouring_duplicate_entires_from_sorted_array(&c->info.testing_procedures);
|
|
}
|
|
|
|
|
|
gb_global std::atomic<isize> total_bodies_checked;
|
|
|
|
gb_internal bool consume_proc_info(Checker *c, ProcInfo *pi, UntypedExprInfoMap *untyped) {
|
|
GB_ASSERT(pi->decl != nullptr);
|
|
switch (pi->decl->proc_checked_state.load()) {
|
|
case ProcCheckedState_InProgress:
|
|
return false;
|
|
case ProcCheckedState_Checked:
|
|
return true;
|
|
}
|
|
|
|
if (pi->decl->parent && pi->decl->parent->entity) {
|
|
Entity *parent = pi->decl->parent->entity;
|
|
// NOTE(bill): Only check a nested procedure if its parent's body has been checked first
|
|
// This is prevent any possible race conditions in evaluation when multithreaded
|
|
// NOTE(bill): In single threaded mode, this should never happen
|
|
if (parent->kind == Entity_Procedure && (parent->flags & EntityFlag_ProcBodyChecked) == 0) {
|
|
Type *pt = base_type(parent->type);
|
|
if (!pt->Proc.is_polymorphic || pt->Proc.is_poly_specialized) {
|
|
check_procedure_later(c, pi);
|
|
return false;
|
|
}
|
|
}
|
|
}
|
|
if (untyped) {
|
|
map_clear(untyped);
|
|
}
|
|
if (check_proc_info(c, pi, untyped)) {
|
|
total_bodies_checked.fetch_add(1, std::memory_order_relaxed);
|
|
return true;
|
|
}
|
|
return false;
|
|
}
|
|
|
|
struct CheckProcedureBodyWorkerData {
|
|
Checker *c;
|
|
UntypedExprInfoMap untyped;
|
|
};
|
|
|
|
gb_global CheckProcedureBodyWorkerData *check_procedure_bodies_worker_data;
|
|
|
|
gb_internal WORKER_TASK_PROC(check_proc_info_worker_proc) {
|
|
auto *wd = &check_procedure_bodies_worker_data[current_thread_index()];
|
|
UntypedExprInfoMap *untyped = &wd->untyped;
|
|
Checker *c = wd->c;
|
|
|
|
ProcInfo *pi = cast(ProcInfo *)data;
|
|
|
|
GB_ASSERT(pi->decl != nullptr);
|
|
if (pi->decl->parent && pi->decl->parent->entity) {
|
|
Entity *parent = pi->decl->parent->entity;
|
|
// NOTE(bill): Only check a nested procedure if its parent's body has been checked first
|
|
// This is prevent any possible race conditions in evaluation when multithreaded
|
|
// NOTE(bill): In single threaded mode, this should never happen
|
|
if (parent->kind == Entity_Procedure && (parent->flags & EntityFlag_ProcBodyChecked) == 0) {
|
|
Type *pt = base_type(parent->type);
|
|
if (!pt->Proc.is_polymorphic || pt->Proc.is_poly_specialized) {
|
|
// NOTE(bill): waits for the parent's body to be checked, which then adds it again,
|
|
// rather than adding itself again and again until then
|
|
DeclInfo *pd = pi->decl->parent;
|
|
mutex_lock(&pd->next_mutex);
|
|
bool waiting = (parent->flags & EntityFlag_ProcBodyChecked) == 0;
|
|
if (waiting) {
|
|
array_add(&pd->nested_to_check, pi);
|
|
}
|
|
mutex_unlock(&pd->next_mutex);
|
|
if (waiting) {
|
|
return 1;
|
|
}
|
|
}
|
|
}
|
|
}
|
|
map_clear(untyped);
|
|
if (check_proc_info(c, pi, untyped)) {
|
|
total_bodies_checked.fetch_add(1, std::memory_order_relaxed);
|
|
return 0;
|
|
}
|
|
return 1;
|
|
}
|
|
|
|
gb_internal void check_init_worker_data(Checker *c) {
|
|
u32 thread_count = cast(u32)global_thread_pool.threads.count;
|
|
|
|
check_procedure_bodies_worker_data = permanent_alloc_array<CheckProcedureBodyWorkerData>(thread_count);
|
|
|
|
for (isize i = 0; i < thread_count; i++) {
|
|
check_procedure_bodies_worker_data[i].c = c;
|
|
map_init(&check_procedure_bodies_worker_data[i].untyped);
|
|
}
|
|
}
|
|
|
|
gb_internal void check_procedure_bodies(Checker *c) {
|
|
GB_ASSERT(c != nullptr);
|
|
|
|
u32 thread_count = cast(u32)global_thread_pool.threads.count;
|
|
if (build_context.no_threaded_checker) {
|
|
thread_count = 1;
|
|
}
|
|
|
|
if (thread_count == 1) {
|
|
UntypedExprInfoMap *untyped = &check_procedure_bodies_worker_data[0].untyped;
|
|
for_array(i, c->procs_to_check) {
|
|
consume_proc_info(c, c->procs_to_check[i], untyped);
|
|
}
|
|
array_clear(&c->procs_to_check);
|
|
|
|
debugf("Total Procedure Bodies Checked: %td\n", total_bodies_checked.load(std::memory_order_relaxed));
|
|
return;
|
|
}
|
|
|
|
global_procedure_body_in_worker_queue = true;
|
|
|
|
isize prev_procs_to_check_count = c->procs_to_check.count;
|
|
for_array(i, c->procs_to_check) {
|
|
thread_pool_add_task(check_proc_info_worker_proc, c->procs_to_check[i]);
|
|
}
|
|
GB_ASSERT(prev_procs_to_check_count == c->procs_to_check.count);
|
|
array_clear(&c->procs_to_check);
|
|
|
|
thread_pool_wait();
|
|
|
|
global_procedure_body_in_worker_queue = false;
|
|
}
|
|
gb_internal void add_untyped_expressions(CheckerInfo *cinfo, UntypedExprInfoMap *untyped) {
|
|
if (untyped == nullptr) {
|
|
return;
|
|
}
|
|
for (auto const &entry : *untyped) {
|
|
Ast *expr = entry.key;
|
|
ExprInfo *info = entry.value;
|
|
if (expr != nullptr && info != nullptr) {
|
|
per_thread_array_add(&cinfo->checker->global_untyped_queue, UntypedExprInfo{expr, info});
|
|
}
|
|
}
|
|
map_clear(untyped);
|
|
}
|
|
|
|
gb_internal Type *tuple_to_pointers(Type *ot) {
|
|
if (ot == nullptr) {
|
|
return nullptr;
|
|
}
|
|
GB_ASSERT(ot->kind == Type_Tuple);
|
|
|
|
|
|
Type *t = alloc_type_tuple();
|
|
t->Tuple.variables = permanent_slice_make<Entity *>(ot->Tuple.variables.count);
|
|
|
|
Scope *scope = nullptr;
|
|
for_array(i, t->Tuple.variables) {
|
|
Entity *e = ot->Tuple.variables[i];
|
|
t->Tuple.variables[i] = alloc_entity_variable(scope, e->token, alloc_type_pointer(e->type));
|
|
}
|
|
t->Tuple.is_packed = ot->Tuple.is_packed;
|
|
|
|
return t;
|
|
}
|
|
|
|
gb_internal void check_deferred_procedures(Checker *c) {
|
|
for (Entity *src = nullptr; mpsc_dequeue(&c->procs_with_deferred_to_check, &src); /**/) {
|
|
GB_ASSERT(src->kind == Entity_Procedure);
|
|
|
|
DeferredProcedureKind dst_kind = src->Procedure.deferred_procedure.kind;
|
|
Entity *dst = src->Procedure.deferred_procedure.entity;
|
|
GB_ASSERT(dst != nullptr);
|
|
GB_ASSERT(dst->kind == Entity_Procedure);
|
|
|
|
char const *attribute = "deferred_none";
|
|
switch (dst_kind) {
|
|
case DeferredProcedure_none: attribute = "deferred_none"; break;
|
|
case DeferredProcedure_in: attribute = "deferred_in"; break;
|
|
case DeferredProcedure_out: attribute = "deferred_out"; break;
|
|
case DeferredProcedure_in_out: attribute = "deferred_in_out"; break;
|
|
case DeferredProcedure_in_by_ptr: attribute = "deferred_in_by_ptr"; break;
|
|
case DeferredProcedure_out_by_ptr: attribute = "deferred_out_by_ptr"; break;
|
|
case DeferredProcedure_in_out_by_ptr: attribute = "deferred_in_out_by_ptr"; break;
|
|
}
|
|
|
|
if (src == dst) {
|
|
error(src->token, "'%.*s' cannot be used as its own %s", LIT(dst->token.string), attribute);
|
|
continue;
|
|
}
|
|
|
|
if (entity_has_deferred_procedure(dst)) {
|
|
error(src->token,
|
|
"Deferred procedure '%.*s' cannot be used as the target of '%.*s' because it has a deferred procedure itself (deferred procedure chaining is not allowed)",
|
|
LIT(dst->token.string), LIT(src->token.string));
|
|
continue;
|
|
}
|
|
|
|
bool src_poly = is_type_polymorphic_or_specialized_proc(src->type);
|
|
bool dst_poly = is_type_polymorphic_or_specialized_proc(dst->type);
|
|
if (dst_poly && !src_poly) {
|
|
error(src->token, "A polymorphic deferred procedure '%.*s' requires the initial procedure '%.*s' to be polymorphic as well", LIT(dst->token.string), LIT(src->token.string));
|
|
continue;
|
|
}
|
|
if (dst_poly && dst_kind == DeferredProcedure_none) {
|
|
error(src->token, "'deferred_none' cannot be used with a polymorphic deferred procedure, as it has no inputs from which to determine its polymorphic types");
|
|
continue;
|
|
}
|
|
|
|
if (dst->flags & EntityFlag_Disabled) {
|
|
// Prevent procedures that have been disabled from acting as deferrals.
|
|
src->Procedure.deferred_procedure = {};
|
|
continue;
|
|
}
|
|
|
|
if (!is_type_proc(src->type)) {
|
|
error(src->token, "Invalid procedure type found during deferred procedure checking");
|
|
continue;
|
|
}
|
|
GB_ASSERT(is_type_proc(dst->type));
|
|
Type *src_params = base_type(src->type)->Proc.params;
|
|
Type *src_results = base_type(src->type)->Proc.results;
|
|
Type *dst_params = base_type(dst->type)->Proc.params;
|
|
|
|
bool by_ptr = false;
|
|
switch (dst_kind) {
|
|
case DeferredProcedure_in_by_ptr:
|
|
by_ptr = true;
|
|
src_params = tuple_to_pointers(src_params);
|
|
break;
|
|
case DeferredProcedure_out_by_ptr:
|
|
by_ptr = true;
|
|
src_results = tuple_to_pointers(src_results);
|
|
break;
|
|
case DeferredProcedure_in_out_by_ptr:
|
|
by_ptr = true;
|
|
src_params = tuple_to_pointers(src_params);
|
|
src_results = tuple_to_pointers(src_results);
|
|
break;
|
|
}
|
|
|
|
switch (dst_kind) {
|
|
case DeferredProcedure_none:
|
|
{
|
|
if (dst_params == nullptr) {
|
|
// Okay
|
|
continue;
|
|
}
|
|
|
|
error(src->token, "Deferred procedure '%.*s' must have no input parameters", LIT(dst->token.string));
|
|
} break;
|
|
case DeferredProcedure_in:
|
|
case DeferredProcedure_in_by_ptr:
|
|
{
|
|
if (src_params == nullptr && dst_params == nullptr) {
|
|
// Okay
|
|
continue;
|
|
}
|
|
if ((src_params == nullptr && dst_params != nullptr) ||
|
|
(src_params != nullptr && dst_params == nullptr)) {
|
|
error(src->token, "Deferred procedure '%.*s' parameters do not match the inputs of initial procedure '%.*s'", LIT(dst->token.string), LIT(src->token.string));
|
|
continue;
|
|
}
|
|
|
|
GB_ASSERT(src_params->kind == Type_Tuple);
|
|
GB_ASSERT(dst_params->kind == Type_Tuple);
|
|
|
|
if (src_poly || dst_poly || are_types_identical(src_params, dst_params)) {
|
|
// Okay!
|
|
} else {
|
|
gbString s = type_to_string(src_params);
|
|
gbString d = type_to_string(dst_params);
|
|
error(src->token, "Deferred procedure '%.*s' parameters do not match the inputs of initial procedure '%.*s':\n\t(%s) =/= (%s)",
|
|
LIT(dst->token.string), LIT(src->token.string),
|
|
d, s
|
|
);
|
|
gb_string_free(d);
|
|
gb_string_free(s);
|
|
continue;
|
|
}
|
|
} break;
|
|
case DeferredProcedure_out:
|
|
case DeferredProcedure_out_by_ptr:
|
|
{
|
|
if (src_results == nullptr && dst_params == nullptr) {
|
|
// Okay
|
|
continue;
|
|
}
|
|
if ((src_results == nullptr && dst_params != nullptr) ||
|
|
(src_results != nullptr && dst_params == nullptr)) {
|
|
error(src->token, "Deferred procedure '%.*s' parameters do not match the results of initial procedure '%.*s'", LIT(dst->token.string), LIT(src->token.string));
|
|
continue;
|
|
}
|
|
|
|
GB_ASSERT(src_results->kind == Type_Tuple);
|
|
GB_ASSERT(dst_params->kind == Type_Tuple);
|
|
|
|
if (src_poly || dst_poly || are_types_identical(src_results, dst_params)) {
|
|
// Okay!
|
|
} else {
|
|
gbString s = type_to_string(src_results);
|
|
gbString d = type_to_string(dst_params);
|
|
error(src->token, "Deferred procedure '%.*s' parameters do not match the results of initial procedure '%.*s':\n\t(%s) =/= (%s)",
|
|
LIT(dst->token.string), LIT(src->token.string),
|
|
d, s
|
|
);
|
|
gb_string_free(d);
|
|
gb_string_free(s);
|
|
continue;
|
|
}
|
|
} break;
|
|
case DeferredProcedure_in_out:
|
|
case DeferredProcedure_in_out_by_ptr:
|
|
{
|
|
if (src_params == nullptr && src_results == nullptr && dst_params == nullptr) {
|
|
// Okay
|
|
continue;
|
|
}
|
|
|
|
if (dst_params == nullptr) {
|
|
error(src->token, "Deferred procedure must have parameters for %s", attribute);
|
|
continue;
|
|
}
|
|
GB_ASSERT(dst_params->kind == Type_Tuple);
|
|
|
|
Type *tsrc = alloc_type_tuple();
|
|
auto &sv = tsrc->Tuple.variables;
|
|
auto const &dv = dst_params->Tuple.variables;
|
|
gb_unused(dv);
|
|
|
|
isize len = 0;
|
|
if (src_params != nullptr) {
|
|
GB_ASSERT(src_params->kind == Type_Tuple);
|
|
len += src_params->Tuple.variables.count;
|
|
}
|
|
if (src_results != nullptr) {
|
|
GB_ASSERT(src_results->kind == Type_Tuple);
|
|
len += src_results->Tuple.variables.count;
|
|
}
|
|
slice_init(&sv, heap_allocator(), len);
|
|
isize offset = 0;
|
|
if (src_params != nullptr) {
|
|
for_array(i, src_params->Tuple.variables) {
|
|
sv[offset++] = src_params->Tuple.variables[i];
|
|
}
|
|
}
|
|
if (src_results != nullptr) {
|
|
for_array(i, src_results->Tuple.variables) {
|
|
sv[offset++] = src_results->Tuple.variables[i];
|
|
}
|
|
}
|
|
GB_ASSERT(offset == len);
|
|
|
|
|
|
if (src_poly || dst_poly || are_types_identical(tsrc, dst_params)) {
|
|
// Okay!
|
|
} else {
|
|
gbString s = type_to_string(tsrc);
|
|
gbString d = type_to_string(dst_params);
|
|
error(src->token, "Deferred procedure '%.*s' parameters do not match the results of initial procedure '%.*s':\n\t(%s) =/= (%s)",
|
|
LIT(dst->token.string), LIT(src->token.string),
|
|
d, s
|
|
);
|
|
gb_string_free(d);
|
|
gb_string_free(s);
|
|
continue;
|
|
}
|
|
} break;
|
|
}
|
|
}
|
|
|
|
}
|
|
|
|
gb_internal void handle_raddbg_type_view(Checker *c, RaddbgTypeView const &type_view) {
|
|
auto const struct_tag_lookup = [](String tag, char const *key_c, String *value_) -> bool {
|
|
String t = tag;
|
|
String key = make_string_c(key_c);
|
|
while (t.len != 0) {
|
|
isize i = 0;
|
|
while (i < t.len && t[i] == ' ') { // Skip whitespace
|
|
i += 1;
|
|
}
|
|
t.text += i;
|
|
t.len -= i;
|
|
if (t.len == 0) {
|
|
break;
|
|
}
|
|
|
|
i = 0;
|
|
|
|
while (i < t.len) {
|
|
u8 c = t[i];
|
|
if (c == ':' || c == '"') {
|
|
break;
|
|
} else if ((0 <= c && c < ' ') || (0x7f <= c && c <= 0x9f)) {
|
|
// break if control character is found
|
|
break;
|
|
}
|
|
i += 1;
|
|
}
|
|
|
|
if (i == 0) {
|
|
break;
|
|
}
|
|
if (i+1 >= t.len) {
|
|
break;
|
|
}
|
|
if (t[i] != ':' || t[i+1] != '"') {
|
|
break;
|
|
}
|
|
String name = {t.text, i};
|
|
t = {t.text+i+1, t.len-(i+1)};
|
|
|
|
i = 1;
|
|
while (i < t.len && t[i] != '"') { // find closing quote
|
|
if (t[i] == '\\') {
|
|
i += 1; // Skip escaped characters
|
|
}
|
|
i += 1;
|
|
}
|
|
if (i >= t.len) {
|
|
break;
|
|
}
|
|
|
|
String value = {t.text, i+1};
|
|
t = {t.text+i+1, t.len-(i+1)};
|
|
|
|
if (key == name) {
|
|
value = {value.text+1, i-1};
|
|
value = string_trim_whitespace(value);
|
|
if (value_) *value_ = value;
|
|
return true;
|
|
}
|
|
}
|
|
return false;
|
|
};
|
|
|
|
auto const parse_int = [](String s, isize *offset_, u64 *result_) -> bool {
|
|
isize offset = *offset_;
|
|
isize new_offset = *offset_;
|
|
|
|
u64 result = 0;
|
|
|
|
while (new_offset < s.len) {
|
|
u8 c = s[new_offset];
|
|
if (!('0' <= c && c <= '9')) {
|
|
break;
|
|
}
|
|
|
|
new_offset += 1;
|
|
result *= 10;
|
|
result += u64(c)-'0';
|
|
}
|
|
|
|
*offset_ = new_offset;
|
|
*result_ = result;
|
|
return new_offset > offset;
|
|
};
|
|
|
|
Type *type = type_view.type;
|
|
if (type == nullptr || type == t_invalid) {
|
|
return;
|
|
}
|
|
String view = type_view.view;
|
|
if (view.len != 0) {
|
|
array_add(&c->info.raddbg_type_views, RaddbgTypeView{type, view});
|
|
return;
|
|
}
|
|
|
|
// NOTE(bill): Generate one automatically from the struct field tags if they exist
|
|
// If it cannot be generated, it'll be ignored/err
|
|
|
|
Type *bt = base_type(type);
|
|
if (is_type_struct(type)) {
|
|
GB_ASSERT(bt->kind == Type_Struct);
|
|
if (bt->Struct.tags != nullptr) {
|
|
bool found_any = false;
|
|
|
|
for (isize i = 0; i < bt->Struct.fields.count; i++) {
|
|
String tag = bt->Struct.tags[i];
|
|
String value = {};
|
|
if (struct_tag_lookup(tag, "raddbg", &value)) {
|
|
found_any = true;
|
|
} else if (struct_tag_lookup(tag, "fmt", &value)) {
|
|
found_any = true;
|
|
}
|
|
}
|
|
|
|
if (!found_any) {
|
|
return;
|
|
}
|
|
|
|
gbString s = gb_string_make(heap_allocator(), "");
|
|
|
|
s = gb_string_appendc(s, "rows($");
|
|
|
|
for (isize i = 0; i < bt->Struct.fields.count; i++) {
|
|
Entity *field = bt->Struct.fields[i];
|
|
GB_ASSERT(field != nullptr);
|
|
String name = field->token.string;
|
|
String tag = bt->Struct.tags[i];
|
|
String value = {};
|
|
bool custom_rule = false;
|
|
|
|
bool raddbg_seen = false;
|
|
if (struct_tag_lookup(tag, "raddbg", &value)) {
|
|
raddbg_seen = true;
|
|
if (value == "-") {
|
|
// Ignore this field entirely;
|
|
continue;
|
|
}
|
|
}
|
|
|
|
s = gb_string_appendc(s, ", ");
|
|
|
|
if (raddbg_seen) {
|
|
if (value == "") {
|
|
// ignore
|
|
} else {
|
|
s = gb_string_append_length(s, value.text, value.len);
|
|
custom_rule = true;
|
|
}
|
|
} else if (struct_tag_lookup(tag, "fmt", &value)) {
|
|
if (value == "" || value == "-") {
|
|
// ignore
|
|
} else {
|
|
auto p = string_partition(value, make_string_c(","));
|
|
String head = p.head;
|
|
String tail = p.tail;
|
|
|
|
isize i = 0;
|
|
|
|
for (bool ok = true; ok && i < head.len; i += 1) {
|
|
switch (head[i]) {
|
|
case '+':
|
|
case '-':
|
|
case ' ':
|
|
case '#':
|
|
case '0':
|
|
break;
|
|
default:
|
|
i -= 1;
|
|
ok = false;
|
|
break;
|
|
}
|
|
}
|
|
|
|
u64 prec = 0;
|
|
u64 width = 0;
|
|
bool width_ok = parse_int(head, &i, &width);
|
|
bool prec_ok = false;
|
|
if (i < head.len && head[i] == '.') {
|
|
i += 1;
|
|
prec_ok = parse_int(head, &i, &prec);
|
|
}
|
|
|
|
|
|
Rune verb = 0;
|
|
if (i >= head.len || head[i] == ' ') {
|
|
verb = 'v';
|
|
} else {
|
|
utf8_decode(head.text+i, head.len-i, &verb);
|
|
}
|
|
|
|
isize paren_count = 0;
|
|
|
|
|
|
if (width_ok) {
|
|
s = gb_string_appendc(s, "digits(");
|
|
custom_rule = true;
|
|
}
|
|
|
|
switch (verb) {
|
|
case 'b':
|
|
s = gb_string_appendc(s, "bin(");
|
|
paren_count += 1;
|
|
break;
|
|
case 'd':
|
|
s = gb_string_appendc(s, "dec(");
|
|
paren_count += 1;
|
|
break;
|
|
case 'x':
|
|
case 'X':
|
|
s = gb_string_appendc(s, "hex(");
|
|
paren_count += 1;
|
|
break;
|
|
case 'o':
|
|
s = gb_string_appendc(s, "oct(");
|
|
paren_count += 1;
|
|
break;
|
|
}
|
|
|
|
|
|
if (tail.len != 0 && tail != "0") {
|
|
s = gb_string_appendc(s, "array(");
|
|
s = gb_string_append_length(s, name.text, name.len);
|
|
if (is_type_slice(field->type) || is_type_dynamic_array(field->type)) {
|
|
s = gb_string_appendc(s, ".data");
|
|
}
|
|
s = gb_string_appendc(s, ", ");
|
|
s = gb_string_append_length(s, tail.text, tail.len);
|
|
s = gb_string_appendc(s, ")");
|
|
custom_rule = true;
|
|
} else {
|
|
s = gb_string_append_length(s, name.text, name.len);
|
|
custom_rule = true;
|
|
}
|
|
|
|
|
|
for (isize j = 0; j < paren_count; j++) {
|
|
s = gb_string_appendc(s, ")");
|
|
custom_rule = true;
|
|
}
|
|
if (width_ok) {
|
|
s = gb_string_append_fmt(s, ", %llu)", cast(unsigned long long)width);
|
|
}
|
|
}
|
|
}
|
|
|
|
if (!custom_rule) {
|
|
s = gb_string_append_length(s, name.text, name.len);
|
|
}
|
|
}
|
|
|
|
s = gb_string_appendc(s, ")");
|
|
|
|
view = make_string((u8 const *)s, gb_string_length(s));
|
|
}
|
|
}
|
|
|
|
if (view.len == 0) {
|
|
// Ignore the type, it didn't anything custom
|
|
return;
|
|
}
|
|
|
|
array_add(&c->info.raddbg_type_views, RaddbgTypeView{type, view});
|
|
}
|
|
|
|
gb_internal GB_COMPARE_PROC(raddbg_type_view_cmp) {
|
|
RaddbgTypeView const *x = cast(RaddbgTypeView const *)a;
|
|
RaddbgTypeView const *y = cast(RaddbgTypeView const *)b;
|
|
Entity *xe = (x->type && x->type->kind == Type_Named) ? x->type->Named.type_name : nullptr;
|
|
Entity *ye = (y->type && y->type->kind == Type_Named) ? y->type->Named.type_name : nullptr;
|
|
if (xe != nullptr && ye != nullptr && xe != ye) {
|
|
return entity_source_order_cmp(xe, ye);
|
|
}
|
|
u64 xh = type_hash_canonical_type(x->type);
|
|
u64 yh = type_hash_canonical_type(y->type);
|
|
if (xh != yh) {
|
|
return xh < yh ? -1 : +1;
|
|
}
|
|
return string_compare(x->view, y->view);
|
|
}
|
|
|
|
gb_internal void check_objc_context_provider_procedures(Checker *c) {
|
|
for (Entity *e = nullptr; mpsc_dequeue(&c->procs_with_objc_context_provider_to_check, &e); /**/) {
|
|
GB_ASSERT(e->kind == Entity_TypeName);
|
|
|
|
Entity *proc_entity = e->TypeName.objc_context_provider;
|
|
GB_ASSERT(proc_entity->kind == Entity_Procedure);
|
|
|
|
auto &proc = proc_entity->type->Proc;
|
|
|
|
Type *return_type = proc.result_count != 1 ? t_untyped_nil : base_named_type(proc.results->Tuple.variables[0]->type);
|
|
if (return_type != t_context) {
|
|
error(proc_entity->token, "The @(objc_context_provider) procedure must only return a context.");
|
|
}
|
|
|
|
const char *self_param_err = "The @(objc_context_provider) procedure must take as a parameter a single pointer to the @(objc_type) value.";
|
|
if (proc.param_count != 1) {
|
|
error(proc_entity->token, "%s", self_param_err);
|
|
}
|
|
|
|
Type *self_param = base_type(proc.params->Tuple.variables[0]->type);
|
|
if (self_param->kind != Type_Pointer) {
|
|
error(proc_entity->token, "%s", self_param_err);
|
|
}
|
|
|
|
Type *self_type = base_named_type(self_param->Pointer.elem);
|
|
if (!internal_check_is_assignable_to(self_type, e->type) &&
|
|
!(e->TypeName.objc_ivar && internal_check_is_assignable_to(self_type, e->TypeName.objc_ivar))) {
|
|
error(proc_entity->token, "%s", self_param_err);
|
|
}
|
|
if (proc.calling_convention != ProcCC_CDecl && proc.calling_convention != ProcCC_Contextless) {
|
|
error(e->token, "%s", self_param_err);
|
|
}
|
|
if (proc.is_polymorphic) {
|
|
error(e->token, "%s", self_param_err);
|
|
}
|
|
}
|
|
}
|
|
|
|
gb_internal bool check_unique_package_names(Checker *c) {
|
|
ERROR_BLOCK();
|
|
|
|
bool ok = true;
|
|
|
|
StringMap<AstPackage *> pkgs = {}; // Key: package name
|
|
string_map_init(&pkgs, 2*c->info.packages.count);
|
|
defer (string_map_destroy(&pkgs));
|
|
|
|
for (auto const &entry : c->info.packages) {
|
|
AstPackage *pkg = entry.value;
|
|
if (pkg->files.count == 0) {
|
|
continue; // Sanity check
|
|
}
|
|
|
|
String name = pkg->name;
|
|
auto key = string_hash_string(name);
|
|
auto *found = string_map_get(&pkgs, key);
|
|
if (found == nullptr) {
|
|
string_map_set(&pkgs, key, pkg);
|
|
continue;
|
|
}
|
|
auto *curr = pkg->files[0]->pkg_decl;
|
|
auto *prev = (*found)->files[0]->pkg_decl;
|
|
if (curr == prev) {
|
|
// NOTE(bill): A false positive was found, ignore it
|
|
continue;
|
|
}
|
|
|
|
ok = false;
|
|
|
|
begin_error_block();
|
|
error(curr, "Duplicate declaration of 'package %.*s'", LIT(name));
|
|
error_line("\tA package name must be unique\n"
|
|
"\tThere is no relation between a package name and the directory that contains it, so they can be completely different\n"
|
|
"\tA package name is required for link name prefixing to have a consistent ABI\n");
|
|
error_line("%s found at previous location\n", token_pos_to_string(ast_token(prev).pos));
|
|
|
|
// NOTE(Jeroen): Check if the conflicting imports are the same case-folded directory
|
|
// See https://github.com/odin-lang/Odin/issues/5080
|
|
#if defined(GB_SYSTEM_WINDOWS)
|
|
String dir_a = pkg->files[0]->directory;
|
|
String dir_b = (*found)->files[0]->directory;
|
|
|
|
if (str_eq_ignore_case(dir_a, dir_b)) {
|
|
error_line("\tRemember that Windows case-folds paths, and so %.*s and %.*s are the same directory.\n", LIT(dir_a), LIT(dir_b));
|
|
// Could also perform a FS lookup to check which of the two is the actual directory and suggest it, but this should be enough.
|
|
}
|
|
#endif
|
|
|
|
end_error_block();
|
|
}
|
|
|
|
return ok;
|
|
}
|
|
|
|
gb_internal void check_add_entities_from_queues(Checker *c) {
|
|
per_thread_array_gather(&c->info.entity_queue, &c->info.entities);
|
|
}
|
|
|
|
gb_internal void check_add_definitions_from_queues(Checker *c) {
|
|
per_thread_array_gather(&c->info.definition_queue, &c->info.definitions);
|
|
}
|
|
|
|
gb_internal void check_merge_queues_into_arrays(Checker *c) {
|
|
for (Type *t = nullptr; mpsc_dequeue(&c->soa_types_to_complete, &t); /**/) {
|
|
complete_soa_type(c, t, false);
|
|
}
|
|
check_add_entities_from_queues(c);
|
|
check_add_definitions_from_queues(c);
|
|
}
|
|
|
|
gb_internal GB_COMPARE_PROC(init_procedures_cmp) {
|
|
return entity_source_order_cmp(*(Entity **)a, *(Entity **)b);
|
|
}
|
|
|
|
gb_internal GB_COMPARE_PROC(fini_procedures_cmp) {
|
|
return init_procedures_cmp(b, a);
|
|
}
|
|
|
|
gb_internal void check_sort_init_and_fini_procedures(Checker *c) {
|
|
array_sort(c->info.init_procedures, init_procedures_cmp);
|
|
array_sort(c->info.fini_procedures, fini_procedures_cmp);
|
|
|
|
// NOTE(bill): remove possible duplicates from the init/fini lists
|
|
// NOTE(bill): because the arrays are sorted, you only need to check the previous element
|
|
remove_neighbouring_duplicate_entires_from_sorted_array(&c->info.init_procedures);
|
|
remove_neighbouring_duplicate_entires_from_sorted_array(&c->info.fini_procedures);
|
|
}
|
|
|
|
#if 0
|
|
gb_internal void check_walk_all_dependencies(DeclInfo *decl) {
|
|
if (decl == nullptr) {
|
|
return;
|
|
}
|
|
for (DeclInfo *child = decl->next_child; child != nullptr; child = child->next_sibling) {
|
|
check_walk_all_dependencies(child);
|
|
}
|
|
add_deps_from_child_to_parent(decl);
|
|
}
|
|
|
|
gb_internal void check_update_dependency_tree_for_procedures(Checker *c) {
|
|
mutex_lock(&c->nested_proc_lits_mutex);
|
|
for (DeclInfo *decl : c->nested_proc_lits) {
|
|
check_walk_all_dependencies(decl);
|
|
}
|
|
mutex_unlock(&c->nested_proc_lits_mutex);
|
|
for (Entity *e : c->info.entities) {
|
|
DeclInfo *decl = e->decl_info;
|
|
check_walk_all_dependencies(decl);
|
|
}
|
|
}
|
|
#else
|
|
// NOTE: post-order, so a declaration has the dependencies of all those nested in it before they are added to its parent
|
|
gb_internal void check_walk_all_dependencies_post_order(DeclInfo *decl) {
|
|
for (DeclInfo *child = decl->next_child; child != nullptr; child = child->next_sibling) {
|
|
check_walk_all_dependencies_post_order(child);
|
|
}
|
|
add_deps_from_child_to_parent(decl);
|
|
}
|
|
|
|
// NOTE(bill): in chunks, as with a task for each entity, adding the tasks was most of the work
|
|
struct CheckWalkDependenciesChunk {
|
|
DeclInfo **decls; // either these
|
|
Entity ** entities; // or the declarations of these
|
|
isize count;
|
|
};
|
|
|
|
gb_internal WORKER_TASK_PROC(check_walk_all_dependencies_worker_proc) {
|
|
CheckWalkDependenciesChunk *chunk = cast(CheckWalkDependenciesChunk *)data;
|
|
for (isize i = 0; i < chunk->count; i++) {
|
|
DeclInfo *decl = chunk->decls != nullptr ? chunk->decls[i] : chunk->entities[i]->decl_info;
|
|
if (decl != nullptr) {
|
|
check_walk_all_dependencies_post_order(decl);
|
|
}
|
|
}
|
|
return 0;
|
|
}
|
|
|
|
gb_internal void check_update_dependency_tree_for_procedures(Checker *c) {
|
|
isize const CHUNK_SIZE = 256;
|
|
auto chunks = array_make<CheckWalkDependenciesChunk>(heap_allocator(), 0, c->info.entities.count/CHUNK_SIZE + 16);
|
|
defer (array_free(&chunks));
|
|
|
|
mutex_lock(&c->nested_proc_lits_mutex);
|
|
for (isize i = 0; i < c->nested_proc_lits.count; i += CHUNK_SIZE) {
|
|
array_add(&chunks, CheckWalkDependenciesChunk{c->nested_proc_lits.data + i, nullptr, gb_min(CHUNK_SIZE, c->nested_proc_lits.count - i)});
|
|
}
|
|
mutex_unlock(&c->nested_proc_lits_mutex);
|
|
for (isize i = 0; i < c->info.entities.count; i += CHUNK_SIZE) {
|
|
array_add(&chunks, CheckWalkDependenciesChunk{nullptr, c->info.entities.data + i, gb_min(CHUNK_SIZE, c->info.entities.count - i)});
|
|
}
|
|
|
|
TaskGroup group = {};
|
|
for (CheckWalkDependenciesChunk &chunk : chunks) {
|
|
thread_pool_add_task(&group, check_walk_all_dependencies_worker_proc, &chunk);
|
|
}
|
|
thread_pool_wait(&group);
|
|
}
|
|
#endif
|
|
|
|
gb_internal WORKER_TASK_PROC(check_scope_usage_file_worker) {
|
|
Checker *c = global_checker_ptr.load(std::memory_order_relaxed);
|
|
AstFile *f = cast(AstFile *)data;
|
|
u64 vet_flags = ast_file_vet_flags(f);
|
|
check_scope_usage(c, f->scope, vet_flags);
|
|
return 0;
|
|
}
|
|
|
|
gb_internal WORKER_TASK_PROC(check_scope_usage_pkg_worker) {
|
|
Checker *c = global_checker_ptr.load(std::memory_order_relaxed);
|
|
AstPackage *pkg = cast(AstPackage *)data;
|
|
check_scope_usage_internal(c, pkg->scope, 0, true);
|
|
return 0;
|
|
}
|
|
|
|
|
|
|
|
gb_internal void start_check_all_scope_usages(Checker *c, TaskGroup *group) {
|
|
for (auto const &entry : c->info.files) {
|
|
AstFile *f = entry.value;
|
|
thread_pool_add_task(group, check_scope_usage_file_worker, f);
|
|
}
|
|
for (auto const &entry : c->info.packages) {
|
|
AstPackage *pkg = entry.value;
|
|
thread_pool_add_task(group, check_scope_usage_pkg_worker, pkg);
|
|
}
|
|
}
|
|
|
|
|
|
gb_internal void add_untyped_expression_values(UntypedExprInfo *untyped, isize count) {
|
|
Checker *c = global_checker_ptr.load(std::memory_order_relaxed);
|
|
for (isize i = 0; i < count; i++) {
|
|
UntypedExprInfo const &u = untyped[i];
|
|
GB_ASSERT(u.expr != nullptr && u.info != nullptr);
|
|
if (is_type_typed(u.info->type)) {
|
|
compiler_error("%s (type %s) is typed!", expr_to_string(u.expr), type_to_string(u.info->type));
|
|
}
|
|
add_type_and_value(&c->builtin_ctx, u.expr, u.info->mode, u.info->type, u.info->value);
|
|
}
|
|
}
|
|
|
|
gb_internal void hash_type_info_pairs(TypeInfoPair *pairs, isize count) {
|
|
for (isize i = 0; i < count; i++) {
|
|
pairs[i].hash = type_hash_canonical_type(pairs[i].type);
|
|
}
|
|
}
|
|
|
|
gb_internal void check_for_type_and_inline_cycles(Entity **definitions, isize count) {
|
|
for (isize i = 0; i < count; i++) {
|
|
Entity *e = definitions[i];
|
|
switch (e->kind) {
|
|
case Entity_TypeName:
|
|
// NOTE(bill): Check for illegal cyclic type declarations, which are reported when the layout is computed
|
|
if (e->type != nullptr && is_type_typed(e->type) && !e->TypeName.is_type_alias) {
|
|
(void)type_align_of(e->type);
|
|
}
|
|
break;
|
|
case Entity_Procedure: {
|
|
DeclInfo *decl = e->decl_info;
|
|
ast_node(pl, ProcLit, decl->proc_lit);
|
|
if (pl->inlining == ProcInlining_inline && ptr_set_exists(&decl->deps, e)) {
|
|
error(e->token, "Cannot inline recursive procedure '%.*s'", LIT(e->token.string));
|
|
}
|
|
} break;
|
|
}
|
|
}
|
|
}
|
|
|
|
|
|
gb_internal void check_parsed_files(Checker *c) {
|
|
global_checker_ptr.store(c, std::memory_order_relaxed);
|
|
|
|
TIME_SECTION("map full filepaths to scope");
|
|
add_type_info_type(&c->builtin_ctx, t_invalid);
|
|
|
|
// Map full filepaths to Scopes
|
|
for_array(i, c->parser->packages) {
|
|
AstPackage *p = c->parser->packages[i];
|
|
Scope *scope = create_scope_from_package(&c->builtin_ctx, p);
|
|
p->decl_info = make_decl_info(scope, c->builtin_ctx.decl);
|
|
string_map_set(&c->info.packages, p->fullpath, p);
|
|
|
|
if (scope->flags&ScopeFlag_Init) {
|
|
c->info.init_package = p;
|
|
c->info.init_scope = scope;
|
|
}
|
|
if (p->kind == Package_Runtime) {
|
|
GB_ASSERT(c->info.runtime_package == nullptr);
|
|
c->info.runtime_package = p;
|
|
}
|
|
}
|
|
|
|
TIME_SECTION("init worker data");
|
|
check_init_worker_data(c);
|
|
|
|
TIME_SECTION("create file scopes");
|
|
check_create_file_scopes(c);
|
|
|
|
TIME_SECTION("collect entities");
|
|
check_collect_entities_all(c);
|
|
|
|
TIME_SECTION("export entities - pre");
|
|
check_export_entities(c);
|
|
|
|
// NOTE: Timing Section handled internally
|
|
check_import_entities(c);
|
|
|
|
TIME_SECTION("export entities - post");
|
|
check_export_entities(c);
|
|
|
|
// NOTE: no global name is declared from here on, so their scopes are read without locking
|
|
for (AstPackage *pkg : c->parser->packages) {
|
|
pkg->scope->flags |= ScopeFlag_ReadOnly;
|
|
for (AstFile *f : pkg->files) {
|
|
f->scope->flags |= ScopeFlag_ReadOnly;
|
|
}
|
|
}
|
|
builtin_pkg->scope->flags |= ScopeFlag_ReadOnly;
|
|
intrinsics_pkg->scope->flags |= ScopeFlag_ReadOnly;
|
|
config_pkg->scope->flags |= ScopeFlag_ReadOnly;
|
|
|
|
TIME_SECTION("add entities from packages");
|
|
check_merge_queues_into_arrays(c);
|
|
|
|
TIME_SECTION("sort global entities");
|
|
|
|
// NOTE(bill): The queues are filled by parallel workers, meaning when their order differs between runs,
|
|
// but each file's entities are in source order, which a natural merge sort only has to merge
|
|
natural_merge_sort(c->info.entities.data, c->info.entities.count, [](Entity *const &x, Entity *const &y) -> int {
|
|
return entity_source_order_cmp(x, y);
|
|
});
|
|
|
|
TIME_SECTION("check all global entities");
|
|
isize entity_count = c->info.entities.count;
|
|
check_all_global_entities(c);
|
|
|
|
TIME_SECTION("check file scope directives");
|
|
check_file_directives(c);
|
|
|
|
// NOTE(bill): lazy entities are added once checked, which with several threads is in no fixed order
|
|
natural_merge_sort(c->info.entities.data + entity_count, c->info.entities.count - entity_count, [](Entity *const &x, Entity *const &y) -> int {
|
|
return entity_source_order_cmp(x, y);
|
|
});
|
|
|
|
if (build_context.internal_global_entity_graph) {
|
|
TIME_SECTION("print global entity graph");
|
|
print_global_groups(&global_groups);
|
|
}
|
|
destroy_global_groups(&global_groups);
|
|
|
|
TIME_SECTION("init preload");
|
|
init_preload(c);
|
|
|
|
TIME_SECTION("add global untyped expression to queue");
|
|
add_untyped_expressions(&c->info, &c->info.global_untyped);
|
|
|
|
CheckerContext prev_context = c->builtin_ctx;
|
|
defer (c->builtin_ctx = prev_context);
|
|
c->builtin_ctx.decl = make_decl_info(nullptr, nullptr);
|
|
|
|
TIME_SECTION("check procedure bodies");
|
|
check_procedure_bodies(c);
|
|
|
|
TIME_SECTION("check foreign import fullpaths");
|
|
check_foreign_import_fullpaths(c);
|
|
|
|
TIME_SECTION("add entities from procedure bodies");
|
|
check_merge_queues_into_arrays(c);
|
|
|
|
TIME_SECTION("add basic type information");
|
|
// Add "Basic" type information
|
|
for (isize i = 0; i < Basic_COUNT; i++) {
|
|
Type *t = &basic_types[i];
|
|
if (t->Basic.size > 0 &&
|
|
(t->Basic.flags & BasicFlag_LLVM) == 0) {
|
|
if (build_context.bedrock) {
|
|
if ((t->Basic.flags & BasicFlag_Integer) != 0 &&
|
|
t->Basic.size == 16) {
|
|
// disallow 128-bit integers
|
|
continue;
|
|
}
|
|
}
|
|
|
|
add_type_info_type(&c->builtin_ctx, t);
|
|
}
|
|
}
|
|
check_merge_queues_into_arrays(c);
|
|
|
|
TIME_SECTION("check deferred procedures");
|
|
check_deferred_procedures(c);
|
|
|
|
TIME_SECTION("check objc context provider procedures");
|
|
check_objc_context_provider_procedures(c);
|
|
|
|
{
|
|
TIME_SECTION("calculate global init order");
|
|
// NOTE(bill): The graph reads the dependencies before the tree update below adds to them
|
|
Arena *init_order_arena = get_arena(ThreadArena_Temporary);
|
|
ArenaTempGuard init_order_arena_guard(init_order_arena);
|
|
EntityGraph graph = {};
|
|
generate_entity_dependency_graph_nodes(&graph, &c->info, init_order_arena);
|
|
start_generate_entity_dependency_graph_edges(&graph);
|
|
|
|
// NOTE(bill): Since both only read what the procedure bodies left they can run alongside the stages below
|
|
// and are waited for only before what changes that
|
|
//
|
|
// When started after the graph's nodes (which then have every thread) and after its edges (which are then taken first)
|
|
// as they are what the stages after wait on
|
|
TIME_SECTION("start scope usages and type and inline cycles");
|
|
TaskGroup scope_usages = {};
|
|
start_check_all_scope_usages(c, &scope_usages);
|
|
ThreadPoolChunks<Entity *> cycle_checks = {};
|
|
thread_pool_start_chunks(&cycle_checks, c->info.definitions.data, c->info.definitions.count, 1024, check_for_type_and_inline_cycles);
|
|
|
|
TIME_SECTION("wait for the graph's edges");
|
|
finish_generate_entity_dependency_graph_edges(&graph);
|
|
GlobalInitOrderData init_order = {&c->info, graph.nodes};
|
|
|
|
TIME_SECTION("wait for type and inline cycles");
|
|
thread_pool_wait_chunks(&cycle_checks);
|
|
check_merge_queues_into_arrays(c);
|
|
|
|
TIME_SECTION("update dependency tree for procedures");
|
|
check_update_dependency_tree_for_procedures(c);
|
|
|
|
TIME_SECTION("wait for scope usages");
|
|
thread_pool_wait(&scope_usages);
|
|
|
|
TIME_SECTION("generate minimum dependency set");
|
|
// NOTE(bill): Only the backend reads the initialization order so it is found alongside this which waits for it
|
|
thread_pool_add_task(calculate_global_init_order_worker, &init_order);
|
|
generate_minimum_dependency_set(c, c->info.entry_point);
|
|
}
|
|
|
|
// Hashed alongside the stages below, as only the type info array reads the hashes
|
|
auto type_info_types = array_make<TypeInfoPair>(heap_allocator());
|
|
defer (array_free(&type_info_types));
|
|
per_thread_array_gather(&c->info.min_dep_type_info_queue, &type_info_types);
|
|
ThreadPoolChunks<TypeInfoPair> type_info_hashes = {};
|
|
thread_pool_start_chunks(&type_info_hashes, type_info_types.data, type_info_types.count, 128, hash_type_info_pairs);
|
|
|
|
TIME_SECTION("check bodies have all been checked");
|
|
check_min_dep_bodies_were_checked(c);
|
|
|
|
// NOTE(laytan): has to be ran after generate_minimum_dependency_set,
|
|
// because that collects the test procedures.
|
|
TIME_SECTION("check test procedures");
|
|
check_test_procedures(c);
|
|
|
|
check_merge_queues_into_arrays(c);
|
|
thread_pool_wait();
|
|
|
|
TIME_SECTION("check entry point");
|
|
if (build_context.build_mode == BuildMode_Executable && !build_context.no_entry_point && build_context.command_kind != Command_test) {
|
|
Scope *s = c->info.init_scope;
|
|
GB_ASSERT(s != nullptr);
|
|
GB_ASSERT(s->flags&ScopeFlag_Init);
|
|
Entity *e = scope_lookup_current(s, string_interner_insert(str_lit("main")));
|
|
if (e == nullptr) {
|
|
Token token = {};
|
|
token.pos.file_id = 0;
|
|
token.pos.line = 1;
|
|
token.pos.column = 1;
|
|
if (s->pkg->files.count > 0) {
|
|
AstFile *f = s->pkg->files[0];
|
|
token = f->first_token;
|
|
}
|
|
|
|
error(token, "Undefined entry point procedure 'main'");
|
|
}
|
|
} else if (build_context.build_mode == BuildMode_DynamicLibrary && build_context.no_entry_point) {
|
|
c->info.entry_point = nullptr;
|
|
}
|
|
|
|
thread_pool_wait();
|
|
GB_ASSERT(c->procs_to_check.count == 0);
|
|
|
|
if (DEBUG_CHECK_ALL_PROCEDURES) {
|
|
TIME_SECTION("check unchecked (safety measure)");
|
|
check_safety_all_procedures_for_unchecked(c);
|
|
}
|
|
|
|
debugf("Total Procedure Bodies Checked: %td\n", total_bodies_checked.load(std::memory_order_relaxed));
|
|
|
|
TIME_SECTION("check unique link names");
|
|
check_link_name_uses(c);
|
|
|
|
TIME_SECTION("check unique package names");
|
|
bool package_names_are_unique = check_unique_package_names(c);
|
|
|
|
TIME_SECTION("sanity checks");
|
|
check_merge_queues_into_arrays(c);
|
|
GB_ASSERT(per_thread_array_count(&c->info.entity_queue) == 0);
|
|
GB_ASSERT(per_thread_array_count(&c->info.definition_queue) == 0);
|
|
|
|
TIME_SECTION("check instrumentation calls");
|
|
{
|
|
if ((c->info.instrumentation_enter_entity != nullptr) ^
|
|
(c->info.instrumentation_exit_entity != nullptr)) {
|
|
Entity *e = c->info.instrumentation_enter_entity;
|
|
if (!e) e = c->info.instrumentation_exit_entity;
|
|
error(e->token, "Both @(instrumentation_enter) and @(instrumentation_exit) must be defined");
|
|
}
|
|
}
|
|
|
|
|
|
TIME_SECTION("add untyped expression values");
|
|
auto untyped = array_make<UntypedExprInfo>(heap_allocator());
|
|
defer (array_free(&untyped));
|
|
per_thread_array_gather(&c->global_untyped_queue, &untyped);
|
|
thread_pool_for_chunks(untyped.data, untyped.count, 512, add_untyped_expression_values);
|
|
|
|
TIME_SECTION("initialize and check for collisions in type info array");
|
|
{
|
|
TEMPORARY_ALLOCATOR_GUARD();
|
|
|
|
thread_pool_wait_chunks(&type_info_hashes);
|
|
natural_merge_sort(type_info_types.data, type_info_types.count, [](TypeInfoPair const &x, TypeInfoPair const &y) -> int {
|
|
return x.hash < y.hash ? -1 : x.hash > y.hash;
|
|
});
|
|
|
|
// identical types collected through different `Type *`s are one entry
|
|
isize unique_count = 0;
|
|
for (isize i = 0; i < type_info_types.count; i++) {
|
|
TypeInfoPair tt = type_info_types[i];
|
|
bool exists = false;
|
|
for (isize j = unique_count-1; j >= 0 && type_info_types[j].hash == tt.hash; j--) {
|
|
if (are_types_identical_unique_tuples(type_info_types[j].type, tt.type)) {
|
|
exists = true;
|
|
break;
|
|
}
|
|
}
|
|
if (!exists) {
|
|
type_info_types[unique_count++] = tt;
|
|
}
|
|
}
|
|
type_info_types.count = unique_count;
|
|
|
|
array_init(&c->info.type_info_types_hash_map, heap_allocator(), type_info_types.count*2 + 1);
|
|
map_reserve(&c->info.min_dep_type_info_index_map, type_info_types.count);
|
|
|
|
isize hash_map_len = c->info.type_info_types_hash_map.count;
|
|
for (auto const &tt : type_info_types) {
|
|
isize index = tt.hash % hash_map_len;
|
|
// NOTE(bill): no need for a sanity check since there
|
|
// will always be enough space for the entries
|
|
for (;;) {
|
|
if (index == 0 || c->info.type_info_types_hash_map[index].hash != 0) {
|
|
index = (index+1) % hash_map_len;
|
|
continue;
|
|
}
|
|
break;
|
|
}
|
|
c->info.type_info_types_hash_map[index] = tt;
|
|
|
|
bool exists = map_set_if_not_previously_exists(&c->info.min_dep_type_info_index_map, tt.hash, index);
|
|
// Because we've already written a nice error about a duplicate package declaration, skip this panic if the package names aren't unique.
|
|
if (package_names_are_unique && exists) {
|
|
for (auto const &entry : c->info.min_dep_type_info_index_map) {
|
|
if (entry.key != tt.hash) {
|
|
continue;
|
|
}
|
|
auto const &other = c->info.type_info_types_hash_map[entry.value];
|
|
if (are_types_identical_unique_tuples(tt.type, other.type)) {
|
|
continue;
|
|
}
|
|
gbString t = temp_canonical_string(tt.type);
|
|
gbString o = temp_canonical_string(other.type);
|
|
GB_PANIC("%s (%s) %llu vs %s (%s) %llu",
|
|
type_to_string(tt.type, false), t, cast(unsigned long long)tt.hash,
|
|
type_to_string(other.type, false), o, cast(unsigned long long)other.hash);
|
|
}
|
|
}
|
|
}
|
|
|
|
|
|
GB_ASSERT(c->info.min_dep_type_info_index_map.count <= type_info_types.count);
|
|
}
|
|
|
|
|
|
TIME_SECTION("sort init and fini procedures");
|
|
check_sort_init_and_fini_procedures(c);
|
|
|
|
if (c->info.intrinsics_entry_point_usage.count > 0) {
|
|
TIME_SECTION("check intrinsics.__entry_point usage");
|
|
Ast *node = nullptr;
|
|
while (mpsc_dequeue(&c->info.intrinsics_entry_point_usage, &node)) {
|
|
if (c->info.entry_point == nullptr && node != nullptr) {
|
|
if (node->file()->pkg->kind != Package_Runtime) {
|
|
error(node, "usage of intrinsics.__entry_point will be a no-op");
|
|
}
|
|
}
|
|
}
|
|
}
|
|
|
|
TIME_SECTION("collate type info stuff");
|
|
{
|
|
auto views = array_make<RaddbgTypeView>(heap_allocator());
|
|
defer (array_free(&views));
|
|
for (RaddbgTypeView type_view; mpsc_dequeue(&c->info.raddbg_type_views_queue, &type_view); /**/) {
|
|
array_add(&views, type_view);
|
|
}
|
|
array_sort(views, raddbg_type_view_cmp);
|
|
for (RaddbgTypeView const &type_view : views) {
|
|
handle_raddbg_type_view(c, type_view);
|
|
}
|
|
}
|
|
|
|
|
|
TIME_SECTION("type check finish");
|
|
}
|