memmem-tests.cpp 1.7 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051
  1. /*
  2. * Copyright (c) 2020, Ali Mohammad Pur <mpfard@serenityos.org>
  3. *
  4. * SPDX-License-Identifier: BSD-2-Clause
  5. */
  6. #include <AK/Types.h>
  7. #include <assert.h>
  8. #include <stdio.h>
  9. #include <stdlib.h>
  10. #include <string.h>
  11. #include <unistd.h>
  12. struct TestCase {
  13. const u8* haystack;
  14. size_t haystack_length;
  15. const u8* needle;
  16. size_t needle_length;
  17. ssize_t matching_offset { -1 };
  18. };
  19. const static TestCase g_test_cases[] = {
  20. { (const u8*) {}, 0u, (const u8*) {}, 0u, 0 },
  21. { (const u8[]) { 1, 2, 3 }, 3u, (const u8[]) { 1, 2, 3 }, 3u, 0 },
  22. { (const u8[]) { 1, 2, 4 }, 3u, (const u8[]) { 1, 2, 3 }, 3u, -1 },
  23. { (const u8*)"abcdef", 6u, (const u8[]) {}, 0u, 0 },
  24. { (const u8*)"abcdef", 6u, (const u8*)"de", 2u, 3 },
  25. { (const u8[]) { 0, 1, 2, 5, 2, 5 }, 6u, (const u8[]) { 1 }, 1u, 1 },
  26. { (const u8[]) { 0, 1, 2, 5, 2, 5 }, 6u, (const u8[]) { 1, 2 }, 2u, 1 },
  27. { (const u8[]) { 0, 1, 1, 2 }, 4u, (const u8[]) { 1, 5 }, 2u, -1 },
  28. { (const u8[64]) { 0 }, 64u, (const u8[33]) { 0 }, 33u, 0 },
  29. { (const u8[64]) { 0, 1, 1, 2 }, 64u, (const u8[33]) { 1, 1 }, 2u, 1 },
  30. };
  31. int main()
  32. {
  33. bool failed = false;
  34. size_t i = 0;
  35. for (const auto& test_case : g_test_cases) {
  36. auto expected = test_case.matching_offset >= 0 ? test_case.haystack + test_case.matching_offset : nullptr;
  37. auto result = memmem(test_case.haystack, test_case.haystack_length, test_case.needle, test_case.needle_length);
  38. if (result != expected) {
  39. failed = true;
  40. fprintf(stderr, "Test %zu FAILED! expected %p, got %p\n", i, expected, result);
  41. }
  42. ++i;
  43. }
  44. printf(failed ? "FAIL\n" : "PASS\n");
  45. return failed ? 1 : 0;
  46. }