I tried coming up with some syntax that would describe this, but was
unsuccessful. The issue is that order is a property of the source queue and
these split elements have no originating queue since the application is
creating them.
If your HW supports this feature it might be easier to model it af
Shouldn't be possible to insert in an ordered flow just with
odp_queue_enq()? Using odp_queue_enq_multi() only is somehow restrictive. I
think ordering information should be contained in the event itself rather
than which index in events[] array occupies.
Alex
On 3 August 2015 at 14:21, Bill Fisc
As defined here, the odp_queue_enq_multi() is the complete split, and the
sequence is as specified in the list. Let's discuss this during today's
Arch call. Do you have a proposed API for doing what you'd like?
On Mon, Aug 3, 2015 at 1:46 AM, Alexandru Badicioiu <
alexandru.badici...@linaro.or
Hi,
I think extending the meaning of this function alone is not enough for the
purpose of splitting a packet/event in an ordered flow context.
There's has to be a way to tell the queuing engine/scheduler which one is
the last fragment in a series , otherwise how the queuing engine/scheduler
is supp
Signed-off-by: Bill Fischofer
---
include/odp/api/queue.h | 23 +++
1 file changed, 23 insertions(+)
diff --git a/include/odp/api/queue.h b/include/odp/api/queue.h
index ce04eb4..5a6dbc0 100644
--- a/include/odp/api/queue.h
+++ b/include/odp/api/queue.h
@@ -173,6 +173,29 @@ i
