commit 1cd1bcf86dcb0a7bb8e4b2b64deeac8ed8fc4785
author Vitaly Buka <vitalybuka@google.com> Sun Nov 27 23:11:56 2022 -0800
committer Copybara-Service <copybara-worker@google.com> Sun Nov 27 23:50:38 2022 -0800
tree 06a6a29c4b2a4405ac683245affc044420e62e77
parent cf5fe5240cec2a56dca4800383a09c78c08c8d04

[NFC][asan] Fix typo in names

GitOrigin-RevId: 4880a48ab27ca8ef794bee4746f4fec7515283b4

test/asan/TestCases/contiguous_container.cpp

diff --git a/test/asan/TestCases/contiguous_container.cpp b/test/asan/TestCases/contiguous_container.cpp
index 7fcb644..c796d04 100644
--- a/test/asan/TestCases/contiguous_container.cpp
+++ b/test/asan/TestCases/contiguous_container.cpp
@@ -26,8 +26,8 @@
   return result;
 }
 
-static int GetFirstMissmatch(const std::vector<bool> &a,
-                             const std::vector<bool> &b) {
+static int GetFirstMismatch(const std::vector<bool> &a,
+                            const std::vector<bool> &b) {
   return std::mismatch(a.begin(), a.end(), b.begin(), b.end()).first -
          a.begin();
 }
@@ -97,7 +97,7 @@
       assert(!is_valid);
       assert(bad_address == std::min(cur, end));
       assert(bad_address ==
-             st_beg + GetFirstMissmatch(masks[i], masks[cur - st_beg]));
+             st_beg + GetFirstMismatch(masks[i], masks[cur - st_beg]));
     }
   }
 
@@ -174,7 +174,7 @@
       __sanitizer_annotate_double_ended_contiguous_container(
           st_beg, st_end, old_beg, old_end, beg, end);
 
-      // Try to missmatch the end of the container.
+      // Try to mismatch the end of the container.
       char *cur_first = std::max(end - 2 * kGranularity, beg);
       char *cur_last = std::min(end + 2 * kGranularity, st_end);
       for (char *cur = cur_first; cur <= cur_last; ++cur) {
@@ -193,10 +193,10 @@
         assert(!is_valid);
         assert(bad_address);
         assert(bad_address ==
-               st_beg + GetFirstMissmatch(masks[i][j], masks[i][cur - st_beg]));
+               st_beg + GetFirstMismatch(masks[i][j], masks[i][cur - st_beg]));
       }
 
-      // Try to missmatch the begin of the container.
+      // Try to mismatch the begin of the container.
       cur_first = std::max(beg - 2 * kGranularity, st_beg);
       cur_last = std::min(beg + 2 * kGranularity, end);
       for (char *cur = cur_first; cur <= cur_last; ++cur) {
@@ -217,7 +217,7 @@
         assert(!is_valid);
         assert(bad_address);
         assert(bad_address ==
-               st_beg + GetFirstMissmatch(masks[i][j], masks[cur - st_beg][j]));
+               st_beg + GetFirstMismatch(masks[i][j], masks[cur - st_beg][j]));
       }
     }
   }