Home
last modified time | relevance | path

Searched refs:node_idx (Results 1 – 2 of 2) sorted by relevance

/xnu-11215/bsd/net/
H A Dtrie_utility.c65 uint16_t node_idx = trie->nodes_free_next++; in trie_node_alloc() local
67 return node_idx; in trie_node_alloc()
331 uint16_t node_idx; in net_trie_insert() local
340 node_idx < current_end && in net_trie_insert()
343 node_idx++, string_idx++) { in net_trie_insert()
477 uint16_t node_idx; in net_trie_search() local
481 node_idx < node_end && string_idx >= 0 && string[string_idx] == TRIE_BYTE(trie, node_idx); in net_trie_search()
482 node_idx++, string_idx--) { in net_trie_search()
490node_idx < node_end && string_idx < (int16_t)string_length && string[string_idx] == TRIE_BYTE(trie… in net_trie_search()
491 node_idx++, string_idx++) { in net_trie_search()
[all …]
/xnu-11215/bsd/netinet/
H A Dflow_divert.c753 uint16_t node_idx = trie->nodes_free_next++; in trie_node_alloc() local
755 return node_idx; in trie_node_alloc()
797 uint16_t node_idx; in flow_divert_trie_insert() local
805 for (node_idx = TRIE_NODE(trie, current).start; in flow_divert_trie_insert()
806 node_idx < current_end && in flow_divert_trie_insert()
809 node_idx++, string_idx++) { in flow_divert_trie_insert()
852 TRIE_NODE(trie, current).start = node_idx; in flow_divert_trie_insert()
911 uint16_t node_idx; in flow_divert_trie_search() local
914node_idx < node_end && string_bytes[string_idx] != '\0' && string_bytes[string_idx] == TRIE_BYTE(t… in flow_divert_trie_search()
915 node_idx++, string_idx++) { in flow_divert_trie_search()
[all …]