- Sort Score
- Result 10 results
- Languages All
Results 21 - 30 of 271 for goTo (0.04 sec)
-
src/go/types/call.go
if def != nil && def.typ == x.typ { check.cycleError([]Object{def}, 0) goto Error } case builtin: // types2 uses the position of '.' for the error check.errorf(e.Sel, UncalledBuiltin, "cannot select on %s", x) goto Error case invalid: goto Error } // Avoid crashing when checking an invalid selector in a method declaration // (i.e., where def is not set):
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Thu May 30 19:19:55 UTC 2024 - 33.5K bytes - Viewed (0) -
src/runtime/map_fast64.go
// change those to emptyRest states. if i == abi.MapBucketCount-1 { if b.overflow(t) != nil && b.overflow(t).tophash[0] != emptyRest { goto notLast } } else { if b.tophash[i+1] != emptyRest { goto notLast } } for { b.tophash[i] = emptyRest if i == 0 { if b == bOrig { break // beginning of initial bucket, we're done. }
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Thu May 23 01:17:26 UTC 2024 - 14.1K bytes - Viewed (0) -
src/go/build/read.go
} continue } if c == '"' { c = r.readByteNoBuf() goto Reswitch } } goto Reswitch case '`': startLine = false for r.err == nil { if r.eof { r.syntaxError() } c = r.readByteNoBuf() if c == '`' { c = r.readByteNoBuf() goto Reswitch } } case '\'': startLine = false
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Wed May 29 16:25:21 UTC 2024 - 14.1K bytes - Viewed (0) -
src/runtime/map_fast32.go
// change those to emptyRest states. if i == abi.MapBucketCount-1 { if b.overflow(t) != nil && b.overflow(t).tophash[0] != emptyRest { goto notLast } } else { if b.tophash[i+1] != emptyRest { goto notLast } } for { b.tophash[i] = emptyRest if i == 0 { if b == bOrig { break // beginning of initial bucket, we're done. }
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Thu May 23 01:17:26 UTC 2024 - 13.9K bytes - Viewed (0) -
src/cmd/vendor/golang.org/x/tools/go/cfg/builder.go
b.add(spec) } } } case *ast.LabeledStmt: label = b.labeledBlock(s.Label, s) b.jump(label._goto) b.current = label._goto _s = s.Stmt goto start // effectively: tailcall stmt(g, s.Stmt, label) case *ast.ReturnStmt: b.add(s) b.current = b.newBlock(KindUnreachable, s) case *ast.BranchStmt: b.branchStmt(s) case *ast.BlockStmt:
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Tue Apr 02 02:20:05 UTC 2024 - 11.4K bytes - Viewed (0) -
src/runtime/map_faststr.go
// change those to emptyRest states. if i == abi.MapBucketCount-1 { if b.overflow(t) != nil && b.overflow(t).tophash[0] != emptyRest { goto notLast } } else { if b.tophash[i+1] != emptyRest { goto notLast } } for { b.tophash[i] = emptyRest if i == 0 { if b == bOrig { break // beginning of initial bucket, we're done. }
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Thu May 23 01:17:26 UTC 2024 - 15.3K bytes - Viewed (0) -
src/cmd/compile/internal/rangefunc/rewrite.go
var next int var ret *syntax.ReturnStmt if x.Tok == syntax.Goto || i < 0 { // goto Label // or break/continue of labeled non-range-over-func loop (x.Label != nil). // We may be able to leave it alone, or we may have to break // out of one or more nested loops and then use #next to signal // to complete the break/continue/goto. // Figure out which range-over-func loop contains the label. r.computeBranchNext()
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Thu May 23 01:05:44 UTC 2024 - 41.6K bytes - Viewed (0) -
src/cmd/compile/internal/typecheck/typecheck.go
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Wed Mar 20 19:08:34 UTC 2024 - 30.5K bytes - Viewed (0) -
src/runtime/mcentral.go
// allocation if the budget runs low. spanBudget := 100 var s *mspan var sl sweepLocker // Try partial swept spans first. sg := mheap_.sweepgen if s = c.partialSwept(sg).pop(); s != nil { goto havespan } sl = sweep.active.begin() if sl.valid { // Now try partial unswept spans. for ; spanBudget >= 0; spanBudget-- { s = c.partialUnswept(sg).pop() if s == nil { break }
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Mon Mar 25 19:53:03 UTC 2024 - 8.1K bytes - Viewed (0) -
src/internal/bytealg/compare_generic.go
package bytealg import _ "unsafe" // for go:linkname func Compare(a, b []byte) int { l := len(a) if len(b) < l { l = len(b) } if l == 0 || &a[0] == &b[0] { goto samebytes } for i := 0; i < l; i++ { c1, c2 := a[i], b[i] if c1 < c2 { return -1 } if c1 > c2 { return +1 } } samebytes: if len(a) < len(b) { return -1 }
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Wed May 29 17:58:53 UTC 2024 - 1.5K bytes - Viewed (0)