remove old frame call stack tree cache - supplanted by artifact cache

This commit is contained in:
Ryan Fleury
2025-10-16 14:08:50 -07:00
parent edb1863020
commit 46634f547f
3 changed files with 5 additions and 10 deletions
-1
View File
@@ -11459,7 +11459,6 @@ rd_frame(void)
// //
Access *frame_access_restore = rd_state->frame_access; Access *frame_access_restore = rd_state->frame_access;
rd_state->frame_access = access_open(); rd_state->frame_access = access_open();
rd_state->got_frame_call_stack_tree = 0;
////////////////////////////// //////////////////////////////
//- rjf: calculate avg length in us of last many frames //- rjf: calculate avg length in us of last many frames
-2
View File
@@ -579,8 +579,6 @@ struct RD_State
// rjf: frame parameters // rjf: frame parameters
F32 frame_dt; F32 frame_dt;
Access *frame_access; Access *frame_access;
CTRL_CallStackTree frame_call_stack_tree;
B32 got_frame_call_stack_tree;
// rjf: evaluation cache // rjf: evaluation cache
E_Cache *eval_cache; E_Cache *eval_cache;
+5 -7
View File
@@ -1558,17 +1558,15 @@ struct RD_CallStackTreeExpandAccel
E_TYPE_EXPAND_INFO_FUNCTION_DEF(call_stack_tree) E_TYPE_EXPAND_INFO_FUNCTION_DEF(call_stack_tree)
{ {
if(!rd_state->got_frame_call_stack_tree) Access *access = access_open();
{ CTRL_CallStackTree call_stack_tree = ctrl_call_stack_tree(access, 0);
rd_state->got_frame_call_stack_tree = 1; access_close(access);
rd_state->frame_call_stack_tree = ctrl_call_stack_tree(rd_state->frame_access, 0);
}
RD_CallStackTreeExpandAccel *accel = push_array(arena, RD_CallStackTreeExpandAccel, 1); RD_CallStackTreeExpandAccel *accel = push_array(arena, RD_CallStackTreeExpandAccel, 1);
accel->node = &ctrl_call_stack_tree_node_nil; accel->node = &ctrl_call_stack_tree_node_nil;
U64 id = e_value_eval_from_eval(eval).value.u64; U64 id = e_value_eval_from_eval(eval).value.u64;
if(rd_state->frame_call_stack_tree.slots_count != 0) if(call_stack_tree.slots_count != 0)
{ {
for(CTRL_CallStackTreeNode *n = rd_state->frame_call_stack_tree.slots[id%rd_state->frame_call_stack_tree.slots_count]; for(CTRL_CallStackTreeNode *n = call_stack_tree.slots[id%call_stack_tree.slots_count];
n != 0; n != 0;
n = n->hash_next) n = n->hash_next)
{ {