93 uint32_t head = graph->head;
94 struct rte_node *node;
96 if (graph->dispatch.wq != NULL)
97 __rte_graph_mcore_dispatch_sched_wq_process(graph);
99 while (
likely(head != graph->tail)) {
100 node = (
struct rte_node *)
RTE_PTR_ADD(graph, cir_start[(int32_t)head++]);
103 if ((int32_t)head < 0 && node->dispatch.lcore_id != graph->dispatch.lcore_id)
107 if (node->dispatch.lcore_id != RTE_MAX_LCORE &&
108 graph->dispatch.lcore_id != node->dispatch.lcore_id &&
109 graph->dispatch.rq != NULL &&
110 __rte_graph_mcore_dispatch_sched_node_enqueue(node, graph->dispatch.rq))
113 __rte_node_process(graph, node);
115 head =
likely((int32_t)head > 0) ? head & mask : head;