Search Options

Results per page
Sort
Preferred Languages
Advance

Results 1 - 10 of 312 for eidx (3.92 sec)

  1. src/cmd/compile/internal/inline/inlheur/funcprops_test.go

    		n := len(dentries)
    		eidx := 0
    		for i := 0; i < n; i++ {
    			dentry := dentries[i]
    			dcst := dcsites[i]
    			if !interestingToCompare(dentry.fname) {
    				continue
    			}
    			if eidx >= len(eentries) {
    				t.Errorf("testcase %s missing expected entry for %s, skipping", tc, dentry.fname)
    				continue
    			}
    			eentry := eentries[eidx]
    			ecst := ecsites[eidx]
    			eidx++
    			if dentry.fname != eentry.fname {
    Registered: Wed Jun 12 16:32:35 UTC 2024
    - Last Modified: Thu Nov 16 20:15:25 UTC 2023
    - 15K bytes
    - Viewed (0)
  2. cmd/admin-handlers_test.go

    	// Test all combinations!
    	for pIdx, params := range qParamsArr {
    		for vIdx, vars := range varsArr {
    			_, err := extractHealInitParams(vars, params, bytes.NewReader([]byte(body)))
    			isErrCase := false
    			if pIdx < 4 || vIdx < 1 {
    				isErrCase = true
    			}
    
    			if err != ErrNone && !isErrCase {
    				t.Errorf("Got unexpected error: %v %v %v", pIdx, vIdx, err)
    			} else if err == ErrNone && isErrCase {
    Registered: Sun Jun 16 00:44:34 UTC 2024
    - Last Modified: Thu Feb 22 06:26:06 UTC 2024
    - 13.8K bytes
    - Viewed (0)
  3. cmd/data-usage-cache.go

    func (h *sizeHistogram) mergeV1(v sizeHistogramV1) {
    	var oidx, nidx int
    	for oidx < len(v) {
    		intOld, intNew := ObjectsHistogramIntervalsV1[oidx], ObjectsHistogramIntervals[nidx]
    		// skip intervals that aren't common to both histograms
    		if intOld.start != intNew.start || intOld.end != intNew.end {
    			nidx++
    			continue
    		}
    		h[nidx] += v[oidx]
    		oidx++
    		nidx++
    	}
    }
    
    Registered: Sun Jun 16 00:44:34 UTC 2024
    - Last Modified: Fri May 10 14:49:50 UTC 2024
    - 42.8K bytes
    - Viewed (0)
  4. src/cmd/link/internal/arm64/asm.go

    				return false
    			}
    			su.SetRelocType(rIdx, objabi.R_ARM64_PCREL)
    			return true
    		}
    		ld.AddGotSym(target, ldr, syms, targ, 0)
    		su := ldr.MakeSymbolUpdater(s)
    		su.SetRelocType(rIdx, objabi.R_ARM64_GOT)
    		su.SetRelocSym(rIdx, syms.GOT)
    		su.SetRelocAdd(rIdx, int64(ldr.SymGot(targ)))
    		return true
    	}
    
    Registered: Wed Jun 12 16:32:35 UTC 2024
    - Last Modified: Tue Jan 30 20:09:45 UTC 2024
    - 47K bytes
    - Viewed (0)
  5. src/runtime/netpoll_wasip1.go

    	subs = subs[:j]
    }
    
    func swapsub(pd *pollDesc, from, to int) {
    	if from == to {
    		return
    	}
    	ridx := int(pd.user >> 16)
    	widx := int(pd.user & 0xFFFF)
    	if ridx == from {
    		ridx = to
    	} else if widx == from {
    		widx = to
    	}
    	pd.user = uint32(ridx)<<16 | uint32(widx)
    	if to != disarmed {
    		subs[to], subs[from] = subs[from], subs[to]
    	}
    }
    
    func netpollclose(fd uintptr) int32 {
    Registered: Wed Jun 12 16:32:35 UTC 2024
    - Last Modified: Wed Mar 27 18:23:49 UTC 2024
    - 6.1K bytes
    - Viewed (0)
  6. src/cmd/link/internal/riscv64/asm.go

    		su := ldr.MakeSymbolUpdater(s)
    		su.SetRelocType(rIdx, objabi.R_RISCV_GOT_HI20)
    		su.SetRelocSym(rIdx, syms.GOT)
    		su.SetRelocAdd(rIdx, r.Add()+int64(ldr.SymGot(targ)))
    		return true
    
    	case objabi.ElfRelocOffset + objabi.RelocType(elf.R_RISCV_PCREL_HI20):
    		su := ldr.MakeSymbolUpdater(s)
    		su.SetRelocType(rIdx, objabi.R_RISCV_PCREL_HI20)
    		return true
    
    Registered: Wed Jun 12 16:32:35 UTC 2024
    - Last Modified: Fri Mar 01 08:06:08 UTC 2024
    - 22.8K bytes
    - Viewed (0)
  7. src/cmd/link/internal/ppc64/asm.go

    		su := ldr.MakeSymbolUpdater(s)
    		su.SetRelocType(rIdx, objabi.R_PCREL)
    		ldr.SetRelocVariant(s, rIdx, sym.RV_POWER_LO)
    		su.SetRelocAdd(rIdx, r.Add()+2) // Compensate for relocation size of 2
    		return true
    
    	case objabi.ElfRelocOffset + objabi.RelocType(elf.R_PPC64_REL16_HI):
    		su := ldr.MakeSymbolUpdater(s)
    		su.SetRelocType(rIdx, objabi.R_PCREL)
    		ldr.SetRelocVariant(s, rIdx, sym.RV_POWER_HI|sym.RV_CHECK_OVERFLOW)
    Registered: Wed Jun 12 16:32:35 UTC 2024
    - Last Modified: Tue Mar 19 20:54:08 UTC 2024
    - 63.7K bytes
    - Viewed (0)
  8. cmd/admin-handlers-pools.go

    				return
    			}
    		}
    		var pool *erasureSets
    		for pidx := range z.serverPools {
    			if pidx == idx {
    				pool = z.serverPools[idx]
    				break
    			}
    		}
    		if pool == nil {
    			// We didn't find any matching pools, invalid input
    			writeErrorResponseJSON(ctx, w, toAdminAPIErr(ctx, errInvalidArgument), r.URL)
    			return
    		}
    
    		poolIndices = append(poolIndices, idx)
    	}
    
    Registered: Sun Jun 16 00:44:34 UTC 2024
    - Last Modified: Fri May 24 23:05:23 UTC 2024
    - 10.9K bytes
    - Viewed (0)
  9. cmd/erasure-server-pool.go

    	var wg sync.WaitGroup
    	for idx, pool := range z.serverPools {
    		if z.IsSuspended(idx) {
    			continue
    		}
    		wg.Add(1)
    		go func(idx int, pool *erasureSets) {
    			defer wg.Done()
    			result, err := pool.HealObject(ctx, bucket, object, versionID, opts)
    			result.Object = decodeDirObject(result.Object)
    			errs[idx] = err
    			results[idx] = result
    		}(idx, pool)
    	}
    	wg.Wait()
    
    Registered: Sun Jun 16 00:44:34 UTC 2024
    - Last Modified: Thu May 30 11:58:12 UTC 2024
    - 82.5K bytes
    - Viewed (0)
  10. internal/http/listener.go

    	// Closure to handle TCPListener until done channel is closed.
    	handleListener := func(idx int, listener net.Listener) {
    		for {
    			conn, err := listener.Accept()
    			send(acceptResult{conn, err, idx})
    		}
    	}
    
    	// Start separate goroutine for each TCP listener to handle connection.
    	for idx, tcpListener := range listener.listeners {
    		go handleListener(idx, tcpListener)
    	}
    }
    
    Registered: Sun Jun 16 00:44:34 UTC 2024
    - Last Modified: Wed May 22 23:07:14 UTC 2024
    - 5.5K bytes
    - Viewed (0)
Back to top