5 #ifndef _RTE_GRAPH_WORKER_H_ 6 #define _RTE_GRAPH_WORKER_H_ 60 uint32_t realloc_count;
66 #define RTE_NODE_CTX_SZ 16 71 uint64_t total_cycles;
102 void __rte_node_stream_alloc(
struct rte_graph *graph,
struct rte_node *node);
121 void __rte_node_stream_alloc_size(
struct rte_graph *graph,
122 struct rte_node *node, uint16_t req_size);
142 uint32_t head = graph->head;
143 struct rte_node *node;
163 while (
likely(head != graph->tail)) {
164 node =
RTE_PTR_ADD(graph, cir_start[(int32_t)head++]);
171 rc = node->process(graph, node, objs, node->idx);
172 node->total_cycles += rte_rdtsc() - start;
174 node->total_objs += rc;
176 node->process(graph, node, objs, node->idx);
179 head =
likely((int32_t)head > 0) ? head & mask : head;
197 __rte_node_enqueue_tail_update(
struct rte_graph *graph,
struct rte_node *node)
202 graph->cir_start[tail++] = node->off;
203 graph->tail = tail & graph->cir_mask;
224 __rte_node_enqueue_prologue(
struct rte_graph *graph,
struct rte_node *node,
225 const uint16_t idx,
const uint16_t space)
230 __rte_node_enqueue_tail_update(graph, node);
232 if (
unlikely(node->size < (idx + space)))
233 __rte_node_stream_alloc(graph, node);
250 __rte_node_next_node_get(
struct rte_node *node,
rte_edge_t next)
252 RTE_ASSERT(next < node->nb_edges);
254 node = node->nodes[next];
281 rte_edge_t next,
void **objs, uint16_t nb_objs)
283 node = __rte_node_next_node_get(node, next);
284 const uint16_t idx = node->idx;
286 __rte_node_enqueue_prologue(graph, node, idx, nb_objs);
288 rte_memcpy(&node->objs[idx], objs, nb_objs *
sizeof(
void *));
289 node->idx = idx + nb_objs;
313 node = __rte_node_next_node_get(node, next);
314 uint16_t idx = node->idx;
316 __rte_node_enqueue_prologue(graph, node, idx, 1);
318 node->objs[idx++] = obj;
346 node = __rte_node_next_node_get(node, next);
347 uint16_t idx = node->idx;
349 __rte_node_enqueue_prologue(graph, node, idx, 2);
351 node->objs[idx++] = obj0;
352 node->objs[idx++] = obj1;
382 rte_edge_t next,
void *obj0,
void *obj1,
void *obj2,
385 node = __rte_node_next_node_get(node, next);
386 uint16_t idx = node->idx;
388 __rte_node_enqueue_prologue(graph, node, idx, 4);
390 node->objs[idx++] = obj0;
391 node->objs[idx++] = obj1;
392 node->objs[idx++] = obj2;
393 node->objs[idx++] = obj3;
419 rte_edge_t *nexts,
void **objs, uint16_t nb_objs)
423 for (i = 0; i < nb_objs; i++)
450 static inline void **
454 node = __rte_node_next_node_get(node, next);
455 const uint16_t idx = node->idx;
456 uint16_t free_space = node->size - idx;
459 __rte_node_stream_alloc_size(graph, node, nb_objs);
461 return &node->objs[idx];
492 node = __rte_node_next_node_get(node, next);
494 __rte_node_enqueue_tail_update(graph, node);
521 struct rte_node *dst = __rte_node_next_node_get(src, next);
524 if (
likely(dst->idx == 0)) {
525 void **dobjs = dst->objs;
526 uint16_t dsz = dst->size;
527 dst->objs = src->objs;
528 dst->size = src->size;
532 __rte_node_enqueue_tail_update(graph, dst);
static __rte_experimental void rte_node_enqueue(struct rte_graph *graph, struct rte_node *node, rte_edge_t next, void **objs, uint16_t nb_objs)
#define __rte_always_inline
static __rte_experimental void rte_node_next_stream_move(struct rte_graph *graph, struct rte_node *src, rte_edge_t next)
#define __rte_cache_min_aligned
static __rte_experimental void rte_node_enqueue_x2(struct rte_graph *graph, struct rte_node *node, rte_edge_t next, void *obj0, void *obj1)
#define RTE_NODE_NAMESIZE
static __rte_always_inline int rte_graph_has_stats_feature(void)
uint16_t(* rte_node_process_t)(struct rte_graph *graph, struct rte_node *node, void **objs, uint16_t nb_objs)
#define RTE_GRAPH_NAMESIZE
static __rte_experimental void rte_node_next_stream_put(struct rte_graph *graph, struct rte_node *node, rte_edge_t next, uint16_t idx)
#define RTE_PTR_ADD(ptr, x)
static __rte_experimental void rte_node_enqueue_next(struct rte_graph *graph, struct rte_node *node, rte_edge_t *nexts, void **objs, uint16_t nb_objs)
static __rte_experimental void rte_graph_walk(struct rte_graph *graph)
static __rte_experimental void rte_node_enqueue_x1(struct rte_graph *graph, struct rte_node *node, rte_edge_t next, void *obj)
#define __rte_cache_aligned
static __rte_experimental 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 __rte_experimental 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)
static void rte_prefetch0(const volatile void *p)