- Sort Score
- Result 10 results
- Languages All
Results 1 - 10 of 306 for Reachable (0.25 sec)
-
src/cmd/vendor/golang.org/x/tools/go/analysis/passes/unreachable/unreachable.go
if x.Else != nil { r := d.reachable d.reachable = true d.findDead(x.Else) d.reachable = d.reachable || r } else { // might not have executed if statement d.reachable = true } case *ast.LabeledStmt: d.findDead(x.Stmt) case *ast.RangeStmt: d.findDead(x.Body) d.reachable = true case *ast.ReturnStmt: d.reachable = false case *ast.SelectStmt:
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Tue May 09 01:28:01 UTC 2023 - 7.6K bytes - Viewed (0) -
src/cmd/compile/internal/ssa/deadcode.go
} if !reachable[c.ID] { reachable[c.ID] = true p = append(p, c) // push } } } return reachable } // liveValues returns the live values in f and a list of values that are eligible // to be statements in reversed data flow order. // The second result is used to help conserve statement boundaries for debugging. // reachable is a map from block ID to whether the block is reachable.
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Fri Dec 08 00:29:01 UTC 2023 - 9.2K bytes - Viewed (0) -
src/cmd/compile/internal/ssa/print.go
fmt.Fprintln(p.w, f.Type) } func (p stringFuncPrinter) startBlock(b *Block, reachable bool) { if !p.printDead && !reachable { return } fmt.Fprintf(p.w, " b%d:", b.ID) if len(b.Preds) > 0 { io.WriteString(p.w, " <-") for _, e := range b.Preds { pred := e.b fmt.Fprintf(p.w, " b%d", pred.ID) } } if !reachable { fmt.Fprint(p.w, " DEAD") } io.WriteString(p.w, "\n") }
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Mon Oct 31 21:41:20 UTC 2022 - 3.9K bytes - Viewed (0) -
tensorflow/compiler/mlir/tf2xla/internal/mlir_bridge_pass_util.h
namespace tensorflow { // Checks if a graph or reachable functions in the library have any // StatefulPartitionedOps with _XlaMustCompile=true. The function library will // be skipped if nullptr is provided. bool IsSupportedByNonReplicatedBridge( const Graph& graph, const FunctionLibraryDefinition* function_library); // Checks if a graph or reachable functions in the library have any ops with
Registered: Sun Jun 16 05:45:23 UTC 2024 - Last Modified: Wed Mar 13 16:33:22 UTC 2024 - 2.3K bytes - Viewed (0) -
src/cmd/go/internal/mvs/graph.go
// To help catch disconnected-graph bugs, enforce that all required versions // are actually reachable from the roots (and therefore should affect the // selected versions of the modules they name). if _, reachable := g.isRoot[m]; !reachable { panic(fmt.Sprintf("%v is not reachable from any root", m)) } // Truncate reqs to its capacity to avoid aliasing bugs if it is later
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Thu Jun 01 02:52:19 UTC 2023 - 6.3K bytes - Viewed (0) -
src/cmd/link/internal/ld/deadcode.go
// // There are three ways a method of a reachable type can be invoked: // // 1. direct call // 2. through a reachable interface type // 3. reflect.Value.Method (or MethodByName), or reflect.Type.Method // (or MethodByName) // // The first case is handled by the flood fill, a directly called method // is marked as reachable. // // The second case is handled by decomposing all reachable interface
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Fri Jun 07 14:52:41 UTC 2024 - 19K bytes - Viewed (0) -
tensorflow/compiler/mlir/tensorflow/transforms/decompose_resource_ops_pass.cc
SymbolUserMap symbol_map(table, module); // Create map from caller to set of all callee(s). llvm::DenseMap<func::FuncOp, llvm::DenseSet<func::FuncOp>> caller_callee_map; // Use worklist to populate the set of reachable functions. std::queue<func::FuncOp> function_worklist; // Iterates over all functions within the module to (1) create caller-callee // map, and (2) initialize function worklist with functions referenced from
Registered: Sun Jun 16 05:45:23 UTC 2024 - Last Modified: Fri Sep 08 20:01:13 UTC 2023 - 8K bytes - Viewed (0) -
android/guava/src/com/google/common/graph/Traverser.java
} /** * Creates a new traverser for the given general {@code graph}. * * <p>Traversers created using this method are guaranteed to visit each node reachable from the * start node(s) at most once. * * <p>If you know that no node in {@code graph} is reachable by more than one path from the start * node(s), consider using {@link #forTree(SuccessorsFunction)} instead. * * <p><b>Performance notes</b> *
Registered: Wed Jun 12 16:38:11 UTC 2024 - Last Modified: Tue May 30 20:12:45 UTC 2023 - 19.8K bytes - Viewed (0) -
guava/src/com/google/common/graph/Traverser.java
} /** * Creates a new traverser for the given general {@code graph}. * * <p>Traversers created using this method are guaranteed to visit each node reachable from the * start node(s) at most once. * * <p>If you know that no node in {@code graph} is reachable by more than one path from the start * node(s), consider using {@link #forTree(SuccessorsFunction)} instead. * * <p><b>Performance notes</b> *
Registered: Wed Jun 12 16:38:11 UTC 2024 - Last Modified: Tue May 30 20:12:45 UTC 2023 - 19.8K bytes - Viewed (0) -
tensorflow/compiler/mlir/tensorflow/utils/tpu_cluster_util.cc
}); }); if (result.wasInterrupted()) return failure(); // Traverse ops that are reachable from some TPU cluster. // node_to_cluster is used to avoid traversing the same node twice, and to // check that no node is reachable from multiple TPU clusters. std::unordered_map<CallGraphNode*, tf_device::ClusterOp> node_to_cluster; while (!pending_call_nodes.empty()) {
Registered: Sun Jun 16 05:45:23 UTC 2024 - Last Modified: Tue Jun 06 04:50:13 UTC 2023 - 4.7K bytes - Viewed (0)