entries_         1148 src/profile-generator.cc   ASSERT(entries_.is_empty());  // Root entry must be the first one.
entries_         1188 src/profile-generator.cc   entries_.Add(entry);
entries_         1189 src/profile-generator.cc   return &entries_.last();
entries_         1242 src/profile-generator.cc     sorted_entries_.Allocate(entries_.length());
entries_         1243 src/profile-generator.cc     for (int i = 0; i < entries_.length(); ++i) {
entries_         1244 src/profile-generator.cc       sorted_entries_[i] = &entries_[i];
entries_         1268 src/profile-generator.cc       GetMemoryUsedByList(entries_) +
entries_         1296 src/profile-generator.cc   entries_.Add(EntryInfo(0, NULL, 0));
entries_         1313 src/profile-generator.cc   entries_.at(from_entry_info_index).addr = to;
entries_         1322 src/profile-generator.cc     entries_.at(to_entry_info_index).addr = NULL;
entries_         1332 src/profile-generator.cc   EntryInfo& entry_info = entries_.at(entry_index);
entries_         1333 src/profile-generator.cc   ASSERT(static_cast<uint32_t>(entries_.length()) > entries_map_.occupancy());
entries_         1340 src/profile-generator.cc   ASSERT(static_cast<uint32_t>(entries_.length()) > entries_map_.occupancy());
entries_         1345 src/profile-generator.cc     EntryInfo& entry_info = entries_.at(entry_index);
entries_         1350 src/profile-generator.cc   entry->value = reinterpret_cast<void*>(entries_.length());
entries_         1353 src/profile-generator.cc   entries_.Add(EntryInfo(id, addr, size));
entries_         1354 src/profile-generator.cc   ASSERT(static_cast<uint32_t>(entries_.length()) > entries_map_.occupancy());
entries_         1381 src/profile-generator.cc   ASSERT(!entries_.is_empty());
entries_         1382 src/profile-generator.cc   EntryInfo* entry_info = &entries_.first();
entries_         1383 src/profile-generator.cc   EntryInfo* end_entry_info = &entries_.last() + 1;
entries_         1423 src/profile-generator.cc   ASSERT(entries_.length() > 0 &&
entries_         1424 src/profile-generator.cc          entries_.at(0).id == 0 &&
entries_         1425 src/profile-generator.cc          entries_.at(0).addr == NULL);
entries_         1427 src/profile-generator.cc   for (int i = 1; i < entries_.length(); ++i) {
entries_         1428 src/profile-generator.cc     EntryInfo& entry_info = entries_.at(i);
entries_         1431 src/profile-generator.cc         entries_.at(first_free_entry) = entry_info;
entries_         1433 src/profile-generator.cc       entries_.at(first_free_entry).accessed = false;
entries_         1445 src/profile-generator.cc   entries_.Rewind(first_free_entry);
entries_         1446 src/profile-generator.cc   ASSERT(static_cast<uint32_t>(entries_.length()) - 1 ==
entries_         1469 src/profile-generator.cc       GetMemoryUsedByList(entries_) +
entries_         1575 src/profile-generator.cc   HashMap::Entry* cache_entry = entries_.Lookup(thing, Hash(thing), false);
entries_         1582 src/profile-generator.cc   HashMap::Entry* cache_entry = entries_.Lookup(thing, Hash(thing), true);
entries_         1594 src/profile-generator.cc   entries_.Clear();
entries_         1601 src/profile-generator.cc   return entries_.Lookup(object, HeapEntriesMap::Hash(object), false) != NULL;
entries_         1608 src/profile-generator.cc   entries_.Lookup(object, HeapEntriesMap::Hash(object), true);
entries_         1615 src/profile-generator.cc       entries_.Lookup(object, HeapEntriesMap::Hash(object), false);
entries_         1626 src/profile-generator.cc       entries_.Lookup(object, HeapEntriesMap::Hash(object), true);
entries_         3015 src/profile-generator.cc     entries_->Pair(ptr, entry->index());
entries_         3019 src/profile-generator.cc     int index = entries_->Map(ptr);
entries_         3061 src/profile-generator.cc   HeapEntriesMap* entries_;
entries_         3150 src/profile-generator.cc   SnapshotFiller filler(snapshot_, &entries_);
entries_          590 src/profile-generator.h   HeapEntry* root() { return &entries_[root_index_]; }
entries_          591 src/profile-generator.h   HeapEntry* gc_roots() { return &entries_[gc_roots_index_]; }
entries_          592 src/profile-generator.h   HeapEntry* natives_root() { return &entries_[natives_root_index_]; }
entries_          594 src/profile-generator.h     return &entries_[gc_subroot_indexes_[index]];
entries_          596 src/profile-generator.h   List<HeapEntry>& entries() { return entries_; }
entries_          628 src/profile-generator.h   List<HeapEntry> entries_;
entries_          699 src/profile-generator.h   List<EntryInfo> entries_;
entries_          791 src/profile-generator.h   HashMap entries_;
entries_          807 src/profile-generator.h   bool is_empty() const { return entries_.occupancy() == 0; }
entries_          810 src/profile-generator.h   HashMap entries_;
entries_         1042 src/profile-generator.h   HeapEntriesMap entries_;
entries_           68 src/safepoint-table.cc   entries_ = pc_and_deoptimization_indexes_ +
entries_          122 src/safepoint-table.h     uint8_t* bits = &Memory::uint8_at(entries_ + (index * entry_size_));
entries_          160 src/safepoint-table.h   Address entries_;
entries_           36 src/unicode-inl.h   CacheEntry entry = entries_[code_point & kMask];
entries_           44 src/unicode-inl.h   entries_[code_point & kMask] = CacheEntry(code_point, result);
entries_           50 src/unicode-inl.h   CacheEntry entry = entries_[c & kMask];
entries_           69 src/unicode-inl.h       entries_[c & kMask] = CacheEntry(c, result[0] - c);
entries_           72 src/unicode-inl.h       entries_[c & kMask] = CacheEntry(c, 0);
entries_           67 src/unicode.h    CacheEntry entries_[kSize];
entries_           93 src/unicode.h    CacheEntry entries_[kSize];