Re: [dpdk-dev] [PATCH v3 02/29] graph: implement node registration

> > + > > +static struct node_head node_list = STAILQ_HEAD_INITIALIZER(node_list); > > +static rte_node_t node_id; > > + > > +#define NODE_ID_CHECK(id) ID_CHECK(id, node_id) > > It's better to move this MACRO into the next patch since it's first used > there, and ID_CHECK is defined there. Will f

Re: [dpdk-dev] [PATCH v3 02/29] graph: implement node registration

roe.eu; mattias.ronnb...@ericsson.com; > pbhagavat...@marvell.com; ndabilpu...@marvell.com > Subject: [dpdk-dev] [PATCH v3 02/29] graph: implement node registration > > From: Jerin Jacob > > Adding rte_node_register() API implementation includes allocating > memory for node objec

[dpdk-dev] [PATCH v3 02/29] graph: implement node registration

From: Jerin Jacob Adding rte_node_register() API implementation includes allocating memory for node object, check for duplicate node name and add the allocated node to STAILQ node_list for future use. Signed-off-by: Jerin Jacob Signed-off-by: Kiran Kumar K Signed-off-by: Pavan Nikhilesh Signe