blob: 8c3f3c8c1721dc8ba9589c438c905509c03dd9b9 [file] [log] [blame] [edit]
// Copyright 2018 syzkaller project authors. All rights reserved.
// Use of this source code is governed by Apache 2 LICENSE that can be found in the LICENSE file.
package prog
import (
"fmt"
"math/rand"
"sort"
"strings"
"testing"
"github.com/google/syzkaller/pkg/testutil"
)
func TestIsComplexPtr(t *testing.T) {
testEachTargetRandom(t, func(t *testing.T, target *Target, rs rand.Source, iters int) {
allComplex := make(map[string]bool)
ForeachType(target.Syscalls, func(t Type, ctx *TypeCtx) {
if ptr, ok := t.(*PtrType); ok && ptr.SquashableElem {
allComplex[ptr.Elem.String()] = true
}
})
var arr []string
for id := range allComplex {
arr = append(arr, id)
}
sort.Strings(arr)
// Log all complex types for manual inspection.
t.Log("complex types:\n" + strings.Join(arr, "\n"))
if testing.Short() || testutil.RaceEnabled {
return
}
// Compare with what we can generate at runtime.
// We cannot guarantee that we will generate 100% of complex types
// (some are no_generate, and the process is random), but we should
// generate at least 90% or there is something wrong.
ct := target.DefaultChoiceTable()
r := newRand(target, rs)
generatedComplex := make(map[string]bool)
for _, meta := range target.Syscalls {
if meta.Attrs.Disabled || meta.Attrs.NoGenerate {
continue
}
for i := 0; i < 10; i++ {
s := newState(target, ct, nil)
calls := r.generateParticularCall(s, meta)
p := &Prog{Target: target, Calls: calls}
for _, arg := range p.complexPtrs() {
generatedComplex[arg.arg.Res.Type().String()] = true
}
}
}
for id := range generatedComplex {
if !allComplex[id] {
t.Errorf("generated complex %v that is not statically complex", id)
}
}
for id := range allComplex {
if !generatedComplex[id] {
t.Logf("did not generate %v", id)
}
}
if len(generatedComplex) < len(allComplex)*9/10 {
t.Errorf("generated too few complex types: %v/%v", len(generatedComplex), len(allComplex))
}
})
}
func TestSquash(t *testing.T) {
target := initTargetTest(t, "test", "64")
// nolint: lll
tests := []struct {
prog string
squashed string // leave empty if the arg must not be squashed
}{
{
`foo$any_in(&(0x7f0000000000)={0x11, 0x11223344, 0x2233, 0x1122334455667788, {0x1, 0x7, 0x1, 0x1, 0x1bc, 0x4}, [{@res32=0x0, @i8=0x44, "aabb"}, {@res64=0x1, @i32=0x11223344, "1122334455667788"}, {@res8=0x2, @i8=0x55, "cc"}]})`,
`foo$any_in(&(0x7f0000000000)=ANY=[@ANYBLOB="1100000044332211223300000000000088776655443322117d00bc11", @ANYRES32=0x0, @ANYBLOB="0000000044aabb00", @ANYRES64=0x1, @ANYBLOB="443322111122334455667788", @ANYRES8=0x2, @ANYBLOB="0000000000000055cc0000"])`,
},
{
// Inout pointers must not be squashed.
`foo$any_inout(&(0x7f0000000000)={0x11, 0x11223344, 0x2233, 0x1122334455667788, {0x1, 0x7, 0x1, 0x1, 0x1bc, 0x4}, [{@res32=0x0, @i8=0x44, "aabb"}, {@res64=0x1, @i32=0x11223344, "1122334455667788"}, {@res8=0x2, @i8=0x55, "cc"}]})`,
``,
},
{
// Squashing of structs with out_overlay is not supported yet
// (used to panic, see isComplexPtr).
`
overlay_any(&(0x7f0000000000)=@overlay2={0x0, 0x0, <r0=>0x0, 0x0})
overlay_uses(0x0, 0x0, 0x0, r0)
`,
``,
},
{
// Unions with filenames must not be squashed.
`foo$any_filename(&AUTO)`,
``,
},
}
for i, test := range tests {
t.Run(fmt.Sprint(i), func(t *testing.T) {
p, err := target.Deserialize([]byte(test.prog), Strict)
if err != nil {
t.Fatalf("failed to deserialize prog: %v", err)
}
ptrArg := p.Calls[0].Args[0].(*PointerArg)
if test.squashed == "" {
if target.isComplexPtr(ptrArg) {
t.Fatalf("arg is complex and can be squashed")
}
return
}
if !target.isComplexPtr(ptrArg) {
t.Fatalf("arg is not complex")
}
if target.ArgContainsAny(ptrArg) {
t.Fatalf("arg is already squashed")
}
target.squashPtr(ptrArg)
if !target.ArgContainsAny(ptrArg) {
t.Fatalf("arg is not squashed")
}
p1 := strings.TrimSpace(string(p.Serialize()))
target.squashPtr(ptrArg)
p2 := strings.TrimSpace(string(p.Serialize()))
if p1 != p2 {
t.Fatalf("double squash changed program:\n%v\nvs:\n%v", p1, p2)
}
if p1 != test.squashed {
t.Fatalf("bad squash result:\n%v\nwant:\n%v", p1, test.squashed)
}
})
}
}