Home
last modified time | relevance | path

Searched refs:RTE_NODE_ID_INVALID (Results 1 – 6 of 6) sorted by relevance

/f-stack/dpdk/lib/librte_graph/
H A Dnode.c118 return RTE_NODE_ID_INVALID; in __rte_node_register()
148 rte_node_t rc = RTE_NODE_ID_INVALID; in node_clone()
153 if (node->parent_id != RTE_NODE_ID_INVALID) { in node_clone()
201 return RTE_NODE_ID_INVALID; in rte_node_clone()
213 return RTE_NODE_ID_INVALID; in rte_node_from_name()
364 rte_node_t rc = RTE_NODE_ID_INVALID; in rte_node_edge_get()
H A Drte_graph.h39 #define RTE_NODE_ID_INVALID UINT32_MAX /**< Invalid node id. */ macro
468 node.parent_id = RTE_NODE_ID_INVALID; \
616 return (id == RTE_NODE_ID_INVALID); in rte_node_is_invalid()
H A Dgraph_populate.c83 if (pid != RTE_NODE_ID_INVALID) { /* Cloned node */ in graph_nodes_populate()
H A Dgraph.c222 if (node->parent_id == RTE_NODE_ID_INVALID) /* Static node */ in graph_mem_fixup_node_ctx()
/f-stack/dpdk/lib/librte_node/
H A Dethdev_ctrl.c75 if (id == RTE_NODE_ID_INVALID) in rte_node_eth_config()
/f-stack/dpdk/app/test/
H A Dtest_graph_perf.c264 if (node_id != RTE_NODE_ID_INVALID) { in graph_node_get()
392 if (node_map[i][j] == RTE_NODE_ID_INVALID) { in graph_init()
454 if (src_nodes[i] == RTE_NODE_ID_INVALID) { in graph_init()
511 if (snk_nodes[i] == RTE_NODE_ID_INVALID) { in graph_init()