Elliott Hughes | 9d5ccec | 2011-09-19 13:19:50 -0700 | [diff] [blame] | 1 | /* |
| 2 | * Copyright (C) 2008 The Android Open Source Project |
| 3 | * |
| 4 | * Licensed under the Apache License, Version 2.0 (the "License"); |
| 5 | * you may not use this file except in compliance with the License. |
| 6 | * You may obtain a copy of the License at |
| 7 | * |
| 8 | * http://www.apache.org/licenses/LICENSE-2.0 |
| 9 | * |
| 10 | * Unless required by applicable law or agreed to in writing, software |
| 11 | * distributed under the License is distributed on an "AS IS" BASIS, |
| 12 | * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied. |
| 13 | * See the License for the specific language governing permissions and |
| 14 | * limitations under the License. |
| 15 | */ |
Carl Shapiro | 1fb8620 | 2011-06-27 17:43:13 -0700 | [diff] [blame] | 16 | |
Brian Carlstrom | fc0e321 | 2013-07-17 14:40:12 -0700 | [diff] [blame] | 17 | #ifndef ART_RUNTIME_GC_HEAP_H_ |
| 18 | #define ART_RUNTIME_GC_HEAP_H_ |
Carl Shapiro | 1fb8620 | 2011-06-27 17:43:13 -0700 | [diff] [blame] | 19 | |
Elliott Hughes | c967f78 | 2012-04-16 10:23:15 -0700 | [diff] [blame] | 20 | #include <iosfwd> |
Elliott Hughes | b3bd5f0 | 2012-03-08 21:05:27 -0800 | [diff] [blame] | 21 | #include <string> |
Carl Shapiro | 58551df | 2011-07-24 03:09:51 -0700 | [diff] [blame] | 22 | #include <vector> |
| 23 | |
Ian Rogers | b0fa5dc | 2014-04-28 16:47:08 -0700 | [diff] [blame] | 24 | #include "allocator_type.h" |
Ian Rogers | ef7d42f | 2014-01-06 12:55:46 -0800 | [diff] [blame] | 25 | #include "atomic.h" |
Sameer Abu Asal | a843954 | 2013-02-14 16:06:42 -0800 | [diff] [blame] | 26 | #include "base/timing_logger.h" |
Ian Rogers | 1d54e73 | 2013-05-02 21:10:01 -0700 | [diff] [blame] | 27 | #include "gc/accounting/atomic_stack.h" |
| 28 | #include "gc/accounting/card_table.h" |
Hiroshi Yamauchi | 6f4ffe4 | 2014-01-13 12:30:44 -0800 | [diff] [blame] | 29 | #include "gc/gc_cause.h" |
Ian Rogers | 1d54e73 | 2013-05-02 21:10:01 -0700 | [diff] [blame] | 30 | #include "gc/collector/gc_type.h" |
Mathieu Chartier | 0de9f73 | 2013-11-22 17:58:48 -0800 | [diff] [blame] | 31 | #include "gc/collector_type.h" |
Brian Carlstrom | 578bbdc | 2011-07-21 14:07:47 -0700 | [diff] [blame] | 32 | #include "globals.h" |
Ian Rogers | 30fab40 | 2012-01-23 15:43:46 -0800 | [diff] [blame] | 33 | #include "gtest/gtest.h" |
Narayan Kamath | 11d9f06 | 2014-04-23 20:24:57 +0100 | [diff] [blame] | 34 | #include "instruction_set.h" |
Mathieu Chartier | c39e342 | 2013-08-07 16:41:36 -0700 | [diff] [blame] | 35 | #include "jni.h" |
Mathieu Chartier | 83c8ee0 | 2014-01-28 14:50:23 -0800 | [diff] [blame] | 36 | #include "object_callbacks.h" |
Ian Rogers | 0cfe1fb | 2011-08-26 03:29:44 -0700 | [diff] [blame] | 37 | #include "offsets.h" |
Mathieu Chartier | 39e3261 | 2013-11-12 16:28:05 -0800 | [diff] [blame] | 38 | #include "reference_queue.h" |
Mathieu Chartier | b062fdd | 2012-07-03 09:51:48 -0700 | [diff] [blame] | 39 | #include "safe_map.h" |
Mathieu Chartier | 02b6a78 | 2012-10-26 13:51:26 -0700 | [diff] [blame] | 40 | #include "thread_pool.h" |
Mathieu Chartier | 4e30541 | 2014-02-19 10:54:44 -0800 | [diff] [blame] | 41 | #include "verify_object.h" |
Carl Shapiro | 1fb8620 | 2011-06-27 17:43:13 -0700 | [diff] [blame] | 42 | |
| 43 | namespace art { |
Ian Rogers | 1d54e73 | 2013-05-02 21:10:01 -0700 | [diff] [blame] | 44 | |
Ian Rogers | 81d425b | 2012-09-27 16:03:43 -0700 | [diff] [blame] | 45 | class ConditionVariable; |
Ian Rogers | 81d425b | 2012-09-27 16:03:43 -0700 | [diff] [blame] | 46 | class Mutex; |
Ian Rogers | 40e3bac | 2012-11-20 00:09:14 -0800 | [diff] [blame] | 47 | class StackVisitor; |
Mathieu Chartier | 5301cd2 | 2012-05-31 12:11:36 -0700 | [diff] [blame] | 48 | class Thread; |
Mathieu Chartier | 357e9be | 2012-08-01 11:00:14 -0700 | [diff] [blame] | 49 | class TimingLogger; |
Carl Shapiro | 69759ea | 2011-07-21 18:13:35 -0700 | [diff] [blame] | 50 | |
Ian Rogers | 1d54e73 | 2013-05-02 21:10:01 -0700 | [diff] [blame] | 51 | namespace mirror { |
| 52 | class Class; |
| 53 | class Object; |
| 54 | } // namespace mirror |
| 55 | |
| 56 | namespace gc { |
| 57 | namespace accounting { |
| 58 | class HeapBitmap; |
| 59 | class ModUnionTable; |
Hiroshi Yamauchi | 38e68e9 | 2014-03-07 13:59:08 -0800 | [diff] [blame] | 60 | class RememberedSet; |
Ian Rogers | 1d54e73 | 2013-05-02 21:10:01 -0700 | [diff] [blame] | 61 | } // namespace accounting |
| 62 | |
| 63 | namespace collector { |
Hiroshi Yamauchi | d5307ec | 2014-03-27 21:07:51 -0700 | [diff] [blame] | 64 | class ConcurrentCopying; |
Ian Rogers | 1d54e73 | 2013-05-02 21:10:01 -0700 | [diff] [blame] | 65 | class GarbageCollector; |
| 66 | class MarkSweep; |
Mathieu Chartier | 590fee9 | 2013-09-13 13:46:47 -0700 | [diff] [blame] | 67 | class SemiSpace; |
Ian Rogers | 1d54e73 | 2013-05-02 21:10:01 -0700 | [diff] [blame] | 68 | } // namespace collector |
| 69 | |
| 70 | namespace space { |
| 71 | class AllocSpace; |
Mathieu Chartier | 590fee9 | 2013-09-13 13:46:47 -0700 | [diff] [blame] | 72 | class BumpPointerSpace; |
Ian Rogers | 1d54e73 | 2013-05-02 21:10:01 -0700 | [diff] [blame] | 73 | class DiscontinuousSpace; |
| 74 | class DlMallocSpace; |
| 75 | class ImageSpace; |
| 76 | class LargeObjectSpace; |
Hiroshi Yamauchi | cf58d4a | 2013-09-26 14:21:22 -0700 | [diff] [blame] | 77 | class MallocSpace; |
| 78 | class RosAllocSpace; |
Ian Rogers | 1d54e73 | 2013-05-02 21:10:01 -0700 | [diff] [blame] | 79 | class Space; |
| 80 | class SpaceTest; |
Mathieu Chartier | 590fee9 | 2013-09-13 13:46:47 -0700 | [diff] [blame] | 81 | class ContinuousMemMapAllocSpace; |
Ian Rogers | 1d54e73 | 2013-05-02 21:10:01 -0700 | [diff] [blame] | 82 | } // namespace space |
Mathieu Chartier | b062fdd | 2012-07-03 09:51:48 -0700 | [diff] [blame] | 83 | |
Mathieu Chartier | d22d548 | 2012-11-06 17:14:12 -0800 | [diff] [blame] | 84 | class AgeCardVisitor { |
| 85 | public: |
Brian Carlstrom | df62950 | 2013-07-17 22:39:56 -0700 | [diff] [blame] | 86 | byte operator()(byte card) const { |
Ian Rogers | 1d54e73 | 2013-05-02 21:10:01 -0700 | [diff] [blame] | 87 | if (card == accounting::CardTable::kCardDirty) { |
Mathieu Chartier | d22d548 | 2012-11-06 17:14:12 -0800 | [diff] [blame] | 88 | return card - 1; |
| 89 | } else { |
| 90 | return 0; |
| 91 | } |
| 92 | } |
| 93 | }; |
| 94 | |
Hiroshi Yamauchi | cf58d4a | 2013-09-26 14:21:22 -0700 | [diff] [blame] | 95 | // If true, use rosalloc/RosAllocSpace instead of dlmalloc/DlMallocSpace |
Hiroshi Yamauchi | d31fb97 | 2013-11-19 11:08:27 -0800 | [diff] [blame] | 96 | static constexpr bool kUseRosAlloc = true; |
Hiroshi Yamauchi | cf58d4a | 2013-09-26 14:21:22 -0700 | [diff] [blame] | 97 | |
Hiroshi Yamauchi | f5b0e20 | 2014-02-11 17:02:22 -0800 | [diff] [blame] | 98 | // If true, use thread-local allocation stack. |
| 99 | static constexpr bool kUseThreadLocalAllocationStack = true; |
| 100 | |
Mathieu Chartier | ca2a24d | 2013-11-25 15:12:12 -0800 | [diff] [blame] | 101 | // The process state passed in from the activity manager, used to determine when to do trimming |
| 102 | // and compaction. |
| 103 | enum ProcessState { |
| 104 | kProcessStateJankPerceptible = 0, |
| 105 | kProcessStateJankImperceptible = 1, |
| 106 | }; |
Mathieu Chartier | e6da9af | 2013-12-16 11:54:42 -0800 | [diff] [blame] | 107 | std::ostream& operator<<(std::ostream& os, const ProcessState& process_state); |
Mathieu Chartier | ca2a24d | 2013-11-25 15:12:12 -0800 | [diff] [blame] | 108 | |
Mathieu Chartier | 7bf9f19 | 2014-04-04 11:09:41 -0700 | [diff] [blame] | 109 | std::ostream& operator<<(std::ostream& os, const RootType& root_type); |
| 110 | |
Ian Rogers | 50b35e2 | 2012-10-04 10:09:15 -0700 | [diff] [blame] | 111 | class Heap { |
Carl Shapiro | 1fb8620 | 2011-06-27 17:43:13 -0700 | [diff] [blame] | 112 | public: |
Mathieu Chartier | 590fee9 | 2013-09-13 13:46:47 -0700 | [diff] [blame] | 113 | // If true, measure the total allocation time. |
| 114 | static constexpr bool kMeasureAllocationTime = false; |
| 115 | // Primitive arrays larger than this size are put in the large object space. |
Mathieu Chartier | bd0a653 | 2014-02-27 11:14:21 -0800 | [diff] [blame] | 116 | static constexpr size_t kDefaultLargeObjectThreshold = 3 * kPageSize; |
Mathieu Chartier | 590fee9 | 2013-09-13 13:46:47 -0700 | [diff] [blame] | 117 | |
Hiroshi Yamauchi | 5ccd498 | 2014-03-11 12:19:04 -0700 | [diff] [blame] | 118 | static constexpr size_t kDefaultStartingSize = kPageSize; |
Mathieu Chartier | 720ef76 | 2013-08-17 14:46:54 -0700 | [diff] [blame] | 119 | static constexpr size_t kDefaultInitialSize = 2 * MB; |
| 120 | static constexpr size_t kDefaultMaximumSize = 32 * MB; |
| 121 | static constexpr size_t kDefaultMaxFree = 2 * MB; |
| 122 | static constexpr size_t kDefaultMinFree = kDefaultMaxFree / 4; |
Mathieu Chartier | 2775ee4 | 2013-08-20 17:43:47 -0700 | [diff] [blame] | 123 | static constexpr size_t kDefaultLongPauseLogThreshold = MsToNs(5); |
| 124 | static constexpr size_t kDefaultLongGCLogThreshold = MsToNs(100); |
Mathieu Chartier | 692fafd | 2013-11-29 17:24:40 -0800 | [diff] [blame] | 125 | static constexpr size_t kDefaultTLABSize = 256 * KB; |
Mathieu Chartier | 720ef76 | 2013-08-17 14:46:54 -0700 | [diff] [blame] | 126 | static constexpr double kDefaultTargetUtilization = 0.5; |
Mathieu Chartier | 2f8da3e | 2014-04-15 15:37:02 -0700 | [diff] [blame] | 127 | static constexpr double kDefaultHeapGrowthMultiplier = 2.0; |
Mathieu Chartier | 0051be6 | 2012-10-12 17:47:11 -0700 | [diff] [blame] | 128 | |
Mathieu Chartier | 155dfe9 | 2012-10-09 14:24:49 -0700 | [diff] [blame] | 129 | // Used so that we don't overflow the allocation time atomic integer. |
Mathieu Chartier | 720ef76 | 2013-08-17 14:46:54 -0700 | [diff] [blame] | 130 | static constexpr size_t kTimeAdjust = 1024; |
Carl Shapiro | 69759ea | 2011-07-21 18:13:35 -0700 | [diff] [blame] | 131 | |
Mathieu Chartier | 7bf52d2 | 2014-03-13 14:46:09 -0700 | [diff] [blame] | 132 | // How often we allow heap trimming to happen (nanoseconds). |
Mathieu Chartier | a5f9de0 | 2014-02-28 16:48:42 -0800 | [diff] [blame] | 133 | static constexpr uint64_t kHeapTrimWait = MsToNs(5000); |
Mathieu Chartier | 7bf52d2 | 2014-03-13 14:46:09 -0700 | [diff] [blame] | 134 | // How long we wait after a transition request to perform a collector transition (nanoseconds). |
| 135 | static constexpr uint64_t kCollectorTransitionWait = MsToNs(5000); |
Mathieu Chartier | a5f9de0 | 2014-02-28 16:48:42 -0800 | [diff] [blame] | 136 | |
Brian Carlstrom | 58ae941 | 2011-10-04 00:56:06 -0700 | [diff] [blame] | 137 | // Create a heap with the requested sizes. The possible empty |
| 138 | // image_file_names names specify Spaces to load based on |
| 139 | // ImageWriter output. |
Mathieu Chartier | 0051be6 | 2012-10-12 17:47:11 -0700 | [diff] [blame] | 140 | explicit Heap(size_t initial_size, size_t growth_limit, size_t min_free, |
Mathieu Chartier | 2f8da3e | 2014-04-15 15:37:02 -0700 | [diff] [blame] | 141 | size_t max_free, double target_utilization, |
| 142 | double foreground_heap_growth_multiplier, size_t capacity, |
Mathieu Chartier | e6da9af | 2013-12-16 11:54:42 -0800 | [diff] [blame] | 143 | const std::string& original_image_file_name, |
Narayan Kamath | 11d9f06 | 2014-04-23 20:24:57 +0100 | [diff] [blame] | 144 | const InstructionSet image_instruction_set, |
Mathieu Chartier | 31f4414 | 2014-04-08 14:40:03 -0700 | [diff] [blame] | 145 | CollectorType foreground_collector_type, CollectorType background_collector_type, |
Mathieu Chartier | 2775ee4 | 2013-08-20 17:43:47 -0700 | [diff] [blame] | 146 | size_t parallel_gc_threads, size_t conc_gc_threads, bool low_memory_mode, |
Mathieu Chartier | ff3b24a | 2013-11-22 16:04:25 -0800 | [diff] [blame] | 147 | size_t long_pause_threshold, size_t long_gc_threshold, |
Mathieu Chartier | 6f365cc | 2014-04-23 12:42:27 -0700 | [diff] [blame] | 148 | bool ignore_max_footprint, bool use_tlab, |
| 149 | bool verify_pre_gc_heap, bool verify_pre_sweeping_heap, bool verify_post_gc_heap, |
| 150 | bool verify_pre_gc_rosalloc, bool verify_pre_sweeping_rosalloc, |
Hiroshi Yamauchi | a4adbfd | 2014-02-04 18:12:17 -0800 | [diff] [blame] | 151 | bool verify_post_gc_rosalloc); |
Carl Shapiro | 61e019d | 2011-07-14 16:53:09 -0700 | [diff] [blame] | 152 | |
Elliott Hughes | b3bd5f0 | 2012-03-08 21:05:27 -0800 | [diff] [blame] | 153 | ~Heap(); |
Brian Carlstrom | a7f4f48 | 2011-07-17 17:01:34 -0700 | [diff] [blame] | 154 | |
Brian Carlstrom | a40f9bc | 2011-07-26 21:26:07 -0700 | [diff] [blame] | 155 | // Allocates and initializes storage for an object instance. |
Hiroshi Yamauchi | 4cd662e | 2014-04-03 16:28:10 -0700 | [diff] [blame] | 156 | template <bool kInstrumented, typename PreFenceVisitor> |
Ian Rogers | 6fac447 | 2014-02-25 17:01:10 -0800 | [diff] [blame] | 157 | mirror::Object* AllocObject(Thread* self, mirror::Class* klass, size_t num_bytes, |
Hiroshi Yamauchi | 4cd662e | 2014-04-03 16:28:10 -0700 | [diff] [blame] | 158 | const PreFenceVisitor& pre_fence_visitor) |
Hiroshi Yamauchi | 3b4c189 | 2013-09-12 21:33:12 -0700 | [diff] [blame] | 159 | SHARED_LOCKS_REQUIRED(Locks::mutator_lock_) { |
Mathieu Chartier | 692fafd | 2013-11-29 17:24:40 -0800 | [diff] [blame] | 160 | return AllocObjectWithAllocator<kInstrumented, true>(self, klass, num_bytes, |
Ian Rogers | 6fac447 | 2014-02-25 17:01:10 -0800 | [diff] [blame] | 161 | GetCurrentAllocator(), |
| 162 | pre_fence_visitor); |
Hiroshi Yamauchi | 3b4c189 | 2013-09-12 21:33:12 -0700 | [diff] [blame] | 163 | } |
Ian Rogers | 6fac447 | 2014-02-25 17:01:10 -0800 | [diff] [blame] | 164 | |
Hiroshi Yamauchi | 4cd662e | 2014-04-03 16:28:10 -0700 | [diff] [blame] | 165 | template <bool kInstrumented, typename PreFenceVisitor> |
Ian Rogers | 6fac447 | 2014-02-25 17:01:10 -0800 | [diff] [blame] | 166 | mirror::Object* AllocNonMovableObject(Thread* self, mirror::Class* klass, size_t num_bytes, |
Hiroshi Yamauchi | 4cd662e | 2014-04-03 16:28:10 -0700 | [diff] [blame] | 167 | const PreFenceVisitor& pre_fence_visitor) |
Mathieu Chartier | 590fee9 | 2013-09-13 13:46:47 -0700 | [diff] [blame] | 168 | SHARED_LOCKS_REQUIRED(Locks::mutator_lock_) { |
Mathieu Chartier | 692fafd | 2013-11-29 17:24:40 -0800 | [diff] [blame] | 169 | return AllocObjectWithAllocator<kInstrumented, true>(self, klass, num_bytes, |
Ian Rogers | 6fac447 | 2014-02-25 17:01:10 -0800 | [diff] [blame] | 170 | GetCurrentNonMovingAllocator(), |
| 171 | pre_fence_visitor); |
Mathieu Chartier | 590fee9 | 2013-09-13 13:46:47 -0700 | [diff] [blame] | 172 | } |
Ian Rogers | 6fac447 | 2014-02-25 17:01:10 -0800 | [diff] [blame] | 173 | |
Hiroshi Yamauchi | 4cd662e | 2014-04-03 16:28:10 -0700 | [diff] [blame] | 174 | template <bool kInstrumented, bool kCheckLargeObject, typename PreFenceVisitor> |
Mathieu Chartier | 1febddf | 2013-11-20 12:33:14 -0800 | [diff] [blame] | 175 | ALWAYS_INLINE mirror::Object* AllocObjectWithAllocator( |
| 176 | Thread* self, mirror::Class* klass, size_t byte_count, AllocatorType allocator, |
Hiroshi Yamauchi | 4cd662e | 2014-04-03 16:28:10 -0700 | [diff] [blame] | 177 | const PreFenceVisitor& pre_fence_visitor) |
Mathieu Chartier | 590fee9 | 2013-09-13 13:46:47 -0700 | [diff] [blame] | 178 | SHARED_LOCKS_REQUIRED(Locks::mutator_lock_); |
Mathieu Chartier | cbb2d20 | 2013-11-14 17:45:16 -0800 | [diff] [blame] | 179 | |
| 180 | AllocatorType GetCurrentAllocator() const { |
| 181 | return current_allocator_; |
| 182 | } |
| 183 | |
| 184 | AllocatorType GetCurrentNonMovingAllocator() const { |
| 185 | return current_non_moving_allocator_; |
| 186 | } |
Hiroshi Yamauchi | 3b4c189 | 2013-09-12 21:33:12 -0700 | [diff] [blame] | 187 | |
Mathieu Chartier | 590fee9 | 2013-09-13 13:46:47 -0700 | [diff] [blame] | 188 | // Visit all of the live objects in the heap. |
Mathieu Chartier | 83c8ee0 | 2014-01-28 14:50:23 -0800 | [diff] [blame] | 189 | void VisitObjects(ObjectCallback callback, void* arg) |
Mathieu Chartier | 590fee9 | 2013-09-13 13:46:47 -0700 | [diff] [blame] | 190 | SHARED_LOCKS_REQUIRED(Locks::heap_bitmap_lock_, Locks::mutator_lock_); |
| 191 | |
Mathieu Chartier | c645f1d | 2014-03-06 18:11:53 -0800 | [diff] [blame] | 192 | void CheckPreconditionsForAllocObject(mirror::Class* c, size_t byte_count) |
Hiroshi Yamauchi | 3b4c189 | 2013-09-12 21:33:12 -0700 | [diff] [blame] | 193 | SHARED_LOCKS_REQUIRED(Locks::mutator_lock_); |
| 194 | void ThrowOutOfMemoryError(size_t byte_count, bool large_object_allocation); |
Brian Carlstrom | a7f4f48 | 2011-07-17 17:01:34 -0700 | [diff] [blame] | 195 | |
Ian Rogers | 1eb512d | 2013-10-18 15:42:20 -0700 | [diff] [blame] | 196 | void RegisterNativeAllocation(JNIEnv* env, int bytes); |
| 197 | void RegisterNativeFree(JNIEnv* env, int bytes); |
Mathieu Chartier | 987ccff | 2013-07-08 11:05:21 -0700 | [diff] [blame] | 198 | |
Mathieu Chartier | 5048223 | 2013-11-21 11:48:14 -0800 | [diff] [blame] | 199 | // Change the allocator, updates entrypoints. |
Mathieu Chartier | d889178 | 2014-03-02 13:28:37 -0800 | [diff] [blame] | 200 | void ChangeAllocator(AllocatorType allocator) |
| 201 | EXCLUSIVE_LOCKS_REQUIRED(Locks::mutator_lock_) |
| 202 | LOCKS_EXCLUDED(Locks::runtime_shutdown_lock_); |
Mathieu Chartier | 5048223 | 2013-11-21 11:48:14 -0800 | [diff] [blame] | 203 | |
Mathieu Chartier | e6da9af | 2013-12-16 11:54:42 -0800 | [diff] [blame] | 204 | // Transition the garbage collector during runtime, may copy objects from one space to another. |
| 205 | void TransitionCollector(CollectorType collector_type); |
| 206 | |
Mathieu Chartier | 0de9f73 | 2013-11-22 17:58:48 -0800 | [diff] [blame] | 207 | // Change the collector to be one of the possible options (MS, CMS, SS). |
Mathieu Chartier | d889178 | 2014-03-02 13:28:37 -0800 | [diff] [blame] | 208 | void ChangeCollector(CollectorType collector_type) |
| 209 | EXCLUSIVE_LOCKS_REQUIRED(Locks::mutator_lock_); |
Mathieu Chartier | 0de9f73 | 2013-11-22 17:58:48 -0800 | [diff] [blame] | 210 | |
Ian Rogers | 04d7aa9 | 2013-03-16 14:29:17 -0700 | [diff] [blame] | 211 | // The given reference is believed to be to an object in the Java heap, check the soundness of it. |
Mathieu Chartier | 4e30541 | 2014-02-19 10:54:44 -0800 | [diff] [blame] | 212 | // TODO: NO_THREAD_SAFETY_ANALYSIS since we call this everywhere and it is impossible to find a |
| 213 | // proper lock ordering for it. |
| 214 | void VerifyObjectBody(mirror::Object* o) NO_THREAD_SAFETY_ANALYSIS; |
Ian Rogers | 408f79a | 2011-08-23 18:22:33 -0700 | [diff] [blame] | 215 | |
Ian Rogers | 04d7aa9 | 2013-03-16 14:29:17 -0700 | [diff] [blame] | 216 | // Check sanity of all live references. |
Ian Rogers | f0bbeab | 2012-10-10 18:26:27 -0700 | [diff] [blame] | 217 | void VerifyHeap() LOCKS_EXCLUDED(Locks::heap_bitmap_lock_); |
Mathieu Chartier | c7b83a0 | 2012-09-11 18:07:39 -0700 | [diff] [blame] | 218 | bool VerifyHeapReferences() |
Mathieu Chartier | c22c59e | 2014-02-24 15:16:06 -0800 | [diff] [blame] | 219 | EXCLUSIVE_LOCKS_REQUIRED(Locks::heap_bitmap_lock_, Locks::mutator_lock_); |
Mathieu Chartier | c7b83a0 | 2012-09-11 18:07:39 -0700 | [diff] [blame] | 220 | bool VerifyMissingCardMarks() |
Mathieu Chartier | c22c59e | 2014-02-24 15:16:06 -0800 | [diff] [blame] | 221 | EXCLUSIVE_LOCKS_REQUIRED(Locks::heap_bitmap_lock_, Locks::mutator_lock_); |
Ian Rogers | 0cfe1fb | 2011-08-26 03:29:44 -0700 | [diff] [blame] | 222 | |
Elliott Hughes | 6a5bd49 | 2011-10-28 14:33:57 -0700 | [diff] [blame] | 223 | // A weaker test than IsLiveObject or VerifyObject that doesn't require the heap lock, |
Elliott Hughes | a250199 | 2011-08-26 19:39:54 -0700 | [diff] [blame] | 224 | // and doesn't abort on error, allowing the caller to report more |
| 225 | // meaningful diagnostics. |
Mathieu Chartier | d68ac70 | 2014-02-11 14:50:51 -0800 | [diff] [blame] | 226 | bool IsValidObjectAddress(const mirror::Object* obj) const |
| 227 | SHARED_LOCKS_REQUIRED(Locks::mutator_lock_); |
Mathieu Chartier | 590fee9 | 2013-09-13 13:46:47 -0700 | [diff] [blame] | 228 | |
Mathieu Chartier | d68ac70 | 2014-02-11 14:50:51 -0800 | [diff] [blame] | 229 | // Faster alternative to IsHeapAddress since finding if an object is in the large object space is |
| 230 | // very slow. |
| 231 | bool IsNonDiscontinuousSpaceHeapAddress(const mirror::Object* obj) const |
| 232 | SHARED_LOCKS_REQUIRED(Locks::mutator_lock_); |
Elliott Hughes | b3bd5f0 | 2012-03-08 21:05:27 -0800 | [diff] [blame] | 233 | |
Elliott Hughes | 6a5bd49 | 2011-10-28 14:33:57 -0700 | [diff] [blame] | 234 | // Returns true if 'obj' is a live heap object, false otherwise (including for invalid addresses). |
| 235 | // Requires the heap lock to be held. |
Ian Rogers | ef7d42f | 2014-01-06 12:55:46 -0800 | [diff] [blame] | 236 | bool IsLiveObjectLocked(mirror::Object* obj, bool search_allocation_stack = true, |
Mathieu Chartier | 0f72e41 | 2013-09-06 16:40:01 -0700 | [diff] [blame] | 237 | bool search_live_stack = true, bool sorted = false) |
Ian Rogers | ef7d42f | 2014-01-06 12:55:46 -0800 | [diff] [blame] | 238 | SHARED_LOCKS_REQUIRED(Locks::heap_bitmap_lock_, Locks::mutator_lock_); |
Elliott Hughes | a250199 | 2011-08-26 19:39:54 -0700 | [diff] [blame] | 239 | |
Mathieu Chartier | 590fee9 | 2013-09-13 13:46:47 -0700 | [diff] [blame] | 240 | // Returns true if there is any chance that the object (obj) will move. |
| 241 | bool IsMovableObject(const mirror::Object* obj) const; |
| 242 | |
Mathieu Chartier | 1d27b34 | 2014-01-28 12:51:09 -0800 | [diff] [blame] | 243 | // Enables us to compacting GC until objects are released. |
| 244 | void IncrementDisableMovingGC(Thread* self); |
| 245 | void DecrementDisableMovingGC(Thread* self); |
Mathieu Chartier | 590fee9 | 2013-09-13 13:46:47 -0700 | [diff] [blame] | 246 | |
Mathieu Chartier | 4aeec17 | 2014-03-27 16:09:46 -0700 | [diff] [blame] | 247 | // Clear all of the mark bits, doesn't clear bitmaps which have the same live bits as mark bits. |
| 248 | void ClearMarkedObjects() EXCLUSIVE_LOCKS_REQUIRED(Locks::heap_bitmap_lock_); |
| 249 | |
Carl Shapiro | 69759ea | 2011-07-21 18:13:35 -0700 | [diff] [blame] | 250 | // Initiates an explicit garbage collection. |
Mathieu Chartier | 412c7fc | 2014-02-07 12:18:39 -0800 | [diff] [blame] | 251 | void CollectGarbage(bool clear_soft_references); |
Carl Shapiro | 69759ea | 2011-07-21 18:13:35 -0700 | [diff] [blame] | 252 | |
Mathieu Chartier | 7664f5c | 2012-06-08 18:15:32 -0700 | [diff] [blame] | 253 | // Does a concurrent GC, should only be called by the GC daemon thread |
| 254 | // through runtime. |
Ian Rogers | f0bbeab | 2012-10-10 18:26:27 -0700 | [diff] [blame] | 255 | void ConcurrentGC(Thread* self) LOCKS_EXCLUDED(Locks::runtime_shutdown_lock_); |
Mathieu Chartier | 7664f5c | 2012-06-08 18:15:32 -0700 | [diff] [blame] | 256 | |
Elliott Hughes | ec0f83d | 2013-01-15 16:54:08 -0800 | [diff] [blame] | 257 | // Implements VMDebug.countInstancesOfClass and JDWP VM_InstanceCount. |
| 258 | // The boolean decides whether to use IsAssignableFrom or == when comparing classes. |
Ian Rogers | 2dd0e2c | 2013-01-24 12:42:14 -0800 | [diff] [blame] | 259 | void CountInstances(const std::vector<mirror::Class*>& classes, bool use_is_assignable_from, |
Elliott Hughes | ec0f83d | 2013-01-15 16:54:08 -0800 | [diff] [blame] | 260 | uint64_t* counts) |
Ian Rogers | b726dcb | 2012-09-05 08:57:23 -0700 | [diff] [blame] | 261 | LOCKS_EXCLUDED(Locks::heap_bitmap_lock_) |
| 262 | SHARED_LOCKS_REQUIRED(Locks::mutator_lock_); |
Elliott Hughes | 3b78c94 | 2013-01-15 17:35:41 -0800 | [diff] [blame] | 263 | // Implements JDWP RT_Instances. |
Ian Rogers | 2dd0e2c | 2013-01-24 12:42:14 -0800 | [diff] [blame] | 264 | void GetInstances(mirror::Class* c, int32_t max_count, std::vector<mirror::Object*>& instances) |
Elliott Hughes | 3b78c94 | 2013-01-15 17:35:41 -0800 | [diff] [blame] | 265 | LOCKS_EXCLUDED(Locks::heap_bitmap_lock_) |
| 266 | SHARED_LOCKS_REQUIRED(Locks::mutator_lock_); |
Elliott Hughes | 0cbaff5 | 2013-01-16 15:28:01 -0800 | [diff] [blame] | 267 | // Implements JDWP OR_ReferringObjects. |
Ian Rogers | 2dd0e2c | 2013-01-24 12:42:14 -0800 | [diff] [blame] | 268 | void GetReferringObjects(mirror::Object* o, int32_t max_count, std::vector<mirror::Object*>& referring_objects) |
Elliott Hughes | 0cbaff5 | 2013-01-16 15:28:01 -0800 | [diff] [blame] | 269 | LOCKS_EXCLUDED(Locks::heap_bitmap_lock_) |
| 270 | SHARED_LOCKS_REQUIRED(Locks::mutator_lock_); |
Elliott Hughes | 9d5ccec | 2011-09-19 13:19:50 -0700 | [diff] [blame] | 271 | |
Ian Rogers | 3bb17a6 | 2012-01-27 23:56:44 -0800 | [diff] [blame] | 272 | // Removes the growth limit on the alloc space so it may grow to its maximum capacity. Used to |
| 273 | // implement dalvik.system.VMRuntime.clearGrowthLimit. |
Elliott Hughes | b3bd5f0 | 2012-03-08 21:05:27 -0800 | [diff] [blame] | 274 | void ClearGrowthLimit(); |
jeffhao | c116070 | 2011-10-27 15:48:45 -0700 | [diff] [blame] | 275 | |
Ian Rogers | 30fab40 | 2012-01-23 15:43:46 -0800 | [diff] [blame] | 276 | // Target ideal heap utilization ratio, implements |
| 277 | // dalvik.system.VMRuntime.getTargetHeapUtilization. |
Mathieu Chartier | 0051be6 | 2012-10-12 17:47:11 -0700 | [diff] [blame] | 278 | double GetTargetHeapUtilization() const { |
| 279 | return target_utilization_; |
| 280 | } |
Mathieu Chartier | 155dfe9 | 2012-10-09 14:24:49 -0700 | [diff] [blame] | 281 | |
Mathieu Chartier | 0a9dc05 | 2013-07-25 11:01:28 -0700 | [diff] [blame] | 282 | // Data structure memory usage tracking. |
| 283 | void RegisterGCAllocation(size_t bytes); |
| 284 | void RegisterGCDeAllocation(size_t bytes); |
| 285 | |
Mathieu Chartier | 1b54f9c | 2014-04-30 16:45:02 -0700 | [diff] [blame] | 286 | // Set the heap's private space pointers to be the same as the space based on it's type. Public |
| 287 | // due to usage by tests. |
| 288 | void SetSpaceAsDefault(space::ContinuousSpace* continuous_space) |
Mathieu Chartier | 73d1e17 | 2014-04-11 17:53:48 -0700 | [diff] [blame] | 289 | LOCKS_EXCLUDED(Locks::heap_bitmap_lock_); |
Mathieu Chartier | 1b54f9c | 2014-04-30 16:45:02 -0700 | [diff] [blame] | 290 | void AddSpace(space::Space* space) LOCKS_EXCLUDED(Locks::heap_bitmap_lock_); |
| 291 | void RemoveSpace(space::Space* space) LOCKS_EXCLUDED(Locks::heap_bitmap_lock_); |
Mathieu Chartier | 73d1e17 | 2014-04-11 17:53:48 -0700 | [diff] [blame] | 292 | |
Ian Rogers | 30fab40 | 2012-01-23 15:43:46 -0800 | [diff] [blame] | 293 | // Set target ideal heap utilization ratio, implements |
| 294 | // dalvik.system.VMRuntime.setTargetHeapUtilization. |
Mathieu Chartier | 155dfe9 | 2012-10-09 14:24:49 -0700 | [diff] [blame] | 295 | void SetTargetHeapUtilization(float target); |
Ian Rogers | 3bb17a6 | 2012-01-27 23:56:44 -0800 | [diff] [blame] | 296 | |
| 297 | // For the alloc space, sets the maximum number of bytes that the heap is allowed to allocate |
| 298 | // from the system. Doesn't allow the space to exceed its growth limit. |
Elliott Hughes | b3bd5f0 | 2012-03-08 21:05:27 -0800 | [diff] [blame] | 299 | void SetIdealFootprint(size_t max_allowed_footprint); |
Elliott Hughes | 7ede61e | 2011-09-14 18:18:06 -0700 | [diff] [blame] | 300 | |
Mathieu Chartier | 590fee9 | 2013-09-13 13:46:47 -0700 | [diff] [blame] | 301 | // Blocks the caller until the garbage collector becomes idle and returns the type of GC we |
| 302 | // waited for. |
Mathieu Chartier | 89a201e | 2014-05-02 10:27:26 -0700 | [diff] [blame] | 303 | collector::GcType WaitForGcToComplete(GcCause cause, Thread* self) |
| 304 | LOCKS_EXCLUDED(gc_complete_lock_); |
Carl Shapiro | 69759ea | 2011-07-21 18:13:35 -0700 | [diff] [blame] | 305 | |
Mathieu Chartier | ca2a24d | 2013-11-25 15:12:12 -0800 | [diff] [blame] | 306 | // Update the heap's process state to a new value, may cause compaction to occur. |
| 307 | void UpdateProcessState(ProcessState process_state); |
| 308 | |
Ian Rogers | 1d54e73 | 2013-05-02 21:10:01 -0700 | [diff] [blame] | 309 | const std::vector<space::ContinuousSpace*>& GetContinuousSpaces() const { |
| 310 | return continuous_spaces_; |
Mathieu Chartier | 2b82db4 | 2012-11-14 17:29:05 -0800 | [diff] [blame] | 311 | } |
| 312 | |
Ian Rogers | 1d54e73 | 2013-05-02 21:10:01 -0700 | [diff] [blame] | 313 | const std::vector<space::DiscontinuousSpace*>& GetDiscontinuousSpaces() const { |
| 314 | return discontinuous_spaces_; |
Carl Shapiro | 58551df | 2011-07-24 03:09:51 -0700 | [diff] [blame] | 315 | } |
Carl Shapiro | 61e019d | 2011-07-14 16:53:09 -0700 | [diff] [blame] | 316 | |
Mathieu Chartier | 39e3261 | 2013-11-12 16:28:05 -0800 | [diff] [blame] | 317 | static mirror::Object* PreserveSoftReferenceCallback(mirror::Object* obj, void* arg); |
Mathieu Chartier | 1ad2784 | 2014-03-19 17:08:17 -0700 | [diff] [blame] | 318 | void ProcessSoftReferences(TimingLogger& timings, bool clear_soft, |
| 319 | IsMarkedCallback* is_marked_callback, |
| 320 | MarkObjectCallback* mark_object_callback, |
| 321 | ProcessMarkStackCallback* process_mark_stack_callback, void* arg) |
| 322 | SHARED_LOCKS_REQUIRED(Locks::mutator_lock_) |
| 323 | EXCLUSIVE_LOCKS_REQUIRED(Locks::heap_bitmap_lock_); |
Mathieu Chartier | 83c8ee0 | 2014-01-28 14:50:23 -0800 | [diff] [blame] | 324 | void ProcessReferences(TimingLogger& timings, bool clear_soft, |
| 325 | IsMarkedCallback* is_marked_callback, |
Mathieu Chartier | 3bb57c7 | 2014-02-18 11:38:45 -0800 | [diff] [blame] | 326 | MarkObjectCallback* mark_object_callback, |
| 327 | ProcessMarkStackCallback* process_mark_stack_callback, |
| 328 | void* arg) |
Mathieu Chartier | 39e3261 | 2013-11-12 16:28:05 -0800 | [diff] [blame] | 329 | SHARED_LOCKS_REQUIRED(Locks::mutator_lock_) |
| 330 | EXCLUSIVE_LOCKS_REQUIRED(Locks::heap_bitmap_lock_); |
Brian Carlstrom | 1f87008 | 2011-08-23 16:02:11 -0700 | [diff] [blame] | 331 | |
Ian Rogers | 04d7aa9 | 2013-03-16 14:29:17 -0700 | [diff] [blame] | 332 | // Enable verification of object references when the runtime is sufficiently initialized. |
Elliott Hughes | b3bd5f0 | 2012-03-08 21:05:27 -0800 | [diff] [blame] | 333 | void EnableObjectValidation() { |
Mathieu Chartier | 4e30541 | 2014-02-19 10:54:44 -0800 | [diff] [blame] | 334 | verify_object_mode_ = kVerifyObjectSupport; |
| 335 | if (verify_object_mode_ > kVerifyObjectModeDisabled) { |
Ian Rogers | 04d7aa9 | 2013-03-16 14:29:17 -0700 | [diff] [blame] | 336 | VerifyHeap(); |
| 337 | } |
Elliott Hughes | 85d1545 | 2011-09-16 17:33:01 -0700 | [diff] [blame] | 338 | } |
| 339 | |
Ian Rogers | 04d7aa9 | 2013-03-16 14:29:17 -0700 | [diff] [blame] | 340 | // Disable object reference verification for image writing. |
Elliott Hughes | b3bd5f0 | 2012-03-08 21:05:27 -0800 | [diff] [blame] | 341 | void DisableObjectValidation() { |
Mathieu Chartier | 4e30541 | 2014-02-19 10:54:44 -0800 | [diff] [blame] | 342 | verify_object_mode_ = kVerifyObjectModeDisabled; |
Ian Rogers | 0cfe1fb | 2011-08-26 03:29:44 -0700 | [diff] [blame] | 343 | } |
| 344 | |
Ian Rogers | 04d7aa9 | 2013-03-16 14:29:17 -0700 | [diff] [blame] | 345 | // Other checks may be performed if we know the heap should be in a sane state. |
Ian Rogers | 23435d0 | 2012-09-24 11:23:12 -0700 | [diff] [blame] | 346 | bool IsObjectValidationEnabled() const { |
Mathieu Chartier | 4e30541 | 2014-02-19 10:54:44 -0800 | [diff] [blame] | 347 | return verify_object_mode_ > kVerifyObjectModeDisabled; |
Ian Rogers | 23435d0 | 2012-09-24 11:23:12 -0700 | [diff] [blame] | 348 | } |
| 349 | |
Mathieu Chartier | e0a53e9 | 2013-08-05 10:17:40 -0700 | [diff] [blame] | 350 | // Returns true if low memory mode is enabled. |
| 351 | bool IsLowMemoryMode() const { |
| 352 | return low_memory_mode_; |
| 353 | } |
| 354 | |
Mathieu Chartier | 2f8da3e | 2014-04-15 15:37:02 -0700 | [diff] [blame] | 355 | // Returns the heap growth multiplier, this affects how much we grow the heap after a GC. |
| 356 | // Scales heap growth, min free, and max free. |
| 357 | double HeapGrowthMultiplier() const; |
| 358 | |
Mathieu Chartier | e6da9af | 2013-12-16 11:54:42 -0800 | [diff] [blame] | 359 | // Freed bytes can be negative in cases where we copy objects from a compacted space to a |
| 360 | // free-list backed space. |
Mathieu Chartier | e76e70f | 2014-05-02 16:35:37 -0700 | [diff] [blame] | 361 | void RecordFree(uint64_t freed_objects, int64_t freed_bytes); |
Brian Carlstrom | 693267a | 2011-09-06 09:25:34 -0700 | [diff] [blame] | 362 | |
Elliott Hughes | 5ea047b | 2011-09-13 14:38:18 -0700 | [diff] [blame] | 363 | // Must be called if a field of an Object in the heap changes, and before any GC safe-point. |
| 364 | // The call is not needed if NULL is stored in the field. |
Mathieu Chartier | e6da9af | 2013-12-16 11:54:42 -0800 | [diff] [blame] | 365 | void WriteBarrierField(const mirror::Object* dst, MemberOffset /*offset*/, |
| 366 | const mirror::Object* /*new_value*/) { |
Mathieu Chartier | e35517a | 2012-10-30 18:49:55 -0700 | [diff] [blame] | 367 | card_table_->MarkCard(dst); |
Ian Rogers | 5d76c43 | 2011-10-31 21:42:49 -0700 | [diff] [blame] | 368 | } |
| 369 | |
| 370 | // Write barrier for array operations that update many field positions |
Ian Rogers | 2dd0e2c | 2013-01-24 12:42:14 -0800 | [diff] [blame] | 371 | void WriteBarrierArray(const mirror::Object* dst, int /*start_offset*/, |
Ian Rogers | 00f7d0e | 2012-07-19 15:28:27 -0700 | [diff] [blame] | 372 | size_t /*length TODO: element_count or byte_count?*/) { |
Mathieu Chartier | e35517a | 2012-10-30 18:49:55 -0700 | [diff] [blame] | 373 | card_table_->MarkCard(dst); |
Ian Rogers | 5d76c43 | 2011-10-31 21:42:49 -0700 | [diff] [blame] | 374 | } |
| 375 | |
Mathieu Chartier | 0732d59 | 2013-11-06 11:02:50 -0800 | [diff] [blame] | 376 | void WriteBarrierEveryFieldOf(const mirror::Object* obj) { |
| 377 | card_table_->MarkCard(obj); |
| 378 | } |
| 379 | |
Ian Rogers | 1d54e73 | 2013-05-02 21:10:01 -0700 | [diff] [blame] | 380 | accounting::CardTable* GetCardTable() const { |
Mathieu Chartier | cc236d7 | 2012-07-20 10:29:05 -0700 | [diff] [blame] | 381 | return card_table_.get(); |
Ian Rogers | 5d76c43 | 2011-10-31 21:42:49 -0700 | [diff] [blame] | 382 | } |
| 383 | |
Mathieu Chartier | 8668c3c | 2014-04-24 16:48:11 -0700 | [diff] [blame] | 384 | void AddFinalizerReference(Thread* self, mirror::Object** object); |
Elliott Hughes | adb460d | 2011-10-05 17:02:34 -0700 | [diff] [blame] | 385 | |
Ian Rogers | 1d54e73 | 2013-05-02 21:10:01 -0700 | [diff] [blame] | 386 | // Returns the number of bytes currently allocated. |
| 387 | size_t GetBytesAllocated() const { |
| 388 | return num_bytes_allocated_; |
| 389 | } |
| 390 | |
| 391 | // Returns the number of objects currently allocated. |
Mathieu Chartier | 590fee9 | 2013-09-13 13:46:47 -0700 | [diff] [blame] | 392 | size_t GetObjectsAllocated() const LOCKS_EXCLUDED(Locks::heap_bitmap_lock_); |
Mathieu Chartier | 7664f5c | 2012-06-08 18:15:32 -0700 | [diff] [blame] | 393 | |
Mathieu Chartier | 155dfe9 | 2012-10-09 14:24:49 -0700 | [diff] [blame] | 394 | // Returns the total number of objects allocated since the heap was created. |
Ian Rogers | 1d54e73 | 2013-05-02 21:10:01 -0700 | [diff] [blame] | 395 | size_t GetObjectsAllocatedEver() const; |
Mathieu Chartier | 155dfe9 | 2012-10-09 14:24:49 -0700 | [diff] [blame] | 396 | |
| 397 | // Returns the total number of bytes allocated since the heap was created. |
Ian Rogers | 1d54e73 | 2013-05-02 21:10:01 -0700 | [diff] [blame] | 398 | size_t GetBytesAllocatedEver() const; |
Mathieu Chartier | 155dfe9 | 2012-10-09 14:24:49 -0700 | [diff] [blame] | 399 | |
| 400 | // Returns the total number of objects freed since the heap was created. |
Ian Rogers | 1d54e73 | 2013-05-02 21:10:01 -0700 | [diff] [blame] | 401 | size_t GetObjectsFreedEver() const { |
| 402 | return total_objects_freed_ever_; |
| 403 | } |
Mathieu Chartier | 155dfe9 | 2012-10-09 14:24:49 -0700 | [diff] [blame] | 404 | |
| 405 | // Returns the total number of bytes freed since the heap was created. |
Ian Rogers | 1d54e73 | 2013-05-02 21:10:01 -0700 | [diff] [blame] | 406 | size_t GetBytesFreedEver() const { |
| 407 | return total_bytes_freed_ever_; |
| 408 | } |
Mathieu Chartier | 155dfe9 | 2012-10-09 14:24:49 -0700 | [diff] [blame] | 409 | |
Ian Rogers | 1d54e73 | 2013-05-02 21:10:01 -0700 | [diff] [blame] | 410 | // Implements java.lang.Runtime.maxMemory, returning the maximum amount of memory a program can |
| 411 | // consume. For a regular VM this would relate to the -Xmx option and would return -1 if no Xmx |
| 412 | // were specified. Android apps start with a growth limit (small heap size) which is |
| 413 | // cleared/extended for large apps. |
Ian Rogers | ef7d42f | 2014-01-06 12:55:46 -0800 | [diff] [blame] | 414 | size_t GetMaxMemory() const { |
Ian Rogers | 1d54e73 | 2013-05-02 21:10:01 -0700 | [diff] [blame] | 415 | return growth_limit_; |
| 416 | } |
| 417 | |
| 418 | // Implements java.lang.Runtime.totalMemory, returning the amount of memory consumed by an |
| 419 | // application. |
Ian Rogers | ef7d42f | 2014-01-06 12:55:46 -0800 | [diff] [blame] | 420 | size_t GetTotalMemory() const; |
Ian Rogers | 1d54e73 | 2013-05-02 21:10:01 -0700 | [diff] [blame] | 421 | |
| 422 | // Implements java.lang.Runtime.freeMemory. |
Ian Rogers | ef7d42f | 2014-01-06 12:55:46 -0800 | [diff] [blame] | 423 | size_t GetFreeMemory() const { |
Ian Rogers | 1d54e73 | 2013-05-02 21:10:01 -0700 | [diff] [blame] | 424 | return GetTotalMemory() - num_bytes_allocated_; |
| 425 | } |
| 426 | |
| 427 | // Get the space that corresponds to an object's address. Current implementation searches all |
| 428 | // spaces in turn. If fail_ok is false then failing to find a space will cause an abort. |
| 429 | // TODO: consider using faster data structure like binary tree. |
| 430 | space::ContinuousSpace* FindContinuousSpaceFromObject(const mirror::Object*, bool fail_ok) const; |
| 431 | space::DiscontinuousSpace* FindDiscontinuousSpaceFromObject(const mirror::Object*, |
| 432 | bool fail_ok) const; |
| 433 | space::Space* FindSpaceFromObject(const mirror::Object*, bool fail_ok) const; |
Mathieu Chartier | b062fdd | 2012-07-03 09:51:48 -0700 | [diff] [blame] | 434 | |
Mathieu Chartier | 037813d | 2012-08-23 16:44:59 -0700 | [diff] [blame] | 435 | void DumpForSigQuit(std::ostream& os); |
Elliott Hughes | c967f78 | 2012-04-16 10:23:15 -0700 | [diff] [blame] | 436 | |
Mathieu Chartier | a5f9de0 | 2014-02-28 16:48:42 -0800 | [diff] [blame] | 437 | |
| 438 | // Do a pending heap transition or trim. |
| 439 | void DoPendingTransitionOrTrim() LOCKS_EXCLUDED(heap_trim_request_lock_); |
| 440 | |
Mathieu Chartier | 590fee9 | 2013-09-13 13:46:47 -0700 | [diff] [blame] | 441 | // Trim the managed and native heaps by releasing unused memory back to the OS. |
Mathieu Chartier | a5f9de0 | 2014-02-28 16:48:42 -0800 | [diff] [blame] | 442 | void Trim() LOCKS_EXCLUDED(heap_trim_request_lock_); |
Mathieu Chartier | b062fdd | 2012-07-03 09:51:48 -0700 | [diff] [blame] | 443 | |
Hiroshi Yamauchi | cf58d4a | 2013-09-26 14:21:22 -0700 | [diff] [blame] | 444 | void RevokeThreadLocalBuffers(Thread* thread); |
Hiroshi Yamauchi | c93c530 | 2014-03-20 16:15:37 -0700 | [diff] [blame] | 445 | void RevokeRosAllocThreadLocalBuffers(Thread* thread); |
Hiroshi Yamauchi | cf58d4a | 2013-09-26 14:21:22 -0700 | [diff] [blame] | 446 | void RevokeAllThreadLocalBuffers(); |
Hiroshi Yamauchi | c93c530 | 2014-03-20 16:15:37 -0700 | [diff] [blame] | 447 | void AssertAllBumpPointerSpaceThreadLocalBuffersAreRevoked(); |
Mathieu Chartier | 6f365cc | 2014-04-23 12:42:27 -0700 | [diff] [blame] | 448 | void RosAllocVerification(TimingLogger* timings, const char* name) |
Hiroshi Yamauchi | a4adbfd | 2014-02-04 18:12:17 -0800 | [diff] [blame] | 449 | EXCLUSIVE_LOCKS_REQUIRED(Locks::mutator_lock_); |
| 450 | |
Ian Rogers | 1d54e73 | 2013-05-02 21:10:01 -0700 | [diff] [blame] | 451 | accounting::HeapBitmap* GetLiveBitmap() SHARED_LOCKS_REQUIRED(Locks::heap_bitmap_lock_) { |
Mathieu Chartier | b062fdd | 2012-07-03 09:51:48 -0700 | [diff] [blame] | 452 | return live_bitmap_.get(); |
| 453 | } |
| 454 | |
Ian Rogers | 1d54e73 | 2013-05-02 21:10:01 -0700 | [diff] [blame] | 455 | accounting::HeapBitmap* GetMarkBitmap() SHARED_LOCKS_REQUIRED(Locks::heap_bitmap_lock_) { |
Mathieu Chartier | b062fdd | 2012-07-03 09:51:48 -0700 | [diff] [blame] | 456 | return mark_bitmap_.get(); |
| 457 | } |
| 458 | |
Ian Rogers | 1d54e73 | 2013-05-02 21:10:01 -0700 | [diff] [blame] | 459 | accounting::ObjectStack* GetLiveStack() SHARED_LOCKS_REQUIRED(Locks::heap_bitmap_lock_) { |
Mathieu Chartier | 2b82db4 | 2012-11-14 17:29:05 -0800 | [diff] [blame] | 460 | return live_stack_.get(); |
| 461 | } |
| 462 | |
Mathieu Chartier | 590fee9 | 2013-09-13 13:46:47 -0700 | [diff] [blame] | 463 | void PreZygoteFork() NO_THREAD_SAFETY_ANALYSIS; |
Mathieu Chartier | cc236d7 | 2012-07-20 10:29:05 -0700 | [diff] [blame] | 464 | |
Mathieu Chartier | 357e9be | 2012-08-01 11:00:14 -0700 | [diff] [blame] | 465 | // Mark and empty stack. |
| 466 | void FlushAllocStack() |
Ian Rogers | b726dcb | 2012-09-05 08:57:23 -0700 | [diff] [blame] | 467 | EXCLUSIVE_LOCKS_REQUIRED(Locks::heap_bitmap_lock_); |
Mathieu Chartier | 357e9be | 2012-08-01 11:00:14 -0700 | [diff] [blame] | 468 | |
Hiroshi Yamauchi | 90d7068 | 2014-02-20 16:17:30 -0800 | [diff] [blame] | 469 | // Revoke all the thread-local allocation stacks. |
Mathieu Chartier | c22c59e | 2014-02-24 15:16:06 -0800 | [diff] [blame] | 470 | void RevokeAllThreadLocalAllocationStacks(Thread* self) |
Mathieu Chartier | d889178 | 2014-03-02 13:28:37 -0800 | [diff] [blame] | 471 | EXCLUSIVE_LOCKS_REQUIRED(Locks::mutator_lock_) |
| 472 | LOCKS_EXCLUDED(Locks::runtime_shutdown_lock_, Locks::thread_list_lock_); |
Hiroshi Yamauchi | 90d7068 | 2014-02-20 16:17:30 -0800 | [diff] [blame] | 473 | |
Mathieu Chartier | c7b83a0 | 2012-09-11 18:07:39 -0700 | [diff] [blame] | 474 | // Mark all the objects in the allocation stack in the specified bitmap. |
Mathieu Chartier | a8e8f9c | 2014-04-09 14:51:05 -0700 | [diff] [blame] | 475 | // TODO: Refactor? |
| 476 | void MarkAllocStack(accounting::SpaceBitmap<kObjectAlignment>* bitmap1, |
| 477 | accounting::SpaceBitmap<kObjectAlignment>* bitmap2, |
Mathieu Chartier | bbd695c | 2014-04-16 09:48:48 -0700 | [diff] [blame] | 478 | accounting::SpaceBitmap<kLargeObjectAlignment>* large_objects, |
| 479 | accounting::ObjectStack* stack) |
Mathieu Chartier | c7b83a0 | 2012-09-11 18:07:39 -0700 | [diff] [blame] | 480 | EXCLUSIVE_LOCKS_REQUIRED(Locks::heap_bitmap_lock_); |
Mathieu Chartier | 357e9be | 2012-08-01 11:00:14 -0700 | [diff] [blame] | 481 | |
Mathieu Chartier | 590fee9 | 2013-09-13 13:46:47 -0700 | [diff] [blame] | 482 | // Mark the specified allocation stack as live. |
| 483 | void MarkAllocStackAsLive(accounting::ObjectStack* stack) |
Mathieu Chartier | ca2a24d | 2013-11-25 15:12:12 -0800 | [diff] [blame] | 484 | EXCLUSIVE_LOCKS_REQUIRED(Locks::heap_bitmap_lock_); |
Mathieu Chartier | 8235331 | 2013-07-18 10:47:51 -0700 | [diff] [blame] | 485 | |
Mathieu Chartier | a1602f2 | 2014-01-13 17:19:19 -0800 | [diff] [blame] | 486 | // Unbind any bound bitmaps. |
| 487 | void UnBindBitmaps() EXCLUSIVE_LOCKS_REQUIRED(Locks::heap_bitmap_lock_); |
| 488 | |
Mathieu Chartier | b062fdd | 2012-07-03 09:51:48 -0700 | [diff] [blame] | 489 | // DEPRECATED: Should remove in "near" future when support for multiple image spaces is added. |
Mathieu Chartier | cc236d7 | 2012-07-20 10:29:05 -0700 | [diff] [blame] | 490 | // Assumes there is only one image space. |
Ian Rogers | 1d54e73 | 2013-05-02 21:10:01 -0700 | [diff] [blame] | 491 | space::ImageSpace* GetImageSpace() const; |
| 492 | |
Mathieu Chartier | 6dda898 | 2014-03-06 11:11:48 -0800 | [diff] [blame] | 493 | // Permenantly disable compaction. |
| 494 | void DisableCompaction(); |
| 495 | |
Mathieu Chartier | e6da9af | 2013-12-16 11:54:42 -0800 | [diff] [blame] | 496 | space::DlMallocSpace* GetDlMallocSpace() const { |
| 497 | return dlmalloc_space_; |
| 498 | } |
| 499 | |
| 500 | space::RosAllocSpace* GetRosAllocSpace() const { |
| 501 | return rosalloc_space_; |
| 502 | } |
| 503 | |
Hiroshi Yamauchi | cf58d4a | 2013-09-26 14:21:22 -0700 | [diff] [blame] | 504 | space::MallocSpace* GetNonMovingSpace() const { |
Mathieu Chartier | 590fee9 | 2013-09-13 13:46:47 -0700 | [diff] [blame] | 505 | return non_moving_space_; |
Mathieu Chartier | e0f0cb3 | 2012-08-28 11:26:00 -0700 | [diff] [blame] | 506 | } |
Ian Rogers | 1d54e73 | 2013-05-02 21:10:01 -0700 | [diff] [blame] | 507 | |
| 508 | space::LargeObjectSpace* GetLargeObjectsSpace() const { |
| 509 | return large_object_space_; |
| 510 | } |
| 511 | |
Hiroshi Yamauchi | 05e713a | 2014-01-09 13:24:51 -0800 | [diff] [blame] | 512 | // Returns the free list space that may contain movable objects (the |
| 513 | // one that's not the non-moving space), either rosalloc_space_ or |
| 514 | // dlmalloc_space_. |
| 515 | space::MallocSpace* GetPrimaryFreeListSpace() { |
| 516 | if (kUseRosAlloc) { |
| 517 | DCHECK(rosalloc_space_ != nullptr); |
| 518 | // reinterpret_cast is necessary as the space class hierarchy |
| 519 | // isn't known (#included) yet here. |
| 520 | return reinterpret_cast<space::MallocSpace*>(rosalloc_space_); |
| 521 | } else { |
| 522 | DCHECK(dlmalloc_space_ != nullptr); |
| 523 | return reinterpret_cast<space::MallocSpace*>(dlmalloc_space_); |
| 524 | } |
| 525 | } |
| 526 | |
Mathieu Chartier | 590fee9 | 2013-09-13 13:46:47 -0700 | [diff] [blame] | 527 | void DumpSpaces(std::ostream& stream = LOG(INFO)); |
Elliott Hughes | f834936 | 2012-06-18 15:00:06 -0700 | [diff] [blame] | 528 | |
Mathieu Chartier | 15d3402 | 2014-02-26 17:16:38 -0800 | [diff] [blame] | 529 | // Dump object should only be used by the signal handler. |
| 530 | void DumpObject(std::ostream& stream, mirror::Object* obj) NO_THREAD_SAFETY_ANALYSIS; |
| 531 | // Safe version of pretty type of which check to make sure objects are heap addresses. |
| 532 | std::string SafeGetClassDescriptor(mirror::Class* klass) NO_THREAD_SAFETY_ANALYSIS; |
| 533 | std::string SafePrettyTypeOf(mirror::Object* obj) NO_THREAD_SAFETY_ANALYSIS; |
| 534 | |
Mathieu Chartier | 155dfe9 | 2012-10-09 14:24:49 -0700 | [diff] [blame] | 535 | // GC performance measuring |
Elliott Hughes | 8b788fe | 2013-04-17 15:57:01 -0700 | [diff] [blame] | 536 | void DumpGcPerformanceInfo(std::ostream& os); |
Mathieu Chartier | 155dfe9 | 2012-10-09 14:24:49 -0700 | [diff] [blame] | 537 | |
Mathieu Chartier | 2775ee4 | 2013-08-20 17:43:47 -0700 | [diff] [blame] | 538 | // Returns true if we currently care about pause times. |
| 539 | bool CareAboutPauseTimes() const { |
Mathieu Chartier | ca2a24d | 2013-11-25 15:12:12 -0800 | [diff] [blame] | 540 | return process_state_ == kProcessStateJankPerceptible; |
Mathieu Chartier | 2775ee4 | 2013-08-20 17:43:47 -0700 | [diff] [blame] | 541 | } |
| 542 | |
Mathieu Chartier | 02b6a78 | 2012-10-26 13:51:26 -0700 | [diff] [blame] | 543 | // Thread pool. |
| 544 | void CreateThreadPool(); |
| 545 | void DeleteThreadPool(); |
| 546 | ThreadPool* GetThreadPool() { |
| 547 | return thread_pool_.get(); |
| 548 | } |
Mathieu Chartier | 2775ee4 | 2013-08-20 17:43:47 -0700 | [diff] [blame] | 549 | size_t GetParallelGCThreadCount() const { |
| 550 | return parallel_gc_threads_; |
| 551 | } |
| 552 | size_t GetConcGCThreadCount() const { |
| 553 | return conc_gc_threads_; |
| 554 | } |
Mathieu Chartier | 11409ae | 2013-09-23 11:49:36 -0700 | [diff] [blame] | 555 | accounting::ModUnionTable* FindModUnionTableFromSpace(space::Space* space); |
| 556 | void AddModUnionTable(accounting::ModUnionTable* mod_union_table); |
Mathieu Chartier | 02b6a78 | 2012-10-26 13:51:26 -0700 | [diff] [blame] | 557 | |
Hiroshi Yamauchi | 38e68e9 | 2014-03-07 13:59:08 -0800 | [diff] [blame] | 558 | accounting::RememberedSet* FindRememberedSetFromSpace(space::Space* space); |
| 559 | void AddRememberedSet(accounting::RememberedSet* remembered_set); |
| 560 | void RemoveRememberedSet(space::Space* space); |
| 561 | |
Mathieu Chartier | 590fee9 | 2013-09-13 13:46:47 -0700 | [diff] [blame] | 562 | bool IsCompilingBoot() const; |
Mathieu Chartier | 36bf216 | 2014-03-20 15:40:37 -0700 | [diff] [blame] | 563 | bool RunningOnValgrind() const { |
| 564 | return running_on_valgrind_; |
| 565 | } |
Mathieu Chartier | 590fee9 | 2013-09-13 13:46:47 -0700 | [diff] [blame] | 566 | bool HasImageSpace() const; |
| 567 | |
Carl Shapiro | 58551df | 2011-07-24 03:09:51 -0700 | [diff] [blame] | 568 | private: |
Mathieu Chartier | 590fee9 | 2013-09-13 13:46:47 -0700 | [diff] [blame] | 569 | void Compact(space::ContinuousMemMapAllocSpace* target_space, |
Mathieu Chartier | 31f4414 | 2014-04-08 14:40:03 -0700 | [diff] [blame] | 570 | space::ContinuousMemMapAllocSpace* source_space) |
| 571 | EXCLUSIVE_LOCKS_REQUIRED(Locks::mutator_lock_); |
Mathieu Chartier | 590fee9 | 2013-09-13 13:46:47 -0700 | [diff] [blame] | 572 | |
Mathieu Chartier | e6da9af | 2013-12-16 11:54:42 -0800 | [diff] [blame] | 573 | void FinishGC(Thread* self, collector::GcType gc_type) LOCKS_EXCLUDED(gc_complete_lock_); |
| 574 | |
Mathieu Chartier | 692fafd | 2013-11-29 17:24:40 -0800 | [diff] [blame] | 575 | static ALWAYS_INLINE bool AllocatorHasAllocationStack(AllocatorType allocator_type) { |
| 576 | return |
| 577 | allocator_type != kAllocatorTypeBumpPointer && |
| 578 | allocator_type != kAllocatorTypeTLAB; |
Mathieu Chartier | cbb2d20 | 2013-11-14 17:45:16 -0800 | [diff] [blame] | 579 | } |
Mathieu Chartier | 692fafd | 2013-11-29 17:24:40 -0800 | [diff] [blame] | 580 | static ALWAYS_INLINE bool AllocatorMayHaveConcurrentGC(AllocatorType allocator_type) { |
| 581 | return AllocatorHasAllocationStack(allocator_type); |
Mathieu Chartier | cbb2d20 | 2013-11-14 17:45:16 -0800 | [diff] [blame] | 582 | } |
Mathieu Chartier | 31f4414 | 2014-04-08 14:40:03 -0700 | [diff] [blame] | 583 | static bool IsMovingGc(CollectorType collector_type) { |
Hiroshi Yamauchi | d5307ec | 2014-03-27 21:07:51 -0700 | [diff] [blame] | 584 | return collector_type == kCollectorTypeSS || collector_type == kCollectorTypeGSS || |
| 585 | collector_type == kCollectorTypeCC; |
Mathieu Chartier | 9be9a7a | 2014-01-24 14:07:33 -0800 | [diff] [blame] | 586 | } |
Ian Rogers | ef7d42f | 2014-01-06 12:55:46 -0800 | [diff] [blame] | 587 | bool ShouldAllocLargeObject(mirror::Class* c, size_t byte_count) const |
| 588 | SHARED_LOCKS_REQUIRED(Locks::mutator_lock_); |
Mathieu Chartier | cbb2d20 | 2013-11-14 17:45:16 -0800 | [diff] [blame] | 589 | ALWAYS_INLINE void CheckConcurrentGC(Thread* self, size_t new_num_bytes_allocated, |
Mathieu Chartier | f517f1a | 2014-03-06 15:52:27 -0800 | [diff] [blame] | 590 | mirror::Object** obj) |
| 591 | SHARED_LOCKS_REQUIRED(Locks::mutator_lock_); |
Hiroshi Yamauchi | 50b2928 | 2013-07-30 13:58:37 -0700 | [diff] [blame] | 592 | |
Mathieu Chartier | 692fafd | 2013-11-29 17:24:40 -0800 | [diff] [blame] | 593 | // We don't force this to be inlined since it is a slow path. |
Mathieu Chartier | c528dba | 2013-11-26 12:00:11 -0800 | [diff] [blame] | 594 | template <bool kInstrumented, typename PreFenceVisitor> |
| 595 | mirror::Object* AllocLargeObject(Thread* self, mirror::Class* klass, size_t byte_count, |
| 596 | const PreFenceVisitor& pre_fence_visitor) |
| 597 | SHARED_LOCKS_REQUIRED(Locks::mutator_lock_); |
| 598 | |
Hiroshi Yamauchi | 50b2928 | 2013-07-30 13:58:37 -0700 | [diff] [blame] | 599 | // Handles Allocate()'s slow allocation path with GC involved after |
| 600 | // an initial allocation attempt failed. |
Mathieu Chartier | cbb2d20 | 2013-11-14 17:45:16 -0800 | [diff] [blame] | 601 | mirror::Object* AllocateInternalWithGc(Thread* self, AllocatorType allocator, size_t num_bytes, |
Ian Rogers | 6fac447 | 2014-02-25 17:01:10 -0800 | [diff] [blame] | 602 | size_t* bytes_allocated, size_t* usable_size, |
| 603 | mirror::Class** klass) |
Ian Rogers | b726dcb | 2012-09-05 08:57:23 -0700 | [diff] [blame] | 604 | LOCKS_EXCLUDED(Locks::thread_suspend_count_lock_) |
| 605 | SHARED_LOCKS_REQUIRED(Locks::mutator_lock_); |
Mathieu Chartier | a639903 | 2012-06-11 18:49:50 -0700 | [diff] [blame] | 606 | |
Mathieu Chartier | 590fee9 | 2013-09-13 13:46:47 -0700 | [diff] [blame] | 607 | // Allocate into a specific space. |
| 608 | mirror::Object* AllocateInto(Thread* self, space::AllocSpace* space, mirror::Class* c, |
| 609 | size_t bytes) |
| 610 | SHARED_LOCKS_REQUIRED(Locks::mutator_lock_); |
| 611 | |
Mathieu Chartier | 31f4414 | 2014-04-08 14:40:03 -0700 | [diff] [blame] | 612 | // Need to do this with mutators paused so that somebody doesn't accidentally allocate into the |
| 613 | // wrong space. |
| 614 | void SwapSemiSpaces() EXCLUSIVE_LOCKS_REQUIRED(Locks::mutator_lock_); |
| 615 | |
Mathieu Chartier | cbb2d20 | 2013-11-14 17:45:16 -0800 | [diff] [blame] | 616 | // Try to allocate a number of bytes, this function never does any GCs. Needs to be inlined so |
| 617 | // that the switch statement is constant optimized in the entrypoints. |
Mathieu Chartier | c528dba | 2013-11-26 12:00:11 -0800 | [diff] [blame] | 618 | template <const bool kInstrumented, const bool kGrow> |
Mathieu Chartier | cbb2d20 | 2013-11-14 17:45:16 -0800 | [diff] [blame] | 619 | ALWAYS_INLINE mirror::Object* TryToAllocate(Thread* self, AllocatorType allocator_type, |
Ian Rogers | 6fac447 | 2014-02-25 17:01:10 -0800 | [diff] [blame] | 620 | size_t alloc_size, size_t* bytes_allocated, |
| 621 | size_t* usable_size) |
Hiroshi Yamauchi | cf58d4a | 2013-09-26 14:21:22 -0700 | [diff] [blame] | 622 | SHARED_LOCKS_REQUIRED(Locks::mutator_lock_); |
| 623 | |
Hiroshi Yamauchi | 3b4c189 | 2013-09-12 21:33:12 -0700 | [diff] [blame] | 624 | void ThrowOutOfMemoryError(Thread* self, size_t byte_count, bool large_object_allocation) |
| 625 | SHARED_LOCKS_REQUIRED(Locks::mutator_lock_); |
Mathieu Chartier | 692fafd | 2013-11-29 17:24:40 -0800 | [diff] [blame] | 626 | |
| 627 | template <bool kGrow> |
| 628 | bool IsOutOfMemoryOnAllocation(AllocatorType allocator_type, size_t alloc_size); |
Hiroshi Yamauchi | 50b2928 | 2013-07-30 13:58:37 -0700 | [diff] [blame] | 629 | |
Mathieu Chartier | 15d3402 | 2014-02-26 17:16:38 -0800 | [diff] [blame] | 630 | // Returns true if the address passed in is within the address range of a continuous space. |
| 631 | bool IsValidContinuousSpaceObjectAddress(const mirror::Object* obj) const |
| 632 | SHARED_LOCKS_REQUIRED(Locks::mutator_lock_); |
| 633 | |
Mathieu Chartier | 39e3261 | 2013-11-12 16:28:05 -0800 | [diff] [blame] | 634 | void EnqueueClearedReferences(); |
| 635 | // Returns true if the reference object has not yet been enqueued. |
Mathieu Chartier | 8fa2dad | 2014-03-13 12:22:56 -0700 | [diff] [blame] | 636 | void DelayReferenceReferent(mirror::Class* klass, mirror::Reference* ref, |
Mathieu Chartier | 83c8ee0 | 2014-01-28 14:50:23 -0800 | [diff] [blame] | 637 | IsMarkedCallback is_marked_callback, void* arg) |
| 638 | SHARED_LOCKS_REQUIRED(Locks::mutator_lock_); |
Mathieu Chartier | 590fee9 | 2013-09-13 13:46:47 -0700 | [diff] [blame] | 639 | |
| 640 | // Run the finalizers. |
| 641 | void RunFinalization(JNIEnv* env); |
| 642 | |
| 643 | // Blocks the caller until the garbage collector becomes idle and returns the type of GC we |
| 644 | // waited for. |
Mathieu Chartier | 89a201e | 2014-05-02 10:27:26 -0700 | [diff] [blame] | 645 | collector::GcType WaitForGcToCompleteLocked(GcCause cause, Thread* self) |
Mathieu Chartier | 590fee9 | 2013-09-13 13:46:47 -0700 | [diff] [blame] | 646 | EXCLUSIVE_LOCKS_REQUIRED(gc_complete_lock_); |
| 647 | |
Mathieu Chartier | 7bf52d2 | 2014-03-13 14:46:09 -0700 | [diff] [blame] | 648 | void RequestCollectorTransition(CollectorType desired_collector_type, uint64_t delta_time) |
Mathieu Chartier | a5f9de0 | 2014-02-28 16:48:42 -0800 | [diff] [blame] | 649 | LOCKS_EXCLUDED(heap_trim_request_lock_); |
Mathieu Chartier | 7bf52d2 | 2014-03-13 14:46:09 -0700 | [diff] [blame] | 650 | void RequestHeapTrim() LOCKS_EXCLUDED(Locks::runtime_shutdown_lock_); |
Ian Rogers | f0bbeab | 2012-10-10 18:26:27 -0700 | [diff] [blame] | 651 | void RequestConcurrentGC(Thread* self) LOCKS_EXCLUDED(Locks::runtime_shutdown_lock_); |
Mathieu Chartier | 987ccff | 2013-07-08 11:05:21 -0700 | [diff] [blame] | 652 | bool IsGCRequestPending() const; |
Elliott Hughes | 8cf5bc0 | 2012-02-02 16:32:16 -0800 | [diff] [blame] | 653 | |
Mathieu Chartier | 866fb2a | 2012-09-10 10:47:49 -0700 | [diff] [blame] | 654 | // Sometimes CollectGarbageInternal decides to run a different Gc than you requested. Returns |
| 655 | // which type of Gc was actually ran. |
Ian Rogers | 1d54e73 | 2013-05-02 21:10:01 -0700 | [diff] [blame] | 656 | collector::GcType CollectGarbageInternal(collector::GcType gc_plan, GcCause gc_cause, |
| 657 | bool clear_soft_references) |
Ian Rogers | 00f7d0e | 2012-07-19 15:28:27 -0700 | [diff] [blame] | 658 | LOCKS_EXCLUDED(gc_complete_lock_, |
Ian Rogers | b726dcb | 2012-09-05 08:57:23 -0700 | [diff] [blame] | 659 | Locks::heap_bitmap_lock_, |
Ian Rogers | b726dcb | 2012-09-05 08:57:23 -0700 | [diff] [blame] | 660 | Locks::thread_suspend_count_lock_); |
Mathieu Chartier | 2b82db4 | 2012-11-14 17:29:05 -0800 | [diff] [blame] | 661 | |
Mathieu Chartier | 6f365cc | 2014-04-23 12:42:27 -0700 | [diff] [blame] | 662 | void PreGcVerification(collector::GarbageCollector* gc) |
| 663 | LOCKS_EXCLUDED(Locks::mutator_lock_); |
| 664 | void PreGcVerificationPaused(collector::GarbageCollector* gc) |
| 665 | EXCLUSIVE_LOCKS_REQUIRED(Locks::mutator_lock_); |
| 666 | void PrePauseRosAllocVerification(collector::GarbageCollector* gc) |
| 667 | EXCLUSIVE_LOCKS_REQUIRED(Locks::mutator_lock_); |
Ian Rogers | 1d54e73 | 2013-05-02 21:10:01 -0700 | [diff] [blame] | 668 | void PreSweepingGcVerification(collector::GarbageCollector* gc) |
Mathieu Chartier | ad2541a | 2013-10-25 10:05:23 -0700 | [diff] [blame] | 669 | EXCLUSIVE_LOCKS_REQUIRED(Locks::mutator_lock_); |
| 670 | void PostGcVerification(collector::GarbageCollector* gc) |
Mathieu Chartier | 6f365cc | 2014-04-23 12:42:27 -0700 | [diff] [blame] | 671 | LOCKS_EXCLUDED(Locks::mutator_lock_); |
| 672 | void PostGcVerificationPaused(collector::GarbageCollector* gc) |
| 673 | EXCLUSIVE_LOCKS_REQUIRED(Locks::mutator_lock_); |
Carl Shapiro | 69759ea | 2011-07-21 18:13:35 -0700 | [diff] [blame] | 674 | |
Mathieu Chartier | 987ccff | 2013-07-08 11:05:21 -0700 | [diff] [blame] | 675 | // Update the watermark for the native allocated bytes based on the current number of native |
| 676 | // bytes allocated and the target utilization ratio. |
| 677 | void UpdateMaxNativeFootprint(); |
| 678 | |
Mathieu Chartier | afe4998 | 2014-03-27 10:55:04 -0700 | [diff] [blame] | 679 | // Find a collector based on GC type. |
| 680 | collector::GarbageCollector* FindCollectorByGcType(collector::GcType gc_type); |
| 681 | |
Mathieu Chartier | 31f4414 | 2014-04-08 14:40:03 -0700 | [diff] [blame] | 682 | // Create the main free list space, typically either a RosAlloc space or DlMalloc space. |
| 683 | void CreateMainMallocSpace(MemMap* mem_map, size_t initial_size, size_t growth_limit, |
| 684 | size_t capacity); |
| 685 | |
Ian Rogers | 3bb17a6 | 2012-01-27 23:56:44 -0800 | [diff] [blame] | 686 | // Given the current contents of the alloc space, increase the allowed heap footprint to match |
| 687 | // the target utilization ratio. This should only be called immediately after a full garbage |
| 688 | // collection. |
Mathieu Chartier | afe4998 | 2014-03-27 10:55:04 -0700 | [diff] [blame] | 689 | void GrowForUtilization(collector::GarbageCollector* collector_ran); |
Carl Shapiro | 69759ea | 2011-07-21 18:13:35 -0700 | [diff] [blame] | 690 | |
Mathieu Chartier | 637e348 | 2012-08-17 10:41:32 -0700 | [diff] [blame] | 691 | size_t GetPercentFree(); |
Elliott Hughes | c967f78 | 2012-04-16 10:23:15 -0700 | [diff] [blame] | 692 | |
Ian Rogers | 2dd0e2c | 2013-01-24 12:42:14 -0800 | [diff] [blame] | 693 | static void VerificationCallback(mirror::Object* obj, void* arg) |
Ian Rogers | 719d1a3 | 2014-03-06 12:13:39 -0800 | [diff] [blame] | 694 | SHARED_LOCKS_REQUIRED(Locks::heap_bitmap_lock_); |
Carl Shapiro | 69759ea | 2011-07-21 18:13:35 -0700 | [diff] [blame] | 695 | |
Mathieu Chartier | e0f0cb3 | 2012-08-28 11:26:00 -0700 | [diff] [blame] | 696 | // Swap the allocation stack with the live stack. |
Hiroshi Yamauchi | f5b0e20 | 2014-02-11 17:02:22 -0800 | [diff] [blame] | 697 | void SwapStacks(Thread* self); |
| 698 | |
Mathieu Chartier | 7469ebf | 2012-09-24 16:28:36 -0700 | [diff] [blame] | 699 | // Clear cards and update the mod union table. |
Hiroshi Yamauchi | 38e68e9 | 2014-03-07 13:59:08 -0800 | [diff] [blame] | 700 | void ProcessCards(TimingLogger& timings, bool use_rem_sets); |
Mathieu Chartier | 7469ebf | 2012-09-24 16:28:36 -0700 | [diff] [blame] | 701 | |
Mathieu Chartier | a5f9de0 | 2014-02-28 16:48:42 -0800 | [diff] [blame] | 702 | // Signal the heap trim daemon that there is something to do, either a heap transition or heap |
| 703 | // trim. |
| 704 | void SignalHeapTrimDaemon(Thread* self); |
| 705 | |
Hiroshi Yamauchi | f5b0e20 | 2014-02-11 17:02:22 -0800 | [diff] [blame] | 706 | // Push an object onto the allocation stack. |
Hiroshi Yamauchi | 4cd662e | 2014-04-03 16:28:10 -0700 | [diff] [blame] | 707 | void PushOnAllocationStack(Thread* self, mirror::Object** obj) |
| 708 | SHARED_LOCKS_REQUIRED(Locks::mutator_lock_); |
Hiroshi Yamauchi | f5b0e20 | 2014-02-11 17:02:22 -0800 | [diff] [blame] | 709 | |
Hiroshi Yamauchi | 3e41780 | 2014-03-20 12:03:02 -0700 | [diff] [blame] | 710 | // What kind of concurrency behavior is the runtime after? Currently true for concurrent mark |
| 711 | // sweep GC, false for other GC types. |
| 712 | bool IsGcConcurrent() const ALWAYS_INLINE { |
Hiroshi Yamauchi | d5307ec | 2014-03-27 21:07:51 -0700 | [diff] [blame] | 713 | return collector_type_ == kCollectorTypeCMS || collector_type_ == kCollectorTypeCC; |
Hiroshi Yamauchi | 3e41780 | 2014-03-20 12:03:02 -0700 | [diff] [blame] | 714 | } |
| 715 | |
Ian Rogers | 1d54e73 | 2013-05-02 21:10:01 -0700 | [diff] [blame] | 716 | // All-known continuous spaces, where objects lie within fixed bounds. |
| 717 | std::vector<space::ContinuousSpace*> continuous_spaces_; |
Carl Shapiro | 69759ea | 2011-07-21 18:13:35 -0700 | [diff] [blame] | 718 | |
Ian Rogers | 1d54e73 | 2013-05-02 21:10:01 -0700 | [diff] [blame] | 719 | // All-known discontinuous spaces, where objects may be placed throughout virtual memory. |
| 720 | std::vector<space::DiscontinuousSpace*> discontinuous_spaces_; |
Mathieu Chartier | d8195f1 | 2012-10-05 12:21:28 -0700 | [diff] [blame] | 721 | |
Mathieu Chartier | 590fee9 | 2013-09-13 13:46:47 -0700 | [diff] [blame] | 722 | // All-known alloc spaces, where objects may be or have been allocated. |
| 723 | std::vector<space::AllocSpace*> alloc_spaces_; |
| 724 | |
| 725 | // A space where non-movable objects are allocated, when compaction is enabled it contains |
| 726 | // Classes, ArtMethods, ArtFields, and non moving objects. |
Hiroshi Yamauchi | cf58d4a | 2013-09-26 14:21:22 -0700 | [diff] [blame] | 727 | space::MallocSpace* non_moving_space_; |
Ian Rogers | 1d54e73 | 2013-05-02 21:10:01 -0700 | [diff] [blame] | 728 | |
Mathieu Chartier | e6da9af | 2013-12-16 11:54:42 -0800 | [diff] [blame] | 729 | // Space which we use for the kAllocatorTypeROSAlloc. |
| 730 | space::RosAllocSpace* rosalloc_space_; |
| 731 | |
| 732 | // Space which we use for the kAllocatorTypeDlMalloc. |
| 733 | space::DlMallocSpace* dlmalloc_space_; |
| 734 | |
Mathieu Chartier | fc5b528 | 2014-01-09 16:15:36 -0800 | [diff] [blame] | 735 | // The main space is the space which the GC copies to and from on process state updates. This |
| 736 | // space is typically either the dlmalloc_space_ or the rosalloc_space_. |
| 737 | space::MallocSpace* main_space_; |
| 738 | |
Ian Rogers | 1d54e73 | 2013-05-02 21:10:01 -0700 | [diff] [blame] | 739 | // The large object space we are currently allocating into. |
| 740 | space::LargeObjectSpace* large_object_space_; |
| 741 | |
| 742 | // The card table, dirtied by the write barrier. |
| 743 | UniquePtr<accounting::CardTable> card_table_; |
Brian Carlstrom | 4a289ed | 2011-08-16 17:17:49 -0700 | [diff] [blame] | 744 | |
Mathieu Chartier | 11409ae | 2013-09-23 11:49:36 -0700 | [diff] [blame] | 745 | // A mod-union table remembers all of the references from the it's space to other spaces. |
| 746 | SafeMap<space::Space*, accounting::ModUnionTable*> mod_union_tables_; |
Mathieu Chartier | cc236d7 | 2012-07-20 10:29:05 -0700 | [diff] [blame] | 747 | |
Hiroshi Yamauchi | 38e68e9 | 2014-03-07 13:59:08 -0800 | [diff] [blame] | 748 | // A remembered set remembers all of the references from the it's space to the target space. |
| 749 | SafeMap<space::Space*, accounting::RememberedSet*> remembered_sets_; |
| 750 | |
Mathieu Chartier | 0de9f73 | 2013-11-22 17:58:48 -0800 | [diff] [blame] | 751 | // The current collector type. |
| 752 | CollectorType collector_type_; |
Mathieu Chartier | 31f4414 | 2014-04-08 14:40:03 -0700 | [diff] [blame] | 753 | // Which collector we use when the app is in the foreground. |
| 754 | CollectorType foreground_collector_type_; |
Mathieu Chartier | e6da9af | 2013-12-16 11:54:42 -0800 | [diff] [blame] | 755 | // Which collector we will use when the app is notified of a transition to background. |
| 756 | CollectorType background_collector_type_; |
Mathieu Chartier | a5f9de0 | 2014-02-28 16:48:42 -0800 | [diff] [blame] | 757 | // Desired collector type, heap trimming daemon transitions the heap if it is != collector_type_. |
| 758 | CollectorType desired_collector_type_; |
| 759 | |
| 760 | // Lock which guards heap trim requests. |
| 761 | Mutex* heap_trim_request_lock_ DEFAULT_MUTEX_ACQUIRED_AFTER; |
| 762 | // When we want to perform the next heap trim (nano seconds). |
Mathieu Chartier | 7bf52d2 | 2014-03-13 14:46:09 -0700 | [diff] [blame] | 763 | uint64_t last_trim_time_ GUARDED_BY(heap_trim_request_lock_); |
Mathieu Chartier | a5f9de0 | 2014-02-28 16:48:42 -0800 | [diff] [blame] | 764 | // When we want to perform the next heap transition (nano seconds). |
| 765 | uint64_t heap_transition_target_time_ GUARDED_BY(heap_trim_request_lock_); |
| 766 | // If we have a heap trim request pending. |
| 767 | bool heap_trim_request_pending_ GUARDED_BY(heap_trim_request_lock_); |
Ian Rogers | 00f7d0e | 2012-07-19 15:28:27 -0700 | [diff] [blame] | 768 | |
Mathieu Chartier | 2775ee4 | 2013-08-20 17:43:47 -0700 | [diff] [blame] | 769 | // How many GC threads we may use for paused parts of garbage collection. |
| 770 | const size_t parallel_gc_threads_; |
| 771 | |
| 772 | // How many GC threads we may use for unpaused parts of garbage collection. |
| 773 | const size_t conc_gc_threads_; |
Mathieu Chartier | 63a5434 | 2013-07-23 13:17:59 -0700 | [diff] [blame] | 774 | |
Mathieu Chartier | e0a53e9 | 2013-08-05 10:17:40 -0700 | [diff] [blame] | 775 | // Boolean for if we are in low memory mode. |
| 776 | const bool low_memory_mode_; |
| 777 | |
Mathieu Chartier | 2775ee4 | 2013-08-20 17:43:47 -0700 | [diff] [blame] | 778 | // If we get a pause longer than long pause log threshold, then we print out the GC after it |
| 779 | // finishes. |
| 780 | const size_t long_pause_log_threshold_; |
| 781 | |
| 782 | // If we get a GC longer than long GC log threshold, then we print out the GC after it finishes. |
| 783 | const size_t long_gc_log_threshold_; |
| 784 | |
| 785 | // If we ignore the max footprint it lets the heap grow until it hits the heap capacity, this is |
| 786 | // useful for benchmarking since it reduces time spent in GC to a low %. |
| 787 | const bool ignore_max_footprint_; |
| 788 | |
Ian Rogers | 00f7d0e | 2012-07-19 15:28:27 -0700 | [diff] [blame] | 789 | // If we have a zygote space. |
| 790 | bool have_zygote_space_; |
| 791 | |
Mathieu Chartier | bd0a653 | 2014-02-27 11:14:21 -0800 | [diff] [blame] | 792 | // Minimum allocation size of large object. |
| 793 | size_t large_object_threshold_; |
| 794 | |
Ian Rogers | 00f7d0e | 2012-07-19 15:28:27 -0700 | [diff] [blame] | 795 | // Guards access to the state of GC, associated conditional variable is used to signal when a GC |
| 796 | // completes. |
| 797 | Mutex* gc_complete_lock_ DEFAULT_MUTEX_ACQUIRED_AFTER; |
| 798 | UniquePtr<ConditionVariable> gc_complete_cond_ GUARDED_BY(gc_complete_lock_); |
| 799 | |
Mathieu Chartier | 39e3261 | 2013-11-12 16:28:05 -0800 | [diff] [blame] | 800 | // Reference queues. |
| 801 | ReferenceQueue soft_reference_queue_; |
| 802 | ReferenceQueue weak_reference_queue_; |
| 803 | ReferenceQueue finalizer_reference_queue_; |
| 804 | ReferenceQueue phantom_reference_queue_; |
| 805 | ReferenceQueue cleared_references_; |
Mathieu Chartier | 02b6a78 | 2012-10-26 13:51:26 -0700 | [diff] [blame] | 806 | |
Carl Shapiro | 58551df | 2011-07-24 03:09:51 -0700 | [diff] [blame] | 807 | // True while the garbage collector is running. |
Mathieu Chartier | d5a89ee | 2014-01-31 09:55:13 -0800 | [diff] [blame] | 808 | volatile CollectorType collector_type_running_ GUARDED_BY(gc_complete_lock_); |
Mathieu Chartier | 866fb2a | 2012-09-10 10:47:49 -0700 | [diff] [blame] | 809 | |
| 810 | // Last Gc type we ran. Used by WaitForConcurrentGc to know which Gc was waited on. |
Ian Rogers | 1d54e73 | 2013-05-02 21:10:01 -0700 | [diff] [blame] | 811 | volatile collector::GcType last_gc_type_ GUARDED_BY(gc_complete_lock_); |
Mathieu Chartier | bdd0fb9 | 2013-07-02 10:16:15 -0700 | [diff] [blame] | 812 | collector::GcType next_gc_type_; |
Mathieu Chartier | 1c23e1e | 2012-10-12 14:14:11 -0700 | [diff] [blame] | 813 | |
Mathieu Chartier | 2fde533 | 2012-09-14 14:51:54 -0700 | [diff] [blame] | 814 | // Maximum size that the heap can reach. |
Ian Rogers | 1d54e73 | 2013-05-02 21:10:01 -0700 | [diff] [blame] | 815 | const size_t capacity_; |
Mathieu Chartier | 2775ee4 | 2013-08-20 17:43:47 -0700 | [diff] [blame] | 816 | |
Ian Rogers | 1d54e73 | 2013-05-02 21:10:01 -0700 | [diff] [blame] | 817 | // The size the heap is limited to. This is initially smaller than capacity, but for largeHeap |
| 818 | // programs it is "cleared" making it the same as capacity. |
Mathieu Chartier | 2fde533 | 2012-09-14 14:51:54 -0700 | [diff] [blame] | 819 | size_t growth_limit_; |
Mathieu Chartier | 2775ee4 | 2013-08-20 17:43:47 -0700 | [diff] [blame] | 820 | |
Ian Rogers | 1d54e73 | 2013-05-02 21:10:01 -0700 | [diff] [blame] | 821 | // When the number of bytes allocated exceeds the footprint TryAllocate returns NULL indicating |
| 822 | // a GC should be triggered. |
Mathieu Chartier | 1c23e1e | 2012-10-12 14:14:11 -0700 | [diff] [blame] | 823 | size_t max_allowed_footprint_; |
Mathieu Chartier | 2775ee4 | 2013-08-20 17:43:47 -0700 | [diff] [blame] | 824 | |
Mathieu Chartier | 987ccff | 2013-07-08 11:05:21 -0700 | [diff] [blame] | 825 | // The watermark at which a concurrent GC is requested by registerNativeAllocation. |
| 826 | size_t native_footprint_gc_watermark_; |
Mathieu Chartier | 2775ee4 | 2013-08-20 17:43:47 -0700 | [diff] [blame] | 827 | |
Mathieu Chartier | 987ccff | 2013-07-08 11:05:21 -0700 | [diff] [blame] | 828 | // The watermark at which a GC is performed inside of registerNativeAllocation. |
| 829 | size_t native_footprint_limit_; |
Mathieu Chartier | 2fde533 | 2012-09-14 14:51:54 -0700 | [diff] [blame] | 830 | |
Mathieu Chartier | 590fee9 | 2013-09-13 13:46:47 -0700 | [diff] [blame] | 831 | // Whether or not we need to run finalizers in the next native allocation. |
| 832 | bool native_need_to_run_finalization_; |
| 833 | |
Mathieu Chartier | c39e342 | 2013-08-07 16:41:36 -0700 | [diff] [blame] | 834 | // Whether or not we currently care about pause times. |
Mathieu Chartier | ca2a24d | 2013-11-25 15:12:12 -0800 | [diff] [blame] | 835 | ProcessState process_state_; |
Mathieu Chartier | c39e342 | 2013-08-07 16:41:36 -0700 | [diff] [blame] | 836 | |
Ian Rogers | 1d54e73 | 2013-05-02 21:10:01 -0700 | [diff] [blame] | 837 | // When num_bytes_allocated_ exceeds this amount then a concurrent GC should be requested so that |
| 838 | // it completes ahead of an allocation failing. |
Mathieu Chartier | 0051be6 | 2012-10-12 17:47:11 -0700 | [diff] [blame] | 839 | size_t concurrent_start_bytes_; |
Mathieu Chartier | 1c23e1e | 2012-10-12 14:14:11 -0700 | [diff] [blame] | 840 | |
Ian Rogers | 1d54e73 | 2013-05-02 21:10:01 -0700 | [diff] [blame] | 841 | // Since the heap was created, how many bytes have been freed. |
| 842 | size_t total_bytes_freed_ever_; |
| 843 | |
| 844 | // Since the heap was created, how many objects have been freed. |
| 845 | size_t total_objects_freed_ever_; |
Mathieu Chartier | 155dfe9 | 2012-10-09 14:24:49 -0700 | [diff] [blame] | 846 | |
Ian Rogers | 00f7d0e | 2012-07-19 15:28:27 -0700 | [diff] [blame] | 847 | // Number of bytes allocated. Adjusted after each allocation and free. |
Ian Rogers | ef7d42f | 2014-01-06 12:55:46 -0800 | [diff] [blame] | 848 | Atomic<size_t> num_bytes_allocated_; |
Ian Rogers | 00f7d0e | 2012-07-19 15:28:27 -0700 | [diff] [blame] | 849 | |
Mathieu Chartier | 987ccff | 2013-07-08 11:05:21 -0700 | [diff] [blame] | 850 | // Bytes which are allocated and managed by native code but still need to be accounted for. |
Ian Rogers | ef7d42f | 2014-01-06 12:55:46 -0800 | [diff] [blame] | 851 | Atomic<size_t> native_bytes_allocated_; |
Mathieu Chartier | 987ccff | 2013-07-08 11:05:21 -0700 | [diff] [blame] | 852 | |
Mathieu Chartier | 0a9dc05 | 2013-07-25 11:01:28 -0700 | [diff] [blame] | 853 | // Data structure GC overhead. |
Ian Rogers | ef7d42f | 2014-01-06 12:55:46 -0800 | [diff] [blame] | 854 | Atomic<size_t> gc_memory_overhead_; |
Mathieu Chartier | 0a9dc05 | 2013-07-25 11:01:28 -0700 | [diff] [blame] | 855 | |
Mathieu Chartier | fd678be | 2012-08-30 14:50:54 -0700 | [diff] [blame] | 856 | // Heap verification flags. |
Mathieu Chartier | c7b83a0 | 2012-09-11 18:07:39 -0700 | [diff] [blame] | 857 | const bool verify_missing_card_marks_; |
| 858 | const bool verify_system_weaks_; |
| 859 | const bool verify_pre_gc_heap_; |
Mathieu Chartier | 6f365cc | 2014-04-23 12:42:27 -0700 | [diff] [blame] | 860 | const bool verify_pre_sweeping_heap_; |
Mathieu Chartier | c7b83a0 | 2012-09-11 18:07:39 -0700 | [diff] [blame] | 861 | const bool verify_post_gc_heap_; |
Mathieu Chartier | fd678be | 2012-08-30 14:50:54 -0700 | [diff] [blame] | 862 | const bool verify_mod_union_table_; |
Hiroshi Yamauchi | a4adbfd | 2014-02-04 18:12:17 -0800 | [diff] [blame] | 863 | bool verify_pre_gc_rosalloc_; |
Mathieu Chartier | 6f365cc | 2014-04-23 12:42:27 -0700 | [diff] [blame] | 864 | bool verify_pre_sweeping_rosalloc_; |
Hiroshi Yamauchi | a4adbfd | 2014-02-04 18:12:17 -0800 | [diff] [blame] | 865 | bool verify_post_gc_rosalloc_; |
| 866 | |
| 867 | // RAII that temporarily disables the rosalloc verification during |
| 868 | // the zygote fork. |
| 869 | class ScopedDisableRosAllocVerification { |
| 870 | private: |
Mathieu Chartier | 6f365cc | 2014-04-23 12:42:27 -0700 | [diff] [blame] | 871 | Heap* const heap_; |
| 872 | const bool orig_verify_pre_gc_; |
| 873 | const bool orig_verify_pre_sweeping_; |
| 874 | const bool orig_verify_post_gc_; |
| 875 | |
Hiroshi Yamauchi | a4adbfd | 2014-02-04 18:12:17 -0800 | [diff] [blame] | 876 | public: |
| 877 | explicit ScopedDisableRosAllocVerification(Heap* heap) |
| 878 | : heap_(heap), |
| 879 | orig_verify_pre_gc_(heap_->verify_pre_gc_rosalloc_), |
Mathieu Chartier | 6f365cc | 2014-04-23 12:42:27 -0700 | [diff] [blame] | 880 | orig_verify_pre_sweeping_(heap_->verify_pre_sweeping_rosalloc_), |
Hiroshi Yamauchi | a4adbfd | 2014-02-04 18:12:17 -0800 | [diff] [blame] | 881 | orig_verify_post_gc_(heap_->verify_post_gc_rosalloc_) { |
| 882 | heap_->verify_pre_gc_rosalloc_ = false; |
Mathieu Chartier | 6f365cc | 2014-04-23 12:42:27 -0700 | [diff] [blame] | 883 | heap_->verify_pre_sweeping_rosalloc_ = false; |
Hiroshi Yamauchi | a4adbfd | 2014-02-04 18:12:17 -0800 | [diff] [blame] | 884 | heap_->verify_post_gc_rosalloc_ = false; |
| 885 | } |
| 886 | ~ScopedDisableRosAllocVerification() { |
| 887 | heap_->verify_pre_gc_rosalloc_ = orig_verify_pre_gc_; |
Mathieu Chartier | 6f365cc | 2014-04-23 12:42:27 -0700 | [diff] [blame] | 888 | heap_->verify_pre_sweeping_rosalloc_ = orig_verify_pre_sweeping_; |
Hiroshi Yamauchi | a4adbfd | 2014-02-04 18:12:17 -0800 | [diff] [blame] | 889 | heap_->verify_post_gc_rosalloc_ = orig_verify_post_gc_; |
| 890 | } |
| 891 | }; |
Mathieu Chartier | fd678be | 2012-08-30 14:50:54 -0700 | [diff] [blame] | 892 | |
Mathieu Chartier | 02b6a78 | 2012-10-26 13:51:26 -0700 | [diff] [blame] | 893 | // Parallel GC data structures. |
| 894 | UniquePtr<ThreadPool> thread_pool_; |
| 895 | |
Ian Rogers | 1d54e73 | 2013-05-02 21:10:01 -0700 | [diff] [blame] | 896 | // The nanosecond time at which the last GC ended. |
| 897 | uint64_t last_gc_time_ns_; |
Mathieu Chartier | 65db880 | 2012-11-20 12:36:46 -0800 | [diff] [blame] | 898 | |
| 899 | // How many bytes were allocated at the end of the last GC. |
| 900 | uint64_t last_gc_size_; |
| 901 | |
Ian Rogers | 1d54e73 | 2013-05-02 21:10:01 -0700 | [diff] [blame] | 902 | // Estimated allocation rate (bytes / second). Computed between the time of the last GC cycle |
| 903 | // and the start of the current one. |
Mathieu Chartier | 65db880 | 2012-11-20 12:36:46 -0800 | [diff] [blame] | 904 | uint64_t allocation_rate_; |
| 905 | |
Ian Rogers | 1d54e73 | 2013-05-02 21:10:01 -0700 | [diff] [blame] | 906 | // For a GC cycle, a bitmap that is set corresponding to the |
| 907 | UniquePtr<accounting::HeapBitmap> live_bitmap_ GUARDED_BY(Locks::heap_bitmap_lock_); |
| 908 | UniquePtr<accounting::HeapBitmap> mark_bitmap_ GUARDED_BY(Locks::heap_bitmap_lock_); |
Mathieu Chartier | b062fdd | 2012-07-03 09:51:48 -0700 | [diff] [blame] | 909 | |
Mathieu Chartier | e0f0cb3 | 2012-08-28 11:26:00 -0700 | [diff] [blame] | 910 | // Mark stack that we reuse to avoid re-allocating the mark stack. |
Ian Rogers | 1d54e73 | 2013-05-02 21:10:01 -0700 | [diff] [blame] | 911 | UniquePtr<accounting::ObjectStack> mark_stack_; |
Mathieu Chartier | 5301cd2 | 2012-05-31 12:11:36 -0700 | [diff] [blame] | 912 | |
Mathieu Chartier | 357e9be | 2012-08-01 11:00:14 -0700 | [diff] [blame] | 913 | // Allocation stack, new allocations go here so that we can do sticky mark bits. This enables us |
| 914 | // to use the live bitmap as the old mark bitmap. |
Mathieu Chartier | d8195f1 | 2012-10-05 12:21:28 -0700 | [diff] [blame] | 915 | const size_t max_allocation_stack_size_; |
Ian Rogers | 1d54e73 | 2013-05-02 21:10:01 -0700 | [diff] [blame] | 916 | UniquePtr<accounting::ObjectStack> allocation_stack_; |
Mathieu Chartier | 357e9be | 2012-08-01 11:00:14 -0700 | [diff] [blame] | 917 | |
| 918 | // Second allocation stack so that we can process allocation with the heap unlocked. |
Ian Rogers | 1d54e73 | 2013-05-02 21:10:01 -0700 | [diff] [blame] | 919 | UniquePtr<accounting::ObjectStack> live_stack_; |
Mathieu Chartier | 357e9be | 2012-08-01 11:00:14 -0700 | [diff] [blame] | 920 | |
Mathieu Chartier | cbb2d20 | 2013-11-14 17:45:16 -0800 | [diff] [blame] | 921 | // Allocator type. |
Mathieu Chartier | 5048223 | 2013-11-21 11:48:14 -0800 | [diff] [blame] | 922 | AllocatorType current_allocator_; |
Mathieu Chartier | cbb2d20 | 2013-11-14 17:45:16 -0800 | [diff] [blame] | 923 | const AllocatorType current_non_moving_allocator_; |
| 924 | |
| 925 | // Which GCs we run in order when we an allocation fails. |
| 926 | std::vector<collector::GcType> gc_plan_; |
| 927 | |
Mathieu Chartier | 590fee9 | 2013-09-13 13:46:47 -0700 | [diff] [blame] | 928 | // Bump pointer spaces. |
| 929 | space::BumpPointerSpace* bump_pointer_space_; |
| 930 | // Temp space is the space which the semispace collector copies to. |
| 931 | space::BumpPointerSpace* temp_space_; |
| 932 | |
Mathieu Chartier | 0051be6 | 2012-10-12 17:47:11 -0700 | [diff] [blame] | 933 | // Minimum free guarantees that you always have at least min_free_ free bytes after growing for |
| 934 | // utilization, regardless of target utilization ratio. |
| 935 | size_t min_free_; |
| 936 | |
| 937 | // The ideal maximum free size, when we grow the heap for utilization. |
| 938 | size_t max_free_; |
| 939 | |
Brian Carlstrom | 395520e | 2011-09-25 19:35:00 -0700 | [diff] [blame] | 940 | // Target ideal heap utilization ratio |
Mathieu Chartier | 0051be6 | 2012-10-12 17:47:11 -0700 | [diff] [blame] | 941 | double target_utilization_; |
Brian Carlstrom | 395520e | 2011-09-25 19:35:00 -0700 | [diff] [blame] | 942 | |
Mathieu Chartier | 2f8da3e | 2014-04-15 15:37:02 -0700 | [diff] [blame] | 943 | // How much more we grow the heap when we are a foreground app instead of background. |
| 944 | double foreground_heap_growth_multiplier_; |
| 945 | |
Mathieu Chartier | 155dfe9 | 2012-10-09 14:24:49 -0700 | [diff] [blame] | 946 | // Total time which mutators are paused or waiting for GC to complete. |
Mathieu Chartier | 155dfe9 | 2012-10-09 14:24:49 -0700 | [diff] [blame] | 947 | uint64_t total_wait_time_; |
| 948 | |
| 949 | // Total number of objects allocated in microseconds. |
Mathieu Chartier | 155dfe9 | 2012-10-09 14:24:49 -0700 | [diff] [blame] | 950 | AtomicInteger total_allocation_time_; |
| 951 | |
Ian Rogers | 04d7aa9 | 2013-03-16 14:29:17 -0700 | [diff] [blame] | 952 | // The current state of heap verification, may be enabled or disabled. |
Mathieu Chartier | 4e30541 | 2014-02-19 10:54:44 -0800 | [diff] [blame] | 953 | VerifyObjectMode verify_object_mode_; |
Ian Rogers | 04d7aa9 | 2013-03-16 14:29:17 -0700 | [diff] [blame] | 954 | |
Mathieu Chartier | 1d27b34 | 2014-01-28 12:51:09 -0800 | [diff] [blame] | 955 | // Compacting GC disable count, prevents compacting GC from running iff > 0. |
| 956 | size_t disable_moving_gc_count_ GUARDED_BY(gc_complete_lock_); |
Mathieu Chartier | 590fee9 | 2013-09-13 13:46:47 -0700 | [diff] [blame] | 957 | |
| 958 | std::vector<collector::GarbageCollector*> garbage_collectors_; |
| 959 | collector::SemiSpace* semi_space_collector_; |
Hiroshi Yamauchi | d5307ec | 2014-03-27 21:07:51 -0700 | [diff] [blame] | 960 | collector::ConcurrentCopying* concurrent_copying_collector_; |
Brian Carlstrom | 1f87008 | 2011-08-23 16:02:11 -0700 | [diff] [blame] | 961 | |
Hiroshi Yamauchi | 50b2928 | 2013-07-30 13:58:37 -0700 | [diff] [blame] | 962 | const bool running_on_valgrind_; |
Mathieu Chartier | 692fafd | 2013-11-29 17:24:40 -0800 | [diff] [blame] | 963 | const bool use_tlab_; |
Hiroshi Yamauchi | 50b2928 | 2013-07-30 13:58:37 -0700 | [diff] [blame] | 964 | |
Mathieu Chartier | 6f365cc | 2014-04-23 12:42:27 -0700 | [diff] [blame] | 965 | friend class collector::GarbageCollector; |
Ian Rogers | 1d54e73 | 2013-05-02 21:10:01 -0700 | [diff] [blame] | 966 | friend class collector::MarkSweep; |
Mathieu Chartier | 590fee9 | 2013-09-13 13:46:47 -0700 | [diff] [blame] | 967 | friend class collector::SemiSpace; |
Mathieu Chartier | 39e3261 | 2013-11-12 16:28:05 -0800 | [diff] [blame] | 968 | friend class ReferenceQueue; |
Mathieu Chartier | c7b83a0 | 2012-09-11 18:07:39 -0700 | [diff] [blame] | 969 | friend class VerifyReferenceCardVisitor; |
Mathieu Chartier | fd678be | 2012-08-30 14:50:54 -0700 | [diff] [blame] | 970 | friend class VerifyReferenceVisitor; |
| 971 | friend class VerifyObjectVisitor; |
Mathieu Chartier | b43b7d4 | 2012-06-19 13:15:09 -0700 | [diff] [blame] | 972 | friend class ScopedHeapLock; |
Ian Rogers | 1d54e73 | 2013-05-02 21:10:01 -0700 | [diff] [blame] | 973 | friend class space::SpaceTest; |
Ian Rogers | 30fab40 | 2012-01-23 15:43:46 -0800 | [diff] [blame] | 974 | |
Hiroshi Yamauchi | 3b4c189 | 2013-09-12 21:33:12 -0700 | [diff] [blame] | 975 | class AllocationTimer { |
| 976 | private: |
| 977 | Heap* heap_; |
| 978 | mirror::Object** allocated_obj_ptr_; |
| 979 | uint64_t allocation_start_time_; |
| 980 | public: |
| 981 | AllocationTimer(Heap* heap, mirror::Object** allocated_obj_ptr); |
| 982 | ~AllocationTimer(); |
| 983 | }; |
| 984 | |
Carl Shapiro | 69759ea | 2011-07-21 18:13:35 -0700 | [diff] [blame] | 985 | DISALLOW_IMPLICIT_CONSTRUCTORS(Heap); |
| 986 | }; |
| 987 | |
Ian Rogers | 1d54e73 | 2013-05-02 21:10:01 -0700 | [diff] [blame] | 988 | } // namespace gc |
Carl Shapiro | 1fb8620 | 2011-06-27 17:43:13 -0700 | [diff] [blame] | 989 | } // namespace art |
| 990 | |
Brian Carlstrom | fc0e321 | 2013-07-17 14:40:12 -0700 | [diff] [blame] | 991 | #endif // ART_RUNTIME_GC_HEAP_H_ |