Home
last modified time | relevance | path

Searched refs:curr_node (Results 1 – 3 of 3) sorted by relevance

/xnu-11215.81.4/tests/sched/sched_test_harness/
H A Dsched_clutch_harness.c276 struct list_node *curr_node = allocated_list; in impl_cleanup_harness() local
277 while (curr_node != NULL) { in impl_cleanup_harness()
278 free(curr_node->ptr); in impl_cleanup_harness()
279 struct list_node *next_node = curr_node->next; in impl_cleanup_harness()
280 free(curr_node); in impl_cleanup_harness()
281 curr_node = next_node; in impl_cleanup_harness()
/xnu-11215.81.4/bsd/skywalk/lib/
H A Dcuckoo_hashtable.c616 struct _bfs_node *prev_node, *curr_node; in cuckoo_move() local
620 curr_node = &queue[leaf_node_idx]; in cuckoo_move()
621 to_bkt = __get_bucket(h, curr_node->bkt_idx); in cuckoo_move()
626 while (__probable(curr_node->prev_node_idx != _CHT_BFS_QUEUE_LEN)) { in cuckoo_move()
627 prev_node = &queue[curr_node->prev_node_idx]; in cuckoo_move()
629 from_slot = curr_node->prev_slot_idx; in cuckoo_move()
670 curr_node = prev_node; in cuckoo_move()
675 ASSERT(curr_node->prev_node_idx == _CHT_BFS_QUEUE_LEN); in cuckoo_move()
676 ASSERT(curr_node->prev_slot_idx == _CHT_SLOT_INVAL); in cuckoo_move()
H A Dcuckoo_hashtable_test.c274 cuckoo_hashtable_foreach(h, ^(struct cuckoo_node *curr_node, uint32_t curr_hash) { in cht_basic_tests()
275 co = container_of(curr_node, struct cht_obj, co_cnode); in cht_basic_tests()
394 cuckoo_hashtable_foreach(h, ^(struct cuckoo_node *curr_node, uint32_t curr_hash) { in cht_concurrent_add_check()
395 co = container_of(curr_node, struct cht_obj, co_cnode); in cht_concurrent_add_check()