bpf/map_tests/lpm_trie_map_batch_ops.c

22 static void map_batch_update(int map_fd, __u32 max_entries,
33 	for (i = 0; i < max_entries; i++) {
40 	err = bpf_map_update_batch(map_fd, keys, values, &max_entries, &opts);
44 static void map_batch_verify(int *visited, __u32 max_entries,
51 	memset(visited, 0, max_entries * sizeof(*visited));
52 	for (i = 0; i < max_entries; i++) {
60 	for (i = 0; i < max_entries; i++) {
72 	const __u32 max_entries = 10;
82 				max_entries, &create_opts);
86 	keys = malloc(max_entries * sizeof(struct test_lpm_key));
87 	values = malloc(max_entries * sizeof(int));
88 	visited = malloc(max_entries * sizeof(int));
93 	for (step = 1; step < max_entries; step++) {
94 		map_batch_update(map_fd, max_entries, keys, values);
95 		map_batch_verify(visited, max_entries, keys, values);
96 		memset(keys, 0, max_entries * sizeof(*keys));
97 		memset(values, 0, max_entries * sizeof(*values));
117 		CHECK(total != max_entries, "lookup with steps",
118 		      "total = %u, max_entries = %u\n", total, max_entries);
120 		map_batch_verify(visited, max_entries, keys, values);
124 		while (total < max_entries) {
125 			if (max_entries - total < step)
126 				count = max_entries - total;
135 		CHECK(total != max_entries, "delete with steps",
136 		      "total = %u, max_entries = %u\n", total, max_entries);