Home
last modified time | relevance | path

Searched refs:call_graph_ (Results 1 – 14 of 14) sorted by relevance

/external/tensorflow/tensorflow/compiler/xla/service/
Dhlo_ordering.cc63 call_graph_->NearestAncestorsInSameComputation( in GetExecutionConstraint()
83 if (call_graph_->InstructionIsNestedIn(a, condition) && in GetExecutionConstraint()
84 call_graph_->InstructionIsNestedIn(b, body)) { in GetExecutionConstraint()
99 if (call_graph_->InstructionIsNestedIn( in GetExecutionConstraint()
103 if (call_graph_->InstructionIsNestedIn( in GetExecutionConstraint()
177 call_graph_->InstructionIsNestedIn(b.defining_instruction(), in IsDefinedBefore()
182 call_graph_->InstructionIsNestedIn(a.defining_instruction(), in IsDefinedBefore()
190 (call_graph_->InstructionIsNestedIn( in IsDefinedBefore()
192 call_graph_->InstructionIsNestedIn( in IsDefinedBefore()
202 if (call_graph_->InstructionIsNestedIn( in IsDefinedBefore()
[all …]
Dhlo_ordering.h41 : module_(module), call_graph_(CallGraph::Build(module)) {} in HloOrdering()
102 const CallGraph& call_graph() const { return *call_graph_; } in call_graph()
119 std::unique_ptr<CallGraph> call_graph_; variable
Dhlo_liveness_analysis.cc272 : module_(module), call_graph_(CallGraph::Build(&module)) {} in HloLivenessAnalysis()
313 call_graph_.get()); in RunAnalysis()
326 &worklist, &workset, call_graph_.get()); in RunAnalysis()
Dhlo_liveness_analysis.h61 std::unique_ptr<CallGraph> call_graph_; variable
Dhlo_dataflow_analysis.h156 const CallGraph& call_graph() const { return *call_graph_; } in call_graph()
318 std::unique_ptr<CallGraph> call_graph_; variable
Dar_crs_combiner.cc195 auto caller_instructions = call_graph_->GetComputationCallers(computation); in WhileFromBodyParameter()
209 auto caller_instructions = call_graph_->GetComputationCallers(computation); in ConditionalFromBodyParameter()
342 combiner.call_graph_ = CallGraph::Build(module); in TestInstructionsComputeSameValue()
606 call_graph_ = CallGraph::Build(module); in Run()
Dar_crs_combiner.h190 std::unique_ptr<CallGraph> call_graph_; variable
Dhlo_rematerialization.h195 std::unique_ptr<CallGraph> call_graph_; variable
Dhlo_dataflow_analysis.cc94 call_graph_(CallGraph::Build(&module)), in HloDataflowAnalysis()
891 call_graph_->GetNode(parameter->parent()); in UpdateParameterValueSet()
1279 call_graph_->GetNode(called_computation); in Propagate()
1294 call_graph_->GetNode(instruction->parent()); in Propagate()
1324 const CallGraphNode& call_graph_node = call_graph_->GetNode(computation); in InitializeInstructionValueSets()
Dhlo_rematerialization.cc1871 call_graph_->GetNode(instruction->parent()).GetCallSite(instruction); in CalledComputationsMemoryUsage()
1933 const CallGraphNode& call_graph_node = call_graph_->GetNode(computation); in RematerializeComputation()
2122 call_graph_ = CallGraph::Build(module); in Run()
2123 TF_RETURN_IF_ERROR(call_graph_->VisitNodes( in Run()
Dlayout_assignment.h623 std::unique_ptr<CallGraph> call_graph_; variable
Dmemory_space_assignment.h219 call_graph_(std::move(call_graph)) {} in MemorySpaceAssignmentCostAnalysis()
226 std::unique_ptr<CallGraph> call_graph_; variable
Dlayout_assignment.cc1822 CallGraphNode& node = call_graph_->GetNode(buffer.instruction()->parent()); in PropagateBufferConstraintToUses()
2417 call_graph_ = CallGraph::Build(module); in Run()
2435 CallGraphNode& node = call_graph_->GetNode(computation); in Run()
2704 call_graph_ = CallGraph::Build(module); in Init()
Dmemory_space_assignment.cc360 auto& node = call_graph_->GetNode(computation); in CalculateComputationNestLevel()