- Sort Score
- Result 10 results
- Languages All
Results 1 - 10 of 12 for predecessor (0.14 sec)
-
src/cmd/compile/internal/ssa/debug.go
// not be a predecessor. // // Note that mergePredecessors behaves slightly differently between // first and subsequent calls for a block. For the first call, the // starting state is approximated by taking the state from the // predecessor whose state is smallest, and removing any elements not // in all the other predecessors; this makes the smallest number of
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Mon Jun 10 19:44:43 UTC 2024 - 58.4K bytes - Viewed (0) -
src/cmd/compile/internal/ssa/regalloc.go
// 2, Avoid the predecessor that contains the function call, because the predecessor that // contains the function call usually generates a lot of spills and lose the previous // allocation state. // TODO: Improve this part. At least the size of endRegs of the predecessor also has // an impact on the code size and compiler speed. But it is not easy to find a simple
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Tue Nov 21 17:49:56 UTC 2023 - 87.2K bytes - Viewed (0) -
tensorflow/compiler/mlir/tensorflow/transforms/sparsecore/embedding_pipelining.cc
for (Operation* op : ops_to_process) { if (predecessors) { for (Value operand : op->getOperands()) { // Stop at the block boundary. if (mlir::isa<BlockArgument>(operand)) continue; Operation* predecessor = operand.getDefiningOp(); if (!operations->contains(predecessor) && !ops_to_avoid.contains(predecessor)) { new_ops.insert(operand.getDefiningOp());
Registered: Sun Jun 16 05:45:23 UTC 2024 - Last Modified: Thu Apr 25 16:01:03 UTC 2024 - 92.9K bytes - Viewed (0) -
tensorflow/compiler/mlir/g3doc/_includes/tf_passes.md
}) {...} : () -> tensor<4xf32> ``` ### `-tf-tpu-colocate-splits` _Colocates each Split op with its predecessor_ It is beneficial for performance to assign a `Split` op to the same device as its predecessor. This is because the weight of cut edges is always minimized when the `Split` is with its predecessor. This colocation constraint will be used by the placer graph optimization to assign a device to the op.
Registered: Sun Jun 16 05:45:23 UTC 2024 - Last Modified: Wed Aug 02 02:26:39 UTC 2023 - 96.4K bytes - Viewed (0) -
src/cmd/compile/internal/ssa/prove.go
// If p and p.Succs[0] are dominators it means that every path // from entry to b passes through p and p.Succs[0]. We care that // no path from entry to b passes through p.Succs[1]. If p.Succs[0] // has one predecessor then (apart from the degenerate case), // there is no path from entry that can reach b through p.Succs[1]. // TODO: how about p->yes->b->yes, i.e. a loop in yes.
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Mon Mar 04 17:30:21 UTC 2024 - 48.9K bytes - Viewed (0) -
src/html/template/escape_test.go
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Mon Oct 16 03:29:27 UTC 2023 - 56.2K bytes - Viewed (0) -
tensorflow/compiler/jit/mark_for_compilation_pass.cc
std::vector<int> MarkForCompilationPassImpl::FindAlternatePathForDebugging( int from, int to) { std::vector<int> rpo = cycles_graph_.AllNodesInPostOrder(); absl::c_reverse(rpo); // best_pred_for_node[n] contains a predecessor of `n` that has an // unclusterable node in some path from `from` to itself. // best_pred_for_node[n] is unpopulated for nodes that are not reachable from
Registered: Sun Jun 16 05:45:23 UTC 2024 - Last Modified: Wed Feb 21 12:19:41 UTC 2024 - 85.3K bytes - Viewed (0) -
android/guava/src/com/google/common/util/concurrent/AbstractFuture.java
succ = curr.next; if (curr.thread != null) { // we aren't unlinking this node, update pred. pred = curr; } else if (pred != null) { // We are unlinking this node and it has a predecessor. pred.next = succ; if (pred.thread == null) { // We raced with another node that unlinked pred. Restart. continue restart; }
Registered: Wed Jun 12 16:38:11 UTC 2024 - Last Modified: Fri Jun 07 22:25:23 UTC 2024 - 63.1K bytes - Viewed (1) -
guava/src/com/google/common/util/concurrent/AbstractFuture.java
succ = curr.next; if (curr.thread != null) { // we aren't unlinking this node, update pred. pred = curr; } else if (pred != null) { // We are unlinking this node and it has a predecessor. pred.next = succ; if (pred.thread == null) { // We raced with another node that unlinked pred. Restart. continue restart; }
Registered: Wed Jun 12 16:38:11 UTC 2024 - Last Modified: Fri Jun 07 22:25:23 UTC 2024 - 62.8K bytes - Viewed (1) -
platforms/documentation/docs/src/docs/userguide/jvm/java_testing.adoc
==== [[using_junit5]] == Using JUnit 5 http://junit.org/junit5[JUnit 5] is the latest version of the well-known JUnit test framework. Unlike its predecessor, JUnit 5 is modularized and composed of several modules: JUnit 5 = JUnit Platform + JUnit Jupiter + JUnit Vintage
Registered: Wed Jun 12 18:38:38 UTC 2024 - Last Modified: Fri Mar 29 16:24:12 UTC 2024 - 53.1K bytes - Viewed (0)