Lines Matching refs:i
165 uint32_t i; in test_node_worker_source() local
174 for (i = 0; i < obj_node0; i++) { in test_node_worker_source()
175 data = &mbuf[0][i]; in test_node_worker_source()
176 *graph_field(data) = ((uint64_t)tm->test_node[0].idx << 32) | i; in test_node_worker_source()
177 if ((i + 1) == obj_node0) in test_node_worker_source()
179 next_stream[i] = &mbuf[0][i]; in test_node_worker_source()
187 for (i = 0; i < obj_node1; i++) { in test_node_worker_source()
188 data = &mbuf[0][obj_node0 + i]; in test_node_worker_source()
189 *graph_field(data) = ((uint64_t)tm->test_node[1].idx << 32) | i; in test_node_worker_source()
190 if ((i + 1) == obj_node1) in test_node_worker_source()
192 next_stream[i] = &mbuf[0][obj_node0 + i]; in test_node_worker_source()
212 uint32_t i; in test_node0_worker() local
217 for (i = 0; i < nb_objs; i++) { in test_node0_worker()
218 data = (struct rte_mbuf *)objs[i]; in test_node0_worker()
227 if ((*graph_field(data) & 0xffff) != (i - count)) { in test_node0_worker()
234 count = i + 1; in test_node0_worker()
239 if (count != i) { in test_node0_worker()
245 for (i = 0; i < obj_node0; i++) { in test_node0_worker()
246 data = &mbuf[1][i]; in test_node0_worker()
248 ((uint64_t)tm->test_node[1].idx << 32) | i; in test_node0_worker()
249 if ((i + 1) == obj_node0) in test_node0_worker()
258 for (i = 0; i < obj_node1; i++) { in test_node0_worker()
259 data = &mbuf[1][obj_node0 + i]; in test_node0_worker()
261 ((uint64_t)tm->test_node[2].idx << 32) | i; in test_node0_worker()
262 if ((i + 1) == obj_node1) in test_node0_worker()
293 uint32_t i; in test_node1_worker() local
297 for (i = 0; i < nb_objs; i++) { in test_node1_worker()
298 data = (struct rte_mbuf *)objs[i]; in test_node1_worker()
307 if ((*graph_field(data) & 0xffff) != (i - count)) { in test_node1_worker()
313 count = i + 1; in test_node1_worker()
318 if (count != i) { in test_node1_worker()
324 for (i = 0; i < obj_node0; i++) { in test_node1_worker()
325 data = &mbuf[2][i]; in test_node1_worker()
326 *graph_field(data) = ((uint64_t)tm->test_node[2].idx << 32) | i; in test_node1_worker()
327 if ((i + 1) == obj_node0) in test_node1_worker()
347 uint32_t i; in test_node2_worker() local
351 for (i = 0; i < nb_objs; i++) { in test_node2_worker()
352 data = (struct rte_mbuf *)objs[i]; in test_node2_worker()
361 if ((*graph_field(data) & 0xffff) != (i - count)) { in test_node2_worker()
367 count = i + 1; in test_node2_worker()
372 if (count != i) { in test_node2_worker()
379 for (i = 0; i < obj_node0; i++) { in test_node2_worker()
380 data = &mbuf[3][i]; in test_node2_worker()
382 ((uint64_t)tm->test_node[3].idx << 32) | i; in test_node2_worker()
383 if ((i + 1) == obj_node0) in test_node2_worker()
403 uint32_t i; in test_node3_worker() local
407 for (i = 0; i < nb_objs; i++) { in test_node3_worker()
408 data = (struct rte_mbuf *)objs[i]; in test_node3_worker()
417 if ((*graph_field(data) & 0xffff) != (i - count)) { in test_node3_worker()
423 count = i + 1; in test_node3_worker()
428 if (count != i) { in test_node3_worker()
438 for (i = 0; i < obj_node0; i++) { in test_node3_worker()
439 data = &mbuf[4][i]; in test_node3_worker()
441 ((uint64_t)tm->test_node[0].idx << 32) | i; in test_node3_worker()
443 if ((i + 1) == obj_node0) in test_node3_worker()
458 int i; in test_lookup_functions() local
461 for (i = 1; i < MAX_NODES; i++) { in test_lookup_functions()
462 char *name = rte_node_id_to_name(tm->test_node[i].idx); in test_lookup_functions()
463 if (strcmp(name, node_names[i]) != 0) { in test_lookup_functions()
466 i, node_names[i], name); in test_lookup_functions()
472 for (i = 1; i < MAX_NODES; i++) { in test_lookup_functions()
473 uint32_t idx = rte_node_from_name(node_names[i]); in test_lookup_functions()
474 if (idx != tm->test_node[i].idx) { in test_lookup_functions()
477 node_names[i], tm->test_node[i].idx, idx); in test_lookup_functions()
483 for (i = 1; i < MAX_NODES; i++) { in test_lookup_functions()
484 uint32_t count = rte_node_edge_count(tm->test_node[i].idx); in test_lookup_functions()
485 if (count != tm->test_node[i].node.nb_edges) { in test_lookup_functions()
487 tm->test_node[i].node.name, in test_lookup_functions()
488 tm->test_node[i].node.nb_edges, count); in test_lookup_functions()
494 for (i = 1; i < MAX_NODES; i++) { in test_lookup_functions()
498 count = rte_node_edge_get(tm->test_node[i].idx, NULL); in test_lookup_functions()
499 if (count != tm->test_node[i].node.nb_edges * sizeof(char *)) { in test_lookup_functions()
501 tm->test_node[i].node.name, in test_lookup_functions()
502 tm->test_node[i].node.nb_edges, count); in test_lookup_functions()
506 count = rte_node_edge_get(tm->test_node[i].idx, next_edges); in test_lookup_functions()
507 if (count != tm->test_node[i].node.nb_edges) { in test_lookup_functions()
509 tm->test_node[i].node.name, in test_lookup_functions()
510 tm->test_node[i].node.nb_edges, count); in test_lookup_functions()
517 tm->test_node[i].node.next_nodes[j]) != 0) { in test_lookup_functions()
519 tm->test_node[i].node.next_nodes[j], in test_lookup_functions()
536 int i; in test_node_clone() local
548 for (i = 1; i < MAX_NODES; i++) { in test_node_clone()
549 tm->test_node[i].idx = in test_node_clone()
550 rte_node_clone(node_id, tm->test_node[i].node.name); in test_node_clone()
551 if (rte_node_is_invalid(tm->test_node[i].idx)) { in test_node_clone()
573 int i; in test_update_edges() local
585 for (i = 1; i < MAX_NODES; i++) { in test_update_edges()
586 count = rte_node_edge_update(tm->test_node[i].idx, 0, in test_update_edges()
587 tm->test_node[i].node.next_nodes, in test_update_edges()
588 tm->test_node[i].node.nb_edges); in test_update_edges()
589 if (count != tm->test_node[i].node.nb_edges) { in test_update_edges()
591 tm->test_node[i].node.nb_edges, count); in test_update_edges()
595 count = rte_node_edge_shrink(tm->test_node[i].idx, in test_update_edges()
596 tm->test_node[i].node.nb_edges); in test_update_edges()
597 if (count != tm->test_node[i].node.nb_edges) { in test_update_edges()
649 int i; in test_graph_walk() local
656 for (i = 0; i < 5; i++) in test_graph_walk()
666 int i; in test_graph_lookup_functions() local
668 for (i = 0; i < MAX_NODES; i++) { in test_graph_lookup_functions()
669 node = rte_graph_node_get(graph_id, tm->test_node[i].idx); in test_graph_lookup_functions()
672 tm->test_node[i].idx); in test_graph_lookup_functions()
676 if (tm->test_node[i].idx != node->id) { in test_graph_lookup_functions()
678 tm->test_node[i].idx, node->id); in test_graph_lookup_functions()
682 if (strncmp(node->name, node_names[i], RTE_NODE_NAMESIZE)) { in test_graph_lookup_functions()
684 node_names[i], node->name); in test_graph_lookup_functions()
689 for (i = 0; i < MAX_NODES; i++) { in test_graph_lookup_functions()
690 node = rte_graph_node_get_by_name("worker0", node_names[i]); in test_graph_lookup_functions()
693 tm->test_node[i].idx); in test_graph_lookup_functions()
697 if (tm->test_node[i].idx != node->id) { in test_graph_lookup_functions()
699 tm->test_node[i].idx, node->id); in test_graph_lookup_functions()
703 if (strncmp(node->name, node_names[i], RTE_NODE_NAMESIZE)) { in test_graph_lookup_functions()
705 node_names[i], node->name); in test_graph_lookup_functions()
717 int i; in graph_cluster_stats_cb_t() local
723 for (i = 0; i < MAX_NODES + 1; i++) { in graph_cluster_stats_cb_t()
724 rte_node_t id = rte_node_from_name(node_patterns[i]); in graph_cluster_stats_cb_t()
726 if (obj_stats[i] != st->objs) { in graph_cluster_stats_cb_t()
728 node_patterns[i], obj_stats[i], in graph_cluster_stats_cb_t()
733 if (fn_calls[i] != st->calls) { in graph_cluster_stats_cb_t()
735 node_patterns[i], fn_calls[i], in graph_cluster_stats_cb_t()
777 int i, j; in graph_setup() local
791 for (i = 0; i <= MAX_NODES; i++) { in graph_setup()
793 mbuf_p[i][j] = &mbuf[i][j]; in graph_setup()