1
Fork 0

Auto merge of #70156 - michaelwoerister:incr-cgus, r=nikomatsakis

Make the rustc respect the `-C codegen-units` flag in incremental mode.

This PR implements (the as of yet unapproved) major change proposal at https://github.com/rust-lang/compiler-team/issues/245. See the description there for background and rationale.

The changes are pretty straightforward and should be easy to rebase if the proposal gets accepted at some point.

r? @nikomatsakis cc @pnkfelix
This commit is contained in:
bors 2020-04-03 23:50:01 +00:00
commit 9e55101bb6
5 changed files with 122 additions and 28 deletions

View file

@ -257,9 +257,8 @@ them in parallel. Increasing parallelism may speed up compile times, but may
also produce slower code. Setting this to 1 may improve the performance of also produce slower code. Setting this to 1 may improve the performance of
generated code, but may be slower to compile. generated code, but may be slower to compile.
The default, if not specified, is 16. This flag is ignored if The default, if not specified, is 16 for non-incremental builds. For
[incremental](#incremental) is enabled, in which case an internal heuristic is incremental builds the default is 256 which allows caching to be more granular.
used to split the crate.
## remark ## remark

View file

@ -107,19 +107,11 @@ use rustc_middle::mir::mono::{InstantiationMode, MonoItem};
use rustc_middle::ty::print::characteristic_def_id_of_type; use rustc_middle::ty::print::characteristic_def_id_of_type;
use rustc_middle::ty::query::Providers; use rustc_middle::ty::query::Providers;
use rustc_middle::ty::{self, DefIdTree, InstanceDef, TyCtxt}; use rustc_middle::ty::{self, DefIdTree, InstanceDef, TyCtxt};
use rustc_span::symbol::Symbol; use rustc_span::symbol::{Symbol, SymbolStr};
use crate::monomorphize::collector::InliningMap; use crate::monomorphize::collector::InliningMap;
use crate::monomorphize::collector::{self, MonoItemCollectionMode}; use crate::monomorphize::collector::{self, MonoItemCollectionMode};
pub enum PartitioningStrategy {
/// Generates one codegen unit per source-level module.
PerModule,
/// Partition the whole crate into a fixed number of codegen units.
FixedUnitCount(usize),
}
// Anything we can't find a proper codegen unit for goes into this. // Anything we can't find a proper codegen unit for goes into this.
fn fallback_cgu_name(name_builder: &mut CodegenUnitNameBuilder<'_>) -> Symbol { fn fallback_cgu_name(name_builder: &mut CodegenUnitNameBuilder<'_>) -> Symbol {
name_builder.build_cgu_name(LOCAL_CRATE, &["fallback"], Some("cgu")) name_builder.build_cgu_name(LOCAL_CRATE, &["fallback"], Some("cgu"))
@ -128,7 +120,7 @@ fn fallback_cgu_name(name_builder: &mut CodegenUnitNameBuilder<'_>) -> Symbol {
pub fn partition<'tcx, I>( pub fn partition<'tcx, I>(
tcx: TyCtxt<'tcx>, tcx: TyCtxt<'tcx>,
mono_items: I, mono_items: I,
strategy: PartitioningStrategy, max_cgu_count: usize,
inlining_map: &InliningMap<'tcx>, inlining_map: &InliningMap<'tcx>,
) -> Vec<CodegenUnit<'tcx>> ) -> Vec<CodegenUnit<'tcx>>
where where
@ -148,11 +140,10 @@ where
debug_dump(tcx, "INITIAL PARTITIONING:", initial_partitioning.codegen_units.iter()); debug_dump(tcx, "INITIAL PARTITIONING:", initial_partitioning.codegen_units.iter());
// If the partitioning should produce a fixed count of codegen units, merge // Merge until we have at most `max_cgu_count` codegen units.
// until that count is reached. {
if let PartitioningStrategy::FixedUnitCount(count) = strategy {
let _prof_timer = tcx.prof.generic_activity("cgu_partitioning_merge_cgus"); let _prof_timer = tcx.prof.generic_activity("cgu_partitioning_merge_cgus");
merge_codegen_units(tcx, &mut initial_partitioning, count); merge_codegen_units(tcx, &mut initial_partitioning, max_cgu_count);
debug_dump(tcx, "POST MERGING:", initial_partitioning.codegen_units.iter()); debug_dump(tcx, "POST MERGING:", initial_partitioning.codegen_units.iter());
} }
@ -480,6 +471,10 @@ fn merge_codegen_units<'tcx>(
// the stable sort below will keep everything nice and deterministic. // the stable sort below will keep everything nice and deterministic.
codegen_units.sort_by_cached_key(|cgu| cgu.name().as_str()); codegen_units.sort_by_cached_key(|cgu| cgu.name().as_str());
// This map keeps track of what got merged into what.
let mut cgu_contents: FxHashMap<Symbol, Vec<SymbolStr>> =
codegen_units.iter().map(|cgu| (cgu.name(), vec![cgu.name().as_str()])).collect();
// Merge the two smallest codegen units until the target size is reached. // Merge the two smallest codegen units until the target size is reached.
while codegen_units.len() > target_cgu_count { while codegen_units.len() > target_cgu_count {
// Sort small cgus to the back // Sort small cgus to the back
@ -487,21 +482,68 @@ fn merge_codegen_units<'tcx>(
let mut smallest = codegen_units.pop().unwrap(); let mut smallest = codegen_units.pop().unwrap();
let second_smallest = codegen_units.last_mut().unwrap(); let second_smallest = codegen_units.last_mut().unwrap();
// Move the mono-items from `smallest` to `second_smallest`
second_smallest.modify_size_estimate(smallest.size_estimate()); second_smallest.modify_size_estimate(smallest.size_estimate());
for (k, v) in smallest.items_mut().drain() { for (k, v) in smallest.items_mut().drain() {
second_smallest.items_mut().insert(k, v); second_smallest.items_mut().insert(k, v);
} }
// Record that `second_smallest` now contains all the stuff that was in
// `smallest` before.
let mut consumed_cgu_names = cgu_contents.remove(&smallest.name()).unwrap();
cgu_contents.get_mut(&second_smallest.name()).unwrap().extend(consumed_cgu_names.drain(..));
debug!( debug!(
"CodegenUnit {} merged in to CodegenUnit {}", "CodegenUnit {} merged into CodegenUnit {}",
smallest.name(), smallest.name(),
second_smallest.name() second_smallest.name()
); );
} }
let cgu_name_builder = &mut CodegenUnitNameBuilder::new(tcx); let cgu_name_builder = &mut CodegenUnitNameBuilder::new(tcx);
if tcx.sess.opts.incremental.is_some() {
// If we are doing incremental compilation, we want CGU names to
// reflect the path of the source level module they correspond to.
// For CGUs that contain the code of multiple modules because of the
// merging done above, we use a concatenation of the names of
// all contained CGUs.
let new_cgu_names: FxHashMap<Symbol, String> = cgu_contents
.into_iter()
// This `filter` makes sure we only update the name of CGUs that
// were actually modified by merging.
.filter(|(_, cgu_contents)| cgu_contents.len() > 1)
.map(|(current_cgu_name, cgu_contents)| {
let mut cgu_contents: Vec<&str> = cgu_contents.iter().map(|s| &s[..]).collect();
// Sort the names, so things are deterministic and easy to
// predict.
cgu_contents.sort();
(current_cgu_name, cgu_contents.join("--"))
})
.collect();
for cgu in codegen_units.iter_mut() {
if let Some(new_cgu_name) = new_cgu_names.get(&cgu.name()) {
if tcx.sess.opts.debugging_opts.human_readable_cgu_names {
cgu.set_name(Symbol::intern(&new_cgu_name));
} else {
// If we don't require CGU names to be human-readable, we
// use a fixed length hash of the composite CGU name
// instead.
let new_cgu_name = CodegenUnit::mangle_name(&new_cgu_name);
cgu.set_name(Symbol::intern(&new_cgu_name));
}
}
}
} else {
// If we are compiling non-incrementally we just generate simple CGU
// names containing an index.
for (index, cgu) in codegen_units.iter_mut().enumerate() { for (index, cgu) in codegen_units.iter_mut().enumerate() {
cgu.set_name(numbered_codegen_unit_name(cgu_name_builder, index)); cgu.set_name(numbered_codegen_unit_name(cgu_name_builder, index));
} }
}
} }
fn place_inlined_mono_items<'tcx>( fn place_inlined_mono_items<'tcx>(
@ -879,13 +921,7 @@ fn collect_and_partition_mono_items(
let (codegen_units, _) = tcx.sess.time("partition_and_assert_distinct_symbols", || { let (codegen_units, _) = tcx.sess.time("partition_and_assert_distinct_symbols", || {
sync::join( sync::join(
|| { || {
let strategy = if tcx.sess.opts.incremental.is_some() { partition(tcx, items.iter().cloned(), tcx.sess.codegen_units(), &inlining_map)
PartitioningStrategy::PerModule
} else {
PartitioningStrategy::FixedUnitCount(tcx.sess.codegen_units())
};
partition(tcx, items.iter().cloned(), strategy, &inlining_map)
.into_iter() .into_iter()
.map(Arc::new) .map(Arc::new)
.collect::<Vec<_>>() .collect::<Vec<_>>()

View file

@ -767,6 +767,13 @@ impl Session {
return n as usize; return n as usize;
} }
// If incremental compilation is turned on, we default to a high number
// codegen units in order to reduce the "collateral damage" small
// changes cause.
if self.opts.incremental.is_some() {
return 256;
}
// Why is 16 codegen units the default all the time? // Why is 16 codegen units the default all the time?
// //
// The main reason for enabling multiple codegen units by default is to // The main reason for enabling multiple codegen units by default is to

View file

@ -0,0 +1,42 @@
// ignore-tidy-linelength
// We specify -C incremental here because we want to test the partitioning for
// incremental compilation
// compile-flags:-Zprint-mono-items=lazy -Cincremental=tmp/partitioning-tests/incremental-merging
// compile-flags:-Ccodegen-units=3
#![crate_type = "rlib"]
// This test makes sure that merging of CGUs works together with incremental
// compilation but at the same time does not modify names of CGUs that were not
// affected by merging.
//
// We expect CGUs `aaa` and `bbb` to be merged (because they are the smallest),
// while `ccc` and `ddd` are supposed to stay untouched.
pub mod aaa {
//~ MONO_ITEM fn incremental_merging::aaa[0]::foo[0] @@ incremental_merging-aaa--incremental_merging-bbb[External]
pub fn foo(a: u64) -> u64 {
a + 1
}
}
pub mod bbb {
//~ MONO_ITEM fn incremental_merging::bbb[0]::foo[0] @@ incremental_merging-aaa--incremental_merging-bbb[External]
pub fn foo(a: u64, b: u64) -> u64 {
a + b + 1
}
}
pub mod ccc {
//~ MONO_ITEM fn incremental_merging::ccc[0]::foo[0] @@ incremental_merging-ccc[External]
pub fn foo(a: u64, b: u64, c: u64) -> u64 {
a + b + c + 1
}
}
pub mod ddd {
//~ MONO_ITEM fn incremental_merging::ddd[0]::foo[0] @@ incremental_merging-ddd[External]
pub fn foo(a: u64, b: u64, c: u64, d: u64) -> u64 {
a + b + c + d + 1
}
}

View file

@ -2513,7 +2513,7 @@ impl<'test> TestCx<'test> {
.filter(|s| !s.is_empty()) .filter(|s| !s.is_empty())
.map(|s| { .map(|s| {
if cgu_has_crate_disambiguator { if cgu_has_crate_disambiguator {
remove_crate_disambiguator_from_cgu(s) remove_crate_disambiguators_from_set_of_cgu_names(s)
} else { } else {
s.to_string() s.to_string()
} }
@ -2563,6 +2563,16 @@ impl<'test> TestCx<'test> {
new_name new_name
} }
// The name of merged CGUs is constructed as the names of the original
// CGUs joined with "--". This function splits such composite CGU names
// and handles each component individually.
fn remove_crate_disambiguators_from_set_of_cgu_names(cgus: &str) -> String {
cgus.split("--")
.map(|cgu| remove_crate_disambiguator_from_cgu(cgu))
.collect::<Vec<_>>()
.join("--")
}
} }
fn init_incremental_test(&self) { fn init_incremental_test(&self) {