#[non_exhaustive]pub struct BuildInput {
pub graph: BuildGraph,
pub build: BuildMeta,
pub matched_by: Vec<MatchMethod>,
pub unblocked: Vec<UnblockedPair>,
pub diagnostics: Vec<Diagnostic>,
}Expand description
One build, ready to analyse.
Fields (Non-exhaustive)§
This struct is marked as non-exhaustive
Struct { .. } syntax; cannot be matched against without a wildcard ..; and struct update syntax will not work.graph: BuildGraphThe graph the two inputs agreed on.
build: BuildMetaWhere its numbers came from.
matched_by: Vec<MatchMethod>How each unit’s two halves were recognised as the same unit, by unit identifier. A build whose entries are all exact was identified rather than deduced.
unblocked: Vec<UnblockedPair>The pairs the timing report claims are dependencies, for check_unblocked.
diagnostics: Vec<Diagnostic>Anything worth telling the reader that did not stop the analysis.
Implementations§
Source§impl BuildInput
impl BuildInput
Sourcepub fn check_unblocked(&self) -> UnblockedCheck
pub fn check_unblocked(&self) -> UnblockedCheck
Checks the timing report’s unblocked_* fields against the graph the verbose log gave.
The fields are not the dependency graph — they record only the unit that happened to be each unit’s last blocker, which covered 51% of the real edges on a measured 28-unit build — but every pair in them must still be a dependency. That makes them an independent check on the matcher and the edge rules, from data the parser did not use to build the graph.
A pair is confirmed when the graph has the edge, or when the consumer requires its whole closure and the producer is somewhere in it. The second case is not a concession: Cargo’s own job queue materialises exactly those closure edges for a unit that needs upstream object files, and this model expresses them as a property of the consumer instead.