- Sort Score
- Result 10 results
- Languages All
Results 81 - 90 of 435 for goTo (0.06 sec)
-
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) -
platforms/core-configuration/kotlin-dsl/src/main/kotlin/org/gradle/kotlin/dsl/support/bytecode/AsmExtensions.kt
visitVarInsn(Opcodes.ALOAD, `var`) } internal fun MethodVisitor.ASTORE(`var`: Int) { visitVarInsn(Opcodes.ASTORE, `var`) } internal fun MethodVisitor.GOTO(label: Label) { visitJumpInsn(Opcodes.GOTO, label) } internal inline fun <reified T> MethodVisitor.TRY_CATCH( noinline tryBlock: MethodVisitor.() -> Unit, noinline catchBlock: MethodVisitor.() -> Unit ) =
Registered: Wed Jun 12 18:38:38 UTC 2024 - Last Modified: Wed Aug 02 08:06:49 UTC 2023 - 8.5K bytes - Viewed (0) -
src/cmd/compile/internal/ssa/fuse_branchredirect.go
// some such cases, we can redirect the predecessor If block to the // corresponding successor block directly. For example: // // p: // v11 = Less64 <bool> v10 v8 // If v11 goto b else u // b: <- p ... // v17 = Leq64 <bool> v10 v8 // If v17 goto s else o // // We can redirect p to s directly. // // The implementation here borrows the framework of the prove pass. // // 1, Traverse all blocks of function f to find If blocks.
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Tue May 16 21:40:11 UTC 2023 - 3.2K 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/ssa/cse_test.go
Valu("r5", OpAdd64, c.config.Types.Int64, 0, nil, "r2", "r3"), Valu("r10", OpAdd64, c.config.Types.Int64, 0, nil, "r6", "r9"), Valu("rstore", OpStore, types.TypeMem, 0, c.config.Types.Int64, "raddr", "r10", "raddrdef"), Goto("exit")), Bloc("exit", Exit("rstore"))) CheckFunc(fun.f) cse(fun.f) deadcode(fun.f) CheckFunc(fun.f) s1Cnt := 2 // r1 == r2 == r3, needs to remove two of this set s2Cnt := 1
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Fri Sep 08 19:09:14 UTC 2023 - 4.2K bytes - Viewed (0) -
src/strconv/atof.go
if d.nd == 0 { mant = 0 exp = flt.bias goto out } // Obvious overflow/underflow. // These bounds are for 64-bit floats. // Will have to change if we want to support 80-bit floats in the future. if d.dp > 310 { goto overflow } if d.dp < -330 { // zero mant = 0 exp = flt.bias goto out } // Scale by powers of two until in range [0.5, 1.0)
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Mon Jun 06 18:50:50 UTC 2022 - 15.9K 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)