mirror of
https://github.com/kemko/nomad.git
synced 2026-01-03 00:45:43 +03:00
dd396a3900
* windows: revert process listing logic to that of v1.6.10 In Nomad 1.7 much of the process management code was refactored, including a rewrite of how the process tree of an executor was determined on Windows machines. Unfortunately that rewrite has been cursed with performance issues and bugs. Instead, revert to the logic used in v1.6.10. * changelog
105 lines
1.9 KiB
Go
105 lines
1.9 KiB
Go
// Copyright (c) HashiCorp, Inc.
|
|
// SPDX-License-Identifier: MPL-2.0
|
|
|
|
package procstats
|
|
|
|
import (
|
|
"math/rand"
|
|
"testing"
|
|
|
|
"github.com/mitchellh/go-ps"
|
|
"github.com/shoenig/test/must"
|
|
)
|
|
|
|
type mockProcess struct {
|
|
pid int
|
|
ppid int
|
|
}
|
|
|
|
func (p *mockProcess) Pid() int {
|
|
return p.pid
|
|
}
|
|
|
|
func (p *mockProcess) PPid() int {
|
|
return p.ppid
|
|
}
|
|
|
|
func (p *mockProcess) Executable() string {
|
|
return ""
|
|
}
|
|
|
|
func mockProc(pid, ppid int) *mockProcess {
|
|
return &mockProcess{pid: pid, ppid: ppid}
|
|
}
|
|
|
|
func genMockProcs(needles, haystack int) ([]ps.Process, []ProcessID) {
|
|
|
|
procs := []ps.Process{mockProc(1, 1), mockProc(42, 1)}
|
|
expect := []ProcessID{42}
|
|
|
|
// TODO: make this into a tree structure, not just a linear tree
|
|
for i := 0; i < needles; i++ {
|
|
parent := 42 + i
|
|
pid := parent + 1
|
|
procs = append(procs, mockProc(pid, parent))
|
|
expect = append(expect, pid)
|
|
}
|
|
|
|
for i := 0; i < haystack; i++ {
|
|
parent := 200 + i
|
|
pid := parent + 1
|
|
procs = append(procs, mockProc(pid, parent))
|
|
}
|
|
|
|
rand.Shuffle(len(procs), func(i, j int) {
|
|
procs[i], procs[j] = procs[j], procs[i]
|
|
})
|
|
|
|
return procs, expect
|
|
}
|
|
|
|
func Test_list(t *testing.T) {
|
|
cases := []struct {
|
|
name string
|
|
needles int
|
|
haystack int
|
|
}{
|
|
{
|
|
name: "minimal",
|
|
needles: 2,
|
|
haystack: 10,
|
|
},
|
|
{
|
|
name: "small needles small haystack",
|
|
needles: 5,
|
|
haystack: 200,
|
|
},
|
|
{
|
|
name: "small needles large haystack",
|
|
needles: 10,
|
|
haystack: 1000,
|
|
},
|
|
{
|
|
name: "moderate needles giant haystack",
|
|
needles: 20,
|
|
haystack: 2000,
|
|
},
|
|
}
|
|
|
|
for _, tc := range cases {
|
|
const executorPID = 42
|
|
t.Run(tc.name, func(t *testing.T) {
|
|
|
|
procs, expect := genMockProcs(tc.needles, tc.haystack)
|
|
lister := func() ([]ps.Process, error) {
|
|
return procs, nil
|
|
}
|
|
|
|
result := list(executorPID, lister)
|
|
must.SliceContainsAll(t, expect, result.Slice(),
|
|
must.Sprintf("exp: %v; got: %v", expect, result),
|
|
)
|
|
})
|
|
}
|
|
}
|