blob: ab6a97f3c0e8876b06ebe58b1610aab09fdf6f88 (
plain)
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
|
// 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/objects-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_
|
