| Index: runtime/vm/redundancy_elimination.cc
|
| diff --git a/runtime/vm/redundancy_elimination.cc b/runtime/vm/redundancy_elimination.cc
|
| index 50a8002128587996752b8bf01714133de2b31ec6..06df06ab4b404d088efff525ccdeed9f594dd401 100644
|
| --- a/runtime/vm/redundancy_elimination.cc
|
| +++ b/runtime/vm/redundancy_elimination.cc
|
| @@ -3182,7 +3182,7 @@ void AllocationSinking::ExitsCollector::CollectTransitively(Definition* 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]);
|
|
|