1 //! Mono Item Collection
2 //! ====================
4 //! This module is responsible for discovering all items that will contribute to
5 //! to code generation of the crate. The important part here is that it not only
6 //! needs to find syntax-level items (functions, structs, etc) but also all
7 //! their monomorphized instantiations. Every non-generic, non-const function
8 //! maps to one LLVM artifact. Every generic function can produce
9 //! from zero to N artifacts, depending on the sets of type arguments it
10 //! is instantiated with.
11 //! This also applies to generic items from other crates: A generic definition
12 //! in crate X might produce monomorphizations that are compiled into crate Y.
13 //! We also have to collect these here.
15 //! The following kinds of "mono items" are handled here:
23 //! The following things also result in LLVM artifacts, but are not collected
24 //! here, since we instantiate them locally on demand when needed in a given
34 //! Let's define some terms first:
36 //! - A "mono item" is something that results in a function or global in
37 //! the LLVM IR of a codegen unit. Mono items do not stand on their
38 //! own, they can reference other mono items. For example, if function
39 //! `foo()` calls function `bar()` then the mono item for `foo()`
40 //! references the mono item for function `bar()`. In general, the
41 //! definition for mono item A referencing a mono item B is that
42 //! the LLVM artifact produced for A references the LLVM artifact produced
45 //! - Mono items and the references between them form a directed graph,
46 //! where the mono items are the nodes and references form the edges.
47 //! Let's call this graph the "mono item graph".
49 //! - The mono item graph for a program contains all mono items
50 //! that are needed in order to produce the complete LLVM IR of the program.
52 //! The purpose of the algorithm implemented in this module is to build the
53 //! mono item graph for the current crate. It runs in two phases:
55 //! 1. Discover the roots of the graph by traversing the HIR of the crate.
56 //! 2. Starting from the roots, find neighboring nodes by inspecting the MIR
57 //! representation of the item corresponding to a given node, until no more
58 //! new nodes are found.
60 //! ### Discovering roots
62 //! The roots of the mono item graph correspond to the non-generic
63 //! syntactic items in the source code. We find them by walking the HIR of the
64 //! crate, and whenever we hit upon a function, method, or static item, we
65 //! create a mono item consisting of the items DefId and, since we only
66 //! consider non-generic items, an empty type-substitution set.
68 //! ### Finding neighbor nodes
69 //! Given a mono item node, we can discover neighbors by inspecting its
70 //! MIR. We walk the MIR and any time we hit upon something that signifies a
71 //! reference to another mono item, we have found a neighbor. Since the
72 //! mono item we are currently at is always monomorphic, we also know the
73 //! concrete type arguments of its neighbors, and so all neighbors again will be
74 //! monomorphic. The specific forms a reference to a neighboring node can take
75 //! in MIR are quite diverse. Here is an overview:
77 //! #### Calling Functions/Methods
78 //! The most obvious form of one mono item referencing another is a
79 //! function or method call (represented by a CALL terminator in MIR). But
80 //! calls are not the only thing that might introduce a reference between two
81 //! function mono items, and as we will see below, they are just a
82 //! specialized of the form described next, and consequently will don't get any
83 //! special treatment in the algorithm.
85 //! #### Taking a reference to a function or method
86 //! A function does not need to actually be called in order to be a neighbor of
87 //! another function. It suffices to just take a reference in order to introduce
88 //! an edge. Consider the following example:
91 //! fn print_val<T: Display>(x: T) {
92 //! println!("{}", x);
95 //! fn call_fn(f: &Fn(i32), x: i32) {
100 //! let print_i32 = print_val::<i32>;
101 //! call_fn(&print_i32, 0);
104 //! The MIR of none of these functions will contain an explicit call to
105 //! `print_val::<i32>`. Nonetheless, in order to mono this program, we need
106 //! an instance of this function. Thus, whenever we encounter a function or
107 //! method in operand position, we treat it as a neighbor of the current
108 //! mono item. Calls are just a special case of that.
111 //! In a way, closures are a simple case. Since every closure object needs to be
112 //! constructed somewhere, we can reliably discover them by observing
113 //! `RValue::Aggregate` expressions with `AggregateKind::Closure`. This is also
114 //! true for closures inlined from other crates.
117 //! Drop glue mono items are introduced by MIR drop-statements. The
118 //! generated mono item will again have drop-glue item neighbors if the
119 //! type to be dropped contains nested values that also need to be dropped. It
120 //! might also have a function item neighbor for the explicit `Drop::drop`
121 //! implementation of its type.
123 //! #### Unsizing Casts
124 //! A subtle way of introducing neighbor edges is by casting to a trait object.
125 //! Since the resulting fat-pointer contains a reference to a vtable, we need to
126 //! instantiate all object-save methods of the trait, as we need to store
127 //! pointers to these functions even if they never get called anywhere. This can
128 //! be seen as a special case of taking a function reference.
131 //! Since `Box` expression have special compiler support, no explicit calls to
132 //! `exchange_malloc()` and `box_free()` may show up in MIR, even if the
133 //! compiler will generate them. We have to observe `Rvalue::Box` expressions
134 //! and Box-typed drop-statements for that purpose.
137 //! Interaction with Cross-Crate Inlining
138 //! -------------------------------------
139 //! The binary of a crate will not only contain machine code for the items
140 //! defined in the source code of that crate. It will also contain monomorphic
141 //! instantiations of any extern generic functions and of functions marked with
143 //! The collection algorithm handles this more or less mono. If it is
144 //! about to create a mono item for something with an external `DefId`,
145 //! it will take a look if the MIR for that item is available, and if so just
146 //! proceed normally. If the MIR is not available, it assumes that the item is
147 //! just linked to and no node is created; which is exactly what we want, since
148 //! no machine code should be generated in the current crate for such an item.
150 //! Eager and Lazy Collection Mode
151 //! ------------------------------
152 //! Mono item collection can be performed in one of two modes:
154 //! - Lazy mode means that items will only be instantiated when actually
155 //! referenced. The goal is to produce the least amount of machine code
158 //! - Eager mode is meant to be used in conjunction with incremental compilation
159 //! where a stable set of mono items is more important than a minimal
160 //! one. Thus, eager mode will instantiate drop-glue for every drop-able type
161 //! in the crate, even of no drop call for that type exists (yet). It will
162 //! also instantiate default implementations of trait methods, something that
163 //! otherwise is only done on demand.
168 //! Some things are not yet fully implemented in the current version of this
172 //! Ideally, no mono item should be generated for const fns unless there
173 //! is a call to them that cannot be evaluated at compile time. At the moment
174 //! this is not implemented however: a mono item will be produced
175 //! regardless of whether it is actually needed or not.
177 use crate::monomorphize;
179 use rustc::middle::codegen_fn_attrs::CodegenFnAttrFlags;
180 use rustc::middle::lang_items::{ExchangeMallocFnLangItem, StartFnLangItem};
181 use rustc::mir::interpret::{AllocId, ConstValue};
182 use rustc::mir::interpret::{ErrorHandled, GlobalAlloc, Scalar};
183 use rustc::mir::mono::{InstantiationMode, MonoItem};
184 use rustc::mir::visit::Visitor as MirVisitor;
185 use rustc::mir::{self, Location, PlaceBase};
186 use rustc::session::config::EntryFnType;
187 use rustc::ty::adjustment::{CustomCoerceUnsized, PointerCast};
188 use rustc::ty::print::obsolete::DefPathBasedNames;
189 use rustc::ty::subst::{InternalSubsts, SubstsRef};
190 use rustc::ty::{self, GenericParamDefKind, Instance, Ty, TyCtxt, TypeFoldable};
191 use rustc_data_structures::fx::{FxHashMap, FxHashSet};
192 use rustc_data_structures::sync::{par_iter, MTLock, MTRef, ParallelIterator};
193 use rustc_hir as hir;
194 use rustc_hir::def_id::{DefId, DefIdMap, LOCAL_CRATE};
195 use rustc_hir::itemlikevisit::ItemLikeVisitor;
196 use rustc_index::bit_set::GrowableBitSet;
201 pub enum MonoItemCollectionMode {
206 /// Maps every mono item to all mono items it references in its
208 pub struct InliningMap<'tcx> {
209 // Maps a source mono item to the range of mono items
211 // The two numbers in the tuple are the start (inclusive) and
212 // end index (exclusive) within the `targets` vecs.
213 index: FxHashMap<MonoItem<'tcx>, (usize, usize)>,
214 targets: Vec<MonoItem<'tcx>>,
216 // Contains one bit per mono item in the `targets` field. That bit
217 // is true if that mono item needs to be inlined into every CGU.
218 inlines: GrowableBitSet<usize>,
221 impl<'tcx> InliningMap<'tcx> {
222 fn new() -> InliningMap<'tcx> {
224 index: FxHashMap::default(),
226 inlines: GrowableBitSet::with_capacity(1024),
230 fn record_accesses<I>(&mut self, source: MonoItem<'tcx>, new_targets: I)
232 I: Iterator<Item = (MonoItem<'tcx>, bool)> + ExactSizeIterator,
234 assert!(!self.index.contains_key(&source));
236 let start_index = self.targets.len();
237 let new_items_count = new_targets.len();
238 let new_items_count_total = new_items_count + self.targets.len();
240 self.targets.reserve(new_items_count);
241 self.inlines.ensure(new_items_count_total);
243 for (i, (target, inline)) in new_targets.enumerate() {
244 self.targets.push(target);
246 self.inlines.insert(i + start_index);
250 let end_index = self.targets.len();
251 self.index.insert(source, (start_index, end_index));
254 // Internally iterate over all items referenced by `source` which will be
255 // made available for inlining.
256 pub fn with_inlining_candidates<F>(&self, source: MonoItem<'tcx>, mut f: F)
258 F: FnMut(MonoItem<'tcx>),
260 if let Some(&(start_index, end_index)) = self.index.get(&source) {
261 for (i, candidate) in self.targets[start_index..end_index].iter().enumerate() {
262 if self.inlines.contains(start_index + i) {
269 // Internally iterate over all items and the things each accesses.
270 pub fn iter_accesses<F>(&self, mut f: F)
272 F: FnMut(MonoItem<'tcx>, &[MonoItem<'tcx>]),
274 for (&accessor, &(start_index, end_index)) in &self.index {
275 f(accessor, &self.targets[start_index..end_index])
280 pub fn collect_crate_mono_items(
282 mode: MonoItemCollectionMode,
283 ) -> (FxHashSet<MonoItem<'_>>, InliningMap<'_>) {
284 let _prof_timer = tcx.prof.generic_activity("monomorphization_collector");
287 tcx.sess.time("monomorphization_collector_root_collections", || collect_roots(tcx, mode));
289 debug!("building mono item graph, beginning at roots");
291 let mut visited = MTLock::new(FxHashSet::default());
292 let mut inlining_map = MTLock::new(InliningMap::new());
295 let visited: MTRef<'_, _> = &mut visited;
296 let inlining_map: MTRef<'_, _> = &mut inlining_map;
298 tcx.sess.time("monomorphization_collector_graph_walk", || {
299 par_iter(roots).for_each(|root| {
300 let mut recursion_depths = DefIdMap::default();
301 collect_items_rec(tcx, root, visited, &mut recursion_depths, inlining_map);
306 (visited.into_inner(), inlining_map.into_inner())
309 // Find all non-generic items by walking the HIR. These items serve as roots to
310 // start monomorphizing from.
311 fn collect_roots(tcx: TyCtxt<'_>, mode: MonoItemCollectionMode) -> Vec<MonoItem<'_>> {
312 debug!("collecting roots");
313 let mut roots = Vec::new();
316 let entry_fn = tcx.entry_fn(LOCAL_CRATE);
318 debug!("collect_roots: entry_fn = {:?}", entry_fn);
320 let mut visitor = RootCollector { tcx, mode, entry_fn, output: &mut roots };
322 tcx.hir().krate().visit_all_item_likes(&mut visitor);
324 visitor.push_extra_entry_roots();
327 // We can only codegen items that are instantiable - items all of
328 // whose predicates hold. Luckily, items that aren't instantiable
329 // can't actually be used, so we can just skip codegenning them.
330 roots.retain(|root| root.is_instantiable(tcx));
335 // Collect all monomorphized items reachable from `starting_point`
336 fn collect_items_rec<'tcx>(
338 starting_point: MonoItem<'tcx>,
339 visited: MTRef<'_, MTLock<FxHashSet<MonoItem<'tcx>>>>,
340 recursion_depths: &mut DefIdMap<usize>,
341 inlining_map: MTRef<'_, MTLock<InliningMap<'tcx>>>,
343 if !visited.lock_mut().insert(starting_point.clone()) {
344 // We've been here already, no need to search again.
347 debug!("BEGIN collect_items_rec({})", starting_point.to_string(tcx, true));
349 let mut neighbors = Vec::new();
350 let recursion_depth_reset;
352 match starting_point {
353 MonoItem::Static(def_id) => {
354 let instance = Instance::mono(tcx, def_id);
356 // Sanity check whether this ended up being collected accidentally
357 debug_assert!(should_monomorphize_locally(tcx, &instance));
359 let ty = instance.monomorphic_ty(tcx);
360 visit_drop_use(tcx, ty, true, &mut neighbors);
362 recursion_depth_reset = None;
364 if let Ok(val) = tcx.const_eval_poly(def_id) {
365 collect_const(tcx, val, InternalSubsts::empty(), &mut neighbors);
368 MonoItem::Fn(instance) => {
369 // Sanity check whether this ended up being collected accidentally
370 debug_assert!(should_monomorphize_locally(tcx, &instance));
372 // Keep track of the monomorphization recursion depth
373 recursion_depth_reset = Some(check_recursion_limit(tcx, instance, recursion_depths));
374 check_type_length_limit(tcx, instance);
376 collect_neighbours(tcx, instance, &mut neighbors);
378 MonoItem::GlobalAsm(..) => {
379 recursion_depth_reset = None;
383 record_accesses(tcx, starting_point, &neighbors[..], inlining_map);
385 for neighbour in neighbors {
386 collect_items_rec(tcx, neighbour, visited, recursion_depths, inlining_map);
389 if let Some((def_id, depth)) = recursion_depth_reset {
390 recursion_depths.insert(def_id, depth);
393 debug!("END collect_items_rec({})", starting_point.to_string(tcx, true));
396 fn record_accesses<'tcx>(
398 caller: MonoItem<'tcx>,
399 callees: &[MonoItem<'tcx>],
400 inlining_map: MTRef<'_, MTLock<InliningMap<'tcx>>>,
402 let is_inlining_candidate = |mono_item: &MonoItem<'tcx>| {
403 mono_item.instantiation_mode(tcx) == InstantiationMode::LocalCopy
407 callees.into_iter().map(|mono_item| (*mono_item, is_inlining_candidate(mono_item)));
409 inlining_map.lock_mut().record_accesses(caller, accesses);
412 fn check_recursion_limit<'tcx>(
414 instance: Instance<'tcx>,
415 recursion_depths: &mut DefIdMap<usize>,
416 ) -> (DefId, usize) {
417 let def_id = instance.def_id();
418 let recursion_depth = recursion_depths.get(&def_id).cloned().unwrap_or(0);
419 debug!(" => recursion depth={}", recursion_depth);
421 let recursion_depth = if Some(def_id) == tcx.lang_items().drop_in_place_fn() {
422 // HACK: drop_in_place creates tight monomorphization loops. Give
429 // Code that needs to instantiate the same function recursively
430 // more than the recursion limit is assumed to be causing an
431 // infinite expansion.
432 if recursion_depth > *tcx.sess.recursion_limit.get() {
433 let error = format!("reached the recursion limit while instantiating `{}`", instance);
434 if let Some(hir_id) = tcx.hir().as_local_hir_id(def_id) {
435 tcx.sess.span_fatal(tcx.hir().span(hir_id), &error);
437 tcx.sess.fatal(&error);
441 recursion_depths.insert(def_id, recursion_depth + 1);
443 (def_id, recursion_depth)
446 fn check_type_length_limit<'tcx>(tcx: TyCtxt<'tcx>, instance: Instance<'tcx>) {
447 let type_length = instance.substs.types().flat_map(|ty| ty.walk()).count();
448 let const_length = instance.substs.consts().flat_map(|ct| ct.ty.walk()).count();
449 debug!(" => type length={}, const length={}", type_length, const_length);
451 // Rust code can easily create exponentially-long types using only a
452 // polynomial recursion depth. Even with the default recursion
453 // depth, you can easily get cases that take >2^60 steps to run,
454 // which means that rustc basically hangs.
456 // Bail out in these cases to avoid that bad user experience.
457 let type_length_limit = *tcx.sess.type_length_limit.get();
458 // We include the const length in the type length, as it's better
459 // to be overly conservative.
460 // FIXME(const_generics): we should instead uniformly walk through `substs`,
461 // ignoring lifetimes.
462 if type_length + const_length > type_length_limit {
463 // The instance name is already known to be too long for rustc.
464 // Show only the first and last 32 characters to avoid blasting
465 // the user's terminal with thousands of lines of type-name.
466 let shrink = |s: String, before: usize, after: usize| {
467 // An iterator of all byte positions including the end of the string.
468 let positions = || s.char_indices().map(|(i, _)| i).chain(iter::once(s.len()));
470 let shrunk = format!(
471 "{before}...{after}",
472 before = &s[..positions().nth(before).unwrap_or(s.len())],
473 after = &s[positions().rev().nth(after).unwrap_or(0)..],
476 // Only use the shrunk version if it's really shorter.
477 // This also avoids the case where before and after slices overlap.
478 if shrunk.len() < s.len() { shrunk } else { s }
481 "reached the type-length limit while instantiating `{}`",
482 shrink(instance.to_string(), 32, 32)
484 let mut diag = tcx.sess.struct_span_fatal(tcx.def_span(instance.def_id()), &msg);
486 "consider adding a `#![type_length_limit=\"{}\"]` attribute to your crate",
490 tcx.sess.abort_if_errors();
494 struct MirNeighborCollector<'a, 'tcx> {
496 body: &'a mir::Body<'tcx>,
497 output: &'a mut Vec<MonoItem<'tcx>>,
498 param_substs: SubstsRef<'tcx>,
501 impl<'a, 'tcx> MirVisitor<'tcx> for MirNeighborCollector<'a, 'tcx> {
502 fn visit_rvalue(&mut self, rvalue: &mir::Rvalue<'tcx>, location: Location) {
503 debug!("visiting rvalue {:?}", *rvalue);
506 // When doing an cast from a regular pointer to a fat pointer, we
507 // have to instantiate all methods of the trait being cast to, so we
508 // can build the appropriate vtable.
510 mir::CastKind::Pointer(PointerCast::Unsize),
514 let target_ty = self.tcx.subst_and_normalize_erasing_regions(
516 ty::ParamEnv::reveal_all(),
519 let source_ty = operand.ty(self.body, self.tcx);
520 let source_ty = self.tcx.subst_and_normalize_erasing_regions(
522 ty::ParamEnv::reveal_all(),
525 let (source_ty, target_ty) =
526 find_vtable_types_for_unsizing(self.tcx, source_ty, target_ty);
527 // This could also be a different Unsize instruction, like
528 // from a fixed sized array to a slice. But we are only
529 // interested in things that produce a vtable.
530 if target_ty.is_trait() && !source_ty.is_trait() {
531 create_mono_items_for_vtable_methods(
540 mir::CastKind::Pointer(PointerCast::ReifyFnPointer),
544 let fn_ty = operand.ty(self.body, self.tcx);
545 let fn_ty = self.tcx.subst_and_normalize_erasing_regions(
547 ty::ParamEnv::reveal_all(),
550 visit_fn_use(self.tcx, fn_ty, false, &mut self.output);
553 mir::CastKind::Pointer(PointerCast::ClosureFnPointer(_)),
557 let source_ty = operand.ty(self.body, self.tcx);
558 let source_ty = self.tcx.subst_and_normalize_erasing_regions(
560 ty::ParamEnv::reveal_all(),
563 match source_ty.kind {
564 ty::Closure(def_id, substs) => {
565 let instance = Instance::resolve_closure(
569 ty::ClosureKind::FnOnce,
571 if should_monomorphize_locally(self.tcx, &instance) {
572 self.output.push(create_fn_mono_item(instance));
578 mir::Rvalue::NullaryOp(mir::NullOp::Box, _) => {
580 let exchange_malloc_fn_def_id = tcx
582 .require(ExchangeMallocFnLangItem)
583 .unwrap_or_else(|e| tcx.sess.fatal(&e));
584 let instance = Instance::mono(tcx, exchange_malloc_fn_def_id);
585 if should_monomorphize_locally(tcx, &instance) {
586 self.output.push(create_fn_mono_item(instance));
589 _ => { /* not interesting */ }
592 self.super_rvalue(rvalue, location);
595 fn visit_const(&mut self, constant: &&'tcx ty::Const<'tcx>, location: Location) {
596 debug!("visiting const {:?} @ {:?}", *constant, location);
598 collect_const(self.tcx, *constant, self.param_substs, self.output);
600 self.super_const(constant);
603 fn visit_terminator_kind(&mut self, kind: &mir::TerminatorKind<'tcx>, location: Location) {
604 debug!("visiting terminator {:?} @ {:?}", kind, location);
608 mir::TerminatorKind::Call { ref func, .. } => {
609 let callee_ty = func.ty(self.body, tcx);
610 let callee_ty = tcx.subst_and_normalize_erasing_regions(
612 ty::ParamEnv::reveal_all(),
615 visit_fn_use(self.tcx, callee_ty, true, &mut self.output);
617 mir::TerminatorKind::Drop { ref location, .. }
618 | mir::TerminatorKind::DropAndReplace { ref location, .. } => {
619 let ty = location.ty(self.body, self.tcx).ty;
620 let ty = tcx.subst_and_normalize_erasing_regions(
622 ty::ParamEnv::reveal_all(),
625 visit_drop_use(self.tcx, ty, true, self.output);
627 mir::TerminatorKind::Goto { .. }
628 | mir::TerminatorKind::SwitchInt { .. }
629 | mir::TerminatorKind::Resume
630 | mir::TerminatorKind::Abort
631 | mir::TerminatorKind::Return
632 | mir::TerminatorKind::Unreachable
633 | mir::TerminatorKind::Assert { .. } => {}
634 mir::TerminatorKind::GeneratorDrop
635 | mir::TerminatorKind::Yield { .. }
636 | mir::TerminatorKind::FalseEdges { .. }
637 | mir::TerminatorKind::FalseUnwind { .. } => bug!(),
640 self.super_terminator_kind(kind, location);
645 place_base: &mir::PlaceBase,
646 _context: mir::visit::PlaceContext,
650 PlaceBase::Local(_) => {
651 // Locals have no relevance for collector.
657 fn visit_drop_use<'tcx>(
660 is_direct_call: bool,
661 output: &mut Vec<MonoItem<'tcx>>,
663 let instance = Instance::resolve_drop_in_place(tcx, ty);
664 visit_instance_use(tcx, instance, is_direct_call, output);
667 fn visit_fn_use<'tcx>(
670 is_direct_call: bool,
671 output: &mut Vec<MonoItem<'tcx>>,
673 if let ty::FnDef(def_id, substs) = ty.kind {
675 if is_direct_call { ty::Instance::resolve } else { ty::Instance::resolve_for_fn_ptr };
676 let instance = resolver(tcx, ty::ParamEnv::reveal_all(), def_id, substs).unwrap();
677 visit_instance_use(tcx, instance, is_direct_call, output);
681 fn visit_instance_use<'tcx>(
683 instance: ty::Instance<'tcx>,
684 is_direct_call: bool,
685 output: &mut Vec<MonoItem<'tcx>>,
687 debug!("visit_item_use({:?}, is_direct_call={:?})", instance, is_direct_call);
688 if !should_monomorphize_locally(tcx, &instance) {
693 ty::InstanceDef::Virtual(..) | ty::InstanceDef::Intrinsic(_) => {
695 bug!("{:?} being reified", instance);
698 ty::InstanceDef::DropGlue(_, None) => {
699 // Don't need to emit noop drop glue if we are calling directly.
701 output.push(create_fn_mono_item(instance));
704 ty::InstanceDef::DropGlue(_, Some(_))
705 | ty::InstanceDef::VtableShim(..)
706 | ty::InstanceDef::ReifyShim(..)
707 | ty::InstanceDef::ClosureOnceShim { .. }
708 | ty::InstanceDef::Item(..)
709 | ty::InstanceDef::FnPtrShim(..)
710 | ty::InstanceDef::CloneShim(..) => {
711 output.push(create_fn_mono_item(instance));
716 // Returns `true` if we should codegen an instance in the local crate.
717 // Returns `false` if we can just link to the upstream crate and therefore don't
719 fn should_monomorphize_locally<'tcx>(tcx: TyCtxt<'tcx>, instance: &Instance<'tcx>) -> bool {
720 let def_id = match instance.def {
721 ty::InstanceDef::Item(def_id) => def_id,
722 ty::InstanceDef::VtableShim(..)
723 | ty::InstanceDef::ReifyShim(..)
724 | ty::InstanceDef::ClosureOnceShim { .. }
725 | ty::InstanceDef::Virtual(..)
726 | ty::InstanceDef::FnPtrShim(..)
727 | ty::InstanceDef::DropGlue(..)
728 | ty::InstanceDef::Intrinsic(_)
729 | ty::InstanceDef::CloneShim(..) => return true,
732 if tcx.is_foreign_item(def_id) {
733 // We can always link to foreign items.
737 if def_id.is_local() {
738 // Local items cannot be referred to locally without monomorphizing them locally.
742 if tcx.is_reachable_non_generic(def_id)
743 || is_available_upstream_generic(tcx, def_id, instance.substs)
745 // We can link to the item in question, no instance needed
750 if !tcx.is_mir_available(def_id) {
751 bug!("cannot create local mono-item for {:?}", def_id)
755 fn is_available_upstream_generic<'tcx>(
758 substs: SubstsRef<'tcx>,
760 debug_assert!(!def_id.is_local());
762 // If we are not in share generics mode, we don't link to upstream
763 // monomorphizations but always instantiate our own internal versions
765 if !tcx.sess.opts.share_generics() {
769 // If this instance has non-erasable parameters, it cannot be a shared
770 // monomorphization. Non-generic instances are already handled above
771 // by `is_reachable_non_generic()`.
772 if substs.non_erasable_generics().next().is_none() {
776 // Take a look at the available monomorphizations listed in the metadata
777 // of upstream crates.
778 tcx.upstream_monomorphizations_for(def_id)
779 .map(|set| set.contains_key(substs))
784 /// For a given pair of source and target type that occur in an unsizing coercion,
785 /// this function finds the pair of types that determines the vtable linking
788 /// For example, the source type might be `&SomeStruct` and the target type\
789 /// might be `&SomeTrait` in a cast like:
791 /// let src: &SomeStruct = ...;
792 /// let target = src as &SomeTrait;
794 /// Then the output of this function would be (SomeStruct, SomeTrait) since for
795 /// constructing the `target` fat-pointer we need the vtable for that pair.
797 /// Things can get more complicated though because there's also the case where
798 /// the unsized type occurs as a field:
801 /// struct ComplexStruct<T: ?Sized> {
808 /// In this case, if `T` is sized, `&ComplexStruct<T>` is a thin pointer. If `T`
809 /// is unsized, `&SomeStruct` is a fat pointer, and the vtable it points to is
810 /// for the pair of `T` (which is a trait) and the concrete type that `T` was
811 /// originally coerced from:
813 /// let src: &ComplexStruct<SomeStruct> = ...;
814 /// let target = src as &ComplexStruct<SomeTrait>;
816 /// Again, we want this `find_vtable_types_for_unsizing()` to provide the pair
817 /// `(SomeStruct, SomeTrait)`.
819 /// Finally, there is also the case of custom unsizing coercions, e.g., for
820 /// smart pointers such as `Rc` and `Arc`.
821 fn find_vtable_types_for_unsizing<'tcx>(
825 ) -> (Ty<'tcx>, Ty<'tcx>) {
826 let ptr_vtable = |inner_source: Ty<'tcx>, inner_target: Ty<'tcx>| {
827 let param_env = ty::ParamEnv::reveal_all();
828 let type_has_metadata = |ty: Ty<'tcx>| -> bool {
829 use rustc_span::DUMMY_SP;
830 if ty.is_sized(tcx.at(DUMMY_SP), param_env) {
833 let tail = tcx.struct_tail_erasing_lifetimes(ty, param_env);
835 ty::Foreign(..) => false,
836 ty::Str | ty::Slice(..) | ty::Dynamic(..) => true,
837 _ => bug!("unexpected unsized tail: {:?}", tail),
840 if type_has_metadata(inner_source) {
841 (inner_source, inner_target)
843 tcx.struct_lockstep_tails_erasing_lifetimes(inner_source, inner_target, param_env)
847 match (&source_ty.kind, &target_ty.kind) {
848 (&ty::Ref(_, a, _), &ty::Ref(_, b, _))
849 | (&ty::Ref(_, a, _), &ty::RawPtr(ty::TypeAndMut { ty: b, .. }))
850 | (&ty::RawPtr(ty::TypeAndMut { ty: a, .. }), &ty::RawPtr(ty::TypeAndMut { ty: b, .. })) => {
853 (&ty::Adt(def_a, _), &ty::Adt(def_b, _)) if def_a.is_box() && def_b.is_box() => {
854 ptr_vtable(source_ty.boxed_ty(), target_ty.boxed_ty())
857 (&ty::Adt(source_adt_def, source_substs), &ty::Adt(target_adt_def, target_substs)) => {
858 assert_eq!(source_adt_def, target_adt_def);
860 let kind = monomorphize::custom_coerce_unsize_info(tcx, source_ty, target_ty);
862 let coerce_index = match kind {
863 CustomCoerceUnsized::Struct(i) => i,
866 let source_fields = &source_adt_def.non_enum_variant().fields;
867 let target_fields = &target_adt_def.non_enum_variant().fields;
870 coerce_index < source_fields.len() && source_fields.len() == target_fields.len()
873 find_vtable_types_for_unsizing(
875 source_fields[coerce_index].ty(tcx, source_substs),
876 target_fields[coerce_index].ty(tcx, target_substs),
880 "find_vtable_types_for_unsizing: invalid coercion {:?} -> {:?}",
887 fn create_fn_mono_item(instance: Instance<'_>) -> MonoItem<'_> {
888 debug!("create_fn_mono_item(instance={})", instance);
889 MonoItem::Fn(instance)
892 /// Creates a `MonoItem` for each method that is referenced by the vtable for
893 /// the given trait/impl pair.
894 fn create_mono_items_for_vtable_methods<'tcx>(
898 output: &mut Vec<MonoItem<'tcx>>,
901 !trait_ty.needs_subst()
902 && !trait_ty.has_escaping_bound_vars()
903 && !impl_ty.needs_subst()
904 && !impl_ty.has_escaping_bound_vars()
907 if let ty::Dynamic(ref trait_ty, ..) = trait_ty.kind {
908 if let Some(principal) = trait_ty.principal() {
909 let poly_trait_ref = principal.with_self_ty(tcx, impl_ty);
910 assert!(!poly_trait_ref.has_escaping_bound_vars());
912 // Walk all methods of the trait, including those of its supertraits
913 let methods = tcx.vtable_methods(poly_trait_ref);
914 let methods = methods
917 .filter_map(|method| method)
918 .map(|(def_id, substs)| {
919 ty::Instance::resolve_for_vtable(
921 ty::ParamEnv::reveal_all(),
927 .filter(|&instance| should_monomorphize_locally(tcx, &instance))
928 .map(|instance| create_fn_mono_item(instance));
929 output.extend(methods);
932 // Also add the destructor.
933 visit_drop_use(tcx, impl_ty, false, output);
937 //=-----------------------------------------------------------------------------
939 //=-----------------------------------------------------------------------------
941 struct RootCollector<'a, 'tcx> {
943 mode: MonoItemCollectionMode,
944 output: &'a mut Vec<MonoItem<'tcx>>,
945 entry_fn: Option<(DefId, EntryFnType)>,
948 impl ItemLikeVisitor<'v> for RootCollector<'_, 'v> {
949 fn visit_item(&mut self, item: &'v hir::Item<'v>) {
951 hir::ItemKind::ExternCrate(..)
952 | hir::ItemKind::Use(..)
953 | hir::ItemKind::ForeignMod(..)
954 | hir::ItemKind::TyAlias(..)
955 | hir::ItemKind::Trait(..)
956 | hir::ItemKind::TraitAlias(..)
957 | hir::ItemKind::OpaqueTy(..)
958 | hir::ItemKind::Mod(..) => {
959 // Nothing to do, just keep recursing.
962 hir::ItemKind::Impl(..) => {
963 if self.mode == MonoItemCollectionMode::Eager {
964 create_mono_items_for_default_impls(self.tcx, item, self.output);
968 hir::ItemKind::Enum(_, ref generics)
969 | hir::ItemKind::Struct(_, ref generics)
970 | hir::ItemKind::Union(_, ref generics) => {
971 if generics.params.is_empty() {
972 if self.mode == MonoItemCollectionMode::Eager {
973 let def_id = self.tcx.hir().local_def_id(item.hir_id);
975 "RootCollector: ADT drop-glue for {}",
976 def_id_to_string(self.tcx, def_id)
980 Instance::new(def_id, InternalSubsts::empty()).monomorphic_ty(self.tcx);
981 visit_drop_use(self.tcx, ty, true, self.output);
985 hir::ItemKind::GlobalAsm(..) => {
987 "RootCollector: ItemKind::GlobalAsm({})",
988 def_id_to_string(self.tcx, self.tcx.hir().local_def_id(item.hir_id))
990 self.output.push(MonoItem::GlobalAsm(item.hir_id));
992 hir::ItemKind::Static(..) => {
993 let def_id = self.tcx.hir().local_def_id(item.hir_id);
994 debug!("RootCollector: ItemKind::Static({})", def_id_to_string(self.tcx, def_id));
995 self.output.push(MonoItem::Static(def_id));
997 hir::ItemKind::Const(..) => {
998 // const items only generate mono items if they are
999 // actually used somewhere. Just declaring them is insufficient.
1001 // but even just declaring them must collect the items they refer to
1002 let def_id = self.tcx.hir().local_def_id(item.hir_id);
1004 if let Ok(val) = self.tcx.const_eval_poly(def_id) {
1005 collect_const(self.tcx, val, InternalSubsts::empty(), &mut self.output);
1008 hir::ItemKind::Fn(..) => {
1009 let def_id = self.tcx.hir().local_def_id(item.hir_id);
1010 self.push_if_root(def_id);
1015 fn visit_trait_item(&mut self, _: &'v hir::TraitItem<'v>) {
1016 // Even if there's a default body with no explicit generics,
1017 // it's still generic over some `Self: Trait`, so not a root.
1020 fn visit_impl_item(&mut self, ii: &'v hir::ImplItem<'v>) {
1022 hir::ImplItemKind::Method(hir::FnSig { .. }, _) => {
1023 let def_id = self.tcx.hir().local_def_id(ii.hir_id);
1024 self.push_if_root(def_id);
1026 _ => { /* nothing to do here */ }
1031 impl RootCollector<'_, 'v> {
1032 fn is_root(&self, def_id: DefId) -> bool {
1033 !item_requires_monomorphization(self.tcx, def_id)
1034 && match self.mode {
1035 MonoItemCollectionMode::Eager => true,
1036 MonoItemCollectionMode::Lazy => {
1037 self.entry_fn.map(|(id, _)| id) == Some(def_id)
1038 || self.tcx.is_reachable_non_generic(def_id)
1041 .codegen_fn_attrs(def_id)
1043 .contains(CodegenFnAttrFlags::RUSTC_STD_INTERNAL_SYMBOL)
1048 /// If `def_id` represents a root, pushes it onto the list of
1049 /// outputs. (Note that all roots must be monomorphic.)
1050 fn push_if_root(&mut self, def_id: DefId) {
1051 if self.is_root(def_id) {
1052 debug!("RootCollector::push_if_root: found root def_id={:?}", def_id);
1054 let instance = Instance::mono(self.tcx, def_id);
1055 self.output.push(create_fn_mono_item(instance));
1059 /// As a special case, when/if we encounter the
1060 /// `main()` function, we also have to generate a
1061 /// monomorphized copy of the start lang item based on
1062 /// the return type of `main`. This is not needed when
1063 /// the user writes their own `start` manually.
1064 fn push_extra_entry_roots(&mut self) {
1065 let main_def_id = match self.entry_fn {
1066 Some((def_id, EntryFnType::Main)) => def_id,
1070 let start_def_id = match self.tcx.lang_items().require(StartFnLangItem) {
1072 Err(err) => self.tcx.sess.fatal(&err),
1074 let main_ret_ty = self.tcx.fn_sig(main_def_id).output();
1076 // Given that `main()` has no arguments,
1077 // then its return type cannot have
1078 // late-bound regions, since late-bound
1079 // regions must appear in the argument
1081 let main_ret_ty = self.tcx.erase_regions(&main_ret_ty.no_bound_vars().unwrap());
1083 let start_instance = Instance::resolve(
1085 ty::ParamEnv::reveal_all(),
1087 self.tcx.intern_substs(&[main_ret_ty.into()]),
1091 self.output.push(create_fn_mono_item(start_instance));
1095 fn item_requires_monomorphization(tcx: TyCtxt<'_>, def_id: DefId) -> bool {
1096 let generics = tcx.generics_of(def_id);
1097 generics.requires_monomorphization(tcx)
1100 fn create_mono_items_for_default_impls<'tcx>(
1102 item: &'tcx hir::Item<'tcx>,
1103 output: &mut Vec<MonoItem<'tcx>>,
1106 hir::ItemKind::Impl(_, _, _, ref generics, .., ref impl_item_refs) => {
1107 for param in generics.params {
1109 hir::GenericParamKind::Lifetime { .. } => {}
1110 hir::GenericParamKind::Type { .. } | hir::GenericParamKind::Const { .. } => {
1116 let impl_def_id = tcx.hir().local_def_id(item.hir_id);
1119 "create_mono_items_for_default_impls(item={})",
1120 def_id_to_string(tcx, impl_def_id)
1123 if let Some(trait_ref) = tcx.impl_trait_ref(impl_def_id) {
1124 let param_env = ty::ParamEnv::reveal_all();
1125 let trait_ref = tcx.normalize_erasing_regions(param_env, trait_ref);
1126 let overridden_methods: FxHashSet<_> =
1127 impl_item_refs.iter().map(|iiref| iiref.ident.modern()).collect();
1128 for method in tcx.provided_trait_methods(trait_ref.def_id) {
1129 if overridden_methods.contains(&method.ident.modern()) {
1133 if tcx.generics_of(method.def_id).own_requires_monomorphization() {
1138 InternalSubsts::for_item(tcx, method.def_id, |param, _| match param.kind {
1139 GenericParamDefKind::Lifetime => tcx.lifetimes.re_erased.into(),
1140 GenericParamDefKind::Type { .. } | GenericParamDefKind::Const => {
1141 trait_ref.substs[param.index as usize]
1145 ty::Instance::resolve(tcx, param_env, method.def_id, substs).unwrap();
1147 let mono_item = create_fn_mono_item(instance);
1148 if mono_item.is_instantiable(tcx) && should_monomorphize_locally(tcx, &instance)
1150 output.push(mono_item);
1159 /// Scans the miri alloc in order to find function calls, closures, and drop-glue.
1160 fn collect_miri<'tcx>(tcx: TyCtxt<'tcx>, alloc_id: AllocId, output: &mut Vec<MonoItem<'tcx>>) {
1161 let alloc_kind = tcx.alloc_map.lock().get(alloc_id);
1163 Some(GlobalAlloc::Static(def_id)) => {
1164 let instance = Instance::mono(tcx, def_id);
1165 if should_monomorphize_locally(tcx, &instance) {
1166 trace!("collecting static {:?}", def_id);
1167 output.push(MonoItem::Static(def_id));
1170 Some(GlobalAlloc::Memory(alloc)) => {
1171 trace!("collecting {:?} with {:#?}", alloc_id, alloc);
1172 for &((), inner) in alloc.relocations().values() {
1173 collect_miri(tcx, inner, output);
1176 Some(GlobalAlloc::Function(fn_instance)) => {
1177 if should_monomorphize_locally(tcx, &fn_instance) {
1178 trace!("collecting {:?} with {:#?}", alloc_id, fn_instance);
1179 output.push(create_fn_mono_item(fn_instance));
1182 None => bug!("alloc id without corresponding allocation: {}", alloc_id),
1186 /// Scans the MIR in order to find function calls, closures, and drop-glue.
1187 fn collect_neighbours<'tcx>(
1189 instance: Instance<'tcx>,
1190 output: &mut Vec<MonoItem<'tcx>>,
1192 debug!("collect_neighbours: {:?}", instance.def_id());
1193 let body = tcx.instance_mir(instance.def);
1195 MirNeighborCollector { tcx, body: &body, output, param_substs: instance.substs }
1199 fn def_id_to_string(tcx: TyCtxt<'_>, def_id: DefId) -> String {
1200 let mut output = String::new();
1201 let printer = DefPathBasedNames::new(tcx, false, false);
1202 printer.push_def_path(def_id, &mut output);
1206 fn collect_const<'tcx>(
1208 constant: &'tcx ty::Const<'tcx>,
1209 param_substs: SubstsRef<'tcx>,
1210 output: &mut Vec<MonoItem<'tcx>>,
1212 debug!("visiting const {:?}", constant);
1214 let param_env = ty::ParamEnv::reveal_all();
1215 let substituted_constant =
1216 tcx.subst_and_normalize_erasing_regions(param_substs, param_env, &constant);
1218 match substituted_constant.val {
1219 ty::ConstKind::Value(ConstValue::Scalar(Scalar::Ptr(ptr))) => {
1220 collect_miri(tcx, ptr.alloc_id, output)
1222 ty::ConstKind::Value(ConstValue::Slice { data: alloc, start: _, end: _ })
1223 | ty::ConstKind::Value(ConstValue::ByRef { alloc, .. }) => {
1224 for &((), id) in alloc.relocations().values() {
1225 collect_miri(tcx, id, output);
1228 ty::ConstKind::Unevaluated(def_id, substs, promoted) => {
1229 match tcx.const_eval_resolve(param_env, def_id, substs, promoted, None) {
1230 Ok(val) => collect_const(tcx, val, param_substs, output),
1231 Err(ErrorHandled::Reported) => {}
1232 Err(ErrorHandled::TooGeneric) => {
1233 span_bug!(tcx.def_span(def_id), "collection encountered polymorphic constant",)