1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
|
/* SPDX-License-Identifier: BSD-3-Clause
* Copyright(C) 2023 Intel Corporation
*/
#ifndef _RTE_GRAPH_MODEL_MCORE_DISPATCH_H_
#define _RTE_GRAPH_MODEL_MCORE_DISPATCH_H_
/**
* @file rte_graph_model_mcore_dispatch.h
*
* These APIs allow to set core affinity with the node and only used for mcore
* dispatch model.
*/
#include <rte_errno.h>
#include <rte_mempool.h>
#include <rte_memzone.h>
#include <rte_ring.h>
#include "rte_graph_worker_common.h"
#ifdef __cplusplus
extern "C" {
#endif
#define RTE_GRAPH_SCHED_WQ_SIZE_MULTIPLIER 8
#define RTE_GRAPH_SCHED_WQ_SIZE(nb_nodes) \
((typeof(nb_nodes))((nb_nodes) * RTE_GRAPH_SCHED_WQ_SIZE_MULTIPLIER))
/**
* @internal
*
* Schedule the node to the right graph's work queue for mcore dispatch model.
*
* @param node
* Pointer to the scheduled node object.
* @param rq
* Pointer to the scheduled run-queue for all graphs.
*
* @return
* True on success, false otherwise.
*
* @note
* This implementation is used by mcore dispatch model only and user application
* should not call it directly.
*/
bool __rte_noinline __rte_graph_mcore_dispatch_sched_node_enqueue(struct rte_node *node,
struct rte_graph_rq_head *rq);
/**
* @internal
*
* Process all nodes (streams) in the graph's work queue for mcore dispatch model.
*
* @param graph
* Pointer to the graph object.
*
* @note
* This implementation is used by mcore dispatch model only and user application
* should not call it directly.
*/
void __rte_graph_mcore_dispatch_sched_wq_process(struct rte_graph *graph);
/**
* Set lcore affinity with the node used for mcore dispatch model.
*
* @param name
* Valid node name. In the case of the cloned node, the name will be
* "parent node name" + "-" + name.
* @param lcore_id
* The lcore ID value.
*
* @return
* 0 on success, error otherwise.
*/
int rte_graph_model_mcore_dispatch_node_lcore_affinity_set(const char *name,
unsigned int lcore_id);
/**
* Perform graph walk on the circular buffer and invoke the process function
* of the nodes and collect the stats.
*
* @param graph
* Graph pointer returned from rte_graph_lookup function.
*
* @see rte_graph_lookup()
*/
static inline void
rte_graph_walk_mcore_dispatch(struct rte_graph *graph)
{
const rte_graph_off_t *cir_start = graph->cir_start;
const rte_node_t mask = graph->cir_mask;
uint32_t head = graph->head;
struct rte_node *node;
if (graph->dispatch.wq != NULL)
__rte_graph_mcore_dispatch_sched_wq_process(graph);
while (likely(head != graph->tail)) {
node = (struct rte_node *)RTE_PTR_ADD(graph, cir_start[(int32_t)head++]);
/* skip the src nodes which not bind with current worker */
if ((int32_t)head < 1 && node->dispatch.lcore_id != graph->dispatch.lcore_id)
continue;
/* Schedule the node until all task/objs are done */
if (node->dispatch.lcore_id != RTE_MAX_LCORE &&
graph->dispatch.lcore_id != node->dispatch.lcore_id &&
graph->dispatch.rq != NULL &&
__rte_graph_mcore_dispatch_sched_node_enqueue(node, graph->dispatch.rq))
continue;
__rte_node_process(graph, node);
head = likely((int32_t)head > 0) ? head & mask : head;
}
graph->tail = 0;
}
#ifdef __cplusplus
}
#endif
#endif /* _RTE_GRAPH_MODEL_MCORE_DISPATCH_H_ */
|
