Elliott Hughes | 2faa5f1 | 2012-01-30 14:42:07 -0800 | [diff] [blame] | 1 | /* |
| 2 | * Copyright (C) 2011 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 | 69759ea | 2011-07-21 18:13:35 -0700 | [diff] [blame] | 16 | |
Brian Carlstrom | 578bbdc | 2011-07-21 14:07:47 -0700 | [diff] [blame] | 17 | #include "heap.h" |
Carl Shapiro | 58551df | 2011-07-24 03:09:51 -0700 | [diff] [blame] | 18 | |
Mathieu Chartier | 752a0e6 | 2013-06-27 11:03:27 -0700 | [diff] [blame] | 19 | #define ATRACE_TAG ATRACE_TAG_DALVIK |
| 20 | #include <cutils/trace.h> |
Brian Carlstrom | 5643b78 | 2012-02-05 12:32:53 -0800 | [diff] [blame] | 21 | |
Brian Carlstrom | 58ae941 | 2011-10-04 00:56:06 -0700 | [diff] [blame] | 22 | #include <limits> |
Carl Shapiro | 58551df | 2011-07-24 03:09:51 -0700 | [diff] [blame] | 23 | #include <vector> |
| 24 | |
Mathieu Chartier | b2f9936 | 2013-11-20 17:26:00 -0800 | [diff] [blame] | 25 | #include "base/histogram-inl.h" |
Elliott Hughes | 1aa246d | 2012-12-13 09:29:36 -0800 | [diff] [blame] | 26 | #include "base/stl_util.h" |
Mathieu Chartier | 987ccff | 2013-07-08 11:05:21 -0700 | [diff] [blame] | 27 | #include "common_throws.h" |
Ian Rogers | 4893188 | 2013-01-22 14:35:16 -0800 | [diff] [blame] | 28 | #include "cutils/sched_policy.h" |
Elliott Hughes | 767a147 | 2011-10-26 18:49:02 -0700 | [diff] [blame] | 29 | #include "debugger.h" |
Ian Rogers | 1d54e73 | 2013-05-02 21:10:01 -0700 | [diff] [blame] | 30 | #include "gc/accounting/atomic_stack.h" |
| 31 | #include "gc/accounting/card_table-inl.h" |
| 32 | #include "gc/accounting/heap_bitmap-inl.h" |
Mathieu Chartier | 590fee9 | 2013-09-13 13:46:47 -0700 | [diff] [blame] | 33 | #include "gc/accounting/mod_union_table.h" |
Ian Rogers | 1d54e73 | 2013-05-02 21:10:01 -0700 | [diff] [blame] | 34 | #include "gc/accounting/mod_union_table-inl.h" |
Hiroshi Yamauchi | 38e68e9 | 2014-03-07 13:59:08 -0800 | [diff] [blame] | 35 | #include "gc/accounting/remembered_set.h" |
Ian Rogers | 1d54e73 | 2013-05-02 21:10:01 -0700 | [diff] [blame] | 36 | #include "gc/accounting/space_bitmap-inl.h" |
Hiroshi Yamauchi | d5307ec | 2014-03-27 21:07:51 -0700 | [diff] [blame] | 37 | #include "gc/collector/concurrent_copying.h" |
Ian Rogers | 1d54e73 | 2013-05-02 21:10:01 -0700 | [diff] [blame] | 38 | #include "gc/collector/mark_sweep-inl.h" |
| 39 | #include "gc/collector/partial_mark_sweep.h" |
Mathieu Chartier | 590fee9 | 2013-09-13 13:46:47 -0700 | [diff] [blame] | 40 | #include "gc/collector/semi_space.h" |
Ian Rogers | 1d54e73 | 2013-05-02 21:10:01 -0700 | [diff] [blame] | 41 | #include "gc/collector/sticky_mark_sweep.h" |
Mathieu Chartier | 78f7b4c | 2014-05-06 10:57:27 -0700 | [diff] [blame] | 42 | #include "gc/reference_processor.h" |
Mathieu Chartier | 590fee9 | 2013-09-13 13:46:47 -0700 | [diff] [blame] | 43 | #include "gc/space/bump_pointer_space.h" |
Hiroshi Yamauchi | 50b2928 | 2013-07-30 13:58:37 -0700 | [diff] [blame] | 44 | #include "gc/space/dlmalloc_space-inl.h" |
Ian Rogers | 1d54e73 | 2013-05-02 21:10:01 -0700 | [diff] [blame] | 45 | #include "gc/space/image_space.h" |
| 46 | #include "gc/space/large_object_space.h" |
Hiroshi Yamauchi | cf58d4a | 2013-09-26 14:21:22 -0700 | [diff] [blame] | 47 | #include "gc/space/rosalloc_space-inl.h" |
Ian Rogers | 1d54e73 | 2013-05-02 21:10:01 -0700 | [diff] [blame] | 48 | #include "gc/space/space-inl.h" |
Mathieu Chartier | a1602f2 | 2014-01-13 17:19:19 -0800 | [diff] [blame] | 49 | #include "gc/space/zygote_space.h" |
Mathieu Chartier | d889178 | 2014-03-02 13:28:37 -0800 | [diff] [blame] | 50 | #include "entrypoints/quick/quick_alloc_entrypoints.h" |
Hiroshi Yamauchi | 3b4c189 | 2013-09-12 21:33:12 -0700 | [diff] [blame] | 51 | #include "heap-inl.h" |
Brian Carlstrom | 9cff8e1 | 2011-08-18 16:47:29 -0700 | [diff] [blame] | 52 | #include "image.h" |
Brian Carlstrom | ea46f95 | 2013-07-30 01:26:50 -0700 | [diff] [blame] | 53 | #include "mirror/art_field-inl.h" |
Ian Rogers | 2dd0e2c | 2013-01-24 12:42:14 -0800 | [diff] [blame] | 54 | #include "mirror/class-inl.h" |
Ian Rogers | 2dd0e2c | 2013-01-24 12:42:14 -0800 | [diff] [blame] | 55 | #include "mirror/object.h" |
| 56 | #include "mirror/object-inl.h" |
| 57 | #include "mirror/object_array-inl.h" |
Mathieu Chartier | 8fa2dad | 2014-03-13 12:22:56 -0700 | [diff] [blame] | 58 | #include "mirror/reference-inl.h" |
Ian Rogers | 6d4d9fc | 2011-11-30 16:24:48 -0800 | [diff] [blame] | 59 | #include "object_utils.h" |
Brian Carlstrom | 5643b78 | 2012-02-05 12:32:53 -0800 | [diff] [blame] | 60 | #include "os.h" |
Ian Rogers | 53b8b09 | 2014-03-13 23:45:53 -0700 | [diff] [blame] | 61 | #include "reflection.h" |
Mathieu Chartier | 0de9f73 | 2013-11-22 17:58:48 -0800 | [diff] [blame] | 62 | #include "runtime.h" |
Mathieu Chartier | 7664f5c | 2012-06-08 18:15:32 -0700 | [diff] [blame] | 63 | #include "ScopedLocalRef.h" |
Ian Rogers | 00f7d0e | 2012-07-19 15:28:27 -0700 | [diff] [blame] | 64 | #include "scoped_thread_state_change.h" |
Ian Rogers | 1f53934 | 2012-10-03 21:09:42 -0700 | [diff] [blame] | 65 | #include "sirt_ref.h" |
Elliott Hughes | 8d768a9 | 2011-09-14 16:35:25 -0700 | [diff] [blame] | 66 | #include "thread_list.h" |
Elliott Hughes | 767a147 | 2011-10-26 18:49:02 -0700 | [diff] [blame] | 67 | #include "UniquePtr.h" |
Elliott Hughes | eac7667 | 2012-05-24 21:56:51 -0700 | [diff] [blame] | 68 | #include "well_known_classes.h" |
Carl Shapiro | 69759ea | 2011-07-21 18:13:35 -0700 | [diff] [blame] | 69 | |
| 70 | namespace art { |
Mathieu Chartier | 5048223 | 2013-11-21 11:48:14 -0800 | [diff] [blame] | 71 | |
Ian Rogers | 1d54e73 | 2013-05-02 21:10:01 -0700 | [diff] [blame] | 72 | namespace gc { |
Carl Shapiro | 69759ea | 2011-07-21 18:13:35 -0700 | [diff] [blame] | 73 | |
Mathieu Chartier | 91e3063 | 2014-03-25 15:58:50 -0700 | [diff] [blame] | 74 | static constexpr size_t kCollectorTransitionStressIterations = 0; |
| 75 | static constexpr size_t kCollectorTransitionStressWait = 10 * 1000; // Microseconds |
Mathieu Chartier | 720ef76 | 2013-08-17 14:46:54 -0700 | [diff] [blame] | 76 | static constexpr bool kGCALotMode = false; |
| 77 | static constexpr size_t kGcAlotInterval = KB; |
Ian Rogers | 1d54e73 | 2013-05-02 21:10:01 -0700 | [diff] [blame] | 78 | // Minimum amount of remaining bytes before a concurrent GC is triggered. |
Mathieu Chartier | 720ef76 | 2013-08-17 14:46:54 -0700 | [diff] [blame] | 79 | static constexpr size_t kMinConcurrentRemainingBytes = 128 * KB; |
Mathieu Chartier | 7476280 | 2014-01-24 10:21:35 -0800 | [diff] [blame] | 80 | static constexpr size_t kMaxConcurrentRemainingBytes = 512 * KB; |
Mathieu Chartier | df86d1f | 2014-04-08 13:44:04 -0700 | [diff] [blame] | 81 | // Sticky GC throughput adjustment, divided by 4. Increasing this causes sticky GC to occur more |
Mathieu Chartier | 73d1e17 | 2014-04-11 17:53:48 -0700 | [diff] [blame] | 82 | // relative to partial/full GC. This may be desirable since sticky GCs interfere less with mutator |
Mathieu Chartier | df86d1f | 2014-04-08 13:44:04 -0700 | [diff] [blame] | 83 | // threads (lower pauses, use less memory bandwidth). |
Mathieu Chartier | 73d1e17 | 2014-04-11 17:53:48 -0700 | [diff] [blame] | 84 | static constexpr double kStickyGcThroughputAdjustment = 1.0; |
Mathieu Chartier | 31f4414 | 2014-04-08 14:40:03 -0700 | [diff] [blame] | 85 | // Whether or not we use the free list large object space. |
| 86 | static constexpr bool kUseFreeListSpaceForLOS = false; |
| 87 | // Whtehr or not we compact the zygote in PreZygoteFork. |
| 88 | static constexpr bool kCompactZygote = kMovingCollector; |
| 89 | static constexpr size_t kNonMovingSpaceCapacity = 64 * MB; |
Mathieu Chartier | 0051be6 | 2012-10-12 17:47:11 -0700 | [diff] [blame] | 90 | |
Mathieu Chartier | 0051be6 | 2012-10-12 17:47:11 -0700 | [diff] [blame] | 91 | Heap::Heap(size_t initial_size, size_t growth_limit, size_t min_free, size_t max_free, |
Mathieu Chartier | 2f8da3e | 2014-04-15 15:37:02 -0700 | [diff] [blame] | 92 | double target_utilization, double foreground_heap_growth_multiplier, size_t capacity, |
Narayan Kamath | 11d9f06 | 2014-04-23 20:24:57 +0100 | [diff] [blame] | 93 | const std::string& image_file_name, const InstructionSet image_instruction_set, |
Mathieu Chartier | 31f4414 | 2014-04-08 14:40:03 -0700 | [diff] [blame] | 94 | CollectorType foreground_collector_type, CollectorType background_collector_type, |
Mathieu Chartier | e6da9af | 2013-12-16 11:54:42 -0800 | [diff] [blame] | 95 | size_t parallel_gc_threads, size_t conc_gc_threads, bool low_memory_mode, |
| 96 | size_t long_pause_log_threshold, size_t long_gc_log_threshold, |
Mathieu Chartier | 6f365cc | 2014-04-23 12:42:27 -0700 | [diff] [blame] | 97 | bool ignore_max_footprint, bool use_tlab, |
| 98 | bool verify_pre_gc_heap, bool verify_pre_sweeping_heap, bool verify_post_gc_heap, |
| 99 | bool verify_pre_gc_rosalloc, bool verify_pre_sweeping_rosalloc, |
Hiroshi Yamauchi | a4adbfd | 2014-02-04 18:12:17 -0800 | [diff] [blame] | 100 | bool verify_post_gc_rosalloc) |
Mathieu Chartier | cbb2d20 | 2013-11-14 17:45:16 -0800 | [diff] [blame] | 101 | : non_moving_space_(nullptr), |
Mathieu Chartier | e6da9af | 2013-12-16 11:54:42 -0800 | [diff] [blame] | 102 | rosalloc_space_(nullptr), |
| 103 | dlmalloc_space_(nullptr), |
Mathieu Chartier | fc5b528 | 2014-01-09 16:15:36 -0800 | [diff] [blame] | 104 | main_space_(nullptr), |
Mathieu Chartier | 7bf82af | 2013-12-06 16:51:45 -0800 | [diff] [blame] | 105 | collector_type_(kCollectorTypeNone), |
Mathieu Chartier | 31f4414 | 2014-04-08 14:40:03 -0700 | [diff] [blame] | 106 | foreground_collector_type_(foreground_collector_type), |
Mathieu Chartier | e6da9af | 2013-12-16 11:54:42 -0800 | [diff] [blame] | 107 | background_collector_type_(background_collector_type), |
Mathieu Chartier | 31f4414 | 2014-04-08 14:40:03 -0700 | [diff] [blame] | 108 | desired_collector_type_(foreground_collector_type_), |
Mathieu Chartier | a5f9de0 | 2014-02-28 16:48:42 -0800 | [diff] [blame] | 109 | heap_trim_request_lock_(nullptr), |
Mathieu Chartier | 7bf52d2 | 2014-03-13 14:46:09 -0700 | [diff] [blame] | 110 | last_trim_time_(0), |
Mathieu Chartier | a5f9de0 | 2014-02-28 16:48:42 -0800 | [diff] [blame] | 111 | heap_transition_target_time_(0), |
| 112 | heap_trim_request_pending_(false), |
Mathieu Chartier | 2775ee4 | 2013-08-20 17:43:47 -0700 | [diff] [blame] | 113 | parallel_gc_threads_(parallel_gc_threads), |
| 114 | conc_gc_threads_(conc_gc_threads), |
Mathieu Chartier | e0a53e9 | 2013-08-05 10:17:40 -0700 | [diff] [blame] | 115 | low_memory_mode_(low_memory_mode), |
Mathieu Chartier | 2775ee4 | 2013-08-20 17:43:47 -0700 | [diff] [blame] | 116 | long_pause_log_threshold_(long_pause_log_threshold), |
| 117 | long_gc_log_threshold_(long_gc_log_threshold), |
| 118 | ignore_max_footprint_(ignore_max_footprint), |
Ian Rogers | 00f7d0e | 2012-07-19 15:28:27 -0700 | [diff] [blame] | 119 | have_zygote_space_(false), |
Mathieu Chartier | bd0a653 | 2014-02-27 11:14:21 -0800 | [diff] [blame] | 120 | large_object_threshold_(std::numeric_limits<size_t>::max()), // Starts out disabled. |
Mathieu Chartier | d5a89ee | 2014-01-31 09:55:13 -0800 | [diff] [blame] | 121 | collector_type_running_(kCollectorTypeNone), |
Ian Rogers | 1d54e73 | 2013-05-02 21:10:01 -0700 | [diff] [blame] | 122 | last_gc_type_(collector::kGcTypeNone), |
Mathieu Chartier | bdd0fb9 | 2013-07-02 10:16:15 -0700 | [diff] [blame] | 123 | next_gc_type_(collector::kGcTypePartial), |
Mathieu Chartier | 80de7a6 | 2012-11-27 17:21:50 -0800 | [diff] [blame] | 124 | capacity_(capacity), |
Mathieu Chartier | 2fde533 | 2012-09-14 14:51:54 -0700 | [diff] [blame] | 125 | growth_limit_(growth_limit), |
Mathieu Chartier | 0051be6 | 2012-10-12 17:47:11 -0700 | [diff] [blame] | 126 | max_allowed_footprint_(initial_size), |
Mathieu Chartier | 987ccff | 2013-07-08 11:05:21 -0700 | [diff] [blame] | 127 | native_footprint_gc_watermark_(initial_size), |
| 128 | native_footprint_limit_(2 * initial_size), |
Mathieu Chartier | 590fee9 | 2013-09-13 13:46:47 -0700 | [diff] [blame] | 129 | native_need_to_run_finalization_(false), |
Mathieu Chartier | ca2a24d | 2013-11-25 15:12:12 -0800 | [diff] [blame] | 130 | // Initially assume we perceive jank in case the process state is never updated. |
| 131 | process_state_(kProcessStateJankPerceptible), |
Mathieu Chartier | 7bf82af | 2013-12-06 16:51:45 -0800 | [diff] [blame] | 132 | concurrent_start_bytes_(std::numeric_limits<size_t>::max()), |
Ian Rogers | 1d54e73 | 2013-05-02 21:10:01 -0700 | [diff] [blame] | 133 | total_bytes_freed_ever_(0), |
| 134 | total_objects_freed_ever_(0), |
Elliott Hughes | b3bd5f0 | 2012-03-08 21:05:27 -0800 | [diff] [blame] | 135 | num_bytes_allocated_(0), |
Mathieu Chartier | 987ccff | 2013-07-08 11:05:21 -0700 | [diff] [blame] | 136 | native_bytes_allocated_(0), |
Mathieu Chartier | 0a9dc05 | 2013-07-25 11:01:28 -0700 | [diff] [blame] | 137 | gc_memory_overhead_(0), |
Mathieu Chartier | c7b83a0 | 2012-09-11 18:07:39 -0700 | [diff] [blame] | 138 | verify_missing_card_marks_(false), |
| 139 | verify_system_weaks_(false), |
Mathieu Chartier | 938a03b | 2014-01-16 15:10:31 -0800 | [diff] [blame] | 140 | verify_pre_gc_heap_(verify_pre_gc_heap), |
Mathieu Chartier | 6f365cc | 2014-04-23 12:42:27 -0700 | [diff] [blame] | 141 | verify_pre_sweeping_heap_(verify_pre_sweeping_heap), |
Mathieu Chartier | 938a03b | 2014-01-16 15:10:31 -0800 | [diff] [blame] | 142 | verify_post_gc_heap_(verify_post_gc_heap), |
Mathieu Chartier | fd678be | 2012-08-30 14:50:54 -0700 | [diff] [blame] | 143 | verify_mod_union_table_(false), |
Hiroshi Yamauchi | a4adbfd | 2014-02-04 18:12:17 -0800 | [diff] [blame] | 144 | verify_pre_gc_rosalloc_(verify_pre_gc_rosalloc), |
Mathieu Chartier | 6f365cc | 2014-04-23 12:42:27 -0700 | [diff] [blame] | 145 | verify_pre_sweeping_rosalloc_(verify_pre_sweeping_rosalloc), |
Hiroshi Yamauchi | a4adbfd | 2014-02-04 18:12:17 -0800 | [diff] [blame] | 146 | verify_post_gc_rosalloc_(verify_post_gc_rosalloc), |
Mathieu Chartier | 65db880 | 2012-11-20 12:36:46 -0800 | [diff] [blame] | 147 | allocation_rate_(0), |
Mathieu Chartier | 0418ae2 | 2013-07-31 13:35:46 -0700 | [diff] [blame] | 148 | /* For GC a lot mode, we limit the allocations stacks to be kGcAlotInterval allocations. This |
| 149 | * causes a lot of GC since we do a GC for alloc whenever the stack is full. When heap |
| 150 | * verification is enabled, we limit the size of allocation stacks to speed up their |
| 151 | * searching. |
| 152 | */ |
| 153 | max_allocation_stack_size_(kGCALotMode ? kGcAlotInterval |
Mathieu Chartier | 4e30541 | 2014-02-19 10:54:44 -0800 | [diff] [blame] | 154 | : (kVerifyObjectSupport > kVerifyObjectModeFast) ? KB : MB), |
Mathieu Chartier | e6da9af | 2013-12-16 11:54:42 -0800 | [diff] [blame] | 155 | current_allocator_(kAllocatorTypeDlMalloc), |
| 156 | current_non_moving_allocator_(kAllocatorTypeNonMoving), |
Mathieu Chartier | 590fee9 | 2013-09-13 13:46:47 -0700 | [diff] [blame] | 157 | bump_pointer_space_(nullptr), |
| 158 | temp_space_(nullptr), |
Mathieu Chartier | 0051be6 | 2012-10-12 17:47:11 -0700 | [diff] [blame] | 159 | min_free_(min_free), |
| 160 | max_free_(max_free), |
| 161 | target_utilization_(target_utilization), |
Mathieu Chartier | 2f8da3e | 2014-04-15 15:37:02 -0700 | [diff] [blame] | 162 | foreground_heap_growth_multiplier_(foreground_heap_growth_multiplier), |
Mathieu Chartier | 155dfe9 | 2012-10-09 14:24:49 -0700 | [diff] [blame] | 163 | total_wait_time_(0), |
Mathieu Chartier | 155dfe9 | 2012-10-09 14:24:49 -0700 | [diff] [blame] | 164 | total_allocation_time_(0), |
Mathieu Chartier | 4e30541 | 2014-02-19 10:54:44 -0800 | [diff] [blame] | 165 | verify_object_mode_(kVerifyObjectModeDisabled), |
Mathieu Chartier | 1d27b34 | 2014-01-28 12:51:09 -0800 | [diff] [blame] | 166 | disable_moving_gc_count_(0), |
Mathieu Chartier | da44d77 | 2014-04-01 15:01:46 -0700 | [diff] [blame] | 167 | running_on_valgrind_(Runtime::Current()->RunningOnValgrind()), |
Mathieu Chartier | 692fafd | 2013-11-29 17:24:40 -0800 | [diff] [blame] | 168 | use_tlab_(use_tlab) { |
Elliott Hughes | 4dd9b4d | 2011-12-12 18:29:24 -0800 | [diff] [blame] | 169 | if (VLOG_IS_ON(heap) || VLOG_IS_ON(startup)) { |
Elliott Hughes | b3bd5f0 | 2012-03-08 21:05:27 -0800 | [diff] [blame] | 170 | LOG(INFO) << "Heap() entering"; |
Brian Carlstrom | 0a5b14d | 2011-09-27 13:29:15 -0700 | [diff] [blame] | 171 | } |
Hiroshi Yamauchi | 5ccd498 | 2014-03-11 12:19:04 -0700 | [diff] [blame] | 172 | const bool is_zygote = Runtime::Current()->IsZygote(); |
Mathieu Chartier | 5048223 | 2013-11-21 11:48:14 -0800 | [diff] [blame] | 173 | // If we aren't the zygote, switch to the default non zygote allocator. This may update the |
| 174 | // entrypoints. |
Hiroshi Yamauchi | 5ccd498 | 2014-03-11 12:19:04 -0700 | [diff] [blame] | 175 | if (!is_zygote) { |
Mathieu Chartier | bd0a653 | 2014-02-27 11:14:21 -0800 | [diff] [blame] | 176 | large_object_threshold_ = kDefaultLargeObjectThreshold; |
Mathieu Chartier | 31f4414 | 2014-04-08 14:40:03 -0700 | [diff] [blame] | 177 | // Background compaction is currently not supported for command line runs. |
| 178 | if (background_collector_type_ != foreground_collector_type_) { |
Mathieu Chartier | 52ba199 | 2014-05-07 14:39:21 -0700 | [diff] [blame] | 179 | VLOG(heap) << "Disabling background compaction for non zygote"; |
Mathieu Chartier | 31f4414 | 2014-04-08 14:40:03 -0700 | [diff] [blame] | 180 | background_collector_type_ = foreground_collector_type_; |
Mathieu Chartier | bd0a653 | 2014-02-27 11:14:21 -0800 | [diff] [blame] | 181 | } |
Mathieu Chartier | 5048223 | 2013-11-21 11:48:14 -0800 | [diff] [blame] | 182 | } |
Mathieu Chartier | a5f9de0 | 2014-02-28 16:48:42 -0800 | [diff] [blame] | 183 | ChangeCollector(desired_collector_type_); |
Mathieu Chartier | 7bf82af | 2013-12-06 16:51:45 -0800 | [diff] [blame] | 184 | |
Ian Rogers | 1d54e73 | 2013-05-02 21:10:01 -0700 | [diff] [blame] | 185 | live_bitmap_.reset(new accounting::HeapBitmap(this)); |
| 186 | mark_bitmap_.reset(new accounting::HeapBitmap(this)); |
Ian Rogers | 30fab40 | 2012-01-23 15:43:46 -0800 | [diff] [blame] | 187 | // Requested begin for the alloc space, to follow the mapped image and oat files |
Mathieu Chartier | 5048223 | 2013-11-21 11:48:14 -0800 | [diff] [blame] | 188 | byte* requested_alloc_space_begin = nullptr; |
Brian Carlstrom | 5643b78 | 2012-02-05 12:32:53 -0800 | [diff] [blame] | 189 | if (!image_file_name.empty()) { |
Narayan Kamath | 11d9f06 | 2014-04-23 20:24:57 +0100 | [diff] [blame] | 190 | space::ImageSpace* image_space = space::ImageSpace::Create(image_file_name.c_str(), |
| 191 | image_instruction_set); |
Mathieu Chartier | 5048223 | 2013-11-21 11:48:14 -0800 | [diff] [blame] | 192 | CHECK(image_space != nullptr) << "Failed to create space for " << image_file_name; |
Mathieu Chartier | 590fee9 | 2013-09-13 13:46:47 -0700 | [diff] [blame] | 193 | AddSpace(image_space); |
Ian Rogers | 30fab40 | 2012-01-23 15:43:46 -0800 | [diff] [blame] | 194 | // Oat files referenced by image files immediately follow them in memory, ensure alloc space |
| 195 | // isn't going to get in the middle |
Brian Carlstrom | 700c8d3 | 2012-11-05 10:42:02 -0800 | [diff] [blame] | 196 | byte* oat_file_end_addr = image_space->GetImageHeader().GetOatFileEnd(); |
| 197 | CHECK_GT(oat_file_end_addr, image_space->End()); |
Mathieu Chartier | 31f4414 | 2014-04-08 14:40:03 -0700 | [diff] [blame] | 198 | requested_alloc_space_begin = AlignUp(oat_file_end_addr, kPageSize); |
Brian Carlstrom | 69b15fb | 2011-09-03 12:25:21 -0700 | [diff] [blame] | 199 | } |
Hiroshi Yamauchi | 5ccd498 | 2014-03-11 12:19:04 -0700 | [diff] [blame] | 200 | if (is_zygote) { |
Mathieu Chartier | 31f4414 | 2014-04-08 14:40:03 -0700 | [diff] [blame] | 201 | // Reserve the address range before we create the non moving space to make sure bitmaps don't |
| 202 | // take it. |
Hiroshi Yamauchi | 5ccd498 | 2014-03-11 12:19:04 -0700 | [diff] [blame] | 203 | std::string error_str; |
Mathieu Chartier | 31f4414 | 2014-04-08 14:40:03 -0700 | [diff] [blame] | 204 | MemMap* mem_map = MemMap::MapAnonymous( |
| 205 | "main space", requested_alloc_space_begin + kNonMovingSpaceCapacity, capacity, |
| 206 | PROT_READ | PROT_WRITE, true, &error_str); |
| 207 | CHECK(mem_map != nullptr) << error_str; |
| 208 | // Non moving space is always dlmalloc since we currently don't have support for multiple |
| 209 | // rosalloc spaces. |
| 210 | non_moving_space_ = space::DlMallocSpace::Create( |
| 211 | "zygote / non moving space", initial_size, kNonMovingSpaceCapacity, kNonMovingSpaceCapacity, |
| 212 | requested_alloc_space_begin, false); |
Mathieu Chartier | 7840888 | 2014-04-11 18:06:01 -0700 | [diff] [blame] | 213 | non_moving_space_->SetFootprintLimit(non_moving_space_->Capacity()); |
Mathieu Chartier | 31f4414 | 2014-04-08 14:40:03 -0700 | [diff] [blame] | 214 | CreateMainMallocSpace(mem_map, initial_size, growth_limit, capacity); |
Hiroshi Yamauchi | 5ccd498 | 2014-03-11 12:19:04 -0700 | [diff] [blame] | 215 | } else { |
Hiroshi Yamauchi | 5ccd498 | 2014-03-11 12:19:04 -0700 | [diff] [blame] | 216 | std::string error_str; |
Mathieu Chartier | 31f4414 | 2014-04-08 14:40:03 -0700 | [diff] [blame] | 217 | MemMap* mem_map = MemMap::MapAnonymous("main/non-moving space", requested_alloc_space_begin, |
| 218 | capacity, PROT_READ | PROT_WRITE, true, &error_str); |
| 219 | CHECK(mem_map != nullptr) << error_str; |
| 220 | // Create the main free list space, which doubles as the non moving space. We can do this since |
| 221 | // non zygote means that we won't have any background compaction. |
| 222 | CreateMainMallocSpace(mem_map, initial_size, growth_limit, capacity); |
| 223 | non_moving_space_ = main_space_; |
Hiroshi Yamauchi | 5ccd498 | 2014-03-11 12:19:04 -0700 | [diff] [blame] | 224 | } |
Mathieu Chartier | 31f4414 | 2014-04-08 14:40:03 -0700 | [diff] [blame] | 225 | CHECK(non_moving_space_ != nullptr); |
| 226 | |
| 227 | // We need to create the bump pointer if the foreground collector is a compacting GC. We only |
| 228 | // create the bump pointer space if we are not a moving foreground collector but have a moving |
| 229 | // background collector since the heap transition code will create the temp space by recycling |
| 230 | // the bitmap from the main space. |
Mathieu Chartier | 590fee9 | 2013-09-13 13:46:47 -0700 | [diff] [blame] | 231 | if (kMovingCollector) { |
| 232 | // TODO: Place bump-pointer spaces somewhere to minimize size of card table. |
Mathieu Chartier | 309e3bf | 2014-04-14 11:30:39 -0700 | [diff] [blame] | 233 | // TODO: Not create all the bump pointer spaces if not necessary (currently only GSS needs all |
| 234 | // 2 of bump pointer spaces + main space) b/14059466. Divide by 2 for a temporary fix. |
| 235 | const size_t bump_pointer_space_capacity = capacity / 2; |
| 236 | bump_pointer_space_ = space::BumpPointerSpace::Create("Bump pointer space", |
| 237 | bump_pointer_space_capacity, nullptr); |
Mathieu Chartier | 590fee9 | 2013-09-13 13:46:47 -0700 | [diff] [blame] | 238 | CHECK(bump_pointer_space_ != nullptr) << "Failed to create bump pointer space"; |
| 239 | AddSpace(bump_pointer_space_); |
Mathieu Chartier | 309e3bf | 2014-04-14 11:30:39 -0700 | [diff] [blame] | 240 | temp_space_ = space::BumpPointerSpace::Create("Bump pointer space 2", |
| 241 | bump_pointer_space_capacity, nullptr); |
Mathieu Chartier | 590fee9 | 2013-09-13 13:46:47 -0700 | [diff] [blame] | 242 | CHECK(temp_space_ != nullptr) << "Failed to create bump pointer space"; |
| 243 | AddSpace(temp_space_); |
| 244 | } |
Mathieu Chartier | 31f4414 | 2014-04-08 14:40:03 -0700 | [diff] [blame] | 245 | if (non_moving_space_ != main_space_) { |
| 246 | AddSpace(non_moving_space_); |
| 247 | } |
| 248 | if (main_space_ != nullptr) { |
| 249 | AddSpace(main_space_); |
| 250 | } |
Mathieu Chartier | b062fdd | 2012-07-03 09:51:48 -0700 | [diff] [blame] | 251 | |
Mathieu Chartier | eb5710e | 2013-07-25 15:19:42 -0700 | [diff] [blame] | 252 | // Allocate the large object space. |
Mathieu Chartier | eb5710e | 2013-07-25 15:19:42 -0700 | [diff] [blame] | 253 | if (kUseFreeListSpaceForLOS) { |
Mathieu Chartier | e6da9af | 2013-12-16 11:54:42 -0800 | [diff] [blame] | 254 | large_object_space_ = space::FreeListSpace::Create("large object space", nullptr, capacity); |
Mathieu Chartier | eb5710e | 2013-07-25 15:19:42 -0700 | [diff] [blame] | 255 | } else { |
| 256 | large_object_space_ = space::LargeObjectMapSpace::Create("large object space"); |
| 257 | } |
Mathieu Chartier | e6da9af | 2013-12-16 11:54:42 -0800 | [diff] [blame] | 258 | CHECK(large_object_space_ != nullptr) << "Failed to create large object space"; |
Mathieu Chartier | 590fee9 | 2013-09-13 13:46:47 -0700 | [diff] [blame] | 259 | AddSpace(large_object_space_); |
Mathieu Chartier | eb5710e | 2013-07-25 15:19:42 -0700 | [diff] [blame] | 260 | |
Ian Rogers | 1d54e73 | 2013-05-02 21:10:01 -0700 | [diff] [blame] | 261 | // Compute heap capacity. Continuous spaces are sorted in order of Begin(). |
Mathieu Chartier | 590fee9 | 2013-09-13 13:46:47 -0700 | [diff] [blame] | 262 | CHECK(!continuous_spaces_.empty()); |
Mathieu Chartier | 938a03b | 2014-01-16 15:10:31 -0800 | [diff] [blame] | 263 | |
Mathieu Chartier | 590fee9 | 2013-09-13 13:46:47 -0700 | [diff] [blame] | 264 | // Relies on the spaces being sorted. |
Mathieu Chartier | 9be9a7a | 2014-01-24 14:07:33 -0800 | [diff] [blame] | 265 | byte* heap_begin = continuous_spaces_.front()->Begin(); |
| 266 | byte* heap_end = continuous_spaces_.back()->Limit(); |
Mathieu Chartier | 590fee9 | 2013-09-13 13:46:47 -0700 | [diff] [blame] | 267 | size_t heap_capacity = heap_end - heap_begin; |
Carl Shapiro | 69759ea | 2011-07-21 18:13:35 -0700 | [diff] [blame] | 268 | |
Elliott Hughes | 6c9c06d | 2011-11-07 16:43:47 -0800 | [diff] [blame] | 269 | // Allocate the card table. |
Ian Rogers | 1d54e73 | 2013-05-02 21:10:01 -0700 | [diff] [blame] | 270 | card_table_.reset(accounting::CardTable::Create(heap_begin, heap_capacity)); |
Mathieu Chartier | cc236d7 | 2012-07-20 10:29:05 -0700 | [diff] [blame] | 271 | CHECK(card_table_.get() != NULL) << "Failed to create card table"; |
Ian Rogers | 5d76c43 | 2011-10-31 21:42:49 -0700 | [diff] [blame] | 272 | |
Mathieu Chartier | 590fee9 | 2013-09-13 13:46:47 -0700 | [diff] [blame] | 273 | // Card cache for now since it makes it easier for us to update the references to the copying |
| 274 | // spaces. |
Mathieu Chartier | 11409ae | 2013-09-23 11:49:36 -0700 | [diff] [blame] | 275 | accounting::ModUnionTable* mod_union_table = |
Mathieu Chartier | 0e54cd0 | 2014-03-20 12:41:23 -0700 | [diff] [blame] | 276 | new accounting::ModUnionTableToZygoteAllocspace("Image mod-union table", this, |
| 277 | GetImageSpace()); |
Mathieu Chartier | 11409ae | 2013-09-23 11:49:36 -0700 | [diff] [blame] | 278 | CHECK(mod_union_table != nullptr) << "Failed to create image mod-union table"; |
| 279 | AddModUnionTable(mod_union_table); |
Carl Shapiro | 69759ea | 2011-07-21 18:13:35 -0700 | [diff] [blame] | 280 | |
Hiroshi Yamauchi | 38e68e9 | 2014-03-07 13:59:08 -0800 | [diff] [blame] | 281 | if (collector::SemiSpace::kUseRememberedSet) { |
| 282 | accounting::RememberedSet* non_moving_space_rem_set = |
| 283 | new accounting::RememberedSet("Non-moving space remembered set", this, non_moving_space_); |
| 284 | CHECK(non_moving_space_rem_set != nullptr) << "Failed to create non-moving space remembered set"; |
| 285 | AddRememberedSet(non_moving_space_rem_set); |
Mathieu Chartier | 31f4414 | 2014-04-08 14:40:03 -0700 | [diff] [blame] | 286 | if (main_space_ != nullptr && main_space_ != non_moving_space_) { |
| 287 | accounting::RememberedSet* main_space_rem_set = |
| 288 | new accounting::RememberedSet("Main space remembered set", this, main_space_); |
| 289 | CHECK(main_space_rem_set != nullptr) << "Failed to create main space remembered set"; |
| 290 | AddRememberedSet(main_space_rem_set); |
| 291 | } |
Hiroshi Yamauchi | 38e68e9 | 2014-03-07 13:59:08 -0800 | [diff] [blame] | 292 | } |
| 293 | |
Mathieu Chartier | 357e9be | 2012-08-01 11:00:14 -0700 | [diff] [blame] | 294 | // TODO: Count objects in the image space here. |
Mathieu Chartier | 1cd9c5c | 2012-08-23 10:52:44 -0700 | [diff] [blame] | 295 | num_bytes_allocated_ = 0; |
Ian Rogers | 0cfe1fb | 2011-08-26 03:29:44 -0700 | [diff] [blame] | 296 | |
Mathieu Chartier | d22d548 | 2012-11-06 17:14:12 -0800 | [diff] [blame] | 297 | // Default mark stack size in bytes. |
Mathieu Chartier | d8195f1 | 2012-10-05 12:21:28 -0700 | [diff] [blame] | 298 | static const size_t default_mark_stack_size = 64 * KB; |
Ian Rogers | 1d54e73 | 2013-05-02 21:10:01 -0700 | [diff] [blame] | 299 | mark_stack_.reset(accounting::ObjectStack::Create("mark stack", default_mark_stack_size)); |
| 300 | allocation_stack_.reset(accounting::ObjectStack::Create("allocation stack", |
| 301 | max_allocation_stack_size_)); |
| 302 | live_stack_.reset(accounting::ObjectStack::Create("live stack", |
| 303 | max_allocation_stack_size_)); |
Mathieu Chartier | 5301cd2 | 2012-05-31 12:11:36 -0700 | [diff] [blame] | 304 | |
Mathieu Chartier | 65db880 | 2012-11-20 12:36:46 -0800 | [diff] [blame] | 305 | // It's still too early to take a lock because there are no threads yet, but we can create locks |
| 306 | // now. We don't create it earlier to make it clear that you can't use locks during heap |
| 307 | // initialization. |
Mathieu Chartier | fd678be | 2012-08-30 14:50:54 -0700 | [diff] [blame] | 308 | gc_complete_lock_ = new Mutex("GC complete lock"); |
Ian Rogers | c604d73 | 2012-10-14 16:09:54 -0700 | [diff] [blame] | 309 | gc_complete_cond_.reset(new ConditionVariable("GC complete condition variable", |
| 310 | *gc_complete_lock_)); |
Mathieu Chartier | a5f9de0 | 2014-02-28 16:48:42 -0800 | [diff] [blame] | 311 | heap_trim_request_lock_ = new Mutex("Heap trim request lock"); |
Mathieu Chartier | 65db880 | 2012-11-20 12:36:46 -0800 | [diff] [blame] | 312 | last_gc_size_ = GetBytesAllocated(); |
| 313 | |
Mathieu Chartier | 2775ee4 | 2013-08-20 17:43:47 -0700 | [diff] [blame] | 314 | if (ignore_max_footprint_) { |
| 315 | SetIdealFootprint(std::numeric_limits<size_t>::max()); |
Mathieu Chartier | 590fee9 | 2013-09-13 13:46:47 -0700 | [diff] [blame] | 316 | concurrent_start_bytes_ = std::numeric_limits<size_t>::max(); |
Mathieu Chartier | 2775ee4 | 2013-08-20 17:43:47 -0700 | [diff] [blame] | 317 | } |
Mathieu Chartier | 590fee9 | 2013-09-13 13:46:47 -0700 | [diff] [blame] | 318 | CHECK_NE(max_allowed_footprint_, 0U); |
Mathieu Chartier | 2775ee4 | 2013-08-20 17:43:47 -0700 | [diff] [blame] | 319 | |
Mathieu Chartier | 2b82db4 | 2012-11-14 17:29:05 -0800 | [diff] [blame] | 320 | // Create our garbage collectors. |
Mathieu Chartier | 5048223 | 2013-11-21 11:48:14 -0800 | [diff] [blame] | 321 | for (size_t i = 0; i < 2; ++i) { |
| 322 | const bool concurrent = i != 0; |
| 323 | garbage_collectors_.push_back(new collector::MarkSweep(this, concurrent)); |
| 324 | garbage_collectors_.push_back(new collector::PartialMarkSweep(this, concurrent)); |
| 325 | garbage_collectors_.push_back(new collector::StickyMarkSweep(this, concurrent)); |
| 326 | } |
Mathieu Chartier | 5048223 | 2013-11-21 11:48:14 -0800 | [diff] [blame] | 327 | if (kMovingCollector) { |
| 328 | // TODO: Clean this up. |
Mathieu Chartier | 31f4414 | 2014-04-08 14:40:03 -0700 | [diff] [blame] | 329 | bool generational = foreground_collector_type_ == kCollectorTypeGSS; |
Hiroshi Yamauchi | df386c5 | 2014-04-08 16:21:52 -0700 | [diff] [blame] | 330 | semi_space_collector_ = new collector::SemiSpace(this, generational, |
| 331 | generational ? "generational" : ""); |
Mathieu Chartier | 590fee9 | 2013-09-13 13:46:47 -0700 | [diff] [blame] | 332 | garbage_collectors_.push_back(semi_space_collector_); |
Hiroshi Yamauchi | d5307ec | 2014-03-27 21:07:51 -0700 | [diff] [blame] | 333 | |
| 334 | concurrent_copying_collector_ = new collector::ConcurrentCopying(this); |
| 335 | garbage_collectors_.push_back(concurrent_copying_collector_); |
Mathieu Chartier | 0325e62 | 2012-09-05 14:22:51 -0700 | [diff] [blame] | 336 | } |
| 337 | |
Hiroshi Yamauchi | 3b4c189 | 2013-09-12 21:33:12 -0700 | [diff] [blame] | 338 | if (running_on_valgrind_) { |
Ian Rogers | fa82427 | 2013-11-05 16:12:57 -0800 | [diff] [blame] | 339 | Runtime::Current()->GetInstrumentation()->InstrumentQuickAllocEntryPoints(); |
Hiroshi Yamauchi | 3b4c189 | 2013-09-12 21:33:12 -0700 | [diff] [blame] | 340 | } |
| 341 | |
Elliott Hughes | 4dd9b4d | 2011-12-12 18:29:24 -0800 | [diff] [blame] | 342 | if (VLOG_IS_ON(heap) || VLOG_IS_ON(startup)) { |
Elliott Hughes | b3bd5f0 | 2012-03-08 21:05:27 -0800 | [diff] [blame] | 343 | LOG(INFO) << "Heap() exiting"; |
Brian Carlstrom | 0a5b14d | 2011-09-27 13:29:15 -0700 | [diff] [blame] | 344 | } |
Carl Shapiro | 69759ea | 2011-07-21 18:13:35 -0700 | [diff] [blame] | 345 | } |
| 346 | |
Mathieu Chartier | 31f4414 | 2014-04-08 14:40:03 -0700 | [diff] [blame] | 347 | void Heap::CreateMainMallocSpace(MemMap* mem_map, size_t initial_size, size_t growth_limit, |
| 348 | size_t capacity) { |
| 349 | // Is background compaction is enabled? |
| 350 | bool can_move_objects = IsMovingGc(background_collector_type_) != |
| 351 | IsMovingGc(foreground_collector_type_); |
| 352 | // If we are the zygote and don't yet have a zygote space, it means that the zygote fork will |
| 353 | // happen in the future. If this happens and we have kCompactZygote enabled we wish to compact |
| 354 | // from the main space to the zygote space. If background compaction is enabled, always pass in |
| 355 | // that we can move objets. |
| 356 | if (kCompactZygote && Runtime::Current()->IsZygote() && !can_move_objects) { |
| 357 | // After the zygote we want this to be false if we don't have background compaction enabled so |
| 358 | // that getting primitive array elements is faster. |
| 359 | can_move_objects = !have_zygote_space_; |
| 360 | } |
| 361 | if (kUseRosAlloc) { |
Mathieu Chartier | 1b54f9c | 2014-04-30 16:45:02 -0700 | [diff] [blame] | 362 | rosalloc_space_ = space::RosAllocSpace::CreateFromMemMap( |
| 363 | mem_map, "main rosalloc space", kDefaultStartingSize, initial_size, growth_limit, capacity, |
| 364 | low_memory_mode_, can_move_objects); |
| 365 | main_space_ = rosalloc_space_; |
Mathieu Chartier | 31f4414 | 2014-04-08 14:40:03 -0700 | [diff] [blame] | 366 | CHECK(main_space_ != nullptr) << "Failed to create rosalloc space"; |
| 367 | } else { |
Mathieu Chartier | 1b54f9c | 2014-04-30 16:45:02 -0700 | [diff] [blame] | 368 | dlmalloc_space_ = space::DlMallocSpace::CreateFromMemMap( |
| 369 | mem_map, "main dlmalloc space", kDefaultStartingSize, initial_size, growth_limit, capacity, |
| 370 | can_move_objects); |
Mathieu Chartier | 41961e2 | 2014-05-06 16:24:35 -0700 | [diff] [blame] | 371 | main_space_ = dlmalloc_space_; |
Mathieu Chartier | 31f4414 | 2014-04-08 14:40:03 -0700 | [diff] [blame] | 372 | CHECK(main_space_ != nullptr) << "Failed to create dlmalloc space"; |
| 373 | } |
| 374 | main_space_->SetFootprintLimit(main_space_->Capacity()); |
| 375 | VLOG(heap) << "Created main space " << main_space_; |
| 376 | } |
| 377 | |
Mathieu Chartier | 5048223 | 2013-11-21 11:48:14 -0800 | [diff] [blame] | 378 | void Heap::ChangeAllocator(AllocatorType allocator) { |
Mathieu Chartier | 5048223 | 2013-11-21 11:48:14 -0800 | [diff] [blame] | 379 | if (current_allocator_ != allocator) { |
Mathieu Chartier | d889178 | 2014-03-02 13:28:37 -0800 | [diff] [blame] | 380 | // These two allocators are only used internally and don't have any entrypoints. |
| 381 | CHECK_NE(allocator, kAllocatorTypeLOS); |
| 382 | CHECK_NE(allocator, kAllocatorTypeNonMoving); |
Mathieu Chartier | 5048223 | 2013-11-21 11:48:14 -0800 | [diff] [blame] | 383 | current_allocator_ = allocator; |
Mathieu Chartier | d889178 | 2014-03-02 13:28:37 -0800 | [diff] [blame] | 384 | MutexLock mu(nullptr, *Locks::runtime_shutdown_lock_); |
Mathieu Chartier | 5048223 | 2013-11-21 11:48:14 -0800 | [diff] [blame] | 385 | SetQuickAllocEntryPointsAllocator(current_allocator_); |
| 386 | Runtime::Current()->GetInstrumentation()->ResetQuickAllocEntryPoints(); |
| 387 | } |
| 388 | } |
| 389 | |
Mathieu Chartier | 6dda898 | 2014-03-06 11:11:48 -0800 | [diff] [blame] | 390 | void Heap::DisableCompaction() { |
Mathieu Chartier | 31f4414 | 2014-04-08 14:40:03 -0700 | [diff] [blame] | 391 | if (IsMovingGc(foreground_collector_type_)) { |
| 392 | foreground_collector_type_ = kCollectorTypeCMS; |
Mathieu Chartier | 6dda898 | 2014-03-06 11:11:48 -0800 | [diff] [blame] | 393 | } |
Mathieu Chartier | 31f4414 | 2014-04-08 14:40:03 -0700 | [diff] [blame] | 394 | if (IsMovingGc(background_collector_type_)) { |
| 395 | background_collector_type_ = foreground_collector_type_; |
Mathieu Chartier | 6dda898 | 2014-03-06 11:11:48 -0800 | [diff] [blame] | 396 | } |
Mathieu Chartier | 31f4414 | 2014-04-08 14:40:03 -0700 | [diff] [blame] | 397 | TransitionCollector(foreground_collector_type_); |
Mathieu Chartier | 6dda898 | 2014-03-06 11:11:48 -0800 | [diff] [blame] | 398 | } |
| 399 | |
Mathieu Chartier | 15d3402 | 2014-02-26 17:16:38 -0800 | [diff] [blame] | 400 | std::string Heap::SafeGetClassDescriptor(mirror::Class* klass) { |
| 401 | if (!IsValidContinuousSpaceObjectAddress(klass)) { |
| 402 | return StringPrintf("<non heap address klass %p>", klass); |
| 403 | } |
| 404 | mirror::Class* component_type = klass->GetComponentType<kVerifyNone>(); |
| 405 | if (IsValidContinuousSpaceObjectAddress(component_type) && klass->IsArrayClass<kVerifyNone>()) { |
| 406 | std::string result("["); |
| 407 | result += SafeGetClassDescriptor(component_type); |
| 408 | return result; |
| 409 | } else if (UNLIKELY(klass->IsPrimitive<kVerifyNone>())) { |
| 410 | return Primitive::Descriptor(klass->GetPrimitiveType<kVerifyNone>()); |
Mathieu Chartier | c2f4d02 | 2014-03-03 16:11:42 -0800 | [diff] [blame] | 411 | } else if (UNLIKELY(klass->IsProxyClass<kVerifyNone>())) { |
Mathieu Chartier | 15d3402 | 2014-02-26 17:16:38 -0800 | [diff] [blame] | 412 | return Runtime::Current()->GetClassLinker()->GetDescriptorForProxy(klass); |
| 413 | } else { |
Mathieu Chartier | c2f4d02 | 2014-03-03 16:11:42 -0800 | [diff] [blame] | 414 | mirror::DexCache* dex_cache = klass->GetDexCache<kVerifyNone>(); |
Mathieu Chartier | 15d3402 | 2014-02-26 17:16:38 -0800 | [diff] [blame] | 415 | if (!IsValidContinuousSpaceObjectAddress(dex_cache)) { |
| 416 | return StringPrintf("<non heap address dex_cache %p>", dex_cache); |
| 417 | } |
| 418 | const DexFile* dex_file = dex_cache->GetDexFile(); |
| 419 | uint16_t class_def_idx = klass->GetDexClassDefIndex(); |
| 420 | if (class_def_idx == DexFile::kDexNoIndex16) { |
| 421 | return "<class def not found>"; |
| 422 | } |
| 423 | const DexFile::ClassDef& class_def = dex_file->GetClassDef(class_def_idx); |
| 424 | const DexFile::TypeId& type_id = dex_file->GetTypeId(class_def.class_idx_); |
| 425 | return dex_file->GetTypeDescriptor(type_id); |
| 426 | } |
| 427 | } |
| 428 | |
| 429 | std::string Heap::SafePrettyTypeOf(mirror::Object* obj) { |
| 430 | if (obj == nullptr) { |
| 431 | return "null"; |
| 432 | } |
| 433 | mirror::Class* klass = obj->GetClass<kVerifyNone>(); |
| 434 | if (klass == nullptr) { |
| 435 | return "(class=null)"; |
| 436 | } |
| 437 | std::string result(SafeGetClassDescriptor(klass)); |
| 438 | if (obj->IsClass()) { |
Mathieu Chartier | c2f4d02 | 2014-03-03 16:11:42 -0800 | [diff] [blame] | 439 | result += "<" + SafeGetClassDescriptor(obj->AsClass<kVerifyNone>()) + ">"; |
Mathieu Chartier | 15d3402 | 2014-02-26 17:16:38 -0800 | [diff] [blame] | 440 | } |
| 441 | return result; |
| 442 | } |
| 443 | |
| 444 | void Heap::DumpObject(std::ostream& stream, mirror::Object* obj) { |
| 445 | if (obj == nullptr) { |
| 446 | stream << "(obj=null)"; |
| 447 | return; |
| 448 | } |
| 449 | if (IsAligned<kObjectAlignment>(obj)) { |
| 450 | space::Space* space = nullptr; |
| 451 | // Don't use find space since it only finds spaces which actually contain objects instead of |
| 452 | // spaces which may contain objects (e.g. cleared bump pointer spaces). |
| 453 | for (const auto& cur_space : continuous_spaces_) { |
| 454 | if (cur_space->HasAddress(obj)) { |
| 455 | space = cur_space; |
| 456 | break; |
| 457 | } |
| 458 | } |
Mathieu Chartier | 15d3402 | 2014-02-26 17:16:38 -0800 | [diff] [blame] | 459 | // Unprotect all the spaces. |
| 460 | for (const auto& space : continuous_spaces_) { |
| 461 | mprotect(space->Begin(), space->Capacity(), PROT_READ | PROT_WRITE); |
| 462 | } |
| 463 | stream << "Object " << obj; |
| 464 | if (space != nullptr) { |
| 465 | stream << " in space " << *space; |
| 466 | } |
Mathieu Chartier | c2f4d02 | 2014-03-03 16:11:42 -0800 | [diff] [blame] | 467 | mirror::Class* klass = obj->GetClass<kVerifyNone>(); |
Mathieu Chartier | 15d3402 | 2014-02-26 17:16:38 -0800 | [diff] [blame] | 468 | stream << "\nclass=" << klass; |
| 469 | if (klass != nullptr) { |
| 470 | stream << " type= " << SafePrettyTypeOf(obj); |
| 471 | } |
| 472 | // Re-protect the address we faulted on. |
| 473 | mprotect(AlignDown(obj, kPageSize), kPageSize, PROT_NONE); |
| 474 | } |
| 475 | } |
| 476 | |
Mathieu Chartier | 590fee9 | 2013-09-13 13:46:47 -0700 | [diff] [blame] | 477 | bool Heap::IsCompilingBoot() const { |
| 478 | for (const auto& space : continuous_spaces_) { |
Mathieu Chartier | 4e30541 | 2014-02-19 10:54:44 -0800 | [diff] [blame] | 479 | if (space->IsImageSpace() || space->IsZygoteSpace()) { |
Mathieu Chartier | 590fee9 | 2013-09-13 13:46:47 -0700 | [diff] [blame] | 480 | return false; |
| 481 | } |
| 482 | } |
| 483 | return true; |
| 484 | } |
| 485 | |
| 486 | bool Heap::HasImageSpace() const { |
| 487 | for (const auto& space : continuous_spaces_) { |
| 488 | if (space->IsImageSpace()) { |
| 489 | return true; |
| 490 | } |
| 491 | } |
| 492 | return false; |
| 493 | } |
| 494 | |
Mathieu Chartier | 1d27b34 | 2014-01-28 12:51:09 -0800 | [diff] [blame] | 495 | void Heap::IncrementDisableMovingGC(Thread* self) { |
Mathieu Chartier | 590fee9 | 2013-09-13 13:46:47 -0700 | [diff] [blame] | 496 | // Need to do this holding the lock to prevent races where the GC is about to run / running when |
| 497 | // we attempt to disable it. |
Mathieu Chartier | caa82d6 | 2014-02-02 16:51:17 -0800 | [diff] [blame] | 498 | ScopedThreadStateChange tsc(self, kWaitingForGcToComplete); |
Mathieu Chartier | 590fee9 | 2013-09-13 13:46:47 -0700 | [diff] [blame] | 499 | MutexLock mu(self, *gc_complete_lock_); |
Mathieu Chartier | 1d27b34 | 2014-01-28 12:51:09 -0800 | [diff] [blame] | 500 | ++disable_moving_gc_count_; |
Mathieu Chartier | 31f4414 | 2014-04-08 14:40:03 -0700 | [diff] [blame] | 501 | if (IsMovingGc(collector_type_running_)) { |
Mathieu Chartier | 89a201e | 2014-05-02 10:27:26 -0700 | [diff] [blame] | 502 | WaitForGcToCompleteLocked(kGcCauseDisableMovingGc, self); |
Mathieu Chartier | d5a89ee | 2014-01-31 09:55:13 -0800 | [diff] [blame] | 503 | } |
Mathieu Chartier | 590fee9 | 2013-09-13 13:46:47 -0700 | [diff] [blame] | 504 | } |
| 505 | |
Mathieu Chartier | 1d27b34 | 2014-01-28 12:51:09 -0800 | [diff] [blame] | 506 | void Heap::DecrementDisableMovingGC(Thread* self) { |
Mathieu Chartier | 590fee9 | 2013-09-13 13:46:47 -0700 | [diff] [blame] | 507 | MutexLock mu(self, *gc_complete_lock_); |
Mathieu Chartier | 1d27b34 | 2014-01-28 12:51:09 -0800 | [diff] [blame] | 508 | CHECK_GE(disable_moving_gc_count_, 0U); |
| 509 | --disable_moving_gc_count_; |
Mathieu Chartier | 590fee9 | 2013-09-13 13:46:47 -0700 | [diff] [blame] | 510 | } |
| 511 | |
Mathieu Chartier | ca2a24d | 2013-11-25 15:12:12 -0800 | [diff] [blame] | 512 | void Heap::UpdateProcessState(ProcessState process_state) { |
Mathieu Chartier | e6da9af | 2013-12-16 11:54:42 -0800 | [diff] [blame] | 513 | if (process_state_ != process_state) { |
| 514 | process_state_ = process_state; |
Mathieu Chartier | 91e3063 | 2014-03-25 15:58:50 -0700 | [diff] [blame] | 515 | for (size_t i = 1; i <= kCollectorTransitionStressIterations; ++i) { |
| 516 | // Start at index 1 to avoid "is always false" warning. |
| 517 | // Have iteration 1 always transition the collector. |
| 518 | TransitionCollector((((i & 1) == 1) == (process_state_ == kProcessStateJankPerceptible)) |
Mathieu Chartier | 31f4414 | 2014-04-08 14:40:03 -0700 | [diff] [blame] | 519 | ? foreground_collector_type_ : background_collector_type_); |
Mathieu Chartier | 91e3063 | 2014-03-25 15:58:50 -0700 | [diff] [blame] | 520 | usleep(kCollectorTransitionStressWait); |
| 521 | } |
Mathieu Chartier | e6da9af | 2013-12-16 11:54:42 -0800 | [diff] [blame] | 522 | if (process_state_ == kProcessStateJankPerceptible) { |
Mathieu Chartier | a5f9de0 | 2014-02-28 16:48:42 -0800 | [diff] [blame] | 523 | // Transition back to foreground right away to prevent jank. |
Mathieu Chartier | 31f4414 | 2014-04-08 14:40:03 -0700 | [diff] [blame] | 524 | RequestCollectorTransition(foreground_collector_type_, 0); |
Mathieu Chartier | e6da9af | 2013-12-16 11:54:42 -0800 | [diff] [blame] | 525 | } else { |
Mathieu Chartier | a5f9de0 | 2014-02-28 16:48:42 -0800 | [diff] [blame] | 526 | // Don't delay for debug builds since we may want to stress test the GC. |
Mathieu Chartier | 7bf52d2 | 2014-03-13 14:46:09 -0700 | [diff] [blame] | 527 | RequestCollectorTransition(background_collector_type_, kIsDebugBuild ? 0 : |
| 528 | kCollectorTransitionWait); |
Mathieu Chartier | e6da9af | 2013-12-16 11:54:42 -0800 | [diff] [blame] | 529 | } |
Mathieu Chartier | e6da9af | 2013-12-16 11:54:42 -0800 | [diff] [blame] | 530 | } |
Mathieu Chartier | ca2a24d | 2013-11-25 15:12:12 -0800 | [diff] [blame] | 531 | } |
| 532 | |
Mathieu Chartier | 02b6a78 | 2012-10-26 13:51:26 -0700 | [diff] [blame] | 533 | void Heap::CreateThreadPool() { |
Mathieu Chartier | 2775ee4 | 2013-08-20 17:43:47 -0700 | [diff] [blame] | 534 | const size_t num_threads = std::max(parallel_gc_threads_, conc_gc_threads_); |
| 535 | if (num_threads != 0) { |
Mathieu Chartier | bcd5e9d | 2013-11-13 14:33:28 -0800 | [diff] [blame] | 536 | thread_pool_.reset(new ThreadPool("Heap thread pool", num_threads)); |
Mathieu Chartier | 94c32c5 | 2013-08-09 11:14:04 -0700 | [diff] [blame] | 537 | } |
Mathieu Chartier | 02b6a78 | 2012-10-26 13:51:26 -0700 | [diff] [blame] | 538 | } |
| 539 | |
Mathieu Chartier | 83c8ee0 | 2014-01-28 14:50:23 -0800 | [diff] [blame] | 540 | void Heap::VisitObjects(ObjectCallback callback, void* arg) { |
Mathieu Chartier | 590fee9 | 2013-09-13 13:46:47 -0700 | [diff] [blame] | 541 | Thread* self = Thread::Current(); |
Mathieu Chartier | 692fafd | 2013-11-29 17:24:40 -0800 | [diff] [blame] | 542 | // GCs can move objects, so don't allow this. |
| 543 | const char* old_cause = self->StartAssertNoThreadSuspension("Visiting objects"); |
Mathieu Chartier | 590fee9 | 2013-09-13 13:46:47 -0700 | [diff] [blame] | 544 | if (bump_pointer_space_ != nullptr) { |
Mathieu Chartier | 692fafd | 2013-11-29 17:24:40 -0800 | [diff] [blame] | 545 | // Visit objects in bump pointer space. |
| 546 | bump_pointer_space_->Walk(callback, arg); |
Mathieu Chartier | 590fee9 | 2013-09-13 13:46:47 -0700 | [diff] [blame] | 547 | } |
| 548 | // TODO: Switch to standard begin and end to use ranged a based loop. |
| 549 | for (mirror::Object** it = allocation_stack_->Begin(), **end = allocation_stack_->End(); |
| 550 | it < end; ++it) { |
| 551 | mirror::Object* obj = *it; |
Mathieu Chartier | ebdf3f3 | 2014-02-13 10:23:27 -0800 | [diff] [blame] | 552 | if (obj != nullptr && obj->GetClass() != nullptr) { |
| 553 | // Avoid the race condition caused by the object not yet being written into the allocation |
Hiroshi Yamauchi | f5b0e20 | 2014-02-11 17:02:22 -0800 | [diff] [blame] | 554 | // stack or the class not yet being written in the object. Or, if kUseThreadLocalAllocationStack, |
| 555 | // there can be nulls on the allocation stack. |
Mathieu Chartier | ebdf3f3 | 2014-02-13 10:23:27 -0800 | [diff] [blame] | 556 | callback(obj, arg); |
| 557 | } |
Mathieu Chartier | 590fee9 | 2013-09-13 13:46:47 -0700 | [diff] [blame] | 558 | } |
| 559 | GetLiveBitmap()->Walk(callback, arg); |
Mathieu Chartier | 692fafd | 2013-11-29 17:24:40 -0800 | [diff] [blame] | 560 | self->EndAssertNoThreadSuspension(old_cause); |
Mathieu Chartier | 590fee9 | 2013-09-13 13:46:47 -0700 | [diff] [blame] | 561 | } |
| 562 | |
| 563 | void Heap::MarkAllocStackAsLive(accounting::ObjectStack* stack) { |
Mathieu Chartier | e6da9af | 2013-12-16 11:54:42 -0800 | [diff] [blame] | 564 | space::ContinuousSpace* space1 = rosalloc_space_ != nullptr ? rosalloc_space_ : non_moving_space_; |
| 565 | space::ContinuousSpace* space2 = dlmalloc_space_ != nullptr ? dlmalloc_space_ : non_moving_space_; |
| 566 | // This is just logic to handle a case of either not having a rosalloc or dlmalloc space. |
| 567 | // TODO: Generalize this to n bitmaps? |
| 568 | if (space1 == nullptr) { |
| 569 | DCHECK(space2 != nullptr); |
| 570 | space1 = space2; |
| 571 | } |
| 572 | if (space2 == nullptr) { |
| 573 | DCHECK(space1 != nullptr); |
| 574 | space2 = space1; |
| 575 | } |
| 576 | MarkAllocStack(space1->GetLiveBitmap(), space2->GetLiveBitmap(), |
Mathieu Chartier | bbd695c | 2014-04-16 09:48:48 -0700 | [diff] [blame] | 577 | large_object_space_->GetLiveBitmap(), stack); |
Mathieu Chartier | 590fee9 | 2013-09-13 13:46:47 -0700 | [diff] [blame] | 578 | } |
| 579 | |
Mathieu Chartier | 02b6a78 | 2012-10-26 13:51:26 -0700 | [diff] [blame] | 580 | void Heap::DeleteThreadPool() { |
Mathieu Chartier | 2775ee4 | 2013-08-20 17:43:47 -0700 | [diff] [blame] | 581 | thread_pool_.reset(nullptr); |
Mathieu Chartier | 02b6a78 | 2012-10-26 13:51:26 -0700 | [diff] [blame] | 582 | } |
| 583 | |
Mathieu Chartier | 1b54f9c | 2014-04-30 16:45:02 -0700 | [diff] [blame] | 584 | void Heap::AddSpace(space::Space* space) { |
Mathieu Chartier | e6da9af | 2013-12-16 11:54:42 -0800 | [diff] [blame] | 585 | DCHECK(space != nullptr); |
Mathieu Chartier | 590fee9 | 2013-09-13 13:46:47 -0700 | [diff] [blame] | 586 | WriterMutexLock mu(Thread::Current(), *Locks::heap_bitmap_lock_); |
| 587 | if (space->IsContinuousSpace()) { |
| 588 | DCHECK(!space->IsDiscontinuousSpace()); |
| 589 | space::ContinuousSpace* continuous_space = space->AsContinuousSpace(); |
| 590 | // Continuous spaces don't necessarily have bitmaps. |
Mathieu Chartier | a8e8f9c | 2014-04-09 14:51:05 -0700 | [diff] [blame] | 591 | accounting::ContinuousSpaceBitmap* live_bitmap = continuous_space->GetLiveBitmap(); |
| 592 | accounting::ContinuousSpaceBitmap* mark_bitmap = continuous_space->GetMarkBitmap(); |
Mathieu Chartier | 590fee9 | 2013-09-13 13:46:47 -0700 | [diff] [blame] | 593 | if (live_bitmap != nullptr) { |
| 594 | DCHECK(mark_bitmap != nullptr); |
| 595 | live_bitmap_->AddContinuousSpaceBitmap(live_bitmap); |
| 596 | mark_bitmap_->AddContinuousSpaceBitmap(mark_bitmap); |
Mathieu Chartier | 357e9be | 2012-08-01 11:00:14 -0700 | [diff] [blame] | 597 | } |
Mathieu Chartier | 590fee9 | 2013-09-13 13:46:47 -0700 | [diff] [blame] | 598 | continuous_spaces_.push_back(continuous_space); |
Mathieu Chartier | 590fee9 | 2013-09-13 13:46:47 -0700 | [diff] [blame] | 599 | // Ensure that spaces remain sorted in increasing order of start address. |
| 600 | std::sort(continuous_spaces_.begin(), continuous_spaces_.end(), |
| 601 | [](const space::ContinuousSpace* a, const space::ContinuousSpace* b) { |
| 602 | return a->Begin() < b->Begin(); |
| 603 | }); |
Mathieu Chartier | 590fee9 | 2013-09-13 13:46:47 -0700 | [diff] [blame] | 604 | } else { |
| 605 | DCHECK(space->IsDiscontinuousSpace()); |
| 606 | space::DiscontinuousSpace* discontinuous_space = space->AsDiscontinuousSpace(); |
Mathieu Chartier | bbd695c | 2014-04-16 09:48:48 -0700 | [diff] [blame] | 607 | live_bitmap_->AddLargeObjectBitmap(discontinuous_space->GetLiveBitmap()); |
| 608 | mark_bitmap_->AddLargeObjectBitmap(discontinuous_space->GetMarkBitmap()); |
Mathieu Chartier | 590fee9 | 2013-09-13 13:46:47 -0700 | [diff] [blame] | 609 | discontinuous_spaces_.push_back(discontinuous_space); |
| 610 | } |
| 611 | if (space->IsAllocSpace()) { |
| 612 | alloc_spaces_.push_back(space->AsAllocSpace()); |
Mathieu Chartier | 357e9be | 2012-08-01 11:00:14 -0700 | [diff] [blame] | 613 | } |
Elliott Hughes | b3bd5f0 | 2012-03-08 21:05:27 -0800 | [diff] [blame] | 614 | } |
| 615 | |
Mathieu Chartier | 1b54f9c | 2014-04-30 16:45:02 -0700 | [diff] [blame] | 616 | void Heap::SetSpaceAsDefault(space::ContinuousSpace* continuous_space) { |
| 617 | WriterMutexLock mu(Thread::Current(), *Locks::heap_bitmap_lock_); |
| 618 | if (continuous_space->IsDlMallocSpace()) { |
| 619 | dlmalloc_space_ = continuous_space->AsDlMallocSpace(); |
| 620 | } else if (continuous_space->IsRosAllocSpace()) { |
| 621 | rosalloc_space_ = continuous_space->AsRosAllocSpace(); |
| 622 | } |
| 623 | } |
| 624 | |
| 625 | void Heap::RemoveSpace(space::Space* space) { |
Mathieu Chartier | e6da9af | 2013-12-16 11:54:42 -0800 | [diff] [blame] | 626 | DCHECK(space != nullptr); |
| 627 | WriterMutexLock mu(Thread::Current(), *Locks::heap_bitmap_lock_); |
| 628 | if (space->IsContinuousSpace()) { |
| 629 | DCHECK(!space->IsDiscontinuousSpace()); |
| 630 | space::ContinuousSpace* continuous_space = space->AsContinuousSpace(); |
| 631 | // Continuous spaces don't necessarily have bitmaps. |
Mathieu Chartier | a8e8f9c | 2014-04-09 14:51:05 -0700 | [diff] [blame] | 632 | accounting::ContinuousSpaceBitmap* live_bitmap = continuous_space->GetLiveBitmap(); |
| 633 | accounting::ContinuousSpaceBitmap* mark_bitmap = continuous_space->GetMarkBitmap(); |
Mathieu Chartier | e6da9af | 2013-12-16 11:54:42 -0800 | [diff] [blame] | 634 | if (live_bitmap != nullptr) { |
| 635 | DCHECK(mark_bitmap != nullptr); |
| 636 | live_bitmap_->RemoveContinuousSpaceBitmap(live_bitmap); |
| 637 | mark_bitmap_->RemoveContinuousSpaceBitmap(mark_bitmap); |
| 638 | } |
| 639 | auto it = std::find(continuous_spaces_.begin(), continuous_spaces_.end(), continuous_space); |
| 640 | DCHECK(it != continuous_spaces_.end()); |
| 641 | continuous_spaces_.erase(it); |
Mathieu Chartier | e6da9af | 2013-12-16 11:54:42 -0800 | [diff] [blame] | 642 | } else { |
| 643 | DCHECK(space->IsDiscontinuousSpace()); |
| 644 | space::DiscontinuousSpace* discontinuous_space = space->AsDiscontinuousSpace(); |
Mathieu Chartier | bbd695c | 2014-04-16 09:48:48 -0700 | [diff] [blame] | 645 | live_bitmap_->RemoveLargeObjectBitmap(discontinuous_space->GetLiveBitmap()); |
| 646 | mark_bitmap_->RemoveLargeObjectBitmap(discontinuous_space->GetMarkBitmap()); |
Mathieu Chartier | e6da9af | 2013-12-16 11:54:42 -0800 | [diff] [blame] | 647 | auto it = std::find(discontinuous_spaces_.begin(), discontinuous_spaces_.end(), |
| 648 | discontinuous_space); |
| 649 | DCHECK(it != discontinuous_spaces_.end()); |
| 650 | discontinuous_spaces_.erase(it); |
| 651 | } |
| 652 | if (space->IsAllocSpace()) { |
| 653 | auto it = std::find(alloc_spaces_.begin(), alloc_spaces_.end(), space->AsAllocSpace()); |
| 654 | DCHECK(it != alloc_spaces_.end()); |
| 655 | alloc_spaces_.erase(it); |
| 656 | } |
| 657 | } |
| 658 | |
Mathieu Chartier | 0a9dc05 | 2013-07-25 11:01:28 -0700 | [diff] [blame] | 659 | void Heap::RegisterGCAllocation(size_t bytes) { |
Mathieu Chartier | 590fee9 | 2013-09-13 13:46:47 -0700 | [diff] [blame] | 660 | if (this != nullptr) { |
Ian Rogers | b122a4b | 2013-11-19 18:00:50 -0800 | [diff] [blame] | 661 | gc_memory_overhead_.FetchAndAdd(bytes); |
Mathieu Chartier | 0a9dc05 | 2013-07-25 11:01:28 -0700 | [diff] [blame] | 662 | } |
| 663 | } |
| 664 | |
| 665 | void Heap::RegisterGCDeAllocation(size_t bytes) { |
Mathieu Chartier | 590fee9 | 2013-09-13 13:46:47 -0700 | [diff] [blame] | 666 | if (this != nullptr) { |
Ian Rogers | b122a4b | 2013-11-19 18:00:50 -0800 | [diff] [blame] | 667 | gc_memory_overhead_.FetchAndSub(bytes); |
Mathieu Chartier | 0a9dc05 | 2013-07-25 11:01:28 -0700 | [diff] [blame] | 668 | } |
| 669 | } |
| 670 | |
Elliott Hughes | 8b788fe | 2013-04-17 15:57:01 -0700 | [diff] [blame] | 671 | void Heap::DumpGcPerformanceInfo(std::ostream& os) { |
Mathieu Chartier | 155dfe9 | 2012-10-09 14:24:49 -0700 | [diff] [blame] | 672 | // Dump cumulative timings. |
Elliott Hughes | 8b788fe | 2013-04-17 15:57:01 -0700 | [diff] [blame] | 673 | os << "Dumping cumulative Gc timings\n"; |
Mathieu Chartier | 155dfe9 | 2012-10-09 14:24:49 -0700 | [diff] [blame] | 674 | uint64_t total_duration = 0; |
Mathieu Chartier | 2b82db4 | 2012-11-14 17:29:05 -0800 | [diff] [blame] | 675 | // Dump cumulative loggers for each GC type. |
Mathieu Chartier | 2b82db4 | 2012-11-14 17:29:05 -0800 | [diff] [blame] | 676 | uint64_t total_paused_time = 0; |
Mathieu Chartier | 5a48719 | 2014-04-08 11:14:54 -0700 | [diff] [blame] | 677 | for (auto& collector : garbage_collectors_) { |
Mathieu Chartier | afe4998 | 2014-03-27 10:55:04 -0700 | [diff] [blame] | 678 | const CumulativeLogger& logger = collector->GetCumulativeTimings(); |
Mathieu Chartier | b6898f5 | 2014-04-09 11:41:49 -0700 | [diff] [blame] | 679 | const size_t iterations = logger.GetIterations(); |
Hiroshi Yamauchi | d20aba1 | 2014-04-11 15:31:09 -0700 | [diff] [blame] | 680 | const Histogram<uint64_t>& pause_histogram = collector->GetPauseHistogram(); |
| 681 | if (iterations != 0 && pause_histogram.SampleSize() != 0) { |
Mathieu Chartier | afe4998 | 2014-03-27 10:55:04 -0700 | [diff] [blame] | 682 | os << ConstDumpable<CumulativeLogger>(logger); |
Mathieu Chartier | 2b82db4 | 2012-11-14 17:29:05 -0800 | [diff] [blame] | 683 | const uint64_t total_ns = logger.GetTotalNs(); |
Mathieu Chartier | 02e2511 | 2013-08-14 16:14:24 -0700 | [diff] [blame] | 684 | const uint64_t total_pause_ns = collector->GetTotalPausedTimeNs(); |
Mathieu Chartier | 2b82db4 | 2012-11-14 17:29:05 -0800 | [diff] [blame] | 685 | double seconds = NsToMs(logger.GetTotalNs()) / 1000.0; |
| 686 | const uint64_t freed_bytes = collector->GetTotalFreedBytes(); |
| 687 | const uint64_t freed_objects = collector->GetTotalFreedObjects(); |
Mathieu Chartier | b2f9936 | 2013-11-20 17:26:00 -0800 | [diff] [blame] | 688 | Histogram<uint64_t>::CumulativeData cumulative_data; |
Hiroshi Yamauchi | d20aba1 | 2014-04-11 15:31:09 -0700 | [diff] [blame] | 689 | pause_histogram.CreateHistogram(&cumulative_data); |
| 690 | pause_histogram.PrintConfidenceIntervals(os, 0.99, cumulative_data); |
Mathieu Chartier | b6898f5 | 2014-04-09 11:41:49 -0700 | [diff] [blame] | 691 | os << collector->GetName() << " total time: " << PrettyDuration(total_ns) |
| 692 | << " mean time: " << PrettyDuration(total_ns / iterations) << "\n" |
Elliott Hughes | 8b788fe | 2013-04-17 15:57:01 -0700 | [diff] [blame] | 693 | << collector->GetName() << " freed: " << freed_objects |
| 694 | << " objects with total size " << PrettySize(freed_bytes) << "\n" |
| 695 | << collector->GetName() << " throughput: " << freed_objects / seconds << "/s / " |
| 696 | << PrettySize(freed_bytes / seconds) << "/s\n"; |
Mathieu Chartier | 2b82db4 | 2012-11-14 17:29:05 -0800 | [diff] [blame] | 697 | total_duration += total_ns; |
| 698 | total_paused_time += total_pause_ns; |
Mathieu Chartier | 155dfe9 | 2012-10-09 14:24:49 -0700 | [diff] [blame] | 699 | } |
Mathieu Chartier | 5a48719 | 2014-04-08 11:14:54 -0700 | [diff] [blame] | 700 | collector->ResetMeasurements(); |
Mathieu Chartier | 155dfe9 | 2012-10-09 14:24:49 -0700 | [diff] [blame] | 701 | } |
| 702 | uint64_t allocation_time = static_cast<uint64_t>(total_allocation_time_) * kTimeAdjust; |
Mathieu Chartier | 155dfe9 | 2012-10-09 14:24:49 -0700 | [diff] [blame] | 703 | if (total_duration != 0) { |
Brian Carlstrom | 2d88862 | 2013-07-18 17:02:00 -0700 | [diff] [blame] | 704 | const double total_seconds = static_cast<double>(total_duration / 1000) / 1000000.0; |
Elliott Hughes | 8b788fe | 2013-04-17 15:57:01 -0700 | [diff] [blame] | 705 | os << "Total time spent in GC: " << PrettyDuration(total_duration) << "\n"; |
| 706 | os << "Mean GC size throughput: " |
Ian Rogers | 1d54e73 | 2013-05-02 21:10:01 -0700 | [diff] [blame] | 707 | << PrettySize(GetBytesFreedEver() / total_seconds) << "/s\n"; |
Elliott Hughes | 8b788fe | 2013-04-17 15:57:01 -0700 | [diff] [blame] | 708 | os << "Mean GC object throughput: " |
Ian Rogers | 1d54e73 | 2013-05-02 21:10:01 -0700 | [diff] [blame] | 709 | << (GetObjectsFreedEver() / total_seconds) << " objects/s\n"; |
Mathieu Chartier | 155dfe9 | 2012-10-09 14:24:49 -0700 | [diff] [blame] | 710 | } |
Mathieu Chartier | 692fafd | 2013-11-29 17:24:40 -0800 | [diff] [blame] | 711 | size_t total_objects_allocated = GetObjectsAllocatedEver(); |
Elliott Hughes | 8b788fe | 2013-04-17 15:57:01 -0700 | [diff] [blame] | 712 | os << "Total number of allocations: " << total_objects_allocated << "\n"; |
Mathieu Chartier | 692fafd | 2013-11-29 17:24:40 -0800 | [diff] [blame] | 713 | size_t total_bytes_allocated = GetBytesAllocatedEver(); |
Elliott Hughes | 8b788fe | 2013-04-17 15:57:01 -0700 | [diff] [blame] | 714 | os << "Total bytes allocated " << PrettySize(total_bytes_allocated) << "\n"; |
Hiroshi Yamauchi | 50b2928 | 2013-07-30 13:58:37 -0700 | [diff] [blame] | 715 | if (kMeasureAllocationTime) { |
Elliott Hughes | 8b788fe | 2013-04-17 15:57:01 -0700 | [diff] [blame] | 716 | os << "Total time spent allocating: " << PrettyDuration(allocation_time) << "\n"; |
| 717 | os << "Mean allocation time: " << PrettyDuration(allocation_time / total_objects_allocated) |
| 718 | << "\n"; |
Mathieu Chartier | 155dfe9 | 2012-10-09 14:24:49 -0700 | [diff] [blame] | 719 | } |
Elliott Hughes | 8b788fe | 2013-04-17 15:57:01 -0700 | [diff] [blame] | 720 | os << "Total mutator paused time: " << PrettyDuration(total_paused_time) << "\n"; |
| 721 | os << "Total time waiting for GC to complete: " << PrettyDuration(total_wait_time_) << "\n"; |
Mathieu Chartier | 0a9dc05 | 2013-07-25 11:01:28 -0700 | [diff] [blame] | 722 | os << "Approximate GC data structures memory overhead: " << gc_memory_overhead_; |
Mathieu Chartier | 73d1e17 | 2014-04-11 17:53:48 -0700 | [diff] [blame] | 723 | BaseMutex::DumpAll(os); |
Mathieu Chartier | 155dfe9 | 2012-10-09 14:24:49 -0700 | [diff] [blame] | 724 | } |
| 725 | |
Elliott Hughes | b3bd5f0 | 2012-03-08 21:05:27 -0800 | [diff] [blame] | 726 | Heap::~Heap() { |
Mathieu Chartier | 590fee9 | 2013-09-13 13:46:47 -0700 | [diff] [blame] | 727 | VLOG(heap) << "Starting ~Heap()"; |
Mathieu Chartier | 590fee9 | 2013-09-13 13:46:47 -0700 | [diff] [blame] | 728 | STLDeleteElements(&garbage_collectors_); |
| 729 | // If we don't reset then the mark stack complains in its destructor. |
Mathieu Chartier | 357e9be | 2012-08-01 11:00:14 -0700 | [diff] [blame] | 730 | allocation_stack_->Reset(); |
| 731 | live_stack_->Reset(); |
Mathieu Chartier | 11409ae | 2013-09-23 11:49:36 -0700 | [diff] [blame] | 732 | STLDeleteValues(&mod_union_tables_); |
Mathieu Chartier | 0767c9a | 2014-03-26 12:53:19 -0700 | [diff] [blame] | 733 | STLDeleteValues(&remembered_sets_); |
Ian Rogers | 1d54e73 | 2013-05-02 21:10:01 -0700 | [diff] [blame] | 734 | STLDeleteElements(&continuous_spaces_); |
| 735 | STLDeleteElements(&discontinuous_spaces_); |
Ian Rogers | 00f7d0e | 2012-07-19 15:28:27 -0700 | [diff] [blame] | 736 | delete gc_complete_lock_; |
Mathieu Chartier | 0767c9a | 2014-03-26 12:53:19 -0700 | [diff] [blame] | 737 | delete heap_trim_request_lock_; |
Mathieu Chartier | 590fee9 | 2013-09-13 13:46:47 -0700 | [diff] [blame] | 738 | VLOG(heap) << "Finished ~Heap()"; |
Carl Shapiro | 69759ea | 2011-07-21 18:13:35 -0700 | [diff] [blame] | 739 | } |
| 740 | |
Ian Rogers | 1d54e73 | 2013-05-02 21:10:01 -0700 | [diff] [blame] | 741 | space::ContinuousSpace* Heap::FindContinuousSpaceFromObject(const mirror::Object* obj, |
| 742 | bool fail_ok) const { |
Mathieu Chartier | 02e2511 | 2013-08-14 16:14:24 -0700 | [diff] [blame] | 743 | for (const auto& space : continuous_spaces_) { |
| 744 | if (space->Contains(obj)) { |
| 745 | return space; |
Mathieu Chartier | b062fdd | 2012-07-03 09:51:48 -0700 | [diff] [blame] | 746 | } |
| 747 | } |
Ian Rogers | 1d54e73 | 2013-05-02 21:10:01 -0700 | [diff] [blame] | 748 | if (!fail_ok) { |
| 749 | LOG(FATAL) << "object " << reinterpret_cast<const void*>(obj) << " not inside any spaces!"; |
| 750 | } |
Mathieu Chartier | b062fdd | 2012-07-03 09:51:48 -0700 | [diff] [blame] | 751 | return NULL; |
| 752 | } |
| 753 | |
Ian Rogers | 1d54e73 | 2013-05-02 21:10:01 -0700 | [diff] [blame] | 754 | space::DiscontinuousSpace* Heap::FindDiscontinuousSpaceFromObject(const mirror::Object* obj, |
| 755 | bool fail_ok) const { |
Mathieu Chartier | 02e2511 | 2013-08-14 16:14:24 -0700 | [diff] [blame] | 756 | for (const auto& space : discontinuous_spaces_) { |
| 757 | if (space->Contains(obj)) { |
| 758 | return space; |
Ian Rogers | 1d54e73 | 2013-05-02 21:10:01 -0700 | [diff] [blame] | 759 | } |
| 760 | } |
| 761 | if (!fail_ok) { |
| 762 | LOG(FATAL) << "object " << reinterpret_cast<const void*>(obj) << " not inside any spaces!"; |
| 763 | } |
| 764 | return NULL; |
| 765 | } |
| 766 | |
| 767 | space::Space* Heap::FindSpaceFromObject(const mirror::Object* obj, bool fail_ok) const { |
| 768 | space::Space* result = FindContinuousSpaceFromObject(obj, true); |
| 769 | if (result != NULL) { |
| 770 | return result; |
| 771 | } |
| 772 | return FindDiscontinuousSpaceFromObject(obj, true); |
| 773 | } |
| 774 | |
| 775 | space::ImageSpace* Heap::GetImageSpace() const { |
Mathieu Chartier | 02e2511 | 2013-08-14 16:14:24 -0700 | [diff] [blame] | 776 | for (const auto& space : continuous_spaces_) { |
| 777 | if (space->IsImageSpace()) { |
| 778 | return space->AsImageSpace(); |
Mathieu Chartier | b062fdd | 2012-07-03 09:51:48 -0700 | [diff] [blame] | 779 | } |
| 780 | } |
| 781 | return NULL; |
| 782 | } |
| 783 | |
Elliott Hughes | 8a8b9cb | 2012-04-13 18:29:22 -0700 | [diff] [blame] | 784 | static void MSpaceChunkCallback(void* start, void* end, size_t used_bytes, void* arg) { |
Mathieu Chartier | 2fde533 | 2012-09-14 14:51:54 -0700 | [diff] [blame] | 785 | size_t chunk_size = reinterpret_cast<uint8_t*>(end) - reinterpret_cast<uint8_t*>(start); |
Elliott Hughes | 8a8b9cb | 2012-04-13 18:29:22 -0700 | [diff] [blame] | 786 | if (used_bytes < chunk_size) { |
Mathieu Chartier | 2fde533 | 2012-09-14 14:51:54 -0700 | [diff] [blame] | 787 | size_t chunk_free_bytes = chunk_size - used_bytes; |
| 788 | size_t& max_contiguous_allocation = *reinterpret_cast<size_t*>(arg); |
| 789 | max_contiguous_allocation = std::max(max_contiguous_allocation, chunk_free_bytes); |
Elliott Hughes | 8a8b9cb | 2012-04-13 18:29:22 -0700 | [diff] [blame] | 790 | } |
Mathieu Chartier | e0f0cb3 | 2012-08-28 11:26:00 -0700 | [diff] [blame] | 791 | } |
| 792 | |
Hiroshi Yamauchi | 3b4c189 | 2013-09-12 21:33:12 -0700 | [diff] [blame] | 793 | void Heap::ThrowOutOfMemoryError(Thread* self, size_t byte_count, bool large_object_allocation) { |
| 794 | std::ostringstream oss; |
Ian Rogers | ef7d42f | 2014-01-06 12:55:46 -0800 | [diff] [blame] | 795 | size_t total_bytes_free = GetFreeMemory(); |
Hiroshi Yamauchi | 3b4c189 | 2013-09-12 21:33:12 -0700 | [diff] [blame] | 796 | oss << "Failed to allocate a " << byte_count << " byte allocation with " << total_bytes_free |
| 797 | << " free bytes"; |
| 798 | // If the allocation failed due to fragmentation, print out the largest continuous allocation. |
| 799 | if (!large_object_allocation && total_bytes_free >= byte_count) { |
| 800 | size_t max_contiguous_allocation = 0; |
| 801 | for (const auto& space : continuous_spaces_) { |
Hiroshi Yamauchi | cf58d4a | 2013-09-26 14:21:22 -0700 | [diff] [blame] | 802 | if (space->IsMallocSpace()) { |
| 803 | // To allow the Walk/InspectAll() to exclusively-lock the mutator |
| 804 | // lock, temporarily release the shared access to the mutator |
| 805 | // lock here by transitioning to the suspended state. |
| 806 | Locks::mutator_lock_->AssertSharedHeld(self); |
| 807 | self->TransitionFromRunnableToSuspended(kSuspended); |
| 808 | space->AsMallocSpace()->Walk(MSpaceChunkCallback, &max_contiguous_allocation); |
| 809 | self->TransitionFromSuspendedToRunnable(); |
| 810 | Locks::mutator_lock_->AssertSharedHeld(self); |
Hiroshi Yamauchi | 3b4c189 | 2013-09-12 21:33:12 -0700 | [diff] [blame] | 811 | } |
| 812 | } |
| 813 | oss << "; failed due to fragmentation (largest possible contiguous allocation " |
| 814 | << max_contiguous_allocation << " bytes)"; |
Mathieu Chartier | 155dfe9 | 2012-10-09 14:24:49 -0700 | [diff] [blame] | 815 | } |
Hiroshi Yamauchi | 3b4c189 | 2013-09-12 21:33:12 -0700 | [diff] [blame] | 816 | self->ThrowOutOfMemoryError(oss.str().c_str()); |
| 817 | } |
Mathieu Chartier | e0f0cb3 | 2012-08-28 11:26:00 -0700 | [diff] [blame] | 818 | |
Mathieu Chartier | a5f9de0 | 2014-02-28 16:48:42 -0800 | [diff] [blame] | 819 | void Heap::DoPendingTransitionOrTrim() { |
| 820 | Thread* self = Thread::Current(); |
| 821 | CollectorType desired_collector_type; |
| 822 | // Wait until we reach the desired transition time. |
| 823 | while (true) { |
| 824 | uint64_t wait_time; |
| 825 | { |
| 826 | MutexLock mu(self, *heap_trim_request_lock_); |
| 827 | desired_collector_type = desired_collector_type_; |
| 828 | uint64_t current_time = NanoTime(); |
| 829 | if (current_time >= heap_transition_target_time_) { |
| 830 | break; |
| 831 | } |
| 832 | wait_time = heap_transition_target_time_ - current_time; |
| 833 | } |
| 834 | ScopedThreadStateChange tsc(self, kSleeping); |
| 835 | usleep(wait_time / 1000); // Usleep takes microseconds. |
| 836 | } |
Mathieu Chartier | 7bf52d2 | 2014-03-13 14:46:09 -0700 | [diff] [blame] | 837 | // Transition the collector if the desired collector type is not the same as the current |
| 838 | // collector type. |
Mathieu Chartier | a5f9de0 | 2014-02-28 16:48:42 -0800 | [diff] [blame] | 839 | TransitionCollector(desired_collector_type); |
Mathieu Chartier | 440e4ce | 2014-03-31 16:36:35 -0700 | [diff] [blame] | 840 | if (!CareAboutPauseTimes()) { |
| 841 | // Deflate the monitors, this can cause a pause but shouldn't matter since we don't care |
| 842 | // about pauses. |
| 843 | Runtime* runtime = Runtime::Current(); |
| 844 | runtime->GetThreadList()->SuspendAll(); |
| 845 | runtime->GetMonitorList()->DeflateMonitors(); |
| 846 | runtime->GetThreadList()->ResumeAll(); |
| 847 | // Do a heap trim if it is needed. |
| 848 | Trim(); |
| 849 | } |
Mathieu Chartier | a5f9de0 | 2014-02-28 16:48:42 -0800 | [diff] [blame] | 850 | } |
| 851 | |
Mathieu Chartier | 590fee9 | 2013-09-13 13:46:47 -0700 | [diff] [blame] | 852 | void Heap::Trim() { |
Mathieu Chartier | d5a89ee | 2014-01-31 09:55:13 -0800 | [diff] [blame] | 853 | Thread* self = Thread::Current(); |
| 854 | { |
Mathieu Chartier | a5f9de0 | 2014-02-28 16:48:42 -0800 | [diff] [blame] | 855 | MutexLock mu(self, *heap_trim_request_lock_); |
Mathieu Chartier | 7bf52d2 | 2014-03-13 14:46:09 -0700 | [diff] [blame] | 856 | if (!heap_trim_request_pending_ || last_trim_time_ + kHeapTrimWait >= NanoTime()) { |
Mathieu Chartier | a5f9de0 | 2014-02-28 16:48:42 -0800 | [diff] [blame] | 857 | return; |
| 858 | } |
Mathieu Chartier | 7bf52d2 | 2014-03-13 14:46:09 -0700 | [diff] [blame] | 859 | last_trim_time_ = NanoTime(); |
Mathieu Chartier | a5f9de0 | 2014-02-28 16:48:42 -0800 | [diff] [blame] | 860 | heap_trim_request_pending_ = false; |
| 861 | } |
| 862 | { |
Mathieu Chartier | caa82d6 | 2014-02-02 16:51:17 -0800 | [diff] [blame] | 863 | // Need to do this before acquiring the locks since we don't want to get suspended while |
| 864 | // holding any locks. |
| 865 | ScopedThreadStateChange tsc(self, kWaitingForGcToComplete); |
Mathieu Chartier | d5a89ee | 2014-01-31 09:55:13 -0800 | [diff] [blame] | 866 | // Pretend we are doing a GC to prevent background compaction from deleting the space we are |
| 867 | // trimming. |
| 868 | MutexLock mu(self, *gc_complete_lock_); |
| 869 | // Ensure there is only one GC at a time. |
Mathieu Chartier | 89a201e | 2014-05-02 10:27:26 -0700 | [diff] [blame] | 870 | WaitForGcToCompleteLocked(kGcCauseTrim, self); |
Mathieu Chartier | d5a89ee | 2014-01-31 09:55:13 -0800 | [diff] [blame] | 871 | collector_type_running_ = kCollectorTypeHeapTrim; |
| 872 | } |
Mathieu Chartier | 590fee9 | 2013-09-13 13:46:47 -0700 | [diff] [blame] | 873 | uint64_t start_ns = NanoTime(); |
| 874 | // Trim the managed spaces. |
| 875 | uint64_t total_alloc_space_allocated = 0; |
| 876 | uint64_t total_alloc_space_size = 0; |
| 877 | uint64_t managed_reclaimed = 0; |
| 878 | for (const auto& space : continuous_spaces_) { |
Mathieu Chartier | a1602f2 | 2014-01-13 17:19:19 -0800 | [diff] [blame] | 879 | if (space->IsMallocSpace()) { |
Hiroshi Yamauchi | cf58d4a | 2013-09-26 14:21:22 -0700 | [diff] [blame] | 880 | gc::space::MallocSpace* alloc_space = space->AsMallocSpace(); |
Mathieu Chartier | 590fee9 | 2013-09-13 13:46:47 -0700 | [diff] [blame] | 881 | total_alloc_space_size += alloc_space->Size(); |
| 882 | managed_reclaimed += alloc_space->Trim(); |
| 883 | } |
| 884 | } |
Mathieu Chartier | 31f4414 | 2014-04-08 14:40:03 -0700 | [diff] [blame] | 885 | total_alloc_space_allocated = GetBytesAllocated() - large_object_space_->GetBytesAllocated(); |
| 886 | if (bump_pointer_space_ != nullptr) { |
| 887 | total_alloc_space_allocated -= bump_pointer_space_->Size(); |
| 888 | } |
Mathieu Chartier | 590fee9 | 2013-09-13 13:46:47 -0700 | [diff] [blame] | 889 | const float managed_utilization = static_cast<float>(total_alloc_space_allocated) / |
| 890 | static_cast<float>(total_alloc_space_size); |
| 891 | uint64_t gc_heap_end_ns = NanoTime(); |
Mathieu Chartier | d5a89ee | 2014-01-31 09:55:13 -0800 | [diff] [blame] | 892 | // We never move things in the native heap, so we can finish the GC at this point. |
| 893 | FinishGC(self, collector::kGcTypeNone); |
Mathieu Chartier | 590fee9 | 2013-09-13 13:46:47 -0700 | [diff] [blame] | 894 | // Trim the native heap. |
| 895 | dlmalloc_trim(0); |
| 896 | size_t native_reclaimed = 0; |
| 897 | dlmalloc_inspect_all(DlmallocMadviseCallback, &native_reclaimed); |
| 898 | uint64_t end_ns = NanoTime(); |
| 899 | VLOG(heap) << "Heap trim of managed (duration=" << PrettyDuration(gc_heap_end_ns - start_ns) |
| 900 | << ", advised=" << PrettySize(managed_reclaimed) << ") and native (duration=" |
| 901 | << PrettyDuration(end_ns - gc_heap_end_ns) << ", advised=" << PrettySize(native_reclaimed) |
| 902 | << ") heaps. Managed heap utilization of " << static_cast<int>(100 * managed_utilization) |
| 903 | << "%."; |
| 904 | } |
| 905 | |
| 906 | bool Heap::IsValidObjectAddress(const mirror::Object* obj) const { |
| 907 | // Note: we deliberately don't take the lock here, and mustn't test anything that would require |
| 908 | // taking the lock. |
| 909 | if (obj == nullptr) { |
Elliott Hughes | 88c5c35 | 2012-03-15 18:49:48 -0700 | [diff] [blame] | 910 | return true; |
| 911 | } |
Mathieu Chartier | 15d3402 | 2014-02-26 17:16:38 -0800 | [diff] [blame] | 912 | return IsAligned<kObjectAlignment>(obj) && FindSpaceFromObject(obj, true) != nullptr; |
Mathieu Chartier | 590fee9 | 2013-09-13 13:46:47 -0700 | [diff] [blame] | 913 | } |
| 914 | |
Mathieu Chartier | d68ac70 | 2014-02-11 14:50:51 -0800 | [diff] [blame] | 915 | bool Heap::IsNonDiscontinuousSpaceHeapAddress(const mirror::Object* obj) const { |
| 916 | return FindContinuousSpaceFromObject(obj, true) != nullptr; |
| 917 | } |
| 918 | |
Mathieu Chartier | 15d3402 | 2014-02-26 17:16:38 -0800 | [diff] [blame] | 919 | bool Heap::IsValidContinuousSpaceObjectAddress(const mirror::Object* obj) const { |
| 920 | if (obj == nullptr || !IsAligned<kObjectAlignment>(obj)) { |
| 921 | return false; |
| 922 | } |
| 923 | for (const auto& space : continuous_spaces_) { |
| 924 | if (space->HasAddress(obj)) { |
| 925 | return true; |
| 926 | } |
| 927 | } |
| 928 | return false; |
Elliott Hughes | a250199 | 2011-08-26 19:39:54 -0700 | [diff] [blame] | 929 | } |
| 930 | |
Ian Rogers | ef7d42f | 2014-01-06 12:55:46 -0800 | [diff] [blame] | 931 | bool Heap::IsLiveObjectLocked(mirror::Object* obj, bool search_allocation_stack, |
Mathieu Chartier | 0f72e41 | 2013-09-06 16:40:01 -0700 | [diff] [blame] | 932 | bool search_live_stack, bool sorted) { |
Mathieu Chartier | 938a03b | 2014-01-16 15:10:31 -0800 | [diff] [blame] | 933 | if (UNLIKELY(!IsAligned<kObjectAlignment>(obj))) { |
| 934 | return false; |
| 935 | } |
| 936 | if (bump_pointer_space_ != nullptr && bump_pointer_space_->HasAddress(obj)) { |
Mathieu Chartier | 4e30541 | 2014-02-19 10:54:44 -0800 | [diff] [blame] | 937 | mirror::Class* klass = obj->GetClass<kVerifyNone>(); |
Mathieu Chartier | 938a03b | 2014-01-16 15:10:31 -0800 | [diff] [blame] | 938 | if (obj == klass) { |
Mathieu Chartier | 9be9a7a | 2014-01-24 14:07:33 -0800 | [diff] [blame] | 939 | // This case happens for java.lang.Class. |
Mathieu Chartier | 938a03b | 2014-01-16 15:10:31 -0800 | [diff] [blame] | 940 | return true; |
| 941 | } |
| 942 | return VerifyClassClass(klass) && IsLiveObjectLocked(klass); |
| 943 | } else if (temp_space_ != nullptr && temp_space_->HasAddress(obj)) { |
Mathieu Chartier | 4e30541 | 2014-02-19 10:54:44 -0800 | [diff] [blame] | 944 | // If we are in the allocated region of the temp space, then we are probably live (e.g. during |
| 945 | // a GC). When a GC isn't running End() - Begin() is 0 which means no objects are contained. |
| 946 | return temp_space_->Contains(obj); |
Ian Rogers | 1d54e73 | 2013-05-02 21:10:01 -0700 | [diff] [blame] | 947 | } |
Mathieu Chartier | f082d3c | 2013-07-29 17:04:07 -0700 | [diff] [blame] | 948 | space::ContinuousSpace* c_space = FindContinuousSpaceFromObject(obj, true); |
Mathieu Chartier | bbd695c | 2014-04-16 09:48:48 -0700 | [diff] [blame] | 949 | space::DiscontinuousSpace* d_space = nullptr; |
Mathieu Chartier | 938a03b | 2014-01-16 15:10:31 -0800 | [diff] [blame] | 950 | if (c_space != nullptr) { |
Mathieu Chartier | f082d3c | 2013-07-29 17:04:07 -0700 | [diff] [blame] | 951 | if (c_space->GetLiveBitmap()->Test(obj)) { |
Ian Rogers | 1d54e73 | 2013-05-02 21:10:01 -0700 | [diff] [blame] | 952 | return true; |
| 953 | } |
| 954 | } else { |
Mathieu Chartier | f082d3c | 2013-07-29 17:04:07 -0700 | [diff] [blame] | 955 | d_space = FindDiscontinuousSpaceFromObject(obj, true); |
Mathieu Chartier | 938a03b | 2014-01-16 15:10:31 -0800 | [diff] [blame] | 956 | if (d_space != nullptr) { |
Mathieu Chartier | bbd695c | 2014-04-16 09:48:48 -0700 | [diff] [blame] | 957 | if (d_space->GetLiveBitmap()->Test(obj)) { |
Ian Rogers | 1d54e73 | 2013-05-02 21:10:01 -0700 | [diff] [blame] | 958 | return true; |
| 959 | } |
| 960 | } |
| 961 | } |
Mathieu Chartier | f082d3c | 2013-07-29 17:04:07 -0700 | [diff] [blame] | 962 | // This is covering the allocation/live stack swapping that is done without mutators suspended. |
Mathieu Chartier | 0f72e41 | 2013-09-06 16:40:01 -0700 | [diff] [blame] | 963 | for (size_t i = 0; i < (sorted ? 1 : 5); ++i) { |
| 964 | if (i > 0) { |
| 965 | NanoSleep(MsToNs(10)); |
Ian Rogers | 1d54e73 | 2013-05-02 21:10:01 -0700 | [diff] [blame] | 966 | } |
Mathieu Chartier | 0f72e41 | 2013-09-06 16:40:01 -0700 | [diff] [blame] | 967 | if (search_allocation_stack) { |
| 968 | if (sorted) { |
Mathieu Chartier | 407f702 | 2014-02-18 14:37:05 -0800 | [diff] [blame] | 969 | if (allocation_stack_->ContainsSorted(obj)) { |
Mathieu Chartier | 0f72e41 | 2013-09-06 16:40:01 -0700 | [diff] [blame] | 970 | return true; |
| 971 | } |
Mathieu Chartier | 407f702 | 2014-02-18 14:37:05 -0800 | [diff] [blame] | 972 | } else if (allocation_stack_->Contains(obj)) { |
Mathieu Chartier | 0f72e41 | 2013-09-06 16:40:01 -0700 | [diff] [blame] | 973 | return true; |
| 974 | } |
| 975 | } |
| 976 | |
| 977 | if (search_live_stack) { |
| 978 | if (sorted) { |
Mathieu Chartier | 407f702 | 2014-02-18 14:37:05 -0800 | [diff] [blame] | 979 | if (live_stack_->ContainsSorted(obj)) { |
Mathieu Chartier | 0f72e41 | 2013-09-06 16:40:01 -0700 | [diff] [blame] | 980 | return true; |
| 981 | } |
Mathieu Chartier | 407f702 | 2014-02-18 14:37:05 -0800 | [diff] [blame] | 982 | } else if (live_stack_->Contains(obj)) { |
Mathieu Chartier | 0f72e41 | 2013-09-06 16:40:01 -0700 | [diff] [blame] | 983 | return true; |
| 984 | } |
| 985 | } |
Ian Rogers | 1d54e73 | 2013-05-02 21:10:01 -0700 | [diff] [blame] | 986 | } |
Mathieu Chartier | f082d3c | 2013-07-29 17:04:07 -0700 | [diff] [blame] | 987 | // We need to check the bitmaps again since there is a race where we mark something as live and |
| 988 | // then clear the stack containing it. |
Mathieu Chartier | 938a03b | 2014-01-16 15:10:31 -0800 | [diff] [blame] | 989 | if (c_space != nullptr) { |
Mathieu Chartier | f082d3c | 2013-07-29 17:04:07 -0700 | [diff] [blame] | 990 | if (c_space->GetLiveBitmap()->Test(obj)) { |
| 991 | return true; |
| 992 | } |
| 993 | } else { |
| 994 | d_space = FindDiscontinuousSpaceFromObject(obj, true); |
Mathieu Chartier | bbd695c | 2014-04-16 09:48:48 -0700 | [diff] [blame] | 995 | if (d_space != nullptr && d_space->GetLiveBitmap()->Test(obj)) { |
Mathieu Chartier | f082d3c | 2013-07-29 17:04:07 -0700 | [diff] [blame] | 996 | return true; |
| 997 | } |
| 998 | } |
Ian Rogers | 1d54e73 | 2013-05-02 21:10:01 -0700 | [diff] [blame] | 999 | return false; |
Elliott Hughes | 6a5bd49 | 2011-10-28 14:33:57 -0700 | [diff] [blame] | 1000 | } |
| 1001 | |
Mathieu Chartier | 590fee9 | 2013-09-13 13:46:47 -0700 | [diff] [blame] | 1002 | void Heap::DumpSpaces(std::ostream& stream) { |
Mathieu Chartier | 02e2511 | 2013-08-14 16:14:24 -0700 | [diff] [blame] | 1003 | for (const auto& space : continuous_spaces_) { |
Mathieu Chartier | a8e8f9c | 2014-04-09 14:51:05 -0700 | [diff] [blame] | 1004 | accounting::ContinuousSpaceBitmap* live_bitmap = space->GetLiveBitmap(); |
| 1005 | accounting::ContinuousSpaceBitmap* mark_bitmap = space->GetMarkBitmap(); |
Mathieu Chartier | 590fee9 | 2013-09-13 13:46:47 -0700 | [diff] [blame] | 1006 | stream << space << " " << *space << "\n"; |
| 1007 | if (live_bitmap != nullptr) { |
| 1008 | stream << live_bitmap << " " << *live_bitmap << "\n"; |
| 1009 | } |
| 1010 | if (mark_bitmap != nullptr) { |
| 1011 | stream << mark_bitmap << " " << *mark_bitmap << "\n"; |
| 1012 | } |
Mathieu Chartier | cc236d7 | 2012-07-20 10:29:05 -0700 | [diff] [blame] | 1013 | } |
Mathieu Chartier | 02e2511 | 2013-08-14 16:14:24 -0700 | [diff] [blame] | 1014 | for (const auto& space : discontinuous_spaces_) { |
Mathieu Chartier | 590fee9 | 2013-09-13 13:46:47 -0700 | [diff] [blame] | 1015 | stream << space << " " << *space << "\n"; |
Mathieu Chartier | 128c52c | 2012-10-16 14:12:41 -0700 | [diff] [blame] | 1016 | } |
Mathieu Chartier | cc236d7 | 2012-07-20 10:29:05 -0700 | [diff] [blame] | 1017 | } |
| 1018 | |
Ian Rogers | ef7d42f | 2014-01-06 12:55:46 -0800 | [diff] [blame] | 1019 | void Heap::VerifyObjectBody(mirror::Object* obj) { |
Mathieu Chartier | 4e30541 | 2014-02-19 10:54:44 -0800 | [diff] [blame] | 1020 | if (this == nullptr && verify_object_mode_ == kVerifyObjectModeDisabled) { |
| 1021 | return; |
| 1022 | } |
Mathieu Chartier | 0f72e41 | 2013-09-06 16:40:01 -0700 | [diff] [blame] | 1023 | // Ignore early dawn of the universe verifications. |
Ian Rogers | b122a4b | 2013-11-19 18:00:50 -0800 | [diff] [blame] | 1024 | if (UNLIKELY(static_cast<size_t>(num_bytes_allocated_.Load()) < 10 * KB)) { |
Ian Rogers | 62d6c77 | 2013-02-27 08:32:07 -0800 | [diff] [blame] | 1025 | return; |
| 1026 | } |
Mathieu Chartier | 4e30541 | 2014-02-19 10:54:44 -0800 | [diff] [blame] | 1027 | CHECK(IsAligned<kObjectAlignment>(obj)) << "Object isn't aligned: " << obj; |
Ian Rogers | b0fa5dc | 2014-04-28 16:47:08 -0700 | [diff] [blame] | 1028 | mirror::Class* c = obj->GetFieldObject<mirror::Class, kVerifyNone>(mirror::Object::ClassOffset()); |
Mathieu Chartier | 4e30541 | 2014-02-19 10:54:44 -0800 | [diff] [blame] | 1029 | CHECK(c != nullptr) << "Null class in object " << obj; |
| 1030 | CHECK(IsAligned<kObjectAlignment>(c)) << "Class " << c << " not aligned in object " << obj; |
Mathieu Chartier | 938a03b | 2014-01-16 15:10:31 -0800 | [diff] [blame] | 1031 | CHECK(VerifyClassClass(c)); |
Mathieu Chartier | 0325e62 | 2012-09-05 14:22:51 -0700 | [diff] [blame] | 1032 | |
Mathieu Chartier | 4e30541 | 2014-02-19 10:54:44 -0800 | [diff] [blame] | 1033 | if (verify_object_mode_ > kVerifyObjectModeFast) { |
| 1034 | // Note: the bitmap tests below are racy since we don't hold the heap bitmap lock. |
Ian Rogers | 1d54e73 | 2013-05-02 21:10:01 -0700 | [diff] [blame] | 1035 | if (!IsLiveObjectLocked(obj)) { |
| 1036 | DumpSpaces(); |
| 1037 | LOG(FATAL) << "Object is dead: " << obj; |
Mathieu Chartier | c7b83a0 | 2012-09-11 18:07:39 -0700 | [diff] [blame] | 1038 | } |
Mathieu Chartier | dcf8d72 | 2012-08-02 14:55:54 -0700 | [diff] [blame] | 1039 | } |
Ian Rogers | 0cfe1fb | 2011-08-26 03:29:44 -0700 | [diff] [blame] | 1040 | } |
| 1041 | |
Ian Rogers | 2dd0e2c | 2013-01-24 12:42:14 -0800 | [diff] [blame] | 1042 | void Heap::VerificationCallback(mirror::Object* obj, void* arg) { |
Mathieu Chartier | 357e9be | 2012-08-01 11:00:14 -0700 | [diff] [blame] | 1043 | reinterpret_cast<Heap*>(arg)->VerifyObjectBody(obj); |
Ian Rogers | 0cfe1fb | 2011-08-26 03:29:44 -0700 | [diff] [blame] | 1044 | } |
| 1045 | |
| 1046 | void Heap::VerifyHeap() { |
Ian Rogers | 50b35e2 | 2012-10-04 10:09:15 -0700 | [diff] [blame] | 1047 | ReaderMutexLock mu(Thread::Current(), *Locks::heap_bitmap_lock_); |
Mathieu Chartier | b062fdd | 2012-07-03 09:51:48 -0700 | [diff] [blame] | 1048 | GetLiveBitmap()->Walk(Heap::VerificationCallback, this); |
Ian Rogers | 0cfe1fb | 2011-08-26 03:29:44 -0700 | [diff] [blame] | 1049 | } |
| 1050 | |
Mathieu Chartier | e76e70f | 2014-05-02 16:35:37 -0700 | [diff] [blame] | 1051 | void Heap::RecordFree(uint64_t freed_objects, int64_t freed_bytes) { |
Mathieu Chartier | 601276a | 2014-03-20 15:12:30 -0700 | [diff] [blame] | 1052 | // Use signed comparison since freed bytes can be negative when background compaction foreground |
| 1053 | // transitions occurs. This is caused by the moving objects from a bump pointer space to a |
| 1054 | // free list backed space typically increasing memory footprint due to padding and binning. |
Mathieu Chartier | e76e70f | 2014-05-02 16:35:37 -0700 | [diff] [blame] | 1055 | DCHECK_LE(freed_bytes, static_cast<int64_t>(num_bytes_allocated_.Load())); |
| 1056 | // Note: This relies on 2s complement for handling negative freed_bytes. |
| 1057 | num_bytes_allocated_.FetchAndSub(static_cast<ssize_t>(freed_bytes)); |
Elliott Hughes | 9d5ccec | 2011-09-19 13:19:50 -0700 | [diff] [blame] | 1058 | if (Runtime::Current()->HasStatsEnabled()) { |
Elliott Hughes | 9d5ccec | 2011-09-19 13:19:50 -0700 | [diff] [blame] | 1059 | RuntimeStats* thread_stats = Thread::Current()->GetStats(); |
Mathieu Chartier | 357e9be | 2012-08-01 11:00:14 -0700 | [diff] [blame] | 1060 | thread_stats->freed_objects += freed_objects; |
Elliott Hughes | 307f75d | 2011-10-12 18:04:40 -0700 | [diff] [blame] | 1061 | thread_stats->freed_bytes += freed_bytes; |
Mathieu Chartier | 2fde533 | 2012-09-14 14:51:54 -0700 | [diff] [blame] | 1062 | // TODO: Do this concurrently. |
| 1063 | RuntimeStats* global_stats = Runtime::Current()->GetStats(); |
| 1064 | global_stats->freed_objects += freed_objects; |
| 1065 | global_stats->freed_bytes += freed_bytes; |
Elliott Hughes | 9d5ccec | 2011-09-19 13:19:50 -0700 | [diff] [blame] | 1066 | } |
Carl Shapiro | 58551df | 2011-07-24 03:09:51 -0700 | [diff] [blame] | 1067 | } |
| 1068 | |
Mathieu Chartier | cbb2d20 | 2013-11-14 17:45:16 -0800 | [diff] [blame] | 1069 | mirror::Object* Heap::AllocateInternalWithGc(Thread* self, AllocatorType allocator, |
Mathieu Chartier | c528dba | 2013-11-26 12:00:11 -0800 | [diff] [blame] | 1070 | size_t alloc_size, size_t* bytes_allocated, |
Ian Rogers | 6fac447 | 2014-02-25 17:01:10 -0800 | [diff] [blame] | 1071 | size_t* usable_size, |
Mathieu Chartier | c528dba | 2013-11-26 12:00:11 -0800 | [diff] [blame] | 1072 | mirror::Class** klass) { |
Mathieu Chartier | cbb2d20 | 2013-11-14 17:45:16 -0800 | [diff] [blame] | 1073 | mirror::Object* ptr = nullptr; |
Mathieu Chartier | e6da9af | 2013-12-16 11:54:42 -0800 | [diff] [blame] | 1074 | bool was_default_allocator = allocator == GetCurrentAllocator(); |
Mathieu Chartier | c528dba | 2013-11-26 12:00:11 -0800 | [diff] [blame] | 1075 | DCHECK(klass != nullptr); |
| 1076 | SirtRef<mirror::Class> sirt_klass(self, *klass); |
Mathieu Chartier | 866fb2a | 2012-09-10 10:47:49 -0700 | [diff] [blame] | 1077 | // The allocation failed. If the GC is running, block until it completes, and then retry the |
| 1078 | // allocation. |
Mathieu Chartier | 89a201e | 2014-05-02 10:27:26 -0700 | [diff] [blame] | 1079 | collector::GcType last_gc = WaitForGcToComplete(kGcCauseForAlloc, self); |
Ian Rogers | 1d54e73 | 2013-05-02 21:10:01 -0700 | [diff] [blame] | 1080 | if (last_gc != collector::kGcTypeNone) { |
Mathieu Chartier | e6da9af | 2013-12-16 11:54:42 -0800 | [diff] [blame] | 1081 | // If we were the default allocator but the allocator changed while we were suspended, |
| 1082 | // abort the allocation. |
| 1083 | if (was_default_allocator && allocator != GetCurrentAllocator()) { |
| 1084 | *klass = sirt_klass.get(); |
| 1085 | return nullptr; |
| 1086 | } |
Mathieu Chartier | 866fb2a | 2012-09-10 10:47:49 -0700 | [diff] [blame] | 1087 | // A GC was in progress and we blocked, retry allocation now that memory has been freed. |
Ian Rogers | 6fac447 | 2014-02-25 17:01:10 -0800 | [diff] [blame] | 1088 | ptr = TryToAllocate<true, false>(self, allocator, alloc_size, bytes_allocated, usable_size); |
Carl Shapiro | 69759ea | 2011-07-21 18:13:35 -0700 | [diff] [blame] | 1089 | } |
| 1090 | |
Mathieu Chartier | 5ae2c93 | 2014-03-28 16:22:20 -0700 | [diff] [blame] | 1091 | collector::GcType tried_type = next_gc_type_; |
| 1092 | if (ptr == nullptr) { |
| 1093 | const bool gc_ran = |
| 1094 | CollectGarbageInternal(tried_type, kGcCauseForAlloc, false) != collector::kGcTypeNone; |
| 1095 | if (was_default_allocator && allocator != GetCurrentAllocator()) { |
| 1096 | *klass = sirt_klass.get(); |
| 1097 | return nullptr; |
| 1098 | } |
| 1099 | if (gc_ran) { |
| 1100 | ptr = TryToAllocate<true, false>(self, allocator, alloc_size, bytes_allocated, usable_size); |
| 1101 | } |
| 1102 | } |
| 1103 | |
Mathieu Chartier | 866fb2a | 2012-09-10 10:47:49 -0700 | [diff] [blame] | 1104 | // Loop through our different Gc types and try to Gc until we get enough free memory. |
Mathieu Chartier | cbb2d20 | 2013-11-14 17:45:16 -0800 | [diff] [blame] | 1105 | for (collector::GcType gc_type : gc_plan_) { |
| 1106 | if (ptr != nullptr) { |
| 1107 | break; |
Mathieu Chartier | 866fb2a | 2012-09-10 10:47:49 -0700 | [diff] [blame] | 1108 | } |
Mathieu Chartier | 5ae2c93 | 2014-03-28 16:22:20 -0700 | [diff] [blame] | 1109 | if (gc_type == tried_type) { |
| 1110 | continue; |
| 1111 | } |
Mathieu Chartier | cbb2d20 | 2013-11-14 17:45:16 -0800 | [diff] [blame] | 1112 | // Attempt to run the collector, if we succeed, re-try the allocation. |
Mathieu Chartier | 5ae2c93 | 2014-03-28 16:22:20 -0700 | [diff] [blame] | 1113 | const bool gc_ran = |
Mathieu Chartier | e6da9af | 2013-12-16 11:54:42 -0800 | [diff] [blame] | 1114 | CollectGarbageInternal(gc_type, kGcCauseForAlloc, false) != collector::kGcTypeNone; |
| 1115 | if (was_default_allocator && allocator != GetCurrentAllocator()) { |
| 1116 | *klass = sirt_klass.get(); |
| 1117 | return nullptr; |
| 1118 | } |
| 1119 | if (gc_ran) { |
Mathieu Chartier | 866fb2a | 2012-09-10 10:47:49 -0700 | [diff] [blame] | 1120 | // Did we free sufficient memory for the allocation to succeed? |
Ian Rogers | 6fac447 | 2014-02-25 17:01:10 -0800 | [diff] [blame] | 1121 | ptr = TryToAllocate<true, false>(self, allocator, alloc_size, bytes_allocated, usable_size); |
Mathieu Chartier | 866fb2a | 2012-09-10 10:47:49 -0700 | [diff] [blame] | 1122 | } |
Ian Rogers | 00f7d0e | 2012-07-19 15:28:27 -0700 | [diff] [blame] | 1123 | } |
Ian Rogers | 00f7d0e | 2012-07-19 15:28:27 -0700 | [diff] [blame] | 1124 | // Allocations have failed after GCs; this is an exceptional state. |
Mathieu Chartier | cbb2d20 | 2013-11-14 17:45:16 -0800 | [diff] [blame] | 1125 | if (ptr == nullptr) { |
| 1126 | // Try harder, growing the heap if necessary. |
Ian Rogers | 6fac447 | 2014-02-25 17:01:10 -0800 | [diff] [blame] | 1127 | ptr = TryToAllocate<true, true>(self, allocator, alloc_size, bytes_allocated, usable_size); |
Carl Shapiro | 69759ea | 2011-07-21 18:13:35 -0700 | [diff] [blame] | 1128 | } |
Mathieu Chartier | cbb2d20 | 2013-11-14 17:45:16 -0800 | [diff] [blame] | 1129 | if (ptr == nullptr) { |
| 1130 | // Most allocations should have succeeded by now, so the heap is really full, really fragmented, |
| 1131 | // or the requested size is really big. Do another GC, collecting SoftReferences this time. The |
| 1132 | // VM spec requires that all SoftReferences have been collected and cleared before throwing |
| 1133 | // OOME. |
| 1134 | VLOG(gc) << "Forcing collection of SoftReferences for " << PrettySize(alloc_size) |
| 1135 | << " allocation"; |
| 1136 | // TODO: Run finalization, but this may cause more allocations to occur. |
| 1137 | // We don't need a WaitForGcToComplete here either. |
| 1138 | DCHECK(!gc_plan_.empty()); |
| 1139 | CollectGarbageInternal(gc_plan_.back(), kGcCauseForAlloc, true); |
Mathieu Chartier | e6da9af | 2013-12-16 11:54:42 -0800 | [diff] [blame] | 1140 | if (was_default_allocator && allocator != GetCurrentAllocator()) { |
| 1141 | *klass = sirt_klass.get(); |
| 1142 | return nullptr; |
| 1143 | } |
Ian Rogers | 6fac447 | 2014-02-25 17:01:10 -0800 | [diff] [blame] | 1144 | ptr = TryToAllocate<true, true>(self, allocator, alloc_size, bytes_allocated, usable_size); |
Mathieu Chartier | cbb2d20 | 2013-11-14 17:45:16 -0800 | [diff] [blame] | 1145 | if (ptr == nullptr) { |
| 1146 | ThrowOutOfMemoryError(self, alloc_size, false); |
| 1147 | } |
| 1148 | } |
Mathieu Chartier | c528dba | 2013-11-26 12:00:11 -0800 | [diff] [blame] | 1149 | *klass = sirt_klass.get(); |
Mathieu Chartier | cbb2d20 | 2013-11-14 17:45:16 -0800 | [diff] [blame] | 1150 | return ptr; |
Carl Shapiro | 69759ea | 2011-07-21 18:13:35 -0700 | [diff] [blame] | 1151 | } |
| 1152 | |
Mathieu Chartier | 155dfe9 | 2012-10-09 14:24:49 -0700 | [diff] [blame] | 1153 | void Heap::SetTargetHeapUtilization(float target) { |
| 1154 | DCHECK_GT(target, 0.0f); // asserted in Java code |
| 1155 | DCHECK_LT(target, 1.0f); |
| 1156 | target_utilization_ = target; |
| 1157 | } |
| 1158 | |
Ian Rogers | 1d54e73 | 2013-05-02 21:10:01 -0700 | [diff] [blame] | 1159 | size_t Heap::GetObjectsAllocated() const { |
| 1160 | size_t total = 0; |
Mathieu Chartier | 590fee9 | 2013-09-13 13:46:47 -0700 | [diff] [blame] | 1161 | for (space::AllocSpace* space : alloc_spaces_) { |
| 1162 | total += space->GetObjectsAllocated(); |
Ian Rogers | 1d54e73 | 2013-05-02 21:10:01 -0700 | [diff] [blame] | 1163 | } |
Mathieu Chartier | 155dfe9 | 2012-10-09 14:24:49 -0700 | [diff] [blame] | 1164 | return total; |
| 1165 | } |
| 1166 | |
Ian Rogers | 1d54e73 | 2013-05-02 21:10:01 -0700 | [diff] [blame] | 1167 | size_t Heap::GetObjectsAllocatedEver() const { |
Mathieu Chartier | 692fafd | 2013-11-29 17:24:40 -0800 | [diff] [blame] | 1168 | return GetObjectsFreedEver() + GetObjectsAllocated(); |
Ian Rogers | 1d54e73 | 2013-05-02 21:10:01 -0700 | [diff] [blame] | 1169 | } |
| 1170 | |
| 1171 | size_t Heap::GetBytesAllocatedEver() const { |
Mathieu Chartier | 692fafd | 2013-11-29 17:24:40 -0800 | [diff] [blame] | 1172 | return GetBytesFreedEver() + GetBytesAllocated(); |
Mathieu Chartier | 155dfe9 | 2012-10-09 14:24:49 -0700 | [diff] [blame] | 1173 | } |
| 1174 | |
Elliott Hughes | 9d5ccec | 2011-09-19 13:19:50 -0700 | [diff] [blame] | 1175 | class InstanceCounter { |
| 1176 | public: |
Ian Rogers | 2dd0e2c | 2013-01-24 12:42:14 -0800 | [diff] [blame] | 1177 | InstanceCounter(const std::vector<mirror::Class*>& classes, bool use_is_assignable_from, uint64_t* counts) |
Ian Rogers | b726dcb | 2012-09-05 08:57:23 -0700 | [diff] [blame] | 1178 | SHARED_LOCKS_REQUIRED(Locks::mutator_lock_) |
Elliott Hughes | ec0f83d | 2013-01-15 16:54:08 -0800 | [diff] [blame] | 1179 | : classes_(classes), use_is_assignable_from_(use_is_assignable_from), counts_(counts) { |
Elliott Hughes | 9d5ccec | 2011-09-19 13:19:50 -0700 | [diff] [blame] | 1180 | } |
Mathieu Chartier | 412c7fc | 2014-02-07 12:18:39 -0800 | [diff] [blame] | 1181 | static void Callback(mirror::Object* obj, void* arg) |
| 1182 | SHARED_LOCKS_REQUIRED(Locks::mutator_lock_, Locks::heap_bitmap_lock_) { |
| 1183 | InstanceCounter* instance_counter = reinterpret_cast<InstanceCounter*>(arg); |
| 1184 | mirror::Class* instance_class = obj->GetClass(); |
| 1185 | CHECK(instance_class != nullptr); |
| 1186 | for (size_t i = 0; i < instance_counter->classes_.size(); ++i) { |
| 1187 | if (instance_counter->use_is_assignable_from_) { |
| 1188 | if (instance_counter->classes_[i]->IsAssignableFrom(instance_class)) { |
| 1189 | ++instance_counter->counts_[i]; |
Elliott Hughes | ec0f83d | 2013-01-15 16:54:08 -0800 | [diff] [blame] | 1190 | } |
Mathieu Chartier | 412c7fc | 2014-02-07 12:18:39 -0800 | [diff] [blame] | 1191 | } else if (instance_class == instance_counter->classes_[i]) { |
| 1192 | ++instance_counter->counts_[i]; |
Elliott Hughes | 9d5ccec | 2011-09-19 13:19:50 -0700 | [diff] [blame] | 1193 | } |
| 1194 | } |
| 1195 | } |
| 1196 | |
Mathieu Chartier | 7469ebf | 2012-09-24 16:28:36 -0700 | [diff] [blame] | 1197 | private: |
Ian Rogers | 2dd0e2c | 2013-01-24 12:42:14 -0800 | [diff] [blame] | 1198 | const std::vector<mirror::Class*>& classes_; |
Elliott Hughes | ec0f83d | 2013-01-15 16:54:08 -0800 | [diff] [blame] | 1199 | bool use_is_assignable_from_; |
| 1200 | uint64_t* const counts_; |
Elliott Hughes | ec0f83d | 2013-01-15 16:54:08 -0800 | [diff] [blame] | 1201 | DISALLOW_COPY_AND_ASSIGN(InstanceCounter); |
Elliott Hughes | 9d5ccec | 2011-09-19 13:19:50 -0700 | [diff] [blame] | 1202 | }; |
| 1203 | |
Ian Rogers | 2dd0e2c | 2013-01-24 12:42:14 -0800 | [diff] [blame] | 1204 | void Heap::CountInstances(const std::vector<mirror::Class*>& classes, bool use_is_assignable_from, |
Elliott Hughes | ec0f83d | 2013-01-15 16:54:08 -0800 | [diff] [blame] | 1205 | uint64_t* counts) { |
Mathieu Chartier | 412c7fc | 2014-02-07 12:18:39 -0800 | [diff] [blame] | 1206 | // Can't do any GC in this function since this may move classes. |
Elliott Hughes | ec0f83d | 2013-01-15 16:54:08 -0800 | [diff] [blame] | 1207 | Thread* self = Thread::Current(); |
Mathieu Chartier | 412c7fc | 2014-02-07 12:18:39 -0800 | [diff] [blame] | 1208 | auto* old_cause = self->StartAssertNoThreadSuspension("CountInstances"); |
Elliott Hughes | ec0f83d | 2013-01-15 16:54:08 -0800 | [diff] [blame] | 1209 | InstanceCounter counter(classes, use_is_assignable_from, counts); |
Mathieu Chartier | 412c7fc | 2014-02-07 12:18:39 -0800 | [diff] [blame] | 1210 | WriterMutexLock mu(self, *Locks::heap_bitmap_lock_); |
| 1211 | VisitObjects(InstanceCounter::Callback, &counter); |
| 1212 | self->EndAssertNoThreadSuspension(old_cause); |
Elliott Hughes | 9d5ccec | 2011-09-19 13:19:50 -0700 | [diff] [blame] | 1213 | } |
| 1214 | |
Elliott Hughes | 3b78c94 | 2013-01-15 17:35:41 -0800 | [diff] [blame] | 1215 | class InstanceCollector { |
| 1216 | public: |
Ian Rogers | 2dd0e2c | 2013-01-24 12:42:14 -0800 | [diff] [blame] | 1217 | InstanceCollector(mirror::Class* c, int32_t max_count, std::vector<mirror::Object*>& instances) |
Elliott Hughes | 3b78c94 | 2013-01-15 17:35:41 -0800 | [diff] [blame] | 1218 | SHARED_LOCKS_REQUIRED(Locks::mutator_lock_) |
| 1219 | : class_(c), max_count_(max_count), instances_(instances) { |
| 1220 | } |
Mathieu Chartier | 412c7fc | 2014-02-07 12:18:39 -0800 | [diff] [blame] | 1221 | static void Callback(mirror::Object* obj, void* arg) |
| 1222 | SHARED_LOCKS_REQUIRED(Locks::mutator_lock_, Locks::heap_bitmap_lock_) { |
| 1223 | DCHECK(arg != nullptr); |
| 1224 | InstanceCollector* instance_collector = reinterpret_cast<InstanceCollector*>(arg); |
| 1225 | mirror::Class* instance_class = obj->GetClass(); |
| 1226 | if (instance_class == instance_collector->class_) { |
| 1227 | if (instance_collector->max_count_ == 0 || |
| 1228 | instance_collector->instances_.size() < instance_collector->max_count_) { |
| 1229 | instance_collector->instances_.push_back(obj); |
Elliott Hughes | 3b78c94 | 2013-01-15 17:35:41 -0800 | [diff] [blame] | 1230 | } |
| 1231 | } |
| 1232 | } |
| 1233 | |
| 1234 | private: |
Ian Rogers | 2dd0e2c | 2013-01-24 12:42:14 -0800 | [diff] [blame] | 1235 | mirror::Class* class_; |
Elliott Hughes | 3b78c94 | 2013-01-15 17:35:41 -0800 | [diff] [blame] | 1236 | uint32_t max_count_; |
Ian Rogers | 2dd0e2c | 2013-01-24 12:42:14 -0800 | [diff] [blame] | 1237 | std::vector<mirror::Object*>& instances_; |
Elliott Hughes | 3b78c94 | 2013-01-15 17:35:41 -0800 | [diff] [blame] | 1238 | DISALLOW_COPY_AND_ASSIGN(InstanceCollector); |
| 1239 | }; |
| 1240 | |
Ian Rogers | 2dd0e2c | 2013-01-24 12:42:14 -0800 | [diff] [blame] | 1241 | void Heap::GetInstances(mirror::Class* c, int32_t max_count, |
| 1242 | std::vector<mirror::Object*>& instances) { |
Mathieu Chartier | 412c7fc | 2014-02-07 12:18:39 -0800 | [diff] [blame] | 1243 | // Can't do any GC in this function since this may move classes. |
Elliott Hughes | 3b78c94 | 2013-01-15 17:35:41 -0800 | [diff] [blame] | 1244 | Thread* self = Thread::Current(); |
Mathieu Chartier | 412c7fc | 2014-02-07 12:18:39 -0800 | [diff] [blame] | 1245 | auto* old_cause = self->StartAssertNoThreadSuspension("GetInstances"); |
Elliott Hughes | 3b78c94 | 2013-01-15 17:35:41 -0800 | [diff] [blame] | 1246 | InstanceCollector collector(c, max_count, instances); |
Mathieu Chartier | 412c7fc | 2014-02-07 12:18:39 -0800 | [diff] [blame] | 1247 | WriterMutexLock mu(self, *Locks::heap_bitmap_lock_); |
| 1248 | VisitObjects(&InstanceCollector::Callback, &collector); |
| 1249 | self->EndAssertNoThreadSuspension(old_cause); |
Elliott Hughes | 3b78c94 | 2013-01-15 17:35:41 -0800 | [diff] [blame] | 1250 | } |
| 1251 | |
Elliott Hughes | 0cbaff5 | 2013-01-16 15:28:01 -0800 | [diff] [blame] | 1252 | class ReferringObjectsFinder { |
| 1253 | public: |
Ian Rogers | 2dd0e2c | 2013-01-24 12:42:14 -0800 | [diff] [blame] | 1254 | ReferringObjectsFinder(mirror::Object* object, int32_t max_count, |
| 1255 | std::vector<mirror::Object*>& referring_objects) |
Elliott Hughes | 0cbaff5 | 2013-01-16 15:28:01 -0800 | [diff] [blame] | 1256 | SHARED_LOCKS_REQUIRED(Locks::mutator_lock_) |
| 1257 | : object_(object), max_count_(max_count), referring_objects_(referring_objects) { |
| 1258 | } |
| 1259 | |
Mathieu Chartier | 412c7fc | 2014-02-07 12:18:39 -0800 | [diff] [blame] | 1260 | static void Callback(mirror::Object* obj, void* arg) |
| 1261 | SHARED_LOCKS_REQUIRED(Locks::mutator_lock_, Locks::heap_bitmap_lock_) { |
| 1262 | reinterpret_cast<ReferringObjectsFinder*>(arg)->operator()(obj); |
| 1263 | } |
| 1264 | |
Elliott Hughes | 0cbaff5 | 2013-01-16 15:28:01 -0800 | [diff] [blame] | 1265 | // For bitmap Visit. |
| 1266 | // TODO: Fix lock analysis to not use NO_THREAD_SAFETY_ANALYSIS, requires support for |
| 1267 | // annotalysis on visitors. |
Mathieu Chartier | 0e54cd0 | 2014-03-20 12:41:23 -0700 | [diff] [blame] | 1268 | void operator()(mirror::Object* o) const NO_THREAD_SAFETY_ANALYSIS { |
Ian Rogers | b0fa5dc | 2014-04-28 16:47:08 -0700 | [diff] [blame] | 1269 | o->VisitReferences<true>(*this, VoidFunctor()); |
Elliott Hughes | 0cbaff5 | 2013-01-16 15:28:01 -0800 | [diff] [blame] | 1270 | } |
| 1271 | |
Mathieu Chartier | 3b05e9b | 2014-03-25 09:29:43 -0700 | [diff] [blame] | 1272 | // For Object::VisitReferences. |
Mathieu Chartier | 407f702 | 2014-02-18 14:37:05 -0800 | [diff] [blame] | 1273 | void operator()(mirror::Object* obj, MemberOffset offset, bool /* is_static */) const |
| 1274 | SHARED_LOCKS_REQUIRED(Locks::mutator_lock_) { |
Ian Rogers | b0fa5dc | 2014-04-28 16:47:08 -0700 | [diff] [blame] | 1275 | mirror::Object* ref = obj->GetFieldObject<mirror::Object>(offset); |
Mathieu Chartier | 407f702 | 2014-02-18 14:37:05 -0800 | [diff] [blame] | 1276 | if (ref == object_ && (max_count_ == 0 || referring_objects_.size() < max_count_)) { |
| 1277 | referring_objects_.push_back(obj); |
Elliott Hughes | 0cbaff5 | 2013-01-16 15:28:01 -0800 | [diff] [blame] | 1278 | } |
| 1279 | } |
| 1280 | |
| 1281 | private: |
Ian Rogers | 2dd0e2c | 2013-01-24 12:42:14 -0800 | [diff] [blame] | 1282 | mirror::Object* object_; |
Elliott Hughes | 0cbaff5 | 2013-01-16 15:28:01 -0800 | [diff] [blame] | 1283 | uint32_t max_count_; |
Ian Rogers | 2dd0e2c | 2013-01-24 12:42:14 -0800 | [diff] [blame] | 1284 | std::vector<mirror::Object*>& referring_objects_; |
Elliott Hughes | 0cbaff5 | 2013-01-16 15:28:01 -0800 | [diff] [blame] | 1285 | DISALLOW_COPY_AND_ASSIGN(ReferringObjectsFinder); |
| 1286 | }; |
| 1287 | |
Ian Rogers | 2dd0e2c | 2013-01-24 12:42:14 -0800 | [diff] [blame] | 1288 | void Heap::GetReferringObjects(mirror::Object* o, int32_t max_count, |
| 1289 | std::vector<mirror::Object*>& referring_objects) { |
Mathieu Chartier | 83c8ee0 | 2014-01-28 14:50:23 -0800 | [diff] [blame] | 1290 | // Can't do any GC in this function since this may move the object o. |
Elliott Hughes | 0cbaff5 | 2013-01-16 15:28:01 -0800 | [diff] [blame] | 1291 | Thread* self = Thread::Current(); |
Mathieu Chartier | 412c7fc | 2014-02-07 12:18:39 -0800 | [diff] [blame] | 1292 | auto* old_cause = self->StartAssertNoThreadSuspension("GetReferringObjects"); |
Elliott Hughes | 0cbaff5 | 2013-01-16 15:28:01 -0800 | [diff] [blame] | 1293 | ReferringObjectsFinder finder(o, max_count, referring_objects); |
Mathieu Chartier | 412c7fc | 2014-02-07 12:18:39 -0800 | [diff] [blame] | 1294 | WriterMutexLock mu(self, *Locks::heap_bitmap_lock_); |
| 1295 | VisitObjects(&ReferringObjectsFinder::Callback, &finder); |
| 1296 | self->EndAssertNoThreadSuspension(old_cause); |
Elliott Hughes | 0cbaff5 | 2013-01-16 15:28:01 -0800 | [diff] [blame] | 1297 | } |
| 1298 | |
Ian Rogers | 30fab40 | 2012-01-23 15:43:46 -0800 | [diff] [blame] | 1299 | void Heap::CollectGarbage(bool clear_soft_references) { |
Mathieu Chartier | 866fb2a | 2012-09-10 10:47:49 -0700 | [diff] [blame] | 1300 | // Even if we waited for a GC we still need to do another GC since weaks allocated during the |
| 1301 | // last GC will not have necessarily been cleared. |
Mathieu Chartier | 7bf82af | 2013-12-06 16:51:45 -0800 | [diff] [blame] | 1302 | CollectGarbageInternal(gc_plan_.back(), kGcCauseExplicit, clear_soft_references); |
Carl Shapiro | 69759ea | 2011-07-21 18:13:35 -0700 | [diff] [blame] | 1303 | } |
| 1304 | |
Mathieu Chartier | e6da9af | 2013-12-16 11:54:42 -0800 | [diff] [blame] | 1305 | void Heap::TransitionCollector(CollectorType collector_type) { |
| 1306 | if (collector_type == collector_type_) { |
| 1307 | return; |
| 1308 | } |
Hiroshi Yamauchi | a4adbfd | 2014-02-04 18:12:17 -0800 | [diff] [blame] | 1309 | VLOG(heap) << "TransitionCollector: " << static_cast<int>(collector_type_) |
| 1310 | << " -> " << static_cast<int>(collector_type); |
Mathieu Chartier | e6da9af | 2013-12-16 11:54:42 -0800 | [diff] [blame] | 1311 | uint64_t start_time = NanoTime(); |
Ian Rogers | ef7d42f | 2014-01-06 12:55:46 -0800 | [diff] [blame] | 1312 | uint32_t before_allocated = num_bytes_allocated_.Load(); |
Mathieu Chartier | e6da9af | 2013-12-16 11:54:42 -0800 | [diff] [blame] | 1313 | ThreadList* tl = Runtime::Current()->GetThreadList(); |
| 1314 | Thread* self = Thread::Current(); |
| 1315 | ScopedThreadStateChange tsc(self, kWaitingPerformingGc); |
| 1316 | Locks::mutator_lock_->AssertNotHeld(self); |
Mathieu Chartier | d5a89ee | 2014-01-31 09:55:13 -0800 | [diff] [blame] | 1317 | const bool copying_transition = |
Mathieu Chartier | 31f4414 | 2014-04-08 14:40:03 -0700 | [diff] [blame] | 1318 | IsMovingGc(background_collector_type_) || IsMovingGc(foreground_collector_type_); |
Mathieu Chartier | 1d27b34 | 2014-01-28 12:51:09 -0800 | [diff] [blame] | 1319 | // Busy wait until we can GC (StartGC can fail if we have a non-zero |
| 1320 | // compacting_gc_disable_count_, this should rarely occurs). |
Mathieu Chartier | d5a89ee | 2014-01-31 09:55:13 -0800 | [diff] [blame] | 1321 | for (;;) { |
Mathieu Chartier | caa82d6 | 2014-02-02 16:51:17 -0800 | [diff] [blame] | 1322 | { |
| 1323 | ScopedThreadStateChange tsc(self, kWaitingForGcToComplete); |
| 1324 | MutexLock mu(self, *gc_complete_lock_); |
| 1325 | // Ensure there is only one GC at a time. |
Mathieu Chartier | 89a201e | 2014-05-02 10:27:26 -0700 | [diff] [blame] | 1326 | WaitForGcToCompleteLocked(kGcCauseCollectorTransition, self); |
Mathieu Chartier | b38d483 | 2014-04-10 10:56:55 -0700 | [diff] [blame] | 1327 | // If someone else beat us to it and changed the collector before we could, exit. |
| 1328 | // This is safe to do before the suspend all since we set the collector_type_running_ before |
| 1329 | // we exit the loop. If another thread attempts to do the heap transition before we exit, |
| 1330 | // then it would get blocked on WaitForGcToCompleteLocked. |
| 1331 | if (collector_type == collector_type_) { |
| 1332 | return; |
| 1333 | } |
Mathieu Chartier | 3c4a434 | 2014-04-23 14:41:11 -0700 | [diff] [blame] | 1334 | if (Runtime::Current()->IsShuttingDown(self)) { |
| 1335 | // Don't allow heap transitions to happen if the runtime is shutting down since these can |
| 1336 | // cause objects to get finalized. |
| 1337 | return; |
| 1338 | } |
Mathieu Chartier | caa82d6 | 2014-02-02 16:51:17 -0800 | [diff] [blame] | 1339 | // GC can be disabled if someone has a used GetPrimitiveArrayCritical but not yet released. |
| 1340 | if (!copying_transition || disable_moving_gc_count_ == 0) { |
| 1341 | // TODO: Not hard code in semi-space collector? |
| 1342 | collector_type_running_ = copying_transition ? kCollectorTypeSS : collector_type; |
| 1343 | break; |
| 1344 | } |
Mathieu Chartier | d5a89ee | 2014-01-31 09:55:13 -0800 | [diff] [blame] | 1345 | } |
Mathieu Chartier | caa82d6 | 2014-02-02 16:51:17 -0800 | [diff] [blame] | 1346 | usleep(1000); |
Mathieu Chartier | e6da9af | 2013-12-16 11:54:42 -0800 | [diff] [blame] | 1347 | } |
| 1348 | tl->SuspendAll(); |
| 1349 | switch (collector_type) { |
Hiroshi Yamauchi | 6f4ffe4 | 2014-01-13 12:30:44 -0800 | [diff] [blame] | 1350 | case kCollectorTypeSS: |
Mathieu Chartier | 1d27b34 | 2014-01-28 12:51:09 -0800 | [diff] [blame] | 1351 | // Fall-through. |
Hiroshi Yamauchi | 6f4ffe4 | 2014-01-13 12:30:44 -0800 | [diff] [blame] | 1352 | case kCollectorTypeGSS: { |
Mathieu Chartier | 31f4414 | 2014-04-08 14:40:03 -0700 | [diff] [blame] | 1353 | if (!IsMovingGc(collector_type_)) { |
| 1354 | // We are transitioning from non moving GC -> moving GC, since we copied from the bump |
| 1355 | // pointer space last transition it will be protected. |
| 1356 | bump_pointer_space_->GetMemMap()->Protect(PROT_READ | PROT_WRITE); |
| 1357 | Compact(bump_pointer_space_, main_space_); |
Mathieu Chartier | 73d1e17 | 2014-04-11 17:53:48 -0700 | [diff] [blame] | 1358 | // Remove the main space so that we don't try to trim it, this doens't work for debug |
| 1359 | // builds since RosAlloc attempts to read the magic number from a protected page. |
| 1360 | // TODO: Clean this up by getting rid of the remove_as_default parameter. |
Mathieu Chartier | 1b54f9c | 2014-04-30 16:45:02 -0700 | [diff] [blame] | 1361 | RemoveSpace(main_space_); |
Mathieu Chartier | 31f4414 | 2014-04-08 14:40:03 -0700 | [diff] [blame] | 1362 | } |
Mathieu Chartier | e6da9af | 2013-12-16 11:54:42 -0800 | [diff] [blame] | 1363 | break; |
| 1364 | } |
| 1365 | case kCollectorTypeMS: |
| 1366 | // Fall through. |
| 1367 | case kCollectorTypeCMS: { |
Mathieu Chartier | 31f4414 | 2014-04-08 14:40:03 -0700 | [diff] [blame] | 1368 | if (IsMovingGc(collector_type_)) { |
| 1369 | // Compact to the main space from the bump pointer space, don't need to swap semispaces. |
Mathieu Chartier | 1b54f9c | 2014-04-30 16:45:02 -0700 | [diff] [blame] | 1370 | AddSpace(main_space_); |
Mathieu Chartier | 31f4414 | 2014-04-08 14:40:03 -0700 | [diff] [blame] | 1371 | main_space_->GetMemMap()->Protect(PROT_READ | PROT_WRITE); |
Mathieu Chartier | fc5b528 | 2014-01-09 16:15:36 -0800 | [diff] [blame] | 1372 | Compact(main_space_, bump_pointer_space_); |
Mathieu Chartier | e6da9af | 2013-12-16 11:54:42 -0800 | [diff] [blame] | 1373 | } |
| 1374 | break; |
| 1375 | } |
| 1376 | default: { |
Hiroshi Yamauchi | d5307ec | 2014-03-27 21:07:51 -0700 | [diff] [blame] | 1377 | LOG(FATAL) << "Attempted to transition to invalid collector type " |
| 1378 | << static_cast<size_t>(collector_type); |
Mathieu Chartier | e6da9af | 2013-12-16 11:54:42 -0800 | [diff] [blame] | 1379 | break; |
| 1380 | } |
| 1381 | } |
| 1382 | ChangeCollector(collector_type); |
| 1383 | tl->ResumeAll(); |
| 1384 | // Can't call into java code with all threads suspended. |
Mathieu Chartier | 78f7b4c | 2014-05-06 10:57:27 -0700 | [diff] [blame] | 1385 | reference_processor_.EnqueueClearedReferences(); |
Mathieu Chartier | e6da9af | 2013-12-16 11:54:42 -0800 | [diff] [blame] | 1386 | uint64_t duration = NanoTime() - start_time; |
Mathieu Chartier | afe4998 | 2014-03-27 10:55:04 -0700 | [diff] [blame] | 1387 | GrowForUtilization(semi_space_collector_); |
Mathieu Chartier | e6da9af | 2013-12-16 11:54:42 -0800 | [diff] [blame] | 1388 | FinishGC(self, collector::kGcTypeFull); |
Mathieu Chartier | e6da9af | 2013-12-16 11:54:42 -0800 | [diff] [blame] | 1389 | int32_t after_allocated = num_bytes_allocated_.Load(); |
| 1390 | int32_t delta_allocated = before_allocated - after_allocated; |
Mathieu Chartier | e6da9af | 2013-12-16 11:54:42 -0800 | [diff] [blame] | 1391 | LOG(INFO) << "Heap transition to " << process_state_ << " took " |
Mathieu Chartier | dcee9ee | 2014-04-15 12:40:17 -0700 | [diff] [blame] | 1392 | << PrettyDuration(duration) << " saved at least " << PrettySize(delta_allocated); |
Mathieu Chartier | e6da9af | 2013-12-16 11:54:42 -0800 | [diff] [blame] | 1393 | } |
| 1394 | |
Mathieu Chartier | 0de9f73 | 2013-11-22 17:58:48 -0800 | [diff] [blame] | 1395 | void Heap::ChangeCollector(CollectorType collector_type) { |
Mathieu Chartier | 7bf82af | 2013-12-06 16:51:45 -0800 | [diff] [blame] | 1396 | // TODO: Only do this with all mutators suspended to avoid races. |
| 1397 | if (collector_type != collector_type_) { |
| 1398 | collector_type_ = collector_type; |
| 1399 | gc_plan_.clear(); |
| 1400 | switch (collector_type_) { |
Hiroshi Yamauchi | d5307ec | 2014-03-27 21:07:51 -0700 | [diff] [blame] | 1401 | case kCollectorTypeCC: // Fall-through. |
Hiroshi Yamauchi | 3e41780 | 2014-03-20 12:03:02 -0700 | [diff] [blame] | 1402 | case kCollectorTypeSS: // Fall-through. |
Hiroshi Yamauchi | 6f4ffe4 | 2014-01-13 12:30:44 -0800 | [diff] [blame] | 1403 | case kCollectorTypeGSS: { |
Mathieu Chartier | 7bf82af | 2013-12-06 16:51:45 -0800 | [diff] [blame] | 1404 | gc_plan_.push_back(collector::kGcTypeFull); |
Mathieu Chartier | 692fafd | 2013-11-29 17:24:40 -0800 | [diff] [blame] | 1405 | if (use_tlab_) { |
| 1406 | ChangeAllocator(kAllocatorTypeTLAB); |
| 1407 | } else { |
| 1408 | ChangeAllocator(kAllocatorTypeBumpPointer); |
| 1409 | } |
Mathieu Chartier | 7bf82af | 2013-12-06 16:51:45 -0800 | [diff] [blame] | 1410 | break; |
| 1411 | } |
| 1412 | case kCollectorTypeMS: { |
Mathieu Chartier | 7bf82af | 2013-12-06 16:51:45 -0800 | [diff] [blame] | 1413 | gc_plan_.push_back(collector::kGcTypeSticky); |
| 1414 | gc_plan_.push_back(collector::kGcTypePartial); |
| 1415 | gc_plan_.push_back(collector::kGcTypeFull); |
Mathieu Chartier | e6da9af | 2013-12-16 11:54:42 -0800 | [diff] [blame] | 1416 | ChangeAllocator(kUseRosAlloc ? kAllocatorTypeRosAlloc : kAllocatorTypeDlMalloc); |
Mathieu Chartier | 7bf82af | 2013-12-06 16:51:45 -0800 | [diff] [blame] | 1417 | break; |
| 1418 | } |
| 1419 | case kCollectorTypeCMS: { |
Mathieu Chartier | 7bf82af | 2013-12-06 16:51:45 -0800 | [diff] [blame] | 1420 | gc_plan_.push_back(collector::kGcTypeSticky); |
| 1421 | gc_plan_.push_back(collector::kGcTypePartial); |
| 1422 | gc_plan_.push_back(collector::kGcTypeFull); |
Mathieu Chartier | e6da9af | 2013-12-16 11:54:42 -0800 | [diff] [blame] | 1423 | ChangeAllocator(kUseRosAlloc ? kAllocatorTypeRosAlloc : kAllocatorTypeDlMalloc); |
Mathieu Chartier | 7bf82af | 2013-12-06 16:51:45 -0800 | [diff] [blame] | 1424 | break; |
| 1425 | } |
| 1426 | default: { |
| 1427 | LOG(FATAL) << "Unimplemented"; |
| 1428 | } |
Mathieu Chartier | 0de9f73 | 2013-11-22 17:58:48 -0800 | [diff] [blame] | 1429 | } |
Hiroshi Yamauchi | 3e41780 | 2014-03-20 12:03:02 -0700 | [diff] [blame] | 1430 | if (IsGcConcurrent()) { |
Mathieu Chartier | 7bf82af | 2013-12-06 16:51:45 -0800 | [diff] [blame] | 1431 | concurrent_start_bytes_ = |
| 1432 | std::max(max_allowed_footprint_, kMinConcurrentRemainingBytes) - kMinConcurrentRemainingBytes; |
| 1433 | } else { |
| 1434 | concurrent_start_bytes_ = std::numeric_limits<size_t>::max(); |
Mathieu Chartier | 0de9f73 | 2013-11-22 17:58:48 -0800 | [diff] [blame] | 1435 | } |
| 1436 | } |
| 1437 | } |
| 1438 | |
Mathieu Chartier | 85a43c0 | 2014-01-07 17:59:00 -0800 | [diff] [blame] | 1439 | // Special compacting collector which uses sub-optimal bin packing to reduce zygote space size. |
Ian Rogers | 6fac447 | 2014-02-25 17:01:10 -0800 | [diff] [blame] | 1440 | class ZygoteCompactingCollector FINAL : public collector::SemiSpace { |
Mathieu Chartier | 85a43c0 | 2014-01-07 17:59:00 -0800 | [diff] [blame] | 1441 | public: |
Hiroshi Yamauchi | 38e68e9 | 2014-03-07 13:59:08 -0800 | [diff] [blame] | 1442 | explicit ZygoteCompactingCollector(gc::Heap* heap) : SemiSpace(heap, false, "zygote collector"), |
Ian Rogers | 6fac447 | 2014-02-25 17:01:10 -0800 | [diff] [blame] | 1443 | bin_live_bitmap_(nullptr), bin_mark_bitmap_(nullptr) { |
Mathieu Chartier | 85a43c0 | 2014-01-07 17:59:00 -0800 | [diff] [blame] | 1444 | } |
| 1445 | |
| 1446 | void BuildBins(space::ContinuousSpace* space) { |
| 1447 | bin_live_bitmap_ = space->GetLiveBitmap(); |
| 1448 | bin_mark_bitmap_ = space->GetMarkBitmap(); |
| 1449 | BinContext context; |
| 1450 | context.prev_ = reinterpret_cast<uintptr_t>(space->Begin()); |
| 1451 | context.collector_ = this; |
| 1452 | WriterMutexLock mu(Thread::Current(), *Locks::heap_bitmap_lock_); |
| 1453 | // Note: This requires traversing the space in increasing order of object addresses. |
| 1454 | bin_live_bitmap_->Walk(Callback, reinterpret_cast<void*>(&context)); |
| 1455 | // Add the last bin which spans after the last object to the end of the space. |
| 1456 | AddBin(reinterpret_cast<uintptr_t>(space->End()) - context.prev_, context.prev_); |
| 1457 | } |
| 1458 | |
| 1459 | private: |
| 1460 | struct BinContext { |
| 1461 | uintptr_t prev_; // The end of the previous object. |
| 1462 | ZygoteCompactingCollector* collector_; |
| 1463 | }; |
| 1464 | // Maps from bin sizes to locations. |
| 1465 | std::multimap<size_t, uintptr_t> bins_; |
| 1466 | // Live bitmap of the space which contains the bins. |
Mathieu Chartier | a8e8f9c | 2014-04-09 14:51:05 -0700 | [diff] [blame] | 1467 | accounting::ContinuousSpaceBitmap* bin_live_bitmap_; |
Mathieu Chartier | 85a43c0 | 2014-01-07 17:59:00 -0800 | [diff] [blame] | 1468 | // Mark bitmap of the space which contains the bins. |
Mathieu Chartier | a8e8f9c | 2014-04-09 14:51:05 -0700 | [diff] [blame] | 1469 | accounting::ContinuousSpaceBitmap* bin_mark_bitmap_; |
Mathieu Chartier | 85a43c0 | 2014-01-07 17:59:00 -0800 | [diff] [blame] | 1470 | |
| 1471 | static void Callback(mirror::Object* obj, void* arg) |
| 1472 | SHARED_LOCKS_REQUIRED(Locks::mutator_lock_) { |
| 1473 | DCHECK(arg != nullptr); |
| 1474 | BinContext* context = reinterpret_cast<BinContext*>(arg); |
| 1475 | ZygoteCompactingCollector* collector = context->collector_; |
| 1476 | uintptr_t object_addr = reinterpret_cast<uintptr_t>(obj); |
| 1477 | size_t bin_size = object_addr - context->prev_; |
| 1478 | // Add the bin consisting of the end of the previous object to the start of the current object. |
| 1479 | collector->AddBin(bin_size, context->prev_); |
| 1480 | context->prev_ = object_addr + RoundUp(obj->SizeOf(), kObjectAlignment); |
| 1481 | } |
| 1482 | |
| 1483 | void AddBin(size_t size, uintptr_t position) { |
| 1484 | if (size != 0) { |
| 1485 | bins_.insert(std::make_pair(size, position)); |
| 1486 | } |
| 1487 | } |
| 1488 | |
Mathieu Chartier | a1602f2 | 2014-01-13 17:19:19 -0800 | [diff] [blame] | 1489 | virtual bool ShouldSweepSpace(space::ContinuousSpace* space) const { |
Mathieu Chartier | 85a43c0 | 2014-01-07 17:59:00 -0800 | [diff] [blame] | 1490 | // Don't sweep any spaces since we probably blasted the internal accounting of the free list |
| 1491 | // allocator. |
| 1492 | return false; |
| 1493 | } |
| 1494 | |
| 1495 | virtual mirror::Object* MarkNonForwardedObject(mirror::Object* obj) |
| 1496 | EXCLUSIVE_LOCKS_REQUIRED(Locks::heap_bitmap_lock_, Locks::mutator_lock_) { |
| 1497 | size_t object_size = RoundUp(obj->SizeOf(), kObjectAlignment); |
Mathieu Chartier | 5dc08a6 | 2014-01-10 10:10:23 -0800 | [diff] [blame] | 1498 | mirror::Object* forward_address; |
Mathieu Chartier | 85a43c0 | 2014-01-07 17:59:00 -0800 | [diff] [blame] | 1499 | // Find the smallest bin which we can move obj in. |
| 1500 | auto it = bins_.lower_bound(object_size); |
| 1501 | if (it == bins_.end()) { |
| 1502 | // No available space in the bins, place it in the target space instead (grows the zygote |
| 1503 | // space). |
Mathieu Chartier | 5dc08a6 | 2014-01-10 10:10:23 -0800 | [diff] [blame] | 1504 | size_t bytes_allocated; |
Ian Rogers | 6fac447 | 2014-02-25 17:01:10 -0800 | [diff] [blame] | 1505 | forward_address = to_space_->Alloc(self_, object_size, &bytes_allocated, nullptr); |
Mathieu Chartier | 85a43c0 | 2014-01-07 17:59:00 -0800 | [diff] [blame] | 1506 | if (to_space_live_bitmap_ != nullptr) { |
| 1507 | to_space_live_bitmap_->Set(forward_address); |
Mathieu Chartier | 938a03b | 2014-01-16 15:10:31 -0800 | [diff] [blame] | 1508 | } else { |
| 1509 | GetHeap()->GetNonMovingSpace()->GetLiveBitmap()->Set(forward_address); |
| 1510 | GetHeap()->GetNonMovingSpace()->GetMarkBitmap()->Set(forward_address); |
Mathieu Chartier | 85a43c0 | 2014-01-07 17:59:00 -0800 | [diff] [blame] | 1511 | } |
| 1512 | } else { |
| 1513 | size_t size = it->first; |
| 1514 | uintptr_t pos = it->second; |
| 1515 | bins_.erase(it); // Erase the old bin which we replace with the new smaller bin. |
| 1516 | forward_address = reinterpret_cast<mirror::Object*>(pos); |
| 1517 | // Set the live and mark bits so that sweeping system weaks works properly. |
| 1518 | bin_live_bitmap_->Set(forward_address); |
| 1519 | bin_mark_bitmap_->Set(forward_address); |
| 1520 | DCHECK_GE(size, object_size); |
| 1521 | AddBin(size - object_size, pos + object_size); // Add a new bin with the remaining space. |
| 1522 | } |
| 1523 | // Copy the object over to its new location. |
| 1524 | memcpy(reinterpret_cast<void*>(forward_address), obj, object_size); |
Hiroshi Yamauchi | 624468c | 2014-03-31 15:14:47 -0700 | [diff] [blame] | 1525 | if (kUseBakerOrBrooksReadBarrier) { |
| 1526 | obj->AssertReadBarrierPointer(); |
| 1527 | if (kUseBrooksReadBarrier) { |
| 1528 | DCHECK_EQ(forward_address->GetReadBarrierPointer(), obj); |
| 1529 | forward_address->SetReadBarrierPointer(forward_address); |
| 1530 | } |
| 1531 | forward_address->AssertReadBarrierPointer(); |
Hiroshi Yamauchi | 9d04a20 | 2014-01-31 13:35:49 -0800 | [diff] [blame] | 1532 | } |
Mathieu Chartier | 85a43c0 | 2014-01-07 17:59:00 -0800 | [diff] [blame] | 1533 | return forward_address; |
| 1534 | } |
| 1535 | }; |
| 1536 | |
Mathieu Chartier | a1602f2 | 2014-01-13 17:19:19 -0800 | [diff] [blame] | 1537 | void Heap::UnBindBitmaps() { |
| 1538 | for (const auto& space : GetContinuousSpaces()) { |
| 1539 | if (space->IsContinuousMemMapAllocSpace()) { |
| 1540 | space::ContinuousMemMapAllocSpace* alloc_space = space->AsContinuousMemMapAllocSpace(); |
| 1541 | if (alloc_space->HasBoundBitmaps()) { |
| 1542 | alloc_space->UnBindBitmaps(); |
| 1543 | } |
| 1544 | } |
| 1545 | } |
| 1546 | } |
| 1547 | |
Mathieu Chartier | cc236d7 | 2012-07-20 10:29:05 -0700 | [diff] [blame] | 1548 | void Heap::PreZygoteFork() { |
Mathieu Chartier | 1f3b535 | 2014-02-03 14:00:42 -0800 | [diff] [blame] | 1549 | CollectGarbageInternal(collector::kGcTypeFull, kGcCauseBackground, false); |
Ian Rogers | 00f7d0e | 2012-07-19 15:28:27 -0700 | [diff] [blame] | 1550 | static Mutex zygote_creation_lock_("zygote creation lock", kZygoteCreationLock); |
Ian Rogers | 81d425b | 2012-09-27 16:03:43 -0700 | [diff] [blame] | 1551 | Thread* self = Thread::Current(); |
| 1552 | MutexLock mu(self, zygote_creation_lock_); |
Mathieu Chartier | cc236d7 | 2012-07-20 10:29:05 -0700 | [diff] [blame] | 1553 | // Try to see if we have any Zygote spaces. |
| 1554 | if (have_zygote_space_) { |
| 1555 | return; |
| 1556 | } |
Mathieu Chartier | 590fee9 | 2013-09-13 13:46:47 -0700 | [diff] [blame] | 1557 | VLOG(heap) << "Starting PreZygoteFork"; |
Mathieu Chartier | 590fee9 | 2013-09-13 13:46:47 -0700 | [diff] [blame] | 1558 | // Trim the pages at the end of the non moving space. |
| 1559 | non_moving_space_->Trim(); |
Mathieu Chartier | 31f4414 | 2014-04-08 14:40:03 -0700 | [diff] [blame] | 1560 | // The end of the non-moving space may be protected, unprotect it so that we can copy the zygote |
| 1561 | // there. |
Mathieu Chartier | 590fee9 | 2013-09-13 13:46:47 -0700 | [diff] [blame] | 1562 | non_moving_space_->GetMemMap()->Protect(PROT_READ | PROT_WRITE); |
Mathieu Chartier | 7bf82af | 2013-12-06 16:51:45 -0800 | [diff] [blame] | 1563 | // Change the collector to the post zygote one. |
Mathieu Chartier | 31f4414 | 2014-04-08 14:40:03 -0700 | [diff] [blame] | 1564 | if (kCompactZygote) { |
| 1565 | DCHECK(semi_space_collector_ != nullptr); |
Hiroshi Yamauchi | a4adbfd | 2014-02-04 18:12:17 -0800 | [diff] [blame] | 1566 | // Temporarily disable rosalloc verification because the zygote |
| 1567 | // compaction will mess up the rosalloc internal metadata. |
| 1568 | ScopedDisableRosAllocVerification disable_rosalloc_verif(this); |
Mathieu Chartier | 85a43c0 | 2014-01-07 17:59:00 -0800 | [diff] [blame] | 1569 | ZygoteCompactingCollector zygote_collector(this); |
| 1570 | zygote_collector.BuildBins(non_moving_space_); |
Mathieu Chartier | 5048223 | 2013-11-21 11:48:14 -0800 | [diff] [blame] | 1571 | // Create a new bump pointer space which we will compact into. |
Mathieu Chartier | 590fee9 | 2013-09-13 13:46:47 -0700 | [diff] [blame] | 1572 | space::BumpPointerSpace target_space("zygote bump space", non_moving_space_->End(), |
| 1573 | non_moving_space_->Limit()); |
| 1574 | // Compact the bump pointer space to a new zygote bump pointer space. |
Mathieu Chartier | 31f4414 | 2014-04-08 14:40:03 -0700 | [diff] [blame] | 1575 | bool reset_main_space = false; |
| 1576 | if (IsMovingGc(collector_type_)) { |
| 1577 | zygote_collector.SetFromSpace(bump_pointer_space_); |
| 1578 | } else { |
| 1579 | CHECK(main_space_ != nullptr); |
| 1580 | // Copy from the main space. |
| 1581 | zygote_collector.SetFromSpace(main_space_); |
| 1582 | reset_main_space = true; |
| 1583 | } |
Mathieu Chartier | 85a43c0 | 2014-01-07 17:59:00 -0800 | [diff] [blame] | 1584 | zygote_collector.SetToSpace(&target_space); |
Mathieu Chartier | 1b54f9c | 2014-04-30 16:45:02 -0700 | [diff] [blame] | 1585 | zygote_collector.SetSwapSemiSpaces(false); |
Hiroshi Yamauchi | 6f4ffe4 | 2014-01-13 12:30:44 -0800 | [diff] [blame] | 1586 | zygote_collector.Run(kGcCauseCollectorTransition, false); |
Mathieu Chartier | 31f4414 | 2014-04-08 14:40:03 -0700 | [diff] [blame] | 1587 | if (reset_main_space) { |
| 1588 | main_space_->GetMemMap()->Protect(PROT_READ | PROT_WRITE); |
| 1589 | madvise(main_space_->Begin(), main_space_->Capacity(), MADV_DONTNEED); |
| 1590 | MemMap* mem_map = main_space_->ReleaseMemMap(); |
| 1591 | RemoveSpace(main_space_); |
| 1592 | delete main_space_; |
| 1593 | main_space_ = nullptr; |
| 1594 | CreateMainMallocSpace(mem_map, kDefaultInitialSize, mem_map->Size(), mem_map->Size()); |
| 1595 | AddSpace(main_space_); |
| 1596 | } else { |
| 1597 | bump_pointer_space_->GetMemMap()->Protect(PROT_READ | PROT_WRITE); |
| 1598 | } |
| 1599 | if (temp_space_ != nullptr) { |
| 1600 | CHECK(temp_space_->IsEmpty()); |
| 1601 | } |
Mathieu Chartier | 590fee9 | 2013-09-13 13:46:47 -0700 | [diff] [blame] | 1602 | total_objects_freed_ever_ += semi_space_collector_->GetFreedObjects(); |
| 1603 | total_bytes_freed_ever_ += semi_space_collector_->GetFreedBytes(); |
| 1604 | // Update the end and write out image. |
| 1605 | non_moving_space_->SetEnd(target_space.End()); |
| 1606 | non_moving_space_->SetLimit(target_space.Limit()); |
Mathieu Chartier | 31f4414 | 2014-04-08 14:40:03 -0700 | [diff] [blame] | 1607 | VLOG(heap) << "Zygote space size " << non_moving_space_->Size() << " bytes"; |
Mathieu Chartier | 357e9be | 2012-08-01 11:00:14 -0700 | [diff] [blame] | 1608 | } |
Mathieu Chartier | 31f4414 | 2014-04-08 14:40:03 -0700 | [diff] [blame] | 1609 | ChangeCollector(foreground_collector_type_); |
Mathieu Chartier | a1602f2 | 2014-01-13 17:19:19 -0800 | [diff] [blame] | 1610 | // Save the old space so that we can remove it after we complete creating the zygote space. |
| 1611 | space::MallocSpace* old_alloc_space = non_moving_space_; |
Mathieu Chartier | 590fee9 | 2013-09-13 13:46:47 -0700 | [diff] [blame] | 1612 | // Turn the current alloc space into a zygote space and obtain the new alloc space composed of |
Mathieu Chartier | a1602f2 | 2014-01-13 17:19:19 -0800 | [diff] [blame] | 1613 | // the remaining available space. |
| 1614 | // Remove the old space before creating the zygote space since creating the zygote space sets |
| 1615 | // the old alloc space's bitmaps to nullptr. |
| 1616 | RemoveSpace(old_alloc_space); |
Hiroshi Yamauchi | 38e68e9 | 2014-03-07 13:59:08 -0800 | [diff] [blame] | 1617 | if (collector::SemiSpace::kUseRememberedSet) { |
| 1618 | // Sanity bound check. |
| 1619 | FindRememberedSetFromSpace(old_alloc_space)->AssertAllDirtyCardsAreWithinSpace(); |
| 1620 | // Remove the remembered set for the now zygote space (the old |
| 1621 | // non-moving space). Note now that we have compacted objects into |
| 1622 | // the zygote space, the data in the remembered set is no longer |
| 1623 | // needed. The zygote space will instead have a mod-union table |
| 1624 | // from this point on. |
| 1625 | RemoveRememberedSet(old_alloc_space); |
| 1626 | } |
Mathieu Chartier | a1602f2 | 2014-01-13 17:19:19 -0800 | [diff] [blame] | 1627 | space::ZygoteSpace* zygote_space = old_alloc_space->CreateZygoteSpace("alloc space", |
| 1628 | low_memory_mode_, |
Mathieu Chartier | 31f4414 | 2014-04-08 14:40:03 -0700 | [diff] [blame] | 1629 | &non_moving_space_); |
Mathieu Chartier | a1602f2 | 2014-01-13 17:19:19 -0800 | [diff] [blame] | 1630 | delete old_alloc_space; |
| 1631 | CHECK(zygote_space != nullptr) << "Failed creating zygote space"; |
Mathieu Chartier | 1b54f9c | 2014-04-30 16:45:02 -0700 | [diff] [blame] | 1632 | AddSpace(zygote_space); |
Mathieu Chartier | 31f4414 | 2014-04-08 14:40:03 -0700 | [diff] [blame] | 1633 | non_moving_space_->SetFootprintLimit(non_moving_space_->Capacity()); |
| 1634 | AddSpace(non_moving_space_); |
Ian Rogers | 1d54e73 | 2013-05-02 21:10:01 -0700 | [diff] [blame] | 1635 | have_zygote_space_ = true; |
Mathieu Chartier | bd0a653 | 2014-02-27 11:14:21 -0800 | [diff] [blame] | 1636 | // Enable large object space allocations. |
| 1637 | large_object_threshold_ = kDefaultLargeObjectThreshold; |
Mathieu Chartier | 11409ae | 2013-09-23 11:49:36 -0700 | [diff] [blame] | 1638 | // Create the zygote space mod union table. |
| 1639 | accounting::ModUnionTable* mod_union_table = |
| 1640 | new accounting::ModUnionTableCardCache("zygote space mod-union table", this, zygote_space); |
| 1641 | CHECK(mod_union_table != nullptr) << "Failed to create zygote space mod-union table"; |
| 1642 | AddModUnionTable(mod_union_table); |
Hiroshi Yamauchi | 38e68e9 | 2014-03-07 13:59:08 -0800 | [diff] [blame] | 1643 | if (collector::SemiSpace::kUseRememberedSet) { |
Hiroshi Yamauchi | 38e68e9 | 2014-03-07 13:59:08 -0800 | [diff] [blame] | 1644 | // Add a new remembered set for the post-zygote non-moving space. |
| 1645 | accounting::RememberedSet* post_zygote_non_moving_space_rem_set = |
| 1646 | new accounting::RememberedSet("Post-zygote non-moving space remembered set", this, |
| 1647 | non_moving_space_); |
| 1648 | CHECK(post_zygote_non_moving_space_rem_set != nullptr) |
| 1649 | << "Failed to create post-zygote non-moving space remembered set"; |
| 1650 | AddRememberedSet(post_zygote_non_moving_space_rem_set); |
| 1651 | } |
Mathieu Chartier | cc236d7 | 2012-07-20 10:29:05 -0700 | [diff] [blame] | 1652 | } |
| 1653 | |
Mathieu Chartier | 357e9be | 2012-08-01 11:00:14 -0700 | [diff] [blame] | 1654 | void Heap::FlushAllocStack() { |
Mathieu Chartier | e6da9af | 2013-12-16 11:54:42 -0800 | [diff] [blame] | 1655 | MarkAllocStackAsLive(allocation_stack_.get()); |
Mathieu Chartier | 357e9be | 2012-08-01 11:00:14 -0700 | [diff] [blame] | 1656 | allocation_stack_->Reset(); |
| 1657 | } |
| 1658 | |
Mathieu Chartier | a8e8f9c | 2014-04-09 14:51:05 -0700 | [diff] [blame] | 1659 | void Heap::MarkAllocStack(accounting::ContinuousSpaceBitmap* bitmap1, |
| 1660 | accounting::ContinuousSpaceBitmap* bitmap2, |
Mathieu Chartier | bbd695c | 2014-04-16 09:48:48 -0700 | [diff] [blame] | 1661 | accounting::LargeObjectBitmap* large_objects, |
Ian Rogers | 1d54e73 | 2013-05-02 21:10:01 -0700 | [diff] [blame] | 1662 | accounting::ObjectStack* stack) { |
Mathieu Chartier | e6da9af | 2013-12-16 11:54:42 -0800 | [diff] [blame] | 1663 | DCHECK(bitmap1 != nullptr); |
| 1664 | DCHECK(bitmap2 != nullptr); |
Ian Rogers | 2dd0e2c | 2013-01-24 12:42:14 -0800 | [diff] [blame] | 1665 | mirror::Object** limit = stack->End(); |
| 1666 | for (mirror::Object** it = stack->Begin(); it != limit; ++it) { |
| 1667 | const mirror::Object* obj = *it; |
Hiroshi Yamauchi | f5b0e20 | 2014-02-11 17:02:22 -0800 | [diff] [blame] | 1668 | if (!kUseThreadLocalAllocationStack || obj != nullptr) { |
| 1669 | if (bitmap1->HasAddress(obj)) { |
| 1670 | bitmap1->Set(obj); |
| 1671 | } else if (bitmap2->HasAddress(obj)) { |
| 1672 | bitmap2->Set(obj); |
| 1673 | } else { |
| 1674 | large_objects->Set(obj); |
| 1675 | } |
Mathieu Chartier | e0f0cb3 | 2012-08-28 11:26:00 -0700 | [diff] [blame] | 1676 | } |
Mathieu Chartier | 357e9be | 2012-08-01 11:00:14 -0700 | [diff] [blame] | 1677 | } |
| 1678 | } |
| 1679 | |
Mathieu Chartier | 590fee9 | 2013-09-13 13:46:47 -0700 | [diff] [blame] | 1680 | void Heap::SwapSemiSpaces() { |
Mathieu Chartier | 31f4414 | 2014-04-08 14:40:03 -0700 | [diff] [blame] | 1681 | CHECK(bump_pointer_space_ != nullptr); |
| 1682 | CHECK(temp_space_ != nullptr); |
Mathieu Chartier | 590fee9 | 2013-09-13 13:46:47 -0700 | [diff] [blame] | 1683 | std::swap(bump_pointer_space_, temp_space_); |
| 1684 | } |
| 1685 | |
| 1686 | void Heap::Compact(space::ContinuousMemMapAllocSpace* target_space, |
| 1687 | space::ContinuousMemMapAllocSpace* source_space) { |
| 1688 | CHECK(kMovingCollector); |
Mathieu Chartier | 5048223 | 2013-11-21 11:48:14 -0800 | [diff] [blame] | 1689 | CHECK_NE(target_space, source_space) << "In-place compaction currently unsupported"; |
Mathieu Chartier | 590fee9 | 2013-09-13 13:46:47 -0700 | [diff] [blame] | 1690 | if (target_space != source_space) { |
Mathieu Chartier | 6f365cc | 2014-04-23 12:42:27 -0700 | [diff] [blame] | 1691 | // Don't swap spaces since this isn't a typical semi space collection. |
| 1692 | semi_space_collector_->SetSwapSemiSpaces(false); |
Mathieu Chartier | 590fee9 | 2013-09-13 13:46:47 -0700 | [diff] [blame] | 1693 | semi_space_collector_->SetFromSpace(source_space); |
| 1694 | semi_space_collector_->SetToSpace(target_space); |
Hiroshi Yamauchi | 6f4ffe4 | 2014-01-13 12:30:44 -0800 | [diff] [blame] | 1695 | semi_space_collector_->Run(kGcCauseCollectorTransition, false); |
Mathieu Chartier | 590fee9 | 2013-09-13 13:46:47 -0700 | [diff] [blame] | 1696 | } |
| 1697 | } |
Anwar Ghuloum | 67f9941 | 2013-08-12 14:19:48 -0700 | [diff] [blame] | 1698 | |
Ian Rogers | 1d54e73 | 2013-05-02 21:10:01 -0700 | [diff] [blame] | 1699 | collector::GcType Heap::CollectGarbageInternal(collector::GcType gc_type, GcCause gc_cause, |
| 1700 | bool clear_soft_references) { |
Ian Rogers | 81d425b | 2012-09-27 16:03:43 -0700 | [diff] [blame] | 1701 | Thread* self = Thread::Current(); |
Mathieu Chartier | 590fee9 | 2013-09-13 13:46:47 -0700 | [diff] [blame] | 1702 | Runtime* runtime = Runtime::Current(); |
Mathieu Chartier | cbb2d20 | 2013-11-14 17:45:16 -0800 | [diff] [blame] | 1703 | // If the heap can't run the GC, silently fail and return that no GC was run. |
| 1704 | switch (gc_type) { |
Mathieu Chartier | cbb2d20 | 2013-11-14 17:45:16 -0800 | [diff] [blame] | 1705 | case collector::kGcTypePartial: { |
| 1706 | if (!have_zygote_space_) { |
| 1707 | return collector::kGcTypeNone; |
| 1708 | } |
| 1709 | break; |
| 1710 | } |
| 1711 | default: { |
| 1712 | // Other GC types don't have any special cases which makes them not runnable. The main case |
| 1713 | // here is full GC. |
| 1714 | } |
| 1715 | } |
Mathieu Chartier | 65db880 | 2012-11-20 12:36:46 -0800 | [diff] [blame] | 1716 | ScopedThreadStateChange tsc(self, kWaitingPerformingGc); |
Ian Rogers | 81d425b | 2012-09-27 16:03:43 -0700 | [diff] [blame] | 1717 | Locks::mutator_lock_->AssertNotHeld(self); |
Ian Rogers | 120f1c7 | 2012-09-28 17:17:10 -0700 | [diff] [blame] | 1718 | if (self->IsHandlingStackOverflow()) { |
| 1719 | LOG(WARNING) << "Performing GC on a thread that is handling a stack overflow."; |
| 1720 | } |
Mathieu Chartier | d5a89ee | 2014-01-31 09:55:13 -0800 | [diff] [blame] | 1721 | bool compacting_gc; |
| 1722 | { |
| 1723 | gc_complete_lock_->AssertNotHeld(self); |
Mathieu Chartier | caa82d6 | 2014-02-02 16:51:17 -0800 | [diff] [blame] | 1724 | ScopedThreadStateChange tsc(self, kWaitingForGcToComplete); |
Mathieu Chartier | d5a89ee | 2014-01-31 09:55:13 -0800 | [diff] [blame] | 1725 | MutexLock mu(self, *gc_complete_lock_); |
| 1726 | // Ensure there is only one GC at a time. |
Mathieu Chartier | 89a201e | 2014-05-02 10:27:26 -0700 | [diff] [blame] | 1727 | WaitForGcToCompleteLocked(gc_cause, self); |
Mathieu Chartier | 31f4414 | 2014-04-08 14:40:03 -0700 | [diff] [blame] | 1728 | compacting_gc = IsMovingGc(collector_type_); |
Mathieu Chartier | d5a89ee | 2014-01-31 09:55:13 -0800 | [diff] [blame] | 1729 | // GC can be disabled if someone has a used GetPrimitiveArrayCritical. |
| 1730 | if (compacting_gc && disable_moving_gc_count_ != 0) { |
| 1731 | LOG(WARNING) << "Skipping GC due to disable moving GC count " << disable_moving_gc_count_; |
| 1732 | return collector::kGcTypeNone; |
| 1733 | } |
| 1734 | collector_type_running_ = collector_type_; |
Ian Rogers | 00f7d0e | 2012-07-19 15:28:27 -0700 | [diff] [blame] | 1735 | } |
Mathieu Chartier | d5a89ee | 2014-01-31 09:55:13 -0800 | [diff] [blame] | 1736 | |
Mathieu Chartier | 590fee9 | 2013-09-13 13:46:47 -0700 | [diff] [blame] | 1737 | if (gc_cause == kGcCauseForAlloc && runtime->HasStatsEnabled()) { |
| 1738 | ++runtime->GetStats()->gc_for_alloc_count; |
| 1739 | ++self->GetStats()->gc_for_alloc_count; |
Mathieu Chartier | 2fde533 | 2012-09-14 14:51:54 -0700 | [diff] [blame] | 1740 | } |
Ian Rogers | 1d54e73 | 2013-05-02 21:10:01 -0700 | [diff] [blame] | 1741 | uint64_t gc_start_time_ns = NanoTime(); |
Mathieu Chartier | 65db880 | 2012-11-20 12:36:46 -0800 | [diff] [blame] | 1742 | uint64_t gc_start_size = GetBytesAllocated(); |
| 1743 | // Approximate allocation rate in bytes / second. |
Ian Rogers | 1d54e73 | 2013-05-02 21:10:01 -0700 | [diff] [blame] | 1744 | uint64_t ms_delta = NsToMs(gc_start_time_ns - last_gc_time_ns_); |
Mathieu Chartier | 590fee9 | 2013-09-13 13:46:47 -0700 | [diff] [blame] | 1745 | // Back to back GCs can cause 0 ms of wait time in between GC invocations. |
| 1746 | if (LIKELY(ms_delta != 0)) { |
Ian Rogers | 1d54e73 | 2013-05-02 21:10:01 -0700 | [diff] [blame] | 1747 | allocation_rate_ = ((gc_start_size - last_gc_size_) * 1000) / ms_delta; |
Mathieu Chartier | 65db880 | 2012-11-20 12:36:46 -0800 | [diff] [blame] | 1748 | VLOG(heap) << "Allocation rate: " << PrettySize(allocation_rate_) << "/s"; |
| 1749 | } |
| 1750 | |
Ian Rogers | 1d54e73 | 2013-05-02 21:10:01 -0700 | [diff] [blame] | 1751 | DCHECK_LT(gc_type, collector::kGcTypeMax); |
| 1752 | DCHECK_NE(gc_type, collector::kGcTypeNone); |
Anwar Ghuloum | 67f9941 | 2013-08-12 14:19:48 -0700 | [diff] [blame] | 1753 | |
Mathieu Chartier | 590fee9 | 2013-09-13 13:46:47 -0700 | [diff] [blame] | 1754 | collector::GarbageCollector* collector = nullptr; |
Mathieu Chartier | 5048223 | 2013-11-21 11:48:14 -0800 | [diff] [blame] | 1755 | // TODO: Clean this up. |
Mathieu Chartier | 1d27b34 | 2014-01-28 12:51:09 -0800 | [diff] [blame] | 1756 | if (compacting_gc) { |
Mathieu Chartier | 692fafd | 2013-11-29 17:24:40 -0800 | [diff] [blame] | 1757 | DCHECK(current_allocator_ == kAllocatorTypeBumpPointer || |
| 1758 | current_allocator_ == kAllocatorTypeTLAB); |
Hiroshi Yamauchi | d5307ec | 2014-03-27 21:07:51 -0700 | [diff] [blame] | 1759 | if (collector_type_ == kCollectorTypeSS || collector_type_ == kCollectorTypeGSS) { |
| 1760 | gc_type = semi_space_collector_->GetGcType(); |
| 1761 | semi_space_collector_->SetFromSpace(bump_pointer_space_); |
| 1762 | semi_space_collector_->SetToSpace(temp_space_); |
| 1763 | collector = semi_space_collector_; |
Mathieu Chartier | 6f365cc | 2014-04-23 12:42:27 -0700 | [diff] [blame] | 1764 | semi_space_collector_->SetSwapSemiSpaces(true); |
Hiroshi Yamauchi | d5307ec | 2014-03-27 21:07:51 -0700 | [diff] [blame] | 1765 | } else if (collector_type_ == kCollectorTypeCC) { |
| 1766 | gc_type = concurrent_copying_collector_->GetGcType(); |
| 1767 | collector = concurrent_copying_collector_; |
| 1768 | } else { |
| 1769 | LOG(FATAL) << "Unreachable - invalid collector type " << static_cast<size_t>(collector_type_); |
| 1770 | } |
Mathieu Chartier | 15d3402 | 2014-02-26 17:16:38 -0800 | [diff] [blame] | 1771 | temp_space_->GetMemMap()->Protect(PROT_READ | PROT_WRITE); |
Hiroshi Yamauchi | d5307ec | 2014-03-27 21:07:51 -0700 | [diff] [blame] | 1772 | CHECK(temp_space_->IsEmpty()); |
Mathieu Chartier | 590fee9 | 2013-09-13 13:46:47 -0700 | [diff] [blame] | 1773 | gc_type = collector::kGcTypeFull; |
Mathieu Chartier | e6da9af | 2013-12-16 11:54:42 -0800 | [diff] [blame] | 1774 | } else if (current_allocator_ == kAllocatorTypeRosAlloc || |
| 1775 | current_allocator_ == kAllocatorTypeDlMalloc) { |
Mathieu Chartier | afe4998 | 2014-03-27 10:55:04 -0700 | [diff] [blame] | 1776 | collector = FindCollectorByGcType(gc_type); |
Mathieu Chartier | 5048223 | 2013-11-21 11:48:14 -0800 | [diff] [blame] | 1777 | } else { |
| 1778 | LOG(FATAL) << "Invalid current allocator " << current_allocator_; |
Mathieu Chartier | 590fee9 | 2013-09-13 13:46:47 -0700 | [diff] [blame] | 1779 | } |
Mathieu Chartier | 7bf82af | 2013-12-06 16:51:45 -0800 | [diff] [blame] | 1780 | CHECK(collector != nullptr) |
Hiroshi Yamauchi | 3e41780 | 2014-03-20 12:03:02 -0700 | [diff] [blame] | 1781 | << "Could not find garbage collector with collector_type=" |
| 1782 | << static_cast<size_t>(collector_type_) << " and gc_type=" << gc_type; |
Mathieu Chartier | 590fee9 | 2013-09-13 13:46:47 -0700 | [diff] [blame] | 1783 | ATRACE_BEGIN(StringPrintf("%s %s GC", PrettyCause(gc_cause), collector->GetName()).c_str()); |
Mathieu Chartier | 6f365cc | 2014-04-23 12:42:27 -0700 | [diff] [blame] | 1784 | collector->Run(gc_cause, clear_soft_references || runtime->IsZygote()); |
Ian Rogers | 1d54e73 | 2013-05-02 21:10:01 -0700 | [diff] [blame] | 1785 | total_objects_freed_ever_ += collector->GetFreedObjects(); |
| 1786 | total_bytes_freed_ever_ += collector->GetFreedBytes(); |
Mathieu Chartier | 7bf52d2 | 2014-03-13 14:46:09 -0700 | [diff] [blame] | 1787 | RequestHeapTrim(); |
Mathieu Chartier | 39e3261 | 2013-11-12 16:28:05 -0800 | [diff] [blame] | 1788 | // Enqueue cleared references. |
Mathieu Chartier | 78f7b4c | 2014-05-06 10:57:27 -0700 | [diff] [blame] | 1789 | reference_processor_.EnqueueClearedReferences(); |
Mathieu Chartier | 590fee9 | 2013-09-13 13:46:47 -0700 | [diff] [blame] | 1790 | // Grow the heap so that we know when to perform the next GC. |
Mathieu Chartier | afe4998 | 2014-03-27 10:55:04 -0700 | [diff] [blame] | 1791 | GrowForUtilization(collector); |
Mathieu Chartier | 62ab87b | 2014-04-28 12:22:07 -0700 | [diff] [blame] | 1792 | const size_t duration = collector->GetDurationNs(); |
| 1793 | const std::vector<uint64_t>& pause_times = collector->GetPauseTimes(); |
| 1794 | // Print the GC if it is an explicit GC (e.g. Runtime.gc()) or a slow GC |
| 1795 | // (mutator time blocked >= long_pause_log_threshold_). |
| 1796 | bool log_gc = gc_cause == kGcCauseExplicit; |
| 1797 | if (!log_gc && CareAboutPauseTimes()) { |
Mathieu Chartier | e53225c | 2013-08-19 10:59:11 -0700 | [diff] [blame] | 1798 | // GC for alloc pauses the allocating thread, so consider it as a pause. |
Mathieu Chartier | 62ab87b | 2014-04-28 12:22:07 -0700 | [diff] [blame] | 1799 | log_gc = duration > long_gc_log_threshold_ || |
Mathieu Chartier | e6da9af | 2013-12-16 11:54:42 -0800 | [diff] [blame] | 1800 | (gc_cause == kGcCauseForAlloc && duration > long_pause_log_threshold_); |
Mathieu Chartier | 62ab87b | 2014-04-28 12:22:07 -0700 | [diff] [blame] | 1801 | for (uint64_t pause : pause_times) { |
| 1802 | log_gc = log_gc || pause >= long_pause_log_threshold_; |
Mathieu Chartier | e53225c | 2013-08-19 10:59:11 -0700 | [diff] [blame] | 1803 | } |
Mathieu Chartier | 62ab87b | 2014-04-28 12:22:07 -0700 | [diff] [blame] | 1804 | } |
| 1805 | if (log_gc) { |
| 1806 | const size_t percent_free = GetPercentFree(); |
| 1807 | const size_t current_heap_size = GetBytesAllocated(); |
| 1808 | const size_t total_memory = GetTotalMemory(); |
| 1809 | std::ostringstream pause_string; |
| 1810 | for (size_t i = 0; i < pause_times.size(); ++i) { |
| 1811 | pause_string << PrettyDuration((pause_times[i] / 1000) * 1000) |
Mathieu Chartier | 6f365cc | 2014-04-23 12:42:27 -0700 | [diff] [blame] | 1812 | << ((i != pause_times.size() - 1) ? "," : ""); |
Mathieu Chartier | e53225c | 2013-08-19 10:59:11 -0700 | [diff] [blame] | 1813 | } |
Mathieu Chartier | 62ab87b | 2014-04-28 12:22:07 -0700 | [diff] [blame] | 1814 | LOG(INFO) << gc_cause << " " << collector->GetName() |
| 1815 | << " GC freed " << collector->GetFreedObjects() << "(" |
| 1816 | << PrettySize(collector->GetFreedBytes()) << ") AllocSpace objects, " |
| 1817 | << collector->GetFreedLargeObjects() << "(" |
| 1818 | << PrettySize(collector->GetFreedLargeObjectBytes()) << ") LOS objects, " |
| 1819 | << percent_free << "% free, " << PrettySize(current_heap_size) << "/" |
| 1820 | << PrettySize(total_memory) << ", " << "paused " << pause_string.str() |
| 1821 | << " total " << PrettyDuration((duration / 1000) * 1000); |
| 1822 | VLOG(heap) << ConstDumpable<TimingLogger>(collector->GetTimings()); |
Mathieu Chartier | 2b82db4 | 2012-11-14 17:29:05 -0800 | [diff] [blame] | 1823 | } |
Mathieu Chartier | e6da9af | 2013-12-16 11:54:42 -0800 | [diff] [blame] | 1824 | FinishGC(self, gc_type); |
Mathieu Chartier | 752a0e6 | 2013-06-27 11:03:27 -0700 | [diff] [blame] | 1825 | ATRACE_END(); |
Anwar Ghuloum | 4446ab9 | 2013-08-09 21:17:25 -0700 | [diff] [blame] | 1826 | |
| 1827 | // Inform DDMS that a GC completed. |
Ian Rogers | 15bf2d3 | 2012-08-28 17:33:04 -0700 | [diff] [blame] | 1828 | Dbg::GcDidFinish(); |
Mathieu Chartier | 866fb2a | 2012-09-10 10:47:49 -0700 | [diff] [blame] | 1829 | return gc_type; |
Ian Rogers | 00f7d0e | 2012-07-19 15:28:27 -0700 | [diff] [blame] | 1830 | } |
Mathieu Chartier | a639903 | 2012-06-11 18:49:50 -0700 | [diff] [blame] | 1831 | |
Mathieu Chartier | e6da9af | 2013-12-16 11:54:42 -0800 | [diff] [blame] | 1832 | void Heap::FinishGC(Thread* self, collector::GcType gc_type) { |
| 1833 | MutexLock mu(self, *gc_complete_lock_); |
Mathieu Chartier | d5a89ee | 2014-01-31 09:55:13 -0800 | [diff] [blame] | 1834 | collector_type_running_ = kCollectorTypeNone; |
| 1835 | if (gc_type != collector::kGcTypeNone) { |
| 1836 | last_gc_type_ = gc_type; |
| 1837 | } |
Mathieu Chartier | e6da9af | 2013-12-16 11:54:42 -0800 | [diff] [blame] | 1838 | // Wake anyone who may have been waiting for the GC to complete. |
| 1839 | gc_complete_cond_->Broadcast(self); |
| 1840 | } |
| 1841 | |
Mathieu Chartier | 815873e | 2014-02-13 18:02:13 -0800 | [diff] [blame] | 1842 | static void RootMatchesObjectVisitor(mirror::Object** root, void* arg, uint32_t /*thread_id*/, |
| 1843 | RootType /*root_type*/) { |
Ian Rogers | 2dd0e2c | 2013-01-24 12:42:14 -0800 | [diff] [blame] | 1844 | mirror::Object* obj = reinterpret_cast<mirror::Object*>(arg); |
Mathieu Chartier | 815873e | 2014-02-13 18:02:13 -0800 | [diff] [blame] | 1845 | if (*root == obj) { |
Mathieu Chartier | fd678be | 2012-08-30 14:50:54 -0700 | [diff] [blame] | 1846 | LOG(INFO) << "Object " << obj << " is a root"; |
| 1847 | } |
| 1848 | } |
| 1849 | |
| 1850 | class ScanVisitor { |
| 1851 | public: |
Brian Carlstrom | df62950 | 2013-07-17 22:39:56 -0700 | [diff] [blame] | 1852 | void operator()(const mirror::Object* obj) const { |
Mathieu Chartier | 0f72e41 | 2013-09-06 16:40:01 -0700 | [diff] [blame] | 1853 | LOG(ERROR) << "Would have rescanned object " << obj; |
Mathieu Chartier | fd678be | 2012-08-30 14:50:54 -0700 | [diff] [blame] | 1854 | } |
| 1855 | }; |
| 1856 | |
Ian Rogers | 1d54e73 | 2013-05-02 21:10:01 -0700 | [diff] [blame] | 1857 | // Verify a reference from an object. |
Mathieu Chartier | fd678be | 2012-08-30 14:50:54 -0700 | [diff] [blame] | 1858 | class VerifyReferenceVisitor { |
| 1859 | public: |
Mathieu Chartier | 78f7b4c | 2014-05-06 10:57:27 -0700 | [diff] [blame] | 1860 | explicit VerifyReferenceVisitor(Heap* heap, bool verify_referent) |
Ian Rogers | 1d54e73 | 2013-05-02 21:10:01 -0700 | [diff] [blame] | 1861 | SHARED_LOCKS_REQUIRED(Locks::mutator_lock_, Locks::heap_bitmap_lock_) |
Mathieu Chartier | 78f7b4c | 2014-05-06 10:57:27 -0700 | [diff] [blame] | 1862 | : heap_(heap), failed_(false), verify_referent_(verify_referent) {} |
Ian Rogers | 1d54e73 | 2013-05-02 21:10:01 -0700 | [diff] [blame] | 1863 | |
| 1864 | bool Failed() const { |
| 1865 | return failed_; |
Mathieu Chartier | fd678be | 2012-08-30 14:50:54 -0700 | [diff] [blame] | 1866 | } |
| 1867 | |
Mathieu Chartier | 407f702 | 2014-02-18 14:37:05 -0800 | [diff] [blame] | 1868 | void operator()(mirror::Class* klass, mirror::Reference* ref) const |
| 1869 | SHARED_LOCKS_REQUIRED(Locks::mutator_lock_) { |
Mathieu Chartier | 78f7b4c | 2014-05-06 10:57:27 -0700 | [diff] [blame] | 1870 | if (verify_referent_) { |
| 1871 | this->operator()(ref, mirror::Reference::ReferentOffset(), false); |
| 1872 | } |
Mathieu Chartier | 407f702 | 2014-02-18 14:37:05 -0800 | [diff] [blame] | 1873 | } |
| 1874 | |
Mathieu Chartier | 3b05e9b | 2014-03-25 09:29:43 -0700 | [diff] [blame] | 1875 | void operator()(mirror::Object* obj, MemberOffset offset, bool /*is_static*/) const |
Mathieu Chartier | 407f702 | 2014-02-18 14:37:05 -0800 | [diff] [blame] | 1876 | SHARED_LOCKS_REQUIRED(Locks::mutator_lock_) { |
Ian Rogers | b0fa5dc | 2014-04-28 16:47:08 -0700 | [diff] [blame] | 1877 | this->operator()(obj, obj->GetFieldObject<mirror::Object>(offset), offset); |
Mathieu Chartier | 407f702 | 2014-02-18 14:37:05 -0800 | [diff] [blame] | 1878 | } |
| 1879 | |
| 1880 | // TODO: Fix the no thread safety analysis. |
| 1881 | void operator()(mirror::Object* obj, mirror::Object* ref, MemberOffset offset) const |
Ian Rogers | 2dd0e2c | 2013-01-24 12:42:14 -0800 | [diff] [blame] | 1882 | NO_THREAD_SAFETY_ANALYSIS { |
Mathieu Chartier | 938a03b | 2014-01-16 15:10:31 -0800 | [diff] [blame] | 1883 | if (ref == nullptr || IsLive(ref)) { |
| 1884 | // Verify that the reference is live. |
| 1885 | return; |
| 1886 | } |
| 1887 | if (!failed_) { |
| 1888 | // Print message on only on first failure to prevent spam. |
| 1889 | LOG(ERROR) << "!!!!!!!!!!!!!!Heap corruption detected!!!!!!!!!!!!!!!!!!!"; |
| 1890 | failed_ = true; |
| 1891 | } |
| 1892 | if (obj != nullptr) { |
Ian Rogers | 1d54e73 | 2013-05-02 21:10:01 -0700 | [diff] [blame] | 1893 | accounting::CardTable* card_table = heap_->GetCardTable(); |
| 1894 | accounting::ObjectStack* alloc_stack = heap_->allocation_stack_.get(); |
| 1895 | accounting::ObjectStack* live_stack = heap_->live_stack_.get(); |
Mathieu Chartier | 938a03b | 2014-01-16 15:10:31 -0800 | [diff] [blame] | 1896 | byte* card_addr = card_table->CardFromAddr(obj); |
| 1897 | LOG(ERROR) << "Object " << obj << " references dead object " << ref << " at offset " |
| 1898 | << offset << "\n card value = " << static_cast<int>(*card_addr); |
| 1899 | if (heap_->IsValidObjectAddress(obj->GetClass())) { |
| 1900 | LOG(ERROR) << "Obj type " << PrettyTypeOf(obj); |
| 1901 | } else { |
| 1902 | LOG(ERROR) << "Object " << obj << " class(" << obj->GetClass() << ") not a heap address"; |
Mathieu Chartier | 0f72e41 | 2013-09-06 16:40:01 -0700 | [diff] [blame] | 1903 | } |
Mathieu Chartier | 938a03b | 2014-01-16 15:10:31 -0800 | [diff] [blame] | 1904 | |
| 1905 | // Attmept to find the class inside of the recently freed objects. |
| 1906 | space::ContinuousSpace* ref_space = heap_->FindContinuousSpaceFromObject(ref, true); |
| 1907 | if (ref_space != nullptr && ref_space->IsMallocSpace()) { |
| 1908 | space::MallocSpace* space = ref_space->AsMallocSpace(); |
| 1909 | mirror::Class* ref_class = space->FindRecentFreedObject(ref); |
| 1910 | if (ref_class != nullptr) { |
| 1911 | LOG(ERROR) << "Reference " << ref << " found as a recently freed object with class " |
| 1912 | << PrettyClass(ref_class); |
Mathieu Chartier | 0f72e41 | 2013-09-06 16:40:01 -0700 | [diff] [blame] | 1913 | } else { |
Mathieu Chartier | 938a03b | 2014-01-16 15:10:31 -0800 | [diff] [blame] | 1914 | LOG(ERROR) << "Reference " << ref << " not found as a recently freed object"; |
Mathieu Chartier | 0f72e41 | 2013-09-06 16:40:01 -0700 | [diff] [blame] | 1915 | } |
Mathieu Chartier | 938a03b | 2014-01-16 15:10:31 -0800 | [diff] [blame] | 1916 | } |
Mathieu Chartier | 0f72e41 | 2013-09-06 16:40:01 -0700 | [diff] [blame] | 1917 | |
Mathieu Chartier | 938a03b | 2014-01-16 15:10:31 -0800 | [diff] [blame] | 1918 | if (ref->GetClass() != nullptr && heap_->IsValidObjectAddress(ref->GetClass()) && |
| 1919 | ref->GetClass()->IsClass()) { |
| 1920 | LOG(ERROR) << "Ref type " << PrettyTypeOf(ref); |
| 1921 | } else { |
| 1922 | LOG(ERROR) << "Ref " << ref << " class(" << ref->GetClass() |
| 1923 | << ") is not a valid heap address"; |
| 1924 | } |
| 1925 | |
| 1926 | card_table->CheckAddrIsInCardTable(reinterpret_cast<const byte*>(obj)); |
| 1927 | void* cover_begin = card_table->AddrFromCard(card_addr); |
| 1928 | void* cover_end = reinterpret_cast<void*>(reinterpret_cast<size_t>(cover_begin) + |
| 1929 | accounting::CardTable::kCardSize); |
| 1930 | LOG(ERROR) << "Card " << reinterpret_cast<void*>(card_addr) << " covers " << cover_begin |
| 1931 | << "-" << cover_end; |
Mathieu Chartier | a8e8f9c | 2014-04-09 14:51:05 -0700 | [diff] [blame] | 1932 | accounting::ContinuousSpaceBitmap* bitmap = |
| 1933 | heap_->GetLiveBitmap()->GetContinuousSpaceBitmap(obj); |
Mathieu Chartier | 938a03b | 2014-01-16 15:10:31 -0800 | [diff] [blame] | 1934 | |
| 1935 | if (bitmap == nullptr) { |
| 1936 | LOG(ERROR) << "Object " << obj << " has no bitmap"; |
Mathieu Chartier | 4e30541 | 2014-02-19 10:54:44 -0800 | [diff] [blame] | 1937 | if (!VerifyClassClass(obj->GetClass())) { |
Mathieu Chartier | 938a03b | 2014-01-16 15:10:31 -0800 | [diff] [blame] | 1938 | LOG(ERROR) << "Object " << obj << " failed class verification!"; |
Mathieu Chartier | 0f72e41 | 2013-09-06 16:40:01 -0700 | [diff] [blame] | 1939 | } |
Mathieu Chartier | 938a03b | 2014-01-16 15:10:31 -0800 | [diff] [blame] | 1940 | } else { |
Ian Rogers | 1d54e73 | 2013-05-02 21:10:01 -0700 | [diff] [blame] | 1941 | // Print out how the object is live. |
Mathieu Chartier | 938a03b | 2014-01-16 15:10:31 -0800 | [diff] [blame] | 1942 | if (bitmap->Test(obj)) { |
Ian Rogers | 1d54e73 | 2013-05-02 21:10:01 -0700 | [diff] [blame] | 1943 | LOG(ERROR) << "Object " << obj << " found in live bitmap"; |
| 1944 | } |
Mathieu Chartier | 0f72e41 | 2013-09-06 16:40:01 -0700 | [diff] [blame] | 1945 | if (alloc_stack->Contains(const_cast<mirror::Object*>(obj))) { |
Ian Rogers | 1d54e73 | 2013-05-02 21:10:01 -0700 | [diff] [blame] | 1946 | LOG(ERROR) << "Object " << obj << " found in allocation stack"; |
| 1947 | } |
Mathieu Chartier | 0f72e41 | 2013-09-06 16:40:01 -0700 | [diff] [blame] | 1948 | if (live_stack->Contains(const_cast<mirror::Object*>(obj))) { |
Ian Rogers | 1d54e73 | 2013-05-02 21:10:01 -0700 | [diff] [blame] | 1949 | LOG(ERROR) << "Object " << obj << " found in live stack"; |
| 1950 | } |
Mathieu Chartier | 0f72e41 | 2013-09-06 16:40:01 -0700 | [diff] [blame] | 1951 | if (alloc_stack->Contains(const_cast<mirror::Object*>(ref))) { |
| 1952 | LOG(ERROR) << "Ref " << ref << " found in allocation stack"; |
| 1953 | } |
| 1954 | if (live_stack->Contains(const_cast<mirror::Object*>(ref))) { |
| 1955 | LOG(ERROR) << "Ref " << ref << " found in live stack"; |
| 1956 | } |
Ian Rogers | 1d54e73 | 2013-05-02 21:10:01 -0700 | [diff] [blame] | 1957 | // Attempt to see if the card table missed the reference. |
| 1958 | ScanVisitor scan_visitor; |
| 1959 | byte* byte_cover_begin = reinterpret_cast<byte*>(card_table->AddrFromCard(card_addr)); |
| 1960 | card_table->Scan(bitmap, byte_cover_begin, |
Mathieu Chartier | 184e322 | 2013-08-03 14:02:57 -0700 | [diff] [blame] | 1961 | byte_cover_begin + accounting::CardTable::kCardSize, scan_visitor); |
Mathieu Chartier | c7b83a0 | 2012-09-11 18:07:39 -0700 | [diff] [blame] | 1962 | } |
Mathieu Chartier | 938a03b | 2014-01-16 15:10:31 -0800 | [diff] [blame] | 1963 | |
| 1964 | // Search to see if any of the roots reference our object. |
| 1965 | void* arg = const_cast<void*>(reinterpret_cast<const void*>(obj)); |
Mathieu Chartier | 893263b | 2014-03-04 11:07:42 -0800 | [diff] [blame] | 1966 | Runtime::Current()->VisitRoots(&RootMatchesObjectVisitor, arg); |
Mathieu Chartier | 938a03b | 2014-01-16 15:10:31 -0800 | [diff] [blame] | 1967 | |
| 1968 | // Search to see if any of the roots reference our reference. |
| 1969 | arg = const_cast<void*>(reinterpret_cast<const void*>(ref)); |
Mathieu Chartier | 893263b | 2014-03-04 11:07:42 -0800 | [diff] [blame] | 1970 | Runtime::Current()->VisitRoots(&RootMatchesObjectVisitor, arg); |
Mathieu Chartier | 938a03b | 2014-01-16 15:10:31 -0800 | [diff] [blame] | 1971 | } else { |
| 1972 | LOG(ERROR) << "Root " << ref << " is dead with type " << PrettyTypeOf(ref); |
Mathieu Chartier | fd678be | 2012-08-30 14:50:54 -0700 | [diff] [blame] | 1973 | } |
| 1974 | } |
| 1975 | |
Ian Rogers | ef7d42f | 2014-01-06 12:55:46 -0800 | [diff] [blame] | 1976 | bool IsLive(mirror::Object* obj) const NO_THREAD_SAFETY_ANALYSIS { |
Mathieu Chartier | 0f72e41 | 2013-09-06 16:40:01 -0700 | [diff] [blame] | 1977 | return heap_->IsLiveObjectLocked(obj, true, false, true); |
Ian Rogers | 1d54e73 | 2013-05-02 21:10:01 -0700 | [diff] [blame] | 1978 | } |
| 1979 | |
Mathieu Chartier | 815873e | 2014-02-13 18:02:13 -0800 | [diff] [blame] | 1980 | static void VerifyRoots(mirror::Object** root, void* arg, uint32_t /*thread_id*/, |
| 1981 | RootType /*root_type*/) { |
Ian Rogers | 1d54e73 | 2013-05-02 21:10:01 -0700 | [diff] [blame] | 1982 | VerifyReferenceVisitor* visitor = reinterpret_cast<VerifyReferenceVisitor*>(arg); |
Mathieu Chartier | 407f702 | 2014-02-18 14:37:05 -0800 | [diff] [blame] | 1983 | (*visitor)(nullptr, *root, MemberOffset(0)); |
Mathieu Chartier | fd678be | 2012-08-30 14:50:54 -0700 | [diff] [blame] | 1984 | } |
| 1985 | |
| 1986 | private: |
Ian Rogers | 1d54e73 | 2013-05-02 21:10:01 -0700 | [diff] [blame] | 1987 | Heap* const heap_; |
| 1988 | mutable bool failed_; |
Mathieu Chartier | 78f7b4c | 2014-05-06 10:57:27 -0700 | [diff] [blame] | 1989 | bool verify_referent_; |
Mathieu Chartier | fd678be | 2012-08-30 14:50:54 -0700 | [diff] [blame] | 1990 | }; |
| 1991 | |
Ian Rogers | 1d54e73 | 2013-05-02 21:10:01 -0700 | [diff] [blame] | 1992 | // Verify all references within an object, for use with HeapBitmap::Visit. |
Mathieu Chartier | fd678be | 2012-08-30 14:50:54 -0700 | [diff] [blame] | 1993 | class VerifyObjectVisitor { |
| 1994 | public: |
Mathieu Chartier | 78f7b4c | 2014-05-06 10:57:27 -0700 | [diff] [blame] | 1995 | explicit VerifyObjectVisitor(Heap* heap, bool verify_referent) |
| 1996 | : heap_(heap), failed_(false), verify_referent_(verify_referent) { |
| 1997 | } |
Mathieu Chartier | fd678be | 2012-08-30 14:50:54 -0700 | [diff] [blame] | 1998 | |
Mathieu Chartier | 590fee9 | 2013-09-13 13:46:47 -0700 | [diff] [blame] | 1999 | void operator()(mirror::Object* obj) const |
Ian Rogers | b726dcb | 2012-09-05 08:57:23 -0700 | [diff] [blame] | 2000 | SHARED_LOCKS_REQUIRED(Locks::mutator_lock_, Locks::heap_bitmap_lock_) { |
Ian Rogers | 1d54e73 | 2013-05-02 21:10:01 -0700 | [diff] [blame] | 2001 | // Note: we are verifying the references in obj but not obj itself, this is because obj must |
| 2002 | // be live or else how did we find it in the live bitmap? |
Mathieu Chartier | 78f7b4c | 2014-05-06 10:57:27 -0700 | [diff] [blame] | 2003 | VerifyReferenceVisitor visitor(heap_, verify_referent_); |
Mathieu Chartier | 0f72e41 | 2013-09-06 16:40:01 -0700 | [diff] [blame] | 2004 | // The class doesn't count as a reference but we should verify it anyways. |
Mathieu Chartier | 407f702 | 2014-02-18 14:37:05 -0800 | [diff] [blame] | 2005 | obj->VisitReferences<true>(visitor, visitor); |
Ian Rogers | 1d54e73 | 2013-05-02 21:10:01 -0700 | [diff] [blame] | 2006 | failed_ = failed_ || visitor.Failed(); |
Mathieu Chartier | fd678be | 2012-08-30 14:50:54 -0700 | [diff] [blame] | 2007 | } |
| 2008 | |
Mathieu Chartier | 590fee9 | 2013-09-13 13:46:47 -0700 | [diff] [blame] | 2009 | static void VisitCallback(mirror::Object* obj, void* arg) |
| 2010 | SHARED_LOCKS_REQUIRED(Locks::mutator_lock_, Locks::heap_bitmap_lock_) { |
| 2011 | VerifyObjectVisitor* visitor = reinterpret_cast<VerifyObjectVisitor*>(arg); |
| 2012 | visitor->operator()(obj); |
| 2013 | } |
| 2014 | |
Mathieu Chartier | fd678be | 2012-08-30 14:50:54 -0700 | [diff] [blame] | 2015 | bool Failed() const { |
| 2016 | return failed_; |
| 2017 | } |
| 2018 | |
| 2019 | private: |
Ian Rogers | 1d54e73 | 2013-05-02 21:10:01 -0700 | [diff] [blame] | 2020 | Heap* const heap_; |
| 2021 | mutable bool failed_; |
Mathieu Chartier | 78f7b4c | 2014-05-06 10:57:27 -0700 | [diff] [blame] | 2022 | const bool verify_referent_; |
Mathieu Chartier | fd678be | 2012-08-30 14:50:54 -0700 | [diff] [blame] | 2023 | }; |
| 2024 | |
| 2025 | // Must do this with mutators suspended since we are directly accessing the allocation stacks. |
Mathieu Chartier | 78f7b4c | 2014-05-06 10:57:27 -0700 | [diff] [blame] | 2026 | bool Heap::VerifyHeapReferences(bool verify_referents) { |
Hiroshi Yamauchi | 1ed9061 | 2014-02-14 15:00:51 -0800 | [diff] [blame] | 2027 | Thread* self = Thread::Current(); |
| 2028 | Locks::mutator_lock_->AssertExclusiveHeld(self); |
Mathieu Chartier | fd678be | 2012-08-30 14:50:54 -0700 | [diff] [blame] | 2029 | // Lets sort our allocation stacks so that we can efficiently binary search them. |
Ian Rogers | 1d54e73 | 2013-05-02 21:10:01 -0700 | [diff] [blame] | 2030 | allocation_stack_->Sort(); |
| 2031 | live_stack_->Sort(); |
Hiroshi Yamauchi | 1ed9061 | 2014-02-14 15:00:51 -0800 | [diff] [blame] | 2032 | // Since we sorted the allocation stack content, need to revoke all |
| 2033 | // thread-local allocation stacks. |
| 2034 | RevokeAllThreadLocalAllocationStacks(self); |
Mathieu Chartier | 78f7b4c | 2014-05-06 10:57:27 -0700 | [diff] [blame] | 2035 | VerifyObjectVisitor visitor(this, verify_referents); |
Mathieu Chartier | 0f72e41 | 2013-09-06 16:40:01 -0700 | [diff] [blame] | 2036 | // Verify objects in the allocation stack since these will be objects which were: |
| 2037 | // 1. Allocated prior to the GC (pre GC verification). |
| 2038 | // 2. Allocated during the GC (pre sweep GC verification). |
Mathieu Chartier | 0f72e41 | 2013-09-06 16:40:01 -0700 | [diff] [blame] | 2039 | // We don't want to verify the objects in the live stack since they themselves may be |
Mathieu Chartier | fd678be | 2012-08-30 14:50:54 -0700 | [diff] [blame] | 2040 | // pointing to dead objects if they are not reachable. |
Mathieu Chartier | 590fee9 | 2013-09-13 13:46:47 -0700 | [diff] [blame] | 2041 | VisitObjects(VerifyObjectVisitor::VisitCallback, &visitor); |
| 2042 | // Verify the roots: |
Mathieu Chartier | 893263b | 2014-03-04 11:07:42 -0800 | [diff] [blame] | 2043 | Runtime::Current()->VisitRoots(VerifyReferenceVisitor::VerifyRoots, &visitor); |
Mathieu Chartier | fd678be | 2012-08-30 14:50:54 -0700 | [diff] [blame] | 2044 | if (visitor.Failed()) { |
Mathieu Chartier | 0f72e41 | 2013-09-06 16:40:01 -0700 | [diff] [blame] | 2045 | // Dump mod-union tables. |
Mathieu Chartier | 11409ae | 2013-09-23 11:49:36 -0700 | [diff] [blame] | 2046 | for (const auto& table_pair : mod_union_tables_) { |
| 2047 | accounting::ModUnionTable* mod_union_table = table_pair.second; |
| 2048 | mod_union_table->Dump(LOG(ERROR) << mod_union_table->GetName() << ": "); |
| 2049 | } |
Hiroshi Yamauchi | 38e68e9 | 2014-03-07 13:59:08 -0800 | [diff] [blame] | 2050 | // Dump remembered sets. |
| 2051 | for (const auto& table_pair : remembered_sets_) { |
| 2052 | accounting::RememberedSet* remembered_set = table_pair.second; |
| 2053 | remembered_set->Dump(LOG(ERROR) << remembered_set->GetName() << ": "); |
| 2054 | } |
Mathieu Chartier | fd678be | 2012-08-30 14:50:54 -0700 | [diff] [blame] | 2055 | DumpSpaces(); |
Mathieu Chartier | c7b83a0 | 2012-09-11 18:07:39 -0700 | [diff] [blame] | 2056 | return false; |
Mathieu Chartier | fd678be | 2012-08-30 14:50:54 -0700 | [diff] [blame] | 2057 | } |
Mathieu Chartier | c7b83a0 | 2012-09-11 18:07:39 -0700 | [diff] [blame] | 2058 | return true; |
| 2059 | } |
| 2060 | |
| 2061 | class VerifyReferenceCardVisitor { |
| 2062 | public: |
| 2063 | VerifyReferenceCardVisitor(Heap* heap, bool* failed) |
| 2064 | SHARED_LOCKS_REQUIRED(Locks::mutator_lock_, |
| 2065 | Locks::heap_bitmap_lock_) |
Ian Rogers | 1d54e73 | 2013-05-02 21:10:01 -0700 | [diff] [blame] | 2066 | : heap_(heap), failed_(failed) { |
Mathieu Chartier | c7b83a0 | 2012-09-11 18:07:39 -0700 | [diff] [blame] | 2067 | } |
| 2068 | |
Mathieu Chartier | 4da7f2f | 2012-11-13 12:51:01 -0800 | [diff] [blame] | 2069 | // TODO: Fix lock analysis to not use NO_THREAD_SAFETY_ANALYSIS, requires support for |
| 2070 | // annotalysis on visitors. |
Mathieu Chartier | 407f702 | 2014-02-18 14:37:05 -0800 | [diff] [blame] | 2071 | void operator()(mirror::Object* obj, MemberOffset offset, bool is_static) const |
| 2072 | NO_THREAD_SAFETY_ANALYSIS { |
Ian Rogers | b0fa5dc | 2014-04-28 16:47:08 -0700 | [diff] [blame] | 2073 | mirror::Object* ref = obj->GetFieldObject<mirror::Object>(offset); |
Mathieu Chartier | 4da7f2f | 2012-11-13 12:51:01 -0800 | [diff] [blame] | 2074 | // Filter out class references since changing an object's class does not mark the card as dirty. |
| 2075 | // Also handles large objects, since the only reference they hold is a class reference. |
Mathieu Chartier | 407f702 | 2014-02-18 14:37:05 -0800 | [diff] [blame] | 2076 | if (ref != nullptr && !ref->IsClass()) { |
Ian Rogers | 1d54e73 | 2013-05-02 21:10:01 -0700 | [diff] [blame] | 2077 | accounting::CardTable* card_table = heap_->GetCardTable(); |
Mathieu Chartier | c7b83a0 | 2012-09-11 18:07:39 -0700 | [diff] [blame] | 2078 | // If the object is not dirty and it is referencing something in the live stack other than |
| 2079 | // class, then it must be on a dirty card. |
Mathieu Chartier | 7469ebf | 2012-09-24 16:28:36 -0700 | [diff] [blame] | 2080 | if (!card_table->AddrIsInCardTable(obj)) { |
| 2081 | LOG(ERROR) << "Object " << obj << " is not in the address range of the card table"; |
| 2082 | *failed_ = true; |
Mathieu Chartier | 2b82db4 | 2012-11-14 17:29:05 -0800 | [diff] [blame] | 2083 | } else if (!card_table->IsDirty(obj)) { |
Mathieu Chartier | 938a03b | 2014-01-16 15:10:31 -0800 | [diff] [blame] | 2084 | // TODO: Check mod-union tables. |
Mathieu Chartier | 4da7f2f | 2012-11-13 12:51:01 -0800 | [diff] [blame] | 2085 | // Card should be either kCardDirty if it got re-dirtied after we aged it, or |
| 2086 | // kCardDirty - 1 if it didnt get touched since we aged it. |
Ian Rogers | 1d54e73 | 2013-05-02 21:10:01 -0700 | [diff] [blame] | 2087 | accounting::ObjectStack* live_stack = heap_->live_stack_.get(); |
Mathieu Chartier | 407f702 | 2014-02-18 14:37:05 -0800 | [diff] [blame] | 2088 | if (live_stack->ContainsSorted(ref)) { |
| 2089 | if (live_stack->ContainsSorted(obj)) { |
Mathieu Chartier | c7b83a0 | 2012-09-11 18:07:39 -0700 | [diff] [blame] | 2090 | LOG(ERROR) << "Object " << obj << " found in live stack"; |
| 2091 | } |
| 2092 | if (heap_->GetLiveBitmap()->Test(obj)) { |
| 2093 | LOG(ERROR) << "Object " << obj << " found in live bitmap"; |
| 2094 | } |
| 2095 | LOG(ERROR) << "Object " << obj << " " << PrettyTypeOf(obj) |
| 2096 | << " references " << ref << " " << PrettyTypeOf(ref) << " in live stack"; |
| 2097 | |
| 2098 | // Print which field of the object is dead. |
| 2099 | if (!obj->IsObjectArray()) { |
Ian Rogers | ef7d42f | 2014-01-06 12:55:46 -0800 | [diff] [blame] | 2100 | mirror::Class* klass = is_static ? obj->AsClass() : obj->GetClass(); |
Mathieu Chartier | c7b83a0 | 2012-09-11 18:07:39 -0700 | [diff] [blame] | 2101 | CHECK(klass != NULL); |
Ian Rogers | ef7d42f | 2014-01-06 12:55:46 -0800 | [diff] [blame] | 2102 | mirror::ObjectArray<mirror::ArtField>* fields = is_static ? klass->GetSFields() |
| 2103 | : klass->GetIFields(); |
Mathieu Chartier | c7b83a0 | 2012-09-11 18:07:39 -0700 | [diff] [blame] | 2104 | CHECK(fields != NULL); |
| 2105 | for (int32_t i = 0; i < fields->GetLength(); ++i) { |
Ian Rogers | ef7d42f | 2014-01-06 12:55:46 -0800 | [diff] [blame] | 2106 | mirror::ArtField* cur = fields->Get(i); |
Mathieu Chartier | c7b83a0 | 2012-09-11 18:07:39 -0700 | [diff] [blame] | 2107 | if (cur->GetOffset().Int32Value() == offset.Int32Value()) { |
| 2108 | LOG(ERROR) << (is_static ? "Static " : "") << "field in the live stack is " |
| 2109 | << PrettyField(cur); |
| 2110 | break; |
| 2111 | } |
| 2112 | } |
| 2113 | } else { |
Ian Rogers | ef7d42f | 2014-01-06 12:55:46 -0800 | [diff] [blame] | 2114 | mirror::ObjectArray<mirror::Object>* object_array = |
Ian Rogers | 2dd0e2c | 2013-01-24 12:42:14 -0800 | [diff] [blame] | 2115 | obj->AsObjectArray<mirror::Object>(); |
Mathieu Chartier | c7b83a0 | 2012-09-11 18:07:39 -0700 | [diff] [blame] | 2116 | for (int32_t i = 0; i < object_array->GetLength(); ++i) { |
| 2117 | if (object_array->Get(i) == ref) { |
| 2118 | LOG(ERROR) << (is_static ? "Static " : "") << "obj[" << i << "] = ref"; |
| 2119 | } |
| 2120 | } |
| 2121 | } |
| 2122 | |
| 2123 | *failed_ = true; |
| 2124 | } |
| 2125 | } |
| 2126 | } |
| 2127 | } |
| 2128 | |
| 2129 | private: |
Ian Rogers | 1d54e73 | 2013-05-02 21:10:01 -0700 | [diff] [blame] | 2130 | Heap* const heap_; |
| 2131 | bool* const failed_; |
Mathieu Chartier | c7b83a0 | 2012-09-11 18:07:39 -0700 | [diff] [blame] | 2132 | }; |
| 2133 | |
| 2134 | class VerifyLiveStackReferences { |
| 2135 | public: |
Brian Carlstrom | 93ba893 | 2013-07-17 21:31:49 -0700 | [diff] [blame] | 2136 | explicit VerifyLiveStackReferences(Heap* heap) |
Mathieu Chartier | c7b83a0 | 2012-09-11 18:07:39 -0700 | [diff] [blame] | 2137 | : heap_(heap), |
Brian Carlstrom | 93ba893 | 2013-07-17 21:31:49 -0700 | [diff] [blame] | 2138 | failed_(false) {} |
Mathieu Chartier | c7b83a0 | 2012-09-11 18:07:39 -0700 | [diff] [blame] | 2139 | |
Mathieu Chartier | 11409ae | 2013-09-23 11:49:36 -0700 | [diff] [blame] | 2140 | void operator()(mirror::Object* obj) const |
Mathieu Chartier | c7b83a0 | 2012-09-11 18:07:39 -0700 | [diff] [blame] | 2141 | SHARED_LOCKS_REQUIRED(Locks::mutator_lock_, Locks::heap_bitmap_lock_) { |
| 2142 | VerifyReferenceCardVisitor visitor(heap_, const_cast<bool*>(&failed_)); |
Ian Rogers | b0fa5dc | 2014-04-28 16:47:08 -0700 | [diff] [blame] | 2143 | obj->VisitReferences<true>(visitor, VoidFunctor()); |
Mathieu Chartier | c7b83a0 | 2012-09-11 18:07:39 -0700 | [diff] [blame] | 2144 | } |
| 2145 | |
| 2146 | bool Failed() const { |
| 2147 | return failed_; |
| 2148 | } |
| 2149 | |
| 2150 | private: |
Ian Rogers | 1d54e73 | 2013-05-02 21:10:01 -0700 | [diff] [blame] | 2151 | Heap* const heap_; |
Mathieu Chartier | c7b83a0 | 2012-09-11 18:07:39 -0700 | [diff] [blame] | 2152 | bool failed_; |
| 2153 | }; |
| 2154 | |
| 2155 | bool Heap::VerifyMissingCardMarks() { |
Hiroshi Yamauchi | 1ed9061 | 2014-02-14 15:00:51 -0800 | [diff] [blame] | 2156 | Thread* self = Thread::Current(); |
| 2157 | Locks::mutator_lock_->AssertExclusiveHeld(self); |
Mathieu Chartier | c7b83a0 | 2012-09-11 18:07:39 -0700 | [diff] [blame] | 2158 | |
Mathieu Chartier | 2b82db4 | 2012-11-14 17:29:05 -0800 | [diff] [blame] | 2159 | // We need to sort the live stack since we binary search it. |
Ian Rogers | 1d54e73 | 2013-05-02 21:10:01 -0700 | [diff] [blame] | 2160 | live_stack_->Sort(); |
Hiroshi Yamauchi | 1ed9061 | 2014-02-14 15:00:51 -0800 | [diff] [blame] | 2161 | // Since we sorted the allocation stack content, need to revoke all |
| 2162 | // thread-local allocation stacks. |
| 2163 | RevokeAllThreadLocalAllocationStacks(self); |
Mathieu Chartier | c7b83a0 | 2012-09-11 18:07:39 -0700 | [diff] [blame] | 2164 | VerifyLiveStackReferences visitor(this); |
| 2165 | GetLiveBitmap()->Visit(visitor); |
| 2166 | |
| 2167 | // We can verify objects in the live stack since none of these should reference dead objects. |
Ian Rogers | 2dd0e2c | 2013-01-24 12:42:14 -0800 | [diff] [blame] | 2168 | for (mirror::Object** it = live_stack_->Begin(); it != live_stack_->End(); ++it) { |
Hiroshi Yamauchi | f5b0e20 | 2014-02-11 17:02:22 -0800 | [diff] [blame] | 2169 | if (!kUseThreadLocalAllocationStack || *it != nullptr) { |
| 2170 | visitor(*it); |
| 2171 | } |
Mathieu Chartier | c7b83a0 | 2012-09-11 18:07:39 -0700 | [diff] [blame] | 2172 | } |
| 2173 | |
| 2174 | if (visitor.Failed()) { |
| 2175 | DumpSpaces(); |
| 2176 | return false; |
| 2177 | } |
| 2178 | return true; |
Mathieu Chartier | fd678be | 2012-08-30 14:50:54 -0700 | [diff] [blame] | 2179 | } |
| 2180 | |
Hiroshi Yamauchi | f5b0e20 | 2014-02-11 17:02:22 -0800 | [diff] [blame] | 2181 | void Heap::SwapStacks(Thread* self) { |
| 2182 | if (kUseThreadLocalAllocationStack) { |
| 2183 | live_stack_->AssertAllZero(); |
| 2184 | } |
Mathieu Chartier | d22d548 | 2012-11-06 17:14:12 -0800 | [diff] [blame] | 2185 | allocation_stack_.swap(live_stack_); |
Mathieu Chartier | c7b83a0 | 2012-09-11 18:07:39 -0700 | [diff] [blame] | 2186 | } |
| 2187 | |
Hiroshi Yamauchi | f5b0e20 | 2014-02-11 17:02:22 -0800 | [diff] [blame] | 2188 | void Heap::RevokeAllThreadLocalAllocationStacks(Thread* self) { |
Hiroshi Yamauchi | f5b0e20 | 2014-02-11 17:02:22 -0800 | [diff] [blame] | 2189 | // This must be called only during the pause. |
| 2190 | CHECK(Locks::mutator_lock_->IsExclusiveHeld(self)); |
| 2191 | MutexLock mu(self, *Locks::runtime_shutdown_lock_); |
| 2192 | MutexLock mu2(self, *Locks::thread_list_lock_); |
| 2193 | std::list<Thread*> thread_list = Runtime::Current()->GetThreadList()->GetList(); |
| 2194 | for (Thread* t : thread_list) { |
| 2195 | t->RevokeThreadLocalAllocationStack(); |
| 2196 | } |
| 2197 | } |
| 2198 | |
Hiroshi Yamauchi | c93c530 | 2014-03-20 16:15:37 -0700 | [diff] [blame] | 2199 | void Heap::AssertAllBumpPointerSpaceThreadLocalBuffersAreRevoked() { |
| 2200 | if (kIsDebugBuild) { |
| 2201 | if (bump_pointer_space_ != nullptr) { |
| 2202 | bump_pointer_space_->AssertAllThreadLocalBuffersAreRevoked(); |
| 2203 | } |
| 2204 | } |
| 2205 | } |
| 2206 | |
Mathieu Chartier | 11409ae | 2013-09-23 11:49:36 -0700 | [diff] [blame] | 2207 | accounting::ModUnionTable* Heap::FindModUnionTableFromSpace(space::Space* space) { |
| 2208 | auto it = mod_union_tables_.find(space); |
| 2209 | if (it == mod_union_tables_.end()) { |
| 2210 | return nullptr; |
| 2211 | } |
| 2212 | return it->second; |
| 2213 | } |
| 2214 | |
Hiroshi Yamauchi | 38e68e9 | 2014-03-07 13:59:08 -0800 | [diff] [blame] | 2215 | accounting::RememberedSet* Heap::FindRememberedSetFromSpace(space::Space* space) { |
| 2216 | auto it = remembered_sets_.find(space); |
| 2217 | if (it == remembered_sets_.end()) { |
| 2218 | return nullptr; |
| 2219 | } |
| 2220 | return it->second; |
| 2221 | } |
| 2222 | |
| 2223 | void Heap::ProcessCards(TimingLogger& timings, bool use_rem_sets) { |
Ian Rogers | 1d54e73 | 2013-05-02 21:10:01 -0700 | [diff] [blame] | 2224 | // Clear cards and keep track of cards cleared in the mod-union table. |
Mathieu Chartier | 02e2511 | 2013-08-14 16:14:24 -0700 | [diff] [blame] | 2225 | for (const auto& space : continuous_spaces_) { |
Mathieu Chartier | 11409ae | 2013-09-23 11:49:36 -0700 | [diff] [blame] | 2226 | accounting::ModUnionTable* table = FindModUnionTableFromSpace(space); |
Hiroshi Yamauchi | 38e68e9 | 2014-03-07 13:59:08 -0800 | [diff] [blame] | 2227 | accounting::RememberedSet* rem_set = FindRememberedSetFromSpace(space); |
Mathieu Chartier | 11409ae | 2013-09-23 11:49:36 -0700 | [diff] [blame] | 2228 | if (table != nullptr) { |
| 2229 | const char* name = space->IsZygoteSpace() ? "ZygoteModUnionClearCards" : |
| 2230 | "ImageModUnionClearCards"; |
Ian Rogers | 5fe9af7 | 2013-11-14 00:17:20 -0800 | [diff] [blame] | 2231 | TimingLogger::ScopedSplit split(name, &timings); |
Mathieu Chartier | 11409ae | 2013-09-23 11:49:36 -0700 | [diff] [blame] | 2232 | table->ClearCards(); |
Hiroshi Yamauchi | 38e68e9 | 2014-03-07 13:59:08 -0800 | [diff] [blame] | 2233 | } else if (use_rem_sets && rem_set != nullptr) { |
| 2234 | DCHECK(collector::SemiSpace::kUseRememberedSet && collector_type_ == kCollectorTypeGSS) |
| 2235 | << static_cast<int>(collector_type_); |
| 2236 | TimingLogger::ScopedSplit split("AllocSpaceRemSetClearCards", &timings); |
| 2237 | rem_set->ClearCards(); |
Mathieu Chartier | 590fee9 | 2013-09-13 13:46:47 -0700 | [diff] [blame] | 2238 | } else if (space->GetType() != space::kSpaceTypeBumpPointerSpace) { |
Ian Rogers | 5fe9af7 | 2013-11-14 00:17:20 -0800 | [diff] [blame] | 2239 | TimingLogger::ScopedSplit split("AllocSpaceClearCards", &timings); |
Mathieu Chartier | d22d548 | 2012-11-06 17:14:12 -0800 | [diff] [blame] | 2240 | // No mod union table for the AllocSpace. Age the cards so that the GC knows that these cards |
| 2241 | // were dirty before the GC started. |
Mathieu Chartier | bd0a653 | 2014-02-27 11:14:21 -0800 | [diff] [blame] | 2242 | // TODO: Need to use atomic for the case where aged(cleaning thread) -> dirty(other thread) |
| 2243 | // -> clean(cleaning thread). |
Mathieu Chartier | 590fee9 | 2013-09-13 13:46:47 -0700 | [diff] [blame] | 2244 | // The races are we either end up with: Aged card, unaged card. Since we have the checkpoint |
Mathieu Chartier | 938a03b | 2014-01-16 15:10:31 -0800 | [diff] [blame] | 2245 | // roots and then we scan / update mod union tables after. We will always scan either card. |
Mathieu Chartier | 590fee9 | 2013-09-13 13:46:47 -0700 | [diff] [blame] | 2246 | // If we end up with the non aged card, we scan it it in the pause. |
Mathieu Chartier | d22d548 | 2012-11-06 17:14:12 -0800 | [diff] [blame] | 2247 | card_table_->ModifyCardsAtomic(space->Begin(), space->End(), AgeCardVisitor(), VoidFunctor()); |
Mathieu Chartier | 7469ebf | 2012-09-24 16:28:36 -0700 | [diff] [blame] | 2248 | } |
| 2249 | } |
| 2250 | } |
| 2251 | |
Mathieu Chartier | 407f702 | 2014-02-18 14:37:05 -0800 | [diff] [blame] | 2252 | static void IdentityMarkHeapReferenceCallback(mirror::HeapReference<mirror::Object>*, void*) { |
Mathieu Chartier | 11409ae | 2013-09-23 11:49:36 -0700 | [diff] [blame] | 2253 | } |
| 2254 | |
Mathieu Chartier | 6f365cc | 2014-04-23 12:42:27 -0700 | [diff] [blame] | 2255 | void Heap::PreGcVerificationPaused(collector::GarbageCollector* gc) { |
| 2256 | Thread* const self = Thread::Current(); |
| 2257 | TimingLogger* const timings = &gc->GetTimings(); |
Mathieu Chartier | 2b82db4 | 2012-11-14 17:29:05 -0800 | [diff] [blame] | 2258 | if (verify_pre_gc_heap_) { |
Mathieu Chartier | 6f365cc | 2014-04-23 12:42:27 -0700 | [diff] [blame] | 2259 | TimingLogger::ScopedSplit split("PreGcVerifyHeapReferences", timings); |
| 2260 | ReaderMutexLock mu(self, *Locks::heap_bitmap_lock_); |
| 2261 | if (!VerifyHeapReferences()) { |
| 2262 | LOG(FATAL) << "Pre " << gc->GetName() << " heap verification failed"; |
Mathieu Chartier | 2b82db4 | 2012-11-14 17:29:05 -0800 | [diff] [blame] | 2263 | } |
Mathieu Chartier | 4da7f2f | 2012-11-13 12:51:01 -0800 | [diff] [blame] | 2264 | } |
Mathieu Chartier | 2b82db4 | 2012-11-14 17:29:05 -0800 | [diff] [blame] | 2265 | // Check that all objects which reference things in the live stack are on dirty cards. |
| 2266 | if (verify_missing_card_marks_) { |
Mathieu Chartier | 6f365cc | 2014-04-23 12:42:27 -0700 | [diff] [blame] | 2267 | TimingLogger::ScopedSplit split("PreGcVerifyMissingCardMarks", timings); |
| 2268 | ReaderMutexLock mu(self, *Locks::heap_bitmap_lock_); |
| 2269 | SwapStacks(self); |
| 2270 | // Sort the live stack so that we can quickly binary search it later. |
| 2271 | if (!VerifyMissingCardMarks()) { |
| 2272 | LOG(FATAL) << "Pre " << gc->GetName() << " missing card mark verification failed"; |
Mathieu Chartier | 2b82db4 | 2012-11-14 17:29:05 -0800 | [diff] [blame] | 2273 | } |
Mathieu Chartier | 6f365cc | 2014-04-23 12:42:27 -0700 | [diff] [blame] | 2274 | SwapStacks(self); |
Mathieu Chartier | 2b82db4 | 2012-11-14 17:29:05 -0800 | [diff] [blame] | 2275 | } |
Mathieu Chartier | 2b82db4 | 2012-11-14 17:29:05 -0800 | [diff] [blame] | 2276 | if (verify_mod_union_table_) { |
Mathieu Chartier | 6f365cc | 2014-04-23 12:42:27 -0700 | [diff] [blame] | 2277 | TimingLogger::ScopedSplit split("PreGcVerifyModUnionTables", timings); |
Mathieu Chartier | 2b82db4 | 2012-11-14 17:29:05 -0800 | [diff] [blame] | 2278 | ReaderMutexLock reader_lock(self, *Locks::heap_bitmap_lock_); |
Mathieu Chartier | 11409ae | 2013-09-23 11:49:36 -0700 | [diff] [blame] | 2279 | for (const auto& table_pair : mod_union_tables_) { |
| 2280 | accounting::ModUnionTable* mod_union_table = table_pair.second; |
Mathieu Chartier | 407f702 | 2014-02-18 14:37:05 -0800 | [diff] [blame] | 2281 | mod_union_table->UpdateAndMarkReferences(IdentityMarkHeapReferenceCallback, nullptr); |
Mathieu Chartier | 11409ae | 2013-09-23 11:49:36 -0700 | [diff] [blame] | 2282 | mod_union_table->Verify(); |
| 2283 | } |
Mathieu Chartier | 6f365cc | 2014-04-23 12:42:27 -0700 | [diff] [blame] | 2284 | } |
| 2285 | } |
| 2286 | |
| 2287 | void Heap::PreGcVerification(collector::GarbageCollector* gc) { |
Mathieu Chartier | 0651d41 | 2014-04-29 14:37:57 -0700 | [diff] [blame] | 2288 | if (verify_pre_gc_heap_ || verify_missing_card_marks_ || verify_mod_union_table_) { |
Mathieu Chartier | 6f365cc | 2014-04-23 12:42:27 -0700 | [diff] [blame] | 2289 | collector::GarbageCollector::ScopedPause pause(gc); |
| 2290 | PreGcVerificationPaused(gc); |
| 2291 | } |
| 2292 | } |
| 2293 | |
| 2294 | void Heap::PrePauseRosAllocVerification(collector::GarbageCollector* gc) { |
| 2295 | // TODO: Add a new runtime option for this? |
| 2296 | if (verify_pre_gc_rosalloc_) { |
| 2297 | RosAllocVerification(&gc->GetTimings(), "PreGcRosAllocVerification"); |
Mathieu Chartier | 2b82db4 | 2012-11-14 17:29:05 -0800 | [diff] [blame] | 2298 | } |
Mathieu Chartier | 4da7f2f | 2012-11-13 12:51:01 -0800 | [diff] [blame] | 2299 | } |
| 2300 | |
Ian Rogers | 1d54e73 | 2013-05-02 21:10:01 -0700 | [diff] [blame] | 2301 | void Heap::PreSweepingGcVerification(collector::GarbageCollector* gc) { |
Mathieu Chartier | 6f365cc | 2014-04-23 12:42:27 -0700 | [diff] [blame] | 2302 | Thread* const self = Thread::Current(); |
| 2303 | TimingLogger* const timings = &gc->GetTimings(); |
Mathieu Chartier | 2b82db4 | 2012-11-14 17:29:05 -0800 | [diff] [blame] | 2304 | // Called before sweeping occurs since we want to make sure we are not going so reclaim any |
| 2305 | // reachable objects. |
Mathieu Chartier | 6f365cc | 2014-04-23 12:42:27 -0700 | [diff] [blame] | 2306 | if (verify_pre_sweeping_heap_) { |
| 2307 | TimingLogger::ScopedSplit split("PostSweepingVerifyHeapReferences", timings); |
Ian Rogers | 1d54e73 | 2013-05-02 21:10:01 -0700 | [diff] [blame] | 2308 | CHECK_NE(self->GetState(), kRunnable); |
Mathieu Chartier | 6f365cc | 2014-04-23 12:42:27 -0700 | [diff] [blame] | 2309 | WriterMutexLock mu(self, *Locks::heap_bitmap_lock_); |
| 2310 | // Swapping bound bitmaps does nothing. |
| 2311 | gc->SwapBitmaps(); |
| 2312 | SwapSemiSpaces(); |
Mathieu Chartier | 78f7b4c | 2014-05-06 10:57:27 -0700 | [diff] [blame] | 2313 | // Pass in false since concurrent reference processing can mean that the reference referents |
| 2314 | // may point to dead objects at the point which PreSweepingGcVerification is called. |
| 2315 | if (!VerifyHeapReferences(false)) { |
Mathieu Chartier | 6f365cc | 2014-04-23 12:42:27 -0700 | [diff] [blame] | 2316 | LOG(FATAL) << "Pre sweeping " << gc->GetName() << " GC verification failed"; |
| 2317 | } |
| 2318 | SwapSemiSpaces(); |
| 2319 | gc->SwapBitmaps(); |
| 2320 | } |
| 2321 | if (verify_pre_sweeping_rosalloc_) { |
| 2322 | RosAllocVerification(timings, "PreSweepingRosAllocVerification"); |
| 2323 | } |
| 2324 | } |
| 2325 | |
| 2326 | void Heap::PostGcVerificationPaused(collector::GarbageCollector* gc) { |
| 2327 | // Only pause if we have to do some verification. |
| 2328 | Thread* const self = Thread::Current(); |
| 2329 | TimingLogger* const timings = &gc->GetTimings(); |
| 2330 | if (verify_system_weaks_) { |
| 2331 | ReaderMutexLock mu2(self, *Locks::heap_bitmap_lock_); |
| 2332 | collector::MarkSweep* mark_sweep = down_cast<collector::MarkSweep*>(gc); |
| 2333 | mark_sweep->VerifySystemWeaks(); |
| 2334 | } |
| 2335 | if (verify_post_gc_rosalloc_) { |
| 2336 | RosAllocVerification(timings, "PostGcRosAllocVerification"); |
| 2337 | } |
| 2338 | if (verify_post_gc_heap_) { |
| 2339 | TimingLogger::ScopedSplit split("PostGcVerifyHeapReferences", timings); |
| 2340 | ReaderMutexLock mu(self, *Locks::heap_bitmap_lock_); |
| 2341 | if (!VerifyHeapReferences()) { |
| 2342 | LOG(FATAL) << "Pre " << gc->GetName() << " heap verification failed"; |
Ian Rogers | 00f7d0e | 2012-07-19 15:28:27 -0700 | [diff] [blame] | 2343 | } |
Ian Rogers | 00f7d0e | 2012-07-19 15:28:27 -0700 | [diff] [blame] | 2344 | } |
Mathieu Chartier | 2b82db4 | 2012-11-14 17:29:05 -0800 | [diff] [blame] | 2345 | } |
Ian Rogers | 00f7d0e | 2012-07-19 15:28:27 -0700 | [diff] [blame] | 2346 | |
Ian Rogers | 1d54e73 | 2013-05-02 21:10:01 -0700 | [diff] [blame] | 2347 | void Heap::PostGcVerification(collector::GarbageCollector* gc) { |
Mathieu Chartier | 6f365cc | 2014-04-23 12:42:27 -0700 | [diff] [blame] | 2348 | if (verify_system_weaks_ || verify_post_gc_rosalloc_ || verify_post_gc_heap_) { |
| 2349 | collector::GarbageCollector::ScopedPause pause(gc); |
| 2350 | PreGcVerificationPaused(gc); |
Ian Rogers | 00f7d0e | 2012-07-19 15:28:27 -0700 | [diff] [blame] | 2351 | } |
Carl Shapiro | 69759ea | 2011-07-21 18:13:35 -0700 | [diff] [blame] | 2352 | } |
| 2353 | |
Mathieu Chartier | 6f365cc | 2014-04-23 12:42:27 -0700 | [diff] [blame] | 2354 | void Heap::RosAllocVerification(TimingLogger* timings, const char* name) { |
| 2355 | TimingLogger::ScopedSplit split(name, timings); |
| 2356 | for (const auto& space : continuous_spaces_) { |
| 2357 | if (space->IsRosAllocSpace()) { |
| 2358 | VLOG(heap) << name << " : " << space->GetName(); |
| 2359 | space->AsRosAllocSpace()->Verify(); |
Hiroshi Yamauchi | a4adbfd | 2014-02-04 18:12:17 -0800 | [diff] [blame] | 2360 | } |
| 2361 | } |
| 2362 | } |
| 2363 | |
Mathieu Chartier | 89a201e | 2014-05-02 10:27:26 -0700 | [diff] [blame] | 2364 | collector::GcType Heap::WaitForGcToComplete(GcCause cause, Thread* self) { |
Mathieu Chartier | caa82d6 | 2014-02-02 16:51:17 -0800 | [diff] [blame] | 2365 | ScopedThreadStateChange tsc(self, kWaitingForGcToComplete); |
Mathieu Chartier | 590fee9 | 2013-09-13 13:46:47 -0700 | [diff] [blame] | 2366 | MutexLock mu(self, *gc_complete_lock_); |
Mathieu Chartier | 89a201e | 2014-05-02 10:27:26 -0700 | [diff] [blame] | 2367 | return WaitForGcToCompleteLocked(cause, self); |
Mathieu Chartier | 590fee9 | 2013-09-13 13:46:47 -0700 | [diff] [blame] | 2368 | } |
| 2369 | |
Mathieu Chartier | 89a201e | 2014-05-02 10:27:26 -0700 | [diff] [blame] | 2370 | collector::GcType Heap::WaitForGcToCompleteLocked(GcCause cause, Thread* self) { |
Ian Rogers | 1d54e73 | 2013-05-02 21:10:01 -0700 | [diff] [blame] | 2371 | collector::GcType last_gc_type = collector::kGcTypeNone; |
Mathieu Chartier | 590fee9 | 2013-09-13 13:46:47 -0700 | [diff] [blame] | 2372 | uint64_t wait_start = NanoTime(); |
Mathieu Chartier | d5a89ee | 2014-01-31 09:55:13 -0800 | [diff] [blame] | 2373 | while (collector_type_running_ != kCollectorTypeNone) { |
Mathieu Chartier | 590fee9 | 2013-09-13 13:46:47 -0700 | [diff] [blame] | 2374 | ATRACE_BEGIN("GC: Wait For Completion"); |
| 2375 | // We must wait, change thread state then sleep on gc_complete_cond_; |
| 2376 | gc_complete_cond_->Wait(self); |
| 2377 | last_gc_type = last_gc_type_; |
Mathieu Chartier | 752a0e6 | 2013-06-27 11:03:27 -0700 | [diff] [blame] | 2378 | ATRACE_END(); |
Mathieu Chartier | 7664f5c | 2012-06-08 18:15:32 -0700 | [diff] [blame] | 2379 | } |
Mathieu Chartier | 590fee9 | 2013-09-13 13:46:47 -0700 | [diff] [blame] | 2380 | uint64_t wait_time = NanoTime() - wait_start; |
| 2381 | total_wait_time_ += wait_time; |
| 2382 | if (wait_time > long_pause_log_threshold_) { |
Mathieu Chartier | 89a201e | 2014-05-02 10:27:26 -0700 | [diff] [blame] | 2383 | LOG(INFO) << "WaitForGcToComplete blocked for " << PrettyDuration(wait_time) |
| 2384 | << " for cause " << cause; |
Mathieu Chartier | 590fee9 | 2013-09-13 13:46:47 -0700 | [diff] [blame] | 2385 | } |
Mathieu Chartier | 866fb2a | 2012-09-10 10:47:49 -0700 | [diff] [blame] | 2386 | return last_gc_type; |
Carl Shapiro | 69759ea | 2011-07-21 18:13:35 -0700 | [diff] [blame] | 2387 | } |
| 2388 | |
Elliott Hughes | c967f78 | 2012-04-16 10:23:15 -0700 | [diff] [blame] | 2389 | void Heap::DumpForSigQuit(std::ostream& os) { |
Ian Rogers | 1d54e73 | 2013-05-02 21:10:01 -0700 | [diff] [blame] | 2390 | os << "Heap: " << GetPercentFree() << "% free, " << PrettySize(GetBytesAllocated()) << "/" |
Mathieu Chartier | 2fde533 | 2012-09-14 14:51:54 -0700 | [diff] [blame] | 2391 | << PrettySize(GetTotalMemory()) << "; " << GetObjectsAllocated() << " objects\n"; |
Elliott Hughes | 8b788fe | 2013-04-17 15:57:01 -0700 | [diff] [blame] | 2392 | DumpGcPerformanceInfo(os); |
Elliott Hughes | c967f78 | 2012-04-16 10:23:15 -0700 | [diff] [blame] | 2393 | } |
| 2394 | |
| 2395 | size_t Heap::GetPercentFree() { |
Mathieu Chartier | 2fde533 | 2012-09-14 14:51:54 -0700 | [diff] [blame] | 2396 | return static_cast<size_t>(100.0f * static_cast<float>(GetFreeMemory()) / GetTotalMemory()); |
Elliott Hughes | c967f78 | 2012-04-16 10:23:15 -0700 | [diff] [blame] | 2397 | } |
| 2398 | |
Elliott Hughes | 4dd9b4d | 2011-12-12 18:29:24 -0800 | [diff] [blame] | 2399 | void Heap::SetIdealFootprint(size_t max_allowed_footprint) { |
Mathieu Chartier | 2fde533 | 2012-09-14 14:51:54 -0700 | [diff] [blame] | 2400 | if (max_allowed_footprint > GetMaxMemory()) { |
Mathieu Chartier | fd678be | 2012-08-30 14:50:54 -0700 | [diff] [blame] | 2401 | VLOG(gc) << "Clamp target GC heap from " << PrettySize(max_allowed_footprint) << " to " |
Mathieu Chartier | 2fde533 | 2012-09-14 14:51:54 -0700 | [diff] [blame] | 2402 | << PrettySize(GetMaxMemory()); |
| 2403 | max_allowed_footprint = GetMaxMemory(); |
| 2404 | } |
Mathieu Chartier | 1c23e1e | 2012-10-12 14:14:11 -0700 | [diff] [blame] | 2405 | max_allowed_footprint_ = max_allowed_footprint; |
Shih-wei Liao | 8c2f641 | 2011-10-03 22:58:14 -0700 | [diff] [blame] | 2406 | } |
| 2407 | |
Mathieu Chartier | 590fee9 | 2013-09-13 13:46:47 -0700 | [diff] [blame] | 2408 | bool Heap::IsMovableObject(const mirror::Object* obj) const { |
| 2409 | if (kMovingCollector) { |
Mathieu Chartier | 31f4414 | 2014-04-08 14:40:03 -0700 | [diff] [blame] | 2410 | space::Space* space = FindContinuousSpaceFromObject(obj, true); |
| 2411 | if (space != nullptr) { |
| 2412 | // TODO: Check large object? |
| 2413 | return space->CanMoveObjects(); |
Mathieu Chartier | 590fee9 | 2013-09-13 13:46:47 -0700 | [diff] [blame] | 2414 | } |
Mathieu Chartier | 590fee9 | 2013-09-13 13:46:47 -0700 | [diff] [blame] | 2415 | } |
| 2416 | return false; |
| 2417 | } |
| 2418 | |
Mathieu Chartier | 987ccff | 2013-07-08 11:05:21 -0700 | [diff] [blame] | 2419 | void Heap::UpdateMaxNativeFootprint() { |
| 2420 | size_t native_size = native_bytes_allocated_; |
| 2421 | // TODO: Tune the native heap utilization to be a value other than the java heap utilization. |
| 2422 | size_t target_size = native_size / GetTargetHeapUtilization(); |
| 2423 | if (target_size > native_size + max_free_) { |
| 2424 | target_size = native_size + max_free_; |
| 2425 | } else if (target_size < native_size + min_free_) { |
| 2426 | target_size = native_size + min_free_; |
| 2427 | } |
| 2428 | native_footprint_gc_watermark_ = target_size; |
| 2429 | native_footprint_limit_ = 2 * target_size - native_size; |
| 2430 | } |
| 2431 | |
Mathieu Chartier | afe4998 | 2014-03-27 10:55:04 -0700 | [diff] [blame] | 2432 | collector::GarbageCollector* Heap::FindCollectorByGcType(collector::GcType gc_type) { |
| 2433 | for (const auto& collector : garbage_collectors_) { |
| 2434 | if (collector->GetCollectorType() == collector_type_ && |
| 2435 | collector->GetGcType() == gc_type) { |
| 2436 | return collector; |
| 2437 | } |
| 2438 | } |
| 2439 | return nullptr; |
| 2440 | } |
| 2441 | |
Mathieu Chartier | 2f8da3e | 2014-04-15 15:37:02 -0700 | [diff] [blame] | 2442 | double Heap::HeapGrowthMultiplier() const { |
| 2443 | // If we don't care about pause times we are background, so return 1.0. |
| 2444 | if (!CareAboutPauseTimes() || IsLowMemoryMode()) { |
| 2445 | return 1.0; |
| 2446 | } |
| 2447 | return foreground_heap_growth_multiplier_; |
| 2448 | } |
| 2449 | |
Mathieu Chartier | afe4998 | 2014-03-27 10:55:04 -0700 | [diff] [blame] | 2450 | void Heap::GrowForUtilization(collector::GarbageCollector* collector_ran) { |
Mathieu Chartier | 2fde533 | 2012-09-14 14:51:54 -0700 | [diff] [blame] | 2451 | // We know what our utilization is at this moment. |
| 2452 | // This doesn't actually resize any memory. It just lets the heap grow more when necessary. |
Mathieu Chartier | 2f8da3e | 2014-04-15 15:37:02 -0700 | [diff] [blame] | 2453 | const uint64_t bytes_allocated = GetBytesAllocated(); |
Mathieu Chartier | 65db880 | 2012-11-20 12:36:46 -0800 | [diff] [blame] | 2454 | last_gc_size_ = bytes_allocated; |
Ian Rogers | 1d54e73 | 2013-05-02 21:10:01 -0700 | [diff] [blame] | 2455 | last_gc_time_ns_ = NanoTime(); |
Mathieu Chartier | 2f8da3e | 2014-04-15 15:37:02 -0700 | [diff] [blame] | 2456 | uint64_t target_size; |
Mathieu Chartier | afe4998 | 2014-03-27 10:55:04 -0700 | [diff] [blame] | 2457 | collector::GcType gc_type = collector_ran->GetGcType(); |
Mathieu Chartier | bdd0fb9 | 2013-07-02 10:16:15 -0700 | [diff] [blame] | 2458 | if (gc_type != collector::kGcTypeSticky) { |
| 2459 | // Grow the heap for non sticky GC. |
Mathieu Chartier | 2f8da3e | 2014-04-15 15:37:02 -0700 | [diff] [blame] | 2460 | const float multiplier = HeapGrowthMultiplier(); // Use the multiplier to grow more for |
| 2461 | // foreground. |
| 2462 | intptr_t delta = bytes_allocated / GetTargetHeapUtilization() - bytes_allocated; |
| 2463 | CHECK_GE(delta, 0); |
| 2464 | target_size = bytes_allocated + delta * multiplier; |
| 2465 | target_size = std::min(target_size, |
| 2466 | bytes_allocated + static_cast<uint64_t>(max_free_ * multiplier)); |
| 2467 | target_size = std::max(target_size, |
| 2468 | bytes_allocated + static_cast<uint64_t>(min_free_ * multiplier)); |
Mathieu Chartier | 590fee9 | 2013-09-13 13:46:47 -0700 | [diff] [blame] | 2469 | native_need_to_run_finalization_ = true; |
Mathieu Chartier | bdd0fb9 | 2013-07-02 10:16:15 -0700 | [diff] [blame] | 2470 | next_gc_type_ = collector::kGcTypeSticky; |
| 2471 | } else { |
Mathieu Chartier | afe4998 | 2014-03-27 10:55:04 -0700 | [diff] [blame] | 2472 | collector::GcType non_sticky_gc_type = |
| 2473 | have_zygote_space_ ? collector::kGcTypePartial : collector::kGcTypeFull; |
| 2474 | // Find what the next non sticky collector will be. |
| 2475 | collector::GarbageCollector* non_sticky_collector = FindCollectorByGcType(non_sticky_gc_type); |
| 2476 | // If the throughput of the current sticky GC >= throughput of the non sticky collector, then |
| 2477 | // do another sticky collection next. |
| 2478 | // We also check that the bytes allocated aren't over the footprint limit in order to prevent a |
| 2479 | // pathological case where dead objects which aren't reclaimed by sticky could get accumulated |
| 2480 | // if the sticky GC throughput always remained >= the full/partial throughput. |
Mathieu Chartier | df86d1f | 2014-04-08 13:44:04 -0700 | [diff] [blame] | 2481 | if (collector_ran->GetEstimatedLastIterationThroughput() * kStickyGcThroughputAdjustment >= |
Mathieu Chartier | afe4998 | 2014-03-27 10:55:04 -0700 | [diff] [blame] | 2482 | non_sticky_collector->GetEstimatedMeanThroughput() && |
| 2483 | non_sticky_collector->GetIterations() > 0 && |
| 2484 | bytes_allocated <= max_allowed_footprint_) { |
Mathieu Chartier | bdd0fb9 | 2013-07-02 10:16:15 -0700 | [diff] [blame] | 2485 | next_gc_type_ = collector::kGcTypeSticky; |
| 2486 | } else { |
Mathieu Chartier | afe4998 | 2014-03-27 10:55:04 -0700 | [diff] [blame] | 2487 | next_gc_type_ = non_sticky_gc_type; |
Mathieu Chartier | bdd0fb9 | 2013-07-02 10:16:15 -0700 | [diff] [blame] | 2488 | } |
Mathieu Chartier | bdd0fb9 | 2013-07-02 10:16:15 -0700 | [diff] [blame] | 2489 | // If we have freed enough memory, shrink the heap back down. |
| 2490 | if (bytes_allocated + max_free_ < max_allowed_footprint_) { |
| 2491 | target_size = bytes_allocated + max_free_; |
| 2492 | } else { |
Mathieu Chartier | 2f8da3e | 2014-04-15 15:37:02 -0700 | [diff] [blame] | 2493 | target_size = std::max(bytes_allocated, static_cast<uint64_t>(max_allowed_footprint_)); |
Mathieu Chartier | bdd0fb9 | 2013-07-02 10:16:15 -0700 | [diff] [blame] | 2494 | } |
| 2495 | } |
Mathieu Chartier | 2775ee4 | 2013-08-20 17:43:47 -0700 | [diff] [blame] | 2496 | if (!ignore_max_footprint_) { |
| 2497 | SetIdealFootprint(target_size); |
Hiroshi Yamauchi | 3e41780 | 2014-03-20 12:03:02 -0700 | [diff] [blame] | 2498 | if (IsGcConcurrent()) { |
Mathieu Chartier | 2775ee4 | 2013-08-20 17:43:47 -0700 | [diff] [blame] | 2499 | // Calculate when to perform the next ConcurrentGC. |
Mathieu Chartier | 2775ee4 | 2013-08-20 17:43:47 -0700 | [diff] [blame] | 2500 | // Calculate the estimated GC duration. |
Mathieu Chartier | afe4998 | 2014-03-27 10:55:04 -0700 | [diff] [blame] | 2501 | const double gc_duration_seconds = NsToMs(collector_ran->GetDurationNs()) / 1000.0; |
Mathieu Chartier | 2775ee4 | 2013-08-20 17:43:47 -0700 | [diff] [blame] | 2502 | // Estimate how many remaining bytes we will have when we need to start the next GC. |
| 2503 | size_t remaining_bytes = allocation_rate_ * gc_duration_seconds; |
Mathieu Chartier | 7476280 | 2014-01-24 10:21:35 -0800 | [diff] [blame] | 2504 | remaining_bytes = std::min(remaining_bytes, kMaxConcurrentRemainingBytes); |
Mathieu Chartier | 2775ee4 | 2013-08-20 17:43:47 -0700 | [diff] [blame] | 2505 | remaining_bytes = std::max(remaining_bytes, kMinConcurrentRemainingBytes); |
| 2506 | if (UNLIKELY(remaining_bytes > max_allowed_footprint_)) { |
| 2507 | // A never going to happen situation that from the estimated allocation rate we will exceed |
| 2508 | // the applications entire footprint with the given estimated allocation rate. Schedule |
Mathieu Chartier | 7476280 | 2014-01-24 10:21:35 -0800 | [diff] [blame] | 2509 | // another GC nearly straight away. |
| 2510 | remaining_bytes = kMinConcurrentRemainingBytes; |
Mathieu Chartier | 2775ee4 | 2013-08-20 17:43:47 -0700 | [diff] [blame] | 2511 | } |
Mathieu Chartier | 7476280 | 2014-01-24 10:21:35 -0800 | [diff] [blame] | 2512 | DCHECK_LE(remaining_bytes, max_allowed_footprint_); |
Mathieu Chartier | 2775ee4 | 2013-08-20 17:43:47 -0700 | [diff] [blame] | 2513 | DCHECK_LE(max_allowed_footprint_, growth_limit_); |
Mathieu Chartier | 7476280 | 2014-01-24 10:21:35 -0800 | [diff] [blame] | 2514 | // Start a concurrent GC when we get close to the estimated remaining bytes. When the |
| 2515 | // allocation rate is very high, remaining_bytes could tell us that we should start a GC |
| 2516 | // right away. |
Mathieu Chartier | 2f8da3e | 2014-04-15 15:37:02 -0700 | [diff] [blame] | 2517 | concurrent_start_bytes_ = std::max(max_allowed_footprint_ - remaining_bytes, |
| 2518 | static_cast<size_t>(bytes_allocated)); |
Mathieu Chartier | 65db880 | 2012-11-20 12:36:46 -0800 | [diff] [blame] | 2519 | } |
Mathieu Chartier | 65db880 | 2012-11-20 12:36:46 -0800 | [diff] [blame] | 2520 | } |
Carl Shapiro | 69759ea | 2011-07-21 18:13:35 -0700 | [diff] [blame] | 2521 | } |
| 2522 | |
jeffhao | c116070 | 2011-10-27 15:48:45 -0700 | [diff] [blame] | 2523 | void Heap::ClearGrowthLimit() { |
Mathieu Chartier | 80de7a6 | 2012-11-27 17:21:50 -0800 | [diff] [blame] | 2524 | growth_limit_ = capacity_; |
Mathieu Chartier | 590fee9 | 2013-09-13 13:46:47 -0700 | [diff] [blame] | 2525 | non_moving_space_->ClearGrowthLimit(); |
jeffhao | c116070 | 2011-10-27 15:48:45 -0700 | [diff] [blame] | 2526 | } |
| 2527 | |
Mathieu Chartier | 8668c3c | 2014-04-24 16:48:11 -0700 | [diff] [blame] | 2528 | void Heap::AddFinalizerReference(Thread* self, mirror::Object** object) { |
Ian Rogers | 00f7d0e | 2012-07-19 15:28:27 -0700 | [diff] [blame] | 2529 | ScopedObjectAccess soa(self); |
Mathieu Chartier | 8668c3c | 2014-04-24 16:48:11 -0700 | [diff] [blame] | 2530 | ScopedLocalRef<jobject> arg(self->GetJniEnv(), soa.AddLocalReference<jobject>(*object)); |
Ian Rogers | 53b8b09 | 2014-03-13 23:45:53 -0700 | [diff] [blame] | 2531 | jvalue args[1]; |
| 2532 | args[0].l = arg.get(); |
| 2533 | InvokeWithJValues(soa, nullptr, WellKnownClasses::java_lang_ref_FinalizerReference_add, args); |
Mathieu Chartier | 8668c3c | 2014-04-24 16:48:11 -0700 | [diff] [blame] | 2534 | // Restore object in case it gets moved. |
| 2535 | *object = soa.Decode<mirror::Object*>(arg.get()); |
Ian Rogers | 00f7d0e | 2012-07-19 15:28:27 -0700 | [diff] [blame] | 2536 | } |
| 2537 | |
Ian Rogers | 1f53934 | 2012-10-03 21:09:42 -0700 | [diff] [blame] | 2538 | void Heap::RequestConcurrentGC(Thread* self) { |
Mathieu Chartier | 069387a | 2012-06-18 12:01:01 -0700 | [diff] [blame] | 2539 | // Make sure that we can do a concurrent GC. |
Ian Rogers | 120f1c7 | 2012-09-28 17:17:10 -0700 | [diff] [blame] | 2540 | Runtime* runtime = Runtime::Current(); |
Mathieu Chartier | 78f7b4c | 2014-05-06 10:57:27 -0700 | [diff] [blame] | 2541 | if (runtime == nullptr || !runtime->IsFinishedStarting() || runtime->IsShuttingDown(self) || |
Mathieu Chartier | 590fee9 | 2013-09-13 13:46:47 -0700 | [diff] [blame] | 2542 | self->IsHandlingStackOverflow()) { |
Ian Rogers | 120f1c7 | 2012-09-28 17:17:10 -0700 | [diff] [blame] | 2543 | return; |
| 2544 | } |
Mathieu Chartier | 987ccff | 2013-07-08 11:05:21 -0700 | [diff] [blame] | 2545 | // We already have a request pending, no reason to start more until we update |
| 2546 | // concurrent_start_bytes_. |
| 2547 | concurrent_start_bytes_ = std::numeric_limits<size_t>::max(); |
Ian Rogers | 120f1c7 | 2012-09-28 17:17:10 -0700 | [diff] [blame] | 2548 | JNIEnv* env = self->GetJniEnv(); |
Mathieu Chartier | 590fee9 | 2013-09-13 13:46:47 -0700 | [diff] [blame] | 2549 | DCHECK(WellKnownClasses::java_lang_Daemons != nullptr); |
| 2550 | DCHECK(WellKnownClasses::java_lang_Daemons_requestGC != nullptr); |
Ian Rogers | 00f7d0e | 2012-07-19 15:28:27 -0700 | [diff] [blame] | 2551 | env->CallStaticVoidMethod(WellKnownClasses::java_lang_Daemons, |
| 2552 | WellKnownClasses::java_lang_Daemons_requestGC); |
Mathieu Chartier | 7664f5c | 2012-06-08 18:15:32 -0700 | [diff] [blame] | 2553 | CHECK(!env->ExceptionCheck()); |
Mathieu Chartier | 7664f5c | 2012-06-08 18:15:32 -0700 | [diff] [blame] | 2554 | } |
| 2555 | |
Ian Rogers | 81d425b | 2012-09-27 16:03:43 -0700 | [diff] [blame] | 2556 | void Heap::ConcurrentGC(Thread* self) { |
Mathieu Chartier | 590fee9 | 2013-09-13 13:46:47 -0700 | [diff] [blame] | 2557 | if (Runtime::Current()->IsShuttingDown(self)) { |
| 2558 | return; |
Mathieu Chartier | 2542d66 | 2012-06-21 17:14:11 -0700 | [diff] [blame] | 2559 | } |
Mathieu Chartier | 65db880 | 2012-11-20 12:36:46 -0800 | [diff] [blame] | 2560 | // Wait for any GCs currently running to finish. |
Mathieu Chartier | 89a201e | 2014-05-02 10:27:26 -0700 | [diff] [blame] | 2561 | if (WaitForGcToComplete(kGcCauseBackground, self) == collector::kGcTypeNone) { |
Mathieu Chartier | f9ed0d3 | 2013-11-21 16:42:47 -0800 | [diff] [blame] | 2562 | // If the we can't run the GC type we wanted to run, find the next appropriate one and try that |
| 2563 | // instead. E.g. can't do partial, so do full instead. |
| 2564 | if (CollectGarbageInternal(next_gc_type_, kGcCauseBackground, false) == |
| 2565 | collector::kGcTypeNone) { |
| 2566 | for (collector::GcType gc_type : gc_plan_) { |
| 2567 | // Attempt to run the collector, if we succeed, we are done. |
| 2568 | if (gc_type > next_gc_type_ && |
| 2569 | CollectGarbageInternal(gc_type, kGcCauseBackground, false) != collector::kGcTypeNone) { |
| 2570 | break; |
| 2571 | } |
| 2572 | } |
| 2573 | } |
Mathieu Chartier | cc236d7 | 2012-07-20 10:29:05 -0700 | [diff] [blame] | 2574 | } |
Mathieu Chartier | 7664f5c | 2012-06-08 18:15:32 -0700 | [diff] [blame] | 2575 | } |
| 2576 | |
Mathieu Chartier | 7bf52d2 | 2014-03-13 14:46:09 -0700 | [diff] [blame] | 2577 | void Heap::RequestCollectorTransition(CollectorType desired_collector_type, uint64_t delta_time) { |
Mathieu Chartier | a5f9de0 | 2014-02-28 16:48:42 -0800 | [diff] [blame] | 2578 | Thread* self = Thread::Current(); |
| 2579 | { |
| 2580 | MutexLock mu(self, *heap_trim_request_lock_); |
| 2581 | if (desired_collector_type_ == desired_collector_type) { |
| 2582 | return; |
| 2583 | } |
| 2584 | heap_transition_target_time_ = std::max(heap_transition_target_time_, NanoTime() + delta_time); |
| 2585 | desired_collector_type_ = desired_collector_type; |
| 2586 | } |
| 2587 | SignalHeapTrimDaemon(self); |
| 2588 | } |
| 2589 | |
Mathieu Chartier | 7bf52d2 | 2014-03-13 14:46:09 -0700 | [diff] [blame] | 2590 | void Heap::RequestHeapTrim() { |
Mathieu Chartier | 440e4ce | 2014-03-31 16:36:35 -0700 | [diff] [blame] | 2591 | // Request a heap trim only if we do not currently care about pause times. |
| 2592 | if (CareAboutPauseTimes()) { |
| 2593 | return; |
| 2594 | } |
Ian Rogers | 4893188 | 2013-01-22 14:35:16 -0800 | [diff] [blame] | 2595 | // GC completed and now we must decide whether to request a heap trim (advising pages back to the |
| 2596 | // kernel) or not. Issuing a request will also cause trimming of the libc heap. As a trim scans |
| 2597 | // a space it will hold its lock and can become a cause of jank. |
| 2598 | // Note, the large object space self trims and the Zygote space was trimmed and unchanging since |
| 2599 | // forking. |
| 2600 | |
Elliott Hughes | 8cf5bc0 | 2012-02-02 16:32:16 -0800 | [diff] [blame] | 2601 | // We don't have a good measure of how worthwhile a trim might be. We can't use the live bitmap |
| 2602 | // because that only marks object heads, so a large array looks like lots of empty space. We |
| 2603 | // don't just call dlmalloc all the time, because the cost of an _attempted_ trim is proportional |
| 2604 | // to utilization (which is probably inversely proportional to how much benefit we can expect). |
| 2605 | // We could try mincore(2) but that's only a measure of how many pages we haven't given away, |
| 2606 | // not how much use we're making of those pages. |
Ian Rogers | 120f1c7 | 2012-09-28 17:17:10 -0700 | [diff] [blame] | 2607 | |
| 2608 | Thread* self = Thread::Current(); |
Mathieu Chartier | 590fee9 | 2013-09-13 13:46:47 -0700 | [diff] [blame] | 2609 | Runtime* runtime = Runtime::Current(); |
| 2610 | if (runtime == nullptr || !runtime->IsFinishedStarting() || runtime->IsShuttingDown(self)) { |
| 2611 | // Heap trimming isn't supported without a Java runtime or Daemons (such as at dex2oat time) |
| 2612 | // Also: we do not wish to start a heap trim if the runtime is shutting down (a racy check |
| 2613 | // as we don't hold the lock while requesting the trim). |
| 2614 | return; |
Ian Rogers | e1d490c | 2012-02-03 09:09:07 -0800 | [diff] [blame] | 2615 | } |
Mathieu Chartier | 440e4ce | 2014-03-31 16:36:35 -0700 | [diff] [blame] | 2616 | { |
| 2617 | MutexLock mu(self, *heap_trim_request_lock_); |
| 2618 | if (last_trim_time_ + kHeapTrimWait >= NanoTime()) { |
| 2619 | // We have done a heap trim in the last kHeapTrimWait nanosecs, don't request another one |
| 2620 | // just yet. |
| 2621 | return; |
Mathieu Chartier | a5f9de0 | 2014-02-28 16:48:42 -0800 | [diff] [blame] | 2622 | } |
Mathieu Chartier | 440e4ce | 2014-03-31 16:36:35 -0700 | [diff] [blame] | 2623 | heap_trim_request_pending_ = true; |
Mathieu Chartier | c39e342 | 2013-08-07 16:41:36 -0700 | [diff] [blame] | 2624 | } |
Mathieu Chartier | 440e4ce | 2014-03-31 16:36:35 -0700 | [diff] [blame] | 2625 | // Notify the daemon thread which will actually do the heap trim. |
| 2626 | SignalHeapTrimDaemon(self); |
Elliott Hughes | 8cf5bc0 | 2012-02-02 16:32:16 -0800 | [diff] [blame] | 2627 | } |
| 2628 | |
Mathieu Chartier | a5f9de0 | 2014-02-28 16:48:42 -0800 | [diff] [blame] | 2629 | void Heap::SignalHeapTrimDaemon(Thread* self) { |
| 2630 | JNIEnv* env = self->GetJniEnv(); |
| 2631 | DCHECK(WellKnownClasses::java_lang_Daemons != nullptr); |
| 2632 | DCHECK(WellKnownClasses::java_lang_Daemons_requestHeapTrim != nullptr); |
| 2633 | env->CallStaticVoidMethod(WellKnownClasses::java_lang_Daemons, |
| 2634 | WellKnownClasses::java_lang_Daemons_requestHeapTrim); |
| 2635 | CHECK(!env->ExceptionCheck()); |
| 2636 | } |
| 2637 | |
Hiroshi Yamauchi | cf58d4a | 2013-09-26 14:21:22 -0700 | [diff] [blame] | 2638 | void Heap::RevokeThreadLocalBuffers(Thread* thread) { |
Mathieu Chartier | e6da9af | 2013-12-16 11:54:42 -0800 | [diff] [blame] | 2639 | if (rosalloc_space_ != nullptr) { |
| 2640 | rosalloc_space_->RevokeThreadLocalBuffers(thread); |
| 2641 | } |
Mathieu Chartier | 692fafd | 2013-11-29 17:24:40 -0800 | [diff] [blame] | 2642 | if (bump_pointer_space_ != nullptr) { |
| 2643 | bump_pointer_space_->RevokeThreadLocalBuffers(thread); |
| 2644 | } |
Hiroshi Yamauchi | cf58d4a | 2013-09-26 14:21:22 -0700 | [diff] [blame] | 2645 | } |
| 2646 | |
Hiroshi Yamauchi | c93c530 | 2014-03-20 16:15:37 -0700 | [diff] [blame] | 2647 | void Heap::RevokeRosAllocThreadLocalBuffers(Thread* thread) { |
| 2648 | if (rosalloc_space_ != nullptr) { |
| 2649 | rosalloc_space_->RevokeThreadLocalBuffers(thread); |
| 2650 | } |
| 2651 | } |
| 2652 | |
Hiroshi Yamauchi | cf58d4a | 2013-09-26 14:21:22 -0700 | [diff] [blame] | 2653 | void Heap::RevokeAllThreadLocalBuffers() { |
Mathieu Chartier | e6da9af | 2013-12-16 11:54:42 -0800 | [diff] [blame] | 2654 | if (rosalloc_space_ != nullptr) { |
| 2655 | rosalloc_space_->RevokeAllThreadLocalBuffers(); |
| 2656 | } |
Mathieu Chartier | 692fafd | 2013-11-29 17:24:40 -0800 | [diff] [blame] | 2657 | if (bump_pointer_space_ != nullptr) { |
| 2658 | bump_pointer_space_->RevokeAllThreadLocalBuffers(); |
| 2659 | } |
Hiroshi Yamauchi | cf58d4a | 2013-09-26 14:21:22 -0700 | [diff] [blame] | 2660 | } |
| 2661 | |
Mathieu Chartier | 987ccff | 2013-07-08 11:05:21 -0700 | [diff] [blame] | 2662 | bool Heap::IsGCRequestPending() const { |
| 2663 | return concurrent_start_bytes_ != std::numeric_limits<size_t>::max(); |
| 2664 | } |
| 2665 | |
Mathieu Chartier | 590fee9 | 2013-09-13 13:46:47 -0700 | [diff] [blame] | 2666 | void Heap::RunFinalization(JNIEnv* env) { |
| 2667 | // Can't do this in WellKnownClasses::Init since System is not properly set up at that point. |
| 2668 | if (WellKnownClasses::java_lang_System_runFinalization == nullptr) { |
| 2669 | CHECK(WellKnownClasses::java_lang_System != nullptr); |
| 2670 | WellKnownClasses::java_lang_System_runFinalization = |
| 2671 | CacheMethod(env, WellKnownClasses::java_lang_System, true, "runFinalization", "()V"); |
| 2672 | CHECK(WellKnownClasses::java_lang_System_runFinalization != nullptr); |
| 2673 | } |
| 2674 | env->CallStaticVoidMethod(WellKnownClasses::java_lang_System, |
| 2675 | WellKnownClasses::java_lang_System_runFinalization); |
| 2676 | } |
| 2677 | |
Ian Rogers | 1eb512d | 2013-10-18 15:42:20 -0700 | [diff] [blame] | 2678 | void Heap::RegisterNativeAllocation(JNIEnv* env, int bytes) { |
Mathieu Chartier | 590fee9 | 2013-09-13 13:46:47 -0700 | [diff] [blame] | 2679 | Thread* self = ThreadForEnv(env); |
| 2680 | if (native_need_to_run_finalization_) { |
| 2681 | RunFinalization(env); |
| 2682 | UpdateMaxNativeFootprint(); |
| 2683 | native_need_to_run_finalization_ = false; |
| 2684 | } |
Mathieu Chartier | 987ccff | 2013-07-08 11:05:21 -0700 | [diff] [blame] | 2685 | // Total number of native bytes allocated. |
Ian Rogers | b122a4b | 2013-11-19 18:00:50 -0800 | [diff] [blame] | 2686 | native_bytes_allocated_.FetchAndAdd(bytes); |
Mathieu Chartier | 987ccff | 2013-07-08 11:05:21 -0700 | [diff] [blame] | 2687 | if (static_cast<size_t>(native_bytes_allocated_) > native_footprint_gc_watermark_) { |
Mathieu Chartier | cbb2d20 | 2013-11-14 17:45:16 -0800 | [diff] [blame] | 2688 | collector::GcType gc_type = have_zygote_space_ ? collector::kGcTypePartial : |
| 2689 | collector::kGcTypeFull; |
| 2690 | |
Mathieu Chartier | 987ccff | 2013-07-08 11:05:21 -0700 | [diff] [blame] | 2691 | // The second watermark is higher than the gc watermark. If you hit this it means you are |
| 2692 | // allocating native objects faster than the GC can keep up with. |
| 2693 | if (static_cast<size_t>(native_bytes_allocated_) > native_footprint_limit_) { |
Mathieu Chartier | 89a201e | 2014-05-02 10:27:26 -0700 | [diff] [blame] | 2694 | if (WaitForGcToComplete(kGcCauseForNativeAlloc, self) != collector::kGcTypeNone) { |
Mathieu Chartier | 590fee9 | 2013-09-13 13:46:47 -0700 | [diff] [blame] | 2695 | // Just finished a GC, attempt to run finalizers. |
| 2696 | RunFinalization(env); |
| 2697 | CHECK(!env->ExceptionCheck()); |
| 2698 | } |
| 2699 | // If we still are over the watermark, attempt a GC for alloc and run finalizers. |
| 2700 | if (static_cast<size_t>(native_bytes_allocated_) > native_footprint_limit_) { |
Hiroshi Yamauchi | 6f4ffe4 | 2014-01-13 12:30:44 -0800 | [diff] [blame] | 2701 | CollectGarbageInternal(gc_type, kGcCauseForNativeAlloc, false); |
Mathieu Chartier | 590fee9 | 2013-09-13 13:46:47 -0700 | [diff] [blame] | 2702 | RunFinalization(env); |
| 2703 | native_need_to_run_finalization_ = false; |
| 2704 | CHECK(!env->ExceptionCheck()); |
| 2705 | } |
| 2706 | // We have just run finalizers, update the native watermark since it is very likely that |
| 2707 | // finalizers released native managed allocations. |
| 2708 | UpdateMaxNativeFootprint(); |
| 2709 | } else if (!IsGCRequestPending()) { |
Hiroshi Yamauchi | 3e41780 | 2014-03-20 12:03:02 -0700 | [diff] [blame] | 2710 | if (IsGcConcurrent()) { |
Mathieu Chartier | 590fee9 | 2013-09-13 13:46:47 -0700 | [diff] [blame] | 2711 | RequestConcurrentGC(self); |
| 2712 | } else { |
Hiroshi Yamauchi | d20aba1 | 2014-04-11 15:31:09 -0700 | [diff] [blame] | 2713 | CollectGarbageInternal(gc_type, kGcCauseForNativeAlloc, false); |
Mathieu Chartier | 987ccff | 2013-07-08 11:05:21 -0700 | [diff] [blame] | 2714 | } |
| 2715 | } |
| 2716 | } |
| 2717 | } |
| 2718 | |
Ian Rogers | 1eb512d | 2013-10-18 15:42:20 -0700 | [diff] [blame] | 2719 | void Heap::RegisterNativeFree(JNIEnv* env, int bytes) { |
Mathieu Chartier | 987ccff | 2013-07-08 11:05:21 -0700 | [diff] [blame] | 2720 | int expected_size, new_size; |
| 2721 | do { |
Ian Rogers | b122a4b | 2013-11-19 18:00:50 -0800 | [diff] [blame] | 2722 | expected_size = native_bytes_allocated_.Load(); |
Mathieu Chartier | 590fee9 | 2013-09-13 13:46:47 -0700 | [diff] [blame] | 2723 | new_size = expected_size - bytes; |
| 2724 | if (UNLIKELY(new_size < 0)) { |
| 2725 | ScopedObjectAccess soa(env); |
| 2726 | env->ThrowNew(WellKnownClasses::java_lang_RuntimeException, |
| 2727 | StringPrintf("Attempted to free %d native bytes with only %d native bytes " |
| 2728 | "registered as allocated", bytes, expected_size).c_str()); |
| 2729 | break; |
| 2730 | } |
Ian Rogers | b122a4b | 2013-11-19 18:00:50 -0800 | [diff] [blame] | 2731 | } while (!native_bytes_allocated_.CompareAndSwap(expected_size, new_size)); |
Mathieu Chartier | 987ccff | 2013-07-08 11:05:21 -0700 | [diff] [blame] | 2732 | } |
| 2733 | |
Ian Rogers | ef7d42f | 2014-01-06 12:55:46 -0800 | [diff] [blame] | 2734 | size_t Heap::GetTotalMemory() const { |
| 2735 | size_t ret = 0; |
Mathieu Chartier | 02e2511 | 2013-08-14 16:14:24 -0700 | [diff] [blame] | 2736 | for (const auto& space : continuous_spaces_) { |
Mathieu Chartier | 590fee9 | 2013-09-13 13:46:47 -0700 | [diff] [blame] | 2737 | // Currently don't include the image space. |
| 2738 | if (!space->IsImageSpace()) { |
| 2739 | ret += space->Size(); |
Hiroshi Yamauchi | 09b07a9 | 2013-07-15 13:17:06 -0700 | [diff] [blame] | 2740 | } |
| 2741 | } |
Mathieu Chartier | 02e2511 | 2013-08-14 16:14:24 -0700 | [diff] [blame] | 2742 | for (const auto& space : discontinuous_spaces_) { |
Hiroshi Yamauchi | 09b07a9 | 2013-07-15 13:17:06 -0700 | [diff] [blame] | 2743 | if (space->IsLargeObjectSpace()) { |
| 2744 | ret += space->AsLargeObjectSpace()->GetBytesAllocated(); |
| 2745 | } |
| 2746 | } |
| 2747 | return ret; |
| 2748 | } |
| 2749 | |
Mathieu Chartier | 11409ae | 2013-09-23 11:49:36 -0700 | [diff] [blame] | 2750 | void Heap::AddModUnionTable(accounting::ModUnionTable* mod_union_table) { |
| 2751 | DCHECK(mod_union_table != nullptr); |
| 2752 | mod_union_tables_.Put(mod_union_table->GetSpace(), mod_union_table); |
| 2753 | } |
| 2754 | |
Mathieu Chartier | c645f1d | 2014-03-06 18:11:53 -0800 | [diff] [blame] | 2755 | void Heap::CheckPreconditionsForAllocObject(mirror::Class* c, size_t byte_count) { |
| 2756 | CHECK(c == NULL || (c->IsClassClass() && byte_count >= sizeof(mirror::Class)) || |
| 2757 | (c->IsVariableSize() || c->GetObjectSize() == byte_count) || |
| 2758 | strlen(ClassHelper(c).GetDescriptor()) == 0); |
| 2759 | CHECK_GE(byte_count, sizeof(mirror::Object)); |
| 2760 | } |
| 2761 | |
Hiroshi Yamauchi | 38e68e9 | 2014-03-07 13:59:08 -0800 | [diff] [blame] | 2762 | void Heap::AddRememberedSet(accounting::RememberedSet* remembered_set) { |
| 2763 | CHECK(remembered_set != nullptr); |
| 2764 | space::Space* space = remembered_set->GetSpace(); |
| 2765 | CHECK(space != nullptr); |
| 2766 | CHECK(remembered_sets_.find(space) == remembered_sets_.end()); |
| 2767 | remembered_sets_.Put(space, remembered_set); |
| 2768 | CHECK(remembered_sets_.find(space) != remembered_sets_.end()); |
| 2769 | } |
| 2770 | |
| 2771 | void Heap::RemoveRememberedSet(space::Space* space) { |
| 2772 | CHECK(space != nullptr); |
| 2773 | auto it = remembered_sets_.find(space); |
| 2774 | CHECK(it != remembered_sets_.end()); |
| 2775 | remembered_sets_.erase(it); |
| 2776 | CHECK(remembered_sets_.find(space) == remembered_sets_.end()); |
| 2777 | } |
| 2778 | |
Mathieu Chartier | 4aeec17 | 2014-03-27 16:09:46 -0700 | [diff] [blame] | 2779 | void Heap::ClearMarkedObjects() { |
| 2780 | // Clear all of the spaces' mark bitmaps. |
| 2781 | for (const auto& space : GetContinuousSpaces()) { |
Mathieu Chartier | a8e8f9c | 2014-04-09 14:51:05 -0700 | [diff] [blame] | 2782 | accounting::ContinuousSpaceBitmap* mark_bitmap = space->GetMarkBitmap(); |
Mathieu Chartier | 4aeec17 | 2014-03-27 16:09:46 -0700 | [diff] [blame] | 2783 | if (space->GetLiveBitmap() != mark_bitmap) { |
| 2784 | mark_bitmap->Clear(); |
| 2785 | } |
| 2786 | } |
| 2787 | // Clear the marked objects in the discontinous space object sets. |
| 2788 | for (const auto& space : GetDiscontinuousSpaces()) { |
Mathieu Chartier | bbd695c | 2014-04-16 09:48:48 -0700 | [diff] [blame] | 2789 | space->GetMarkBitmap()->Clear(); |
Mathieu Chartier | 4aeec17 | 2014-03-27 16:09:46 -0700 | [diff] [blame] | 2790 | } |
| 2791 | } |
| 2792 | |
Ian Rogers | 1d54e73 | 2013-05-02 21:10:01 -0700 | [diff] [blame] | 2793 | } // namespace gc |
Carl Shapiro | 69759ea | 2011-07-21 18:13:35 -0700 | [diff] [blame] | 2794 | } // namespace art |