Searched refs:node_idx (Results 1 – 2 of 2) sorted by relevance
| /xnu-11417.121.6/bsd/net/ ! |
| H A D | trie_utility.c | 65 uint16_t node_idx = trie->nodes_free_next++; in trie_node_alloc() local
66 TRIE_NODE(trie, node_idx).child_map = NULL_TRIE_IDX; in trie_node_alloc()
67 return node_idx; in trie_node_alloc()
331 uint16_t node_idx; in net_trie_insert() local
339 for (node_idx = TRIE_NODE(trie, current).start; in net_trie_insert()
340 node_idx < current_end && in net_trie_insert()
342 TRIE_BYTE(trie, node_idx) == TRIE_BYTE(trie, string_idx); in net_trie_insert()
343 node_idx++, string_idx++) { in net_trie_insert()
349 if (node_idx < (TRIE_NODE(trie, current).start + TRIE_NODE(trie, current).length)) { in net_trie_insert()
369 TRIE_NODE(trie, prefix).length = (node_idx - TRIE_NODE(trie, current).start); in net_trie_insert()
[all …]
|
| /xnu-11417.121.6/bsd/netinet/ ! |
| H A D | flow_divert.c | 767 uint16_t node_idx = trie->nodes_free_next++; in trie_node_alloc() local
768 TRIE_NODE(trie, node_idx).child_map = NULL_TRIE_IDX; in trie_node_alloc()
769 return node_idx; in trie_node_alloc()
811 uint16_t node_idx; in flow_divert_trie_insert() local
819 for (node_idx = TRIE_NODE(trie, current).start; in flow_divert_trie_insert()
820 node_idx < current_end && in flow_divert_trie_insert()
822 TRIE_BYTE(trie, node_idx) == TRIE_BYTE(trie, string_idx); in flow_divert_trie_insert()
823 node_idx++, string_idx++) { in flow_divert_trie_insert()
829 if (node_idx < (TRIE_NODE(trie, current).start + TRIE_NODE(trie, current).length)) { in flow_divert_trie_insert()
849 TRIE_NODE(trie, prefix).length = (node_idx - TRIE_NODE(trie, current).start); in flow_divert_trie_insert()
[all …]
|