Lines Matching refs:Graph
13 #include "src/compiler/graph-reducer.h"
70 EscapeStatusAnalysis(EscapeAnalysis* object_analysis, Graph* graph,
80 Graph* graph() const { return graph_; }
111 Graph* const graph_;
203 bool MergeFrom(MergeCache* cache, Node* at, Graph* graph,
220 bool MergeFields(size_t i, Node* at, MergeCache* cache, Graph* graph,
270 bool MergeFrom(MergeCache* cache, Zone* zone, Graph* graph,
438 Graph* graph, CommonOperatorBuilder* common) {
445 Node* phi = graph->NewNode(
473 bool VirtualObject::MergeFrom(MergeCache* cache, Node* at, Graph* graph,
488 changed = MergeFields(i, at, cache, graph, common) || changed;
501 bool VirtualState::MergeFrom(MergeCache* cache, Zone* zone, Graph* graph,
545 changed = mergeObject->MergeFrom(cache, at, graph, common) || changed;
558 Graph* graph, Zone* zone)
561 graph_(graph),
607 if (status_.size() <= graph()->NodeCount()) {
608 status_.resize(graph()->NodeCount() * 1.1, kUnknown);
849 EscapeAnalysis::EscapeAnalysis(Graph* graph, CommonOperatorBuilder* common,
852 slot_not_analyzed_(graph->NewNode(common->NumberConstant(0x1c0debad))),
854 status_analysis_(new (zone) EscapeStatusAnalysis(this, graph, zone)),
862 replacements_.resize(graph()->NodeCount());
866 replacements_.resize(graph()->NodeCount());
877 std::min(std::max(graph()->NodeCount() / 5, min_size), max_size);
880 stack_.push_back(graph()->end());
881 CHECK_LT(graph()->NodeCount(), kUntrackable);
882 aliases_.resize(graph()->NodeCount(), kNotReachable);
883 aliases_[graph()->end()->id()] = kUntrackable;
940 virtual_states_.resize(graph()->NodeCount());
942 queue.push_back(graph()->start());
1214 mergeState->MergeFrom(cache_, zone(), graph(), common(), node) || changed;
1368 Node* phi = graph()->NewNode(
1536 graph()->NewNode(common()->ObjectState(input_count, vobj->id()),
1611 Graph* EscapeAnalysis::graph() const { return status_analysis_->graph(); }
