ed/Odin
1
0
Fork 0
mirror of https://github.com/Ed94/Odin.git synced 2026-08-04 14:48:47 +00:00
Code Issues Packages Projects Releases Wiki Activity

Narrow type info mutex usage

Browse Source
This commit is contained in:
gingerBill
2023-01-02 20:38:37 +00:00
parent d2ec2d1606
commit 09c26e6be0
1 changed files with 27 additions and 28 deletions
Download Patch File Download Diff File Expand all files Collapse all files
src/checker.cpp
+27 -28
View File
@@ -1731,10 +1731,7 @@ gb_internal void add_type_info_type(CheckerContext *c, Type *t) {
if (build_context.disallow_rtti) { if (build_context.disallow_rtti) {
return; return;
} }
mutex_lock(&c->info->type_info_mutex);
add_type_info_type_internal(c, t); add_type_info_type_internal(c, t);
mutex_unlock(&c->info->type_info_mutex);
} }
gb_internal void add_type_info_type_internal(CheckerContext *c, Type *t) { gb_internal void add_type_info_type_internal(CheckerContext *c, Type *t) {
@@ -1751,33 +1748,35 @@ gb_internal void add_type_info_type_internal(CheckerContext *c, Type *t) {
add_type_info_dependency(c->info, c->decl, t); add_type_info_dependency(c->info, c->decl, t);
auto found = map_get(&c->info->type_info_map, t); MUTEX_GUARD_BLOCK(&c->info->type_info_mutex) {
if (found != nullptr) { auto found = map_get(&c->info->type_info_map, t);
// Types have already been added if (found != nullptr) {
return; // Types have already been added
} return;
bool prev = false;
isize ti_index = -1;
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;
array_add(&c->info->type_info_types, t);
}
map_set(&c->checker->info.type_info_map, t, ti_index);
if (prev) { bool prev = false;
// NOTE(bill): If a previous one exists already, no need to continue isize ti_index = -1;
return; 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;
array_add(&c->info->type_info_types, t);
}
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 // Add nested types