MCPcopy Create free account
hub / github.com/1a1a11a/libCacheSim / free_sTree

Function free_sTree

libCacheSim/dataStructure/splay.c:242–248  ·  view source on GitHub ↗

sTree *find_node(key_type e, sTree *t) { /* Returns a pointer to the node in the sTree with the given value. */ /* Returns NULL if there is no such node. */ /* Does not change the sTree. To guarantee logarithmic behavior, */ /* the node found here should be splayed to the root. */ T lsize; / if ((value < 0) || (value >= node_value(t))) return NULL; for

Source from the content-addressed store, hash-verified

240// }
241//}
242void free_sTree(sTree* t)
243{
244 if(t==NULL) return;
245 free_sTree(t->right);
246 free_sTree(t->left);
247 free_node(t);
248}
249void print_sTree(sTree * t, int d) {
250 //printf("%p\n",t);
251 int i;

Callers 3

_get_lru_hit_cntFunction · 0.85
get_stack_distFunction · 0.85
generate_shards_mrcFunction · 0.85

Calls 1

free_nodeFunction · 0.85

Tested by

no test coverage detected