Home
last modified time | relevance | path

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

/external/tensorflow/tensorflow/compiler/xla/service/
Dhlo_ordering.cc59 const HloInstruction* a_ancestor; in GetExecutionConstraint() local
61 std::tie(a_ancestor, b_ancestor) = in GetExecutionConstraint()
65 if (a_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()
80 const HloComputation* body = a_ancestor->while_body(); in GetExecutionConstraint()
81 const HloComputation* condition = a_ancestor->while_condition(); in GetExecutionConstraint()
93 if (a_ancestor == b_ancestor && in GetExecutionConstraint()
94 (a_ancestor->opcode() == HloOpcode::kConditional)) { in GetExecutionConstraint()
97 for (int j = 0; j < a_ancestor->branch_count(); ++j) { in GetExecutionConstraint()
[all …]
Dcall_graph.cc396 HloInstruction* a_ancestor = a; in NearestAncestorsInSameComputation() local
406 a_ancestor = next_caller(a_ancestor); in NearestAncestorsInSameComputation()
407 if (a_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()
425 a_ancestor = next_caller(a_ancestor); in NearestAncestorsInSameComputation()