machenbach@chromium.org | b5be0a9 | 2013-11-15 10:32:41 +0000 | [diff] [blame] | 1 | // Copyright 2013 the V8 project authors. All rights reserved. |
| 2 | // Redistribution and use in source and binary forms, with or without |
| 3 | // modification, are permitted provided that the following conditions are |
| 4 | // met: |
| 5 | // |
| 6 | // * Redistributions of source code must retain the above copyright |
| 7 | // notice, this list of conditions and the following disclaimer. |
| 8 | // * Redistributions in binary form must reproduce the above |
| 9 | // copyright notice, this list of conditions and the following |
| 10 | // disclaimer in the documentation and/or other materials provided |
| 11 | // with the distribution. |
| 12 | // * Neither the name of Google Inc. nor the names of its |
| 13 | // contributors may be used to endorse or promote products derived |
| 14 | // from this software without specific prior written permission. |
| 15 | // |
| 16 | // THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS |
| 17 | // "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT |
| 18 | // LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR |
| 19 | // A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT |
| 20 | // OWNER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, |
| 21 | // SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT |
| 22 | // LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, |
| 23 | // DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY |
| 24 | // THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT |
| 25 | // (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE |
| 26 | // OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE. |
| 27 | |
| 28 | #include "v8.h" |
| 29 | |
| 30 | #include "allocation-tracker.h" |
| 31 | |
| 32 | #include "heap-snapshot-generator.h" |
| 33 | #include "frames-inl.h" |
| 34 | |
| 35 | namespace v8 { |
| 36 | namespace internal { |
| 37 | |
| 38 | AllocationTraceNode::AllocationTraceNode( |
| 39 | AllocationTraceTree* tree, SnapshotObjectId shared_function_info_id) |
| 40 | : tree_(tree), |
| 41 | function_id_(shared_function_info_id), |
| 42 | total_size_(0), |
| 43 | allocation_count_(0), |
| 44 | id_(tree->next_node_id()) { |
| 45 | } |
| 46 | |
| 47 | |
| 48 | AllocationTraceNode::~AllocationTraceNode() { |
| 49 | } |
| 50 | |
| 51 | |
| 52 | AllocationTraceNode* AllocationTraceNode::FindChild(SnapshotObjectId id) { |
| 53 | for (int i = 0; i < children_.length(); i++) { |
| 54 | AllocationTraceNode* node = children_[i]; |
| 55 | if (node->function_id() == id) return node; |
| 56 | } |
| 57 | return NULL; |
| 58 | } |
| 59 | |
| 60 | |
| 61 | AllocationTraceNode* AllocationTraceNode::FindOrAddChild(SnapshotObjectId id) { |
| 62 | AllocationTraceNode* child = FindChild(id); |
| 63 | if (child == NULL) { |
| 64 | child = new AllocationTraceNode(tree_, id); |
| 65 | children_.Add(child); |
| 66 | } |
| 67 | return child; |
| 68 | } |
| 69 | |
| 70 | |
| 71 | void AllocationTraceNode::AddAllocation(unsigned size) { |
| 72 | total_size_ += size; |
| 73 | ++allocation_count_; |
| 74 | } |
| 75 | |
| 76 | |
| 77 | void AllocationTraceNode::Print(int indent, AllocationTracker* tracker) { |
| 78 | OS::Print("%10u %10u %*c", total_size_, allocation_count_, indent, ' '); |
| 79 | if (tracker != NULL) { |
| 80 | const char* name = "<unknown function>"; |
| 81 | if (function_id_ != 0) { |
| 82 | AllocationTracker::FunctionInfo* info = |
| 83 | tracker->GetFunctionInfo(function_id_); |
| 84 | if (info != NULL) { |
| 85 | name = info->name; |
| 86 | } |
| 87 | } |
| 88 | OS::Print("%s #%u", name, id_); |
| 89 | } else { |
| 90 | OS::Print("%u #%u", function_id_, id_); |
| 91 | } |
| 92 | OS::Print("\n"); |
| 93 | indent += 2; |
| 94 | for (int i = 0; i < children_.length(); i++) { |
| 95 | children_[i]->Print(indent, tracker); |
| 96 | } |
| 97 | } |
| 98 | |
| 99 | |
| 100 | AllocationTraceTree::AllocationTraceTree() |
| 101 | : next_node_id_(1), |
| 102 | root_(this, 0) { |
| 103 | } |
| 104 | |
| 105 | |
| 106 | AllocationTraceTree::~AllocationTraceTree() { |
| 107 | } |
| 108 | |
| 109 | |
| 110 | AllocationTraceNode* AllocationTraceTree::AddPathFromEnd( |
| 111 | const Vector<SnapshotObjectId>& path) { |
| 112 | AllocationTraceNode* node = root(); |
| 113 | for (SnapshotObjectId* entry = path.start() + path.length() - 1; |
| 114 | entry != path.start() - 1; |
| 115 | --entry) { |
| 116 | node = node->FindOrAddChild(*entry); |
| 117 | } |
| 118 | return node; |
| 119 | } |
| 120 | |
| 121 | |
| 122 | void AllocationTraceTree::Print(AllocationTracker* tracker) { |
| 123 | OS::Print("[AllocationTraceTree:]\n"); |
| 124 | OS::Print("Total size | Allocation count | Function id | id\n"); |
| 125 | root()->Print(0, tracker); |
| 126 | } |
| 127 | |
| 128 | void AllocationTracker::DeleteUnresolvedLocation( |
| 129 | UnresolvedLocation** location) { |
| 130 | delete *location; |
| 131 | } |
| 132 | |
| 133 | |
| 134 | AllocationTracker::FunctionInfo::FunctionInfo() |
| 135 | : name(""), |
| 136 | script_name(""), |
| 137 | script_id(0), |
| 138 | line(-1), |
| 139 | column(-1) { |
| 140 | } |
| 141 | |
| 142 | |
| 143 | static bool AddressesMatch(void* key1, void* key2) { |
| 144 | return key1 == key2; |
| 145 | } |
| 146 | |
| 147 | |
| 148 | AllocationTracker::AllocationTracker( |
| 149 | HeapObjectsMap* ids, StringsStorage* names) |
| 150 | : ids_(ids), |
| 151 | names_(names), |
| 152 | id_to_function_info_(AddressesMatch) { |
| 153 | } |
| 154 | |
| 155 | |
| 156 | AllocationTracker::~AllocationTracker() { |
| 157 | unresolved_locations_.Iterate(DeleteUnresolvedLocation); |
| 158 | } |
| 159 | |
| 160 | |
| 161 | void AllocationTracker::PrepareForSerialization() { |
| 162 | List<UnresolvedLocation*> copy(unresolved_locations_.length()); |
| 163 | copy.AddAll(unresolved_locations_); |
| 164 | unresolved_locations_.Clear(); |
| 165 | for (int i = 0; i < copy.length(); i++) { |
| 166 | copy[i]->Resolve(); |
| 167 | delete copy[i]; |
| 168 | } |
| 169 | } |
| 170 | |
| 171 | |
yangguo@chromium.org | cc53605 | 2013-11-29 11:43:20 +0000 | [diff] [blame^] | 172 | void AllocationTracker::AllocationEvent(Address addr, int size) { |
machenbach@chromium.org | b5be0a9 | 2013-11-15 10:32:41 +0000 | [diff] [blame] | 173 | DisallowHeapAllocation no_allocation; |
| 174 | Heap* heap = ids_->heap(); |
| 175 | |
| 176 | // Mark the new block as FreeSpace to make sure the heap is iterable |
| 177 | // while we are capturing stack trace. |
| 178 | FreeListNode::FromAddress(addr)->set_size(heap, size); |
| 179 | ASSERT_EQ(HeapObject::FromAddress(addr)->Size(), size); |
| 180 | ASSERT(FreeListNode::IsFreeListNode(HeapObject::FromAddress(addr))); |
| 181 | |
| 182 | Isolate* isolate = heap->isolate(); |
| 183 | int length = 0; |
| 184 | StackTraceFrameIterator it(isolate); |
| 185 | while (!it.done() && length < kMaxAllocationTraceLength) { |
| 186 | JavaScriptFrame* frame = it.frame(); |
| 187 | SharedFunctionInfo* shared = frame->function()->shared(); |
yangguo@chromium.org | cc53605 | 2013-11-29 11:43:20 +0000 | [diff] [blame^] | 188 | SnapshotObjectId id = ids_->FindOrAddEntry( |
| 189 | shared->address(), shared->Size(), false); |
machenbach@chromium.org | b5be0a9 | 2013-11-15 10:32:41 +0000 | [diff] [blame] | 190 | allocation_trace_buffer_[length++] = id; |
| 191 | AddFunctionInfo(shared, id); |
| 192 | it.Advance(); |
| 193 | } |
| 194 | AllocationTraceNode* top_node = trace_tree_.AddPathFromEnd( |
| 195 | Vector<SnapshotObjectId>(allocation_trace_buffer_, length)); |
| 196 | top_node->AddAllocation(size); |
| 197 | } |
| 198 | |
| 199 | |
| 200 | static uint32_t SnapshotObjectIdHash(SnapshotObjectId id) { |
| 201 | return ComputeIntegerHash(static_cast<uint32_t>(id), |
| 202 | v8::internal::kZeroHashSeed); |
| 203 | } |
| 204 | |
| 205 | |
| 206 | AllocationTracker::FunctionInfo* AllocationTracker::GetFunctionInfo( |
| 207 | SnapshotObjectId id) { |
| 208 | HashMap::Entry* entry = id_to_function_info_.Lookup( |
| 209 | reinterpret_cast<void*>(id), SnapshotObjectIdHash(id), false); |
| 210 | if (entry == NULL) { |
| 211 | return NULL; |
| 212 | } |
| 213 | return reinterpret_cast<FunctionInfo*>(entry->value); |
| 214 | } |
| 215 | |
| 216 | |
| 217 | void AllocationTracker::AddFunctionInfo(SharedFunctionInfo* shared, |
| 218 | SnapshotObjectId id) { |
| 219 | HashMap::Entry* entry = id_to_function_info_.Lookup( |
| 220 | reinterpret_cast<void*>(id), SnapshotObjectIdHash(id), true); |
| 221 | if (entry->value == NULL) { |
| 222 | FunctionInfo* info = new FunctionInfo(); |
| 223 | info->name = names_->GetFunctionName(shared->DebugName()); |
| 224 | if (shared->script()->IsScript()) { |
| 225 | Script* script = Script::cast(shared->script()); |
| 226 | if (script->name()->IsName()) { |
| 227 | Name* name = Name::cast(script->name()); |
| 228 | info->script_name = names_->GetName(name); |
| 229 | } |
| 230 | info->script_id = script->id()->value(); |
| 231 | // Converting start offset into line and column may cause heap |
| 232 | // allocations so we postpone them until snapshot serialization. |
| 233 | unresolved_locations_.Add(new UnresolvedLocation( |
| 234 | script, |
| 235 | shared->start_position(), |
| 236 | info)); |
| 237 | } |
| 238 | entry->value = info; |
| 239 | } |
| 240 | } |
| 241 | |
| 242 | |
| 243 | AllocationTracker::UnresolvedLocation::UnresolvedLocation( |
| 244 | Script* script, int start, FunctionInfo* info) |
| 245 | : start_position_(start), |
| 246 | info_(info) { |
| 247 | script_ = Handle<Script>::cast( |
| 248 | script->GetIsolate()->global_handles()->Create(script)); |
| 249 | GlobalHandles::MakeWeak( |
| 250 | reinterpret_cast<Object**>(script_.location()), |
| 251 | this, &HandleWeakScript); |
| 252 | } |
| 253 | |
| 254 | |
| 255 | AllocationTracker::UnresolvedLocation::~UnresolvedLocation() { |
| 256 | if (!script_.is_null()) { |
| 257 | script_->GetIsolate()->global_handles()->Destroy( |
| 258 | reinterpret_cast<Object**>(script_.location())); |
| 259 | } |
| 260 | } |
| 261 | |
| 262 | |
| 263 | void AllocationTracker::UnresolvedLocation::Resolve() { |
| 264 | if (script_.is_null()) return; |
| 265 | info_->line = GetScriptLineNumber(script_, start_position_); |
| 266 | info_->column = GetScriptColumnNumber(script_, start_position_); |
| 267 | } |
| 268 | |
| 269 | |
| 270 | void AllocationTracker::UnresolvedLocation::HandleWeakScript( |
| 271 | v8::Isolate* isolate, |
| 272 | v8::Persistent<v8::Value>* obj, |
| 273 | void* data) { |
| 274 | UnresolvedLocation* location = reinterpret_cast<UnresolvedLocation*>(data); |
| 275 | location->script_ = Handle<Script>::null(); |
machenbach@chromium.org | f984189 | 2013-11-25 12:01:13 +0000 | [diff] [blame] | 276 | obj->Reset(); |
machenbach@chromium.org | b5be0a9 | 2013-11-15 10:32:41 +0000 | [diff] [blame] | 277 | } |
| 278 | |
| 279 | |
| 280 | } } // namespace v8::internal |