Search Options

Results per page
Sort
Preferred Languages
Advance

Results 41 - 50 of 128 for goTo (0.06 sec)

  1. src/math/rand/rand.go

    	// Instead of that, if we round up to 1, just try again.
    	// Getting 1 only happens 1/2⁵³ of the time, so most clients
    	// will not observe it anyway.
    again:
    	f := float64(r.Int63()) / (1 << 63)
    	if f == 1 {
    		goto again // resample; this branch is taken O(never)
    	}
    	return f
    }
    
    // Float32 returns, as a float32, a pseudo-random number in the half-open interval [0.0,1.0).
    func (r *Rand) Float32() float32 {
    Registered: Wed Jun 12 16:32:35 UTC 2024
    - Last Modified: Wed May 22 22:09:08 UTC 2024
    - 16.9K bytes
    - Viewed (0)
  2. cmd/sftp-server-driver.go

    		w.nextOffset += int64(n)
    		if n != len(nextOut) {
    			return 0, fmt.Errorf("expected write size %d but wrote %d bytes", len(nextOut), n)
    		}
    		if err != nil {
    			return 0, err
    		}
    		goto again
    	}
    
    	return len(b), nil
    }
    
    func (f *sftpDriver) Filewrite(r *sftp.Request) (w io.WriterAt, err error) {
    	stopFn := globalSftpMetrics.log(r, f.AccessKey())
    	defer func() {
    		if err != nil {
    Registered: Sun Jun 16 00:44:34 UTC 2024
    - Last Modified: Wed Jun 05 07:51:13 UTC 2024
    - 11.1K bytes
    - Viewed (0)
  3. src/runtime/proc.go

    		unlock(&sched.lock)
    		goto top
    	}
    	if sched.runqsize != 0 {
    		gp := globrunqget(pp, 0)
    		unlock(&sched.lock)
    		return gp, false, false
    	}
    	if !mp.spinning && sched.needspinning.Load() == 1 {
    		// See "Delicate dance" comment below.
    		mp.becomeSpinning()
    		unlock(&sched.lock)
    		goto top
    	}
    	if releasep() != pp {
    		throw("findrunnable: wrong p")
    Registered: Wed Jun 12 16:32:35 UTC 2024
    - Last Modified: Wed May 29 17:58:53 UTC 2024
    - 207.5K bytes
    - Viewed (0)
  4. src/runtime/map.go

    			// for loops are not currently inlineable.
    			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: Wed May 29 17:58:53 UTC 2024
    - 57.6K bytes
    - Viewed (0)
  5. src/cmd/compile/internal/ssa/deadstore.go

    			// the first logical store in the block.
    			// (Even if it isn't the first in the current b.Values order.)
    			continue
    		}
    		for _, a := range v.Args {
    			if a.Block == b && a.Type.IsMemory() {
    				v = a
    				goto walkloop
    			}
    		}
    	}
    }
    
    // A shadowRange encodes a set of byte offsets [lo():hi()] from
    // a given pointer that will be written to later in the block.
    Registered: Wed Jun 12 16:32:35 UTC 2024
    - Last Modified: Thu Apr 25 20:07:26 UTC 2024
    - 11K bytes
    - Viewed (0)
  6. src/runtime/iface.go

    	t := (*itabTableType)(atomic.Loadp(unsafe.Pointer(&itabTable)))
    	if m = t.find(inter, typ); m != nil {
    		goto finish
    	}
    
    	// Not found.  Grab the lock and try again.
    	lock(&itabLock)
    	if m = itabTable.find(inter, typ); m != nil {
    		unlock(&itabLock)
    		goto finish
    	}
    
    	// Entry doesn't exist yet. Make a new entry & add it.
    Registered: Wed Jun 12 16:32:35 UTC 2024
    - Last Modified: Wed May 29 17:58:53 UTC 2024
    - 22.5K bytes
    - Viewed (0)
  7. cmd/s3-zip-handlers.go

    					if len(listObjectsInfo.Prefixes) == 0 || commonPrefix != listObjectsInfo.Prefixes[len(listObjectsInfo.Prefixes)-1] {
    						listObjectsInfo.Prefixes = append(listObjectsInfo.Prefixes, commonPrefix)
    						count++
    					}
    					goto next
    				}
    			}
    			listObjectsInfo.Objects = append(listObjectsInfo.Objects, ObjectInfo{
    				Bucket:  bucket,
    				Name:    objName,
    				Size:    int64(file.UncompressedSize64),
    				ModTime: zipObjInfo.ModTime,
    Registered: Sun Jun 16 00:44:34 UTC 2024
    - Last Modified: Mon Jun 10 15:31:51 UTC 2024
    - 15.8K bytes
    - Viewed (0)
  8. cmd/sftp-server.go

    		if !globalIAMSys.LDAPConfig.Enabled() {
    			return nil, errSFTPLDAPNotEnabled
    		}
    		return processLDAPAuthentication(key, pass, user)
    	}
    
    	user, found = strings.CutSuffix(c.User(), "=svc")
    	if found {
    		goto internalAuth
    	}
    
    	if globalIAMSys.LDAPConfig.Enabled() {
    		perms, _ := processLDAPAuthentication(key, pass, user)
    		if perms != nil {
    			return perms, nil
    		}
    	}
    
    internalAuth:
    Registered: Sun Jun 16 00:44:34 UTC 2024
    - Last Modified: Wed Jun 05 07:51:13 UTC 2024
    - 16K bytes
    - Viewed (0)
  9. src/cmd/compile/internal/liveness/plive.go

    				continue
    			}
    			// WBend appears at the start of a block, like this:
    			//    ...
    			//    if wbEnabled: goto C else D
    			// C:
    			//    ... some write barrier enabled code ...
    			//    goto B
    			// D:
    			//    ... some write barrier disabled code ...
    			//    goto B
    			// B:
    			//    m1 = Phi mem_C mem_D
    			//    m2 = store operation ... m1
    			//    m3 = store operation ... m2
    Registered: Wed Jun 12 16:32:35 UTC 2024
    - Last Modified: Fri Jun 07 15:22:22 UTC 2024
    - 45.2K bytes
    - Viewed (0)
  10. src/cmd/go/internal/load/pkg.go

    			// the same directory, it's likely an error (see below).
    			goto omitVCS
    		}
    		if cfg.BuildBuildvcs == "auto" && vcsCmd != nil && vcsCmd.Cmd != "" {
    			if _, err := cfg.LookPath(vcsCmd.Cmd); err != nil {
    				// We fould a repository, but the required VCS tool is not present.
    				// "-buildvcs=auto" means that we should silently drop the VCS metadata.
    				goto omitVCS
    			}
    		}
    	}
    Registered: Wed Jun 12 16:32:35 UTC 2024
    - Last Modified: Tue May 28 17:00:51 UTC 2024
    - 120K bytes
    - Viewed (0)
Back to top