This seems to be a reminiscent from the hashmap tests.

Signed-off-by: Pedro Tammela <pctamm...@gmail.com>
---
 tools/testing/selftests/bpf/map_tests/array_map_batch_ops.c | 5 -----
 1 file changed, 5 deletions(-)

diff --git a/tools/testing/selftests/bpf/map_tests/array_map_batch_ops.c 
b/tools/testing/selftests/bpf/map_tests/array_map_batch_ops.c
index f0a64d8ac59a..e42ea1195d18 100644
--- a/tools/testing/selftests/bpf/map_tests/array_map_batch_ops.c
+++ b/tools/testing/selftests/bpf/map_tests/array_map_batch_ops.c
@@ -55,7 +55,6 @@ void test_array_map_batch_ops(void)
        int map_fd, *keys, *values, *visited;
        __u32 count, total, total_success;
        const __u32 max_entries = 10;
-       bool nospace_err;
        __u64 batch = 0;
        int err, step;
        DECLARE_LIBBPF_OPTS(bpf_map_batch_opts, opts,
@@ -90,7 +89,6 @@ void test_array_map_batch_ops(void)
                 * elements each.
                 */
                count = step;
-               nospace_err = false;
                while (true) {
                        err = bpf_map_lookup_batch(map_fd,
                                                total ? &batch : NULL, &batch,
@@ -107,9 +105,6 @@ void test_array_map_batch_ops(void)
 
                }
 
-               if (nospace_err == true)
-                       continue;
-
                CHECK(total != max_entries, "lookup with steps",
                      "total = %u, max_entries = %u\n", total, max_entries);
 
-- 
2.25.1

Reply via email to