Searched refs:IsEnter (Results 1 – 23 of 23) sorted by relevance
92 ASSERT_FALSE(op->IsEnter()); in TEST()116 if (op->IsEnter()) { in TEST()206 ASSERT_FALSE(op->IsEnter()); in TEST()225 if (op->IsEnter()) { in TEST()
207 if (IsEnter(current_node) || IsExit(current_node)) { in ExtractConstantSubgraph()
282 ASSERT_FALSE(op->IsEnter()); in TEST()
669 item->is_enter = IsEnter(n); in Initialize()683 (IsEnter(n) || IsExit(n) || IsNextIteration(n)); in Initialize()1531 if (IsEnter(curr_node)) { in BuildControlFlowInfo()
67 if (IsEnter(*fanout_node)) { in InferFromGraphViewT()101 if (IsEnter(*fanout_node)) { in InferFromGraphViewT()
151 bool IsEnter() const { return class_ == NC_ENTER; } in IsEnter() function168 (IsSwitch() || IsMerge() || IsEnter() || IsExit() || in IsControlFlow()765 inline bool IsEnter(const Node* node) { return node->IsEnter(); } in IsEnter() function
135 if (IsEnter(out)) { in BuildControlFlowInfo()
88 if (IsEnter(node)) { in TEST()
390 if ((IsEnter(node) && !IsRefType(node->input_type(0))) || in OptimizeControlFlowColocation()607 if (!node->IsEnter()) { in InputFrame()
263 if (IsEnter(*invariant_node)) { in MoveInvariantNodes()280 if (!IsConstant(*node) && !IsEnter(*node) && iter->second > 0) { in RevertInvariantNodes()307 !IsEnter(*producer)) { in RevertInvariantNodes()414 if (IsEnter(node) && node.attr().at("is_constant").b()) { in Optimize()666 if (IsEnter(*node)) { in CheckForDeadFanout()
1099 return src->IsEnter() && CheckBoolAttr(src, "is_constant"); in AddStrictInputSemantics()
3446 if (IsEnter(node) || IsExit(node)) { in CanDedup()
2347 if (!IsEnter(*node) || node->input_size() == 0 || in MoveConstantsPastEnter()
74 if (IsEnter(node)) { in ExtractWhileLoopFrames()
54 return (n->IsEnter() || n->IsExit() || n->IsSwitch() || n->IsMerge() || in IsControlFlowV1Node()
239 if (!src_node->IsEnter() && !src_node->IsNextIteration()) { in InsertNodes()259 if (node->IsEnter()) { in DeparallelizeWhileLoops()
148 if (edge->dst()->IsEnter() || edge->src()->IsExit()) { in CreateCycleDetectionGraph()154 if (edge->dst()->IsEnter()) { in CreateCycleDetectionGraph()
882 return IsEnter(n) && control_flow_info_[n->id()].parent_frame->IsSource(); in IsRootEnter()
73 bool IsEnter(const NodeDef& node);
233 bool IsEnter(const NodeDef& node) { in IsEnter() function717 return IsEnter(node) || IsExit(node) || IsNextIteration(node); in ModifiesFrameInfo()
489 DCHECK(!n->IsEnter() && !n->IsNextIteration()) << n->DebugString(); in AddGradients()
1985 if (IsEnter(*n)) { in UpdateShapes()2186 if (IsEnter(*fanout.node)) { in InferStatically()
1425 if (node.IsEnter()) { in createOperation()