[libunwind] b397921 - [runtimes] Fix some duplicate word typos

[Louis Dionne via cfe-commits]

Author: Louis Dionne
Date: 2023-08-31T11:55:10-04:00
New Revision: b397921fc7ef4e2882b3ae9c5f12fb40daca4078

URL: https://github.com/llvm/llvm-project/commit/b397921fc7ef4e2882b3ae9c5f12fb40daca4078
DIFF: https://github.com/llvm/llvm-project/commit/b397921fc7ef4e2882b3ae9c5f12fb40daca4078.diff

LOG: [runtimes] Fix some duplicate word typos

Those fixes were taken from https://reviews.llvm.org/D137338.

Added: 
    

Modified: 
    libcxx/include/__format/buffer.h
    libcxx/test/std/time/time.syn/formatter.duration.pass.cpp
    libcxxabi/src/private_typeinfo.cpp
    libunwind/include/mach-o/compact_unwind_encoding.h
    libunwind/src/FrameHeaderCache.hpp
    libunwind/src/UnwindRegistersRestore.S

Removed: 
    


################################################################################
diff  --git a/libcxx/include/__format/buffer.h b/libcxx/include/__format/buffer.h
index 45f9da801722cca..c0502971ce127ad 100644
--- a/libcxx/include/__format/buffer.h
+++ b/libcxx/include/__format/buffer.h
@@ -95,7 +95,7 @@ class _LIBCPP_TEMPLATE_VIS __output_buffer {
   _LIBCPP_HIDE_FROM_ABI void __copy(basic_string_view<_InCharT> __str) {
     // When the underlying iterator is a simple iterator the __capacity_ is
     // infinite. For a string or container back_inserter it isn't. This means
-    // adding a large string the the buffer can cause some overhead. In that
+    // that adding a large string to the buffer can cause some overhead. In that
     // case a better approach could be:
     // - flush the buffer
     // - container.append(__str.begin(), __str.end());

diff  --git a/libcxx/test/std/time/time.syn/formatter.duration.pass.cpp b/libcxx/test/std/time/time.syn/formatter.duration.pass.cpp
index 9367055fb9694cb..dbf373a19ba806b 100644
--- a/libcxx/test/std/time/time.syn/formatter.duration.pass.cpp
+++ b/libcxx/test/std/time/time.syn/formatter.duration.pass.cpp
@@ -1176,7 +1176,7 @@ static void test() {
   check_exception("End of input while parsing the modifier E", SV("{:%E"), 0ms);
   check_exception("End of input while parsing the modifier O", SV("{:%O"), 0ms);
 
-  // Make sure the the required values work, based on their minimum number of required bits per [time.syn].
+  // Make sure the required values work, based on their minimum number of required bits per [time.syn].
   check(SV("23:47:16.854775807"),
         SV("{:%T}"),
         std::chrono::nanoseconds{0x7fff'ffff'ffff'ffffll}); // 64 bit signed value max

diff  --git a/libcxxabi/src/private_typeinfo.cpp b/libcxxabi/src/private_typeinfo.cpp
index 83d1f9f130a3915..c737d96f418d8a8 100644
--- a/libcxxabi/src/private_typeinfo.cpp
+++ b/libcxxabi/src/private_typeinfo.cpp
@@ -1075,7 +1075,7 @@ __vmi_class_type_info::search_below_dst(__dynamic_cast_info* info,
                     if (info->search_done)
                         break;
                     // If we just found a dst_type with a public path to (static_ptr, static_type),
-                    //    then the only reason to continue the search is to make sure sure
+                    //    then the only reason to continue the search is to make sure
                     //    no other dst_type points to (static_ptr, static_type).
                     //    If !diamond, then we don't need to search here.
                     // if we just found a dst_type with a private path to (static_ptr, static_type),

diff  --git a/libunwind/include/mach-o/compact_unwind_encoding.h b/libunwind/include/mach-o/compact_unwind_encoding.h
index 76a9478ac93d2b0..4c48e33c3c177d9 100644
--- a/libunwind/include/mach-o/compact_unwind_encoding.h
+++ b/libunwind/include/mach-o/compact_unwind_encoding.h
@@ -372,7 +372,7 @@ enum {
 //     .quad    except_tab1
 //
 //
-// Notes: There is no need for any labels in the the __compact_unwind section.
+// Notes: There is no need for any labels in the __compact_unwind section.
 //        The use of the .set directive is to force the evaluation of the
 //        range-length at assembly time, instead of generating relocations.
 //

diff  --git a/libunwind/src/FrameHeaderCache.hpp b/libunwind/src/FrameHeaderCache.hpp
index 54d5d33c3cd7ede..e1754cb6e1e676a 100644
--- a/libunwind/src/FrameHeaderCache.hpp
+++ b/libunwind/src/FrameHeaderCache.hpp
@@ -41,7 +41,7 @@ class _LIBUNWIND_HIDDEN FrameHeaderCache {
 
   // Can't depend on the C++ standard library in libunwind, so use an array to
   // allocate the entries, and two linked lists for ordering unused and recently
-  // used entries.  FIXME: Would the the extra memory for a doubly-linked list
+  // used entries.  FIXME: Would the extra memory for a doubly-linked list
   // be better than the runtime cost of traversing a very short singly-linked
   // list on a cache miss? The entries themselves are all small and consecutive,
   // so unlikely to cause page faults when following the pointers. The memory

diff  --git a/libunwind/src/UnwindRegistersRestore.S b/libunwind/src/UnwindRegistersRestore.S
index c4471eac73fffc1..42c2488fc7cf7a6 100644
--- a/libunwind/src/UnwindRegistersRestore.S
+++ b/libunwind/src/UnwindRegistersRestore.S
@@ -673,7 +673,7 @@ DEFINE_LIBUNWIND_FUNCTION(__libunwind_Registers_arm64_jumpto)
   ldr    d30,     [x0, #0x200]
   ldr    d31,     [x0, #0x208]
 
-  // Finally, restore sp. This must be done after the the last read from the
+  // Finally, restore sp. This must be done after the last read from the
   // context struct, because it is allocated on the stack, and an exception
   // could clobber the de-allocated portion of the stack after sp has been
   // restored.