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 | |
Brian Carlstrom | 5643b78 | 2012-02-05 12:32:53 -0800 | [diff] [blame] | 19 | #include <sys/types.h> |
| 20 | #include <sys/wait.h> |
| 21 | |
Brian Carlstrom | 58ae941 | 2011-10-04 00:56:06 -0700 | [diff] [blame] | 22 | #include <limits> |
Carl Shapiro | 58551df | 2011-07-24 03:09:51 -0700 | [diff] [blame] | 23 | #include <vector> |
| 24 | |
Mathieu Chartier | 637e348 | 2012-08-17 10:41:32 -0700 | [diff] [blame] | 25 | #include "atomic.h" |
Ian Rogers | 5d76c43 | 2011-10-31 21:42:49 -0700 | [diff] [blame] | 26 | #include "card_table.h" |
Elliott Hughes | 767a147 | 2011-10-26 18:49:02 -0700 | [diff] [blame] | 27 | #include "debugger.h" |
Mathieu Chartier | cc236d7 | 2012-07-20 10:29:05 -0700 | [diff] [blame] | 28 | #include "heap_bitmap.h" |
Brian Carlstrom | 9cff8e1 | 2011-08-18 16:47:29 -0700 | [diff] [blame] | 29 | #include "image.h" |
Carl Shapiro | 58551df | 2011-07-24 03:09:51 -0700 | [diff] [blame] | 30 | #include "mark_sweep.h" |
Mathieu Chartier | b43b7d4 | 2012-06-19 13:15:09 -0700 | [diff] [blame] | 31 | #include "mod_union_table.h" |
Brian Carlstrom | 578bbdc | 2011-07-21 14:07:47 -0700 | [diff] [blame] | 32 | #include "object.h" |
Ian Rogers | 6d4d9fc | 2011-11-30 16:24:48 -0800 | [diff] [blame] | 33 | #include "object_utils.h" |
Brian Carlstrom | 5643b78 | 2012-02-05 12:32:53 -0800 | [diff] [blame] | 34 | #include "os.h" |
Mathieu Chartier | 7664f5c | 2012-06-08 18:15:32 -0700 | [diff] [blame] | 35 | #include "ScopedLocalRef.h" |
Ian Rogers | 00f7d0e | 2012-07-19 15:28:27 -0700 | [diff] [blame] | 36 | #include "scoped_thread_state_change.h" |
Brian Carlstrom | 578bbdc | 2011-07-21 14:07:47 -0700 | [diff] [blame] | 37 | #include "space.h" |
Carl Shapiro | 58551df | 2011-07-24 03:09:51 -0700 | [diff] [blame] | 38 | #include "stl_util.h" |
Elliott Hughes | 8d768a9 | 2011-09-14 16:35:25 -0700 | [diff] [blame] | 39 | #include "thread_list.h" |
Elliott Hughes | 767a147 | 2011-10-26 18:49:02 -0700 | [diff] [blame] | 40 | #include "timing_logger.h" |
| 41 | #include "UniquePtr.h" |
Elliott Hughes | eac7667 | 2012-05-24 21:56:51 -0700 | [diff] [blame] | 42 | #include "well_known_classes.h" |
Carl Shapiro | 69759ea | 2011-07-21 18:13:35 -0700 | [diff] [blame] | 43 | |
| 44 | namespace art { |
| 45 | |
Ian Rogers | 30fab40 | 2012-01-23 15:43:46 -0800 | [diff] [blame] | 46 | static void UpdateFirstAndLastSpace(Space** first_space, Space** last_space, Space* space) { |
| 47 | if (*first_space == NULL) { |
| 48 | *first_space = space; |
| 49 | *last_space = space; |
| 50 | } else { |
| 51 | if ((*first_space)->Begin() > space->Begin()) { |
| 52 | *first_space = space; |
| 53 | } else if (space->Begin() > (*last_space)->Begin()) { |
| 54 | *last_space = space; |
| 55 | } |
| 56 | } |
| 57 | } |
| 58 | |
Elliott Hughes | ae80b49 | 2012-04-24 10:43:17 -0700 | [diff] [blame] | 59 | static bool GenerateImage(const std::string& image_file_name) { |
Brian Carlstrom | a004aa9 | 2012-02-08 18:05:09 -0800 | [diff] [blame] | 60 | const std::string boot_class_path_string(Runtime::Current()->GetBootClassPathString()); |
Brian Carlstrom | 5643b78 | 2012-02-05 12:32:53 -0800 | [diff] [blame] | 61 | std::vector<std::string> boot_class_path; |
| 62 | Split(boot_class_path_string, ':', boot_class_path); |
Brian Carlstrom | b279337 | 2012-03-17 18:27:16 -0700 | [diff] [blame] | 63 | if (boot_class_path.empty()) { |
| 64 | LOG(FATAL) << "Failed to generate image because no boot class path specified"; |
| 65 | } |
Brian Carlstrom | 5643b78 | 2012-02-05 12:32:53 -0800 | [diff] [blame] | 66 | |
| 67 | std::vector<char*> arg_vector; |
| 68 | |
| 69 | std::string dex2oat_string(GetAndroidRoot()); |
Elliott Hughes | 67d9200 | 2012-03-26 15:08:51 -0700 | [diff] [blame] | 70 | dex2oat_string += (kIsDebugBuild ? "/bin/dex2oatd" : "/bin/dex2oat"); |
Brian Carlstrom | 5643b78 | 2012-02-05 12:32:53 -0800 | [diff] [blame] | 71 | const char* dex2oat = dex2oat_string.c_str(); |
| 72 | arg_vector.push_back(strdup(dex2oat)); |
| 73 | |
| 74 | std::string image_option_string("--image="); |
| 75 | image_option_string += image_file_name; |
| 76 | const char* image_option = image_option_string.c_str(); |
| 77 | arg_vector.push_back(strdup(image_option)); |
| 78 | |
| 79 | arg_vector.push_back(strdup("--runtime-arg")); |
| 80 | arg_vector.push_back(strdup("-Xms64m")); |
| 81 | |
| 82 | arg_vector.push_back(strdup("--runtime-arg")); |
| 83 | arg_vector.push_back(strdup("-Xmx64m")); |
| 84 | |
| 85 | for (size_t i = 0; i < boot_class_path.size(); i++) { |
| 86 | std::string dex_file_option_string("--dex-file="); |
| 87 | dex_file_option_string += boot_class_path[i]; |
| 88 | const char* dex_file_option = dex_file_option_string.c_str(); |
| 89 | arg_vector.push_back(strdup(dex_file_option)); |
| 90 | } |
| 91 | |
| 92 | std::string oat_file_option_string("--oat-file="); |
| 93 | oat_file_option_string += image_file_name; |
| 94 | oat_file_option_string.erase(oat_file_option_string.size() - 3); |
| 95 | oat_file_option_string += "oat"; |
| 96 | const char* oat_file_option = oat_file_option_string.c_str(); |
| 97 | arg_vector.push_back(strdup(oat_file_option)); |
| 98 | |
| 99 | arg_vector.push_back(strdup("--base=0x60000000")); |
| 100 | |
Elliott Hughes | 48436bb | 2012-02-07 15:23:28 -0800 | [diff] [blame] | 101 | std::string command_line(Join(arg_vector, ' ')); |
Brian Carlstrom | 5643b78 | 2012-02-05 12:32:53 -0800 | [diff] [blame] | 102 | LOG(INFO) << command_line; |
| 103 | |
Elliott Hughes | 48436bb | 2012-02-07 15:23:28 -0800 | [diff] [blame] | 104 | arg_vector.push_back(NULL); |
Brian Carlstrom | 5643b78 | 2012-02-05 12:32:53 -0800 | [diff] [blame] | 105 | char** argv = &arg_vector[0]; |
| 106 | |
| 107 | // fork and exec dex2oat |
| 108 | pid_t pid = fork(); |
| 109 | if (pid == 0) { |
| 110 | // no allocation allowed between fork and exec |
| 111 | |
| 112 | // change process groups, so we don't get reaped by ProcessManager |
| 113 | setpgid(0, 0); |
| 114 | |
| 115 | execv(dex2oat, argv); |
| 116 | |
| 117 | PLOG(FATAL) << "execv(" << dex2oat << ") failed"; |
| 118 | return false; |
| 119 | } else { |
| 120 | STLDeleteElements(&arg_vector); |
| 121 | |
| 122 | // wait for dex2oat to finish |
| 123 | int status; |
| 124 | pid_t got_pid = TEMP_FAILURE_RETRY(waitpid(pid, &status, 0)); |
| 125 | if (got_pid != pid) { |
| 126 | PLOG(ERROR) << "waitpid failed: wanted " << pid << ", got " << got_pid; |
| 127 | return false; |
| 128 | } |
| 129 | if (!WIFEXITED(status) || WEXITSTATUS(status) != 0) { |
| 130 | LOG(ERROR) << dex2oat << " failed: " << command_line; |
| 131 | return false; |
| 132 | } |
| 133 | } |
| 134 | return true; |
| 135 | } |
| 136 | |
Elliott Hughes | b3bd5f0 | 2012-03-08 21:05:27 -0800 | [diff] [blame] | 137 | Heap::Heap(size_t initial_size, size_t growth_limit, size_t capacity, |
Ian Rogers | 00f7d0e | 2012-07-19 15:28:27 -0700 | [diff] [blame] | 138 | const std::string& original_image_file_name, bool concurrent_gc) |
| 139 | : alloc_space_(NULL), |
Elliott Hughes | b3bd5f0 | 2012-03-08 21:05:27 -0800 | [diff] [blame] | 140 | card_table_(NULL), |
Ian Rogers | 00f7d0e | 2012-07-19 15:28:27 -0700 | [diff] [blame] | 141 | concurrent_gc_(concurrent_gc), |
| 142 | have_zygote_space_(false), |
Elliott Hughes | b3bd5f0 | 2012-03-08 21:05:27 -0800 | [diff] [blame] | 143 | card_marking_disabled_(false), |
| 144 | is_gc_running_(false), |
Mathieu Chartier | cc236d7 | 2012-07-20 10:29:05 -0700 | [diff] [blame] | 145 | concurrent_start_bytes_(std::numeric_limits<size_t>::max()), |
Mathieu Chartier | 7664f5c | 2012-06-08 18:15:32 -0700 | [diff] [blame] | 146 | concurrent_start_size_(128 * KB), |
| 147 | concurrent_min_free_(256 * KB), |
Mathieu Chartier | 357e9be | 2012-08-01 11:00:14 -0700 | [diff] [blame] | 148 | sticky_gc_count_(0), |
Elliott Hughes | b3bd5f0 | 2012-03-08 21:05:27 -0800 | [diff] [blame] | 149 | num_bytes_allocated_(0), |
| 150 | num_objects_allocated_(0), |
Mathieu Chartier | fd678be | 2012-08-30 14:50:54 -0700 | [diff] [blame^] | 151 | pre_gc_verify_heap_(false), |
| 152 | post_gc_verify_heap_(false), |
| 153 | verify_mod_union_table_(false), |
Mathieu Chartier | 7664f5c | 2012-06-08 18:15:32 -0700 | [diff] [blame] | 154 | last_trim_time_(0), |
Ian Rogers | 00f7d0e | 2012-07-19 15:28:27 -0700 | [diff] [blame] | 155 | try_running_gc_(false), |
| 156 | requesting_gc_(false), |
Elliott Hughes | b3bd5f0 | 2012-03-08 21:05:27 -0800 | [diff] [blame] | 157 | reference_referent_offset_(0), |
| 158 | reference_queue_offset_(0), |
| 159 | reference_queueNext_offset_(0), |
| 160 | reference_pendingNext_offset_(0), |
| 161 | finalizer_reference_zombie_offset_(0), |
| 162 | target_utilization_(0.5), |
Elliott Hughes | b25c3f6 | 2012-03-26 16:35:06 -0700 | [diff] [blame] | 163 | verify_objects_(false) { |
Elliott Hughes | 4dd9b4d | 2011-12-12 18:29:24 -0800 | [diff] [blame] | 164 | if (VLOG_IS_ON(heap) || VLOG_IS_ON(startup)) { |
Elliott Hughes | b3bd5f0 | 2012-03-08 21:05:27 -0800 | [diff] [blame] | 165 | LOG(INFO) << "Heap() entering"; |
Brian Carlstrom | 0a5b14d | 2011-09-27 13:29:15 -0700 | [diff] [blame] | 166 | } |
| 167 | |
Ian Rogers | 30fab40 | 2012-01-23 15:43:46 -0800 | [diff] [blame] | 168 | // Compute the bounds of all spaces for allocating live and mark bitmaps |
| 169 | // there will be at least one space (the alloc space) |
| 170 | Space* first_space = NULL; |
| 171 | Space* last_space = NULL; |
Brian Carlstrom | 4a289ed | 2011-08-16 17:17:49 -0700 | [diff] [blame] | 172 | |
Mathieu Chartier | cc236d7 | 2012-07-20 10:29:05 -0700 | [diff] [blame] | 173 | live_bitmap_.reset(new HeapBitmap(this)); |
| 174 | mark_bitmap_.reset(new HeapBitmap(this)); |
Mathieu Chartier | b062fdd | 2012-07-03 09:51:48 -0700 | [diff] [blame] | 175 | |
Ian Rogers | 30fab40 | 2012-01-23 15:43:46 -0800 | [diff] [blame] | 176 | // Requested begin for the alloc space, to follow the mapped image and oat files |
| 177 | byte* requested_begin = NULL; |
Brian Carlstrom | 5643b78 | 2012-02-05 12:32:53 -0800 | [diff] [blame] | 178 | std::string image_file_name(original_image_file_name); |
| 179 | if (!image_file_name.empty()) { |
Mathieu Chartier | b062fdd | 2012-07-03 09:51:48 -0700 | [diff] [blame] | 180 | Space* image_space = NULL; |
| 181 | |
Brian Carlstrom | 5643b78 | 2012-02-05 12:32:53 -0800 | [diff] [blame] | 182 | if (OS::FileExists(image_file_name.c_str())) { |
| 183 | // If the /system file exists, it should be up-to-date, don't try to generate |
Mathieu Chartier | b062fdd | 2012-07-03 09:51:48 -0700 | [diff] [blame] | 184 | image_space = Space::CreateImageSpace(image_file_name); |
Brian Carlstrom | 5643b78 | 2012-02-05 12:32:53 -0800 | [diff] [blame] | 185 | } else { |
| 186 | // If the /system file didn't exist, we need to use one from the art-cache. |
| 187 | // If the cache file exists, try to open, but if it fails, regenerate. |
| 188 | // If it does not exist, generate. |
| 189 | image_file_name = GetArtCacheFilenameOrDie(image_file_name); |
| 190 | if (OS::FileExists(image_file_name.c_str())) { |
Mathieu Chartier | b062fdd | 2012-07-03 09:51:48 -0700 | [diff] [blame] | 191 | image_space = Space::CreateImageSpace(image_file_name); |
Brian Carlstrom | 5643b78 | 2012-02-05 12:32:53 -0800 | [diff] [blame] | 192 | } |
Mathieu Chartier | b062fdd | 2012-07-03 09:51:48 -0700 | [diff] [blame] | 193 | if (image_space == NULL) { |
Brian Carlstrom | 5643b78 | 2012-02-05 12:32:53 -0800 | [diff] [blame] | 194 | if (!GenerateImage(image_file_name)) { |
| 195 | LOG(FATAL) << "Failed to generate image: " << image_file_name; |
| 196 | } |
Mathieu Chartier | b062fdd | 2012-07-03 09:51:48 -0700 | [diff] [blame] | 197 | image_space = Space::CreateImageSpace(image_file_name); |
Brian Carlstrom | 5643b78 | 2012-02-05 12:32:53 -0800 | [diff] [blame] | 198 | } |
| 199 | } |
Mathieu Chartier | b062fdd | 2012-07-03 09:51:48 -0700 | [diff] [blame] | 200 | if (image_space == NULL) { |
Brian Carlstrom | 223f20f | 2012-02-04 23:06:55 -0800 | [diff] [blame] | 201 | LOG(FATAL) << "Failed to create space from " << image_file_name; |
Brian Carlstrom | 69b15fb | 2011-09-03 12:25:21 -0700 | [diff] [blame] | 202 | } |
Brian Carlstrom | 5643b78 | 2012-02-05 12:32:53 -0800 | [diff] [blame] | 203 | |
Mathieu Chartier | b062fdd | 2012-07-03 09:51:48 -0700 | [diff] [blame] | 204 | AddSpace(image_space); |
| 205 | UpdateFirstAndLastSpace(&first_space, &last_space, image_space); |
Ian Rogers | 30fab40 | 2012-01-23 15:43:46 -0800 | [diff] [blame] | 206 | // Oat files referenced by image files immediately follow them in memory, ensure alloc space |
| 207 | // isn't going to get in the middle |
Mathieu Chartier | b062fdd | 2012-07-03 09:51:48 -0700 | [diff] [blame] | 208 | byte* oat_end_addr = GetImageSpace()->GetImageHeader().GetOatEnd(); |
| 209 | CHECK(oat_end_addr > GetImageSpace()->End()); |
Ian Rogers | 30fab40 | 2012-01-23 15:43:46 -0800 | [diff] [blame] | 210 | if (oat_end_addr > requested_begin) { |
| 211 | requested_begin = reinterpret_cast<byte*>(RoundUp(reinterpret_cast<uintptr_t>(oat_end_addr), |
Mathieu Chartier | fd678be | 2012-08-30 14:50:54 -0700 | [diff] [blame^] | 212 | kPageSize)); |
Brian Carlstrom | 58ae941 | 2011-10-04 00:56:06 -0700 | [diff] [blame] | 213 | } |
Brian Carlstrom | 69b15fb | 2011-09-03 12:25:21 -0700 | [diff] [blame] | 214 | } |
| 215 | |
Mathieu Chartier | b062fdd | 2012-07-03 09:51:48 -0700 | [diff] [blame] | 216 | UniquePtr<AllocSpace> alloc_space(Space::CreateAllocSpace( |
| 217 | "alloc space", initial_size, growth_limit, capacity, requested_begin)); |
| 218 | alloc_space_ = alloc_space.release(); |
Mathieu Chartier | cc236d7 | 2012-07-20 10:29:05 -0700 | [diff] [blame] | 219 | CHECK(alloc_space_ != NULL) << "Failed to create alloc space"; |
Mathieu Chartier | b062fdd | 2012-07-03 09:51:48 -0700 | [diff] [blame] | 220 | AddSpace(alloc_space_); |
Mathieu Chartier | b062fdd | 2012-07-03 09:51:48 -0700 | [diff] [blame] | 221 | |
Ian Rogers | 30fab40 | 2012-01-23 15:43:46 -0800 | [diff] [blame] | 222 | UpdateFirstAndLastSpace(&first_space, &last_space, alloc_space_); |
| 223 | byte* heap_begin = first_space->Begin(); |
Ian Rogers | 3bb17a6 | 2012-01-27 23:56:44 -0800 | [diff] [blame] | 224 | size_t heap_capacity = (last_space->Begin() - first_space->Begin()) + last_space->NonGrowthLimitCapacity(); |
Carl Shapiro | 69759ea | 2011-07-21 18:13:35 -0700 | [diff] [blame] | 225 | |
Ian Rogers | 30fab40 | 2012-01-23 15:43:46 -0800 | [diff] [blame] | 226 | // Mark image objects in the live bitmap |
Elliott Hughes | b3bd5f0 | 2012-03-08 21:05:27 -0800 | [diff] [blame] | 227 | for (size_t i = 0; i < spaces_.size(); ++i) { |
Ian Rogers | 30fab40 | 2012-01-23 15:43:46 -0800 | [diff] [blame] | 228 | Space* space = spaces_[i]; |
| 229 | if (space->IsImageSpace()) { |
Mathieu Chartier | b062fdd | 2012-07-03 09:51:48 -0700 | [diff] [blame] | 230 | space->AsImageSpace()->RecordImageAllocations(space->GetLiveBitmap()); |
Ian Rogers | 30fab40 | 2012-01-23 15:43:46 -0800 | [diff] [blame] | 231 | } |
| 232 | } |
| 233 | |
Elliott Hughes | 6c9c06d | 2011-11-07 16:43:47 -0800 | [diff] [blame] | 234 | // Allocate the card table. |
Mathieu Chartier | cc236d7 | 2012-07-20 10:29:05 -0700 | [diff] [blame] | 235 | card_table_.reset(CardTable::Create(heap_begin, heap_capacity)); |
| 236 | CHECK(card_table_.get() != NULL) << "Failed to create card table"; |
Ian Rogers | 5d76c43 | 2011-10-31 21:42:49 -0700 | [diff] [blame] | 237 | |
Mathieu Chartier | cc236d7 | 2012-07-20 10:29:05 -0700 | [diff] [blame] | 238 | mod_union_table_.reset(new ModUnionTableToZygoteAllocspace<ModUnionTableReferenceCache>(this)); |
| 239 | CHECK(mod_union_table_.get() != NULL) << "Failed to create mod-union table"; |
Mathieu Chartier | b43b7d4 | 2012-06-19 13:15:09 -0700 | [diff] [blame] | 240 | |
Mathieu Chartier | cc236d7 | 2012-07-20 10:29:05 -0700 | [diff] [blame] | 241 | zygote_mod_union_table_.reset(new ModUnionTableCardCache(this)); |
| 242 | 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] | 243 | |
Mathieu Chartier | 357e9be | 2012-08-01 11:00:14 -0700 | [diff] [blame] | 244 | // TODO: Count objects in the image space here. |
Mathieu Chartier | 1cd9c5c | 2012-08-23 10:52:44 -0700 | [diff] [blame] | 245 | num_bytes_allocated_ = 0; |
Ian Rogers | 0cfe1fb | 2011-08-26 03:29:44 -0700 | [diff] [blame] | 246 | num_objects_allocated_ = 0; |
| 247 | |
Mathieu Chartier | 357e9be | 2012-08-01 11:00:14 -0700 | [diff] [blame] | 248 | // Max stack size in bytes. |
| 249 | static const size_t max_stack_size = capacity / SpaceBitmap::kAlignment * kWordSize; |
| 250 | |
| 251 | // TODO: Rename MarkStack to a more generic name? |
| 252 | mark_stack_.reset(MarkStack::Create("dalvik-mark-stack", max_stack_size)); |
| 253 | allocation_stack_.reset(MarkStack::Create("dalvik-allocation-stack", max_stack_size)); |
| 254 | live_stack_.reset(MarkStack::Create("dalvik-live-stack", max_stack_size)); |
Mathieu Chartier | 5301cd2 | 2012-05-31 12:11:36 -0700 | [diff] [blame] | 255 | |
Elliott Hughes | b3bd5f0 | 2012-03-08 21:05:27 -0800 | [diff] [blame] | 256 | // It's still too early to take a lock because there are no threads yet, |
Elliott Hughes | 92b3b56 | 2011-09-08 16:32:26 -0700 | [diff] [blame] | 257 | // but we can create the heap lock now. We don't create it earlier to |
| 258 | // make it clear that you can't use locks during heap initialization. |
Mathieu Chartier | fd678be | 2012-08-30 14:50:54 -0700 | [diff] [blame^] | 259 | gc_complete_lock_ = new Mutex("GC complete lock"); |
Ian Rogers | 00f7d0e | 2012-07-19 15:28:27 -0700 | [diff] [blame] | 260 | gc_complete_cond_.reset(new ConditionVariable("GC complete condition variable")); |
Brian Carlstrom | 0a5b14d | 2011-09-27 13:29:15 -0700 | [diff] [blame] | 261 | |
Elliott Hughes | 4dd9b4d | 2011-12-12 18:29:24 -0800 | [diff] [blame] | 262 | if (VLOG_IS_ON(heap) || VLOG_IS_ON(startup)) { |
Elliott Hughes | b3bd5f0 | 2012-03-08 21:05:27 -0800 | [diff] [blame] | 263 | LOG(INFO) << "Heap() exiting"; |
Brian Carlstrom | 0a5b14d | 2011-09-27 13:29:15 -0700 | [diff] [blame] | 264 | } |
Carl Shapiro | 69759ea | 2011-07-21 18:13:35 -0700 | [diff] [blame] | 265 | } |
| 266 | |
Mathieu Chartier | cc236d7 | 2012-07-20 10:29:05 -0700 | [diff] [blame] | 267 | // Sort spaces based on begin address |
| 268 | class SpaceSorter { |
| 269 | public: |
Mathieu Chartier | fd678be | 2012-08-30 14:50:54 -0700 | [diff] [blame^] | 270 | bool operator ()(const Space* a, const Space* b) const { |
Mathieu Chartier | cc236d7 | 2012-07-20 10:29:05 -0700 | [diff] [blame] | 271 | return a->Begin() < b->Begin(); |
| 272 | } |
| 273 | }; |
| 274 | |
Elliott Hughes | b3bd5f0 | 2012-03-08 21:05:27 -0800 | [diff] [blame] | 275 | void Heap::AddSpace(Space* space) { |
Ian Rogers | 00f7d0e | 2012-07-19 15:28:27 -0700 | [diff] [blame] | 276 | WriterMutexLock mu(*GlobalSynchronization::heap_bitmap_lock_); |
Mathieu Chartier | cc236d7 | 2012-07-20 10:29:05 -0700 | [diff] [blame] | 277 | DCHECK(space != NULL); |
Mathieu Chartier | b062fdd | 2012-07-03 09:51:48 -0700 | [diff] [blame] | 278 | DCHECK(space->GetLiveBitmap() != NULL); |
| 279 | live_bitmap_->AddSpaceBitmap(space->GetLiveBitmap()); |
Mathieu Chartier | b062fdd | 2012-07-03 09:51:48 -0700 | [diff] [blame] | 280 | DCHECK(space->GetMarkBitmap() != NULL); |
| 281 | mark_bitmap_->AddSpaceBitmap(space->GetMarkBitmap()); |
Elliott Hughes | b3bd5f0 | 2012-03-08 21:05:27 -0800 | [diff] [blame] | 282 | spaces_.push_back(space); |
Mathieu Chartier | 357e9be | 2012-08-01 11:00:14 -0700 | [diff] [blame] | 283 | if (space->IsAllocSpace()) { |
| 284 | alloc_space_ = space->AsAllocSpace(); |
| 285 | } |
| 286 | |
Mathieu Chartier | cc236d7 | 2012-07-20 10:29:05 -0700 | [diff] [blame] | 287 | // Ensure that spaces remain sorted in increasing order of start address (required for CMS finger) |
| 288 | std::sort(spaces_.begin(), spaces_.end(), SpaceSorter()); |
Mathieu Chartier | 357e9be | 2012-08-01 11:00:14 -0700 | [diff] [blame] | 289 | |
| 290 | // Ensure that ImageSpaces < ZygoteSpaces < AllocSpaces so that we can do address based checks to |
| 291 | // avoid redundant marking. |
| 292 | bool seen_zygote = false, seen_alloc = false; |
| 293 | for (Spaces::const_iterator it = spaces_.begin(); it != spaces_.end(); ++it) { |
| 294 | Space* space = *it; |
| 295 | if (space->IsImageSpace()) { |
| 296 | DCHECK(!seen_zygote); |
| 297 | DCHECK(!seen_alloc); |
Mathieu Chartier | fd678be | 2012-08-30 14:50:54 -0700 | [diff] [blame^] | 298 | } else if (space->IsZygoteSpace()) { |
Mathieu Chartier | 357e9be | 2012-08-01 11:00:14 -0700 | [diff] [blame] | 299 | DCHECK(!seen_alloc); |
| 300 | seen_zygote = true; |
| 301 | } else if (space->IsAllocSpace()) { |
| 302 | seen_alloc = true; |
| 303 | } |
| 304 | } |
Elliott Hughes | b3bd5f0 | 2012-03-08 21:05:27 -0800 | [diff] [blame] | 305 | } |
| 306 | |
| 307 | Heap::~Heap() { |
Mathieu Chartier | 357e9be | 2012-08-01 11:00:14 -0700 | [diff] [blame] | 308 | // If we don't reset then the mark stack complains in it's destructor. |
| 309 | allocation_stack_->Reset(); |
| 310 | live_stack_->Reset(); |
| 311 | |
Elliott Hughes | b3bd5f0 | 2012-03-08 21:05:27 -0800 | [diff] [blame] | 312 | VLOG(heap) << "~Heap()"; |
Elliott Hughes | b3e66df | 2012-01-12 14:49:18 -0800 | [diff] [blame] | 313 | // We can't take the heap lock here because there might be a daemon thread suspended with the |
| 314 | // heap lock held. We know though that no non-daemon threads are executing, and we know that |
| 315 | // all daemon threads are suspended, and we also know that the threads list have been deleted, so |
| 316 | // those threads can't resume. We're the only running thread, and we can do whatever we like... |
Carl Shapiro | 58551df | 2011-07-24 03:09:51 -0700 | [diff] [blame] | 317 | STLDeleteElements(&spaces_); |
Ian Rogers | 00f7d0e | 2012-07-19 15:28:27 -0700 | [diff] [blame] | 318 | delete gc_complete_lock_; |
| 319 | |
Carl Shapiro | 69759ea | 2011-07-21 18:13:35 -0700 | [diff] [blame] | 320 | } |
| 321 | |
Mathieu Chartier | b062fdd | 2012-07-03 09:51:48 -0700 | [diff] [blame] | 322 | Space* Heap::FindSpaceFromObject(const Object* obj) const { |
| 323 | // TODO: C++0x auto |
Mathieu Chartier | fd678be | 2012-08-30 14:50:54 -0700 | [diff] [blame^] | 324 | for (Spaces::const_iterator it = spaces_.begin(); it != spaces_.end(); ++it) { |
| 325 | if ((*it)->Contains(obj)) { |
| 326 | return *it; |
Mathieu Chartier | b062fdd | 2012-07-03 09:51:48 -0700 | [diff] [blame] | 327 | } |
| 328 | } |
| 329 | LOG(FATAL) << "object " << reinterpret_cast<const void*>(obj) << " not inside any spaces!"; |
| 330 | return NULL; |
| 331 | } |
| 332 | |
| 333 | ImageSpace* Heap::GetImageSpace() { |
| 334 | // TODO: C++0x auto |
Mathieu Chartier | fd678be | 2012-08-30 14:50:54 -0700 | [diff] [blame^] | 335 | for (Spaces::const_iterator it = spaces_.begin(); it != spaces_.end(); ++it) { |
| 336 | if ((*it)->IsImageSpace()) { |
| 337 | return (*it)->AsImageSpace(); |
Mathieu Chartier | b062fdd | 2012-07-03 09:51:48 -0700 | [diff] [blame] | 338 | } |
| 339 | } |
| 340 | return NULL; |
| 341 | } |
| 342 | |
| 343 | AllocSpace* Heap::GetAllocSpace() { |
| 344 | return alloc_space_; |
| 345 | } |
| 346 | |
Elliott Hughes | 8a8b9cb | 2012-04-13 18:29:22 -0700 | [diff] [blame] | 347 | static void MSpaceChunkCallback(void* start, void* end, size_t used_bytes, void* arg) { |
| 348 | size_t& max_contiguous_allocation = *reinterpret_cast<size_t*>(arg); |
| 349 | |
| 350 | size_t chunk_size = static_cast<size_t>(reinterpret_cast<uint8_t*>(end) - reinterpret_cast<uint8_t*>(start)); |
| 351 | size_t chunk_free_bytes = 0; |
| 352 | if (used_bytes < chunk_size) { |
| 353 | chunk_free_bytes = chunk_size - used_bytes; |
| 354 | } |
| 355 | |
| 356 | if (chunk_free_bytes > max_contiguous_allocation) { |
| 357 | max_contiguous_allocation = chunk_free_bytes; |
| 358 | } |
| 359 | } |
| 360 | |
| 361 | Object* Heap::AllocObject(Class* c, size_t byte_count) { |
Ian Rogers | 00f7d0e | 2012-07-19 15:28:27 -0700 | [diff] [blame] | 362 | DCHECK(c == NULL || (c->IsClassClass() && byte_count >= sizeof(Class)) || |
| 363 | (c->IsVariableSize() || c->GetObjectSize() == byte_count) || |
| 364 | strlen(ClassHelper(c).GetDescriptor()) == 0); |
| 365 | DCHECK_GE(byte_count, sizeof(Object)); |
Mathieu Chartier | 037813d | 2012-08-23 16:44:59 -0700 | [diff] [blame] | 366 | Object* obj = Allocate(alloc_space_, byte_count); |
| 367 | if (LIKELY(obj != NULL)) { |
| 368 | #if VERIFY_OBJECT_ENABLED |
| 369 | WriterMutexLock mu(*GlobalSynchronization::heap_bitmap_lock_); |
| 370 | // Verify objects doesn't like objects in allocation stack not being marked as live. |
| 371 | live_bitmap_->Set(obj); |
| 372 | #endif |
| 373 | |
Ian Rogers | 00f7d0e | 2012-07-19 15:28:27 -0700 | [diff] [blame] | 374 | obj->SetClass(c); |
Mathieu Chartier | 037813d | 2012-08-23 16:44:59 -0700 | [diff] [blame] | 375 | |
| 376 | // Record allocation after since we want to use the atomic add for the atomic fence to guard |
| 377 | // the SetClass since we do not want the class to appear NULL in another thread. |
| 378 | RecordAllocation(alloc_space_, obj); |
| 379 | |
Ian Rogers | 00f7d0e | 2012-07-19 15:28:27 -0700 | [diff] [blame] | 380 | if (Dbg::IsAllocTrackingEnabled()) { |
| 381 | Dbg::RecordAllocation(c, byte_count); |
Elliott Hughes | 418dfe7 | 2011-10-06 18:56:27 -0700 | [diff] [blame] | 382 | } |
Mathieu Chartier | 637e348 | 2012-08-17 10:41:32 -0700 | [diff] [blame] | 383 | const bool request_concurrent_gc = num_bytes_allocated_ >= concurrent_start_bytes_; |
Ian Rogers | 00f7d0e | 2012-07-19 15:28:27 -0700 | [diff] [blame] | 384 | if (request_concurrent_gc) { |
| 385 | // The SirtRef is necessary since the calls in RequestConcurrentGC are a safepoint. |
| 386 | SirtRef<Object> ref(obj); |
| 387 | RequestConcurrentGC(); |
| 388 | } |
| 389 | VerifyObject(obj); |
| 390 | |
| 391 | // Additional verification to ensure that we did not allocate into a zygote space. |
| 392 | DCHECK(!have_zygote_space_ || !FindSpaceFromObject(obj)->IsZygoteSpace()); |
| 393 | |
| 394 | return obj; |
| 395 | } |
Mathieu Chartier | 037813d | 2012-08-23 16:44:59 -0700 | [diff] [blame] | 396 | int64_t total_bytes_free = GetFreeMemory(); |
| 397 | size_t max_contiguous_allocation = 0; |
Ian Rogers | 00f7d0e | 2012-07-19 15:28:27 -0700 | [diff] [blame] | 398 | // TODO: C++0x auto |
Mathieu Chartier | fd678be | 2012-08-30 14:50:54 -0700 | [diff] [blame^] | 399 | for (Spaces::const_iterator it = spaces_.begin(); it != spaces_.end(); ++it) { |
| 400 | if ((*it)->IsAllocSpace()) { |
| 401 | (*it)->AsAllocSpace()->Walk(MSpaceChunkCallback, &max_contiguous_allocation); |
Mathieu Chartier | b062fdd | 2012-07-03 09:51:48 -0700 | [diff] [blame] | 402 | } |
Carl Shapiro | 58551df | 2011-07-24 03:09:51 -0700 | [diff] [blame] | 403 | } |
Elliott Hughes | 418dfe7 | 2011-10-06 18:56:27 -0700 | [diff] [blame] | 404 | |
Elliott Hughes | 8a8b9cb | 2012-04-13 18:29:22 -0700 | [diff] [blame] | 405 | std::string msg(StringPrintf("Failed to allocate a %zd-byte %s (%lld total bytes free; largest possible contiguous allocation %zd bytes)", |
Mathieu Chartier | fd678be | 2012-08-30 14:50:54 -0700 | [diff] [blame^] | 406 | byte_count, PrettyDescriptor(c).c_str(), total_bytes_free, max_contiguous_allocation)); |
Elliott Hughes | 8a8b9cb | 2012-04-13 18:29:22 -0700 | [diff] [blame] | 407 | Thread::Current()->ThrowOutOfMemoryError(msg.c_str()); |
Elliott Hughes | 418dfe7 | 2011-10-06 18:56:27 -0700 | [diff] [blame] | 408 | return NULL; |
Carl Shapiro | 58551df | 2011-07-24 03:09:51 -0700 | [diff] [blame] | 409 | } |
| 410 | |
Elliott Hughes | cf4c6c4 | 2011-09-01 15:16:42 -0700 | [diff] [blame] | 411 | bool Heap::IsHeapAddress(const Object* obj) { |
Elliott Hughes | 92b3b56 | 2011-09-08 16:32:26 -0700 | [diff] [blame] | 412 | // Note: we deliberately don't take the lock here, and mustn't test anything that would |
| 413 | // require taking the lock. |
Elliott Hughes | 88c5c35 | 2012-03-15 18:49:48 -0700 | [diff] [blame] | 414 | if (obj == NULL) { |
| 415 | return true; |
| 416 | } |
| 417 | if (!IsAligned<kObjectAlignment>(obj)) { |
Elliott Hughes | a250199 | 2011-08-26 19:39:54 -0700 | [diff] [blame] | 418 | return false; |
| 419 | } |
Elliott Hughes | b3bd5f0 | 2012-03-08 21:05:27 -0800 | [diff] [blame] | 420 | for (size_t i = 0; i < spaces_.size(); ++i) { |
Ian Rogers | 30fab40 | 2012-01-23 15:43:46 -0800 | [diff] [blame] | 421 | if (spaces_[i]->Contains(obj)) { |
| 422 | return true; |
| 423 | } |
| 424 | } |
| 425 | return false; |
Elliott Hughes | a250199 | 2011-08-26 19:39:54 -0700 | [diff] [blame] | 426 | } |
| 427 | |
Elliott Hughes | 6a5bd49 | 2011-10-28 14:33:57 -0700 | [diff] [blame] | 428 | bool Heap::IsLiveObjectLocked(const Object* obj) { |
Ian Rogers | 00f7d0e | 2012-07-19 15:28:27 -0700 | [diff] [blame] | 429 | GlobalSynchronization::heap_bitmap_lock_->AssertReaderHeld(); |
Mathieu Chartier | b062fdd | 2012-07-03 09:51:48 -0700 | [diff] [blame] | 430 | return IsHeapAddress(obj) && GetLiveBitmap()->Test(obj); |
Elliott Hughes | 6a5bd49 | 2011-10-28 14:33:57 -0700 | [diff] [blame] | 431 | } |
| 432 | |
Elliott Hughes | 3e465b1 | 2011-09-02 18:26:12 -0700 | [diff] [blame] | 433 | #if VERIFY_OBJECT_ENABLED |
Ian Rogers | 0cfe1fb | 2011-08-26 03:29:44 -0700 | [diff] [blame] | 434 | void Heap::VerifyObject(const Object* obj) { |
Mathieu Chartier | dcf8d72 | 2012-08-02 14:55:54 -0700 | [diff] [blame] | 435 | if (obj == NULL || this == NULL || !verify_objects_ || Runtime::Current()->IsShuttingDown() || |
Ian Rogers | 141d622 | 2012-04-05 12:23:06 -0700 | [diff] [blame] | 436 | Thread::Current() == NULL || |
jeffhao | 2504552 | 2012-03-13 19:34:37 -0700 | [diff] [blame] | 437 | Runtime::Current()->GetThreadList()->GetLockOwner() == Thread::Current()->GetTid()) { |
Elliott Hughes | 85d1545 | 2011-09-16 17:33:01 -0700 | [diff] [blame] | 438 | return; |
| 439 | } |
Mathieu Chartier | 357e9be | 2012-08-01 11:00:14 -0700 | [diff] [blame] | 440 | VerifyObjectBody(obj); |
Elliott Hughes | 92b3b56 | 2011-09-08 16:32:26 -0700 | [diff] [blame] | 441 | } |
| 442 | #endif |
| 443 | |
Mathieu Chartier | cc236d7 | 2012-07-20 10:29:05 -0700 | [diff] [blame] | 444 | void Heap::DumpSpaces() { |
| 445 | // TODO: C++0x auto |
| 446 | for (Spaces::iterator it = spaces_.begin(); it != spaces_.end(); ++it) { |
Mathieu Chartier | 357e9be | 2012-08-01 11:00:14 -0700 | [diff] [blame] | 447 | Space* space = *it; |
| 448 | LOG(INFO) << *space; |
| 449 | LOG(INFO) << *space->GetLiveBitmap(); |
| 450 | LOG(INFO) << *space->GetMarkBitmap(); |
Mathieu Chartier | cc236d7 | 2012-07-20 10:29:05 -0700 | [diff] [blame] | 451 | } |
| 452 | } |
| 453 | |
Mathieu Chartier | 357e9be | 2012-08-01 11:00:14 -0700 | [diff] [blame] | 454 | // We want to avoid bit rotting. |
| 455 | void Heap::VerifyObjectBody(const Object* obj) { |
Mathieu Chartier | dcf8d72 | 2012-08-02 14:55:54 -0700 | [diff] [blame] | 456 | if (!IsAligned<kObjectAlignment>(obj)) { |
| 457 | LOG(FATAL) << "Object isn't aligned: " << obj; |
| 458 | } else if (!GetLiveBitmap()->Test(obj)) { |
Mathieu Chartier | 357e9be | 2012-08-01 11:00:14 -0700 | [diff] [blame] | 459 | DumpSpaces(); |
| 460 | LOG(FATAL) << "Object is dead: " << obj; |
Ian Rogers | 0cfe1fb | 2011-08-26 03:29:44 -0700 | [diff] [blame] | 461 | } |
Mathieu Chartier | 357e9be | 2012-08-01 11:00:14 -0700 | [diff] [blame] | 462 | |
Mathieu Chartier | dcf8d72 | 2012-08-02 14:55:54 -0700 | [diff] [blame] | 463 | // Ignore early dawn of the universe verifications |
Mathieu Chartier | 357e9be | 2012-08-01 11:00:14 -0700 | [diff] [blame] | 464 | if (!VERIFY_OBJECT_FAST && num_objects_allocated_ > 10) { |
Mathieu Chartier | dcf8d72 | 2012-08-02 14:55:54 -0700 | [diff] [blame] | 465 | const byte* raw_addr = reinterpret_cast<const byte*>(obj) + |
| 466 | Object::ClassOffset().Int32Value(); |
| 467 | const Class* c = *reinterpret_cast<Class* const *>(raw_addr); |
| 468 | if (c == NULL) { |
| 469 | LOG(FATAL) << "Null class in object: " << obj; |
| 470 | } else if (!IsAligned<kObjectAlignment>(c)) { |
| 471 | LOG(FATAL) << "Class isn't aligned: " << c << " in object: " << obj; |
| 472 | } else if (!GetLiveBitmap()->Test(c)) { |
| 473 | LOG(FATAL) << "Class of object is dead: " << c << " in object: " << obj; |
| 474 | } |
| 475 | // Check obj.getClass().getClass() == obj.getClass().getClass().getClass() |
| 476 | // Note: we don't use the accessors here as they have internal sanity checks |
| 477 | // that we don't want to run |
| 478 | raw_addr = reinterpret_cast<const byte*>(c) + Object::ClassOffset().Int32Value(); |
| 479 | const Class* c_c = *reinterpret_cast<Class* const *>(raw_addr); |
| 480 | raw_addr = reinterpret_cast<const byte*>(c_c) + Object::ClassOffset().Int32Value(); |
| 481 | const Class* c_c_c = *reinterpret_cast<Class* const *>(raw_addr); |
| 482 | CHECK_EQ(c_c, c_c_c); |
| 483 | } |
Ian Rogers | 0cfe1fb | 2011-08-26 03:29:44 -0700 | [diff] [blame] | 484 | } |
| 485 | |
Brian Carlstrom | 78128a6 | 2011-09-15 17:21:19 -0700 | [diff] [blame] | 486 | void Heap::VerificationCallback(Object* obj, void* arg) { |
Ian Rogers | 0cfe1fb | 2011-08-26 03:29:44 -0700 | [diff] [blame] | 487 | DCHECK(obj != NULL); |
Mathieu Chartier | 357e9be | 2012-08-01 11:00:14 -0700 | [diff] [blame] | 488 | reinterpret_cast<Heap*>(arg)->VerifyObjectBody(obj); |
Ian Rogers | 0cfe1fb | 2011-08-26 03:29:44 -0700 | [diff] [blame] | 489 | } |
| 490 | |
| 491 | void Heap::VerifyHeap() { |
Ian Rogers | 00f7d0e | 2012-07-19 15:28:27 -0700 | [diff] [blame] | 492 | ReaderMutexLock mu(*GlobalSynchronization::heap_bitmap_lock_); |
Mathieu Chartier | b062fdd | 2012-07-03 09:51:48 -0700 | [diff] [blame] | 493 | GetLiveBitmap()->Walk(Heap::VerificationCallback, this); |
Ian Rogers | 0cfe1fb | 2011-08-26 03:29:44 -0700 | [diff] [blame] | 494 | } |
| 495 | |
Ian Rogers | 00f7d0e | 2012-07-19 15:28:27 -0700 | [diff] [blame] | 496 | void Heap::RecordAllocation(AllocSpace* space, const Object* obj) { |
Mathieu Chartier | fd678be | 2012-08-30 14:50:54 -0700 | [diff] [blame^] | 497 | DCHECK(obj != NULL); |
Elliott Hughes | 9d5ccec | 2011-09-19 13:19:50 -0700 | [diff] [blame] | 498 | |
Mathieu Chartier | fd678be | 2012-08-30 14:50:54 -0700 | [diff] [blame^] | 499 | size_t size = space->AllocationSize(obj); |
| 500 | DCHECK_GT(size, 0u); |
| 501 | COMPILE_ASSERT(sizeof(size_t) == sizeof(int32_t), |
| 502 | int32_t_must_be_same_size_as_size_t_for_used_atomic_operations); |
| 503 | android_atomic_add( |
| 504 | size, reinterpret_cast<volatile int32_t*>(reinterpret_cast<size_t>(&num_bytes_allocated_))); |
| 505 | android_atomic_add( |
| 506 | 1, reinterpret_cast<volatile int32_t*>(reinterpret_cast<size_t>(&num_objects_allocated_))); |
| 507 | |
| 508 | if (Runtime::Current()->HasStatsEnabled()) { |
| 509 | RuntimeStats* global_stats = Runtime::Current()->GetStats(); |
| 510 | RuntimeStats* thread_stats = Thread::Current()->GetStats(); |
| 511 | ++global_stats->allocated_objects; |
| 512 | ++thread_stats->allocated_objects; |
| 513 | global_stats->allocated_bytes += size; |
| 514 | thread_stats->allocated_bytes += size; |
Elliott Hughes | 9d5ccec | 2011-09-19 13:19:50 -0700 | [diff] [blame] | 515 | } |
Mathieu Chartier | 357e9be | 2012-08-01 11:00:14 -0700 | [diff] [blame] | 516 | |
Mathieu Chartier | 357e9be | 2012-08-01 11:00:14 -0700 | [diff] [blame] | 517 | allocation_stack_->AtomicPush(obj); |
Carl Shapiro | 58551df | 2011-07-24 03:09:51 -0700 | [diff] [blame] | 518 | } |
| 519 | |
Ian Rogers | 00f7d0e | 2012-07-19 15:28:27 -0700 | [diff] [blame] | 520 | void Heap::RecordFree(size_t freed_objects, size_t freed_bytes) { |
Mathieu Chartier | 637e348 | 2012-08-17 10:41:32 -0700 | [diff] [blame] | 521 | COMPILE_ASSERT(sizeof(size_t) == sizeof(int32_t), |
| 522 | int32_t_must_be_same_size_as_size_t_for_used_atomic_operations); |
Mathieu Chartier | 357e9be | 2012-08-01 11:00:14 -0700 | [diff] [blame] | 523 | DCHECK_LE(freed_objects, num_objects_allocated_); |
Mathieu Chartier | 637e348 | 2012-08-17 10:41:32 -0700 | [diff] [blame] | 524 | android_atomic_add(-static_cast<int32_t>(freed_objects), |
Mathieu Chartier | 556fad3 | 2012-08-20 16:13:20 -0700 | [diff] [blame] | 525 | reinterpret_cast<volatile int32_t*>( |
| 526 | reinterpret_cast<size_t>(&num_objects_allocated_))); |
Mathieu Chartier | 357e9be | 2012-08-01 11:00:14 -0700 | [diff] [blame] | 527 | |
| 528 | DCHECK_LE(freed_bytes, num_bytes_allocated_); |
Mathieu Chartier | 637e348 | 2012-08-17 10:41:32 -0700 | [diff] [blame] | 529 | android_atomic_add(-static_cast<int32_t>(freed_bytes), |
Mathieu Chartier | 556fad3 | 2012-08-20 16:13:20 -0700 | [diff] [blame] | 530 | reinterpret_cast<volatile int32_t*>( |
| 531 | reinterpret_cast<size_t>(&num_bytes_allocated_))); |
Elliott Hughes | 9d5ccec | 2011-09-19 13:19:50 -0700 | [diff] [blame] | 532 | |
| 533 | if (Runtime::Current()->HasStatsEnabled()) { |
| 534 | RuntimeStats* global_stats = Runtime::Current()->GetStats(); |
| 535 | RuntimeStats* thread_stats = Thread::Current()->GetStats(); |
Mathieu Chartier | 357e9be | 2012-08-01 11:00:14 -0700 | [diff] [blame] | 536 | global_stats->freed_objects += freed_objects; |
| 537 | thread_stats->freed_objects += freed_objects; |
Elliott Hughes | 307f75d | 2011-10-12 18:04:40 -0700 | [diff] [blame] | 538 | global_stats->freed_bytes += freed_bytes; |
| 539 | thread_stats->freed_bytes += freed_bytes; |
Elliott Hughes | 9d5ccec | 2011-09-19 13:19:50 -0700 | [diff] [blame] | 540 | } |
Carl Shapiro | 58551df | 2011-07-24 03:09:51 -0700 | [diff] [blame] | 541 | } |
| 542 | |
Ian Rogers | 00f7d0e | 2012-07-19 15:28:27 -0700 | [diff] [blame] | 543 | Object* Heap::Allocate(AllocSpace* space, size_t alloc_size) { |
| 544 | Thread* self = Thread::Current(); |
Ian Rogers | 0399dde | 2012-06-06 17:09:28 -0700 | [diff] [blame] | 545 | // Since allocation can cause a GC which will need to SuspendAll, make sure all allocations are |
| 546 | // done in the runnable state where suspension is expected. |
Ian Rogers | 00f7d0e | 2012-07-19 15:28:27 -0700 | [diff] [blame] | 547 | #ifndef NDEBUG |
| 548 | { |
| 549 | MutexLock mu(*GlobalSynchronization::thread_suspend_count_lock_); |
| 550 | CHECK_EQ(self->GetState(), kRunnable); |
| 551 | } |
| 552 | self->AssertThreadSuspensionIsAllowable(); |
| 553 | #endif |
Brian Carlstrom | b82b687 | 2011-10-26 17:18:07 -0700 | [diff] [blame] | 554 | |
Ian Rogers | 30fab40 | 2012-01-23 15:43:46 -0800 | [diff] [blame] | 555 | Object* ptr = space->AllocWithoutGrowth(alloc_size); |
Carl Shapiro | 69759ea | 2011-07-21 18:13:35 -0700 | [diff] [blame] | 556 | if (ptr != NULL) { |
| 557 | return ptr; |
| 558 | } |
| 559 | |
Ian Rogers | 00f7d0e | 2012-07-19 15:28:27 -0700 | [diff] [blame] | 560 | // The allocation failed. If the GC is running, block until it completes else request a |
| 561 | // foreground partial collection. |
| 562 | if (!WaitForConcurrentGcToComplete()) { |
| 563 | // No concurrent GC so perform a foreground collection. |
| 564 | if (Runtime::Current()->HasStatsEnabled()) { |
| 565 | ++Runtime::Current()->GetStats()->gc_for_alloc_count; |
| 566 | ++Thread::Current()->GetStats()->gc_for_alloc_count; |
Carl Shapiro | 69759ea | 2011-07-21 18:13:35 -0700 | [diff] [blame] | 567 | } |
Ian Rogers | 00f7d0e | 2012-07-19 15:28:27 -0700 | [diff] [blame] | 568 | self->TransitionFromRunnableToSuspended(kWaitingPerformingGc); |
Mathieu Chartier | fd678be | 2012-08-30 14:50:54 -0700 | [diff] [blame^] | 569 | const size_t alloc_space_size = alloc_space_->Size(); |
| 570 | if (alloc_space_size > kMinAllocSpaceSizeForStickyGC |
| 571 | && alloc_space_->Capacity() - alloc_space_size >= kMinRemainingSpaceForStickyGC) { |
| 572 | CollectGarbageInternal(GC_STICKY, false); |
| 573 | } else { |
| 574 | CollectGarbageInternal(have_zygote_space_ ? GC_PARTIAL : GC_FULL, false); |
| 575 | } |
| 576 | self->TransitionFromSuspendedToRunnable(); |
| 577 | } else if (have_zygote_space_) { |
| 578 | // TODO: Keep track of what kind of Gc we waited to complete and is this to figure out what Gc |
| 579 | // to do. |
| 580 | // Try a partial Gc. |
| 581 | if (Runtime::Current()->HasStatsEnabled()) { |
| 582 | ++Runtime::Current()->GetStats()->gc_for_alloc_count; |
| 583 | ++Thread::Current()->GetStats()->gc_for_alloc_count; |
| 584 | } |
| 585 | self->TransitionFromRunnableToSuspended(kWaitingPerformingGc); |
| 586 | CollectGarbageInternal(GC_PARTIAL, false); |
Ian Rogers | 00f7d0e | 2012-07-19 15:28:27 -0700 | [diff] [blame] | 587 | self->TransitionFromSuspendedToRunnable(); |
Carl Shapiro | 69759ea | 2011-07-21 18:13:35 -0700 | [diff] [blame] | 588 | } |
| 589 | |
Ian Rogers | 30fab40 | 2012-01-23 15:43:46 -0800 | [diff] [blame] | 590 | ptr = space->AllocWithoutGrowth(alloc_size); |
Carl Shapiro | 69759ea | 2011-07-21 18:13:35 -0700 | [diff] [blame] | 591 | if (ptr != NULL) { |
| 592 | return ptr; |
| 593 | } |
| 594 | |
Mathieu Chartier | fd678be | 2012-08-30 14:50:54 -0700 | [diff] [blame^] | 595 | // Partial GC didn't free enough memory, try a full GC. |
| 596 | if (Runtime::Current()->HasStatsEnabled()) { |
| 597 | ++Runtime::Current()->GetStats()->gc_for_alloc_count; |
| 598 | ++Thread::Current()->GetStats()->gc_for_alloc_count; |
Mathieu Chartier | 357e9be | 2012-08-01 11:00:14 -0700 | [diff] [blame] | 599 | } |
Mathieu Chartier | fd678be | 2012-08-30 14:50:54 -0700 | [diff] [blame^] | 600 | self->TransitionFromRunnableToSuspended(kWaitingPerformingGc); |
| 601 | CollectGarbageInternal(GC_FULL, false); |
| 602 | self->TransitionFromSuspendedToRunnable(); |
| 603 | ptr = space->AllocWithoutGrowth(alloc_size); |
| 604 | if (ptr != NULL) { |
| 605 | return ptr; |
Ian Rogers | 00f7d0e | 2012-07-19 15:28:27 -0700 | [diff] [blame] | 606 | } |
| 607 | |
| 608 | // Allocations have failed after GCs; this is an exceptional state. |
Carl Shapiro | 69759ea | 2011-07-21 18:13:35 -0700 | [diff] [blame] | 609 | // Try harder, growing the heap if necessary. |
Ian Rogers | 30fab40 | 2012-01-23 15:43:46 -0800 | [diff] [blame] | 610 | ptr = space->AllocWithGrowth(alloc_size); |
Carl Shapiro | 69759ea | 2011-07-21 18:13:35 -0700 | [diff] [blame] | 611 | if (ptr != NULL) { |
Ian Rogers | 30fab40 | 2012-01-23 15:43:46 -0800 | [diff] [blame] | 612 | size_t new_footprint = space->GetFootprintLimit(); |
Elliott Hughes | 418dfe7 | 2011-10-06 18:56:27 -0700 | [diff] [blame] | 613 | // OLD-TODO: may want to grow a little bit more so that the amount of |
Carl Shapiro | 58551df | 2011-07-24 03:09:51 -0700 | [diff] [blame] | 614 | // free space is equal to the old free space + the |
| 615 | // utilization slop for the new allocation. |
Ian Rogers | 3bb17a6 | 2012-01-27 23:56:44 -0800 | [diff] [blame] | 616 | VLOG(gc) << "Grow heap (frag case) to " << PrettySize(new_footprint) |
Ian Rogers | 162a31c | 2012-01-31 16:14:31 -0800 | [diff] [blame] | 617 | << " for a " << PrettySize(alloc_size) << " allocation"; |
Carl Shapiro | 69759ea | 2011-07-21 18:13:35 -0700 | [diff] [blame] | 618 | return ptr; |
| 619 | } |
| 620 | |
Elliott Hughes | 81ff318 | 2012-03-23 20:35:56 -0700 | [diff] [blame] | 621 | // Most allocations should have succeeded by now, so the heap is really full, really fragmented, |
| 622 | // or the requested size is really big. Do another GC, collecting SoftReferences this time. The |
| 623 | // 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] | 624 | |
Elliott Hughes | 418dfe7 | 2011-10-06 18:56:27 -0700 | [diff] [blame] | 625 | // OLD-TODO: wait for the finalizers from the previous GC to finish |
Mathieu Chartier | fd678be | 2012-08-30 14:50:54 -0700 | [diff] [blame^] | 626 | VLOG(gc) << "Forcing collection of SoftReferences for " << PrettySize(alloc_size) |
| 627 | << " allocation"; |
Ian Rogers | 00f7d0e | 2012-07-19 15:28:27 -0700 | [diff] [blame] | 628 | |
| 629 | if (Runtime::Current()->HasStatsEnabled()) { |
| 630 | ++Runtime::Current()->GetStats()->gc_for_alloc_count; |
| 631 | ++Thread::Current()->GetStats()->gc_for_alloc_count; |
| 632 | } |
Mathieu Chartier | fc8cfac | 2012-06-19 11:56:36 -0700 | [diff] [blame] | 633 | // We don't need a WaitForConcurrentGcToComplete here either. |
Ian Rogers | 00f7d0e | 2012-07-19 15:28:27 -0700 | [diff] [blame] | 634 | self->TransitionFromRunnableToSuspended(kWaitingPerformingGc); |
Mathieu Chartier | 357e9be | 2012-08-01 11:00:14 -0700 | [diff] [blame] | 635 | CollectGarbageInternal(GC_FULL, true); |
Ian Rogers | 00f7d0e | 2012-07-19 15:28:27 -0700 | [diff] [blame] | 636 | self->TransitionFromSuspendedToRunnable(); |
Mathieu Chartier | 357e9be | 2012-08-01 11:00:14 -0700 | [diff] [blame] | 637 | return space->AllocWithGrowth(alloc_size); |
Carl Shapiro | 69759ea | 2011-07-21 18:13:35 -0700 | [diff] [blame] | 638 | } |
| 639 | |
Elliott Hughes | bf86d04 | 2011-08-31 17:53:14 -0700 | [diff] [blame] | 640 | int64_t Heap::GetMaxMemory() { |
Mathieu Chartier | b062fdd | 2012-07-03 09:51:48 -0700 | [diff] [blame] | 641 | size_t total = 0; |
| 642 | // TODO: C++0x auto |
Mathieu Chartier | 357e9be | 2012-08-01 11:00:14 -0700 | [diff] [blame] | 643 | for (Spaces::const_iterator it = spaces_.begin(); it != spaces_.end(); ++it) { |
| 644 | Space* space = *it; |
| 645 | if (space->IsAllocSpace()) { |
| 646 | total += space->AsAllocSpace()->Capacity(); |
Mathieu Chartier | b062fdd | 2012-07-03 09:51:48 -0700 | [diff] [blame] | 647 | } |
| 648 | } |
| 649 | return total; |
Elliott Hughes | bf86d04 | 2011-08-31 17:53:14 -0700 | [diff] [blame] | 650 | } |
| 651 | |
| 652 | int64_t Heap::GetTotalMemory() { |
Mathieu Chartier | b062fdd | 2012-07-03 09:51:48 -0700 | [diff] [blame] | 653 | return GetMaxMemory(); |
Elliott Hughes | bf86d04 | 2011-08-31 17:53:14 -0700 | [diff] [blame] | 654 | } |
| 655 | |
| 656 | int64_t Heap::GetFreeMemory() { |
Mathieu Chartier | b062fdd | 2012-07-03 09:51:48 -0700 | [diff] [blame] | 657 | return GetMaxMemory() - num_bytes_allocated_; |
Elliott Hughes | bf86d04 | 2011-08-31 17:53:14 -0700 | [diff] [blame] | 658 | } |
| 659 | |
Elliott Hughes | 9d5ccec | 2011-09-19 13:19:50 -0700 | [diff] [blame] | 660 | class InstanceCounter { |
| 661 | public: |
| 662 | InstanceCounter(Class* c, bool count_assignable) |
Ian Rogers | 00f7d0e | 2012-07-19 15:28:27 -0700 | [diff] [blame] | 663 | SHARED_LOCKS_REQUIRED(GlobalSynchronization::mutator_lock_) |
Elliott Hughes | 9d5ccec | 2011-09-19 13:19:50 -0700 | [diff] [blame] | 664 | : class_(c), count_assignable_(count_assignable), count_(0) { |
Mathieu Chartier | fd678be | 2012-08-30 14:50:54 -0700 | [diff] [blame^] | 665 | |
Elliott Hughes | 9d5ccec | 2011-09-19 13:19:50 -0700 | [diff] [blame] | 666 | } |
| 667 | |
| 668 | size_t GetCount() { |
| 669 | return count_; |
| 670 | } |
| 671 | |
Ian Rogers | 00f7d0e | 2012-07-19 15:28:27 -0700 | [diff] [blame] | 672 | static void Callback(Object* o, void* arg) |
| 673 | SHARED_LOCKS_REQUIRED(GlobalSynchronization::mutator_lock_) { |
Elliott Hughes | 9d5ccec | 2011-09-19 13:19:50 -0700 | [diff] [blame] | 674 | reinterpret_cast<InstanceCounter*>(arg)->VisitInstance(o); |
| 675 | } |
| 676 | |
| 677 | private: |
Ian Rogers | 00f7d0e | 2012-07-19 15:28:27 -0700 | [diff] [blame] | 678 | void VisitInstance(Object* o) SHARED_LOCKS_REQUIRED(GlobalSynchronization::mutator_lock_) { |
Elliott Hughes | 9d5ccec | 2011-09-19 13:19:50 -0700 | [diff] [blame] | 679 | Class* instance_class = o->GetClass(); |
| 680 | if (count_assignable_) { |
| 681 | if (instance_class == class_) { |
| 682 | ++count_; |
| 683 | } |
| 684 | } else { |
| 685 | if (instance_class != NULL && class_->IsAssignableFrom(instance_class)) { |
| 686 | ++count_; |
| 687 | } |
| 688 | } |
| 689 | } |
| 690 | |
| 691 | Class* class_; |
| 692 | bool count_assignable_; |
| 693 | size_t count_; |
| 694 | }; |
| 695 | |
| 696 | int64_t Heap::CountInstances(Class* c, bool count_assignable) { |
Ian Rogers | 00f7d0e | 2012-07-19 15:28:27 -0700 | [diff] [blame] | 697 | ReaderMutexLock mu(*GlobalSynchronization::heap_bitmap_lock_); |
Elliott Hughes | 9d5ccec | 2011-09-19 13:19:50 -0700 | [diff] [blame] | 698 | InstanceCounter counter(c, count_assignable); |
Mathieu Chartier | b062fdd | 2012-07-03 09:51:48 -0700 | [diff] [blame] | 699 | GetLiveBitmap()->Walk(InstanceCounter::Callback, &counter); |
Elliott Hughes | 9d5ccec | 2011-09-19 13:19:50 -0700 | [diff] [blame] | 700 | return counter.GetCount(); |
| 701 | } |
| 702 | |
Ian Rogers | 30fab40 | 2012-01-23 15:43:46 -0800 | [diff] [blame] | 703 | void Heap::CollectGarbage(bool clear_soft_references) { |
Mathieu Chartier | fc8cfac | 2012-06-19 11:56:36 -0700 | [diff] [blame] | 704 | // If we just waited for a GC to complete then we do not need to do another |
| 705 | // GC unless we clear soft references. |
| 706 | if (!WaitForConcurrentGcToComplete() || clear_soft_references) { |
Ian Rogers | 00f7d0e | 2012-07-19 15:28:27 -0700 | [diff] [blame] | 707 | ScopedThreadStateChange tsc(Thread::Current(), kWaitingPerformingGc); |
Mathieu Chartier | 357e9be | 2012-08-01 11:00:14 -0700 | [diff] [blame] | 708 | CollectGarbageInternal(have_zygote_space_ ? GC_PARTIAL : GC_FULL, clear_soft_references); |
Mathieu Chartier | fc8cfac | 2012-06-19 11:56:36 -0700 | [diff] [blame] | 709 | } |
Carl Shapiro | 69759ea | 2011-07-21 18:13:35 -0700 | [diff] [blame] | 710 | } |
| 711 | |
Mathieu Chartier | cc236d7 | 2012-07-20 10:29:05 -0700 | [diff] [blame] | 712 | void Heap::PreZygoteFork() { |
Ian Rogers | 00f7d0e | 2012-07-19 15:28:27 -0700 | [diff] [blame] | 713 | static Mutex zygote_creation_lock_("zygote creation lock", kZygoteCreationLock); |
| 714 | MutexLock mu(zygote_creation_lock_); |
Mathieu Chartier | cc236d7 | 2012-07-20 10:29:05 -0700 | [diff] [blame] | 715 | |
| 716 | // Try to see if we have any Zygote spaces. |
| 717 | if (have_zygote_space_) { |
| 718 | return; |
| 719 | } |
| 720 | |
Mathieu Chartier | 357e9be | 2012-08-01 11:00:14 -0700 | [diff] [blame] | 721 | VLOG(heap) << "Starting PreZygoteFork with alloc space size " << PrettySize(alloc_space_->Size()); |
| 722 | |
| 723 | { |
| 724 | // Flush the alloc stack. |
| 725 | WriterMutexLock mu(*GlobalSynchronization::heap_bitmap_lock_); |
| 726 | FlushAllocStack(); |
| 727 | } |
Mathieu Chartier | cc236d7 | 2012-07-20 10:29:05 -0700 | [diff] [blame] | 728 | |
| 729 | // Replace the first alloc space we find with a zygote space. |
| 730 | // TODO: C++0x auto |
| 731 | for (Spaces::iterator it = spaces_.begin(); it != spaces_.end(); ++it) { |
| 732 | if ((*it)->IsAllocSpace()) { |
| 733 | AllocSpace* zygote_space = (*it)->AsAllocSpace(); |
| 734 | |
| 735 | // Turns the current alloc space into a Zygote space and obtain the new alloc space composed |
| 736 | // of the remaining available heap memory. |
| 737 | alloc_space_ = zygote_space->CreateZygoteSpace(); |
| 738 | |
| 739 | // Change the GC retention policy of the zygote space to only collect when full. |
| 740 | zygote_space->SetGcRetentionPolicy(GCRP_FULL_COLLECT); |
| 741 | AddSpace(alloc_space_); |
| 742 | have_zygote_space_ = true; |
| 743 | break; |
| 744 | } |
| 745 | } |
Mathieu Chartier | 1cd9c5c | 2012-08-23 10:52:44 -0700 | [diff] [blame] | 746 | |
| 747 | // Reset this since we now count the ZygoteSpace in the total heap size. |
| 748 | num_bytes_allocated_ = 0; |
Mathieu Chartier | cc236d7 | 2012-07-20 10:29:05 -0700 | [diff] [blame] | 749 | } |
| 750 | |
Mathieu Chartier | 357e9be | 2012-08-01 11:00:14 -0700 | [diff] [blame] | 751 | void Heap::FlushAllocStack() { |
| 752 | MarkStackAsLive(allocation_stack_.get()); |
| 753 | allocation_stack_->Reset(); |
| 754 | } |
| 755 | |
Mathieu Chartier | 1cd9c5c | 2012-08-23 10:52:44 -0700 | [diff] [blame] | 756 | size_t Heap::GetUsedMemorySize() const { |
| 757 | size_t total = num_bytes_allocated_; |
| 758 | for (Spaces::const_iterator it = spaces_.begin(); it != spaces_.end(); ++it) { |
| 759 | if ((*it)->IsZygoteSpace()) { |
| 760 | total += (*it)->AsAllocSpace()->Size(); |
| 761 | } |
| 762 | } |
| 763 | return total; |
| 764 | } |
| 765 | |
Mathieu Chartier | 357e9be | 2012-08-01 11:00:14 -0700 | [diff] [blame] | 766 | void Heap::MarkStackAsLive(MarkStack* alloc_stack) { |
| 767 | // We can just assume everything is inside the alloc_space_'s bitmap since we should only have |
| 768 | // fresh allocations. |
| 769 | SpaceBitmap* live_bitmap = alloc_space_->GetLiveBitmap(); |
| 770 | |
| 771 | // Empty the allocation stack. |
| 772 | const size_t count = alloc_stack->Size(); |
| 773 | for (size_t i = 0; i < count; ++i) { |
| 774 | const Object* obj = alloc_stack->Get(i); |
| 775 | DCHECK(obj != NULL); |
| 776 | live_bitmap->Set(obj); |
| 777 | } |
| 778 | } |
| 779 | |
| 780 | void Heap::UnMarkStack(MarkStack* alloc_stack) { |
| 781 | SpaceBitmap* mark_bitmap = alloc_space_->GetMarkBitmap(); |
| 782 | |
| 783 | // Clear all of the things in the AllocStack. |
| 784 | size_t count = alloc_stack->Size(); |
Mathieu Chartier | fd678be | 2012-08-30 14:50:54 -0700 | [diff] [blame^] | 785 | for (size_t i = 0; i < count; ++i) { |
Mathieu Chartier | 357e9be | 2012-08-01 11:00:14 -0700 | [diff] [blame] | 786 | const Object* obj = alloc_stack->Get(i); |
| 787 | DCHECK(obj != NULL); |
| 788 | if (mark_bitmap->Test(obj)) { |
| 789 | mark_bitmap->Clear(obj); |
| 790 | } |
| 791 | } |
| 792 | } |
| 793 | |
Mathieu Chartier | fd678be | 2012-08-30 14:50:54 -0700 | [diff] [blame^] | 794 | void Heap::UnMarkStackAsLive(MarkStack* alloc_stack) { |
| 795 | SpaceBitmap* live_bitmap = alloc_space_->GetLiveBitmap(); |
| 796 | |
| 797 | // Clear all of the things in the AllocStack. |
| 798 | size_t count = alloc_stack->Size(); |
| 799 | for (size_t i = 0; i < count; ++i) { |
| 800 | const Object* obj = alloc_stack->Get(i); |
| 801 | DCHECK(obj != NULL); |
| 802 | if (live_bitmap->Test(obj)) { |
| 803 | live_bitmap->Clear(obj); |
| 804 | } |
| 805 | } |
| 806 | } |
| 807 | |
Mathieu Chartier | 357e9be | 2012-08-01 11:00:14 -0700 | [diff] [blame] | 808 | void Heap::CollectGarbageInternal(GcType gc_type, bool clear_soft_references) { |
Ian Rogers | 00f7d0e | 2012-07-19 15:28:27 -0700 | [diff] [blame] | 809 | GlobalSynchronization::mutator_lock_->AssertNotHeld(); |
| 810 | #ifndef NDEBUG |
| 811 | { |
| 812 | MutexLock mu(*GlobalSynchronization::thread_suspend_count_lock_); |
| 813 | CHECK_EQ(Thread::Current()->GetState(), kWaitingPerformingGc); |
| 814 | } |
| 815 | #endif |
Carl Shapiro | 58551df | 2011-07-24 03:09:51 -0700 | [diff] [blame] | 816 | |
Ian Rogers | 00f7d0e | 2012-07-19 15:28:27 -0700 | [diff] [blame] | 817 | // Ensure there is only one GC at a time. |
| 818 | bool start_collect = false; |
| 819 | while (!start_collect) { |
| 820 | { |
| 821 | MutexLock mu(*gc_complete_lock_); |
| 822 | if (!is_gc_running_) { |
| 823 | is_gc_running_ = true; |
| 824 | start_collect = true; |
| 825 | } |
| 826 | } |
| 827 | if (!start_collect) { |
| 828 | WaitForConcurrentGcToComplete(); |
| 829 | // TODO: if another thread beat this one to do the GC, perhaps we should just return here? |
| 830 | // Not doing at the moment to ensure soft references are cleared. |
| 831 | } |
| 832 | } |
| 833 | gc_complete_lock_->AssertNotHeld(); |
Mathieu Chartier | 357e9be | 2012-08-01 11:00:14 -0700 | [diff] [blame] | 834 | |
| 835 | // We need to do partial GCs every now and then to avoid the heap growing too much and |
| 836 | // fragmenting. |
| 837 | if (gc_type == GC_STICKY && ++sticky_gc_count_ > kPartialGCFrequency) { |
| 838 | gc_type = GC_PARTIAL; |
Ian Rogers | 00f7d0e | 2012-07-19 15:28:27 -0700 | [diff] [blame] | 839 | } |
Mathieu Chartier | 357e9be | 2012-08-01 11:00:14 -0700 | [diff] [blame] | 840 | if (gc_type != GC_STICKY) { |
| 841 | sticky_gc_count_ = 0; |
| 842 | } |
| 843 | |
Mathieu Chartier | 637e348 | 2012-08-17 10:41:32 -0700 | [diff] [blame] | 844 | if (concurrent_gc_) { |
Mathieu Chartier | 357e9be | 2012-08-01 11:00:14 -0700 | [diff] [blame] | 845 | CollectGarbageConcurrentMarkSweepPlan(gc_type, clear_soft_references); |
| 846 | } else { |
| 847 | CollectGarbageMarkSweepPlan(gc_type, clear_soft_references); |
| 848 | } |
Mathieu Chartier | 357e9be | 2012-08-01 11:00:14 -0700 | [diff] [blame] | 849 | |
Ian Rogers | 15bf2d3 | 2012-08-28 17:33:04 -0700 | [diff] [blame] | 850 | { |
| 851 | MutexLock mu(*gc_complete_lock_); |
| 852 | is_gc_running_ = false; |
| 853 | // Wake anyone who may have been waiting for the GC to complete. |
| 854 | gc_complete_cond_->Broadcast(); |
| 855 | } |
| 856 | // Inform DDMS that a GC completed. |
| 857 | Dbg::GcDidFinish(); |
Ian Rogers | 00f7d0e | 2012-07-19 15:28:27 -0700 | [diff] [blame] | 858 | } |
Mathieu Chartier | a639903 | 2012-06-11 18:49:50 -0700 | [diff] [blame] | 859 | |
Mathieu Chartier | 357e9be | 2012-08-01 11:00:14 -0700 | [diff] [blame] | 860 | void Heap::CollectGarbageMarkSweepPlan(GcType gc_type, bool clear_soft_references) { |
| 861 | TimingLogger timings("CollectGarbageInternal", true); |
Mathieu Chartier | 662618f | 2012-06-06 12:01:47 -0700 | [diff] [blame] | 862 | |
Mathieu Chartier | fd678be | 2012-08-30 14:50:54 -0700 | [diff] [blame^] | 863 | std::stringstream gc_type_str; |
| 864 | gc_type_str << gc_type << " "; |
| 865 | |
Ian Rogers | 00f7d0e | 2012-07-19 15:28:27 -0700 | [diff] [blame] | 866 | // Suspend all threads are get exclusive access to the heap. |
Mathieu Chartier | 357e9be | 2012-08-01 11:00:14 -0700 | [diff] [blame] | 867 | uint64_t start_time = NanoTime(); |
Elliott Hughes | 8d768a9 | 2011-09-14 16:35:25 -0700 | [diff] [blame] | 868 | ThreadList* thread_list = Runtime::Current()->GetThreadList(); |
| 869 | thread_list->SuspendAll(); |
Mathieu Chartier | 662618f | 2012-06-06 12:01:47 -0700 | [diff] [blame] | 870 | timings.AddSplit("SuspendAll"); |
Ian Rogers | 00f7d0e | 2012-07-19 15:28:27 -0700 | [diff] [blame] | 871 | GlobalSynchronization::mutator_lock_->AssertExclusiveHeld(); |
Elliott Hughes | 83df2ac | 2011-10-11 16:37:54 -0700 | [diff] [blame] | 872 | |
Mathieu Chartier | 357e9be | 2012-08-01 11:00:14 -0700 | [diff] [blame] | 873 | size_t bytes_freed = 0; |
Elliott Hughes | adb460d | 2011-10-05 17:02:34 -0700 | [diff] [blame] | 874 | Object* cleared_references = NULL; |
Carl Shapiro | 58551df | 2011-07-24 03:09:51 -0700 | [diff] [blame] | 875 | { |
Mathieu Chartier | cc236d7 | 2012-07-20 10:29:05 -0700 | [diff] [blame] | 876 | MarkSweep mark_sweep(mark_stack_.get()); |
Carl Shapiro | 58551df | 2011-07-24 03:09:51 -0700 | [diff] [blame] | 877 | |
| 878 | mark_sweep.Init(); |
Elliott Hughes | 307f75d | 2011-10-12 18:04:40 -0700 | [diff] [blame] | 879 | timings.AddSplit("Init"); |
Carl Shapiro | 58551df | 2011-07-24 03:09:51 -0700 | [diff] [blame] | 880 | |
Mathieu Chartier | fd678be | 2012-08-30 14:50:54 -0700 | [diff] [blame^] | 881 | // Pre verify the heap |
| 882 | if (pre_gc_verify_heap_) { |
| 883 | WriterMutexLock mu(*GlobalSynchronization::heap_bitmap_lock_); |
| 884 | VerifyHeapReferences(std::string("Pre ") + gc_type_str.str() + "Gc"); |
| 885 | timings.AddSplit("VerifyHeapReferencesPreGC"); |
| 886 | } |
| 887 | |
Mathieu Chartier | cc236d7 | 2012-07-20 10:29:05 -0700 | [diff] [blame] | 888 | // Make sure that the tables have the correct pointer for the mark sweep. |
| 889 | mod_union_table_->Init(&mark_sweep); |
| 890 | zygote_mod_union_table_->Init(&mark_sweep); |
Mathieu Chartier | 7664f5c | 2012-06-08 18:15:32 -0700 | [diff] [blame] | 891 | |
Mathieu Chartier | 357e9be | 2012-08-01 11:00:14 -0700 | [diff] [blame] | 892 | // Swap allocation stack and live stack, enabling us to have new allocations during this GC. |
| 893 | MarkStack* temp = allocation_stack_.release(); |
| 894 | allocation_stack_.reset(live_stack_.release()); |
| 895 | live_stack_.reset(temp); |
| 896 | |
| 897 | // We will need to know which cards were dirty for doing concurrent processing of dirty cards. |
| 898 | // TODO: Investigate using a mark stack instead of a vector. |
| 899 | std::vector<byte*> dirty_cards; |
| 900 | if (gc_type == GC_STICKY) { |
| 901 | for (Spaces::iterator it = spaces_.begin(); it != spaces_.end(); ++it) { |
| 902 | card_table_->GetDirtyCards(*it, dirty_cards); |
| 903 | } |
| 904 | } |
| 905 | |
Mathieu Chartier | b43b7d4 | 2012-06-19 13:15:09 -0700 | [diff] [blame] | 906 | // Clear image space cards and keep track of cards we cleared in the mod-union table. |
Mathieu Chartier | cc236d7 | 2012-07-20 10:29:05 -0700 | [diff] [blame] | 907 | for (Spaces::iterator it = spaces_.begin(); it != spaces_.end(); ++it) { |
| 908 | Space* space = *it; |
| 909 | if (space->IsImageSpace()) { |
| 910 | mod_union_table_->ClearCards(*it); |
Mathieu Chartier | 357e9be | 2012-08-01 11:00:14 -0700 | [diff] [blame] | 911 | timings.AddSplit("ClearModUnionCards"); |
Mathieu Chartier | cc236d7 | 2012-07-20 10:29:05 -0700 | [diff] [blame] | 912 | } else if (space->GetGcRetentionPolicy() == GCRP_FULL_COLLECT) { |
| 913 | zygote_mod_union_table_->ClearCards(space); |
Mathieu Chartier | 357e9be | 2012-08-01 11:00:14 -0700 | [diff] [blame] | 914 | timings.AddSplit("ClearZygoteCards"); |
| 915 | } else { |
| 916 | card_table_->ClearSpaceCards(space); |
| 917 | timings.AddSplit("ClearCards"); |
Mathieu Chartier | cc236d7 | 2012-07-20 10:29:05 -0700 | [diff] [blame] | 918 | } |
| 919 | } |
Mathieu Chartier | cc236d7 | 2012-07-20 10:29:05 -0700 | [diff] [blame] | 920 | |
Ian Rogers | 00f7d0e | 2012-07-19 15:28:27 -0700 | [diff] [blame] | 921 | WriterMutexLock mu(*GlobalSynchronization::heap_bitmap_lock_); |
Mathieu Chartier | 357e9be | 2012-08-01 11:00:14 -0700 | [diff] [blame] | 922 | if (gc_type == GC_PARTIAL) { |
Mathieu Chartier | cc236d7 | 2012-07-20 10:29:05 -0700 | [diff] [blame] | 923 | // Copy the mark bits over from the live bits, do this as early as possible or else we can |
| 924 | // accidentally un-mark roots. |
| 925 | // Needed for scanning dirty objects. |
Mathieu Chartier | fd678be | 2012-08-30 14:50:54 -0700 | [diff] [blame^] | 926 | for (Spaces::iterator it = spaces_.begin(); it != spaces_.end(); ++it) { |
Mathieu Chartier | 357e9be | 2012-08-01 11:00:14 -0700 | [diff] [blame] | 927 | if ((*it)->GetGcRetentionPolicy() == GCRP_FULL_COLLECT) { |
| 928 | mark_sweep.CopyMarkBits(*it); |
| 929 | } |
| 930 | } |
Mathieu Chartier | cc236d7 | 2012-07-20 10:29:05 -0700 | [diff] [blame] | 931 | timings.AddSplit("CopyMarkBits"); |
Mathieu Chartier | 357e9be | 2012-08-01 11:00:14 -0700 | [diff] [blame] | 932 | |
| 933 | // We can assume that everything < alloc_space_ start is marked at this point. |
| 934 | mark_sweep.SetCondemned(reinterpret_cast<Object*>(alloc_space_->Begin())); |
| 935 | } else if (gc_type == GC_STICKY) { |
Mathieu Chartier | fd678be | 2012-08-30 14:50:54 -0700 | [diff] [blame^] | 936 | for (Spaces::iterator it = spaces_.begin(); it != spaces_.end(); ++it) { |
Mathieu Chartier | 357e9be | 2012-08-01 11:00:14 -0700 | [diff] [blame] | 937 | if ((*it)->GetGcRetentionPolicy() != GCRP_NEVER_COLLECT) { |
| 938 | mark_sweep.CopyMarkBits(*it); |
| 939 | } |
| 940 | } |
| 941 | timings.AddSplit("CopyMarkBits"); |
| 942 | |
Mathieu Chartier | 357e9be | 2012-08-01 11:00:14 -0700 | [diff] [blame] | 943 | mark_sweep.SetCondemned(reinterpret_cast<Object*>(alloc_space_->Begin())); |
Mathieu Chartier | cc236d7 | 2012-07-20 10:29:05 -0700 | [diff] [blame] | 944 | } |
Mathieu Chartier | b43b7d4 | 2012-06-19 13:15:09 -0700 | [diff] [blame] | 945 | |
Mathieu Chartier | 357e9be | 2012-08-01 11:00:14 -0700 | [diff] [blame] | 946 | MarkStackAsLive(live_stack_.get()); |
| 947 | |
Mathieu Chartier | fd678be | 2012-08-30 14:50:54 -0700 | [diff] [blame^] | 948 | if (gc_type != GC_STICKY) { |
| 949 | live_stack_->Reset(); |
| 950 | } |
| 951 | |
Carl Shapiro | 58551df | 2011-07-24 03:09:51 -0700 | [diff] [blame] | 952 | mark_sweep.MarkRoots(); |
Elliott Hughes | 307f75d | 2011-10-12 18:04:40 -0700 | [diff] [blame] | 953 | timings.AddSplit("MarkRoots"); |
Carl Shapiro | 58551df | 2011-07-24 03:09:51 -0700 | [diff] [blame] | 954 | |
Mathieu Chartier | b43b7d4 | 2012-06-19 13:15:09 -0700 | [diff] [blame] | 955 | // Roots are marked on the bitmap and the mark_stack is empty. |
Ian Rogers | 5d76c43 | 2011-10-31 21:42:49 -0700 | [diff] [blame] | 956 | DCHECK(mark_sweep.IsMarkStackEmpty()); |
Carl Shapiro | 58551df | 2011-07-24 03:09:51 -0700 | [diff] [blame] | 957 | |
Mathieu Chartier | fd678be | 2012-08-30 14:50:54 -0700 | [diff] [blame^] | 958 | UpdateAndMarkModUnion(timings, gc_type); |
Mathieu Chartier | cc236d7 | 2012-07-20 10:29:05 -0700 | [diff] [blame] | 959 | |
Mathieu Chartier | fd678be | 2012-08-30 14:50:54 -0700 | [diff] [blame^] | 960 | if (verify_mod_union_table_) { |
| 961 | zygote_mod_union_table_->Update(); |
| 962 | zygote_mod_union_table_->Verify(); |
| 963 | mod_union_table_->Update(); |
| 964 | mod_union_table_->Verify(); |
| 965 | } |
Mathieu Chartier | b43b7d4 | 2012-06-19 13:15:09 -0700 | [diff] [blame] | 966 | |
| 967 | // Recursively mark all the non-image bits set in the mark bitmap. |
Mathieu Chartier | 357e9be | 2012-08-01 11:00:14 -0700 | [diff] [blame] | 968 | if (gc_type != GC_STICKY) { |
| 969 | live_stack_->Reset(); |
| 970 | mark_sweep.RecursiveMark(gc_type == GC_PARTIAL, timings); |
| 971 | } else { |
| 972 | mark_sweep.RecursiveMarkCards(card_table_.get(), dirty_cards, timings); |
| 973 | } |
Mathieu Chartier | fd678be | 2012-08-30 14:50:54 -0700 | [diff] [blame^] | 974 | mark_sweep.DisableFinger(); |
Carl Shapiro | 58551df | 2011-07-24 03:09:51 -0700 | [diff] [blame] | 975 | |
Mathieu Chartier | 357e9be | 2012-08-01 11:00:14 -0700 | [diff] [blame] | 976 | // Need to process references the swap since it uses IsMarked. |
Ian Rogers | 30fab40 | 2012-01-23 15:43:46 -0800 | [diff] [blame] | 977 | mark_sweep.ProcessReferences(clear_soft_references); |
Elliott Hughes | 307f75d | 2011-10-12 18:04:40 -0700 | [diff] [blame] | 978 | timings.AddSplit("ProcessReferences"); |
Carl Shapiro | 58551df | 2011-07-24 03:09:51 -0700 | [diff] [blame] | 979 | |
Mathieu Chartier | 357e9be | 2012-08-01 11:00:14 -0700 | [diff] [blame] | 980 | // This doesn't work with mutators unpaused for some reason, TODO: Fix. |
| 981 | mark_sweep.SweepSystemWeaks(false); |
| 982 | timings.AddSplit("SweepSystemWeaks"); |
| 983 | |
| 984 | // Need to swap for VERIFY_OBJECT_ENABLED since we put things in the live bitmap after they |
| 985 | // have been allocated. |
| 986 | const bool swap = true; |
Mathieu Chartier | 357e9be | 2012-08-01 11:00:14 -0700 | [diff] [blame] | 987 | if (swap) { |
Mathieu Chartier | fd678be | 2012-08-30 14:50:54 -0700 | [diff] [blame^] | 988 | SwapBitmaps(); |
Mathieu Chartier | 654d3a2 | 2012-07-11 17:54:18 -0700 | [diff] [blame] | 989 | } |
Mathieu Chartier | 262e5ff | 2012-06-01 17:35:38 -0700 | [diff] [blame] | 990 | |
Mathieu Chartier | 357e9be | 2012-08-01 11:00:14 -0700 | [diff] [blame] | 991 | #ifndef NDEBUG |
Mathieu Chartier | 262e5ff | 2012-06-01 17:35:38 -0700 | [diff] [blame] | 992 | // Verify that we only reach marked objects from the image space |
| 993 | mark_sweep.VerifyImageRoots(); |
| 994 | timings.AddSplit("VerifyImageRoots"); |
Mathieu Chartier | 357e9be | 2012-08-01 11:00:14 -0700 | [diff] [blame] | 995 | #endif |
Carl Shapiro | 58551df | 2011-07-24 03:09:51 -0700 | [diff] [blame] | 996 | |
Mathieu Chartier | 357e9be | 2012-08-01 11:00:14 -0700 | [diff] [blame] | 997 | if (gc_type != GC_STICKY) { |
| 998 | mark_sweep.Sweep(gc_type == GC_PARTIAL, swap); |
| 999 | } else { |
| 1000 | mark_sweep.SweepArray(timings, live_stack_.get(), swap); |
| 1001 | } |
Elliott Hughes | 307f75d | 2011-10-12 18:04:40 -0700 | [diff] [blame] | 1002 | timings.AddSplit("Sweep"); |
Elliott Hughes | adb460d | 2011-10-05 17:02:34 -0700 | [diff] [blame] | 1003 | |
| 1004 | cleared_references = mark_sweep.GetClearedReferences(); |
Mathieu Chartier | 357e9be | 2012-08-01 11:00:14 -0700 | [diff] [blame] | 1005 | bytes_freed = mark_sweep.GetFreedBytes(); |
Carl Shapiro | 58551df | 2011-07-24 03:09:51 -0700 | [diff] [blame] | 1006 | } |
| 1007 | |
Mathieu Chartier | fd678be | 2012-08-30 14:50:54 -0700 | [diff] [blame^] | 1008 | // Post gc verify the heap |
| 1009 | if (post_gc_verify_heap_) { |
| 1010 | WriterMutexLock mu(*GlobalSynchronization::heap_bitmap_lock_); |
| 1011 | VerifyHeapReferences(std::string("Post ") + gc_type_str.str() + "Gc"); |
| 1012 | timings.AddSplit("VerifyHeapReferencesPostGC"); |
| 1013 | } |
| 1014 | |
Carl Shapiro | 58551df | 2011-07-24 03:09:51 -0700 | [diff] [blame] | 1015 | GrowForUtilization(); |
Elliott Hughes | 307f75d | 2011-10-12 18:04:40 -0700 | [diff] [blame] | 1016 | timings.AddSplit("GrowForUtilization"); |
Mathieu Chartier | b43b7d4 | 2012-06-19 13:15:09 -0700 | [diff] [blame] | 1017 | |
Ian Rogers | 00f7d0e | 2012-07-19 15:28:27 -0700 | [diff] [blame] | 1018 | thread_list->ResumeAll(); |
Mathieu Chartier | 357e9be | 2012-08-01 11:00:14 -0700 | [diff] [blame] | 1019 | timings.AddSplit("ResumeAll"); |
Elliott Hughes | adb460d | 2011-10-05 17:02:34 -0700 | [diff] [blame] | 1020 | |
| 1021 | EnqueueClearedReferences(&cleared_references); |
Elliott Hughes | 8cf5bc0 | 2012-02-02 16:32:16 -0800 | [diff] [blame] | 1022 | RequestHeapTrim(); |
Mathieu Chartier | 662618f | 2012-06-06 12:01:47 -0700 | [diff] [blame] | 1023 | timings.AddSplit("Finish"); |
Elliott Hughes | 83df2ac | 2011-10-11 16:37:54 -0700 | [diff] [blame] | 1024 | |
Mathieu Chartier | 357e9be | 2012-08-01 11:00:14 -0700 | [diff] [blame] | 1025 | // If the GC was slow, then print timings in the log. |
| 1026 | uint64_t duration = (NanoTime() - start_time) / 1000 * 1000; |
| 1027 | if (duration > MsToNs(50)) { |
Mathieu Chartier | 637e348 | 2012-08-17 10:41:32 -0700 | [diff] [blame] | 1028 | const size_t percent_free = GetPercentFree(); |
Mathieu Chartier | 1cd9c5c | 2012-08-23 10:52:44 -0700 | [diff] [blame] | 1029 | const size_t current_heap_size = GetUsedMemorySize(); |
Mathieu Chartier | 637e348 | 2012-08-17 10:41:32 -0700 | [diff] [blame] | 1030 | const size_t total_memory = GetTotalMemory(); |
Mathieu Chartier | fd678be | 2012-08-30 14:50:54 -0700 | [diff] [blame^] | 1031 | LOG(INFO) << gc_type_str.str() << " " |
Mathieu Chartier | 637e348 | 2012-08-17 10:41:32 -0700 | [diff] [blame] | 1032 | << "GC freed " << PrettySize(bytes_freed) << ", " << percent_free << "% free, " |
Mathieu Chartier | 1cd9c5c | 2012-08-23 10:52:44 -0700 | [diff] [blame] | 1033 | << PrettySize(current_heap_size) << "/" << PrettySize(total_memory) << ", " |
Mathieu Chartier | 357e9be | 2012-08-01 11:00:14 -0700 | [diff] [blame] | 1034 | << "paused " << PrettyDuration(duration); |
Brian Carlstrom | 6b4ef02 | 2011-10-23 14:59:04 -0700 | [diff] [blame] | 1035 | } |
Mathieu Chartier | 357e9be | 2012-08-01 11:00:14 -0700 | [diff] [blame] | 1036 | |
Elliott Hughes | 4dd9b4d | 2011-12-12 18:29:24 -0800 | [diff] [blame] | 1037 | if (VLOG_IS_ON(heap)) { |
Brian Carlstrom | 6b4ef02 | 2011-10-23 14:59:04 -0700 | [diff] [blame] | 1038 | timings.Dump(); |
| 1039 | } |
Ian Rogers | 00f7d0e | 2012-07-19 15:28:27 -0700 | [diff] [blame] | 1040 | } |
Mathieu Chartier | a639903 | 2012-06-11 18:49:50 -0700 | [diff] [blame] | 1041 | |
Mathieu Chartier | fd678be | 2012-08-30 14:50:54 -0700 | [diff] [blame^] | 1042 | void Heap::UpdateAndMarkModUnion(TimingLogger& timings, GcType gc_type) { |
| 1043 | if (gc_type == GC_STICKY) { |
| 1044 | // Don't need to do anythign for mod union table in this case since we are only scanning dirty |
| 1045 | // cards. |
| 1046 | return; |
| 1047 | } |
| 1048 | |
| 1049 | // Update zygote mod union table. |
| 1050 | if (gc_type == GC_PARTIAL) { |
| 1051 | zygote_mod_union_table_->Update(); |
| 1052 | timings.AddSplit("UpdateZygoteModUnionTable"); |
| 1053 | |
| 1054 | zygote_mod_union_table_->MarkReferences(); |
| 1055 | timings.AddSplit("ZygoteMarkReferences"); |
| 1056 | } |
| 1057 | |
| 1058 | // Processes the cards we cleared earlier and adds their objects into the mod-union table. |
| 1059 | mod_union_table_->Update(); |
| 1060 | timings.AddSplit("UpdateModUnionTable"); |
| 1061 | |
| 1062 | // Scans all objects in the mod-union table. |
| 1063 | mod_union_table_->MarkReferences(); |
| 1064 | timings.AddSplit("MarkImageToAllocSpaceReferences"); |
| 1065 | } |
| 1066 | |
| 1067 | void Heap::RootMatchesObjectVisitor(const Object* root, void* arg) { |
| 1068 | Object* obj = reinterpret_cast<Object*>(arg); |
| 1069 | if (root == obj) { |
| 1070 | LOG(INFO) << "Object " << obj << " is a root"; |
| 1071 | } |
| 1072 | } |
| 1073 | |
| 1074 | class ScanVisitor { |
| 1075 | public: |
| 1076 | void operator ()(const Object* obj) const { |
| 1077 | LOG(INFO) << "Would have rescanned object " << obj; |
| 1078 | } |
| 1079 | }; |
| 1080 | |
| 1081 | class VerifyReferenceVisitor { |
| 1082 | public: |
| 1083 | VerifyReferenceVisitor(Heap* heap, bool* failed) |
| 1084 | SHARED_LOCKS_REQUIRED(GlobalSynchronization::mutator_lock_, |
| 1085 | GlobalSynchronization::heap_bitmap_lock_) |
| 1086 | : heap_(heap), |
| 1087 | failed_(failed) { |
| 1088 | } |
| 1089 | |
| 1090 | // TODO: Fix lock analysis to not use NO_THREAD_SAFETY_ANALYSIS, requires support for smarter |
| 1091 | // analysis. |
| 1092 | void operator ()(const Object* obj, const Object* ref, const MemberOffset& /* offset */, |
| 1093 | bool /* is_static */) const NO_THREAD_SAFETY_ANALYSIS { |
| 1094 | // Verify that the reference is live. |
| 1095 | if (ref != NULL && !IsLive(ref)) { |
| 1096 | CardTable* card_table = heap_->GetCardTable(); |
| 1097 | MarkStack* alloc_stack = heap_->allocation_stack_.get(); |
| 1098 | MarkStack* live_stack = heap_->live_stack_.get(); |
| 1099 | |
| 1100 | // Print the cards around our object |
| 1101 | byte* card_addr = card_table->CardFromAddr(obj); |
| 1102 | LOG(INFO) << "Object " << obj << " references dead object " << ref << " on IsDirty = " |
| 1103 | << (*card_addr == GC_CARD_DIRTY); |
| 1104 | void* cover_begin = card_table->AddrFromCard(card_addr); |
| 1105 | void* cover_end = reinterpret_cast<void*>(reinterpret_cast<size_t>(cover_begin) + |
| 1106 | GC_CARD_SIZE); |
| 1107 | LOG(INFO) << "Card " << reinterpret_cast<void*>(card_addr) << " covers " << cover_begin |
| 1108 | << "-" << cover_end; |
| 1109 | SpaceBitmap* bitmap = heap_->GetLiveBitmap()->GetSpaceBitmap(obj); |
| 1110 | |
| 1111 | // Print out how the object is live. |
| 1112 | if (bitmap->Test(obj)) { |
| 1113 | LOG(INFO) << "Object " << obj << " found in live bitmap"; |
| 1114 | } else if (std::binary_search(alloc_stack->Begin(), alloc_stack->End(), obj)) { |
| 1115 | LOG(INFO) << "Object " << obj << " found in allocation stack"; |
| 1116 | } |
| 1117 | |
| 1118 | if (std::binary_search(live_stack->Begin(), live_stack->End(), ref)) { |
| 1119 | LOG(INFO) << "Reference " << ref << " found in live stack!"; |
| 1120 | } |
| 1121 | |
| 1122 | // Attempt to see if the card table missed the reference. |
| 1123 | ScanVisitor scan_visitor; |
| 1124 | byte* byte_cover_begin = reinterpret_cast<byte*>(card_table->AddrFromCard(card_addr)); |
| 1125 | card_table->Scan(bitmap, byte_cover_begin, byte_cover_begin + GC_CARD_SIZE, scan_visitor, |
| 1126 | IdentityFunctor()); |
| 1127 | |
| 1128 | // Try and see if a mark sweep collector scans the reference. |
| 1129 | MarkStack* mark_stack = heap_->mark_stack_.get(); |
| 1130 | MarkSweep ms(mark_stack); |
| 1131 | ms.Init(); |
| 1132 | mark_stack->Reset(); |
| 1133 | ms.SetFinger(reinterpret_cast<Object*>(~size_t(0))); |
| 1134 | // All the references should end up in the mark stack. |
| 1135 | ms.ScanRoot(obj); |
| 1136 | if (std::find(mark_stack->Begin(), mark_stack->End(), ref)) { |
| 1137 | LOG(INFO) << "Ref found in the mark_stack when rescanning the object!"; |
| 1138 | } else { |
| 1139 | LOG(INFO) << "Dumping mark stack contents"; |
| 1140 | for (Object** it = mark_stack->Begin(); it != mark_stack->End(); ++it) { |
| 1141 | LOG(INFO) << *it; |
| 1142 | } |
| 1143 | } |
| 1144 | mark_stack->Reset(); |
| 1145 | |
| 1146 | // Search to see if any of the roots reference our object. |
| 1147 | void* arg = const_cast<void*>(reinterpret_cast<const void*>(obj)); |
| 1148 | Runtime::Current()->VisitRoots(&Heap::RootMatchesObjectVisitor, arg); |
| 1149 | *failed_ = true; |
| 1150 | } |
| 1151 | } |
| 1152 | |
| 1153 | bool IsLive(const Object* obj) const NO_THREAD_SAFETY_ANALYSIS { |
| 1154 | SpaceBitmap* bitmap = heap_->GetLiveBitmap()->GetSpaceBitmap(obj); |
| 1155 | if (bitmap != NULL) { |
| 1156 | if (bitmap->Test(obj)) { |
| 1157 | return true; |
| 1158 | } |
| 1159 | } else { |
| 1160 | heap_->DumpSpaces(); |
| 1161 | LOG(FATAL) << "Object " << obj << " not found in any spaces"; |
| 1162 | } |
| 1163 | MarkStack* alloc_stack = heap_->allocation_stack_.get(); |
| 1164 | // At this point we need to search the allocation since things in the live stack may get swept. |
| 1165 | if (std::binary_search(alloc_stack->Begin(), alloc_stack->End(), const_cast<Object*>(obj))) { |
| 1166 | return true; |
| 1167 | } |
| 1168 | // Not either in the live bitmap or allocation stack, so the object must be dead. |
| 1169 | return false; |
| 1170 | } |
| 1171 | |
| 1172 | private: |
| 1173 | Heap* heap_; |
| 1174 | bool* failed_; |
| 1175 | }; |
| 1176 | |
| 1177 | class VerifyObjectVisitor { |
| 1178 | public: |
| 1179 | VerifyObjectVisitor(Heap* heap) |
| 1180 | : heap_(heap), |
| 1181 | failed_(false) { |
| 1182 | |
| 1183 | } |
| 1184 | |
| 1185 | void operator ()(const Object* obj) const |
| 1186 | SHARED_LOCKS_REQUIRED(GlobalSynchronization::mutator_lock_, |
| 1187 | GlobalSynchronization::heap_bitmap_lock_) { |
| 1188 | VerifyReferenceVisitor visitor(heap_, const_cast<bool*>(&failed_)); |
| 1189 | MarkSweep::VisitObjectReferences(obj, visitor); |
| 1190 | } |
| 1191 | |
| 1192 | bool Failed() const { |
| 1193 | return failed_; |
| 1194 | } |
| 1195 | |
| 1196 | private: |
| 1197 | Heap* heap_; |
| 1198 | bool failed_; |
| 1199 | }; |
| 1200 | |
| 1201 | // Must do this with mutators suspended since we are directly accessing the allocation stacks. |
| 1202 | void Heap::VerifyHeapReferences(const std::string& phase) { |
| 1203 | GlobalSynchronization::mutator_lock_->AssertExclusiveHeld(); |
| 1204 | // Lets sort our allocation stacks so that we can efficiently binary search them. |
| 1205 | std::sort(allocation_stack_->Begin(), allocation_stack_->End()); |
| 1206 | std::sort(live_stack_->Begin(), live_stack_->End()); |
| 1207 | // Perform the verification. |
| 1208 | VerifyObjectVisitor visitor(this); |
| 1209 | GetLiveBitmap()->Visit(visitor); |
| 1210 | // We don't want to verify the objects in the allocation stack since they themselves may be |
| 1211 | // pointing to dead objects if they are not reachable. |
| 1212 | if (visitor.Failed()) { |
| 1213 | DumpSpaces(); |
| 1214 | LOG(FATAL) << phase << " heap verification failed"; |
| 1215 | } |
| 1216 | } |
| 1217 | |
| 1218 | void Heap::SwapBitmaps() { |
| 1219 | // Swap the live and mark bitmaps for each alloc space. This is needed since sweep re-swaps |
| 1220 | // these bitmaps. Doing this enables us to sweep with the heap unlocked since new allocations |
| 1221 | // set the live bit, but since we have the bitmaps reversed at this point, this sets the mark bit |
| 1222 | // instead, resulting in no new allocated objects being incorrectly freed by sweep. |
| 1223 | WriterMutexLock mu(*GlobalSynchronization::heap_bitmap_lock_); |
| 1224 | for (Spaces::iterator it = spaces_.begin(); it != spaces_.end(); ++it) { |
| 1225 | Space* space = *it; |
| 1226 | // We never allocate into zygote spaces. |
| 1227 | if (space->GetGcRetentionPolicy() != GCRP_NEVER_COLLECT) { |
| 1228 | live_bitmap_->ReplaceBitmap(space->GetLiveBitmap(), space->GetMarkBitmap()); |
| 1229 | mark_bitmap_->ReplaceBitmap(space->GetMarkBitmap(), space->GetLiveBitmap()); |
| 1230 | space->AsAllocSpace()->SwapBitmaps(); |
| 1231 | } |
| 1232 | } |
| 1233 | } |
| 1234 | |
Mathieu Chartier | 357e9be | 2012-08-01 11:00:14 -0700 | [diff] [blame] | 1235 | void Heap::CollectGarbageConcurrentMarkSweepPlan(GcType gc_type, bool clear_soft_references) { |
| 1236 | TimingLogger timings("ConcurrentCollectGarbageInternal", true); |
| 1237 | uint64_t root_begin = NanoTime(), root_end = 0, dirty_begin = 0, dirty_end = 0; |
Mathieu Chartier | fd678be | 2012-08-30 14:50:54 -0700 | [diff] [blame^] | 1238 | std::stringstream gc_type_str; |
| 1239 | gc_type_str << gc_type << " "; |
Mathieu Chartier | a639903 | 2012-06-11 18:49:50 -0700 | [diff] [blame] | 1240 | |
Ian Rogers | 00f7d0e | 2012-07-19 15:28:27 -0700 | [diff] [blame] | 1241 | // Suspend all threads are get exclusive access to the heap. |
| 1242 | ThreadList* thread_list = Runtime::Current()->GetThreadList(); |
| 1243 | thread_list->SuspendAll(); |
| 1244 | timings.AddSplit("SuspendAll"); |
| 1245 | GlobalSynchronization::mutator_lock_->AssertExclusiveHeld(); |
| 1246 | |
Mathieu Chartier | 357e9be | 2012-08-01 11:00:14 -0700 | [diff] [blame] | 1247 | size_t bytes_freed = 0; |
Ian Rogers | 00f7d0e | 2012-07-19 15:28:27 -0700 | [diff] [blame] | 1248 | Object* cleared_references = NULL; |
| 1249 | { |
| 1250 | MarkSweep mark_sweep(mark_stack_.get()); |
| 1251 | timings.AddSplit("ctor"); |
| 1252 | |
| 1253 | mark_sweep.Init(); |
| 1254 | timings.AddSplit("Init"); |
| 1255 | |
Mathieu Chartier | fd678be | 2012-08-30 14:50:54 -0700 | [diff] [blame^] | 1256 | // Pre verify the heap |
| 1257 | if (pre_gc_verify_heap_) { |
| 1258 | WriterMutexLock mu(*GlobalSynchronization::heap_bitmap_lock_); |
| 1259 | VerifyHeapReferences(std::string("Pre ") + gc_type_str.str() + "Gc"); |
| 1260 | timings.AddSplit("VerifyHeapReferencesPreGC"); |
| 1261 | } |
| 1262 | |
Mathieu Chartier | 357e9be | 2012-08-01 11:00:14 -0700 | [diff] [blame] | 1263 | // Swap the stacks, this is safe sunce all the mutators are suspended at this point. |
| 1264 | MarkStack* temp = allocation_stack_.release(); |
| 1265 | allocation_stack_.reset(live_stack_.release()); |
| 1266 | live_stack_.reset(temp); |
| 1267 | |
| 1268 | // We will need to know which cards were dirty for doing concurrent processing of dirty cards. |
| 1269 | // TODO: Investigate using a mark stack instead of a vector. |
| 1270 | std::vector<byte*> dirty_cards; |
| 1271 | if (gc_type == GC_STICKY) { |
| 1272 | for (Spaces::iterator it = spaces_.begin(); it != spaces_.end(); ++it) { |
| 1273 | card_table_->GetDirtyCards(*it, dirty_cards); |
| 1274 | } |
| 1275 | } |
| 1276 | |
Ian Rogers | 00f7d0e | 2012-07-19 15:28:27 -0700 | [diff] [blame] | 1277 | // Make sure that the tables have the correct pointer for the mark sweep. |
| 1278 | mod_union_table_->Init(&mark_sweep); |
| 1279 | zygote_mod_union_table_->Init(&mark_sweep); |
| 1280 | |
| 1281 | // Clear image space cards and keep track of cards we cleared in the mod-union table. |
| 1282 | for (Spaces::iterator it = spaces_.begin(); it != spaces_.end(); ++it) { |
| 1283 | Space* space = *it; |
| 1284 | if (space->IsImageSpace()) { |
| 1285 | mod_union_table_->ClearCards(*it); |
Mathieu Chartier | 357e9be | 2012-08-01 11:00:14 -0700 | [diff] [blame] | 1286 | timings.AddSplit("ModUnionClearCards"); |
Ian Rogers | 00f7d0e | 2012-07-19 15:28:27 -0700 | [diff] [blame] | 1287 | } else if (space->GetGcRetentionPolicy() == GCRP_FULL_COLLECT) { |
| 1288 | zygote_mod_union_table_->ClearCards(space); |
Mathieu Chartier | 357e9be | 2012-08-01 11:00:14 -0700 | [diff] [blame] | 1289 | timings.AddSplit("ZygoteModUnionClearCards"); |
Ian Rogers | 00f7d0e | 2012-07-19 15:28:27 -0700 | [diff] [blame] | 1290 | } else { |
| 1291 | card_table_->ClearSpaceCards(space); |
Mathieu Chartier | 357e9be | 2012-08-01 11:00:14 -0700 | [diff] [blame] | 1292 | timings.AddSplit("ClearCards"); |
Ian Rogers | 00f7d0e | 2012-07-19 15:28:27 -0700 | [diff] [blame] | 1293 | } |
| 1294 | } |
Ian Rogers | 00f7d0e | 2012-07-19 15:28:27 -0700 | [diff] [blame] | 1295 | |
Ian Rogers | 00f7d0e | 2012-07-19 15:28:27 -0700 | [diff] [blame] | 1296 | { |
| 1297 | WriterMutexLock mu(*GlobalSynchronization::heap_bitmap_lock_); |
Mathieu Chartier | 357e9be | 2012-08-01 11:00:14 -0700 | [diff] [blame] | 1298 | |
| 1299 | if (gc_type == GC_PARTIAL) { |
| 1300 | // Copy the mark bits over from the live bits, do this as early as possible or else we can |
| 1301 | // accidentally un-mark roots. |
| 1302 | // Needed for scanning dirty objects. |
Mathieu Chartier | fd678be | 2012-08-30 14:50:54 -0700 | [diff] [blame^] | 1303 | for (Spaces::iterator it = spaces_.begin(); it != spaces_.end(); ++it) { |
Mathieu Chartier | 357e9be | 2012-08-01 11:00:14 -0700 | [diff] [blame] | 1304 | if ((*it)->GetGcRetentionPolicy() == GCRP_FULL_COLLECT) { |
| 1305 | mark_sweep.CopyMarkBits(*it); |
| 1306 | } |
| 1307 | } |
| 1308 | timings.AddSplit("CopyMarkBits"); |
| 1309 | mark_sweep.SetCondemned(reinterpret_cast<Object*>(alloc_space_->Begin())); |
| 1310 | } else if (gc_type == GC_STICKY) { |
Mathieu Chartier | fd678be | 2012-08-30 14:50:54 -0700 | [diff] [blame^] | 1311 | for (Spaces::iterator it = spaces_.begin(); it != spaces_.end(); ++it) { |
Mathieu Chartier | 357e9be | 2012-08-01 11:00:14 -0700 | [diff] [blame] | 1312 | if ((*it)->GetGcRetentionPolicy() != GCRP_NEVER_COLLECT) { |
| 1313 | mark_sweep.CopyMarkBits(*it); |
| 1314 | } |
| 1315 | } |
| 1316 | timings.AddSplit("CopyMarkBits"); |
Mathieu Chartier | 357e9be | 2012-08-01 11:00:14 -0700 | [diff] [blame] | 1317 | mark_sweep.SetCondemned(reinterpret_cast<Object*>(alloc_space_->Begin())); |
| 1318 | } |
| 1319 | |
Mathieu Chartier | fd678be | 2012-08-30 14:50:54 -0700 | [diff] [blame^] | 1320 | // Mark everything as live so that sweeping system weak works correctly for sticky mark bit |
| 1321 | // GCs. |
Mathieu Chartier | 357e9be | 2012-08-01 11:00:14 -0700 | [diff] [blame] | 1322 | MarkStackAsLive(live_stack_.get()); |
Mathieu Chartier | fd678be | 2012-08-30 14:50:54 -0700 | [diff] [blame^] | 1323 | timings.AddSplit("MarkStackAsLive"); |
Mathieu Chartier | 357e9be | 2012-08-01 11:00:14 -0700 | [diff] [blame] | 1324 | |
Mathieu Chartier | fd678be | 2012-08-30 14:50:54 -0700 | [diff] [blame^] | 1325 | // TODO: Investigate whether or not this is really necessary for sticky mark bits. |
Mathieu Chartier | 357e9be | 2012-08-01 11:00:14 -0700 | [diff] [blame] | 1326 | if (gc_type != GC_STICKY) { |
| 1327 | live_stack_->Reset(); |
| 1328 | mark_sweep.MarkRoots(); |
| 1329 | timings.AddSplit("MarkRoots"); |
| 1330 | } |
Mathieu Chartier | fd678be | 2012-08-30 14:50:54 -0700 | [diff] [blame^] | 1331 | |
| 1332 | if (verify_mod_union_table_) { |
| 1333 | zygote_mod_union_table_->Update(); |
| 1334 | zygote_mod_union_table_->Verify(); |
| 1335 | mod_union_table_->Update(); |
| 1336 | mod_union_table_->Verify(); |
| 1337 | } |
Ian Rogers | 00f7d0e | 2012-07-19 15:28:27 -0700 | [diff] [blame] | 1338 | } |
| 1339 | |
| 1340 | // Roots are marked on the bitmap and the mark_stack is empty. |
| 1341 | DCHECK(mark_sweep.IsMarkStackEmpty()); |
| 1342 | |
| 1343 | // Allow mutators to go again, acquire share on mutator_lock_ to continue. |
| 1344 | thread_list->ResumeAll(); |
| 1345 | { |
| 1346 | ReaderMutexLock reader_lock(*GlobalSynchronization::mutator_lock_); |
| 1347 | root_end = NanoTime(); |
| 1348 | timings.AddSplit("RootEnd"); |
| 1349 | |
Mathieu Chartier | 357e9be | 2012-08-01 11:00:14 -0700 | [diff] [blame] | 1350 | WriterMutexLock mu(*GlobalSynchronization::heap_bitmap_lock_); |
Mathieu Chartier | fd678be | 2012-08-30 14:50:54 -0700 | [diff] [blame^] | 1351 | UpdateAndMarkModUnion(timings, gc_type); |
Mathieu Chartier | 357e9be | 2012-08-01 11:00:14 -0700 | [diff] [blame] | 1352 | if (gc_type != GC_STICKY) { |
Ian Rogers | 00f7d0e | 2012-07-19 15:28:27 -0700 | [diff] [blame] | 1353 | // Recursively mark all the non-image bits set in the mark bitmap. |
Mathieu Chartier | 357e9be | 2012-08-01 11:00:14 -0700 | [diff] [blame] | 1354 | mark_sweep.RecursiveMark(gc_type == GC_PARTIAL, timings); |
| 1355 | } else { |
| 1356 | mark_sweep.RecursiveMarkCards(card_table_.get(), dirty_cards, timings); |
Ian Rogers | 00f7d0e | 2012-07-19 15:28:27 -0700 | [diff] [blame] | 1357 | } |
Mathieu Chartier | fd678be | 2012-08-30 14:50:54 -0700 | [diff] [blame^] | 1358 | mark_sweep.DisableFinger(); |
Ian Rogers | 00f7d0e | 2012-07-19 15:28:27 -0700 | [diff] [blame] | 1359 | } |
| 1360 | // Release share on mutator_lock_ and then get exclusive access. |
| 1361 | dirty_begin = NanoTime(); |
| 1362 | thread_list->SuspendAll(); |
| 1363 | timings.AddSplit("ReSuspend"); |
| 1364 | GlobalSynchronization::mutator_lock_->AssertExclusiveHeld(); |
| 1365 | |
| 1366 | { |
| 1367 | WriterMutexLock mu(*GlobalSynchronization::heap_bitmap_lock_); |
Mathieu Chartier | 357e9be | 2012-08-01 11:00:14 -0700 | [diff] [blame] | 1368 | |
Ian Rogers | 00f7d0e | 2012-07-19 15:28:27 -0700 | [diff] [blame] | 1369 | // Re-mark root set. |
| 1370 | mark_sweep.ReMarkRoots(); |
| 1371 | timings.AddSplit("ReMarkRoots"); |
| 1372 | |
| 1373 | // Scan dirty objects, this is only required if we are not doing concurrent GC. |
Mathieu Chartier | 357e9be | 2012-08-01 11:00:14 -0700 | [diff] [blame] | 1374 | mark_sweep.RecursiveMarkDirtyObjects(false); |
Ian Rogers | 00f7d0e | 2012-07-19 15:28:27 -0700 | [diff] [blame] | 1375 | timings.AddSplit("RecursiveMarkDirtyObjects"); |
| 1376 | } |
Mathieu Chartier | fd678be | 2012-08-30 14:50:54 -0700 | [diff] [blame^] | 1377 | |
Ian Rogers | 00f7d0e | 2012-07-19 15:28:27 -0700 | [diff] [blame] | 1378 | { |
| 1379 | ReaderMutexLock mu(*GlobalSynchronization::heap_bitmap_lock_); |
| 1380 | mark_sweep.ProcessReferences(clear_soft_references); |
| 1381 | timings.AddSplit("ProcessReferences"); |
Mathieu Chartier | 357e9be | 2012-08-01 11:00:14 -0700 | [diff] [blame] | 1382 | |
| 1383 | // This doesn't work with mutators unpaused for some reason, TODO: Fix. |
| 1384 | mark_sweep.SweepSystemWeaks(false); |
| 1385 | timings.AddSplit("SweepSystemWeaks"); |
Ian Rogers | 00f7d0e | 2012-07-19 15:28:27 -0700 | [diff] [blame] | 1386 | } |
| 1387 | // Swap the live and mark bitmaps for each alloc space. This is needed since sweep re-swaps |
| 1388 | // these bitmaps. Doing this enables us to sweep with the heap unlocked since new allocations |
| 1389 | // set the live bit, but since we have the bitmaps reversed at this point, this sets the mark |
| 1390 | // bit instead, resulting in no new allocated objects being incorrectly freed by sweep. |
Mathieu Chartier | fd678be | 2012-08-30 14:50:54 -0700 | [diff] [blame^] | 1391 | const bool swap = true; |
Mathieu Chartier | 357e9be | 2012-08-01 11:00:14 -0700 | [diff] [blame] | 1392 | if (swap) { |
Mathieu Chartier | fd678be | 2012-08-30 14:50:54 -0700 | [diff] [blame^] | 1393 | SwapBitmaps(); |
Ian Rogers | 00f7d0e | 2012-07-19 15:28:27 -0700 | [diff] [blame] | 1394 | } |
| 1395 | |
| 1396 | if (kIsDebugBuild) { |
| 1397 | // Verify that we only reach marked objects from the image space. |
| 1398 | ReaderMutexLock mu(*GlobalSynchronization::heap_bitmap_lock_); |
| 1399 | mark_sweep.VerifyImageRoots(); |
| 1400 | timings.AddSplit("VerifyImageRoots"); |
| 1401 | } |
Mathieu Chartier | 357e9be | 2012-08-01 11:00:14 -0700 | [diff] [blame] | 1402 | |
Mathieu Chartier | fd678be | 2012-08-30 14:50:54 -0700 | [diff] [blame^] | 1403 | if (gc_type == GC_STICKY) { |
| 1404 | // We only sweep over the live stack, and the live stack should not intersect with the |
| 1405 | // allocation stack, so it should be safe to UnMark anything in the allocation stack as live. |
| 1406 | // This only works for sticky Gcs though! |
| 1407 | UnMarkStackAsLive(allocation_stack_.get()); |
| 1408 | } |
| 1409 | timings.AddSplit("UnMarkStacks"); |
| 1410 | |
| 1411 | // If we are going to do post Gc verification, lets keep the mutators paused since we don't |
| 1412 | // want them to touch dead objects before we find these in verification. |
| 1413 | if (post_gc_verify_heap_) { |
| 1414 | WriterMutexLock mu(*GlobalSynchronization::heap_bitmap_lock_); |
| 1415 | VerifyHeapReferences(std::string("Post ") + gc_type_str.str() + "Gc"); |
| 1416 | timings.AddSplit("VerifyHeapReferencesPostGC"); |
| 1417 | } |
| 1418 | |
Ian Rogers | 00f7d0e | 2012-07-19 15:28:27 -0700 | [diff] [blame] | 1419 | thread_list->ResumeAll(); |
| 1420 | dirty_end = NanoTime(); |
| 1421 | GlobalSynchronization::mutator_lock_->AssertNotHeld(); |
| 1422 | |
| 1423 | { |
| 1424 | // TODO: this lock shouldn't be necessary (it's why we did the bitmap flip above). |
| 1425 | WriterMutexLock mu(*GlobalSynchronization::heap_bitmap_lock_); |
Mathieu Chartier | 357e9be | 2012-08-01 11:00:14 -0700 | [diff] [blame] | 1426 | if (gc_type != GC_STICKY) { |
| 1427 | mark_sweep.Sweep(gc_type == GC_PARTIAL, swap); |
| 1428 | } else { |
| 1429 | mark_sweep.SweepArray(timings, live_stack_.get(), swap); |
| 1430 | } |
Ian Rogers | 00f7d0e | 2012-07-19 15:28:27 -0700 | [diff] [blame] | 1431 | timings.AddSplit("Sweep"); |
| 1432 | } |
| 1433 | |
| 1434 | cleared_references = mark_sweep.GetClearedReferences(); |
Mathieu Chartier | 357e9be | 2012-08-01 11:00:14 -0700 | [diff] [blame] | 1435 | bytes_freed = mark_sweep.GetFreedBytes(); |
Ian Rogers | 00f7d0e | 2012-07-19 15:28:27 -0700 | [diff] [blame] | 1436 | } |
| 1437 | |
| 1438 | GrowForUtilization(); |
| 1439 | timings.AddSplit("GrowForUtilization"); |
| 1440 | |
| 1441 | EnqueueClearedReferences(&cleared_references); |
| 1442 | RequestHeapTrim(); |
| 1443 | timings.AddSplit("Finish"); |
| 1444 | |
Mathieu Chartier | 357e9be | 2012-08-01 11:00:14 -0700 | [diff] [blame] | 1445 | // If the GC was slow, then print timings in the log. |
| 1446 | uint64_t pause_roots = (root_end - root_begin) / 1000 * 1000; |
| 1447 | uint64_t pause_dirty = (dirty_end - dirty_begin) / 1000 * 1000; |
Mathieu Chartier | 637e348 | 2012-08-17 10:41:32 -0700 | [diff] [blame] | 1448 | uint64_t duration = (NanoTime() - root_begin) / 1000 * 1000; |
Mathieu Chartier | 357e9be | 2012-08-01 11:00:14 -0700 | [diff] [blame] | 1449 | if (pause_roots > MsToNs(5) || pause_dirty > MsToNs(5)) { |
Mathieu Chartier | 637e348 | 2012-08-17 10:41:32 -0700 | [diff] [blame] | 1450 | const size_t percent_free = GetPercentFree(); |
Mathieu Chartier | 1cd9c5c | 2012-08-23 10:52:44 -0700 | [diff] [blame] | 1451 | const size_t current_heap_size = GetUsedMemorySize(); |
Mathieu Chartier | 637e348 | 2012-08-17 10:41:32 -0700 | [diff] [blame] | 1452 | const size_t total_memory = GetTotalMemory(); |
Mathieu Chartier | fd678be | 2012-08-30 14:50:54 -0700 | [diff] [blame^] | 1453 | LOG(INFO) << gc_type_str.str() |
Mathieu Chartier | 637e348 | 2012-08-17 10:41:32 -0700 | [diff] [blame] | 1454 | << "Concurrent GC freed " << PrettySize(bytes_freed) << ", " << percent_free |
Mathieu Chartier | 1cd9c5c | 2012-08-23 10:52:44 -0700 | [diff] [blame] | 1455 | << "% free, " << PrettySize(current_heap_size) << "/" |
Mathieu Chartier | 637e348 | 2012-08-17 10:41:32 -0700 | [diff] [blame] | 1456 | << PrettySize(total_memory) << ", " << "paused " << PrettyDuration(pause_roots) |
| 1457 | << "+" << PrettyDuration(pause_dirty) << " total " << PrettyDuration(duration); |
Ian Rogers | 00f7d0e | 2012-07-19 15:28:27 -0700 | [diff] [blame] | 1458 | } |
Mathieu Chartier | 357e9be | 2012-08-01 11:00:14 -0700 | [diff] [blame] | 1459 | |
Ian Rogers | 00f7d0e | 2012-07-19 15:28:27 -0700 | [diff] [blame] | 1460 | if (VLOG_IS_ON(heap)) { |
| 1461 | timings.Dump(); |
| 1462 | } |
Carl Shapiro | 69759ea | 2011-07-21 18:13:35 -0700 | [diff] [blame] | 1463 | } |
| 1464 | |
Mathieu Chartier | fc8cfac | 2012-06-19 11:56:36 -0700 | [diff] [blame] | 1465 | bool Heap::WaitForConcurrentGcToComplete() { |
Ian Rogers | 00f7d0e | 2012-07-19 15:28:27 -0700 | [diff] [blame] | 1466 | if (concurrent_gc_) { |
| 1467 | bool do_wait = false; |
| 1468 | uint64_t wait_start; |
| 1469 | { |
| 1470 | // Check if GC is running holding gc_complete_lock_. |
| 1471 | MutexLock mu(*gc_complete_lock_); |
| 1472 | if (is_gc_running_) { |
| 1473 | wait_start = NanoTime(); |
| 1474 | do_wait = true; |
| 1475 | } |
Mathieu Chartier | a639903 | 2012-06-11 18:49:50 -0700 | [diff] [blame] | 1476 | } |
Ian Rogers | 00f7d0e | 2012-07-19 15:28:27 -0700 | [diff] [blame] | 1477 | if (do_wait) { |
| 1478 | // We must wait, change thread state then sleep on gc_complete_cond_; |
| 1479 | ScopedThreadStateChange tsc(Thread::Current(), kWaitingForGcToComplete); |
| 1480 | { |
| 1481 | MutexLock mu(*gc_complete_lock_); |
| 1482 | while (is_gc_running_) { |
| 1483 | gc_complete_cond_->Wait(*gc_complete_lock_); |
| 1484 | } |
| 1485 | } |
| 1486 | uint64_t wait_time = NanoTime() - wait_start; |
| 1487 | if (wait_time > MsToNs(5)) { |
| 1488 | LOG(INFO) << "WaitForConcurrentGcToComplete blocked for " << PrettyDuration(wait_time); |
| 1489 | } |
| 1490 | return true; |
| 1491 | } |
Mathieu Chartier | 7664f5c | 2012-06-08 18:15:32 -0700 | [diff] [blame] | 1492 | } |
Mathieu Chartier | fc8cfac | 2012-06-19 11:56:36 -0700 | [diff] [blame] | 1493 | return false; |
Carl Shapiro | 69759ea | 2011-07-21 18:13:35 -0700 | [diff] [blame] | 1494 | } |
| 1495 | |
Elliott Hughes | c967f78 | 2012-04-16 10:23:15 -0700 | [diff] [blame] | 1496 | void Heap::DumpForSigQuit(std::ostream& os) { |
Mathieu Chartier | fd678be | 2012-08-30 14:50:54 -0700 | [diff] [blame^] | 1497 | os << "Heap: " << GetPercentFree() << "% free, " << PrettySize(num_bytes_allocated_) << "/" |
| 1498 | << PrettySize(GetTotalMemory()) << "; " << num_objects_allocated_ << " objects\n"; |
Elliott Hughes | c967f78 | 2012-04-16 10:23:15 -0700 | [diff] [blame] | 1499 | } |
| 1500 | |
| 1501 | size_t Heap::GetPercentFree() { |
| 1502 | size_t total = GetTotalMemory(); |
| 1503 | return 100 - static_cast<size_t>(100.0f * static_cast<float>(num_bytes_allocated_) / total); |
| 1504 | } |
| 1505 | |
Elliott Hughes | 4dd9b4d | 2011-12-12 18:29:24 -0800 | [diff] [blame] | 1506 | void Heap::SetIdealFootprint(size_t max_allowed_footprint) { |
Mathieu Chartier | cc236d7 | 2012-07-20 10:29:05 -0700 | [diff] [blame] | 1507 | AllocSpace* alloc_space = alloc_space_; |
| 1508 | // TODO: Behavior for multiple alloc spaces? |
| 1509 | size_t alloc_space_capacity = alloc_space->Capacity(); |
| 1510 | if (max_allowed_footprint > alloc_space_capacity) { |
Mathieu Chartier | fd678be | 2012-08-30 14:50:54 -0700 | [diff] [blame^] | 1511 | VLOG(gc) << "Clamp target GC heap from " << PrettySize(max_allowed_footprint) << " to " |
| 1512 | << PrettySize(alloc_space_capacity); |
Mathieu Chartier | cc236d7 | 2012-07-20 10:29:05 -0700 | [diff] [blame] | 1513 | max_allowed_footprint = alloc_space_capacity; |
Shih-wei Liao | 8c2f641 | 2011-10-03 22:58:14 -0700 | [diff] [blame] | 1514 | } |
Mathieu Chartier | cc236d7 | 2012-07-20 10:29:05 -0700 | [diff] [blame] | 1515 | alloc_space->SetFootprintLimit(max_allowed_footprint); |
Shih-wei Liao | 8c2f641 | 2011-10-03 22:58:14 -0700 | [diff] [blame] | 1516 | } |
| 1517 | |
Ian Rogers | 3bb17a6 | 2012-01-27 23:56:44 -0800 | [diff] [blame] | 1518 | // kHeapIdealFree is the ideal maximum free size, when we grow the heap for utilization. |
Shih-wei Liao | 7f1caab | 2011-10-06 12:11:04 -0700 | [diff] [blame] | 1519 | static const size_t kHeapIdealFree = 2 * MB; |
Ian Rogers | 3bb17a6 | 2012-01-27 23:56:44 -0800 | [diff] [blame] | 1520 | // kHeapMinFree guarantees that you always have at least 512 KB free, when you grow for utilization, |
| 1521 | // regardless of target utilization ratio. |
Shih-wei Liao | 8c2f641 | 2011-10-03 22:58:14 -0700 | [diff] [blame] | 1522 | static const size_t kHeapMinFree = kHeapIdealFree / 4; |
| 1523 | |
Carl Shapiro | 69759ea | 2011-07-21 18:13:35 -0700 | [diff] [blame] | 1524 | void Heap::GrowForUtilization() { |
Ian Rogers | 00f7d0e | 2012-07-19 15:28:27 -0700 | [diff] [blame] | 1525 | size_t target_size; |
| 1526 | bool use_footprint_limit = false; |
| 1527 | { |
Ian Rogers | 00f7d0e | 2012-07-19 15:28:27 -0700 | [diff] [blame] | 1528 | // We know what our utilization is at this moment. |
| 1529 | // This doesn't actually resize any memory. It just lets the heap grow more when necessary. |
| 1530 | target_size = num_bytes_allocated_ / Heap::GetTargetHeapUtilization(); |
Shih-wei Liao | 8c2f641 | 2011-10-03 22:58:14 -0700 | [diff] [blame] | 1531 | |
Ian Rogers | 00f7d0e | 2012-07-19 15:28:27 -0700 | [diff] [blame] | 1532 | if (target_size > num_bytes_allocated_ + kHeapIdealFree) { |
| 1533 | target_size = num_bytes_allocated_ + kHeapIdealFree; |
| 1534 | } else if (target_size < num_bytes_allocated_ + kHeapMinFree) { |
| 1535 | target_size = num_bytes_allocated_ + kHeapMinFree; |
| 1536 | } |
Shih-wei Liao | 8c2f641 | 2011-10-03 22:58:14 -0700 | [diff] [blame] | 1537 | |
Ian Rogers | 00f7d0e | 2012-07-19 15:28:27 -0700 | [diff] [blame] | 1538 | // Calculate when to perform the next ConcurrentGC. |
Mathieu Chartier | 1cd9c5c | 2012-08-23 10:52:44 -0700 | [diff] [blame] | 1539 | if (GetTotalMemory() - GetUsedMemorySize() < concurrent_min_free_) { |
Ian Rogers | 00f7d0e | 2012-07-19 15:28:27 -0700 | [diff] [blame] | 1540 | // Not enough free memory to perform concurrent GC. |
| 1541 | concurrent_start_bytes_ = std::numeric_limits<size_t>::max(); |
| 1542 | } else { |
| 1543 | // Compute below to avoid holding both the statistics and the alloc space lock |
| 1544 | use_footprint_limit = true; |
| 1545 | } |
Shih-wei Liao | 8c2f641 | 2011-10-03 22:58:14 -0700 | [diff] [blame] | 1546 | } |
Mathieu Chartier | 357e9be | 2012-08-01 11:00:14 -0700 | [diff] [blame] | 1547 | |
Ian Rogers | 00f7d0e | 2012-07-19 15:28:27 -0700 | [diff] [blame] | 1548 | if (use_footprint_limit) { |
| 1549 | size_t foot_print_limit = alloc_space_->GetFootprintLimit(); |
Ian Rogers | 00f7d0e | 2012-07-19 15:28:27 -0700 | [diff] [blame] | 1550 | concurrent_start_bytes_ = foot_print_limit - concurrent_start_size_; |
Mathieu Chartier | 7664f5c | 2012-06-08 18:15:32 -0700 | [diff] [blame] | 1551 | } |
Shih-wei Liao | 8c2f641 | 2011-10-03 22:58:14 -0700 | [diff] [blame] | 1552 | SetIdealFootprint(target_size); |
Carl Shapiro | 69759ea | 2011-07-21 18:13:35 -0700 | [diff] [blame] | 1553 | } |
| 1554 | |
jeffhao | c116070 | 2011-10-27 15:48:45 -0700 | [diff] [blame] | 1555 | void Heap::ClearGrowthLimit() { |
jeffhao | c116070 | 2011-10-27 15:48:45 -0700 | [diff] [blame] | 1556 | WaitForConcurrentGcToComplete(); |
jeffhao | c116070 | 2011-10-27 15:48:45 -0700 | [diff] [blame] | 1557 | alloc_space_->ClearGrowthLimit(); |
| 1558 | } |
| 1559 | |
Elliott Hughes | adb460d | 2011-10-05 17:02:34 -0700 | [diff] [blame] | 1560 | void Heap::SetReferenceOffsets(MemberOffset reference_referent_offset, |
Mathieu Chartier | fd678be | 2012-08-30 14:50:54 -0700 | [diff] [blame^] | 1561 | MemberOffset reference_queue_offset, |
| 1562 | MemberOffset reference_queueNext_offset, |
| 1563 | MemberOffset reference_pendingNext_offset, |
| 1564 | MemberOffset finalizer_reference_zombie_offset) { |
Elliott Hughes | adb460d | 2011-10-05 17:02:34 -0700 | [diff] [blame] | 1565 | reference_referent_offset_ = reference_referent_offset; |
| 1566 | reference_queue_offset_ = reference_queue_offset; |
| 1567 | reference_queueNext_offset_ = reference_queueNext_offset; |
| 1568 | reference_pendingNext_offset_ = reference_pendingNext_offset; |
| 1569 | finalizer_reference_zombie_offset_ = finalizer_reference_zombie_offset; |
| 1570 | CHECK_NE(reference_referent_offset_.Uint32Value(), 0U); |
| 1571 | CHECK_NE(reference_queue_offset_.Uint32Value(), 0U); |
| 1572 | CHECK_NE(reference_queueNext_offset_.Uint32Value(), 0U); |
| 1573 | CHECK_NE(reference_pendingNext_offset_.Uint32Value(), 0U); |
| 1574 | CHECK_NE(finalizer_reference_zombie_offset_.Uint32Value(), 0U); |
| 1575 | } |
| 1576 | |
| 1577 | Object* Heap::GetReferenceReferent(Object* reference) { |
| 1578 | DCHECK(reference != NULL); |
| 1579 | DCHECK_NE(reference_referent_offset_.Uint32Value(), 0U); |
| 1580 | return reference->GetFieldObject<Object*>(reference_referent_offset_, true); |
| 1581 | } |
| 1582 | |
| 1583 | void Heap::ClearReferenceReferent(Object* reference) { |
| 1584 | DCHECK(reference != NULL); |
| 1585 | DCHECK_NE(reference_referent_offset_.Uint32Value(), 0U); |
| 1586 | reference->SetFieldObject(reference_referent_offset_, NULL, true); |
| 1587 | } |
| 1588 | |
| 1589 | // Returns true if the reference object has not yet been enqueued. |
| 1590 | bool Heap::IsEnqueuable(const Object* ref) { |
| 1591 | DCHECK(ref != NULL); |
| 1592 | const Object* queue = ref->GetFieldObject<Object*>(reference_queue_offset_, false); |
| 1593 | const Object* queue_next = ref->GetFieldObject<Object*>(reference_queueNext_offset_, false); |
| 1594 | return (queue != NULL) && (queue_next == NULL); |
| 1595 | } |
| 1596 | |
| 1597 | void Heap::EnqueueReference(Object* ref, Object** cleared_reference_list) { |
| 1598 | DCHECK(ref != NULL); |
| 1599 | CHECK(ref->GetFieldObject<Object*>(reference_queue_offset_, false) != NULL); |
| 1600 | CHECK(ref->GetFieldObject<Object*>(reference_queueNext_offset_, false) == NULL); |
| 1601 | EnqueuePendingReference(ref, cleared_reference_list); |
| 1602 | } |
| 1603 | |
| 1604 | void Heap::EnqueuePendingReference(Object* ref, Object** list) { |
| 1605 | DCHECK(ref != NULL); |
| 1606 | DCHECK(list != NULL); |
| 1607 | |
| 1608 | if (*list == NULL) { |
| 1609 | ref->SetFieldObject(reference_pendingNext_offset_, ref, false); |
| 1610 | *list = ref; |
| 1611 | } else { |
| 1612 | Object* head = (*list)->GetFieldObject<Object*>(reference_pendingNext_offset_, false); |
| 1613 | ref->SetFieldObject(reference_pendingNext_offset_, head, false); |
| 1614 | (*list)->SetFieldObject(reference_pendingNext_offset_, ref, false); |
| 1615 | } |
| 1616 | } |
| 1617 | |
| 1618 | Object* Heap::DequeuePendingReference(Object** list) { |
| 1619 | DCHECK(list != NULL); |
| 1620 | DCHECK(*list != NULL); |
| 1621 | Object* head = (*list)->GetFieldObject<Object*>(reference_pendingNext_offset_, false); |
| 1622 | Object* ref; |
| 1623 | if (*list == head) { |
| 1624 | ref = *list; |
| 1625 | *list = NULL; |
| 1626 | } else { |
| 1627 | Object* next = head->GetFieldObject<Object*>(reference_pendingNext_offset_, false); |
| 1628 | (*list)->SetFieldObject(reference_pendingNext_offset_, next, false); |
| 1629 | ref = head; |
| 1630 | } |
| 1631 | ref->SetFieldObject(reference_pendingNext_offset_, NULL, false); |
| 1632 | return ref; |
| 1633 | } |
| 1634 | |
Ian Rogers | 5d4bdc2 | 2011-11-02 22:15:43 -0700 | [diff] [blame] | 1635 | void Heap::AddFinalizerReference(Thread* self, Object* object) { |
Ian Rogers | 00f7d0e | 2012-07-19 15:28:27 -0700 | [diff] [blame] | 1636 | ScopedObjectAccess soa(self); |
Elliott Hughes | 7740579 | 2012-03-15 15:22:12 -0700 | [diff] [blame] | 1637 | JValue args[1]; |
Elliott Hughes | f24d3ce | 2012-04-11 17:43:37 -0700 | [diff] [blame] | 1638 | args[0].SetL(object); |
Mathieu Chartier | fd678be | 2012-08-30 14:50:54 -0700 | [diff] [blame^] | 1639 | soa.DecodeMethod(WellKnownClasses::java_lang_ref_FinalizerReference_add)->Invoke(self, NULL, args, |
| 1640 | NULL); |
Ian Rogers | 00f7d0e | 2012-07-19 15:28:27 -0700 | [diff] [blame] | 1641 | } |
| 1642 | |
| 1643 | size_t Heap::GetBytesAllocated() const { |
Ian Rogers | 00f7d0e | 2012-07-19 15:28:27 -0700 | [diff] [blame] | 1644 | return num_bytes_allocated_; |
| 1645 | } |
| 1646 | |
| 1647 | size_t Heap::GetObjectsAllocated() const { |
Ian Rogers | 00f7d0e | 2012-07-19 15:28:27 -0700 | [diff] [blame] | 1648 | return num_objects_allocated_; |
| 1649 | } |
| 1650 | |
| 1651 | size_t Heap::GetConcurrentStartSize() const { |
Ian Rogers | 00f7d0e | 2012-07-19 15:28:27 -0700 | [diff] [blame] | 1652 | return concurrent_start_size_; |
| 1653 | } |
| 1654 | |
| 1655 | size_t Heap::GetConcurrentMinFree() const { |
Ian Rogers | 00f7d0e | 2012-07-19 15:28:27 -0700 | [diff] [blame] | 1656 | return concurrent_min_free_; |
Elliott Hughes | adb460d | 2011-10-05 17:02:34 -0700 | [diff] [blame] | 1657 | } |
| 1658 | |
| 1659 | void Heap::EnqueueClearedReferences(Object** cleared) { |
| 1660 | DCHECK(cleared != NULL); |
| 1661 | if (*cleared != NULL) { |
Ian Rogers | 00f7d0e | 2012-07-19 15:28:27 -0700 | [diff] [blame] | 1662 | ScopedObjectAccess soa(Thread::Current()); |
Elliott Hughes | 7740579 | 2012-03-15 15:22:12 -0700 | [diff] [blame] | 1663 | JValue args[1]; |
Elliott Hughes | f24d3ce | 2012-04-11 17:43:37 -0700 | [diff] [blame] | 1664 | args[0].SetL(*cleared); |
Mathieu Chartier | fd678be | 2012-08-30 14:50:54 -0700 | [diff] [blame^] | 1665 | soa.DecodeMethod(WellKnownClasses::java_lang_ref_ReferenceQueue_add)->Invoke(soa.Self(), NULL, |
| 1666 | args, NULL); |
Elliott Hughes | adb460d | 2011-10-05 17:02:34 -0700 | [diff] [blame] | 1667 | *cleared = NULL; |
| 1668 | } |
| 1669 | } |
| 1670 | |
Mathieu Chartier | 7664f5c | 2012-06-08 18:15:32 -0700 | [diff] [blame] | 1671 | void Heap::RequestConcurrentGC() { |
Mathieu Chartier | 069387a | 2012-06-18 12:01:01 -0700 | [diff] [blame] | 1672 | // Make sure that we can do a concurrent GC. |
Mathieu Chartier | fd678be | 2012-08-30 14:50:54 -0700 | [diff] [blame^] | 1673 | if (requesting_gc_ || !Runtime::Current()->IsFinishedStarting() || |
| 1674 | Runtime::Current()->IsShuttingDown() || !Runtime::Current()->IsConcurrentGcEnabled()) { |
Mathieu Chartier | 7664f5c | 2012-06-08 18:15:32 -0700 | [diff] [blame] | 1675 | return; |
| 1676 | } |
| 1677 | |
| 1678 | requesting_gc_ = true; |
| 1679 | JNIEnv* env = Thread::Current()->GetJniEnv(); |
Mathieu Chartier | a639903 | 2012-06-11 18:49:50 -0700 | [diff] [blame] | 1680 | DCHECK(WellKnownClasses::java_lang_Daemons != NULL); |
| 1681 | DCHECK(WellKnownClasses::java_lang_Daemons_requestGC != NULL); |
Ian Rogers | 00f7d0e | 2012-07-19 15:28:27 -0700 | [diff] [blame] | 1682 | env->CallStaticVoidMethod(WellKnownClasses::java_lang_Daemons, |
| 1683 | WellKnownClasses::java_lang_Daemons_requestGC); |
Mathieu Chartier | 7664f5c | 2012-06-08 18:15:32 -0700 | [diff] [blame] | 1684 | CHECK(!env->ExceptionCheck()); |
| 1685 | requesting_gc_ = false; |
| 1686 | } |
| 1687 | |
| 1688 | void Heap::ConcurrentGC() { |
Ian Rogers | 00f7d0e | 2012-07-19 15:28:27 -0700 | [diff] [blame] | 1689 | if (Runtime::Current()->IsShuttingDown() || !concurrent_gc_) { |
Mathieu Chartier | 2542d66 | 2012-06-21 17:14:11 -0700 | [diff] [blame] | 1690 | return; |
| 1691 | } |
Mathieu Chartier | 357e9be | 2012-08-01 11:00:14 -0700 | [diff] [blame] | 1692 | |
Ian Rogers | 00f7d0e | 2012-07-19 15:28:27 -0700 | [diff] [blame] | 1693 | // TODO: We shouldn't need a WaitForConcurrentGcToComplete here since only |
| 1694 | // concurrent GC resumes threads before the GC is completed and this function |
| 1695 | // is only called within the GC daemon thread. |
Mathieu Chartier | cc236d7 | 2012-07-20 10:29:05 -0700 | [diff] [blame] | 1696 | if (!WaitForConcurrentGcToComplete()) { |
Ian Rogers | 00f7d0e | 2012-07-19 15:28:27 -0700 | [diff] [blame] | 1697 | // Start a concurrent GC as one wasn't in progress |
| 1698 | ScopedThreadStateChange tsc(Thread::Current(), kWaitingPerformingGc); |
Mathieu Chartier | 357e9be | 2012-08-01 11:00:14 -0700 | [diff] [blame] | 1699 | if (alloc_space_->Size() > kMinAllocSpaceSizeForStickyGC) { |
| 1700 | CollectGarbageInternal(GC_STICKY, false); |
| 1701 | } else { |
| 1702 | CollectGarbageInternal(GC_PARTIAL, false); |
| 1703 | } |
Mathieu Chartier | cc236d7 | 2012-07-20 10:29:05 -0700 | [diff] [blame] | 1704 | } |
Mathieu Chartier | 7664f5c | 2012-06-08 18:15:32 -0700 | [diff] [blame] | 1705 | } |
| 1706 | |
Mathieu Chartier | fd678be | 2012-08-30 14:50:54 -0700 | [diff] [blame^] | 1707 | void Heap::Trim() { |
Mathieu Chartier | a639903 | 2012-06-11 18:49:50 -0700 | [diff] [blame] | 1708 | WaitForConcurrentGcToComplete(); |
Mathieu Chartier | fd678be | 2012-08-30 14:50:54 -0700 | [diff] [blame^] | 1709 | alloc_space_->Trim(); |
Mathieu Chartier | 7664f5c | 2012-06-08 18:15:32 -0700 | [diff] [blame] | 1710 | } |
| 1711 | |
Elliott Hughes | 8cf5bc0 | 2012-02-02 16:32:16 -0800 | [diff] [blame] | 1712 | void Heap::RequestHeapTrim() { |
| 1713 | // We don't have a good measure of how worthwhile a trim might be. We can't use the live bitmap |
| 1714 | // because that only marks object heads, so a large array looks like lots of empty space. We |
| 1715 | // don't just call dlmalloc all the time, because the cost of an _attempted_ trim is proportional |
| 1716 | // to utilization (which is probably inversely proportional to how much benefit we can expect). |
| 1717 | // We could try mincore(2) but that's only a measure of how many pages we haven't given away, |
| 1718 | // not how much use we're making of those pages. |
Mathieu Chartier | 7664f5c | 2012-06-08 18:15:32 -0700 | [diff] [blame] | 1719 | uint64_t ms_time = NsToMs(NanoTime()); |
Ian Rogers | 00f7d0e | 2012-07-19 15:28:27 -0700 | [diff] [blame] | 1720 | { |
Ian Rogers | 00f7d0e | 2012-07-19 15:28:27 -0700 | [diff] [blame] | 1721 | float utilization = static_cast<float>(num_bytes_allocated_) / alloc_space_->Size(); |
| 1722 | if ((utilization > 0.75f) || ((ms_time - last_trim_time_) < 2 * 1000)) { |
| 1723 | // Don't bother trimming the heap if it's more than 75% utilized, or if a |
| 1724 | // heap trim occurred in the last two seconds. |
| 1725 | return; |
| 1726 | } |
Elliott Hughes | 8cf5bc0 | 2012-02-02 16:32:16 -0800 | [diff] [blame] | 1727 | } |
Mathieu Chartier | a639903 | 2012-06-11 18:49:50 -0700 | [diff] [blame] | 1728 | if (!Runtime::Current()->IsFinishedStarting() || Runtime::Current()->IsShuttingDown()) { |
Mathieu Chartier | 7664f5c | 2012-06-08 18:15:32 -0700 | [diff] [blame] | 1729 | // Heap trimming isn't supported without a Java runtime or Daemons (such as at dex2oat time) |
Mathieu Chartier | a639903 | 2012-06-11 18:49:50 -0700 | [diff] [blame] | 1730 | // Also: we do not wish to start a heap trim if the runtime is shutting down. |
Ian Rogers | e1d490c | 2012-02-03 09:09:07 -0800 | [diff] [blame] | 1731 | return; |
| 1732 | } |
Mathieu Chartier | 7664f5c | 2012-06-08 18:15:32 -0700 | [diff] [blame] | 1733 | last_trim_time_ = ms_time; |
Elliott Hughes | 8cf5bc0 | 2012-02-02 16:32:16 -0800 | [diff] [blame] | 1734 | JNIEnv* env = Thread::Current()->GetJniEnv(); |
Mathieu Chartier | a639903 | 2012-06-11 18:49:50 -0700 | [diff] [blame] | 1735 | DCHECK(WellKnownClasses::java_lang_Daemons != NULL); |
| 1736 | DCHECK(WellKnownClasses::java_lang_Daemons_requestHeapTrim != NULL); |
Ian Rogers | 00f7d0e | 2012-07-19 15:28:27 -0700 | [diff] [blame] | 1737 | env->CallStaticVoidMethod(WellKnownClasses::java_lang_Daemons, |
| 1738 | WellKnownClasses::java_lang_Daemons_requestHeapTrim); |
Elliott Hughes | 8cf5bc0 | 2012-02-02 16:32:16 -0800 | [diff] [blame] | 1739 | CHECK(!env->ExceptionCheck()); |
| 1740 | } |
| 1741 | |
Carl Shapiro | 69759ea | 2011-07-21 18:13:35 -0700 | [diff] [blame] | 1742 | } // namespace art |