- Sort Score
- Result 10 results
- Languages All
Results 1 - 9 of 9 for predecessor (0.4 sec)
-
tensorflow/compiler/mlir/tensorflow/analysis/side_effect_analysis.cc
for (auto& entry : control_predecessors_) { auto op = entry.getFirst(); auto& predecessors = entry.getSecond(); auto& sorted_predecessors = sorted_control_predecessors_[op]; for (Operation* predecessor : predecessors) { sorted_predecessors.push_back(predecessor); sorted_control_successors_[predecessor].push_back(op); } } control_predecessors_.clear();
Registered: Sun Jun 16 05:45:23 UTC 2024 - Last Modified: Wed May 15 09:04:13 UTC 2024 - 41.2K bytes - Viewed (0) -
tensorflow/compiler/mlir/tensorflow/analysis/side_effect_analysis.h
AnalyzeRegion(region); } SideEffectAnalysisInfo(SideEffectAnalysisInfo&&) = default; // Returns a vector of ops that are direct control predecessors of `op`, // sorted in program order. If `filter` is provided, only predecessors that // pass the filter (returning true) will be included. const llvm::SmallVector<Operation*, 4>& DirectControlPredecessors( Operation* op) const;
Registered: Sun Jun 16 05:45:23 UTC 2024 - Last Modified: Wed May 15 09:04:13 UTC 2024 - 14.8K bytes - Viewed (0) -
platforms/core-configuration/model-core/src/main/java/org/gradle/model/internal/registry/DefaultModelRegistry.java
// Node must be at the predecessor state before calculating dependencies NodeAtState predecessor = new NodeAtState(getPath(), getTargetState().previous()); dependencies.add(graph.nodeAtState(predecessor)); // Transition any other nodes that depend on the predecessor state dependencies.add(new TransitionDependents(predecessor)); seenPredecessor = true;
Registered: Wed Jun 12 18:38:38 UTC 2024 - Last Modified: Fri May 24 15:40:00 UTC 2024 - 45.7K bytes - Viewed (0) -
src/internal/trace/gc.go
} } // An integrator tracks a position in a utilization function and // integrates it. type integrator struct { u *mmuSeries // pos is the index in u.util of the current time's non-strict // predecessor. pos int } // advance returns the integral of the utilization function from 0 to // time. advance must be called on monotonically increasing values of // times.
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Fri May 17 18:48:18 UTC 2024 - 26K bytes - Viewed (0) -
src/cmd/compile/internal/ssa/block.go
} b.Preds[n] = Edge{} b.Preds = b.Preds[:n] b.Func.invalidateCFG() } // removeSucc removes the ith output edge from b. // It is the responsibility of the caller to remove // the corresponding predecessor edge. // Note that this potentially reorders successors of b, so it // must be used very carefully. func (b *Block) removeSucc(i int) { n := len(b.Succs) - 1 if i != n { e := b.Succs[n] b.Succs[i] = e
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Wed May 15 15:44:14 UTC 2024 - 12.2K bytes - Viewed (0) -
src/cmd/vendor/github.com/google/pprof/internal/report/source.go
// cannot determine the real line number. if f.begin > expand { f.begin -= expand } else if f.begin > 1 { f.begin = 1 } } else { // Find gap from predecessor and divide between predecessor and f. halfGap := (f.begin - funcs[i-1].end) / 2 if halfGap > expand { halfGap = expand } funcs[i-1].end += halfGap f.begin -= halfGap } funcs[i] = f }
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Fri May 31 19:48:28 UTC 2024 - 31.3K 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/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/_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)