d2r2 type deduplication: further work on type content hashing; correct .debug_str_offsets handling; sketch out type dependency chain build

This commit is contained in:
Ryan Fleury committed 2026-04-24 20:34:20 -07:00
1 parent 35e00de05c
commit ad0d023c93
9 files changed
+674 -326

No files matched your search

+14 -16
View File
@@ -758,34 +758,32 @@ rng1u64_array_from_list(Arena *arena, Rng1U64List *list)
}
internal U64
rng_1u64_array_bsearch(Rng1U64Array arr, U64 value)
rng1u64_array_num_from_value__binary_search(Rng1U64Array *array, U64 value)
{
if(arr.count > 0 && arr.v[0].min < value && value < arr.v[arr.count-1].max)
U64 result = 0;
if(array->count > 0 && array->v[0].min <= value && value < array->v[array->count-1].max)
{
U64 l = 0;
U64 r = arr.count - 1;
for(; l <= r; )
U64 min_idx = 0;
U64 max_idx = array->count - 1;
for(;min_idx <= max_idx;)
{
U64 m = l + (r - l) / 2;
if(contains_1u64(arr.v[m], value))
U64 mid_idx = min_idx + (max_idx - min_idx) / 2;
if(contains_1u64(array->v[mid_idx], value))
{
return m;
result = mid_idx+1;
break;
}
else if(arr.v[m].min < value)
else if(array->v[mid_idx].min < value)
{
l = m + 1;
min_idx = mid_idx + 1;
}
else
{
r = m - 1;
max_idx = mid_idx - 1;
}
}
}
else if(arr.count == 1 && contains_1u64(arr.v[0], value))
{
return 0;
}
return max_U64;
return result;
}
internal void
+1 -1
View File
@@ -682,7 +682,7 @@ internal void rng1u64_list_push_node(Rng1U64List *list, Rng1U64Node *n);
internal Rng1U64Node * rng1u64_list_push(Arena *arena, Rng1U64List *list, Rng1U64 rng);
internal void rng1u64_list_concat(Rng1U64List *list, Rng1U64List *to_concat);
internal Rng1U64Array rng1u64_array_from_list(Arena *arena, Rng1U64List *list);
internal U64 rng_1u64_array_bsearch(Rng1U64Array arr, U64 value);
internal U64 rng1u64_array_num_from_value__binary_search(Rng1U64Array *array, U64 value);
internal void rng1s64_list_push(Arena *arena, Rng1S64List *list, Rng1S64 rng);
internal Rng1S64Array rng1s64_array_from_list(Arena *arena, Rng1S64List *list);