Spelling fixes e to i.

runtime/vm/redundancy_elimination.cc

 // Copyright (c) 2016, the Dart project authors.  Please see the AUTHORS file
 // for details. All rights reserved. Use of this source code is governed by a
 // BSD-style license that can be found in the LICENSE file.
 
 #include "vm/redundancy_elimination.h"
 
 #include "vm/bit_vector.h"
 #include "vm/flow_graph.h"
 #include "vm/hash_map.h"
 #include "vm/il_printer.h"
@@ skipping 3164 matching lines @@
 
 void AllocationSinking::ExitsCollector::CollectTransitively(Definition* alloc) {
   exits_.TruncateTo(0);
   worklist_.TruncateTo(0);
 
   worklist_.Add(alloc);
 
   // Note: worklist potentially will grow while we are iterating over it.
   // We are not removing allocations from the worklist not to waste space on
   // the side maintaining BitVector of already processed allocations: worklist
-  // is expected to be very small thus linear search in it is just as effecient
+  // is expected to be very small thus linear search in it is just as efficient
   // as a bitvector.
   for (intptr_t i = 0; i < worklist_.length(); i++) {
     Collect(worklist_[i]);
   }
 }
 
 
 void AllocationSinking::InsertMaterializations(Definition* alloc) {
   // Collect all fields that are written for this instance.
   ZoneGrowableArray<const Object*>* slots =
@@ skipping 181 matching lines @@
         join->phis_ = NULL;
       } else {
         join->phis_->TruncateTo(to_index);
       }
     }
   }
 }
 
 
 }  // namespace dart