1 // Copyright 2016 The Rust Project Developers. See the COPYRIGHT
2 // file at the top-level directory of this distribution and at
3 // http://rust-lang.org/COPYRIGHT.
5 // Licensed under the Apache License, Version 2.0 <LICENSE-APACHE or
6 // http://www.apache.org/licenses/LICENSE-2.0> or the MIT license
7 // <LICENSE-MIT or http://opensource.org/licenses/MIT>, at your
8 // option. This file may not be copied, modified, or distributed
9 // except according to those terms.
11 //! Partitioning Codegen Units for Incremental Compilation
12 //! ======================================================
14 //! The task of this module is to take the complete set of translation items of
15 //! a crate and produce a set of codegen units from it, where a codegen unit
16 //! is a named set of (translation-item, linkage) pairs. That is, this module
17 //! decides which translation item appears in which codegen units with which
18 //! linkage. The following paragraphs describe some of the background on the
19 //! partitioning scheme.
21 //! The most important opportunity for saving on compilation time with
22 //! incremental compilation is to avoid re-translating and re-optimizing code.
23 //! Since the unit of translation and optimization for LLVM is "modules" or, how
24 //! we call them "codegen units", the particulars of how much time can be saved
25 //! by incremental compilation are tightly linked to how the output program is
26 //! partitioned into these codegen units prior to passing it to LLVM --
27 //! especially because we have to treat codegen units as opaque entities once
28 //! they are created: There is no way for us to incrementally update an existing
29 //! LLVM module and so we have to build any such module from scratch if it was
30 //! affected by some change in the source code.
32 //! From that point of view it would make sense to maximize the number of
33 //! codegen units by, for example, putting each function into its own module.
34 //! That way only those modules would have to be re-compiled that were actually
35 //! affected by some change, minimizing the number of functions that could have
36 //! been re-used but just happened to be located in a module that is
39 //! However, since LLVM optimization does not work across module boundaries,
40 //! using such a highly granular partitioning would lead to very slow runtime
41 //! code since it would effectively prohibit inlining and other inter-procedure
42 //! optimizations. We want to avoid that as much as possible.
44 //! Thus we end up with a trade-off: The bigger the codegen units, the better
45 //! LLVM's optimizer can do its work, but also the smaller the compilation time
46 //! reduction we get from incremental compilation.
48 //! Ideally, we would create a partitioning such that there are few big codegen
49 //! units with few interdependencies between them. For now though, we use the
50 //! following heuristic to determine the partitioning:
52 //! - There are two codegen units for every source-level module:
53 //! - One for "stable", that is non-generic, code
54 //! - One for more "volatile" code, i.e. monomorphized instances of functions
55 //! defined in that module
57 //! In order to see why this heuristic makes sense, let's take a look at when a
58 //! codegen unit can get invalidated:
60 //! 1. The most straightforward case is when the BODY of a function or global
61 //! changes. Then any codegen unit containing the code for that item has to be
62 //! re-compiled. Note that this includes all codegen units where the function
65 //! 2. The next case is when the SIGNATURE of a function or global changes. In
66 //! this case, all codegen units containing a REFERENCE to that item have to be
67 //! re-compiled. This is a superset of case 1.
69 //! 3. The final and most subtle case is when a REFERENCE to a generic function
70 //! is added or removed somewhere. Even though the definition of the function
71 //! might be unchanged, a new REFERENCE might introduce a new monomorphized
72 //! instance of this function which has to be placed and compiled somewhere.
73 //! Conversely, when removing a REFERENCE, it might have been the last one with
74 //! that particular set of generic arguments and thus we have to remove it.
76 //! From the above we see that just using one codegen unit per source-level
77 //! module is not such a good idea, since just adding a REFERENCE to some
78 //! generic item somewhere else would invalidate everything within the module
79 //! containing the generic item. The heuristic above reduces this detrimental
80 //! side-effect of references a little by at least not touching the non-generic
81 //! code of the module.
83 //! A Note on Inlining
84 //! ------------------
85 //! As briefly mentioned above, in order for LLVM to be able to inline a
86 //! function call, the body of the function has to be available in the LLVM
87 //! module where the call is made. This has a few consequences for partitioning:
89 //! - The partitioning algorithm has to take care of placing functions into all
90 //! codegen units where they should be available for inlining. It also has to
91 //! decide on the correct linkage for these functions.
93 //! - The partitioning algorithm has to know which functions are likely to get
94 //! inlined, so it can distribute function instantiations accordingly. Since
95 //! there is no way of knowing for sure which functions LLVM will decide to
96 //! inline in the end, we apply a heuristic here: Only functions marked with
97 //! #[inline] are considered for inlining by the partitioner. The current
98 //! implementation will not try to determine if a function is likely to be
99 //! inlined by looking at the functions definition.
101 //! Note though that as a side-effect of creating a codegen units per
102 //! source-level module, functions from the same module will be available for
103 //! inlining, even when they are not marked #[inline].
105 use collector::InliningMap;
107 use context::SharedCrateContext;
109 use rustc::dep_graph::{DepNode, WorkProductId};
110 use rustc::hir::def_id::DefId;
111 use rustc::hir::map::DefPathData;
112 use rustc::session::config::NUMBERED_CODEGEN_UNIT_MARKER;
113 use rustc::ty::{self, TyCtxt};
114 use rustc::ty::item_path::characteristic_def_id_of_type;
115 use rustc_incremental::IchHasher;
116 use std::cmp::Ordering;
119 use symbol_map::SymbolMap;
120 use syntax::ast::NodeId;
121 use syntax::symbol::{Symbol, InternedString};
122 use trans_item::{TransItem, InstantiationMode};
123 use util::nodemap::{FxHashMap, FxHashSet};
125 pub enum PartitioningStrategy {
126 /// Generate one codegen unit per source-level module.
129 /// Partition the whole crate into a fixed number of codegen units.
130 FixedUnitCount(usize)
133 pub struct CodegenUnit<'tcx> {
134 /// A name for this CGU. Incremental compilation requires that
135 /// name be unique amongst **all** crates. Therefore, it should
136 /// contain something unique to this crate (e.g., a module path)
137 /// as well as the crate name and disambiguator.
138 name: InternedString,
140 items: FxHashMap<TransItem<'tcx>, llvm::Linkage>,
143 impl<'tcx> CodegenUnit<'tcx> {
144 pub fn new(name: InternedString,
145 items: FxHashMap<TransItem<'tcx>, llvm::Linkage>)
153 pub fn empty(name: InternedString) -> Self {
154 Self::new(name, FxHashMap())
157 pub fn contains_item(&self, item: &TransItem<'tcx>) -> bool {
158 self.items.contains_key(item)
161 pub fn name(&self) -> &str {
165 pub fn items(&self) -> &FxHashMap<TransItem<'tcx>, llvm::Linkage> {
169 pub fn work_product_id(&self) -> Arc<WorkProductId> {
170 Arc::new(WorkProductId(self.name().to_string()))
173 pub fn work_product_dep_node(&self) -> DepNode<DefId> {
174 DepNode::WorkProduct(self.work_product_id())
177 pub fn compute_symbol_name_hash(&self,
178 scx: &SharedCrateContext,
179 symbol_map: &SymbolMap) -> u64 {
180 let mut state = IchHasher::new();
181 let exported_symbols = scx.exported_symbols();
182 let all_items = self.items_in_deterministic_order(scx.tcx(), symbol_map);
183 for (item, _) in all_items {
184 let symbol_name = symbol_map.get(item).unwrap();
185 symbol_name.len().hash(&mut state);
186 symbol_name.hash(&mut state);
187 let exported = match item {
188 TransItem::Fn(ref instance) => {
190 scx.tcx().hir.as_local_node_id(instance.def_id());
191 node_id.map(|node_id| exported_symbols.contains(&node_id))
194 TransItem::Static(node_id) => {
195 exported_symbols.contains(&node_id)
197 TransItem::DropGlue(..) => false,
199 exported.hash(&mut state);
201 state.finish().to_smaller_hash()
204 pub fn items_in_deterministic_order(&self,
206 symbol_map: &SymbolMap)
207 -> Vec<(TransItem<'tcx>, llvm::Linkage)> {
208 let mut items: Vec<(TransItem<'tcx>, llvm::Linkage)> =
209 self.items.iter().map(|(item, linkage)| (*item, *linkage)).collect();
211 // The codegen tests rely on items being process in the same order as
212 // they appear in the file, so for local items, we sort by node_id first
213 items.sort_by(|&(trans_item1, _), &(trans_item2, _)| {
214 let node_id1 = local_node_id(tcx, trans_item1);
215 let node_id2 = local_node_id(tcx, trans_item2);
217 match (node_id1, node_id2) {
219 let symbol_name1 = symbol_map.get(trans_item1).unwrap();
220 let symbol_name2 = symbol_map.get(trans_item2).unwrap();
221 symbol_name1.cmp(symbol_name2)
223 // In the following two cases we can avoid looking up the symbol
224 (None, Some(_)) => Ordering::Less,
225 (Some(_), None) => Ordering::Greater,
226 (Some(node_id1), Some(node_id2)) => {
227 let ordering = node_id1.cmp(&node_id2);
229 if ordering != Ordering::Equal {
233 let symbol_name1 = symbol_map.get(trans_item1).unwrap();
234 let symbol_name2 = symbol_map.get(trans_item2).unwrap();
235 symbol_name1.cmp(symbol_name2)
242 fn local_node_id(tcx: TyCtxt, trans_item: TransItem) -> Option<NodeId> {
244 TransItem::Fn(instance) => {
245 tcx.hir.as_local_node_id(instance.def_id())
247 TransItem::Static(node_id) => Some(node_id),
248 TransItem::DropGlue(_) => None,
255 // Anything we can't find a proper codegen unit for goes into this.
256 const FALLBACK_CODEGEN_UNIT: &'static str = "__rustc_fallback_codegen_unit";
258 pub fn partition<'a, 'tcx, I>(scx: &SharedCrateContext<'a, 'tcx>,
260 strategy: PartitioningStrategy,
261 inlining_map: &InliningMap<'tcx>)
262 -> Vec<CodegenUnit<'tcx>>
263 where I: Iterator<Item = TransItem<'tcx>>
267 // In the first step, we place all regular translation items into their
268 // respective 'home' codegen unit. Regular translation items are all
269 // functions and statics defined in the local crate.
270 let mut initial_partitioning = place_root_translation_items(scx,
273 debug_dump(scx, "INITIAL PARTITONING:", initial_partitioning.codegen_units.iter());
275 // If the partitioning should produce a fixed count of codegen units, merge
276 // until that count is reached.
277 if let PartitioningStrategy::FixedUnitCount(count) = strategy {
278 merge_codegen_units(&mut initial_partitioning, count, &tcx.crate_name.as_str());
280 debug_dump(scx, "POST MERGING:", initial_partitioning.codegen_units.iter());
283 // In the next step, we use the inlining map to determine which addtional
284 // translation items have to go into each codegen unit. These additional
285 // translation items can be drop-glue, functions from external crates, and
286 // local functions the definition of which is marked with #[inline].
287 let post_inlining = place_inlined_translation_items(initial_partitioning,
290 debug_dump(scx, "POST INLINING:", post_inlining.0.iter());
292 // Finally, sort by codegen unit name, so that we get deterministic results
293 let mut result = post_inlining.0;
294 result.sort_by(|cgu1, cgu2| {
295 (&cgu1.name[..]).cmp(&cgu2.name[..])
301 struct PreInliningPartitioning<'tcx> {
302 codegen_units: Vec<CodegenUnit<'tcx>>,
303 roots: FxHashSet<TransItem<'tcx>>,
306 struct PostInliningPartitioning<'tcx>(Vec<CodegenUnit<'tcx>>);
308 fn place_root_translation_items<'a, 'tcx, I>(scx: &SharedCrateContext<'a, 'tcx>,
310 -> PreInliningPartitioning<'tcx>
311 where I: Iterator<Item = TransItem<'tcx>>
314 let mut roots = FxHashSet();
315 let mut codegen_units = FxHashMap();
316 let is_incremental_build = tcx.sess.opts.incremental.is_some();
318 for trans_item in trans_items {
319 let is_root = trans_item.instantiation_mode(tcx) == InstantiationMode::GloballyShared;
322 let characteristic_def_id = characteristic_def_id_of_trans_item(scx, trans_item);
323 let is_volatile = is_incremental_build &&
324 trans_item.is_generic_fn();
326 let codegen_unit_name = match characteristic_def_id {
327 Some(def_id) => compute_codegen_unit_name(tcx, def_id, is_volatile),
328 None => Symbol::intern(FALLBACK_CODEGEN_UNIT).as_str(),
331 let make_codegen_unit = || {
332 CodegenUnit::empty(codegen_unit_name.clone())
335 let mut codegen_unit = codegen_units.entry(codegen_unit_name.clone())
336 .or_insert_with(make_codegen_unit);
338 let linkage = match trans_item.explicit_linkage(tcx) {
339 Some(explicit_linkage) => explicit_linkage,
343 TransItem::Static(..) => llvm::ExternalLinkage,
344 TransItem::DropGlue(..) => unreachable!(),
349 codegen_unit.items.insert(trans_item, linkage);
350 roots.insert(trans_item);
354 // always ensure we have at least one CGU; otherwise, if we have a
355 // crate with just types (for example), we could wind up with no CGU
356 if codegen_units.is_empty() {
357 let codegen_unit_name = Symbol::intern(FALLBACK_CODEGEN_UNIT).as_str();
358 codegen_units.entry(codegen_unit_name.clone())
359 .or_insert_with(|| CodegenUnit::empty(codegen_unit_name.clone()));
362 PreInliningPartitioning {
363 codegen_units: codegen_units.into_iter()
364 .map(|(_, codegen_unit)| codegen_unit)
370 fn merge_codegen_units<'tcx>(initial_partitioning: &mut PreInliningPartitioning<'tcx>,
371 target_cgu_count: usize,
373 assert!(target_cgu_count >= 1);
374 let codegen_units = &mut initial_partitioning.codegen_units;
376 // Merge the two smallest codegen units until the target size is reached.
377 // Note that "size" is estimated here rather inaccurately as the number of
378 // translation items in a given unit. This could be improved on.
379 while codegen_units.len() > target_cgu_count {
380 // Sort small cgus to the back
381 codegen_units.sort_by_key(|cgu| -(cgu.items.len() as i64));
382 let smallest = codegen_units.pop().unwrap();
383 let second_smallest = codegen_units.last_mut().unwrap();
385 for (k, v) in smallest.items.into_iter() {
386 second_smallest.items.insert(k, v);
390 for (index, cgu) in codegen_units.iter_mut().enumerate() {
391 cgu.name = numbered_codegen_unit_name(crate_name, index);
394 // If the initial partitioning contained less than target_cgu_count to begin
395 // with, we won't have enough codegen units here, so add a empty units until
396 // we reach the target count
397 while codegen_units.len() < target_cgu_count {
398 let index = codegen_units.len();
400 CodegenUnit::empty(numbered_codegen_unit_name(crate_name, index)));
404 fn place_inlined_translation_items<'tcx>(initial_partitioning: PreInliningPartitioning<'tcx>,
405 inlining_map: &InliningMap<'tcx>)
406 -> PostInliningPartitioning<'tcx> {
407 let mut new_partitioning = Vec::new();
409 for codegen_unit in &initial_partitioning.codegen_units[..] {
410 // Collect all items that need to be available in this codegen unit
411 let mut reachable = FxHashSet();
412 for root in codegen_unit.items.keys() {
413 follow_inlining(*root, inlining_map, &mut reachable);
416 let mut new_codegen_unit =
417 CodegenUnit::empty(codegen_unit.name.clone());
419 // Add all translation items that are not already there
420 for trans_item in reachable {
421 if let Some(linkage) = codegen_unit.items.get(&trans_item) {
422 // This is a root, just copy it over
423 new_codegen_unit.items.insert(trans_item, *linkage);
425 if initial_partitioning.roots.contains(&trans_item) {
426 bug!("GloballyShared trans-item inlined into other CGU: \
430 // This is a cgu-private copy
431 new_codegen_unit.items.insert(trans_item, llvm::InternalLinkage);
435 new_partitioning.push(new_codegen_unit);
438 return PostInliningPartitioning(new_partitioning);
440 fn follow_inlining<'tcx>(trans_item: TransItem<'tcx>,
441 inlining_map: &InliningMap<'tcx>,
442 visited: &mut FxHashSet<TransItem<'tcx>>) {
443 if !visited.insert(trans_item) {
447 inlining_map.with_inlining_candidates(trans_item, |target| {
448 follow_inlining(target, inlining_map, visited);
453 fn characteristic_def_id_of_trans_item<'a, 'tcx>(scx: &SharedCrateContext<'a, 'tcx>,
454 trans_item: TransItem<'tcx>)
458 TransItem::Fn(instance) => {
459 let def_id = match instance.def {
460 ty::InstanceDef::Item(def_id) => def_id,
461 ty::InstanceDef::FnPtrShim(..) => return None
464 // If this is a method, we want to put it into the same module as
465 // its self-type. If the self-type does not provide a characteristic
466 // DefId, we use the location of the impl after all.
468 if tcx.trait_of_item(def_id).is_some() {
469 let self_ty = instance.substs.type_at(0);
470 // This is an implementation of a trait method.
471 return characteristic_def_id_of_type(self_ty).or(Some(def_id));
474 if let Some(impl_def_id) = tcx.impl_of_method(def_id) {
475 // This is a method within an inherent impl, find out what the
477 let impl_self_ty = common::def_ty(scx, impl_def_id, instance.substs);
478 if let Some(def_id) = characteristic_def_id_of_type(impl_self_ty) {
485 TransItem::DropGlue(dg) => characteristic_def_id_of_type(dg.ty()),
486 TransItem::Static(node_id) => Some(tcx.hir.local_def_id(node_id)),
490 fn compute_codegen_unit_name<'a, 'tcx>(tcx: TyCtxt<'a, 'tcx, 'tcx>,
494 // Unfortunately we cannot just use the `ty::item_path` infrastructure here
495 // because we need paths to modules and the DefIds of those are not
496 // available anymore for external items.
497 let mut mod_path = String::with_capacity(64);
499 let def_path = tcx.def_path(def_id);
500 mod_path.push_str(&tcx.crate_name(def_path.krate).as_str());
502 for part in tcx.def_path(def_id)
507 DefPathData::Module(..) => true,
511 mod_path.push_str("-");
512 mod_path.push_str(&part.data.as_interned_str());
516 mod_path.push_str(".volatile");
519 return Symbol::intern(&mod_path[..]).as_str();
522 fn numbered_codegen_unit_name(crate_name: &str, index: usize) -> InternedString {
523 Symbol::intern(&format!("{}{}{}", crate_name, NUMBERED_CODEGEN_UNIT_MARKER, index)).as_str()
526 fn debug_dump<'a, 'b, 'tcx, I>(scx: &SharedCrateContext<'a, 'tcx>,
529 where I: Iterator<Item=&'b CodegenUnit<'tcx>>,
532 if cfg!(debug_assertions) {
535 let symbol_map = SymbolMap::build(scx, cgu.items
537 .map(|(&trans_item, _)| trans_item));
538 debug!("CodegenUnit {}:", cgu.name);
540 for (trans_item, linkage) in &cgu.items {
541 let symbol_name = symbol_map.get_or_compute(scx, *trans_item);
542 let symbol_hash_start = symbol_name.rfind('h');
543 let symbol_hash = symbol_hash_start.map(|i| &symbol_name[i ..])
544 .unwrap_or("<no hash>");
546 debug!(" - {} [{:?}] [{}]",
547 trans_item.to_string(scx.tcx()),