forked from security/hakurei
This also uses priority obtained via sched_get_priority_min, and improves bounds checking. Signed-off-by: Ophestra <cat@gensokyo.uk>
101 lines
2.7 KiB
Go
101 lines
2.7 KiB
Go
package container_test
|
|
|
|
import (
|
|
"encoding/json"
|
|
"errors"
|
|
"math"
|
|
"reflect"
|
|
"syscall"
|
|
"testing"
|
|
|
|
"hakurei.app/container"
|
|
"hakurei.app/container/std"
|
|
)
|
|
|
|
func TestSchedPolicyJSON(t *testing.T) {
|
|
t.Parallel()
|
|
|
|
testCases := []struct {
|
|
policy container.SchedPolicy
|
|
want string
|
|
encodeErr error
|
|
decodeErr error
|
|
}{
|
|
{container.SCHED_NORMAL, `""`, nil, nil},
|
|
{container.SCHED_FIFO, `"fifo"`, nil, nil},
|
|
{container.SCHED_RR, `"rr"`, nil, nil},
|
|
{container.SCHED_BATCH, `"batch"`, nil, nil},
|
|
{4, `"invalid policy 4"`, syscall.EINVAL, container.InvalidSchedPolicyError("invalid policy 4")},
|
|
{container.SCHED_IDLE, `"idle"`, nil, nil},
|
|
{container.SCHED_DEADLINE, `"deadline"`, nil, nil},
|
|
{container.SCHED_EXT, `"ext"`, nil, nil},
|
|
{math.MaxInt, `"iso"`, syscall.EINVAL, container.InvalidSchedPolicyError("iso")},
|
|
}
|
|
for _, tc := range testCases {
|
|
name := tc.policy.String()
|
|
if tc.policy == container.SCHED_NORMAL {
|
|
name = "normal"
|
|
}
|
|
|
|
t.Run(name, func(t *testing.T) {
|
|
t.Parallel()
|
|
|
|
got, err := json.Marshal(tc.policy)
|
|
if !errors.Is(err, tc.encodeErr) {
|
|
t.Fatalf("Marshal: error = %v, want %v", err, tc.encodeErr)
|
|
}
|
|
if err == nil && string(got) != tc.want {
|
|
t.Fatalf("Marshal: %s, want %s", string(got), tc.want)
|
|
}
|
|
|
|
var v container.SchedPolicy
|
|
if err = json.Unmarshal([]byte(tc.want), &v); !reflect.DeepEqual(err, tc.decodeErr) {
|
|
t.Fatalf("Unmarshal: error = %v, want %v", err, tc.decodeErr)
|
|
}
|
|
if err == nil && v != tc.policy {
|
|
t.Fatalf("Unmarshal: %d, want %d", v, tc.policy)
|
|
}
|
|
})
|
|
}
|
|
}
|
|
|
|
func TestSchedPolicyMinMax(t *testing.T) {
|
|
t.Parallel()
|
|
|
|
testCases := []struct {
|
|
policy container.SchedPolicy
|
|
min, max std.Int
|
|
err error
|
|
}{
|
|
{container.SCHED_NORMAL, 0, 0, nil},
|
|
{container.SCHED_FIFO, 1, 99, nil},
|
|
{container.SCHED_RR, 1, 99, nil},
|
|
{container.SCHED_BATCH, 0, 0, nil},
|
|
{4, -1, -1, syscall.EINVAL},
|
|
{container.SCHED_IDLE, 0, 0, nil},
|
|
{container.SCHED_DEADLINE, 0, 0, nil},
|
|
{container.SCHED_EXT, 0, 0, nil},
|
|
}
|
|
for _, tc := range testCases {
|
|
name := tc.policy.String()
|
|
if tc.policy == container.SCHED_NORMAL {
|
|
name = "normal"
|
|
}
|
|
|
|
t.Run(name, func(t *testing.T) {
|
|
t.Parallel()
|
|
|
|
if priority, err := tc.policy.GetPriorityMax(); !reflect.DeepEqual(err, tc.err) {
|
|
t.Fatalf("GetPriorityMax: error = %v, want %v", err, tc.err)
|
|
} else if priority != tc.max {
|
|
t.Fatalf("GetPriorityMax: %d, want %d", priority, tc.max)
|
|
}
|
|
if priority, err := tc.policy.GetPriorityMin(); !reflect.DeepEqual(err, tc.err) {
|
|
t.Fatalf("GetPriorityMin: error = %v, want %v", err, tc.err)
|
|
} else if priority != tc.min {
|
|
t.Fatalf("GetPriorityMin: %d, want %d", priority, tc.min)
|
|
}
|
|
})
|
|
}
|
|
}
|