- Sort Score
- Result 10 results
- Languages All
Results 1 - 10 of 15 for NewBlock (0.16 sec)
-
src/cmd/vendor/golang.org/x/tools/go/cfg/builder.go
case *ast.ReturnStmt: b.add(s) b.current = b.newBlock(KindUnreachable, s) case *ast.BranchStmt: b.branchStmt(s) case *ast.BlockStmt: b.stmtList(s.List) case *ast.IfStmt: if s.Init != nil { b.stmt(s.Init) } then := b.newBlock(KindIfThen, s) done := b.newBlock(KindIfDone, s) _else := done if s.Else != nil { _else = b.newBlock(KindIfElse, s) } b.add(s.Cond)
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Tue Apr 02 02:20:05 UTC 2024 - 11.4K bytes - Viewed (0) -
platforms/core-execution/persistent-cache/src/main/java/org/gradle/cache/internal/btree/FreeListBlockStore.java
if (entries.size() > maxBlockEntries) { FreeListBlock newBlock = new FreeListBlock(); newBlock.largestInNextBlock = largestInNextBlock; newBlock.nextBlock = nextBlock; newBlock.prev = this; newBlock.next = next; next = newBlock; List<FreeListEntry> newBlockEntries = entries.subList(0, entries.size() / 2);
Registered: Wed Jun 12 18:38:38 UTC 2024 - Last Modified: Fri Apr 26 16:02:32 UTC 2024 - 8.7K bytes - Viewed (0) -
platforms/core-execution/persistent-cache/src/main/java/org/gradle/cache/internal/btree/BTreePersistentIndexedCache.java
Registered: Wed Jun 12 18:38:38 UTC 2024 - Last Modified: Fri Sep 22 09:08:47 UTC 2023 - 26.5K bytes - Viewed (0) -
src/cmd/compile/internal/ssagen/ssa.go
s.Fatalf("atomic load not available") } merge = s.f.NewBlock(ssa.BlockPlain) cacheHit := s.f.NewBlock(ssa.BlockPlain) cacheMiss := s.f.NewBlock(ssa.BlockPlain) loopHead := s.f.NewBlock(ssa.BlockPlain) loopBody := s.f.NewBlock(ssa.BlockPlain) // Pick right size ops. var mul, and, add, zext ssa.Op if s.config.PtrSize == 4 {
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Mon Jun 10 19:44:43 UTC 2024 - 284.9K bytes - Viewed (0) -
src/cmd/compile/internal/ssa/critical.go
// the new blocks to be re-examined. d = f.NewBlock(BlockPlain) d.Pos = p.Pos blocks[argID] = d if f.pass.debug > 0 { f.Warnl(p.Pos, "split critical edge") } } else { reusedBlock = true } } else { // no existing block, so allocate a new block // to place on the edge d = f.NewBlock(BlockPlain) d.Pos = p.Pos if f.pass.debug > 0 {
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/vendor/github.com/google/pprof/internal/driver/html/source.html
{{/* instructions for this source line */ -}} <span class=asm>{{"" -}} {{range .Instructions -}} {{/* separate when we hit a new basic block */ -}} {{if .NewBlock -}}{{printf " %8s %28s\n" "" "⋮"}}{{end -}} {{/* inlined calls leading to this instruction */ -}} {{range .InlinedCalls -}} {{printf " %8s %10s %10s %8s " "" "" "" "" -}}
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Fri May 31 19:48:28 UTC 2024 - 2.5K bytes - Viewed (0) -
src/cmd/compile/internal/ssa/loopreschedchecks.go
// join, and branches targeting join must instead target // the header, and the other phi functions within header are // adjusted for the additional input. test := f.NewBlock(BlockIf) sched := f.NewBlock(BlockPlain) test.Pos = bb.Pos sched.Pos = bb.Pos // if sp < g.limit { goto sched } // goto header cfgtypes := &f.Config.Types pt := cfgtypes.Uintptr
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Tue Aug 22 21:17:10 UTC 2023 - 16K bytes - Viewed (0) -
src/cmd/vendor/golang.org/x/tools/go/cfg/cfg.go
// CallExpr beneath an ExprStmt. func New(body *ast.BlockStmt, mayReturn func(*ast.CallExpr) bool) *CFG { b := builder{ mayReturn: mayReturn, cfg: new(CFG), } b.current = b.newBlock(KindBody, body) b.stmt(body) // Compute liveness (reachability from entry point), breadth-first. q := make([]*Block, 0, len(b.cfg.Blocks)) q = append(q, b.cfg.Blocks[0]) // entry point for len(q) > 0 {
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Tue Apr 02 02:20:05 UTC 2024 - 7.7K bytes - Viewed (0) -
src/cmd/compile/internal/ssa/writebarrier.go
mem.Aux = t volatiles = append(volatiles, volatileCopy{val, tmpaddr}) } } } } // Build branch point. bThen := f.NewBlock(BlockPlain) bEnd := f.NewBlock(b.Kind) bThen.Pos = pos bEnd.Pos = b.Pos b.Pos = pos // Set up control flow for end block. bEnd.CopyControls(b) bEnd.Likely = b.Likely for _, e := range b.Succs {
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Fri Sep 08 19:09:14 UTC 2023 - 23.5K bytes - Viewed (0) -
src/cmd/compile/internal/ssa/func_test.go
blocks := make(map[string]*Block) values := make(map[string]*Value) // Create all the blocks and values. for _, bloc := range blocs { b := f.NewBlock(bloc.control.kind) blocks[bloc.name] = b for _, valu := range bloc.valus { // args are filled in the second pass. values[valu.name] = b.NewValue0IA(src.NoXPos, valu.op, valu.t, valu.auxint, valu.aux) }
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Fri Sep 08 19:01:04 UTC 2023 - 13.1K bytes - Viewed (0)