20 #define NODE_ID_CHECK(id) ID_CHECK(id, node_id)  argument
107 	node->id = node_id++;  in __rte_node_register()
113 	return node->id;  in __rte_node_register()
174 	reg->parent_id = node->id;  in node_clone()
191 rte_node_clone(rte_node_t id, const char *name)  in rte_node_clone()  argument
195 	NODE_ID_CHECK(id);  in rte_node_clone()
197 		if (node->id == id)  in rte_node_clone()
211 			return node->id;  in rte_node_from_name()
217 rte_node_id_to_name(rte_node_t id)  in rte_node_id_to_name()  argument
221 	NODE_ID_CHECK(id);  in rte_node_id_to_name()
223 		if (node->id == id)  in rte_node_id_to_name()
231 rte_node_edge_count(rte_node_t id)  in rte_node_edge_count()  argument
235 	NODE_ID_CHECK(id);  in rte_node_edge_count()
237 		if (node->id == id)  in rte_node_edge_count()
301 rte_node_edge_shrink(rte_node_t id, rte_edge_t size)  in rte_node_edge_shrink()  argument
306 	NODE_ID_CHECK(id);  in rte_node_edge_shrink()
310 		if (node->id == id) {  in rte_node_edge_shrink()
327 rte_node_edge_update(rte_node_t id, rte_edge_t from, const char **next_nodes,  in rte_node_edge_update()  argument
333 	NODE_ID_CHECK(id);  in rte_node_edge_update()
338 		if (n->id == id) {  in rte_node_edge_update()
362 rte_node_edge_get(rte_node_t id, char *next_nodes[])  in rte_node_edge_get()  argument
367 	NODE_ID_CHECK(id);  in rte_node_edge_get()
371 		if (node->id == id) {  in rte_node_edge_get()
386 node_scan_dump(FILE *f, rte_node_t id, bool all)  in node_scan_dump()  argument
391 	NODE_ID_CHECK(id);  in node_scan_dump()
396 		} else if (node->id == id) {  in node_scan_dump()
406 rte_node_dump(FILE *f, rte_node_t id)  in rte_node_dump()  argument
408 	node_scan_dump(f, id, false);  in rte_node_dump()