Searched refs:IsNextIteration (Results 1 – 22 of 22) sorted by relevance
82 ASSERT_FALSE(op->IsNextIteration()); in TEST()112 if (op->IsNextIteration()) { in TEST()183 ASSERT_FALSE(op->IsNextIteration()); in TEST()207 if (op->IsNextIteration()) { in TEST()
273 ASSERT_FALSE(op->IsNextIteration()); in TEST()
655 (IsEnter(n) || IsExit(n) || IsNextIteration(n)); in Initialize()2160 DCHECK(IsNextIteration(node)); in PropagateOutputs()
275 return !edge.src()->IsNextIteration(); in ComputeIncompatibleResourceOperationPairs()293 if (n->IsMerge() && e->src()->IsNextIteration()) { in ComputeIncompatibleResourceOperationPairs()
34 if (e->src()->IsNextIteration()) { in Remove()
825 if (backedge->src()->IsNextIteration()) { in CreateMultipleNextIterationInputsError()839 if (e->src()->IsNextIteration()) { in FindUniqueBackedge()925 if (!e->IsControlEdge() && e->src()->IsNextIteration()) { in HandleMerge()1031 } else if (n->IsNextIteration()) { in HandleNode()1043 return !edge.src()->IsNextIteration(); in Populate()1088 if (n->IsNextIteration()) { in PopulateWithReversePostOrder()
34 bool NotBackedge(const Edge& edge) { return !edge.src()->IsNextIteration(); } in NotBackedge()
187 if (edge->src()->IsNextIteration()) { in CreateCycleDetectionGraph()
581 return !edge.src()->IsNextIteration(); in TEST()
151 bool IsNextIteration() const { return class_ == NC_NEXT_ITERATION; } in IsNextIteration() function167 IsNextIteration()); in IsControlFlow()740 inline bool IsNextIteration(const Node* n) { return n->IsNextIteration(); } in IsNextIteration() function
77 if (!e->IsControlEdge() && e->src()->IsNextIteration()) { in ValidateGraphHasNoCycle()
52 inline bool IsNextIteration(const NodeDef& node_def) { in IsNextIteration() function366 IsNextIteration(node)) { in OptimizeControlFlowColocation()820 if (IsNextIteration(*ndef)) { in TopologicalSortNodesWithTimePriority()
53 inline bool IsNextIteration(const NodeDef& node_def) { in IsNextIteration() function328 bool is_next_iteration = IsNextIteration(*node_defs_[processed]); in UpdatePendingCountAndReady()487 if (IsNextIteration(node_def)) { in GetNextIterationNodes()
73 if (IsNextIteration(graph.node(input))) { in ComputeTopologicalOrder()
215 if (IsNextIteration(*node)) { in IdentifyLoops()
124 [](const Edge& edge) { return !edge.src()->IsNextIteration(); }); in BackwardsConstAnalysis()
408 if (!IsNextIteration(arg.next_iteration)) { in FunctionalizeLoop()
335 bool IsNextIteration(const NodeDef& node) { in IsNextIteration() function677 return IsEnter(node) || IsExit(node) || IsNextIteration(node); in ModifiesFrameInfo()
108 bool IsNextIteration(const NodeDef& node);
206 if (!src_node->IsEnter() && !src_node->IsNextIteration()) { in InsertNodes()
489 DCHECK(!n->IsEnter() && !n->IsNextIteration()) << n->DebugString(); in AddGradients()
2089 } else if (IsNextIteration(node)) { in InferStatically()