1 //! Mono Item Collection
2 //! ====================
4 //! This module is responsible for discovering all items that will contribute
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 public 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 public function, method, or static item,
65 //! we create a mono item consisting of the items DefId and, since we only
66 //! consider non-generic items, an empty type-substitution set. (In eager
67 //! collection mode, during incremental compilation, all non-generic functions
68 //! are considered as roots, as well as when the `-Clink-dead-code` option is
69 //! specified. Functions marked `#[no_mangle]` and functions called by inlinable
70 //! functions also always act as roots.)
72 //! ### Finding neighbor nodes
73 //! Given a mono item node, we can discover neighbors by inspecting its
74 //! MIR. We walk the MIR and any time we hit upon something that signifies a
75 //! reference to another mono item, we have found a neighbor. Since the
76 //! mono item we are currently at is always monomorphic, we also know the
77 //! concrete type arguments of its neighbors, and so all neighbors again will be
78 //! monomorphic. The specific forms a reference to a neighboring node can take
79 //! in MIR are quite diverse. Here is an overview:
81 //! #### Calling Functions/Methods
82 //! The most obvious form of one mono item referencing another is a
83 //! function or method call (represented by a CALL terminator in MIR). But
84 //! calls are not the only thing that might introduce a reference between two
85 //! function mono items, and as we will see below, they are just a
86 //! specialization of the form described next, and consequently will not get any
87 //! special treatment in the algorithm.
89 //! #### Taking a reference to a function or method
90 //! A function does not need to actually be called in order to be a neighbor of
91 //! another function. It suffices to just take a reference in order to introduce
92 //! an edge. Consider the following example:
95 //! fn print_val<T: Display>(x: T) {
96 //! println!("{}", x);
99 //! fn call_fn(f: &Fn(i32), x: i32) {
104 //! let print_i32 = print_val::<i32>;
105 //! call_fn(&print_i32, 0);
108 //! The MIR of none of these functions will contain an explicit call to
109 //! `print_val::<i32>`. Nonetheless, in order to mono this program, we need
110 //! an instance of this function. Thus, whenever we encounter a function or
111 //! method in operand position, we treat it as a neighbor of the current
112 //! mono item. Calls are just a special case of that.
115 //! In a way, closures are a simple case. Since every closure object needs to be
116 //! constructed somewhere, we can reliably discover them by observing
117 //! `RValue::Aggregate` expressions with `AggregateKind::Closure`. This is also
118 //! true for closures inlined from other crates.
121 //! Drop glue mono items are introduced by MIR drop-statements. The
122 //! generated mono item will again have drop-glue item neighbors if the
123 //! type to be dropped contains nested values that also need to be dropped. It
124 //! might also have a function item neighbor for the explicit `Drop::drop`
125 //! implementation of its type.
127 //! #### Unsizing Casts
128 //! A subtle way of introducing neighbor edges is by casting to a trait object.
129 //! Since the resulting fat-pointer contains a reference to a vtable, we need to
130 //! instantiate all object-save methods of the trait, as we need to store
131 //! pointers to these functions even if they never get called anywhere. This can
132 //! be seen as a special case of taking a function reference.
135 //! Since `Box` expression have special compiler support, no explicit calls to
136 //! `exchange_malloc()` and `box_free()` may show up in MIR, even if the
137 //! compiler will generate them. We have to observe `Rvalue::Box` expressions
138 //! and Box-typed drop-statements for that purpose.
141 //! Interaction with Cross-Crate Inlining
142 //! -------------------------------------
143 //! The binary of a crate will not only contain machine code for the items
144 //! defined in the source code of that crate. It will also contain monomorphic
145 //! instantiations of any extern generic functions and of functions marked with
147 //! The collection algorithm handles this more or less mono. If it is
148 //! about to create a mono item for something with an external `DefId`,
149 //! it will take a look if the MIR for that item is available, and if so just
150 //! proceed normally. If the MIR is not available, it assumes that the item is
151 //! just linked to and no node is created; which is exactly what we want, since
152 //! no machine code should be generated in the current crate for such an item.
154 //! Eager and Lazy Collection Mode
155 //! ------------------------------
156 //! Mono item collection can be performed in one of two modes:
158 //! - Lazy mode means that items will only be instantiated when actually
159 //! referenced. The goal is to produce the least amount of machine code
162 //! - Eager mode is meant to be used in conjunction with incremental compilation
163 //! where a stable set of mono items is more important than a minimal
164 //! one. Thus, eager mode will instantiate drop-glue for every drop-able type
165 //! in the crate, even if no drop call for that type exists (yet). It will
166 //! also instantiate default implementations of trait methods, something that
167 //! otherwise is only done on demand.
172 //! Some things are not yet fully implemented in the current version of this
176 //! Ideally, no mono item should be generated for const fns unless there
177 //! is a call to them that cannot be evaluated at compile time. At the moment
178 //! this is not implemented however: a mono item will be produced
179 //! regardless of whether it is actually needed or not.
181 use rustc_data_structures::fx::{FxHashMap, FxHashSet};
182 use rustc_data_structures::sync::{par_iter, MTLock, MTRef, ParallelIterator};
183 use rustc_hir as hir;
184 use rustc_hir::def_id::{DefId, DefIdMap, LocalDefId, LOCAL_CRATE};
185 use rustc_hir::itemlikevisit::ItemLikeVisitor;
186 use rustc_hir::lang_items::LangItem;
187 use rustc_index::bit_set::GrowableBitSet;
188 use rustc_middle::mir::interpret::{AllocId, ConstValue};
189 use rustc_middle::mir::interpret::{ErrorHandled, GlobalAlloc, Scalar};
190 use rustc_middle::mir::mono::{InstantiationMode, MonoItem};
191 use rustc_middle::mir::visit::Visitor as MirVisitor;
192 use rustc_middle::mir::{self, Local, Location};
193 use rustc_middle::ty::adjustment::{CustomCoerceUnsized, PointerCast};
194 use rustc_middle::ty::print::with_no_trimmed_paths;
195 use rustc_middle::ty::subst::{GenericArgKind, InternalSubsts};
196 use rustc_middle::ty::{self, GenericParamDefKind, Instance, Ty, TyCtxt, TypeFoldable, VtblEntry};
197 use rustc_middle::{middle::codegen_fn_attrs::CodegenFnAttrFlags, mir::visit::TyContext};
198 use rustc_session::config::EntryFnType;
199 use rustc_session::lint::builtin::LARGE_ASSIGNMENTS;
200 use rustc_session::Limit;
201 use rustc_span::source_map::{dummy_spanned, respan, Span, Spanned, DUMMY_SP};
202 use rustc_target::abi::Size;
203 use smallvec::SmallVec;
206 use std::path::PathBuf;
209 pub enum MonoItemCollectionMode {
214 /// Maps every mono item to all mono items it references in its
216 pub struct InliningMap<'tcx> {
217 // Maps a source mono item to the range of mono items
219 // The range selects elements within the `targets` vecs.
220 index: FxHashMap<MonoItem<'tcx>, Range<usize>>,
221 targets: Vec<MonoItem<'tcx>>,
223 // Contains one bit per mono item in the `targets` field. That bit
224 // is true if that mono item needs to be inlined into every CGU.
225 inlines: GrowableBitSet<usize>,
228 impl<'tcx> InliningMap<'tcx> {
229 fn new() -> InliningMap<'tcx> {
231 index: FxHashMap::default(),
233 inlines: GrowableBitSet::with_capacity(1024),
237 fn record_accesses(&mut self, source: MonoItem<'tcx>, new_targets: &[(MonoItem<'tcx>, bool)]) {
238 let start_index = self.targets.len();
239 let new_items_count = new_targets.len();
240 let new_items_count_total = new_items_count + self.targets.len();
242 self.targets.reserve(new_items_count);
243 self.inlines.ensure(new_items_count_total);
245 for (i, (target, inline)) in new_targets.iter().enumerate() {
246 self.targets.push(*target);
248 self.inlines.insert(i + start_index);
252 let end_index = self.targets.len();
253 assert!(self.index.insert(source, start_index..end_index).is_none());
256 // Internally iterate over all items referenced by `source` which will be
257 // made available for inlining.
258 pub fn with_inlining_candidates<F>(&self, source: MonoItem<'tcx>, mut f: F)
260 F: FnMut(MonoItem<'tcx>),
262 if let Some(range) = self.index.get(&source) {
263 for (i, candidate) in self.targets[range.clone()].iter().enumerate() {
264 if self.inlines.contains(range.start + i) {
271 // Internally iterate over all items and the things each accesses.
272 pub fn iter_accesses<F>(&self, mut f: F)
274 F: FnMut(MonoItem<'tcx>, &[MonoItem<'tcx>]),
276 for (&accessor, range) in &self.index {
277 f(accessor, &self.targets[range.clone()])
282 pub fn collect_crate_mono_items(
284 mode: MonoItemCollectionMode,
285 ) -> (FxHashSet<MonoItem<'_>>, InliningMap<'_>) {
286 let _prof_timer = tcx.prof.generic_activity("monomorphization_collector");
289 tcx.sess.time("monomorphization_collector_root_collections", || collect_roots(tcx, mode));
291 debug!("building mono item graph, beginning at roots");
293 let mut visited = MTLock::new(FxHashSet::default());
294 let mut inlining_map = MTLock::new(InliningMap::new());
295 let recursion_limit = tcx.recursion_limit();
298 let visited: MTRef<'_, _> = &mut visited;
299 let inlining_map: MTRef<'_, _> = &mut inlining_map;
301 tcx.sess.time("monomorphization_collector_graph_walk", || {
302 par_iter(roots).for_each(|root| {
303 let mut recursion_depths = DefIdMap::default();
308 &mut recursion_depths,
316 (visited.into_inner(), inlining_map.into_inner())
319 // Find all non-generic items by walking the HIR. These items serve as roots to
320 // start monomorphizing from.
321 fn collect_roots(tcx: TyCtxt<'_>, mode: MonoItemCollectionMode) -> Vec<MonoItem<'_>> {
322 debug!("collecting roots");
323 let mut roots = Vec::new();
326 let entry_fn = tcx.entry_fn(());
328 debug!("collect_roots: entry_fn = {:?}", entry_fn);
330 let mut visitor = RootCollector { tcx, mode, entry_fn, output: &mut roots };
332 tcx.hir().visit_all_item_likes(&mut visitor);
334 visitor.push_extra_entry_roots();
337 // We can only codegen items that are instantiable - items all of
338 // whose predicates hold. Luckily, items that aren't instantiable
339 // can't actually be used, so we can just skip codegenning them.
342 .filter_map(|root| root.node.is_instantiable(tcx).then_some(root.node))
346 /// Collect all monomorphized items reachable from `starting_point`, and emit a note diagnostic if a
347 /// post-monorphization error is encountered during a collection step.
348 fn collect_items_rec<'tcx>(
350 starting_point: Spanned<MonoItem<'tcx>>,
351 visited: MTRef<'_, MTLock<FxHashSet<MonoItem<'tcx>>>>,
352 recursion_depths: &mut DefIdMap<usize>,
353 recursion_limit: Limit,
354 inlining_map: MTRef<'_, MTLock<InliningMap<'tcx>>>,
356 if !visited.lock_mut().insert(starting_point.node) {
357 // We've been here already, no need to search again.
360 debug!("BEGIN collect_items_rec({})", starting_point.node);
362 let mut neighbors = Vec::new();
363 let recursion_depth_reset;
366 // Post-monomorphization errors MVP
368 // We can encounter errors while monomorphizing an item, but we don't have a good way of
369 // showing a complete stack of spans ultimately leading to collecting the erroneous one yet.
370 // (It's also currently unclear exactly which diagnostics and information would be interesting
371 // to report in such cases)
373 // This leads to suboptimal error reporting: a post-monomorphization error (PME) will be
374 // shown with just a spanned piece of code causing the error, without information on where
375 // it was called from. This is especially obscure if the erroneous mono item is in a
376 // dependency. See for example issue #85155, where, before minimization, a PME happened two
377 // crates downstream from libcore's stdarch, without a way to know which dependency was the
380 // If such an error occurs in the current crate, its span will be enough to locate the
381 // source. If the cause is in another crate, the goal here is to quickly locate which mono
382 // item in the current crate is ultimately responsible for causing the error.
384 // To give at least _some_ context to the user: while collecting mono items, we check the
385 // error count. If it has changed, a PME occurred, and we trigger some diagnostics about the
386 // current step of mono items collection.
388 let error_count = tcx.sess.diagnostic().err_count();
390 match starting_point.node {
391 MonoItem::Static(def_id) => {
392 let instance = Instance::mono(tcx, def_id);
394 // Sanity check whether this ended up being collected accidentally
395 debug_assert!(should_codegen_locally(tcx, &instance));
397 let ty = instance.ty(tcx, ty::ParamEnv::reveal_all());
398 visit_drop_use(tcx, ty, true, starting_point.span, &mut neighbors);
400 recursion_depth_reset = None;
402 if let Ok(alloc) = tcx.eval_static_initializer(def_id) {
403 for &id in alloc.inner().relocations().values() {
404 collect_miri(tcx, id, &mut neighbors);
408 MonoItem::Fn(instance) => {
409 // Sanity check whether this ended up being collected accidentally
410 debug_assert!(should_codegen_locally(tcx, &instance));
412 // Keep track of the monomorphization recursion depth
413 recursion_depth_reset = Some(check_recursion_limit(
420 check_type_length_limit(tcx, instance);
422 rustc_data_structures::stack::ensure_sufficient_stack(|| {
423 collect_neighbours(tcx, instance, &mut neighbors);
426 MonoItem::GlobalAsm(item_id) => {
427 recursion_depth_reset = None;
429 let item = tcx.hir().item(item_id);
430 if let hir::ItemKind::GlobalAsm(asm) = item.kind {
431 for (op, op_sp) in asm.operands {
433 hir::InlineAsmOperand::Const { .. } => {
434 // Only constants which resolve to a plain integer
435 // are supported. Therefore the value should not
436 // depend on any other items.
438 hir::InlineAsmOperand::SymFn { anon_const } => {
439 let def_id = tcx.hir().body_owner_def_id(anon_const.body).to_def_id();
440 if let Ok(val) = tcx.const_eval_poly(def_id) {
441 rustc_data_structures::stack::ensure_sufficient_stack(|| {
442 collect_const_value(tcx, val, &mut neighbors);
446 hir::InlineAsmOperand::SymStatic { path: _, def_id } => {
447 let instance = Instance::mono(tcx, *def_id);
448 if should_codegen_locally(tcx, &instance) {
449 trace!("collecting static {:?}", def_id);
450 neighbors.push(dummy_spanned(MonoItem::Static(*def_id)));
453 hir::InlineAsmOperand::In { .. }
454 | hir::InlineAsmOperand::Out { .. }
455 | hir::InlineAsmOperand::InOut { .. }
456 | hir::InlineAsmOperand::SplitInOut { .. } => {
457 span_bug!(*op_sp, "invalid operand type for global_asm!")
462 span_bug!(item.span, "Mismatch between hir::Item type and MonoItem type")
467 // Check for PMEs and emit a diagnostic if one happened. To try to show relevant edges of the
468 // mono item graph where the PME diagnostics are currently the most problematic (e.g. ones
469 // involving a dependency, and the lack of context is confusing) in this MVP, we focus on
470 // diagnostics on edges crossing a crate boundary: the collected mono items which are not
471 // defined in the local crate.
472 if tcx.sess.diagnostic().err_count() > error_count
473 && starting_point.node.krate() != LOCAL_CRATE
474 && starting_point.node.is_user_defined()
476 let formatted_item = with_no_trimmed_paths!(starting_point.node.to_string());
477 tcx.sess.span_note_without_error(
479 &format!("the above error was encountered while instantiating `{}`", formatted_item),
483 record_accesses(tcx, starting_point.node, neighbors.iter().map(|i| &i.node), inlining_map);
485 for neighbour in neighbors {
486 collect_items_rec(tcx, neighbour, visited, recursion_depths, recursion_limit, inlining_map);
489 if let Some((def_id, depth)) = recursion_depth_reset {
490 recursion_depths.insert(def_id, depth);
493 debug!("END collect_items_rec({})", starting_point.node);
496 fn record_accesses<'a, 'tcx: 'a>(
498 caller: MonoItem<'tcx>,
499 callees: impl Iterator<Item = &'a MonoItem<'tcx>>,
500 inlining_map: MTRef<'_, MTLock<InliningMap<'tcx>>>,
502 let is_inlining_candidate = |mono_item: &MonoItem<'tcx>| {
503 mono_item.instantiation_mode(tcx) == InstantiationMode::LocalCopy
506 // We collect this into a `SmallVec` to avoid calling `is_inlining_candidate` in the lock.
507 // FIXME: Call `is_inlining_candidate` when pushing to `neighbors` in `collect_items_rec`
508 // instead to avoid creating this `SmallVec`.
509 let accesses: SmallVec<[_; 128]> =
510 callees.map(|mono_item| (*mono_item, is_inlining_candidate(mono_item))).collect();
512 inlining_map.lock_mut().record_accesses(caller, &accesses);
515 /// Format instance name that is already known to be too long for rustc.
516 /// Show only the first and last 32 characters to avoid blasting
517 /// the user's terminal with thousands of lines of type-name.
519 /// If the type name is longer than before+after, it will be written to a file.
520 fn shrunk_instance_name<'tcx>(
522 instance: &Instance<'tcx>,
525 ) -> (String, Option<PathBuf>) {
526 let s = instance.to_string();
528 // Only use the shrunk version if it's really shorter.
529 // This also avoids the case where before and after slices overlap.
530 if s.chars().nth(before + after + 1).is_some() {
531 // An iterator of all byte positions including the end of the string.
532 let positions = || s.char_indices().map(|(i, _)| i).chain(iter::once(s.len()));
534 let shrunk = format!(
535 "{before}...{after}",
536 before = &s[..positions().nth(before).unwrap_or(s.len())],
537 after = &s[positions().rev().nth(after).unwrap_or(0)..],
540 let path = tcx.output_filenames(()).temp_path_ext("long-type.txt", None);
541 let written_to_path = std::fs::write(&path, s).ok().map(|_| path);
543 (shrunk, written_to_path)
549 fn check_recursion_limit<'tcx>(
551 instance: Instance<'tcx>,
553 recursion_depths: &mut DefIdMap<usize>,
554 recursion_limit: Limit,
555 ) -> (DefId, usize) {
556 let def_id = instance.def_id();
557 let recursion_depth = recursion_depths.get(&def_id).cloned().unwrap_or(0);
558 debug!(" => recursion depth={}", recursion_depth);
560 let adjusted_recursion_depth = if Some(def_id) == tcx.lang_items().drop_in_place_fn() {
561 // HACK: drop_in_place creates tight monomorphization loops. Give
568 // Code that needs to instantiate the same function recursively
569 // more than the recursion limit is assumed to be causing an
570 // infinite expansion.
571 if !recursion_limit.value_within_limit(adjusted_recursion_depth) {
572 let (shrunk, written_to_path) = shrunk_instance_name(tcx, &instance, 32, 32);
573 let error = format!("reached the recursion limit while instantiating `{}`", shrunk);
574 let mut err = tcx.sess.struct_span_fatal(span, &error);
576 tcx.def_span(def_id),
577 &format!("`{}` defined here", tcx.def_path_str(def_id)),
579 if let Some(path) = written_to_path {
580 err.note(&format!("the full type name has been written to '{}'", path.display()));
585 recursion_depths.insert(def_id, recursion_depth + 1);
587 (def_id, recursion_depth)
590 fn check_type_length_limit<'tcx>(tcx: TyCtxt<'tcx>, instance: Instance<'tcx>) {
591 let type_length = instance
594 .flat_map(|arg| arg.walk())
595 .filter(|arg| match arg.unpack() {
596 GenericArgKind::Type(_) | GenericArgKind::Const(_) => true,
597 GenericArgKind::Lifetime(_) => false,
600 debug!(" => type length={}", type_length);
602 // Rust code can easily create exponentially-long types using only a
603 // polynomial recursion depth. Even with the default recursion
604 // depth, you can easily get cases that take >2^60 steps to run,
605 // which means that rustc basically hangs.
607 // Bail out in these cases to avoid that bad user experience.
608 if !tcx.type_length_limit().value_within_limit(type_length) {
609 let (shrunk, written_to_path) = shrunk_instance_name(tcx, &instance, 32, 32);
610 let msg = format!("reached the type-length limit while instantiating `{}`", shrunk);
611 let mut diag = tcx.sess.struct_span_fatal(tcx.def_span(instance.def_id()), &msg);
612 if let Some(path) = written_to_path {
613 diag.note(&format!("the full type name has been written to '{}'", path.display()));
616 "consider adding a `#![type_length_limit=\"{}\"]` attribute to your crate",
623 struct MirNeighborCollector<'a, 'tcx> {
625 body: &'a mir::Body<'tcx>,
626 output: &'a mut Vec<Spanned<MonoItem<'tcx>>>,
627 instance: Instance<'tcx>,
630 impl<'a, 'tcx> MirNeighborCollector<'a, 'tcx> {
631 pub fn monomorphize<T>(&self, value: T) -> T
633 T: TypeFoldable<'tcx>,
635 debug!("monomorphize: self.instance={:?}", self.instance);
636 self.instance.subst_mir_and_normalize_erasing_regions(
638 ty::ParamEnv::reveal_all(),
644 impl<'a, 'tcx> MirVisitor<'tcx> for MirNeighborCollector<'a, 'tcx> {
645 fn visit_rvalue(&mut self, rvalue: &mir::Rvalue<'tcx>, location: Location) {
646 debug!("visiting rvalue {:?}", *rvalue);
648 let span = self.body.source_info(location).span;
651 // When doing an cast from a regular pointer to a fat pointer, we
652 // have to instantiate all methods of the trait being cast to, so we
653 // can build the appropriate vtable.
655 mir::CastKind::Pointer(PointerCast::Unsize),
659 let target_ty = self.monomorphize(target_ty);
660 let source_ty = operand.ty(self.body, self.tcx);
661 let source_ty = self.monomorphize(source_ty);
662 let (source_ty, target_ty) =
663 find_vtable_types_for_unsizing(self.tcx, source_ty, target_ty);
664 // This could also be a different Unsize instruction, like
665 // from a fixed sized array to a slice. But we are only
666 // interested in things that produce a vtable.
667 if target_ty.is_trait() && !source_ty.is_trait() {
668 create_mono_items_for_vtable_methods(
678 mir::CastKind::Pointer(PointerCast::ReifyFnPointer),
682 let fn_ty = operand.ty(self.body, self.tcx);
683 let fn_ty = self.monomorphize(fn_ty);
684 visit_fn_use(self.tcx, fn_ty, false, span, &mut self.output);
687 mir::CastKind::Pointer(PointerCast::ClosureFnPointer(_)),
691 let source_ty = operand.ty(self.body, self.tcx);
692 let source_ty = self.monomorphize(source_ty);
693 match *source_ty.kind() {
694 ty::Closure(def_id, substs) => {
695 let instance = Instance::resolve_closure(
699 ty::ClosureKind::FnOnce,
701 if should_codegen_locally(self.tcx, &instance) {
702 self.output.push(create_fn_mono_item(self.tcx, instance, span));
708 mir::Rvalue::ThreadLocalRef(def_id) => {
709 assert!(self.tcx.is_thread_local_static(def_id));
710 let instance = Instance::mono(self.tcx, def_id);
711 if should_codegen_locally(self.tcx, &instance) {
712 trace!("collecting thread-local static {:?}", def_id);
713 self.output.push(respan(span, MonoItem::Static(def_id)));
716 _ => { /* not interesting */ }
719 self.super_rvalue(rvalue, location);
722 /// This does not walk the constant, as it has been handled entirely here and trying
723 /// to walk it would attempt to evaluate the `ty::Const` inside, which doesn't necessarily
724 /// work, as some constants cannot be represented in the type system.
725 fn visit_constant(&mut self, constant: &mir::Constant<'tcx>, location: Location) {
726 let literal = self.monomorphize(constant.literal);
727 let val = match literal {
728 mir::ConstantKind::Val(val, _) => val,
729 mir::ConstantKind::Ty(ct) => match ct.val() {
730 ty::ConstKind::Value(val) => val,
731 ty::ConstKind::Unevaluated(ct) => {
732 let param_env = ty::ParamEnv::reveal_all();
733 match self.tcx.const_eval_resolve(param_env, ct, None) {
734 // The `monomorphize` call should have evaluated that constant already.
736 Err(ErrorHandled::Reported(_) | ErrorHandled::Linted) => return,
737 Err(ErrorHandled::TooGeneric) => span_bug!(
738 self.body.source_info(location).span,
739 "collection encountered polymorphic constant: {:?}",
747 collect_const_value(self.tcx, val, self.output);
748 self.visit_ty(literal.ty(), TyContext::Location(location));
751 fn visit_const(&mut self, constant: ty::Const<'tcx>, location: Location) {
752 debug!("visiting const {:?} @ {:?}", constant, location);
754 let substituted_constant = self.monomorphize(constant);
755 let param_env = ty::ParamEnv::reveal_all();
757 match substituted_constant.val() {
758 ty::ConstKind::Value(val) => collect_const_value(self.tcx, val, self.output),
759 ty::ConstKind::Unevaluated(unevaluated) => {
760 match self.tcx.const_eval_resolve(param_env, unevaluated, None) {
761 // The `monomorphize` call should have evaluated that constant already.
762 Ok(val) => span_bug!(
763 self.body.source_info(location).span,
764 "collection encountered the unevaluated constant {} which evaluated to {:?}",
765 substituted_constant,
768 Err(ErrorHandled::Reported(_) | ErrorHandled::Linted) => {}
769 Err(ErrorHandled::TooGeneric) => span_bug!(
770 self.body.source_info(location).span,
771 "collection encountered polymorphic constant: {}",
779 self.super_const(constant);
782 fn visit_terminator(&mut self, terminator: &mir::Terminator<'tcx>, location: Location) {
783 debug!("visiting terminator {:?} @ {:?}", terminator, location);
784 let source = self.body.source_info(location).span;
787 match terminator.kind {
788 mir::TerminatorKind::Call { ref func, .. } => {
789 let callee_ty = func.ty(self.body, tcx);
790 let callee_ty = self.monomorphize(callee_ty);
791 visit_fn_use(self.tcx, callee_ty, true, source, &mut self.output);
793 mir::TerminatorKind::Drop { ref place, .. }
794 | mir::TerminatorKind::DropAndReplace { ref place, .. } => {
795 let ty = place.ty(self.body, self.tcx).ty;
796 let ty = self.monomorphize(ty);
797 visit_drop_use(self.tcx, ty, true, source, self.output);
799 mir::TerminatorKind::InlineAsm { ref operands, .. } => {
802 mir::InlineAsmOperand::SymFn { ref value } => {
803 let fn_ty = self.monomorphize(value.literal.ty());
804 visit_fn_use(self.tcx, fn_ty, false, source, &mut self.output);
806 mir::InlineAsmOperand::SymStatic { def_id } => {
807 let instance = Instance::mono(self.tcx, def_id);
808 if should_codegen_locally(self.tcx, &instance) {
809 trace!("collecting asm sym static {:?}", def_id);
810 self.output.push(respan(source, MonoItem::Static(def_id)));
817 mir::TerminatorKind::Assert { ref msg, .. } => {
818 let lang_item = match msg {
819 mir::AssertKind::BoundsCheck { .. } => LangItem::PanicBoundsCheck,
820 _ => LangItem::Panic,
822 let instance = Instance::mono(tcx, tcx.require_lang_item(lang_item, Some(source)));
823 if should_codegen_locally(tcx, &instance) {
824 self.output.push(create_fn_mono_item(tcx, instance, source));
827 mir::TerminatorKind::Abort { .. } => {
828 let instance = Instance::mono(
830 tcx.require_lang_item(LangItem::PanicNoUnwind, Some(source)),
832 if should_codegen_locally(tcx, &instance) {
833 self.output.push(create_fn_mono_item(tcx, instance, source));
836 mir::TerminatorKind::Goto { .. }
837 | mir::TerminatorKind::SwitchInt { .. }
838 | mir::TerminatorKind::Resume
839 | mir::TerminatorKind::Return
840 | mir::TerminatorKind::Unreachable => {}
841 mir::TerminatorKind::GeneratorDrop
842 | mir::TerminatorKind::Yield { .. }
843 | mir::TerminatorKind::FalseEdge { .. }
844 | mir::TerminatorKind::FalseUnwind { .. } => bug!(),
847 self.super_terminator(terminator, location);
850 fn visit_operand(&mut self, operand: &mir::Operand<'tcx>, location: Location) {
851 self.super_operand(operand, location);
852 let limit = self.tcx.move_size_limit().0;
856 let limit = Size::from_bytes(limit);
857 let ty = operand.ty(self.body, self.tcx);
858 let ty = self.monomorphize(ty);
859 let layout = self.tcx.layout_of(ty::ParamEnv::reveal_all().and(ty));
860 if let Ok(layout) = layout {
861 if layout.size > limit {
863 let source_info = self.body.source_info(location);
864 debug!(?source_info);
865 let lint_root = source_info.scope.lint_root(&self.body.source_scopes);
867 let Some(lint_root) = lint_root else {
868 // This happens when the issue is in a function from a foreign crate that
869 // we monomorphized in the current crate. We can't get a `HirId` for things
871 // FIXME: Find out where to report the lint on. Maybe simply crate-level lint root
872 // but correct span? This would make the lint at least accept crate-level lint attributes.
875 self.tcx.struct_span_lint_hir(
880 let mut err = lint.build(&format!("moving {} bytes", layout.size.bytes()));
881 err.span_label(source_info.span, "value moved from here");
882 err.note(&format!(r#"The current maximum size is {}, but it can be customized with the move_size_limit attribute: `#![move_size_limit = "..."]`"#, limit.bytes()));
892 _place_local: &Local,
893 _context: mir::visit::PlaceContext,
899 fn visit_drop_use<'tcx>(
902 is_direct_call: bool,
904 output: &mut Vec<Spanned<MonoItem<'tcx>>>,
906 let instance = Instance::resolve_drop_in_place(tcx, ty);
907 visit_instance_use(tcx, instance, is_direct_call, source, output);
910 fn visit_fn_use<'tcx>(
913 is_direct_call: bool,
915 output: &mut Vec<Spanned<MonoItem<'tcx>>>,
917 if let ty::FnDef(def_id, substs) = *ty.kind() {
918 let instance = if is_direct_call {
919 ty::Instance::resolve(tcx, ty::ParamEnv::reveal_all(), def_id, substs).unwrap().unwrap()
921 ty::Instance::resolve_for_fn_ptr(tcx, ty::ParamEnv::reveal_all(), def_id, substs)
924 visit_instance_use(tcx, instance, is_direct_call, source, output);
928 fn visit_instance_use<'tcx>(
930 instance: ty::Instance<'tcx>,
931 is_direct_call: bool,
933 output: &mut Vec<Spanned<MonoItem<'tcx>>>,
935 debug!("visit_item_use({:?}, is_direct_call={:?})", instance, is_direct_call);
936 if !should_codegen_locally(tcx, &instance) {
941 ty::InstanceDef::Virtual(..) | ty::InstanceDef::Intrinsic(_) => {
943 bug!("{:?} being reified", instance);
946 ty::InstanceDef::DropGlue(_, None) => {
947 // Don't need to emit noop drop glue if we are calling directly.
949 output.push(create_fn_mono_item(tcx, instance, source));
952 ty::InstanceDef::DropGlue(_, Some(_))
953 | ty::InstanceDef::VtableShim(..)
954 | ty::InstanceDef::ReifyShim(..)
955 | ty::InstanceDef::ClosureOnceShim { .. }
956 | ty::InstanceDef::Item(..)
957 | ty::InstanceDef::FnPtrShim(..)
958 | ty::InstanceDef::CloneShim(..) => {
959 output.push(create_fn_mono_item(tcx, instance, source));
964 /// Returns `true` if we should codegen an instance in the local crate, or returns `false` if we
965 /// can just link to the upstream crate and therefore don't need a mono item.
966 fn should_codegen_locally<'tcx>(tcx: TyCtxt<'tcx>, instance: &Instance<'tcx>) -> bool {
967 let Some(def_id) = instance.def.def_id_if_not_guaranteed_local_codegen() else {
971 if tcx.is_foreign_item(def_id) {
972 // Foreign items are always linked against, there's no way of instantiating them.
976 if def_id.is_local() {
977 // Local items cannot be referred to locally without monomorphizing them locally.
981 if tcx.is_reachable_non_generic(def_id)
982 || instance.polymorphize(tcx).upstream_monomorphization(tcx).is_some()
984 // We can link to the item in question, no instance needed in this crate.
988 if !tcx.is_mir_available(def_id) {
989 bug!("no MIR available for {:?}", def_id);
995 /// For a given pair of source and target type that occur in an unsizing coercion,
996 /// this function finds the pair of types that determines the vtable linking
999 /// For example, the source type might be `&SomeStruct` and the target type
1000 /// might be `&SomeTrait` in a cast like:
1002 /// let src: &SomeStruct = ...;
1003 /// let target = src as &SomeTrait;
1005 /// Then the output of this function would be (SomeStruct, SomeTrait) since for
1006 /// constructing the `target` fat-pointer we need the vtable for that pair.
1008 /// Things can get more complicated though because there's also the case where
1009 /// the unsized type occurs as a field:
1012 /// struct ComplexStruct<T: ?Sized> {
1019 /// In this case, if `T` is sized, `&ComplexStruct<T>` is a thin pointer. If `T`
1020 /// is unsized, `&SomeStruct` is a fat pointer, and the vtable it points to is
1021 /// for the pair of `T` (which is a trait) and the concrete type that `T` was
1022 /// originally coerced from:
1024 /// let src: &ComplexStruct<SomeStruct> = ...;
1025 /// let target = src as &ComplexStruct<SomeTrait>;
1027 /// Again, we want this `find_vtable_types_for_unsizing()` to provide the pair
1028 /// `(SomeStruct, SomeTrait)`.
1030 /// Finally, there is also the case of custom unsizing coercions, e.g., for
1031 /// smart pointers such as `Rc` and `Arc`.
1032 fn find_vtable_types_for_unsizing<'tcx>(
1034 source_ty: Ty<'tcx>,
1035 target_ty: Ty<'tcx>,
1036 ) -> (Ty<'tcx>, Ty<'tcx>) {
1037 let ptr_vtable = |inner_source: Ty<'tcx>, inner_target: Ty<'tcx>| {
1038 let param_env = ty::ParamEnv::reveal_all();
1039 let type_has_metadata = |ty: Ty<'tcx>| -> bool {
1040 if ty.is_sized(tcx.at(DUMMY_SP), param_env) {
1043 let tail = tcx.struct_tail_erasing_lifetimes(ty, param_env);
1045 ty::Foreign(..) => false,
1046 ty::Str | ty::Slice(..) | ty::Dynamic(..) => true,
1047 _ => bug!("unexpected unsized tail: {:?}", tail),
1050 if type_has_metadata(inner_source) {
1051 (inner_source, inner_target)
1053 tcx.struct_lockstep_tails_erasing_lifetimes(inner_source, inner_target, param_env)
1057 match (&source_ty.kind(), &target_ty.kind()) {
1058 (&ty::Ref(_, a, _), &ty::Ref(_, b, _) | &ty::RawPtr(ty::TypeAndMut { ty: b, .. }))
1059 | (&ty::RawPtr(ty::TypeAndMut { ty: a, .. }), &ty::RawPtr(ty::TypeAndMut { ty: b, .. })) => {
1062 (&ty::Adt(def_a, _), &ty::Adt(def_b, _)) if def_a.is_box() && def_b.is_box() => {
1063 ptr_vtable(source_ty.boxed_ty(), target_ty.boxed_ty())
1066 (&ty::Adt(source_adt_def, source_substs), &ty::Adt(target_adt_def, target_substs)) => {
1067 assert_eq!(source_adt_def, target_adt_def);
1069 let CustomCoerceUnsized::Struct(coerce_index) =
1070 crate::custom_coerce_unsize_info(tcx, source_ty, target_ty);
1072 let source_fields = &source_adt_def.non_enum_variant().fields;
1073 let target_fields = &target_adt_def.non_enum_variant().fields;
1076 coerce_index < source_fields.len() && source_fields.len() == target_fields.len()
1079 find_vtable_types_for_unsizing(
1081 source_fields[coerce_index].ty(tcx, source_substs),
1082 target_fields[coerce_index].ty(tcx, target_substs),
1086 "find_vtable_types_for_unsizing: invalid coercion {:?} -> {:?}",
1093 fn create_fn_mono_item<'tcx>(
1095 instance: Instance<'tcx>,
1097 ) -> Spanned<MonoItem<'tcx>> {
1098 debug!("create_fn_mono_item(instance={})", instance);
1100 let def_id = instance.def_id();
1101 if tcx.sess.opts.debugging_opts.profile_closures && def_id.is_local() && tcx.is_closure(def_id)
1103 crate::util::dump_closure_profile(tcx, instance);
1106 respan(source, MonoItem::Fn(instance.polymorphize(tcx)))
1109 /// Creates a `MonoItem` for each method that is referenced by the vtable for
1110 /// the given trait/impl pair.
1111 fn create_mono_items_for_vtable_methods<'tcx>(
1116 output: &mut Vec<Spanned<MonoItem<'tcx>>>,
1118 assert!(!trait_ty.has_escaping_bound_vars() && !impl_ty.has_escaping_bound_vars());
1120 if let ty::Dynamic(ref trait_ty, ..) = trait_ty.kind() {
1121 if let Some(principal) = trait_ty.principal() {
1122 let poly_trait_ref = principal.with_self_ty(tcx, impl_ty);
1123 assert!(!poly_trait_ref.has_escaping_bound_vars());
1125 // Walk all methods of the trait, including those of its supertraits
1126 let entries = tcx.vtable_entries(poly_trait_ref);
1127 let methods = entries
1129 .filter_map(|entry| match entry {
1130 VtblEntry::MetadataDropInPlace
1131 | VtblEntry::MetadataSize
1132 | VtblEntry::MetadataAlign
1133 | VtblEntry::Vacant => None,
1134 VtblEntry::TraitVPtr(_) => {
1135 // all super trait items already covered, so skip them.
1138 VtblEntry::Method(instance) => {
1139 Some(*instance).filter(|instance| should_codegen_locally(tcx, instance))
1142 .map(|item| create_fn_mono_item(tcx, item, source));
1143 output.extend(methods);
1146 // Also add the destructor.
1147 visit_drop_use(tcx, impl_ty, false, source, output);
1151 //=-----------------------------------------------------------------------------
1153 //=-----------------------------------------------------------------------------
1155 struct RootCollector<'a, 'tcx> {
1157 mode: MonoItemCollectionMode,
1158 output: &'a mut Vec<Spanned<MonoItem<'tcx>>>,
1159 entry_fn: Option<(DefId, EntryFnType)>,
1162 impl<'v> ItemLikeVisitor<'v> for RootCollector<'_, 'v> {
1163 fn visit_item(&mut self, item: &'v hir::Item<'v>) {
1165 hir::ItemKind::ExternCrate(..)
1166 | hir::ItemKind::Use(..)
1167 | hir::ItemKind::Macro(..)
1168 | hir::ItemKind::ForeignMod { .. }
1169 | hir::ItemKind::TyAlias(..)
1170 | hir::ItemKind::Trait(..)
1171 | hir::ItemKind::TraitAlias(..)
1172 | hir::ItemKind::OpaqueTy(..)
1173 | hir::ItemKind::Mod(..) => {
1174 // Nothing to do, just keep recursing.
1177 hir::ItemKind::Impl { .. } => {
1178 if self.mode == MonoItemCollectionMode::Eager {
1179 create_mono_items_for_default_impls(self.tcx, item, self.output);
1183 hir::ItemKind::Enum(_, ref generics)
1184 | hir::ItemKind::Struct(_, ref generics)
1185 | hir::ItemKind::Union(_, ref generics) => {
1186 if generics.params.is_empty() {
1187 if self.mode == MonoItemCollectionMode::Eager {
1189 "RootCollector: ADT drop-glue for {}",
1190 self.tcx.def_path_str(item.def_id.to_def_id())
1193 let ty = Instance::new(item.def_id.to_def_id(), InternalSubsts::empty())
1194 .ty(self.tcx, ty::ParamEnv::reveal_all());
1195 visit_drop_use(self.tcx, ty, true, DUMMY_SP, self.output);
1199 hir::ItemKind::GlobalAsm(..) => {
1201 "RootCollector: ItemKind::GlobalAsm({})",
1202 self.tcx.def_path_str(item.def_id.to_def_id())
1204 self.output.push(dummy_spanned(MonoItem::GlobalAsm(item.item_id())));
1206 hir::ItemKind::Static(..) => {
1208 "RootCollector: ItemKind::Static({})",
1209 self.tcx.def_path_str(item.def_id.to_def_id())
1211 self.output.push(dummy_spanned(MonoItem::Static(item.def_id.to_def_id())));
1213 hir::ItemKind::Const(..) => {
1214 // const items only generate mono items if they are
1215 // actually used somewhere. Just declaring them is insufficient.
1217 // but even just declaring them must collect the items they refer to
1218 if let Ok(val) = self.tcx.const_eval_poly(item.def_id.to_def_id()) {
1219 collect_const_value(self.tcx, val, &mut self.output);
1222 hir::ItemKind::Fn(..) => {
1223 self.push_if_root(item.def_id);
1228 fn visit_trait_item(&mut self, _: &'v hir::TraitItem<'v>) {
1229 // Even if there's a default body with no explicit generics,
1230 // it's still generic over some `Self: Trait`, so not a root.
1233 fn visit_impl_item(&mut self, ii: &'v hir::ImplItem<'v>) {
1234 if let hir::ImplItemKind::Fn(hir::FnSig { .. }, _) = ii.kind {
1235 self.push_if_root(ii.def_id);
1239 fn visit_foreign_item(&mut self, _foreign_item: &'v hir::ForeignItem<'v>) {}
1242 impl<'v> RootCollector<'_, 'v> {
1243 fn is_root(&self, def_id: LocalDefId) -> bool {
1244 !item_requires_monomorphization(self.tcx, def_id)
1245 && match self.mode {
1246 MonoItemCollectionMode::Eager => true,
1247 MonoItemCollectionMode::Lazy => {
1248 self.entry_fn.and_then(|(id, _)| id.as_local()) == Some(def_id)
1249 || self.tcx.is_reachable_non_generic(def_id)
1252 .codegen_fn_attrs(def_id)
1254 .contains(CodegenFnAttrFlags::RUSTC_STD_INTERNAL_SYMBOL)
1259 /// If `def_id` represents a root, pushes it onto the list of
1260 /// outputs. (Note that all roots must be monomorphic.)
1261 fn push_if_root(&mut self, def_id: LocalDefId) {
1262 if self.is_root(def_id) {
1263 debug!("RootCollector::push_if_root: found root def_id={:?}", def_id);
1265 let instance = Instance::mono(self.tcx, def_id.to_def_id());
1266 self.output.push(create_fn_mono_item(self.tcx, instance, DUMMY_SP));
1270 /// As a special case, when/if we encounter the
1271 /// `main()` function, we also have to generate a
1272 /// monomorphized copy of the start lang item based on
1273 /// the return type of `main`. This is not needed when
1274 /// the user writes their own `start` manually.
1275 fn push_extra_entry_roots(&mut self) {
1276 let Some((main_def_id, EntryFnType::Main)) = self.entry_fn else {
1280 let start_def_id = match self.tcx.lang_items().require(LangItem::Start) {
1282 Err(err) => self.tcx.sess.fatal(&err),
1284 let main_ret_ty = self.tcx.fn_sig(main_def_id).output();
1286 // Given that `main()` has no arguments,
1287 // then its return type cannot have
1288 // late-bound regions, since late-bound
1289 // regions must appear in the argument
1291 let main_ret_ty = self.tcx.normalize_erasing_regions(
1292 ty::ParamEnv::reveal_all(),
1293 main_ret_ty.no_bound_vars().unwrap(),
1296 let start_instance = Instance::resolve(
1298 ty::ParamEnv::reveal_all(),
1300 self.tcx.intern_substs(&[main_ret_ty.into()]),
1305 self.output.push(create_fn_mono_item(self.tcx, start_instance, DUMMY_SP));
1309 fn item_requires_monomorphization(tcx: TyCtxt<'_>, def_id: LocalDefId) -> bool {
1310 let generics = tcx.generics_of(def_id);
1311 generics.requires_monomorphization(tcx)
1314 fn create_mono_items_for_default_impls<'tcx>(
1316 item: &'tcx hir::Item<'tcx>,
1317 output: &mut Vec<Spanned<MonoItem<'tcx>>>,
1320 hir::ItemKind::Impl(ref impl_) => {
1321 for param in impl_.generics.params {
1323 hir::GenericParamKind::Lifetime { .. } => {}
1324 hir::GenericParamKind::Type { .. } | hir::GenericParamKind::Const { .. } => {
1331 "create_mono_items_for_default_impls(item={})",
1332 tcx.def_path_str(item.def_id.to_def_id())
1335 if let Some(trait_ref) = tcx.impl_trait_ref(item.def_id) {
1336 let param_env = ty::ParamEnv::reveal_all();
1337 let trait_ref = tcx.normalize_erasing_regions(param_env, trait_ref);
1338 let overridden_methods = tcx.impl_item_implementor_ids(item.def_id);
1339 for method in tcx.provided_trait_methods(trait_ref.def_id) {
1340 if overridden_methods.contains_key(&method.def_id) {
1344 if tcx.generics_of(method.def_id).own_requires_monomorphization() {
1349 InternalSubsts::for_item(tcx, method.def_id, |param, _| match param.kind {
1350 GenericParamDefKind::Lifetime => tcx.lifetimes.re_erased.into(),
1351 GenericParamDefKind::Type { .. }
1352 | GenericParamDefKind::Const { .. } => {
1353 trait_ref.substs[param.index as usize]
1356 let instance = ty::Instance::resolve(tcx, param_env, method.def_id, substs)
1360 let mono_item = create_fn_mono_item(tcx, instance, DUMMY_SP);
1361 if mono_item.node.is_instantiable(tcx) && should_codegen_locally(tcx, &instance)
1363 output.push(mono_item);
1372 /// Scans the miri alloc in order to find function calls, closures, and drop-glue.
1373 fn collect_miri<'tcx>(
1376 output: &mut Vec<Spanned<MonoItem<'tcx>>>,
1378 match tcx.global_alloc(alloc_id) {
1379 GlobalAlloc::Static(def_id) => {
1380 assert!(!tcx.is_thread_local_static(def_id));
1381 let instance = Instance::mono(tcx, def_id);
1382 if should_codegen_locally(tcx, &instance) {
1383 trace!("collecting static {:?}", def_id);
1384 output.push(dummy_spanned(MonoItem::Static(def_id)));
1387 GlobalAlloc::Memory(alloc) => {
1388 trace!("collecting {:?} with {:#?}", alloc_id, alloc);
1389 for &inner in alloc.inner().relocations().values() {
1390 rustc_data_structures::stack::ensure_sufficient_stack(|| {
1391 collect_miri(tcx, inner, output);
1395 GlobalAlloc::Function(fn_instance) => {
1396 if should_codegen_locally(tcx, &fn_instance) {
1397 trace!("collecting {:?} with {:#?}", alloc_id, fn_instance);
1398 output.push(create_fn_mono_item(tcx, fn_instance, DUMMY_SP));
1404 /// Scans the MIR in order to find function calls, closures, and drop-glue.
1405 fn collect_neighbours<'tcx>(
1407 instance: Instance<'tcx>,
1408 output: &mut Vec<Spanned<MonoItem<'tcx>>>,
1410 debug!("collect_neighbours: {:?}", instance.def_id());
1411 let body = tcx.instance_mir(instance.def);
1413 MirNeighborCollector { tcx, body: &body, output, instance }.visit_body(&body);
1416 fn collect_const_value<'tcx>(
1418 value: ConstValue<'tcx>,
1419 output: &mut Vec<Spanned<MonoItem<'tcx>>>,
1422 ConstValue::Scalar(Scalar::Ptr(ptr, _size)) => collect_miri(tcx, ptr.provenance, output),
1423 ConstValue::Slice { data: alloc, start: _, end: _ } | ConstValue::ByRef { alloc, .. } => {
1424 for &id in alloc.inner().relocations().values() {
1425 collect_miri(tcx, id, output);