1 // Copyright 2014 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 //! Translation Item Collection
12 //! ===========================
14 //! This module is responsible for discovering all items that will contribute to
15 //! to code generation of the crate. The important part here is that it not only
16 //! needs to find syntax-level items (functions, structs, etc) but also all
17 //! their monomorphized instantiations. Every non-generic, non-const function
18 //! maps to one LLVM artifact. Every generic function can produce
19 //! from zero to N artifacts, depending on the sets of type arguments it
20 //! is instantiated with.
21 //! This also applies to generic items from other crates: A generic definition
22 //! in crate X might produce monomorphizations that are compiled into crate Y.
23 //! We also have to collect these here.
25 //! The following kinds of "translation items" are handled here:
33 //! The following things also result in LLVM artifacts, but are not collected
34 //! here, since we instantiate them locally on demand when needed in a given
44 //! Let's define some terms first:
46 //! - A "translation item" is something that results in a function or global in
47 //! the LLVM IR of a codegen unit. Translation items do not stand on their
48 //! own, they can reference other translation items. For example, if function
49 //! `foo()` calls function `bar()` then the translation item for `foo()`
50 //! references the translation item for function `bar()`. In general, the
51 //! definition for translation item A referencing a translation item B is that
52 //! the LLVM artifact produced for A references the LLVM artifact produced
55 //! - Translation items and the references between them form a directed graph,
56 //! where the translation items are the nodes and references form the edges.
57 //! Let's call this graph the "translation item graph".
59 //! - The translation item graph for a program contains all translation items
60 //! that are needed in order to produce the complete LLVM IR of the program.
62 //! The purpose of the algorithm implemented in this module is to build the
63 //! translation item graph for the current crate. It runs in two phases:
65 //! 1. Discover the roots of the graph by traversing the HIR of the crate.
66 //! 2. Starting from the roots, find neighboring nodes by inspecting the MIR
67 //! representation of the item corresponding to a given node, until no more
68 //! new nodes are found.
70 //! ### Discovering roots
72 //! The roots of the translation item graph correspond to the non-generic
73 //! syntactic items in the source code. We find them by walking the HIR of the
74 //! crate, and whenever we hit upon a function, method, or static item, we
75 //! create a translation item consisting of the items DefId and, since we only
76 //! consider non-generic items, an empty type-substitution set.
78 //! ### Finding neighbor nodes
79 //! Given a translation item node, we can discover neighbors by inspecting its
80 //! MIR. We walk the MIR and any time we hit upon something that signifies a
81 //! reference to another translation item, we have found a neighbor. Since the
82 //! translation item we are currently at is always monomorphic, we also know the
83 //! concrete type arguments of its neighbors, and so all neighbors again will be
84 //! monomorphic. The specific forms a reference to a neighboring node can take
85 //! in MIR are quite diverse. Here is an overview:
87 //! #### Calling Functions/Methods
88 //! The most obvious form of one translation item referencing another is a
89 //! function or method call (represented by a CALL terminator in MIR). But
90 //! calls are not the only thing that might introduce a reference between two
91 //! function translation items, and as we will see below, they are just a
92 //! specialized of the form described next, and consequently will don't get any
93 //! special treatment in the algorithm.
95 //! #### Taking a reference to a function or method
96 //! A function does not need to actually be called in order to be a neighbor of
97 //! another function. It suffices to just take a reference in order to introduce
98 //! an edge. Consider the following example:
101 //! fn print_val<T: Display>(x: T) {
102 //! println!("{}", x);
105 //! fn call_fn(f: &Fn(i32), x: i32) {
110 //! let print_i32 = print_val::<i32>;
111 //! call_fn(&print_i32, 0);
114 //! The MIR of none of these functions will contain an explicit call to
115 //! `print_val::<i32>`. Nonetheless, in order to translate this program, we need
116 //! an instance of this function. Thus, whenever we encounter a function or
117 //! method in operand position, we treat it as a neighbor of the current
118 //! translation item. Calls are just a special case of that.
121 //! In a way, closures are a simple case. Since every closure object needs to be
122 //! constructed somewhere, we can reliably discover them by observing
123 //! `RValue::Aggregate` expressions with `AggregateKind::Closure`. This is also
124 //! true for closures inlined from other crates.
127 //! Drop glue translation items are introduced by MIR drop-statements. The
128 //! generated translation item will again have drop-glue item neighbors if the
129 //! type to be dropped contains nested values that also need to be dropped. It
130 //! might also have a function item neighbor for the explicit `Drop::drop`
131 //! implementation of its type.
133 //! #### Unsizing Casts
134 //! A subtle way of introducing neighbor edges is by casting to a trait object.
135 //! Since the resulting fat-pointer contains a reference to a vtable, we need to
136 //! instantiate all object-save methods of the trait, as we need to store
137 //! pointers to these functions even if they never get called anywhere. This can
138 //! be seen as a special case of taking a function reference.
141 //! Since `Box` expression have special compiler support, no explicit calls to
142 //! `exchange_malloc()` and `exchange_free()` may show up in MIR, even if the
143 //! compiler will generate them. We have to observe `Rvalue::Box` expressions
144 //! and Box-typed drop-statements for that purpose.
147 //! Interaction with Cross-Crate Inlining
148 //! -------------------------------------
149 //! The binary of a crate will not only contain machine code for the items
150 //! defined in the source code of that crate. It will also contain monomorphic
151 //! instantiations of any extern generic functions and of functions marked with
153 //! The collection algorithm handles this more or less transparently. If it is
154 //! about to create a translation item for something with an external `DefId`,
155 //! it will take a look if the MIR for that item is available, and if so just
156 //! proceed normally. If the MIR is not available, it assumes that the item is
157 //! just linked to and no node is created; which is exactly what we want, since
158 //! no machine code should be generated in the current crate for such an item.
160 //! Eager and Lazy Collection Mode
161 //! ------------------------------
162 //! Translation item collection can be performed in one of two modes:
164 //! - Lazy mode means that items will only be instantiated when actually
165 //! referenced. The goal is to produce the least amount of machine code
168 //! - Eager mode is meant to be used in conjunction with incremental compilation
169 //! where a stable set of translation items is more important than a minimal
170 //! one. Thus, eager mode will instantiate drop-glue for every drop-able type
171 //! in the crate, even of no drop call for that type exists (yet). It will
172 //! also instantiate default implementations of trait methods, something that
173 //! otherwise is only done on demand.
178 //! Some things are not yet fully implemented in the current version of this
181 //! ### Initializers of Constants and Statics
182 //! Since no MIR is constructed yet for initializer expressions of constants and
183 //! statics we cannot inspect these properly.
186 //! Ideally, no translation item should be generated for const fns unless there
187 //! is a call to them that cannot be evaluated at compile time. At the moment
188 //! this is not implemented however: a translation item will be produced
189 //! regardless of whether it is actually needed or not.
192 use rustc::hir::itemlikevisit::ItemLikeVisitor;
194 use rustc::hir::map as hir_map;
195 use rustc::hir::def_id::DefId;
196 use rustc::middle::lang_items::{ExchangeMallocFnLangItem};
198 use rustc::ty::subst::{Substs, Subst};
199 use rustc::ty::{self, TypeFoldable, TyCtxt};
200 use rustc::ty::adjustment::CustomCoerceUnsized;
201 use rustc::mir::{self, Location};
202 use rustc::mir::visit::Visitor as MirVisitor;
204 use context::SharedCrateContext;
205 use common::{def_ty, instance_ty};
206 use monomorphize::{self, Instance};
207 use rustc::util::nodemap::{FxHashSet, FxHashMap, DefIdMap};
209 use trans_item::{TransItem, DefPathBasedNames, InstantiationMode};
211 #[derive(PartialEq, Eq, Hash, Clone, Copy, Debug)]
212 pub enum TransItemCollectionMode {
217 /// Maps every translation item to all translation items it references in its
219 pub struct InliningMap<'tcx> {
220 // Maps a source translation item to a range of target translation items
221 // that are potentially inlined by LLVM into the source.
222 // The two numbers in the tuple are the start (inclusive) and
223 // end index (exclusive) within the `targets` vecs.
224 index: FxHashMap<TransItem<'tcx>, (usize, usize)>,
225 targets: Vec<TransItem<'tcx>>,
228 impl<'tcx> InliningMap<'tcx> {
230 fn new() -> InliningMap<'tcx> {
237 fn record_inlining_canditates<I>(&mut self,
238 source: TransItem<'tcx>,
240 where I: Iterator<Item=TransItem<'tcx>>
242 assert!(!self.index.contains_key(&source));
244 let start_index = self.targets.len();
245 self.targets.extend(targets);
246 let end_index = self.targets.len();
247 self.index.insert(source, (start_index, end_index));
250 // Internally iterate over all items referenced by `source` which will be
251 // made available for inlining.
252 pub fn with_inlining_candidates<F>(&self, source: TransItem<'tcx>, mut f: F)
253 where F: FnMut(TransItem<'tcx>) {
254 if let Some(&(start_index, end_index)) = self.index.get(&source)
256 for candidate in &self.targets[start_index .. end_index] {
263 pub fn collect_crate_translation_items<'a, 'tcx>(scx: &SharedCrateContext<'a, 'tcx>,
264 mode: TransItemCollectionMode)
265 -> (FxHashSet<TransItem<'tcx>>,
267 // We are not tracking dependencies of this pass as it has to be re-executed
268 // every time no matter what.
269 scx.tcx().dep_graph.with_ignore(|| {
270 let roots = collect_roots(scx, mode);
272 debug!("Building translation item graph, beginning at roots");
273 let mut visited = FxHashSet();
274 let mut recursion_depths = DefIdMap();
275 let mut inlining_map = InliningMap::new();
278 collect_items_rec(scx,
281 &mut recursion_depths,
285 (visited, inlining_map)
289 // Find all non-generic items by walking the HIR. These items serve as roots to
290 // start monomorphizing from.
291 fn collect_roots<'a, 'tcx>(scx: &SharedCrateContext<'a, 'tcx>,
292 mode: TransItemCollectionMode)
293 -> Vec<TransItem<'tcx>> {
294 debug!("Collecting roots");
295 let mut roots = Vec::new();
298 let mut visitor = RootCollector {
304 scx.tcx().hir.krate().visit_all_item_likes(&mut visitor);
310 // Collect all monomorphized translation items reachable from `starting_point`
311 fn collect_items_rec<'a, 'tcx: 'a>(scx: &SharedCrateContext<'a, 'tcx>,
312 starting_point: TransItem<'tcx>,
313 visited: &mut FxHashSet<TransItem<'tcx>>,
314 recursion_depths: &mut DefIdMap<usize>,
315 inlining_map: &mut InliningMap<'tcx>) {
316 if !visited.insert(starting_point.clone()) {
317 // We've been here already, no need to search again.
320 debug!("BEGIN collect_items_rec({})", starting_point.to_string(scx.tcx()));
322 let mut neighbors = Vec::new();
323 let recursion_depth_reset;
325 match starting_point {
326 TransItem::Static(node_id) => {
327 let def_id = scx.tcx().hir.local_def_id(node_id);
328 let instance = Instance::mono(scx.tcx(), def_id);
330 // Sanity check whether this ended up being collected accidentally
331 debug_assert!(should_trans_locally(scx.tcx(), &instance));
333 let ty = instance_ty(scx, &instance);
334 visit_drop_use(scx, ty, true, &mut neighbors);
336 recursion_depth_reset = None;
338 collect_neighbours(scx, instance, &mut neighbors);
340 TransItem::Fn(instance) => {
341 // Sanity check whether this ended up being collected accidentally
342 debug_assert!(should_trans_locally(scx.tcx(), &instance));
344 // Keep track of the monomorphization recursion depth
345 recursion_depth_reset = Some(check_recursion_limit(scx.tcx(),
348 check_type_length_limit(scx.tcx(), instance);
350 collect_neighbours(scx, instance, &mut neighbors);
352 TransItem::GlobalAsm(..) => {
353 recursion_depth_reset = None;
357 record_inlining_canditates(scx.tcx(), starting_point, &neighbors[..], inlining_map);
359 for neighbour in neighbors {
360 collect_items_rec(scx, neighbour, visited, recursion_depths, inlining_map);
363 if let Some((def_id, depth)) = recursion_depth_reset {
364 recursion_depths.insert(def_id, depth);
367 debug!("END collect_items_rec({})", starting_point.to_string(scx.tcx()));
370 fn record_inlining_canditates<'a, 'tcx>(tcx: TyCtxt<'a, 'tcx, 'tcx>,
371 caller: TransItem<'tcx>,
372 callees: &[TransItem<'tcx>],
373 inlining_map: &mut InliningMap<'tcx>) {
374 let is_inlining_candidate = |trans_item: &TransItem<'tcx>| {
375 trans_item.instantiation_mode(tcx) == InstantiationMode::LocalCopy
378 let inlining_candidates = callees.into_iter()
380 .filter(is_inlining_candidate);
382 inlining_map.record_inlining_canditates(caller, inlining_candidates);
385 fn check_recursion_limit<'a, 'tcx>(tcx: TyCtxt<'a, 'tcx, 'tcx>,
386 instance: Instance<'tcx>,
387 recursion_depths: &mut DefIdMap<usize>)
389 let def_id = instance.def_id();
390 let recursion_depth = recursion_depths.get(&def_id).cloned().unwrap_or(0);
391 debug!(" => recursion depth={}", recursion_depth);
393 let recursion_depth = if Some(def_id) == tcx.lang_items.drop_in_place_fn() {
394 // HACK: drop_in_place creates tight monomorphization loops. Give
401 // Code that needs to instantiate the same function recursively
402 // more than the recursion limit is assumed to be causing an
403 // infinite expansion.
404 if recursion_depth > tcx.sess.recursion_limit.get() {
405 let error = format!("reached the recursion limit while instantiating `{}`",
407 if let Some(node_id) = tcx.hir.as_local_node_id(def_id) {
408 tcx.sess.span_fatal(tcx.hir.span(node_id), &error);
410 tcx.sess.fatal(&error);
414 recursion_depths.insert(def_id, recursion_depth + 1);
416 (def_id, recursion_depth)
419 fn check_type_length_limit<'a, 'tcx>(tcx: TyCtxt<'a, 'tcx, 'tcx>,
420 instance: Instance<'tcx>)
422 let type_length = instance.substs.types().flat_map(|ty| ty.walk()).count();
423 debug!(" => type length={}", type_length);
425 // Rust code can easily create exponentially-long types using only a
426 // polynomial recursion depth. Even with the default recursion
427 // depth, you can easily get cases that take >2^60 steps to run,
428 // which means that rustc basically hangs.
430 // Bail out in these cases to avoid that bad user experience.
431 let type_length_limit = tcx.sess.type_length_limit.get();
432 if type_length > type_length_limit {
433 // The instance name is already known to be too long for rustc. Use
434 // `{:.64}` to avoid blasting the user's terminal with thousands of
435 // lines of type-name.
436 let instance_name = instance.to_string();
437 let msg = format!("reached the type-length limit while instantiating `{:.64}...`",
439 let mut diag = if let Some(node_id) = tcx.hir.as_local_node_id(instance.def_id()) {
440 tcx.sess.struct_span_fatal(tcx.hir.span(node_id), &msg)
442 tcx.sess.struct_fatal(&msg)
446 "consider adding a `#![type_length_limit=\"{}\"]` attribute to your crate",
447 type_length_limit*2));
449 tcx.sess.abort_if_errors();
453 struct MirNeighborCollector<'a, 'tcx: 'a> {
454 scx: &'a SharedCrateContext<'a, 'tcx>,
455 mir: &'a mir::Mir<'tcx>,
456 output: &'a mut Vec<TransItem<'tcx>>,
457 param_substs: &'tcx Substs<'tcx>
460 impl<'a, 'tcx> MirVisitor<'tcx> for MirNeighborCollector<'a, 'tcx> {
462 fn visit_rvalue(&mut self, rvalue: &mir::Rvalue<'tcx>, location: Location) {
463 debug!("visiting rvalue {:?}", *rvalue);
466 // When doing an cast from a regular pointer to a fat pointer, we
467 // have to instantiate all methods of the trait being cast to, so we
468 // can build the appropriate vtable.
469 mir::Rvalue::Cast(mir::CastKind::Unsize, ref operand, target_ty) => {
470 let target_ty = self.scx.tcx().trans_apply_param_substs(self.param_substs,
472 let source_ty = operand.ty(self.mir, self.scx.tcx());
473 let source_ty = self.scx.tcx().trans_apply_param_substs(self.param_substs,
475 let (source_ty, target_ty) = find_vtable_types_for_unsizing(self.scx,
478 // This could also be a different Unsize instruction, like
479 // from a fixed sized array to a slice. But we are only
480 // interested in things that produce a vtable.
481 if target_ty.is_trait() && !source_ty.is_trait() {
482 create_trans_items_for_vtable_methods(self.scx,
488 mir::Rvalue::Cast(mir::CastKind::ReifyFnPointer, ref operand, _) => {
489 let fn_ty = operand.ty(self.mir, self.scx.tcx());
490 let fn_ty = self.scx.tcx().trans_apply_param_substs(self.param_substs,
492 visit_fn_use(self.scx, fn_ty, false, &mut self.output);
494 mir::Rvalue::Cast(mir::CastKind::ClosureFnPointer, ref operand, _) => {
495 let source_ty = operand.ty(self.mir, self.scx.tcx());
496 let source_ty = self.scx.tcx().trans_apply_param_substs(self.param_substs,
498 match source_ty.sty {
499 ty::TyClosure(def_id, substs) => {
500 let instance = monomorphize::resolve_closure(
501 self.scx, def_id, substs, ty::ClosureKind::FnOnce);
502 self.output.push(create_fn_trans_item(instance));
507 mir::Rvalue::NullaryOp(mir::NullOp::Box, _) => {
508 let tcx = self.scx.tcx();
509 let exchange_malloc_fn_def_id = tcx
511 .require(ExchangeMallocFnLangItem)
512 .unwrap_or_else(|e| self.scx.sess().fatal(&e));
513 let instance = Instance::mono(tcx, exchange_malloc_fn_def_id);
514 if should_trans_locally(tcx, &instance) {
515 self.output.push(create_fn_trans_item(instance));
518 _ => { /* not interesting */ }
521 self.super_rvalue(rvalue, location);
524 fn visit_constant(&mut self, constant: &mir::Constant<'tcx>, location: Location) {
525 debug!("visiting constant {:?} @ {:?}", *constant, location);
527 if let ty::TyFnDef(..) = constant.ty.sty {
528 // function definitions are zero-sized, and only generate
529 // IR when they are called/reified.
530 self.super_constant(constant, location);
534 if let mir::Literal::Item { def_id, substs } = constant.literal {
535 let substs = self.scx.tcx().trans_apply_param_substs(self.param_substs,
537 let instance = monomorphize::resolve(self.scx, def_id, substs);
538 collect_neighbours(self.scx, instance, self.output);
541 self.super_constant(constant, location);
544 fn visit_terminator_kind(&mut self,
545 block: mir::BasicBlock,
546 kind: &mir::TerminatorKind<'tcx>,
547 location: Location) {
548 debug!("visiting terminator {:?} @ {:?}", kind, location);
550 let tcx = self.scx.tcx();
552 mir::TerminatorKind::Call { ref func, .. } => {
553 let callee_ty = func.ty(self.mir, tcx);
554 let callee_ty = tcx.trans_apply_param_substs(self.param_substs, &callee_ty);
555 visit_fn_use(self.scx, callee_ty, true, &mut self.output);
557 mir::TerminatorKind::Drop { ref location, .. } |
558 mir::TerminatorKind::DropAndReplace { ref location, .. } => {
559 let ty = location.ty(self.mir, self.scx.tcx())
560 .to_ty(self.scx.tcx());
561 let ty = tcx.trans_apply_param_substs(self.param_substs, &ty);
562 visit_drop_use(self.scx, ty, true, self.output);
564 mir::TerminatorKind::Goto { .. } |
565 mir::TerminatorKind::SwitchInt { .. } |
566 mir::TerminatorKind::Resume |
567 mir::TerminatorKind::Return |
568 mir::TerminatorKind::Unreachable |
569 mir::TerminatorKind::Assert { .. } => {}
572 self.super_terminator_kind(block, kind, location);
576 fn visit_drop_use<'a, 'tcx>(scx: &SharedCrateContext<'a, 'tcx>,
578 is_direct_call: bool,
579 output: &mut Vec<TransItem<'tcx>>)
581 let instance = monomorphize::resolve_drop_in_place(scx, ty);
582 visit_instance_use(scx, instance, is_direct_call, output);
585 fn visit_fn_use<'a, 'tcx>(scx: &SharedCrateContext<'a, 'tcx>,
587 is_direct_call: bool,
588 output: &mut Vec<TransItem<'tcx>>)
590 if let ty::TyFnDef(def_id, substs, _) = ty.sty {
591 let instance = monomorphize::resolve(scx, def_id, substs);
592 visit_instance_use(scx, instance, is_direct_call, output);
596 fn visit_instance_use<'a, 'tcx>(scx: &SharedCrateContext<'a, 'tcx>,
597 instance: ty::Instance<'tcx>,
598 is_direct_call: bool,
599 output: &mut Vec<TransItem<'tcx>>)
601 debug!("visit_item_use({:?}, is_direct_call={:?})", instance, is_direct_call);
602 if !should_trans_locally(scx.tcx(), &instance) {
607 ty::InstanceDef::Intrinsic(def_id) => {
609 bug!("intrinsic {:?} being reified", def_id);
612 ty::InstanceDef::Virtual(..) |
613 ty::InstanceDef::DropGlue(_, None) => {
614 // don't need to emit shim if we are calling directly.
616 output.push(create_fn_trans_item(instance));
619 ty::InstanceDef::DropGlue(_, Some(_)) => {
620 output.push(create_fn_trans_item(instance));
622 ty::InstanceDef::ClosureOnceShim { .. } |
623 ty::InstanceDef::Item(..) |
624 ty::InstanceDef::FnPtrShim(..) => {
625 output.push(create_fn_trans_item(instance));
630 // Returns true if we should translate an instance in the local crate.
631 // Returns false if we can just link to the upstream crate and therefore don't
632 // need a translation item.
633 fn should_trans_locally<'a, 'tcx>(tcx: TyCtxt<'a, 'tcx, 'tcx>, instance: &Instance<'tcx>)
635 let def_id = match instance.def {
636 ty::InstanceDef::Item(def_id) => def_id,
637 ty::InstanceDef::ClosureOnceShim { .. } |
638 ty::InstanceDef::Virtual(..) |
639 ty::InstanceDef::FnPtrShim(..) |
640 ty::InstanceDef::DropGlue(..) |
641 ty::InstanceDef::Intrinsic(_) => return true
643 match tcx.hir.get_if_local(def_id) {
644 Some(hir_map::NodeForeignItem(..)) => {
645 false // foreign items are linked against, not translated.
649 if tcx.is_exported_symbol(def_id) ||
650 tcx.is_foreign_item(def_id)
652 // We can link to the item in question, no instance needed
656 if !tcx.is_mir_available(def_id) {
657 bug!("Cannot create local trans-item for {:?}", def_id)
665 /// For given pair of source and target type that occur in an unsizing coercion,
666 /// this function finds the pair of types that determines the vtable linking
669 /// For example, the source type might be `&SomeStruct` and the target type\
670 /// might be `&SomeTrait` in a cast like:
672 /// let src: &SomeStruct = ...;
673 /// let target = src as &SomeTrait;
675 /// Then the output of this function would be (SomeStruct, SomeTrait) since for
676 /// constructing the `target` fat-pointer we need the vtable for that pair.
678 /// Things can get more complicated though because there's also the case where
679 /// the unsized type occurs as a field:
682 /// struct ComplexStruct<T: ?Sized> {
689 /// In this case, if `T` is sized, `&ComplexStruct<T>` is a thin pointer. If `T`
690 /// is unsized, `&SomeStruct` is a fat pointer, and the vtable it points to is
691 /// for the pair of `T` (which is a trait) and the concrete type that `T` was
692 /// originally coerced from:
694 /// let src: &ComplexStruct<SomeStruct> = ...;
695 /// let target = src as &ComplexStruct<SomeTrait>;
697 /// Again, we want this `find_vtable_types_for_unsizing()` to provide the pair
698 /// `(SomeStruct, SomeTrait)`.
700 /// Finally, there is also the case of custom unsizing coercions, e.g. for
701 /// smart pointers such as `Rc` and `Arc`.
702 fn find_vtable_types_for_unsizing<'a, 'tcx>(scx: &SharedCrateContext<'a, 'tcx>,
703 source_ty: ty::Ty<'tcx>,
704 target_ty: ty::Ty<'tcx>)
705 -> (ty::Ty<'tcx>, ty::Ty<'tcx>) {
706 let ptr_vtable = |inner_source: ty::Ty<'tcx>, inner_target: ty::Ty<'tcx>| {
707 if !scx.type_is_sized(inner_source) {
708 (inner_source, inner_target)
710 scx.tcx().struct_lockstep_tails(inner_source, inner_target)
713 match (&source_ty.sty, &target_ty.sty) {
714 (&ty::TyRef(_, ty::TypeAndMut { ty: a, .. }),
715 &ty::TyRef(_, ty::TypeAndMut { ty: b, .. })) |
716 (&ty::TyRef(_, ty::TypeAndMut { ty: a, .. }),
717 &ty::TyRawPtr(ty::TypeAndMut { ty: b, .. })) |
718 (&ty::TyRawPtr(ty::TypeAndMut { ty: a, .. }),
719 &ty::TyRawPtr(ty::TypeAndMut { ty: b, .. })) => {
722 (&ty::TyAdt(def_a, _), &ty::TyAdt(def_b, _)) if def_a.is_box() && def_b.is_box() => {
723 ptr_vtable(source_ty.boxed_ty(), target_ty.boxed_ty())
726 (&ty::TyAdt(source_adt_def, source_substs),
727 &ty::TyAdt(target_adt_def, target_substs)) => {
728 assert_eq!(source_adt_def, target_adt_def);
731 monomorphize::custom_coerce_unsize_info(scx, source_ty, target_ty);
733 let coerce_index = match kind {
734 CustomCoerceUnsized::Struct(i) => i
737 let source_fields = &source_adt_def.struct_variant().fields;
738 let target_fields = &target_adt_def.struct_variant().fields;
740 assert!(coerce_index < source_fields.len() &&
741 source_fields.len() == target_fields.len());
743 find_vtable_types_for_unsizing(scx,
744 source_fields[coerce_index].ty(scx.tcx(),
746 target_fields[coerce_index].ty(scx.tcx(),
749 _ => bug!("find_vtable_types_for_unsizing: invalid coercion {:?} -> {:?}",
755 fn create_fn_trans_item<'a, 'tcx>(instance: Instance<'tcx>) -> TransItem<'tcx> {
756 debug!("create_fn_trans_item(instance={})", instance);
757 TransItem::Fn(instance)
760 /// Creates a `TransItem` for each method that is referenced by the vtable for
761 /// the given trait/impl pair.
762 fn create_trans_items_for_vtable_methods<'a, 'tcx>(scx: &SharedCrateContext<'a, 'tcx>,
763 trait_ty: ty::Ty<'tcx>,
764 impl_ty: ty::Ty<'tcx>,
765 output: &mut Vec<TransItem<'tcx>>) {
766 assert!(!trait_ty.needs_subst() && !trait_ty.has_escaping_regions() &&
767 !impl_ty.needs_subst() && !impl_ty.has_escaping_regions());
769 if let ty::TyDynamic(ref trait_ty, ..) = trait_ty.sty {
770 if let Some(principal) = trait_ty.principal() {
771 let poly_trait_ref = principal.with_self_ty(scx.tcx(), impl_ty);
772 assert!(!poly_trait_ref.has_escaping_regions());
774 // Walk all methods of the trait, including those of its supertraits
775 let methods = traits::get_vtable_methods(scx.tcx(), poly_trait_ref);
776 let methods = methods.filter_map(|method| method)
777 .map(|(def_id, substs)| monomorphize::resolve(scx, def_id, substs))
778 .filter(|&instance| should_trans_locally(scx.tcx(), &instance))
779 .map(|instance| create_fn_trans_item(instance));
780 output.extend(methods);
782 // Also add the destructor
783 visit_drop_use(scx, impl_ty, false, output);
787 //=-----------------------------------------------------------------------------
789 //=-----------------------------------------------------------------------------
791 struct RootCollector<'b, 'a: 'b, 'tcx: 'a + 'b> {
792 scx: &'b SharedCrateContext<'a, 'tcx>,
793 mode: TransItemCollectionMode,
794 output: &'b mut Vec<TransItem<'tcx>>,
797 impl<'b, 'a, 'v> ItemLikeVisitor<'v> for RootCollector<'b, 'a, 'v> {
798 fn visit_item(&mut self, item: &'v hir::Item) {
800 hir::ItemExternCrate(..) |
802 hir::ItemForeignMod(..) |
804 hir::ItemDefaultImpl(..) |
806 hir::ItemMod(..) => {
807 // Nothing to do, just keep recursing...
810 hir::ItemImpl(..) => {
811 if self.mode == TransItemCollectionMode::Eager {
812 create_trans_items_for_default_impls(self.scx,
818 hir::ItemEnum(_, ref generics) |
819 hir::ItemStruct(_, ref generics) |
820 hir::ItemUnion(_, ref generics) => {
821 if !generics.is_parameterized() {
822 if self.mode == TransItemCollectionMode::Eager {
823 let def_id = self.scx.tcx().hir.local_def_id(item.id);
824 debug!("RootCollector: ADT drop-glue for {}",
825 def_id_to_string(self.scx.tcx(), def_id));
827 let ty = def_ty(self.scx, def_id, Substs::empty());
828 visit_drop_use(self.scx, ty, true, self.output);
832 hir::ItemGlobalAsm(..) => {
833 debug!("RootCollector: ItemGlobalAsm({})",
834 def_id_to_string(self.scx.tcx(),
835 self.scx.tcx().hir.local_def_id(item.id)));
836 self.output.push(TransItem::GlobalAsm(item.id));
838 hir::ItemStatic(..) => {
839 debug!("RootCollector: ItemStatic({})",
840 def_id_to_string(self.scx.tcx(),
841 self.scx.tcx().hir.local_def_id(item.id)));
842 self.output.push(TransItem::Static(item.id));
844 hir::ItemConst(..) => {
845 // const items only generate translation items if they are
846 // actually used somewhere. Just declaring them is insufficient.
848 hir::ItemFn(.., ref generics, _) => {
849 if !generics.is_type_parameterized() {
850 let def_id = self.scx.tcx().hir.local_def_id(item.id);
852 debug!("RootCollector: ItemFn({})",
853 def_id_to_string(self.scx.tcx(), def_id));
855 let instance = Instance::mono(self.scx.tcx(), def_id);
856 self.output.push(TransItem::Fn(instance));
862 fn visit_trait_item(&mut self, _: &'v hir::TraitItem) {
863 // Even if there's a default body with no explicit generics,
864 // it's still generic over some `Self: Trait`, so not a root.
867 fn visit_impl_item(&mut self, ii: &'v hir::ImplItem) {
869 hir::ImplItemKind::Method(hir::MethodSig {
873 let hir_map = &self.scx.tcx().hir;
874 let parent_node_id = hir_map.get_parent_node(ii.id);
875 let is_impl_generic = match hir_map.expect_item(parent_node_id) {
877 node: hir::ItemImpl(_, _, _, ref generics, ..),
880 generics.is_type_parameterized()
887 if !generics.is_type_parameterized() && !is_impl_generic {
888 let def_id = self.scx.tcx().hir.local_def_id(ii.id);
890 debug!("RootCollector: MethodImplItem({})",
891 def_id_to_string(self.scx.tcx(), def_id));
893 let instance = Instance::mono(self.scx.tcx(), def_id);
894 self.output.push(TransItem::Fn(instance));
897 _ => { /* Nothing to do here */ }
902 fn create_trans_items_for_default_impls<'a, 'tcx>(scx: &SharedCrateContext<'a, 'tcx>,
903 item: &'tcx hir::Item,
904 output: &mut Vec<TransItem<'tcx>>) {
912 ref impl_item_refs) => {
913 if generics.is_type_parameterized() {
917 let impl_def_id = tcx.hir.local_def_id(item.id);
919 debug!("create_trans_items_for_default_impls(item={})",
920 def_id_to_string(tcx, impl_def_id));
922 if let Some(trait_ref) = tcx.impl_trait_ref(impl_def_id) {
923 let callee_substs = tcx.erase_regions(&trait_ref.substs);
924 let overridden_methods: FxHashSet<_> =
925 impl_item_refs.iter()
926 .map(|iiref| iiref.name)
928 for method in tcx.provided_trait_methods(trait_ref.def_id) {
929 if overridden_methods.contains(&method.name) {
933 if !tcx.generics_of(method.def_id).types.is_empty() {
938 monomorphize::resolve(scx, method.def_id, callee_substs);
940 let predicates = tcx.predicates_of(instance.def_id()).predicates
941 .subst(tcx, instance.substs);
942 if !traits::normalize_and_test_predicates(tcx, predicates) {
946 if should_trans_locally(tcx, &instance) {
947 output.push(create_fn_trans_item(instance));
958 /// Scan the MIR in order to find function calls, closures, and drop-glue
959 fn collect_neighbours<'a, 'tcx>(scx: &SharedCrateContext<'a, 'tcx>,
960 instance: Instance<'tcx>,
961 output: &mut Vec<TransItem<'tcx>>)
963 let mir = scx.tcx().instance_mir(instance.def);
965 let mut visitor = MirNeighborCollector {
969 param_substs: instance.substs
972 visitor.visit_mir(&mir);
973 for promoted in &mir.promoted {
974 visitor.mir = promoted;
975 visitor.visit_mir(promoted);
979 fn def_id_to_string<'a, 'tcx>(tcx: TyCtxt<'a, 'tcx, 'tcx>,
982 let mut output = String::new();
983 let printer = DefPathBasedNames::new(tcx, false, false);
984 printer.push_def_path(def_id, &mut output);