X7ROOT File Manager
Current Path:
/opt/golang/1.19.4/src/cmd/compile/internal/ssa
opt
/
golang
/
1.19.4
/
src
/
cmd
/
compile
/
internal
/
ssa
/
📁
..
📄
README.md
(8.14 KB)
📄
TODO
(950 B)
📄
addressingmodes.go
(23.64 KB)
📄
bench_test.go
(531 B)
📄
biasedsparsemap.go
(2.71 KB)
📄
block.go
(11.1 KB)
📄
branchelim.go
(11.98 KB)
📄
branchelim_test.go
(5.21 KB)
📄
cache.go
(2.46 KB)
📄
check.go
(16.59 KB)
📄
checkbce.go
(956 B)
📄
compile.go
(18.19 KB)
📄
config.go
(11.7 KB)
📄
copyelim.go
(1.83 KB)
📄
copyelim_test.go
(1.29 KB)
📄
critical.go
(3.19 KB)
📄
cse.go
(9.43 KB)
📄
cse_test.go
(4.25 KB)
📄
deadcode.go
(9.61 KB)
📄
deadcode_test.go
(3.49 KB)
📄
deadstore.go
(9.08 KB)
📄
deadstore_test.go
(4.09 KB)
📄
debug.go
(56.34 KB)
📄
debug_lines_test.go
(8.29 KB)
📄
debug_test.go
(28.75 KB)
📄
decompose.go
(13.41 KB)
📄
dom.go
(7.98 KB)
📄
dom_test.go
(13.34 KB)
📄
expand_calls.go
(63.5 KB)
📄
export_test.go
(3.23 KB)
📄
flagalloc.go
(6.68 KB)
📄
flags_amd64_test.s
(533 B)
📄
flags_arm64_test.s
(699 B)
📄
flags_test.go
(2.49 KB)
📄
func.go
(27.08 KB)
📄
func_test.go
(13.07 KB)
📄
fuse.go
(6.5 KB)
📄
fuse_branchredirect.go
(3.24 KB)
📄
fuse_comparisons.go
(4.04 KB)
📄
fuse_test.go
(7.21 KB)
📁
gen
📄
html.go
(34.72 KB)
📄
id.go
(576 B)
📄
layout.go
(4.82 KB)
📄
lca.go
(3.77 KB)
📄
lca_test.go
(1.65 KB)
📄
likelyadjust.go
(15.24 KB)
📄
location.go
(3.06 KB)
📄
loopbce.go
(10.54 KB)
📄
loopreschedchecks.go
(15.86 KB)
📄
looprotate.go
(2.61 KB)
📄
lower.go
(1.36 KB)
📄
magic.go
(15.77 KB)
📄
magic_test.go
(9.1 KB)
📄
nilcheck.go
(11.06 KB)
📄
nilcheck_test.go
(12.17 KB)
📄
numberlines.go
(7.83 KB)
📄
op.go
(18.65 KB)
📄
opGen.go
(1.01 MB)
📄
opt.go
(308 B)
📄
passbm_test.go
(3.14 KB)
📄
phielim.go
(1.48 KB)
📄
phiopt.go
(8.08 KB)
📄
poset.go
(37.2 KB)
📄
poset_test.go
(18.14 KB)
📄
print.go
(3.85 KB)
📄
prove.go
(41.82 KB)
📄
regalloc.go
(83.69 KB)
📄
regalloc_test.go
(6.49 KB)
📄
rewrite.go
(53.49 KB)
📄
rewrite386.go
(289.01 KB)
📄
rewrite386splitload.go
(4.05 KB)
📄
rewriteAMD64.go
(888.95 KB)
📄
rewriteAMD64splitload.go
(21.41 KB)
📄
rewriteARM.go
(487.7 KB)
📄
rewriteARM64.go
(751.84 KB)
📄
rewriteCond_test.go
(10.62 KB)
📄
rewriteLOONG64.go
(193.44 KB)
📄
rewriteMIPS.go
(174.44 KB)
📄
rewriteMIPS64.go
(195.55 KB)
📄
rewritePPC64.go
(431.6 KB)
📄
rewriteRISCV64.go
(159.66 KB)
📄
rewriteS390X.go
(433.4 KB)
📄
rewriteWasm.go
(109.86 KB)
📄
rewrite_test.go
(6.91 KB)
📄
rewritedec.go
(10.16 KB)
📄
rewritedec64.go
(63.77 KB)
📄
rewritegeneric.go
(617.96 KB)
📄
schedule.go
(18.23 KB)
📄
schedule_test.go
(2.91 KB)
📄
shift_test.go
(4.05 KB)
📄
shortcircuit.go
(12.63 KB)
📄
shortcircuit_test.go
(1.31 KB)
📄
sizeof_test.go
(855 B)
📄
softfloat.go
(1.99 KB)
📄
sparsemap.go
(1.98 KB)
📄
sparseset.go
(1.54 KB)
📄
sparsetree.go
(8.05 KB)
📄
stackalloc.go
(12.79 KB)
📄
stackframe.go
(290 B)
📄
stmtlines_test.go
(2.96 KB)
📁
testdata
📄
tighten.go
(4.3 KB)
📄
trim.go
(4.24 KB)
📄
tuple.go
(1.97 KB)
📄
value.go
(15.21 KB)
📄
writebarrier.go
(19.29 KB)
📄
writebarrier_test.go
(1.75 KB)
📄
xposmap.go
(3.29 KB)
📄
zcse.go
(2.07 KB)
📄
zeroextension_test.go
(1.66 KB)
Editing: fuse_test.go
package ssa import ( "cmd/compile/internal/types" "fmt" "strconv" "testing" ) func TestFuseEliminatesOneBranch(t *testing.T) { c := testConfig(t) ptrType := c.config.Types.BytePtr fun := c.Fun("entry", Bloc("entry", Valu("mem", OpInitMem, types.TypeMem, 0, nil), Valu("sb", OpSB, c.config.Types.Uintptr, 0, nil), Goto("checkPtr")), Bloc("checkPtr", Valu("ptr1", OpLoad, ptrType, 0, nil, "sb", "mem"), Valu("nilptr", OpConstNil, ptrType, 0, nil), Valu("bool1", OpNeqPtr, c.config.Types.Bool, 0, nil, "ptr1", "nilptr"), If("bool1", "then", "exit")), Bloc("then", Goto("exit")), Bloc("exit", Exit("mem"))) CheckFunc(fun.f) fuseLate(fun.f) for _, b := range fun.f.Blocks { if b == fun.blocks["then"] && b.Kind != BlockInvalid { t.Errorf("then was not eliminated, but should have") } } } func TestFuseEliminatesBothBranches(t *testing.T) { c := testConfig(t) ptrType := c.config.Types.BytePtr fun := c.Fun("entry", Bloc("entry", Valu("mem", OpInitMem, types.TypeMem, 0, nil), Valu("sb", OpSB, c.config.Types.Uintptr, 0, nil), Goto("checkPtr")), Bloc("checkPtr", Valu("ptr1", OpLoad, ptrType, 0, nil, "sb", "mem"), Valu("nilptr", OpConstNil, ptrType, 0, nil), Valu("bool1", OpNeqPtr, c.config.Types.Bool, 0, nil, "ptr1", "nilptr"), If("bool1", "then", "else")), Bloc("then", Goto("exit")), Bloc("else", Goto("exit")), Bloc("exit", Exit("mem"))) CheckFunc(fun.f) fuseLate(fun.f) for _, b := range fun.f.Blocks { if b == fun.blocks["then"] && b.Kind != BlockInvalid { t.Errorf("then was not eliminated, but should have") } if b == fun.blocks["else"] && b.Kind != BlockInvalid { t.Errorf("else was not eliminated, but should have") } } } func TestFuseHandlesPhis(t *testing.T) { c := testConfig(t) ptrType := c.config.Types.BytePtr fun := c.Fun("entry", Bloc("entry", Valu("mem", OpInitMem, types.TypeMem, 0, nil), Valu("sb", OpSB, c.config.Types.Uintptr, 0, nil), Goto("checkPtr")), Bloc("checkPtr", Valu("ptr1", OpLoad, ptrType, 0, nil, "sb", "mem"), Valu("nilptr", OpConstNil, ptrType, 0, nil), Valu("bool1", OpNeqPtr, c.config.Types.Bool, 0, nil, "ptr1", "nilptr"), If("bool1", "then", "else")), Bloc("then", Goto("exit")), Bloc("else", Goto("exit")), Bloc("exit", Valu("phi", OpPhi, ptrType, 0, nil, "ptr1", "ptr1"), Exit("mem"))) CheckFunc(fun.f) fuseLate(fun.f) for _, b := range fun.f.Blocks { if b == fun.blocks["then"] && b.Kind != BlockInvalid { t.Errorf("then was not eliminated, but should have") } if b == fun.blocks["else"] && b.Kind != BlockInvalid { t.Errorf("else was not eliminated, but should have") } } } func TestFuseEliminatesEmptyBlocks(t *testing.T) { c := testConfig(t) // Case 1, plain type empty blocks z0 ~ z3 will be eliminated. // entry // | // z0 // | // z1 // | // z2 // | // z3 // | // exit fun := c.Fun("entry", Bloc("entry", Valu("mem", OpInitMem, types.TypeMem, 0, nil), Valu("sb", OpSB, c.config.Types.Uintptr, 0, nil), Goto("z0")), Bloc("z1", Goto("z2")), Bloc("z3", Goto("exit")), Bloc("z2", Goto("z3")), Bloc("z0", Goto("z1")), Bloc("exit", Exit("mem"), )) CheckFunc(fun.f) fuseLate(fun.f) for k, b := range fun.blocks { if k[:1] == "z" && b.Kind != BlockInvalid { t.Errorf("case1 %s was not eliminated, but should have", k) } } // Case 2, empty blocks with If branch, z0 and z1 will be eliminated. // entry // / \ // z0 z1 // \ / // exit fun = c.Fun("entry", Bloc("entry", Valu("mem", OpInitMem, types.TypeMem, 0, nil), Valu("c", OpArg, c.config.Types.Bool, 0, nil), If("c", "z0", "z1")), Bloc("z0", Goto("exit")), Bloc("z1", Goto("exit")), Bloc("exit", Exit("mem"), )) CheckFunc(fun.f) fuseLate(fun.f) for k, b := range fun.blocks { if k[:1] == "z" && b.Kind != BlockInvalid { t.Errorf("case2 %s was not eliminated, but should have", k) } } // Case 3, empty blocks with multiple predecessors, z0 and z1 will be eliminated. // entry // | \ // | b0 // | / \ // z0 z1 // \ / // exit fun = c.Fun("entry", Bloc("entry", Valu("mem", OpInitMem, types.TypeMem, 0, nil), Valu("c1", OpArg, c.config.Types.Bool, 0, nil), If("c1", "b0", "z0")), Bloc("b0", Valu("c2", OpArg, c.config.Types.Bool, 0, nil), If("c2", "z1", "z0")), Bloc("z0", Goto("exit")), Bloc("z1", Goto("exit")), Bloc("exit", Exit("mem"), )) CheckFunc(fun.f) fuseLate(fun.f) for k, b := range fun.blocks { if k[:1] == "z" && b.Kind != BlockInvalid { t.Errorf("case3 %s was not eliminated, but should have", k) } } } func TestFuseSideEffects(t *testing.T) { c := testConfig(t) // Case1, test that we don't fuse branches that have side effects but // have no use (e.g. followed by infinite loop). // See issue #36005. fun := c.Fun("entry", Bloc("entry", Valu("mem", OpInitMem, types.TypeMem, 0, nil), Valu("b", OpArg, c.config.Types.Bool, 0, nil), If("b", "then", "else")), Bloc("then", Valu("call1", OpStaticCall, types.TypeMem, 0, AuxCallLSym("_"), "mem"), Goto("empty")), Bloc("else", Valu("call2", OpStaticCall, types.TypeMem, 0, AuxCallLSym("_"), "mem"), Goto("empty")), Bloc("empty", Goto("loop")), Bloc("loop", Goto("loop"))) CheckFunc(fun.f) fuseLate(fun.f) for _, b := range fun.f.Blocks { if b == fun.blocks["then"] && b.Kind == BlockInvalid { t.Errorf("then is eliminated, but should not") } if b == fun.blocks["else"] && b.Kind == BlockInvalid { t.Errorf("else is eliminated, but should not") } } // Case2, z0 contains a value that has side effect, z0 shouldn't be eliminated. // entry // | \ // | z0 // | / // exit fun = c.Fun("entry", Bloc("entry", Valu("mem", OpInitMem, types.TypeMem, 0, nil), Valu("c1", OpArg, c.config.Types.Bool, 0, nil), Valu("p", OpArg, c.config.Types.IntPtr, 0, nil), If("c1", "z0", "exit")), Bloc("z0", Valu("nilcheck", OpNilCheck, types.TypeVoid, 0, nil, "p", "mem"), Goto("exit")), Bloc("exit", Exit("mem"), )) CheckFunc(fun.f) fuseLate(fun.f) z0, ok := fun.blocks["z0"] if !ok || z0.Kind == BlockInvalid { t.Errorf("case2 z0 is eliminated, but should not") } } func BenchmarkFuse(b *testing.B) { for _, n := range [...]int{1, 10, 100, 1000, 10000} { b.Run(strconv.Itoa(n), func(b *testing.B) { c := testConfig(b) blocks := make([]bloc, 0, 2*n+3) blocks = append(blocks, Bloc("entry", Valu("mem", OpInitMem, types.TypeMem, 0, nil), Valu("cond", OpArg, c.config.Types.Bool, 0, nil), Valu("x", OpArg, c.config.Types.Int64, 0, nil), Goto("exit"))) phiArgs := make([]string, 0, 2*n) for i := 0; i < n; i++ { cname := fmt.Sprintf("c%d", i) blocks = append(blocks, Bloc(fmt.Sprintf("b%d", i), If("cond", cname, "merge")), Bloc(cname, Goto("merge"))) phiArgs = append(phiArgs, "x", "x") } blocks = append(blocks, Bloc("merge", Valu("phi", OpPhi, types.TypeMem, 0, nil, phiArgs...), Goto("exit")), Bloc("exit", Exit("mem"))) b.ResetTimer() for i := 0; i < b.N; i++ { fun := c.Fun("entry", blocks...) fuseLate(fun.f) } }) } }
Upload File
Create Folder