81 	sz = sizeof(struct node) + (reg->nb_edges * RTE_NODE_NAMESIZE);  in __rte_node_register()
97 	node->nb_edges = reg->nb_edges;  in __rte_node_register()
99 	for (i = 0; i < reg->nb_edges; i++) {  in __rte_node_register()
162 	reg = calloc(1, sizeof(*reg) + (sizeof(char *) * node->nb_edges));  in node_clone()
173 	reg->nb_edges = node->nb_edges;  in node_clone()
176 	for (i = 0; i < node->nb_edges; i++)  in node_clone()
238 			return node->nb_edges;  in rte_node_edge_count()
245 	    const char **next_nodes, rte_edge_t nb_edges)  in edge_update()  argument
253 		from = node->nb_edges;  in edge_update()
256 	if (from > node->nb_edges) {  in edge_update()
265 	max_edges = from + nb_edges;  in edge_update()
266 	need_realloc = max_edges > node->nb_edges;  in edge_update()
294 		node->nb_edges = max_edges;  in edge_update()
311 			if (node->nb_edges < size) {  in rte_node_edge_shrink()
315 			node->nb_edges = size;  in rte_node_edge_shrink()
328 		     uint16_t nb_edges)  in rte_node_edge_update()  argument
339 			rc = edge_update(n, prev, from, next_nodes, nb_edges);  in rte_node_edge_update()
355 	for (i = 0; i < node->nb_edges; i++)  in node_copy_edges()
373 				rc = sizeof(char *) * node->nb_edges;  in rte_node_edge_get()