- Sort Score
- Result 10 results
- Languages All
Results 1 - 10 of 1,021 for nblocks (0.15 sec)
-
src/net/netip/slow_test.go
case 1: // No ::, nothing to do. case 2: lhs, rhs := fs[0], fs[1] // Found a ::, figure out how many zero blocks need to be // inserted. nblocks := strings.Count(lhs, ":") + strings.Count(rhs, ":") if lhs != "" { nblocks++ } if rhs != "" { nblocks++ } if nblocks > 7 { return "", fmt.Errorf("netaddr.ParseIP(%q): address too long", orig) } fs = nil
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Mon Mar 11 19:54:31 UTC 2024 - 5.8K bytes - Viewed (0) -
src/cmd/compile/internal/ssa/likelyadjust.go
f.LogStat("loopstats:", l.depth, "depth", x, "exits", inner, "is_inner", cf, "always_calls", l.nBlocks, "n_blocks") } } if f.pass != nil && f.pass.debug > 1 && len(loops) > 0 { fmt.Printf("Loops in %s:\n", f.Name) for _, l := range loops { fmt.Printf("%s, b=", l.LongString()) for _, b := range f.Blocks { if b2l[b.ID] == l { fmt.Printf(" %s", b) } } fmt.Print("\n") }
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Mon Oct 31 21:41:20 UTC 2022 - 15.4K bytes - Viewed (0) -
src/runtime/mgcmark.go
func gcMarkRootPrepare() { assertWorldStopped() // Compute how many data and BSS root blocks there are. nBlocks := func(bytes uintptr) int { return int(divRoundUp(bytes, rootBlockBytes)) } work.nDataRoots = 0 work.nBSSRoots = 0 // Scan globals. for _, datap := range activeModules() { nDataRoots := nBlocks(datap.edata - datap.data) if nDataRoots > work.nDataRoots { work.nDataRoots = nDataRoots }
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Thu Apr 18 21:25:11 UTC 2024 - 52.5K bytes - Viewed (0) -
src/cmd/compile/internal/liveness/plive.go
d := b.Preds[1].Block() // Find their common predecessor block (the one that branches based on wb on/off). // It might be a diamond pattern, or one of the blocks in the diamond pattern might // be missing. var decisionBlock *ssa.Block if len(c.Preds) == 1 && c.Preds[0].Block() == d { decisionBlock = d } else if len(d.Preds) == 1 && d.Preds[0].Block() == c { decisionBlock = c
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Fri Jun 07 15:22:22 UTC 2024 - 45.2K bytes - Viewed (0) -
src/cmd/compile/internal/ssa/block.go
package ssa import ( "cmd/internal/src" "fmt" ) // Block represents a basic block in the control flow graph of a function. type Block struct { // A unique identifier for the block. The system will attempt to allocate // these IDs densely, but no guarantees. ID ID // Source position for block's control operation Pos src.XPos // The kind of block this is. Kind BlockKind // Likely direction for branches.
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Wed May 15 15:44:14 UTC 2024 - 12.2K bytes - Viewed (0) -
src/crypto/des/block.go
b1 = block & 0x0f0f00000f0f0000 b2 = block & 0x0000f0f00000f0f0 block ^= b1 ^ b2 ^ b1>>12 ^ b2<<12 b1 = block >> 32 & 0xff00ff b2 = (block & 0xff00ff00) block ^= b1<<32 ^ b2 ^ b1<<8 ^ b2<<24 b1 = block >> 48 b2 = block << 48 block ^= b1 ^ b2 ^ b1<<48 ^ b2>>48 return block } // creates 16 28-bit blocks rotated according // to the rotation schedule.
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Mon May 13 18:57:38 UTC 2024 - 6.5K bytes - Viewed (0) -
src/cmd/go/internal/lockedfile/internal/filelock/filelock_fcntl.go
// // P.1 locks file A. // Q.3 locks file B. // Q.3 blocks on file A. // P.2 blocks on file B. (This is erroneously reported as a deadlock.) // P.1 unlocks file A. // Q.3 unblocks and locks file A. // Q.3 unlocks files A and B. // P.2 unblocks and locks file B. // P.2 unlocks file B. //
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Fri Mar 17 02:24:35 UTC 2023 - 5.5K bytes - Viewed (0) -
cmd/erasure-utils.go
"github.com/klauspost/reedsolomon" ) // getDataBlockLen - get length of data blocks from encoded blocks. func getDataBlockLen(enBlocks [][]byte, dataBlocks int) int { size := 0 // Figure out the data block length. for _, block := range enBlocks[:dataBlocks] { size += len(block) } return size } // Writes all the data blocks from encoded blocks until requested // outSize length. Provides a way to skip bytes until the offset.
Registered: Sun Jun 16 00:44:34 UTC 2024 - Last Modified: Wed Jan 31 02:11:45 UTC 2024 - 3.1K bytes - Viewed (0) -
src/cmd/compile/internal/ssa/layout.go
// scheduled block. var succs []ID exit := f.newSparseSet(f.NumBlocks()) // exit blocks defer f.retSparseSet(exit) // Populate idToBlock and find exit blocks. for _, b := range f.Blocks { idToBlock[b.ID] = b if b.Kind == BlockExit { exit.add(b.ID) } } // Expand exit to include blocks post-dominated by exit blocks. for { changed := false for _, id := range exit.contents() {
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Mon Oct 31 21:41:20 UTC 2022 - 5K bytes - Viewed (0) -
pkg/kubelet/clustertrustbundle/clustertrustbundle_manager_test.go
func diffBundles(a, b []byte) string { var block *pem.Block aBlocks := []*pem.Block{} for { block, a = pem.Decode(a) if block == nil { break } aBlocks = append(aBlocks, block) } sort.Slice(aBlocks, func(i, j int) bool { if aBlocks[i].Type < aBlocks[j].Type { return true } else if aBlocks[i].Type == aBlocks[j].Type { comp := bytes.Compare(aBlocks[i].Bytes, aBlocks[j].Bytes)
Registered: Sat Jun 15 01:39:40 UTC 2024 - Last Modified: Fri Nov 03 18:40:48 UTC 2023 - 15.5K bytes - Viewed (0)