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 | d582fa4 | 2014-11-05 23:46:43 -0800 | [diff] [blame] | 25 | #include "arch/instruction_set.h" |
Ian Rogers | ef7d42f | 2014-01-06 12:55:46 -0800 | [diff] [blame] | 26 | #include "atomic.h" |
Sameer Abu Asal | a843954 | 2013-02-14 16:06:42 -0800 | [diff] [blame] | 27 | #include "base/timing_logger.h" |
Ian Rogers | 1d54e73 | 2013-05-02 21:10:01 -0700 | [diff] [blame] | 28 | #include "gc/accounting/atomic_stack.h" |
| 29 | #include "gc/accounting/card_table.h" |
Hiroshi Yamauchi | 2cd334a | 2015-01-09 14:03:35 -0800 | [diff] [blame] | 30 | #include "gc/accounting/read_barrier_table.h" |
Hiroshi Yamauchi | 6f4ffe4 | 2014-01-13 12:30:44 -0800 | [diff] [blame] | 31 | #include "gc/gc_cause.h" |
Mathieu Chartier | 10fb83a | 2014-06-15 15:15:43 -0700 | [diff] [blame] | 32 | #include "gc/collector/garbage_collector.h" |
Ian Rogers | 1d54e73 | 2013-05-02 21:10:01 -0700 | [diff] [blame] | 33 | #include "gc/collector/gc_type.h" |
Mathieu Chartier | 0de9f73 | 2013-11-22 17:58:48 -0800 | [diff] [blame] | 34 | #include "gc/collector_type.h" |
Mathieu Chartier | 2dbe627 | 2014-09-16 10:43:23 -0700 | [diff] [blame] | 35 | #include "gc/space/large_object_space.h" |
Brian Carlstrom | 578bbdc | 2011-07-21 14:07:47 -0700 | [diff] [blame] | 36 | #include "globals.h" |
Mathieu Chartier | c39e342 | 2013-08-07 16:41:36 -0700 | [diff] [blame] | 37 | #include "jni.h" |
Mathieu Chartier | 83c8ee0 | 2014-01-28 14:50:23 -0800 | [diff] [blame] | 38 | #include "object_callbacks.h" |
Ian Rogers | 0cfe1fb | 2011-08-26 03:29:44 -0700 | [diff] [blame] | 39 | #include "offsets.h" |
Mathieu Chartier | 78f7b4c | 2014-05-06 10:57:27 -0700 | [diff] [blame] | 40 | #include "reference_processor.h" |
Mathieu Chartier | b062fdd | 2012-07-03 09:51:48 -0700 | [diff] [blame] | 41 | #include "safe_map.h" |
Mathieu Chartier | 02b6a78 | 2012-10-26 13:51:26 -0700 | [diff] [blame] | 42 | #include "thread_pool.h" |
Mathieu Chartier | 4e30541 | 2014-02-19 10:54:44 -0800 | [diff] [blame] | 43 | #include "verify_object.h" |
Carl Shapiro | 1fb8620 | 2011-06-27 17:43:13 -0700 | [diff] [blame] | 44 | |
| 45 | namespace art { |
Ian Rogers | 1d54e73 | 2013-05-02 21:10:01 -0700 | [diff] [blame] | 46 | |
Ian Rogers | 81d425b | 2012-09-27 16:03:43 -0700 | [diff] [blame] | 47 | class ConditionVariable; |
Ian Rogers | 81d425b | 2012-09-27 16:03:43 -0700 | [diff] [blame] | 48 | class Mutex; |
Ian Rogers | 40e3bac | 2012-11-20 00:09:14 -0800 | [diff] [blame] | 49 | class StackVisitor; |
Mathieu Chartier | 5301cd2 | 2012-05-31 12:11:36 -0700 | [diff] [blame] | 50 | class Thread; |
Mathieu Chartier | 357e9be | 2012-08-01 11:00:14 -0700 | [diff] [blame] | 51 | class TimingLogger; |
Carl Shapiro | 69759ea | 2011-07-21 18:13:35 -0700 | [diff] [blame] | 52 | |
Ian Rogers | 1d54e73 | 2013-05-02 21:10:01 -0700 | [diff] [blame] | 53 | namespace mirror { |
| 54 | class Class; |
| 55 | class Object; |
| 56 | } // namespace mirror |
| 57 | |
| 58 | namespace gc { |
Mathieu Chartier | 78f7b4c | 2014-05-06 10:57:27 -0700 | [diff] [blame] | 59 | |
| 60 | class ReferenceProcessor; |
Mathieu Chartier | a5eae69 | 2014-12-17 17:56:03 -0800 | [diff] [blame] | 61 | class TaskProcessor; |
Mathieu Chartier | 78f7b4c | 2014-05-06 10:57:27 -0700 | [diff] [blame] | 62 | |
Ian Rogers | 1d54e73 | 2013-05-02 21:10:01 -0700 | [diff] [blame] | 63 | namespace accounting { |
| 64 | class HeapBitmap; |
| 65 | class ModUnionTable; |
Hiroshi Yamauchi | 38e68e9 | 2014-03-07 13:59:08 -0800 | [diff] [blame] | 66 | class RememberedSet; |
Ian Rogers | 1d54e73 | 2013-05-02 21:10:01 -0700 | [diff] [blame] | 67 | } // namespace accounting |
| 68 | |
| 69 | namespace collector { |
Hiroshi Yamauchi | d5307ec | 2014-03-27 21:07:51 -0700 | [diff] [blame] | 70 | class ConcurrentCopying; |
Ian Rogers | 1d54e73 | 2013-05-02 21:10:01 -0700 | [diff] [blame] | 71 | class GarbageCollector; |
Mathieu Chartier | 52e4b43 | 2014-06-10 11:22:31 -0700 | [diff] [blame] | 72 | class MarkCompact; |
Ian Rogers | 1d54e73 | 2013-05-02 21:10:01 -0700 | [diff] [blame] | 73 | class MarkSweep; |
Mathieu Chartier | 590fee9 | 2013-09-13 13:46:47 -0700 | [diff] [blame] | 74 | class SemiSpace; |
Ian Rogers | 1d54e73 | 2013-05-02 21:10:01 -0700 | [diff] [blame] | 75 | } // namespace collector |
| 76 | |
Zuo Wang | f37a88b | 2014-07-10 04:26:41 -0700 | [diff] [blame] | 77 | namespace allocator { |
| 78 | class RosAlloc; |
| 79 | } // namespace allocator |
| 80 | |
Ian Rogers | 1d54e73 | 2013-05-02 21:10:01 -0700 | [diff] [blame] | 81 | namespace space { |
| 82 | class AllocSpace; |
Mathieu Chartier | 590fee9 | 2013-09-13 13:46:47 -0700 | [diff] [blame] | 83 | class BumpPointerSpace; |
Mathieu Chartier | e4cab17 | 2014-08-19 18:24:04 -0700 | [diff] [blame] | 84 | class ContinuousMemMapAllocSpace; |
Ian Rogers | 1d54e73 | 2013-05-02 21:10:01 -0700 | [diff] [blame] | 85 | class DiscontinuousSpace; |
| 86 | class DlMallocSpace; |
| 87 | class ImageSpace; |
| 88 | class LargeObjectSpace; |
Hiroshi Yamauchi | cf58d4a | 2013-09-26 14:21:22 -0700 | [diff] [blame] | 89 | class MallocSpace; |
Hiroshi Yamauchi | 2cd334a | 2015-01-09 14:03:35 -0800 | [diff] [blame] | 90 | class RegionSpace; |
Hiroshi Yamauchi | cf58d4a | 2013-09-26 14:21:22 -0700 | [diff] [blame] | 91 | class RosAllocSpace; |
Ian Rogers | 1d54e73 | 2013-05-02 21:10:01 -0700 | [diff] [blame] | 92 | class Space; |
| 93 | class SpaceTest; |
Mathieu Chartier | e4cab17 | 2014-08-19 18:24:04 -0700 | [diff] [blame] | 94 | class ZygoteSpace; |
Ian Rogers | 1d54e73 | 2013-05-02 21:10:01 -0700 | [diff] [blame] | 95 | } // namespace space |
Mathieu Chartier | b062fdd | 2012-07-03 09:51:48 -0700 | [diff] [blame] | 96 | |
Mathieu Chartier | d22d548 | 2012-11-06 17:14:12 -0800 | [diff] [blame] | 97 | class AgeCardVisitor { |
| 98 | public: |
Ian Rogers | 1373595 | 2014-10-08 12:43:28 -0700 | [diff] [blame] | 99 | uint8_t operator()(uint8_t card) const { |
Ian Rogers | 1d54e73 | 2013-05-02 21:10:01 -0700 | [diff] [blame] | 100 | if (card == accounting::CardTable::kCardDirty) { |
Mathieu Chartier | d22d548 | 2012-11-06 17:14:12 -0800 | [diff] [blame] | 101 | return card - 1; |
| 102 | } else { |
| 103 | return 0; |
| 104 | } |
| 105 | } |
| 106 | }; |
| 107 | |
Zuo Wang | f37a88b | 2014-07-10 04:26:41 -0700 | [diff] [blame] | 108 | enum HomogeneousSpaceCompactResult { |
| 109 | // Success. |
| 110 | kSuccess, |
| 111 | // Reject due to disabled moving GC. |
| 112 | kErrorReject, |
| 113 | // System is shutting down. |
| 114 | kErrorVMShuttingDown, |
| 115 | }; |
| 116 | |
Hiroshi Yamauchi | cf58d4a | 2013-09-26 14:21:22 -0700 | [diff] [blame] | 117 | // If true, use rosalloc/RosAllocSpace instead of dlmalloc/DlMallocSpace |
Hiroshi Yamauchi | d31fb97 | 2013-11-19 11:08:27 -0800 | [diff] [blame] | 118 | static constexpr bool kUseRosAlloc = true; |
Hiroshi Yamauchi | cf58d4a | 2013-09-26 14:21:22 -0700 | [diff] [blame] | 119 | |
Hiroshi Yamauchi | f5b0e20 | 2014-02-11 17:02:22 -0800 | [diff] [blame] | 120 | // If true, use thread-local allocation stack. |
| 121 | static constexpr bool kUseThreadLocalAllocationStack = true; |
| 122 | |
Mathieu Chartier | ca2a24d | 2013-11-25 15:12:12 -0800 | [diff] [blame] | 123 | // The process state passed in from the activity manager, used to determine when to do trimming |
| 124 | // and compaction. |
| 125 | enum ProcessState { |
| 126 | kProcessStateJankPerceptible = 0, |
| 127 | kProcessStateJankImperceptible = 1, |
| 128 | }; |
Mathieu Chartier | e6da9af | 2013-12-16 11:54:42 -0800 | [diff] [blame] | 129 | std::ostream& operator<<(std::ostream& os, const ProcessState& process_state); |
Mathieu Chartier | ca2a24d | 2013-11-25 15:12:12 -0800 | [diff] [blame] | 130 | |
Ian Rogers | 50b35e2 | 2012-10-04 10:09:15 -0700 | [diff] [blame] | 131 | class Heap { |
Carl Shapiro | 1fb8620 | 2011-06-27 17:43:13 -0700 | [diff] [blame] | 132 | public: |
Mathieu Chartier | 590fee9 | 2013-09-13 13:46:47 -0700 | [diff] [blame] | 133 | // If true, measure the total allocation time. |
| 134 | static constexpr bool kMeasureAllocationTime = false; |
Hiroshi Yamauchi | 5ccd498 | 2014-03-11 12:19:04 -0700 | [diff] [blame] | 135 | static constexpr size_t kDefaultStartingSize = kPageSize; |
Mathieu Chartier | 720ef76 | 2013-08-17 14:46:54 -0700 | [diff] [blame] | 136 | static constexpr size_t kDefaultInitialSize = 2 * MB; |
Mathieu Chartier | 2f4f0a3 | 2014-07-10 17:50:34 -0700 | [diff] [blame] | 137 | static constexpr size_t kDefaultMaximumSize = 256 * MB; |
Mathieu Chartier | 6a7824d | 2014-08-22 14:53:04 -0700 | [diff] [blame] | 138 | static constexpr size_t kDefaultNonMovingSpaceCapacity = 64 * MB; |
Mathieu Chartier | 720ef76 | 2013-08-17 14:46:54 -0700 | [diff] [blame] | 139 | static constexpr size_t kDefaultMaxFree = 2 * MB; |
| 140 | static constexpr size_t kDefaultMinFree = kDefaultMaxFree / 4; |
Mathieu Chartier | 2775ee4 | 2013-08-20 17:43:47 -0700 | [diff] [blame] | 141 | static constexpr size_t kDefaultLongPauseLogThreshold = MsToNs(5); |
| 142 | static constexpr size_t kDefaultLongGCLogThreshold = MsToNs(100); |
Mathieu Chartier | 692fafd | 2013-11-29 17:24:40 -0800 | [diff] [blame] | 143 | static constexpr size_t kDefaultTLABSize = 256 * KB; |
Mathieu Chartier | 720ef76 | 2013-08-17 14:46:54 -0700 | [diff] [blame] | 144 | static constexpr double kDefaultTargetUtilization = 0.5; |
Mathieu Chartier | 2f8da3e | 2014-04-15 15:37:02 -0700 | [diff] [blame] | 145 | static constexpr double kDefaultHeapGrowthMultiplier = 2.0; |
Mathieu Chartier | 2dbe627 | 2014-09-16 10:43:23 -0700 | [diff] [blame] | 146 | // Primitive arrays larger than this size are put in the large object space. |
| 147 | static constexpr size_t kDefaultLargeObjectThreshold = 3 * kPageSize; |
| 148 | // Whether or not we use the free list large object space. Only use it if USE_ART_LOW_4G_ALLOCATOR |
| 149 | // since this means that we have to use the slow msync loop in MemMap::MapAnonymous. |
| 150 | #if USE_ART_LOW_4G_ALLOCATOR |
| 151 | static constexpr space::LargeObjectSpaceType kDefaultLargeObjectSpaceType = |
| 152 | space::kLargeObjectSpaceTypeFreeList; |
| 153 | #else |
| 154 | static constexpr space::LargeObjectSpaceType kDefaultLargeObjectSpaceType = |
| 155 | space::kLargeObjectSpaceTypeMap; |
| 156 | #endif |
Mathieu Chartier | 155dfe9 | 2012-10-09 14:24:49 -0700 | [diff] [blame] | 157 | // Used so that we don't overflow the allocation time atomic integer. |
Mathieu Chartier | 720ef76 | 2013-08-17 14:46:54 -0700 | [diff] [blame] | 158 | static constexpr size_t kTimeAdjust = 1024; |
Carl Shapiro | 69759ea | 2011-07-21 18:13:35 -0700 | [diff] [blame] | 159 | |
Mathieu Chartier | 7bf52d2 | 2014-03-13 14:46:09 -0700 | [diff] [blame] | 160 | // How often we allow heap trimming to happen (nanoseconds). |
Mathieu Chartier | a5f9de0 | 2014-02-28 16:48:42 -0800 | [diff] [blame] | 161 | static constexpr uint64_t kHeapTrimWait = MsToNs(5000); |
Mathieu Chartier | 7bf52d2 | 2014-03-13 14:46:09 -0700 | [diff] [blame] | 162 | // How long we wait after a transition request to perform a collector transition (nanoseconds). |
| 163 | static constexpr uint64_t kCollectorTransitionWait = MsToNs(5000); |
Mathieu Chartier | a5f9de0 | 2014-02-28 16:48:42 -0800 | [diff] [blame] | 164 | |
Brian Carlstrom | 58ae941 | 2011-10-04 00:56:06 -0700 | [diff] [blame] | 165 | // Create a heap with the requested sizes. The possible empty |
| 166 | // image_file_names names specify Spaces to load based on |
| 167 | // ImageWriter output. |
Mathieu Chartier | 0051be6 | 2012-10-12 17:47:11 -0700 | [diff] [blame] | 168 | 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] | 169 | size_t max_free, double target_utilization, |
| 170 | double foreground_heap_growth_multiplier, size_t capacity, |
Mathieu Chartier | 6a7824d | 2014-08-22 14:53:04 -0700 | [diff] [blame] | 171 | size_t non_moving_space_capacity, |
Mathieu Chartier | e6da9af | 2013-12-16 11:54:42 -0800 | [diff] [blame] | 172 | const std::string& original_image_file_name, |
Brian Carlstrom | 2afe494 | 2014-05-19 10:25:33 -0700 | [diff] [blame] | 173 | InstructionSet image_instruction_set, |
Mathieu Chartier | 31f4414 | 2014-04-08 14:40:03 -0700 | [diff] [blame] | 174 | CollectorType foreground_collector_type, CollectorType background_collector_type, |
Mathieu Chartier | 2dbe627 | 2014-09-16 10:43:23 -0700 | [diff] [blame] | 175 | space::LargeObjectSpaceType large_object_space_type, size_t large_object_threshold, |
Mathieu Chartier | 2775ee4 | 2013-08-20 17:43:47 -0700 | [diff] [blame] | 176 | 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] | 177 | size_t long_pause_threshold, size_t long_gc_threshold, |
Mathieu Chartier | 6f365cc | 2014-04-23 12:42:27 -0700 | [diff] [blame] | 178 | bool ignore_max_footprint, bool use_tlab, |
| 179 | bool verify_pre_gc_heap, bool verify_pre_sweeping_heap, bool verify_post_gc_heap, |
| 180 | bool verify_pre_gc_rosalloc, bool verify_pre_sweeping_rosalloc, |
Zuo Wang | f37a88b | 2014-07-10 04:26:41 -0700 | [diff] [blame] | 181 | bool verify_post_gc_rosalloc, bool use_homogeneous_space_compaction, |
| 182 | uint64_t min_interval_homogeneous_space_compaction_by_oom); |
Carl Shapiro | 61e019d | 2011-07-14 16:53:09 -0700 | [diff] [blame] | 183 | |
Elliott Hughes | b3bd5f0 | 2012-03-08 21:05:27 -0800 | [diff] [blame] | 184 | ~Heap(); |
Brian Carlstrom | a7f4f48 | 2011-07-17 17:01:34 -0700 | [diff] [blame] | 185 | |
Brian Carlstrom | a40f9bc | 2011-07-26 21:26:07 -0700 | [diff] [blame] | 186 | // Allocates and initializes storage for an object instance. |
Hiroshi Yamauchi | 4cd662e | 2014-04-03 16:28:10 -0700 | [diff] [blame] | 187 | template <bool kInstrumented, typename PreFenceVisitor> |
Ian Rogers | 6fac447 | 2014-02-25 17:01:10 -0800 | [diff] [blame] | 188 | mirror::Object* AllocObject(Thread* self, mirror::Class* klass, size_t num_bytes, |
Hiroshi Yamauchi | 4cd662e | 2014-04-03 16:28:10 -0700 | [diff] [blame] | 189 | const PreFenceVisitor& pre_fence_visitor) |
Hiroshi Yamauchi | 3b4c189 | 2013-09-12 21:33:12 -0700 | [diff] [blame] | 190 | SHARED_LOCKS_REQUIRED(Locks::mutator_lock_) { |
Mathieu Chartier | 692fafd | 2013-11-29 17:24:40 -0800 | [diff] [blame] | 191 | return AllocObjectWithAllocator<kInstrumented, true>(self, klass, num_bytes, |
Ian Rogers | 6fac447 | 2014-02-25 17:01:10 -0800 | [diff] [blame] | 192 | GetCurrentAllocator(), |
| 193 | pre_fence_visitor); |
Hiroshi Yamauchi | 3b4c189 | 2013-09-12 21:33:12 -0700 | [diff] [blame] | 194 | } |
Ian Rogers | 6fac447 | 2014-02-25 17:01:10 -0800 | [diff] [blame] | 195 | |
Hiroshi Yamauchi | 4cd662e | 2014-04-03 16:28:10 -0700 | [diff] [blame] | 196 | template <bool kInstrumented, typename PreFenceVisitor> |
Ian Rogers | 6fac447 | 2014-02-25 17:01:10 -0800 | [diff] [blame] | 197 | mirror::Object* AllocNonMovableObject(Thread* self, mirror::Class* klass, size_t num_bytes, |
Hiroshi Yamauchi | 4cd662e | 2014-04-03 16:28:10 -0700 | [diff] [blame] | 198 | const PreFenceVisitor& pre_fence_visitor) |
Mathieu Chartier | 590fee9 | 2013-09-13 13:46:47 -0700 | [diff] [blame] | 199 | SHARED_LOCKS_REQUIRED(Locks::mutator_lock_) { |
Mathieu Chartier | 692fafd | 2013-11-29 17:24:40 -0800 | [diff] [blame] | 200 | return AllocObjectWithAllocator<kInstrumented, true>(self, klass, num_bytes, |
Ian Rogers | 6fac447 | 2014-02-25 17:01:10 -0800 | [diff] [blame] | 201 | GetCurrentNonMovingAllocator(), |
| 202 | pre_fence_visitor); |
Mathieu Chartier | 590fee9 | 2013-09-13 13:46:47 -0700 | [diff] [blame] | 203 | } |
Ian Rogers | 6fac447 | 2014-02-25 17:01:10 -0800 | [diff] [blame] | 204 | |
Hiroshi Yamauchi | 4cd662e | 2014-04-03 16:28:10 -0700 | [diff] [blame] | 205 | template <bool kInstrumented, bool kCheckLargeObject, typename PreFenceVisitor> |
Mathieu Chartier | 1febddf | 2013-11-20 12:33:14 -0800 | [diff] [blame] | 206 | ALWAYS_INLINE mirror::Object* AllocObjectWithAllocator( |
| 207 | Thread* self, mirror::Class* klass, size_t byte_count, AllocatorType allocator, |
Hiroshi Yamauchi | 4cd662e | 2014-04-03 16:28:10 -0700 | [diff] [blame] | 208 | const PreFenceVisitor& pre_fence_visitor) |
Mathieu Chartier | 590fee9 | 2013-09-13 13:46:47 -0700 | [diff] [blame] | 209 | SHARED_LOCKS_REQUIRED(Locks::mutator_lock_); |
Mathieu Chartier | cbb2d20 | 2013-11-14 17:45:16 -0800 | [diff] [blame] | 210 | |
| 211 | AllocatorType GetCurrentAllocator() const { |
| 212 | return current_allocator_; |
| 213 | } |
| 214 | |
| 215 | AllocatorType GetCurrentNonMovingAllocator() const { |
| 216 | return current_non_moving_allocator_; |
| 217 | } |
Hiroshi Yamauchi | 3b4c189 | 2013-09-12 21:33:12 -0700 | [diff] [blame] | 218 | |
Mathieu Chartier | 590fee9 | 2013-09-13 13:46:47 -0700 | [diff] [blame] | 219 | // Visit all of the live objects in the heap. |
Mathieu Chartier | 83c8ee0 | 2014-01-28 14:50:23 -0800 | [diff] [blame] | 220 | void VisitObjects(ObjectCallback callback, void* arg) |
Hiroshi Yamauchi | 0c8c303 | 2015-01-16 16:54:35 -0800 | [diff] [blame] | 221 | SHARED_LOCKS_REQUIRED(Locks::mutator_lock_) |
| 222 | LOCKS_EXCLUDED(Locks::heap_bitmap_lock_); |
Hiroshi Yamauchi | 2cd334a | 2015-01-09 14:03:35 -0800 | [diff] [blame] | 223 | void VisitObjectsPaused(ObjectCallback callback, void* arg) |
| 224 | EXCLUSIVE_LOCKS_REQUIRED(Locks::mutator_lock_) |
Hiroshi Yamauchi | 0c8c303 | 2015-01-16 16:54:35 -0800 | [diff] [blame] | 225 | LOCKS_EXCLUDED(Locks::heap_bitmap_lock_); |
Mathieu Chartier | 590fee9 | 2013-09-13 13:46:47 -0700 | [diff] [blame] | 226 | |
Mathieu Chartier | c645f1d | 2014-03-06 18:11:53 -0800 | [diff] [blame] | 227 | void CheckPreconditionsForAllocObject(mirror::Class* c, size_t byte_count) |
Hiroshi Yamauchi | 3b4c189 | 2013-09-12 21:33:12 -0700 | [diff] [blame] | 228 | SHARED_LOCKS_REQUIRED(Locks::mutator_lock_); |
Brian Carlstrom | a7f4f48 | 2011-07-17 17:01:34 -0700 | [diff] [blame] | 229 | |
Mathieu Chartier | 8ec31f9 | 2014-09-03 10:30:11 -0700 | [diff] [blame] | 230 | void RegisterNativeAllocation(JNIEnv* env, size_t bytes); |
| 231 | void RegisterNativeFree(JNIEnv* env, size_t bytes); |
Mathieu Chartier | 987ccff | 2013-07-08 11:05:21 -0700 | [diff] [blame] | 232 | |
Mathieu Chartier | 5048223 | 2013-11-21 11:48:14 -0800 | [diff] [blame] | 233 | // Change the allocator, updates entrypoints. |
Mathieu Chartier | d889178 | 2014-03-02 13:28:37 -0800 | [diff] [blame] | 234 | void ChangeAllocator(AllocatorType allocator) |
| 235 | EXCLUSIVE_LOCKS_REQUIRED(Locks::mutator_lock_) |
| 236 | LOCKS_EXCLUDED(Locks::runtime_shutdown_lock_); |
Mathieu Chartier | 5048223 | 2013-11-21 11:48:14 -0800 | [diff] [blame] | 237 | |
Mathieu Chartier | e6da9af | 2013-12-16 11:54:42 -0800 | [diff] [blame] | 238 | // Transition the garbage collector during runtime, may copy objects from one space to another. |
| 239 | void TransitionCollector(CollectorType collector_type); |
| 240 | |
Mathieu Chartier | 0de9f73 | 2013-11-22 17:58:48 -0800 | [diff] [blame] | 241 | // 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] | 242 | void ChangeCollector(CollectorType collector_type) |
| 243 | EXCLUSIVE_LOCKS_REQUIRED(Locks::mutator_lock_); |
Mathieu Chartier | 0de9f73 | 2013-11-22 17:58:48 -0800 | [diff] [blame] | 244 | |
Ian Rogers | 04d7aa9 | 2013-03-16 14:29:17 -0700 | [diff] [blame] | 245 | // 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] | 246 | // TODO: NO_THREAD_SAFETY_ANALYSIS since we call this everywhere and it is impossible to find a |
| 247 | // proper lock ordering for it. |
| 248 | void VerifyObjectBody(mirror::Object* o) NO_THREAD_SAFETY_ANALYSIS; |
Ian Rogers | 408f79a | 2011-08-23 18:22:33 -0700 | [diff] [blame] | 249 | |
Ian Rogers | 04d7aa9 | 2013-03-16 14:29:17 -0700 | [diff] [blame] | 250 | // Check sanity of all live references. |
Ian Rogers | f0bbeab | 2012-10-10 18:26:27 -0700 | [diff] [blame] | 251 | void VerifyHeap() LOCKS_EXCLUDED(Locks::heap_bitmap_lock_); |
Mathieu Chartier | 8ab7e78 | 2014-05-19 16:55:27 -0700 | [diff] [blame] | 252 | // Returns how many failures occured. |
| 253 | size_t VerifyHeapReferences(bool verify_referents = true) |
Hiroshi Yamauchi | 0c8c303 | 2015-01-16 16:54:35 -0800 | [diff] [blame] | 254 | EXCLUSIVE_LOCKS_REQUIRED(Locks::mutator_lock_); |
Mathieu Chartier | c7b83a0 | 2012-09-11 18:07:39 -0700 | [diff] [blame] | 255 | bool VerifyMissingCardMarks() |
Mathieu Chartier | c22c59e | 2014-02-24 15:16:06 -0800 | [diff] [blame] | 256 | EXCLUSIVE_LOCKS_REQUIRED(Locks::heap_bitmap_lock_, Locks::mutator_lock_); |
Ian Rogers | 0cfe1fb | 2011-08-26 03:29:44 -0700 | [diff] [blame] | 257 | |
Elliott Hughes | 6a5bd49 | 2011-10-28 14:33:57 -0700 | [diff] [blame] | 258 | // 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] | 259 | // and doesn't abort on error, allowing the caller to report more |
| 260 | // meaningful diagnostics. |
Mathieu Chartier | d68ac70 | 2014-02-11 14:50:51 -0800 | [diff] [blame] | 261 | bool IsValidObjectAddress(const mirror::Object* obj) const |
| 262 | SHARED_LOCKS_REQUIRED(Locks::mutator_lock_); |
Mathieu Chartier | 590fee9 | 2013-09-13 13:46:47 -0700 | [diff] [blame] | 263 | |
Mathieu Chartier | d68ac70 | 2014-02-11 14:50:51 -0800 | [diff] [blame] | 264 | // Faster alternative to IsHeapAddress since finding if an object is in the large object space is |
| 265 | // very slow. |
| 266 | bool IsNonDiscontinuousSpaceHeapAddress(const mirror::Object* obj) const |
| 267 | SHARED_LOCKS_REQUIRED(Locks::mutator_lock_); |
Elliott Hughes | b3bd5f0 | 2012-03-08 21:05:27 -0800 | [diff] [blame] | 268 | |
Elliott Hughes | 6a5bd49 | 2011-10-28 14:33:57 -0700 | [diff] [blame] | 269 | // Returns true if 'obj' is a live heap object, false otherwise (including for invalid addresses). |
| 270 | // Requires the heap lock to be held. |
Ian Rogers | ef7d42f | 2014-01-06 12:55:46 -0800 | [diff] [blame] | 271 | bool IsLiveObjectLocked(mirror::Object* obj, bool search_allocation_stack = true, |
Mathieu Chartier | 0f72e41 | 2013-09-06 16:40:01 -0700 | [diff] [blame] | 272 | bool search_live_stack = true, bool sorted = false) |
Ian Rogers | ef7d42f | 2014-01-06 12:55:46 -0800 | [diff] [blame] | 273 | SHARED_LOCKS_REQUIRED(Locks::heap_bitmap_lock_, Locks::mutator_lock_); |
Elliott Hughes | a250199 | 2011-08-26 19:39:54 -0700 | [diff] [blame] | 274 | |
Mathieu Chartier | 590fee9 | 2013-09-13 13:46:47 -0700 | [diff] [blame] | 275 | // Returns true if there is any chance that the object (obj) will move. |
Mathieu Chartier | 6a7824d | 2014-08-22 14:53:04 -0700 | [diff] [blame] | 276 | bool IsMovableObject(const mirror::Object* obj) const SHARED_LOCKS_REQUIRED(Locks::mutator_lock_); |
Mathieu Chartier | 590fee9 | 2013-09-13 13:46:47 -0700 | [diff] [blame] | 277 | |
Mathieu Chartier | 1d27b34 | 2014-01-28 12:51:09 -0800 | [diff] [blame] | 278 | // Enables us to compacting GC until objects are released. |
| 279 | void IncrementDisableMovingGC(Thread* self); |
| 280 | void DecrementDisableMovingGC(Thread* self); |
Mathieu Chartier | 590fee9 | 2013-09-13 13:46:47 -0700 | [diff] [blame] | 281 | |
Mathieu Chartier | 4aeec17 | 2014-03-27 16:09:46 -0700 | [diff] [blame] | 282 | // Clear all of the mark bits, doesn't clear bitmaps which have the same live bits as mark bits. |
| 283 | void ClearMarkedObjects() EXCLUSIVE_LOCKS_REQUIRED(Locks::heap_bitmap_lock_); |
| 284 | |
Carl Shapiro | 69759ea | 2011-07-21 18:13:35 -0700 | [diff] [blame] | 285 | // Initiates an explicit garbage collection. |
Mathieu Chartier | 412c7fc | 2014-02-07 12:18:39 -0800 | [diff] [blame] | 286 | void CollectGarbage(bool clear_soft_references); |
Carl Shapiro | 69759ea | 2011-07-21 18:13:35 -0700 | [diff] [blame] | 287 | |
Mathieu Chartier | 7664f5c | 2012-06-08 18:15:32 -0700 | [diff] [blame] | 288 | // Does a concurrent GC, should only be called by the GC daemon thread |
| 289 | // through runtime. |
Ian Rogers | f0bbeab | 2012-10-10 18:26:27 -0700 | [diff] [blame] | 290 | void ConcurrentGC(Thread* self) LOCKS_EXCLUDED(Locks::runtime_shutdown_lock_); |
Mathieu Chartier | 7664f5c | 2012-06-08 18:15:32 -0700 | [diff] [blame] | 291 | |
Elliott Hughes | ec0f83d | 2013-01-15 16:54:08 -0800 | [diff] [blame] | 292 | // Implements VMDebug.countInstancesOfClass and JDWP VM_InstanceCount. |
| 293 | // The boolean decides whether to use IsAssignableFrom or == when comparing classes. |
Ian Rogers | 2dd0e2c | 2013-01-24 12:42:14 -0800 | [diff] [blame] | 294 | 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] | 295 | uint64_t* counts) |
Ian Rogers | b726dcb | 2012-09-05 08:57:23 -0700 | [diff] [blame] | 296 | LOCKS_EXCLUDED(Locks::heap_bitmap_lock_) |
| 297 | SHARED_LOCKS_REQUIRED(Locks::mutator_lock_); |
Elliott Hughes | 3b78c94 | 2013-01-15 17:35:41 -0800 | [diff] [blame] | 298 | // Implements JDWP RT_Instances. |
Ian Rogers | 2dd0e2c | 2013-01-24 12:42:14 -0800 | [diff] [blame] | 299 | 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] | 300 | LOCKS_EXCLUDED(Locks::heap_bitmap_lock_) |
| 301 | SHARED_LOCKS_REQUIRED(Locks::mutator_lock_); |
Elliott Hughes | 0cbaff5 | 2013-01-16 15:28:01 -0800 | [diff] [blame] | 302 | // Implements JDWP OR_ReferringObjects. |
Ian Rogers | 2dd0e2c | 2013-01-24 12:42:14 -0800 | [diff] [blame] | 303 | 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] | 304 | LOCKS_EXCLUDED(Locks::heap_bitmap_lock_) |
| 305 | SHARED_LOCKS_REQUIRED(Locks::mutator_lock_); |
Elliott Hughes | 9d5ccec | 2011-09-19 13:19:50 -0700 | [diff] [blame] | 306 | |
Ian Rogers | 3bb17a6 | 2012-01-27 23:56:44 -0800 | [diff] [blame] | 307 | // Removes the growth limit on the alloc space so it may grow to its maximum capacity. Used to |
| 308 | // implement dalvik.system.VMRuntime.clearGrowthLimit. |
Elliott Hughes | b3bd5f0 | 2012-03-08 21:05:27 -0800 | [diff] [blame] | 309 | void ClearGrowthLimit(); |
jeffhao | c116070 | 2011-10-27 15:48:45 -0700 | [diff] [blame] | 310 | |
Mathieu Chartier | 379d09f | 2015-01-08 11:28:13 -0800 | [diff] [blame] | 311 | // Make the current growth limit the new maximum capacity, unmaps pages at the end of spaces |
| 312 | // which will never be used. Used to implement dalvik.system.VMRuntime.clampGrowthLimit. |
| 313 | void ClampGrowthLimit(); |
| 314 | |
Ian Rogers | 30fab40 | 2012-01-23 15:43:46 -0800 | [diff] [blame] | 315 | // Target ideal heap utilization ratio, implements |
| 316 | // dalvik.system.VMRuntime.getTargetHeapUtilization. |
Mathieu Chartier | 0051be6 | 2012-10-12 17:47:11 -0700 | [diff] [blame] | 317 | double GetTargetHeapUtilization() const { |
| 318 | return target_utilization_; |
| 319 | } |
Mathieu Chartier | 155dfe9 | 2012-10-09 14:24:49 -0700 | [diff] [blame] | 320 | |
Mathieu Chartier | 0a9dc05 | 2013-07-25 11:01:28 -0700 | [diff] [blame] | 321 | // Data structure memory usage tracking. |
| 322 | void RegisterGCAllocation(size_t bytes); |
| 323 | void RegisterGCDeAllocation(size_t bytes); |
| 324 | |
Mathieu Chartier | 1b54f9c | 2014-04-30 16:45:02 -0700 | [diff] [blame] | 325 | // Set the heap's private space pointers to be the same as the space based on it's type. Public |
| 326 | // due to usage by tests. |
| 327 | void SetSpaceAsDefault(space::ContinuousSpace* continuous_space) |
Mathieu Chartier | 73d1e17 | 2014-04-11 17:53:48 -0700 | [diff] [blame] | 328 | LOCKS_EXCLUDED(Locks::heap_bitmap_lock_); |
Mathieu Chartier | 1b54f9c | 2014-04-30 16:45:02 -0700 | [diff] [blame] | 329 | void AddSpace(space::Space* space) LOCKS_EXCLUDED(Locks::heap_bitmap_lock_); |
| 330 | void RemoveSpace(space::Space* space) LOCKS_EXCLUDED(Locks::heap_bitmap_lock_); |
Mathieu Chartier | 73d1e17 | 2014-04-11 17:53:48 -0700 | [diff] [blame] | 331 | |
Ian Rogers | 30fab40 | 2012-01-23 15:43:46 -0800 | [diff] [blame] | 332 | // Set target ideal heap utilization ratio, implements |
| 333 | // dalvik.system.VMRuntime.setTargetHeapUtilization. |
Mathieu Chartier | 155dfe9 | 2012-10-09 14:24:49 -0700 | [diff] [blame] | 334 | void SetTargetHeapUtilization(float target); |
Ian Rogers | 3bb17a6 | 2012-01-27 23:56:44 -0800 | [diff] [blame] | 335 | |
| 336 | // For the alloc space, sets the maximum number of bytes that the heap is allowed to allocate |
| 337 | // 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] | 338 | void SetIdealFootprint(size_t max_allowed_footprint); |
Elliott Hughes | 7ede61e | 2011-09-14 18:18:06 -0700 | [diff] [blame] | 339 | |
Mathieu Chartier | 590fee9 | 2013-09-13 13:46:47 -0700 | [diff] [blame] | 340 | // Blocks the caller until the garbage collector becomes idle and returns the type of GC we |
| 341 | // waited for. |
Mathieu Chartier | 89a201e | 2014-05-02 10:27:26 -0700 | [diff] [blame] | 342 | collector::GcType WaitForGcToComplete(GcCause cause, Thread* self) |
| 343 | LOCKS_EXCLUDED(gc_complete_lock_); |
Carl Shapiro | 69759ea | 2011-07-21 18:13:35 -0700 | [diff] [blame] | 344 | |
Mathieu Chartier | ca2a24d | 2013-11-25 15:12:12 -0800 | [diff] [blame] | 345 | // Update the heap's process state to a new value, may cause compaction to occur. |
| 346 | void UpdateProcessState(ProcessState process_state); |
| 347 | |
Ian Rogers | 1d54e73 | 2013-05-02 21:10:01 -0700 | [diff] [blame] | 348 | const std::vector<space::ContinuousSpace*>& GetContinuousSpaces() const { |
| 349 | return continuous_spaces_; |
Mathieu Chartier | 2b82db4 | 2012-11-14 17:29:05 -0800 | [diff] [blame] | 350 | } |
| 351 | |
Ian Rogers | 1d54e73 | 2013-05-02 21:10:01 -0700 | [diff] [blame] | 352 | const std::vector<space::DiscontinuousSpace*>& GetDiscontinuousSpaces() const { |
| 353 | return discontinuous_spaces_; |
Carl Shapiro | 58551df | 2011-07-24 03:09:51 -0700 | [diff] [blame] | 354 | } |
Carl Shapiro | 61e019d | 2011-07-14 16:53:09 -0700 | [diff] [blame] | 355 | |
Mathieu Chartier | 10fb83a | 2014-06-15 15:15:43 -0700 | [diff] [blame] | 356 | const collector::Iteration* GetCurrentGcIteration() const { |
| 357 | return ¤t_gc_iteration_; |
| 358 | } |
| 359 | collector::Iteration* GetCurrentGcIteration() { |
| 360 | return ¤t_gc_iteration_; |
| 361 | } |
| 362 | |
Ian Rogers | 04d7aa9 | 2013-03-16 14:29:17 -0700 | [diff] [blame] | 363 | // Enable verification of object references when the runtime is sufficiently initialized. |
Elliott Hughes | b3bd5f0 | 2012-03-08 21:05:27 -0800 | [diff] [blame] | 364 | void EnableObjectValidation() { |
Mathieu Chartier | 4e30541 | 2014-02-19 10:54:44 -0800 | [diff] [blame] | 365 | verify_object_mode_ = kVerifyObjectSupport; |
| 366 | if (verify_object_mode_ > kVerifyObjectModeDisabled) { |
Ian Rogers | 04d7aa9 | 2013-03-16 14:29:17 -0700 | [diff] [blame] | 367 | VerifyHeap(); |
| 368 | } |
Elliott Hughes | 85d1545 | 2011-09-16 17:33:01 -0700 | [diff] [blame] | 369 | } |
| 370 | |
Ian Rogers | 04d7aa9 | 2013-03-16 14:29:17 -0700 | [diff] [blame] | 371 | // Disable object reference verification for image writing. |
Elliott Hughes | b3bd5f0 | 2012-03-08 21:05:27 -0800 | [diff] [blame] | 372 | void DisableObjectValidation() { |
Mathieu Chartier | 4e30541 | 2014-02-19 10:54:44 -0800 | [diff] [blame] | 373 | verify_object_mode_ = kVerifyObjectModeDisabled; |
Ian Rogers | 0cfe1fb | 2011-08-26 03:29:44 -0700 | [diff] [blame] | 374 | } |
| 375 | |
Ian Rogers | 04d7aa9 | 2013-03-16 14:29:17 -0700 | [diff] [blame] | 376 | // 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] | 377 | bool IsObjectValidationEnabled() const { |
Mathieu Chartier | 4e30541 | 2014-02-19 10:54:44 -0800 | [diff] [blame] | 378 | return verify_object_mode_ > kVerifyObjectModeDisabled; |
Ian Rogers | 23435d0 | 2012-09-24 11:23:12 -0700 | [diff] [blame] | 379 | } |
| 380 | |
Mathieu Chartier | e0a53e9 | 2013-08-05 10:17:40 -0700 | [diff] [blame] | 381 | // Returns true if low memory mode is enabled. |
| 382 | bool IsLowMemoryMode() const { |
| 383 | return low_memory_mode_; |
| 384 | } |
| 385 | |
Mathieu Chartier | 2f8da3e | 2014-04-15 15:37:02 -0700 | [diff] [blame] | 386 | // Returns the heap growth multiplier, this affects how much we grow the heap after a GC. |
| 387 | // Scales heap growth, min free, and max free. |
| 388 | double HeapGrowthMultiplier() const; |
| 389 | |
Mathieu Chartier | e6da9af | 2013-12-16 11:54:42 -0800 | [diff] [blame] | 390 | // Freed bytes can be negative in cases where we copy objects from a compacted space to a |
| 391 | // free-list backed space. |
Mathieu Chartier | e76e70f | 2014-05-02 16:35:37 -0700 | [diff] [blame] | 392 | void RecordFree(uint64_t freed_objects, int64_t freed_bytes); |
Brian Carlstrom | 693267a | 2011-09-06 09:25:34 -0700 | [diff] [blame] | 393 | |
Elliott Hughes | 5ea047b | 2011-09-13 14:38:18 -0700 | [diff] [blame] | 394 | // Must be called if a field of an Object in the heap changes, and before any GC safe-point. |
| 395 | // The call is not needed if NULL is stored in the field. |
Mathieu Chartier | 2d2621a | 2014-10-23 16:48:06 -0700 | [diff] [blame] | 396 | ALWAYS_INLINE void WriteBarrierField(const mirror::Object* dst, MemberOffset /*offset*/, |
| 397 | const mirror::Object* /*new_value*/) { |
Mathieu Chartier | e35517a | 2012-10-30 18:49:55 -0700 | [diff] [blame] | 398 | card_table_->MarkCard(dst); |
Ian Rogers | 5d76c43 | 2011-10-31 21:42:49 -0700 | [diff] [blame] | 399 | } |
| 400 | |
| 401 | // Write barrier for array operations that update many field positions |
Mathieu Chartier | 2d2621a | 2014-10-23 16:48:06 -0700 | [diff] [blame] | 402 | ALWAYS_INLINE void WriteBarrierArray(const mirror::Object* dst, int /*start_offset*/, |
| 403 | size_t /*length TODO: element_count or byte_count?*/) { |
Mathieu Chartier | e35517a | 2012-10-30 18:49:55 -0700 | [diff] [blame] | 404 | card_table_->MarkCard(dst); |
Ian Rogers | 5d76c43 | 2011-10-31 21:42:49 -0700 | [diff] [blame] | 405 | } |
| 406 | |
Mathieu Chartier | 2d2621a | 2014-10-23 16:48:06 -0700 | [diff] [blame] | 407 | ALWAYS_INLINE void WriteBarrierEveryFieldOf(const mirror::Object* obj) { |
Mathieu Chartier | 0732d59 | 2013-11-06 11:02:50 -0800 | [diff] [blame] | 408 | card_table_->MarkCard(obj); |
| 409 | } |
| 410 | |
Ian Rogers | 1d54e73 | 2013-05-02 21:10:01 -0700 | [diff] [blame] | 411 | accounting::CardTable* GetCardTable() const { |
Mathieu Chartier | cc236d7 | 2012-07-20 10:29:05 -0700 | [diff] [blame] | 412 | return card_table_.get(); |
Ian Rogers | 5d76c43 | 2011-10-31 21:42:49 -0700 | [diff] [blame] | 413 | } |
| 414 | |
Hiroshi Yamauchi | 2cd334a | 2015-01-09 14:03:35 -0800 | [diff] [blame] | 415 | accounting::ReadBarrierTable* GetReadBarrierTable() const { |
| 416 | return rb_table_.get(); |
| 417 | } |
| 418 | |
Mathieu Chartier | 8668c3c | 2014-04-24 16:48:11 -0700 | [diff] [blame] | 419 | void AddFinalizerReference(Thread* self, mirror::Object** object); |
Elliott Hughes | adb460d | 2011-10-05 17:02:34 -0700 | [diff] [blame] | 420 | |
Ian Rogers | 1d54e73 | 2013-05-02 21:10:01 -0700 | [diff] [blame] | 421 | // Returns the number of bytes currently allocated. |
| 422 | size_t GetBytesAllocated() const { |
Ian Rogers | 3e5cf30 | 2014-05-20 16:40:37 -0700 | [diff] [blame] | 423 | return num_bytes_allocated_.LoadSequentiallyConsistent(); |
Ian Rogers | 1d54e73 | 2013-05-02 21:10:01 -0700 | [diff] [blame] | 424 | } |
| 425 | |
| 426 | // Returns the number of objects currently allocated. |
Mathieu Chartier | 590fee9 | 2013-09-13 13:46:47 -0700 | [diff] [blame] | 427 | size_t GetObjectsAllocated() const LOCKS_EXCLUDED(Locks::heap_bitmap_lock_); |
Mathieu Chartier | 7664f5c | 2012-06-08 18:15:32 -0700 | [diff] [blame] | 428 | |
Mathieu Chartier | 155dfe9 | 2012-10-09 14:24:49 -0700 | [diff] [blame] | 429 | // Returns the total number of objects allocated since the heap was created. |
Mathieu Chartier | dd162fb | 2014-08-06 17:06:33 -0700 | [diff] [blame] | 430 | uint64_t GetObjectsAllocatedEver() const; |
Mathieu Chartier | 155dfe9 | 2012-10-09 14:24:49 -0700 | [diff] [blame] | 431 | |
| 432 | // Returns the total number of bytes allocated since the heap was created. |
Mathieu Chartier | dd162fb | 2014-08-06 17:06:33 -0700 | [diff] [blame] | 433 | uint64_t GetBytesAllocatedEver() const; |
Mathieu Chartier | 155dfe9 | 2012-10-09 14:24:49 -0700 | [diff] [blame] | 434 | |
| 435 | // Returns the total number of objects freed since the heap was created. |
Mathieu Chartier | dd162fb | 2014-08-06 17:06:33 -0700 | [diff] [blame] | 436 | uint64_t GetObjectsFreedEver() const { |
Ian Rogers | 1d54e73 | 2013-05-02 21:10:01 -0700 | [diff] [blame] | 437 | return total_objects_freed_ever_; |
| 438 | } |
Mathieu Chartier | 155dfe9 | 2012-10-09 14:24:49 -0700 | [diff] [blame] | 439 | |
| 440 | // Returns the total number of bytes freed since the heap was created. |
Mathieu Chartier | dd162fb | 2014-08-06 17:06:33 -0700 | [diff] [blame] | 441 | uint64_t GetBytesFreedEver() const { |
Ian Rogers | 1d54e73 | 2013-05-02 21:10:01 -0700 | [diff] [blame] | 442 | return total_bytes_freed_ever_; |
| 443 | } |
Mathieu Chartier | 155dfe9 | 2012-10-09 14:24:49 -0700 | [diff] [blame] | 444 | |
Ian Rogers | 1d54e73 | 2013-05-02 21:10:01 -0700 | [diff] [blame] | 445 | // Implements java.lang.Runtime.maxMemory, returning the maximum amount of memory a program can |
| 446 | // consume. For a regular VM this would relate to the -Xmx option and would return -1 if no Xmx |
| 447 | // were specified. Android apps start with a growth limit (small heap size) which is |
| 448 | // cleared/extended for large apps. |
Ian Rogers | ef7d42f | 2014-01-06 12:55:46 -0800 | [diff] [blame] | 449 | size_t GetMaxMemory() const { |
Mathieu Chartier | dd162fb | 2014-08-06 17:06:33 -0700 | [diff] [blame] | 450 | // There is some race conditions in the allocation code that can cause bytes allocated to |
| 451 | // become larger than growth_limit_ in rare cases. |
| 452 | return std::max(GetBytesAllocated(), growth_limit_); |
Ian Rogers | 1d54e73 | 2013-05-02 21:10:01 -0700 | [diff] [blame] | 453 | } |
| 454 | |
Mathieu Chartier | dd162fb | 2014-08-06 17:06:33 -0700 | [diff] [blame] | 455 | // Implements java.lang.Runtime.totalMemory, returning approximate amount of memory currently |
| 456 | // consumed by an application. |
Ian Rogers | ef7d42f | 2014-01-06 12:55:46 -0800 | [diff] [blame] | 457 | size_t GetTotalMemory() const; |
Ian Rogers | 1d54e73 | 2013-05-02 21:10:01 -0700 | [diff] [blame] | 458 | |
Mathieu Chartier | dd162fb | 2014-08-06 17:06:33 -0700 | [diff] [blame] | 459 | // Returns approximately how much free memory we have until the next GC happens. |
| 460 | size_t GetFreeMemoryUntilGC() const { |
| 461 | return max_allowed_footprint_ - GetBytesAllocated(); |
| 462 | } |
| 463 | |
| 464 | // Returns approximately how much free memory we have until the next OOME happens. |
| 465 | size_t GetFreeMemoryUntilOOME() const { |
| 466 | return growth_limit_ - GetBytesAllocated(); |
| 467 | } |
| 468 | |
| 469 | // Returns how much free memory we have until we need to grow the heap to perform an allocation. |
| 470 | // Similar to GetFreeMemoryUntilGC. Implements java.lang.Runtime.freeMemory. |
Ian Rogers | ef7d42f | 2014-01-06 12:55:46 -0800 | [diff] [blame] | 471 | size_t GetFreeMemory() const { |
Mathieu Chartier | 146b187 | 2014-06-27 09:57:12 -0700 | [diff] [blame] | 472 | size_t byte_allocated = num_bytes_allocated_.LoadSequentiallyConsistent(); |
Mathieu Chartier | dd162fb | 2014-08-06 17:06:33 -0700 | [diff] [blame] | 473 | size_t total_memory = GetTotalMemory(); |
| 474 | // Make sure we don't get a negative number. |
| 475 | return total_memory - std::min(total_memory, byte_allocated); |
Ian Rogers | 1d54e73 | 2013-05-02 21:10:01 -0700 | [diff] [blame] | 476 | } |
| 477 | |
Mathieu Chartier | eb8167a | 2014-05-07 15:43:14 -0700 | [diff] [blame] | 478 | // get the space that corresponds to an object's address. Current implementation searches all |
Ian Rogers | 1d54e73 | 2013-05-02 21:10:01 -0700 | [diff] [blame] | 479 | // spaces in turn. If fail_ok is false then failing to find a space will cause an abort. |
| 480 | // TODO: consider using faster data structure like binary tree. |
| 481 | space::ContinuousSpace* FindContinuousSpaceFromObject(const mirror::Object*, bool fail_ok) const; |
| 482 | space::DiscontinuousSpace* FindDiscontinuousSpaceFromObject(const mirror::Object*, |
| 483 | bool fail_ok) const; |
| 484 | space::Space* FindSpaceFromObject(const mirror::Object*, bool fail_ok) const; |
Mathieu Chartier | b062fdd | 2012-07-03 09:51:48 -0700 | [diff] [blame] | 485 | |
Ian Rogers | 7b078e8 | 2014-09-10 14:44:24 -0700 | [diff] [blame] | 486 | void DumpForSigQuit(std::ostream& os); |
Mathieu Chartier | a5f9de0 | 2014-02-28 16:48:42 -0800 | [diff] [blame] | 487 | |
Mathieu Chartier | a5eae69 | 2014-12-17 17:56:03 -0800 | [diff] [blame] | 488 | // Do a pending collector transition. |
| 489 | void DoPendingCollectorTransition(); |
Mathieu Chartier | a5f9de0 | 2014-02-28 16:48:42 -0800 | [diff] [blame] | 490 | |
Mathieu Chartier | a5eae69 | 2014-12-17 17:56:03 -0800 | [diff] [blame] | 491 | // Deflate monitors, ... and trim the spaces. |
| 492 | void Trim(Thread* self) LOCKS_EXCLUDED(gc_complete_lock_); |
Mathieu Chartier | b062fdd | 2012-07-03 09:51:48 -0700 | [diff] [blame] | 493 | |
Hiroshi Yamauchi | cf58d4a | 2013-09-26 14:21:22 -0700 | [diff] [blame] | 494 | void RevokeThreadLocalBuffers(Thread* thread); |
Hiroshi Yamauchi | c93c530 | 2014-03-20 16:15:37 -0700 | [diff] [blame] | 495 | void RevokeRosAllocThreadLocalBuffers(Thread* thread); |
Hiroshi Yamauchi | cf58d4a | 2013-09-26 14:21:22 -0700 | [diff] [blame] | 496 | void RevokeAllThreadLocalBuffers(); |
Ian Rogers | 68d8b42 | 2014-07-17 11:09:10 -0700 | [diff] [blame] | 497 | void AssertThreadLocalBuffersAreRevoked(Thread* thread); |
Hiroshi Yamauchi | c93c530 | 2014-03-20 16:15:37 -0700 | [diff] [blame] | 498 | void AssertAllBumpPointerSpaceThreadLocalBuffersAreRevoked(); |
Mathieu Chartier | 6f365cc | 2014-04-23 12:42:27 -0700 | [diff] [blame] | 499 | void RosAllocVerification(TimingLogger* timings, const char* name) |
Hiroshi Yamauchi | a4adbfd | 2014-02-04 18:12:17 -0800 | [diff] [blame] | 500 | EXCLUSIVE_LOCKS_REQUIRED(Locks::mutator_lock_); |
| 501 | |
Ian Rogers | 1d54e73 | 2013-05-02 21:10:01 -0700 | [diff] [blame] | 502 | accounting::HeapBitmap* GetLiveBitmap() SHARED_LOCKS_REQUIRED(Locks::heap_bitmap_lock_) { |
Mathieu Chartier | b062fdd | 2012-07-03 09:51:48 -0700 | [diff] [blame] | 503 | return live_bitmap_.get(); |
| 504 | } |
| 505 | |
Ian Rogers | 1d54e73 | 2013-05-02 21:10:01 -0700 | [diff] [blame] | 506 | accounting::HeapBitmap* GetMarkBitmap() SHARED_LOCKS_REQUIRED(Locks::heap_bitmap_lock_) { |
Mathieu Chartier | b062fdd | 2012-07-03 09:51:48 -0700 | [diff] [blame] | 507 | return mark_bitmap_.get(); |
| 508 | } |
| 509 | |
Ian Rogers | 1d54e73 | 2013-05-02 21:10:01 -0700 | [diff] [blame] | 510 | accounting::ObjectStack* GetLiveStack() SHARED_LOCKS_REQUIRED(Locks::heap_bitmap_lock_) { |
Mathieu Chartier | 2b82db4 | 2012-11-14 17:29:05 -0800 | [diff] [blame] | 511 | return live_stack_.get(); |
| 512 | } |
| 513 | |
Mathieu Chartier | 590fee9 | 2013-09-13 13:46:47 -0700 | [diff] [blame] | 514 | void PreZygoteFork() NO_THREAD_SAFETY_ANALYSIS; |
Mathieu Chartier | cc236d7 | 2012-07-20 10:29:05 -0700 | [diff] [blame] | 515 | |
Mathieu Chartier | 357e9be | 2012-08-01 11:00:14 -0700 | [diff] [blame] | 516 | // Mark and empty stack. |
| 517 | void FlushAllocStack() |
Mathieu Chartier | cb535da | 2015-01-23 13:50:03 -0800 | [diff] [blame^] | 518 | SHARED_LOCKS_REQUIRED(Locks::mutator_lock_) |
Ian Rogers | b726dcb | 2012-09-05 08:57:23 -0700 | [diff] [blame] | 519 | EXCLUSIVE_LOCKS_REQUIRED(Locks::heap_bitmap_lock_); |
Mathieu Chartier | 357e9be | 2012-08-01 11:00:14 -0700 | [diff] [blame] | 520 | |
Hiroshi Yamauchi | 90d7068 | 2014-02-20 16:17:30 -0800 | [diff] [blame] | 521 | // Revoke all the thread-local allocation stacks. |
Mathieu Chartier | c22c59e | 2014-02-24 15:16:06 -0800 | [diff] [blame] | 522 | void RevokeAllThreadLocalAllocationStacks(Thread* self) |
Mathieu Chartier | d889178 | 2014-03-02 13:28:37 -0800 | [diff] [blame] | 523 | EXCLUSIVE_LOCKS_REQUIRED(Locks::mutator_lock_) |
| 524 | LOCKS_EXCLUDED(Locks::runtime_shutdown_lock_, Locks::thread_list_lock_); |
Hiroshi Yamauchi | 90d7068 | 2014-02-20 16:17:30 -0800 | [diff] [blame] | 525 | |
Mathieu Chartier | c7b83a0 | 2012-09-11 18:07:39 -0700 | [diff] [blame] | 526 | // Mark all the objects in the allocation stack in the specified bitmap. |
Mathieu Chartier | a8e8f9c | 2014-04-09 14:51:05 -0700 | [diff] [blame] | 527 | // TODO: Refactor? |
| 528 | void MarkAllocStack(accounting::SpaceBitmap<kObjectAlignment>* bitmap1, |
| 529 | accounting::SpaceBitmap<kObjectAlignment>* bitmap2, |
Mathieu Chartier | bbd695c | 2014-04-16 09:48:48 -0700 | [diff] [blame] | 530 | accounting::SpaceBitmap<kLargeObjectAlignment>* large_objects, |
| 531 | accounting::ObjectStack* stack) |
Mathieu Chartier | cb535da | 2015-01-23 13:50:03 -0800 | [diff] [blame^] | 532 | SHARED_LOCKS_REQUIRED(Locks::mutator_lock_) |
Mathieu Chartier | c7b83a0 | 2012-09-11 18:07:39 -0700 | [diff] [blame] | 533 | EXCLUSIVE_LOCKS_REQUIRED(Locks::heap_bitmap_lock_); |
Mathieu Chartier | 357e9be | 2012-08-01 11:00:14 -0700 | [diff] [blame] | 534 | |
Mathieu Chartier | 590fee9 | 2013-09-13 13:46:47 -0700 | [diff] [blame] | 535 | // Mark the specified allocation stack as live. |
| 536 | void MarkAllocStackAsLive(accounting::ObjectStack* stack) |
Mathieu Chartier | cb535da | 2015-01-23 13:50:03 -0800 | [diff] [blame^] | 537 | SHARED_LOCKS_REQUIRED(Locks::mutator_lock_) |
Mathieu Chartier | ca2a24d | 2013-11-25 15:12:12 -0800 | [diff] [blame] | 538 | EXCLUSIVE_LOCKS_REQUIRED(Locks::heap_bitmap_lock_); |
Mathieu Chartier | 8235331 | 2013-07-18 10:47:51 -0700 | [diff] [blame] | 539 | |
Mathieu Chartier | a1602f2 | 2014-01-13 17:19:19 -0800 | [diff] [blame] | 540 | // Unbind any bound bitmaps. |
| 541 | void UnBindBitmaps() EXCLUSIVE_LOCKS_REQUIRED(Locks::heap_bitmap_lock_); |
| 542 | |
Mathieu Chartier | b062fdd | 2012-07-03 09:51:48 -0700 | [diff] [blame] | 543 | // 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] | 544 | // Assumes there is only one image space. |
Ian Rogers | 1d54e73 | 2013-05-02 21:10:01 -0700 | [diff] [blame] | 545 | space::ImageSpace* GetImageSpace() const; |
| 546 | |
Mathieu Chartier | 6a7824d | 2014-08-22 14:53:04 -0700 | [diff] [blame] | 547 | // Permenantly disable moving garbage collection. |
| 548 | void DisableMovingGc(); |
Mathieu Chartier | 6dda898 | 2014-03-06 11:11:48 -0800 | [diff] [blame] | 549 | |
Mathieu Chartier | e6da9af | 2013-12-16 11:54:42 -0800 | [diff] [blame] | 550 | space::DlMallocSpace* GetDlMallocSpace() const { |
| 551 | return dlmalloc_space_; |
| 552 | } |
| 553 | |
| 554 | space::RosAllocSpace* GetRosAllocSpace() const { |
| 555 | return rosalloc_space_; |
| 556 | } |
| 557 | |
Zuo Wang | f37a88b | 2014-07-10 04:26:41 -0700 | [diff] [blame] | 558 | // Return the corresponding rosalloc space. |
| 559 | space::RosAllocSpace* GetRosAllocSpace(gc::allocator::RosAlloc* rosalloc) const; |
| 560 | |
Hiroshi Yamauchi | cf58d4a | 2013-09-26 14:21:22 -0700 | [diff] [blame] | 561 | space::MallocSpace* GetNonMovingSpace() const { |
Mathieu Chartier | 590fee9 | 2013-09-13 13:46:47 -0700 | [diff] [blame] | 562 | return non_moving_space_; |
Mathieu Chartier | e0f0cb3 | 2012-08-28 11:26:00 -0700 | [diff] [blame] | 563 | } |
Ian Rogers | 1d54e73 | 2013-05-02 21:10:01 -0700 | [diff] [blame] | 564 | |
| 565 | space::LargeObjectSpace* GetLargeObjectsSpace() const { |
| 566 | return large_object_space_; |
| 567 | } |
| 568 | |
Hiroshi Yamauchi | 05e713a | 2014-01-09 13:24:51 -0800 | [diff] [blame] | 569 | // Returns the free list space that may contain movable objects (the |
| 570 | // one that's not the non-moving space), either rosalloc_space_ or |
| 571 | // dlmalloc_space_. |
| 572 | space::MallocSpace* GetPrimaryFreeListSpace() { |
| 573 | if (kUseRosAlloc) { |
| 574 | DCHECK(rosalloc_space_ != nullptr); |
| 575 | // reinterpret_cast is necessary as the space class hierarchy |
| 576 | // isn't known (#included) yet here. |
| 577 | return reinterpret_cast<space::MallocSpace*>(rosalloc_space_); |
| 578 | } else { |
| 579 | DCHECK(dlmalloc_space_ != nullptr); |
| 580 | return reinterpret_cast<space::MallocSpace*>(dlmalloc_space_); |
| 581 | } |
| 582 | } |
| 583 | |
Mathieu Chartier | 4c13a3f | 2014-07-14 14:57:16 -0700 | [diff] [blame] | 584 | std::string DumpSpaces() const WARN_UNUSED; |
| 585 | void DumpSpaces(std::ostream& stream) const; |
Elliott Hughes | f834936 | 2012-06-18 15:00:06 -0700 | [diff] [blame] | 586 | |
Mathieu Chartier | 15d3402 | 2014-02-26 17:16:38 -0800 | [diff] [blame] | 587 | // Dump object should only be used by the signal handler. |
| 588 | void DumpObject(std::ostream& stream, mirror::Object* obj) NO_THREAD_SAFETY_ANALYSIS; |
| 589 | // Safe version of pretty type of which check to make sure objects are heap addresses. |
| 590 | std::string SafeGetClassDescriptor(mirror::Class* klass) NO_THREAD_SAFETY_ANALYSIS; |
| 591 | std::string SafePrettyTypeOf(mirror::Object* obj) NO_THREAD_SAFETY_ANALYSIS; |
| 592 | |
Mathieu Chartier | 155dfe9 | 2012-10-09 14:24:49 -0700 | [diff] [blame] | 593 | // GC performance measuring |
Elliott Hughes | 8b788fe | 2013-04-17 15:57:01 -0700 | [diff] [blame] | 594 | void DumpGcPerformanceInfo(std::ostream& os); |
Mathieu Chartier | 155dfe9 | 2012-10-09 14:24:49 -0700 | [diff] [blame] | 595 | |
Mathieu Chartier | 2775ee4 | 2013-08-20 17:43:47 -0700 | [diff] [blame] | 596 | // Returns true if we currently care about pause times. |
| 597 | bool CareAboutPauseTimes() const { |
Mathieu Chartier | ca2a24d | 2013-11-25 15:12:12 -0800 | [diff] [blame] | 598 | return process_state_ == kProcessStateJankPerceptible; |
Mathieu Chartier | 2775ee4 | 2013-08-20 17:43:47 -0700 | [diff] [blame] | 599 | } |
| 600 | |
Mathieu Chartier | 02b6a78 | 2012-10-26 13:51:26 -0700 | [diff] [blame] | 601 | // Thread pool. |
| 602 | void CreateThreadPool(); |
| 603 | void DeleteThreadPool(); |
| 604 | ThreadPool* GetThreadPool() { |
| 605 | return thread_pool_.get(); |
| 606 | } |
Mathieu Chartier | 2775ee4 | 2013-08-20 17:43:47 -0700 | [diff] [blame] | 607 | size_t GetParallelGCThreadCount() const { |
| 608 | return parallel_gc_threads_; |
| 609 | } |
| 610 | size_t GetConcGCThreadCount() const { |
| 611 | return conc_gc_threads_; |
| 612 | } |
Mathieu Chartier | 11409ae | 2013-09-23 11:49:36 -0700 | [diff] [blame] | 613 | accounting::ModUnionTable* FindModUnionTableFromSpace(space::Space* space); |
| 614 | void AddModUnionTable(accounting::ModUnionTable* mod_union_table); |
Mathieu Chartier | 02b6a78 | 2012-10-26 13:51:26 -0700 | [diff] [blame] | 615 | |
Hiroshi Yamauchi | 38e68e9 | 2014-03-07 13:59:08 -0800 | [diff] [blame] | 616 | accounting::RememberedSet* FindRememberedSetFromSpace(space::Space* space); |
| 617 | void AddRememberedSet(accounting::RememberedSet* remembered_set); |
Mathieu Chartier | 5189e24 | 2014-07-24 11:11:05 -0700 | [diff] [blame] | 618 | // Also deletes the remebered set. |
Hiroshi Yamauchi | 38e68e9 | 2014-03-07 13:59:08 -0800 | [diff] [blame] | 619 | void RemoveRememberedSet(space::Space* space); |
| 620 | |
Mathieu Chartier | 590fee9 | 2013-09-13 13:46:47 -0700 | [diff] [blame] | 621 | bool IsCompilingBoot() const; |
| 622 | bool HasImageSpace() const; |
| 623 | |
Mathieu Chartier | 78f7b4c | 2014-05-06 10:57:27 -0700 | [diff] [blame] | 624 | ReferenceProcessor* GetReferenceProcessor() { |
| 625 | return &reference_processor_; |
| 626 | } |
Mathieu Chartier | a5eae69 | 2014-12-17 17:56:03 -0800 | [diff] [blame] | 627 | TaskProcessor* GetTaskProcessor() { |
| 628 | return task_processor_.get(); |
| 629 | } |
Mathieu Chartier | 78f7b4c | 2014-05-06 10:57:27 -0700 | [diff] [blame] | 630 | |
Mathieu Chartier | e4cab17 | 2014-08-19 18:24:04 -0700 | [diff] [blame] | 631 | bool HasZygoteSpace() const { |
| 632 | return zygote_space_ != nullptr; |
| 633 | } |
| 634 | |
Hiroshi Yamauchi | 2cd334a | 2015-01-09 14:03:35 -0800 | [diff] [blame] | 635 | collector::ConcurrentCopying* ConcurrentCopyingCollector() { |
| 636 | return concurrent_copying_collector_; |
| 637 | } |
| 638 | |
| 639 | CollectorType CurrentCollectorType() { |
| 640 | return collector_type_; |
| 641 | } |
| 642 | |
| 643 | bool IsGcConcurrentAndMoving() const { |
| 644 | if (IsGcConcurrent() && IsMovingGc(collector_type_)) { |
| 645 | // Assume no transition when a concurrent moving collector is used. |
| 646 | DCHECK_EQ(collector_type_, foreground_collector_type_); |
| 647 | DCHECK_EQ(foreground_collector_type_, background_collector_type_) |
| 648 | << "Assume no transition such that collector_type_ won't change"; |
| 649 | return true; |
| 650 | } |
| 651 | return false; |
| 652 | } |
| 653 | |
| 654 | bool IsMovingGCDisabled(Thread* self) { |
| 655 | MutexLock mu(self, *gc_complete_lock_); |
| 656 | return disable_moving_gc_count_ > 0; |
| 657 | } |
| 658 | |
Mathieu Chartier | a5eae69 | 2014-12-17 17:56:03 -0800 | [diff] [blame] | 659 | // Request an asynchronous trim. |
| 660 | void RequestTrim(Thread* self) LOCKS_EXCLUDED(pending_task_lock_); |
| 661 | |
| 662 | // Request asynchronous GC. |
| 663 | void RequestConcurrentGC(Thread* self) LOCKS_EXCLUDED(pending_task_lock_); |
Mathieu Chartier | 079101a | 2014-12-15 14:23:10 -0800 | [diff] [blame] | 664 | |
Carl Shapiro | 58551df | 2011-07-24 03:09:51 -0700 | [diff] [blame] | 665 | private: |
Mathieu Chartier | a5eae69 | 2014-12-17 17:56:03 -0800 | [diff] [blame] | 666 | class ConcurrentGCTask; |
| 667 | class CollectorTransitionTask; |
| 668 | class HeapTrimTask; |
| 669 | |
Zuo Wang | f37a88b | 2014-07-10 04:26:41 -0700 | [diff] [blame] | 670 | // Compact source space to target space. |
Mathieu Chartier | 590fee9 | 2013-09-13 13:46:47 -0700 | [diff] [blame] | 671 | void Compact(space::ContinuousMemMapAllocSpace* target_space, |
Zuo Wang | f37a88b | 2014-07-10 04:26:41 -0700 | [diff] [blame] | 672 | space::ContinuousMemMapAllocSpace* source_space, |
| 673 | GcCause gc_cause) |
Mathieu Chartier | 31f4414 | 2014-04-08 14:40:03 -0700 | [diff] [blame] | 674 | EXCLUSIVE_LOCKS_REQUIRED(Locks::mutator_lock_); |
Mathieu Chartier | 590fee9 | 2013-09-13 13:46:47 -0700 | [diff] [blame] | 675 | |
Mathieu Chartier | e6da9af | 2013-12-16 11:54:42 -0800 | [diff] [blame] | 676 | void FinishGC(Thread* self, collector::GcType gc_type) LOCKS_EXCLUDED(gc_complete_lock_); |
| 677 | |
Mathieu Chartier | b363f66 | 2014-07-16 13:28:58 -0700 | [diff] [blame] | 678 | // Create a mem map with a preferred base address. |
Ian Rogers | 1373595 | 2014-10-08 12:43:28 -0700 | [diff] [blame] | 679 | static MemMap* MapAnonymousPreferredAddress(const char* name, uint8_t* request_begin, |
Ian Rogers | 6a3c1fc | 2014-10-31 00:33:20 -0700 | [diff] [blame] | 680 | size_t capacity, std::string* out_error_str); |
Mathieu Chartier | b363f66 | 2014-07-16 13:28:58 -0700 | [diff] [blame] | 681 | |
Zuo Wang | f37a88b | 2014-07-10 04:26:41 -0700 | [diff] [blame] | 682 | bool SupportHSpaceCompaction() const { |
Mathieu Chartier | b363f66 | 2014-07-16 13:28:58 -0700 | [diff] [blame] | 683 | // Returns true if we can do hspace compaction |
Zuo Wang | f37a88b | 2014-07-10 04:26:41 -0700 | [diff] [blame] | 684 | return main_space_backup_ != nullptr; |
| 685 | } |
| 686 | |
Mathieu Chartier | 692fafd | 2013-11-29 17:24:40 -0800 | [diff] [blame] | 687 | static ALWAYS_INLINE bool AllocatorHasAllocationStack(AllocatorType allocator_type) { |
| 688 | return |
| 689 | allocator_type != kAllocatorTypeBumpPointer && |
Hiroshi Yamauchi | 2cd334a | 2015-01-09 14:03:35 -0800 | [diff] [blame] | 690 | allocator_type != kAllocatorTypeTLAB && |
| 691 | allocator_type != kAllocatorTypeRegion && |
| 692 | allocator_type != kAllocatorTypeRegionTLAB; |
Mathieu Chartier | cbb2d20 | 2013-11-14 17:45:16 -0800 | [diff] [blame] | 693 | } |
Mathieu Chartier | 692fafd | 2013-11-29 17:24:40 -0800 | [diff] [blame] | 694 | static ALWAYS_INLINE bool AllocatorMayHaveConcurrentGC(AllocatorType allocator_type) { |
Hiroshi Yamauchi | 2cd334a | 2015-01-09 14:03:35 -0800 | [diff] [blame] | 695 | return |
| 696 | allocator_type != kAllocatorTypeBumpPointer && |
| 697 | allocator_type != kAllocatorTypeTLAB; |
Mathieu Chartier | cbb2d20 | 2013-11-14 17:45:16 -0800 | [diff] [blame] | 698 | } |
Mathieu Chartier | 31f4414 | 2014-04-08 14:40:03 -0700 | [diff] [blame] | 699 | static bool IsMovingGc(CollectorType collector_type) { |
Hiroshi Yamauchi | d5307ec | 2014-03-27 21:07:51 -0700 | [diff] [blame] | 700 | return collector_type == kCollectorTypeSS || collector_type == kCollectorTypeGSS || |
Zuo Wang | f37a88b | 2014-07-10 04:26:41 -0700 | [diff] [blame] | 701 | collector_type == kCollectorTypeCC || collector_type == kCollectorTypeMC || |
| 702 | collector_type == kCollectorTypeHomogeneousSpaceCompact; |
Mathieu Chartier | 9be9a7a | 2014-01-24 14:07:33 -0800 | [diff] [blame] | 703 | } |
Ian Rogers | ef7d42f | 2014-01-06 12:55:46 -0800 | [diff] [blame] | 704 | bool ShouldAllocLargeObject(mirror::Class* c, size_t byte_count) const |
| 705 | SHARED_LOCKS_REQUIRED(Locks::mutator_lock_); |
Mathieu Chartier | cbb2d20 | 2013-11-14 17:45:16 -0800 | [diff] [blame] | 706 | ALWAYS_INLINE void CheckConcurrentGC(Thread* self, size_t new_num_bytes_allocated, |
Mathieu Chartier | f517f1a | 2014-03-06 15:52:27 -0800 | [diff] [blame] | 707 | mirror::Object** obj) |
| 708 | SHARED_LOCKS_REQUIRED(Locks::mutator_lock_); |
Hiroshi Yamauchi | 50b2928 | 2013-07-30 13:58:37 -0700 | [diff] [blame] | 709 | |
Mathieu Chartier | eb8167a | 2014-05-07 15:43:14 -0700 | [diff] [blame] | 710 | accounting::ObjectStack* GetMarkStack() { |
| 711 | return mark_stack_.get(); |
| 712 | } |
| 713 | |
Mathieu Chartier | 692fafd | 2013-11-29 17:24:40 -0800 | [diff] [blame] | 714 | // 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] | 715 | template <bool kInstrumented, typename PreFenceVisitor> |
Mathieu Chartier | 446f9ee | 2014-12-01 15:00:27 -0800 | [diff] [blame] | 716 | mirror::Object* AllocLargeObject(Thread* self, mirror::Class** klass, size_t byte_count, |
Mathieu Chartier | c528dba | 2013-11-26 12:00:11 -0800 | [diff] [blame] | 717 | const PreFenceVisitor& pre_fence_visitor) |
| 718 | SHARED_LOCKS_REQUIRED(Locks::mutator_lock_); |
| 719 | |
Hiroshi Yamauchi | 50b2928 | 2013-07-30 13:58:37 -0700 | [diff] [blame] | 720 | // Handles Allocate()'s slow allocation path with GC involved after |
| 721 | // an initial allocation attempt failed. |
Mathieu Chartier | cbb2d20 | 2013-11-14 17:45:16 -0800 | [diff] [blame] | 722 | mirror::Object* AllocateInternalWithGc(Thread* self, AllocatorType allocator, size_t num_bytes, |
Ian Rogers | 6fac447 | 2014-02-25 17:01:10 -0800 | [diff] [blame] | 723 | size_t* bytes_allocated, size_t* usable_size, |
| 724 | mirror::Class** klass) |
Ian Rogers | b726dcb | 2012-09-05 08:57:23 -0700 | [diff] [blame] | 725 | LOCKS_EXCLUDED(Locks::thread_suspend_count_lock_) |
| 726 | SHARED_LOCKS_REQUIRED(Locks::mutator_lock_); |
Mathieu Chartier | a639903 | 2012-06-11 18:49:50 -0700 | [diff] [blame] | 727 | |
Mathieu Chartier | 590fee9 | 2013-09-13 13:46:47 -0700 | [diff] [blame] | 728 | // Allocate into a specific space. |
| 729 | mirror::Object* AllocateInto(Thread* self, space::AllocSpace* space, mirror::Class* c, |
| 730 | size_t bytes) |
| 731 | SHARED_LOCKS_REQUIRED(Locks::mutator_lock_); |
| 732 | |
Mathieu Chartier | 31f4414 | 2014-04-08 14:40:03 -0700 | [diff] [blame] | 733 | // Need to do this with mutators paused so that somebody doesn't accidentally allocate into the |
| 734 | // wrong space. |
| 735 | void SwapSemiSpaces() EXCLUSIVE_LOCKS_REQUIRED(Locks::mutator_lock_); |
| 736 | |
Mathieu Chartier | cbb2d20 | 2013-11-14 17:45:16 -0800 | [diff] [blame] | 737 | // Try to allocate a number of bytes, this function never does any GCs. Needs to be inlined so |
| 738 | // that the switch statement is constant optimized in the entrypoints. |
Mathieu Chartier | c528dba | 2013-11-26 12:00:11 -0800 | [diff] [blame] | 739 | template <const bool kInstrumented, const bool kGrow> |
Mathieu Chartier | cbb2d20 | 2013-11-14 17:45:16 -0800 | [diff] [blame] | 740 | ALWAYS_INLINE mirror::Object* TryToAllocate(Thread* self, AllocatorType allocator_type, |
Ian Rogers | 6fac447 | 2014-02-25 17:01:10 -0800 | [diff] [blame] | 741 | size_t alloc_size, size_t* bytes_allocated, |
| 742 | size_t* usable_size) |
Hiroshi Yamauchi | cf58d4a | 2013-09-26 14:21:22 -0700 | [diff] [blame] | 743 | SHARED_LOCKS_REQUIRED(Locks::mutator_lock_); |
| 744 | |
Hiroshi Yamauchi | 654dd48 | 2014-07-09 12:54:32 -0700 | [diff] [blame] | 745 | void ThrowOutOfMemoryError(Thread* self, size_t byte_count, AllocatorType allocator_type) |
Hiroshi Yamauchi | 3b4c189 | 2013-09-12 21:33:12 -0700 | [diff] [blame] | 746 | SHARED_LOCKS_REQUIRED(Locks::mutator_lock_); |
Mathieu Chartier | 692fafd | 2013-11-29 17:24:40 -0800 | [diff] [blame] | 747 | |
| 748 | template <bool kGrow> |
Hiroshi Yamauchi | eb1e929 | 2014-08-06 12:41:15 -0700 | [diff] [blame] | 749 | ALWAYS_INLINE bool IsOutOfMemoryOnAllocation(AllocatorType allocator_type, size_t alloc_size); |
Hiroshi Yamauchi | 50b2928 | 2013-07-30 13:58:37 -0700 | [diff] [blame] | 750 | |
Mathieu Chartier | 15d3402 | 2014-02-26 17:16:38 -0800 | [diff] [blame] | 751 | // Returns true if the address passed in is within the address range of a continuous space. |
| 752 | bool IsValidContinuousSpaceObjectAddress(const mirror::Object* obj) const |
| 753 | SHARED_LOCKS_REQUIRED(Locks::mutator_lock_); |
| 754 | |
Mathieu Chartier | 590fee9 | 2013-09-13 13:46:47 -0700 | [diff] [blame] | 755 | // Run the finalizers. |
| 756 | void RunFinalization(JNIEnv* env); |
| 757 | |
| 758 | // Blocks the caller until the garbage collector becomes idle and returns the type of GC we |
| 759 | // waited for. |
Mathieu Chartier | 89a201e | 2014-05-02 10:27:26 -0700 | [diff] [blame] | 760 | collector::GcType WaitForGcToCompleteLocked(GcCause cause, Thread* self) |
Mathieu Chartier | 590fee9 | 2013-09-13 13:46:47 -0700 | [diff] [blame] | 761 | EXCLUSIVE_LOCKS_REQUIRED(gc_complete_lock_); |
| 762 | |
Mathieu Chartier | 7bf52d2 | 2014-03-13 14:46:09 -0700 | [diff] [blame] | 763 | void RequestCollectorTransition(CollectorType desired_collector_type, uint64_t delta_time) |
Mathieu Chartier | a5eae69 | 2014-12-17 17:56:03 -0800 | [diff] [blame] | 764 | LOCKS_EXCLUDED(pending_task_lock_); |
| 765 | |
Mathieu Chartier | eb8167a | 2014-05-07 15:43:14 -0700 | [diff] [blame] | 766 | void RequestConcurrentGCAndSaveObject(Thread* self, mirror::Object** obj) |
| 767 | SHARED_LOCKS_REQUIRED(Locks::mutator_lock_); |
Mathieu Chartier | 987ccff | 2013-07-08 11:05:21 -0700 | [diff] [blame] | 768 | bool IsGCRequestPending() const; |
Elliott Hughes | 8cf5bc0 | 2012-02-02 16:32:16 -0800 | [diff] [blame] | 769 | |
Mathieu Chartier | 866fb2a | 2012-09-10 10:47:49 -0700 | [diff] [blame] | 770 | // Sometimes CollectGarbageInternal decides to run a different Gc than you requested. Returns |
| 771 | // which type of Gc was actually ran. |
Ian Rogers | 1d54e73 | 2013-05-02 21:10:01 -0700 | [diff] [blame] | 772 | collector::GcType CollectGarbageInternal(collector::GcType gc_plan, GcCause gc_cause, |
| 773 | bool clear_soft_references) |
Ian Rogers | 00f7d0e | 2012-07-19 15:28:27 -0700 | [diff] [blame] | 774 | LOCKS_EXCLUDED(gc_complete_lock_, |
Ian Rogers | b726dcb | 2012-09-05 08:57:23 -0700 | [diff] [blame] | 775 | Locks::heap_bitmap_lock_, |
Ian Rogers | b726dcb | 2012-09-05 08:57:23 -0700 | [diff] [blame] | 776 | Locks::thread_suspend_count_lock_); |
Mathieu Chartier | 2b82db4 | 2012-11-14 17:29:05 -0800 | [diff] [blame] | 777 | |
Mathieu Chartier | 6f365cc | 2014-04-23 12:42:27 -0700 | [diff] [blame] | 778 | void PreGcVerification(collector::GarbageCollector* gc) |
| 779 | LOCKS_EXCLUDED(Locks::mutator_lock_); |
| 780 | void PreGcVerificationPaused(collector::GarbageCollector* gc) |
| 781 | EXCLUSIVE_LOCKS_REQUIRED(Locks::mutator_lock_); |
| 782 | void PrePauseRosAllocVerification(collector::GarbageCollector* gc) |
| 783 | EXCLUSIVE_LOCKS_REQUIRED(Locks::mutator_lock_); |
Ian Rogers | 1d54e73 | 2013-05-02 21:10:01 -0700 | [diff] [blame] | 784 | void PreSweepingGcVerification(collector::GarbageCollector* gc) |
Hiroshi Yamauchi | 0c8c303 | 2015-01-16 16:54:35 -0800 | [diff] [blame] | 785 | EXCLUSIVE_LOCKS_REQUIRED(Locks::mutator_lock_) |
| 786 | LOCKS_EXCLUDED(Locks::heap_bitmap_lock_); |
Mathieu Chartier | ad2541a | 2013-10-25 10:05:23 -0700 | [diff] [blame] | 787 | void PostGcVerification(collector::GarbageCollector* gc) |
Mathieu Chartier | 6f365cc | 2014-04-23 12:42:27 -0700 | [diff] [blame] | 788 | LOCKS_EXCLUDED(Locks::mutator_lock_); |
| 789 | void PostGcVerificationPaused(collector::GarbageCollector* gc) |
| 790 | EXCLUSIVE_LOCKS_REQUIRED(Locks::mutator_lock_); |
Carl Shapiro | 69759ea | 2011-07-21 18:13:35 -0700 | [diff] [blame] | 791 | |
Mathieu Chartier | 987ccff | 2013-07-08 11:05:21 -0700 | [diff] [blame] | 792 | // Update the watermark for the native allocated bytes based on the current number of native |
| 793 | // bytes allocated and the target utilization ratio. |
| 794 | void UpdateMaxNativeFootprint(); |
| 795 | |
Mathieu Chartier | afe4998 | 2014-03-27 10:55:04 -0700 | [diff] [blame] | 796 | // Find a collector based on GC type. |
| 797 | collector::GarbageCollector* FindCollectorByGcType(collector::GcType gc_type); |
| 798 | |
Zuo Wang | f37a88b | 2014-07-10 04:26:41 -0700 | [diff] [blame] | 799 | // Create a new alloc space and compact default alloc space to it. |
| 800 | HomogeneousSpaceCompactResult PerformHomogeneousSpaceCompact(); |
| 801 | |
| 802 | // Create the main free list malloc space, either a RosAlloc space or DlMalloc space. |
Mathieu Chartier | 31f4414 | 2014-04-08 14:40:03 -0700 | [diff] [blame] | 803 | void CreateMainMallocSpace(MemMap* mem_map, size_t initial_size, size_t growth_limit, |
| 804 | size_t capacity); |
| 805 | |
Zuo Wang | f37a88b | 2014-07-10 04:26:41 -0700 | [diff] [blame] | 806 | // Create a malloc space based on a mem map. Does not set the space as default. |
| 807 | space::MallocSpace* CreateMallocSpaceFromMemMap(MemMap* mem_map, size_t initial_size, |
| 808 | size_t growth_limit, size_t capacity, |
| 809 | const char* name, bool can_move_objects); |
| 810 | |
Ian Rogers | 3bb17a6 | 2012-01-27 23:56:44 -0800 | [diff] [blame] | 811 | // Given the current contents of the alloc space, increase the allowed heap footprint to match |
| 812 | // the target utilization ratio. This should only be called immediately after a full garbage |
Mathieu Chartier | e2c2f6e | 2014-12-16 18:49:31 -0800 | [diff] [blame] | 813 | // collection. bytes_allocated_before_gc is used to measure bytes / second for the period which |
| 814 | // the GC was run. |
| 815 | void GrowForUtilization(collector::GarbageCollector* collector_ran, |
| 816 | uint64_t bytes_allocated_before_gc = 0); |
Carl Shapiro | 69759ea | 2011-07-21 18:13:35 -0700 | [diff] [blame] | 817 | |
Mathieu Chartier | 637e348 | 2012-08-17 10:41:32 -0700 | [diff] [blame] | 818 | size_t GetPercentFree(); |
Elliott Hughes | c967f78 | 2012-04-16 10:23:15 -0700 | [diff] [blame] | 819 | |
Ian Rogers | 2dd0e2c | 2013-01-24 12:42:14 -0800 | [diff] [blame] | 820 | static void VerificationCallback(mirror::Object* obj, void* arg) |
Ian Rogers | 719d1a3 | 2014-03-06 12:13:39 -0800 | [diff] [blame] | 821 | SHARED_LOCKS_REQUIRED(Locks::heap_bitmap_lock_); |
Carl Shapiro | 69759ea | 2011-07-21 18:13:35 -0700 | [diff] [blame] | 822 | |
Mathieu Chartier | e0f0cb3 | 2012-08-28 11:26:00 -0700 | [diff] [blame] | 823 | // Swap the allocation stack with the live stack. |
Mathieu Chartier | cb535da | 2015-01-23 13:50:03 -0800 | [diff] [blame^] | 824 | void SwapStacks(Thread* self) SHARED_LOCKS_REQUIRED(Locks::mutator_lock_); |
Hiroshi Yamauchi | f5b0e20 | 2014-02-11 17:02:22 -0800 | [diff] [blame] | 825 | |
Mathieu Chartier | 7469ebf | 2012-09-24 16:28:36 -0700 | [diff] [blame] | 826 | // Clear cards and update the mod union table. |
Mathieu Chartier | 10fb83a | 2014-06-15 15:15:43 -0700 | [diff] [blame] | 827 | void ProcessCards(TimingLogger* timings, bool use_rem_sets); |
Mathieu Chartier | 7469ebf | 2012-09-24 16:28:36 -0700 | [diff] [blame] | 828 | |
Hiroshi Yamauchi | f5b0e20 | 2014-02-11 17:02:22 -0800 | [diff] [blame] | 829 | // Push an object onto the allocation stack. |
Hiroshi Yamauchi | 4cd662e | 2014-04-03 16:28:10 -0700 | [diff] [blame] | 830 | void PushOnAllocationStack(Thread* self, mirror::Object** obj) |
| 831 | SHARED_LOCKS_REQUIRED(Locks::mutator_lock_); |
Mathieu Chartier | c179016 | 2014-05-23 10:54:50 -0700 | [diff] [blame] | 832 | void PushOnAllocationStackWithInternalGC(Thread* self, mirror::Object** obj) |
| 833 | SHARED_LOCKS_REQUIRED(Locks::mutator_lock_); |
| 834 | void PushOnThreadLocalAllocationStackWithInternalGC(Thread* thread, mirror::Object** obj) |
| 835 | SHARED_LOCKS_REQUIRED(Locks::mutator_lock_); |
Hiroshi Yamauchi | f5b0e20 | 2014-02-11 17:02:22 -0800 | [diff] [blame] | 836 | |
Mathieu Chartier | a5eae69 | 2014-12-17 17:56:03 -0800 | [diff] [blame] | 837 | void ClearConcurrentGCRequest(); |
| 838 | void ClearPendingTrim(Thread* self) LOCKS_EXCLUDED(pending_task_lock_); |
| 839 | void ClearPendingCollectorTransition(Thread* self) LOCKS_EXCLUDED(pending_task_lock_); |
| 840 | |
Hiroshi Yamauchi | 3e41780 | 2014-03-20 12:03:02 -0700 | [diff] [blame] | 841 | // What kind of concurrency behavior is the runtime after? Currently true for concurrent mark |
| 842 | // sweep GC, false for other GC types. |
| 843 | bool IsGcConcurrent() const ALWAYS_INLINE { |
Hiroshi Yamauchi | d5307ec | 2014-03-27 21:07:51 -0700 | [diff] [blame] | 844 | return collector_type_ == kCollectorTypeCMS || collector_type_ == kCollectorTypeCC; |
Hiroshi Yamauchi | 3e41780 | 2014-03-20 12:03:02 -0700 | [diff] [blame] | 845 | } |
| 846 | |
Mathieu Chartier | a5eae69 | 2014-12-17 17:56:03 -0800 | [diff] [blame] | 847 | // Trim the managed and native spaces by releasing unused memory back to the OS. |
| 848 | void TrimSpaces(Thread* self) LOCKS_EXCLUDED(gc_complete_lock_); |
| 849 | |
| 850 | // Trim 0 pages at the end of reference tables. |
| 851 | void TrimIndirectReferenceTables(Thread* self); |
| 852 | |
Hiroshi Yamauchi | 2cd334a | 2015-01-09 14:03:35 -0800 | [diff] [blame] | 853 | void VisitObjectsInternal(ObjectCallback callback, void* arg) |
| 854 | SHARED_LOCKS_REQUIRED(Locks::mutator_lock_) |
| 855 | LOCKS_EXCLUDED(Locks::heap_bitmap_lock_); |
| 856 | void VisitObjectsInternalRegionSpace(ObjectCallback callback, void* arg) |
| 857 | EXCLUSIVE_LOCKS_REQUIRED(Locks::mutator_lock_) |
| 858 | LOCKS_EXCLUDED(Locks::heap_bitmap_lock_); |
| 859 | |
Ian Rogers | 1d54e73 | 2013-05-02 21:10:01 -0700 | [diff] [blame] | 860 | // All-known continuous spaces, where objects lie within fixed bounds. |
| 861 | std::vector<space::ContinuousSpace*> continuous_spaces_; |
Carl Shapiro | 69759ea | 2011-07-21 18:13:35 -0700 | [diff] [blame] | 862 | |
Ian Rogers | 1d54e73 | 2013-05-02 21:10:01 -0700 | [diff] [blame] | 863 | // All-known discontinuous spaces, where objects may be placed throughout virtual memory. |
| 864 | std::vector<space::DiscontinuousSpace*> discontinuous_spaces_; |
Mathieu Chartier | d8195f1 | 2012-10-05 12:21:28 -0700 | [diff] [blame] | 865 | |
Mathieu Chartier | 590fee9 | 2013-09-13 13:46:47 -0700 | [diff] [blame] | 866 | // All-known alloc spaces, where objects may be or have been allocated. |
| 867 | std::vector<space::AllocSpace*> alloc_spaces_; |
| 868 | |
| 869 | // A space where non-movable objects are allocated, when compaction is enabled it contains |
| 870 | // Classes, ArtMethods, ArtFields, and non moving objects. |
Hiroshi Yamauchi | cf58d4a | 2013-09-26 14:21:22 -0700 | [diff] [blame] | 871 | space::MallocSpace* non_moving_space_; |
Ian Rogers | 1d54e73 | 2013-05-02 21:10:01 -0700 | [diff] [blame] | 872 | |
Mathieu Chartier | e6da9af | 2013-12-16 11:54:42 -0800 | [diff] [blame] | 873 | // Space which we use for the kAllocatorTypeROSAlloc. |
| 874 | space::RosAllocSpace* rosalloc_space_; |
| 875 | |
| 876 | // Space which we use for the kAllocatorTypeDlMalloc. |
| 877 | space::DlMallocSpace* dlmalloc_space_; |
| 878 | |
Mathieu Chartier | fc5b528 | 2014-01-09 16:15:36 -0800 | [diff] [blame] | 879 | // The main space is the space which the GC copies to and from on process state updates. This |
| 880 | // space is typically either the dlmalloc_space_ or the rosalloc_space_. |
| 881 | space::MallocSpace* main_space_; |
| 882 | |
Ian Rogers | 1d54e73 | 2013-05-02 21:10:01 -0700 | [diff] [blame] | 883 | // The large object space we are currently allocating into. |
| 884 | space::LargeObjectSpace* large_object_space_; |
| 885 | |
| 886 | // The card table, dirtied by the write barrier. |
Ian Rogers | 700a402 | 2014-05-19 16:49:03 -0700 | [diff] [blame] | 887 | std::unique_ptr<accounting::CardTable> card_table_; |
Brian Carlstrom | 4a289ed | 2011-08-16 17:17:49 -0700 | [diff] [blame] | 888 | |
Hiroshi Yamauchi | 2cd334a | 2015-01-09 14:03:35 -0800 | [diff] [blame] | 889 | std::unique_ptr<accounting::ReadBarrierTable> rb_table_; |
| 890 | |
Mathieu Chartier | 11409ae | 2013-09-23 11:49:36 -0700 | [diff] [blame] | 891 | // A mod-union table remembers all of the references from the it's space to other spaces. |
Mathieu Chartier | bad0267 | 2014-08-25 13:08:22 -0700 | [diff] [blame] | 892 | AllocationTrackingSafeMap<space::Space*, accounting::ModUnionTable*, kAllocatorTagHeap> |
| 893 | mod_union_tables_; |
Mathieu Chartier | cc236d7 | 2012-07-20 10:29:05 -0700 | [diff] [blame] | 894 | |
Hiroshi Yamauchi | 38e68e9 | 2014-03-07 13:59:08 -0800 | [diff] [blame] | 895 | // A remembered set remembers all of the references from the it's space to the target space. |
Mathieu Chartier | bad0267 | 2014-08-25 13:08:22 -0700 | [diff] [blame] | 896 | AllocationTrackingSafeMap<space::Space*, accounting::RememberedSet*, kAllocatorTagHeap> |
| 897 | remembered_sets_; |
Hiroshi Yamauchi | 38e68e9 | 2014-03-07 13:59:08 -0800 | [diff] [blame] | 898 | |
Mathieu Chartier | 0de9f73 | 2013-11-22 17:58:48 -0800 | [diff] [blame] | 899 | // The current collector type. |
| 900 | CollectorType collector_type_; |
Mathieu Chartier | 31f4414 | 2014-04-08 14:40:03 -0700 | [diff] [blame] | 901 | // Which collector we use when the app is in the foreground. |
| 902 | CollectorType foreground_collector_type_; |
Mathieu Chartier | e6da9af | 2013-12-16 11:54:42 -0800 | [diff] [blame] | 903 | // Which collector we will use when the app is notified of a transition to background. |
| 904 | CollectorType background_collector_type_; |
Mathieu Chartier | a5f9de0 | 2014-02-28 16:48:42 -0800 | [diff] [blame] | 905 | // Desired collector type, heap trimming daemon transitions the heap if it is != collector_type_. |
| 906 | CollectorType desired_collector_type_; |
| 907 | |
Mathieu Chartier | a5eae69 | 2014-12-17 17:56:03 -0800 | [diff] [blame] | 908 | // Lock which guards pending tasks. |
| 909 | Mutex* pending_task_lock_ DEFAULT_MUTEX_ACQUIRED_AFTER; |
Ian Rogers | 00f7d0e | 2012-07-19 15:28:27 -0700 | [diff] [blame] | 910 | |
Mathieu Chartier | 2775ee4 | 2013-08-20 17:43:47 -0700 | [diff] [blame] | 911 | // How many GC threads we may use for paused parts of garbage collection. |
| 912 | const size_t parallel_gc_threads_; |
| 913 | |
| 914 | // How many GC threads we may use for unpaused parts of garbage collection. |
| 915 | const size_t conc_gc_threads_; |
Mathieu Chartier | 63a5434 | 2013-07-23 13:17:59 -0700 | [diff] [blame] | 916 | |
Mathieu Chartier | e0a53e9 | 2013-08-05 10:17:40 -0700 | [diff] [blame] | 917 | // Boolean for if we are in low memory mode. |
| 918 | const bool low_memory_mode_; |
| 919 | |
Mathieu Chartier | 2775ee4 | 2013-08-20 17:43:47 -0700 | [diff] [blame] | 920 | // If we get a pause longer than long pause log threshold, then we print out the GC after it |
| 921 | // finishes. |
| 922 | const size_t long_pause_log_threshold_; |
| 923 | |
| 924 | // If we get a GC longer than long GC log threshold, then we print out the GC after it finishes. |
| 925 | const size_t long_gc_log_threshold_; |
| 926 | |
| 927 | // If we ignore the max footprint it lets the heap grow until it hits the heap capacity, this is |
| 928 | // useful for benchmarking since it reduces time spent in GC to a low %. |
| 929 | const bool ignore_max_footprint_; |
| 930 | |
Mathieu Chartier | 8e4a96d | 2014-05-21 10:44:32 -0700 | [diff] [blame] | 931 | // Lock which guards zygote space creation. |
| 932 | Mutex zygote_creation_lock_; |
| 933 | |
Mathieu Chartier | e4cab17 | 2014-08-19 18:24:04 -0700 | [diff] [blame] | 934 | // Non-null iff we have a zygote space. Doesn't contain the large objects allocated before |
| 935 | // zygote space creation. |
| 936 | space::ZygoteSpace* zygote_space_; |
Ian Rogers | 00f7d0e | 2012-07-19 15:28:27 -0700 | [diff] [blame] | 937 | |
Mathieu Chartier | bd0a653 | 2014-02-27 11:14:21 -0800 | [diff] [blame] | 938 | // Minimum allocation size of large object. |
| 939 | size_t large_object_threshold_; |
| 940 | |
Ian Rogers | 00f7d0e | 2012-07-19 15:28:27 -0700 | [diff] [blame] | 941 | // Guards access to the state of GC, associated conditional variable is used to signal when a GC |
| 942 | // completes. |
| 943 | Mutex* gc_complete_lock_ DEFAULT_MUTEX_ACQUIRED_AFTER; |
Ian Rogers | 700a402 | 2014-05-19 16:49:03 -0700 | [diff] [blame] | 944 | std::unique_ptr<ConditionVariable> gc_complete_cond_ GUARDED_BY(gc_complete_lock_); |
Ian Rogers | 00f7d0e | 2012-07-19 15:28:27 -0700 | [diff] [blame] | 945 | |
Mathieu Chartier | 78f7b4c | 2014-05-06 10:57:27 -0700 | [diff] [blame] | 946 | // Reference processor; |
| 947 | ReferenceProcessor reference_processor_; |
Mathieu Chartier | 02b6a78 | 2012-10-26 13:51:26 -0700 | [diff] [blame] | 948 | |
Mathieu Chartier | a5eae69 | 2014-12-17 17:56:03 -0800 | [diff] [blame] | 949 | // Task processor, proxies heap trim requests to the daemon threads. |
| 950 | std::unique_ptr<TaskProcessor> task_processor_; |
| 951 | |
Carl Shapiro | 58551df | 2011-07-24 03:09:51 -0700 | [diff] [blame] | 952 | // True while the garbage collector is running. |
Mathieu Chartier | d5a89ee | 2014-01-31 09:55:13 -0800 | [diff] [blame] | 953 | volatile CollectorType collector_type_running_ GUARDED_BY(gc_complete_lock_); |
Mathieu Chartier | 866fb2a | 2012-09-10 10:47:49 -0700 | [diff] [blame] | 954 | |
| 955 | // 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] | 956 | volatile collector::GcType last_gc_type_ GUARDED_BY(gc_complete_lock_); |
Mathieu Chartier | bdd0fb9 | 2013-07-02 10:16:15 -0700 | [diff] [blame] | 957 | collector::GcType next_gc_type_; |
Mathieu Chartier | 1c23e1e | 2012-10-12 14:14:11 -0700 | [diff] [blame] | 958 | |
Mathieu Chartier | 2fde533 | 2012-09-14 14:51:54 -0700 | [diff] [blame] | 959 | // Maximum size that the heap can reach. |
Mathieu Chartier | 379d09f | 2015-01-08 11:28:13 -0800 | [diff] [blame] | 960 | size_t capacity_; |
Mathieu Chartier | 2775ee4 | 2013-08-20 17:43:47 -0700 | [diff] [blame] | 961 | |
Ian Rogers | 1d54e73 | 2013-05-02 21:10:01 -0700 | [diff] [blame] | 962 | // The size the heap is limited to. This is initially smaller than capacity, but for largeHeap |
| 963 | // programs it is "cleared" making it the same as capacity. |
Mathieu Chartier | 2fde533 | 2012-09-14 14:51:54 -0700 | [diff] [blame] | 964 | size_t growth_limit_; |
Mathieu Chartier | 2775ee4 | 2013-08-20 17:43:47 -0700 | [diff] [blame] | 965 | |
Ian Rogers | 1d54e73 | 2013-05-02 21:10:01 -0700 | [diff] [blame] | 966 | // When the number of bytes allocated exceeds the footprint TryAllocate returns NULL indicating |
| 967 | // a GC should be triggered. |
Mathieu Chartier | 1c23e1e | 2012-10-12 14:14:11 -0700 | [diff] [blame] | 968 | size_t max_allowed_footprint_; |
Mathieu Chartier | 2775ee4 | 2013-08-20 17:43:47 -0700 | [diff] [blame] | 969 | |
Mathieu Chartier | 987ccff | 2013-07-08 11:05:21 -0700 | [diff] [blame] | 970 | // The watermark at which a concurrent GC is requested by registerNativeAllocation. |
| 971 | size_t native_footprint_gc_watermark_; |
Mathieu Chartier | 2775ee4 | 2013-08-20 17:43:47 -0700 | [diff] [blame] | 972 | |
Mathieu Chartier | 590fee9 | 2013-09-13 13:46:47 -0700 | [diff] [blame] | 973 | // Whether or not we need to run finalizers in the next native allocation. |
| 974 | bool native_need_to_run_finalization_; |
| 975 | |
Mathieu Chartier | c39e342 | 2013-08-07 16:41:36 -0700 | [diff] [blame] | 976 | // Whether or not we currently care about pause times. |
Mathieu Chartier | ca2a24d | 2013-11-25 15:12:12 -0800 | [diff] [blame] | 977 | ProcessState process_state_; |
Mathieu Chartier | c39e342 | 2013-08-07 16:41:36 -0700 | [diff] [blame] | 978 | |
Ian Rogers | 1d54e73 | 2013-05-02 21:10:01 -0700 | [diff] [blame] | 979 | // When num_bytes_allocated_ exceeds this amount then a concurrent GC should be requested so that |
| 980 | // it completes ahead of an allocation failing. |
Mathieu Chartier | 0051be6 | 2012-10-12 17:47:11 -0700 | [diff] [blame] | 981 | size_t concurrent_start_bytes_; |
Mathieu Chartier | 1c23e1e | 2012-10-12 14:14:11 -0700 | [diff] [blame] | 982 | |
Ian Rogers | 1d54e73 | 2013-05-02 21:10:01 -0700 | [diff] [blame] | 983 | // Since the heap was created, how many bytes have been freed. |
Mathieu Chartier | dd162fb | 2014-08-06 17:06:33 -0700 | [diff] [blame] | 984 | uint64_t total_bytes_freed_ever_; |
Ian Rogers | 1d54e73 | 2013-05-02 21:10:01 -0700 | [diff] [blame] | 985 | |
| 986 | // Since the heap was created, how many objects have been freed. |
Mathieu Chartier | dd162fb | 2014-08-06 17:06:33 -0700 | [diff] [blame] | 987 | uint64_t total_objects_freed_ever_; |
Mathieu Chartier | 155dfe9 | 2012-10-09 14:24:49 -0700 | [diff] [blame] | 988 | |
Ian Rogers | 00f7d0e | 2012-07-19 15:28:27 -0700 | [diff] [blame] | 989 | // Number of bytes allocated. Adjusted after each allocation and free. |
Ian Rogers | ef7d42f | 2014-01-06 12:55:46 -0800 | [diff] [blame] | 990 | Atomic<size_t> num_bytes_allocated_; |
Ian Rogers | 00f7d0e | 2012-07-19 15:28:27 -0700 | [diff] [blame] | 991 | |
Mathieu Chartier | 987ccff | 2013-07-08 11:05:21 -0700 | [diff] [blame] | 992 | // 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] | 993 | Atomic<size_t> native_bytes_allocated_; |
Mathieu Chartier | 987ccff | 2013-07-08 11:05:21 -0700 | [diff] [blame] | 994 | |
Mathieu Chartier | 10fb83a | 2014-06-15 15:15:43 -0700 | [diff] [blame] | 995 | // Info related to the current or previous GC iteration. |
| 996 | collector::Iteration current_gc_iteration_; |
| 997 | |
Mathieu Chartier | fd678be | 2012-08-30 14:50:54 -0700 | [diff] [blame] | 998 | // Heap verification flags. |
Mathieu Chartier | c7b83a0 | 2012-09-11 18:07:39 -0700 | [diff] [blame] | 999 | const bool verify_missing_card_marks_; |
| 1000 | const bool verify_system_weaks_; |
| 1001 | const bool verify_pre_gc_heap_; |
Mathieu Chartier | 6f365cc | 2014-04-23 12:42:27 -0700 | [diff] [blame] | 1002 | const bool verify_pre_sweeping_heap_; |
Mathieu Chartier | c7b83a0 | 2012-09-11 18:07:39 -0700 | [diff] [blame] | 1003 | const bool verify_post_gc_heap_; |
Mathieu Chartier | fd678be | 2012-08-30 14:50:54 -0700 | [diff] [blame] | 1004 | const bool verify_mod_union_table_; |
Hiroshi Yamauchi | a4adbfd | 2014-02-04 18:12:17 -0800 | [diff] [blame] | 1005 | bool verify_pre_gc_rosalloc_; |
Mathieu Chartier | 6f365cc | 2014-04-23 12:42:27 -0700 | [diff] [blame] | 1006 | bool verify_pre_sweeping_rosalloc_; |
Hiroshi Yamauchi | a4adbfd | 2014-02-04 18:12:17 -0800 | [diff] [blame] | 1007 | bool verify_post_gc_rosalloc_; |
| 1008 | |
| 1009 | // RAII that temporarily disables the rosalloc verification during |
| 1010 | // the zygote fork. |
| 1011 | class ScopedDisableRosAllocVerification { |
| 1012 | private: |
Mathieu Chartier | 6f365cc | 2014-04-23 12:42:27 -0700 | [diff] [blame] | 1013 | Heap* const heap_; |
| 1014 | const bool orig_verify_pre_gc_; |
| 1015 | const bool orig_verify_pre_sweeping_; |
| 1016 | const bool orig_verify_post_gc_; |
| 1017 | |
Hiroshi Yamauchi | a4adbfd | 2014-02-04 18:12:17 -0800 | [diff] [blame] | 1018 | public: |
| 1019 | explicit ScopedDisableRosAllocVerification(Heap* heap) |
| 1020 | : heap_(heap), |
| 1021 | orig_verify_pre_gc_(heap_->verify_pre_gc_rosalloc_), |
Mathieu Chartier | 6f365cc | 2014-04-23 12:42:27 -0700 | [diff] [blame] | 1022 | orig_verify_pre_sweeping_(heap_->verify_pre_sweeping_rosalloc_), |
Hiroshi Yamauchi | a4adbfd | 2014-02-04 18:12:17 -0800 | [diff] [blame] | 1023 | orig_verify_post_gc_(heap_->verify_post_gc_rosalloc_) { |
| 1024 | heap_->verify_pre_gc_rosalloc_ = false; |
Mathieu Chartier | 6f365cc | 2014-04-23 12:42:27 -0700 | [diff] [blame] | 1025 | heap_->verify_pre_sweeping_rosalloc_ = false; |
Hiroshi Yamauchi | a4adbfd | 2014-02-04 18:12:17 -0800 | [diff] [blame] | 1026 | heap_->verify_post_gc_rosalloc_ = false; |
| 1027 | } |
| 1028 | ~ScopedDisableRosAllocVerification() { |
| 1029 | heap_->verify_pre_gc_rosalloc_ = orig_verify_pre_gc_; |
Mathieu Chartier | 6f365cc | 2014-04-23 12:42:27 -0700 | [diff] [blame] | 1030 | heap_->verify_pre_sweeping_rosalloc_ = orig_verify_pre_sweeping_; |
Hiroshi Yamauchi | a4adbfd | 2014-02-04 18:12:17 -0800 | [diff] [blame] | 1031 | heap_->verify_post_gc_rosalloc_ = orig_verify_post_gc_; |
| 1032 | } |
| 1033 | }; |
Mathieu Chartier | fd678be | 2012-08-30 14:50:54 -0700 | [diff] [blame] | 1034 | |
Mathieu Chartier | 02b6a78 | 2012-10-26 13:51:26 -0700 | [diff] [blame] | 1035 | // Parallel GC data structures. |
Ian Rogers | 700a402 | 2014-05-19 16:49:03 -0700 | [diff] [blame] | 1036 | std::unique_ptr<ThreadPool> thread_pool_; |
Mathieu Chartier | 02b6a78 | 2012-10-26 13:51:26 -0700 | [diff] [blame] | 1037 | |
Ian Rogers | 1d54e73 | 2013-05-02 21:10:01 -0700 | [diff] [blame] | 1038 | // Estimated allocation rate (bytes / second). Computed between the time of the last GC cycle |
| 1039 | // and the start of the current one. |
Mathieu Chartier | 65db880 | 2012-11-20 12:36:46 -0800 | [diff] [blame] | 1040 | uint64_t allocation_rate_; |
| 1041 | |
Ian Rogers | 1d54e73 | 2013-05-02 21:10:01 -0700 | [diff] [blame] | 1042 | // For a GC cycle, a bitmap that is set corresponding to the |
Ian Rogers | 700a402 | 2014-05-19 16:49:03 -0700 | [diff] [blame] | 1043 | std::unique_ptr<accounting::HeapBitmap> live_bitmap_ GUARDED_BY(Locks::heap_bitmap_lock_); |
| 1044 | std::unique_ptr<accounting::HeapBitmap> mark_bitmap_ GUARDED_BY(Locks::heap_bitmap_lock_); |
Mathieu Chartier | b062fdd | 2012-07-03 09:51:48 -0700 | [diff] [blame] | 1045 | |
Mathieu Chartier | e0f0cb3 | 2012-08-28 11:26:00 -0700 | [diff] [blame] | 1046 | // Mark stack that we reuse to avoid re-allocating the mark stack. |
Ian Rogers | 700a402 | 2014-05-19 16:49:03 -0700 | [diff] [blame] | 1047 | std::unique_ptr<accounting::ObjectStack> mark_stack_; |
Mathieu Chartier | 5301cd2 | 2012-05-31 12:11:36 -0700 | [diff] [blame] | 1048 | |
Mathieu Chartier | 357e9be | 2012-08-01 11:00:14 -0700 | [diff] [blame] | 1049 | // Allocation stack, new allocations go here so that we can do sticky mark bits. This enables us |
| 1050 | // to use the live bitmap as the old mark bitmap. |
Mathieu Chartier | d8195f1 | 2012-10-05 12:21:28 -0700 | [diff] [blame] | 1051 | const size_t max_allocation_stack_size_; |
Ian Rogers | 700a402 | 2014-05-19 16:49:03 -0700 | [diff] [blame] | 1052 | std::unique_ptr<accounting::ObjectStack> allocation_stack_; |
Mathieu Chartier | 357e9be | 2012-08-01 11:00:14 -0700 | [diff] [blame] | 1053 | |
| 1054 | // Second allocation stack so that we can process allocation with the heap unlocked. |
Ian Rogers | 700a402 | 2014-05-19 16:49:03 -0700 | [diff] [blame] | 1055 | std::unique_ptr<accounting::ObjectStack> live_stack_; |
Mathieu Chartier | 357e9be | 2012-08-01 11:00:14 -0700 | [diff] [blame] | 1056 | |
Mathieu Chartier | cbb2d20 | 2013-11-14 17:45:16 -0800 | [diff] [blame] | 1057 | // Allocator type. |
Mathieu Chartier | 5048223 | 2013-11-21 11:48:14 -0800 | [diff] [blame] | 1058 | AllocatorType current_allocator_; |
Mathieu Chartier | cbb2d20 | 2013-11-14 17:45:16 -0800 | [diff] [blame] | 1059 | const AllocatorType current_non_moving_allocator_; |
| 1060 | |
| 1061 | // Which GCs we run in order when we an allocation fails. |
| 1062 | std::vector<collector::GcType> gc_plan_; |
| 1063 | |
Mathieu Chartier | 590fee9 | 2013-09-13 13:46:47 -0700 | [diff] [blame] | 1064 | // Bump pointer spaces. |
| 1065 | space::BumpPointerSpace* bump_pointer_space_; |
| 1066 | // Temp space is the space which the semispace collector copies to. |
| 1067 | space::BumpPointerSpace* temp_space_; |
| 1068 | |
Hiroshi Yamauchi | 2cd334a | 2015-01-09 14:03:35 -0800 | [diff] [blame] | 1069 | space::RegionSpace* region_space_; |
| 1070 | |
Mathieu Chartier | 0051be6 | 2012-10-12 17:47:11 -0700 | [diff] [blame] | 1071 | // Minimum free guarantees that you always have at least min_free_ free bytes after growing for |
| 1072 | // utilization, regardless of target utilization ratio. |
| 1073 | size_t min_free_; |
| 1074 | |
| 1075 | // The ideal maximum free size, when we grow the heap for utilization. |
| 1076 | size_t max_free_; |
| 1077 | |
Brian Carlstrom | 395520e | 2011-09-25 19:35:00 -0700 | [diff] [blame] | 1078 | // Target ideal heap utilization ratio |
Mathieu Chartier | 0051be6 | 2012-10-12 17:47:11 -0700 | [diff] [blame] | 1079 | double target_utilization_; |
Brian Carlstrom | 395520e | 2011-09-25 19:35:00 -0700 | [diff] [blame] | 1080 | |
Mathieu Chartier | 2f8da3e | 2014-04-15 15:37:02 -0700 | [diff] [blame] | 1081 | // How much more we grow the heap when we are a foreground app instead of background. |
| 1082 | double foreground_heap_growth_multiplier_; |
| 1083 | |
Mathieu Chartier | 155dfe9 | 2012-10-09 14:24:49 -0700 | [diff] [blame] | 1084 | // Total time which mutators are paused or waiting for GC to complete. |
Mathieu Chartier | 155dfe9 | 2012-10-09 14:24:49 -0700 | [diff] [blame] | 1085 | uint64_t total_wait_time_; |
| 1086 | |
| 1087 | // Total number of objects allocated in microseconds. |
Mathieu Chartier | 155dfe9 | 2012-10-09 14:24:49 -0700 | [diff] [blame] | 1088 | AtomicInteger total_allocation_time_; |
| 1089 | |
Ian Rogers | 04d7aa9 | 2013-03-16 14:29:17 -0700 | [diff] [blame] | 1090 | // The current state of heap verification, may be enabled or disabled. |
Mathieu Chartier | 4e30541 | 2014-02-19 10:54:44 -0800 | [diff] [blame] | 1091 | VerifyObjectMode verify_object_mode_; |
Ian Rogers | 04d7aa9 | 2013-03-16 14:29:17 -0700 | [diff] [blame] | 1092 | |
Mathieu Chartier | 1d27b34 | 2014-01-28 12:51:09 -0800 | [diff] [blame] | 1093 | // Compacting GC disable count, prevents compacting GC from running iff > 0. |
| 1094 | size_t disable_moving_gc_count_ GUARDED_BY(gc_complete_lock_); |
Mathieu Chartier | 590fee9 | 2013-09-13 13:46:47 -0700 | [diff] [blame] | 1095 | |
| 1096 | std::vector<collector::GarbageCollector*> garbage_collectors_; |
| 1097 | collector::SemiSpace* semi_space_collector_; |
Mathieu Chartier | 52e4b43 | 2014-06-10 11:22:31 -0700 | [diff] [blame] | 1098 | collector::MarkCompact* mark_compact_collector_; |
Hiroshi Yamauchi | d5307ec | 2014-03-27 21:07:51 -0700 | [diff] [blame] | 1099 | collector::ConcurrentCopying* concurrent_copying_collector_; |
Brian Carlstrom | 1f87008 | 2011-08-23 16:02:11 -0700 | [diff] [blame] | 1100 | |
Hiroshi Yamauchi | 50b2928 | 2013-07-30 13:58:37 -0700 | [diff] [blame] | 1101 | const bool running_on_valgrind_; |
Mathieu Chartier | 692fafd | 2013-11-29 17:24:40 -0800 | [diff] [blame] | 1102 | const bool use_tlab_; |
Hiroshi Yamauchi | 50b2928 | 2013-07-30 13:58:37 -0700 | [diff] [blame] | 1103 | |
Zuo Wang | f37a88b | 2014-07-10 04:26:41 -0700 | [diff] [blame] | 1104 | // Pointer to the space which becomes the new main space when we do homogeneous space compaction. |
Mathieu Chartier | b363f66 | 2014-07-16 13:28:58 -0700 | [diff] [blame] | 1105 | // Use unique_ptr since the space is only added during the homogeneous compaction phase. |
| 1106 | std::unique_ptr<space::MallocSpace> main_space_backup_; |
Zuo Wang | f37a88b | 2014-07-10 04:26:41 -0700 | [diff] [blame] | 1107 | |
| 1108 | // Minimal interval allowed between two homogeneous space compactions caused by OOM. |
| 1109 | uint64_t min_interval_homogeneous_space_compaction_by_oom_; |
| 1110 | |
| 1111 | // Times of the last homogeneous space compaction caused by OOM. |
| 1112 | uint64_t last_time_homogeneous_space_compaction_by_oom_; |
| 1113 | |
| 1114 | // Saved OOMs by homogeneous space compaction. |
| 1115 | Atomic<size_t> count_delayed_oom_; |
| 1116 | |
| 1117 | // Count for requested homogeneous space compaction. |
| 1118 | Atomic<size_t> count_requested_homogeneous_space_compaction_; |
| 1119 | |
| 1120 | // Count for ignored homogeneous space compaction. |
| 1121 | Atomic<size_t> count_ignored_homogeneous_space_compaction_; |
| 1122 | |
| 1123 | // Count for performed homogeneous space compaction. |
| 1124 | Atomic<size_t> count_performed_homogeneous_space_compaction_; |
| 1125 | |
Mathieu Chartier | a5eae69 | 2014-12-17 17:56:03 -0800 | [diff] [blame] | 1126 | // Whether or not a concurrent GC is pending. |
| 1127 | Atomic<bool> concurrent_gc_pending_; |
| 1128 | |
| 1129 | // Active tasks which we can modify (change target time, desired collector type, etc..). |
| 1130 | CollectorTransitionTask* pending_collector_transition_ GUARDED_BY(pending_task_lock_); |
| 1131 | HeapTrimTask* pending_heap_trim_ GUARDED_BY(pending_task_lock_); |
| 1132 | |
Zuo Wang | f37a88b | 2014-07-10 04:26:41 -0700 | [diff] [blame] | 1133 | // Whether or not we use homogeneous space compaction to avoid OOM errors. |
| 1134 | bool use_homogeneous_space_compaction_for_oom_; |
| 1135 | |
Mathieu Chartier | a5eae69 | 2014-12-17 17:56:03 -0800 | [diff] [blame] | 1136 | friend class CollectorTransitionTask; |
Mathieu Chartier | 6f365cc | 2014-04-23 12:42:27 -0700 | [diff] [blame] | 1137 | friend class collector::GarbageCollector; |
Mathieu Chartier | 52e4b43 | 2014-06-10 11:22:31 -0700 | [diff] [blame] | 1138 | friend class collector::MarkCompact; |
Hiroshi Yamauchi | 2cd334a | 2015-01-09 14:03:35 -0800 | [diff] [blame] | 1139 | friend class collector::ConcurrentCopying; |
Ian Rogers | 1d54e73 | 2013-05-02 21:10:01 -0700 | [diff] [blame] | 1140 | friend class collector::MarkSweep; |
Mathieu Chartier | 590fee9 | 2013-09-13 13:46:47 -0700 | [diff] [blame] | 1141 | friend class collector::SemiSpace; |
Mathieu Chartier | 39e3261 | 2013-11-12 16:28:05 -0800 | [diff] [blame] | 1142 | friend class ReferenceQueue; |
Mathieu Chartier | c7b83a0 | 2012-09-11 18:07:39 -0700 | [diff] [blame] | 1143 | friend class VerifyReferenceCardVisitor; |
Mathieu Chartier | fd678be | 2012-08-30 14:50:54 -0700 | [diff] [blame] | 1144 | friend class VerifyReferenceVisitor; |
| 1145 | friend class VerifyObjectVisitor; |
Mathieu Chartier | 7c88c60 | 2014-07-08 17:46:19 -0700 | [diff] [blame] | 1146 | friend class ScopedHeapFill; |
Mathieu Chartier | b43b7d4 | 2012-06-19 13:15:09 -0700 | [diff] [blame] | 1147 | friend class ScopedHeapLock; |
Ian Rogers | 1d54e73 | 2013-05-02 21:10:01 -0700 | [diff] [blame] | 1148 | friend class space::SpaceTest; |
Ian Rogers | 30fab40 | 2012-01-23 15:43:46 -0800 | [diff] [blame] | 1149 | |
Hiroshi Yamauchi | 3b4c189 | 2013-09-12 21:33:12 -0700 | [diff] [blame] | 1150 | class AllocationTimer { |
| 1151 | private: |
| 1152 | Heap* heap_; |
| 1153 | mirror::Object** allocated_obj_ptr_; |
| 1154 | uint64_t allocation_start_time_; |
| 1155 | public: |
| 1156 | AllocationTimer(Heap* heap, mirror::Object** allocated_obj_ptr); |
| 1157 | ~AllocationTimer(); |
| 1158 | }; |
| 1159 | |
Carl Shapiro | 69759ea | 2011-07-21 18:13:35 -0700 | [diff] [blame] | 1160 | DISALLOW_IMPLICIT_CONSTRUCTORS(Heap); |
| 1161 | }; |
| 1162 | |
Mathieu Chartier | 7c88c60 | 2014-07-08 17:46:19 -0700 | [diff] [blame] | 1163 | // ScopedHeapFill changes the bytes allocated counter to be equal to the growth limit. This |
| 1164 | // causes the next allocation to perform a GC and possibly an OOM. It can be used to ensure that a |
| 1165 | // GC happens in specific methods such as ThrowIllegalMonitorStateExceptionF in Monitor::Wait. |
| 1166 | class ScopedHeapFill { |
| 1167 | public: |
| 1168 | explicit ScopedHeapFill(Heap* heap) |
| 1169 | : heap_(heap), |
| 1170 | delta_(heap_->GetMaxMemory() - heap_->GetBytesAllocated()) { |
| 1171 | heap_->num_bytes_allocated_.FetchAndAddSequentiallyConsistent(delta_); |
| 1172 | } |
| 1173 | ~ScopedHeapFill() { |
| 1174 | heap_->num_bytes_allocated_.FetchAndSubSequentiallyConsistent(delta_); |
| 1175 | } |
| 1176 | |
| 1177 | private: |
| 1178 | Heap* const heap_; |
| 1179 | const int64_t delta_; |
| 1180 | }; |
| 1181 | |
Ian Rogers | 1d54e73 | 2013-05-02 21:10:01 -0700 | [diff] [blame] | 1182 | } // namespace gc |
Carl Shapiro | 1fb8620 | 2011-06-27 17:43:13 -0700 | [diff] [blame] | 1183 | } // namespace art |
| 1184 | |
Brian Carlstrom | fc0e321 | 2013-07-17 14:40:12 -0700 | [diff] [blame] | 1185 | #endif // ART_RUNTIME_GC_HEAP_H_ |