Home
last modified time | relevance | path

Searched refs:new_node (Results 1 – 5 of 5) sorted by relevance

/dpdk/lib/rib/
H A Drte_rib.c255 if (new_node != NULL) { in rte_rib_insert()
261 if (new_node == NULL) { in rte_rib_insert()
265 new_node->left = NULL; in rte_rib_insert()
266 new_node->right = NULL; in rte_rib_insert()
267 new_node->parent = NULL; in rte_rib_insert()
268 new_node->ip = ip; in rte_rib_insert()
269 new_node->depth = depth; in rte_rib_insert()
276 *tmp = new_node; in rte_rib_insert()
311 new_node->left = *tmp; in rte_rib_insert()
314 *tmp = new_node; in rte_rib_insert()
[all …]
H A Drte_rib6.c308 if (new_node != NULL) { in rte_rib6_insert()
314 if (new_node == NULL) { in rte_rib6_insert()
318 new_node->left = NULL; in rte_rib6_insert()
319 new_node->right = NULL; in rte_rib6_insert()
320 new_node->parent = NULL; in rte_rib6_insert()
322 new_node->depth = depth; in rte_rib6_insert()
329 *tmp = new_node; in rte_rib6_insert()
379 new_node->right = *tmp; in rte_rib6_insert()
381 new_node->left = *tmp; in rte_rib6_insert()
384 *tmp = new_node; in rte_rib6_insert()
[all …]
/dpdk/lib/vhost/
H A Diotlb.c167 struct vhost_iotlb_entry *node, *new_node; in vhost_user_iotlb_cache_insert() local
170 ret = rte_mempool_get(vq->iotlb_pool, (void **)&new_node); in vhost_user_iotlb_cache_insert()
188 new_node->iova = iova; in vhost_user_iotlb_cache_insert()
189 new_node->uaddr = uaddr; in vhost_user_iotlb_cache_insert()
190 new_node->size = size; in vhost_user_iotlb_cache_insert()
191 new_node->perm = perm; in vhost_user_iotlb_cache_insert()
200 if (node->iova == new_node->iova) { in vhost_user_iotlb_cache_insert()
201 rte_mempool_put(vq->iotlb_pool, new_node); in vhost_user_iotlb_cache_insert()
203 } else if (node->iova > new_node->iova) { in vhost_user_iotlb_cache_insert()
204 TAILQ_INSERT_BEFORE(node, new_node, next); in vhost_user_iotlb_cache_insert()
[all …]
/dpdk/lib/graph/
H A Dnode.c239 struct node *new_node; in edge_update() local
260 new_node = realloc(node, sz); in edge_update()
261 if (new_node == NULL) { in edge_update()
265 node = new_node; in edge_update()
/dpdk/drivers/net/ice/base/
H A Dice_sched.c885 struct ice_sched_node *prev, *new_node; in ice_sched_add_elems() local
937 new_node = ice_sched_find_node_by_teid(parent, teid); in ice_sched_add_elems()
938 if (!new_node) { in ice_sched_add_elems()
943 new_node->sibling = NULL; in ice_sched_add_elems()
944 new_node->tc_num = tc_node->tc_num; in ice_sched_add_elems()
949 if (prev && prev != new_node) { in ice_sched_add_elems()
952 prev->sibling = new_node; in ice_sched_add_elems()
957 pi->sib_head[tc_node->tc_num][layer] = new_node; in ice_sched_add_elems()