- Sort Score
- Result 10 results
- Languages All
Results 1 - 10 of 17 for augPos (0.23 sec)
-
src/cmd/vendor/golang.org/x/tools/go/ast/astutil/enclosing.go
for i, child := range children { // [childPos, childEnd) is unaugmented interval of child. childPos := child.Pos() childEnd := child.End() // [augPos, augEnd) is whitespace-augmented interval of child. augPos := childPos augEnd := childEnd if i > 0 { augPos = children[i-1].End() // start of preceding whitespace } if i < l-1 { nextChildPos := children[i+1].Pos()
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Mon Dec 18 21:28:13 UTC 2023 - 15.9K bytes - Viewed (0) -
src/cmd/compile/internal/ssa/deadstore.go
if ok && elim[v] == nil { elim[v] = n changed = true } // Other args might hold pointers to autos. args = args[1:] } // The code below assumes that we have handled all the ops // with sym effects already. Sanity check that here. // Ignore Args since they can't be autos. if v.Op.SymEffect() != SymNone && v.Op != OpArg { panic("unhandled op with sym effect") }
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Thu Apr 25 20:07:26 UTC 2024 - 11K bytes - Viewed (0) -
docs/ftp/README.md
diffie-hellman-group1-sha1 ``` `--sftp=cipher-algos=...` specifies the allowed cipher algorithms. If unspecified then a sensible default is used. Valid values: ``` aes128-ctr aes192-ctr aes256-ctr ******@****.*** ******@****.*** ******@****.*** arcfour256 arcfour128 arcfour aes128-cbc 3des-cbc ```
Registered: Sun Jun 16 00:44:34 UTC 2024 - Last Modified: Tue May 07 06:41:25 UTC 2024 - 7.8K bytes - Viewed (0) -
cmd/sftp-server.go
sshPrivateKey = tokens[1] case "pub-key-algos": allowPubKeys = filterAlgos(arg, strings.Split(tokens[1], ","), supportedPubKeyAuthAlgos) case "kex-algos": allowKexAlgos = filterAlgos(arg, strings.Split(tokens[1], ","), supportedKexAlgos) case "cipher-algos": allowCiphers = filterAlgos(arg, strings.Split(tokens[1], ","), supportedCiphers) case "mac-algos":
Registered: Sun Jun 16 00:44:34 UTC 2024 - Last Modified: Wed Jun 05 07:51:13 UTC 2024 - 16K bytes - Viewed (0) -
src/cmd/compile/internal/ssagen/pgen.go
// Sort non-autos before autos. if needAlloc(a) != needAlloc(b) { return needAlloc(b) } // If both are non-auto (e.g., parameters, results), then sort by // frame offset (defined by ABI). if !needAlloc(a) { return a.FrameOffset() < b.FrameOffset() } // From here on, a and b are both autos (i.e., local variables). // Sort followers after leaders, if mls != nil
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Wed May 15 15:44:14 UTC 2024 - 13.1K bytes - Viewed (0) -
src/cmd/compile/internal/test/testdata/addressed_test.go
// addressed. Which is expected to be one of 11-13, 21-23, 31, 32, // and y.val() should be equal to which and y.p.val() should // be equal to z.val(). Also, x(.p)**8 == x; that is, the // autos are all linked into a ring. // //go:noinline func (v V) autos_ssa(which, w1, x1, w2, x2 int64) (y, z V) { fill_ssa(v.w, v.x, &v, v.p) // gratuitous no-op to force addressing var a, b, c, d, e, f, g, h V
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Tue Apr 05 17:54:15 UTC 2022 - 4.4K bytes - Viewed (0) -
src/database/sql/fakedb_test.go
if strvalue, ok := s.colValue[n].(string); ok && strings.HasPrefix(strvalue, "?") { if strvalue == "?" { val = args[argPos].Value } else { // Assign value from argument placeholder name. if v := valueFromPlaceholderName(args, strvalue[1:]); v != nil { val = v } } argPos++ } else { val = s.colValue[n] } if doInsert { cols[colidx] = val } }
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Mon Apr 01 12:38:07 UTC 2024 - 30.3K bytes - Viewed (0) -
src/cmd/compile/internal/ssa/_gen/rulegen.go
rr.add(declf(rr.Loc, argname, "%s", rhs)) } bexpr := exprf("%s.Op != addLater", argname) rr.add(&CondBreak{Cond: bexpr}) argPos, argCheckOp := genMatch0(rr, arch, expr, argname, cnt, false) bexpr.(*ast.BinaryExpr).Y.(*ast.Ident).Name = argCheckOp if argPos != "" { // Keep the argument in preference to the parent, as the // argument is normally earlier in program flow.
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Sat Sep 02 22:09:21 UTC 2023 - 48.7K bytes - Viewed (0) -
src/cmd/compile/internal/ssa/stackalloc.go
nNotNeed, // Number of Values not needing a stack slot nNamedSlot, // Number of Values using a named stack slot nReuse, // Number of values reusing a stack slot nAuto, // Number of autos allocated for stack slots. nSelfInterfere int32 // Number of self-interferences } func newStackAllocState(f *Func) *stackAllocState { s := f.Cache.stackAllocState if s == nil { return new(stackAllocState) }
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Thu Feb 29 21:29:41 UTC 2024 - 12.6K bytes - Viewed (0) -
src/cmd/compile/internal/ssa/compile.go
{name: "lowered deadcode for cse", fn: deadcode}, // deadcode immediately before CSE avoids CSE making dead values live again {name: "lowered cse", fn: cse}, {name: "elim unread autos", fn: elimUnreadAutos}, {name: "tighten tuple selectors", fn: tightenTupleSelectors, required: true}, {name: "lowered deadcode", fn: deadcode, required: true}, {name: "checkLower", fn: checkLower, required: true},
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Mon Apr 22 14:55:18 UTC 2024 - 18.6K bytes - Viewed (0)