91 	struct rte_acl_node *node_a, struct rte_acl_node *node_b,
514 	struct rte_acl_node *node_b,  in acl_resolve_leaf()  argument
521 		if (node_a->mrt->priority[n] != node_b->mrt->priority[n]) {  in acl_resolve_leaf()
523 				node_b->mrt->priority[n]) ?  in acl_resolve_leaf()
543 		*node_c = node_b;  in acl_resolve_leaf()
557 		if ((*node_c)->mrt->priority[n] < node_b->mrt->priority[n]) {  in acl_resolve_leaf()
558 			(*node_c)->mrt->priority[n] = node_b->mrt->priority[n];  in acl_resolve_leaf()
559 			(*node_c)->mrt->results[n] = node_b->mrt->results[n];  in acl_resolve_leaf()
590 	struct rte_acl_node *node_a, struct rte_acl_node *node_b,  in acl_merge_trie()  argument
612 		acl_resolve_leaf(context, node_a, node_b, return_c);  in acl_merge_trie()
629 		&node_b->values,  in acl_merge_trie()
634 		min_add_b = node_b->min_add;  in acl_merge_trie()
635 		node_b->min_add = node_b->num_ptrs;  in acl_merge_trie()
636 		ptrs_b = node_b->num_ptrs;  in acl_merge_trie()
654 				if (node_b->ptrs[m].ptr == NULL ||  in acl_merge_trie()
656 						node_b->ptrs[m].ptr)  in acl_merge_trie()
661 					&node_b->ptrs[m].values,  in acl_merge_trie()
668 							node_b->ptrs[m].ptr,  in acl_merge_trie()
693 							node_b->ptrs[m].ptr);  in acl_merge_trie()
717 		node_b->min_add = min_add_b;  in acl_merge_trie()
718 		acl_compact_node_ptrs(node_b);  in acl_merge_trie()
726 		for (m = 0; m < node_b->num_ptrs; m++)  in acl_merge_trie()
727 			if (node_b->ptrs[m].ptr != NULL)  in acl_merge_trie()
729 					node_b, m, &node_intersect);  in acl_merge_trie()
753 				node_c = node_b;  in acl_merge_trie()
762 		acl_free_node(context, node_b);  in acl_merge_trie()