Home
last modified time | relevance | path

Searched refs:info_for_node_ (Results 1 – 4 of 4) sorted by relevance

/external/v8/src/compiler/
Dload-elimination.h138 explicit AbstractField(Zone* zone) : info_for_node_(zone) {} in NON_EXPORTED_BASE()
140 : info_for_node_(zone) { in NON_EXPORTED_BASE()
141 info_for_node_.insert(std::make_pair(object, Field(value, name))); in NON_EXPORTED_BASE()
147 that->info_for_node_ = this->info_for_node_; in NON_EXPORTED_BASE()
148 that->info_for_node_.insert(std::make_pair(object, Field(value, name))); in NON_EXPORTED_BASE()
155 return this == that || this->info_for_node_ == that->info_for_node_; in NON_EXPORTED_BASE()
160 for (auto this_it : this->info_for_node_) { in NON_EXPORTED_BASE()
164 auto that_it = that->info_for_node_.find(this_object); in NON_EXPORTED_BASE()
165 if (that_it != that->info_for_node_.end() && in NON_EXPORTED_BASE()
167 copy->info_for_node_.insert(this_it); in NON_EXPORTED_BASE()
[all …]
Dload-elimination.cc319 for (auto pair : info_for_node_) { in Lookup()
355 for (auto pair : this->info_for_node_) { in Kill()
359 for (auto pair : this->info_for_node_) { in Kill()
362 that->info_for_node_.insert(pair); in Kill()
372 for (auto pair : info_for_node_) { in Print()
380 : info_for_node_(zone) {} in AbstractMaps()
384 : info_for_node_(zone) { in AbstractMaps()
386 info_for_node_.insert(std::make_pair(object, maps)); in AbstractMaps()
391 auto it = info_for_node_.find(ResolveRenames(object)); in Lookup()
392 if (it == info_for_node_.end()) return false; in Lookup()
[all …]
Dredundancy-elimination.cc208 if (id < info_for_node_.size()) return info_for_node_[id]; in Get()
215 if (id >= info_for_node_.size()) info_for_node_.resize(id + 1, nullptr); in Set()
216 info_for_node_[id] = checks; in Set()
Dredundancy-elimination.h52 explicit PathChecksForEffectNodes(Zone* zone) : info_for_node_(zone) {} in PathChecksForEffectNodes()
57 ZoneVector<EffectPathChecks const*> info_for_node_;