- Sort Score
- Result 10 results
- Languages All
Results 1 - 3 of 3 for control_flow_info (0.3 sec)
-
tensorflow/compiler/jit/xla_cluster_util.cc
// integers starting from 0. CHECK_EQ(i, cycles->NewNode()); } // Compute the loop structure of the graph. std::vector<ControlFlowInfo> control_flow_info; TF_RETURN_IF_ERROR(BuildControlFlowInfo(graph, &control_flow_info)); // The clustering code must avoid adding cycles to the graph to prevent // deadlock. However, the graph may contain loops, which would trigger the
Registered: Sun Jun 16 05:45:23 UTC 2024 - Last Modified: Thu Feb 29 08:39:39 UTC 2024 - 21.3K bytes - Viewed (0) -
tensorflow/compiler/jit/encapsulate_subgraphs_pass.cc
// flow frame. while (!control_flow_info[src_node->id()].frame_name.empty()) { NodeDebugInfo debug_info(*src_node); NodeBuilder enter_builder(options.GetNameForOp("Enter"), "Enter", options.op_registry(), &debug_info); enter_builder.Attr("frame_name", control_flow_info[src_node->id()].frame_name); enter_builder.Attr("is_constant", true);
Registered: Sun Jun 16 05:45:23 UTC 2024 - Last Modified: Thu Feb 22 08:47:20 UTC 2024 - 51K bytes - Viewed (0) -
tensorflow/compiler/jit/deadness_analysis.cc
Status GetFrameBasedTopologicalOrder(std::vector<Node*>* order); bool IsRootEnter(const Node* n) const { return IsEnter(n) && control_flow_info_[n->id()].parent_frame->IsSource(); } bool IsRootExit(const Node* n) const { return IsExit(n) && control_flow_info_[n->id()].parent_frame->IsSource(); } const Graph& graph_; absl::flat_hash_map<TensorId, Predicate*, TensorId::Hasher> predicate_map_;
Registered: Sun Jun 16 05:45:23 UTC 2024 - Last Modified: Tue Mar 12 06:33:33 UTC 2024 - 60.4K bytes - Viewed (0)