Lines Matching refs:entry
100 for (HashMap::Entry* p = names_.Start();
129 HashMap::Entry* cache_entry = names_.Lookup(str, hash, true);
131 // New entry added.
204 bool CodeEntry::IsSameAs(CodeEntry* entry) const {
205 return this == entry
206 || (tag_ == entry->tag_
207 && shared_id_ == entry->shared_id_
209 || (name_prefix_ == entry->name_prefix_
210 && name_ == entry->name_
211 && resource_name_ == entry->resource_name_
212 && line_number_ == entry->line_number_)));
216 ProfileNode* ProfileNode::FindChild(CodeEntry* entry) {
217 HashMap::Entry* map_entry =
218 children_.Lookup(entry, CodeEntryHash(entry), false);
224 ProfileNode* ProfileNode::FindOrAddChild(CodeEntry* entry) {
225 HashMap::Entry* map_entry =
226 children_.Lookup(entry, CodeEntryHash(entry), true);
229 ProfileNode* new_node = new ProfileNode(tree_, entry);
257 for (HashMap::Entry* p = children_.Start();
296 for (CodeEntry** entry = path.start() + path.length() - 1;
297 entry != path.start() - 1;
298 --entry) {
299 if (*entry != NULL) {
300 node = node->FindOrAddChild(*entry);
309 for (CodeEntry** entry = path.start();
310 entry != path.start() + path.length();
311 ++entry) {
312 if (*entry != NULL) {
313 node = node->FindOrAddChild(*entry);
337 if (IsTokenAcceptable(child->entry()->security_token_id(),
338 parent->entry()->security_token_id())) {
339 ProfileNode* clone = stack_.last().dst->FindOrAddChild(child->entry());
501 void CodeMap::AddCode(Address addr, CodeEntry* entry, unsigned size) {
505 locator.set_value(CodeEntryInfo(entry, size));
526 // locator.key() <= addr. Need to check that addr is within entry.
527 const CodeEntryInfo& entry = locator.value();
528 if (addr < (locator.key() + entry.size))
529 return entry.entry;
539 const CodeEntryInfo& entry = locator.value();
540 ASSERT(entry.entry == kSharedFunctionCodeEntry);
541 return entry.size;
555 CodeEntryInfo entry = locator.value();
557 AddCode(to, entry.entry, entry.size);
563 entry->name());
650 HashMap::Entry* entry =
654 ASSERT(entry->value == NULL);
655 entry->value = reinterpret_cast<void*>(unabridged_list->length() - 1);
681 HashMap::Entry* entry = profiles_uids_.Lookup(reinterpret_cast<void*>(uid),
684 return entry != NULL ?
685 static_cast<int>(reinterpret_cast<intptr_t>(entry->value)) : -1;
709 for (HashMap::Entry* p = profiles_uids_.Start();
776 CodeEntry* entry = new CodeEntry(tag,
782 code_entries_.Add(entry);
783 return entry;
789 CodeEntry* entry = new CodeEntry(tag,
795 code_entries_.Add(entry);
796 return entry;
803 CodeEntry* entry = new CodeEntry(tag,
809 code_entries_.Add(entry);
810 return entry;
816 CodeEntry* entry = new CodeEntry(tag,
822 code_entries_.Add(entry);
823 return entry;
886 CodeEntry** entry = entries.start();
887 memset(entry, 0, entries.length() * sizeof(*entry));
889 *entry++ = code_map_.FindEntry(sample.pc);
896 *entry++ = code_map_.FindEntry(sample.external_callback);
900 *entry = code_map_.FindEntry(sample.tos);
901 if (*entry != NULL && !(*entry)->is_js_function()) {
902 *entry = NULL;
904 entry++;
911 *entry++ = code_map_.FindEntry(*stack_pos);
917 for (CodeEntry** e = entries.start(); e != entry; ++e) {
923 // If no frames were symbolized, put the VM state entry in.
925 *entry++ = EntryForVMState(sample.state);
988 HeapEntry* entry,
990 children()[child_index].Init(child_index, type, name, entry);
991 entry->retainers()[retainer_index] = children_arr() + child_index;
998 HeapEntry* entry,
1000 children()[child_index].Init(child_index, type, index, entry);
1001 entry->retainers()[retainer_index] = children_arr() + child_index;
1006 int child_index, int index, HeapEntry* entry) {
1007 children()[child_index].Init(child_index, index, entry);
1224 HeapEntry* entry = GetNextEntryToInit();
1225 entry->Init(this, type, name, id, size, children_count, retainers_count);
1226 return entry;
1232 HeapEntry* entry = entries_[i];
1233 if (entry->dominator() == NULL) entry->set_dominator(entry);
1338 HashMap::Entry* entry = entries_map_.Lookup(from, AddressHash(from), false);
1339 if (entry != NULL) {
1340 void* value = entry->value;
1343 entry = entries_map_.Lookup(to, AddressHash(to), true);
1344 // We can have an entry at the new location, it is OK, as GC can overwrite
1346 entry->value = value;
1353 HashMap::Entry* entry = entries_map_.Lookup(addr, AddressHash(addr), true);
1354 ASSERT(entry->value == NULL);
1355 entry->value = reinterpret_cast<void*>(entries_->length());
1361 HashMap::Entry* entry = entries_map_.Lookup(addr, AddressHash(addr), false);
1362 if (entry != NULL) {
1364 static_cast<int>(reinterpret_cast<intptr_t>(entry->value));
1377 for (HashMap::Entry* entry = entries_map_.Start();
1378 entry != NULL;
1379 entry = entries_map_.Next(entry)) {
1381 static_cast<int>(reinterpret_cast<intptr_t>(entry->value));
1384 entry->value = reinterpret_cast<void*>(new_entries->length());
1387 dead_entries.Add(entry->key);
1445 HashMap::Entry* entry =
1449 ASSERT(entry->value == NULL);
1450 entry->value = snapshot;
1456 HashMap::Entry* entry = snapshots_uids_.Lookup(reinterpret_cast<void*>(uid),
1459 return entry != NULL ? reinterpret_cast<HeapSnapshot*>(entry->value) : NULL;
1505 for (HashMap::Entry* p = entries_.Start(); p != NULL; p = entries_.Next(p)) {
1512 for (HashMap::Entry* p = entries_.Start();
1516 entry_info->entry = entry_info->allocator->AllocateEntry(
1520 ASSERT(entry_info->entry != NULL);
1521 ASSERT(entry_info->entry != kHeapEntryPlaceholder);
1529 HashMap::Entry* cache_entry = entries_.Lookup(thing, Hash(thing), false);
1532 return entry_info->entry;
1540 HeapThing thing, HeapEntriesAllocator* allocator, HeapEntry* entry) {
1541 HashMap::Entry* cache_entry = entries_.Lookup(thing, Hash(thing), true);
1543 cache_entry->value = new EntryInfo(entry, allocator);
1551 HashMap::Entry* from_cache_entry = entries_.Lookup(from, Hash(from), false);
1552 HashMap::Entry* to_cache_entry = entries_.Lookup(to, Hash(to), false);
1583 HashMap::Entry
1592 HashMap::Entry* cache_entry =
1602 HashMap::Entry* cache_entry =
1616 HashMap::Entry* cache_entry =
1877 HeapEntry* entry = GetEntry(obj);
1878 if (entry == NULL) return; // No interest in this object.
1889 ExtractClosureReferences(js_obj, entry);
1890 ExtractPropertyReferences(js_obj, entry);
1891 ExtractElementReferences(js_obj, entry);
1892 ExtractInternalReferences(js_obj, entry);
1894 obj, entry, heap_->Proto_symbol(), js_obj->GetPrototype());
1901 obj, entry,
1907 obj, entry,
1916 SetInternalReference(js_fun, entry,
1920 SetInternalReference(js_fun, entry,
1924 SetInternalReference(js_fun, entry,
1930 SetWeakReference(js_fun, entry, i, *HeapObject::RawField(js_fun, i), i);
1934 SetInternalReference(obj, entry,
1938 SetInternalReference(obj, entry,
1944 SetInternalReference(obj, entry, 1, cs->first());
1945 SetInternalReference(obj, entry, 2, cs->second());
1949 SetInternalReference(obj, entry, "parent", ss->parent());
1962 SetWeakReference(obj, entry,
1968 SetInternalReference(obj, entry,
1970 SetInternalReference(obj, entry,
1975 SetInternalReference(obj, entry,
1982 entry,
1987 SetInternalReference(obj, entry,
1992 SetInternalReference(obj, entry,
1995 SetInternalReference(obj, entry,
1999 SetInternalReference(obj, entry,
2002 SetInternalReference(obj, entry,
2005 SetInternalReference(obj, entry,
2008 SetWeakReference(obj, entry,
2013 SetInternalReference(obj, entry,
2016 SetInternalReference(obj, entry,
2019 SetInternalReference(obj, entry,
2022 SetInternalReference(obj, entry,
2026 SetInternalReference(obj, entry,
2032 SetInternalReference(obj, entry,
2036 SetInternalReference(obj, entry,
2045 SetInternalReference(obj, entry, "map", obj->map(), HeapObject::kMapOffset);
2046 IndexedReferencesExtractor refs_extractor(this, obj, entry);
2053 HeapEntry* entry) {
2062 SetNativeBindReference(js_obj, entry, "bound_this",
2064 SetNativeBindReference(js_obj, entry, "bound_function",
2071 SetNativeBindReference(js_obj, entry, reference_name,
2080 SetClosureReference(js_obj, entry, local_name, context->get(idx));
2091 SetClosureReference(js_obj, entry, name, context->get(idx));
2098 HeapEntry* entry) {
2107 js_obj, entry,
2113 js_obj, entry,
2120 js_obj, entry,
2128 SetPropertyReference(js_obj, entry, descs->GetKey(i),
2132 SetPropertyReference(js_obj, entry, descs->GetKey(i),
2156 js_obj, entry, String::cast(k), target);
2160 entry,
2172 HeapEntry* entry) {
2180 SetElementReference(js_obj, entry, i, elements->get(i));
2191 SetElementReference(js_obj, entry, index, dictionary->ValueAt(i));
2199 HeapEntry* entry) {
2204 js_obj, entry, i, o, js_obj->GetInternalFieldOffset(i));
2704 for (HashMap::Entry* p = objects_by_info_.Start();
2714 for (HashMap::Entry* p = native_groups_.Start();
2783 HashMap::Entry* entry =
2785 if (entry->value != NULL) {
2788 entry->value = new List<HeapObject*>(4);
2790 return reinterpret_cast<List<HeapObject*>* >(entry->value);
2800 for (HashMap::Entry* p = objects_by_info_.Start();
2852 HashMap::Entry* entry = native_groups_.Lookup(const_cast<char*>(label_copy),
2854 if (entry->value == NULL)
2855 entry->value = new NativeGroupRetainedObjectInfo(label);
2856 return static_cast<NativeGroupRetainedObjectInfo*>(entry->value);
2894 for (HashMap::Entry* entry = native_groups_.Start();
2895 entry;
2896 entry = native_groups_.Next(entry)) {
2898 static_cast<NativeGroupRetainedObjectInfo*>(entry->value);
2931 HeapEntry* entry = FindEntry(ptr);
2932 return entry != NULL ? entry : AddEntry(ptr, allocator);
2984 HeapEntry* entry = FindEntry(ptr);
2985 return entry != NULL ? entry : AddEntry(ptr, allocator);
3174 HeapEntry* entry = nodes_to_visit.last();
3175 Vector<HeapGraphEdge> children = entry->children();
3187 entry->set_ordered_index(current_entry);
3188 (*entries)[current_entry++] = entry;
3235 // If dominator of the entry has already been set to root,
3287 HeapEntry* entry = entries[i];
3288 entry->set_retained_size(entry->self_size());
3291 HeapEntry* entry = entries[i];
3292 int entry_size = entry->self_size();
3293 for (HeapEntry* dominator = entry->dominator();
3294 dominator != entry;
3295 entry = dominator, dominator = entry->dominator()) {
3472 void Apply(HeapEntry** entry) {
3473 s_->GetNodeId(*entry);
3486 int HeapSnapshotJSONSerializer::GetNodeId(HeapEntry* entry) {
3487 HashMap::Entry* cache_entry = nodes_.Lookup(entry, ObjectHash(entry), true);
3496 HashMap::Entry* cache_entry = strings_.Lookup(
3525 void HeapSnapshotJSONSerializer::SerializeNode(HeapEntry* entry) {
3532 Vector<HeapGraphEdge> children = entry->children();
3533 STATIC_CHECK(sizeof(int) == sizeof(entry->type())); // NOLINT
3534 STATIC_CHECK(sizeof(int) == sizeof(GetStringId(entry->name()))); // NOLINT
3535 STATIC_CHECK(sizeof(unsigned) == sizeof(entry->id())); // NOLINT
3536 STATIC_CHECK(sizeof(int) == sizeof(entry->self_size())); // NOLINT
3537 STATIC_CHECK(sizeof(int) == sizeof(entry->retained_size())); // NOLINT
3538 STATIC_CHECK(sizeof(int) == sizeof(GetNodeId(entry->dominator()))); // NOLINT
3541 entry->type(),
3542 GetStringId(entry->name()),
3543 entry->id(),
3544 entry->self_size(),
3545 entry->retained_size(),
3546 GetNodeId(entry->dominator()),
3616 List<HashMap::Entry*> sorted_nodes;
3707 List<HashMap::Entry*> sorted_strings;
3734 HashMap* map, List<HashMap::Entry*>* sorted_entries) {
3735 for (HashMap::Entry* p = map->Start(); p != NULL; p = map->Next(p))
