-
Notifications
You must be signed in to change notification settings - Fork 712
Commit
This commit does not belong to any branch on this repository, and may belong to a fork outside of the repository.
- Move pidtree to its own module and disaggregate it into tree, walker and reporter. - Extend testing for probe/process - Extend process metadata; add command line.
- Loading branch information
Tom Wilkie
committed
Jun 23, 2015
1 parent
744ecc8
commit 16bba90
Showing
16 changed files
with
392 additions
and
218 deletions.
There are no files selected for viewing
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
Original file line number | Diff line number | Diff line change |
---|---|---|
@@ -0,0 +1,58 @@ | ||
package process | ||
|
||
import ( | ||
"strconv" | ||
|
||
"github.com/weaveworks/scope/report" | ||
) | ||
|
||
// We use these keys in node metadata | ||
const ( | ||
PID = "pid" | ||
Comm = "comm" | ||
PPID = "ppid" | ||
Cmdline = "cmdline" | ||
) | ||
|
||
// Reporter generate Reports containing the Process topology | ||
type Reporter struct { | ||
procRoot string | ||
scope string | ||
} | ||
|
||
// NewReporter makes a new Reporter | ||
func NewReporter(procRoot, scope string) *Reporter { | ||
return &Reporter{ | ||
procRoot: procRoot, | ||
scope: scope, | ||
} | ||
} | ||
|
||
// Report generates a Report containing the Process topology | ||
func (r *Reporter) Report() (report.Report, error) { | ||
result := report.MakeReport() | ||
processes, err := r.processTopology() | ||
if err != nil { | ||
return result, err | ||
} | ||
result.Process.Merge(processes) | ||
return result, nil | ||
} | ||
|
||
func (r *Reporter) processTopology() (report.Topology, error) { | ||
t := report.NewTopology() | ||
err := Walk(r.procRoot, func(p *Process) { | ||
pidstr := strconv.Itoa(p.PID) | ||
nodeID := report.MakeProcessNodeID(r.scope, pidstr) | ||
t.NodeMetadatas[nodeID] = report.NodeMetadata{ | ||
PID: pidstr, | ||
Comm: p.Comm, | ||
Cmdline: p.Cmdline, | ||
} | ||
if p.PPID > 0 { | ||
t.NodeMetadatas[nodeID][PPID] = strconv.Itoa(p.PPID) | ||
} | ||
}) | ||
|
||
return t, err | ||
} |
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
Original file line number | Diff line number | Diff line change |
---|---|---|
@@ -0,0 +1,64 @@ | ||
package process_test | ||
|
||
import ( | ||
"reflect" | ||
"testing" | ||
|
||
"github.com/weaveworks/scope/probe/process" | ||
"github.com/weaveworks/scope/report" | ||
"github.com/weaveworks/scope/test" | ||
) | ||
|
||
func TestReporter(t *testing.T) { | ||
oldWalk := process.Walk | ||
defer func() { process.Walk = oldWalk }() | ||
|
||
process.Walk = func(_ string, f func(*process.Process)) error { | ||
for _, p := range []*process.Process{ | ||
{PID: 1, PPID: 0, Comm: "init"}, | ||
{PID: 2, PPID: 1, Comm: "bash"}, | ||
{PID: 3, PPID: 1, Comm: "apache"}, | ||
{PID: 4, PPID: 2, Comm: "ping", Cmdline: "ping foo.bar.local"}, | ||
} { | ||
f(p) | ||
} | ||
return nil | ||
} | ||
|
||
reporter := process.NewReporter("", "") | ||
want := report.MakeReport() | ||
want.Process = report.Topology{ | ||
Adjacency: report.Adjacency{}, | ||
EdgeMetadatas: report.EdgeMetadatas{}, | ||
NodeMetadatas: report.NodeMetadatas{ | ||
report.MakeProcessNodeID("", "1"): report.NodeMetadata{ | ||
process.PID: "1", | ||
process.Comm: "init", | ||
process.Cmdline: "", | ||
}, | ||
report.MakeProcessNodeID("", "2"): report.NodeMetadata{ | ||
process.PID: "2", | ||
process.Comm: "bash", | ||
process.PPID: "1", | ||
process.Cmdline: "", | ||
}, | ||
report.MakeProcessNodeID("", "3"): report.NodeMetadata{ | ||
process.PID: "3", | ||
process.Comm: "apache", | ||
process.PPID: "1", | ||
process.Cmdline: "", | ||
}, | ||
report.MakeProcessNodeID("", "4"): report.NodeMetadata{ | ||
process.PID: "4", | ||
process.Comm: "ping", | ||
process.PPID: "2", | ||
process.Cmdline: "ping foo.bar.local", | ||
}, | ||
}, | ||
} | ||
|
||
have, err := reporter.Report() | ||
if err != nil || !reflect.DeepEqual(want, have) { | ||
t.Errorf("%s (%v)", test.Diff(want, have), err) | ||
} | ||
} |
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
Original file line number | Diff line number | Diff line change |
---|---|---|
@@ -0,0 +1,34 @@ | ||
package process | ||
|
||
import ( | ||
"fmt" | ||
) | ||
|
||
// Tree represents all processes on the machine. | ||
type Tree interface { | ||
GetParent(pid int) (int, error) | ||
} | ||
|
||
type tree struct { | ||
processes map[int]*Process | ||
} | ||
|
||
// NewTree returns a new Tree that can be polled. | ||
func NewTree(procRoot string) (Tree, error) { | ||
pt := tree{processes: map[int]*Process{}} | ||
err := Walk(procRoot, func(p *Process) { | ||
pt.processes[p.PID] = p | ||
}) | ||
|
||
return &pt, err | ||
} | ||
|
||
// GetParent returns the pid of the parent process for a given pid | ||
func (pt *tree) GetParent(pid int) (int, error) { | ||
proc, ok := pt.processes[pid] | ||
if !ok { | ||
return -1, fmt.Errorf("PID %d not found", pid) | ||
} | ||
|
||
return proc.PPID, nil | ||
} |
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
Original file line number | Diff line number | Diff line change |
---|---|---|
@@ -0,0 +1,37 @@ | ||
package process_test | ||
|
||
import ( | ||
"reflect" | ||
"testing" | ||
|
||
"github.com/weaveworks/scope/probe/process" | ||
) | ||
|
||
func TestTree(t *testing.T) { | ||
oldWalk := process.Walk | ||
defer func() { process.Walk = oldWalk }() | ||
|
||
process.Walk = func(_ string, f func(*process.Process)) error { | ||
for _, p := range []*process.Process{ | ||
{PID: 1, PPID: 0, Comm: "(unknown)"}, | ||
{PID: 2, PPID: 1, Comm: "(unknown)"}, | ||
{PID: 3, PPID: 1, Comm: "(unknown)"}, | ||
{PID: 4, PPID: 2, Comm: "(unknown)"}, | ||
} { | ||
f(p) | ||
} | ||
return nil | ||
} | ||
|
||
tree, err := process.NewTree("foo") | ||
if err != nil { | ||
t.Fatalf("newProcessTree error: %v", err) | ||
} | ||
|
||
for pid, want := range map[int]int{2: 1, 3: 1, 4: 2} { | ||
have, err := tree.GetParent(pid) | ||
if err != nil || !reflect.DeepEqual(want, have) { | ||
t.Errorf("%d: want %#v, have %#v (%v)", pid, want, have, err) | ||
} | ||
} | ||
} |
Oops, something went wrong.