Home
last modified time | relevance | path

Searched refs:next (Results 1 – 25 of 610) sorted by relevance

12345678910>>...25

/dpdk/drivers/common/dpaax/
H A Ddpaa_list.h16 struct list_head *next; member
22 .next = &n \
28 __p298->next = __p298; \
29 __p298->prev = __p298->next; \
44 __p298->next = __l298->next; \
47 __l298->next = __p298; \
54 __p298->next = __l298; \
59 for (i = (l)->next; i != (l); i = i->next)
61 for (i = (l)->next, j = i->next; i != (l); \
62 i = j, j = i->next)
[all …]
/dpdk/drivers/event/sw/
H A Diq_chunk.h16 struct sw_queue_chunk *next; member
36 chunk->next = NULL; in iq_alloc_chunk()
52 next = head->next; in iq_free_chunk_list()
54 head = next; in iq_free_chunk_list()
80 iq->tail->next = chunk; in iq_enqueue()
93 struct sw_queue_chunk *next = iq->head->next; in iq_pop() local
95 iq->head = next; in iq_pop()
133 next = current->next; in iq_dequeue_burst()
135 current = next; in iq_dequeue_burst()
141 struct sw_queue_chunk *next = current->next; in iq_dequeue_burst() local
[all …]
/dpdk/lib/eal/common/
H A Dmalloc_elem.c131 elem->next = NULL; in malloc_elem_init()
322 next = elem->next; in remove_elem()
325 if (next) in remove_elem()
330 prev->next = next; in remove_elem()
335 elem->next = NULL; in remove_elem()
497 struct malloc_elem *next = elem2->next; in join_elem() local
499 if (next) in join_elem()
503 elem1->next = next; in join_elem()
518 if (elem->next != NULL && elem->next->state == ELEM_FREE && in malloc_elem_join_adjacent_free()
618 next = elem->next; in malloc_elem_hide_region()
[all …]
/dpdk/drivers/net/softnic/
H A Dparser.c82 char *next; in softnic_parser_read_int32() local
90 if (p == next) in softnic_parser_read_int32()
100 char *next; in softnic_parser_read_uint64() local
108 if (p == next) in softnic_parser_read_uint64()
111 p = next; in softnic_parser_read_uint64()
140 char *next; in softnic_parser_read_uint64_hex() local
326 char *next; in softnic_parse_mpls_labels() local
459 next++; in softnic_parse_cpu_core()
466 next++; in softnic_parse_cpu_core()
473 next++; in softnic_parse_cpu_core()
[all …]
/dpdk/examples/ip_pipeline/
H A Dparser.c83 char *next; in parser_read_uint64() local
91 if (p == next) in parser_read_uint64()
94 p = next; in parser_read_uint64()
123 char *next; in parser_read_uint64_hex() local
129 if (p == next) in parser_read_uint64_hex()
309 char *next; in parse_mpls_labels() local
435 type = *next; in parse_cpu_core()
442 next++; in parse_cpu_core()
449 next++; in parse_cpu_core()
456 next++; in parse_cpu_core()
[all …]
/dpdk/app/test-pmd/
H A Dcmdline_flow.c7290 ctx->next[ctx->next_num++] = next; in parse_vc_action_rss_type()
7341 ctx->next[ctx->next_num++] = next; in parse_vc_action_rss_queue()
10224 if (!token->next) in cmd_flow_parse()
10226 ctx->next[ctx->next_num++] = token->next[0]; in cmd_flow_parse()
10236 if (next->call) in cmd_flow_parse()
10237 tmp = next->call(ctx, next, src, len, result, size); in cmd_flow_parse()
10242 token = next; in cmd_flow_parse()
10249 if (token->next) in cmd_flow_parse()
10253 ctx->next[ctx->next_num++] = token->next[i]; in cmd_flow_parse()
11039 uint8_t next; in cmd_set_raw_parsed() member
[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; \
68 obj->node_field.next = node; \
72 node = node->next; \
75 obj->node_field.next = NULL; \
76 tree->tail->next = &obj->node_field; \
88 tree->head = tree->head->next; \
95 tree->tail->next = NULL; \
98 obj->node_field.prev->next = obj->node_field.next; \
[all …]
/dpdk/lib/eal/include/generic/
H A Drte_mcslock.h31 struct rte_mcslock *next; member
53 __atomic_store_n(&me->next, NULL, __ATOMIC_RELAXED); in rte_mcslock_lock()
75 __atomic_store_n(&prev->next, me, __ATOMIC_RELEASE); in rte_mcslock_lock()
102 if (likely(__atomic_load_n(&me->next, __ATOMIC_RELAXED) == NULL)) { in rte_mcslock_unlock()
119 uintptr_t *next; in rte_mcslock_unlock() local
120 next = (uintptr_t *)&me->next; in rte_mcslock_unlock()
121 RTE_WAIT_UNTIL_MASKED(next, UINTPTR_MAX, !=, 0, in rte_mcslock_unlock()
126 __atomic_store_n(&me->next->locked, 0, __ATOMIC_RELEASE); in rte_mcslock_unlock()
143 __atomic_store_n(&me->next, NULL, __ATOMIC_RELAXED); in rte_mcslock_trylock()
/dpdk/lib/graph/
H A Dgraph.c94 const char *next; in graph_node_edges_add() local
99 next = graph_node->node->next_nodes[i]; in graph_node_edges_add()
100 adjacency = node_from_name(next); in graph_node_edges_add()
103 "Node %s not registered", next); in graph_node_edges_add()
118 const char *next; in graph_adjacency_list_update() local
123 next = graph_node->node->next_nodes[i]; in graph_adjacency_list_update()
124 adjacency = node_from_name(next); in graph_adjacency_list_update()
127 "Node %s not registered", next); in graph_adjacency_list_update()
148 STAILQ_FOREACH(node, node_head, next) { in expand_pattern_to_node()
278 STAILQ_FOREACH(graph, &graph_list, next) in rte_graph_create()
[all …]
H A Drte_graph_worker.h246 RTE_ASSERT(next < node->nb_edges); in __rte_node_next_node_get()
248 node = node->nodes[next]; in __rte_node_next_node_get()
274 node = __rte_node_next_node_get(node, next); in rte_node_enqueue()
299 rte_edge_t next, void *obj) in rte_node_enqueue_x1() argument
301 node = __rte_node_next_node_get(node, next); in rte_node_enqueue_x1()
331 node = __rte_node_next_node_get(node, next); in rte_node_enqueue_x2()
367 node = __rte_node_next_node_get(node, next); in rte_node_enqueue_x4()
428 rte_edge_t next, uint16_t nb_objs) in rte_node_next_stream_get() argument
430 node = __rte_node_next_node_get(node, next); in rte_node_next_stream_get()
459 rte_edge_t next, uint16_t idx) in rte_node_next_stream_put() argument
[all …]
H A Dnode.c33 STAILQ_FOREACH(node, &node_list, next) in node_from_name()
46 STAILQ_FOREACH(node, &node_list, next) { in node_has_duplicate_entry()
105 STAILQ_INSERT_TAIL(&node_list, node, next); in __rte_node_register()
187 STAILQ_FOREACH(node, &node_list, next) in rte_node_clone()
200 STAILQ_FOREACH(node, &node_list, next) in rte_node_from_name()
213 STAILQ_FOREACH(node, &node_list, next) in rte_node_id_to_name()
227 STAILQ_FOREACH(node, &node_list, next) in rte_node_edge_count()
298 STAILQ_FOREACH(node, &node_list, next) { in rte_node_edge_shrink()
326 STAILQ_FOREACH(n, &node_list, next) { in rte_node_edge_update()
359 STAILQ_FOREACH(node, &node_list, next) { in rte_node_edge_get()
[all …]
/dpdk/drivers/net/bnxt/tf_core/
H A Dll.c26 entry->next = NULL; in ll_insert()
29 entry->next = ll->head; in ll_insert()
31 entry->next->prev = entry; in ll_insert()
32 ll->head = entry->next->prev; in ll_insert()
45 ll->head = entry->next; in ll_delete()
49 ll->tail->next = NULL; in ll_delete()
51 entry->prev->next = entry->next; in ll_delete()
52 entry->next->prev = entry->prev; in ll_delete()
/dpdk/lib/eal/freebsd/
H A Deal_interrupts.c34 TAILQ_ENTRY(rte_intr_callback) next;
42 TAILQ_ENTRY(rte_intr_source) next;
105 TAILQ_FOREACH(src, &intr_sources, next) { in rte_intr_callback_register()
221 struct rte_intr_callback *cb, *next; in rte_intr_callback_unregister_pending() local
238 TAILQ_FOREACH(src, &intr_sources, next) in rte_intr_callback_unregister_pending()
255 next = TAILQ_NEXT(cb, next); in rte_intr_callback_unregister_pending()
276 struct rte_intr_callback *cb, *next; in rte_intr_callback_unregister() local
292 TAILQ_FOREACH(src, &intr_sources, next) in rte_intr_callback_unregister()
334 next = TAILQ_NEXT(cb, next); in rte_intr_callback_unregister()
464 struct rte_intr_callback *cb, *next; in eal_intr_process_interrupts() local
[all …]
H A Deal_alarm.c34 LIST_ENTRY(alarm_entry) next;
189 LIST_REMOVE(ap, next); in eal_alarm_callback()
231 LIST_INSERT_HEAD(&alarm_list, new_alarm, next); in rte_eal_alarm_set()
233 LIST_FOREACH(ap, &alarm_list, next) { in rte_eal_alarm_set()
235 LIST_INSERT_BEFORE(ap, new_alarm, next); in rte_eal_alarm_set()
238 if (LIST_NEXT(ap, next) == NULL) { in rte_eal_alarm_set()
239 LIST_INSERT_AFTER(ap, new_alarm, next); in rte_eal_alarm_set()
280 LIST_REMOVE(ap, next); in rte_eal_alarm_cancel()
301 LIST_FOREACH(ap, &alarm_list, next) { in rte_eal_alarm_cancel()
307 LIST_REMOVE(ap, next); in rte_eal_alarm_cancel()
/dpdk/lib/vhost/
H A Diotlb.c15 TAILQ_ENTRY(vhost_iotlb_entry) next;
36 TAILQ_REMOVE(&vq->iotlb_pending_list, node, next); in vhost_user_iotlb_pending_remove_all()
52 TAILQ_FOREACH(node, &vq->iotlb_pending_list, next) { in vhost_user_iotlb_pending_miss()
115 TAILQ_REMOVE(&vq->iotlb_pending_list, node, next); in vhost_user_iotlb_pending_remove()
130 TAILQ_REMOVE(&vq->iotlb_list, node, next); in vhost_user_iotlb_cache_remove_all()
151 TAILQ_REMOVE(&vq->iotlb_list, node, next); in vhost_user_iotlb_cache_random_evict()
195 TAILQ_FOREACH(node, &vq->iotlb_list, next) { in vhost_user_iotlb_cache_insert()
204 TAILQ_INSERT_BEFORE(node, new_node, next); in vhost_user_iotlb_cache_insert()
210 TAILQ_INSERT_TAIL(&vq->iotlb_list, new_node, next); in vhost_user_iotlb_cache_insert()
237 TAILQ_REMOVE(&vq->iotlb_list, node, next); in vhost_user_iotlb_cache_remove()
[all …]
/dpdk/examples/qos_sched/
H A Dcfg_file.c49 char *next; in cfg_load_pipe() local
138 entry = next; in cfg_load_pipe()
295 char *next; in cfg_load_subport() local
302 entry = next; in cfg_load_subport()
310 char *next; in cfg_load_subport() local
317 entry = next; in cfg_load_subport()
325 char *next; in cfg_load_subport() local
333 entry = next; in cfg_load_subport()
341 char *next; in cfg_load_subport() local
348 entry = next; in cfg_load_subport()
[all …]
/dpdk/drivers/net/mlx5/windows/
H A Dmlx5_flow_os.c247 struct mlx5_workspace_thread *next; member
285 struct mlx5_workspace_thread *next, *prev = NULL; in mlx5_clear_thread_list() local
296 next = temp->next; in mlx5_clear_thread_list()
301 curr = temp->next; in mlx5_clear_thread_list()
302 first = temp->next; in mlx5_clear_thread_list()
310 prev->next = next; in mlx5_clear_thread_list()
311 temp = next; in mlx5_clear_thread_list()
315 temp = temp->next; in mlx5_clear_thread_list()
328 MLX5_ASSERT(!first->next); in mlx5_flow_os_release_workspace()
361 curr->next = temp; in mlx5_add_workspace_to_list()
[all …]
/dpdk/drivers/crypto/ipsec_mb/
H A Dipsec_mb_private.h199 const struct rte_crypto_sym_xform *next = xform->next; in ipsec_mb_parse_xform() local
202 if (next == NULL) { in ipsec_mb_parse_xform()
215 if (next->type != RTE_CRYPTO_SYM_XFORM_AUTH) { in ipsec_mb_parse_xform()
221 if (next->auth.op != RTE_CRYPTO_AUTH_OP_GENERATE) { in ipsec_mb_parse_xform()
228 *auth_xform = xform->next; in ipsec_mb_parse_xform()
231 if (next->auth.op != RTE_CRYPTO_AUTH_OP_VERIFY) { in ipsec_mb_parse_xform()
238 *auth_xform = xform->next; in ipsec_mb_parse_xform()
243 if (next == NULL) { in ipsec_mb_parse_xform()
256 if (next->type != RTE_CRYPTO_SYM_XFORM_CIPHER) { in ipsec_mb_parse_xform()
269 *cipher_xform = xform->next; in ipsec_mb_parse_xform()
[all …]
/dpdk/drivers/net/bnxt/
H A Dbnxt_filter.c58 STAILQ_INSERT_TAIL(&bp->pf->vf_info[vf].filter, filter, next); in bnxt_alloc_vf_filter()
74 STAILQ_INSERT_TAIL(&bp->free_filter_list, filter, next); in bnxt_init_filters()
85 STAILQ_FOREACH(filter, &bp->pf->vf_info[i].filter, next) { in bnxt_free_all_filters()
97 temp_filter = STAILQ_NEXT(filter, next); in bnxt_free_all_filters()
99 bnxt_filter_info, next); in bnxt_free_all_filters()
101 filter, next); in bnxt_free_all_filters()
154 STAILQ_FOREACH(filter, &bp->pf->vf_info[i].filter, next) { in bnxt_free_filter_mem()
157 bnxt_filter_info, next); in bnxt_free_filter_mem()
192 STAILQ_REMOVE_HEAD(&bp->free_filter_list, next); in bnxt_get_unused_filter()
204 STAILQ_INSERT_TAIL(&bp->free_filter_list, filter, next); in bnxt_free_filter()
/dpdk/app/test-eventdev/
H A Dparser.c81 char *next; in parser_read_uint64() local
88 val = strtoul(p, &next, 10); in parser_read_uint64()
89 if (p == next) in parser_read_uint64()
92 p = next; in parser_read_uint64()
121 char *next; in parser_read_int32() local
128 val = strtol(p, &next, 10); in parser_read_int32()
129 if (p == next) in parser_read_int32()
139 char *next; in parser_read_uint64_hex() local
144 val = strtoul(p, &next, 16); in parser_read_uint64_hex()
145 if (p == next) in parser_read_uint64_hex()
[all …]
/dpdk/drivers/bus/vdev/
H A Dvdev.c46 TAILQ_ENTRY(vdev_custom_scan) next;
66 TAILQ_REMOVE(&vdev_driver_list, driver, next); in rte_vdev_unregister()
123 TAILQ_FOREACH(driver, &vdev_driver_list, next) { in vdev_parse()
227 TAILQ_FOREACH(dev, &vdev_device_list, next) { in find_vdev()
330 TAILQ_REMOVE(&vdev_device_list, dev, next); in rte_vdev_init()
376 TAILQ_REMOVE(&vdev_device_list, dev, next); in rte_vdev_uninit()
427 TAILQ_FOREACH(dev, &vdev_device_list, next) { in vdev_action()
553 TAILQ_FOREACH(dev, &vdev_device_list, next) { in vdev_probe()
582 dev = TAILQ_NEXT(vstart, next); in rte_vdev_find_device()
589 dev = TAILQ_NEXT(dev, next); in rte_vdev_find_device()
[all …]
/dpdk/app/test/
H A Dtest_cryptodev_security_ipsec_test_vectors.h112 .next = NULL,
211 .next = NULL,
313 .next = NULL,
419 .next = NULL,
429 .next = NULL,
520 .next = NULL,
622 .next = NULL,
632 .next = NULL,
727 .next = NULL,
737 .next = NULL,
[all …]
/dpdk/drivers/bus/fslmc/
H A Dfslmc_bus.c49 TAILQ_REMOVE(&rte_fslmc_bus.device_list, dev, next); in cleanup_fslmc_device_list()
89 TAILQ_INSERT_BEFORE(dev, newdev, next); in insert_in_device_list()
123 TAILQ_FOREACH(dev, &rte_fslmc_bus.device_list, next) { in dump_device_list()
454 TAILQ_FOREACH(dev, &rte_fslmc_bus.device_list, next) { in rte_fslmc_probe()
455 TAILQ_FOREACH(drv, &rte_fslmc_bus.driver_list, next) { in rte_fslmc_probe()
510 dev = TAILQ_NEXT(dstart, next); in rte_fslmc_find_device()
520 dev = TAILQ_NEXT(dev, next); in rte_fslmc_find_device()
551 TAILQ_REMOVE(&fslmc_bus->driver_list, driver, next); in rte_fslmc_driver_unregister()
566 TAILQ_FOREACH(dev, &rte_fslmc_bus.device_list, next) { in fslmc_all_device_support_iova()
648 dev = TAILQ_NEXT(dstart, next); in fslmc_bus_dev_iterate()
[all …]
/dpdk/lib/eal/linux/
H A Deal_alarm.c39 LIST_ENTRY(alarm_entry) next;
107 LIST_REMOVE(ap, next); in eal_alarm_callback()
160 LIST_INSERT_HEAD(&alarm_list, new_alarm, next); in rte_eal_alarm_set()
162 LIST_FOREACH(ap, &alarm_list, next) { in rte_eal_alarm_set()
166 LIST_INSERT_BEFORE(ap, new_alarm, next); in rte_eal_alarm_set()
169 if (LIST_NEXT(ap, next) == NULL) { in rte_eal_alarm_set()
170 LIST_INSERT_AFTER(ap, new_alarm, next); in rte_eal_alarm_set()
214 LIST_REMOVE(ap, next); in rte_eal_alarm_cancel()
232 LIST_FOREACH(ap, &alarm_list, next) { in rte_eal_alarm_cancel()
238 LIST_REMOVE(ap, next); in rte_eal_alarm_cancel()
/dpdk/lib/acl/
H A Dacl_bld.c420 next->mrt = acl_build_alloc(context, 1, sizeof(*next->mrt)); in acl_dup_node()
421 memcpy(next->mrt, node->mrt, sizeof(*next->mrt)); in acl_dup_node()
427 node->next = next; in acl_dup_node()
428 next->prev = node; in acl_dup_node()
430 return next; in acl_dup_node()
553 node_a->next = NULL; in acl_resolve_leaf()
1062 rule = rule->next; in build_trie()
1231 slow->next = NULL; in rule_list_split()
1256 a = a->next; in rule_list_sorted_merge()
1260 b = b->next; in rule_list_sorted_merge()
[all …]

12345678910>>...25