go schedule_test 源码
golang schedule_test 代码
文件路径：/src/cmd/compile/internal/ssa/schedule_test.go
// Copyright 2015 The Go Authors. All rights reserved.
// Use of this source code is governed by a BSD-style
// license that can be found in the LICENSE file.
package ssa
import (
"cmd/compile/internal/types"
"testing"
)
func TestSchedule(t *testing.T) {
c := testConfig(t)
cases := []fun{
c.Fun("entry",
Bloc("entry",
Valu("mem0", OpInitMem, types.TypeMem, 0, nil),
Valu("ptr", OpConst64, c.config.Types.Int64, 0xABCD, nil),
Valu("v", OpConst64, c.config.Types.Int64, 12, nil),
Valu("mem1", OpStore, types.TypeMem, 0, c.config.Types.Int64, "ptr", "v", "mem0"),
Valu("mem2", OpStore, types.TypeMem, 0, c.config.Types.Int64, "ptr", "v", "mem1"),
Valu("mem3", OpStore, types.TypeMem, 0, c.config.Types.Int64, "ptr", "sum", "mem2"),
Valu("l1", OpLoad, c.config.Types.Int64, 0, nil, "ptr", "mem1"),
Valu("l2", OpLoad, c.config.Types.Int64, 0, nil, "ptr", "mem2"),
Valu("sum", OpAdd64, c.config.Types.Int64, 0, nil, "l1", "l2"),
Goto("exit")),
Bloc("exit",
Exit("mem3"))),
}
for _, c := range cases {
schedule(c.f)
if !isSingleLiveMem(c.f) {
t.Error("single-live-mem restriction not enforced by schedule for func:")
printFunc(c.f)
}
}
}
func isSingleLiveMem(f *Func) bool {
for _, b := range f.Blocks {
var liveMem *Value
for _, v := range b.Values {
for _, w := range v.Args {
if w.Type.IsMemory() {
if liveMem == nil {
liveMem = w
continue
}
if w != liveMem {
return false
}
}
}
if v.Type.IsMemory() {
liveMem = v
}
}
}
return true
}
func TestStoreOrder(t *testing.T) {
// In the function below, v2 depends on v3 and v4, v4 depends on v3, and v3 depends on store v5.
// storeOrder did not handle this case correctly.
c := testConfig(t)
fun := c.Fun("entry",
Bloc("entry",
Valu("mem0", OpInitMem, types.TypeMem, 0, nil),
Valu("a", OpAdd64, c.config.Types.Int64, 0, nil, "b", "c"), // v2
Valu("b", OpLoad, c.config.Types.Int64, 0, nil, "ptr", "mem1"), // v3
Valu("c", OpNeg64, c.config.Types.Int64, 0, nil, "b"), // v4
Valu("mem1", OpStore, types.TypeMem, 0, c.config.Types.Int64, "ptr", "v", "mem0"), // v5
Valu("mem2", OpStore, types.TypeMem, 0, c.config.Types.Int64, "ptr", "a", "mem1"),
Valu("ptr", OpConst64, c.config.Types.Int64, 0xABCD, nil),
Valu("v", OpConst64, c.config.Types.Int64, 12, nil),
Goto("exit")),
Bloc("exit",
Exit("mem2")))
CheckFunc(fun.f)
order := storeOrder(fun.f.Blocks[0].Values, fun.f.newSparseSet(fun.f.NumValues()), make([]int32, fun.f.NumValues()))
// check that v2, v3, v4 is sorted after v5
var ai, bi, ci, si int
for i, v := range order {
switch v.ID {
case 2:
ai = i
case 3:
bi = i
case 4:
ci = i
case 5:
si = i
}
}
if ai < si || bi < si || ci < si {
t.Logf("Func: %s", fun.f)
t.Errorf("store order is wrong: got %v, want v2 v3 v4 after v5", order)
}
}
相关信息
相关文章
0
赞
热门推荐
-
2、 - 优质文章
-
3、 gate.io
-
6、 golang
-
8、 openharmony