- Sort Score
- Result 10 results
- Languages All
Results 31 - 40 of 662 for walkFn (0.14 sec)
-
tensorflow/compiler/mlir/tensorflow/utils/tpu_cluster_util.h
#include "tensorflow/compiler/mlir/tensorflow/utils/tpu_rewrite_device_util.h" namespace mlir { namespace TFTPU { // For each TPU cluster in `module`, walk over all ops inside the cluster // and reachable in the call graph from the cluster. // For each op walked, `callback` is applied to the op, the root cluster, and // the root cluster's host device. `callback` returning WasInterrupted // indicates failure.
Registered: Sun Jun 16 05:45:23 UTC 2024 - Last Modified: Tue Jun 06 04:50:13 UTC 2023 - 2.1K bytes - Viewed (0) -
src/cmd/doc/dirs.go
if !ok { return Dir{}, false } d.hist = append(d.hist, dir) d.offset++ return dir, ok } // walk walks the trees in GOROOT and GOPATH. func (d *Dirs) walk(roots []Dir) { for _, root := range roots { d.bfsWalkRoot(root) } close(d.scan) } // bfsWalkRoot walks a single directory hierarchy in breadth-first lexical order. // Each Go source directory it finds is delivered on d.scan.
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Mon May 02 17:49:12 UTC 2022 - 9K bytes - Viewed (0) -
cmd/preferredimports/preferredimports.go
if err != nil { log.Fatalf("Error compiling regex: %v", err) } c := collector{regex: regex} for _, arg := range args { err := filepath.Walk(arg, c.handlePath) if err != nil { log.Fatalf("Error walking: %v", err) } } sort.Strings(c.dirs) if len(*importAliases) > 0 { bytes, err := os.ReadFile(*importAliases) if err != nil {
Registered: Sat Jun 15 01:39:40 UTC 2024 - Last Modified: Fri Mar 01 06:06:44 UTC 2024 - 7.1K bytes - Viewed (0) -
subprojects/core/src/test/groovy/org/gradle/api/internal/file/copy/CopySpecBackedCopyActionProcessingStreamTest.groovy
Registered: Wed Jun 12 18:38:38 UTC 2024 - Last Modified: Tue Jul 20 13:25:37 UTC 2021 - 1.6K bytes - Viewed (0) -
test/fixedbugs/issue8048.go
// license that can be found in the LICENSE file. // Issue 8048. Incorrect handling of liveness when walking stack // containing faulting frame. package main import "runtime" func main() { test1() test2() test3() } func test1() { // test1f will panic without its own defer. // The runtime.GC checks that we can walk the stack // at that point and not get confused. // The recover lets test1 exit normally.
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Mon May 02 13:43:18 UTC 2016 - 2K bytes - Viewed (0) -
src/go/types/stdlib_test.go
return filenames, nil } func walkPkgDirs(dir string, pkgh func(dir string, filenames []string), errh func(args ...any)) { w := walker{pkgh, errh} w.walk(dir) } type walker struct { pkgh func(dir string, filenames []string) errh func(args ...any) } func (w *walker) walk(dir string) { files, err := os.ReadDir(dir) if err != nil { w.errh(err) return }
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Tue Dec 19 04:39:56 UTC 2023 - 13.7K bytes - Viewed (0) -
src/cmd/compile/internal/types2/stdlib_test.go
} func walkPkgDirs(dir string, pkgh func(dir string, filenames []string), errh func(args ...interface{})) { w := walker{pkgh, errh} w.walk(dir) } type walker struct { pkgh func(dir string, filenames []string) errh func(args ...any) } func (w *walker) walk(dir string) { files, err := os.ReadDir(dir) if err != nil { w.errh(err) return }
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Thu May 30 19:18:33 UTC 2024 - 13.3K bytes - Viewed (0) -
platforms/core-runtime/base-services/src/test/groovy/org/gradle/internal/graph/CachingDirectedGraphWalkerTest.groovy
0 * _._ when: walker.add(1) def values = walker.findValues() then: values == ['1', '2', '3', '4'] as Set when: walker.add(2) values = walker.findValues() then: values == ['1', '2', '3', '4'] as Set when: walker.add(3) values = walker.findValues() then:
Registered: Wed Jun 12 18:38:38 UTC 2024 - Last Modified: Fri Sep 22 08:48:02 UTC 2023 - 9.9K bytes - Viewed (0) -
src/cmd/compile/internal/ssa/sparsetree.go
// // Entry and exit values are assigned in a depth-first dominator tree walk. // For all blocks x and y, one of the following holds: // // (x-dom-y) x dominates y => entry(x) < entry(y) < exit(y) < exit(x) // (y-dom-x) y dominates x => entry(y) < entry(x) < exit(x) < exit(y) // (x-then-y) neither x nor y dominates the other and x walked before y => entry(x) < exit(x) < entry(y) < exit(y)
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Fri Nov 18 17:59:44 UTC 2022 - 8.1K bytes - Viewed (0) -
src/cmd/link/internal/ld/stackcheck.go
// target of an indirect/closure call. const stackCheckIndirect loader.Sym = ^loader.Sym(0) // doStackCheck walks the call tree to check that there is always // enough stack space for call frames, especially for a chain of // nosplit functions. // // It walks all functions to accumulate the number of bytes they can // grow the stack by without a split check and checks this against the // limit.
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Mon Apr 24 16:49:08 UTC 2023 - 11.9K bytes - Viewed (0)