Home
last modified time | relevance | path

Searched refs:trie (Results 1 – 4 of 4) sorted by relevance

/xnu-12377.41.6/bsd/net/
H A Dtrie_utility.c62 trie_node_alloc(struct net_trie *trie) in trie_node_alloc() argument
64 if (trie->nodes_free_next < trie->nodes_count) { in trie_node_alloc()
65 uint16_t node_idx = trie->nodes_free_next++; in trie_node_alloc()
66 TRIE_NODE(trie, node_idx).child_map = NULL_TRIE_IDX; in trie_node_alloc()
74 trie_child_map_alloc(struct net_trie *trie) in trie_child_map_alloc() argument
76 if (trie->child_maps_free_next < trie->child_maps_count) { in trie_child_map_alloc()
77 return trie->child_maps_free_next++; in trie_child_map_alloc()
84 trie_bytes_move(struct net_trie *trie, uint16_t bytes_idx, size_t bytes_size) in trie_bytes_move() argument
86 uint16_t start = trie->bytes_free_next; in trie_bytes_move()
87 if (start + bytes_size <= trie->bytes_count) { in trie_bytes_move()
[all …]
H A Dtrie_utility.h91 uint16_t net_trie_insert(struct net_trie *trie,
95 uint16_t net_trie_search(struct net_trie *trie,
H A Dnecp.c310 struct net_trie trie; member
558 static void necp_free_domain_trie(struct necp_domain_trie *trie);
1655 struct necp_domain_trie* __single trie = NULL; in necp_session_remove_all_domain_tries() local
1657 LIST_FOREACH_SAFE(trie, &session->domain_tries, owner_chain, temp_trie) { in necp_session_remove_all_domain_tries()
1658 if (os_ref_release_locked(&trie->refcount) == 0) { in necp_session_remove_all_domain_tries()
1660 LIST_REMOVE(trie, chain); in necp_session_remove_all_domain_tries()
1662 LIST_REMOVE(trie, owner_chain); in necp_session_remove_all_domain_tries()
1663 necp_free_domain_trie(trie); in necp_session_remove_all_domain_tries()
1707 struct necp_domain_trie* __single trie = NULL; in necp_session_trie_dump_all() local
1708 LIST_FOREACH(trie, &necp_global_domain_trie_list, chain) { in necp_session_trie_dump_all()
[all …]
/xnu-12377.41.6/bsd/netinet/
H A Dflow_divert.c761 trie_node_alloc(struct flow_divert_trie *trie) in trie_node_alloc() argument
763 if (trie->nodes_free_next < trie->nodes_count) { in trie_node_alloc()
764 uint16_t node_idx = trie->nodes_free_next++; in trie_node_alloc()
765 TRIE_NODE(trie, node_idx).child_map = NULL_TRIE_IDX; in trie_node_alloc()
773 trie_child_map_alloc(struct flow_divert_trie *trie) in trie_child_map_alloc() argument
775 if (trie->child_maps_free_next < trie->child_maps_count) { in trie_child_map_alloc()
776 return trie->child_maps_free_next++; in trie_child_map_alloc()
783 trie_bytes_move(struct flow_divert_trie *trie, uint16_t bytes_idx, size_t bytes_size) in trie_bytes_move() argument
785 uint16_t start = trie->bytes_free_next; in trie_bytes_move()
786 if (start + bytes_size <= trie->bytes_count) { in trie_bytes_move()
[all …]