diff --git a/libcxx/test/std/algorithms/algorithms.results/out_value_result.pass.cpp b/libcxx/test/std/algorithms/algorithms.results/out_value_result.pass.cpp
index 7bdbb7f60e9a2..9f45976c29681 100644
--- a/libcxx/test/std/algorithms/algorithms.results/out_value_result.pass.cpp
+++ b/libcxx/test/std/algorithms/algorithms.results/out_value_result.pass.cpp
@@ -123,7 +123,7 @@ constexpr bool test() {
     static_assert(std::is_same_v<double, decltype(res.value)>);
   }
   {
-    // Check aggregate initiazliation
+    // Check aggregate initialization
     out_value_result<int, int> res = {1, 2};
     assert(res.out == 1);
     assert(res.value == 2);
diff --git a/libcxx/test/std/atomics/types.pass.cpp b/libcxx/test/std/atomics/types.pass.cpp
index 8737694e2a070..c979392290b35 100644
--- a/libcxx/test/std/atomics/types.pass.cpp
+++ b/libcxx/test/std/atomics/types.pass.cpp
@@ -68,7 +68,7 @@ struct test_atomic<T, /*Integral=*/true, false, false> {
 };
 
 template <class T>
-struct test_atomic<T, false, /*Foating=*/true, false> {
+struct test_atomic<T, false, /*Floating=*/true, false> {
   test_atomic() {
     using A = std::atomic<T>;
     A a;
diff --git a/libcxx/test/std/containers/associative/map/map.cons/copy_assign.pass.cpp b/libcxx/test/std/containers/associative/map/map.cons/copy_assign.pass.cpp
index e01a10b679ac6..56c6cdd7e1e99 100644
--- a/libcxx/test/std/containers/associative/map/map.cons/copy_assign.pass.cpp
+++ b/libcxx/test/std/containers/associative/map/map.cons/copy_assign.pass.cpp
@@ -70,7 +70,7 @@ template <class Alloc, class AllocatorInvariant = NoOp>
 void test_alloc(const Alloc& lhs_alloc                   = Alloc(),
                 const Alloc& rhs_alloc                   = Alloc(),
                 AllocatorInvariant check_alloc_invariant = NoOp()) {
-  {   // Test empty/non-empy map combinations
+  {   // Test empty/non-empty map combinations
     { // assign from a non-empty container into an empty one
       using V   = std::pair<const int, int>;
       using Map = std::map<int, int, std::less<int>, Alloc>;
@@ -225,7 +225,7 @@ void test_alloc(const Alloc& lhs_alloc                   = Alloc(),
     }
     check_alloc_invariant();
   }
-  { // Make a somewhat larget set to exercise the algorithm a bit
+  { // Make a somewhat larger set to exercise the algorithm a bit
     using V   = std::pair<const int, int>;
     using Map = std::map<int, int, std::less<int>, Alloc>;
 
diff --git a/libcxx/test/std/containers/associative/multimap/multimap.cons/copy_assign.pass.cpp b/libcxx/test/std/containers/associative/multimap/multimap.cons/copy_assign.pass.cpp
index 5830283e9b0c5..e52da3a4a6313 100644
--- a/libcxx/test/std/containers/associative/multimap/multimap.cons/copy_assign.pass.cpp
+++ b/libcxx/test/std/containers/associative/multimap/multimap.cons/copy_assign.pass.cpp
@@ -68,7 +68,7 @@ template <class Alloc, class AllocatorInvariant = NoOp>
 void test_alloc(const Alloc& lhs_alloc                   = Alloc(),
                 const Alloc& rhs_alloc                   = Alloc(),
                 AllocatorInvariant check_alloc_invariant = NoOp()) {
-  {   // Test empty/non-empy multimap combinations
+  {   // Test empty/non-empty multimap combinations
     { // assign from a non-empty container into an empty one
       using V   = std::pair<const int, int>;
       using Map = std::multimap<int, int, std::less<int>, Alloc>;
@@ -223,7 +223,7 @@ void test_alloc(const Alloc& lhs_alloc                   = Alloc(),
     }
     check_alloc_invariant();
   }
-  { // Make a somewhat larget set to exercise the algorithm a bit
+  { // Make a somewhat larger set to exercise the algorithm a bit
     using V   = std::pair<const int, int>;
     using Map = std::multimap<int, int, std::less<int>, Alloc>;
 
diff --git a/libcxx/test/std/containers/associative/multiset/multiset.cons/copy_assign.pass.cpp b/libcxx/test/std/containers/associative/multiset/multiset.cons/copy_assign.pass.cpp
index 8511f05ab57e4..0a5fe62eed69e 100644
--- a/libcxx/test/std/containers/associative/multiset/multiset.cons/copy_assign.pass.cpp
+++ b/libcxx/test/std/containers/associative/multiset/multiset.cons/copy_assign.pass.cpp
@@ -68,7 +68,7 @@ template <class Alloc, class AllocatorInvariant = NoOp>
 void test_alloc(const Alloc& lhs_alloc                   = Alloc(),
                 const Alloc& rhs_alloc                   = Alloc(),
                 AllocatorInvariant check_alloc_invariant = NoOp()) {
-  {   // Test empty/non-empy multiset combinations
+  {   // Test empty/non-empty multiset combinations
     { // assign from a non-empty container into an empty one
       using Set = std::multiset<int, std::less<int>, Alloc>;
 
@@ -216,7 +216,7 @@ void test_alloc(const Alloc& lhs_alloc                   = Alloc(),
       assert(std::next(orig.begin(), 3) == orig.end());
     }
     check_alloc_invariant();
-    { // Make a somewhat larget multiset to exercise the algorithm a bit
+    { // Make a somewhat larger multiset to exercise the algorithm a bit
       using Set = std::multiset<int, std::less<int>, Alloc>;
 
       Set orig(rhs_alloc);
diff --git a/libcxx/test/std/containers/associative/set/set.cons/copy_assign.pass.cpp b/libcxx/test/std/containers/associative/set/set.cons/copy_assign.pass.cpp
index 85bc4e761f2c3..dd1dbc86190f8 100644
--- a/libcxx/test/std/containers/associative/set/set.cons/copy_assign.pass.cpp
+++ b/libcxx/test/std/containers/associative/set/set.cons/copy_assign.pass.cpp
@@ -70,7 +70,7 @@ template <class Alloc, class AllocatorInvariant = NoOp>
 void test_alloc(const Alloc& lhs_alloc                   = Alloc(),
                 const Alloc& rhs_alloc                   = Alloc(),
                 AllocatorInvariant check_alloc_invariant = NoOp()) {
-  {   // Test empty/non-empy set combinations
+  {   // Test empty/non-empty set combinations
     { // assign from a non-empty container into an empty one
       using Set = std::set<int, std::less<int>, Alloc>;
 
@@ -218,7 +218,7 @@ void test_alloc(const Alloc& lhs_alloc                   = Alloc(),
       assert(std::next(orig.begin(), 3) == orig.end());
     }
     check_alloc_invariant();
-    { // Make a somewhat larget set to exercise the algorithm a bit
+    { // Make a somewhat larger set to exercise the algorithm a bit
       using Set = std::set<int, std::less<int>, Alloc>;
 
       Set orig(rhs_alloc);
diff --git a/libcxx/test/std/containers/sequences/array/array.cons/initialization.pass.cpp b/libcxx/test/std/containers/sequences/array/array.cons/initialization.pass.cpp
index 0bca4299c8516..6d5427f3e3637 100644
--- a/libcxx/test/std/containers/sequences/array/array.cons/initialization.pass.cpp
+++ b/libcxx/test/std/containers/sequences/array/array.cons/initialization.pass.cpp
@@ -20,7 +20,7 @@ struct NoDefault {
 struct test_initialization {
   template <typename T>
   TEST_CONSTEXPR_CXX14 void operator()() const {
-    // Check default initalization
+    // Check default initialization
     {
       std::array<T, 0> a0;
       (void)a0;
diff --git a/libcxx/test/std/containers/sequences/vector/vector.capacity/max_size.pass.cpp b/libcxx/test/std/containers/sequences/vector/vector.capacity/max_size.pass.cpp
index a3f44f33028e4..af57e5ffc5cf9 100644
--- a/libcxx/test/std/containers/sequences/vector/vector.capacity/max_size.pass.cpp
+++ b/libcxx/test/std/containers/sequences/vector/vector.capacity/max_size.pass.cpp
@@ -66,7 +66,7 @@ TEST_CONSTEXPR_CXX20 bool tests() {
 
 #if TEST_STD_VER >= 11
 
-  // Test with various allocators and diffrent size_type
+  // Test with various allocators and different size_type
   {
     test(std::vector<int>());
     test(std::vector<short, std::allocator<short> >());
diff --git a/libcxx/test/std/containers/sequences/vector/vector.capacity/shrink_to_fit_exceptions.pass.cpp b/libcxx/test/std/containers/sequences/vector/vector.capacity/shrink_to_fit_exceptions.pass.cpp
index 521a25fdeda0f..0bc3387e26b87 100644
--- a/libcxx/test/std/containers/sequences/vector/vector.capacity/shrink_to_fit_exceptions.pass.cpp
+++ b/libcxx/test/std/containers/sequences/vector/vector.capacity/shrink_to_fit_exceptions.pass.cpp
@@ -39,7 +39,7 @@ void test_allocation_exception_for_strong_guarantee(std::vector<T, Alloc>& v, co
   } catch (...) {
   }
 
-  // As shrink_to_fit may swallow any exceptions, we place the checks outisde the catch block.
+  // As shrink_to_fit may swallow any exceptions, we place the checks outside the catch block.
   assert(v.data() == old_data);
   assert(v.size() == old_size);
   assert(v.capacity() == old_cap);
diff --git a/libcxx/test/std/containers/views/mdspan/aligned_accessor/access.pass.cpp b/libcxx/test/std/containers/views/mdspan/aligned_accessor/access.pass.cpp
index deca1226e47ca..91a910899abcb 100644
--- a/libcxx/test/std/containers/views/mdspan/aligned_accessor/access.pass.cpp
+++ b/libcxx/test/std/containers/views/mdspan/aligned_accessor/access.pass.cpp
@@ -23,7 +23,7 @@
 #include "test_macros.h"
 
 // We are not using MinimalElementType.h because MinimalElementType is not
-// default consructible and uninitialized storage does not work in constexpr.
+// default constructible and uninitialized storage does not work in constexpr.
 
 // Same as MinimalElementType but with a defaulted default constructor
 struct MyMinimalElementType {
diff --git a/libcxx/test/std/containers/views/mdspan/aligned_accessor/offset.pass.cpp b/libcxx/test/std/containers/views/mdspan/aligned_accessor/offset.pass.cpp
index 66c30da787a8d..3ed8cd7520176 100644
--- a/libcxx/test/std/containers/views/mdspan/aligned_accessor/offset.pass.cpp
+++ b/libcxx/test/std/containers/views/mdspan/aligned_accessor/offset.pass.cpp
@@ -23,7 +23,7 @@
 #include "test_macros.h"
 
 // We are not using MinimalElementType.h because MinimalElementType is not
-// default consructible and uninitialized storage does not work in constexpr.
+// default constructible and uninitialized storage does not work in constexpr.
 
 // Same as MinimalElementType but with a defaulted default constructor
 struct MyMinimalElementType {
diff --git a/libcxx/test/std/containers/views/views.span/span.cons/initializer_list.pass.cpp b/libcxx/test/std/containers/views/views.span/span.cons/initializer_list.pass.cpp
index bc76e23fea3c0..b413b71ec9458 100644
--- a/libcxx/test/std/containers/views/views.span/span.cons/initializer_list.pass.cpp
+++ b/libcxx/test/std/containers/views/views.span/span.cons/initializer_list.pass.cpp
@@ -34,7 +34,7 @@ static_assert(!ConstElementType<std::span<int>>);
 static_assert(ConstElementType<std::span<const int, 94>>);
 static_assert(!ConstElementType<std::span<int, 94>>);
 
-// Constructor constraings
+// Constructor constraints
 
 template <typename I, typename T, std::size_t... N>
 concept HasInitializerListCtr = requires(I il) { std::span<T, N...>{il}; };
diff --git a/libcxx/test/std/input.output/filesystems/class.path/path.member/path.compare.pass.cpp b/libcxx/test/std/input.output/filesystems/class.path/path.member/path.compare.pass.cpp
index 3bebf38a2a7c3..56e35736d4f78 100644
--- a/libcxx/test/std/input.output/filesystems/class.path/path.member/path.compare.pass.cpp
+++ b/libcxx/test/std/input.output/filesystems/class.path/path.member/path.compare.pass.cpp
@@ -132,7 +132,7 @@ void test_compare_basic() {
       AssertOrderReturn<std::strong_ordering, path>();
 #endif
 
-      // check comarison results
+      // check comparison results
       assert(testComparisons(p1, p2, /*isEqual*/ E == 0, /*isLess*/ E < 0));
 #if TEST_STD_VER > 17
       assert(testOrder(p1, p2, E <=> 0));
diff --git a/libcxx/test/std/input.output/filesystems/class.rec.dir.itr/cache_refresh_iter.pass.cpp b/libcxx/test/std/input.output/filesystems/class.rec.dir.itr/cache_refresh_iter.pass.cpp
index 3d45828968de9..ff7035096e702 100644
--- a/libcxx/test/std/input.output/filesystems/class.rec.dir.itr/cache_refresh_iter.pass.cpp
+++ b/libcxx/test/std/input.output/filesystems/class.rec.dir.itr/cache_refresh_iter.pass.cpp
@@ -147,7 +147,7 @@ static void test_cached_values_in_iteration() {
     const std::set<fs::path> dir_contents(static_env.RecDirIterationList.begin(), static_env.RecDirIterationList.end());
     dir_entries = get_directory_entries_for(testDir, dir_contents);
   }
-  // Testing folder should be deleted after destoying static_test_env.
+  // Testing folder should be deleted after destroying static_test_env.
 
   for (const auto& dir_entry : dir_entries) {
     // During iteration Windows provides information only about symlink itself
diff --git a/libcxx/test/std/iterators/iterator.requirements/indirectcallable/projected/projected.compile.pass.cpp b/libcxx/test/std/iterators/iterator.requirements/indirectcallable/projected/projected.compile.pass.cpp
index 06d1171c370a5..7ab92660fb068 100644
--- a/libcxx/test/std/iterators/iterator.requirements/indirectcallable/projected/projected.compile.pass.cpp
+++ b/libcxx/test/std/iterators/iterator.requirements/indirectcallable/projected/projected.compile.pass.cpp
@@ -61,4 +61,4 @@ constexpr bool projectable = requires {
 
 static_assert(!projectable<int, void (*)(int)>); // int isn't indirectly_readable
 static_assert(!projectable<S, void (*)(int)>);   // S isn't weakly_incrementable
-static_assert(!projectable<int*, void(int)>);    // void(int) doesn't satisfy indirectly_regular_unary_invcable
+static_assert(!projectable<int*, void(int)>);    // void(int) doesn't satisfy indirectly_regular_unary_invocable
diff --git a/libcxx/test/std/iterators/stream.iterators/istream.iterator/istream.iterator.cons/copy.pass.cpp b/libcxx/test/std/iterators/stream.iterators/istream.iterator/istream.iterator.cons/copy.pass.cpp
index 050f4ac7cc6d5..7474a8d3dde96 100644
--- a/libcxx/test/std/iterators/stream.iterators/istream.iterator/istream.iterator.cons/copy.pass.cpp
+++ b/libcxx/test/std/iterators/stream.iterators/istream.iterator/istream.iterator.cons/copy.pass.cpp
@@ -27,9 +27,9 @@ TEST_CONSTEXPR_CXX14 bool test_constexpr() {
   return true;
 }
 
-struct thowing_copy_constructor {
-  thowing_copy_constructor() {}
-  thowing_copy_constructor(const thowing_copy_constructor&) TEST_NOEXCEPT_FALSE {}
+struct throwing_copy_constructor {
+  throwing_copy_constructor() {}
+  throwing_copy_constructor(const throwing_copy_constructor&) TEST_NOEXCEPT_FALSE {}
 };
 
 int main(int, char**)
@@ -43,11 +43,11 @@ int main(int, char**)
 #endif
     }
     {
-      std::istream_iterator<thowing_copy_constructor> io;
-      std::istream_iterator<thowing_copy_constructor> i = io;
-      assert(i == std::istream_iterator<thowing_copy_constructor>());
+      std::istream_iterator<throwing_copy_constructor> io;
+      std::istream_iterator<throwing_copy_constructor> i = io;
+      assert(i == std::istream_iterator<throwing_copy_constructor>());
 #if TEST_STD_VER >= 11
-      static_assert(!std::is_nothrow_copy_constructible<std::istream_iterator<thowing_copy_constructor>>::value, "");
+      static_assert(!std::is_nothrow_copy_constructible<std::istream_iterator<throwing_copy_constructor>>::value, "");
 #endif
     }
     {
diff --git a/libcxx/test/std/localization/locale.categories/category.numeric/locale.nm.put/facet.num.put.members/put_long_double.hex.pass.cpp b/libcxx/test/std/localization/locale.categories/category.numeric/locale.nm.put/facet.num.put.members/put_long_double.hex.pass.cpp
index 06a974ad1bee0..8db40b9e0dcbc 100644
--- a/libcxx/test/std/localization/locale.categories/category.numeric/locale.nm.put/facet.num.put.members/put_long_double.hex.pass.cpp
+++ b/libcxx/test/std/localization/locale.categories/category.numeric/locale.nm.put/facet.num.put.members/put_long_double.hex.pass.cpp
@@ -1858,7 +1858,7 @@ void test2() {
   // 64 mantissa bits are grouped by nibble as they are stored in the long
   // double representation (nibble aligned at the end of the least significant
   // bits). This makes 1.0L to be formatted as "0x8p-3" (where the leading
-  // bit of the mantissa is the higest bit in the 0x8 nibble), and makes
+  // bit of the mantissa is the highest bit in the 0x8 nibble), and makes
   // __LDBL_MAX__ be formatted as "0xf.fffffffffffffffp+16380".
   //
   // FreeBSD normalizes/aligns the leading bit of the mantissa as a separate
diff --git a/libcxx/test/std/numerics/c.math/hermite.pass.cpp b/libcxx/test/std/numerics/c.math/hermite.pass.cpp
index f1a37c5ddc15d..2905950942581 100644
--- a/libcxx/test/std/numerics/c.math/hermite.pass.cpp
+++ b/libcxx/test/std/numerics/c.math/hermite.pass.cpp
@@ -319,7 +319,7 @@ void test() {
       static_assert(sizeof(double) == 8);
       for (unsigned n = 0; n < get_maximal_order<Real>(); ++n) {
         // Q: Why n=111 and x=300?
-        // A: Both are chosen s.t. the first overlow occurs for some `n<get_maximal_order<Real>()`.
+        // A: Both are chosen s.t. the first overflow occurs for some `n<get_maximal_order<Real>()`.
         if (n < 111) {
           assert(std::isfinite(std::hermite(n, +300.0)));
           assert(std::isfinite(std::hermite(n, -300.0)));
diff --git a/libcxx/test/std/numerics/numarray/template.valarray/valarray.cassign/and_valarray.pass.cpp b/libcxx/test/std/numerics/numarray/template.valarray/valarray.cassign/and_valarray.pass.cpp
index 15a2b03bf84bf..594b99bc09583 100644
--- a/libcxx/test/std/numerics/numarray/template.valarray/valarray.cassign/and_valarray.pass.cpp
+++ b/libcxx/test/std/numerics/numarray/template.valarray/valarray.cassign/and_valarray.pass.cpp
@@ -21,7 +21,7 @@
 //
 // The const overloads of
 //   valarray::operator[](...) const
-// return propxy objects. These proxies are implicitly convertible to
+// return proxy objects. These proxies are implicitly convertible to
 // std::valarray.
 //
 // Validate the function works for valarray, the proxies, and __val_expr.
diff --git a/libcxx/test/std/numerics/numarray/template.valarray/valarray.cassign/divide_valarray.pass.cpp b/libcxx/test/std/numerics/numarray/template.valarray/valarray.cassign/divide_valarray.pass.cpp
index e4fe675a9ec38..8c1fb2afd96fa 100644
--- a/libcxx/test/std/numerics/numarray/template.valarray/valarray.cassign/divide_valarray.pass.cpp
+++ b/libcxx/test/std/numerics/numarray/template.valarray/valarray.cassign/divide_valarray.pass.cpp
@@ -21,7 +21,7 @@
 //
 // The const overloads of
 //   valarray::operator[](...) const
-// return propxy objects. These proxies are implicitly convertible to
+// return proxy objects. These proxies are implicitly convertible to
 // std::valarray.
 //
 // Validate the function works for valarray, the proxies, and __val_expr.
diff --git a/libcxx/test/std/numerics/numarray/template.valarray/valarray.cassign/minus_valarray.pass.cpp b/libcxx/test/std/numerics/numarray/template.valarray/valarray.cassign/minus_valarray.pass.cpp
index 54aa7fd4c269f..6e13d2618b6bb 100644
--- a/libcxx/test/std/numerics/numarray/template.valarray/valarray.cassign/minus_valarray.pass.cpp
+++ b/libcxx/test/std/numerics/numarray/template.valarray/valarray.cassign/minus_valarray.pass.cpp
@@ -21,7 +21,7 @@
 //
 // The const overloads of
 //   valarray::operator[](...) const
-// return propxy objects. These proxies are implicitly convertible to
+// return proxy objects. These proxies are implicitly convertible to
 // std::valarray.
 //
 // Validate the function works for valarray, the proxies, and __val_expr.
diff --git a/libcxx/test/std/numerics/numarray/template.valarray/valarray.cassign/modulo_valarray.pass.cpp b/libcxx/test/std/numerics/numarray/template.valarray/valarray.cassign/modulo_valarray.pass.cpp
index e52097ae68e21..1246ab35547bf 100644
--- a/libcxx/test/std/numerics/numarray/template.valarray/valarray.cassign/modulo_valarray.pass.cpp
+++ b/libcxx/test/std/numerics/numarray/template.valarray/valarray.cassign/modulo_valarray.pass.cpp
@@ -21,7 +21,7 @@
 //
 // The const overloads of
 //   valarray::operator[](...) const
-// return propxy objects. These proxies are implicitly convertible to
+// return proxy objects. These proxies are implicitly convertible to
 // std::valarray.
 //
 // Validate the function works for valarray, the proxies, and __val_expr.
diff --git a/libcxx/test/std/numerics/numarray/template.valarray/valarray.cassign/or_valarray.pass.cpp b/libcxx/test/std/numerics/numarray/template.valarray/valarray.cassign/or_valarray.pass.cpp
index 429953e272b61..9387fccbf1538 100644
--- a/libcxx/test/std/numerics/numarray/template.valarray/valarray.cassign/or_valarray.pass.cpp
+++ b/libcxx/test/std/numerics/numarray/template.valarray/valarray.cassign/or_valarray...
[truncated]