Lines Matching refs:i
177 uint32_t i; in test_node_worker_source() local
186 for (i = 0; i < obj_node0; i++) { in test_node_worker_source()
187 data = &mbuf[0][i]; in test_node_worker_source()
188 *graph_field(data) = ((uint64_t)tm->test_node[0].idx << 32) | i; in test_node_worker_source()
189 if ((i + 1) == obj_node0) in test_node_worker_source()
191 next_stream[i] = &mbuf[0][i]; in test_node_worker_source()
199 for (i = 0; i < obj_node1; i++) { in test_node_worker_source()
200 data = &mbuf[0][obj_node0 + i]; in test_node_worker_source()
201 *graph_field(data) = ((uint64_t)tm->test_node[1].idx << 32) | i; in test_node_worker_source()
202 if ((i + 1) == obj_node1) in test_node_worker_source()
204 next_stream[i] = &mbuf[0][obj_node0 + i]; in test_node_worker_source()
224 uint32_t i; in test_node0_worker() local
229 for (i = 0; i < nb_objs; i++) { in test_node0_worker()
230 data = (struct rte_mbuf *)objs[i]; in test_node0_worker()
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()
257 for (i = 0; i < obj_node0; i++) { in test_node0_worker()
258 data = &mbuf[1][i]; in test_node0_worker()
260 ((uint64_t)tm->test_node[1].idx << 32) | i; in test_node0_worker()
261 if ((i + 1) == obj_node0) in test_node0_worker()
270 for (i = 0; i < obj_node1; i++) { in test_node0_worker()
271 data = &mbuf[1][obj_node0 + i]; in test_node0_worker()
273 ((uint64_t)tm->test_node[2].idx << 32) | i; in test_node0_worker()
274 if ((i + 1) == obj_node1) in test_node0_worker()
305 uint32_t i; in test_node1_worker() local
309 for (i = 0; i < nb_objs; i++) { in test_node1_worker()
310 data = (struct rte_mbuf *)objs[i]; in test_node1_worker()
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()
336 for (i = 0; i < obj_node0; i++) { in test_node1_worker()
337 data = &mbuf[2][i]; in test_node1_worker()
338 *graph_field(data) = ((uint64_t)tm->test_node[2].idx << 32) | i; in test_node1_worker()
339 if ((i + 1) == obj_node0) in test_node1_worker()
359 uint32_t i; in test_node2_worker() local
363 for (i = 0; i < nb_objs; i++) { in test_node2_worker()
364 data = (struct rte_mbuf *)objs[i]; in test_node2_worker()
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()
391 for (i = 0; i < obj_node0; i++) { in test_node2_worker()
392 data = &mbuf[3][i]; in test_node2_worker()
394 ((uint64_t)tm->test_node[3].idx << 32) | i; in test_node2_worker()
395 if ((i + 1) == obj_node0) in test_node2_worker()
415 uint32_t i; in test_node3_worker() local
419 for (i = 0; i < nb_objs; i++) { in test_node3_worker()
420 data = (struct rte_mbuf *)objs[i]; in test_node3_worker()
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()
450 for (i = 0; i < obj_node0; i++) { in test_node3_worker()
451 data = &mbuf[4][i]; in test_node3_worker()
453 ((uint64_t)tm->test_node[0].idx << 32) | i; in test_node3_worker()
455 if ((i + 1) == obj_node0) in test_node3_worker()
470 int i; in test_lookup_functions() local
473 for (i = 1; i < MAX_NODES; i++) { in test_lookup_functions()
474 char *name = rte_node_id_to_name(tm->test_node[i].idx); in test_lookup_functions()
475 if (strcmp(name, node_names[i]) != 0) { in test_lookup_functions()
478 i, node_names[i], name); in test_lookup_functions()
484 for (i = 1; i < MAX_NODES; i++) { in test_lookup_functions()
485 uint32_t idx = rte_node_from_name(node_names[i]); in test_lookup_functions()
486 if (idx != tm->test_node[i].idx) { in test_lookup_functions()
489 node_names[i], tm->test_node[i].idx, idx); in test_lookup_functions()
495 for (i = 1; i < MAX_NODES; i++) { in test_lookup_functions()
496 uint32_t count = rte_node_edge_count(tm->test_node[i].idx); in test_lookup_functions()
497 if (count != tm->test_node[i].node.nb_edges) { in test_lookup_functions()
499 tm->test_node[i].node.name, in test_lookup_functions()
500 tm->test_node[i].node.nb_edges, count); in test_lookup_functions()
506 for (i = 1; i < MAX_NODES; i++) { in test_lookup_functions()
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()
513 tm->test_node[i].node.name, in test_lookup_functions()
514 tm->test_node[i].node.nb_edges, 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()
521 tm->test_node[i].node.name, in test_lookup_functions()
522 tm->test_node[i].node.nb_edges, count); in test_lookup_functions()
529 tm->test_node[i].node.next_nodes[j]) != 0) { in test_lookup_functions()
531 tm->test_node[i].node.next_nodes[j], in test_lookup_functions()
548 int i; in test_node_clone() local
566 for (i = 1; i < MAX_NODES; i++) { in test_node_clone()
567 tm->test_node[i].idx = in test_node_clone()
568 rte_node_clone(node_id, tm->test_node[i].node.name); in test_node_clone()
569 if (rte_node_is_invalid(tm->test_node[i].idx)) { in test_node_clone()
591 int i; in test_update_edges() local
603 for (i = 1; i < MAX_NODES; i++) { in test_update_edges()
604 count = rte_node_edge_update(tm->test_node[i].idx, 0, in test_update_edges()
605 tm->test_node[i].node.next_nodes, in test_update_edges()
606 tm->test_node[i].node.nb_edges); 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()
614 tm->test_node[i].node.nb_edges); in test_update_edges()
615 if (count != tm->test_node[i].node.nb_edges) { in test_update_edges()
667 int i; in test_graph_walk() local
674 for (i = 0; i < 5; i++) in test_graph_walk()
684 int i; in test_graph_lookup_functions() local
686 for (i = 0; i < MAX_NODES; i++) { in test_graph_lookup_functions()
687 node = rte_graph_node_get(graph_id, tm->test_node[i].idx); in test_graph_lookup_functions()
690 tm->test_node[i].idx); in test_graph_lookup_functions()
694 if (tm->test_node[i].idx != node->id) { in test_graph_lookup_functions()
696 tm->test_node[i].idx, node->id); in test_graph_lookup_functions()
700 if (strncmp(node->name, node_names[i], RTE_NODE_NAMESIZE)) { in test_graph_lookup_functions()
702 node_names[i], node->name); in test_graph_lookup_functions()
707 for (i = 0; i < MAX_NODES; i++) { in test_graph_lookup_functions()
708 node = rte_graph_node_get_by_name("worker0", node_names[i]); in test_graph_lookup_functions()
711 tm->test_node[i].idx); in test_graph_lookup_functions()
715 if (tm->test_node[i].idx != node->id) { in test_graph_lookup_functions()
717 tm->test_node[i].idx, node->id); in test_graph_lookup_functions()
721 if (strncmp(node->name, node_names[i], RTE_NODE_NAMESIZE)) { in test_graph_lookup_functions()
723 node_names[i], node->name); in test_graph_lookup_functions()
735 int i; in graph_cluster_stats_cb_t() local
741 for (i = 0; i < MAX_NODES + 1; i++) { in graph_cluster_stats_cb_t()
742 rte_node_t id = rte_node_from_name(node_patterns[i]); in graph_cluster_stats_cb_t()
744 if (obj_stats[i] != st->objs) { in graph_cluster_stats_cb_t()
746 node_patterns[i], obj_stats[i], in graph_cluster_stats_cb_t()
751 if (fn_calls[i] != st->calls) { in graph_cluster_stats_cb_t()
753 node_patterns[i], fn_calls[i], in graph_cluster_stats_cb_t()
795 int i, j; in graph_setup() local
809 for (i = 0; i <= MAX_NODES; i++) { in graph_setup()
811 mbuf_p[i][j] = &mbuf[i][j]; in graph_setup()