1 // Copyright 2014 the V8 project authors. All rights reserved.
2 // Use of this source code is governed by a BSD-style license that can be
3 // found in the LICENSE file.
5 #ifndef V8_COMPILER_NODE_CACHE_H_
6 #define V8_COMPILER_NODE_CACHE_H_
8 #include "src/base/functional.h"
9 #include "src/base/macros.h"
10 #include "src/compiler/node.h"
16 // A cache for nodes based on a key. Useful for implementing canonicalization of
17 // nodes such as constants, parameters, etc.
18 template <typename Key, typename Hash = base::hash<Key>,
19 typename Pred = std::equal_to<Key> >
20 class NodeCache FINAL {
22 explicit NodeCache(size_t max = 256)
23 : entries_(nullptr), size_(0), max_(max) {}
25 // Search for node associated with {key} and return a pointer to a memory
26 // location in this cache that stores an entry for the key. If the location
27 // returned by this method contains a non-NULL node, the caller can use that
28 // node. Otherwise it is the responsibility of the caller to fill the entry
30 // Note that a previous cache entry may be overwritten if the cache becomes
31 // too full or encounters too many hash collisions.
32 Node** Find(Zone* zone, Key key);
34 void GetCachedNodes(NodeVector* nodes);
37 enum { kInitialSize = 16u, kLinearProbe = 5u };
41 Entry* entries_; // lazily-allocated hash entries.
47 bool Resize(Zone* zone);
50 // Various default cache types.
51 typedef NodeCache<int64_t> Int64NodeCache;
52 typedef NodeCache<int32_t> Int32NodeCache;
53 typedef NodeCache<void*> PtrNodeCache;
55 } // namespace compiler
56 } // namespace internal
59 #endif // V8_COMPILER_NODE_CACHE_H_