124 #define TRIE_NODE(t, i)                 ((t)->nodes[(i)])  macro
125 #define TRIE_CHILD(t, i, b)             (((t)->child_maps + (CHILD_MAP_SIZE * TRIE_NODE(t, i).child…
724 		TRIE_NODE(trie, node_idx).child_map = NULL_TRIE_IDX;  in trie_node_alloc()
773 		current_end = TRIE_NODE(trie, current).start + TRIE_NODE(trie, current).length;  in flow_divert_trie_insert()
775 		for (node_idx = TRIE_NODE(trie, current).start;  in flow_divert_trie_insert()
785 		if (node_idx < (TRIE_NODE(trie, current).start + TRIE_NODE(trie, current).length)) {  in flow_divert_trie_insert()
804 			TRIE_NODE(trie, prefix).start = TRIE_NODE(trie, current).start;  in flow_divert_trie_insert()
805 			TRIE_NODE(trie, prefix).length = (node_idx - TRIE_NODE(trie, current).start);  in flow_divert_trie_insert()
811 			TRIE_NODE(trie, prefix).child_map = trie_child_map_alloc(trie);  in flow_divert_trie_insert()
812 			if (TRIE_NODE(trie, prefix).child_map == NULL_TRIE_IDX) {  in flow_divert_trie_insert()
819 			TRIE_CHILD(trie, parent, TRIE_BYTE(trie, TRIE_NODE(trie, prefix).start)) = prefix;  in flow_divert_trie_insert()
822 			TRIE_NODE(trie, current).start = node_idx;  in flow_divert_trie_insert()
823 			TRIE_NODE(trie, current).length -= TRIE_NODE(trie, prefix).length;  in flow_divert_trie_insert()
835 			if (TRIE_NODE(trie, current).child_map != NULL_TRIE_IDX) {  in flow_divert_trie_insert()
849 		TRIE_NODE(trie, leaf).start = trie_bytes_move(trie, string_idx, string_remainder);  in flow_divert_trie_insert()
850 		if (TRIE_NODE(trie, leaf).start == NULL_TRIE_IDX) {  in flow_divert_trie_insert()
854 		TRIE_NODE(trie, leaf).length = string_remainder;  in flow_divert_trie_insert()
857 		if (TRIE_NODE(trie, current).child_map == NULL_TRIE_IDX) {  in flow_divert_trie_insert()
858 			TRIE_NODE(trie, current).child_map = trie_child_map_alloc(trie);  in flow_divert_trie_insert()
859 			if (TRIE_NODE(trie, current).child_map == NULL_TRIE_IDX) {  in flow_divert_trie_insert()
864 		TRIE_CHILD(trie, current, TRIE_BYTE(trie, TRIE_NODE(trie, leaf).start)) = leaf;  in flow_divert_trie_insert()
880 		uint16_t node_end = TRIE_NODE(trie, current).start + TRIE_NODE(trie, current).length;  in flow_divert_trie_search()
883 		for (node_idx = TRIE_NODE(trie, current).start;  in flow_divert_trie_search()
895 			} else if (TRIE_NODE(trie, current).child_map != NULL_TRIE_IDX) {  in flow_divert_trie_search()