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 rustc::hir::{self, CodegenFnAttrFlags};
178 use rustc::hir::itemlikevisit::ItemLikeVisitor;
180 use rustc::hir::def_id::{DefId, LOCAL_CRATE};
181 use rustc::mir::interpret::{AllocId, ConstValue};
182 use rustc::middle::lang_items::{ExchangeMallocFnLangItem, StartFnLangItem};
183 use rustc::ty::subst::{InternalSubsts, SubstsRef};
184 use rustc::ty::{self, TypeFoldable, Ty, TyCtxt, GenericParamDefKind};
185 use rustc::ty::adjustment::{CustomCoerceUnsized, PointerCast};
186 use rustc::session::config::EntryFnType;
187 use rustc::mir::{self, Location, Place, PlaceBase, Promoted, Static, StaticKind};
188 use rustc::mir::visit::Visitor as MirVisitor;
189 use rustc::mir::mono::MonoItem;
190 use rustc::mir::interpret::{Scalar, GlobalId, AllocKind, ErrorHandled};
192 use crate::monomorphize::{self, Instance};
193 use rustc::util::nodemap::{FxHashSet, FxHashMap, DefIdMap};
194 use rustc::util::common::time;
196 use crate::monomorphize::item::{MonoItemExt, DefPathBasedNames, InstantiationMode};
198 use rustc_data_structures::bit_set::GrowableBitSet;
199 use rustc_data_structures::sync::{MTRef, MTLock, ParallelIterator, par_iter};
203 #[derive(PartialEq, Eq, Hash, Clone, Copy, Debug)]
204 pub enum MonoItemCollectionMode {
209 /// Maps every mono item to all mono items it references in its
211 pub struct InliningMap<'tcx> {
212 // Maps a source mono item to the range of mono items
214 // The two numbers in the tuple are the start (inclusive) and
215 // end index (exclusive) within the `targets` vecs.
216 index: FxHashMap<MonoItem<'tcx>, (usize, usize)>,
217 targets: Vec<MonoItem<'tcx>>,
219 // Contains one bit per mono item in the `targets` field. That bit
220 // is true if that mono item needs to be inlined into every CGU.
221 inlines: GrowableBitSet<usize>,
224 impl<'tcx> InliningMap<'tcx> {
226 fn new() -> InliningMap<'tcx> {
228 index: FxHashMap::default(),
230 inlines: GrowableBitSet::with_capacity(1024),
234 fn record_accesses<I>(&mut self,
235 source: MonoItem<'tcx>,
237 where I: Iterator<Item=(MonoItem<'tcx>, bool)> + ExactSizeIterator
239 assert!(!self.index.contains_key(&source));
241 let start_index = self.targets.len();
242 let new_items_count = new_targets.len();
243 let new_items_count_total = new_items_count + self.targets.len();
245 self.targets.reserve(new_items_count);
246 self.inlines.ensure(new_items_count_total);
248 for (i, (target, inline)) in new_targets.enumerate() {
249 self.targets.push(target);
251 self.inlines.insert(i + start_index);
255 let end_index = self.targets.len();
256 self.index.insert(source, (start_index, end_index));
259 // Internally iterate over all items referenced by `source` which will be
260 // made available for inlining.
261 pub fn with_inlining_candidates<F>(&self, source: MonoItem<'tcx>, mut f: F)
262 where F: FnMut(MonoItem<'tcx>)
264 if let Some(&(start_index, end_index)) = self.index.get(&source) {
265 for (i, candidate) in self.targets[start_index .. end_index]
268 if self.inlines.contains(start_index + i) {
275 // Internally iterate over all items and the things each accesses.
276 pub fn iter_accesses<F>(&self, mut f: F)
277 where F: FnMut(MonoItem<'tcx>, &[MonoItem<'tcx>])
279 for (&accessor, &(start_index, end_index)) in &self.index {
280 f(accessor, &self.targets[start_index .. end_index])
285 pub fn collect_crate_mono_items<'a, 'tcx>(tcx: TyCtxt<'a, 'tcx, 'tcx>,
286 mode: MonoItemCollectionMode)
287 -> (FxHashSet<MonoItem<'tcx>>,
289 let roots = time(tcx.sess, "collecting roots", || {
290 collect_roots(tcx, mode)
293 debug!("Building mono item graph, beginning at roots");
295 let mut visited = MTLock::new(FxHashSet::default());
296 let mut inlining_map = MTLock::new(InliningMap::new());
299 let visited: MTRef<'_, _> = &mut visited;
300 let inlining_map: MTRef<'_, _> = &mut inlining_map;
302 time(tcx.sess, "collecting mono items", || {
303 par_iter(roots).for_each(|root| {
304 let mut recursion_depths = DefIdMap::default();
305 collect_items_rec(tcx,
308 &mut recursion_depths,
314 (visited.into_inner(), inlining_map.into_inner())
317 // Find all non-generic items by walking the HIR. These items serve as roots to
318 // start monomorphizing from.
319 fn collect_roots<'a, 'tcx>(tcx: TyCtxt<'a, 'tcx, 'tcx>,
320 mode: MonoItemCollectionMode)
321 -> Vec<MonoItem<'tcx>> {
322 debug!("Collecting roots");
323 let mut roots = Vec::new();
326 let entry_fn = tcx.entry_fn(LOCAL_CRATE);
328 debug!("collect_roots: entry_fn = {:?}", entry_fn);
330 let mut visitor = RootCollector {
337 tcx.hir().krate().visit_all_item_likes(&mut visitor);
339 visitor.push_extra_entry_roots();
342 // We can only codegen items that are instantiable - items all of
343 // whose predicates hold. Luckily, items that aren't instantiable
344 // can't actually be used, so we can just skip codegenning them.
345 roots.retain(|root| root.is_instantiable(tcx));
350 // Collect all monomorphized items reachable from `starting_point`
351 fn collect_items_rec<'a, 'tcx: 'a>(tcx: TyCtxt<'a, 'tcx, 'tcx>,
352 starting_point: MonoItem<'tcx>,
353 visited: MTRef<'_, MTLock<FxHashSet<MonoItem<'tcx>>>>,
354 recursion_depths: &mut DefIdMap<usize>,
355 inlining_map: MTRef<'_, MTLock<InliningMap<'tcx>>>) {
356 if !visited.lock_mut().insert(starting_point.clone()) {
357 // We've been here already, no need to search again.
360 debug!("BEGIN collect_items_rec({})", starting_point.to_string(tcx, true));
362 let mut neighbors = Vec::new();
363 let recursion_depth_reset;
365 match starting_point {
366 MonoItem::Static(def_id) => {
367 let instance = Instance::mono(tcx, def_id);
369 // Sanity check whether this ended up being collected accidentally
370 debug_assert!(should_monomorphize_locally(tcx, &instance));
372 let ty = instance.ty(tcx);
373 visit_drop_use(tcx, ty, true, &mut neighbors);
375 recursion_depth_reset = None;
381 let param_env = ty::ParamEnv::reveal_all();
383 if let Ok(val) = tcx.const_eval(param_env.and(cid)) {
384 collect_const(tcx, val, InternalSubsts::empty(), &mut neighbors);
387 MonoItem::Fn(instance) => {
388 // Sanity check whether this ended up being collected accidentally
389 debug_assert!(should_monomorphize_locally(tcx, &instance));
391 // Keep track of the monomorphization recursion depth
392 recursion_depth_reset = Some(check_recursion_limit(tcx,
395 check_type_length_limit(tcx, instance);
397 collect_neighbours(tcx, instance, &mut neighbors);
399 MonoItem::GlobalAsm(..) => {
400 recursion_depth_reset = None;
404 record_accesses(tcx, starting_point, &neighbors[..], inlining_map);
406 for neighbour in neighbors {
407 collect_items_rec(tcx, neighbour, visited, recursion_depths, inlining_map);
410 if let Some((def_id, depth)) = recursion_depth_reset {
411 recursion_depths.insert(def_id, depth);
414 debug!("END collect_items_rec({})", starting_point.to_string(tcx, true));
417 fn record_accesses<'a, 'tcx>(tcx: TyCtxt<'a, 'tcx, 'tcx>,
418 caller: MonoItem<'tcx>,
419 callees: &[MonoItem<'tcx>],
420 inlining_map: MTRef<'_, MTLock<InliningMap<'tcx>>>) {
421 let is_inlining_candidate = |mono_item: &MonoItem<'tcx>| {
422 mono_item.instantiation_mode(tcx) == InstantiationMode::LocalCopy
425 let accesses = callees.into_iter()
427 (*mono_item, is_inlining_candidate(mono_item))
430 inlining_map.lock_mut().record_accesses(caller, accesses);
433 fn check_recursion_limit<'a, 'tcx>(tcx: TyCtxt<'a, 'tcx, 'tcx>,
434 instance: Instance<'tcx>,
435 recursion_depths: &mut DefIdMap<usize>)
437 let def_id = instance.def_id();
438 let recursion_depth = recursion_depths.get(&def_id).cloned().unwrap_or(0);
439 debug!(" => recursion depth={}", recursion_depth);
441 let recursion_depth = if Some(def_id) == tcx.lang_items().drop_in_place_fn() {
442 // HACK: drop_in_place creates tight monomorphization loops. Give
449 // Code that needs to instantiate the same function recursively
450 // more than the recursion limit is assumed to be causing an
451 // infinite expansion.
452 if recursion_depth > *tcx.sess.recursion_limit.get() {
453 let error = format!("reached the recursion limit while instantiating `{}`",
455 if let Some(hir_id) = tcx.hir().as_local_hir_id(def_id) {
456 tcx.sess.span_fatal(tcx.hir().span_by_hir_id(hir_id), &error);
458 tcx.sess.fatal(&error);
462 recursion_depths.insert(def_id, recursion_depth + 1);
464 (def_id, recursion_depth)
467 fn check_type_length_limit<'a, 'tcx>(tcx: TyCtxt<'a, 'tcx, 'tcx>,
468 instance: Instance<'tcx>)
470 let type_length = instance.substs.types().flat_map(|ty| ty.walk()).count();
471 let const_length = instance.substs.consts().flat_map(|ct| ct.ty.walk()).count();
472 debug!(" => type length={}, const length={}", type_length, const_length);
474 // Rust code can easily create exponentially-long types using only a
475 // polynomial recursion depth. Even with the default recursion
476 // depth, you can easily get cases that take >2^60 steps to run,
477 // which means that rustc basically hangs.
479 // Bail out in these cases to avoid that bad user experience.
480 let type_length_limit = *tcx.sess.type_length_limit.get();
481 // We include the const length in the type length, as it's better
482 // to be overly conservative.
483 // FIXME(const_generics): we should instead uniformly walk through `substs`,
484 // ignoring lifetimes.
485 if type_length + const_length > type_length_limit {
486 // The instance name is already known to be too long for rustc.
487 // Show only the first and last 32 characters to avoid blasting
488 // the user's terminal with thousands of lines of type-name.
489 let shrink = |s: String, before: usize, after: usize| {
490 // An iterator of all byte positions including the end of the string.
491 let positions = || s.char_indices().map(|(i, _)| i).chain(iter::once(s.len()));
493 let shrunk = format!(
494 "{before}...{after}",
495 before = &s[..positions().nth(before).unwrap_or(s.len())],
496 after = &s[positions().rev().nth(after).unwrap_or(0)..],
499 // Only use the shrunk version if it's really shorter.
500 // This also avoids the case where before and after slices overlap.
501 if shrunk.len() < s.len() {
507 let msg = format!("reached the type-length limit while instantiating `{}`",
508 shrink(instance.to_string(), 32, 32));
509 let mut diag = tcx.sess.struct_span_fatal(tcx.def_span(instance.def_id()), &msg);
511 "consider adding a `#![type_length_limit=\"{}\"]` attribute to your crate",
514 tcx.sess.abort_if_errors();
518 struct MirNeighborCollector<'a, 'tcx: 'a> {
519 tcx: TyCtxt<'a, 'tcx, 'tcx>,
520 mir: &'a mir::Body<'tcx>,
521 output: &'a mut Vec<MonoItem<'tcx>>,
522 param_substs: SubstsRef<'tcx>,
525 impl<'a, 'tcx> MirVisitor<'tcx> for MirNeighborCollector<'a, 'tcx> {
527 fn visit_rvalue(&mut self, rvalue: &mir::Rvalue<'tcx>, location: Location) {
528 debug!("visiting rvalue {:?}", *rvalue);
531 // When doing an cast from a regular pointer to a fat pointer, we
532 // have to instantiate all methods of the trait being cast to, so we
533 // can build the appropriate vtable.
535 mir::CastKind::Pointer(PointerCast::Unsize), ref operand, target_ty
537 let target_ty = self.tcx.subst_and_normalize_erasing_regions(
539 ty::ParamEnv::reveal_all(),
542 let source_ty = operand.ty(self.mir, self.tcx);
543 let source_ty = self.tcx.subst_and_normalize_erasing_regions(
545 ty::ParamEnv::reveal_all(),
548 let (source_ty, target_ty) = find_vtable_types_for_unsizing(self.tcx,
551 // This could also be a different Unsize instruction, like
552 // from a fixed sized array to a slice. But we are only
553 // interested in things that produce a vtable.
554 if target_ty.is_trait() && !source_ty.is_trait() {
555 create_mono_items_for_vtable_methods(self.tcx,
562 mir::CastKind::Pointer(PointerCast::ReifyFnPointer), ref operand, _
564 let fn_ty = operand.ty(self.mir, self.tcx);
565 let fn_ty = self.tcx.subst_and_normalize_erasing_regions(
567 ty::ParamEnv::reveal_all(),
570 visit_fn_use(self.tcx, fn_ty, false, &mut self.output);
573 mir::CastKind::Pointer(PointerCast::ClosureFnPointer(_)), ref operand, _
575 let source_ty = operand.ty(self.mir, self.tcx);
576 let source_ty = self.tcx.subst_and_normalize_erasing_regions(
578 ty::ParamEnv::reveal_all(),
581 match source_ty.sty {
582 ty::Closure(def_id, substs) => {
583 let instance = monomorphize::resolve_closure(
584 self.tcx, def_id, substs, ty::ClosureKind::FnOnce);
585 if should_monomorphize_locally(self.tcx, &instance) {
586 self.output.push(create_fn_mono_item(instance));
592 mir::Rvalue::NullaryOp(mir::NullOp::Box, _) => {
594 let exchange_malloc_fn_def_id = tcx
596 .require(ExchangeMallocFnLangItem)
597 .unwrap_or_else(|e| tcx.sess.fatal(&e));
598 let instance = Instance::mono(tcx, exchange_malloc_fn_def_id);
599 if should_monomorphize_locally(tcx, &instance) {
600 self.output.push(create_fn_mono_item(instance));
603 _ => { /* not interesting */ }
606 self.super_rvalue(rvalue, location);
609 fn visit_const(&mut self, constant: &&'tcx ty::Const<'tcx>, location: Location) {
610 debug!("visiting const {:?} @ {:?}", *constant, location);
612 collect_const(self.tcx, *constant, self.param_substs, self.output);
614 self.super_const(constant);
617 fn visit_terminator_kind(&mut self,
618 kind: &mir::TerminatorKind<'tcx>,
619 location: Location) {
620 debug!("visiting terminator {:?} @ {:?}", kind, location);
624 mir::TerminatorKind::Call { ref func, .. } => {
625 let callee_ty = func.ty(self.mir, tcx);
626 let callee_ty = tcx.subst_and_normalize_erasing_regions(
628 ty::ParamEnv::reveal_all(),
631 visit_fn_use(self.tcx, callee_ty, true, &mut self.output);
633 mir::TerminatorKind::Drop { ref location, .. } |
634 mir::TerminatorKind::DropAndReplace { ref location, .. } => {
635 let ty = location.ty(self.mir, self.tcx).ty;
636 let ty = tcx.subst_and_normalize_erasing_regions(
638 ty::ParamEnv::reveal_all(),
641 visit_drop_use(self.tcx, ty, true, self.output);
643 mir::TerminatorKind::Goto { .. } |
644 mir::TerminatorKind::SwitchInt { .. } |
645 mir::TerminatorKind::Resume |
646 mir::TerminatorKind::Abort |
647 mir::TerminatorKind::Return |
648 mir::TerminatorKind::Unreachable |
649 mir::TerminatorKind::Assert { .. } => {}
650 mir::TerminatorKind::GeneratorDrop |
651 mir::TerminatorKind::Yield { .. } |
652 mir::TerminatorKind::FalseEdges { .. } |
653 mir::TerminatorKind::FalseUnwind { .. } => bug!(),
656 self.super_terminator_kind(kind, location);
659 fn visit_place(&mut self,
660 place: &mir::Place<'tcx>,
661 context: mir::visit::PlaceContext,
662 location: Location) {
665 PlaceBase::Static(box Static{ kind:StaticKind::Static(def_id), .. })
667 debug!("visiting static {:?} @ {:?}", def_id, location);
670 let instance = Instance::mono(tcx, *def_id);
671 if should_monomorphize_locally(tcx, &instance) {
672 self.output.push(MonoItem::Static(*def_id));
678 self.super_place(place, context, location);
682 fn visit_drop_use<'a, 'tcx>(tcx: TyCtxt<'a, 'tcx, 'tcx>,
684 is_direct_call: bool,
685 output: &mut Vec<MonoItem<'tcx>>)
687 let instance = monomorphize::resolve_drop_in_place(tcx, ty);
688 visit_instance_use(tcx, instance, is_direct_call, output);
691 fn visit_fn_use<'a, 'tcx>(tcx: TyCtxt<'a, 'tcx, 'tcx>,
693 is_direct_call: bool,
694 output: &mut Vec<MonoItem<'tcx>>)
696 if let ty::FnDef(def_id, substs) = ty.sty {
697 let instance = ty::Instance::resolve(tcx,
698 ty::ParamEnv::reveal_all(),
701 visit_instance_use(tcx, instance, is_direct_call, output);
705 fn visit_instance_use<'a, 'tcx>(tcx: TyCtxt<'a, 'tcx, 'tcx>,
706 instance: ty::Instance<'tcx>,
707 is_direct_call: bool,
708 output: &mut Vec<MonoItem<'tcx>>)
710 debug!("visit_item_use({:?}, is_direct_call={:?})", instance, is_direct_call);
711 if !should_monomorphize_locally(tcx, &instance) {
716 ty::InstanceDef::Intrinsic(def_id) => {
718 bug!("intrinsic {:?} being reified", def_id);
721 ty::InstanceDef::VtableShim(..) |
722 ty::InstanceDef::Virtual(..) |
723 ty::InstanceDef::DropGlue(_, None) => {
724 // don't need to emit shim if we are calling directly.
726 output.push(create_fn_mono_item(instance));
729 ty::InstanceDef::DropGlue(_, Some(_)) => {
730 output.push(create_fn_mono_item(instance));
732 ty::InstanceDef::ClosureOnceShim { .. } |
733 ty::InstanceDef::Item(..) |
734 ty::InstanceDef::FnPtrShim(..) |
735 ty::InstanceDef::CloneShim(..) => {
736 output.push(create_fn_mono_item(instance));
741 // Returns true if we should codegen an instance in the local crate.
742 // Returns false if we can just link to the upstream crate and therefore don't
744 fn should_monomorphize_locally<'a, 'tcx>(tcx: TyCtxt<'a, 'tcx, 'tcx>, instance: &Instance<'tcx>)
746 let def_id = match instance.def {
747 ty::InstanceDef::Item(def_id) => def_id,
748 ty::InstanceDef::VtableShim(..) |
749 ty::InstanceDef::ClosureOnceShim { .. } |
750 ty::InstanceDef::Virtual(..) |
751 ty::InstanceDef::FnPtrShim(..) |
752 ty::InstanceDef::DropGlue(..) |
753 ty::InstanceDef::Intrinsic(_) |
754 ty::InstanceDef::CloneShim(..) => return true
757 if tcx.is_foreign_item(def_id) {
758 // We can always link to foreign items
762 if def_id.is_local() {
763 // local items cannot be referred to locally without monomorphizing them locally
767 if tcx.is_reachable_non_generic(def_id) ||
768 is_available_upstream_generic(tcx, def_id, instance.substs) {
769 // We can link to the item in question, no instance needed
774 if !tcx.is_mir_available(def_id) {
775 bug!("Cannot create local mono-item for {:?}", def_id)
779 fn is_available_upstream_generic<'a, 'tcx>(tcx: TyCtxt<'a, 'tcx, 'tcx>,
781 substs: SubstsRef<'tcx>)
783 debug_assert!(!def_id.is_local());
785 // If we are not in share generics mode, we don't link to upstream
786 // monomorphizations but always instantiate our own internal versions
788 if !tcx.sess.opts.share_generics() {
792 // If this instance has non-erasable parameters, it cannot be a shared
793 // monomorphization. Non-generic instances are already handled above
794 // by `is_reachable_non_generic()`
795 if substs.non_erasable_generics().next().is_none() {
799 // Take a look at the available monomorphizations listed in the metadata
800 // of upstream crates.
801 tcx.upstream_monomorphizations_for(def_id)
802 .map(|set| set.contains_key(substs))
807 /// For given pair of source and target type that occur in an unsizing coercion,
808 /// this function finds the pair of types that determines the vtable linking
811 /// For example, the source type might be `&SomeStruct` and the target type\
812 /// might be `&SomeTrait` in a cast like:
814 /// let src: &SomeStruct = ...;
815 /// let target = src as &SomeTrait;
817 /// Then the output of this function would be (SomeStruct, SomeTrait) since for
818 /// constructing the `target` fat-pointer we need the vtable for that pair.
820 /// Things can get more complicated though because there's also the case where
821 /// the unsized type occurs as a field:
824 /// struct ComplexStruct<T: ?Sized> {
831 /// In this case, if `T` is sized, `&ComplexStruct<T>` is a thin pointer. If `T`
832 /// is unsized, `&SomeStruct` is a fat pointer, and the vtable it points to is
833 /// for the pair of `T` (which is a trait) and the concrete type that `T` was
834 /// originally coerced from:
836 /// let src: &ComplexStruct<SomeStruct> = ...;
837 /// let target = src as &ComplexStruct<SomeTrait>;
839 /// Again, we want this `find_vtable_types_for_unsizing()` to provide the pair
840 /// `(SomeStruct, SomeTrait)`.
842 /// Finally, there is also the case of custom unsizing coercions, e.g., for
843 /// smart pointers such as `Rc` and `Arc`.
844 fn find_vtable_types_for_unsizing<'a, 'tcx>(tcx: TyCtxt<'a, 'tcx, 'tcx>,
847 -> (Ty<'tcx>, Ty<'tcx>) {
848 let ptr_vtable = |inner_source: Ty<'tcx>, inner_target: Ty<'tcx>| {
849 let type_has_metadata = |ty: Ty<'tcx>| -> bool {
850 use syntax_pos::DUMMY_SP;
851 if ty.is_sized(tcx.at(DUMMY_SP), ty::ParamEnv::reveal_all()) {
854 let tail = tcx.struct_tail(ty);
856 ty::Foreign(..) => false,
857 ty::Str | ty::Slice(..) | ty::Dynamic(..) => true,
858 _ => bug!("unexpected unsized tail: {:?}", tail),
861 if type_has_metadata(inner_source) {
862 (inner_source, inner_target)
864 tcx.struct_lockstep_tails(inner_source, inner_target)
868 match (&source_ty.sty, &target_ty.sty) {
872 &ty::RawPtr(ty::TypeAndMut { ty: b, .. })) |
873 (&ty::RawPtr(ty::TypeAndMut { ty: a, .. }),
874 &ty::RawPtr(ty::TypeAndMut { ty: b, .. })) => {
877 (&ty::Adt(def_a, _), &ty::Adt(def_b, _)) if def_a.is_box() && def_b.is_box() => {
878 ptr_vtable(source_ty.boxed_ty(), target_ty.boxed_ty())
881 (&ty::Adt(source_adt_def, source_substs),
882 &ty::Adt(target_adt_def, target_substs)) => {
883 assert_eq!(source_adt_def, target_adt_def);
886 monomorphize::custom_coerce_unsize_info(tcx, source_ty, target_ty);
888 let coerce_index = match kind {
889 CustomCoerceUnsized::Struct(i) => i
892 let source_fields = &source_adt_def.non_enum_variant().fields;
893 let target_fields = &target_adt_def.non_enum_variant().fields;
895 assert!(coerce_index < source_fields.len() &&
896 source_fields.len() == target_fields.len());
898 find_vtable_types_for_unsizing(tcx,
899 source_fields[coerce_index].ty(tcx,
901 target_fields[coerce_index].ty(tcx,
904 _ => bug!("find_vtable_types_for_unsizing: invalid coercion {:?} -> {:?}",
910 fn create_fn_mono_item<'a, 'tcx>(instance: Instance<'tcx>) -> MonoItem<'tcx> {
911 debug!("create_fn_mono_item(instance={})", instance);
912 MonoItem::Fn(instance)
915 /// Creates a `MonoItem` for each method that is referenced by the vtable for
916 /// the given trait/impl pair.
917 fn create_mono_items_for_vtable_methods<'a, 'tcx>(tcx: TyCtxt<'a, 'tcx, 'tcx>,
920 output: &mut Vec<MonoItem<'tcx>>) {
921 assert!(!trait_ty.needs_subst() && !trait_ty.has_escaping_bound_vars() &&
922 !impl_ty.needs_subst() && !impl_ty.has_escaping_bound_vars());
924 if let ty::Dynamic(ref trait_ty, ..) = trait_ty.sty {
925 if let Some(principal) = trait_ty.principal() {
926 let poly_trait_ref = principal.with_self_ty(tcx, impl_ty);
927 assert!(!poly_trait_ref.has_escaping_bound_vars());
929 // Walk all methods of the trait, including those of its supertraits
930 let methods = tcx.vtable_methods(poly_trait_ref);
931 let methods = methods.iter().cloned().filter_map(|method| method)
932 .map(|(def_id, substs)| ty::Instance::resolve_for_vtable(
934 ty::ParamEnv::reveal_all(),
937 .filter(|&instance| should_monomorphize_locally(tcx, &instance))
938 .map(|instance| create_fn_mono_item(instance));
939 output.extend(methods);
942 // Also add the destructor
943 visit_drop_use(tcx, impl_ty, false, output);
947 //=-----------------------------------------------------------------------------
949 //=-----------------------------------------------------------------------------
951 struct RootCollector<'b, 'a: 'b, 'tcx: 'a + 'b> {
952 tcx: TyCtxt<'a, 'tcx, 'tcx>,
953 mode: MonoItemCollectionMode,
954 output: &'b mut Vec<MonoItem<'tcx>>,
955 entry_fn: Option<(DefId, EntryFnType)>,
958 impl<'b, 'a, 'v> ItemLikeVisitor<'v> for RootCollector<'b, 'a, 'v> {
959 fn visit_item(&mut self, item: &'v hir::Item) {
961 hir::ItemKind::ExternCrate(..) |
962 hir::ItemKind::Use(..) |
963 hir::ItemKind::ForeignMod(..) |
964 hir::ItemKind::Ty(..) |
965 hir::ItemKind::Trait(..) |
966 hir::ItemKind::TraitAlias(..) |
967 hir::ItemKind::Existential(..) |
968 hir::ItemKind::Mod(..) => {
969 // Nothing to do, just keep recursing...
972 hir::ItemKind::Impl(..) => {
973 if self.mode == MonoItemCollectionMode::Eager {
974 create_mono_items_for_default_impls(self.tcx,
980 hir::ItemKind::Enum(_, ref generics) |
981 hir::ItemKind::Struct(_, ref generics) |
982 hir::ItemKind::Union(_, ref generics) => {
983 if generics.params.is_empty() {
984 if self.mode == MonoItemCollectionMode::Eager {
985 let def_id = self.tcx.hir().local_def_id_from_hir_id(item.hir_id);
986 debug!("RootCollector: ADT drop-glue for {}",
987 def_id_to_string(self.tcx, def_id));
989 let ty = Instance::new(def_id, InternalSubsts::empty()).ty(self.tcx);
990 visit_drop_use(self.tcx, ty, true, self.output);
994 hir::ItemKind::GlobalAsm(..) => {
995 debug!("RootCollector: ItemKind::GlobalAsm({})",
996 def_id_to_string(self.tcx,
997 self.tcx.hir().local_def_id_from_hir_id(item.hir_id)));
998 self.output.push(MonoItem::GlobalAsm(item.hir_id));
1000 hir::ItemKind::Static(..) => {
1001 let def_id = self.tcx.hir().local_def_id_from_hir_id(item.hir_id);
1002 debug!("RootCollector: ItemKind::Static({})",
1003 def_id_to_string(self.tcx, def_id));
1004 self.output.push(MonoItem::Static(def_id));
1006 hir::ItemKind::Const(..) => {
1007 // const items only generate mono items if they are
1008 // actually used somewhere. Just declaring them is insufficient.
1010 // but even just declaring them must collect the items they refer to
1011 let def_id = self.tcx.hir().local_def_id_from_hir_id(item.hir_id);
1013 let instance = Instance::mono(self.tcx, def_id);
1014 let cid = GlobalId {
1018 let param_env = ty::ParamEnv::reveal_all();
1020 if let Ok(val) = self.tcx.const_eval(param_env.and(cid)) {
1021 collect_const(self.tcx, val, InternalSubsts::empty(), &mut self.output);
1024 hir::ItemKind::Fn(..) => {
1025 let def_id = self.tcx.hir().local_def_id_from_hir_id(item.hir_id);
1026 self.push_if_root(def_id);
1031 fn visit_trait_item(&mut self, _: &'v hir::TraitItem) {
1032 // Even if there's a default body with no explicit generics,
1033 // it's still generic over some `Self: Trait`, so not a root.
1036 fn visit_impl_item(&mut self, ii: &'v hir::ImplItem) {
1038 hir::ImplItemKind::Method(hir::MethodSig { .. }, _) => {
1039 let def_id = self.tcx.hir().local_def_id_from_hir_id(ii.hir_id);
1040 self.push_if_root(def_id);
1042 _ => { /* Nothing to do here */ }
1047 impl<'b, 'a, 'v> RootCollector<'b, 'a, 'v> {
1048 fn is_root(&self, def_id: DefId) -> bool {
1049 !item_requires_monomorphization(self.tcx, def_id) && match self.mode {
1050 MonoItemCollectionMode::Eager => {
1053 MonoItemCollectionMode::Lazy => {
1054 self.entry_fn.map(|(id, _)| id) == Some(def_id) ||
1055 self.tcx.is_reachable_non_generic(def_id) ||
1056 self.tcx.codegen_fn_attrs(def_id).flags.contains(
1057 CodegenFnAttrFlags::RUSTC_STD_INTERNAL_SYMBOL)
1062 /// If `def_id` represents a root, then push it onto the list of
1063 /// outputs. (Note that all roots must be monomorphic.)
1064 fn push_if_root(&mut self, def_id: DefId) {
1065 if self.is_root(def_id) {
1066 debug!("RootCollector::push_if_root: found root def_id={:?}", def_id);
1068 let instance = Instance::mono(self.tcx, def_id);
1069 self.output.push(create_fn_mono_item(instance));
1073 /// As a special case, when/if we encounter the
1074 /// `main()` function, we also have to generate a
1075 /// monomorphized copy of the start lang item based on
1076 /// the return type of `main`. This is not needed when
1077 /// the user writes their own `start` manually.
1078 fn push_extra_entry_roots(&mut self) {
1079 let main_def_id = match self.entry_fn {
1080 Some((def_id, EntryFnType::Main)) => def_id,
1084 let start_def_id = match self.tcx.lang_items().require(StartFnLangItem) {
1086 Err(err) => self.tcx.sess.fatal(&err),
1088 let main_ret_ty = self.tcx.fn_sig(main_def_id).output();
1090 // Given that `main()` has no arguments,
1091 // then its return type cannot have
1092 // late-bound regions, since late-bound
1093 // regions must appear in the argument
1095 let main_ret_ty = self.tcx.erase_regions(
1096 &main_ret_ty.no_bound_vars().unwrap(),
1099 let start_instance = Instance::resolve(
1101 ty::ParamEnv::reveal_all(),
1103 self.tcx.intern_substs(&[main_ret_ty.into()])
1106 self.output.push(create_fn_mono_item(start_instance));
1110 fn item_requires_monomorphization<'a, 'tcx>(tcx: TyCtxt<'a, 'tcx, 'tcx>, def_id: DefId) -> bool {
1111 let generics = tcx.generics_of(def_id);
1112 generics.requires_monomorphization(tcx)
1115 fn create_mono_items_for_default_impls<'a, 'tcx>(tcx: TyCtxt<'a, 'tcx, 'tcx>,
1116 item: &'tcx hir::Item,
1117 output: &mut Vec<MonoItem<'tcx>>) {
1119 hir::ItemKind::Impl(_, _, _, ref generics, .., ref impl_item_refs) => {
1120 for param in &generics.params {
1122 hir::GenericParamKind::Lifetime { .. } => {}
1123 hir::GenericParamKind::Type { .. } |
1124 hir::GenericParamKind::Const { .. } => {
1130 let impl_def_id = tcx.hir().local_def_id_from_hir_id(item.hir_id);
1132 debug!("create_mono_items_for_default_impls(item={})",
1133 def_id_to_string(tcx, impl_def_id));
1135 if let Some(trait_ref) = tcx.impl_trait_ref(impl_def_id) {
1136 let overridden_methods: FxHashSet<_> =
1137 impl_item_refs.iter()
1138 .map(|iiref| iiref.ident.modern())
1140 for method in tcx.provided_trait_methods(trait_ref.def_id) {
1141 if overridden_methods.contains(&method.ident.modern()) {
1145 if tcx.generics_of(method.def_id).own_requires_monomorphization() {
1149 let substs = InternalSubsts::for_item(tcx, method.def_id, |param, _| {
1151 GenericParamDefKind::Lifetime => tcx.lifetimes.re_erased.into(),
1152 GenericParamDefKind::Type { .. } |
1153 GenericParamDefKind::Const => {
1154 trait_ref.substs[param.index as usize]
1159 let instance = ty::Instance::resolve(tcx,
1160 ty::ParamEnv::reveal_all(),
1164 let mono_item = create_fn_mono_item(instance);
1165 if mono_item.is_instantiable(tcx)
1166 && should_monomorphize_locally(tcx, &instance) {
1167 output.push(mono_item);
1178 /// Scan the miri alloc in order to find function calls, closures, and drop-glue
1179 fn collect_miri<'a, 'tcx>(
1180 tcx: TyCtxt<'a, 'tcx, 'tcx>,
1182 output: &mut Vec<MonoItem<'tcx>>,
1184 let alloc_kind = tcx.alloc_map.lock().get(alloc_id);
1186 Some(AllocKind::Static(did)) => {
1187 let instance = Instance::mono(tcx, did);
1188 if should_monomorphize_locally(tcx, &instance) {
1189 trace!("collecting static {:?}", did);
1190 output.push(MonoItem::Static(did));
1193 Some(AllocKind::Memory(alloc)) => {
1194 trace!("collecting {:?} with {:#?}", alloc_id, alloc);
1195 for &((), inner) in alloc.relocations.values() {
1196 collect_miri(tcx, inner, output);
1199 Some(AllocKind::Function(fn_instance)) => {
1200 if should_monomorphize_locally(tcx, &fn_instance) {
1201 trace!("collecting {:?} with {:#?}", alloc_id, fn_instance);
1202 output.push(create_fn_mono_item(fn_instance));
1205 None => bug!("alloc id without corresponding allocation: {}", alloc_id),
1209 /// Scan the MIR in order to find function calls, closures, and drop-glue
1210 fn collect_neighbours<'a, 'tcx>(tcx: TyCtxt<'a, 'tcx, 'tcx>,
1211 instance: Instance<'tcx>,
1212 output: &mut Vec<MonoItem<'tcx>>)
1214 let mir = tcx.instance_mir(instance.def);
1216 MirNeighborCollector {
1220 param_substs: instance.substs,
1222 let param_env = ty::ParamEnv::reveal_all();
1223 for i in 0..mir.promoted.len() {
1224 use rustc_data_structures::indexed_vec::Idx;
1225 let i = Promoted::new(i);
1226 let cid = GlobalId {
1230 match tcx.const_eval(param_env.and(cid)) {
1231 Ok(val) => collect_const(tcx, val, instance.substs, output),
1232 Err(ErrorHandled::Reported) => {},
1233 Err(ErrorHandled::TooGeneric) => span_bug!(
1234 mir.promoted[i].span, "collection encountered polymorphic constant",
1240 fn def_id_to_string<'a, 'tcx>(tcx: TyCtxt<'a, 'tcx, 'tcx>,
1243 let mut output = String::new();
1244 let printer = DefPathBasedNames::new(tcx, false, false);
1245 printer.push_def_path(def_id, &mut output);
1249 fn collect_const<'a, 'tcx>(
1250 tcx: TyCtxt<'a, 'tcx, 'tcx>,
1251 constant: &'tcx ty::Const<'tcx>,
1252 param_substs: SubstsRef<'tcx>,
1253 output: &mut Vec<MonoItem<'tcx>>,
1255 debug!("visiting const {:?}", constant);
1257 match constant.val {
1258 ConstValue::Scalar(Scalar::Ptr(ptr)) =>
1259 collect_miri(tcx, ptr.alloc_id, output),
1260 ConstValue::Slice { data: alloc, start: _, end: _ } |
1261 ConstValue::ByRef(_, alloc) => {
1262 for &((), id) in alloc.relocations.values() {
1263 collect_miri(tcx, id, output);
1266 ConstValue::Unevaluated(did, substs) => {
1267 let param_env = ty::ParamEnv::reveal_all();
1268 let substs = tcx.subst_and_normalize_erasing_regions(
1273 let instance = ty::Instance::resolve(tcx,
1278 let cid = GlobalId {
1282 match tcx.const_eval(param_env.and(cid)) {
1283 Ok(val) => collect_const(tcx, val, param_substs, output),
1284 Err(ErrorHandled::Reported) => {},
1285 Err(ErrorHandled::TooGeneric) => span_bug!(
1286 tcx.def_span(did), "collection encountered polymorphic constant",