Searched refs:IsEnter (Results 1 – 20 of 20) sorted by relevance
65 if (IsEnter(*fanout.node)) { in InferFromGraphView()99 if (IsEnter(*fanout.node)) { in InferFromGraphView()
78 ASSERT_FALSE(op->IsEnter()); in TEST()99 if (op->IsEnter()) { in TEST()179 ASSERT_FALSE(op->IsEnter()); in TEST()195 if (op->IsEnter()) { in TEST()
204 if (IsEnter(current_node) || IsExit(current_node)) { in ExtractConstantSubgraph()
269 ASSERT_FALSE(op->IsEnter()); in TEST()
642 item->is_enter = IsEnter(n); in Initialize()655 (IsEnter(n) || IsExit(n) || IsNextIteration(n)); in Initialize()668 if (IsEnter(n)) { in Initialize()1452 if (IsEnter(curr_node)) { in BuildControlFlowInfo()
149 bool IsEnter() const { return class_ == NC_ENTER; } in IsEnter() function166 (IsSwitch() || IsMerge() || IsEnter() || IsExit() || in IsControlFlow()738 inline bool IsEnter(const Node* node) { return node->IsEnter(); } in IsEnter() function
135 if (IsEnter(out)) { in BuildControlFlowInfo()
88 if (IsEnter(node)) { in TEST()
365 if ((IsEnter(node) && !IsRefType(node->input_type(0))) || in OptimizeControlFlowColocation()582 if (!node->IsEnter()) { in InputFrame()
265 if (IsEnter(*invariant_node)) { in MoveInvariantNodes()282 if (!IsConstant(*node) && !IsEnter(*node) && iter->second > 0) { in RevertInvariantNodes()309 !IsEnter(*producer)) { in RevertInvariantNodes()414 if (IsEnter(node) && node.attr().at("is_constant").b()) { in Optimize()658 if (IsEnter(*node)) { in CheckForDeadFanout()
278 EXPECT_TRUE(IsEnter(node)); in TEST_F()
2331 if (IsEnter(*node) && node->input_size() > 0) { in MoveConstantsPastEnter()
3409 if (IsEnter(node) || IsExit(node)) { in CanDedup()
155 if (edge->dst()->IsEnter() || edge->src()->IsExit()) { in CreateCycleDetectionGraph()161 if (edge->dst()->IsEnter()) { in CreateCycleDetectionGraph()
206 if (!src_node->IsEnter() && !src_node->IsNextIteration()) { in InsertNodes()226 if (node->IsEnter()) { in DeparallelizeWhileLoops()
210 bool IsEnter(const NodeDef& node) { in IsEnter() function677 return IsEnter(node) || IsExit(node) || IsNextIteration(node); in ModifiesFrameInfo()
67 bool IsEnter(const NodeDef& node);
489 DCHECK(!n->IsEnter() && !n->IsNextIteration()) << n->DebugString(); in AddGradients()
628 if (IsEnter(node)) { in FunctionalizeWhileLoop()
1867 if (IsEnter(*n)) { in UpdateShapes()2066 if (IsEnter(*fanout.node)) { in InferStatically()