Lines Matching refs:node_idx
695 uint16_t node_idx = trie->nodes_free_next++; in trie_node_alloc() local
696 TRIE_NODE(trie, node_idx).child_map = NULL_TRIE_IDX; in trie_node_alloc()
697 return node_idx; in trie_node_alloc()
739 uint16_t node_idx; in flow_divert_trie_insert() local
747 for (node_idx = TRIE_NODE(trie, current).start; in flow_divert_trie_insert()
748 node_idx < current_end && in flow_divert_trie_insert()
750 TRIE_BYTE(trie, node_idx) == TRIE_BYTE(trie, string_idx); in flow_divert_trie_insert()
751 node_idx++, string_idx++) { in flow_divert_trie_insert()
757 if (node_idx < (TRIE_NODE(trie, current).start + TRIE_NODE(trie, current).length)) { in flow_divert_trie_insert()
777 TRIE_NODE(trie, prefix).length = (node_idx - TRIE_NODE(trie, current).start); in flow_divert_trie_insert()
788 TRIE_CHILD(trie, prefix, TRIE_BYTE(trie, node_idx)) = current; in flow_divert_trie_insert()
794 TRIE_NODE(trie, current).start = node_idx; in flow_divert_trie_insert()
853 uint16_t node_idx; in flow_divert_trie_search() local
855 for (node_idx = TRIE_NODE(trie, current).start; in flow_divert_trie_search()
856 …node_idx < node_end && string_bytes[string_idx] != '\0' && string_bytes[string_idx] == TRIE_BYTE(t… in flow_divert_trie_search()
857 node_idx++, string_idx++) { in flow_divert_trie_search()
861 if (node_idx == node_end) { in flow_divert_trie_search()