Home
last modified time | relevance | path

Searched refs:IsEnter (Results 1 – 25 of 25) sorted by relevance

/external/tensorflow/tensorflow/core/common_runtime/
Dimmutable_executor_state.cc104 if (IsSwitch(n) || IsMerge(n) || IsEnter(n) || IsExit(n)) { in Initialize()
157 item->is_enter = IsEnter(n); in Initialize()
192 (IsEnter(n) || IsExit(n) || IsNextIteration(n)); in Initialize()
310 if (IsEnter(curr_node)) { in BuildControlFlowInfo()
Dlower_while_op_test.cc92 ASSERT_FALSE(op->IsEnter()); in TEST()
116 if (op->IsEnter()) { in TEST()
438 ASSERT_FALSE(op->IsEnter()); in TEST()
457 if (op->IsEnter()) { in TEST()
Dlower_functional_ops_test.cc281 ASSERT_FALSE(op->IsEnter()); in TEST()
Deval_const_tensor.cc221 if (IsEnter(current_node) || IsExit(current_node)) { in ExtractConstantSubgraph()
/external/tensorflow/tensorflow/core/grappler/utils/
Dframe.cc67 if (IsEnter(*fanout_node)) { in InferFromGraphViewT()
101 if (IsEnter(*fanout_node)) { in InferFromGraphViewT()
/external/tensorflow/tensorflow/core/graph/
Dgraph.h159 bool IsEnter() const { return class_ == NC_ENTER; } in IsEnter() function
176 (IsSwitch() || IsMerge() || IsEnter() || IsExit() || in IsControlFlow()
814 inline bool IsEnter(const Node* node) { return node->IsEnter(); } in IsEnter() function
Dcontrol_flow.cc135 if (IsEnter(out)) { in BuildControlFlowInfo()
Dcontrol_flow_test.cc88 if (IsEnter(node)) { in TEST()
Dgraph_partition.cc392 if ((IsEnter(node) && !IsRefType(node->input_type(0))) || in OptimizeControlFlowColocation()
609 if (!node->IsEnter()) { in InputFrame()
/external/tensorflow/tensorflow/core/grappler/optimizers/
Dloop_optimizer.cc263 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()
Dcommon_subgraph_elimination.cc155 if (IsEnter(node) || IsExit(node)) { in CanDedup()
Dfunction_optimizer.cc1115 return src->IsEnter() && CheckBoolAttr(src, "is_constant"); in AddStrictInputSemantics()
Dconstant_folding.cc2592 if (!IsEnter(*node) || node->input_size() == 0 || in MoveConstantsPastEnter()
/external/tensorflow/tensorflow/compiler/tf2xla/
Dfunctionalize_control_flow_util.cc75 if (IsEnter(node)) { in ExtractWhileLoopFrames()
Dresource_util.cc54 return (n->IsEnter() || n->IsExit() || n->IsSwitch() || n->IsMerge() || in IsControlFlowV1Node()
/external/tensorflow/tensorflow/core/debug/
Ddebug_graph_utils.cc239 if (!src_node->IsEnter() && !src_node->IsNextIteration()) { in InsertNodes()
259 if (node->IsEnter()) { in DeparallelizeWhileLoops()
/external/tensorflow/tensorflow/compiler/jit/
Dxla_cluster_util.cc148 if (edge->dst()->IsEnter() || edge->src()->IsExit()) { in CreateCycleDetectionGraph()
154 if (edge->dst()->IsEnter()) { in CreateCycleDetectionGraph()
Ddeadness_analysis.cc882 return IsEnter(n) && control_flow_info_[n->id()].parent_frame->IsSource(); in IsRootEnter()
/external/tensorflow/tensorflow/core/grappler/
Dop_types.h79 bool IsEnter(const NodeDef& node);
Dop_types.cc260 bool IsEnter(const NodeDef& node) { in IsEnter() function
768 return IsEnter(node) || IsExit(node) || IsNextIteration(node); in ModifiesFrameInfo()
/external/tensorflow/tensorflow/core/tpu/graph_rewrite/
Dhost_training_loop_optimization_util.cc86 if (node->IsEnter()) { in FindEnterNodeFromTPUExecuteNodeInput()
Ddistributed_tpu_rewrite_pass.cc2482 while (node->IsEnter() || node->IsSwitch()) { in FindVariableInputs()
/external/tensorflow/tensorflow/cc/framework/
Dgradients.cc490 DCHECK(!n->IsEnter() && !n->IsNextIteration()) << n->DebugString(); in AddGradients()
/external/tensorflow/tensorflow/core/grappler/costs/
Dgraph_properties.cc2300 if (IsEnter(*n)) { in UpdateShapes()
2501 if (IsEnter(*fanout.node)) { in InferStatically()
/external/tensorflow/tensorflow/compiler/mlir/tensorflow/translate/
Dimport_model.cc1768 if (node.IsEnter()) { in CreateOperation()