- Sort Score
- Result 10 results
- Languages All
Results 11 - 20 of 1,425 for Blocks (0.68 sec)
-
src/cmd/compile/internal/ssa/nilcheck_test.go
c := testConfig(b) ptrType := c.config.Types.BytePtr var blocs []bloc blocs = append(blocs, Bloc("entry", Valu("mem", OpInitMem, types.TypeMem, 0, nil), Valu("sb", OpSB, c.config.Types.Uintptr, 0, nil), Goto(blockn(0)), ), ) for i := 0; i < depth; i++ { blocs = append(blocs, Bloc(blockn(i), Valu(ptrn(i), OpAddr, ptrType, 0, nil, "sb"),
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Fri Nov 17 23:34:11 UTC 2023 - 12.3K bytes - Viewed (0) -
src/cmd/compile/internal/ssa/critical.go
// critical splits critical edges (those that go from a block with // more than one outedge to a block with more than one inedge). // Regalloc wants a critical-edge-free CFG so it can implement phi values. func critical(f *Func) { // maps from phi arg ID to the new block created for that argument blocks := f.Cache.allocBlockSlice(f.NumValues()) defer f.Cache.freeBlockSlice(blocks) // need to iterate over f.Blocks without range, as we might
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Tue May 16 21:40:11 UTC 2023 - 3.1K bytes - Viewed (0) -
src/cmd/compile/internal/ssa/deadcode.go
if reachable[b.ID] { f.Blocks[i] = b i++ } else { if len(b.Values) > 0 { b.Fatalf("live values in unreachable block %v: %v", b, b.Values) } f.freeBlock(b) } } // zero remainder to help GC tail := f.Blocks[i:] for j := range tail { tail[j] = nil } f.Blocks = f.Blocks[:i] } // removeEdge removes the i'th outgoing edge from b (and
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Fri Dec 08 00:29:01 UTC 2023 - 9.2K 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/vendor/golang.org/x/tools/cover/profile.go
FileName: fn, Mode: mode, } files[fn] = p } p.Blocks = append(p.Blocks, b) } if err := s.Err(); err != nil { return nil, err } for _, p := range files { sort.Sort(blocksByStart(p.Blocks)) // Merge samples from the same location. j := 1 for i := 1; i < len(p.Blocks); i++ { b := p.Blocks[i] last := p.Blocks[j-1] if b.StartLine == last.StartLine && b.StartCol == last.StartCol &&
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Mon Oct 11 17:02:03 UTC 2021 - 7.5K bytes - Viewed (0) -
src/crypto/aes/modes.go
package aes import ( "crypto/cipher" ) // gcmAble is implemented by cipher.Blocks that can provide an optimized // implementation of GCM through the AEAD interface. // See crypto/cipher/gcm.go. type gcmAble interface { NewGCM(nonceSize, tagSize int) (cipher.AEAD, error) } // cbcEncAble is implemented by cipher.Blocks that can provide an optimized // implementation of CBC encryption through the cipher.BlockMode interface.
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Wed Feb 14 15:32:26 UTC 2018 - 1.1K bytes - Viewed (0) -
src/cmd/vendor/rsc.io/markdown/quote.go
import ( "bytes" ) type Quote struct { Position Blocks []Block } func (b *Quote) PrintHTML(buf *bytes.Buffer) { buf.WriteString("<blockquote>\n") for _, c := range b.Blocks { c.PrintHTML(buf) } buf.WriteString("</blockquote>\n") } func (b *Quote) printMarkdown(buf *bytes.Buffer, s mdState) { s.prefix += "> " printMarkdownBlocks(b.Blocks, buf, s) } func trimQuote(s line) (line, bool) {
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Wed Jan 24 13:01:26 UTC 2024 - 1K bytes - Viewed (0) -
src/cmd/vendor/golang.org/x/build/relnote/relnote.go
slices.Sort(filenames) return filenames, nil } // lastBlock returns the last block in the document. // It panics if the document has no blocks. func lastBlock(doc *md.Document) md.Block { return doc.Blocks[len(doc.Blocks)-1] } // addLines adds n lines to the position of b. // n can be negative. func addLines(b md.Block, n int) { pos := position(b) pos.StartLine += n pos.EndLine += n }
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Tue Jun 04 16:19:04 UTC 2024 - 12.7K bytes - Viewed (0) -
src/cmd/compile/internal/ssa/tighten.go
package ssa import "cmd/compile/internal/base" // tighten moves Values closer to the Blocks in which they are used. // This can reduce the amount of register spilling required, // if it doesn't also create more live values. // A Value can be moved to any block that // dominates all blocks in which it is used. func tighten(f *Func) { if base.Flag.N != 0 && len(f.Blocks) < 10000 { // Skip the optimization in -N mode, except for huge functions.
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Tue May 16 01:01:38 UTC 2023 - 7.7K bytes - Viewed (0) -
src/cmd/compile/internal/ssa/cache.go
xv := c.values[:nv] for i := range xv { xv[i] = Value{} } nb := sort.Search(len(c.blocks), func(i int) bool { return c.blocks[i].ID == 0 }) xb := c.blocks[:nb] for i := range xb { xb[i] = Block{} } nl := sort.Search(len(c.locs), func(i int) bool { return c.locs[i] == nil }) xl := c.locs[:nl] for i := range xl { xl[i] = nil }
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Wed Feb 15 23:00:54 UTC 2023 - 1.6K bytes - Viewed (0)