- Sort Score
- Result 10 results
- Languages All
Results 1 - 10 of 593 for blockn (2.44 sec)
-
src/cmd/compile/internal/ssa/dom_test.go
Goto(blockn(0)), ), ) for i := 0; i < size; i++ { switch i % 2 { case 0: blocs = append(blocs, Bloc(blockn(i), If("p", blockn(i+1), blockn(i+2)))) case 1: blocs = append(blocs, Bloc(blockn(i), If("p", blockn(i+1), blockn(i-1)))) } } blocs = append(blocs, Bloc(blockn(size), Goto("exit")), Bloc("exit", Exit("mem")), ) return blocs }
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Tue Mar 26 19:58:28 UTC 2024 - 13.3K bytes - Viewed (0) -
src/cmd/compile/internal/ssa/block.go
// for the new value. The index must refer to a valid control value. func (b *Block) ReplaceControl(i int, v *Value) { b.Controls[i].Uses-- b.Controls[i] = v v.Uses++ } // CopyControls replaces the controls for this block with those from the // provided block. The provided block is not modified. func (b *Block) CopyControls(from *Block) { if b == from { return } b.ResetControls()
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/runtime/mspanset.go
// which claimed the last slot in the block, we're just the last one // to finish popping. if block.popped.Add(1) == spanSetBlockEntries { // Clear the block's pointer. blockp.StoreNoWB(nil) // Return the block to the block pool. spanSetBlockPool.free(block) } return s } // reset resets a spanSet which is empty. It will also clean up // any left over blocks. // // Throws if the buf is not empty.
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Mon Mar 25 19:53:03 UTC 2024 - 13.1K bytes - Viewed (0) -
src/cmd/cover/cover.go
return } // Self-check: Verify that the instrumented basic blocks are disjoint. t := make([]block1, len(f.blocks)) for i := range f.blocks { t[i].Block = f.blocks[i] t[i].index = i } sort.Sort(blockSlice(t)) for i := 1; i < len(t); i++ { if t[i-1].endByte > t[i].startByte { fmt.Fprintf(os.Stderr, "cover: internal error: block %d overlaps block %d\n", t[i-1].index, t[i].index)
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Tue May 14 19:41:17 UTC 2024 - 34.5K 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/check.go
bb := s.Block() if ln.b2l[b.ID] == nil && ln.b2l[bb.ID] != nil && bb != ln.b2l[bb.ID].header { f.Fatalf("block %s not in loop branches to non-header block %s in loop", b.String(), bb.String()) } if ln.b2l[b.ID] != nil && ln.b2l[bb.ID] != nil && bb != ln.b2l[bb.ID].header && !ln.b2l[b.ID].isWithinOrEq(ln.b2l[bb.ID]) { f.Fatalf("block %s in loop branches to non-header block %s in non-containing loop", b.String(), bb.String())
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Tue Apr 09 16:41:23 UTC 2024 - 17.6K bytes - Viewed (0) -
src/image/jpeg/scan.go
d.progCoeffs[compIndex] = make([]block, mxx*myy*d.comp[compIndex].h*d.comp[compIndex].v) } } } d.bits = bits{} mcu, expectedRST := 0, uint8(rst0Marker) var ( // b is the decoded coefficients, in natural (not zig-zag) order. b block dc [maxComponents]int32 // bx and by are the location of the current block, in units of 8x8 // blocks: the third block in the first row has (bx, by) = (2, 0).
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Thu Apr 25 00:46:29 UTC 2024 - 15.7K bytes - Viewed (0) -
platforms/extensibility/plugin-use/src/integTest/groovy/org/gradle/plugin/repository/PluginManagementDslSpec.groovy
succeeds 'help' } def "other blocks can follow the pluginManagement block"() { given: settingsFile << """ pluginManagement {} rootProject.name = 'rumpelstiltskin' """ expect: succeeds 'help' } def "pluginManagement block is not supported in ProjectScripts"() { given:
Registered: Wed Jun 12 18:38:38 UTC 2024 - Last Modified: Thu Mar 28 15:16:47 UTC 2024 - 10.2K bytes - Viewed (0) -
tensorflow/compiler/mlir/tensorflow/transforms/sparsecore/embedding_program_key.cc
return tpu_compile_successor; } // Get all the Blocks underneath `top` that are "in the scope" of `bottom`, // i.e., are ancestors. llvm::DenseSet<Block*> GetAllBlocksBetween(Operation* bottom, Operation* top) { llvm::DenseSet<Block*> blocks; Operation* op = bottom; while (op && op != top) { blocks.insert(op->getBlock()); op = op->getParentOp(); } return blocks; }
Registered: Sun Jun 16 05:45:23 UTC 2024 - Last Modified: Thu Apr 25 16:01:03 UTC 2024 - 17.4K bytes - Viewed (0) -
src/cmd/vendor/golang.org/x/tools/go/cfg/builder.go
// newBlock appends a new unconnected basic block to b.cfg's block // slice and returns it. // It does not automatically become the current block. // comment is an optional string for more readable debugging output. func (b *builder) newBlock(kind BlockKind, stmt ast.Stmt) *Block { g := b.cfg block := &Block{ Index: int32(len(g.Blocks)), Kind: kind, Stmt: stmt, } block.Succs = block.succs2[:0]
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Tue Apr 02 02:20:05 UTC 2024 - 11.4K bytes - Viewed (0)