Fix typos.
Test: art/test/testrunner/testrunner.py
Change-Id: I5f5e052c940650a3adb3a8717b84260e6b306500
diff --git a/runtime/gc/heap.h b/runtime/gc/heap.h
index faa6195..9f84d6d 100644
--- a/runtime/gc/heap.h
+++ b/runtime/gc/heap.h
@@ -551,7 +551,7 @@
return total_memory - std::min(total_memory, byte_allocated);
}
- // get the space that corresponds to an object's address. Current implementation searches all
+ // Get the space that corresponds to an object's address. Current implementation searches all
// spaces in turn. If fail_ok is false then failing to find a space will cause an abort.
// TODO: consider using faster data structure like binary tree.
space::ContinuousSpace* FindContinuousSpaceFromObject(ObjPtr<mirror::Object>, bool fail_ok) const
@@ -1312,7 +1312,7 @@
AllocatorType current_allocator_;
const AllocatorType current_non_moving_allocator_;
- // Which GCs we run in order when we an allocation fails.
+ // Which GCs we run in order when an allocation fails.
std::vector<collector::GcType> gc_plan_;
// Bump pointer spaces.