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 | #include <sys/types.h> |
| 22 | #include <sys/wait.h> |
| 23 | |
Brian Carlstrom | 58ae941 | 2011-10-04 00:56:06 -0700 | [diff] [blame] | 24 | #include <limits> |
Carl Shapiro | 58551df | 2011-07-24 03:09:51 -0700 | [diff] [blame] | 25 | #include <vector> |
| 26 | |
Elliott Hughes | 1aa246d | 2012-12-13 09:29:36 -0800 | [diff] [blame] | 27 | #include "base/stl_util.h" |
Ian Rogers | 4893188 | 2013-01-22 14:35:16 -0800 | [diff] [blame] | 28 | #include "cutils/sched_policy.h" |
Elliott Hughes | 767a147 | 2011-10-26 18:49:02 -0700 | [diff] [blame] | 29 | #include "debugger.h" |
Ian Rogers | 1d54e73 | 2013-05-02 21:10:01 -0700 | [diff] [blame] | 30 | #include "gc/accounting/atomic_stack.h" |
| 31 | #include "gc/accounting/card_table-inl.h" |
| 32 | #include "gc/accounting/heap_bitmap-inl.h" |
| 33 | #include "gc/accounting/mod_union_table-inl.h" |
| 34 | #include "gc/accounting/space_bitmap-inl.h" |
| 35 | #include "gc/collector/mark_sweep-inl.h" |
| 36 | #include "gc/collector/partial_mark_sweep.h" |
| 37 | #include "gc/collector/sticky_mark_sweep.h" |
| 38 | #include "gc/space/image_space.h" |
| 39 | #include "gc/space/large_object_space.h" |
| 40 | #include "gc/space/space-inl.h" |
Brian Carlstrom | 9cff8e1 | 2011-08-18 16:47:29 -0700 | [diff] [blame] | 41 | #include "image.h" |
Jeff Hao | 5d91730 | 2013-02-27 17:57:33 -0800 | [diff] [blame] | 42 | #include "invoke_arg_array_builder.h" |
Ian Rogers | 2dd0e2c | 2013-01-24 12:42:14 -0800 | [diff] [blame] | 43 | #include "mirror/class-inl.h" |
| 44 | #include "mirror/field-inl.h" |
| 45 | #include "mirror/object.h" |
| 46 | #include "mirror/object-inl.h" |
| 47 | #include "mirror/object_array-inl.h" |
Ian Rogers | 6d4d9fc | 2011-11-30 16:24:48 -0800 | [diff] [blame] | 48 | #include "object_utils.h" |
Brian Carlstrom | 5643b78 | 2012-02-05 12:32:53 -0800 | [diff] [blame] | 49 | #include "os.h" |
Mathieu Chartier | 7664f5c | 2012-06-08 18:15:32 -0700 | [diff] [blame] | 50 | #include "ScopedLocalRef.h" |
Ian Rogers | 00f7d0e | 2012-07-19 15:28:27 -0700 | [diff] [blame] | 51 | #include "scoped_thread_state_change.h" |
Ian Rogers | 1f53934 | 2012-10-03 21:09:42 -0700 | [diff] [blame] | 52 | #include "sirt_ref.h" |
Elliott Hughes | 8d768a9 | 2011-09-14 16:35:25 -0700 | [diff] [blame] | 53 | #include "thread_list.h" |
Elliott Hughes | 767a147 | 2011-10-26 18:49:02 -0700 | [diff] [blame] | 54 | #include "UniquePtr.h" |
Elliott Hughes | eac7667 | 2012-05-24 21:56:51 -0700 | [diff] [blame] | 55 | #include "well_known_classes.h" |
Carl Shapiro | 69759ea | 2011-07-21 18:13:35 -0700 | [diff] [blame] | 56 | |
| 57 | namespace art { |
Ian Rogers | 1d54e73 | 2013-05-02 21:10:01 -0700 | [diff] [blame] | 58 | namespace gc { |
Carl Shapiro | 69759ea | 2011-07-21 18:13:35 -0700 | [diff] [blame] | 59 | |
Ian Rogers | 1d54e73 | 2013-05-02 21:10:01 -0700 | [diff] [blame] | 60 | // When to create a log message about a slow GC, 100ms. |
Mathieu Chartier | 2b82db4 | 2012-11-14 17:29:05 -0800 | [diff] [blame] | 61 | static const uint64_t kSlowGcThreshold = MsToNs(100); |
Ian Rogers | 1d54e73 | 2013-05-02 21:10:01 -0700 | [diff] [blame] | 62 | // When to create a log message about a slow pause, 5ms. |
Mathieu Chartier | 2b82db4 | 2012-11-14 17:29:05 -0800 | [diff] [blame] | 63 | static const uint64_t kLongGcPauseThreshold = MsToNs(5); |
Mathieu Chartier | 65db880 | 2012-11-20 12:36:46 -0800 | [diff] [blame] | 64 | static const bool kDumpGcPerformanceOnShutdown = false; |
Ian Rogers | 1d54e73 | 2013-05-02 21:10:01 -0700 | [diff] [blame] | 65 | // Minimum amount of remaining bytes before a concurrent GC is triggered. |
| 66 | static const size_t kMinConcurrentRemainingBytes = 128 * KB; |
Mathieu Chartier | 0051be6 | 2012-10-12 17:47:11 -0700 | [diff] [blame] | 67 | const double Heap::kDefaultTargetUtilization = 0.5; |
| 68 | |
Elliott Hughes | ae80b49 | 2012-04-24 10:43:17 -0700 | [diff] [blame] | 69 | static bool GenerateImage(const std::string& image_file_name) { |
Brian Carlstrom | a004aa9 | 2012-02-08 18:05:09 -0800 | [diff] [blame] | 70 | const std::string boot_class_path_string(Runtime::Current()->GetBootClassPathString()); |
Brian Carlstrom | 5643b78 | 2012-02-05 12:32:53 -0800 | [diff] [blame] | 71 | std::vector<std::string> boot_class_path; |
| 72 | Split(boot_class_path_string, ':', boot_class_path); |
Brian Carlstrom | b279337 | 2012-03-17 18:27:16 -0700 | [diff] [blame] | 73 | if (boot_class_path.empty()) { |
| 74 | LOG(FATAL) << "Failed to generate image because no boot class path specified"; |
| 75 | } |
Brian Carlstrom | 5643b78 | 2012-02-05 12:32:53 -0800 | [diff] [blame] | 76 | |
| 77 | std::vector<char*> arg_vector; |
| 78 | |
| 79 | std::string dex2oat_string(GetAndroidRoot()); |
Elliott Hughes | 67d9200 | 2012-03-26 15:08:51 -0700 | [diff] [blame] | 80 | dex2oat_string += (kIsDebugBuild ? "/bin/dex2oatd" : "/bin/dex2oat"); |
Brian Carlstrom | 5643b78 | 2012-02-05 12:32:53 -0800 | [diff] [blame] | 81 | const char* dex2oat = dex2oat_string.c_str(); |
| 82 | arg_vector.push_back(strdup(dex2oat)); |
| 83 | |
| 84 | std::string image_option_string("--image="); |
| 85 | image_option_string += image_file_name; |
| 86 | const char* image_option = image_option_string.c_str(); |
| 87 | arg_vector.push_back(strdup(image_option)); |
| 88 | |
| 89 | arg_vector.push_back(strdup("--runtime-arg")); |
| 90 | arg_vector.push_back(strdup("-Xms64m")); |
| 91 | |
| 92 | arg_vector.push_back(strdup("--runtime-arg")); |
| 93 | arg_vector.push_back(strdup("-Xmx64m")); |
| 94 | |
| 95 | for (size_t i = 0; i < boot_class_path.size(); i++) { |
| 96 | std::string dex_file_option_string("--dex-file="); |
| 97 | dex_file_option_string += boot_class_path[i]; |
| 98 | const char* dex_file_option = dex_file_option_string.c_str(); |
| 99 | arg_vector.push_back(strdup(dex_file_option)); |
| 100 | } |
| 101 | |
| 102 | std::string oat_file_option_string("--oat-file="); |
| 103 | oat_file_option_string += image_file_name; |
| 104 | oat_file_option_string.erase(oat_file_option_string.size() - 3); |
| 105 | oat_file_option_string += "oat"; |
| 106 | const char* oat_file_option = oat_file_option_string.c_str(); |
| 107 | arg_vector.push_back(strdup(oat_file_option)); |
| 108 | |
jeffhao | 8161c03 | 2012-10-31 15:50:00 -0700 | [diff] [blame] | 109 | std::string base_option_string(StringPrintf("--base=0x%x", ART_BASE_ADDRESS)); |
| 110 | arg_vector.push_back(strdup(base_option_string.c_str())); |
Brian Carlstrom | 5643b78 | 2012-02-05 12:32:53 -0800 | [diff] [blame] | 111 | |
Brian Carlstrom | 265091e | 2013-01-30 14:08:26 -0800 | [diff] [blame] | 112 | if (!kIsTargetBuild) { |
| 113 | arg_vector.push_back(strdup("--host")); |
| 114 | } |
| 115 | |
Elliott Hughes | 48436bb | 2012-02-07 15:23:28 -0800 | [diff] [blame] | 116 | std::string command_line(Join(arg_vector, ' ')); |
Brian Carlstrom | 5643b78 | 2012-02-05 12:32:53 -0800 | [diff] [blame] | 117 | LOG(INFO) << command_line; |
| 118 | |
Elliott Hughes | 48436bb | 2012-02-07 15:23:28 -0800 | [diff] [blame] | 119 | arg_vector.push_back(NULL); |
Brian Carlstrom | 5643b78 | 2012-02-05 12:32:53 -0800 | [diff] [blame] | 120 | char** argv = &arg_vector[0]; |
| 121 | |
| 122 | // fork and exec dex2oat |
| 123 | pid_t pid = fork(); |
| 124 | if (pid == 0) { |
| 125 | // no allocation allowed between fork and exec |
| 126 | |
| 127 | // change process groups, so we don't get reaped by ProcessManager |
| 128 | setpgid(0, 0); |
| 129 | |
| 130 | execv(dex2oat, argv); |
| 131 | |
| 132 | PLOG(FATAL) << "execv(" << dex2oat << ") failed"; |
| 133 | return false; |
| 134 | } else { |
| 135 | STLDeleteElements(&arg_vector); |
| 136 | |
| 137 | // wait for dex2oat to finish |
| 138 | int status; |
| 139 | pid_t got_pid = TEMP_FAILURE_RETRY(waitpid(pid, &status, 0)); |
| 140 | if (got_pid != pid) { |
| 141 | PLOG(ERROR) << "waitpid failed: wanted " << pid << ", got " << got_pid; |
| 142 | return false; |
| 143 | } |
| 144 | if (!WIFEXITED(status) || WEXITSTATUS(status) != 0) { |
| 145 | LOG(ERROR) << dex2oat << " failed: " << command_line; |
| 146 | return false; |
| 147 | } |
| 148 | } |
| 149 | return true; |
| 150 | } |
| 151 | |
Mathieu Chartier | d8195f1 | 2012-10-05 12:21:28 -0700 | [diff] [blame] | 152 | void Heap::UnReserveOatFileAddressRange() { |
| 153 | oat_file_map_.reset(NULL); |
| 154 | } |
| 155 | |
Mathieu Chartier | 0051be6 | 2012-10-12 17:47:11 -0700 | [diff] [blame] | 156 | Heap::Heap(size_t initial_size, size_t growth_limit, size_t min_free, size_t max_free, |
| 157 | double target_utilization, size_t capacity, |
Ian Rogers | 00f7d0e | 2012-07-19 15:28:27 -0700 | [diff] [blame] | 158 | const std::string& original_image_file_name, bool concurrent_gc) |
| 159 | : alloc_space_(NULL), |
Elliott Hughes | b3bd5f0 | 2012-03-08 21:05:27 -0800 | [diff] [blame] | 160 | card_table_(NULL), |
Ian Rogers | 00f7d0e | 2012-07-19 15:28:27 -0700 | [diff] [blame] | 161 | concurrent_gc_(concurrent_gc), |
| 162 | have_zygote_space_(false), |
Ian Rogers | 1d54e73 | 2013-05-02 21:10:01 -0700 | [diff] [blame] | 163 | reference_queue_lock_(NULL), |
Elliott Hughes | b3bd5f0 | 2012-03-08 21:05:27 -0800 | [diff] [blame] | 164 | is_gc_running_(false), |
Ian Rogers | 1d54e73 | 2013-05-02 21:10:01 -0700 | [diff] [blame] | 165 | last_gc_type_(collector::kGcTypeNone), |
Mathieu Chartier | 80de7a6 | 2012-11-27 17:21:50 -0800 | [diff] [blame] | 166 | capacity_(capacity), |
Mathieu Chartier | 2fde533 | 2012-09-14 14:51:54 -0700 | [diff] [blame] | 167 | growth_limit_(growth_limit), |
Mathieu Chartier | 0051be6 | 2012-10-12 17:47:11 -0700 | [diff] [blame] | 168 | max_allowed_footprint_(initial_size), |
Ian Rogers | 1d54e73 | 2013-05-02 21:10:01 -0700 | [diff] [blame] | 169 | concurrent_start_bytes_(concurrent_gc ? initial_size - (kMinConcurrentRemainingBytes) |
| 170 | : std::numeric_limits<size_t>::max()), |
Mathieu Chartier | 357e9be | 2012-08-01 11:00:14 -0700 | [diff] [blame] | 171 | sticky_gc_count_(0), |
Ian Rogers | 1d54e73 | 2013-05-02 21:10:01 -0700 | [diff] [blame] | 172 | sticky_to_partial_gc_ratio_(10), |
| 173 | total_bytes_freed_ever_(0), |
| 174 | total_objects_freed_ever_(0), |
Mathieu Chartier | 2fde533 | 2012-09-14 14:51:54 -0700 | [diff] [blame] | 175 | large_object_threshold_(3 * kPageSize), |
Elliott Hughes | b3bd5f0 | 2012-03-08 21:05:27 -0800 | [diff] [blame] | 176 | num_bytes_allocated_(0), |
Mathieu Chartier | c7b83a0 | 2012-09-11 18:07:39 -0700 | [diff] [blame] | 177 | verify_missing_card_marks_(false), |
| 178 | verify_system_weaks_(false), |
| 179 | verify_pre_gc_heap_(false), |
| 180 | verify_post_gc_heap_(false), |
Mathieu Chartier | fd678be | 2012-08-30 14:50:54 -0700 | [diff] [blame] | 181 | verify_mod_union_table_(false), |
Mathieu Chartier | 7469ebf | 2012-09-24 16:28:36 -0700 | [diff] [blame] | 182 | min_alloc_space_size_for_sticky_gc_(2 * MB), |
Mathieu Chartier | c7b83a0 | 2012-09-11 18:07:39 -0700 | [diff] [blame] | 183 | min_remaining_space_for_sticky_gc_(1 * MB), |
Ian Rogers | 1d54e73 | 2013-05-02 21:10:01 -0700 | [diff] [blame] | 184 | last_trim_time_ms_(0), |
Mathieu Chartier | 65db880 | 2012-11-20 12:36:46 -0800 | [diff] [blame] | 185 | allocation_rate_(0), |
Ian Rogers | 1d54e73 | 2013-05-02 21:10:01 -0700 | [diff] [blame] | 186 | max_allocation_stack_size_(kDesiredHeapVerification > kNoHeapVerification? KB : MB), |
Elliott Hughes | b3bd5f0 | 2012-03-08 21:05:27 -0800 | [diff] [blame] | 187 | reference_referent_offset_(0), |
| 188 | reference_queue_offset_(0), |
| 189 | reference_queueNext_offset_(0), |
| 190 | reference_pendingNext_offset_(0), |
| 191 | finalizer_reference_zombie_offset_(0), |
Mathieu Chartier | 0051be6 | 2012-10-12 17:47:11 -0700 | [diff] [blame] | 192 | min_free_(min_free), |
| 193 | max_free_(max_free), |
| 194 | target_utilization_(target_utilization), |
Mathieu Chartier | 155dfe9 | 2012-10-09 14:24:49 -0700 | [diff] [blame] | 195 | total_wait_time_(0), |
| 196 | measure_allocation_time_(false), |
| 197 | total_allocation_time_(0), |
Ian Rogers | 04d7aa9 | 2013-03-16 14:29:17 -0700 | [diff] [blame] | 198 | verify_object_mode_(kHeapVerificationNotPermitted) { |
Elliott Hughes | 4dd9b4d | 2011-12-12 18:29:24 -0800 | [diff] [blame] | 199 | if (VLOG_IS_ON(heap) || VLOG_IS_ON(startup)) { |
Elliott Hughes | b3bd5f0 | 2012-03-08 21:05:27 -0800 | [diff] [blame] | 200 | LOG(INFO) << "Heap() entering"; |
Brian Carlstrom | 0a5b14d | 2011-09-27 13:29:15 -0700 | [diff] [blame] | 201 | } |
| 202 | |
Ian Rogers | 1d54e73 | 2013-05-02 21:10:01 -0700 | [diff] [blame] | 203 | live_bitmap_.reset(new accounting::HeapBitmap(this)); |
| 204 | mark_bitmap_.reset(new accounting::HeapBitmap(this)); |
Mathieu Chartier | b062fdd | 2012-07-03 09:51:48 -0700 | [diff] [blame] | 205 | |
Ian Rogers | 30fab40 | 2012-01-23 15:43:46 -0800 | [diff] [blame] | 206 | // Requested begin for the alloc space, to follow the mapped image and oat files |
| 207 | byte* requested_begin = NULL; |
Brian Carlstrom | 5643b78 | 2012-02-05 12:32:53 -0800 | [diff] [blame] | 208 | std::string image_file_name(original_image_file_name); |
| 209 | if (!image_file_name.empty()) { |
Ian Rogers | 1d54e73 | 2013-05-02 21:10:01 -0700 | [diff] [blame] | 210 | space::ImageSpace* image_space = NULL; |
Mathieu Chartier | b062fdd | 2012-07-03 09:51:48 -0700 | [diff] [blame] | 211 | |
Brian Carlstrom | 5643b78 | 2012-02-05 12:32:53 -0800 | [diff] [blame] | 212 | if (OS::FileExists(image_file_name.c_str())) { |
| 213 | // If the /system file exists, it should be up-to-date, don't try to generate |
Ian Rogers | 1d54e73 | 2013-05-02 21:10:01 -0700 | [diff] [blame] | 214 | image_space = space::ImageSpace::Create(image_file_name); |
Brian Carlstrom | 5643b78 | 2012-02-05 12:32:53 -0800 | [diff] [blame] | 215 | } else { |
Brian Carlstrom | 7675e16 | 2013-06-10 16:18:04 -0700 | [diff] [blame] | 216 | // If the /system file didn't exist, we need to use one from the dalvik-cache. |
Brian Carlstrom | 5643b78 | 2012-02-05 12:32:53 -0800 | [diff] [blame] | 217 | // If the cache file exists, try to open, but if it fails, regenerate. |
| 218 | // If it does not exist, generate. |
Brian Carlstrom | 7675e16 | 2013-06-10 16:18:04 -0700 | [diff] [blame] | 219 | image_file_name = GetDalvikCacheFilenameOrDie(image_file_name); |
Brian Carlstrom | 5643b78 | 2012-02-05 12:32:53 -0800 | [diff] [blame] | 220 | if (OS::FileExists(image_file_name.c_str())) { |
Ian Rogers | 1d54e73 | 2013-05-02 21:10:01 -0700 | [diff] [blame] | 221 | image_space = space::ImageSpace::Create(image_file_name); |
Brian Carlstrom | 5643b78 | 2012-02-05 12:32:53 -0800 | [diff] [blame] | 222 | } |
Mathieu Chartier | b062fdd | 2012-07-03 09:51:48 -0700 | [diff] [blame] | 223 | if (image_space == NULL) { |
Mathieu Chartier | 7469ebf | 2012-09-24 16:28:36 -0700 | [diff] [blame] | 224 | CHECK(GenerateImage(image_file_name)) << "Failed to generate image: " << image_file_name; |
Ian Rogers | 1d54e73 | 2013-05-02 21:10:01 -0700 | [diff] [blame] | 225 | image_space = space::ImageSpace::Create(image_file_name); |
Brian Carlstrom | 5643b78 | 2012-02-05 12:32:53 -0800 | [diff] [blame] | 226 | } |
| 227 | } |
Mathieu Chartier | d8195f1 | 2012-10-05 12:21:28 -0700 | [diff] [blame] | 228 | |
Mathieu Chartier | 2fde533 | 2012-09-14 14:51:54 -0700 | [diff] [blame] | 229 | CHECK(image_space != NULL) << "Failed to create space from " << image_file_name; |
Ian Rogers | 1d54e73 | 2013-05-02 21:10:01 -0700 | [diff] [blame] | 230 | AddContinuousSpace(image_space); |
Ian Rogers | 30fab40 | 2012-01-23 15:43:46 -0800 | [diff] [blame] | 231 | // Oat files referenced by image files immediately follow them in memory, ensure alloc space |
| 232 | // isn't going to get in the middle |
Brian Carlstrom | 700c8d3 | 2012-11-05 10:42:02 -0800 | [diff] [blame] | 233 | byte* oat_file_end_addr = image_space->GetImageHeader().GetOatFileEnd(); |
| 234 | CHECK_GT(oat_file_end_addr, image_space->End()); |
Mathieu Chartier | d8195f1 | 2012-10-05 12:21:28 -0700 | [diff] [blame] | 235 | |
| 236 | // Reserve address range from image_space->End() to image_space->GetImageHeader().GetOatEnd() |
| 237 | uintptr_t reserve_begin = RoundUp(reinterpret_cast<uintptr_t>(image_space->End()), kPageSize); |
Brian Carlstrom | 700c8d3 | 2012-11-05 10:42:02 -0800 | [diff] [blame] | 238 | uintptr_t reserve_end = RoundUp(reinterpret_cast<uintptr_t>(oat_file_end_addr), kPageSize); |
Mathieu Chartier | d8195f1 | 2012-10-05 12:21:28 -0700 | [diff] [blame] | 239 | oat_file_map_.reset(MemMap::MapAnonymous("oat file reserve", |
| 240 | reinterpret_cast<byte*>(reserve_begin), |
Ian Rogers | 10c5b78 | 2013-01-10 10:40:53 -0800 | [diff] [blame] | 241 | reserve_end - reserve_begin, PROT_NONE)); |
Mathieu Chartier | d8195f1 | 2012-10-05 12:21:28 -0700 | [diff] [blame] | 242 | |
Brian Carlstrom | 700c8d3 | 2012-11-05 10:42:02 -0800 | [diff] [blame] | 243 | if (oat_file_end_addr > requested_begin) { |
| 244 | requested_begin = reinterpret_cast<byte*>(RoundUp(reinterpret_cast<uintptr_t>(oat_file_end_addr), |
Mathieu Chartier | fd678be | 2012-08-30 14:50:54 -0700 | [diff] [blame] | 245 | kPageSize)); |
Brian Carlstrom | 58ae941 | 2011-10-04 00:56:06 -0700 | [diff] [blame] | 246 | } |
Brian Carlstrom | 69b15fb | 2011-09-03 12:25:21 -0700 | [diff] [blame] | 247 | } |
| 248 | |
Mathieu Chartier | d8195f1 | 2012-10-05 12:21:28 -0700 | [diff] [blame] | 249 | // Allocate the large object space. |
Ian Rogers | 22a2086 | 2013-03-16 16:34:57 -0700 | [diff] [blame] | 250 | const bool kUseFreeListSpaceForLOS = false; |
| 251 | if (kUseFreeListSpaceForLOS) { |
Ian Rogers | 1d54e73 | 2013-05-02 21:10:01 -0700 | [diff] [blame] | 252 | large_object_space_ = space::FreeListSpace::Create("large object space", NULL, capacity); |
Ian Rogers | 22a2086 | 2013-03-16 16:34:57 -0700 | [diff] [blame] | 253 | } else { |
Ian Rogers | 1d54e73 | 2013-05-02 21:10:01 -0700 | [diff] [blame] | 254 | large_object_space_ = space::LargeObjectMapSpace::Create("large object space"); |
Ian Rogers | 22a2086 | 2013-03-16 16:34:57 -0700 | [diff] [blame] | 255 | } |
Ian Rogers | 1d54e73 | 2013-05-02 21:10:01 -0700 | [diff] [blame] | 256 | CHECK(large_object_space_ != NULL) << "Failed to create large object space"; |
| 257 | AddDiscontinuousSpace(large_object_space_); |
Mathieu Chartier | 8e9a149 | 2012-10-04 12:25:40 -0700 | [diff] [blame] | 258 | |
Ian Rogers | 1d54e73 | 2013-05-02 21:10:01 -0700 | [diff] [blame] | 259 | alloc_space_ = space::DlMallocSpace::Create("alloc space", |
| 260 | initial_size, |
| 261 | growth_limit, capacity, |
| 262 | requested_begin); |
Mathieu Chartier | cc236d7 | 2012-07-20 10:29:05 -0700 | [diff] [blame] | 263 | CHECK(alloc_space_ != NULL) << "Failed to create alloc space"; |
jeffhao | 8161c03 | 2012-10-31 15:50:00 -0700 | [diff] [blame] | 264 | alloc_space_->SetFootprintLimit(alloc_space_->Capacity()); |
Ian Rogers | 1d54e73 | 2013-05-02 21:10:01 -0700 | [diff] [blame] | 265 | AddContinuousSpace(alloc_space_); |
Mathieu Chartier | b062fdd | 2012-07-03 09:51:48 -0700 | [diff] [blame] | 266 | |
Ian Rogers | 1d54e73 | 2013-05-02 21:10:01 -0700 | [diff] [blame] | 267 | // Compute heap capacity. Continuous spaces are sorted in order of Begin(). |
| 268 | byte* heap_begin = continuous_spaces_.front()->Begin(); |
| 269 | size_t heap_capacity = continuous_spaces_.back()->End() - continuous_spaces_.front()->Begin(); |
| 270 | if (continuous_spaces_.back()->IsDlMallocSpace()) { |
| 271 | heap_capacity += continuous_spaces_.back()->AsDlMallocSpace()->NonGrowthLimitCapacity(); |
Mathieu Chartier | 2fde533 | 2012-09-14 14:51:54 -0700 | [diff] [blame] | 272 | } |
Carl Shapiro | 69759ea | 2011-07-21 18:13:35 -0700 | [diff] [blame] | 273 | |
Ian Rogers | 30fab40 | 2012-01-23 15:43:46 -0800 | [diff] [blame] | 274 | // Mark image objects in the live bitmap |
Mathieu Chartier | 2fde533 | 2012-09-14 14:51:54 -0700 | [diff] [blame] | 275 | // TODO: C++0x |
Ian Rogers | 1d54e73 | 2013-05-02 21:10:01 -0700 | [diff] [blame] | 276 | typedef std::vector<space::ContinuousSpace*>::iterator It; |
| 277 | for (It it = continuous_spaces_.begin(); it != continuous_spaces_.end(); ++it) { |
| 278 | space::ContinuousSpace* space = *it; |
Ian Rogers | 30fab40 | 2012-01-23 15:43:46 -0800 | [diff] [blame] | 279 | if (space->IsImageSpace()) { |
Ian Rogers | 1d54e73 | 2013-05-02 21:10:01 -0700 | [diff] [blame] | 280 | space::ImageSpace* image_space = space->AsImageSpace(); |
Mathieu Chartier | 2fde533 | 2012-09-14 14:51:54 -0700 | [diff] [blame] | 281 | image_space->RecordImageAllocations(image_space->GetLiveBitmap()); |
Ian Rogers | 30fab40 | 2012-01-23 15:43:46 -0800 | [diff] [blame] | 282 | } |
| 283 | } |
| 284 | |
Elliott Hughes | 6c9c06d | 2011-11-07 16:43:47 -0800 | [diff] [blame] | 285 | // Allocate the card table. |
Ian Rogers | 1d54e73 | 2013-05-02 21:10:01 -0700 | [diff] [blame] | 286 | card_table_.reset(accounting::CardTable::Create(heap_begin, heap_capacity)); |
Mathieu Chartier | cc236d7 | 2012-07-20 10:29:05 -0700 | [diff] [blame] | 287 | CHECK(card_table_.get() != NULL) << "Failed to create card table"; |
Ian Rogers | 5d76c43 | 2011-10-31 21:42:49 -0700 | [diff] [blame] | 288 | |
Ian Rogers | 1d54e73 | 2013-05-02 21:10:01 -0700 | [diff] [blame] | 289 | image_mod_union_table_.reset(new accounting::ModUnionTableToZygoteAllocspace(this)); |
| 290 | CHECK(image_mod_union_table_.get() != NULL) << "Failed to create image mod-union table"; |
Mathieu Chartier | b43b7d4 | 2012-06-19 13:15:09 -0700 | [diff] [blame] | 291 | |
Ian Rogers | 1d54e73 | 2013-05-02 21:10:01 -0700 | [diff] [blame] | 292 | zygote_mod_union_table_.reset(new accounting::ModUnionTableCardCache(this)); |
Mathieu Chartier | cc236d7 | 2012-07-20 10:29:05 -0700 | [diff] [blame] | 293 | CHECK(zygote_mod_union_table_.get() != NULL) << "Failed to create Zygote mod-union table"; |
Carl Shapiro | 69759ea | 2011-07-21 18:13:35 -0700 | [diff] [blame] | 294 | |
Mathieu Chartier | 357e9be | 2012-08-01 11:00:14 -0700 | [diff] [blame] | 295 | // TODO: Count objects in the image space here. |
Mathieu Chartier | 1cd9c5c | 2012-08-23 10:52:44 -0700 | [diff] [blame] | 296 | num_bytes_allocated_ = 0; |
Ian Rogers | 0cfe1fb | 2011-08-26 03:29:44 -0700 | [diff] [blame] | 297 | |
Mathieu Chartier | d22d548 | 2012-11-06 17:14:12 -0800 | [diff] [blame] | 298 | // Default mark stack size in bytes. |
Mathieu Chartier | d8195f1 | 2012-10-05 12:21:28 -0700 | [diff] [blame] | 299 | static const size_t default_mark_stack_size = 64 * KB; |
Ian Rogers | 1d54e73 | 2013-05-02 21:10:01 -0700 | [diff] [blame] | 300 | mark_stack_.reset(accounting::ObjectStack::Create("mark stack", default_mark_stack_size)); |
| 301 | allocation_stack_.reset(accounting::ObjectStack::Create("allocation stack", |
| 302 | max_allocation_stack_size_)); |
| 303 | live_stack_.reset(accounting::ObjectStack::Create("live stack", |
| 304 | max_allocation_stack_size_)); |
Mathieu Chartier | 5301cd2 | 2012-05-31 12:11:36 -0700 | [diff] [blame] | 305 | |
Mathieu Chartier | 65db880 | 2012-11-20 12:36:46 -0800 | [diff] [blame] | 306 | // It's still too early to take a lock because there are no threads yet, but we can create locks |
| 307 | // now. We don't create it earlier to make it clear that you can't use locks during heap |
| 308 | // initialization. |
Mathieu Chartier | fd678be | 2012-08-30 14:50:54 -0700 | [diff] [blame] | 309 | gc_complete_lock_ = new Mutex("GC complete lock"); |
Ian Rogers | c604d73 | 2012-10-14 16:09:54 -0700 | [diff] [blame] | 310 | gc_complete_cond_.reset(new ConditionVariable("GC complete condition variable", |
| 311 | *gc_complete_lock_)); |
Brian Carlstrom | 0a5b14d | 2011-09-27 13:29:15 -0700 | [diff] [blame] | 312 | |
Mathieu Chartier | 02b6a78 | 2012-10-26 13:51:26 -0700 | [diff] [blame] | 313 | // Create the reference queue lock, this is required so for parrallel object scanning in the GC. |
Ian Rogers | 1d54e73 | 2013-05-02 21:10:01 -0700 | [diff] [blame] | 314 | reference_queue_lock_ = new Mutex("reference queue lock"); |
Mathieu Chartier | 02b6a78 | 2012-10-26 13:51:26 -0700 | [diff] [blame] | 315 | |
Ian Rogers | 1d54e73 | 2013-05-02 21:10:01 -0700 | [diff] [blame] | 316 | last_gc_time_ns_ = NanoTime(); |
Mathieu Chartier | 65db880 | 2012-11-20 12:36:46 -0800 | [diff] [blame] | 317 | last_gc_size_ = GetBytesAllocated(); |
| 318 | |
Mathieu Chartier | 2b82db4 | 2012-11-14 17:29:05 -0800 | [diff] [blame] | 319 | // Create our garbage collectors. |
| 320 | for (size_t i = 0; i < 2; ++i) { |
| 321 | const bool concurrent = i != 0; |
Ian Rogers | 1d54e73 | 2013-05-02 21:10:01 -0700 | [diff] [blame] | 322 | mark_sweep_collectors_.push_back(new collector::MarkSweep(this, concurrent)); |
| 323 | mark_sweep_collectors_.push_back(new collector::PartialMarkSweep(this, concurrent)); |
| 324 | mark_sweep_collectors_.push_back(new collector::StickyMarkSweep(this, concurrent)); |
Mathieu Chartier | 0325e62 | 2012-09-05 14:22:51 -0700 | [diff] [blame] | 325 | } |
| 326 | |
Mathieu Chartier | 2b82db4 | 2012-11-14 17:29:05 -0800 | [diff] [blame] | 327 | CHECK(max_allowed_footprint_ != 0); |
Elliott Hughes | 4dd9b4d | 2011-12-12 18:29:24 -0800 | [diff] [blame] | 328 | if (VLOG_IS_ON(heap) || VLOG_IS_ON(startup)) { |
Elliott Hughes | b3bd5f0 | 2012-03-08 21:05:27 -0800 | [diff] [blame] | 329 | LOG(INFO) << "Heap() exiting"; |
Brian Carlstrom | 0a5b14d | 2011-09-27 13:29:15 -0700 | [diff] [blame] | 330 | } |
Carl Shapiro | 69759ea | 2011-07-21 18:13:35 -0700 | [diff] [blame] | 331 | } |
| 332 | |
Mathieu Chartier | 02b6a78 | 2012-10-26 13:51:26 -0700 | [diff] [blame] | 333 | void Heap::CreateThreadPool() { |
| 334 | // TODO: Make sysconf(_SC_NPROCESSORS_CONF) be a helper function? |
| 335 | // Use the number of processors - 1 since the thread doing the GC does work while its waiting for |
| 336 | // workers to complete. |
Ian Rogers | 1d54e73 | 2013-05-02 21:10:01 -0700 | [diff] [blame] | 337 | thread_pool_.reset(new ThreadPool(1)); // new ThreadPool(sysconf(_SC_NPROCESSORS_CONF) - 1)); |
Mathieu Chartier | 02b6a78 | 2012-10-26 13:51:26 -0700 | [diff] [blame] | 338 | } |
| 339 | |
| 340 | void Heap::DeleteThreadPool() { |
| 341 | thread_pool_.reset(NULL); |
| 342 | } |
| 343 | |
Mathieu Chartier | cc236d7 | 2012-07-20 10:29:05 -0700 | [diff] [blame] | 344 | // Sort spaces based on begin address |
Ian Rogers | 1d54e73 | 2013-05-02 21:10:01 -0700 | [diff] [blame] | 345 | struct ContinuousSpaceSorter { |
| 346 | bool operator ()(const space::ContinuousSpace* a, const space::ContinuousSpace* b) const { |
Mathieu Chartier | cc236d7 | 2012-07-20 10:29:05 -0700 | [diff] [blame] | 347 | return a->Begin() < b->Begin(); |
| 348 | } |
| 349 | }; |
| 350 | |
Ian Rogers | 1d54e73 | 2013-05-02 21:10:01 -0700 | [diff] [blame] | 351 | void Heap::AddContinuousSpace(space::ContinuousSpace* space) { |
Ian Rogers | 50b35e2 | 2012-10-04 10:09:15 -0700 | [diff] [blame] | 352 | WriterMutexLock mu(Thread::Current(), *Locks::heap_bitmap_lock_); |
Mathieu Chartier | cc236d7 | 2012-07-20 10:29:05 -0700 | [diff] [blame] | 353 | DCHECK(space != NULL); |
Mathieu Chartier | b062fdd | 2012-07-03 09:51:48 -0700 | [diff] [blame] | 354 | DCHECK(space->GetLiveBitmap() != NULL); |
Ian Rogers | 1d54e73 | 2013-05-02 21:10:01 -0700 | [diff] [blame] | 355 | live_bitmap_->AddContinuousSpaceBitmap(space->GetLiveBitmap()); |
Mathieu Chartier | b062fdd | 2012-07-03 09:51:48 -0700 | [diff] [blame] | 356 | DCHECK(space->GetMarkBitmap() != NULL); |
Ian Rogers | 1d54e73 | 2013-05-02 21:10:01 -0700 | [diff] [blame] | 357 | mark_bitmap_->AddContinuousSpaceBitmap(space->GetMarkBitmap()); |
| 358 | continuous_spaces_.push_back(space); |
| 359 | if (space->IsDlMallocSpace() && !space->IsLargeObjectSpace()) { |
| 360 | alloc_space_ = space->AsDlMallocSpace(); |
Mathieu Chartier | 357e9be | 2012-08-01 11:00:14 -0700 | [diff] [blame] | 361 | } |
| 362 | |
Mathieu Chartier | cc236d7 | 2012-07-20 10:29:05 -0700 | [diff] [blame] | 363 | // Ensure that spaces remain sorted in increasing order of start address (required for CMS finger) |
Ian Rogers | 1d54e73 | 2013-05-02 21:10:01 -0700 | [diff] [blame] | 364 | std::sort(continuous_spaces_.begin(), continuous_spaces_.end(), ContinuousSpaceSorter()); |
Mathieu Chartier | 357e9be | 2012-08-01 11:00:14 -0700 | [diff] [blame] | 365 | |
| 366 | // Ensure that ImageSpaces < ZygoteSpaces < AllocSpaces so that we can do address based checks to |
| 367 | // avoid redundant marking. |
| 368 | bool seen_zygote = false, seen_alloc = false; |
Ian Rogers | 1d54e73 | 2013-05-02 21:10:01 -0700 | [diff] [blame] | 369 | typedef std::vector<space::ContinuousSpace*>::const_iterator It; |
| 370 | for (It it = continuous_spaces_.begin(); it != continuous_spaces_.end(); ++it) { |
| 371 | space::ContinuousSpace* space = *it; |
Mathieu Chartier | 357e9be | 2012-08-01 11:00:14 -0700 | [diff] [blame] | 372 | if (space->IsImageSpace()) { |
| 373 | DCHECK(!seen_zygote); |
| 374 | DCHECK(!seen_alloc); |
Mathieu Chartier | fd678be | 2012-08-30 14:50:54 -0700 | [diff] [blame] | 375 | } else if (space->IsZygoteSpace()) { |
Mathieu Chartier | 357e9be | 2012-08-01 11:00:14 -0700 | [diff] [blame] | 376 | DCHECK(!seen_alloc); |
| 377 | seen_zygote = true; |
Ian Rogers | 1d54e73 | 2013-05-02 21:10:01 -0700 | [diff] [blame] | 378 | } else if (space->IsDlMallocSpace()) { |
Mathieu Chartier | 357e9be | 2012-08-01 11:00:14 -0700 | [diff] [blame] | 379 | seen_alloc = true; |
| 380 | } |
| 381 | } |
Elliott Hughes | b3bd5f0 | 2012-03-08 21:05:27 -0800 | [diff] [blame] | 382 | } |
| 383 | |
Ian Rogers | 1d54e73 | 2013-05-02 21:10:01 -0700 | [diff] [blame] | 384 | void Heap::AddDiscontinuousSpace(space::DiscontinuousSpace* space) { |
| 385 | WriterMutexLock mu(Thread::Current(), *Locks::heap_bitmap_lock_); |
| 386 | DCHECK(space != NULL); |
| 387 | DCHECK(space->GetLiveObjects() != NULL); |
| 388 | live_bitmap_->AddDiscontinuousObjectSet(space->GetLiveObjects()); |
| 389 | DCHECK(space->GetMarkObjects() != NULL); |
| 390 | mark_bitmap_->AddDiscontinuousObjectSet(space->GetMarkObjects()); |
| 391 | discontinuous_spaces_.push_back(space); |
| 392 | } |
| 393 | |
Elliott Hughes | 8b788fe | 2013-04-17 15:57:01 -0700 | [diff] [blame] | 394 | void Heap::DumpGcPerformanceInfo(std::ostream& os) { |
Mathieu Chartier | 155dfe9 | 2012-10-09 14:24:49 -0700 | [diff] [blame] | 395 | // Dump cumulative timings. |
Elliott Hughes | 8b788fe | 2013-04-17 15:57:01 -0700 | [diff] [blame] | 396 | os << "Dumping cumulative Gc timings\n"; |
Mathieu Chartier | 155dfe9 | 2012-10-09 14:24:49 -0700 | [diff] [blame] | 397 | uint64_t total_duration = 0; |
Mathieu Chartier | 2b82db4 | 2012-11-14 17:29:05 -0800 | [diff] [blame] | 398 | |
| 399 | // Dump cumulative loggers for each GC type. |
| 400 | // TODO: C++0x |
| 401 | uint64_t total_paused_time = 0; |
Ian Rogers | 1d54e73 | 2013-05-02 21:10:01 -0700 | [diff] [blame] | 402 | typedef std::vector<collector::MarkSweep*>::const_iterator It; |
| 403 | for (It it = mark_sweep_collectors_.begin(); |
Sameer Abu Asal | a843954 | 2013-02-14 16:06:42 -0800 | [diff] [blame] | 404 | it != mark_sweep_collectors_.end(); ++it) { |
Ian Rogers | 1d54e73 | 2013-05-02 21:10:01 -0700 | [diff] [blame] | 405 | collector::MarkSweep* collector = *it; |
Sameer Abu Asal | a843954 | 2013-02-14 16:06:42 -0800 | [diff] [blame] | 406 | CumulativeLogger& logger = collector->GetCumulativeTimings(); |
Mathieu Chartier | 2b82db4 | 2012-11-14 17:29:05 -0800 | [diff] [blame] | 407 | if (logger.GetTotalNs() != 0) { |
Elliott Hughes | 8b788fe | 2013-04-17 15:57:01 -0700 | [diff] [blame] | 408 | os << Dumpable<CumulativeLogger>(logger); |
Mathieu Chartier | 2b82db4 | 2012-11-14 17:29:05 -0800 | [diff] [blame] | 409 | const uint64_t total_ns = logger.GetTotalNs(); |
Ian Rogers | 1d54e73 | 2013-05-02 21:10:01 -0700 | [diff] [blame] | 410 | const uint64_t total_pause_ns = (*it)->GetTotalPausedTimeNs(); |
Mathieu Chartier | 2b82db4 | 2012-11-14 17:29:05 -0800 | [diff] [blame] | 411 | double seconds = NsToMs(logger.GetTotalNs()) / 1000.0; |
| 412 | const uint64_t freed_bytes = collector->GetTotalFreedBytes(); |
| 413 | const uint64_t freed_objects = collector->GetTotalFreedObjects(); |
Elliott Hughes | 8b788fe | 2013-04-17 15:57:01 -0700 | [diff] [blame] | 414 | os << collector->GetName() << " total time: " << PrettyDuration(total_ns) << "\n" |
| 415 | << collector->GetName() << " paused time: " << PrettyDuration(total_pause_ns) << "\n" |
| 416 | << collector->GetName() << " freed: " << freed_objects |
| 417 | << " objects with total size " << PrettySize(freed_bytes) << "\n" |
| 418 | << collector->GetName() << " throughput: " << freed_objects / seconds << "/s / " |
| 419 | << PrettySize(freed_bytes / seconds) << "/s\n"; |
Mathieu Chartier | 2b82db4 | 2012-11-14 17:29:05 -0800 | [diff] [blame] | 420 | total_duration += total_ns; |
| 421 | total_paused_time += total_pause_ns; |
Mathieu Chartier | 155dfe9 | 2012-10-09 14:24:49 -0700 | [diff] [blame] | 422 | } |
| 423 | } |
| 424 | uint64_t allocation_time = static_cast<uint64_t>(total_allocation_time_) * kTimeAdjust; |
Ian Rogers | 1d54e73 | 2013-05-02 21:10:01 -0700 | [diff] [blame] | 425 | size_t total_objects_allocated = GetObjectsAllocatedEver(); |
| 426 | size_t total_bytes_allocated = GetBytesAllocatedEver(); |
Mathieu Chartier | 155dfe9 | 2012-10-09 14:24:49 -0700 | [diff] [blame] | 427 | if (total_duration != 0) { |
| 428 | const double total_seconds = double(total_duration / 1000) / 1000000.0; |
Elliott Hughes | 8b788fe | 2013-04-17 15:57:01 -0700 | [diff] [blame] | 429 | os << "Total time spent in GC: " << PrettyDuration(total_duration) << "\n"; |
| 430 | os << "Mean GC size throughput: " |
Ian Rogers | 1d54e73 | 2013-05-02 21:10:01 -0700 | [diff] [blame] | 431 | << PrettySize(GetBytesFreedEver() / total_seconds) << "/s\n"; |
Elliott Hughes | 8b788fe | 2013-04-17 15:57:01 -0700 | [diff] [blame] | 432 | os << "Mean GC object throughput: " |
Ian Rogers | 1d54e73 | 2013-05-02 21:10:01 -0700 | [diff] [blame] | 433 | << (GetObjectsFreedEver() / total_seconds) << " objects/s\n"; |
Mathieu Chartier | 155dfe9 | 2012-10-09 14:24:49 -0700 | [diff] [blame] | 434 | } |
Elliott Hughes | 8b788fe | 2013-04-17 15:57:01 -0700 | [diff] [blame] | 435 | os << "Total number of allocations: " << total_objects_allocated << "\n"; |
| 436 | os << "Total bytes allocated " << PrettySize(total_bytes_allocated) << "\n"; |
Mathieu Chartier | 155dfe9 | 2012-10-09 14:24:49 -0700 | [diff] [blame] | 437 | if (measure_allocation_time_) { |
Elliott Hughes | 8b788fe | 2013-04-17 15:57:01 -0700 | [diff] [blame] | 438 | os << "Total time spent allocating: " << PrettyDuration(allocation_time) << "\n"; |
| 439 | os << "Mean allocation time: " << PrettyDuration(allocation_time / total_objects_allocated) |
| 440 | << "\n"; |
Mathieu Chartier | 155dfe9 | 2012-10-09 14:24:49 -0700 | [diff] [blame] | 441 | } |
Elliott Hughes | 8b788fe | 2013-04-17 15:57:01 -0700 | [diff] [blame] | 442 | os << "Total mutator paused time: " << PrettyDuration(total_paused_time) << "\n"; |
| 443 | os << "Total time waiting for GC to complete: " << PrettyDuration(total_wait_time_) << "\n"; |
Mathieu Chartier | 155dfe9 | 2012-10-09 14:24:49 -0700 | [diff] [blame] | 444 | } |
| 445 | |
Elliott Hughes | b3bd5f0 | 2012-03-08 21:05:27 -0800 | [diff] [blame] | 446 | Heap::~Heap() { |
Mathieu Chartier | 02b6a78 | 2012-10-26 13:51:26 -0700 | [diff] [blame] | 447 | if (kDumpGcPerformanceOnShutdown) { |
Elliott Hughes | 8b788fe | 2013-04-17 15:57:01 -0700 | [diff] [blame] | 448 | DumpGcPerformanceInfo(LOG(INFO)); |
Mathieu Chartier | 02b6a78 | 2012-10-26 13:51:26 -0700 | [diff] [blame] | 449 | } |
| 450 | |
Mathieu Chartier | 2b82db4 | 2012-11-14 17:29:05 -0800 | [diff] [blame] | 451 | STLDeleteElements(&mark_sweep_collectors_); |
| 452 | |
Mathieu Chartier | 357e9be | 2012-08-01 11:00:14 -0700 | [diff] [blame] | 453 | // If we don't reset then the mark stack complains in it's destructor. |
| 454 | allocation_stack_->Reset(); |
| 455 | live_stack_->Reset(); |
| 456 | |
Elliott Hughes | b3bd5f0 | 2012-03-08 21:05:27 -0800 | [diff] [blame] | 457 | VLOG(heap) << "~Heap()"; |
Elliott Hughes | b3e66df | 2012-01-12 14:49:18 -0800 | [diff] [blame] | 458 | // We can't take the heap lock here because there might be a daemon thread suspended with the |
| 459 | // heap lock held. We know though that no non-daemon threads are executing, and we know that |
| 460 | // all daemon threads are suspended, and we also know that the threads list have been deleted, so |
| 461 | // those threads can't resume. We're the only running thread, and we can do whatever we like... |
Ian Rogers | 1d54e73 | 2013-05-02 21:10:01 -0700 | [diff] [blame] | 462 | STLDeleteElements(&continuous_spaces_); |
| 463 | STLDeleteElements(&discontinuous_spaces_); |
Ian Rogers | 00f7d0e | 2012-07-19 15:28:27 -0700 | [diff] [blame] | 464 | delete gc_complete_lock_; |
Ian Rogers | 1d54e73 | 2013-05-02 21:10:01 -0700 | [diff] [blame] | 465 | delete reference_queue_lock_; |
Carl Shapiro | 69759ea | 2011-07-21 18:13:35 -0700 | [diff] [blame] | 466 | } |
| 467 | |
Ian Rogers | 1d54e73 | 2013-05-02 21:10:01 -0700 | [diff] [blame] | 468 | space::ContinuousSpace* Heap::FindContinuousSpaceFromObject(const mirror::Object* obj, |
| 469 | bool fail_ok) const { |
Mathieu Chartier | b062fdd | 2012-07-03 09:51:48 -0700 | [diff] [blame] | 470 | // TODO: C++0x auto |
Ian Rogers | 1d54e73 | 2013-05-02 21:10:01 -0700 | [diff] [blame] | 471 | typedef std::vector<space::ContinuousSpace*>::const_iterator It; |
| 472 | for (It it = continuous_spaces_.begin(), end = continuous_spaces_.end(); it != end; ++it) { |
Mathieu Chartier | fd678be | 2012-08-30 14:50:54 -0700 | [diff] [blame] | 473 | if ((*it)->Contains(obj)) { |
| 474 | return *it; |
Mathieu Chartier | b062fdd | 2012-07-03 09:51:48 -0700 | [diff] [blame] | 475 | } |
| 476 | } |
Ian Rogers | 1d54e73 | 2013-05-02 21:10:01 -0700 | [diff] [blame] | 477 | if (!fail_ok) { |
| 478 | LOG(FATAL) << "object " << reinterpret_cast<const void*>(obj) << " not inside any spaces!"; |
| 479 | } |
Mathieu Chartier | b062fdd | 2012-07-03 09:51:48 -0700 | [diff] [blame] | 480 | return NULL; |
| 481 | } |
| 482 | |
Ian Rogers | 1d54e73 | 2013-05-02 21:10:01 -0700 | [diff] [blame] | 483 | space::DiscontinuousSpace* Heap::FindDiscontinuousSpaceFromObject(const mirror::Object* obj, |
| 484 | bool fail_ok) const { |
Mathieu Chartier | b062fdd | 2012-07-03 09:51:48 -0700 | [diff] [blame] | 485 | // TODO: C++0x auto |
Ian Rogers | 1d54e73 | 2013-05-02 21:10:01 -0700 | [diff] [blame] | 486 | typedef std::vector<space::DiscontinuousSpace*>::const_iterator It; |
| 487 | for (It it = discontinuous_spaces_.begin(), end = discontinuous_spaces_.end(); it != end; ++it) { |
| 488 | if ((*it)->Contains(obj)) { |
| 489 | return *it; |
| 490 | } |
| 491 | } |
| 492 | if (!fail_ok) { |
| 493 | LOG(FATAL) << "object " << reinterpret_cast<const void*>(obj) << " not inside any spaces!"; |
| 494 | } |
| 495 | return NULL; |
| 496 | } |
| 497 | |
| 498 | space::Space* Heap::FindSpaceFromObject(const mirror::Object* obj, bool fail_ok) const { |
| 499 | space::Space* result = FindContinuousSpaceFromObject(obj, true); |
| 500 | if (result != NULL) { |
| 501 | return result; |
| 502 | } |
| 503 | return FindDiscontinuousSpaceFromObject(obj, true); |
| 504 | } |
| 505 | |
| 506 | space::ImageSpace* Heap::GetImageSpace() const { |
| 507 | // TODO: C++0x auto |
| 508 | typedef std::vector<space::ContinuousSpace*>::const_iterator It; |
| 509 | for (It it = continuous_spaces_.begin(), end = continuous_spaces_.end(); it != end; ++it) { |
Mathieu Chartier | fd678be | 2012-08-30 14:50:54 -0700 | [diff] [blame] | 510 | if ((*it)->IsImageSpace()) { |
| 511 | return (*it)->AsImageSpace(); |
Mathieu Chartier | b062fdd | 2012-07-03 09:51:48 -0700 | [diff] [blame] | 512 | } |
| 513 | } |
| 514 | return NULL; |
| 515 | } |
| 516 | |
Elliott Hughes | 8a8b9cb | 2012-04-13 18:29:22 -0700 | [diff] [blame] | 517 | 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] | 518 | 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] | 519 | if (used_bytes < chunk_size) { |
Mathieu Chartier | 2fde533 | 2012-09-14 14:51:54 -0700 | [diff] [blame] | 520 | size_t chunk_free_bytes = chunk_size - used_bytes; |
| 521 | size_t& max_contiguous_allocation = *reinterpret_cast<size_t*>(arg); |
| 522 | max_contiguous_allocation = std::max(max_contiguous_allocation, chunk_free_bytes); |
Elliott Hughes | 8a8b9cb | 2012-04-13 18:29:22 -0700 | [diff] [blame] | 523 | } |
Mathieu Chartier | e0f0cb3 | 2012-08-28 11:26:00 -0700 | [diff] [blame] | 524 | } |
| 525 | |
Ian Rogers | 2dd0e2c | 2013-01-24 12:42:14 -0800 | [diff] [blame] | 526 | mirror::Object* Heap::AllocObject(Thread* self, mirror::Class* c, size_t byte_count) { |
| 527 | DCHECK(c == NULL || (c->IsClassClass() && byte_count >= sizeof(mirror::Class)) || |
Ian Rogers | 00f7d0e | 2012-07-19 15:28:27 -0700 | [diff] [blame] | 528 | (c->IsVariableSize() || c->GetObjectSize() == byte_count) || |
| 529 | strlen(ClassHelper(c).GetDescriptor()) == 0); |
Ian Rogers | 2dd0e2c | 2013-01-24 12:42:14 -0800 | [diff] [blame] | 530 | DCHECK_GE(byte_count, sizeof(mirror::Object)); |
Mathieu Chartier | e0f0cb3 | 2012-08-28 11:26:00 -0700 | [diff] [blame] | 531 | |
Ian Rogers | 2dd0e2c | 2013-01-24 12:42:14 -0800 | [diff] [blame] | 532 | mirror::Object* obj = NULL; |
Mathieu Chartier | e0f0cb3 | 2012-08-28 11:26:00 -0700 | [diff] [blame] | 533 | size_t size = 0; |
Mathieu Chartier | 155dfe9 | 2012-10-09 14:24:49 -0700 | [diff] [blame] | 534 | uint64_t allocation_start = 0; |
| 535 | if (measure_allocation_time_) { |
| 536 | allocation_start = NanoTime(); |
| 537 | } |
Mathieu Chartier | e0f0cb3 | 2012-08-28 11:26:00 -0700 | [diff] [blame] | 538 | |
| 539 | // We need to have a zygote space or else our newly allocated large object can end up in the |
| 540 | // Zygote resulting in it being prematurely freed. |
| 541 | // We can only do this for primive objects since large objects will not be within the card table |
| 542 | // range. This also means that we rely on SetClass not dirtying the object's card. |
Ian Rogers | 22a2086 | 2013-03-16 16:34:57 -0700 | [diff] [blame] | 543 | if (byte_count >= large_object_threshold_ && have_zygote_space_ && c->IsPrimitiveArray()) { |
Mathieu Chartier | 2fde533 | 2012-09-14 14:51:54 -0700 | [diff] [blame] | 544 | size = RoundUp(byte_count, kPageSize); |
Ian Rogers | 1d54e73 | 2013-05-02 21:10:01 -0700 | [diff] [blame] | 545 | obj = Allocate(self, large_object_space_, size); |
Mathieu Chartier | 155dfe9 | 2012-10-09 14:24:49 -0700 | [diff] [blame] | 546 | // Make sure that our large object didn't get placed anywhere within the space interval or else |
| 547 | // it breaks the immune range. |
| 548 | DCHECK(obj == NULL || |
Ian Rogers | 1d54e73 | 2013-05-02 21:10:01 -0700 | [diff] [blame] | 549 | reinterpret_cast<byte*>(obj) < continuous_spaces_.front()->Begin() || |
| 550 | reinterpret_cast<byte*>(obj) >= continuous_spaces_.back()->End()); |
Mathieu Chartier | e0f0cb3 | 2012-08-28 11:26:00 -0700 | [diff] [blame] | 551 | } else { |
Ian Rogers | 50b35e2 | 2012-10-04 10:09:15 -0700 | [diff] [blame] | 552 | obj = Allocate(self, alloc_space_, byte_count); |
Mathieu Chartier | e0f0cb3 | 2012-08-28 11:26:00 -0700 | [diff] [blame] | 553 | |
Mathieu Chartier | 155dfe9 | 2012-10-09 14:24:49 -0700 | [diff] [blame] | 554 | // Ensure that we did not allocate into a zygote space. |
Ian Rogers | 1d54e73 | 2013-05-02 21:10:01 -0700 | [diff] [blame] | 555 | DCHECK(obj == NULL || !have_zygote_space_ || !FindSpaceFromObject(obj, false)->IsZygoteSpace()); |
Mathieu Chartier | 155dfe9 | 2012-10-09 14:24:49 -0700 | [diff] [blame] | 556 | size = alloc_space_->AllocationSize(obj); |
Mathieu Chartier | e0f0cb3 | 2012-08-28 11:26:00 -0700 | [diff] [blame] | 557 | } |
| 558 | |
Mathieu Chartier | 037813d | 2012-08-23 16:44:59 -0700 | [diff] [blame] | 559 | if (LIKELY(obj != NULL)) { |
Ian Rogers | 00f7d0e | 2012-07-19 15:28:27 -0700 | [diff] [blame] | 560 | obj->SetClass(c); |
Mathieu Chartier | 037813d | 2012-08-23 16:44:59 -0700 | [diff] [blame] | 561 | |
| 562 | // Record allocation after since we want to use the atomic add for the atomic fence to guard |
| 563 | // the SetClass since we do not want the class to appear NULL in another thread. |
Mathieu Chartier | e0f0cb3 | 2012-08-28 11:26:00 -0700 | [diff] [blame] | 564 | RecordAllocation(size, obj); |
Mathieu Chartier | 037813d | 2012-08-23 16:44:59 -0700 | [diff] [blame] | 565 | |
Ian Rogers | 00f7d0e | 2012-07-19 15:28:27 -0700 | [diff] [blame] | 566 | if (Dbg::IsAllocTrackingEnabled()) { |
| 567 | Dbg::RecordAllocation(c, byte_count); |
Elliott Hughes | 418dfe7 | 2011-10-06 18:56:27 -0700 | [diff] [blame] | 568 | } |
Mathieu Chartier | 2fde533 | 2012-09-14 14:51:54 -0700 | [diff] [blame] | 569 | if (static_cast<size_t>(num_bytes_allocated_) >= concurrent_start_bytes_) { |
Mathieu Chartier | e0f0cb3 | 2012-08-28 11:26:00 -0700 | [diff] [blame] | 570 | // We already have a request pending, no reason to start more until we update |
| 571 | // concurrent_start_bytes_. |
| 572 | concurrent_start_bytes_ = std::numeric_limits<size_t>::max(); |
Ian Rogers | 00f7d0e | 2012-07-19 15:28:27 -0700 | [diff] [blame] | 573 | // The SirtRef is necessary since the calls in RequestConcurrentGC are a safepoint. |
Ian Rogers | 2dd0e2c | 2013-01-24 12:42:14 -0800 | [diff] [blame] | 574 | SirtRef<mirror::Object> ref(self, obj); |
Ian Rogers | 1f53934 | 2012-10-03 21:09:42 -0700 | [diff] [blame] | 575 | RequestConcurrentGC(self); |
Ian Rogers | 00f7d0e | 2012-07-19 15:28:27 -0700 | [diff] [blame] | 576 | } |
| 577 | VerifyObject(obj); |
| 578 | |
Mathieu Chartier | 155dfe9 | 2012-10-09 14:24:49 -0700 | [diff] [blame] | 579 | if (measure_allocation_time_) { |
| 580 | total_allocation_time_ += (NanoTime() - allocation_start) / kTimeAdjust; |
| 581 | } |
| 582 | |
Ian Rogers | 00f7d0e | 2012-07-19 15:28:27 -0700 | [diff] [blame] | 583 | return obj; |
| 584 | } |
Mathieu Chartier | 80de7a6 | 2012-11-27 17:21:50 -0800 | [diff] [blame] | 585 | std::ostringstream oss; |
Mathieu Chartier | 037813d | 2012-08-23 16:44:59 -0700 | [diff] [blame] | 586 | int64_t total_bytes_free = GetFreeMemory(); |
Ian Rogers | 1d54e73 | 2013-05-02 21:10:01 -0700 | [diff] [blame] | 587 | uint64_t alloc_space_size = alloc_space_->GetBytesAllocated(); |
| 588 | uint64_t large_object_size = large_object_space_->GetObjectsAllocated(); |
Mathieu Chartier | 80de7a6 | 2012-11-27 17:21:50 -0800 | [diff] [blame] | 589 | oss << "Failed to allocate a " << byte_count << " byte allocation with " << total_bytes_free |
| 590 | << " free bytes; allocation space size " << alloc_space_size |
| 591 | << "; large object space size " << large_object_size; |
| 592 | // If the allocation failed due to fragmentation, print out the largest continuous allocation. |
| 593 | if (total_bytes_free >= byte_count) { |
| 594 | size_t max_contiguous_allocation = 0; |
| 595 | // TODO: C++0x auto |
Ian Rogers | 1d54e73 | 2013-05-02 21:10:01 -0700 | [diff] [blame] | 596 | typedef std::vector<space::ContinuousSpace*>::const_iterator It; |
| 597 | for (It it = continuous_spaces_.begin(), end = continuous_spaces_.end(); it != end; ++it) { |
| 598 | space::ContinuousSpace* space = *it; |
| 599 | if (space->IsDlMallocSpace()) { |
| 600 | space->AsDlMallocSpace()->Walk(MSpaceChunkCallback, &max_contiguous_allocation); |
Mathieu Chartier | 80de7a6 | 2012-11-27 17:21:50 -0800 | [diff] [blame] | 601 | } |
Mathieu Chartier | b062fdd | 2012-07-03 09:51:48 -0700 | [diff] [blame] | 602 | } |
Mathieu Chartier | 80de7a6 | 2012-11-27 17:21:50 -0800 | [diff] [blame] | 603 | oss << "; failed due to fragmentation (largest possible contiguous allocation " |
| 604 | << max_contiguous_allocation << " bytes)"; |
Carl Shapiro | 58551df | 2011-07-24 03:09:51 -0700 | [diff] [blame] | 605 | } |
Mathieu Chartier | 80de7a6 | 2012-11-27 17:21:50 -0800 | [diff] [blame] | 606 | self->ThrowOutOfMemoryError(oss.str().c_str()); |
Elliott Hughes | 418dfe7 | 2011-10-06 18:56:27 -0700 | [diff] [blame] | 607 | return NULL; |
Carl Shapiro | 58551df | 2011-07-24 03:09:51 -0700 | [diff] [blame] | 608 | } |
| 609 | |
Ian Rogers | 2dd0e2c | 2013-01-24 12:42:14 -0800 | [diff] [blame] | 610 | bool Heap::IsHeapAddress(const mirror::Object* obj) { |
Elliott Hughes | 92b3b56 | 2011-09-08 16:32:26 -0700 | [diff] [blame] | 611 | // Note: we deliberately don't take the lock here, and mustn't test anything that would |
| 612 | // require taking the lock. |
Elliott Hughes | 88c5c35 | 2012-03-15 18:49:48 -0700 | [diff] [blame] | 613 | if (obj == NULL) { |
| 614 | return true; |
| 615 | } |
Ian Rogers | 1d54e73 | 2013-05-02 21:10:01 -0700 | [diff] [blame] | 616 | if (UNLIKELY(!IsAligned<kObjectAlignment>(obj))) { |
Elliott Hughes | a250199 | 2011-08-26 19:39:54 -0700 | [diff] [blame] | 617 | return false; |
| 618 | } |
Ian Rogers | 1d54e73 | 2013-05-02 21:10:01 -0700 | [diff] [blame] | 619 | return FindSpaceFromObject(obj, true) != NULL; |
Elliott Hughes | a250199 | 2011-08-26 19:39:54 -0700 | [diff] [blame] | 620 | } |
| 621 | |
Ian Rogers | 2dd0e2c | 2013-01-24 12:42:14 -0800 | [diff] [blame] | 622 | bool Heap::IsLiveObjectLocked(const mirror::Object* obj) { |
Ian Rogers | 1d54e73 | 2013-05-02 21:10:01 -0700 | [diff] [blame] | 623 | //Locks::heap_bitmap_lock_->AssertReaderHeld(Thread::Current()); |
| 624 | if (obj == NULL) { |
| 625 | return false; |
| 626 | } |
| 627 | if (UNLIKELY(!IsAligned<kObjectAlignment>(obj))) { |
| 628 | return false; |
| 629 | } |
| 630 | space::ContinuousSpace* cont_space = FindContinuousSpaceFromObject(obj, true); |
| 631 | if (cont_space != NULL) { |
| 632 | if (cont_space->GetLiveBitmap()->Test(obj)) { |
| 633 | return true; |
| 634 | } |
| 635 | } else { |
| 636 | space::DiscontinuousSpace* disc_space = FindDiscontinuousSpaceFromObject(obj, true); |
| 637 | if (disc_space != NULL) { |
| 638 | if (disc_space->GetLiveObjects()->Test(obj)) { |
| 639 | return true; |
| 640 | } |
| 641 | } |
| 642 | } |
| 643 | for (size_t i = 0; i < 5; ++i) { |
| 644 | if (allocation_stack_->Contains(const_cast<mirror::Object*>(obj)) || |
| 645 | live_stack_->Contains(const_cast<mirror::Object*>(obj))) { |
| 646 | return true; |
| 647 | } |
| 648 | NanoSleep(MsToNs(10)); |
| 649 | } |
| 650 | return false; |
Elliott Hughes | 6a5bd49 | 2011-10-28 14:33:57 -0700 | [diff] [blame] | 651 | } |
| 652 | |
Ian Rogers | 04d7aa9 | 2013-03-16 14:29:17 -0700 | [diff] [blame] | 653 | void Heap::VerifyObjectImpl(const mirror::Object* obj) { |
| 654 | if (Thread::Current() == NULL || |
jeffhao | 2504552 | 2012-03-13 19:34:37 -0700 | [diff] [blame] | 655 | Runtime::Current()->GetThreadList()->GetLockOwner() == Thread::Current()->GetTid()) { |
Elliott Hughes | 85d1545 | 2011-09-16 17:33:01 -0700 | [diff] [blame] | 656 | return; |
| 657 | } |
Mathieu Chartier | 357e9be | 2012-08-01 11:00:14 -0700 | [diff] [blame] | 658 | VerifyObjectBody(obj); |
Elliott Hughes | 92b3b56 | 2011-09-08 16:32:26 -0700 | [diff] [blame] | 659 | } |
Elliott Hughes | 92b3b56 | 2011-09-08 16:32:26 -0700 | [diff] [blame] | 660 | |
Mathieu Chartier | cc236d7 | 2012-07-20 10:29:05 -0700 | [diff] [blame] | 661 | void Heap::DumpSpaces() { |
| 662 | // TODO: C++0x auto |
Ian Rogers | 1d54e73 | 2013-05-02 21:10:01 -0700 | [diff] [blame] | 663 | typedef std::vector<space::ContinuousSpace*>::const_iterator It; |
| 664 | for (It it = continuous_spaces_.begin(), end = continuous_spaces_.end(); it != end; ++it) { |
| 665 | space::ContinuousSpace* space = *it; |
| 666 | accounting::SpaceBitmap* live_bitmap = space->GetLiveBitmap(); |
| 667 | accounting::SpaceBitmap* mark_bitmap = space->GetMarkBitmap(); |
Mathieu Chartier | 7469ebf | 2012-09-24 16:28:36 -0700 | [diff] [blame] | 668 | LOG(INFO) << space << " " << *space << "\n" |
| 669 | << live_bitmap << " " << *live_bitmap << "\n" |
| 670 | << mark_bitmap << " " << *mark_bitmap; |
Mathieu Chartier | cc236d7 | 2012-07-20 10:29:05 -0700 | [diff] [blame] | 671 | } |
Ian Rogers | 1d54e73 | 2013-05-02 21:10:01 -0700 | [diff] [blame] | 672 | typedef std::vector<space::DiscontinuousSpace*>::const_iterator It2; |
| 673 | for (It2 it = discontinuous_spaces_.begin(), end = discontinuous_spaces_.end(); it != end; ++it) { |
| 674 | space::DiscontinuousSpace* space = *it; |
| 675 | LOG(INFO) << space << " " << *space << "\n"; |
Mathieu Chartier | 128c52c | 2012-10-16 14:12:41 -0700 | [diff] [blame] | 676 | } |
Mathieu Chartier | cc236d7 | 2012-07-20 10:29:05 -0700 | [diff] [blame] | 677 | } |
| 678 | |
Ian Rogers | 2dd0e2c | 2013-01-24 12:42:14 -0800 | [diff] [blame] | 679 | void Heap::VerifyObjectBody(const mirror::Object* obj) { |
Ian Rogers | 62d6c77 | 2013-02-27 08:32:07 -0800 | [diff] [blame] | 680 | if (UNLIKELY(!IsAligned<kObjectAlignment>(obj))) { |
Mathieu Chartier | dcf8d72 | 2012-08-02 14:55:54 -0700 | [diff] [blame] | 681 | LOG(FATAL) << "Object isn't aligned: " << obj; |
Mathieu Chartier | 0325e62 | 2012-09-05 14:22:51 -0700 | [diff] [blame] | 682 | } |
Ian Rogers | 62d6c77 | 2013-02-27 08:32:07 -0800 | [diff] [blame] | 683 | if (UNLIKELY(GetObjectsAllocated() <= 10)) { // Ignore early dawn of the universe verifications. |
| 684 | return; |
| 685 | } |
| 686 | const byte* raw_addr = reinterpret_cast<const byte*>(obj) + |
| 687 | mirror::Object::ClassOffset().Int32Value(); |
| 688 | const mirror::Class* c = *reinterpret_cast<mirror::Class* const *>(raw_addr); |
| 689 | if (UNLIKELY(c == NULL)) { |
| 690 | LOG(FATAL) << "Null class in object: " << obj; |
| 691 | } else if (UNLIKELY(!IsAligned<kObjectAlignment>(c))) { |
| 692 | LOG(FATAL) << "Class isn't aligned: " << c << " in object: " << obj; |
| 693 | } |
| 694 | // Check obj.getClass().getClass() == obj.getClass().getClass().getClass() |
| 695 | // Note: we don't use the accessors here as they have internal sanity checks |
| 696 | // that we don't want to run |
| 697 | raw_addr = reinterpret_cast<const byte*>(c) + mirror::Object::ClassOffset().Int32Value(); |
| 698 | const mirror::Class* c_c = *reinterpret_cast<mirror::Class* const *>(raw_addr); |
| 699 | raw_addr = reinterpret_cast<const byte*>(c_c) + mirror::Object::ClassOffset().Int32Value(); |
| 700 | const mirror::Class* c_c_c = *reinterpret_cast<mirror::Class* const *>(raw_addr); |
| 701 | CHECK_EQ(c_c, c_c_c); |
Mathieu Chartier | 0325e62 | 2012-09-05 14:22:51 -0700 | [diff] [blame] | 702 | |
Ian Rogers | 62d6c77 | 2013-02-27 08:32:07 -0800 | [diff] [blame] | 703 | if (verify_object_mode_ != kVerifyAllFast) { |
| 704 | // TODO: the bitmap tests below are racy if VerifyObjectBody is called without the |
| 705 | // heap_bitmap_lock_. |
Ian Rogers | 1d54e73 | 2013-05-02 21:10:01 -0700 | [diff] [blame] | 706 | if (!IsLiveObjectLocked(obj)) { |
| 707 | DumpSpaces(); |
| 708 | LOG(FATAL) << "Object is dead: " << obj; |
Mathieu Chartier | c7b83a0 | 2012-09-11 18:07:39 -0700 | [diff] [blame] | 709 | } |
Ian Rogers | 1d54e73 | 2013-05-02 21:10:01 -0700 | [diff] [blame] | 710 | if (!IsLiveObjectLocked(c)) { |
Mathieu Chartier | dcf8d72 | 2012-08-02 14:55:54 -0700 | [diff] [blame] | 711 | LOG(FATAL) << "Class of object is dead: " << c << " in object: " << obj; |
| 712 | } |
Mathieu Chartier | dcf8d72 | 2012-08-02 14:55:54 -0700 | [diff] [blame] | 713 | } |
Ian Rogers | 0cfe1fb | 2011-08-26 03:29:44 -0700 | [diff] [blame] | 714 | } |
| 715 | |
Ian Rogers | 2dd0e2c | 2013-01-24 12:42:14 -0800 | [diff] [blame] | 716 | void Heap::VerificationCallback(mirror::Object* obj, void* arg) { |
Ian Rogers | 0cfe1fb | 2011-08-26 03:29:44 -0700 | [diff] [blame] | 717 | DCHECK(obj != NULL); |
Mathieu Chartier | 357e9be | 2012-08-01 11:00:14 -0700 | [diff] [blame] | 718 | reinterpret_cast<Heap*>(arg)->VerifyObjectBody(obj); |
Ian Rogers | 0cfe1fb | 2011-08-26 03:29:44 -0700 | [diff] [blame] | 719 | } |
| 720 | |
| 721 | void Heap::VerifyHeap() { |
Ian Rogers | 50b35e2 | 2012-10-04 10:09:15 -0700 | [diff] [blame] | 722 | ReaderMutexLock mu(Thread::Current(), *Locks::heap_bitmap_lock_); |
Mathieu Chartier | b062fdd | 2012-07-03 09:51:48 -0700 | [diff] [blame] | 723 | GetLiveBitmap()->Walk(Heap::VerificationCallback, this); |
Ian Rogers | 0cfe1fb | 2011-08-26 03:29:44 -0700 | [diff] [blame] | 724 | } |
| 725 | |
Ian Rogers | 2dd0e2c | 2013-01-24 12:42:14 -0800 | [diff] [blame] | 726 | void Heap::RecordAllocation(size_t size, mirror::Object* obj) { |
Mathieu Chartier | fd678be | 2012-08-30 14:50:54 -0700 | [diff] [blame] | 727 | DCHECK(obj != NULL); |
Mathieu Chartier | fd678be | 2012-08-30 14:50:54 -0700 | [diff] [blame] | 728 | DCHECK_GT(size, 0u); |
Mathieu Chartier | 2fde533 | 2012-09-14 14:51:54 -0700 | [diff] [blame] | 729 | num_bytes_allocated_ += size; |
Mathieu Chartier | fd678be | 2012-08-30 14:50:54 -0700 | [diff] [blame] | 730 | |
| 731 | if (Runtime::Current()->HasStatsEnabled()) { |
Mathieu Chartier | fd678be | 2012-08-30 14:50:54 -0700 | [diff] [blame] | 732 | RuntimeStats* thread_stats = Thread::Current()->GetStats(); |
Mathieu Chartier | fd678be | 2012-08-30 14:50:54 -0700 | [diff] [blame] | 733 | ++thread_stats->allocated_objects; |
Mathieu Chartier | fd678be | 2012-08-30 14:50:54 -0700 | [diff] [blame] | 734 | thread_stats->allocated_bytes += size; |
Mathieu Chartier | 2fde533 | 2012-09-14 14:51:54 -0700 | [diff] [blame] | 735 | |
| 736 | // TODO: Update these atomically. |
| 737 | RuntimeStats* global_stats = Runtime::Current()->GetStats(); |
| 738 | ++global_stats->allocated_objects; |
| 739 | global_stats->allocated_bytes += size; |
Elliott Hughes | 9d5ccec | 2011-09-19 13:19:50 -0700 | [diff] [blame] | 740 | } |
Mathieu Chartier | 357e9be | 2012-08-01 11:00:14 -0700 | [diff] [blame] | 741 | |
Mathieu Chartier | d8195f1 | 2012-10-05 12:21:28 -0700 | [diff] [blame] | 742 | // This is safe to do since the GC will never free objects which are neither in the allocation |
| 743 | // stack or the live bitmap. |
| 744 | while (!allocation_stack_->AtomicPushBack(obj)) { |
Ian Rogers | 1d54e73 | 2013-05-02 21:10:01 -0700 | [diff] [blame] | 745 | CollectGarbageInternal(collector::kGcTypeSticky, kGcCauseForAlloc, false); |
Mathieu Chartier | d8195f1 | 2012-10-05 12:21:28 -0700 | [diff] [blame] | 746 | } |
Carl Shapiro | 58551df | 2011-07-24 03:09:51 -0700 | [diff] [blame] | 747 | } |
| 748 | |
Ian Rogers | 00f7d0e | 2012-07-19 15:28:27 -0700 | [diff] [blame] | 749 | void Heap::RecordFree(size_t freed_objects, size_t freed_bytes) { |
Mathieu Chartier | 2fde533 | 2012-09-14 14:51:54 -0700 | [diff] [blame] | 750 | DCHECK_LE(freed_bytes, static_cast<size_t>(num_bytes_allocated_)); |
| 751 | num_bytes_allocated_ -= freed_bytes; |
Elliott Hughes | 9d5ccec | 2011-09-19 13:19:50 -0700 | [diff] [blame] | 752 | |
| 753 | if (Runtime::Current()->HasStatsEnabled()) { |
Elliott Hughes | 9d5ccec | 2011-09-19 13:19:50 -0700 | [diff] [blame] | 754 | RuntimeStats* thread_stats = Thread::Current()->GetStats(); |
Mathieu Chartier | 357e9be | 2012-08-01 11:00:14 -0700 | [diff] [blame] | 755 | thread_stats->freed_objects += freed_objects; |
Elliott Hughes | 307f75d | 2011-10-12 18:04:40 -0700 | [diff] [blame] | 756 | thread_stats->freed_bytes += freed_bytes; |
Mathieu Chartier | 2fde533 | 2012-09-14 14:51:54 -0700 | [diff] [blame] | 757 | |
| 758 | // TODO: Do this concurrently. |
| 759 | RuntimeStats* global_stats = Runtime::Current()->GetStats(); |
| 760 | global_stats->freed_objects += freed_objects; |
| 761 | global_stats->freed_bytes += freed_bytes; |
Elliott Hughes | 9d5ccec | 2011-09-19 13:19:50 -0700 | [diff] [blame] | 762 | } |
Carl Shapiro | 58551df | 2011-07-24 03:09:51 -0700 | [diff] [blame] | 763 | } |
| 764 | |
Ian Rogers | 1d54e73 | 2013-05-02 21:10:01 -0700 | [diff] [blame] | 765 | mirror::Object* Heap::TryToAllocate(Thread* self, space::AllocSpace* space, size_t alloc_size, |
| 766 | bool grow) { |
Mathieu Chartier | 2fde533 | 2012-09-14 14:51:54 -0700 | [diff] [blame] | 767 | // Should we try to use a CAS here and fix up num_bytes_allocated_ later with AllocationSize? |
Mathieu Chartier | 2b82db4 | 2012-11-14 17:29:05 -0800 | [diff] [blame] | 768 | if (num_bytes_allocated_ + alloc_size > max_allowed_footprint_) { |
| 769 | // max_allowed_footprint_ <= growth_limit_ so it is safe to check in here. |
| 770 | if (num_bytes_allocated_ + alloc_size > growth_limit_) { |
| 771 | // Completely out of memory. |
Mathieu Chartier | 1c23e1e | 2012-10-12 14:14:11 -0700 | [diff] [blame] | 772 | return NULL; |
| 773 | } |
Mathieu Chartier | 2fde533 | 2012-09-14 14:51:54 -0700 | [diff] [blame] | 774 | } |
| 775 | |
Mathieu Chartier | 1c23e1e | 2012-10-12 14:14:11 -0700 | [diff] [blame] | 776 | return space->Alloc(self, alloc_size); |
Mathieu Chartier | e0f0cb3 | 2012-08-28 11:26:00 -0700 | [diff] [blame] | 777 | } |
| 778 | |
Ian Rogers | 1d54e73 | 2013-05-02 21:10:01 -0700 | [diff] [blame] | 779 | mirror::Object* Heap::Allocate(Thread* self, space::AllocSpace* space, size_t alloc_size) { |
Ian Rogers | 0399dde | 2012-06-06 17:09:28 -0700 | [diff] [blame] | 780 | // Since allocation can cause a GC which will need to SuspendAll, make sure all allocations are |
| 781 | // done in the runnable state where suspension is expected. |
Ian Rogers | 81d425b | 2012-09-27 16:03:43 -0700 | [diff] [blame] | 782 | DCHECK_EQ(self->GetState(), kRunnable); |
Ian Rogers | 00f7d0e | 2012-07-19 15:28:27 -0700 | [diff] [blame] | 783 | self->AssertThreadSuspensionIsAllowable(); |
Brian Carlstrom | b82b687 | 2011-10-26 17:18:07 -0700 | [diff] [blame] | 784 | |
Ian Rogers | 2dd0e2c | 2013-01-24 12:42:14 -0800 | [diff] [blame] | 785 | mirror::Object* ptr = TryToAllocate(self, space, alloc_size, false); |
Carl Shapiro | 69759ea | 2011-07-21 18:13:35 -0700 | [diff] [blame] | 786 | if (ptr != NULL) { |
| 787 | return ptr; |
| 788 | } |
| 789 | |
Mathieu Chartier | 866fb2a | 2012-09-10 10:47:49 -0700 | [diff] [blame] | 790 | // The allocation failed. If the GC is running, block until it completes, and then retry the |
| 791 | // allocation. |
Ian Rogers | 1d54e73 | 2013-05-02 21:10:01 -0700 | [diff] [blame] | 792 | collector::GcType last_gc = WaitForConcurrentGcToComplete(self); |
| 793 | if (last_gc != collector::kGcTypeNone) { |
Mathieu Chartier | 866fb2a | 2012-09-10 10:47:49 -0700 | [diff] [blame] | 794 | // A GC was in progress and we blocked, retry allocation now that memory has been freed. |
Ian Rogers | 50b35e2 | 2012-10-04 10:09:15 -0700 | [diff] [blame] | 795 | ptr = TryToAllocate(self, space, alloc_size, false); |
Mathieu Chartier | 866fb2a | 2012-09-10 10:47:49 -0700 | [diff] [blame] | 796 | if (ptr != NULL) { |
| 797 | return ptr; |
Carl Shapiro | 69759ea | 2011-07-21 18:13:35 -0700 | [diff] [blame] | 798 | } |
| 799 | } |
| 800 | |
Mathieu Chartier | 866fb2a | 2012-09-10 10:47:49 -0700 | [diff] [blame] | 801 | // Loop through our different Gc types and try to Gc until we get enough free memory. |
Ian Rogers | 1d54e73 | 2013-05-02 21:10:01 -0700 | [diff] [blame] | 802 | for (size_t i = static_cast<size_t>(last_gc) + 1; |
| 803 | i < static_cast<size_t>(collector::kGcTypeMax); ++i) { |
Mathieu Chartier | 866fb2a | 2012-09-10 10:47:49 -0700 | [diff] [blame] | 804 | bool run_gc = false; |
Ian Rogers | 1d54e73 | 2013-05-02 21:10:01 -0700 | [diff] [blame] | 805 | collector::GcType gc_type = static_cast<collector::GcType>(i); |
Mathieu Chartier | 866fb2a | 2012-09-10 10:47:49 -0700 | [diff] [blame] | 806 | switch (gc_type) { |
Ian Rogers | 1d54e73 | 2013-05-02 21:10:01 -0700 | [diff] [blame] | 807 | case collector::kGcTypeSticky: { |
Mathieu Chartier | 866fb2a | 2012-09-10 10:47:49 -0700 | [diff] [blame] | 808 | const size_t alloc_space_size = alloc_space_->Size(); |
Mathieu Chartier | c7b83a0 | 2012-09-11 18:07:39 -0700 | [diff] [blame] | 809 | run_gc = alloc_space_size > min_alloc_space_size_for_sticky_gc_ && |
| 810 | alloc_space_->Capacity() - alloc_space_size >= min_remaining_space_for_sticky_gc_; |
Mathieu Chartier | 866fb2a | 2012-09-10 10:47:49 -0700 | [diff] [blame] | 811 | break; |
| 812 | } |
Ian Rogers | 1d54e73 | 2013-05-02 21:10:01 -0700 | [diff] [blame] | 813 | case collector::kGcTypePartial: |
Mathieu Chartier | 866fb2a | 2012-09-10 10:47:49 -0700 | [diff] [blame] | 814 | run_gc = have_zygote_space_; |
| 815 | break; |
Ian Rogers | 1d54e73 | 2013-05-02 21:10:01 -0700 | [diff] [blame] | 816 | case collector::kGcTypeFull: |
Mathieu Chartier | 866fb2a | 2012-09-10 10:47:49 -0700 | [diff] [blame] | 817 | run_gc = true; |
| 818 | break; |
| 819 | default: |
| 820 | break; |
| 821 | } |
Carl Shapiro | 69759ea | 2011-07-21 18:13:35 -0700 | [diff] [blame] | 822 | |
Mathieu Chartier | 866fb2a | 2012-09-10 10:47:49 -0700 | [diff] [blame] | 823 | if (run_gc) { |
Mathieu Chartier | 866fb2a | 2012-09-10 10:47:49 -0700 | [diff] [blame] | 824 | // If we actually ran a different type of Gc than requested, we can skip the index forwards. |
Ian Rogers | 1d54e73 | 2013-05-02 21:10:01 -0700 | [diff] [blame] | 825 | collector::GcType gc_type_ran = CollectGarbageInternal(gc_type, kGcCauseForAlloc, false); |
Mathieu Chartier | 65db880 | 2012-11-20 12:36:46 -0800 | [diff] [blame] | 826 | DCHECK_GE(static_cast<size_t>(gc_type_ran), i); |
Mathieu Chartier | 866fb2a | 2012-09-10 10:47:49 -0700 | [diff] [blame] | 827 | i = static_cast<size_t>(gc_type_ran); |
Mathieu Chartier | 866fb2a | 2012-09-10 10:47:49 -0700 | [diff] [blame] | 828 | |
| 829 | // Did we free sufficient memory for the allocation to succeed? |
Ian Rogers | 50b35e2 | 2012-10-04 10:09:15 -0700 | [diff] [blame] | 830 | ptr = TryToAllocate(self, space, alloc_size, false); |
Mathieu Chartier | 866fb2a | 2012-09-10 10:47:49 -0700 | [diff] [blame] | 831 | if (ptr != NULL) { |
| 832 | return ptr; |
| 833 | } |
| 834 | } |
Ian Rogers | 00f7d0e | 2012-07-19 15:28:27 -0700 | [diff] [blame] | 835 | } |
| 836 | |
| 837 | // Allocations have failed after GCs; this is an exceptional state. |
Carl Shapiro | 69759ea | 2011-07-21 18:13:35 -0700 | [diff] [blame] | 838 | // Try harder, growing the heap if necessary. |
Ian Rogers | 50b35e2 | 2012-10-04 10:09:15 -0700 | [diff] [blame] | 839 | ptr = TryToAllocate(self, space, alloc_size, true); |
Carl Shapiro | 69759ea | 2011-07-21 18:13:35 -0700 | [diff] [blame] | 840 | if (ptr != NULL) { |
Carl Shapiro | 69759ea | 2011-07-21 18:13:35 -0700 | [diff] [blame] | 841 | return ptr; |
| 842 | } |
| 843 | |
Elliott Hughes | 81ff318 | 2012-03-23 20:35:56 -0700 | [diff] [blame] | 844 | // Most allocations should have succeeded by now, so the heap is really full, really fragmented, |
| 845 | // or the requested size is really big. Do another GC, collecting SoftReferences this time. The |
| 846 | // VM spec requires that all SoftReferences have been collected and cleared before throwing OOME. |
Carl Shapiro | 69759ea | 2011-07-21 18:13:35 -0700 | [diff] [blame] | 847 | |
Elliott Hughes | 418dfe7 | 2011-10-06 18:56:27 -0700 | [diff] [blame] | 848 | // OLD-TODO: wait for the finalizers from the previous GC to finish |
Mathieu Chartier | fd678be | 2012-08-30 14:50:54 -0700 | [diff] [blame] | 849 | VLOG(gc) << "Forcing collection of SoftReferences for " << PrettySize(alloc_size) |
| 850 | << " allocation"; |
Ian Rogers | 00f7d0e | 2012-07-19 15:28:27 -0700 | [diff] [blame] | 851 | |
Mathieu Chartier | fc8cfac | 2012-06-19 11:56:36 -0700 | [diff] [blame] | 852 | // We don't need a WaitForConcurrentGcToComplete here either. |
Ian Rogers | 1d54e73 | 2013-05-02 21:10:01 -0700 | [diff] [blame] | 853 | CollectGarbageInternal(collector::kGcTypeFull, kGcCauseForAlloc, true); |
Ian Rogers | 50b35e2 | 2012-10-04 10:09:15 -0700 | [diff] [blame] | 854 | return TryToAllocate(self, space, alloc_size, true); |
Carl Shapiro | 69759ea | 2011-07-21 18:13:35 -0700 | [diff] [blame] | 855 | } |
| 856 | |
Mathieu Chartier | 155dfe9 | 2012-10-09 14:24:49 -0700 | [diff] [blame] | 857 | void Heap::SetTargetHeapUtilization(float target) { |
| 858 | DCHECK_GT(target, 0.0f); // asserted in Java code |
| 859 | DCHECK_LT(target, 1.0f); |
| 860 | target_utilization_ = target; |
| 861 | } |
| 862 | |
Ian Rogers | 1d54e73 | 2013-05-02 21:10:01 -0700 | [diff] [blame] | 863 | size_t Heap::GetObjectsAllocated() const { |
| 864 | size_t total = 0; |
| 865 | typedef std::vector<space::ContinuousSpace*>::const_iterator It; |
| 866 | for (It it = continuous_spaces_.begin(), end = continuous_spaces_.end(); it != end; ++it) { |
| 867 | space::ContinuousSpace* space = *it; |
| 868 | if (space->IsDlMallocSpace()) { |
| 869 | total += space->AsDlMallocSpace()->GetObjectsAllocated(); |
Mathieu Chartier | 155dfe9 | 2012-10-09 14:24:49 -0700 | [diff] [blame] | 870 | } |
| 871 | } |
Ian Rogers | 1d54e73 | 2013-05-02 21:10:01 -0700 | [diff] [blame] | 872 | typedef std::vector<space::DiscontinuousSpace*>::const_iterator It2; |
| 873 | for (It2 it = discontinuous_spaces_.begin(), end = discontinuous_spaces_.end(); it != end; ++it) { |
| 874 | space::DiscontinuousSpace* space = *it; |
| 875 | total += space->AsLargeObjectSpace()->GetObjectsAllocated(); |
| 876 | } |
Mathieu Chartier | 155dfe9 | 2012-10-09 14:24:49 -0700 | [diff] [blame] | 877 | return total; |
| 878 | } |
| 879 | |
Ian Rogers | 1d54e73 | 2013-05-02 21:10:01 -0700 | [diff] [blame] | 880 | size_t Heap::GetObjectsAllocatedEver() const { |
| 881 | size_t total = 0; |
| 882 | typedef std::vector<space::ContinuousSpace*>::const_iterator It; |
| 883 | for (It it = continuous_spaces_.begin(), end = continuous_spaces_.end(); it != end; ++it) { |
| 884 | space::ContinuousSpace* space = *it; |
| 885 | if (space->IsDlMallocSpace()) { |
| 886 | total += space->AsDlMallocSpace()->GetTotalObjectsAllocated(); |
Mathieu Chartier | 155dfe9 | 2012-10-09 14:24:49 -0700 | [diff] [blame] | 887 | } |
| 888 | } |
Ian Rogers | 1d54e73 | 2013-05-02 21:10:01 -0700 | [diff] [blame] | 889 | typedef std::vector<space::DiscontinuousSpace*>::const_iterator It2; |
| 890 | for (It2 it = discontinuous_spaces_.begin(), end = discontinuous_spaces_.end(); it != end; ++it) { |
| 891 | space::DiscontinuousSpace* space = *it; |
| 892 | total += space->AsLargeObjectSpace()->GetTotalObjectsAllocated(); |
| 893 | } |
| 894 | return total; |
| 895 | } |
| 896 | |
| 897 | size_t Heap::GetBytesAllocatedEver() const { |
| 898 | size_t total = 0; |
| 899 | typedef std::vector<space::ContinuousSpace*>::const_iterator It; |
| 900 | for (It it = continuous_spaces_.begin(), end = continuous_spaces_.end(); it != end; ++it) { |
| 901 | space::ContinuousSpace* space = *it; |
| 902 | if (space->IsDlMallocSpace()) { |
| 903 | total += space->AsDlMallocSpace()->GetTotalBytesAllocated(); |
| 904 | } |
| 905 | } |
| 906 | typedef std::vector<space::DiscontinuousSpace*>::const_iterator It2; |
| 907 | for (It2 it = discontinuous_spaces_.begin(), end = discontinuous_spaces_.end(); it != end; ++it) { |
| 908 | space::DiscontinuousSpace* space = *it; |
| 909 | total += space->AsLargeObjectSpace()->GetTotalBytesAllocated(); |
| 910 | } |
Mathieu Chartier | 155dfe9 | 2012-10-09 14:24:49 -0700 | [diff] [blame] | 911 | return total; |
| 912 | } |
| 913 | |
Elliott Hughes | 9d5ccec | 2011-09-19 13:19:50 -0700 | [diff] [blame] | 914 | class InstanceCounter { |
| 915 | public: |
Ian Rogers | 2dd0e2c | 2013-01-24 12:42:14 -0800 | [diff] [blame] | 916 | 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] | 917 | SHARED_LOCKS_REQUIRED(Locks::mutator_lock_) |
Elliott Hughes | ec0f83d | 2013-01-15 16:54:08 -0800 | [diff] [blame] | 918 | : classes_(classes), use_is_assignable_from_(use_is_assignable_from), counts_(counts) { |
Elliott Hughes | 9d5ccec | 2011-09-19 13:19:50 -0700 | [diff] [blame] | 919 | } |
| 920 | |
Ian Rogers | 2dd0e2c | 2013-01-24 12:42:14 -0800 | [diff] [blame] | 921 | void operator()(const mirror::Object* o) const SHARED_LOCKS_REQUIRED(Locks::mutator_lock_) { |
Elliott Hughes | ec0f83d | 2013-01-15 16:54:08 -0800 | [diff] [blame] | 922 | for (size_t i = 0; i < classes_.size(); ++i) { |
Ian Rogers | 2dd0e2c | 2013-01-24 12:42:14 -0800 | [diff] [blame] | 923 | const mirror::Class* instance_class = o->GetClass(); |
Elliott Hughes | ec0f83d | 2013-01-15 16:54:08 -0800 | [diff] [blame] | 924 | if (use_is_assignable_from_) { |
| 925 | if (instance_class != NULL && classes_[i]->IsAssignableFrom(instance_class)) { |
| 926 | ++counts_[i]; |
| 927 | } |
| 928 | } else { |
| 929 | if (instance_class == classes_[i]) { |
| 930 | ++counts_[i]; |
| 931 | } |
Elliott Hughes | 9d5ccec | 2011-09-19 13:19:50 -0700 | [diff] [blame] | 932 | } |
| 933 | } |
| 934 | } |
| 935 | |
Mathieu Chartier | 7469ebf | 2012-09-24 16:28:36 -0700 | [diff] [blame] | 936 | private: |
Ian Rogers | 2dd0e2c | 2013-01-24 12:42:14 -0800 | [diff] [blame] | 937 | const std::vector<mirror::Class*>& classes_; |
Elliott Hughes | ec0f83d | 2013-01-15 16:54:08 -0800 | [diff] [blame] | 938 | bool use_is_assignable_from_; |
| 939 | uint64_t* const counts_; |
| 940 | |
| 941 | DISALLOW_COPY_AND_ASSIGN(InstanceCounter); |
Elliott Hughes | 9d5ccec | 2011-09-19 13:19:50 -0700 | [diff] [blame] | 942 | }; |
| 943 | |
Ian Rogers | 2dd0e2c | 2013-01-24 12:42:14 -0800 | [diff] [blame] | 944 | 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] | 945 | uint64_t* counts) { |
| 946 | // We only want reachable instances, so do a GC. This also ensures that the alloc stack |
| 947 | // is empty, so the live bitmap is the only place we need to look. |
| 948 | Thread* self = Thread::Current(); |
| 949 | self->TransitionFromRunnableToSuspended(kNative); |
| 950 | CollectGarbage(false); |
| 951 | self->TransitionFromSuspendedToRunnable(); |
| 952 | |
| 953 | InstanceCounter counter(classes, use_is_assignable_from, counts); |
| 954 | ReaderMutexLock mu(self, *Locks::heap_bitmap_lock_); |
Mathieu Chartier | 7469ebf | 2012-09-24 16:28:36 -0700 | [diff] [blame] | 955 | GetLiveBitmap()->Visit(counter); |
Elliott Hughes | 9d5ccec | 2011-09-19 13:19:50 -0700 | [diff] [blame] | 956 | } |
| 957 | |
Elliott Hughes | 3b78c94 | 2013-01-15 17:35:41 -0800 | [diff] [blame] | 958 | class InstanceCollector { |
| 959 | public: |
Ian Rogers | 2dd0e2c | 2013-01-24 12:42:14 -0800 | [diff] [blame] | 960 | 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] | 961 | SHARED_LOCKS_REQUIRED(Locks::mutator_lock_) |
| 962 | : class_(c), max_count_(max_count), instances_(instances) { |
| 963 | } |
| 964 | |
Ian Rogers | 2dd0e2c | 2013-01-24 12:42:14 -0800 | [diff] [blame] | 965 | void operator()(const mirror::Object* o) const SHARED_LOCKS_REQUIRED(Locks::mutator_lock_) { |
| 966 | const mirror::Class* instance_class = o->GetClass(); |
Elliott Hughes | 3b78c94 | 2013-01-15 17:35:41 -0800 | [diff] [blame] | 967 | if (instance_class == class_) { |
| 968 | if (max_count_ == 0 || instances_.size() < max_count_) { |
Ian Rogers | 2dd0e2c | 2013-01-24 12:42:14 -0800 | [diff] [blame] | 969 | instances_.push_back(const_cast<mirror::Object*>(o)); |
Elliott Hughes | 3b78c94 | 2013-01-15 17:35:41 -0800 | [diff] [blame] | 970 | } |
| 971 | } |
| 972 | } |
| 973 | |
| 974 | private: |
Ian Rogers | 2dd0e2c | 2013-01-24 12:42:14 -0800 | [diff] [blame] | 975 | mirror::Class* class_; |
Elliott Hughes | 3b78c94 | 2013-01-15 17:35:41 -0800 | [diff] [blame] | 976 | uint32_t max_count_; |
Ian Rogers | 2dd0e2c | 2013-01-24 12:42:14 -0800 | [diff] [blame] | 977 | std::vector<mirror::Object*>& instances_; |
Elliott Hughes | 3b78c94 | 2013-01-15 17:35:41 -0800 | [diff] [blame] | 978 | |
| 979 | DISALLOW_COPY_AND_ASSIGN(InstanceCollector); |
| 980 | }; |
| 981 | |
Ian Rogers | 2dd0e2c | 2013-01-24 12:42:14 -0800 | [diff] [blame] | 982 | void Heap::GetInstances(mirror::Class* c, int32_t max_count, |
| 983 | std::vector<mirror::Object*>& instances) { |
Elliott Hughes | 3b78c94 | 2013-01-15 17:35:41 -0800 | [diff] [blame] | 984 | // We only want reachable instances, so do a GC. This also ensures that the alloc stack |
| 985 | // is empty, so the live bitmap is the only place we need to look. |
| 986 | Thread* self = Thread::Current(); |
| 987 | self->TransitionFromRunnableToSuspended(kNative); |
| 988 | CollectGarbage(false); |
| 989 | self->TransitionFromSuspendedToRunnable(); |
| 990 | |
| 991 | InstanceCollector collector(c, max_count, instances); |
| 992 | ReaderMutexLock mu(self, *Locks::heap_bitmap_lock_); |
| 993 | GetLiveBitmap()->Visit(collector); |
| 994 | } |
| 995 | |
Elliott Hughes | 0cbaff5 | 2013-01-16 15:28:01 -0800 | [diff] [blame] | 996 | class ReferringObjectsFinder { |
| 997 | public: |
Ian Rogers | 2dd0e2c | 2013-01-24 12:42:14 -0800 | [diff] [blame] | 998 | ReferringObjectsFinder(mirror::Object* object, int32_t max_count, |
| 999 | std::vector<mirror::Object*>& referring_objects) |
Elliott Hughes | 0cbaff5 | 2013-01-16 15:28:01 -0800 | [diff] [blame] | 1000 | SHARED_LOCKS_REQUIRED(Locks::mutator_lock_) |
| 1001 | : object_(object), max_count_(max_count), referring_objects_(referring_objects) { |
| 1002 | } |
| 1003 | |
| 1004 | // For bitmap Visit. |
| 1005 | // TODO: Fix lock analysis to not use NO_THREAD_SAFETY_ANALYSIS, requires support for |
| 1006 | // annotalysis on visitors. |
Ian Rogers | 2dd0e2c | 2013-01-24 12:42:14 -0800 | [diff] [blame] | 1007 | void operator()(const mirror::Object* o) const NO_THREAD_SAFETY_ANALYSIS { |
Ian Rogers | 1d54e73 | 2013-05-02 21:10:01 -0700 | [diff] [blame] | 1008 | collector::MarkSweep::VisitObjectReferences(o, *this); |
Elliott Hughes | 0cbaff5 | 2013-01-16 15:28:01 -0800 | [diff] [blame] | 1009 | } |
| 1010 | |
| 1011 | // For MarkSweep::VisitObjectReferences. |
Ian Rogers | 2dd0e2c | 2013-01-24 12:42:14 -0800 | [diff] [blame] | 1012 | void operator ()(const mirror::Object* referrer, const mirror::Object* object, |
| 1013 | const MemberOffset&, bool) const { |
Elliott Hughes | 0cbaff5 | 2013-01-16 15:28:01 -0800 | [diff] [blame] | 1014 | if (object == object_ && (max_count_ == 0 || referring_objects_.size() < max_count_)) { |
Ian Rogers | 2dd0e2c | 2013-01-24 12:42:14 -0800 | [diff] [blame] | 1015 | referring_objects_.push_back(const_cast<mirror::Object*>(referrer)); |
Elliott Hughes | 0cbaff5 | 2013-01-16 15:28:01 -0800 | [diff] [blame] | 1016 | } |
| 1017 | } |
| 1018 | |
| 1019 | private: |
Ian Rogers | 2dd0e2c | 2013-01-24 12:42:14 -0800 | [diff] [blame] | 1020 | mirror::Object* object_; |
Elliott Hughes | 0cbaff5 | 2013-01-16 15:28:01 -0800 | [diff] [blame] | 1021 | uint32_t max_count_; |
Ian Rogers | 2dd0e2c | 2013-01-24 12:42:14 -0800 | [diff] [blame] | 1022 | std::vector<mirror::Object*>& referring_objects_; |
Elliott Hughes | 0cbaff5 | 2013-01-16 15:28:01 -0800 | [diff] [blame] | 1023 | |
| 1024 | DISALLOW_COPY_AND_ASSIGN(ReferringObjectsFinder); |
| 1025 | }; |
| 1026 | |
Ian Rogers | 2dd0e2c | 2013-01-24 12:42:14 -0800 | [diff] [blame] | 1027 | void Heap::GetReferringObjects(mirror::Object* o, int32_t max_count, |
| 1028 | std::vector<mirror::Object*>& referring_objects) { |
Elliott Hughes | 0cbaff5 | 2013-01-16 15:28:01 -0800 | [diff] [blame] | 1029 | // We only want reachable instances, so do a GC. This also ensures that the alloc stack |
| 1030 | // is empty, so the live bitmap is the only place we need to look. |
| 1031 | Thread* self = Thread::Current(); |
| 1032 | self->TransitionFromRunnableToSuspended(kNative); |
| 1033 | CollectGarbage(false); |
| 1034 | self->TransitionFromSuspendedToRunnable(); |
| 1035 | |
| 1036 | ReferringObjectsFinder finder(o, max_count, referring_objects); |
| 1037 | ReaderMutexLock mu(self, *Locks::heap_bitmap_lock_); |
| 1038 | GetLiveBitmap()->Visit(finder); |
| 1039 | } |
| 1040 | |
Ian Rogers | 30fab40 | 2012-01-23 15:43:46 -0800 | [diff] [blame] | 1041 | void Heap::CollectGarbage(bool clear_soft_references) { |
Mathieu Chartier | 866fb2a | 2012-09-10 10:47:49 -0700 | [diff] [blame] | 1042 | // Even if we waited for a GC we still need to do another GC since weaks allocated during the |
| 1043 | // last GC will not have necessarily been cleared. |
Ian Rogers | 81d425b | 2012-09-27 16:03:43 -0700 | [diff] [blame] | 1044 | Thread* self = Thread::Current(); |
| 1045 | WaitForConcurrentGcToComplete(self); |
Ian Rogers | 1d54e73 | 2013-05-02 21:10:01 -0700 | [diff] [blame] | 1046 | CollectGarbageInternal(collector::kGcTypeFull, kGcCauseExplicit, clear_soft_references); |
Carl Shapiro | 69759ea | 2011-07-21 18:13:35 -0700 | [diff] [blame] | 1047 | } |
| 1048 | |
Mathieu Chartier | cc236d7 | 2012-07-20 10:29:05 -0700 | [diff] [blame] | 1049 | void Heap::PreZygoteFork() { |
Ian Rogers | 00f7d0e | 2012-07-19 15:28:27 -0700 | [diff] [blame] | 1050 | static Mutex zygote_creation_lock_("zygote creation lock", kZygoteCreationLock); |
Mathieu Chartier | d22d548 | 2012-11-06 17:14:12 -0800 | [diff] [blame] | 1051 | // Do this before acquiring the zygote creation lock so that we don't get lock order violations. |
| 1052 | CollectGarbage(false); |
Ian Rogers | 81d425b | 2012-09-27 16:03:43 -0700 | [diff] [blame] | 1053 | Thread* self = Thread::Current(); |
| 1054 | MutexLock mu(self, zygote_creation_lock_); |
Mathieu Chartier | cc236d7 | 2012-07-20 10:29:05 -0700 | [diff] [blame] | 1055 | |
| 1056 | // Try to see if we have any Zygote spaces. |
| 1057 | if (have_zygote_space_) { |
| 1058 | return; |
| 1059 | } |
| 1060 | |
Mathieu Chartier | 357e9be | 2012-08-01 11:00:14 -0700 | [diff] [blame] | 1061 | VLOG(heap) << "Starting PreZygoteFork with alloc space size " << PrettySize(alloc_space_->Size()); |
| 1062 | |
| 1063 | { |
| 1064 | // Flush the alloc stack. |
Ian Rogers | 81d425b | 2012-09-27 16:03:43 -0700 | [diff] [blame] | 1065 | WriterMutexLock mu(self, *Locks::heap_bitmap_lock_); |
Mathieu Chartier | 357e9be | 2012-08-01 11:00:14 -0700 | [diff] [blame] | 1066 | FlushAllocStack(); |
| 1067 | } |
Mathieu Chartier | cc236d7 | 2012-07-20 10:29:05 -0700 | [diff] [blame] | 1068 | |
Ian Rogers | 1d54e73 | 2013-05-02 21:10:01 -0700 | [diff] [blame] | 1069 | // Turns the current alloc space into a Zygote space and obtain the new alloc space composed |
| 1070 | // of the remaining available heap memory. |
| 1071 | space::DlMallocSpace* zygote_space = alloc_space_; |
| 1072 | alloc_space_ = zygote_space->CreateZygoteSpace(); |
| 1073 | alloc_space_->SetFootprintLimit(alloc_space_->Capacity()); |
Mathieu Chartier | cc236d7 | 2012-07-20 10:29:05 -0700 | [diff] [blame] | 1074 | |
Ian Rogers | 1d54e73 | 2013-05-02 21:10:01 -0700 | [diff] [blame] | 1075 | // Change the GC retention policy of the zygote space to only collect when full. |
| 1076 | zygote_space->SetGcRetentionPolicy(space::kGcRetentionPolicyFullCollect); |
| 1077 | AddContinuousSpace(alloc_space_); |
| 1078 | have_zygote_space_ = true; |
Mathieu Chartier | 1cd9c5c | 2012-08-23 10:52:44 -0700 | [diff] [blame] | 1079 | |
Ian Rogers | 5f5a2c0 | 2012-09-17 10:52:08 -0700 | [diff] [blame] | 1080 | // Reset the cumulative loggers since we now have a few additional timing phases. |
Mathieu Chartier | 0325e62 | 2012-09-05 14:22:51 -0700 | [diff] [blame] | 1081 | // TODO: C++0x |
Ian Rogers | 1d54e73 | 2013-05-02 21:10:01 -0700 | [diff] [blame] | 1082 | typedef std::vector<collector::MarkSweep*>::const_iterator It; |
| 1083 | for (It it = mark_sweep_collectors_.begin(), end = mark_sweep_collectors_.end(); |
| 1084 | it != end; ++it) { |
Mathieu Chartier | 2b82db4 | 2012-11-14 17:29:05 -0800 | [diff] [blame] | 1085 | (*it)->ResetCumulativeStatistics(); |
Mathieu Chartier | 0325e62 | 2012-09-05 14:22:51 -0700 | [diff] [blame] | 1086 | } |
Mathieu Chartier | cc236d7 | 2012-07-20 10:29:05 -0700 | [diff] [blame] | 1087 | } |
| 1088 | |
Mathieu Chartier | 357e9be | 2012-08-01 11:00:14 -0700 | [diff] [blame] | 1089 | void Heap::FlushAllocStack() { |
Mathieu Chartier | e0f0cb3 | 2012-08-28 11:26:00 -0700 | [diff] [blame] | 1090 | MarkAllocStack(alloc_space_->GetLiveBitmap(), large_object_space_->GetLiveObjects(), |
| 1091 | allocation_stack_.get()); |
Mathieu Chartier | 357e9be | 2012-08-01 11:00:14 -0700 | [diff] [blame] | 1092 | allocation_stack_->Reset(); |
| 1093 | } |
| 1094 | |
Ian Rogers | 1d54e73 | 2013-05-02 21:10:01 -0700 | [diff] [blame] | 1095 | void Heap::MarkAllocStack(accounting::SpaceBitmap* bitmap, accounting::SpaceSetMap* large_objects, |
| 1096 | accounting::ObjectStack* stack) { |
Ian Rogers | 2dd0e2c | 2013-01-24 12:42:14 -0800 | [diff] [blame] | 1097 | mirror::Object** limit = stack->End(); |
| 1098 | for (mirror::Object** it = stack->Begin(); it != limit; ++it) { |
| 1099 | const mirror::Object* obj = *it; |
Mathieu Chartier | 357e9be | 2012-08-01 11:00:14 -0700 | [diff] [blame] | 1100 | DCHECK(obj != NULL); |
Mathieu Chartier | e0f0cb3 | 2012-08-28 11:26:00 -0700 | [diff] [blame] | 1101 | if (LIKELY(bitmap->HasAddress(obj))) { |
| 1102 | bitmap->Set(obj); |
| 1103 | } else { |
| 1104 | large_objects->Set(obj); |
| 1105 | } |
Mathieu Chartier | 357e9be | 2012-08-01 11:00:14 -0700 | [diff] [blame] | 1106 | } |
| 1107 | } |
| 1108 | |
Ian Rogers | 1d54e73 | 2013-05-02 21:10:01 -0700 | [diff] [blame] | 1109 | void Heap::UnMarkAllocStack(accounting::SpaceBitmap* bitmap, accounting::SpaceSetMap* large_objects, |
| 1110 | accounting::ObjectStack* stack) { |
Ian Rogers | 2dd0e2c | 2013-01-24 12:42:14 -0800 | [diff] [blame] | 1111 | mirror::Object** limit = stack->End(); |
| 1112 | for (mirror::Object** it = stack->Begin(); it != limit; ++it) { |
| 1113 | const mirror::Object* obj = *it; |
Mathieu Chartier | 357e9be | 2012-08-01 11:00:14 -0700 | [diff] [blame] | 1114 | DCHECK(obj != NULL); |
Mathieu Chartier | e0f0cb3 | 2012-08-28 11:26:00 -0700 | [diff] [blame] | 1115 | if (LIKELY(bitmap->HasAddress(obj))) { |
| 1116 | bitmap->Clear(obj); |
| 1117 | } else { |
| 1118 | large_objects->Clear(obj); |
| 1119 | } |
Mathieu Chartier | fd678be | 2012-08-30 14:50:54 -0700 | [diff] [blame] | 1120 | } |
| 1121 | } |
| 1122 | |
Ian Rogers | 1d54e73 | 2013-05-02 21:10:01 -0700 | [diff] [blame] | 1123 | collector::GcType Heap::CollectGarbageInternal(collector::GcType gc_type, GcCause gc_cause, |
| 1124 | bool clear_soft_references) { |
Ian Rogers | 81d425b | 2012-09-27 16:03:43 -0700 | [diff] [blame] | 1125 | Thread* self = Thread::Current(); |
Mathieu Chartier | 752a0e6 | 2013-06-27 11:03:27 -0700 | [diff] [blame] | 1126 | |
| 1127 | switch (gc_cause) { |
| 1128 | case kGcCauseForAlloc: |
| 1129 | ATRACE_BEGIN("GC (alloc)"); |
| 1130 | break; |
| 1131 | case kGcCauseBackground: |
| 1132 | ATRACE_BEGIN("GC (background)"); |
| 1133 | break; |
| 1134 | case kGcCauseExplicit: |
| 1135 | ATRACE_BEGIN("GC (explicit)"); |
| 1136 | break; |
| 1137 | } |
| 1138 | |
Mathieu Chartier | 65db880 | 2012-11-20 12:36:46 -0800 | [diff] [blame] | 1139 | ScopedThreadStateChange tsc(self, kWaitingPerformingGc); |
Ian Rogers | 81d425b | 2012-09-27 16:03:43 -0700 | [diff] [blame] | 1140 | Locks::mutator_lock_->AssertNotHeld(self); |
Carl Shapiro | 58551df | 2011-07-24 03:09:51 -0700 | [diff] [blame] | 1141 | |
Ian Rogers | 120f1c7 | 2012-09-28 17:17:10 -0700 | [diff] [blame] | 1142 | if (self->IsHandlingStackOverflow()) { |
| 1143 | LOG(WARNING) << "Performing GC on a thread that is handling a stack overflow."; |
| 1144 | } |
| 1145 | |
Ian Rogers | 00f7d0e | 2012-07-19 15:28:27 -0700 | [diff] [blame] | 1146 | // Ensure there is only one GC at a time. |
| 1147 | bool start_collect = false; |
| 1148 | while (!start_collect) { |
| 1149 | { |
Ian Rogers | 81d425b | 2012-09-27 16:03:43 -0700 | [diff] [blame] | 1150 | MutexLock mu(self, *gc_complete_lock_); |
Ian Rogers | 00f7d0e | 2012-07-19 15:28:27 -0700 | [diff] [blame] | 1151 | if (!is_gc_running_) { |
| 1152 | is_gc_running_ = true; |
| 1153 | start_collect = true; |
| 1154 | } |
| 1155 | } |
| 1156 | if (!start_collect) { |
Ian Rogers | 81d425b | 2012-09-27 16:03:43 -0700 | [diff] [blame] | 1157 | WaitForConcurrentGcToComplete(self); |
Ian Rogers | 00f7d0e | 2012-07-19 15:28:27 -0700 | [diff] [blame] | 1158 | // TODO: if another thread beat this one to do the GC, perhaps we should just return here? |
| 1159 | // Not doing at the moment to ensure soft references are cleared. |
| 1160 | } |
| 1161 | } |
Ian Rogers | 81d425b | 2012-09-27 16:03:43 -0700 | [diff] [blame] | 1162 | gc_complete_lock_->AssertNotHeld(self); |
Mathieu Chartier | 357e9be | 2012-08-01 11:00:14 -0700 | [diff] [blame] | 1163 | |
Mathieu Chartier | 2fde533 | 2012-09-14 14:51:54 -0700 | [diff] [blame] | 1164 | if (gc_cause == kGcCauseForAlloc && Runtime::Current()->HasStatsEnabled()) { |
| 1165 | ++Runtime::Current()->GetStats()->gc_for_alloc_count; |
| 1166 | ++Thread::Current()->GetStats()->gc_for_alloc_count; |
| 1167 | } |
| 1168 | |
Mathieu Chartier | 357e9be | 2012-08-01 11:00:14 -0700 | [diff] [blame] | 1169 | // We need to do partial GCs every now and then to avoid the heap growing too much and |
| 1170 | // fragmenting. |
Ian Rogers | 1d54e73 | 2013-05-02 21:10:01 -0700 | [diff] [blame] | 1171 | // TODO: if sticky GCs are failing to free memory then we should lower the |
| 1172 | // sticky_to_partial_gc_ratio_, if they are successful we can increase it. |
| 1173 | if (gc_type == collector::kGcTypeSticky) { |
| 1174 | ++sticky_gc_count_; |
| 1175 | if (sticky_gc_count_ >= sticky_to_partial_gc_ratio_) { |
| 1176 | gc_type = have_zygote_space_ ? collector::kGcTypePartial : collector::kGcTypeFull; |
| 1177 | sticky_gc_count_ = 0; |
| 1178 | } |
| 1179 | } else { |
Mathieu Chartier | 357e9be | 2012-08-01 11:00:14 -0700 | [diff] [blame] | 1180 | sticky_gc_count_ = 0; |
| 1181 | } |
Mathieu Chartier | d22d548 | 2012-11-06 17:14:12 -0800 | [diff] [blame] | 1182 | |
Ian Rogers | 1d54e73 | 2013-05-02 21:10:01 -0700 | [diff] [blame] | 1183 | uint64_t gc_start_time_ns = NanoTime(); |
Mathieu Chartier | 65db880 | 2012-11-20 12:36:46 -0800 | [diff] [blame] | 1184 | uint64_t gc_start_size = GetBytesAllocated(); |
| 1185 | // Approximate allocation rate in bytes / second. |
Ian Rogers | 1d54e73 | 2013-05-02 21:10:01 -0700 | [diff] [blame] | 1186 | if (UNLIKELY(gc_start_time_ns == last_gc_time_ns_)) { |
Jeff Hao | 9bd0281 | 2013-02-08 14:29:50 -0800 | [diff] [blame] | 1187 | LOG(WARNING) << "Timers are broken (gc_start_time == last_gc_time_)."; |
| 1188 | } |
Ian Rogers | 1d54e73 | 2013-05-02 21:10:01 -0700 | [diff] [blame] | 1189 | uint64_t ms_delta = NsToMs(gc_start_time_ns - last_gc_time_ns_); |
Mathieu Chartier | 65db880 | 2012-11-20 12:36:46 -0800 | [diff] [blame] | 1190 | if (ms_delta != 0) { |
Ian Rogers | 1d54e73 | 2013-05-02 21:10:01 -0700 | [diff] [blame] | 1191 | allocation_rate_ = ((gc_start_size - last_gc_size_) * 1000) / ms_delta; |
Mathieu Chartier | 65db880 | 2012-11-20 12:36:46 -0800 | [diff] [blame] | 1192 | VLOG(heap) << "Allocation rate: " << PrettySize(allocation_rate_) << "/s"; |
| 1193 | } |
| 1194 | |
Ian Rogers | 1d54e73 | 2013-05-02 21:10:01 -0700 | [diff] [blame] | 1195 | DCHECK_LT(gc_type, collector::kGcTypeMax); |
| 1196 | DCHECK_NE(gc_type, collector::kGcTypeNone); |
| 1197 | collector::MarkSweep* collector = NULL; |
| 1198 | typedef std::vector<collector::MarkSweep*>::iterator It; |
| 1199 | for (It it = mark_sweep_collectors_.begin(), end = mark_sweep_collectors_.end(); |
| 1200 | it != end; ++it) { |
| 1201 | collector::MarkSweep* cur_collector = *it; |
Mathieu Chartier | 2b82db4 | 2012-11-14 17:29:05 -0800 | [diff] [blame] | 1202 | if (cur_collector->IsConcurrent() == concurrent_gc_ && cur_collector->GetGcType() == gc_type) { |
| 1203 | collector = cur_collector; |
| 1204 | break; |
| 1205 | } |
Mathieu Chartier | 357e9be | 2012-08-01 11:00:14 -0700 | [diff] [blame] | 1206 | } |
Mathieu Chartier | 2b82db4 | 2012-11-14 17:29:05 -0800 | [diff] [blame] | 1207 | CHECK(collector != NULL) |
| 1208 | << "Could not find garbage collector with concurrent=" << concurrent_gc_ |
| 1209 | << " and type=" << gc_type; |
| 1210 | collector->clear_soft_references_ = clear_soft_references; |
| 1211 | collector->Run(); |
Ian Rogers | 1d54e73 | 2013-05-02 21:10:01 -0700 | [diff] [blame] | 1212 | total_objects_freed_ever_ += collector->GetFreedObjects(); |
| 1213 | total_bytes_freed_ever_ += collector->GetFreedBytes(); |
Mathieu Chartier | 2b82db4 | 2012-11-14 17:29:05 -0800 | [diff] [blame] | 1214 | |
Ian Rogers | 1d54e73 | 2013-05-02 21:10:01 -0700 | [diff] [blame] | 1215 | const size_t duration = collector->GetDurationNs(); |
Mathieu Chartier | 2b82db4 | 2012-11-14 17:29:05 -0800 | [diff] [blame] | 1216 | std::vector<uint64_t> pauses = collector->GetPauseTimes(); |
| 1217 | bool was_slow = duration > kSlowGcThreshold || |
| 1218 | (gc_cause == kGcCauseForAlloc && duration > kLongGcPauseThreshold); |
| 1219 | for (size_t i = 0; i < pauses.size(); ++i) { |
| 1220 | if (pauses[i] > kLongGcPauseThreshold) { |
| 1221 | was_slow = true; |
| 1222 | } |
| 1223 | } |
| 1224 | |
| 1225 | if (was_slow) { |
| 1226 | const size_t percent_free = GetPercentFree(); |
Ian Rogers | 1d54e73 | 2013-05-02 21:10:01 -0700 | [diff] [blame] | 1227 | const size_t current_heap_size = GetBytesAllocated(); |
Mathieu Chartier | 2b82db4 | 2012-11-14 17:29:05 -0800 | [diff] [blame] | 1228 | const size_t total_memory = GetTotalMemory(); |
| 1229 | std::ostringstream pause_string; |
| 1230 | for (size_t i = 0; i < pauses.size(); ++i) { |
| 1231 | pause_string << PrettyDuration((pauses[i] / 1000) * 1000) |
| 1232 | << ((i != pauses.size() - 1) ? ", " : ""); |
| 1233 | } |
| 1234 | LOG(INFO) << gc_cause << " " << collector->GetName() |
Sameer Abu Asal | a843954 | 2013-02-14 16:06:42 -0800 | [diff] [blame] | 1235 | << "GC freed " << PrettySize(collector->GetFreedBytes()) << ", " |
| 1236 | << percent_free << "% free, " << PrettySize(current_heap_size) << "/" |
| 1237 | << PrettySize(total_memory) << ", " << "paused " << pause_string.str() |
| 1238 | << " total " << PrettyDuration((duration / 1000) * 1000); |
Mathieu Chartier | 2b82db4 | 2012-11-14 17:29:05 -0800 | [diff] [blame] | 1239 | if (VLOG_IS_ON(heap)) { |
Ian Rogers | 1d54e73 | 2013-05-02 21:10:01 -0700 | [diff] [blame] | 1240 | LOG(INFO) << Dumpable<base::NewTimingLogger>(collector->GetTimings()); |
Mathieu Chartier | 2b82db4 | 2012-11-14 17:29:05 -0800 | [diff] [blame] | 1241 | } |
| 1242 | } |
Mathieu Chartier | 357e9be | 2012-08-01 11:00:14 -0700 | [diff] [blame] | 1243 | |
Ian Rogers | 15bf2d3 | 2012-08-28 17:33:04 -0700 | [diff] [blame] | 1244 | { |
Ian Rogers | 81d425b | 2012-09-27 16:03:43 -0700 | [diff] [blame] | 1245 | MutexLock mu(self, *gc_complete_lock_); |
Ian Rogers | 15bf2d3 | 2012-08-28 17:33:04 -0700 | [diff] [blame] | 1246 | is_gc_running_ = false; |
Mathieu Chartier | 866fb2a | 2012-09-10 10:47:49 -0700 | [diff] [blame] | 1247 | last_gc_type_ = gc_type; |
Ian Rogers | 15bf2d3 | 2012-08-28 17:33:04 -0700 | [diff] [blame] | 1248 | // Wake anyone who may have been waiting for the GC to complete. |
Ian Rogers | c604d73 | 2012-10-14 16:09:54 -0700 | [diff] [blame] | 1249 | gc_complete_cond_->Broadcast(self); |
Ian Rogers | 15bf2d3 | 2012-08-28 17:33:04 -0700 | [diff] [blame] | 1250 | } |
| 1251 | // Inform DDMS that a GC completed. |
Mathieu Chartier | 752a0e6 | 2013-06-27 11:03:27 -0700 | [diff] [blame] | 1252 | ATRACE_END(); |
Ian Rogers | 15bf2d3 | 2012-08-28 17:33:04 -0700 | [diff] [blame] | 1253 | Dbg::GcDidFinish(); |
Mathieu Chartier | 866fb2a | 2012-09-10 10:47:49 -0700 | [diff] [blame] | 1254 | return gc_type; |
Ian Rogers | 00f7d0e | 2012-07-19 15:28:27 -0700 | [diff] [blame] | 1255 | } |
Mathieu Chartier | a639903 | 2012-06-11 18:49:50 -0700 | [diff] [blame] | 1256 | |
Ian Rogers | 1d54e73 | 2013-05-02 21:10:01 -0700 | [diff] [blame] | 1257 | void Heap::UpdateAndMarkModUnion(collector::MarkSweep* mark_sweep, base::NewTimingLogger& timings, |
| 1258 | collector::GcType gc_type) { |
| 1259 | if (gc_type == collector::kGcTypeSticky) { |
Mathieu Chartier | 7469ebf | 2012-09-24 16:28:36 -0700 | [diff] [blame] | 1260 | // Don't need to do anything for mod union table in this case since we are only scanning dirty |
Mathieu Chartier | fd678be | 2012-08-30 14:50:54 -0700 | [diff] [blame] | 1261 | // cards. |
| 1262 | return; |
| 1263 | } |
| 1264 | |
| 1265 | // Update zygote mod union table. |
Ian Rogers | 1d54e73 | 2013-05-02 21:10:01 -0700 | [diff] [blame] | 1266 | if (gc_type == collector::kGcTypePartial) { |
| 1267 | timings.NewSplit("UpdateZygoteModUnionTable"); |
Mathieu Chartier | fd678be | 2012-08-30 14:50:54 -0700 | [diff] [blame] | 1268 | zygote_mod_union_table_->Update(); |
Mathieu Chartier | fd678be | 2012-08-30 14:50:54 -0700 | [diff] [blame] | 1269 | |
Ian Rogers | 1d54e73 | 2013-05-02 21:10:01 -0700 | [diff] [blame] | 1270 | timings.NewSplit("ZygoteMarkReferences"); |
Mathieu Chartier | 7469ebf | 2012-09-24 16:28:36 -0700 | [diff] [blame] | 1271 | zygote_mod_union_table_->MarkReferences(mark_sweep); |
Mathieu Chartier | fd678be | 2012-08-30 14:50:54 -0700 | [diff] [blame] | 1272 | } |
| 1273 | |
| 1274 | // Processes the cards we cleared earlier and adds their objects into the mod-union table. |
Ian Rogers | 1d54e73 | 2013-05-02 21:10:01 -0700 | [diff] [blame] | 1275 | timings.NewSplit("UpdateModUnionTable"); |
| 1276 | image_mod_union_table_->Update(); |
Mathieu Chartier | fd678be | 2012-08-30 14:50:54 -0700 | [diff] [blame] | 1277 | |
| 1278 | // Scans all objects in the mod-union table. |
Ian Rogers | 1d54e73 | 2013-05-02 21:10:01 -0700 | [diff] [blame] | 1279 | timings.NewSplit("MarkImageToAllocSpaceReferences"); |
| 1280 | image_mod_union_table_->MarkReferences(mark_sweep); |
Mathieu Chartier | fd678be | 2012-08-30 14:50:54 -0700 | [diff] [blame] | 1281 | } |
| 1282 | |
Ian Rogers | 1d54e73 | 2013-05-02 21:10:01 -0700 | [diff] [blame] | 1283 | static void RootMatchesObjectVisitor(const mirror::Object* root, void* arg) { |
Ian Rogers | 2dd0e2c | 2013-01-24 12:42:14 -0800 | [diff] [blame] | 1284 | mirror::Object* obj = reinterpret_cast<mirror::Object*>(arg); |
Mathieu Chartier | fd678be | 2012-08-30 14:50:54 -0700 | [diff] [blame] | 1285 | if (root == obj) { |
| 1286 | LOG(INFO) << "Object " << obj << " is a root"; |
| 1287 | } |
| 1288 | } |
| 1289 | |
| 1290 | class ScanVisitor { |
| 1291 | public: |
Ian Rogers | 2dd0e2c | 2013-01-24 12:42:14 -0800 | [diff] [blame] | 1292 | void operator ()(const mirror::Object* obj) const { |
Mathieu Chartier | fd678be | 2012-08-30 14:50:54 -0700 | [diff] [blame] | 1293 | LOG(INFO) << "Would have rescanned object " << obj; |
| 1294 | } |
| 1295 | }; |
| 1296 | |
Ian Rogers | 1d54e73 | 2013-05-02 21:10:01 -0700 | [diff] [blame] | 1297 | // Verify a reference from an object. |
Mathieu Chartier | fd678be | 2012-08-30 14:50:54 -0700 | [diff] [blame] | 1298 | class VerifyReferenceVisitor { |
| 1299 | public: |
Ian Rogers | 1d54e73 | 2013-05-02 21:10:01 -0700 | [diff] [blame] | 1300 | VerifyReferenceVisitor(Heap* heap) |
| 1301 | SHARED_LOCKS_REQUIRED(Locks::mutator_lock_, Locks::heap_bitmap_lock_) |
| 1302 | : heap_(heap), failed_(false) { |
| 1303 | } |
| 1304 | |
| 1305 | bool Failed() const { |
| 1306 | return failed_; |
Mathieu Chartier | fd678be | 2012-08-30 14:50:54 -0700 | [diff] [blame] | 1307 | } |
| 1308 | |
| 1309 | // 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] | 1310 | // analysis on visitors. |
Ian Rogers | 2dd0e2c | 2013-01-24 12:42:14 -0800 | [diff] [blame] | 1311 | void operator ()(const mirror::Object* obj, const mirror::Object* ref, |
Ian Rogers | 1d54e73 | 2013-05-02 21:10:01 -0700 | [diff] [blame] | 1312 | const MemberOffset& offset, bool /* is_static */) const |
Ian Rogers | 2dd0e2c | 2013-01-24 12:42:14 -0800 | [diff] [blame] | 1313 | NO_THREAD_SAFETY_ANALYSIS { |
Mathieu Chartier | fd678be | 2012-08-30 14:50:54 -0700 | [diff] [blame] | 1314 | // Verify that the reference is live. |
Ian Rogers | 1d54e73 | 2013-05-02 21:10:01 -0700 | [diff] [blame] | 1315 | if (UNLIKELY(ref != NULL && !IsLive(ref))) { |
| 1316 | accounting::CardTable* card_table = heap_->GetCardTable(); |
| 1317 | accounting::ObjectStack* alloc_stack = heap_->allocation_stack_.get(); |
| 1318 | accounting::ObjectStack* live_stack = heap_->live_stack_.get(); |
Mathieu Chartier | fd678be | 2012-08-30 14:50:54 -0700 | [diff] [blame] | 1319 | |
Ian Rogers | 1d54e73 | 2013-05-02 21:10:01 -0700 | [diff] [blame] | 1320 | if (obj != NULL) { |
| 1321 | byte* card_addr = card_table->CardFromAddr(obj); |
| 1322 | LOG(ERROR) << "Object " << obj << " references dead object " << ref << " at offset " << offset |
| 1323 | << "\nIsDirty = " << (*card_addr == accounting::CardTable::kCardDirty) |
| 1324 | << "\nObj type " << PrettyTypeOf(obj) |
| 1325 | << "\nRef type " << PrettyTypeOf(ref); |
| 1326 | card_table->CheckAddrIsInCardTable(reinterpret_cast<const byte*>(obj)); |
| 1327 | void* cover_begin = card_table->AddrFromCard(card_addr); |
| 1328 | void* cover_end = reinterpret_cast<void*>(reinterpret_cast<size_t>(cover_begin) + |
| 1329 | accounting::CardTable::kCardSize); |
| 1330 | LOG(ERROR) << "Card " << reinterpret_cast<void*>(card_addr) << " covers " << cover_begin |
| 1331 | << "-" << cover_end; |
| 1332 | accounting::SpaceBitmap* bitmap = heap_->GetLiveBitmap()->GetContinuousSpaceBitmap(obj); |
Mathieu Chartier | fd678be | 2012-08-30 14:50:54 -0700 | [diff] [blame] | 1333 | |
Ian Rogers | 1d54e73 | 2013-05-02 21:10:01 -0700 | [diff] [blame] | 1334 | // Print out how the object is live. |
| 1335 | if (bitmap != NULL && bitmap->Test(obj)) { |
| 1336 | LOG(ERROR) << "Object " << obj << " found in live bitmap"; |
| 1337 | } |
| 1338 | if (alloc_stack->Contains(const_cast<mirror::Object*>(obj))) { |
| 1339 | LOG(ERROR) << "Object " << obj << " found in allocation stack"; |
| 1340 | } |
| 1341 | if (live_stack->Contains(const_cast<mirror::Object*>(obj))) { |
| 1342 | LOG(ERROR) << "Object " << obj << " found in live stack"; |
| 1343 | } |
| 1344 | // Attempt to see if the card table missed the reference. |
| 1345 | ScanVisitor scan_visitor; |
| 1346 | byte* byte_cover_begin = reinterpret_cast<byte*>(card_table->AddrFromCard(card_addr)); |
| 1347 | card_table->Scan(bitmap, byte_cover_begin, |
| 1348 | byte_cover_begin + accounting::CardTable::kCardSize, |
| 1349 | scan_visitor, VoidFunctor()); |
| 1350 | |
| 1351 | // Search to see if any of the roots reference our object. |
| 1352 | void* arg = const_cast<void*>(reinterpret_cast<const void*>(obj)); |
| 1353 | Runtime::Current()->VisitRoots(&RootMatchesObjectVisitor, arg, false, false); |
| 1354 | |
| 1355 | // Search to see if any of the roots reference our reference. |
| 1356 | arg = const_cast<void*>(reinterpret_cast<const void*>(ref)); |
| 1357 | Runtime::Current()->VisitRoots(&RootMatchesObjectVisitor, arg, false, false); |
| 1358 | } else { |
| 1359 | LOG(ERROR) << "Root references dead object " << ref << "\nRef type " << PrettyTypeOf(ref); |
Mathieu Chartier | c7b83a0 | 2012-09-11 18:07:39 -0700 | [diff] [blame] | 1360 | } |
Ian Rogers | 1d54e73 | 2013-05-02 21:10:01 -0700 | [diff] [blame] | 1361 | if (alloc_stack->Contains(const_cast<mirror::Object*>(ref))) { |
| 1362 | LOG(ERROR) << "Reference " << ref << " found in allocation stack!"; |
Mathieu Chartier | c7b83a0 | 2012-09-11 18:07:39 -0700 | [diff] [blame] | 1363 | } |
Ian Rogers | 1d54e73 | 2013-05-02 21:10:01 -0700 | [diff] [blame] | 1364 | if (live_stack->Contains(const_cast<mirror::Object*>(ref))) { |
Mathieu Chartier | c7b83a0 | 2012-09-11 18:07:39 -0700 | [diff] [blame] | 1365 | LOG(ERROR) << "Reference " << ref << " found in live stack!"; |
Mathieu Chartier | fd678be | 2012-08-30 14:50:54 -0700 | [diff] [blame] | 1366 | } |
Ian Rogers | 1d54e73 | 2013-05-02 21:10:01 -0700 | [diff] [blame] | 1367 | heap_->image_mod_union_table_->Dump(LOG(ERROR) << "Image mod-union table: "); |
| 1368 | heap_->zygote_mod_union_table_->Dump(LOG(ERROR) << "Zygote mod-union table: "); |
| 1369 | failed_ = true; |
Mathieu Chartier | fd678be | 2012-08-30 14:50:54 -0700 | [diff] [blame] | 1370 | } |
| 1371 | } |
| 1372 | |
Ian Rogers | 2dd0e2c | 2013-01-24 12:42:14 -0800 | [diff] [blame] | 1373 | bool IsLive(const mirror::Object* obj) const NO_THREAD_SAFETY_ANALYSIS { |
Ian Rogers | 1d54e73 | 2013-05-02 21:10:01 -0700 | [diff] [blame] | 1374 | return heap_->IsLiveObjectLocked(obj); |
| 1375 | } |
| 1376 | |
| 1377 | static void VerifyRoots(const mirror::Object* root, void* arg) { |
| 1378 | VerifyReferenceVisitor* visitor = reinterpret_cast<VerifyReferenceVisitor*>(arg); |
| 1379 | (*visitor)(NULL, root, MemberOffset(0), true); |
Mathieu Chartier | fd678be | 2012-08-30 14:50:54 -0700 | [diff] [blame] | 1380 | } |
| 1381 | |
| 1382 | private: |
Ian Rogers | 1d54e73 | 2013-05-02 21:10:01 -0700 | [diff] [blame] | 1383 | Heap* const heap_; |
| 1384 | mutable bool failed_; |
Mathieu Chartier | fd678be | 2012-08-30 14:50:54 -0700 | [diff] [blame] | 1385 | }; |
| 1386 | |
Ian Rogers | 1d54e73 | 2013-05-02 21:10:01 -0700 | [diff] [blame] | 1387 | // Verify all references within an object, for use with HeapBitmap::Visit. |
Mathieu Chartier | fd678be | 2012-08-30 14:50:54 -0700 | [diff] [blame] | 1388 | class VerifyObjectVisitor { |
| 1389 | public: |
Ian Rogers | 1d54e73 | 2013-05-02 21:10:01 -0700 | [diff] [blame] | 1390 | VerifyObjectVisitor(Heap* heap) : heap_(heap), failed_(false) { |
Mathieu Chartier | fd678be | 2012-08-30 14:50:54 -0700 | [diff] [blame] | 1391 | } |
| 1392 | |
Ian Rogers | 2dd0e2c | 2013-01-24 12:42:14 -0800 | [diff] [blame] | 1393 | void operator ()(const mirror::Object* obj) const |
Ian Rogers | b726dcb | 2012-09-05 08:57:23 -0700 | [diff] [blame] | 1394 | SHARED_LOCKS_REQUIRED(Locks::mutator_lock_, Locks::heap_bitmap_lock_) { |
Ian Rogers | 1d54e73 | 2013-05-02 21:10:01 -0700 | [diff] [blame] | 1395 | // Note: we are verifying the references in obj but not obj itself, this is because obj must |
| 1396 | // be live or else how did we find it in the live bitmap? |
| 1397 | VerifyReferenceVisitor visitor(heap_); |
| 1398 | collector::MarkSweep::VisitObjectReferences(obj, visitor); |
| 1399 | failed_ = failed_ || visitor.Failed(); |
Mathieu Chartier | fd678be | 2012-08-30 14:50:54 -0700 | [diff] [blame] | 1400 | } |
| 1401 | |
| 1402 | bool Failed() const { |
| 1403 | return failed_; |
| 1404 | } |
| 1405 | |
| 1406 | private: |
Ian Rogers | 1d54e73 | 2013-05-02 21:10:01 -0700 | [diff] [blame] | 1407 | Heap* const heap_; |
| 1408 | mutable bool failed_; |
Mathieu Chartier | fd678be | 2012-08-30 14:50:54 -0700 | [diff] [blame] | 1409 | }; |
| 1410 | |
| 1411 | // 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] | 1412 | bool Heap::VerifyHeapReferences() { |
Ian Rogers | 81d425b | 2012-09-27 16:03:43 -0700 | [diff] [blame] | 1413 | Locks::mutator_lock_->AssertExclusiveHeld(Thread::Current()); |
Mathieu Chartier | fd678be | 2012-08-30 14:50:54 -0700 | [diff] [blame] | 1414 | // 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] | 1415 | allocation_stack_->Sort(); |
| 1416 | live_stack_->Sort(); |
Mathieu Chartier | fd678be | 2012-08-30 14:50:54 -0700 | [diff] [blame] | 1417 | // Perform the verification. |
| 1418 | VerifyObjectVisitor visitor(this); |
Ian Rogers | 1d54e73 | 2013-05-02 21:10:01 -0700 | [diff] [blame] | 1419 | Runtime::Current()->VisitRoots(VerifyReferenceVisitor::VerifyRoots, &visitor, false, false); |
Mathieu Chartier | fd678be | 2012-08-30 14:50:54 -0700 | [diff] [blame] | 1420 | GetLiveBitmap()->Visit(visitor); |
| 1421 | // We don't want to verify the objects in the allocation stack since they themselves may be |
| 1422 | // pointing to dead objects if they are not reachable. |
| 1423 | if (visitor.Failed()) { |
| 1424 | DumpSpaces(); |
Mathieu Chartier | c7b83a0 | 2012-09-11 18:07:39 -0700 | [diff] [blame] | 1425 | return false; |
Mathieu Chartier | fd678be | 2012-08-30 14:50:54 -0700 | [diff] [blame] | 1426 | } |
Mathieu Chartier | c7b83a0 | 2012-09-11 18:07:39 -0700 | [diff] [blame] | 1427 | return true; |
| 1428 | } |
| 1429 | |
| 1430 | class VerifyReferenceCardVisitor { |
| 1431 | public: |
| 1432 | VerifyReferenceCardVisitor(Heap* heap, bool* failed) |
| 1433 | SHARED_LOCKS_REQUIRED(Locks::mutator_lock_, |
| 1434 | Locks::heap_bitmap_lock_) |
Ian Rogers | 1d54e73 | 2013-05-02 21:10:01 -0700 | [diff] [blame] | 1435 | : heap_(heap), failed_(failed) { |
Mathieu Chartier | c7b83a0 | 2012-09-11 18:07:39 -0700 | [diff] [blame] | 1436 | } |
| 1437 | |
Mathieu Chartier | 4da7f2f | 2012-11-13 12:51:01 -0800 | [diff] [blame] | 1438 | // TODO: Fix lock analysis to not use NO_THREAD_SAFETY_ANALYSIS, requires support for |
| 1439 | // annotalysis on visitors. |
Ian Rogers | 2dd0e2c | 2013-01-24 12:42:14 -0800 | [diff] [blame] | 1440 | void operator ()(const mirror::Object* obj, const mirror::Object* ref, const MemberOffset& offset, |
| 1441 | bool is_static) const NO_THREAD_SAFETY_ANALYSIS { |
Mathieu Chartier | 4da7f2f | 2012-11-13 12:51:01 -0800 | [diff] [blame] | 1442 | // Filter out class references since changing an object's class does not mark the card as dirty. |
| 1443 | // Also handles large objects, since the only reference they hold is a class reference. |
| 1444 | if (ref != NULL && !ref->IsClass()) { |
Ian Rogers | 1d54e73 | 2013-05-02 21:10:01 -0700 | [diff] [blame] | 1445 | accounting::CardTable* card_table = heap_->GetCardTable(); |
Mathieu Chartier | c7b83a0 | 2012-09-11 18:07:39 -0700 | [diff] [blame] | 1446 | // If the object is not dirty and it is referencing something in the live stack other than |
| 1447 | // class, then it must be on a dirty card. |
Mathieu Chartier | 7469ebf | 2012-09-24 16:28:36 -0700 | [diff] [blame] | 1448 | if (!card_table->AddrIsInCardTable(obj)) { |
| 1449 | LOG(ERROR) << "Object " << obj << " is not in the address range of the card table"; |
| 1450 | *failed_ = true; |
Mathieu Chartier | 2b82db4 | 2012-11-14 17:29:05 -0800 | [diff] [blame] | 1451 | } else if (!card_table->IsDirty(obj)) { |
Mathieu Chartier | 4da7f2f | 2012-11-13 12:51:01 -0800 | [diff] [blame] | 1452 | // Card should be either kCardDirty if it got re-dirtied after we aged it, or |
| 1453 | // kCardDirty - 1 if it didnt get touched since we aged it. |
Ian Rogers | 1d54e73 | 2013-05-02 21:10:01 -0700 | [diff] [blame] | 1454 | accounting::ObjectStack* live_stack = heap_->live_stack_.get(); |
| 1455 | if (live_stack->Contains(const_cast<mirror::Object*>(ref))) { |
| 1456 | if (live_stack->Contains(const_cast<mirror::Object*>(obj))) { |
Mathieu Chartier | c7b83a0 | 2012-09-11 18:07:39 -0700 | [diff] [blame] | 1457 | LOG(ERROR) << "Object " << obj << " found in live stack"; |
| 1458 | } |
| 1459 | if (heap_->GetLiveBitmap()->Test(obj)) { |
| 1460 | LOG(ERROR) << "Object " << obj << " found in live bitmap"; |
| 1461 | } |
| 1462 | LOG(ERROR) << "Object " << obj << " " << PrettyTypeOf(obj) |
| 1463 | << " references " << ref << " " << PrettyTypeOf(ref) << " in live stack"; |
| 1464 | |
| 1465 | // Print which field of the object is dead. |
| 1466 | if (!obj->IsObjectArray()) { |
Ian Rogers | 2dd0e2c | 2013-01-24 12:42:14 -0800 | [diff] [blame] | 1467 | const mirror::Class* klass = is_static ? obj->AsClass() : obj->GetClass(); |
Mathieu Chartier | c7b83a0 | 2012-09-11 18:07:39 -0700 | [diff] [blame] | 1468 | CHECK(klass != NULL); |
Ian Rogers | 2dd0e2c | 2013-01-24 12:42:14 -0800 | [diff] [blame] | 1469 | const mirror::ObjectArray<mirror::Field>* fields = is_static ? klass->GetSFields() |
| 1470 | : klass->GetIFields(); |
Mathieu Chartier | c7b83a0 | 2012-09-11 18:07:39 -0700 | [diff] [blame] | 1471 | CHECK(fields != NULL); |
| 1472 | for (int32_t i = 0; i < fields->GetLength(); ++i) { |
Ian Rogers | 2dd0e2c | 2013-01-24 12:42:14 -0800 | [diff] [blame] | 1473 | const mirror::Field* cur = fields->Get(i); |
Mathieu Chartier | c7b83a0 | 2012-09-11 18:07:39 -0700 | [diff] [blame] | 1474 | if (cur->GetOffset().Int32Value() == offset.Int32Value()) { |
| 1475 | LOG(ERROR) << (is_static ? "Static " : "") << "field in the live stack is " |
| 1476 | << PrettyField(cur); |
| 1477 | break; |
| 1478 | } |
| 1479 | } |
| 1480 | } else { |
Ian Rogers | 2dd0e2c | 2013-01-24 12:42:14 -0800 | [diff] [blame] | 1481 | const mirror::ObjectArray<mirror::Object>* object_array = |
| 1482 | obj->AsObjectArray<mirror::Object>(); |
Mathieu Chartier | c7b83a0 | 2012-09-11 18:07:39 -0700 | [diff] [blame] | 1483 | for (int32_t i = 0; i < object_array->GetLength(); ++i) { |
| 1484 | if (object_array->Get(i) == ref) { |
| 1485 | LOG(ERROR) << (is_static ? "Static " : "") << "obj[" << i << "] = ref"; |
| 1486 | } |
| 1487 | } |
| 1488 | } |
| 1489 | |
| 1490 | *failed_ = true; |
| 1491 | } |
| 1492 | } |
| 1493 | } |
| 1494 | } |
| 1495 | |
| 1496 | private: |
Ian Rogers | 1d54e73 | 2013-05-02 21:10:01 -0700 | [diff] [blame] | 1497 | Heap* const heap_; |
| 1498 | bool* const failed_; |
Mathieu Chartier | c7b83a0 | 2012-09-11 18:07:39 -0700 | [diff] [blame] | 1499 | }; |
| 1500 | |
| 1501 | class VerifyLiveStackReferences { |
| 1502 | public: |
| 1503 | VerifyLiveStackReferences(Heap* heap) |
| 1504 | : heap_(heap), |
| 1505 | failed_(false) { |
| 1506 | |
| 1507 | } |
| 1508 | |
Ian Rogers | 2dd0e2c | 2013-01-24 12:42:14 -0800 | [diff] [blame] | 1509 | void operator ()(const mirror::Object* obj) const |
Mathieu Chartier | c7b83a0 | 2012-09-11 18:07:39 -0700 | [diff] [blame] | 1510 | SHARED_LOCKS_REQUIRED(Locks::mutator_lock_, Locks::heap_bitmap_lock_) { |
| 1511 | VerifyReferenceCardVisitor visitor(heap_, const_cast<bool*>(&failed_)); |
Ian Rogers | 1d54e73 | 2013-05-02 21:10:01 -0700 | [diff] [blame] | 1512 | collector::MarkSweep::VisitObjectReferences(obj, visitor); |
Mathieu Chartier | c7b83a0 | 2012-09-11 18:07:39 -0700 | [diff] [blame] | 1513 | } |
| 1514 | |
| 1515 | bool Failed() const { |
| 1516 | return failed_; |
| 1517 | } |
| 1518 | |
| 1519 | private: |
Ian Rogers | 1d54e73 | 2013-05-02 21:10:01 -0700 | [diff] [blame] | 1520 | Heap* const heap_; |
Mathieu Chartier | c7b83a0 | 2012-09-11 18:07:39 -0700 | [diff] [blame] | 1521 | bool failed_; |
| 1522 | }; |
| 1523 | |
| 1524 | bool Heap::VerifyMissingCardMarks() { |
Ian Rogers | 81d425b | 2012-09-27 16:03:43 -0700 | [diff] [blame] | 1525 | Locks::mutator_lock_->AssertExclusiveHeld(Thread::Current()); |
Mathieu Chartier | c7b83a0 | 2012-09-11 18:07:39 -0700 | [diff] [blame] | 1526 | |
Mathieu Chartier | 2b82db4 | 2012-11-14 17:29:05 -0800 | [diff] [blame] | 1527 | // We need to sort the live stack since we binary search it. |
Ian Rogers | 1d54e73 | 2013-05-02 21:10:01 -0700 | [diff] [blame] | 1528 | live_stack_->Sort(); |
Mathieu Chartier | c7b83a0 | 2012-09-11 18:07:39 -0700 | [diff] [blame] | 1529 | VerifyLiveStackReferences visitor(this); |
| 1530 | GetLiveBitmap()->Visit(visitor); |
| 1531 | |
| 1532 | // 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] | 1533 | for (mirror::Object** it = live_stack_->Begin(); it != live_stack_->End(); ++it) { |
Mathieu Chartier | c7b83a0 | 2012-09-11 18:07:39 -0700 | [diff] [blame] | 1534 | visitor(*it); |
| 1535 | } |
| 1536 | |
| 1537 | if (visitor.Failed()) { |
| 1538 | DumpSpaces(); |
| 1539 | return false; |
| 1540 | } |
| 1541 | return true; |
Mathieu Chartier | fd678be | 2012-08-30 14:50:54 -0700 | [diff] [blame] | 1542 | } |
| 1543 | |
Mathieu Chartier | c7b83a0 | 2012-09-11 18:07:39 -0700 | [diff] [blame] | 1544 | void Heap::SwapStacks() { |
Mathieu Chartier | d22d548 | 2012-11-06 17:14:12 -0800 | [diff] [blame] | 1545 | allocation_stack_.swap(live_stack_); |
Mathieu Chartier | c7b83a0 | 2012-09-11 18:07:39 -0700 | [diff] [blame] | 1546 | |
| 1547 | // Sort the live stack so that we can quickly binary search it later. |
Ian Rogers | 04d7aa9 | 2013-03-16 14:29:17 -0700 | [diff] [blame] | 1548 | if (verify_object_mode_ > kNoHeapVerification) { |
Ian Rogers | 1d54e73 | 2013-05-02 21:10:01 -0700 | [diff] [blame] | 1549 | live_stack_->Sort(); |
Mathieu Chartier | c7b83a0 | 2012-09-11 18:07:39 -0700 | [diff] [blame] | 1550 | } |
| 1551 | } |
| 1552 | |
Ian Rogers | 1d54e73 | 2013-05-02 21:10:01 -0700 | [diff] [blame] | 1553 | void Heap::ProcessCards(base::NewTimingLogger& timings) { |
| 1554 | // Clear cards and keep track of cards cleared in the mod-union table. |
| 1555 | typedef std::vector<space::ContinuousSpace*>::iterator It; |
| 1556 | for (It it = continuous_spaces_.begin(), end = continuous_spaces_.end(); it != end; ++it) { |
| 1557 | space::ContinuousSpace* space = *it; |
Mathieu Chartier | 7469ebf | 2012-09-24 16:28:36 -0700 | [diff] [blame] | 1558 | if (space->IsImageSpace()) { |
Ian Rogers | 1d54e73 | 2013-05-02 21:10:01 -0700 | [diff] [blame] | 1559 | timings.NewSplit("ModUnionClearCards"); |
| 1560 | image_mod_union_table_->ClearCards(space); |
| 1561 | } else if (space->IsZygoteSpace()) { |
| 1562 | timings.NewSplit("ZygoteModUnionClearCards"); |
Mathieu Chartier | 7469ebf | 2012-09-24 16:28:36 -0700 | [diff] [blame] | 1563 | zygote_mod_union_table_->ClearCards(space); |
Mathieu Chartier | 7469ebf | 2012-09-24 16:28:36 -0700 | [diff] [blame] | 1564 | } else { |
Mathieu Chartier | d22d548 | 2012-11-06 17:14:12 -0800 | [diff] [blame] | 1565 | // No mod union table for the AllocSpace. Age the cards so that the GC knows that these cards |
| 1566 | // were dirty before the GC started. |
Ian Rogers | 1d54e73 | 2013-05-02 21:10:01 -0700 | [diff] [blame] | 1567 | timings.NewSplit("AllocSpaceClearCards"); |
Mathieu Chartier | d22d548 | 2012-11-06 17:14:12 -0800 | [diff] [blame] | 1568 | card_table_->ModifyCardsAtomic(space->Begin(), space->End(), AgeCardVisitor(), VoidFunctor()); |
Mathieu Chartier | 7469ebf | 2012-09-24 16:28:36 -0700 | [diff] [blame] | 1569 | } |
| 1570 | } |
| 1571 | } |
| 1572 | |
Ian Rogers | 1d54e73 | 2013-05-02 21:10:01 -0700 | [diff] [blame] | 1573 | void Heap::PreGcVerification(collector::GarbageCollector* gc) { |
Mathieu Chartier | 2b82db4 | 2012-11-14 17:29:05 -0800 | [diff] [blame] | 1574 | ThreadList* thread_list = Runtime::Current()->GetThreadList(); |
| 1575 | Thread* self = Thread::Current(); |
Mathieu Chartier | 4da7f2f | 2012-11-13 12:51:01 -0800 | [diff] [blame] | 1576 | |
Mathieu Chartier | 2b82db4 | 2012-11-14 17:29:05 -0800 | [diff] [blame] | 1577 | if (verify_pre_gc_heap_) { |
| 1578 | thread_list->SuspendAll(); |
| 1579 | { |
| 1580 | ReaderMutexLock mu(self, *Locks::heap_bitmap_lock_); |
| 1581 | if (!VerifyHeapReferences()) { |
| 1582 | LOG(FATAL) << "Pre " << gc->GetName() << " heap verification failed"; |
| 1583 | } |
| 1584 | } |
| 1585 | thread_list->ResumeAll(); |
Mathieu Chartier | 4da7f2f | 2012-11-13 12:51:01 -0800 | [diff] [blame] | 1586 | } |
Mathieu Chartier | 2b82db4 | 2012-11-14 17:29:05 -0800 | [diff] [blame] | 1587 | |
| 1588 | // Check that all objects which reference things in the live stack are on dirty cards. |
| 1589 | if (verify_missing_card_marks_) { |
| 1590 | thread_list->SuspendAll(); |
| 1591 | { |
| 1592 | ReaderMutexLock mu(self, *Locks::heap_bitmap_lock_); |
| 1593 | SwapStacks(); |
| 1594 | // Sort the live stack so that we can quickly binary search it later. |
| 1595 | if (!VerifyMissingCardMarks()) { |
| 1596 | LOG(FATAL) << "Pre " << gc->GetName() << " missing card mark verification failed"; |
| 1597 | } |
| 1598 | SwapStacks(); |
| 1599 | } |
| 1600 | thread_list->ResumeAll(); |
| 1601 | } |
| 1602 | |
| 1603 | if (verify_mod_union_table_) { |
| 1604 | thread_list->SuspendAll(); |
| 1605 | ReaderMutexLock reader_lock(self, *Locks::heap_bitmap_lock_); |
| 1606 | zygote_mod_union_table_->Update(); |
| 1607 | zygote_mod_union_table_->Verify(); |
Ian Rogers | 1d54e73 | 2013-05-02 21:10:01 -0700 | [diff] [blame] | 1608 | image_mod_union_table_->Update(); |
| 1609 | image_mod_union_table_->Verify(); |
Mathieu Chartier | 2b82db4 | 2012-11-14 17:29:05 -0800 | [diff] [blame] | 1610 | thread_list->ResumeAll(); |
| 1611 | } |
Mathieu Chartier | 4da7f2f | 2012-11-13 12:51:01 -0800 | [diff] [blame] | 1612 | } |
| 1613 | |
Ian Rogers | 1d54e73 | 2013-05-02 21:10:01 -0700 | [diff] [blame] | 1614 | void Heap::PreSweepingGcVerification(collector::GarbageCollector* gc) { |
Ian Rogers | 00f7d0e | 2012-07-19 15:28:27 -0700 | [diff] [blame] | 1615 | ThreadList* thread_list = Runtime::Current()->GetThreadList(); |
Ian Rogers | 00f7d0e | 2012-07-19 15:28:27 -0700 | [diff] [blame] | 1616 | |
Mathieu Chartier | 2b82db4 | 2012-11-14 17:29:05 -0800 | [diff] [blame] | 1617 | // Called before sweeping occurs since we want to make sure we are not going so reclaim any |
| 1618 | // reachable objects. |
| 1619 | if (verify_post_gc_heap_) { |
Ian Rogers | 1d54e73 | 2013-05-02 21:10:01 -0700 | [diff] [blame] | 1620 | Thread* self = Thread::Current(); |
| 1621 | CHECK_NE(self->GetState(), kRunnable); |
| 1622 | Locks::mutator_lock_->SharedUnlock(self); |
Ian Rogers | 00f7d0e | 2012-07-19 15:28:27 -0700 | [diff] [blame] | 1623 | thread_list->SuspendAll(); |
Ian Rogers | 1d54e73 | 2013-05-02 21:10:01 -0700 | [diff] [blame] | 1624 | { |
| 1625 | WriterMutexLock mu(self, *Locks::heap_bitmap_lock_); |
| 1626 | // Swapping bound bitmaps does nothing. |
| 1627 | gc->SwapBitmaps(); |
| 1628 | if (!VerifyHeapReferences()) { |
| 1629 | LOG(FATAL) << "Post " << gc->GetName() << "GC verification failed"; |
| 1630 | } |
| 1631 | gc->SwapBitmaps(); |
Ian Rogers | 00f7d0e | 2012-07-19 15:28:27 -0700 | [diff] [blame] | 1632 | } |
Ian Rogers | 00f7d0e | 2012-07-19 15:28:27 -0700 | [diff] [blame] | 1633 | thread_list->ResumeAll(); |
Ian Rogers | 1d54e73 | 2013-05-02 21:10:01 -0700 | [diff] [blame] | 1634 | Locks::mutator_lock_->SharedLock(self); |
Ian Rogers | 00f7d0e | 2012-07-19 15:28:27 -0700 | [diff] [blame] | 1635 | } |
Mathieu Chartier | 2b82db4 | 2012-11-14 17:29:05 -0800 | [diff] [blame] | 1636 | } |
Ian Rogers | 00f7d0e | 2012-07-19 15:28:27 -0700 | [diff] [blame] | 1637 | |
Ian Rogers | 1d54e73 | 2013-05-02 21:10:01 -0700 | [diff] [blame] | 1638 | void Heap::PostGcVerification(collector::GarbageCollector* gc) { |
Mathieu Chartier | 2b82db4 | 2012-11-14 17:29:05 -0800 | [diff] [blame] | 1639 | Thread* self = Thread::Current(); |
Ian Rogers | 00f7d0e | 2012-07-19 15:28:27 -0700 | [diff] [blame] | 1640 | |
Mathieu Chartier | 2b82db4 | 2012-11-14 17:29:05 -0800 | [diff] [blame] | 1641 | if (verify_system_weaks_) { |
| 1642 | ReaderMutexLock mu(self, *Locks::heap_bitmap_lock_); |
Ian Rogers | 1d54e73 | 2013-05-02 21:10:01 -0700 | [diff] [blame] | 1643 | collector::MarkSweep* mark_sweep = down_cast<collector::MarkSweep*>(gc); |
Mathieu Chartier | 2b82db4 | 2012-11-14 17:29:05 -0800 | [diff] [blame] | 1644 | mark_sweep->VerifySystemWeaks(); |
Ian Rogers | 00f7d0e | 2012-07-19 15:28:27 -0700 | [diff] [blame] | 1645 | } |
Carl Shapiro | 69759ea | 2011-07-21 18:13:35 -0700 | [diff] [blame] | 1646 | } |
| 1647 | |
Ian Rogers | 1d54e73 | 2013-05-02 21:10:01 -0700 | [diff] [blame] | 1648 | collector::GcType Heap::WaitForConcurrentGcToComplete(Thread* self) { |
| 1649 | collector::GcType last_gc_type = collector::kGcTypeNone; |
Ian Rogers | 00f7d0e | 2012-07-19 15:28:27 -0700 | [diff] [blame] | 1650 | if (concurrent_gc_) { |
Mathieu Chartier | 752a0e6 | 2013-06-27 11:03:27 -0700 | [diff] [blame] | 1651 | ATRACE_BEGIN("GC: Wait For Concurrent"); |
Mathieu Chartier | 866fb2a | 2012-09-10 10:47:49 -0700 | [diff] [blame] | 1652 | bool do_wait; |
| 1653 | uint64_t wait_start = NanoTime(); |
Ian Rogers | 00f7d0e | 2012-07-19 15:28:27 -0700 | [diff] [blame] | 1654 | { |
| 1655 | // Check if GC is running holding gc_complete_lock_. |
Ian Rogers | 81d425b | 2012-09-27 16:03:43 -0700 | [diff] [blame] | 1656 | MutexLock mu(self, *gc_complete_lock_); |
Mathieu Chartier | 866fb2a | 2012-09-10 10:47:49 -0700 | [diff] [blame] | 1657 | do_wait = is_gc_running_; |
Mathieu Chartier | a639903 | 2012-06-11 18:49:50 -0700 | [diff] [blame] | 1658 | } |
Ian Rogers | 00f7d0e | 2012-07-19 15:28:27 -0700 | [diff] [blame] | 1659 | if (do_wait) { |
Mathieu Chartier | 155dfe9 | 2012-10-09 14:24:49 -0700 | [diff] [blame] | 1660 | uint64_t wait_time; |
Ian Rogers | 00f7d0e | 2012-07-19 15:28:27 -0700 | [diff] [blame] | 1661 | // We must wait, change thread state then sleep on gc_complete_cond_; |
| 1662 | ScopedThreadStateChange tsc(Thread::Current(), kWaitingForGcToComplete); |
| 1663 | { |
Ian Rogers | 81d425b | 2012-09-27 16:03:43 -0700 | [diff] [blame] | 1664 | MutexLock mu(self, *gc_complete_lock_); |
Ian Rogers | 00f7d0e | 2012-07-19 15:28:27 -0700 | [diff] [blame] | 1665 | while (is_gc_running_) { |
Ian Rogers | c604d73 | 2012-10-14 16:09:54 -0700 | [diff] [blame] | 1666 | gc_complete_cond_->Wait(self); |
Ian Rogers | 00f7d0e | 2012-07-19 15:28:27 -0700 | [diff] [blame] | 1667 | } |
Mathieu Chartier | 866fb2a | 2012-09-10 10:47:49 -0700 | [diff] [blame] | 1668 | last_gc_type = last_gc_type_; |
Mathieu Chartier | 155dfe9 | 2012-10-09 14:24:49 -0700 | [diff] [blame] | 1669 | wait_time = NanoTime() - wait_start;; |
| 1670 | total_wait_time_ += wait_time; |
Ian Rogers | 00f7d0e | 2012-07-19 15:28:27 -0700 | [diff] [blame] | 1671 | } |
Mathieu Chartier | 2b82db4 | 2012-11-14 17:29:05 -0800 | [diff] [blame] | 1672 | if (wait_time > kLongGcPauseThreshold) { |
Ian Rogers | 00f7d0e | 2012-07-19 15:28:27 -0700 | [diff] [blame] | 1673 | LOG(INFO) << "WaitForConcurrentGcToComplete blocked for " << PrettyDuration(wait_time); |
| 1674 | } |
Ian Rogers | 00f7d0e | 2012-07-19 15:28:27 -0700 | [diff] [blame] | 1675 | } |
Mathieu Chartier | 752a0e6 | 2013-06-27 11:03:27 -0700 | [diff] [blame] | 1676 | ATRACE_END(); |
Mathieu Chartier | 7664f5c | 2012-06-08 18:15:32 -0700 | [diff] [blame] | 1677 | } |
Mathieu Chartier | 866fb2a | 2012-09-10 10:47:49 -0700 | [diff] [blame] | 1678 | return last_gc_type; |
Carl Shapiro | 69759ea | 2011-07-21 18:13:35 -0700 | [diff] [blame] | 1679 | } |
| 1680 | |
Elliott Hughes | c967f78 | 2012-04-16 10:23:15 -0700 | [diff] [blame] | 1681 | void Heap::DumpForSigQuit(std::ostream& os) { |
Ian Rogers | 1d54e73 | 2013-05-02 21:10:01 -0700 | [diff] [blame] | 1682 | os << "Heap: " << GetPercentFree() << "% free, " << PrettySize(GetBytesAllocated()) << "/" |
Mathieu Chartier | 2fde533 | 2012-09-14 14:51:54 -0700 | [diff] [blame] | 1683 | << PrettySize(GetTotalMemory()) << "; " << GetObjectsAllocated() << " objects\n"; |
Elliott Hughes | 8b788fe | 2013-04-17 15:57:01 -0700 | [diff] [blame] | 1684 | DumpGcPerformanceInfo(os); |
Elliott Hughes | c967f78 | 2012-04-16 10:23:15 -0700 | [diff] [blame] | 1685 | } |
| 1686 | |
| 1687 | size_t Heap::GetPercentFree() { |
Mathieu Chartier | 2fde533 | 2012-09-14 14:51:54 -0700 | [diff] [blame] | 1688 | return static_cast<size_t>(100.0f * static_cast<float>(GetFreeMemory()) / GetTotalMemory()); |
Elliott Hughes | c967f78 | 2012-04-16 10:23:15 -0700 | [diff] [blame] | 1689 | } |
| 1690 | |
Elliott Hughes | 4dd9b4d | 2011-12-12 18:29:24 -0800 | [diff] [blame] | 1691 | void Heap::SetIdealFootprint(size_t max_allowed_footprint) { |
Mathieu Chartier | 2fde533 | 2012-09-14 14:51:54 -0700 | [diff] [blame] | 1692 | if (max_allowed_footprint > GetMaxMemory()) { |
Mathieu Chartier | fd678be | 2012-08-30 14:50:54 -0700 | [diff] [blame] | 1693 | VLOG(gc) << "Clamp target GC heap from " << PrettySize(max_allowed_footprint) << " to " |
Mathieu Chartier | 2fde533 | 2012-09-14 14:51:54 -0700 | [diff] [blame] | 1694 | << PrettySize(GetMaxMemory()); |
| 1695 | max_allowed_footprint = GetMaxMemory(); |
| 1696 | } |
Mathieu Chartier | 1c23e1e | 2012-10-12 14:14:11 -0700 | [diff] [blame] | 1697 | max_allowed_footprint_ = max_allowed_footprint; |
Shih-wei Liao | 8c2f641 | 2011-10-03 22:58:14 -0700 | [diff] [blame] | 1698 | } |
| 1699 | |
Mathieu Chartier | 65db880 | 2012-11-20 12:36:46 -0800 | [diff] [blame] | 1700 | void Heap::GrowForUtilization(uint64_t gc_duration) { |
Mathieu Chartier | 2fde533 | 2012-09-14 14:51:54 -0700 | [diff] [blame] | 1701 | // We know what our utilization is at this moment. |
| 1702 | // 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] | 1703 | const size_t bytes_allocated = GetBytesAllocated(); |
| 1704 | last_gc_size_ = bytes_allocated; |
Ian Rogers | 1d54e73 | 2013-05-02 21:10:01 -0700 | [diff] [blame] | 1705 | last_gc_time_ns_ = NanoTime(); |
Mathieu Chartier | 357e9be | 2012-08-01 11:00:14 -0700 | [diff] [blame] | 1706 | |
Mathieu Chartier | 65db880 | 2012-11-20 12:36:46 -0800 | [diff] [blame] | 1707 | size_t target_size = bytes_allocated / GetTargetHeapUtilization(); |
| 1708 | if (target_size > bytes_allocated + max_free_) { |
| 1709 | target_size = bytes_allocated + max_free_; |
| 1710 | } else if (target_size < bytes_allocated + min_free_) { |
| 1711 | target_size = bytes_allocated + min_free_; |
Mathieu Chartier | 7664f5c | 2012-06-08 18:15:32 -0700 | [diff] [blame] | 1712 | } |
Mathieu Chartier | 2fde533 | 2012-09-14 14:51:54 -0700 | [diff] [blame] | 1713 | |
Shih-wei Liao | 8c2f641 | 2011-10-03 22:58:14 -0700 | [diff] [blame] | 1714 | SetIdealFootprint(target_size); |
Mathieu Chartier | 65db880 | 2012-11-20 12:36:46 -0800 | [diff] [blame] | 1715 | |
Ian Rogers | 1d54e73 | 2013-05-02 21:10:01 -0700 | [diff] [blame] | 1716 | // Calculate when to perform the next ConcurrentGC. |
| 1717 | if (concurrent_gc_) { |
Mathieu Chartier | 65db880 | 2012-11-20 12:36:46 -0800 | [diff] [blame] | 1718 | // Calculate the estimated GC duration. |
| 1719 | double gc_duration_seconds = NsToMs(gc_duration) / 1000.0; |
| 1720 | // Estimate how many remaining bytes we will have when we need to start the next GC. |
| 1721 | size_t remaining_bytes = allocation_rate_ * gc_duration_seconds; |
Ian Rogers | 1d54e73 | 2013-05-02 21:10:01 -0700 | [diff] [blame] | 1722 | remaining_bytes = std::max(remaining_bytes, kMinConcurrentRemainingBytes); |
| 1723 | if (UNLIKELY(remaining_bytes > max_allowed_footprint_)) { |
| 1724 | // A never going to happen situation that from the estimated allocation rate we will exceed |
| 1725 | // the applications entire footprint with the given estimated allocation rate. Schedule |
| 1726 | // another GC straight away. |
| 1727 | concurrent_start_bytes_ = bytes_allocated; |
| 1728 | } else { |
Mathieu Chartier | 65db880 | 2012-11-20 12:36:46 -0800 | [diff] [blame] | 1729 | // Start a concurrent GC when we get close to the estimated remaining bytes. When the |
| 1730 | // allocation rate is very high, remaining_bytes could tell us that we should start a GC |
| 1731 | // right away. |
| 1732 | concurrent_start_bytes_ = std::max(max_allowed_footprint_ - remaining_bytes, bytes_allocated); |
Mathieu Chartier | 65db880 | 2012-11-20 12:36:46 -0800 | [diff] [blame] | 1733 | } |
| 1734 | DCHECK_LE(concurrent_start_bytes_, max_allowed_footprint_); |
| 1735 | DCHECK_LE(max_allowed_footprint_, growth_limit_); |
| 1736 | } |
Carl Shapiro | 69759ea | 2011-07-21 18:13:35 -0700 | [diff] [blame] | 1737 | } |
| 1738 | |
jeffhao | c116070 | 2011-10-27 15:48:45 -0700 | [diff] [blame] | 1739 | void Heap::ClearGrowthLimit() { |
Mathieu Chartier | 80de7a6 | 2012-11-27 17:21:50 -0800 | [diff] [blame] | 1740 | growth_limit_ = capacity_; |
jeffhao | c116070 | 2011-10-27 15:48:45 -0700 | [diff] [blame] | 1741 | alloc_space_->ClearGrowthLimit(); |
| 1742 | } |
| 1743 | |
Elliott Hughes | adb460d | 2011-10-05 17:02:34 -0700 | [diff] [blame] | 1744 | void Heap::SetReferenceOffsets(MemberOffset reference_referent_offset, |
Mathieu Chartier | fd678be | 2012-08-30 14:50:54 -0700 | [diff] [blame] | 1745 | MemberOffset reference_queue_offset, |
| 1746 | MemberOffset reference_queueNext_offset, |
| 1747 | MemberOffset reference_pendingNext_offset, |
| 1748 | MemberOffset finalizer_reference_zombie_offset) { |
Elliott Hughes | adb460d | 2011-10-05 17:02:34 -0700 | [diff] [blame] | 1749 | reference_referent_offset_ = reference_referent_offset; |
| 1750 | reference_queue_offset_ = reference_queue_offset; |
| 1751 | reference_queueNext_offset_ = reference_queueNext_offset; |
| 1752 | reference_pendingNext_offset_ = reference_pendingNext_offset; |
| 1753 | finalizer_reference_zombie_offset_ = finalizer_reference_zombie_offset; |
| 1754 | CHECK_NE(reference_referent_offset_.Uint32Value(), 0U); |
| 1755 | CHECK_NE(reference_queue_offset_.Uint32Value(), 0U); |
| 1756 | CHECK_NE(reference_queueNext_offset_.Uint32Value(), 0U); |
| 1757 | CHECK_NE(reference_pendingNext_offset_.Uint32Value(), 0U); |
| 1758 | CHECK_NE(finalizer_reference_zombie_offset_.Uint32Value(), 0U); |
| 1759 | } |
| 1760 | |
Ian Rogers | 2dd0e2c | 2013-01-24 12:42:14 -0800 | [diff] [blame] | 1761 | mirror::Object* Heap::GetReferenceReferent(mirror::Object* reference) { |
Elliott Hughes | adb460d | 2011-10-05 17:02:34 -0700 | [diff] [blame] | 1762 | DCHECK(reference != NULL); |
| 1763 | DCHECK_NE(reference_referent_offset_.Uint32Value(), 0U); |
Ian Rogers | 2dd0e2c | 2013-01-24 12:42:14 -0800 | [diff] [blame] | 1764 | return reference->GetFieldObject<mirror::Object*>(reference_referent_offset_, true); |
Elliott Hughes | adb460d | 2011-10-05 17:02:34 -0700 | [diff] [blame] | 1765 | } |
| 1766 | |
Ian Rogers | 2dd0e2c | 2013-01-24 12:42:14 -0800 | [diff] [blame] | 1767 | void Heap::ClearReferenceReferent(mirror::Object* reference) { |
Elliott Hughes | adb460d | 2011-10-05 17:02:34 -0700 | [diff] [blame] | 1768 | DCHECK(reference != NULL); |
| 1769 | DCHECK_NE(reference_referent_offset_.Uint32Value(), 0U); |
| 1770 | reference->SetFieldObject(reference_referent_offset_, NULL, true); |
| 1771 | } |
| 1772 | |
| 1773 | // Returns true if the reference object has not yet been enqueued. |
Ian Rogers | 2dd0e2c | 2013-01-24 12:42:14 -0800 | [diff] [blame] | 1774 | bool Heap::IsEnqueuable(const mirror::Object* ref) { |
Elliott Hughes | adb460d | 2011-10-05 17:02:34 -0700 | [diff] [blame] | 1775 | DCHECK(ref != NULL); |
Ian Rogers | 2dd0e2c | 2013-01-24 12:42:14 -0800 | [diff] [blame] | 1776 | const mirror::Object* queue = |
| 1777 | ref->GetFieldObject<mirror::Object*>(reference_queue_offset_, false); |
| 1778 | const mirror::Object* queue_next = |
| 1779 | ref->GetFieldObject<mirror::Object*>(reference_queueNext_offset_, false); |
Elliott Hughes | adb460d | 2011-10-05 17:02:34 -0700 | [diff] [blame] | 1780 | return (queue != NULL) && (queue_next == NULL); |
| 1781 | } |
| 1782 | |
Ian Rogers | 2dd0e2c | 2013-01-24 12:42:14 -0800 | [diff] [blame] | 1783 | void Heap::EnqueueReference(mirror::Object* ref, mirror::Object** cleared_reference_list) { |
Elliott Hughes | adb460d | 2011-10-05 17:02:34 -0700 | [diff] [blame] | 1784 | DCHECK(ref != NULL); |
Ian Rogers | 2dd0e2c | 2013-01-24 12:42:14 -0800 | [diff] [blame] | 1785 | CHECK(ref->GetFieldObject<mirror::Object*>(reference_queue_offset_, false) != NULL); |
| 1786 | CHECK(ref->GetFieldObject<mirror::Object*>(reference_queueNext_offset_, false) == NULL); |
Elliott Hughes | adb460d | 2011-10-05 17:02:34 -0700 | [diff] [blame] | 1787 | EnqueuePendingReference(ref, cleared_reference_list); |
| 1788 | } |
| 1789 | |
Ian Rogers | 2dd0e2c | 2013-01-24 12:42:14 -0800 | [diff] [blame] | 1790 | void Heap::EnqueuePendingReference(mirror::Object* ref, mirror::Object** list) { |
Elliott Hughes | adb460d | 2011-10-05 17:02:34 -0700 | [diff] [blame] | 1791 | DCHECK(ref != NULL); |
| 1792 | DCHECK(list != NULL); |
| 1793 | |
Mathieu Chartier | 02b6a78 | 2012-10-26 13:51:26 -0700 | [diff] [blame] | 1794 | // TODO: Remove this lock, use atomic stacks for storing references. |
| 1795 | MutexLock mu(Thread::Current(), *reference_queue_lock_); |
Elliott Hughes | adb460d | 2011-10-05 17:02:34 -0700 | [diff] [blame] | 1796 | if (*list == NULL) { |
| 1797 | ref->SetFieldObject(reference_pendingNext_offset_, ref, false); |
| 1798 | *list = ref; |
| 1799 | } else { |
Ian Rogers | 2dd0e2c | 2013-01-24 12:42:14 -0800 | [diff] [blame] | 1800 | mirror::Object* head = |
| 1801 | (*list)->GetFieldObject<mirror::Object*>(reference_pendingNext_offset_, false); |
Elliott Hughes | adb460d | 2011-10-05 17:02:34 -0700 | [diff] [blame] | 1802 | ref->SetFieldObject(reference_pendingNext_offset_, head, false); |
| 1803 | (*list)->SetFieldObject(reference_pendingNext_offset_, ref, false); |
| 1804 | } |
| 1805 | } |
| 1806 | |
Ian Rogers | 2dd0e2c | 2013-01-24 12:42:14 -0800 | [diff] [blame] | 1807 | mirror::Object* Heap::DequeuePendingReference(mirror::Object** list) { |
Elliott Hughes | adb460d | 2011-10-05 17:02:34 -0700 | [diff] [blame] | 1808 | DCHECK(list != NULL); |
| 1809 | DCHECK(*list != NULL); |
Ian Rogers | 2dd0e2c | 2013-01-24 12:42:14 -0800 | [diff] [blame] | 1810 | mirror::Object* head = (*list)->GetFieldObject<mirror::Object*>(reference_pendingNext_offset_, |
| 1811 | false); |
| 1812 | mirror::Object* ref; |
Mathieu Chartier | 02b6a78 | 2012-10-26 13:51:26 -0700 | [diff] [blame] | 1813 | |
Mathieu Chartier | d22d548 | 2012-11-06 17:14:12 -0800 | [diff] [blame] | 1814 | // Note: the following code is thread-safe because it is only called from ProcessReferences which |
| 1815 | // is single threaded. |
Elliott Hughes | adb460d | 2011-10-05 17:02:34 -0700 | [diff] [blame] | 1816 | if (*list == head) { |
| 1817 | ref = *list; |
| 1818 | *list = NULL; |
| 1819 | } else { |
Ian Rogers | 2dd0e2c | 2013-01-24 12:42:14 -0800 | [diff] [blame] | 1820 | mirror::Object* next = head->GetFieldObject<mirror::Object*>(reference_pendingNext_offset_, |
| 1821 | false); |
Elliott Hughes | adb460d | 2011-10-05 17:02:34 -0700 | [diff] [blame] | 1822 | (*list)->SetFieldObject(reference_pendingNext_offset_, next, false); |
| 1823 | ref = head; |
| 1824 | } |
| 1825 | ref->SetFieldObject(reference_pendingNext_offset_, NULL, false); |
| 1826 | return ref; |
| 1827 | } |
| 1828 | |
Ian Rogers | 2dd0e2c | 2013-01-24 12:42:14 -0800 | [diff] [blame] | 1829 | void Heap::AddFinalizerReference(Thread* self, mirror::Object* object) { |
Ian Rogers | 00f7d0e | 2012-07-19 15:28:27 -0700 | [diff] [blame] | 1830 | ScopedObjectAccess soa(self); |
Jeff Hao | 5d91730 | 2013-02-27 17:57:33 -0800 | [diff] [blame] | 1831 | JValue result; |
Jeff Hao | 5d91730 | 2013-02-27 17:57:33 -0800 | [diff] [blame] | 1832 | ArgArray arg_array(NULL, 0); |
| 1833 | arg_array.Append(reinterpret_cast<uint32_t>(object)); |
| 1834 | soa.DecodeMethod(WellKnownClasses::java_lang_ref_FinalizerReference_add)->Invoke(self, |
Jeff Hao | 6474d19 | 2013-03-26 14:08:09 -0700 | [diff] [blame] | 1835 | arg_array.GetArray(), arg_array.GetNumBytes(), &result, 'V'); |
Ian Rogers | 00f7d0e | 2012-07-19 15:28:27 -0700 | [diff] [blame] | 1836 | } |
| 1837 | |
Ian Rogers | 2dd0e2c | 2013-01-24 12:42:14 -0800 | [diff] [blame] | 1838 | void Heap::EnqueueClearedReferences(mirror::Object** cleared) { |
Elliott Hughes | adb460d | 2011-10-05 17:02:34 -0700 | [diff] [blame] | 1839 | DCHECK(cleared != NULL); |
| 1840 | if (*cleared != NULL) { |
Ian Rogers | 64b6d14 | 2012-10-29 16:34:15 -0700 | [diff] [blame] | 1841 | // When a runtime isn't started there are no reference queues to care about so ignore. |
| 1842 | if (LIKELY(Runtime::Current()->IsStarted())) { |
| 1843 | ScopedObjectAccess soa(Thread::Current()); |
Jeff Hao | 5d91730 | 2013-02-27 17:57:33 -0800 | [diff] [blame] | 1844 | JValue result; |
Jeff Hao | 5d91730 | 2013-02-27 17:57:33 -0800 | [diff] [blame] | 1845 | ArgArray arg_array(NULL, 0); |
| 1846 | arg_array.Append(reinterpret_cast<uint32_t>(*cleared)); |
| 1847 | soa.DecodeMethod(WellKnownClasses::java_lang_ref_ReferenceQueue_add)->Invoke(soa.Self(), |
Jeff Hao | 6474d19 | 2013-03-26 14:08:09 -0700 | [diff] [blame] | 1848 | arg_array.GetArray(), arg_array.GetNumBytes(), &result, 'V'); |
Ian Rogers | 64b6d14 | 2012-10-29 16:34:15 -0700 | [diff] [blame] | 1849 | } |
Elliott Hughes | adb460d | 2011-10-05 17:02:34 -0700 | [diff] [blame] | 1850 | *cleared = NULL; |
| 1851 | } |
| 1852 | } |
| 1853 | |
Ian Rogers | 1f53934 | 2012-10-03 21:09:42 -0700 | [diff] [blame] | 1854 | void Heap::RequestConcurrentGC(Thread* self) { |
Mathieu Chartier | 069387a | 2012-06-18 12:01:01 -0700 | [diff] [blame] | 1855 | // Make sure that we can do a concurrent GC. |
Ian Rogers | 120f1c7 | 2012-09-28 17:17:10 -0700 | [diff] [blame] | 1856 | Runtime* runtime = Runtime::Current(); |
Mathieu Chartier | 65db880 | 2012-11-20 12:36:46 -0800 | [diff] [blame] | 1857 | DCHECK(concurrent_gc_); |
Mathieu Chartier | 2b82db4 | 2012-11-14 17:29:05 -0800 | [diff] [blame] | 1858 | if (runtime == NULL || !runtime->IsFinishedStarting() || |
Ian Rogers | 120f1c7 | 2012-09-28 17:17:10 -0700 | [diff] [blame] | 1859 | !runtime->IsConcurrentGcEnabled()) { |
| 1860 | return; |
| 1861 | } |
Ian Rogers | 120f1c7 | 2012-09-28 17:17:10 -0700 | [diff] [blame] | 1862 | { |
| 1863 | MutexLock mu(self, *Locks::runtime_shutdown_lock_); |
| 1864 | if (runtime->IsShuttingDown()) { |
| 1865 | return; |
| 1866 | } |
| 1867 | } |
| 1868 | if (self->IsHandlingStackOverflow()) { |
Mathieu Chartier | 7664f5c | 2012-06-08 18:15:32 -0700 | [diff] [blame] | 1869 | return; |
| 1870 | } |
| 1871 | |
Ian Rogers | 120f1c7 | 2012-09-28 17:17:10 -0700 | [diff] [blame] | 1872 | JNIEnv* env = self->GetJniEnv(); |
Mathieu Chartier | a639903 | 2012-06-11 18:49:50 -0700 | [diff] [blame] | 1873 | DCHECK(WellKnownClasses::java_lang_Daemons != NULL); |
| 1874 | DCHECK(WellKnownClasses::java_lang_Daemons_requestGC != NULL); |
Ian Rogers | 00f7d0e | 2012-07-19 15:28:27 -0700 | [diff] [blame] | 1875 | env->CallStaticVoidMethod(WellKnownClasses::java_lang_Daemons, |
| 1876 | WellKnownClasses::java_lang_Daemons_requestGC); |
Mathieu Chartier | 7664f5c | 2012-06-08 18:15:32 -0700 | [diff] [blame] | 1877 | CHECK(!env->ExceptionCheck()); |
Mathieu Chartier | 7664f5c | 2012-06-08 18:15:32 -0700 | [diff] [blame] | 1878 | } |
| 1879 | |
Ian Rogers | 81d425b | 2012-09-27 16:03:43 -0700 | [diff] [blame] | 1880 | void Heap::ConcurrentGC(Thread* self) { |
Ian Rogers | 120f1c7 | 2012-09-28 17:17:10 -0700 | [diff] [blame] | 1881 | { |
| 1882 | MutexLock mu(self, *Locks::runtime_shutdown_lock_); |
Mathieu Chartier | 65db880 | 2012-11-20 12:36:46 -0800 | [diff] [blame] | 1883 | if (Runtime::Current()->IsShuttingDown()) { |
Ian Rogers | 120f1c7 | 2012-09-28 17:17:10 -0700 | [diff] [blame] | 1884 | return; |
| 1885 | } |
Mathieu Chartier | 2542d66 | 2012-06-21 17:14:11 -0700 | [diff] [blame] | 1886 | } |
Mathieu Chartier | 357e9be | 2012-08-01 11:00:14 -0700 | [diff] [blame] | 1887 | |
Mathieu Chartier | 65db880 | 2012-11-20 12:36:46 -0800 | [diff] [blame] | 1888 | // Wait for any GCs currently running to finish. |
Ian Rogers | 1d54e73 | 2013-05-02 21:10:01 -0700 | [diff] [blame] | 1889 | if (WaitForConcurrentGcToComplete(self) == collector::kGcTypeNone) { |
Mathieu Chartier | c7b83a0 | 2012-09-11 18:07:39 -0700 | [diff] [blame] | 1890 | if (alloc_space_->Size() > min_alloc_space_size_for_sticky_gc_) { |
Ian Rogers | 1d54e73 | 2013-05-02 21:10:01 -0700 | [diff] [blame] | 1891 | CollectGarbageInternal(collector::kGcTypeSticky, kGcCauseBackground, false); |
Mathieu Chartier | 357e9be | 2012-08-01 11:00:14 -0700 | [diff] [blame] | 1892 | } else { |
Ian Rogers | 1d54e73 | 2013-05-02 21:10:01 -0700 | [diff] [blame] | 1893 | CollectGarbageInternal(collector::kGcTypePartial, kGcCauseBackground, false); |
Mathieu Chartier | 357e9be | 2012-08-01 11:00:14 -0700 | [diff] [blame] | 1894 | } |
Mathieu Chartier | cc236d7 | 2012-07-20 10:29:05 -0700 | [diff] [blame] | 1895 | } |
Mathieu Chartier | 7664f5c | 2012-06-08 18:15:32 -0700 | [diff] [blame] | 1896 | } |
| 1897 | |
Elliott Hughes | 8cf5bc0 | 2012-02-02 16:32:16 -0800 | [diff] [blame] | 1898 | void Heap::RequestHeapTrim() { |
Ian Rogers | 4893188 | 2013-01-22 14:35:16 -0800 | [diff] [blame] | 1899 | // GC completed and now we must decide whether to request a heap trim (advising pages back to the |
| 1900 | // kernel) or not. Issuing a request will also cause trimming of the libc heap. As a trim scans |
| 1901 | // a space it will hold its lock and can become a cause of jank. |
| 1902 | // Note, the large object space self trims and the Zygote space was trimmed and unchanging since |
| 1903 | // forking. |
| 1904 | |
Elliott Hughes | 8cf5bc0 | 2012-02-02 16:32:16 -0800 | [diff] [blame] | 1905 | // We don't have a good measure of how worthwhile a trim might be. We can't use the live bitmap |
| 1906 | // because that only marks object heads, so a large array looks like lots of empty space. We |
| 1907 | // don't just call dlmalloc all the time, because the cost of an _attempted_ trim is proportional |
| 1908 | // to utilization (which is probably inversely proportional to how much benefit we can expect). |
| 1909 | // We could try mincore(2) but that's only a measure of how many pages we haven't given away, |
| 1910 | // not how much use we're making of those pages. |
Ian Rogers | 4893188 | 2013-01-22 14:35:16 -0800 | [diff] [blame] | 1911 | uint64_t ms_time = MilliTime(); |
Mathieu Chartier | 2fde533 | 2012-09-14 14:51:54 -0700 | [diff] [blame] | 1912 | float utilization = |
Ian Rogers | 1d54e73 | 2013-05-02 21:10:01 -0700 | [diff] [blame] | 1913 | static_cast<float>(alloc_space_->GetBytesAllocated()) / alloc_space_->Size(); |
| 1914 | if ((utilization > 0.75f) || ((ms_time - last_trim_time_ms_) < 2 * 1000)) { |
Mathieu Chartier | 2fde533 | 2012-09-14 14:51:54 -0700 | [diff] [blame] | 1915 | // Don't bother trimming the alloc space if it's more than 75% utilized, or if a |
| 1916 | // heap trim occurred in the last two seconds. |
| 1917 | return; |
Elliott Hughes | 8cf5bc0 | 2012-02-02 16:32:16 -0800 | [diff] [blame] | 1918 | } |
Ian Rogers | 120f1c7 | 2012-09-28 17:17:10 -0700 | [diff] [blame] | 1919 | |
| 1920 | Thread* self = Thread::Current(); |
| 1921 | { |
| 1922 | MutexLock mu(self, *Locks::runtime_shutdown_lock_); |
| 1923 | Runtime* runtime = Runtime::Current(); |
| 1924 | if (runtime == NULL || !runtime->IsFinishedStarting() || runtime->IsShuttingDown()) { |
| 1925 | // Heap trimming isn't supported without a Java runtime or Daemons (such as at dex2oat time) |
| 1926 | // Also: we do not wish to start a heap trim if the runtime is shutting down (a racy check |
| 1927 | // as we don't hold the lock while requesting the trim). |
| 1928 | return; |
| 1929 | } |
Ian Rogers | e1d490c | 2012-02-03 09:09:07 -0800 | [diff] [blame] | 1930 | } |
Ian Rogers | 4893188 | 2013-01-22 14:35:16 -0800 | [diff] [blame] | 1931 | |
| 1932 | SchedPolicy policy; |
| 1933 | get_sched_policy(self->GetTid(), &policy); |
| 1934 | if (policy == SP_FOREGROUND || policy == SP_AUDIO_APP) { |
| 1935 | // Don't trim the heap if we are a foreground or audio app. |
| 1936 | return; |
| 1937 | } |
| 1938 | |
Ian Rogers | 1d54e73 | 2013-05-02 21:10:01 -0700 | [diff] [blame] | 1939 | last_trim_time_ms_ = ms_time; |
Ian Rogers | 120f1c7 | 2012-09-28 17:17:10 -0700 | [diff] [blame] | 1940 | JNIEnv* env = self->GetJniEnv(); |
Mathieu Chartier | a639903 | 2012-06-11 18:49:50 -0700 | [diff] [blame] | 1941 | DCHECK(WellKnownClasses::java_lang_Daemons != NULL); |
| 1942 | DCHECK(WellKnownClasses::java_lang_Daemons_requestHeapTrim != NULL); |
Ian Rogers | 00f7d0e | 2012-07-19 15:28:27 -0700 | [diff] [blame] | 1943 | env->CallStaticVoidMethod(WellKnownClasses::java_lang_Daemons, |
| 1944 | WellKnownClasses::java_lang_Daemons_requestHeapTrim); |
Elliott Hughes | 8cf5bc0 | 2012-02-02 16:32:16 -0800 | [diff] [blame] | 1945 | CHECK(!env->ExceptionCheck()); |
| 1946 | } |
| 1947 | |
Ian Rogers | 4893188 | 2013-01-22 14:35:16 -0800 | [diff] [blame] | 1948 | size_t Heap::Trim() { |
| 1949 | // Handle a requested heap trim on a thread outside of the main GC thread. |
| 1950 | return alloc_space_->Trim(); |
| 1951 | } |
| 1952 | |
Ian Rogers | 1d54e73 | 2013-05-02 21:10:01 -0700 | [diff] [blame] | 1953 | } // namespace gc |
Carl Shapiro | 69759ea | 2011-07-21 18:13:35 -0700 | [diff] [blame] | 1954 | } // namespace art |