Lines Matching refs:node_c
92 uint32_t level, struct rte_acl_node **node_c);
515 struct rte_acl_node **node_c) in acl_resolve_leaf() argument
534 *node_c = node_a; in acl_resolve_leaf()
543 *node_c = node_b; in acl_resolve_leaf()
555 *node_c = acl_dup_node(context, node_a); 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()
597 struct rte_acl_node *node_c; in acl_merge_trie() local
602 node_c = node_a; in acl_merge_trie()
622 node_c = acl_dup_node(context, node_a); in acl_merge_trie()
628 node_intersect_type = acl_intersect_type(&node_c->values, in acl_merge_trie()
638 min_add_c = node_c->min_add; in acl_merge_trie()
639 node_c->min_add = node_c->num_ptrs; in acl_merge_trie()
640 ptrs_c = node_c->num_ptrs; in acl_merge_trie()
643 if (node_c->ptrs[n].ptr == NULL) { in acl_merge_trie()
647 node_c->ptrs[n].ptr->next = NULL; in acl_merge_trie()
655 node_c->ptrs[n].ptr == in acl_merge_trie()
660 &node_c->ptrs[n].values, in acl_merge_trie()
667 node_c->ptrs[n].ptr, in acl_merge_trie()
675 node_c->ptrs[n].ptr) { in acl_merge_trie()
684 acl_add_ptr(context, node_c, in acl_merge_trie()
700 &node_c->ptrs[n].values, in acl_merge_trie()
701 &node_c->ptrs[n].values, in acl_merge_trie()
704 node_c, n); in acl_merge_trie()
705 node_c->ptrs[n].ptr = in acl_merge_trie()
715 node_c->min_add = min_add_c; in acl_merge_trie()
716 acl_compact_node_ptrs(node_c); in acl_merge_trie()
728 acl_copy_ptr(context, node_c, in acl_merge_trie()
737 if (node_c != node_a && node_c != node_a_next) { in acl_merge_trie()
744 acl_free_node(context, node_c); in acl_merge_trie()
745 node_c = node_a; in acl_merge_trie()
752 acl_free_node(context, node_c); in acl_merge_trie()
753 node_c = node_b; in acl_merge_trie()
759 *return_c = node_c; in acl_merge_trie()