Fix typos (#8570)

Co-authored-by: Alon Zakai <azakai@google.com>

Author: tlively

scripts/clusterfuzz/run.py

@@ -87,7 +87,7 @@
     # Enable all features but disable ones not yet ready for fuzzing. This may
     # be a smaller set than fuzz_opt.py, as that enables a few experimental
     # flags, while here we just fuzz with d8's --wasm-staging. This should be
-    # synchonized with bundle_clusterfuzz.
+    # synchronized with bundle_clusterfuzz.
     '-all',
     '--disable-shared-everything',
     '--disable-fp16',

scripts/test/generate_atomic_spec_test.py

@@ -147,7 +147,7 @@ def func():
       )
     """
     return f''';; Memory index must come before memory ordering if present.
-;; Both immediates are optional; an ommitted memory ordering will be treated as seqcst.
+;; Both immediates are optional; an omitted memory ordering will be treated as seqcst.
 (func $test-all-ops
 {indent(newline.join(statement(template, mem_idx, mem_ptr_type, ordering) for template, (mem_idx, mem_ptr_type), ordering in all_combinations()))}
 )'''

src/analysis/lattice.h

@@ -61,7 +61,7 @@ concept Lattice = requires(const L& lattice,
 
 // The analysis framework only uses bottom elements and least upper bounds (i.e.
 // joins) directly, so lattices do not necessarily need to implement top
-// elements and greatest lower bounds (i.e. meets) to be useable, even though
+// elements and greatest lower bounds (i.e. meets) to be usable, even though
 // they are required for mathematical lattices. Implementing top elements and
 // meets does have the benefit of making a lattice generically invertable,
 // though. See lattices/inverted.h.

src/analysis/monotone-analyzer.h

@@ -22,7 +22,7 @@ template<Lattice L, TransferFunction TxFn> class MonotoneCFGAnalyzer {
   std::vector<Element> states;
 
 public:
-  // Will constuct BlockState objects corresponding to BasicBlocks from the
+  // Will construct BlockState objects corresponding to BasicBlocks from the
   // given CFG.
   MonotoneCFGAnalyzer(L& lattice, TxFn& txfn, CFG& cfg);
 

src/analysis/reaching-definitions-transfer-function.h

@@ -26,7 +26,7 @@ namespace wasm::analysis {
 
 // When collecting results, the transfer function takes the states and converts
 // it into a map of LocalGets to LocalSets which affect it. The fictitious
-// inital value LocalSetes will be converted to nullptrs.
+// initial value LocalSetes will be converted to nullptrs.
 
 class ReachingDefinitionsTransferFunction
   : public VisitorTransferFunc<ReachingDefinitionsTransferFunction,
@@ -44,7 +44,7 @@ class ReachingDefinitionsTransferFunction
   // LocalGraph members we need to update.
   LocalGraph::GetSetsMap& getSetsMap;
 
-  // Fictitious LocalSet objects to reprsent a local index obtaining its value
+  // Fictitious LocalSet objects to represent a local index obtaining its value
   // from its default initial value or parameter value.
   std::vector<LocalSet> fakeInitialValueSets;
 
@@ -54,7 +54,7 @@ class ReachingDefinitionsTransferFunction
   // Helper function which creates fictitious LocalSets for a function,
   // inserts them into fakeInitialValueSets and fakeSetPtrs. It returns a
   // vector of actual LocalSets in the function and fictitious LocalSets for
-  // use when instatitating the lattice.
+  // use when instantiating the lattice.
   static std::vector<LocalSet*>
   listLocalSets(Function* func,
                 std::vector<LocalSet>& fakeInitialValueSets,

src/binaryen-c.h

@@ -3062,7 +3062,7 @@ BINARYEN_API void BinaryenModulePrintStackIR(BinaryenModuleRef module);
 BINARYEN_API void BinaryenModulePrintAsmjs(BinaryenModuleRef module);
 
 // Validate a module, showing errors on problems.
-//  @return 0 if an error occurred, 1 if validated succesfully
+//  @return 0 if an error occurred, 1 if validated successfully
 BINARYEN_API bool BinaryenModuleValidate(BinaryenModuleRef module);
 
 // Runs the standard optimization passes on the module. Uses the currently set
@@ -3283,7 +3283,7 @@ BINARYEN_API BinaryenModuleAllocateAndWriteResult
 BinaryenModuleAllocateAndWrite(BinaryenModuleRef module,
                                const char* sourceMapUrl);
 
-// Serialize a module in s-expression form. Implicity allocates the returned
+// Serialize a module in s-expression form. Implicitly allocates the returned
 // char* with malloc(), and expects the user to free() them manually
 // once not needed anymore.
 BINARYEN_API char* BinaryenModuleAllocateAndWriteText(BinaryenModuleRef module);

src/cfg/Relooper.h

@@ -15,7 +15,7 @@
  */
 
 /*
-This is an optimized C++ implemention of the Relooper algorithm originally
+This is an optimized C++ implementation of the Relooper algorithm originally
 developed as part of Emscripten. This implementation includes optimizations
 added since the original academic paper [1] was published about it.
 

src/cfg/cfg-traversal.h

@@ -304,7 +304,7 @@ struct CFGWalker : public PostWalker<SubType, VisitorType> {
         }
       }
 
-      // Exception thrown. Note outselves so that we will create a link to each
+      // Exception thrown. Note ourselves so that we will create a link to each
       // catch within the try / each destination block within the try_table when
       // we get there.
       self->throwingInstsStack[i].push_back(self->currBasicBlock);

src/ir/ExpressionManipulator.cpp

@@ -21,7 +21,7 @@ namespace wasm::ExpressionManipulator {
 
 Expression*
 flexibleCopy(Expression* original, Module& wasm, CustomCopier custom) {
-  // Perform the copy using a stack of tasks (avoiding recusion).
+  // Perform the copy using a stack of tasks (avoiding recursion).
   struct CopyTask {
     // The thing to copy.
     Expression* original;

src/ir/child-typer.h

@@ -22,7 +22,7 @@
 
 namespace wasm {
 
-// CRTP visitor for determining constaints on the types of expression children.
+// CRTP visitor for determining constraints on the types of expression children.
 // For each child of the visited expression, calls a callback with the VarTypes
 // giving the constraint on the child:
 //