223 		uint32_t count = 0;  in test_node0_worker()  local
239 			if ((*graph_field(data) & 0xffff) != (i - count)) {  in test_node0_worker()
246 				count = i + 1;  in test_node0_worker()
251 		if (count != i) {  in test_node0_worker()
304 	uint32_t count = 0;  in test_node1_worker()  local
319 		if ((*graph_field(data) & 0xffff) != (i - count)) {  in test_node1_worker()
325 			count = i + 1;  in test_node1_worker()
330 	if (count != i) {  in test_node1_worker()
357 	uint32_t count = 0;  in test_node2_worker()  local
373 		if ((*graph_field(data) & 0xffff) != (i - count)) {  in test_node2_worker()
379 			count = i + 1;  in test_node2_worker()
384 	if (count != i) {  in test_node2_worker()
413 	uint32_t count = 0;  in test_node3_worker()  local
429 		if ((*graph_field(data) & 0xffff) != (i - count)) {  in test_node3_worker()
435 			count = i + 1;  in test_node3_worker()
440 	if (count != i) {  in test_node3_worker()
496 		uint32_t count = rte_node_edge_count(tm->test_node[i].idx);  in test_lookup_functions()  local
497 		if (count != tm->test_node[i].node.nb_edges) {  in test_lookup_functions()
500 			       tm->test_node[i].node.nb_edges, count);  in test_lookup_functions()
507 		uint32_t j, count;  in test_lookup_functions()  local
510 		count = rte_node_edge_get(tm->test_node[i].idx, NULL);  in test_lookup_functions()
511 		if (count != tm->test_node[i].node.nb_edges * sizeof(char *)) {  in test_lookup_functions()
514 			       tm->test_node[i].node.nb_edges, count);  in test_lookup_functions()
517 		next_edges = malloc(count);  in test_lookup_functions()
518 		count = rte_node_edge_get(tm->test_node[i].idx, next_edges);  in test_lookup_functions()
519 		if (count != tm->test_node[i].node.nb_edges) {  in test_lookup_functions()
522 			       tm->test_node[i].node.nb_edges, count);  in test_lookup_functions()
527 		for (j = 0; j < count; j++) {  in test_lookup_functions()
590 	uint16_t count;  in test_update_edges()  local
594 	count = rte_node_edge_update(node_id, 0,  in test_update_edges()
597 	if (count != tm->test_node[0].node.nb_edges) {  in test_update_edges()
599 		       tm->test_node[0].node.nb_edges, count);  in test_update_edges()
604 		count = rte_node_edge_update(tm->test_node[i].idx, 0,  in test_update_edges()
607 		if (count != tm->test_node[i].node.nb_edges) {  in test_update_edges()
609 			       tm->test_node[i].node.nb_edges, count);  in test_update_edges()
613 		count = rte_node_edge_shrink(tm->test_node[i].idx,  in test_update_edges()
615 		if (count != tm->test_node[i].node.nb_edges) {  in test_update_edges()