diff options
| author | Louis Dionne <ldionne.2@gmail.com> | 2023-08-31 11:52:06 -0400 |
|---|---|---|
| committer | Louis Dionne <ldionne.2@gmail.com> | 2023-08-31 11:55:10 -0400 |
| commit | b397921fc7ef4e2882b3ae9c5f12fb40daca4078 (patch) | |
| tree | 97cee7d9aea350625529902c888b12f98795bf5a /libunwind | |
| parent | ba55034a898baf728f4d78ec811664b2a154bbfe (diff) | |
| download | llvm-b397921fc7ef4e2882b3ae9c5f12fb40daca4078.zip llvm-b397921fc7ef4e2882b3ae9c5f12fb40daca4078.tar.gz llvm-b397921fc7ef4e2882b3ae9c5f12fb40daca4078.tar.bz2 | |
[runtimes] Fix some duplicate word typos
Those fixes were taken from https://reviews.llvm.org/D137338.
Diffstat (limited to 'libunwind')
| -rw-r--r-- | libunwind/include/mach-o/compact_unwind_encoding.h | 2 | ||||
| -rw-r--r-- | libunwind/src/FrameHeaderCache.hpp | 2 | ||||
| -rw-r--r-- | libunwind/src/UnwindRegistersRestore.S | 2 |
3 files changed, 3 insertions, 3 deletions
diff --git a/libunwind/include/mach-o/compact_unwind_encoding.h b/libunwind/include/mach-o/compact_unwind_encoding.h index 76a9478..4c48e33 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 54d5d33..e1754cb 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 c4471ea..42c2488 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. |