[runtimes] Fix some duplicate word typos

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

libcxx/include/__format/buffer.h

@@ -95,7 +95,7 @@ public:
   _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());

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

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),

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.
 //

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

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.