lookup-cache.h 1.51 KB
Newer Older
1 2 3 4
// 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.

5 6
#ifndef V8_OBJECTS_LOOKUP_CACHE_H_
#define V8_OBJECTS_LOOKUP_CACHE_H_
7

8
#include "src/objects/map.h"
9
#include "src/objects/name.h"
10
#include "src/objects/objects.h"
11 12 13 14 15 16 17 18 19 20

namespace v8 {
namespace internal {

// Cache for mapping (map, property name) into descriptor index.
// The cache contains both positive and negative results.
// Descriptor index equals kNotFound means the property is absent.
// Cleared at startup and prior to any gc.
class DescriptorLookupCache {
 public:
21 22
  DescriptorLookupCache(const DescriptorLookupCache&) = delete;
  DescriptorLookupCache& operator=(const DescriptorLookupCache&) = delete;
23 24
  // Lookup descriptor index for (map, name).
  // If absent, kAbsent is returned.
25
  inline int Lookup(Map source, Name name);
26 27

  // Update an element in the cache.
28
  inline void Update(Map source, Name name, int result);
29 30 31 32 33 34 35 36 37

  // Clear the cache.
  void Clear();

  static const int kAbsent = -2;

 private:
  DescriptorLookupCache() {
    for (int i = 0; i < kLength; ++i) {
38
      keys_[i].source = Map();
39
      keys_[i].name = Name();
40 41 42 43
      results_[i] = kAbsent;
    }
  }

44
  static inline int Hash(Map source, Name name);
45 46 47

  static const int kLength = 64;
  struct Key {
48
    Map source;
49
    Name name;
50 51 52 53 54 55 56 57 58 59 60
  };

  Key keys_[kLength];
  int results_[kLength];

  friend class Isolate;
};

}  // namespace internal
}  // namespace v8

61
#endif  // V8_OBJECTS_LOOKUP_CACHE_H_