pub struct ProcessTree {
pub processes: Vec<Process>,
}Expand description
The processes of a run, in the order the tracer saw them start, each with its programs and their observations.
A process ID that the system gives to a new process within the run starts a new process, so two processes never merge. The kinds of each path, combined over every program, are exactly its kinds in the run’s combined accesses.
Fields§
§processes: Vec<Process>The processes, numbered from 1, in order.
Implementations§
Source§impl ProcessTree
impl ProcessTree
Sourcepub fn of_request(
request: &RunRequest,
accesses: &Accesses,
status: Option<Termination>,
) -> Self
pub fn of_request( request: &RunRequest, accesses: &Accesses, status: Option<Termination>, ) -> Self
The tree of one process, the command of request, without a process ID,
whose one program is the request’s program with its arguments, which
touched every path of accesses with its kinds, each with the outcome
ok, and which ended as status says. Fake tracers build their trees
with it.
Sourcepub fn of_run(request: &RunRequest, result: &RunResult) -> Self
pub fn of_run(request: &RunRequest, result: &RunResult) -> Self
The tree of one process, the command of request, built from the run’s
whole result, as ProcessTree::of_request builds it from the result’s
accesses and termination, with the result’s reason that the trace is
incomplete, when it has one, its unknown system calls and its connections
on the one program, where the Linux tracer puts them: on the program that
made them. So the tree carries everything that the run reports, and a report
built from it says what the run says. Fake tracers whose runs a test builds a
report from build their trees with it; the tree of a failed start, which
reports none of these, keeps the shape that of_request gives it.
Sourcepub fn process(&self, number: u32) -> Option<&Process>
pub fn process(&self, number: u32) -> Option<&Process>
The process numbered number, if there is one.
Sourcepub fn programs(&self) -> impl Iterator<Item = (&Process, &Program)>
pub fn programs(&self) -> impl Iterator<Item = (&Process, &Program)>
Every program of every process, with its process, in order.
Sourcepub fn observations(&self) -> Observations
pub fn observations(&self) -> Observations
The observations of every program, combined.
Sourcepub fn accesses(&self) -> Accesses
pub fn accesses(&self) -> Accesses
The access kinds of every path of every program, combined, without the outcomes.
Sourcepub fn connections(&self) -> BTreeSet<Connection>
pub fn connections(&self) -> BTreeSet<Connection>
The connections of every program, combined.
Sourcepub fn unknown_system_calls(&self) -> BTreeSet<u32>
pub fn unknown_system_calls(&self) -> BTreeSet<u32>
The unknown system calls of every program, combined.