- Sort Score
- Result 10 results
- Languages All
Results 1 - 10 of 235 for walkP (0.04 sec)
-
src/cmd/compile/internal/walk/walk.go
const tmpstringbufsize = 32 func Walk(fn *ir.Func) { ir.CurFunc = fn errorsBefore := base.Errors() order(fn) if base.Errors() > errorsBefore { return } if base.Flag.W != 0 { s := fmt.Sprintf("\nbefore walk %v", ir.CurFunc.Sym()) ir.DumpList(s, ir.CurFunc.Body) } walkStmtList(ir.CurFunc.Body) if base.Flag.W != 0 { s := fmt.Sprintf("after walk %v", ir.CurFunc.Sym())
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Tue Feb 27 20:56:00 UTC 2024 - 10.4K bytes - Viewed (0) -
cmd/metacache-walk.go
if s.walkMu != nil { s.walkMu.Unlock() } if err != nil { // Folder could have gone away in-between if err != errVolumeNotFound && err != errFileNotFound { internalLogOnceIf(ctx, err, "metacache-walk-scan-dir") } if opts.ReportNotFound && err == errFileNotFound && current == opts.BaseDir { err = errFileNotFound } else { err = nil } diskHealthCheckOK(ctx, err) return err
Registered: Sun Jun 16 00:44:34 UTC 2024 - Last Modified: Sat Jun 01 05:17:37 UTC 2024 - 12.4K bytes - Viewed (0) -
src/cmd/compile/internal/walk/convert.go
// pointers, usually for alignment." var originals []ir.Node var walk func(n ir.Node) walk = func(n ir.Node) { switch n.Op() { case ir.OADD: n := n.(*ir.BinaryExpr) walk(n.X) walk(n.Y) case ir.OSUB, ir.OANDNOT: n := n.(*ir.BinaryExpr) walk(n.X) case ir.OCONVNOP: n := n.(*ir.ConvExpr) if n.X.Type().IsUnsafePtr() {
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Mon Oct 09 17:28:22 UTC 2023 - 18.2K 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/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) -
tensorflow/compiler/mlir/tensorflow/analysis/resource_alias_analysis.cc
// for such regions to a new unique-id. This is required because walk() walks // the attached regions first before visiting the op, so there is no // opportunity during the walk to seed region arguments. Also note that walk // eventually also visits the Op on which the walk() is called, so make sure // we do not overwrite the function argument mapping here. func_op.walk([&](Operation* op) { if (op == func_op) return;
Registered: Sun Jun 16 05:45:23 UTC 2024 - Last Modified: Wed May 15 09:04:13 UTC 2024 - 28.2K bytes - Viewed (0)