%PDF- <> %âãÏÓ endobj 2 0 obj <> endobj 3 0 obj <>/ExtGState<>/ProcSet[/PDF/Text/ImageB/ImageC/ImageI] >>/Annots[ 28 0 R 29 0 R] /MediaBox[ 0 0 595.5 842.25] /Contents 4 0 R/Group<>/Tabs/S>> endobj ºaâÚÎΞ-ÌE1ÍØÄ÷{òò2ÿ ÛÖ^ÔÀá TÎ{¦?§®¥kuµùÕ5sLOšuY>endobj 2 0 obj<>endobj 2 0 obj<>endobj 2 0 obj<>endobj 2 0 obj<> endobj 2 0 obj<>endobj 2 0 obj<>es 3 0 R>> endobj 2 0 obj<> ox[ 0.000000 0.000000 609.600000 935.600000]/Fi endobj 3 0 obj<> endobj 7 1 obj<>/ProcSet[/PDF/Text/ImageB/ImageC/ImageI]>>/Subtype/Form>> stream
// Copyright 2016 the V8 project authors. All rights reserved. // Use of this source code is governed by a BSD-style license that can be // found in the LICENSE file. #ifndef V8_OBJECTS_LOOKUP_CACHE_INL_H_ #define V8_OBJECTS_LOOKUP_CACHE_INL_H_ #include "src/objects/lookup-cache.h" #include "src/objects/map.h" #include "src/objects/name-inl.h" namespace v8 { namespace internal { // static int DescriptorLookupCache::Hash(Map source, Name name) { DCHECK(name.IsUniqueName()); // Uses only lower 32 bits if pointers are larger. uint32_t source_hash = static_cast<uint32_t>(source.ptr()) >> kTaggedSizeLog2; uint32_t name_hash = name.hash(); return (source_hash ^ name_hash) % kLength; } int DescriptorLookupCache::Lookup(Map source, Name name) { int index = Hash(source, name); Key& key = keys_[index]; if ((key.source == source) && (key.name == name)) return results_[index]; return kAbsent; } void DescriptorLookupCache::Update(Map source, Name name, int result) { DCHECK_NE(result, kAbsent); int index = Hash(source, name); Key& key = keys_[index]; key.source = source; key.name = name; results_[index] = result; } } // namespace internal } // namespace v8 #endif // V8_OBJECTS_LOOKUP_CACHE_INL_H_