70 	uint16_t idx;		/**< Number of objects used. */  member
165 			rc = node->process(graph, node, objs, node->idx);  in rte_graph_walk()
170 			node->process(graph, node, objs, node->idx);  in rte_graph_walk()
172 		node->idx = 0;  in rte_graph_walk()
219 			    const uint16_t idx, const uint16_t space)  in __rte_node_enqueue_prologue()  argument
223 	if (idx == 0)  in __rte_node_enqueue_prologue()
226 	if (unlikely(node->size < (idx + space)))  in __rte_node_enqueue_prologue()
275 	const uint16_t idx = node->idx;  in rte_node_enqueue()  local
277 	__rte_node_enqueue_prologue(graph, node, idx, nb_objs);  in rte_node_enqueue()
279 	rte_memcpy(&node->objs[idx], objs, nb_objs * sizeof(void *));  in rte_node_enqueue()
280 	node->idx = idx + nb_objs;  in rte_node_enqueue()
302 	uint16_t idx = node->idx;  in rte_node_enqueue_x1()  local
304 	__rte_node_enqueue_prologue(graph, node, idx, 1);  in rte_node_enqueue_x1()
306 	node->objs[idx++] = obj;  in rte_node_enqueue_x1()
307 	node->idx = idx;  in rte_node_enqueue_x1()
332 	uint16_t idx = node->idx;  in rte_node_enqueue_x2()  local
334 	__rte_node_enqueue_prologue(graph, node, idx, 2);  in rte_node_enqueue_x2()
336 	node->objs[idx++] = obj0;  in rte_node_enqueue_x2()
337 	node->objs[idx++] = obj1;  in rte_node_enqueue_x2()
338 	node->idx = idx;  in rte_node_enqueue_x2()
368 	uint16_t idx = node->idx;  in rte_node_enqueue_x4()  local
370 	__rte_node_enqueue_prologue(graph, node, idx, 4);  in rte_node_enqueue_x4()
372 	node->objs[idx++] = obj0;  in rte_node_enqueue_x4()
373 	node->objs[idx++] = obj1;  in rte_node_enqueue_x4()
374 	node->objs[idx++] = obj2;  in rte_node_enqueue_x4()
375 	node->objs[idx++] = obj3;  in rte_node_enqueue_x4()
376 	node->idx = idx;  in rte_node_enqueue_x4()
431 	const uint16_t idx = node->idx;  in rte_node_next_stream_get()  local
432 	uint16_t free_space = node->size - idx;  in rte_node_next_stream_get()
437 	return &node->objs[idx];  in rte_node_next_stream_get()
459 			 rte_edge_t next, uint16_t idx)  in rte_node_next_stream_put()  argument
461 	if (unlikely(!idx))  in rte_node_next_stream_put()
465 	if (node->idx == 0)  in rte_node_next_stream_put()
468 	node->idx += idx;  in rte_node_next_stream_put()
493 	if (likely(dst->idx == 0)) {  in rte_node_next_stream_move()
500 		dst->idx = src->idx;  in rte_node_next_stream_move()
503 		rte_node_enqueue(graph, src, next, src->objs, src->idx);  in rte_node_next_stream_move()