Home
last modified time | relevance | path

Searched refs:STAILQ_FOREACH (Results 1 – 21 of 21) sorted by relevance

/dpdk/lib/graph/
H A Dgraph_ops.c38 STAILQ_FOREACH(graph_node, &graph->node_list, next) in graph_node_has_loop_edge()
51 STAILQ_FOREACH(graph_node, &graph->node_list, next) in graph_src_nodes_count()
69 STAILQ_FOREACH(graph_node, &graph->node_list, next) { in graph_node_has_edge_to_src_node()
91 STAILQ_FOREACH(graph_node, &graph->node_list, next) in graph_nodes_count()
102 STAILQ_FOREACH(graph_node, &graph->node_list, next) in graph_mark_nodes_as_not_visited()
149 STAILQ_FOREACH(graph_node, &graph->node_list, next) { in graph_has_isolated_node()
160 STAILQ_FOREACH(graph_node, &graph->node_list, next) in graph_has_isolated_node()
H A Dgraph.c50 STAILQ_FOREACH(graph_node, &graph->node_list, next) in graph_node_add()
80 STAILQ_FOREACH(graph_node, &graph->node_list, next) in node_to_graph_node()
148 STAILQ_FOREACH(node, node_head, next) { in expand_pattern_to_node()
204 STAILQ_FOREACH(graph_node, &graph->node_list, next) in graph_node_fini()
278 STAILQ_FOREACH(graph, &graph_list, next) in rte_graph_create()
395 STAILQ_FOREACH(graph, &graph_list, next) in rte_graph_from_name()
408 STAILQ_FOREACH(graph, &graph_list, next) in rte_graph_id_to_name()
425 STAILQ_FOREACH(graph, &graph_list, next) in rte_graph_node_get()
446 STAILQ_FOREACH(graph, &graph_list, next) in rte_graph_node_get_by_name()
533 STAILQ_FOREACH(graph, &graph_list, next) { in rte_graph_export()
[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()
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()
382 STAILQ_FOREACH(node, &node_list, next) { in node_scan_dump()
H A Dgraph_populate.c35 STAILQ_FOREACH(graph_node, &graph->node_list, next) { in graph_fp_mem_calc_size()
73 STAILQ_FOREACH(graph_node, &_graph->node_list, next) { in graph_nodes_populate()
163 STAILQ_FOREACH(graph_node, &_graph->node_list, next) { in graph_src_nodes_populate()
H A Dgraph_stats.c247 STAILQ_FOREACH(graph, graph_head, next) { in expand_pattern_to_cluster()
301 STAILQ_FOREACH(graph_node, &graph->node_list, next) { in rte_graph_cluster_stats_create()
H A Dgraph_debug.c24 STAILQ_FOREACH(graph_node, &g->node_list, next) in graph_dump()
/dpdk/app/test-eventdev/
H A Devt_test.c27 STAILQ_FOREACH(entry, &head, next) in evt_test_get()
39 STAILQ_FOREACH(entry, &head, next) in evt_test_dump_names()
/dpdk/lib/eal/common/
H A Deal_common_trace.c83 STAILQ_FOREACH(arg, &trace.args, next) in eal_trace_init()
132 STAILQ_FOREACH(tp, &tp_list, next) in rte_trace_mode_set()
190 STAILQ_FOREACH(tp, &tp_list, next) { in rte_trace_pattern()
215 STAILQ_FOREACH(tp, &tp_list, next) { in rte_trace_regexp()
239 STAILQ_FOREACH(tp, &tp_list, next) in rte_trace_point_lookup()
299 STAILQ_FOREACH(tp, tp_list, next) in rte_trace_dump()
H A Deal_common_trace_utils.c44 STAILQ_FOREACH(tp, tp_list, next) { in trace_entry_compare()
63 STAILQ_FOREACH(tp, tp_list, next) in trace_has_duplicate_entry()
79 STAILQ_FOREACH(tp, tp_list, next) { in trace_uuid_generate()
H A Deal_common_trace_ctf.c285 STAILQ_FOREACH(tp, tp_list, next) in trace_metadata_create()
/dpdk/drivers/net/bnxt/
H A Dbnxt_filter.c85 STAILQ_FOREACH(filter, &bp->pf->vf_info[i].filter, next) { in bnxt_free_all_filters()
154 STAILQ_FOREACH(filter, &bp->pf->vf_info[i].filter, next) { in bnxt_free_filter_mem()
H A Dbnxt_stats.c809 STAILQ_FOREACH(flow, &vnic->flow_list, next) { in bnxt_dev_xstats_get_op()
1047 STAILQ_FOREACH(flow, &vnic->flow_list, next) { in bnxt_flow_stats_req()
H A Drte_pmd_bnxt.c780 STAILQ_FOREACH(filter, &bp->pf->vf_info[vf_id].filter, next) { in rte_pmd_bnxt_mac_addr_add()
H A Dbnxt_flow.c796 STAILQ_FOREACH(mf, &vnic->filter, next) { in bnxt_find_matching_l2_filter()
1844 STAILQ_FOREACH(flow, &vnic->flow_list, next) { in bnxt_match_filter()
H A Dbnxt_hwrm.c2860 STAILQ_FOREACH(filter, &vnic->filter, next) { in bnxt_clear_hwrm_vnic_filters()
2892 STAILQ_FOREACH(filter, &vnic->filter, next) { in bnxt_set_hwrm_vnic_filters()
H A Dbnxt_ethdev.c1750 STAILQ_FOREACH(filter, &vnic->filter, next) { in bnxt_add_mac_filter()
/dpdk/drivers/common/cnxk/
H A Droc_bphy_irq.c134 STAILQ_FOREACH(curr_stack, &irq_stacks, entries) { in roc_bphy_irq_stack_remove()
168 STAILQ_FOREACH(curr_stack, &irq_stacks, entries) { in roc_bphy_irq_stack_get()
/dpdk/drivers/bus/vmbus/linux/
H A Dvmbus_uio.c385 STAILQ_FOREACH(c, &primary->subchannel_list, next) { in vmbus_isnew_subchannel()
/dpdk/lib/mempool/
H A Drte_mempool.c190 STAILQ_FOREACH(hdr, &mp->elt_list, next) { in rte_mempool_obj_iter()
207 STAILQ_FOREACH(hdr, &mp->mem_list, next) { in rte_mempool_mem_iter()
1254 STAILQ_FOREACH(memhdr, &mp->mem_list, next) in rte_mempool_dump()
/dpdk/lib/eal/windows/include/sys/
H A Dqueue.h321 #define STAILQ_FOREACH(var, head, field) \ macro
/dpdk/drivers/net/bnxt/tf_ulp/
H A Dbnxt_ulp.c1029 STAILQ_FOREACH(session, &bnxt_ulp_session_list, next) { in ulp_get_session()