Searched refs:enter_node (Results 1 – 5 of 5) sorted by relevance
197 Node* enter_node; in CreateEnterNodes() local204 .Finalize(graph_, &enter_node)); in CreateEnterNodes()205 enter_nodes_[edge->dst_input()] = enter_node; in CreateEnterNodes()230 for (Node* enter_node : enter_nodes_) { in CreateMergeNodes()235 .Input({NodeOut(enter_node, 0), NodeOut(enter_node, 0)}) in CreateMergeNodes()
40 bool enter_node = in DiscoverDataDependencies() local42 if (enter_node) { in DiscoverDataDependencies()57 if (enter_node && s.ok()) { in DiscoverDataDependencies()
654 NodeDef* enter_node = nullptr; in CheckForDeadFanout() local659 enter_node = node; in CheckForDeadFanout()665 if (enter_node != nullptr) { in CheckForDeadFanout()667 for (const auto& input : enter_node->input()) { in CheckForDeadFanout()
428 Node* enter_node = while_ctx->enter_nodes()[i]; in ProcessWhileLoop() local429 for (const Edge* e : enter_node->in_edges()) { in ProcessWhileLoop()
1858 Node* enter_node = options.FinalizeBuilder(&enter_builder); in AddDummyShapedNode() local1860 node = enter_node; in AddDummyShapedNode()