Home
last modified time | relevance | path

Searched refs:nodes_count (Results 1 – 6 of 6) sorted by relevance

/xnu-11215/bsd/net/
H A Dtrie_utility.c64 if (trie->nodes_free_next < trie->nodes_count) { in trie_node_alloc()
116 size_t nodes_count = 0; in net_trie_init() local
135 if (os_add3_overflow(prefix_count, leaf_count, 1, &nodes_count)) { /* + 1 for the root node */ in net_trie_init()
145 if (bytes_count > UINT16_MAX || nodes_count > UINT16_MAX || maps_count > UINT16_MAX) { in net_trie_init()
150 if (os_mul_overflow(sizeof(*new_trie->nodes), (size_t)nodes_count, &nodes_mem_size) || in net_trie_init()
183 new_trie->nodes_count = (uint16_t)nodes_count; in net_trie_init()
206 uint16_t nodes_count, uint16_t child_maps_count, uint16_t bytes_count) in net_trie_init_with_mem() argument
223 os_mul_overflow(sizeof(*new_trie->nodes), (size_t)nodes_count, &test_nodes_mem_size) || in net_trie_init_with_mem()
235 …_TRIE_LOG(LOG_ERR, "%s: NET_TRIE - passed in nodes_count %d not valid", __FUNCTION__, nodes_count); in net_trie_init_with_mem()
262 new_trie->nodes_count = (uint16_t)nodes_count; in net_trie_init_with_mem()
[all …]
H A Dtrie_utility.h68 struct net_trie_node *nodes __counted_by(nodes_count);
72 uint16_t nodes_count; member
90 uint16_t nodes_count, uint16_t child_maps_count, uint16_t bytes_count);
H A Dnecp.h81 uint32_t nodes_count; member
H A Dnecp.c6096 trie_request->nodes_count, trie_request->maps_count, trie_request->bytes_count) == false) { in necp_create_domain_trie()
/xnu-11215/bsd/netinet/
H A Dflow_divert.h76 struct flow_divert_trie_node *nodes __counted_by(nodes_count);
80 uint16_t nodes_count; member
H A Dflow_divert.c752 if (trie->nodes_free_next < trie->nodes_count) { in trie_node_alloc()
3080 size_t nodes_count = 0; in flow_divert_handle_app_map_create() local
3128 …if (os_add3_overflow(prefix_count, signing_id_count, 1, &nodes_count)) { /* + 1 for the root node … in flow_divert_handle_app_map_create()
3140 if (bytes_count > UINT16_MAX || nodes_count > UINT16_MAX || maps_count > UINT16_MAX) { in flow_divert_handle_app_map_create()
3142 …d bytes count (%lu), nodes count (%lu) or maps count (%lu)", bytes_count, nodes_count, maps_count); in flow_divert_handle_app_map_create()
3147 nodes_count, maps_count, bytes_count); in flow_divert_handle_app_map_create()
3149 if (os_mul_overflow(sizeof(*new_trie.nodes), (size_t)nodes_count, &nodes_mem_size) || in flow_divert_handle_app_map_create()
3175 new_trie.nodes_count = (uint16_t)nodes_count; in flow_divert_handle_app_map_create()