5 #ifndef _RTE_GRAPH_WORKER_COMMON_H_
6 #define _RTE_GRAPH_WORKER_COMMON_H_
29 #define RTE_GRAPH_MODEL_RTC 0
30 #define RTE_GRAPH_MODEL_MCORE_DISPATCH 1
32 #define RTE_GRAPH_MODEL_DEFAULT RTE_GRAPH_MODEL_RTC
39 SLIST_HEAD(rte_graph_rq_head, rte_graph);
61 struct rte_graph_rq_head rq_head;
63 unsigned int lcore_id;
68 SLIST_ENTRY(rte_graph) next;
75 uint64_t nb_pkt_captured;
77 uint64_t nb_pkt_to_capture;
94 uint32_t realloc_count;
105 unsigned int lcore_id;
106 uint64_t total_sched_objs;
107 uint64_t total_sched_fail;
111 #define RTE_NODE_CTX_SZ 16
116 uint64_t total_cycles;
117 uint64_t total_calls;
125 uint64_t process_u64;
142 void __rte_node_stream_alloc(
struct rte_graph *graph,
struct rte_node *node);
158 void __rte_node_stream_alloc_size(
struct rte_graph *graph,
159 struct rte_node *node, uint16_t req_size);
174 __rte_node_process(
struct rte_graph *graph,
struct rte_node *node)
186 rc = node->process(graph, node, objs, node->idx);
187 node->total_cycles += rte_rdtsc() - start;
189 node->total_objs += rc;
191 node->process(graph, node, objs, node->idx);
207 __rte_node_enqueue_tail_update(
struct rte_graph *graph,
struct rte_node *node)
212 graph->cir_start[tail++] = node->off;
213 graph->tail = tail & graph->cir_mask;
234 __rte_node_enqueue_prologue(
struct rte_graph *graph,
struct rte_node *node,
235 const uint16_t idx,
const uint16_t space)
240 __rte_node_enqueue_tail_update(graph, node);
242 if (
unlikely(node->size < (idx + space)))
243 __rte_node_stream_alloc_size(graph, node, node->size + space);
260 __rte_node_next_node_get(
struct rte_node *node,
rte_edge_t next)
262 RTE_ASSERT(next < node->nb_edges);
264 node = node->nodes[next];
287 rte_edge_t next,
void **objs, uint16_t nb_objs)
289 node = __rte_node_next_node_get(node, next);
290 const uint16_t idx = node->idx;
292 __rte_node_enqueue_prologue(graph, node, idx, nb_objs);
294 rte_memcpy(&node->objs[idx], objs, nb_objs *
sizeof(
void *));
295 node->idx = idx + nb_objs;
315 node = __rte_node_next_node_get(node, next);
316 uint16_t idx = node->idx;
318 __rte_node_enqueue_prologue(graph, node, idx, 1);
320 node->objs[idx++] = obj;
344 node = __rte_node_next_node_get(node, next);
345 uint16_t idx = node->idx;
347 __rte_node_enqueue_prologue(graph, node, idx, 2);
349 node->objs[idx++] = obj0;
350 node->objs[idx++] = obj1;
376 rte_edge_t next,
void *obj0,
void *obj1,
void *obj2,
379 node = __rte_node_next_node_get(node, next);
380 uint16_t idx = node->idx;
382 __rte_node_enqueue_prologue(graph, node, idx, 4);
384 node->objs[idx++] = obj0;
385 node->objs[idx++] = obj1;
386 node->objs[idx++] = obj2;
387 node->objs[idx++] = obj3;
409 rte_edge_t *nexts,
void **objs, uint16_t nb_objs)
413 for (i = 0; i < nb_objs; i++)
436 static inline void **
440 node = __rte_node_next_node_get(node, next);
441 const uint16_t idx = node->idx;
442 uint16_t free_space = node->size - idx;
445 __rte_node_stream_alloc_size(graph, node, node->size + nb_objs);
447 return &node->objs[idx];
473 node = __rte_node_next_node_get(node, next);
475 __rte_node_enqueue_tail_update(graph, node);
498 struct rte_node *dst = __rte_node_next_node_get(src, next);
501 if (
likely(dst->idx == 0)) {
502 void **dobjs = dst->objs;
503 uint16_t dsz = dst->size;
504 dst->objs = src->objs;
505 dst->size = src->size;
509 __rte_node_enqueue_tail_update(graph, dst);
#define __rte_cache_aligned
#define __rte_cache_min_aligned
#define __rte_always_inline
uint16_t(* rte_node_process_t)(struct rte_graph *graph, struct rte_node *node, void **objs, uint16_t nb_objs)
#define RTE_NODE_NAMESIZE
#define RTE_GRAPH_PCAP_FILE_SZ
#define RTE_GRAPH_NAMESIZE
static __rte_always_inline int rte_graph_has_stats_feature(void)
static __rte_always_inline uint8_t rte_graph_worker_model_no_check_get(struct rte_graph *graph)
static void rte_node_enqueue_x4(struct rte_graph *graph, struct rte_node *node, rte_edge_t next, void *obj0, void *obj1, void *obj2, void *obj3)
bool rte_graph_model_is_valid(uint8_t model)
static void rte_node_next_stream_put(struct rte_graph *graph, struct rte_node *node, rte_edge_t next, uint16_t idx)
static void rte_node_enqueue(struct rte_graph *graph, struct rte_node *node, rte_edge_t next, void **objs, uint16_t nb_objs)
static void rte_node_next_stream_move(struct rte_graph *graph, struct rte_node *src, rte_edge_t next)
int rte_graph_worker_model_set(uint8_t model)
static void rte_node_enqueue_next(struct rte_graph *graph, struct rte_node *node, rte_edge_t *nexts, void **objs, uint16_t nb_objs)
static void rte_node_enqueue_x1(struct rte_graph *graph, struct rte_node *node, rte_edge_t next, void *obj)
static void rte_node_enqueue_x2(struct rte_graph *graph, struct rte_node *node, rte_edge_t next, void *obj0, void *obj1)
uint8_t rte_graph_worker_model_get(struct rte_graph *graph)
static void ** rte_node_next_stream_get(struct rte_graph *graph, struct rte_node *node, rte_edge_t next, uint16_t nb_objs)
static void * rte_memcpy(void *dst, const void *src, size_t n)
static void rte_prefetch0(const volatile void *p)
char name[RTE_MEMPOOL_NAMESIZE]