> > +++ b/lib/librte_graph/graph.c
> [...]
> > +static int
> > +graph_node_add(struct graph *graph, struct node *node)
> > +{
> > + struct graph_node *graph_node;
> > + size_t sz;
> > +
> > + /* Skip the duplicate nodes */
> > + STAILQ_FOREACH(graph_node, &graph->node_list, next)
>
On 4/5/20 10:55 AM, jer...@marvell.com wrote:
> From: Jerin Jacob
>
> Adding graph specific API implementations like graph create
> and graph destroy. This detect loops in the graph,
> check for isolated nodes and operation to verify the validity of
> graph.
>
> Signed-off-by: Jerin Jacob
> Sig
From: Jerin Jacob
Adding graph specific API implementations like graph create
and graph destroy. This detect loops in the graph,
check for isolated nodes and operation to verify the validity of
graph.
Signed-off-by: Jerin Jacob
Signed-off-by: Kiran Kumar K
Signed-off-by: Pavan Nikhilesh
Signe
3 matches
Mail list logo