- Sort Score
- Result 10 results
- Languages All
Results 11 - 20 of 90 for predecessor (0.25 sec)
-
android/guava/src/com/google/common/graph/AbstractBaseGraph.java
Registered: Wed Jun 12 16:38:11 UTC 2024 - Last Modified: Mon Jan 22 17:29:38 UTC 2024 - 7.2K bytes - Viewed (0) -
src/cmd/compile/internal/types2/initorder.go
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Thu Mar 28 22:06:51 UTC 2024 - 9.8K bytes - Viewed (0) -
src/go/types/initorder.go
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Wed Apr 03 18:48:38 UTC 2024 - 9.9K bytes - Viewed (0) -
tensorflow/compiler/mlir/tensorflow/transforms/lower_globals_to_ml_program.cc
&arg) .succeeded()) { options.insert(arg); } } } else { op->emitOpError("Predecessor op doesn't implement BranchOpInterface"); return failure(); } } } if (!options.empty()) { if (options.size() != 1) { op->emitOpError("Incompatible code paths.");
Registered: Sun Jun 16 05:45:23 UTC 2024 - Last Modified: Thu Apr 25 16:01:03 UTC 2024 - 8.6K bytes - Viewed (0) -
src/cmd/compile/internal/ssa/numberlines.go
change = true } if change { ranges[i] = lp } } // Visit in reverse post order so that all non-loop predecessors come first. for j := len(po) - 1; j >= 0; j-- { b := po[j] // Find the first interesting position and check to see if it differs from any predecessor firstPos := src.NoXPos firstPosIndex := -1 if b.Pos.IsStmt() != src.PosNotStmt { note(b.Pos) }
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Mon Aug 14 21:26:13 UTC 2023 - 7.8K bytes - Viewed (0) -
tensorflow/compiler/mlir/tensorflow/transforms/move_tpu_compile_to_front.cc
while (op && op != func) { op->removeAttr("_is_compilation"); op->removeAttr("_wraps_compilation"); op = op->getParentOp(); } }); } int OutsideCompilationOrdering(Operation* predecessor, Operation* op) { // Actual compilations go first. if (op->hasAttr("_is_compilation")) return 2; // Followed by nested ops that contain compilations. if (op->hasAttr("_wraps_compilation")) return 1;
Registered: Sun Jun 16 05:45:23 UTC 2024 - Last Modified: Tue Oct 17 00:26:18 UTC 2023 - 3.2K 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) -
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) -
tensorflow/compiler/mlir/tensorflow/transforms/sparsecore/sparsecore_passes.td
let constructor = "TFDevice::CreateEmbeddingProgramKeyPass()"; let description = [{ Passes in the program key to embedding ops. Will move the embedding ops after a _TPUCompileMlir op if there is no predecessor _TPUCompileMlir op. Both the embedding op and compile op are assumed to be wrapped in separate tf_device.launch() ops. This is because the embedding op is head outside
Registered: Sun Jun 16 05:45:23 UTC 2024 - Last Modified: Thu Mar 28 23:42:09 UTC 2024 - 3.9K 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)