Home
last modified time | relevance | path

Searched refs:graph_ (Results 1 - 25 of 57) sorted by relevance

123

/third_party/node/deps/v8/src/compiler/
H A Dloop-peeling.cc133 NodeCopier copier(graph_, estimated_peeled_size, &iter->node_pairs_, 1); in Peel()
135 Node* dead = graph_->NewNode(common_->Dead()); in Peel()
143 copier.CopyNodes(graph_, tmp_zone_, dead, loop_tree_->BodyNodes(loop), in Peel()
160 graph_->NewNode(common_->Merge(backedges), backedges, &inputs[0]); in Peel()
173 Node* phi = graph_->NewNode(op, backedges + 1, &inputs[0]); in Peel()
202 exit->InsertInput(graph_->zone(), 1, copier.map(exit->InputAt(0))); in Peel()
208 exit->InsertInput(graph_->zone(), 1, copier.map(exit->InputAt(0))); in Peel()
266 EliminateLoopExits(graph_, tmp_zone_); in PeelInnerLoopsOfTree()
H A Dcompiler-source-position-table.cc28 : graph_(graph), in SourcePositionTable()
35 decorator_ = graph_->zone()->New<Decorator>(this); in AddDecorator()
36 graph_->AddDecorator(decorator_); in AddDecorator()
41 graph_->RemoveDecorator(decorator_); in RemoveDecorator()
H A Dmachine-graph.h27 : graph_(graph), common_(common), machine_(machine), cache_(zone()) {} in MachineGraph()
75 return Dead_ ? Dead_ : Dead_ = graph_->NewNode(common_->Dead()); in Dead()
80 Graph* graph() const { return graph_; } in graph()
84 Graph* graph_; member in v8::internal::compiler::MachineGraph
H A Dnode-origin-table.cc42 : graph_(graph), in NodeOriginTable()
50 decorator_ = graph_->zone()->New<Decorator>(this); in AddDecorator()
51 graph_->AddDecorator(decorator_); in AddDecorator()
56 graph_->RemoveDecorator(decorator_); in RemoveDecorator()
H A Dgraph.h46 : graph_(graph), start_(graph->start()), end_(graph->end()) {} in SubgraphScope()
48 graph_->SetStart(start_); in ~SubgraphScope()
49 graph_->SetEnd(end_); in ~SubgraphScope()
55 Graph* const graph_; member in v8::internal::compiler::final::final
H A Dbranch-condition-duplicator.cc67 return graph_->CloneNode(node); in DuplicateNode()
94 Enqueue(graph_->end()); in ProcessGraph()
103 : graph_(graph), to_visit_(zone), seen_(graph, 2) {} in BranchConditionDuplicator()
H A Dsimplified-lowering-verifier.h24 : hints_(zone), data_(zone), graph_(graph) {} in SimplifiedLoweringVerifier()
104 Zone* graph_zone() const { return graph_->zone(); } in graph_zone()
108 Graph* graph_; member in v8::internal::compiler::final
H A Dgraph-trimmer.h50 Graph* graph() const { return graph_; } in graph()
52 Graph* const graph_; member in v8::internal::compiler::final
H A Dtyper.h47 Graph* graph() const { return graph_; } in graph()
53 Graph* const graph_; member in v8::internal::compiler::Typer
H A Dcontrol-flow-optimizer.h43 Graph* graph() const { return graph_; } in graph()
48 Graph* const graph_; member in v8::internal::compiler::final
H A Ddecompression-optimizer.h103 Graph* graph() const { return graph_; } in graph()
107 Graph* const graph_; member in v8::internal::compiler::final
H A Dloop-peeling.h40 : graph_(graph), in LoopPeeler()
57 Graph* const graph_; member in v8::internal::compiler::LoopPeeler
H A Dcommon-operator-reducer.h56 Graph* graph() const { return graph_; } in graph()
62 Graph* const graph_; member in v8::internal::compiler::final
H A Ddead-code-elimination.h73 Graph* graph() const { return graph_; } in graph()
77 Graph* const graph_; member in v8::internal::compiler::final
H A Dint64-lowering.h55 Graph* graph() const { return graph_; } in graph()
92 Graph* const graph_; member in v8::internal::compiler::Int64Lowering
H A Dloop-variable-optimizer.h117 Graph* graph() { return graph_; } in graph()
121 Graph* graph_; member in v8::internal::compiler::LoopVariableOptimizer
H A Descape-analysis-reducer.h26 : graph_(graph), cache_(zone), temp_nodes_(zone) {} in NodeHashCache()
68 Graph* graph_; member in v8::internal::compiler::NodeHashCache
H A Dgraph-reducer.h150 Graph* graph() const { return graph_; } in graph()
193 Graph* const graph_; member in v8::internal::compiler::GraphReducer
/third_party/skia/third_party/externals/tint/src/resolver/
H A Ddependency_graph.cc130 graph_(graph), in DependencyScanner()
181 graph_.shadows.emplace(param, shadows); in TraverseFunction()
262 graph_.shadows.emplace(v->variable, shadows); in TraverseStatement()
311 graph_.resolved_symbols.emplace(ident, node); in TraverseExpression()
320 graph_.resolved_symbols.emplace( in TraverseExpression()
322 utils::Lookup(graph_.resolved_symbols, call->target.name)); in TraverseExpression()
327 graph_.resolved_symbols.emplace( in TraverseExpression()
329 utils::Lookup(graph_.resolved_symbols, call->target.type)); in TraverseExpression()
434 graph_.resolved_symbols.emplace(from, global->node); in AddGlobalDependency()
459 DependencyGraph& graph_; member in tint::resolver::__anon26049::DependencyScanner
765 DependencyGraph& graph_; global() member
[all...]
/third_party/googletest/googlemock/src/
H A Dgmock-matchers.cc127 : graph_(&graph), in MaxBipartiteMatchState()
128 left_(graph_->LhsSize(), kUnused), in MaxBipartiteMatchState()
129 right_(graph_->RhsSize(), kUnused) {} in MaxBipartiteMatchState()
147 for (size_t ilhs = 0; ilhs < graph_->LhsSize(); ++ilhs) { in Compute()
152 // 'seen' initialized to 'graph_->RhsSize()' copies of 0. in Compute()
153 seen.assign(graph_->RhsSize(), 0); in Compute()
185 for (size_t irhs = 0; irhs < graph_->RhsSize(); ++irhs) { in TryAugment()
187 if (!graph_->HasEdge(ilhs, irhs)) continue; in TryAugment()
210 const MatchMatrix* graph_; // not owned member in testing::internal::MaxBipartiteMatchState
/third_party/node/deps/v8/src/compiler/backend/
H A Dinstruction-scheduler.cc79 graph_(zone), in InstructionScheduler()
92 DCHECK(graph_.empty()); in StartBlock()
114 for (ScheduleGraphNode* node : graph_) { in AddTerminator()
117 graph_.push_back(new_node); in AddTerminator()
208 graph_.push_back(new_node); in AddInstruction()
219 for (ScheduleGraphNode* node : graph_) { in Schedule()
248 graph_.clear(); in Schedule()
397 for (ScheduleGraphNode* node : base::Reversed(graph_)) { in ComputeTotalLatencies()
/third_party/node/src/
H A Dmemory_tracker-inl.h111 graph_->AddEdge(CurrentNode(), it->second, edge_name); in TrackField()
233 graph_->AddEdge(CurrentNode(), graph_->V8Node(value), edge_name); in TrackField()
279 graph_->AddEdge(CurrentNode(), it->second, edge_name); in Track()
310 graph_->AddNode(std::unique_ptr<v8::EmbedderGraph::Node>(n)); in AddNode()
312 if (CurrentNode() != nullptr) graph_->AddEdge(CurrentNode(), n, edge_name); in AddNode()
315 graph_->AddEdge(n, n->JSWrapperNode(), "native_to_javascript"); in AddNode()
316 graph_->AddEdge(n->JSWrapperNode(), n, "javascript_to_native"); in AddNode()
326 graph_->AddNode(std::unique_ptr<v8::EmbedderGraph::Node>(n)); in AddNode()
328 if (CurrentNode() != nullptr) graph_ in AddNode()
[all...]
H A Dmemory_tracker.h257 inline v8::EmbedderGraph* graph() { return graph_; } in graph()
262 : isolate_(isolate), graph_(graph) {} in MemoryTracker()
282 v8::EmbedderGraph* graph_; member in node::MemoryTracker
/third_party/node/deps/v8/src/maglev/
H A Dmaglev-compilation-info.h63 void set_graph(Graph* graph) { graph_ = graph; } in set_graph()
64 Graph* graph() const { return graph_; } in graph()
101 Graph* graph_ = nullptr; member in v8::internal::maglev::final
/third_party/node/deps/v8/src/heap/cppgc-js/
H A Dcpp-snapshot.cc414 : cpp_heap_(cpp_heap), graph_(graph) {} in CppGraphBuilderImpl()
431 return static_cast<EmbedderRootNode*>(graph_.AddNode( in AddRootNode()
437 graph_.AddNode(std::unique_ptr<v8::EmbedderGraph::Node>{ in AddNode()
457 graph_.AddEdge(parent.get_node(), current.get_node(), in AddEdge()
460 graph_.AddEdge(parent.get_node(), current.get_node()); in AddEdge()
473 auto* v8_node = graph_.V8Node(v8_value); in AddEdge()
475 graph_.AddEdge(parent.get_node(), v8_node, in AddEdge()
478 graph_.AddEdge(parent.get_node(), v8_node); in AddEdge()
530 graph_.AddEdge(root.get_node(), child.get_node(), in AddRootEdge()
534 graph_ in AddRootEdge()
549 v8::EmbedderGraph& graph_; global() member in v8::internal::final
[all...]

Completed in 11 milliseconds

123