v8  3.25.30(node0.11.13)
V8 is Google's open source JavaScript engine
 All Data Structures Namespaces Files Functions Variables Typedefs Enumerations Enumerator Friends Macros Pages
heap-profiler.cc
Go to the documentation of this file.
1 // Copyright 2009-2010 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 "heap-profiler.h"
31 
32 #include "allocation-tracker.h"
34 
35 namespace v8 {
36 namespace internal {
37 
39  : ids_(new HeapObjectsMap(heap)),
40  names_(new StringsStorage(heap)),
41  next_snapshot_uid_(1),
42  is_tracking_object_moves_(false) {
43 }
44 
45 
46 static void DeleteHeapSnapshot(HeapSnapshot** snapshot_ptr) {
47  delete *snapshot_ptr;
48 }
49 
50 
52  snapshots_.Iterate(DeleteHeapSnapshot);
53  snapshots_.Clear();
54 }
55 
56 
58  snapshots_.Iterate(DeleteHeapSnapshot);
59  snapshots_.Clear();
60  names_.Reset(new StringsStorage(heap()));
61 }
62 
63 
65  snapshots_.RemoveElement(snapshot);
66 }
67 
68 
72  if (wrapper_callbacks_.length() <= class_id) {
73  wrapper_callbacks_.AddBlock(
74  NULL, class_id - wrapper_callbacks_.length() + 1);
75  }
76  wrapper_callbacks_[class_id] = callback;
77 }
78 
79 
81  uint16_t class_id, Object** wrapper) {
82  if (wrapper_callbacks_.length() <= class_id) return NULL;
83  return wrapper_callbacks_[class_id](
84  class_id, Utils::ToLocal(Handle<Object>(wrapper)));
85 }
86 
87 
89  const char* name,
90  v8::ActivityControl* control,
92  HeapSnapshot* result = new HeapSnapshot(this, name, next_snapshot_uid_++);
93  {
94  HeapSnapshotGenerator generator(result, control, resolver, heap());
95  if (!generator.GenerateSnapshot()) {
96  delete result;
97  result = NULL;
98  } else {
99  snapshots_.Add(result);
100  }
101  }
102  ids_->RemoveDeadEntries();
103  is_tracking_object_moves_ = true;
104  return result;
105 }
106 
107 
109  String* name,
110  v8::ActivityControl* control,
112  return TakeSnapshot(names_->GetName(name), control, resolver);
113 }
114 
115 
116 void HeapProfiler::StartHeapObjectsTracking(bool track_allocations) {
117  ids_->UpdateHeapObjectsMap();
118  is_tracking_object_moves_ = true;
120  if (track_allocations) {
121  allocation_tracker_.Reset(new AllocationTracker(ids_.get(), names_.get()));
122  heap()->DisableInlineAllocation();
123  }
124 }
125 
126 
128  return ids_->PushHeapObjectsStats(stream);
129 }
130 
131 
133  ids_->StopHeapObjectsTracking();
134  if (is_tracking_allocations()) {
135  allocation_tracker_.Reset(NULL);
136  heap()->EnableInlineAllocation();
137  }
138 }
139 
140 
142  size_t size = sizeof(*this);
143  size += names_->GetUsedMemorySize();
144  size += ids_->GetUsedMemorySize();
145  size += GetMemoryUsedByList(snapshots_);
146  for (int i = 0; i < snapshots_.length(); ++i) {
147  size += snapshots_[i]->RawSnapshotSize();
148  }
149  return size;
150 }
151 
152 
154  return snapshots_.length();
155 }
156 
157 
159  return snapshots_.at(index);
160 }
161 
162 
164  if (!obj->IsHeapObject())
166  return ids_->FindEntry(HeapObject::cast(*obj)->address());
167 }
168 
169 
171  bool known_object = ids_->MoveObject(from, to, size);
172  if (!known_object && !allocation_tracker_.is_empty()) {
173  allocation_tracker_->address_to_trace()->MoveObject(from, to, size);
174  }
175 }
176 
177 
179  DisallowHeapAllocation no_allocation;
180  if (!allocation_tracker_.is_empty()) {
181  allocation_tracker_->AllocationEvent(addr, size);
182  }
183 }
184 
185 
187  ids_->UpdateObjectSize(addr, size);
188 }
189 
190 
193  // TODO(yurus, marja): Don't route this information through GlobalHandles.
194  heap()->isolate()->global_handles()->SetRetainedObjectInfo(id, info);
195 }
196 
197 
200  "HeapProfiler::FindHeapObjectById");
201  DisallowHeapAllocation no_allocation;
202  HeapObject* object = NULL;
203  HeapIterator iterator(heap(), HeapIterator::kFilterUnreachable);
204  // Make sure that object with the given id is still reachable.
205  for (HeapObject* obj = iterator.next();
206  obj != NULL;
207  obj = iterator.next()) {
208  if (ids_->FindEntry(obj->address()) == id) {
209  ASSERT(object == NULL);
210  object = obj;
211  // Can't break -- kFilterUnreachable requires full heap traversal.
212  }
213  }
214  return object != NULL ? Handle<HeapObject>(object) : Handle<HeapObject>();
215 }
216 
217 
219  ids_.Reset(new HeapObjectsMap(heap()));
220  if (!is_tracking_allocations()) is_tracking_object_moves_ = false;
221 }
222 
223 
224 } } // namespace v8::internal
byte * Address
Definition: globals.h:186
enable upcoming ES6 features enable harmony block scoping enable harmony enable harmony proxies enable harmony generators enable harmony numeric enable harmony string enable harmony math functions harmony_scoping harmony_symbols harmony_collections harmony_iteration harmony_strings harmony_scoping harmony_maths tracks arrays with only smi values Optimize object Array DOM strings and string pretenure call new trace pretenuring decisions of HAllocate instructions track fields with only smi values track fields with heap values track_fields track_fields Enables optimizations which favor memory size over execution speed use string slices optimization filter maximum number of GVN fix point iterations use function inlining use allocation folding eliminate write barriers targeting allocations in optimized code maximum source size in bytes considered for a single inlining maximum cumulative number of AST nodes considered for inlining crankshaft harvests type feedback from stub cache trace check elimination phase hydrogen tracing filter NULL
Definition: flags.cc:269
HeapSnapshot * GetSnapshot(int index)
SnapshotObjectId PushHeapObjectsStats(OutputStream *stream)
void CollectAllGarbage(int flags, const char *gc_reason=NULL, const GCCallbackFlags gc_callback_flags=kNoGCCallbackFlags)
Definition: heap.cc:731
Isolate * isolate()
Definition: heap-inl.h:624
static HeapObject * cast(Object *obj)
void RemoveSnapshot(HeapSnapshot *snapshot)
#define ASSERT(condition)
Definition: checks.h:329
unsigned short uint16_t
Definition: unicode.cc:46
void UpdateObjectSizeEvent(Address addr, int size)
HeapSnapshot * TakeSnapshot(const char *name, v8::ActivityControl *control, v8::HeapProfiler::ObjectNameResolver *resolver)
Handle< HeapObject > FindHeapObjectById(SnapshotObjectId id)
void StartHeapObjectsTracking(bool track_allocations)
enable upcoming ES6 features enable harmony block scoping enable harmony enable harmony proxies enable harmony generators enable harmony numeric enable harmony string enable harmony math functions harmony_scoping harmony_symbols harmony_collections harmony_iteration harmony_strings harmony_scoping harmony_maths tracks arrays with only smi values Optimize object size
Definition: flags.cc:211
static const uint16_t kPersistentHandleNoClassId
Definition: v8-profiler.h:514
GlobalHandles * global_handles()
Definition: isolate.h:918
static const int kMakeHeapIterableMask
Definition: heap.h:1264
SnapshotObjectId GetSnapshotObjectId(Handle< Object > obj)
static Local< Context > ToLocal(v8::internal::Handle< v8::internal::Context > obj)
void ObjectMoveEvent(Address from, Address to, int size)
void SetRetainedObjectInfo(UniqueId id, RetainedObjectInfo *info)
enable upcoming ES6 features enable harmony block scoping enable harmony enable harmony proxies enable harmony generators enable harmony numeric enable harmony string enable harmony math functions harmony_scoping harmony_symbols harmony_collections harmony_iteration harmony_strings harmony_scoping harmony_maths tracks arrays with only smi values Optimize object Array DOM strings and string pretenure call new trace pretenuring decisions of HAllocate instructions track fields with only smi values track fields with heap values track_fields track_fields Enables optimizations which favor memory size over execution speed use string slices optimization filter maximum number of GVN fix point iterations use function inlining use allocation folding eliminate write barriers targeting allocations in optimized code maximum source size in bytes considered for a single inlining maximum cumulative number of AST nodes considered for inlining crankshaft harvests type feedback from stub cache trace check elimination phase hydrogen tracing filter trace hydrogen to given file name trace inlining decisions trace store elimination trace all use positions trace global value numbering trace hydrogen escape analysis trace the tracking of allocation sites trace map generalization environment for every instruction deoptimize every n garbage collections put a break point before deoptimizing deoptimize uncommon cases use on stack replacement trace array bounds check elimination perform array index dehoisting use load elimination use store elimination use constant folding eliminate unreachable code number of stress runs when picking a function to watch for shared function info
Definition: flags.cc:317
uint32_t SnapshotObjectId
Definition: v8-profiler.h:39
void EnableInlineAllocation()
Definition: heap.cc:6529
bool is_tracking_allocations() const
Definition: heap-profiler.h:85
size_t GetMemoryUsedByList(const List< T, P > &list)
Definition: list.h:205
void DisableInlineAllocation()
Definition: heap.cc:6538
RetainedObjectInfo *(* WrapperInfoCallback)(uint16_t class_id, Handle< Value > wrapper)
Definition: v8-profiler.h:410
HeapObject * obj
v8::RetainedObjectInfo * ExecuteWrapperClassCallback(uint16_t class_id, Object **wrapper)
void SetRetainedObjectInfo(UniqueId id, RetainedObjectInfo *info)
enable upcoming ES6 features enable harmony block scoping enable harmony enable harmony proxies enable harmony generators enable harmony numeric enable harmony string enable harmony math functions harmony_scoping harmony_symbols harmony_collections harmony_iteration harmony_strings harmony_scoping harmony_maths tracks arrays with only smi values Optimize object Array DOM strings and string pretenure call new trace pretenuring decisions of HAllocate instructions track fields with only smi values track fields with heap values track_fields track_fields Enables optimizations which favor memory size over execution speed use string slices optimization filter maximum number of GVN fix point iterations use function inlining use allocation folding eliminate write barriers targeting allocations in optimized code maximum source size in bytes considered for a single inlining maximum cumulative number of AST nodes considered for inlining crankshaft harvests type feedback from stub cache trace check elimination phase hydrogen tracing filter trace hydrogen to given file name trace inlining decisions trace store elimination trace all use positions trace global value numbering trace hydrogen escape analysis trace the tracking of allocation sites trace map generalization environment for every instruction deoptimize every n garbage collections put a break point before deoptimizing deoptimize uncommon cases use on stack replacement trace array bounds check elimination perform array index dehoisting use load elimination use store elimination use constant folding eliminate unreachable code number of stress runs when picking a function to watch for shared function not JSFunction itself flushes the cache of optimized code for closures on every GC functions with arguments object maximum number of escape analysis fix point iterations allow uint32 values on optimize frames if they are used only in safe operations track concurrent recompilation artificial compilation delay in ms concurrent on stack replacement do not emit check maps for constant values that have a leaf deoptimize the optimized code if the layout of the maps changes number of stack frames inspected by the profiler percentage of ICs that must have type info to allow optimization extra verbose compilation tracing generate extra emit comments in code disassembly enable use of SSE3 instructions if available enable use of CMOV instruction if available enable use of VFP3 instructions if available enable use of NEON instructions if enable use of SDIV and UDIV instructions if enable loading bit constant by means of movw movt instruction enable unaligned accesses for enable use of d16 d31 registers on ARM this requires VFP3 force all emitted branches to be in long expose natives in global object expose freeBuffer extension expose gc extension under the specified name expose externalize string extension number of stack frames to capture disable builtin natives files print name of functions for which code is generated use random jit cookie to mask large constants trace lazy optimization use adaptive optimizations always try to OSR functions trace optimize function deoptimization minimum length for automatic enable preparsing maximum number of optimization attempts before giving up cache prototype transitions trace debugging JSON request response trace out of bounds accesses to external arrays trace_js_array_abuse automatically set the debug break flag when debugger commands are in the queue abort by crashing maximum length of function source code printed in a stack trace max size of the new max size of the old max size of executable always perform global GCs print one trace line following each garbage collection do not print trace line after scavenger collection print statistics of the maximum memory committed for the heap in name
Definition: flags.cc:505
void AllocationEvent(Address addr, int size)
void DefineWrapperClass(uint16_t class_id, v8::HeapProfiler::WrapperInfoCallback callback)
static const SnapshotObjectId kUnknownObjectId
Definition: v8-profiler.h:442