- Sort Score
- Result 10 results
- Languages All
Results 1 - 10 of 31 for Predecessors (0.15 sec)
-
src/cmd/compile/internal/ssa/block.go
Hotness Hotness // Subsequent blocks, if any. The number and order depend on the block kind. Succs []Edge // Inverse of successors. // The order is significant to Phi nodes in the block. // TODO: predecessors is a pain to maintain. Can we somehow order phi // arguments by block id and have this field computed explicitly when needed? Preds []Edge // A list of values that determine how the block is exited. The number
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Wed May 15 15:44:14 UTC 2024 - 12.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) -
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) -
maven-api-impl/src/main/java/org/apache/maven/internal/impl/model/DefaultProfileInjector.java
for (Plugin element : tgt) { Object key = getPluginKey().apply(element); master.put(key, element); } Map<Object, List<Plugin>> predecessors = new LinkedHashMap<>(); List<Plugin> pending = new ArrayList<>(); for (Plugin element : src) { Object key = getPluginKey().apply(element);
Registered: Wed Jun 12 09:55:16 UTC 2024 - Last Modified: Fri Apr 12 10:50:18 UTC 2024 - 9.5K bytes - Viewed (0) -
src/cmd/compile/internal/ssa/debug.go
state.currentState.reset(ourStartState) } // Zero predecessors if len(preds) == 0 { if previousBlock != nil { state.f.Fatalf("Function %v, block %s with no predecessors is not first block, has previous %s", state.f, b.String(), previousBlock.String()) } // startState is empty reset(abt.T{}) return abt.T{}, blockChanged } // One predecessor l0 := blockLocs[preds[0].ID] p0 := l0.endState
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Mon Jun 10 19:44:43 UTC 2024 - 58.4K bytes - Viewed (0) -
maven-api-impl/src/main/java/org/apache/maven/internal/impl/model/DefaultInheritanceAssembler.java
Object key = getPluginKey().apply(plugin); master.put(key, plugin); } } Map<Object, List<Plugin>> predecessors = new LinkedHashMap<>(); List<Plugin> pending = new ArrayList<>(); for (Plugin element : tgt) { Object key = getPluginKey().apply(element);
Registered: Wed Jun 12 09:55:16 UTC 2024 - Last Modified: Fri Apr 12 10:50:18 UTC 2024 - 13.8K bytes - Viewed (0) -
tensorflow/compiler/mlir/tensorflow/transforms/tpu_validate_inputs.cc
} } return successors; } // Gets the predecessors of an op wrapped in tf_executor.island. llvm::SmallVector<Operation*> GetPredecessors(Operation* op) { llvm::SmallVector<Operation*> predecessors; for (auto operand : op->getOperands()) { if (Operation* pred = operand.getDefiningOp()) { pred->walk([&](mlir::Operation* opinexecutor) { predecessors.push_back(opinexecutor); }); } }
Registered: Sun Jun 16 05:45:23 UTC 2024 - Last Modified: Tue May 07 06:51:01 UTC 2024 - 21.5K bytes - Viewed (0) -
tensorflow/compiler/mlir/tensorflow/transforms/sparsecore/embedding_sequencing.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 - 39.4K bytes - Viewed (0) -
tensorflow/compiler/mlir/tf2xla/internal/passes/extract_head_tail_outside_compilation.cc
auto predecessors = analysis.DirectControlPredecessors(&cluster_op); if (!predecessors.empty() && !IsEmbeddingOp(&cluster_op)) { bool skip = false; for (Operation* predecessor : llvm::reverse(predecessors)) { if (IsEmbeddingOp(predecessor)) continue; skip = !head_outside_compiled_ops.contains(predecessor); break; } if (skip) continue;
Registered: Sun Jun 16 05:45:23 UTC 2024 - Last Modified: Thu Apr 25 16:01:03 UTC 2024 - 20.6K bytes - Viewed (0) -
pkg/controller/statefulset/stateful_set_control.go
return true, nil } // If we have a Pod that has been created but is not running and ready we can not make progress. // We must ensure that all for each Pod, when we create it, all of its predecessors, with respect to its // ordinal, are Running and Ready. if !isRunningAndReady(replicas[i]) && monotonic { logger.V(4).Info("StatefulSet is waiting for Pod to be Running and Ready",
Registered: Sat Jun 15 01:39:40 UTC 2024 - Last Modified: Thu Apr 18 08:03:46 UTC 2024 - 30.9K bytes - Viewed (0)