120 #define TRIE_NODE(t, i)                 ((t)->nodes[(i)])  macro
121 #define TRIE_CHILD(t, i, b)             (((t)->child_maps + (CHILD_MAP_SIZE * TRIE_NODE(t, i).child…
753 		TRIE_NODE(trie, node_idx).child_map = NULL_TRIE_IDX;  in trie_node_alloc()
802 		current_end = TRIE_NODE(trie, current).start + TRIE_NODE(trie, current).length;  in flow_divert_trie_insert()
804 		for (node_idx = TRIE_NODE(trie, current).start;  in flow_divert_trie_insert()
814 		if (node_idx < (TRIE_NODE(trie, current).start + TRIE_NODE(trie, current).length)) {  in flow_divert_trie_insert()
833 			TRIE_NODE(trie, prefix).start = TRIE_NODE(trie, current).start;  in flow_divert_trie_insert()
834 			TRIE_NODE(trie, prefix).length = (node_idx - TRIE_NODE(trie, current).start);  in flow_divert_trie_insert()
840 			TRIE_NODE(trie, prefix).child_map = trie_child_map_alloc(trie);  in flow_divert_trie_insert()
841 			if (TRIE_NODE(trie, prefix).child_map == NULL_TRIE_IDX) {  in flow_divert_trie_insert()
848 			TRIE_CHILD(trie, parent, TRIE_BYTE(trie, TRIE_NODE(trie, prefix).start)) = prefix;  in flow_divert_trie_insert()
851 			TRIE_NODE(trie, current).start = node_idx;  in flow_divert_trie_insert()
852 			TRIE_NODE(trie, current).length -= TRIE_NODE(trie, prefix).length;  in flow_divert_trie_insert()
864 			if (TRIE_NODE(trie, current).child_map != NULL_TRIE_IDX) {  in flow_divert_trie_insert()
878 		TRIE_NODE(trie, leaf).start = trie_bytes_move(trie, string_idx, string_remainder);  in flow_divert_trie_insert()
879 		if (TRIE_NODE(trie, leaf).start == NULL_TRIE_IDX) {  in flow_divert_trie_insert()
883 		TRIE_NODE(trie, leaf).length = string_remainder;  in flow_divert_trie_insert()
886 		if (TRIE_NODE(trie, current).child_map == NULL_TRIE_IDX) {  in flow_divert_trie_insert()
887 			TRIE_NODE(trie, current).child_map = trie_child_map_alloc(trie);  in flow_divert_trie_insert()
888 			if (TRIE_NODE(trie, current).child_map == NULL_TRIE_IDX) {  in flow_divert_trie_insert()
893 		TRIE_CHILD(trie, current, TRIE_BYTE(trie, TRIE_NODE(trie, leaf).start)) = leaf;  in flow_divert_trie_insert()
909 		uint16_t node_end = TRIE_NODE(trie, current).start + TRIE_NODE(trie, current).length;  in flow_divert_trie_search()
912 		for (node_idx = TRIE_NODE(trie, current).start;  in flow_divert_trie_search()
924 			} else if (TRIE_NODE(trie, current).child_map != NULL_TRIE_IDX) {  in flow_divert_trie_search()