- Sort Score
- Result 10 results
- Languages All
Results 11 - 20 of 590 for walkP (0.04 sec)
-
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) -
src/path/filepath/path.go
} } return nil } // walk recursively descends path, calling walkFn. func walk(path string, info fs.FileInfo, walkFn WalkFunc) error { if !info.IsDir() { return walkFn(path, info, nil) } names, err := readDirNames(path) err1 := walkFn(path, info, err) // If err != nil, walk can't walk into this directory. // err1 != nil means walkFn want walk to skip this directory or stop walking.
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Thu May 23 01:00:11 UTC 2024 - 15.5K bytes - Viewed (0) -
src/cmd/compile/internal/walk/expr.go
} return n } // walkDot walks an ODOT or ODOTPTR node. func walkDot(n *ir.SelectorExpr, init *ir.Nodes) ir.Node { usefield(n) n.X = walkExpr(n.X, init) return n } // walkDotType walks an ODOTTYPE or ODOTTYPE2 node. func walkDotType(n *ir.TypeAssertExpr, init *ir.Nodes) ir.Node { n.X = walkExpr(n.X, init)
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Mon Mar 04 17:34:01 UTC 2024 - 27.6K 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) -
src/cmd/compile/internal/ssagen/nowb.go
extraCalls map[*ir.Func][]nowritebarrierrecCall // curfn is the current function during AST walks. curfn *ir.Func } type nowritebarrierrecCall struct { target *ir.Func // caller or callee lineno src.XPos // line of call } // newNowritebarrierrecChecker creates a nowritebarrierrecChecker. It // must be called before walk. func newNowritebarrierrecChecker() *nowritebarrierrecChecker { c := &nowritebarrierrecChecker{
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Wed May 15 17:29:46 UTC 2024 - 5.9K bytes - Viewed (0) -
src/cmd/compile/internal/walk/stmt.go
// to avoid confusion about what gets returned // in the presence of type assertions. } func walkStmtList(s []ir.Node) { for i := range s { s[i] = walkStmt(s[i]) } } // walkFor walks an OFOR node. func walkFor(n *ir.ForStmt) ir.Node { if n.Cond != nil { init := ir.TakeInit(n.Cond) walkStmtList(init) n.Cond = walkExpr(n.Cond, &init) n.Cond = ir.InitExpr(init, n.Cond) }
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Fri Oct 06 15:42:30 UTC 2023 - 4.7K bytes - Viewed (0) -
src/cmd/cgo/ast.go
f.walk(n.Body, ctxTypeSwitch, visit) case *ast.CommClause: f.walk(n.Comm, ctxStmt, visit) f.walk(n.Body, ctxStmt, visit) case *ast.SelectStmt: f.walk(n.Body, ctxStmt, visit) case *ast.ForStmt: f.walk(n.Init, ctxStmt, visit) f.walk(&n.Cond, ctxExpr, visit) f.walk(n.Post, ctxStmt, visit) f.walk(n.Body, ctxStmt, visit) case *ast.RangeStmt: f.walk(&n.Key, ctxExpr, visit)
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Wed Jun 07 16:54:27 UTC 2023 - 14.3K bytes - Viewed (0) -
src/go/parser/resolver.go
} else { ast.Walk(r, kv.Key) } ast.Walk(r, kv.Value) } else { ast.Walk(r, e) } } case *ast.InterfaceType: r.openScope(n.Pos()) defer r.closeScope() r.walkFieldList(n.Methods, ast.Fun) // Statements case *ast.LabeledStmt: r.declare(n, nil, r.labelScope, ast.Lbl, n.Label) ast.Walk(r, n.Stmt) case *ast.AssignStmt:
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Thu Nov 02 12:56:53 UTC 2023 - 15.8K bytes - Viewed (0) -
pkg/util/iptree/iptree.go
bitPosition = n.prefix.Bits() } recursiveWalk[T](n, fn) } // WalkPath is used to walk the tree, but only visiting nodes // from the root down to a given IP prefix. Where WalkPrefix walks // all the entries *under* the given prefix, this walks the // entries *above* the given prefix. func (t *Tree[T]) WalkPath(path netip.Prefix, fn WalkFn[T]) { n := t.rootV4 if path.Addr().Is6() {
Registered: Sat Jun 15 01:39:40 UTC 2024 - Last Modified: Tue Oct 31 21:05:04 UTC 2023 - 17.7K bytes - Viewed (0) -
pkg/kubelet/pluginmanager/pluginwatcher/plugin_watcher.go
func (w *Watcher) Start(stopCh <-chan struct{}) error { klog.V(2).InfoS("Plugin Watcher Start", "path", w.path) // Creating the directory to be watched if it doesn't exist yet, // and walks through the directory to discover the existing plugins. if err := w.init(); err != nil { return err } fsWatcher, err := fsnotify.NewWatcher() if err != nil {
Registered: Sat Jun 15 01:39:40 UTC 2024 - Last Modified: Sun Jan 01 00:26:37 UTC 2023 - 6.1K bytes - Viewed (0)