guppy/graph/feature/build.rs
1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 59 60 61 62 63 64 65 66 67 68 69 70 71 72 73 74 75 76 77 78 79 80 81 82 83 84 85 86 87 88 89 90 91 92 93 94 95 96 97 98 99 100 101 102 103 104 105 106 107 108 109 110 111 112 113 114 115 116 117 118 119 120 121 122 123 124 125 126 127 128 129 130 131 132 133 134 135 136 137 138 139 140 141 142 143 144 145 146 147 148 149 150 151 152 153 154 155 156 157 158 159 160 161 162 163 164 165 166 167 168 169 170 171 172 173 174 175 176 177 178 179 180 181 182 183 184 185 186 187 188 189 190 191 192 193 194 195 196 197 198 199 200 201 202 203 204 205 206 207 208 209 210 211 212 213 214 215 216 217 218 219 220 221 222 223 224 225 226 227 228 229 230 231 232 233 234 235 236 237 238 239 240 241 242 243 244 245 246 247 248 249 250 251 252 253 254 255 256 257 258 259 260 261 262 263 264 265 266 267 268 269 270 271 272 273 274 275 276 277 278 279 280 281 282 283 284 285 286 287 288 289 290 291 292 293 294 295 296 297 298 299 300 301 302 303 304 305 306 307 308 309 310 311 312 313 314 315 316 317 318 319 320 321 322 323 324 325 326 327 328 329 330 331 332 333 334 335 336 337 338 339 340 341 342 343 344 345 346 347 348 349 350 351 352 353 354 355 356 357 358 359 360 361 362 363 364 365 366 367 368 369 370 371 372 373 374 375 376 377 378 379 380 381 382 383 384 385 386 387 388 389 390 391 392 393 394 395 396 397 398 399 400 401 402 403 404 405 406 407 408 409 410 411 412 413 414 415 416 417 418 419 420 421 422 423 424 425 426 427 428 429 430 431 432 433 434 435 436 437 438 439 440 441 442 443 444 445 446 447 448 449 450 451 452 453 454 455 456 457 458 459 460 461 462 463 464 465 466 467 468 469 470 471 472 473 474 475 476 477 478 479 480 481 482 483 484 485 486 487 488 489 490 491 492 493 494 495 496 497 498 499 500 501 502 503 504 505 506 507 508 509 510 511 512 513 514 515 516 517 518 519 520 521 522 523 524 525 526 527 528 529 530 531 532 533 534 535 536 537 538 539 540 541 542 543 544 545 546 547 548 549 550 551 552 553 554 555 556 557 558 559 560 561 562 563 564 565 566 567 568 569 570 571 572 573 574 575 576 577 578 579 580 581 582 583 584 585 586 587 588 589 590 591 592 593 594 595 596 597 598 599 600 601 602 603 604 605 606 607 608 609 610 611 612 613 614 615 616 617 618 619 620 621 622 623 624 625 626 627 628 629 630 631 632 633 634 635 636
// Copyright (c) The cargo-guppy Contributors
// SPDX-License-Identifier: MIT OR Apache-2.0
use crate::{
errors::{FeatureBuildStage, FeatureGraphWarning},
graph::{
feature::{
ConditionalLinkImpl, FeatureEdge, FeatureGraphImpl, FeatureLabel, FeatureMetadataImpl,
FeatureNode, WeakDependencies, WeakIndex,
},
DepRequiredOrOptional, DependencyReq, FeatureIndexInPackage, FeatureIx, NamedFeatureDep,
PackageGraph, PackageIx, PackageLink, PackageMetadata,
},
platform::PlatformStatusImpl,
};
use ahash::AHashMap;
use cargo_metadata::DependencyKind;
use once_cell::sync::OnceCell;
use petgraph::{prelude::*, visit::IntoEdgeReferences};
use smallvec::SmallVec;
use std::iter;
pub(super) type FeaturePetgraph = Graph<FeatureNode, FeatureEdge, Directed, FeatureIx>;
pub(super) type FeatureEdgeReference<'g> = <&'g FeaturePetgraph as IntoEdgeReferences>::EdgeRef;
#[derive(Debug)]
pub(super) struct FeatureGraphBuildState {
graph: FeaturePetgraph,
// Map from package ixs to the base (first) feature for each package.
base_ixs: Vec<NodeIndex<FeatureIx>>,
map: AHashMap<FeatureNode, FeatureMetadataImpl>,
weak: WeakDependencies,
warnings: Vec<FeatureGraphWarning>,
}
impl FeatureGraphBuildState {
pub(super) fn new(package_graph: &PackageGraph) -> Self {
let package_count = package_graph.package_count();
Self {
// Each package corresponds to at least one feature ID.
graph: Graph::with_capacity(package_count, package_count),
// Each package corresponds to exactly one base feature ix, and there's one last ix at
// the end.
base_ixs: Vec::with_capacity(package_count + 1),
map: AHashMap::with_capacity(package_count),
weak: WeakDependencies::new(),
warnings: vec![],
}
}
/// Add nodes for every feature in this package + the base package, and add edges from every
/// feature to the base package.
pub(super) fn add_nodes(&mut self, package: PackageMetadata<'_>) {
let base_node = FeatureNode::base(package.package_ix());
let base_ix = self.add_node(base_node);
self.base_ixs.push(base_ix);
FeatureNode::named_features(package)
.chain(FeatureNode::optional_deps(package))
.for_each(|feature_node| {
let feature_ix = self.add_node(feature_node);
self.graph
.update_edge(feature_ix, base_ix, FeatureEdge::FeatureToBase);
});
}
/// Mark the end of adding nodes.
pub(super) fn end_nodes(&mut self) {
self.base_ixs.push(NodeIndex::new(self.graph.node_count()));
}
pub(super) fn add_named_feature_edges(&mut self, metadata: PackageMetadata<'_>) {
let dep_name_to_link: AHashMap<_, _> = metadata
.direct_links()
.map(|link| (link.dep_name(), link))
.collect();
metadata
.named_features_full()
.for_each(|(n, from_feature, feature_deps)| {
let from_node = FeatureNode::new(metadata.package_ix(), n);
let to_nodes_edges: Vec<_> = feature_deps
.iter()
.flat_map(|feature_dep| {
self.nodes_for_named_feature_dep(
metadata,
from_feature,
feature_dep,
&dep_name_to_link,
)
})
// The flat_map above holds an &mut reference to self, which is why it needs to
// be collected.
.collect();
// Don't create a map to the base 'from' node since it is already created in
// add_nodes.
self.add_edges(from_node, to_nodes_edges, metadata.graph());
})
}
fn nodes_for_named_feature_dep(
&mut self,
metadata: PackageMetadata<'_>,
from_named_feature: &str,
feature_dep: &NamedFeatureDep,
dep_name_to_link: &AHashMap<&str, PackageLink>,
) -> SmallVec<[(FeatureNode, FeatureEdge); 3]> {
let from_label = FeatureLabel::Named(from_named_feature);
let mut nodes_edges: SmallVec<[(FeatureNode, FeatureEdge); 3]> = SmallVec::new();
match feature_dep {
NamedFeatureDep::DependencyNamedFeature {
dep_name,
feature,
weak,
} => {
if let Some(link) = dep_name_to_link.get(dep_name.as_ref()) {
let weak_index = weak.then(|| self.weak.insert(link.edge_ix()));
// Dependency from (`main`, `a`) to (`dep, `foo`)
if let Some(cross_node) = self.make_named_feature_node(
&metadata,
from_label,
&link.to(),
FeatureLabel::Named(feature.as_ref()),
true,
) {
// This is a cross-package link. The platform-specific
// requirements still apply, so grab them from the
// PackageLink.
nodes_edges.push((
cross_node,
Self::make_named_feature_cross_edge(link, weak_index),
));
};
// If the package is present as an optional dependency, it is
// implicitly activated by the feature:
// from (`main`, `a`) to (`main`, `dep:dep`)
if let Some(same_node) = self.make_named_feature_node(
&metadata,
from_label,
&metadata,
FeatureLabel::OptionalDependency(dep_name),
// Don't warn if this dep isn't optional.
false,
) {
nodes_edges.push((
same_node,
Self::make_named_feature_cross_edge(link, weak_index),
));
}
// Finally, (`main`, `a`) to (`main`, `dep`) -- if this is a non-weak dependency
// and a named feature by this name is present, it also gets activated (even if
// the named feature has no relation to the optional dependency).
//
// For example:
//
// server = ["hyper/server"]
//
// will also activate the named feature `hyper`.
//
// One thing to be careful of here is that we don't want to insert self-edges.
// For example:
//
// tokio = ["dep:tokio", "tokio/net"]
//
// should not insert a self-edge from `tokio` to `tokio`. The second condition
// checks this.
if !*weak && &**dep_name != from_named_feature {
if let Some(same_named_feature_node) = self.make_named_feature_node(
&metadata,
from_label,
&metadata,
FeatureLabel::Named(dep_name),
// Don't warn if this dep isn't optional.
false,
) {
nodes_edges.push((
same_named_feature_node,
Self::make_named_feature_cross_edge(link, None),
));
}
}
}
}
NamedFeatureDep::NamedFeature(feature_name) => {
if let Some(same_node) = self.make_named_feature_node(
&metadata,
from_label,
&metadata,
FeatureLabel::Named(feature_name.as_ref()),
true,
) {
nodes_edges.push((same_node, FeatureEdge::NamedFeature));
}
}
NamedFeatureDep::OptionalDependency(dep_name) => {
if let Some(same_node) = self.make_named_feature_node(
&metadata,
from_label,
&metadata,
FeatureLabel::OptionalDependency(dep_name.as_ref()),
true,
) {
if let Some(link) = dep_name_to_link.get(dep_name.as_ref()) {
nodes_edges.push((
same_node,
FeatureEdge::NamedFeatureDepColon(
Self::make_full_conditional_link_impl(link),
),
));
}
}
}
};
nodes_edges
}
fn make_named_feature_node(
&mut self,
from_package: &PackageMetadata<'_>,
from_label: FeatureLabel<'_>,
to_package: &PackageMetadata<'_>,
to_label: FeatureLabel<'_>,
warn: bool,
) -> Option<FeatureNode> {
match to_package.get_feature_idx(to_label) {
Some(idx) => Some(FeatureNode::new(to_package.package_ix(), idx)),
None => {
// It is possible to specify a feature that doesn't actually exist, and cargo will
// accept that if the feature isn't resolved. One example is the cfg-if crate, where
// version 0.1.9 has the `rustc-dep-of-std` feature commented out, and several
// crates try to enable that feature:
// https://github.com/alexcrichton/cfg-if/issues/22
//
// Since these aren't fatal errors, it seems like the best we can do is to store
// such issues as warnings.
if warn {
self.warnings.push(FeatureGraphWarning::MissingFeature {
stage: FeatureBuildStage::AddNamedFeatureEdges {
package_id: from_package.id().clone(),
from_feature: from_label.to_string(),
},
package_id: to_package.id().clone(),
feature_name: to_label.to_string(),
});
}
None
}
}
}
/// Creates the cross link for situations like:
///
/// ```toml
/// [features]
/// a = ["dep/foo"]
/// ```
///
/// (a link (`from`, `a`) to (`dep`, `foo`) is created.
///
/// If `dep` is optional, the edge (`from`, `a`) to (`from`, `dep`) is also a
/// `NamedFeatureWithSlash` edge.
fn make_named_feature_cross_edge(
link: &PackageLink<'_>,
weak_index: Option<WeakIndex>,
) -> FeatureEdge {
// This edge is enabled if the feature is enabled, which means the union of (required,
// optional) build conditions.
FeatureEdge::NamedFeatureWithSlash {
link: Self::make_full_conditional_link_impl(link),
weak_index,
}
}
// Creates a "full" conditional link, unifying requirements across all dependency lines.
// This should not be used in add_dependency_edges below!
fn make_full_conditional_link_impl(link: &PackageLink<'_>) -> ConditionalLinkImpl {
// This edge is enabled if the feature is enabled, which means the union of (required,
// optional) build conditions.
fn combine_req_opt(req: DependencyReq<'_>) -> PlatformStatusImpl {
let mut required = req.inner.required.build_if.clone();
required.extend(&req.inner.optional.build_if);
required
}
ConditionalLinkImpl {
package_edge_ix: link.edge_ix(),
normal: combine_req_opt(link.normal()),
build: combine_req_opt(link.build()),
dev: combine_req_opt(link.dev()),
}
}
pub(super) fn add_dependency_edges(&mut self, link: PackageLink<'_>) {
let from = link.from();
// Sometimes the same package is depended on separately in different sections like so:
//
// bar/Cargo.toml:
//
// [dependencies]
// foo = { version = "1", features = ["a"] }
//
// [build-dependencies]
// foo = { version = "1", features = ["b"] }
//
// Now if you have a crate 'baz' with:
//
// [dependencies]
// bar = { path = "../bar" }
//
// ... what features would you expect foo to be built with? You might expect it to just
// be built with "a", but as it turns out Cargo actually *unifies* the features, such
// that foo is built with both "a" and "b".
//
// Also, feature unification is impacted by whether the dependency is optional.
//
// [dependencies]
// foo = { version = "1", features = ["a"] }
//
// [build-dependencies]
// foo = { version = "1", optional = true, features = ["b"] }
//
// This will include 'foo' as a normal dependency but *not* as a build dependency by
// default.
// * Without '--features foo', the `foo` dependency will be built with "a".
// * With '--features foo', `foo` will be both a normal and a build dependency, with
// features "a" and "b" in both instances.
//
// This means that up to two separate edges have to be represented:
// * a 'required edge', which will be from the base node for 'from' to the feature nodes
// for each required feature in 'to'.
// * an 'optional edge', which will be from the feature node (from, dep_name) to the
// feature nodes for each optional feature in 'to'. This edge is only added if at least
// one line is optional.
let unified_metadata = iter::once((DependencyKind::Normal, link.normal()))
.chain(iter::once((DependencyKind::Build, link.build())))
.chain(iter::once((DependencyKind::Development, link.dev())));
let mut required_req = FeatureReq::new(link);
let mut optional_req = FeatureReq::new(link);
for (kind, dependency_req) in unified_metadata {
required_req.add_features(kind, &dependency_req.inner.required, &mut self.warnings);
optional_req.add_features(kind, &dependency_req.inner.optional, &mut self.warnings);
}
// Add the required edges (base -> features).
self.add_edges(
FeatureNode::base(from.package_ix()),
required_req.finish(),
link.from().graph(),
);
if !optional_req.is_empty() {
// This means that there is at least one instance of this dependency with optional =
// true. The dep name should have been added as an optional dependency node to the
// package metadata.
let from_node = FeatureNode::new(
from.package_ix(),
from.get_feature_idx(FeatureLabel::OptionalDependency(link.dep_name()))
.unwrap_or_else(|| {
panic!(
"while adding feature edges, for package '{}', optional dep '{}' missing",
from.id(),
link.dep_name(),
);
}),
);
self.add_edges(from_node, optional_req.finish(), link.from().graph());
}
}
fn add_node(&mut self, feature_id: FeatureNode) -> NodeIndex<FeatureIx> {
let feature_ix = self.graph.add_node(feature_id);
self.map
.insert(feature_id, FeatureMetadataImpl { feature_ix });
feature_ix
}
fn add_edges(
&mut self,
from_node: FeatureNode,
to_nodes_edges: impl IntoIterator<Item = (FeatureNode, FeatureEdge)>,
graph: &PackageGraph,
) {
// The from node should always be present because it is a known node.
let from_ix = self.lookup_node(&from_node).unwrap_or_else(|| {
panic!(
"while adding feature edges, missing 'from': {:?}",
from_node
);
});
let to_nodes_edges = to_nodes_edges.into_iter().collect::<Vec<_>>();
to_nodes_edges.into_iter().for_each(|(to_node, edge)| {
let to_ix = self.lookup_node(&to_node).unwrap_or_else(|| {
panic!("while adding feature edges, missing 'to': {:?}", to_node)
});
if from_ix == to_ix {
let (package_id, feature_label) = from_node.package_id_and_feature_label(graph);
self.warnings.push(FeatureGraphWarning::SelfLoop {
package_id: package_id.clone(),
feature_name: feature_label.to_string(),
});
}
match self.graph.find_edge(from_ix, to_ix) {
Some(edge_ix) => {
// The edge already exists. This could be an upgrade from a cross link to a
// feature dependency, for example:
//
// [package]
// name = "main"
//
// [dependencies]
// dep = { ..., optional = true }
//
// [features]
// "feat" = ["dep/feat", "dep"]
//
// "dep/feat" causes a cross link to be created from "main/feat" to "main/dep".
// However, the "dep" encountered later upgrades this link to a feature
// dependency.
//
// This could also be an upgrade from a weak to a non-weak dependency:
//
// [features]
// feat = ["dep?/feat", "dep/feat2"]
let old_edge = self
.graph
.edge_weight_mut(edge_ix)
.expect("this edge was just found");
#[allow(clippy::single_match)]
match (old_edge, edge) {
(
FeatureEdge::NamedFeatureWithSlash {
weak_index: old_weak_index,
..
},
FeatureEdge::NamedFeatureWithSlash { weak_index, .. },
) => {
if old_weak_index.is_some() && weak_index.is_some() {
debug_assert_eq!(
*old_weak_index, weak_index,
"weak indexes should match if some"
);
}
// Upgrade this edge from weak to non-weak.
if weak_index.is_none() {
*old_weak_index = None;
}
}
(
old_edge @ FeatureEdge::NamedFeatureWithSlash { .. },
edge @ FeatureEdge::NamedFeature
| edge @ FeatureEdge::NamedFeatureDepColon(_),
) => {
// Upgrade this edge from / conditional to dep: conditional or unconditional.
*old_edge = edge;
}
(
old_edge @ FeatureEdge::NamedFeatureDepColon(_),
edge @ FeatureEdge::NamedFeature,
) => {
// Upgrade this edge from dep: conditional to unconditional.
// XXX: can this ever happen?
*old_edge = edge;
}
_ => {
// In all other cases, leave the old edge alone.
}
}
}
None => {
self.graph.add_edge(from_ix, to_ix, edge);
}
}
})
}
fn lookup_node(&self, node: &FeatureNode) -> Option<NodeIndex<FeatureIx>> {
self.map.get(node).map(|metadata| metadata.feature_ix)
}
pub(super) fn build(self) -> FeatureGraphImpl {
FeatureGraphImpl {
graph: self.graph,
base_ixs: self.base_ixs,
map: self.map,
warnings: self.warnings,
sccs: OnceCell::new(),
weak: self.weak,
}
}
}
#[derive(Debug)]
struct FeatureReq<'g> {
link: PackageLink<'g>,
to: PackageMetadata<'g>,
edge_ix: EdgeIndex<PackageIx>,
to_default_idx: FeatureIndexInPackage,
// This will contain any build states that aren't empty.
features: AHashMap<FeatureIndexInPackage, DependencyBuildState>,
}
impl<'g> FeatureReq<'g> {
fn new(link: PackageLink<'g>) -> Self {
let to = link.to();
Self {
link,
to,
edge_ix: link.edge_ix(),
to_default_idx: to
.get_feature_idx(FeatureLabel::Named("default"))
.unwrap_or(FeatureIndexInPackage::Base),
features: AHashMap::new(),
}
}
fn is_empty(&self) -> bool {
// self.features only consists of non-empty build states.
self.features.is_empty()
}
fn add_features(
&mut self,
dep_kind: DependencyKind,
req: &DepRequiredOrOptional,
warnings: &mut Vec<FeatureGraphWarning>,
) {
// Base feature.
self.extend(FeatureIndexInPackage::Base, dep_kind, &req.build_if);
// Default feature (or base if it isn't present).
self.extend(self.to_default_idx, dep_kind, &req.default_features_if);
for (feature, status) in &req.feature_targets {
match self.to.get_feature_idx(FeatureLabel::Named(feature)) {
Some(feature_idx) => {
self.extend(feature_idx, dep_kind, status);
}
None => {
// The destination feature is missing -- this is accepted by cargo
// in some circumstances, so use a warning rather than an error.
warnings.push(FeatureGraphWarning::MissingFeature {
stage: FeatureBuildStage::AddDependencyEdges {
package_id: self.link.from().id().clone(),
dep_name: self.link.dep_name().to_string(),
},
package_id: self.to.id().clone(),
feature_name: feature.to_string(),
});
}
}
}
}
fn extend(
&mut self,
feature_idx: FeatureIndexInPackage,
dep_kind: DependencyKind,
status: &PlatformStatusImpl,
) {
let package_edge_ix = self.edge_ix;
if !status.is_never() {
self.features
.entry(feature_idx)
.or_insert_with(|| DependencyBuildState::new(package_edge_ix))
.extend(dep_kind, status);
}
}
fn finish(self) -> impl Iterator<Item = (FeatureNode, FeatureEdge)> {
let package_ix = self.to.package_ix();
self.features
.into_iter()
.map(move |(feature_idx, build_state)| {
// extend ensures that the build states aren't empty. Double-check that.
debug_assert!(!build_state.is_empty(), "build states are always non-empty");
(
FeatureNode::new(package_ix, feature_idx),
build_state.finish(),
)
})
}
}
#[derive(Debug)]
struct DependencyBuildState {
package_edge_ix: EdgeIndex<PackageIx>,
normal: PlatformStatusImpl,
build: PlatformStatusImpl,
dev: PlatformStatusImpl,
}
impl DependencyBuildState {
fn new(package_edge_ix: EdgeIndex<PackageIx>) -> Self {
Self {
package_edge_ix,
normal: PlatformStatusImpl::default(),
build: PlatformStatusImpl::default(),
dev: PlatformStatusImpl::default(),
}
}
fn extend(&mut self, dep_kind: DependencyKind, status: &PlatformStatusImpl) {
match dep_kind {
DependencyKind::Normal => self.normal.extend(status),
DependencyKind::Build => self.build.extend(status),
DependencyKind::Development => self.dev.extend(status),
_ => panic!("unknown dependency kind"),
}
}
fn is_empty(&self) -> bool {
self.normal.is_never() && self.build.is_never() && self.dev.is_never()
}
fn finish(self) -> FeatureEdge {
FeatureEdge::DependenciesSection(ConditionalLinkImpl {
package_edge_ix: self.package_edge_ix,
normal: self.normal,
build: self.build,
dev: self.dev,
})
}
}