- Sort Score
- Result 10 results
- Languages All
Results 41 - 50 of 90 for predecessor (0.36 sec)
-
tensorflow/compiler/mlir/tensorflow/transforms/tf_passes.td
let summary = "Colocates each Split op with its predecessor"; let constructor = "TFTPU::CreateTPUColocateSplitsPass()"; let description = [{ 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
Registered: Sun Jun 16 05:45:23 UTC 2024 - Last Modified: Wed Jun 12 21:18:05 UTC 2024 - 99.6K bytes - Viewed (0) -
src/cmd/compile/internal/liveness/plive.go
} if m.Op == ssa.OpPhi { break } } // Find the two predecessor blocks (write barrier on and write barrier off) if len(m.Args) != 2 { lv.f.Fatalf("phi before write barrier end mark has %d args, want 2", len(m.Args)) } c := b.Preds[0].Block() d := b.Preds[1].Block() // Find their common predecessor block (the one that branches based on wb on/off).
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Fri Jun 07 15:22:22 UTC 2024 - 45.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/tensorflow/transforms/passes.h
// Creates a pass that propagates TPU devices to users. std::unique_ptr<OperationPass<func::FuncOp>> CreateTPUDevicePropagationPass(); // Create a pass that colocates each `Split` with its predecessor. std::unique_ptr<OperationPass<func::FuncOp>> CreateTPUColocateSplitsPass(); // Creates a pass that replicates the tf._TPUCompileMlir op on each host that
Registered: Sun Jun 16 05:45:23 UTC 2024 - Last Modified: Wed Jun 12 21:18:05 UTC 2024 - 31.8K 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/cmd/compile/internal/ssa/_gen/genericOps.go
{name: "FMA", argLength: 3}, // compute (a*b)+c without intermediate rounding // Data movement. Max argument length for Phi is indefinite. {name: "Phi", argLength: -1, zeroWidth: true}, // select an argument based on which predecessor block we came from {name: "Copy", argLength: 1}, // output = arg0 // Convert converts between pointers and integers. // We have a special op for this so as to not confuse GC
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Thu May 23 15:49:20 UTC 2024 - 42.6K 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)