Bug 1181581 - Fix some typos in comments. r=jandem

CLOSED TREE

js/src/jit/AliasAnalysis.cpp

@@ -158,7 +158,7 @@ IonSpewAliasInfo(const char* pre, MInstruction* ins, const char* post)
 // loop header if no instruction inside the loop body aliases it. To calculate
 // this efficiently, we maintain a list of maybe-invariant loads and the combined
 // alias set for all stores inside the loop. When we see the loop's backedge, this
-// information is used to mark every load we wrongly assumed to be loop invaraint as
+// information is used to mark every load we wrongly assumed to be loop invariant as
 // having an implicit dependency on the last instruction of the loop header, so that
 // it's never moved before the loop header.
 //

js/src/jit/BaselineBailouts.cpp

@@ -69,7 +69,7 @@ class BufferPointer
  * allocated portion being constructed or the existing stack).
  *
  * The abstraction handles transparent re-allocation of the heap memory when it
- * needs to be enlarged to accomodate new data.  Similarly to the C stack, the
+ * needs to be enlarged to accommodate new data.  Similarly to the C stack, the
  * data that's written to the reconstructed stack grows from high to low in memory.
  *
  * The lowest region of the allocated memory contains a BaselineBailoutInfo structure that

js/src/jit/CompileInfo.h

@@ -526,7 +526,7 @@ class CompileInfo
     // definition can be optimized away as long as we can compute its values.
     bool isRecoverableOperand(uint32_t slot) const {
         // If this script is not a function, then none of the slots are
-        // obserbavle.  If it this |slot| is not observable, thus we can always
+        // observable.  If it this |slot| is not observable, thus we can always
         // recover it.
         if (!funMaybeLazy())
             return true;

js/src/jit/Ion.cpp

@@ -3026,7 +3026,7 @@ AutoFlushICache::setRange(uintptr_t start, size_t len)
 //
 // For efficiency it is expected that all large ranges will be flushed within an
 // AutoFlushICache, so check.  If this assertion is hit then it does not necessarily
-// indicate a progam fault but it might indicate a lost opportunity to merge cache
+// indicate a program fault but it might indicate a lost opportunity to merge cache
 // flushing.  It can be corrected by wrapping the call in an AutoFlushICache to context.
 //
 // Note this can be called without TLS PerThreadData defined so this case needs

js/src/jit/IonAnalysis.cpp

@@ -1681,7 +1681,7 @@ jit::BuildDominatorTree(MIRGraph& graph)
         MBasicBlock* child = *i;
         MBasicBlock* parent = child->immediateDominator();
 
-        // Domininace is defined such that blocks always dominate themselves.
+        // Dominance is defined such that blocks always dominate themselves.
         child->addNumDominated(1);
 
         // If the block only self-dominates, it has no definite parent.

js/src/jit/SharedIC.h

@@ -746,7 +746,7 @@ class ICFallbackStub : public ICStub
     // A pointer to the location stub pointer that needs to be
     // changed to add a new "last" stub immediately before the fallback
     // stub.  This'll start out pointing to the icEntry's "firstStub_"
-    // field, and as new stubs are addd, it'll point to the current
+    // field, and as new stubs are added, it'll point to the current
     // last stub's "next_" field.
     ICStub** lastStubPtrAddr_;