| 995 | } |
| 996 | |
| 997 | Status FindUniqueBackedge(Node* merge, const Edge** result) { |
| 998 | *result = nullptr; |
| 999 | CHECK(merge->IsMerge()); |
| 1000 | for (const Edge* e : merge->in_edges()) { |
| 1001 | if (e->src()->IsNextIteration()) { |
| 1002 | if (*result != nullptr) { |
| 1003 | return CreateMultipleNextIterationInputsError(merge); |
| 1004 | } |
| 1005 | *result = e; |
| 1006 | } |
| 1007 | } |
| 1008 | return Status::OK(); |
| 1009 | } |
| 1010 | |
| 1011 | // If `backedge_predicate` is equal to `symbolic_predicate` & Step where Step |
| 1012 | // does not contain `symbolic_predicate` as an inner (not top-level) operand |
no test coverage detected