| 1215 | } |
| 1216 | |
| 1217 | Status DeadnessAnalysisImpl::HandleNode(Node* n, |
| 1218 | std::vector<bool>* should_revisit, |
| 1219 | bool use_optimistic_mode) { |
| 1220 | if (n->IsSwitch()) { |
| 1221 | TF_RETURN_IF_ERROR(HandleSwitch(n, should_revisit)); |
| 1222 | } else if (n->IsMerge()) { |
| 1223 | TF_RETURN_IF_ERROR(HandleMerge(n, should_revisit, use_optimistic_mode)); |
| 1224 | } else if (n->IsControlTrigger()) { |
| 1225 | SetPredicate(n, Graph::kControlSlot, predicate_factory_.MakeTrue(), |
| 1226 | nullptr); |
| 1227 | } else if (n->IsRecv() || n->IsHostRecv()) { |
| 1228 | TF_RETURN_IF_ERROR(HandleRecv(n, should_revisit)); |
| 1229 | } else if (n->IsNextIteration()) { |
| 1230 | TF_RETURN_IF_ERROR(HandleGeneric(n, should_revisit)); |
| 1231 | } else { |
| 1232 | TF_RETURN_IF_ERROR(HandleGeneric(n, should_revisit)); |
| 1233 | } |
| 1234 | return Status::OK(); |
| 1235 | } |
| 1236 | |
| 1237 | // Compute a special topological order for the Graph, where nodes having the |
| 1238 | // same root frame are placed adjacent to each other. The traversal uses a |
nothing calls this directly
no test coverage detected