54 struct rte_node {  struct
85 	struct rte_node *nodes[] __rte_cache_min_aligned; /**< Next nodes. */  argument
101 void __rte_node_stream_alloc(struct rte_graph *graph, struct rte_node *node);
119 				  struct rte_node *node, uint16_t req_size);
137 	struct rte_node *node;  in rte_graph_walk()
158 		node = (struct rte_node *)RTE_PTR_ADD(graph, cir_start[(int32_t)head++]);  in rte_graph_walk()
191 __rte_node_enqueue_tail_update(struct rte_graph *graph, struct rte_node *node)  in __rte_node_enqueue_tail_update()
218 __rte_node_enqueue_prologue(struct rte_graph *graph, struct rte_node *node,  in __rte_node_enqueue_prologue()
243 static __rte_always_inline struct rte_node *
244 __rte_node_next_node_get(struct rte_node *node, rte_edge_t next)  in __rte_node_next_node_get()
271 rte_node_enqueue(struct rte_graph *graph, struct rte_node *node,  in rte_node_enqueue()
298 rte_node_enqueue_x1(struct rte_graph *graph, struct rte_node *node,  in rte_node_enqueue_x1()
328 rte_node_enqueue_x2(struct rte_graph *graph, struct rte_node *node,  in rte_node_enqueue_x2()
363 rte_node_enqueue_x4(struct rte_graph *graph, struct rte_node *node,  in rte_node_enqueue_x4()
397 rte_node_enqueue_next(struct rte_graph *graph, struct rte_node *node,  in rte_node_enqueue_next()
427 rte_node_next_stream_get(struct rte_graph *graph, struct rte_node *node,  in rte_node_next_stream_get()
458 rte_node_next_stream_put(struct rte_graph *graph, struct rte_node *node,  in rte_node_next_stream_put()
487 rte_node_next_stream_move(struct rte_graph *graph, struct rte_node *src,  in rte_node_next_stream_move()
490 	struct rte_node *dst = __rte_node_next_node_get(src, next);  in rte_node_next_stream_move()