Lines Matching refs:node_idx
723 uint16_t node_idx = trie->nodes_free_next++; in trie_node_alloc() local
724 TRIE_NODE(trie, node_idx).child_map = NULL_TRIE_IDX; in trie_node_alloc()
725 return node_idx; in trie_node_alloc()
767 uint16_t node_idx; in flow_divert_trie_insert() local
775 for (node_idx = TRIE_NODE(trie, current).start; in flow_divert_trie_insert()
776 node_idx < current_end && in flow_divert_trie_insert()
778 TRIE_BYTE(trie, node_idx) == TRIE_BYTE(trie, string_idx); in flow_divert_trie_insert()
779 node_idx++, string_idx++) { in flow_divert_trie_insert()
785 if (node_idx < (TRIE_NODE(trie, current).start + TRIE_NODE(trie, current).length)) { in flow_divert_trie_insert()
805 TRIE_NODE(trie, prefix).length = (node_idx - TRIE_NODE(trie, current).start); in flow_divert_trie_insert()
816 TRIE_CHILD(trie, prefix, TRIE_BYTE(trie, node_idx)) = current; in flow_divert_trie_insert()
822 TRIE_NODE(trie, current).start = node_idx; in flow_divert_trie_insert()
881 uint16_t node_idx; in flow_divert_trie_search() local
883 for (node_idx = TRIE_NODE(trie, current).start; in flow_divert_trie_search()
884 …node_idx < node_end && string_bytes[string_idx] != '\0' && string_bytes[string_idx] == TRIE_BYTE(t… in flow_divert_trie_search()
885 node_idx++, string_idx++) { in flow_divert_trie_search()
889 if (node_idx == node_end) { in flow_divert_trie_search()