- Sort Score
- Result 10 results
- Languages All
Results 101 - 110 of 271 for goTo (0.1 sec)
-
test/prove.go
func oforuntil(b []int) { i := 0 if len(b) > i { top: println(b[i]) // ERROR "Induction variable: limits \[0,\?\), increment 1$" "Proved IsInBounds$" i++ if i < len(b) { goto top } } } func atexit(foobar []func()) { for i := len(foobar) - 1; i >= 0; i-- { // ERROR "Induction variable: limits \[0,\?\], increment 1" f := foobar[i]
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Tue Jan 23 00:02:36 UTC 2024 - 21.2K bytes - Viewed (0) -
src/internal/trace/gc.go
// worse. for i, ui := range acc.wHeap { if time+int64(window) > ui.Time && ui.Time+int64(window) > time { if ui.MutatorUtil <= mu { // Keep the first window. goto keep } else { // Replace it with this window. heap.Remove(&acc.wHeap, i) break } } } heap.Push(&acc.wHeap, UtilWindow{time, mu}) if len(acc.wHeap) > acc.nWorst {
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Fri May 17 18:48:18 UTC 2024 - 26K bytes - Viewed (0) -
src/cmd/link/internal/ld/elf.go
aux *Elfaux file string } func addelflib(list **Elflib, file string, vers string) *Elfaux { var lib *Elflib for lib = *list; lib != nil; lib = lib.next { if lib.file == file { goto havelib } } lib = new(Elflib) lib.next = *list lib.file = file *list = lib havelib: for aux := lib.aux; aux != nil; aux = aux.next { if aux.vers == vers { return aux }
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Mon Apr 22 13:29:54 UTC 2024 - 63.6K bytes - Viewed (0) -
src/runtime/mgc.go
// previous termination check, so there may be more // work to do. Keep going. It's possible the // transition condition became true again during the // ragged barrier, so re-check it. semrelease(&worldsema) goto top } // There was no global work, no local work, and no Ps // communicated work since we took markDoneSema. Therefore // there are no grey objects and no more objects can be
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Wed May 29 16:25:21 UTC 2024 - 62K bytes - Viewed (0) -
src/cmd/compile/internal/ssagen/ssa.go
break } lab := s.label(sym) // The label might already have a target block via a goto. if lab.target == nil { lab.target = s.f.NewBlock(ssa.BlockPlain) } // Go to that label. // (We pretend "label:" is preceded by "goto label", unless the predecessor is unreachable.) if s.curBlock != nil { b := s.endBlock() b.AddEdgeTo(lab.target) }
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Mon Jun 10 19:44:43 UTC 2024 - 284.9K bytes - Viewed (0) -
src/runtime/malloc.go
// // Only do this if we're using the regular heap arena hints. // This behavior is only for the heap. v = h.arena.alloc(n, heapArenaBytes, &gcController.heapReleased) if v != nil { size = n goto mapped } } // Try to grow the heap at a hint address. for *hintList != nil { hint := *hintList p := hint.addr if hint.down { p -= n } if p+n < p {
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Wed May 29 17:58:53 UTC 2024 - 59.6K bytes - Viewed (0) -
src/cmd/compile/internal/types2/stmt.go
case ctxt&inTypeSwitch != 0: msg = "cannot fallthrough in type switch" default: msg = "fallthrough statement out of place" } check.error(s, MisplacedFallthrough, msg) } case syntax.Goto: // goto's must have labels, should have been caught above fallthrough default: check.errorf(s, InvalidSyntaxTree, "branch statement: %s", s.Tok) } case *syntax.BlockStmt:
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Thu May 30 19:19:55 UTC 2024 - 30.7K bytes - Viewed (0) -
src/runtime/stack.go
print("adjust ptr ", hex(p), " ", funcname(f), "\n") } if useCAS { ppu := (*unsafe.Pointer)(unsafe.Pointer(pp)) if !atomic.Casp1(ppu, unsafe.Pointer(p), unsafe.Pointer(p+delta)) { goto retry } } else { *pp = p + delta } } } } } // Note: the argument/return area is adjusted by the callee. func adjustframe(frame *stkframe, adjinfo *adjustinfo) {
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Wed May 22 22:31:00 UTC 2024 - 41.1K bytes - Viewed (0) -
src/strings/strings.go
// form of case-insensitivity. func EqualFold(s, t string) bool { // ASCII fast path i := 0 for ; i < len(s) && i < len(t); i++ { sr := s[i] tr := t[i] if sr|tr >= utf8.RuneSelf { goto hasUnicode } // Easy case. if tr == sr { continue } // Make sr < tr to simplify what follows. if tr < sr { tr, sr = sr, tr }
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Fri May 03 16:48:16 UTC 2024 - 31.2K bytes - Viewed (0) -
src/runtime/mgcsweep.go
if sweepone() == ^uintptr(0) { mheap_.sweepPagesPerByte = 0 break } if mheap_.pagesSweptBasis.Load() != sweptBasis { // Sweep pacing changed. Recompute debt. goto retry } } trace = traceAcquire() if trace.ok() { trace.GCSweepDone() traceRelease(trace) } } // clobberfree sets the memory content at x to bad content, for debugging
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Wed May 08 17:52:18 UTC 2024 - 32.9K bytes - Viewed (0)