Searched refs:TRIE_NODE (Results 1 – 1 of 1) sorted by relevance
| /xnu-10063.101.15/bsd/netinet/ |
| H A D | flow_divert.c | 126 #define TRIE_NODE(t, i) ((t)->nodes[(i)]) macro
127 #define TRIE_CHILD(t, i, b) (((t)->child_maps + (CHILD_MAP_SIZE * TRIE_NODE(t, i).child…
763 TRIE_NODE(trie, node_idx).child_map = NULL_TRIE_IDX; in trie_node_alloc()
812 current_end = TRIE_NODE(trie, current).start + TRIE_NODE(trie, current).length; in flow_divert_trie_insert()
814 for (node_idx = TRIE_NODE(trie, current).start; in flow_divert_trie_insert()
824 if (node_idx < (TRIE_NODE(trie, current).start + TRIE_NODE(trie, current).length)) { in flow_divert_trie_insert()
843 TRIE_NODE(trie, prefix).start = TRIE_NODE(trie, current).start; in flow_divert_trie_insert()
844 TRIE_NODE(trie, prefix).length = (node_idx - TRIE_NODE(trie, current).start); in flow_divert_trie_insert()
850 TRIE_NODE(trie, prefix).child_map = trie_child_map_alloc(trie); in flow_divert_trie_insert()
851 if (TRIE_NODE(trie, prefix).child_map == NULL_TRIE_IDX) { in flow_divert_trie_insert()
[all …]
|