ed/raddebugger
1
0
Fork 0
mirror of https://github.com/Ed94/raddebugger.git synced 2026-08-02 03:58:11 +00:00
Code Issues Packages Projects Releases Wiki Activity

switch to thread safe hash trie map

Browse Source 
Initial implementation of the symbol table allowed us to push symbols
from one thread at a time and required a wonky lock-step and spread out
logic for replacing symbols. And because it was a externally chained
hash table we had to guesstimate optimal capacity for small and big targets.
We erred on the side of larger capacity to prevent degradation and
rehashing, however this meant small targets had to spent unreasonable
amount of time memory allocing slots. With hash trie we can dynamically
scale up to 4 ^ 32 items and atomically replace symbols when needed. Neat!
This commit is contained in:
Nikita Smith
2024-10-30 15:43:53 -07:00
parent ee65ea3692
commit 4a2e1dd8d0
14 changed files with 877 additions and 1049 deletions
Download Patch File Download Diff File Expand all files Collapse all files
src/linker/lnk_lib.c
+14 -8
View File
@@ -97,6 +97,8 @@ lnk_lib_symbol_array_sort(LNK_LibSymbol *arr, U64 count)
internal LNK_Lib
lnk_lib_from_data(Arena *arena, String8 data, String8 path)
{
ProfBeginFunction();
U64 symbol_count;
String8 string_table;
U32 *member_off_arr;
@@ -167,9 +169,11 @@ lnk_lib_from_data(Arena *arena, String8 data, String8 path)
lib.symbol_name_list = symbol_name_list;
lib.long_names = parse.long_names;
ProfEnd();
return lib;
}
internal
THREAD_POOL_TASK_FUNC(lnk_lib_initer)
{
LNK_LibIniter *task = raw_task;
@@ -179,6 +183,7 @@ THREAD_POOL_TASK_FUNC(lnk_lib_initer)
String8 path = task->path_arr[task_id];
*lib = lnk_lib_from_data(arena, data, path);
lib->input_idx = task->base_input_idx + task_id;
}
internal LNK_LibNodeArray
@@ -187,15 +192,16 @@ lnk_lib_list_push_parallel(TP_Context *tp, TP_Arena *arena, LNK_LibList *list, S
Assert(data_arr.count == path_arr.count);
U64 lib_count = data_arr.count;
LNK_LibIniter lib_initer = {0};
lib_initer.node_arr = lnk_lib_list_reserve(arena->v[0], list, lib_count);
lib_initer.data_arr = data_arr.v;
lib_initer.path_arr = path_arr.v;
tp_for_parallel(tp, arena, lib_count, lnk_lib_initer, &lib_initer);
LNK_LibIniter task = {0};
task.node_arr = lnk_lib_list_reserve(arena->v[0], list, lib_count);
task.data_arr = data_arr.v;
task.path_arr = path_arr.v;
task.base_input_idx = list->count;
tp_for_parallel(tp, arena, lib_count, lnk_lib_initer, &task);
LNK_LibNodeArray arr;
arr.count = lib_count;
arr.v = lib_initer.node_arr;
LNK_LibNodeArray arr = {0};
arr.count = lib_count;
arr.v = task.node_arr;
return arr;
}