- Sort Score
- Result 10 results
- Languages All
Results 1 - 8 of 8 for succs (0.04 sec)
-
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/regalloc.go
delta := int32(normalDistance) if len(p.Succs) == 2 { if p.Succs[0].b == b && p.Likely == BranchLikely || p.Succs[1].b == b && p.Likely == BranchUnlikely { delta = likelyDistance } if p.Succs[0].b == b && p.Likely == BranchUnlikely || p.Succs[1].b == b && p.Likely == BranchLikely { delta = unlikelyDistance } }
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Tue Nov 21 17:49:56 UTC 2023 - 87.2K bytes - Viewed (0) -
src/cmd/compile/internal/ssa/rewrite.go
var states map[string]bool for { change := false deadChange := false for _, b := range f.Blocks { var b0 *Block if debug > 1 { b0 = new(Block) *b0 = *b b0.Succs = append([]Edge{}, b.Succs...) // make a new copy, not aliasing } for i, c := range b.ControlValues() { for c.Op == OpCopy { c = c.Args[0] b.ReplaceControl(i, c) } } if rb(b) {
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Fri Jun 07 19:02:52 UTC 2024 - 64.2K bytes - Viewed (0) -
android/guava/src/com/google/common/util/concurrent/AbstractFuture.java
Registered: Wed Jun 12 16:38:11 UTC 2024 - Last Modified: Fri Jun 07 22:25:23 UTC 2024 - 63.1K bytes - Viewed (0) -
guava/src/com/google/common/util/concurrent/AbstractFuture.java
Registered: Wed Jun 12 16:38:11 UTC 2024 - Last Modified: Fri Jun 07 22:25:23 UTC 2024 - 62.8K bytes - Viewed (1) -
guava/src/com/google/common/collect/MapMakerInternalMap.java
/** Gets the key for this entry. */ K getKey(); /** Gets the value for the entry. */ V getValue(); } /* * Note: the following classes have a lot of duplicate code. It sucks, but it saves a lot of * memory. If only Java had mixins! */ /** Base class for {@link InternalEntry} implementations for strong keys. */
Registered: Wed Jun 12 16:38:11 UTC 2024 - Last Modified: Sat May 18 03:24:34 UTC 2024 - 90.8K bytes - Viewed (0) -
android/guava/src/com/google/common/collect/MapMakerInternalMap.java
/** Gets the key for this entry. */ K getKey(); /** Gets the value for the entry. */ V getValue(); } /* * Note: the following classes have a lot of duplicate code. It sucks, but it saves a lot of * memory. If only Java had mixins! */ /** Base class for {@link InternalEntry} implementations for strong keys. */
Registered: Wed Jun 12 16:38:11 UTC 2024 - Last Modified: Sat May 18 03:24:34 UTC 2024 - 90.8K bytes - Viewed (0)