Lines Matching defs:node
53 is_valid_node(const struct rte_rib6_node *node)
55 return (node->flag & RTE_RIB_VALID_NODE) == RTE_RIB_VALID_NODE;
59 is_right_node(const struct rte_rib6_node *node)
61 return node->parent->right == node;
88 get_nxt_node(struct rte_rib6_node *node,
91 if (node->depth == RTE_IPV6_MAX_DEPTH)
94 return (get_dir(ip, node->depth)) ? node->right : node->left;
309 /* traverse down the tree to find matching node or closest matching */
311 /* insert as the last node in the branch */
319 * Intermediate node found.
321 * but node with proper search criteria is found.
322 * Validate intermediate node and return.
341 /* closest node found, new_node should be inserted in the middle */
369 /* create intermediate node */
396 rte_rib6_get_ip(const struct rte_rib6_node *node,
399 if (unlikely(node == NULL || ip == NULL)) {
403 *ip = node->ip;
408 rte_rib6_get_depth(const struct rte_rib6_node *node, uint8_t *depth)
410 if (unlikely(node == NULL || depth == NULL)) {
414 *depth = node->depth;
419 rte_rib6_get_ext(struct rte_rib6_node *node)
421 return (node == NULL) ? NULL : &node->ext[0];
425 rte_rib6_get_nh(const struct rte_rib6_node *node, uint64_t *nh)
427 if (unlikely(node == NULL || nh == NULL)) {
431 *nh = node->nh;
436 rte_rib6_set_nh(struct rte_rib6_node *node, uint64_t nh)
438 if (unlikely(node == NULL)) {
442 node->nh = nh;