Home
last modified time | relevance | path

Searched refs:prev (Results 1 – 25 of 67) sorted by relevance

123

/dpdk/drivers/common/dpaax/
H A Ddpaa_list.h15 struct list_head *prev; member
21 .prev = &n, \
29 __p298->prev = __p298->next; \
36 ((__p298->next == __p298) && (__p298->prev == __p298)); \
45 __p298->prev = __l298; \
46 __l298->next->prev = __p298; \
53 __p298->prev = __l298->prev; \
55 __l298->prev->next = __p298; \
56 __l298->prev = __p298; \
73 (i)->next->prev = (i)->prev; \
[all …]
/dpdk/drivers/bus/dpaa/include/
H A Ddpaa_rbtree.h33 struct rb_node *prev, *next; member
55 obj->node_field.prev = obj->node_field.next = NULL; \
66 node->prev->next = &obj->node_field; \
67 obj->node_field.prev = node->prev; \
69 node->prev = &obj->node_field; \
74 obj->node_field.prev = tree->tail; \
89 tree->head->prev = NULL; \
94 tree->tail = tree->tail->prev; \
98 obj->node_field.prev->next = obj->node_field.next; \
99 obj->node_field.next->prev = obj->node_field.prev; \
/dpdk/drivers/net/bnxt/tf_core/
H A Dll.c27 entry->prev = NULL; in ll_insert()
30 entry->prev = NULL; in ll_insert()
31 entry->next->prev = entry; in ll_insert()
32 ll->head = entry->next->prev; in ll_insert()
46 ll->head->prev = NULL; in ll_delete()
48 ll->tail = entry->prev; in ll_delete()
51 entry->prev->next = entry->next; in ll_delete()
52 entry->next->prev = entry->prev; in ll_delete()
H A Dtf_sram_mgr.c30 struct tf_sram_block *prev; member
432 slice_list->head->prev = NULL; in tf_sram_free_block()
434 slice_list->tail = block->prev; in tf_sram_free_block()
437 block->prev->next = block->next; in tf_sram_free_block()
438 block->next->prev = block->prev; in tf_sram_free_block()
491 block->prev = NULL; in tf_sram_alloc_block()
494 block->prev = NULL; in tf_sram_alloc_block()
495 block->next->prev = block; in tf_sram_alloc_block()
496 slice_list->head = block->next->prev; in tf_sram_alloc_block()
/dpdk/lib/eal/common/
H A Dmalloc_elem.c130 elem->prev = NULL; in malloc_elem_init()
323 prev = elem->prev; in remove_elem()
326 next->prev = prev; in remove_elem()
329 if (prev) in remove_elem()
330 prev->next = next; in remove_elem()
334 elem->prev = NULL; in remove_elem()
356 return elem == RTE_PTR_ADD(elem->prev, elem->prev->size) && in prev_elem_is_adjacent()
500 next->prev = elem1; in join_elem()
539 if (elem->prev != NULL && elem->prev->state == ELEM_FREE && in malloc_elem_join_adjacent_free()
617 prev = elem->prev; in malloc_elem_hide_region()
[all …]
H A Deal_common_lcore.c347 struct lcore_callback *prev; in eal_lcore_non_eal_allocate() local
368 prev = TAILQ_PREV(callback, lcore_callbacks_head, next); in eal_lcore_non_eal_allocate()
369 while (prev != NULL) { in eal_lcore_non_eal_allocate()
370 callback_uninit(prev, lcore_id); in eal_lcore_non_eal_allocate()
371 prev = TAILQ_PREV(prev, lcore_callbacks_head, next); in eal_lcore_non_eal_allocate()
/dpdk/lib/timer/
H A Drte_timer.c356 prev[lvl] = prev[lvl+1]; in timer_get_prev_entries()
359 prev[lvl] = prev[lvl]->sl_next[lvl]; in timer_get_prev_entries()
369 struct rte_timer **prev, in timer_get_prev_entries_for_node() argument
380 prev[i]->sl_next[i] != tim && in timer_get_prev_entries_for_node()
382 prev[i] = prev[i]->sl_next[i]; in timer_get_prev_entries_for_node()
411 prev[lvl]->sl_next[lvl] = tim; in timer_add()
415 prev[0]->sl_next[0] = tim; in timer_add()
703 prev[i]->sl_next[i]; in __rte_timer_manage()
706 prev[i] ->sl_next[i] = NULL; in __rte_timer_manage()
862 prev[j]->sl_next[j]; in rte_timer_alt_manage()
[all …]
/dpdk/lib/rib/
H A Drte_rib.c100 struct rte_rib_node *cur, *prev = NULL; in rte_rib_lookup() local
110 prev = cur; in rte_rib_lookup()
113 return prev; in rte_rib_lookup()
195 prev = tmp; in rte_rib_get_nxt()
197 return prev; in rte_rib_get_nxt()
201 return prev; in rte_rib_get_nxt()
230 prev = cur; in rte_rib_remove()
232 node_free(rib, prev); in rte_rib_remove()
240 struct rte_rib_node *prev = NULL; in rte_rib_insert() local
277 new_node->parent = prev; in rte_rib_insert()
[all …]
H A Drte_rib6.c135 struct rte_rib6_node *prev = NULL; in rte_rib6_lookup() local
145 prev = cur; in rte_rib6_lookup()
148 return prev; in rte_rib6_lookup()
241 prev = tmp; in rte_rib6_get_nxt()
243 return prev; in rte_rib6_get_nxt()
247 return prev; in rte_rib6_get_nxt()
277 prev = cur; in rte_rib6_remove()
279 node_free(rib, prev); in rte_rib6_remove()
288 struct rte_rib6_node *prev = NULL; in rte_rib6_insert() local
330 new_node->parent = prev; in rte_rib6_insert()
[all …]
/dpdk/lib/eal/include/generic/
H A Drte_mcslock.h49 rte_mcslock_t *prev; in rte_mcslock_lock() local
61 prev = __atomic_exchange_n(msl, me, __ATOMIC_ACQ_REL); in rte_mcslock_lock()
62 if (likely(prev == NULL)) { in rte_mcslock_lock()
75 __atomic_store_n(&prev->next, me, __ATOMIC_RELEASE); in rte_mcslock_lock()
/dpdk/lib/acl/
H A Dacl_bld.c787 prev = root; in acl_gen_full_range()
791 prev = node; in acl_gen_full_range()
873 prev = root; in acl_gen_range_trie()
879 prev = node; in acl_gen_range_trie()
928 prev = root; in acl_gen_mask_trie()
934 prev = node; in acl_gen_mask_trie()
937 *pend = prev; in acl_gen_mask_trie()
952 prev = head; in build_trie()
954 *last = prev; in build_trie()
1057 *last = prev; in build_trie()
[all …]
/dpdk/lib/eal/x86/include/
H A Drte_atomic_64.h125 int64_t prev = inc; in rte_atomic64_add_return() local
130 : [prev] "+r" (prev), /* output */ in rte_atomic64_add_return()
134 return prev + inc; in rte_atomic64_add_return()
/dpdk/drivers/net/mlx5/
H A Dmlx5_utils.h226 uint32_t prev; /* Previous free trunk in free list. */ member
591 type prev; /* Index of previous element. */ \
600 (elem)->field.prev = 0; \
604 (peer)->field.prev = (idx); \
614 if ((elem)->field.prev) { \
616 (pool, (elem)->field.prev); \
624 (peer)->field.prev = (elem)->field.prev;\
/dpdk/drivers/net/nfp/nfpcore/
H A Dnfp_mutex.c35 struct nfp_cpp_mutex *prev, *next; member
167 cpp->mutex_cache->prev = mutex; in nfp_cpp_mutex_alloc()
239 mutex->next->prev = mutex->prev; in nfp_cpp_mutex_free()
240 if (mutex->prev) in nfp_cpp_mutex_free()
241 mutex->prev->next = mutex->next; in nfp_cpp_mutex_free()
/dpdk/lib/graph/
H A Dnode.c235 edge_update(struct node *node, struct node *prev, rte_edge_t from, in edge_update() argument
277 if (prev) in edge_update()
278 STAILQ_INSERT_AFTER(&node_list, prev, node, next); in edge_update()
320 struct node *n, *prev; in rte_node_edge_update() local
325 prev = NULL; in rte_node_edge_update()
328 rc = edge_update(n, prev, from, next_nodes, nb_edges); in rte_node_edge_update()
331 prev = n; in rte_node_edge_update()
/dpdk/drivers/net/mlx5/windows/
H A Dmlx5_flow_os.c285 struct mlx5_workspace_thread *next, *prev = NULL; in mlx5_clear_thread_list() local
304 curr = prev; in mlx5_clear_thread_list()
309 if (prev) in mlx5_clear_thread_list()
310 prev->next = next; in mlx5_clear_thread_list()
314 prev = temp; in mlx5_clear_thread_list()
/dpdk/drivers/net/qede/base/
H A Dbcm_osal.h194 struct _osal_list_entry_t *next, *prev; member
211 (entry)->prev = (osal_list_entry_t *)0; \
216 (list)->head->prev = (entry); \
225 (entry)->prev = (list)->tail; \
244 (list)->head->prev = (osal_list_entry_t *)0;\
252 (list)->tail = (list)->tail->prev; \
261 (entry)->prev->next = (entry)->next; \
262 (entry)->next->prev = (entry)->prev; \
/dpdk/drivers/net/tap/
H A Dtap_netlink.c32 struct nested_tail *prev; member
384 tail->prev = msg->nested_tails; in tap_nlattr_nested_start()
407 if (tail->prev) in tap_nlattr_nested_finish()
408 msg->nested_tails = tail->prev; in tap_nlattr_nested_finish()
/dpdk/lib/mbuf/
H A Drte_mbuf.c514 struct rte_mbuf *mc, *mi, **prev; in rte_pktmbuf_clone() local
523 prev = &mi->next; in rte_pktmbuf_clone()
530 *prev = mi; in rte_pktmbuf_clone()
531 prev = &mi->next; in rte_pktmbuf_clone()
535 *prev = NULL; in rte_pktmbuf_clone()
592 struct rte_mbuf *mc, *m_last, **prev; in rte_pktmbuf_copy() local
614 prev = &mc->next; in rte_pktmbuf_copy()
633 *prev = m_last; in rte_pktmbuf_copy()
634 prev = &m_last->next; in rte_pktmbuf_copy()
/dpdk/lib/ip_frag/
H A Drte_ipv4_reassembly.c18 struct rte_mbuf *m, *prev; in ipv4_frag_reassemble() local
32 prev = m; in ipv4_frag_reassemble()
57 if (m == prev) { in ipv4_frag_reassemble()
H A Drte_ipv6_reassembly.c37 struct rte_mbuf *m, *prev; in ipv6_frag_reassemble() local
55 prev = m; in ipv6_frag_reassemble()
80 if (m == prev) { in ipv6_frag_reassemble()
/dpdk/examples/vhost/
H A Dvirtio_net.c252 struct rte_mbuf *cur = m, *prev = m; in dequeue_pkt() local
349 prev->next = cur; in dequeue_pkt()
350 prev->data_len = mbuf_offset; in dequeue_pkt()
353 prev = cur; in dequeue_pkt()
360 prev->data_len = mbuf_offset; in dequeue_pkt()
/dpdk/drivers/net/virtio/
H A Dvirtio_rxtx.c1265 prev = rxm; in virtio_recv_pkts_inorder()
1290 prev->next = rxm; in virtio_recv_pkts_inorder()
1291 prev = rxm; in virtio_recv_pkts_inorder()
1319 prev = rxm; in virtio_recv_pkts_inorder()
1444 prev = rxm; in virtio_recv_mergeable_pkts()
1469 prev->next = rxm; in virtio_recv_mergeable_pkts()
1470 prev = rxm; in virtio_recv_mergeable_pkts()
1498 prev = rxm; in virtio_recv_mergeable_pkts()
1616 prev = rxm; in virtio_recv_mergeable_pkts_packed()
1642 prev = rxm; in virtio_recv_mergeable_pkts_packed()
[all …]
/dpdk/drivers/net/bnx2x/
H A Decore_sp.h226 struct _ecore_list_entry_t *next, *prev; member
262 (_elem)->prev = (ecore_list_entry_t *)0; \
267 (_list)->head->prev = (_elem); \
277 (_elem)->prev = (_list)->tail; \
292 (_list2)->head->prev = (_list1)->tail; \
310 (_list)->head->prev = (ecore_list_entry_t *)0; \
318 (_list)->tail = (_list)->tail->prev; \
327 (_elem)->prev->next = (_elem)->next; \
328 (_elem)->next->prev = (_elem)->prev; \
/dpdk/lib/eal/linux/
H A Deal_memory.c863 struct hugepage_file *prev, *cur; local
867 prev = cur_page == 0 ? NULL :
886 else if ((prev->physaddr - cur->physaddr) !=
890 else if ((cur->physaddr - prev->physaddr) !=
989 struct hugepage_file *prev, *cur; local
994 prev = cur_page == 0 ? NULL : &hugepages[cur_page - 1];
1002 else if (cur->socket_id != prev->socket_id)
1004 else if (cur->size != prev->size)
1011 else if ((prev->physaddr - cur->physaddr) != cur->size)
1014 else if ((cur->physaddr - prev->physaddr) != cur->size)

123