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