- Sort Score
- Result 10 results
- Languages All
Results 21 - 30 of 75 for succs (0.1 sec)
-
src/cmd/compile/internal/ssa/func_test.go
return false } for i := range fb.Values { if !checkVal(fb.Values[i], gb.Values[i]) { return false } } if len(fb.Succs) != len(gb.Succs) { return false } for i := range fb.Succs { if !checkBlk(fb.Succs[i].b, gb.Succs[i].b) { return false } } if len(fb.Preds) != len(gb.Preds) { return false } for i := range fb.Preds {
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Fri Sep 08 19:01:04 UTC 2023 - 13.1K bytes - Viewed (0) -
src/cmd/compile/internal/ssa/sccp.go
break case BlockDefer: // we know nothing about control flow, add all branch destinations t.edges = append(t.edges, block.Succs...) case BlockFirst: fallthrough // always takes the first branch case BlockPlain: t.edges = append(t.edges, block.Succs[0]) case BlockIf, BlockJumpTable: cond := block.ControlValues()[0] condLattice := t.getLatticeCell(cond) if condLattice.tag == bottom {
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Mon Jan 22 16:54:50 UTC 2024 - 17.6K bytes - Viewed (0) -
src/cmd/compile/internal/ssa/loopreschedchecks.go
test.AddEdgeTo(sched) // if false, rewrite edge to header. // do NOT remove+add, because that will perturb all the other phi functions // as well as messing up other edges to the header. test.Succs = append(test.Succs, Edge{h, i}) h.Preds[i] = Edge{test, 1} headerMemPhi.SetArg(i, mem0) test.Likely = BranchUnlikely // sched: // mem1 := call resched (mem0) // goto header
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/builder.go
Stmt: stmt, } block.Succs = block.succs2[:0] g.Blocks = append(g.Blocks, block) return block } func (b *builder) add(n ast.Node) { b.current.Nodes = append(b.current.Nodes, n) } // jump adds an edge from the current block to the target block, // and sets b.current to nil. func (b *builder) jump(target *Block) { b.current.Succs = append(b.current.Succs, target) b.current = nil }
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Tue Apr 02 02:20:05 UTC 2024 - 11.4K bytes - Viewed (0) -
src/cmd/compile/internal/ppc64/ssa.go
if jmp.invasmun { // TODO: The second branch is probably predict-not-taken since it is for FP unordered s.Br(ppc64.ABVS, b.Succs[1].Block()) } case b.Succs[1].Block(): s.Br(jmp.asm, b.Succs[0].Block()) if jmp.asmeq { s.Br(ppc64.ABEQ, b.Succs[0].Block()) } default: if b.Likely != ssa.BranchUnlikely { s.Br(jmp.asm, b.Succs[0].Block()) if jmp.asmeq {
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Wed May 22 19:59:38 UTC 2024 - 55.4K bytes - Viewed (0) -
src/cmd/compile/internal/ssa/prove.go
return positive } if sdom.IsAncestorEq(p.Succs[1].b, b) && len(p.Succs[1].b.Preds) == 1 { return negative } case BlockJumpTable: // TODO: this loop can lead to quadratic behavior, as // getBranch can be called len(p.Succs) times. for i, e := range p.Succs { if sdom.IsAncestorEq(e.b, b) && len(e.b.Preds) == 1 {
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Mon Mar 04 17:30:21 UTC 2024 - 48.9K bytes - Viewed (0) -
src/cmd/compile/internal/ssa/writebarrier.go
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 { bEnd.Succs = append(bEnd.Succs, e) e.b.Preds[e.i].b = bEnd } // set up control flow for write barrier test // load word, test word, avoiding partial register write from load byte. cfgtypes := &f.Config.Types
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/vendor/golang.org/x/tools/go/analysis/passes/lostcancel/lostcancel.go
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Mon Jan 22 19:00:13 UTC 2024 - 9K bytes - Viewed (0) -
src/cmd/compile/internal/ssa/_gen/rulegen.go
// Check if newsuccs is the same set as succs. succs := s[data.controls:] newsuccs := t[outdata.controls:] m := map[string]bool{} for _, succ := range succs { if m[succ] { log.Fatalf("can't have a repeat successor name %s in %s", succ, rule) } m[succ] = true } for _, succ := range newsuccs { if !m[succ] { log.Fatalf("unknown successor %s in %s", succ, rule) } delete(m, succ) }
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Sat Sep 02 22:09:21 UTC 2023 - 48.7K bytes - Viewed (0) -
src/cmd/compile/internal/ssa/_gen/genericOps.go
// JumpTable [integer Value] [succ1,succ2,..] var genericBlocks = []blockData{ {name: "Plain"}, // a single successor {name: "If", controls: 1}, // if Controls[0] goto Succs[0] else goto Succs[1] {name: "Defer", controls: 1}, // Succs[0]=defer queued, Succs[1]=defer recovered. Controls[0] is call op (of memory type)
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Thu May 23 15:49:20 UTC 2024 - 42.6K bytes - Viewed (0)