Lines Matching refs:node_idx
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()
860 TRIE_CHILD(trie, prefix, TRIE_BYTE(trie, node_idx)) = current; in flow_divert_trie_insert()
866 TRIE_NODE(trie, current).start = node_idx; in flow_divert_trie_insert()
925 uint16_t node_idx; in flow_divert_trie_search() local
927 for (node_idx = TRIE_NODE(trie, current).start; in flow_divert_trie_search()
928 …node_idx < node_end && string_bytes[string_idx] != '\0' && string_bytes[string_idx] == TRIE_BYTE(t… in flow_divert_trie_search()
929 node_idx++, string_idx++) { in flow_divert_trie_search()
933 if (node_idx == node_end) { in flow_divert_trie_search()