- Sort Score
- Result 10 results
- Languages All
Results 1 - 10 of 53 for succFn (0.12 sec)
-
src/cmd/vendor/golang.org/x/tools/go/cfg/cfg.go
fmt.Fprintf(&buf, ".%d: # %s\n", b.Index, b.comment(fset)) for _, n := range b.Nodes { fmt.Fprintf(&buf, "\t%s\n", formatNode(fset, n)) } if len(b.Succs) > 0 { fmt.Fprintf(&buf, "\tsuccs:") for _, succ := range b.Succs { fmt.Fprintf(&buf, " %d", succ.Index) } buf.WriteByte('\n') } buf.WriteByte('\n') } return buf.String() }
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/check.go
} case BlockRetJmp: if len(b.Succs) != 0 { f.Fatalf("retjmp block %s len(Succs)==%d, want 0", b, len(b.Succs)) } if b.NumControls() != 1 { f.Fatalf("retjmp block %s has nil control", b) } if !b.Controls[0].Type.IsMemory() { f.Fatalf("retjmp block %s has non-memory control value %s", b, b.Controls[0].LongString()) } case BlockPlain: if len(b.Succs) != 1 {
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/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/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/ssa/fuse.go
var ss0, ss1 *Block s0 := b.Succs[0].b i0 := b.Succs[0].i if s0.Kind != BlockPlain || !isEmpty(s0) { s0, ss0 = b, s0 } else { ss0 = s0.Succs[0].b i0 = s0.Succs[0].i } s1 := b.Succs[1].b i1 := b.Succs[1].i if s1.Kind != BlockPlain || !isEmpty(s1) { s1, ss1 = b, s1 } else { ss1 = s1.Succs[0].b i1 = s1.Succs[0].i } if ss0 != ss1 {
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Tue Oct 31 20:45:54 UTC 2023 - 9K bytes - Viewed (0) -
src/cmd/compile/internal/ssa/block.go
func (b *Block) removeSucc(i int) { n := len(b.Succs) - 1 if i != n { e := b.Succs[n] b.Succs[i] = e // Update the other end of the edge we moved. e.b.Preds[e.i].i = i } b.Succs[n] = Edge{} b.Succs = b.Succs[:n] b.Func.invalidateCFG() } func (b *Block) swapSuccessors() { if len(b.Succs) != 2 { b.Fatalf("swapSuccessors with len(Succs)=%d", len(b.Succs)) } e0 := b.Succs[0]
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/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/deadcode.go
} // removeEdge removes the i'th outgoing edge from b (and // the corresponding incoming edge from b.Succs[i].b). // Note that this potentially reorders successors of b, so it // must be used very carefully. func (b *Block) removeEdge(i int) { e := b.Succs[i] c := e.b j := e.i // Adjust b.Succs b.removeSucc(i) // Adjust c.Preds c.removePred(j) // Remove phi args from c's phis.
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Fri Dec 08 00:29:01 UTC 2023 - 9.2K bytes - Viewed (0) -
android/guava/src/com/google/common/graph/DirectedGraphConnections.java
// Adding the class hashCode to avoid a clash with Succ instances. return Pred.class.hashCode() + node.hashCode(); } } static final class Succ<N> extends NodeConnection<N> { Succ(N node) { super(node); } @Override public boolean equals(@CheckForNull Object that) { if (that instanceof Succ) { return this.node.equals(((Succ<?>) that).node);
Registered: Wed Jun 12 16:38:11 UTC 2024 - Last Modified: Tue Feb 20 17:00:05 UTC 2024 - 18K bytes - Viewed (0) -
cmd/tier_test.go
} metrics := globalTierMetrics.Report() var succ, fail float64 for _, metric := range metrics { switch metric.Description.Name { case tierRequestsSuccess: succ += metric.Value case tierRequestsFailure: fail += metric.Value } } if int(succ) != expSuccess { t.Fatalf("Expected %d successes but got %f", expSuccess, succ) } if int(fail) != expFailure {
Registered: Sun Jun 16 00:44:34 UTC 2024 - Last Modified: Thu Dec 21 04:13:40 UTC 2023 - 1.5K bytes - Viewed (0)