Key 311 src/hashmap.h template<class Key, class Value, class AllocationPolicy>
Key 314 src/hashmap.h STATIC_ASSERT(sizeof(Key*) == sizeof(void*)); // NOLINT
Key 317 src/hashmap.h Key* first;
Key 352 src/hashmap.h Iterator find(Key* key, bool insert = false,
Key 6996 src/heap.cc Key& key = keys_[index + i];
Key 7012 src/heap.cc Key& key = keys_[index];
Key 7024 src/heap.cc Key& key = keys_[index + i];
Key 7025 src/heap.cc Key& key2 = keys_[index + i - 1];
Key 7031 src/heap.cc Key& key = keys_[index];
Key 2297 src/heap.h Key keys_[kLength];
Key 2317 src/heap.h Key& key = keys_[index];
Key 2327 src/heap.h Key& key = keys_[index];
Key 2363 src/heap.h Key keys_[kLength];
Key 3281 src/hydrogen.cc Key()->IndexBase(),
Key 3295 src/hydrogen.cc Key()->IndexBase(),
Key 3472 src/hydrogen.cc table->Insert(data->Key(), data->FatherInDominatorTree(), zone());
Key 3474 src/hydrogen.cc table->Delete(data->Key());
Key 2147 src/objects-inl.h template<typename Shape, typename Key>
Key 2148 src/objects-inl.h int HashTable<Shape, Key>::ComputeCapacity(int at_least_space_for) {
Key 2158 src/objects-inl.h template<typename Shape, typename Key>
Key 2159 src/objects-inl.h int HashTable<Shape, Key>::FindEntry(Key key) {
Key 2165 src/objects-inl.h template<typename Shape, typename Key>
Key 2166 src/objects-inl.h int HashTable<Shape, Key>::FindEntry(Isolate* isolate, Key key) {
Key 2168 src/objects-inl.h uint32_t entry = FirstProbe(HashTable<Shape, Key>::Hash(key), capacity);
Key 2273 src/objects-inl.h template <typename Shape, typename Key>
Key 2274 src/objects-inl.h HashTable<Shape, Key>* HashTable<Shape, Key>::cast(Object* obj) {
Key 5000 src/objects-inl.h template<typename Shape, typename Key>
Key 5001 src/objects-inl.h void Dictionary<Shape, Key>::SetEntry(int entry,
Key 5008 src/objects-inl.h template<typename Shape, typename Key>
Key 5009 src/objects-inl.h void Dictionary<Shape, Key>::SetEntry(int entry,
Key 5014 src/objects-inl.h int index = HashTable<Shape, Key>::EntryToIndex(entry);
Key 10064 src/objects.cc void Dictionary<Shape, Key>::Print(FILE* out) {
Key 10065 src/objects.cc int capacity = HashTable<Shape, Key>::Capacity();
Key 10067 src/objects.cc Object* k = HashTable<Shape, Key>::KeyAt(i);
Key 10068 src/objects.cc if (HashTable<Shape, Key>::IsKey(k)) {
Key 10085 src/objects.cc void Dictionary<Shape, Key>::CopyValuesTo(FixedArray* elements) {
Key 10087 src/objects.cc int capacity = HashTable<Shape, Key>::Capacity();
Key 10091 src/objects.cc Object* k = Dictionary<Shape, Key>::KeyAt(i);
Key 10092 src/objects.cc if (Dictionary<Shape, Key>::IsKey(k)) {
Key 10973 src/objects.cc void HashTable<Shape, Key>::IteratePrefix(ObjectVisitor* v) {
Key 10979 src/objects.cc void HashTable<Shape, Key>::IterateElements(ObjectVisitor* v) {
Key 10987 src/objects.cc MaybeObject* HashTable<Shape, Key>::Allocate(int at_least_space_for,
Key 11047 src/objects.cc MaybeObject* HashTable<Shape, Key>::Rehash(HashTable* new_table, Key key) {
Key 11066 src/objects.cc uint32_t hash = HashTable<Shape, Key>::HashForObject(key, k);
Key 11081 src/objects.cc MaybeObject* HashTable<Shape, Key>::EnsureCapacity(int n, Key key) {
Key 11107 src/objects.cc MaybeObject* HashTable<Shape, Key>::Shrink(Key key) {
Key 11136 src/objects.cc uint32_t HashTable<Shape, Key>::FindInsertionEntry(uint32_t hash) {
Key 12044 src/objects.cc MaybeObject* Dictionary<Shape, Key>::Allocate(int at_least_space_for) {
Key 12047 src/objects.cc HashTable<Shape, Key>::Allocate(at_least_space_for);
Key 12051 src/objects.cc Dictionary<Shape, Key>::cast(obj)->
Key 12058 src/objects.cc MaybeObject* Dictionary<Shape, Key>::GenerateNewEnumerationIndices() {
Key 12059 src/objects.cc Heap* heap = Dictionary<Shape, Key>::GetHeap();
Key 12060 src/objects.cc int length = HashTable<Shape, Key>::NumberOfElements();
Key 12079 src/objects.cc int capacity = HashTable<Shape, Key>::Capacity();
Key 12082 src/objects.cc if (Dictionary<Shape, Key>::IsKey(Dictionary<Shape, Key>::KeyAt(i))) {
Key 12098 src/objects.cc capacity = HashTable<Shape, Key>::Capacity();
Key 12101 src/objects.cc if (Dictionary<Shape, Key>::IsKey(Dictionary<Shape, Key>::KeyAt(i))) {
Key 12116 src/objects.cc MaybeObject* Dictionary<Shape, Key>::EnsureCapacity(int n, Key key) {
Key 12126 src/objects.cc return HashTable<Shape, Key>::EnsureCapacity(n, key);
Key 12131 src/objects.cc Object* Dictionary<Shape, Key>::DeleteProperty(int entry,
Key 12133 src/objects.cc Heap* heap = Dictionary<Shape, Key>::GetHeap();
Key 12140 src/objects.cc HashTable<Shape, Key>::ElementRemoved();
Key 12146 src/objects.cc MaybeObject* Dictionary<Shape, Key>::Shrink(Key key) {
Key 12147 src/objects.cc return HashTable<Shape, Key>::Shrink(key);
Key 12152 src/objects.cc MaybeObject* Dictionary<Shape, Key>::AtPut(Key key, Object* value) {
Key 12156 src/objects.cc if (entry != Dictionary<Shape, Key>::kNotFound) {
Key 12173 src/objects.cc return Dictionary<Shape, Key>::cast(obj)->AddEntry(key, value, details,
Key 12174 src/objects.cc Dictionary<Shape, Key>::Hash(key));
Key 12179 src/objects.cc MaybeObject* Dictionary<Shape, Key>::Add(Key key,
Key 12183 src/objects.cc SLOW_ASSERT((this->FindEntry(key) == Dictionary<Shape, Key>::kNotFound));
Key 12190 src/objects.cc return Dictionary<Shape, Key>::cast(obj)->AddEntry(key, value, details,
Key 12191 src/objects.cc Dictionary<Shape, Key>::Hash(key));
Key 12197 src/objects.cc MaybeObject* Dictionary<Shape, Key>::AddEntry(Key key,
Key 12207 src/objects.cc uint32_t entry = Dictionary<Shape, Key>::FindInsertionEntry(hash);
Key 12217 src/objects.cc ASSERT((Dictionary<Shape, Key>::KeyAt(entry)->IsNumber()
Key 12218 src/objects.cc || Dictionary<Shape, Key>::KeyAt(entry)->IsString()));
Key 12219 src/objects.cc HashTable<Shape, Key>::ElementAdded();
Key 12323 src/objects.cc int Dictionary<Shape, Key>::NumberOfElementsFilterAttributes(
Key 12325 src/objects.cc int capacity = HashTable<Shape, Key>::Capacity();
Key 12328 src/objects.cc Object* k = HashTable<Shape, Key>::KeyAt(i);
Key 12329 src/objects.cc if (HashTable<Shape, Key>::IsKey(k)) {
Key 12341 src/objects.cc int Dictionary<Shape, Key>::NumberOfEnumElements() {
Key 12348 src/objects.cc void Dictionary<Shape, Key>::CopyKeysTo(
Key 12353 src/objects.cc int capacity = HashTable<Shape, Key>::Capacity();
Key 12356 src/objects.cc Object* k = HashTable<Shape, Key>::KeyAt(i);
Key 12357 src/objects.cc if (HashTable<Shape, Key>::IsKey(k)) {
Key 12364 src/objects.cc if (sort_mode == Dictionary<Shape, Key>::SORTED) {
Key 12392 src/objects.cc void Dictionary<Shape, Key>::CopyKeysTo(
Key 12398 src/objects.cc int capacity = HashTable<Shape, Key>::Capacity();
Key 12400 src/objects.cc Object* k = HashTable<Shape, Key>::KeyAt(i);
Key 12401 src/objects.cc if (HashTable<Shape, Key>::IsKey(k)) {
Key 12407 src/objects.cc if (sort_mode == Dictionary<Shape, Key>::SORTED) {
Key 12416 src/objects.cc Object* Dictionary<Shape, Key>::SlowReverseLookup(Object* value) {
Key 12417 src/objects.cc int capacity = HashTable<Shape, Key>::Capacity();
Key 12419 src/objects.cc Object* k = HashTable<Shape, Key>::KeyAt(i);
Key 12420 src/objects.cc if (Dictionary<Shape, Key>::IsKey(k)) {
Key 12428 src/objects.cc Heap* heap = Dictionary<Shape, Key>::GetHeap();
Key 2757 src/objects.h template<typename Key>
Key 2761 src/objects.h static uint32_t Hash(Key key) { return 0; }
Key 2762 src/objects.h static uint32_t SeededHash(Key key, uint32_t seed) {
Key 2766 src/objects.h static uint32_t HashForObject(Key key, Object* object) { return 0; }
Key 2767 src/objects.h static uint32_t SeededHashForObject(Key key, uint32_t seed, Object* object) {
Key 2773 src/objects.h template<typename Shape, typename Key>
Key 2777 src/objects.h inline uint32_t Hash(Key key) {
Key 2786 src/objects.h inline uint32_t HashForObject(Key key, Object* object) {
Key 2877 src/objects.h inline int FindEntry(Key key);
Key 2878 src/objects.h int FindEntry(Isolate* isolate, Key key);
Key 2926 src/objects.h MUST_USE_RESULT MaybeObject* Rehash(HashTable* new_table, Key key);
Key 2929 src/objects.h MUST_USE_RESULT MaybeObject* Shrink(Key key);
Key 2932 src/objects.h MUST_USE_RESULT MaybeObject* EnsureCapacity(int n, Key key);
Key 3050 src/objects.h template <typename Shape, typename Key>
Key 3051 src/objects.h class Dictionary: public HashTable<Shape, Key> {
Key 3053 src/objects.h static inline Dictionary<Shape, Key>* cast(Object* obj) {
Key 3054 src/objects.h return reinterpret_cast<Dictionary<Shape, Key>*>(obj);
Key 3059 src/objects.h return this->get(HashTable<Shape, Key>::EntryToIndex(entry) + 1);
Key 3064 src/objects.h this->set(HashTable<Shape, Key>::EntryToIndex(entry) + 1, value);
Key 3071 src/objects.h Smi::cast(this->get(HashTable<Shape, Key>::EntryToIndex(entry) + 2)));
Key 3076 src/objects.h this->set(HashTable<Shape, Key>::EntryToIndex(entry) + 2, value.AsSmi());
Key 3086 src/objects.h MUST_USE_RESULT MaybeObject* Shrink(Key key);
Key 3117 src/objects.h MUST_USE_RESULT MaybeObject* EnsureCapacity(int n, Key key);
Key 3137 src/objects.h MUST_USE_RESULT MaybeObject* Add(Key key,
Key 3143 src/objects.h MUST_USE_RESULT MaybeObject* AtPut(Key key, Object* value);
Key 3146 src/objects.h MUST_USE_RESULT MaybeObject* AddEntry(Key key,
Key 3154 src/objects.h HashTable<Shape, Key>::kPrefixStartIndex;
Key 125 src/preparse-data.cc Key key = { is_ascii, literal_bytes };
Key 135 src/preparse-data.cc Vector<Key> symbol = symbol_keys_.AddBlock(1, key);
Key 209 src/preparse-data.h Key* string1 = reinterpret_cast<Key*>(a);
Key 210 src/preparse-data.h Key* string2 = reinterpret_cast<Key*>(b);
Key 223 src/preparse-data.h Collector<Key> symbol_keys_;
Key 508 src/profile-generator.cc const CodeMap::CodeTreeConfig::Key CodeMap::CodeTreeConfig::kNoKey = NULL;
Key 262 src/profile-generator.h static const Key kNoKey;
Key 264 src/profile-generator.h static int Compare(const Key& a, const Key& b) {
Key 403 src/scopeinfo.cc Key& key = keys_[index];
Key 423 src/scopeinfo.cc Key& key = keys_[index];
Key 450 src/scopeinfo.cc Key& key = keys_[index];
Key 125 src/scopeinfo.h Key keys_[kLength];
Key 416 src/serialize.h return serialization_map_->Lookup(Key(obj), Hash(obj), false) != NULL;
Key 422 src/serialize.h serialization_map_->Lookup(Key(obj), Hash(obj), false)->value));
Key 428 src/serialize.h serialization_map_->Lookup(Key(obj), Hash(obj), true);
Key 441 src/serialize.h static void* Key(HeapObject* obj) {
Key 45 src/splay-tree-inl.h bool SplayTree<Config, Allocator>::Insert(const Key& key,
Key 85 src/splay-tree-inl.h bool SplayTree<Config, Allocator>::FindInternal(const Key& key) {
Key 94 src/splay-tree-inl.h bool SplayTree<Config, Allocator>::Find(const Key& key, Locator* locator) {
Key 105 src/splay-tree-inl.h bool SplayTree<Config, Allocator>::FindGreatestLessThan(const Key& key,
Key 129 src/splay-tree-inl.h bool SplayTree<Config, Allocator>::FindLeastGreaterThan(const Key& key,
Key 177 src/splay-tree-inl.h bool SplayTree<Config, Allocator>::Move(const Key& old_key,
Key 178 src/splay-tree-inl.h const Key& new_key) {
Key 197 src/splay-tree-inl.h bool SplayTree<Config, Allocator>::Remove(const Key& key) {
Key 208 src/splay-tree-inl.h void SplayTree<Config, Allocator>::RemoveRootNode(const Key& key) {
Key 227 src/splay-tree-inl.h void SplayTree<Config, Allocator>::Splay(const Key& key) {
Key 80 src/splay-tree.h bool Insert(const Key& key, Locator* locator);
Key 85 src/splay-tree.h bool Find(const Key& key, Locator* locator);
Key 89 src/splay-tree.h bool FindGreatestLessThan(const Key& key, Locator* locator);
Key 96 src/splay-tree.h bool FindLeastGreaterThan(const Key& key, Locator* locator);
Key 102 src/splay-tree.h bool Move(const Key& old_key, const Key& new_key);
Key 105 src/splay-tree.h bool Remove(const Key& key);
Key 113 src/splay-tree.h void Splay(const Key& key);
Key 117 src/splay-tree.h Node(const Key& key, const Value& value)
Key 135 src/splay-tree.h Key key() { return key_; }
Key 143 src/splay-tree.h Key key_;
Key 155 src/splay-tree.h const Key& key() { return node_->key_; }
Key 174 src/splay-tree.h bool FindInternal(const Key& key);
Key 180 src/splay-tree.h void RemoveRootNode(const Key& key);