- Sort Score
- Result 10 results
- Languages All
Results 1 - 3 of 3 for BackEdge (0.1 sec)
-
tensorflow/compiler/jit/deadness_analysis.cc
} namespace { Status CreateMultipleNextIterationInputsError(Node* merge) { std::vector<string> backedges; for (const Edge* backedge : merge->in_edges()) { if (backedge->src()->IsNextIteration()) { backedges.push_back(absl::StrCat(" ", SummarizeNode(*backedge->src()))); } } return errors::InvalidArgument( "Multiple NextIteration inputs to merge node ",
Registered: Sun Jun 16 05:45:23 UTC 2024 - Last Modified: Tue Mar 12 06:33:33 UTC 2024 - 60.4K bytes - Viewed (0) -
tensorflow/compiler/jit/deadness_analysis_test.cc
} } TEST(DeadnessAnalysisTest, LoopInvariantPredicateOnBackedge) { // Create a merge that "looks like" a loop but isn't really. It has a value // that does not depend on the merge on its backedge. Scope root = Scope::NewRootScope().ExitOnError(); InductionVarInfo iv = CreateInductionVariable(root, "iv0", "frame", 0); DependentInductionVar dependent_iv =
Registered: Sun Jun 16 05:45:23 UTC 2024 - Last Modified: Thu Feb 22 06:59:07 UTC 2024 - 51.6K bytes - Viewed (0) -
src/cmd/compile/internal/ssa/debug.go
reset(p0) return p0, blockChanged } // More than one predecessor if updating { // After the first approximation, i.e., when updating, results // can only get smaller, because initially backedge // predecessors do not participate in the intersection. This // means that for the update, given the prior approximation of // startState, there is no need to re-intersect with unchanged
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Mon Jun 10 19:44:43 UTC 2024 - 58.4K bytes - Viewed (0)