Home
last modified time | relevance | path

Searched refs:b_ancestor (Results 1 – 3 of 3) sorted by relevance

/external/tensorflow/tensorflow/compiler/xla/service/
Dcall_graph.cc394 HloInstruction* b_ancestor = b; in NearestAncestorsInSameComputation() local
410 b_ancestor = next_caller(b_ancestor); in NearestAncestorsInSameComputation()
411 if (b_ancestor == nullptr) { in NearestAncestorsInSameComputation()
417 while ((a_ancestor != nullptr) && (b_ancestor != nullptr)) { in NearestAncestorsInSameComputation()
418 if (a_ancestor->parent() == b_ancestor->parent()) { in NearestAncestorsInSameComputation()
419 return {a_ancestor, b_ancestor}; in NearestAncestorsInSameComputation()
423 b_ancestor = next_caller(b_ancestor); in NearestAncestorsInSameComputation()
Dhlo_ordering.cc42 const HloInstruction* b_ancestor; in ExecutesBefore() local
43 std::tie(a_ancestor, b_ancestor) = in ExecutesBefore()
53 CHECK_NE(b_ancestor, nullptr); in ExecutesBefore()
54 CHECK_EQ(a_ancestor->parent(), b_ancestor->parent()); in ExecutesBefore()
60 if (a_ancestor == b_ancestor && a_ancestor->opcode() == HloOpcode::kWhile) { in ExecutesBefore()
74 if (a_ancestor == b_ancestor && in ExecutesBefore()
98 return ExecutesBeforeInSameComputation(a_ancestor, b_ancestor); in ExecutesBefore()
Dbuffer_assignment.cc759 const HloInstruction* b_ancestor; in MayInterfereAcrossSubcomputations() local
760 std::tie(a_ancestor, b_ancestor) = in MayInterfereAcrossSubcomputations()