2015-09-15 21:43:53 +02:00
|
|
|
// 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 gc
|
|
|
|
|
|
2015-09-19 23:55:27 +02:00
|
|
|
import (
|
|
|
|
|
"reflect"
|
2016-02-26 13:03:11 -08:00
|
|
|
"sort"
|
2015-09-19 23:55:27 +02:00
|
|
|
"testing"
|
|
|
|
|
)
|
2015-09-15 21:43:53 +02:00
|
|
|
|
2016-04-01 20:11:30 -07:00
|
|
|
func typeWithoutPointers() *Type {
|
|
|
|
|
return &Type{Etype: TSTRUCT, Extra: &StructType{Haspointers: 1}} // haspointers -> false
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
func typeWithPointers() *Type {
|
|
|
|
|
return &Type{Etype: TSTRUCT, Extra: &StructType{Haspointers: 2}} // haspointers -> true
|
|
|
|
|
}
|
|
|
|
|
|
2015-09-15 21:43:53 +02:00
|
|
|
// Test all code paths for cmpstackvarlt.
|
|
|
|
|
func TestCmpstackvar(t *testing.T) {
|
|
|
|
|
testdata := []struct {
|
|
|
|
|
a, b Node
|
|
|
|
|
lt bool
|
|
|
|
|
}{
|
|
|
|
|
{
|
|
|
|
|
Node{Class: PAUTO},
|
|
|
|
|
Node{Class: PFUNC},
|
|
|
|
|
false,
|
|
|
|
|
},
|
|
|
|
|
{
|
|
|
|
|
Node{Class: PFUNC},
|
|
|
|
|
Node{Class: PAUTO},
|
|
|
|
|
true,
|
|
|
|
|
},
|
|
|
|
|
{
|
|
|
|
|
Node{Class: PFUNC, Xoffset: 0},
|
|
|
|
|
Node{Class: PFUNC, Xoffset: 10},
|
|
|
|
|
true,
|
|
|
|
|
},
|
|
|
|
|
{
|
|
|
|
|
Node{Class: PFUNC, Xoffset: 20},
|
|
|
|
|
Node{Class: PFUNC, Xoffset: 10},
|
|
|
|
|
false,
|
|
|
|
|
},
|
|
|
|
|
{
|
|
|
|
|
Node{Class: PFUNC, Xoffset: 10},
|
|
|
|
|
Node{Class: PFUNC, Xoffset: 10},
|
|
|
|
|
false,
|
|
|
|
|
},
|
2016-02-20 21:36:12 -08:00
|
|
|
{
|
|
|
|
|
Node{Class: PPARAM, Xoffset: 10},
|
|
|
|
|
Node{Class: PPARAMOUT, Xoffset: 20},
|
|
|
|
|
true,
|
|
|
|
|
},
|
|
|
|
|
{
|
|
|
|
|
Node{Class: PPARAMOUT, Xoffset: 10},
|
|
|
|
|
Node{Class: PPARAM, Xoffset: 20},
|
|
|
|
|
true,
|
|
|
|
|
},
|
2015-09-15 21:43:53 +02:00
|
|
|
{
|
2017-02-27 19:56:38 +02:00
|
|
|
Node{Class: PAUTO, flags: nodeUsed},
|
|
|
|
|
Node{Class: PAUTO},
|
2015-09-15 21:43:53 +02:00
|
|
|
true,
|
|
|
|
|
},
|
|
|
|
|
{
|
2017-02-27 19:56:38 +02:00
|
|
|
Node{Class: PAUTO},
|
|
|
|
|
Node{Class: PAUTO, flags: nodeUsed},
|
2015-09-15 21:43:53 +02:00
|
|
|
false,
|
|
|
|
|
},
|
|
|
|
|
{
|
2016-04-01 20:11:30 -07:00
|
|
|
Node{Class: PAUTO, Type: typeWithoutPointers()},
|
|
|
|
|
Node{Class: PAUTO, Type: typeWithPointers()},
|
2015-09-15 21:43:53 +02:00
|
|
|
false,
|
|
|
|
|
},
|
|
|
|
|
{
|
2016-04-01 20:11:30 -07:00
|
|
|
Node{Class: PAUTO, Type: typeWithPointers()},
|
|
|
|
|
Node{Class: PAUTO, Type: typeWithoutPointers()},
|
2015-09-15 21:43:53 +02:00
|
|
|
true,
|
|
|
|
|
},
|
|
|
|
|
{
|
2017-02-27 19:56:38 +02:00
|
|
|
Node{Class: PAUTO, Type: &Type{}, Name: &Name{flags: nameNeedzero}},
|
|
|
|
|
Node{Class: PAUTO, Type: &Type{}, Name: &Name{}},
|
2015-09-15 21:43:53 +02:00
|
|
|
true,
|
|
|
|
|
},
|
|
|
|
|
{
|
2017-02-27 19:56:38 +02:00
|
|
|
Node{Class: PAUTO, Type: &Type{}, Name: &Name{}},
|
|
|
|
|
Node{Class: PAUTO, Type: &Type{}, Name: &Name{flags: nameNeedzero}},
|
2015-09-15 21:43:53 +02:00
|
|
|
false,
|
|
|
|
|
},
|
|
|
|
|
{
|
|
|
|
|
Node{Class: PAUTO, Type: &Type{Width: 1}, Name: &Name{}},
|
|
|
|
|
Node{Class: PAUTO, Type: &Type{Width: 2}, Name: &Name{}},
|
|
|
|
|
false,
|
|
|
|
|
},
|
|
|
|
|
{
|
|
|
|
|
Node{Class: PAUTO, Type: &Type{Width: 2}, Name: &Name{}},
|
|
|
|
|
Node{Class: PAUTO, Type: &Type{Width: 1}, Name: &Name{}},
|
|
|
|
|
true,
|
|
|
|
|
},
|
|
|
|
|
{
|
|
|
|
|
Node{Class: PAUTO, Type: &Type{}, Name: &Name{}, Sym: &Sym{Name: "abc"}},
|
|
|
|
|
Node{Class: PAUTO, Type: &Type{}, Name: &Name{}, Sym: &Sym{Name: "xyz"}},
|
|
|
|
|
true,
|
|
|
|
|
},
|
|
|
|
|
{
|
|
|
|
|
Node{Class: PAUTO, Type: &Type{}, Name: &Name{}, Sym: &Sym{Name: "abc"}},
|
|
|
|
|
Node{Class: PAUTO, Type: &Type{}, Name: &Name{}, Sym: &Sym{Name: "abc"}},
|
|
|
|
|
false,
|
|
|
|
|
},
|
|
|
|
|
{
|
|
|
|
|
Node{Class: PAUTO, Type: &Type{}, Name: &Name{}, Sym: &Sym{Name: "xyz"}},
|
|
|
|
|
Node{Class: PAUTO, Type: &Type{}, Name: &Name{}, Sym: &Sym{Name: "abc"}},
|
|
|
|
|
false,
|
|
|
|
|
},
|
|
|
|
|
}
|
|
|
|
|
for _, d := range testdata {
|
|
|
|
|
got := cmpstackvarlt(&d.a, &d.b)
|
|
|
|
|
if got != d.lt {
|
|
|
|
|
t.Errorf("want %#v < %#v", d.a, d.b)
|
|
|
|
|
}
|
2016-02-20 21:36:12 -08:00
|
|
|
// If we expect a < b to be true, check that b < a is false.
|
|
|
|
|
if d.lt && cmpstackvarlt(&d.b, &d.a) {
|
|
|
|
|
t.Errorf("unexpected %#v < %#v", d.b, d.a)
|
|
|
|
|
}
|
2015-09-15 21:43:53 +02:00
|
|
|
}
|
|
|
|
|
}
|
2015-09-19 23:55:27 +02:00
|
|
|
|
2016-02-26 13:03:11 -08:00
|
|
|
func TestStackvarSort(t *testing.T) {
|
2015-09-19 23:55:27 +02:00
|
|
|
inp := []*Node{
|
|
|
|
|
{Class: PFUNC, Type: &Type{}, Name: &Name{}, Sym: &Sym{}},
|
|
|
|
|
{Class: PAUTO, Type: &Type{}, Name: &Name{}, Sym: &Sym{}},
|
|
|
|
|
{Class: PFUNC, Xoffset: 0, Type: &Type{}, Name: &Name{}, Sym: &Sym{}},
|
|
|
|
|
{Class: PFUNC, Xoffset: 10, Type: &Type{}, Name: &Name{}, Sym: &Sym{}},
|
|
|
|
|
{Class: PFUNC, Xoffset: 20, Type: &Type{}, Name: &Name{}, Sym: &Sym{}},
|
2017-02-27 19:56:38 +02:00
|
|
|
{Class: PAUTO, flags: nodeUsed, Type: &Type{}, Name: &Name{}, Sym: &Sym{}},
|
2016-04-01 20:11:30 -07:00
|
|
|
{Class: PAUTO, Type: typeWithoutPointers(), Name: &Name{}, Sym: &Sym{}},
|
2015-09-19 23:55:27 +02:00
|
|
|
{Class: PAUTO, Type: &Type{}, Name: &Name{}, Sym: &Sym{}},
|
2017-02-27 19:56:38 +02:00
|
|
|
{Class: PAUTO, Type: &Type{}, Name: &Name{flags: nameNeedzero}, Sym: &Sym{}},
|
2015-09-19 23:55:27 +02:00
|
|
|
{Class: PAUTO, Type: &Type{Width: 1}, Name: &Name{}, Sym: &Sym{}},
|
|
|
|
|
{Class: PAUTO, Type: &Type{Width: 2}, Name: &Name{}, Sym: &Sym{}},
|
|
|
|
|
{Class: PAUTO, Type: &Type{}, Name: &Name{}, Sym: &Sym{Name: "abc"}},
|
|
|
|
|
{Class: PAUTO, Type: &Type{}, Name: &Name{}, Sym: &Sym{Name: "xyz"}},
|
|
|
|
|
}
|
|
|
|
|
want := []*Node{
|
|
|
|
|
{Class: PFUNC, Type: &Type{}, Name: &Name{}, Sym: &Sym{}},
|
|
|
|
|
{Class: PFUNC, Xoffset: 0, Type: &Type{}, Name: &Name{}, Sym: &Sym{}},
|
|
|
|
|
{Class: PFUNC, Xoffset: 10, Type: &Type{}, Name: &Name{}, Sym: &Sym{}},
|
|
|
|
|
{Class: PFUNC, Xoffset: 20, Type: &Type{}, Name: &Name{}, Sym: &Sym{}},
|
2017-02-27 19:56:38 +02:00
|
|
|
{Class: PAUTO, flags: nodeUsed, Type: &Type{}, Name: &Name{}, Sym: &Sym{}},
|
|
|
|
|
{Class: PAUTO, Type: &Type{}, Name: &Name{flags: nameNeedzero}, Sym: &Sym{}},
|
2015-09-19 23:55:27 +02:00
|
|
|
{Class: PAUTO, Type: &Type{Width: 2}, Name: &Name{}, Sym: &Sym{}},
|
|
|
|
|
{Class: PAUTO, Type: &Type{Width: 1}, Name: &Name{}, Sym: &Sym{}},
|
|
|
|
|
{Class: PAUTO, Type: &Type{}, Name: &Name{}, Sym: &Sym{}},
|
|
|
|
|
{Class: PAUTO, Type: &Type{}, Name: &Name{}, Sym: &Sym{}},
|
|
|
|
|
{Class: PAUTO, Type: &Type{}, Name: &Name{}, Sym: &Sym{Name: "abc"}},
|
|
|
|
|
{Class: PAUTO, Type: &Type{}, Name: &Name{}, Sym: &Sym{Name: "xyz"}},
|
2016-04-01 20:11:30 -07:00
|
|
|
{Class: PAUTO, Type: typeWithoutPointers(), Name: &Name{}, Sym: &Sym{}},
|
2015-09-19 23:55:27 +02:00
|
|
|
}
|
|
|
|
|
// haspointers updates Type.Haspointers as a side effect, so
|
|
|
|
|
// exercise this function on all inputs so that reflect.DeepEqual
|
|
|
|
|
// doesn't produce false positives.
|
|
|
|
|
for i := range want {
|
|
|
|
|
haspointers(want[i].Type)
|
|
|
|
|
haspointers(inp[i].Type)
|
|
|
|
|
}
|
|
|
|
|
|
2016-02-26 13:03:11 -08:00
|
|
|
sort.Sort(byStackVar(inp))
|
|
|
|
|
if !reflect.DeepEqual(want, inp) {
|
|
|
|
|
t.Error("sort failed")
|
|
|
|
|
for i := range inp {
|
|
|
|
|
g := inp[i]
|
2015-09-19 23:55:27 +02:00
|
|
|
w := want[i]
|
|
|
|
|
eq := reflect.DeepEqual(w, g)
|
|
|
|
|
if !eq {
|
|
|
|
|
t.Log(i, w, g)
|
|
|
|
|
}
|
|
|
|
|
}
|
|
|
|
|
}
|
|
|
|
|
}
|