HomeSort by relevance Sort by last modified time
    Searched refs:a_ancestor (Results 1 - 3 of 3) sorted by null

  /external/tensorflow/tensorflow/compiler/xla/service/
hlo_ordering.cc 41 const HloInstruction* a_ancestor; local
43 std::tie(a_ancestor, b_ancestor) =
47 if (a_ancestor == nullptr) {
52 // a_ancestor and b_ancestor must be either both null or both non-null.
54 CHECK_EQ(a_ancestor->parent(), b_ancestor->parent());
60 if (a_ancestor == b_ancestor && a_ancestor->opcode() == HloOpcode::kWhile) {
61 const HloComputation* body = a_ancestor->while_body();
62 const HloComputation* condition = a_ancestor->while_condition();
74 if (a_ancestor == b_ancestor &
    [all...]
call_graph.cc 393 HloInstruction* a_ancestor = a; local
398 // Advance a_ancestor (b_ancestor) up the call chain until the call depth of
399 // a_ancestor or b_ancestor are the same. Necessarily each call to next_caller
403 a_ancestor = next_caller(a_ancestor);
404 if (a_ancestor == nullptr) {
417 while ((a_ancestor != nullptr) && (b_ancestor != nullptr)) {
418 if (a_ancestor->parent() == b_ancestor->parent()) {
419 return {a_ancestor, b_ancestor};
422 a_ancestor = next_caller(a_ancestor)
    [all...]
buffer_assignment.cc 758 const HloInstruction* a_ancestor; local
760 std::tie(a_ancestor, b_ancestor) =
763 if (a_ancestor == nullptr) {
767 if (a_ancestor->opcode() == HloOpcode::kWhile &&
769 a_ancestor->while_body())) {
772 a_ancestor->operand(0));
779 assignment->liveness().points_to_analysis().GetPointsToSet(a_ancestor);
    [all...]

Completed in 102 milliseconds