Home
last modified time | relevance | path

Searched refs:TRIE_NODE (Results 1 – 3 of 3) sorted by relevance

/xnu-11417.121.6/bsd/net/
H A Dtrie_utility.c55 …(((t)->child_maps + (CHILD_MAP_SIZE * TRIE_NODE(t, i).child_map))[(b - FIRST_PRINTABLE_ASCII)]) = …
66 TRIE_NODE(trie, node_idx).child_map = NULL_TRIE_IDX; in trie_node_alloc()
337 current_end = TRIE_NODE(trie, current).start + TRIE_NODE(trie, current).length; in net_trie_insert()
339 for (node_idx = TRIE_NODE(trie, current).start; in net_trie_insert()
349 if (node_idx < (TRIE_NODE(trie, current).start + TRIE_NODE(trie, current).length)) { in net_trie_insert()
368 TRIE_NODE(trie, prefix).start = TRIE_NODE(trie, current).start; in net_trie_insert()
369 TRIE_NODE(trie, prefix).length = (node_idx - TRIE_NODE(trie, current).start); in net_trie_insert()
371 TRIE_NODE(trie, prefix).is_leaf = true; in net_trie_insert()
377 … TRIE_NODE(trie, prefix).metadata = trie_bytes_move(trie, trie->bytes_free_next, metadata_length); in net_trie_insert()
378 TRIE_NODE(trie, prefix).metadata_length = (uint16_t)metadata_length; in net_trie_insert()
[all …]
H A Dtrie_utility.h44 #define TRIE_NODE(t, i) ((t)->nodes[(i)]) macro
46 …(((t)->child_maps + (CHILD_MAP_SIZE * TRIE_NODE(t, i).child_map))[(b - FIRST_PRINTABLE_ASCII)]) : \
/xnu-11417.121.6/bsd/netinet/
H A Dflow_divert.c121 #define TRIE_NODE(t, i) ((t)->nodes[(i)]) macro
122 #define TRIE_CHILD(t, i, b) (((t)->child_maps + (CHILD_MAP_SIZE * TRIE_NODE(t, i).child…
768 TRIE_NODE(trie, node_idx).child_map = NULL_TRIE_IDX; in trie_node_alloc()
817 current_end = TRIE_NODE(trie, current).start + TRIE_NODE(trie, current).length; in flow_divert_trie_insert()
819 for (node_idx = TRIE_NODE(trie, current).start; in flow_divert_trie_insert()
829 if (node_idx < (TRIE_NODE(trie, current).start + TRIE_NODE(trie, current).length)) { in flow_divert_trie_insert()
848 TRIE_NODE(trie, prefix).start = TRIE_NODE(trie, current).start; in flow_divert_trie_insert()
849 TRIE_NODE(trie, prefix).length = (node_idx - TRIE_NODE(trie, current).start); in flow_divert_trie_insert()
855 TRIE_NODE(trie, prefix).child_map = trie_child_map_alloc(trie); in flow_divert_trie_insert()
856 if (TRIE_NODE(trie, prefix).child_map == NULL_TRIE_IDX) { in flow_divert_trie_insert()
[all …]