Random comment typo fixes
Discovered while trying to understand this code ...
Test: Build platform.
Change-Id: I606bf8b07375513699e12f31f771c2a7677b6766
diff --git a/runtime/gc/collector/mark_sweep.cc b/runtime/gc/collector/mark_sweep.cc
index 34de83a..2dc5acc 100644
--- a/runtime/gc/collector/mark_sweep.cc
+++ b/runtime/gc/collector/mark_sweep.cc
@@ -1205,7 +1205,7 @@
}
}
}
- // Unlikely to sweep a significant amount of non_movable objects, so we do these after the after
+ // Unlikely to sweep a significant amount of non_movable objects, so we do these after
// the other alloc spaces as an optimization.
if (non_moving_space != nullptr) {
sweep_spaces.push_back(non_moving_space);
diff --git a/runtime/gc/collector/sticky_mark_sweep.cc b/runtime/gc/collector/sticky_mark_sweep.cc
index 98fdfac..b66095f 100644
--- a/runtime/gc/collector/sticky_mark_sweep.cc
+++ b/runtime/gc/collector/sticky_mark_sweep.cc
@@ -54,7 +54,7 @@
void StickyMarkSweep::MarkReachableObjects() {
// All reachable objects must be referenced by a root or a dirty card, so we can clear the mark
- // stack here since all objects in the mark stack will Get scanned by the card scanning anyways.
+ // stack here since all objects in the mark stack will get scanned by the card scanning anyways.
// TODO: Not put these objects in the mark stack in the first place.
mark_stack_->Reset();
RecursiveMarkDirtyObjects(false, accounting::CardTable::kCardDirty - 1);
diff --git a/runtime/gc/heap.cc b/runtime/gc/heap.cc
index f1685b2..6377c89 100644
--- a/runtime/gc/heap.cc
+++ b/runtime/gc/heap.cc
@@ -239,7 +239,7 @@
verify_pre_sweeping_rosalloc_(verify_pre_sweeping_rosalloc),
verify_post_gc_rosalloc_(verify_post_gc_rosalloc),
gc_stress_mode_(gc_stress_mode),
- /* For GC a lot mode, we limit the allocations stacks to be kGcAlotInterval allocations. This
+ /* For GC a lot mode, we limit the allocation stacks to be kGcAlotInterval allocations. This
* causes a lot of GC since we do a GC for alloc whenever the stack is full. When heap
* verification is enabled, we limit the size of allocation stacks to speed up their
* searching.
@@ -2932,7 +2932,7 @@
// TODO: Add handle VerifyObject.
StackHandleScope<1> hs(self);
HandleWrapperObjPtr<mirror::Object> wrapper(hs.NewHandleWrapper(obj));
- // Push our object into the reserve region of the allocaiton stack. This is only required due
+ // Push our object into the reserve region of the allocation stack. This is only required due
// to heap verification requiring that roots are live (either in the live bitmap or in the
// allocation stack).
CHECK(allocation_stack_->AtomicPushBackIgnoreGrowthLimit(obj->Ptr()));