Searched refs:node_idx (Results 1 – 1 of 1) sorted by relevance
695 uint16_t node_idx = trie->nodes_free_next++; in trie_node_alloc() local696 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() local747 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()[all …]