Home
last modified time | relevance | path

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

/external/tensorflow/tensorflow/compiler/xla/service/
Dcall_graph.cc397 HloInstruction* b_ancestor = b; in NearestAncestorsInSameComputation() local
413 b_ancestor = next_caller(b_ancestor); in NearestAncestorsInSameComputation()
414 if (b_ancestor == nullptr) { in NearestAncestorsInSameComputation()
420 while ((a_ancestor != nullptr) && (b_ancestor != nullptr)) { in NearestAncestorsInSameComputation()
421 if (a_ancestor->parent() == b_ancestor->parent()) { in NearestAncestorsInSameComputation()
422 return {a_ancestor, b_ancestor}; in NearestAncestorsInSameComputation()
426 b_ancestor = next_caller(b_ancestor); in NearestAncestorsInSameComputation()
Dhlo_ordering.cc60 const HloInstruction* b_ancestor; in GetExecutionConstraint() local
61 std::tie(a_ancestor, b_ancestor) = in GetExecutionConstraint()
72 CHECK_NE(b_ancestor, nullptr); in GetExecutionConstraint()
73 CHECK_EQ(a_ancestor->parent(), b_ancestor->parent()); in GetExecutionConstraint()
79 if (a_ancestor == b_ancestor && a_ancestor->opcode() == HloOpcode::kWhile) { in GetExecutionConstraint()
93 if (a_ancestor == b_ancestor && in GetExecutionConstraint()
110 CHECK_EQ(b, b_ancestor); in GetExecutionConstraint()
132 if (ExecutesBeforeInSameComputation(a_ancestor, b_ancestor)) { in GetExecutionConstraint()
135 if (ExecutesBeforeInSameComputation(b_ancestor, a_ancestor)) { in GetExecutionConstraint()