Lines Matching refs:test_node
85 test_node_t test_node[MAX_NODES]; member
89 .test_node = {
176 *graph_field(data) = ((uint64_t)tm->test_node[0].idx << 32) | i; in test_node_worker_source()
189 *graph_field(data) = ((uint64_t)tm->test_node[1].idx << 32) | i; in test_node_worker_source()
219 if ((*graph_field(data) >> 32) != tm->test_node[0].idx) { in test_node0_worker()
222 tm->test_node[0].idx, in test_node0_worker()
248 ((uint64_t)tm->test_node[1].idx << 32) | i; in test_node0_worker()
261 ((uint64_t)tm->test_node[2].idx << 32) | i; in test_node0_worker()
270 } else if (*(uint32_t *)node->ctx == tm->test_node[1].idx) { in test_node0_worker()
272 } else if (*(uint32_t *)node->ctx == tm->test_node[2].idx) { in test_node0_worker()
274 } else if (*(uint32_t *)node->ctx == tm->test_node[3].idx) { in test_node0_worker()
299 if ((*graph_field(data) >> 32) != tm->test_node[1].idx) { in test_node1_worker()
302 tm->test_node[1].idx, in test_node1_worker()
326 *graph_field(data) = ((uint64_t)tm->test_node[2].idx << 32) | i; in test_node1_worker()
353 if ((*graph_field(data) >> 32) != tm->test_node[2].idx) { in test_node2_worker()
356 tm->test_node[2].idx, in test_node2_worker()
382 ((uint64_t)tm->test_node[3].idx << 32) | i; in test_node2_worker()
409 if ((*graph_field(data) >> 32) != tm->test_node[3].idx) { in test_node3_worker()
412 tm->test_node[3].idx, in test_node3_worker()
441 ((uint64_t)tm->test_node[0].idx << 32) | i; in test_node3_worker()
462 char *name = rte_node_id_to_name(tm->test_node[i].idx); 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()
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()
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()
539 tm->test_node[0].idx = node_id; 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()
558 dummy_id = rte_node_clone(tm->test_node[1].idx, "dummy_node"); in test_node_clone()
577 tm->test_node[0].node.next_nodes, in test_update_edges()
578 tm->test_node[0].node.nb_edges); in test_update_edges()
579 if (count != tm->test_node[0].node.nb_edges) { in test_update_edges()
581 tm->test_node[0].node.nb_edges, count); 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()
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()
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()