Home
last modified time | relevance | path

Searched refs:PersistentMap (Results 1 - 6 of 6) sorted by relevance

/third_party/node/deps/v8/src/compiler/
H A Dpersistent-map.h18 // PersistentMap is a persistent map datastructure based on hash trees (a binary
35 class PersistentMap { class
78 bool operator==(const PersistentMap& other) const { in operator ==()
87 bool operator!=(const PersistentMap& other) const { in operator !=()
109 PersistentMap a;
110 PersistentMap b;
115 ZipIterable Zip(const PersistentMap& other) const { return {*this, other}; } in Zip()
117 explicit PersistentMap(Zone* zone, Value def_value = Value()) in PersistentMap() function
118 : PersistentMap(nullptr, zone, def_value) {} in PersistentMap()
149 PersistentMap(cons function
341 DCHECK(old_first < first_); } if (second_current_) { ++second_; DCHECK(old_second < second_); } return *this = double_iterator(first_, second_); } double_iterator(iterator first, iterator second) : first_(first), second_(second) { if (first_ == second_) { first_current_ = second_current_ = true; } else if (first_ < second_) { first_current_ = true; second_current_ = false; } else { DCHECK(second_ < first_); first_current_ = false; second_current_ = true; } } bool operator!=(const double_iterator& other) { return first_ != other.first_ || second_ != other.second_; } bool is_end() const { return first_.is_end() && second_.is_end(); } private: iterator first_; iterator second_; bool first_current_; bool second_current_; }; template <class Key, class Value, class Hasher> void PersistentMap<Key, Value, Hasher>::Set(Key key, Value value) { HashValue key_hash = HashValue(Hasher()(key)); std::array<const FocusedTree*, kHashBits> path; int length = 0; const FocusedTree* old = FindHash(key_hash, &path, &length); ZoneMap<Key, Value>* more = nullptr; if (!(GetFocusedValue(old, key) != value)) return; if (old && !(old->more == nullptr && old->key_value.key() == key)) { more = zone_->New<ZoneMap<Key, Value>>(zone_); if (old->more) operator ++() argument
510 operator <<(std::ostream& os, const PersistentMap<Key, Value, Hasher>& map) operator <<() argument
[all...]
H A Dcsa-load-elimination.h93 using InnerMap = PersistentMap<Node*, FieldInfo>;
95 using OuterMap = PersistentMap<OuterKey, InnerMap>;
H A Dbranch-elimination.h97 PersistentMap<Node*, BranchCondition> conditions_;
H A Dbranch-elimination.cc511 PersistentMap<Node*, BranchCondition> conditions_copy(conditions_); in BlocksAndConditionsInvariant()
H A Dstore-store-elimination.cc91 using SetT = PersistentMap<KeyT, ValueT>;
H A Descape-analysis.cc99 // PersistentMap does not contain an element or maps it to the default element.
105 using Map = PersistentMap<Variable, Node*>;

Completed in 5 milliseconds