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::const_val::ConstVal;
197 use rustc::middle::lang_items::{ExchangeMallocFnLangItem};
199 use rustc::ty::subst::Substs;
200 use rustc::ty::{self, TypeFoldable, Ty, TyCtxt};
201 use rustc::ty::adjustment::CustomCoerceUnsized;
202 use rustc::mir::{self, Location};
203 use rustc::mir::visit::Visitor as MirVisitor;
205 use common::{def_ty, instance_ty, type_is_sized};
206 use monomorphize::{self, Instance};
207 use rustc::util::nodemap::{FxHashSet, FxHashMap, DefIdMap};
209 use trans_item::{TransItem, TransItemExt, DefPathBasedNames, InstantiationMode};
211 use rustc_data_structures::bitvec::BitVector;
213 #[derive(PartialEq, Eq, Hash, Clone, Copy, Debug)]
214 pub enum TransItemCollectionMode {
219 /// Maps every translation item to all translation items it references in its
221 pub struct InliningMap<'tcx> {
222 // Maps a source translation item to the range of translation items
224 // The two numbers in the tuple are the start (inclusive) and
225 // end index (exclusive) within the `targets` vecs.
226 index: FxHashMap<TransItem<'tcx>, (usize, usize)>,
227 targets: Vec<TransItem<'tcx>>,
229 // Contains one bit per translation item in the `targets` field. That bit
230 // is true if that translation item needs to be inlined into every CGU.
234 impl<'tcx> InliningMap<'tcx> {
236 fn new() -> InliningMap<'tcx> {
240 inlines: BitVector::new(1024),
244 fn record_accesses<I>(&mut self,
245 source: TransItem<'tcx>,
247 where I: Iterator<Item=(TransItem<'tcx>, bool)> + ExactSizeIterator
249 assert!(!self.index.contains_key(&source));
251 let start_index = self.targets.len();
252 let new_items_count = new_targets.len();
253 let new_items_count_total = new_items_count + self.targets.len();
255 self.targets.reserve(new_items_count);
256 self.inlines.grow(new_items_count_total);
258 for (i, (target, inline)) in new_targets.enumerate() {
259 self.targets.push(target);
261 self.inlines.insert(i + start_index);
265 let end_index = self.targets.len();
266 self.index.insert(source, (start_index, end_index));
269 // Internally iterate over all items referenced by `source` which will be
270 // made available for inlining.
271 pub fn with_inlining_candidates<F>(&self, source: TransItem<'tcx>, mut f: F)
272 where F: FnMut(TransItem<'tcx>)
274 if let Some(&(start_index, end_index)) = self.index.get(&source) {
275 for (i, candidate) in self.targets[start_index .. end_index]
278 if self.inlines.contains(start_index + i) {
285 // Internally iterate over all items and the things each accesses.
286 pub fn iter_accesses<F>(&self, mut f: F)
287 where F: FnMut(TransItem<'tcx>, &[TransItem<'tcx>])
289 for (&accessor, &(start_index, end_index)) in &self.index {
290 f(accessor, &self.targets[start_index .. end_index])
295 pub fn collect_crate_translation_items<'a, 'tcx>(tcx: TyCtxt<'a, 'tcx, 'tcx>,
296 mode: TransItemCollectionMode)
297 -> (FxHashSet<TransItem<'tcx>>,
299 let roots = collect_roots(tcx, mode);
301 debug!("Building translation item graph, beginning at roots");
302 let mut visited = FxHashSet();
303 let mut recursion_depths = DefIdMap();
304 let mut inlining_map = InliningMap::new();
307 collect_items_rec(tcx,
310 &mut recursion_depths,
314 (visited, inlining_map)
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: TransItemCollectionMode)
321 -> Vec<TransItem<'tcx>> {
322 debug!("Collecting roots");
323 let mut roots = Vec::new();
326 let mut visitor = RootCollector {
332 tcx.hir.krate().visit_all_item_likes(&mut visitor);
335 // We can only translate items that are instantiable - items all of
336 // whose predicates hold. Luckily, items that aren't instantiable
337 // can't actually be used, so we can just skip translating them.
338 roots.retain(|root| root.is_instantiable(tcx));
343 // Collect all monomorphized translation items reachable from `starting_point`
344 fn collect_items_rec<'a, 'tcx: 'a>(tcx: TyCtxt<'a, 'tcx, 'tcx>,
345 starting_point: TransItem<'tcx>,
346 visited: &mut FxHashSet<TransItem<'tcx>>,
347 recursion_depths: &mut DefIdMap<usize>,
348 inlining_map: &mut InliningMap<'tcx>) {
349 if !visited.insert(starting_point.clone()) {
350 // We've been here already, no need to search again.
353 debug!("BEGIN collect_items_rec({})", starting_point.to_string(tcx));
355 let mut neighbors = Vec::new();
356 let recursion_depth_reset;
358 match starting_point {
359 TransItem::Static(node_id) => {
360 let def_id = tcx.hir.local_def_id(node_id);
361 let instance = Instance::mono(tcx, def_id);
363 // Sanity check whether this ended up being collected accidentally
364 debug_assert!(should_trans_locally(tcx, &instance));
366 let ty = instance_ty(tcx, &instance);
367 visit_drop_use(tcx, ty, true, &mut neighbors);
369 recursion_depth_reset = None;
371 collect_neighbours(tcx, instance, true, &mut neighbors);
373 TransItem::Fn(instance) => {
374 // Sanity check whether this ended up being collected accidentally
375 debug_assert!(should_trans_locally(tcx, &instance));
377 // Keep track of the monomorphization recursion depth
378 recursion_depth_reset = Some(check_recursion_limit(tcx,
381 check_type_length_limit(tcx, instance);
383 collect_neighbours(tcx, instance, false, &mut neighbors);
385 TransItem::GlobalAsm(..) => {
386 recursion_depth_reset = None;
390 record_accesses(tcx, starting_point, &neighbors[..], inlining_map);
392 for neighbour in neighbors {
393 collect_items_rec(tcx, neighbour, visited, recursion_depths, inlining_map);
396 if let Some((def_id, depth)) = recursion_depth_reset {
397 recursion_depths.insert(def_id, depth);
400 debug!("END collect_items_rec({})", starting_point.to_string(tcx));
403 fn record_accesses<'a, 'tcx>(tcx: TyCtxt<'a, 'tcx, 'tcx>,
404 caller: TransItem<'tcx>,
405 callees: &[TransItem<'tcx>],
406 inlining_map: &mut InliningMap<'tcx>) {
407 let is_inlining_candidate = |trans_item: &TransItem<'tcx>| {
408 trans_item.instantiation_mode(tcx) == InstantiationMode::LocalCopy
411 let accesses = callees.into_iter()
413 (*trans_item, is_inlining_candidate(trans_item))
416 inlining_map.record_accesses(caller, accesses);
419 fn check_recursion_limit<'a, 'tcx>(tcx: TyCtxt<'a, 'tcx, 'tcx>,
420 instance: Instance<'tcx>,
421 recursion_depths: &mut DefIdMap<usize>)
423 let def_id = instance.def_id();
424 let recursion_depth = recursion_depths.get(&def_id).cloned().unwrap_or(0);
425 debug!(" => recursion depth={}", recursion_depth);
427 let recursion_depth = if Some(def_id) == tcx.lang_items().drop_in_place_fn() {
428 // HACK: drop_in_place creates tight monomorphization loops. Give
435 // Code that needs to instantiate the same function recursively
436 // more than the recursion limit is assumed to be causing an
437 // infinite expansion.
438 if recursion_depth > tcx.sess.recursion_limit.get() {
439 let error = format!("reached the recursion limit while instantiating `{}`",
441 if let Some(node_id) = tcx.hir.as_local_node_id(def_id) {
442 tcx.sess.span_fatal(tcx.hir.span(node_id), &error);
444 tcx.sess.fatal(&error);
448 recursion_depths.insert(def_id, recursion_depth + 1);
450 (def_id, recursion_depth)
453 fn check_type_length_limit<'a, 'tcx>(tcx: TyCtxt<'a, 'tcx, 'tcx>,
454 instance: Instance<'tcx>)
456 let type_length = instance.substs.types().flat_map(|ty| ty.walk()).count();
457 debug!(" => type length={}", type_length);
459 // Rust code can easily create exponentially-long types using only a
460 // polynomial recursion depth. Even with the default recursion
461 // depth, you can easily get cases that take >2^60 steps to run,
462 // which means that rustc basically hangs.
464 // Bail out in these cases to avoid that bad user experience.
465 let type_length_limit = tcx.sess.type_length_limit.get();
466 if type_length > type_length_limit {
467 // The instance name is already known to be too long for rustc. Use
468 // `{:.64}` to avoid blasting the user's terminal with thousands of
469 // lines of type-name.
470 let instance_name = instance.to_string();
471 let msg = format!("reached the type-length limit while instantiating `{:.64}...`",
473 let mut diag = if let Some(node_id) = tcx.hir.as_local_node_id(instance.def_id()) {
474 tcx.sess.struct_span_fatal(tcx.hir.span(node_id), &msg)
476 tcx.sess.struct_fatal(&msg)
480 "consider adding a `#![type_length_limit=\"{}\"]` attribute to your crate",
481 type_length_limit*2));
483 tcx.sess.abort_if_errors();
487 struct MirNeighborCollector<'a, 'tcx: 'a> {
488 tcx: TyCtxt<'a, 'tcx, 'tcx>,
489 mir: &'a mir::Mir<'tcx>,
490 output: &'a mut Vec<TransItem<'tcx>>,
491 param_substs: &'tcx Substs<'tcx>,
495 impl<'a, 'tcx> MirVisitor<'tcx> for MirNeighborCollector<'a, 'tcx> {
497 fn visit_rvalue(&mut self, rvalue: &mir::Rvalue<'tcx>, location: Location) {
498 debug!("visiting rvalue {:?}", *rvalue);
501 // When doing an cast from a regular pointer to a fat pointer, we
502 // have to instantiate all methods of the trait being cast to, so we
503 // can build the appropriate vtable.
504 mir::Rvalue::Cast(mir::CastKind::Unsize, ref operand, target_ty) => {
505 let target_ty = self.tcx.trans_apply_param_substs(self.param_substs,
507 let source_ty = operand.ty(self.mir, self.tcx);
508 let source_ty = self.tcx.trans_apply_param_substs(self.param_substs,
510 let (source_ty, target_ty) = find_vtable_types_for_unsizing(self.tcx,
513 // This could also be a different Unsize instruction, like
514 // from a fixed sized array to a slice. But we are only
515 // interested in things that produce a vtable.
516 if target_ty.is_trait() && !source_ty.is_trait() {
517 create_trans_items_for_vtable_methods(self.tcx,
523 mir::Rvalue::Cast(mir::CastKind::ReifyFnPointer, ref operand, _) => {
524 let fn_ty = operand.ty(self.mir, self.tcx);
525 let fn_ty = self.tcx.trans_apply_param_substs(self.param_substs,
527 visit_fn_use(self.tcx, fn_ty, false, &mut self.output);
529 mir::Rvalue::Cast(mir::CastKind::ClosureFnPointer, ref operand, _) => {
530 let source_ty = operand.ty(self.mir, self.tcx);
531 let source_ty = self.tcx.trans_apply_param_substs(self.param_substs,
533 match source_ty.sty {
534 ty::TyClosure(def_id, substs) => {
535 let instance = monomorphize::resolve_closure(
536 self.tcx, def_id, substs, ty::ClosureKind::FnOnce);
537 self.output.push(create_fn_trans_item(instance));
542 mir::Rvalue::NullaryOp(mir::NullOp::Box, _) => {
544 let exchange_malloc_fn_def_id = tcx
546 .require(ExchangeMallocFnLangItem)
547 .unwrap_or_else(|e| tcx.sess.fatal(&e));
548 let instance = Instance::mono(tcx, exchange_malloc_fn_def_id);
549 if should_trans_locally(tcx, &instance) {
550 self.output.push(create_fn_trans_item(instance));
553 _ => { /* not interesting */ }
556 self.super_rvalue(rvalue, location);
559 fn visit_const(&mut self, constant: &&'tcx ty::Const<'tcx>, location: Location) {
560 debug!("visiting const {:?} @ {:?}", *constant, location);
562 if let ConstVal::Unevaluated(def_id, substs) = constant.val {
563 let substs = self.tcx.trans_apply_param_substs(self.param_substs,
565 let instance = monomorphize::resolve(self.tcx, def_id, substs);
566 collect_neighbours(self.tcx, instance, true, self.output);
569 self.super_const(constant);
572 fn visit_terminator_kind(&mut self,
573 block: mir::BasicBlock,
574 kind: &mir::TerminatorKind<'tcx>,
575 location: Location) {
576 debug!("visiting terminator {:?} @ {:?}", kind, location);
580 mir::TerminatorKind::Call { ref func, .. } => {
581 let callee_ty = func.ty(self.mir, tcx);
582 let callee_ty = tcx.trans_apply_param_substs(self.param_substs, &callee_ty);
584 let constness = match (self.const_context, &callee_ty.sty) {
585 (true, &ty::TyFnDef(def_id, substs)) if self.tcx.is_const_fn(def_id) => {
586 let instance = monomorphize::resolve(self.tcx, def_id, substs);
592 if let Some(const_fn_instance) = constness {
593 // If this is a const fn, called from a const context, we
594 // have to visit its body in order to find any fn reifications
596 collect_neighbours(self.tcx,
601 visit_fn_use(self.tcx, callee_ty, true, &mut self.output);
604 mir::TerminatorKind::Drop { ref location, .. } |
605 mir::TerminatorKind::DropAndReplace { ref location, .. } => {
606 let ty = location.ty(self.mir, self.tcx)
608 let ty = tcx.trans_apply_param_substs(self.param_substs, &ty);
609 visit_drop_use(self.tcx, ty, true, self.output);
611 mir::TerminatorKind::Goto { .. } |
612 mir::TerminatorKind::SwitchInt { .. } |
613 mir::TerminatorKind::Resume |
614 mir::TerminatorKind::Return |
615 mir::TerminatorKind::Unreachable |
616 mir::TerminatorKind::Assert { .. } => {}
617 mir::TerminatorKind::GeneratorDrop |
618 mir::TerminatorKind::Yield { .. } => bug!(),
621 self.super_terminator_kind(block, kind, location);
624 fn visit_static(&mut self,
625 static_: &mir::Static<'tcx>,
626 context: mir::visit::LvalueContext<'tcx>,
627 location: Location) {
628 debug!("visiting static {:?} @ {:?}", static_.def_id, location);
631 let instance = Instance::mono(tcx, static_.def_id);
632 if should_trans_locally(tcx, &instance) {
633 let node_id = tcx.hir.as_local_node_id(static_.def_id).unwrap();
634 self.output.push(TransItem::Static(node_id));
637 self.super_static(static_, context, location);
641 fn visit_drop_use<'a, 'tcx>(tcx: TyCtxt<'a, 'tcx, 'tcx>,
643 is_direct_call: bool,
644 output: &mut Vec<TransItem<'tcx>>)
646 let instance = monomorphize::resolve_drop_in_place(tcx, ty);
647 visit_instance_use(tcx, instance, is_direct_call, output);
650 fn visit_fn_use<'a, 'tcx>(tcx: TyCtxt<'a, 'tcx, 'tcx>,
652 is_direct_call: bool,
653 output: &mut Vec<TransItem<'tcx>>)
655 if let ty::TyFnDef(def_id, substs) = ty.sty {
656 let instance = monomorphize::resolve(tcx, def_id, substs);
657 visit_instance_use(tcx, instance, is_direct_call, output);
661 fn visit_instance_use<'a, 'tcx>(tcx: TyCtxt<'a, 'tcx, 'tcx>,
662 instance: ty::Instance<'tcx>,
663 is_direct_call: bool,
664 output: &mut Vec<TransItem<'tcx>>)
666 debug!("visit_item_use({:?}, is_direct_call={:?})", instance, is_direct_call);
667 if !should_trans_locally(tcx, &instance) {
672 ty::InstanceDef::Intrinsic(def_id) => {
674 bug!("intrinsic {:?} being reified", def_id);
677 ty::InstanceDef::Virtual(..) |
678 ty::InstanceDef::DropGlue(_, None) => {
679 // don't need to emit shim if we are calling directly.
681 output.push(create_fn_trans_item(instance));
684 ty::InstanceDef::DropGlue(_, Some(_)) => {
685 output.push(create_fn_trans_item(instance));
687 ty::InstanceDef::ClosureOnceShim { .. } |
688 ty::InstanceDef::Item(..) |
689 ty::InstanceDef::FnPtrShim(..) |
690 ty::InstanceDef::CloneShim(..) => {
691 output.push(create_fn_trans_item(instance));
696 // Returns true if we should translate an instance in the local crate.
697 // Returns false if we can just link to the upstream crate and therefore don't
698 // need a translation item.
699 fn should_trans_locally<'a, 'tcx>(tcx: TyCtxt<'a, 'tcx, 'tcx>, instance: &Instance<'tcx>)
701 let def_id = match instance.def {
702 ty::InstanceDef::Item(def_id) => def_id,
703 ty::InstanceDef::ClosureOnceShim { .. } |
704 ty::InstanceDef::Virtual(..) |
705 ty::InstanceDef::FnPtrShim(..) |
706 ty::InstanceDef::DropGlue(..) |
707 ty::InstanceDef::Intrinsic(_) |
708 ty::InstanceDef::CloneShim(..) => return true
710 match tcx.hir.get_if_local(def_id) {
711 Some(hir_map::NodeForeignItem(..)) => {
712 false // foreign items are linked against, not translated.
716 if tcx.is_exported_symbol(def_id) ||
717 tcx.is_foreign_item(def_id)
719 // We can link to the item in question, no instance needed
723 if !tcx.is_mir_available(def_id) {
724 bug!("Cannot create local trans-item for {:?}", def_id)
732 /// For given pair of source and target type that occur in an unsizing coercion,
733 /// this function finds the pair of types that determines the vtable linking
736 /// For example, the source type might be `&SomeStruct` and the target type\
737 /// might be `&SomeTrait` in a cast like:
739 /// let src: &SomeStruct = ...;
740 /// let target = src as &SomeTrait;
742 /// Then the output of this function would be (SomeStruct, SomeTrait) since for
743 /// constructing the `target` fat-pointer we need the vtable for that pair.
745 /// Things can get more complicated though because there's also the case where
746 /// the unsized type occurs as a field:
749 /// struct ComplexStruct<T: ?Sized> {
756 /// In this case, if `T` is sized, `&ComplexStruct<T>` is a thin pointer. If `T`
757 /// is unsized, `&SomeStruct` is a fat pointer, and the vtable it points to is
758 /// for the pair of `T` (which is a trait) and the concrete type that `T` was
759 /// originally coerced from:
761 /// let src: &ComplexStruct<SomeStruct> = ...;
762 /// let target = src as &ComplexStruct<SomeTrait>;
764 /// Again, we want this `find_vtable_types_for_unsizing()` to provide the pair
765 /// `(SomeStruct, SomeTrait)`.
767 /// Finally, there is also the case of custom unsizing coercions, e.g. for
768 /// smart pointers such as `Rc` and `Arc`.
769 fn find_vtable_types_for_unsizing<'a, 'tcx>(tcx: TyCtxt<'a, 'tcx, 'tcx>,
772 -> (Ty<'tcx>, Ty<'tcx>) {
773 let ptr_vtable = |inner_source: Ty<'tcx>, inner_target: Ty<'tcx>| {
774 if !type_is_sized(tcx, inner_source) {
775 (inner_source, inner_target)
777 tcx.struct_lockstep_tails(inner_source, inner_target)
780 match (&source_ty.sty, &target_ty.sty) {
781 (&ty::TyRef(_, ty::TypeAndMut { ty: a, .. }),
782 &ty::TyRef(_, ty::TypeAndMut { ty: b, .. })) |
783 (&ty::TyRef(_, ty::TypeAndMut { ty: a, .. }),
784 &ty::TyRawPtr(ty::TypeAndMut { ty: b, .. })) |
785 (&ty::TyRawPtr(ty::TypeAndMut { ty: a, .. }),
786 &ty::TyRawPtr(ty::TypeAndMut { ty: b, .. })) => {
789 (&ty::TyAdt(def_a, _), &ty::TyAdt(def_b, _)) if def_a.is_box() && def_b.is_box() => {
790 ptr_vtable(source_ty.boxed_ty(), target_ty.boxed_ty())
793 (&ty::TyAdt(source_adt_def, source_substs),
794 &ty::TyAdt(target_adt_def, target_substs)) => {
795 assert_eq!(source_adt_def, target_adt_def);
798 monomorphize::custom_coerce_unsize_info(tcx, source_ty, target_ty);
800 let coerce_index = match kind {
801 CustomCoerceUnsized::Struct(i) => i
804 let source_fields = &source_adt_def.struct_variant().fields;
805 let target_fields = &target_adt_def.struct_variant().fields;
807 assert!(coerce_index < source_fields.len() &&
808 source_fields.len() == target_fields.len());
810 find_vtable_types_for_unsizing(tcx,
811 source_fields[coerce_index].ty(tcx,
813 target_fields[coerce_index].ty(tcx,
816 _ => bug!("find_vtable_types_for_unsizing: invalid coercion {:?} -> {:?}",
822 fn create_fn_trans_item<'a, 'tcx>(instance: Instance<'tcx>) -> TransItem<'tcx> {
823 debug!("create_fn_trans_item(instance={})", instance);
824 TransItem::Fn(instance)
827 /// Creates a `TransItem` for each method that is referenced by the vtable for
828 /// the given trait/impl pair.
829 fn create_trans_items_for_vtable_methods<'a, 'tcx>(tcx: TyCtxt<'a, 'tcx, 'tcx>,
832 output: &mut Vec<TransItem<'tcx>>) {
833 assert!(!trait_ty.needs_subst() && !trait_ty.has_escaping_regions() &&
834 !impl_ty.needs_subst() && !impl_ty.has_escaping_regions());
836 if let ty::TyDynamic(ref trait_ty, ..) = trait_ty.sty {
837 if let Some(principal) = trait_ty.principal() {
838 let poly_trait_ref = principal.with_self_ty(tcx, impl_ty);
839 assert!(!poly_trait_ref.has_escaping_regions());
841 // Walk all methods of the trait, including those of its supertraits
842 let methods = traits::get_vtable_methods(tcx, poly_trait_ref);
843 let methods = methods.filter_map(|method| method)
844 .map(|(def_id, substs)| monomorphize::resolve(tcx, def_id, substs))
845 .filter(|&instance| should_trans_locally(tcx, &instance))
846 .map(|instance| create_fn_trans_item(instance));
847 output.extend(methods);
849 // Also add the destructor
850 visit_drop_use(tcx, impl_ty, false, output);
854 //=-----------------------------------------------------------------------------
856 //=-----------------------------------------------------------------------------
858 struct RootCollector<'b, 'a: 'b, 'tcx: 'a + 'b> {
859 tcx: TyCtxt<'a, 'tcx, 'tcx>,
860 mode: TransItemCollectionMode,
861 output: &'b mut Vec<TransItem<'tcx>>,
864 impl<'b, 'a, 'v> ItemLikeVisitor<'v> for RootCollector<'b, 'a, 'v> {
865 fn visit_item(&mut self, item: &'v hir::Item) {
867 hir::ItemExternCrate(..) |
869 hir::ItemForeignMod(..) |
871 hir::ItemDefaultImpl(..) |
873 hir::ItemMod(..) => {
874 // Nothing to do, just keep recursing...
877 hir::ItemImpl(..) => {
878 if self.mode == TransItemCollectionMode::Eager {
879 create_trans_items_for_default_impls(self.tcx,
885 hir::ItemEnum(_, ref generics) |
886 hir::ItemStruct(_, ref generics) |
887 hir::ItemUnion(_, ref generics) => {
888 if !generics.is_parameterized() {
889 if self.mode == TransItemCollectionMode::Eager {
890 let def_id = self.tcx.hir.local_def_id(item.id);
891 debug!("RootCollector: ADT drop-glue for {}",
892 def_id_to_string(self.tcx, def_id));
894 let ty = def_ty(self.tcx, def_id, Substs::empty());
895 visit_drop_use(self.tcx, ty, true, self.output);
899 hir::ItemGlobalAsm(..) => {
900 debug!("RootCollector: ItemGlobalAsm({})",
901 def_id_to_string(self.tcx,
902 self.tcx.hir.local_def_id(item.id)));
903 self.output.push(TransItem::GlobalAsm(item.id));
905 hir::ItemStatic(..) => {
906 debug!("RootCollector: ItemStatic({})",
907 def_id_to_string(self.tcx,
908 self.tcx.hir.local_def_id(item.id)));
909 self.output.push(TransItem::Static(item.id));
911 hir::ItemConst(..) => {
912 // const items only generate translation items if they are
913 // actually used somewhere. Just declaring them is insufficient.
917 let def_id = tcx.hir.local_def_id(item.id);
919 if (self.mode == TransItemCollectionMode::Eager ||
920 !tcx.is_const_fn(def_id) || tcx.is_exported_symbol(def_id)) &&
921 !item_has_type_parameters(tcx, def_id) {
923 debug!("RootCollector: ItemFn({})",
924 def_id_to_string(tcx, def_id));
926 let instance = Instance::mono(tcx, def_id);
927 self.output.push(TransItem::Fn(instance));
933 fn visit_trait_item(&mut self, _: &'v hir::TraitItem) {
934 // Even if there's a default body with no explicit generics,
935 // it's still generic over some `Self: Trait`, so not a root.
938 fn visit_impl_item(&mut self, ii: &'v hir::ImplItem) {
940 hir::ImplItemKind::Method(hir::MethodSig { .. }, _) => {
942 let def_id = tcx.hir.local_def_id(ii.id);
944 if (self.mode == TransItemCollectionMode::Eager ||
945 !tcx.is_const_fn(def_id) ||
946 tcx.is_exported_symbol(def_id)) &&
947 !item_has_type_parameters(tcx, def_id) {
948 debug!("RootCollector: MethodImplItem({})",
949 def_id_to_string(tcx, def_id));
951 let instance = Instance::mono(tcx, def_id);
952 self.output.push(TransItem::Fn(instance));
955 _ => { /* Nothing to do here */ }
960 fn item_has_type_parameters<'a, 'tcx>(tcx: TyCtxt<'a, 'tcx, 'tcx>, def_id: DefId) -> bool {
961 let generics = tcx.generics_of(def_id);
962 generics.parent_types as usize + generics.types.len() > 0
965 fn create_trans_items_for_default_impls<'a, 'tcx>(tcx: TyCtxt<'a, 'tcx, 'tcx>,
966 item: &'tcx hir::Item,
967 output: &mut Vec<TransItem<'tcx>>) {
974 ref impl_item_refs) => {
975 if generics.is_type_parameterized() {
979 let impl_def_id = tcx.hir.local_def_id(item.id);
981 debug!("create_trans_items_for_default_impls(item={})",
982 def_id_to_string(tcx, impl_def_id));
984 if let Some(trait_ref) = tcx.impl_trait_ref(impl_def_id) {
985 let callee_substs = tcx.erase_regions(&trait_ref.substs);
986 let overridden_methods: FxHashSet<_> =
987 impl_item_refs.iter()
988 .map(|iiref| iiref.name)
990 for method in tcx.provided_trait_methods(trait_ref.def_id) {
991 if overridden_methods.contains(&method.name) {
995 if !tcx.generics_of(method.def_id).types.is_empty() {
1000 monomorphize::resolve(tcx, method.def_id, callee_substs);
1002 let trans_item = create_fn_trans_item(instance);
1003 if trans_item.is_instantiable(tcx) && should_trans_locally(tcx, &instance) {
1004 output.push(trans_item);
1015 /// Scan the MIR in order to find function calls, closures, and drop-glue
1016 fn collect_neighbours<'a, 'tcx>(tcx: TyCtxt<'a, 'tcx, 'tcx>,
1017 instance: Instance<'tcx>,
1018 const_context: bool,
1019 output: &mut Vec<TransItem<'tcx>>)
1021 let mir = tcx.instance_mir(instance.def);
1023 let mut visitor = MirNeighborCollector {
1027 param_substs: instance.substs,
1031 visitor.visit_mir(&mir);
1032 for promoted in &mir.promoted {
1033 visitor.mir = promoted;
1034 visitor.visit_mir(promoted);
1038 fn def_id_to_string<'a, 'tcx>(tcx: TyCtxt<'a, 'tcx, 'tcx>,
1041 let mut output = String::new();
1042 let printer = DefPathBasedNames::new(tcx, false, false);
1043 printer.push_def_path(def_id, &mut output);