Lines Matching defs:objs
137 void **objs; /**< Array of object pointers. */
199 void **objs;
202 objs = node->objs;
203 rte_prefetch0(objs);
207 rc = node->process(graph, node, objs, node->idx);
212 node->process(graph, node, objs, node->idx);
292 * Enqueue the objs to next node for further processing and set
300 * Relative next node index to enqueue objs.
301 * @param objs
304 * Number of objs to enqueue.
308 rte_edge_t next, void **objs, uint16_t nb_objs)
315 rte_memcpy(&node->objs[idx], objs, nb_objs * sizeof(void *));
328 * Relative next node index to enqueue objs.
341 node->objs[idx++] = obj;
346 * Enqueue only two objs to next node for further processing and
348 * Same as rte_node_enqueue_x1 but enqueue two objs.
355 * Relative next node index to enqueue objs.
370 node->objs[idx++] = obj0;
371 node->objs[idx++] = obj1;
376 * Enqueue only four objs to next node for further processing and
378 * Same as rte_node_enqueue_x1 but enqueue four objs.
385 * Relative next node index to enqueue objs.
405 node->objs[idx++] = obj0;
406 node->objs[idx++] = obj1;
407 node->objs[idx++] = obj2;
408 node->objs[idx++] = obj3;
413 * Enqueue objs to multiple next nodes for further processing and
415 * objs[i] will be enqueued to nexts[i].
422 * List of relative next node indices to enqueue objs.
423 * @param objs
424 * List of objs to enqueue.
426 * Number of objs to enqueue.
430 rte_edge_t *nexts, void **objs, uint16_t nb_objs)
435 rte_node_enqueue_x1(graph, node, nexts[i], objs[i]);
439 * Get the stream of next node to enqueue the objs.
440 * Once done with the updating the objs, needs to call
468 return &node->objs[idx];
482 * Number of objs updated in the stream after getting the stream using
502 * Home run scenario, Enqueue all the objs of current node to next
521 /* Let swap the pointers if dst don't have valid objs */
523 void **dobjs = dst->objs;
525 dst->objs = src->objs;
527 src->objs = dobjs;
532 rte_node_enqueue(graph, src, next, src->objs, src->idx);