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 //! # use core::fmt::Display;
96 //! fn print_val<T: Display>(x: T) {
97 //! println!("{}", x);
100 //! fn call_fn(f: &dyn Fn(i32), x: i32) {
105 //! let print_i32 = print_val::<i32>;
106 //! call_fn(&print_i32, 0);
109 //! The MIR of none of these functions will contain an explicit call to
110 //! `print_val::<i32>`. Nonetheless, in order to mono this program, we need
111 //! an instance of this function. Thus, whenever we encounter a function or
112 //! method in operand position, we treat it as a neighbor of the current
113 //! mono item. Calls are just a special case of that.
116 //! In a way, closures are a simple case. Since every closure object needs to be
117 //! constructed somewhere, we can reliably discover them by observing
118 //! `RValue::Aggregate` expressions with `AggregateKind::Closure`. This is also
119 //! true for closures inlined from other crates.
122 //! Drop glue mono items are introduced by MIR drop-statements. The
123 //! generated mono item will again have drop-glue item neighbors if the
124 //! type to be dropped contains nested values that also need to be dropped. It
125 //! might also have a function item neighbor for the explicit `Drop::drop`
126 //! implementation of its type.
128 //! #### Unsizing Casts
129 //! A subtle way of introducing neighbor edges is by casting to a trait object.
130 //! Since the resulting fat-pointer contains a reference to a vtable, we need to
131 //! instantiate all object-safe methods of the trait, as we need to store
132 //! pointers to these functions even if they never get called anywhere. This can
133 //! be seen as a special case of taking a function reference.
136 //! Since `Box` expression have special compiler support, no explicit calls to
137 //! `exchange_malloc()` and `box_free()` may show up in MIR, even if the
138 //! compiler will generate them. We have to observe `Rvalue::Box` expressions
139 //! and Box-typed drop-statements for that purpose.
142 //! Interaction with Cross-Crate Inlining
143 //! -------------------------------------
144 //! The binary of a crate will not only contain machine code for the items
145 //! defined in the source code of that crate. It will also contain monomorphic
146 //! instantiations of any extern generic functions and of functions marked with
148 //! The collection algorithm handles this more or less mono. If it is
149 //! about to create a mono item for something with an external `DefId`,
150 //! it will take a look if the MIR for that item is available, and if so just
151 //! proceed normally. If the MIR is not available, it assumes that the item is
152 //! just linked to and no node is created; which is exactly what we want, since
153 //! no machine code should be generated in the current crate for such an item.
155 //! Eager and Lazy Collection Mode
156 //! ------------------------------
157 //! Mono item collection can be performed in one of two modes:
159 //! - Lazy mode means that items will only be instantiated when actually
160 //! referenced. The goal is to produce the least amount of machine code
163 //! - Eager mode is meant to be used in conjunction with incremental compilation
164 //! where a stable set of mono items is more important than a minimal
165 //! one. Thus, eager mode will instantiate drop-glue for every drop-able type
166 //! in the crate, even if no drop call for that type exists (yet). It will
167 //! also instantiate default implementations of trait methods, something that
168 //! otherwise is only done on demand.
173 //! Some things are not yet fully implemented in the current version of this
177 //! Ideally, no mono item should be generated for const fns unless there
178 //! is a call to them that cannot be evaluated at compile time. At the moment
179 //! this is not implemented however: a mono item will be produced
180 //! regardless of whether it is actually needed or not.
182 use rustc_data_structures::fx::{FxHashMap, FxHashSet};
183 use rustc_data_structures::sync::{par_for_each_in, MTLock, MTRef};
184 use rustc_hir as hir;
185 use rustc_hir::def::DefKind;
186 use rustc_hir::def_id::{DefId, DefIdMap, LocalDefId};
187 use rustc_hir::lang_items::LangItem;
188 use rustc_index::bit_set::GrowableBitSet;
189 use rustc_middle::mir::interpret::{AllocId, ConstValue};
190 use rustc_middle::mir::interpret::{ErrorHandled, GlobalAlloc, Scalar};
191 use rustc_middle::mir::mono::{InstantiationMode, MonoItem};
192 use rustc_middle::mir::visit::Visitor as MirVisitor;
193 use rustc_middle::mir::{self, Local, Location};
194 use rustc_middle::ty::adjustment::{CustomCoerceUnsized, PointerCast};
195 use rustc_middle::ty::print::with_no_trimmed_paths;
196 use rustc_middle::ty::subst::{GenericArgKind, InternalSubsts};
197 use rustc_middle::ty::{
198 self, GenericParamDefKind, Instance, Ty, TyCtxt, TypeFoldable, TypeVisitable, VtblEntry,
200 use rustc_middle::{middle::codegen_fn_attrs::CodegenFnAttrFlags, mir::visit::TyContext};
201 use rustc_session::config::EntryFnType;
202 use rustc_session::lint::builtin::LARGE_ASSIGNMENTS;
203 use rustc_session::Limit;
204 use rustc_span::source_map::{dummy_spanned, respan, Span, Spanned, DUMMY_SP};
205 use rustc_target::abi::Size;
208 use std::path::PathBuf;
210 use crate::errors::{FatalError, LargeAssignmentsLint, RecursionLimit, TypeLengthLimit};
213 pub enum MonoItemCollectionMode {
218 /// Maps every mono item to all mono items it references in its
220 pub struct InliningMap<'tcx> {
221 // Maps a source mono item to the range of mono items
223 // The range selects elements within the `targets` vecs.
224 index: FxHashMap<MonoItem<'tcx>, Range<usize>>,
225 targets: Vec<MonoItem<'tcx>>,
227 // Contains one bit per mono item in the `targets` field. That bit
228 // is true if that mono item needs to be inlined into every CGU.
229 inlines: GrowableBitSet<usize>,
232 /// Struct to store mono items in each collecting and if they should
233 /// be inlined. We call `instantiation_mode` to get their inlining
234 /// status when inserting new elements, which avoids calling it in
235 /// `inlining_map.lock_mut()`. See the `collect_items_rec` implementation
237 struct MonoItems<'tcx> {
238 // If this is false, we do not need to compute whether items
239 // will need to be inlined.
240 compute_inlining: bool,
242 // The TyCtxt used to determine whether the a item should
246 // The collected mono items. The bool field in each element
247 // indicates whether this element should be inlined.
248 items: Vec<(Spanned<MonoItem<'tcx>>, bool /*inlined*/)>,
251 impl<'tcx> MonoItems<'tcx> {
253 fn push(&mut self, item: Spanned<MonoItem<'tcx>>) {
258 fn extend<T: IntoIterator<Item = Spanned<MonoItem<'tcx>>>>(&mut self, iter: T) {
259 self.items.extend(iter.into_iter().map(|mono_item| {
260 let inlined = if !self.compute_inlining {
263 mono_item.node.instantiation_mode(self.tcx) == InstantiationMode::LocalCopy
270 impl<'tcx> InliningMap<'tcx> {
271 fn new() -> InliningMap<'tcx> {
273 index: FxHashMap::default(),
275 inlines: GrowableBitSet::with_capacity(1024),
279 fn record_accesses<'a>(
281 source: MonoItem<'tcx>,
282 new_targets: &'a [(Spanned<MonoItem<'tcx>>, bool)],
286 let start_index = self.targets.len();
287 let new_items_count = new_targets.len();
288 let new_items_count_total = new_items_count + self.targets.len();
290 self.targets.reserve(new_items_count);
291 self.inlines.ensure(new_items_count_total);
293 for (i, (Spanned { node: mono_item, .. }, inlined)) in new_targets.into_iter().enumerate() {
294 self.targets.push(*mono_item);
296 self.inlines.insert(i + start_index);
300 let end_index = self.targets.len();
301 assert!(self.index.insert(source, start_index..end_index).is_none());
304 // Internally iterate over all items referenced by `source` which will be
305 // made available for inlining.
306 pub fn with_inlining_candidates<F>(&self, source: MonoItem<'tcx>, mut f: F)
308 F: FnMut(MonoItem<'tcx>),
310 if let Some(range) = self.index.get(&source) {
311 for (i, candidate) in self.targets[range.clone()].iter().enumerate() {
312 if self.inlines.contains(range.start + i) {
319 // Internally iterate over all items and the things each accesses.
320 pub fn iter_accesses<F>(&self, mut f: F)
322 F: FnMut(MonoItem<'tcx>, &[MonoItem<'tcx>]),
324 for (&accessor, range) in &self.index {
325 f(accessor, &self.targets[range.clone()])
330 #[instrument(skip(tcx, mode), level = "debug")]
331 pub fn collect_crate_mono_items(
333 mode: MonoItemCollectionMode,
334 ) -> (FxHashSet<MonoItem<'_>>, InliningMap<'_>) {
335 let _prof_timer = tcx.prof.generic_activity("monomorphization_collector");
338 tcx.sess.time("monomorphization_collector_root_collections", || collect_roots(tcx, mode));
340 debug!("building mono item graph, beginning at roots");
342 let mut visited = MTLock::new(FxHashSet::default());
343 let mut inlining_map = MTLock::new(InliningMap::new());
344 let recursion_limit = tcx.recursion_limit();
347 let visited: MTRef<'_, _> = &mut visited;
348 let inlining_map: MTRef<'_, _> = &mut inlining_map;
350 tcx.sess.time("monomorphization_collector_graph_walk", || {
351 par_for_each_in(roots, |root| {
352 let mut recursion_depths = DefIdMap::default();
357 &mut recursion_depths,
365 (visited.into_inner(), inlining_map.into_inner())
368 // Find all non-generic items by walking the HIR. These items serve as roots to
369 // start monomorphizing from.
370 #[instrument(skip(tcx, mode), level = "debug")]
371 fn collect_roots(tcx: TyCtxt<'_>, mode: MonoItemCollectionMode) -> Vec<MonoItem<'_>> {
372 debug!("collecting roots");
373 let mut roots = MonoItems { compute_inlining: false, tcx, items: Vec::new() };
376 let entry_fn = tcx.entry_fn(());
378 debug!("collect_roots: entry_fn = {:?}", entry_fn);
380 let mut collector = RootCollector { tcx, mode, entry_fn, output: &mut roots };
382 let crate_items = tcx.hir_crate_items(());
384 for id in crate_items.items() {
385 collector.process_item(id);
388 for id in crate_items.impl_items() {
389 collector.process_impl_item(id);
392 collector.push_extra_entry_roots();
395 // We can only codegen items that are instantiable - items all of
396 // whose predicates hold. Luckily, items that aren't instantiable
397 // can't actually be used, so we can just skip codegenning them.
401 .filter_map(|(Spanned { node: mono_item, .. }, _)| {
402 mono_item.is_instantiable(tcx).then_some(mono_item)
407 /// Collect all monomorphized items reachable from `starting_point`, and emit a note diagnostic if a
408 /// post-monorphization error is encountered during a collection step.
409 #[instrument(skip(tcx, visited, recursion_depths, recursion_limit, inlining_map), level = "debug")]
410 fn collect_items_rec<'tcx>(
412 starting_point: Spanned<MonoItem<'tcx>>,
413 visited: MTRef<'_, MTLock<FxHashSet<MonoItem<'tcx>>>>,
414 recursion_depths: &mut DefIdMap<usize>,
415 recursion_limit: Limit,
416 inlining_map: MTRef<'_, MTLock<InliningMap<'tcx>>>,
418 if !visited.lock_mut().insert(starting_point.node) {
419 // We've been here already, no need to search again.
422 debug!("BEGIN collect_items_rec({})", starting_point.node);
424 let mut neighbors = MonoItems { compute_inlining: true, tcx, items: Vec::new() };
425 let recursion_depth_reset;
428 // Post-monomorphization errors MVP
430 // We can encounter errors while monomorphizing an item, but we don't have a good way of
431 // showing a complete stack of spans ultimately leading to collecting the erroneous one yet.
432 // (It's also currently unclear exactly which diagnostics and information would be interesting
433 // to report in such cases)
435 // This leads to suboptimal error reporting: a post-monomorphization error (PME) will be
436 // shown with just a spanned piece of code causing the error, without information on where
437 // it was called from. This is especially obscure if the erroneous mono item is in a
438 // dependency. See for example issue #85155, where, before minimization, a PME happened two
439 // crates downstream from libcore's stdarch, without a way to know which dependency was the
442 // If such an error occurs in the current crate, its span will be enough to locate the
443 // source. If the cause is in another crate, the goal here is to quickly locate which mono
444 // item in the current crate is ultimately responsible for causing the error.
446 // To give at least _some_ context to the user: while collecting mono items, we check the
447 // error count. If it has changed, a PME occurred, and we trigger some diagnostics about the
448 // current step of mono items collection.
450 // FIXME: don't rely on global state, instead bubble up errors. Note: this is very hard to do.
451 let error_count = tcx.sess.diagnostic().err_count();
453 match starting_point.node {
454 MonoItem::Static(def_id) => {
455 let instance = Instance::mono(tcx, def_id);
457 // Sanity check whether this ended up being collected accidentally
458 debug_assert!(should_codegen_locally(tcx, &instance));
460 let ty = instance.ty(tcx, ty::ParamEnv::reveal_all());
461 visit_drop_use(tcx, ty, true, starting_point.span, &mut neighbors);
463 recursion_depth_reset = None;
465 if let Ok(alloc) = tcx.eval_static_initializer(def_id) {
466 for &id in alloc.inner().relocations().values() {
467 collect_miri(tcx, id, &mut neighbors);
471 MonoItem::Fn(instance) => {
472 // Sanity check whether this ended up being collected accidentally
473 debug_assert!(should_codegen_locally(tcx, &instance));
475 // Keep track of the monomorphization recursion depth
476 recursion_depth_reset = Some(check_recursion_limit(
483 check_type_length_limit(tcx, instance);
485 rustc_data_structures::stack::ensure_sufficient_stack(|| {
486 collect_neighbours(tcx, instance, &mut neighbors);
489 MonoItem::GlobalAsm(item_id) => {
490 recursion_depth_reset = None;
492 let item = tcx.hir().item(item_id);
493 if let hir::ItemKind::GlobalAsm(asm) = item.kind {
494 for (op, op_sp) in asm.operands {
496 hir::InlineAsmOperand::Const { .. } => {
497 // Only constants which resolve to a plain integer
498 // are supported. Therefore the value should not
499 // depend on any other items.
501 hir::InlineAsmOperand::SymFn { anon_const } => {
503 tcx.typeck_body(anon_const.body).node_type(anon_const.hir_id);
504 visit_fn_use(tcx, fn_ty, false, *op_sp, &mut neighbors);
506 hir::InlineAsmOperand::SymStatic { path: _, def_id } => {
507 let instance = Instance::mono(tcx, *def_id);
508 if should_codegen_locally(tcx, &instance) {
509 trace!("collecting static {:?}", def_id);
510 neighbors.push(dummy_spanned(MonoItem::Static(*def_id)));
513 hir::InlineAsmOperand::In { .. }
514 | hir::InlineAsmOperand::Out { .. }
515 | hir::InlineAsmOperand::InOut { .. }
516 | hir::InlineAsmOperand::SplitInOut { .. } => {
517 span_bug!(*op_sp, "invalid operand type for global_asm!")
522 span_bug!(item.span, "Mismatch between hir::Item type and MonoItem type")
527 // Check for PMEs and emit a diagnostic if one happened. To try to show relevant edges of the
529 if tcx.sess.diagnostic().err_count() > error_count
530 && starting_point.node.is_generic_fn()
531 && starting_point.node.is_user_defined()
533 let formatted_item = with_no_trimmed_paths!(starting_point.node.to_string());
534 tcx.sess.span_note_without_error(
536 &format!("the above error was encountered while instantiating `{}`", formatted_item),
539 inlining_map.lock_mut().record_accesses(starting_point.node, &neighbors.items);
541 for (neighbour, _) in neighbors.items {
542 collect_items_rec(tcx, neighbour, visited, recursion_depths, recursion_limit, inlining_map);
545 if let Some((def_id, depth)) = recursion_depth_reset {
546 recursion_depths.insert(def_id, depth);
549 debug!("END collect_items_rec({})", starting_point.node);
552 /// Format instance name that is already known to be too long for rustc.
553 /// Show only the first and last 32 characters to avoid blasting
554 /// the user's terminal with thousands of lines of type-name.
556 /// If the type name is longer than before+after, it will be written to a file.
557 fn shrunk_instance_name<'tcx>(
559 instance: &Instance<'tcx>,
562 ) -> (String, Option<PathBuf>) {
563 let s = instance.to_string();
565 // Only use the shrunk version if it's really shorter.
566 // This also avoids the case where before and after slices overlap.
567 if s.chars().nth(before + after + 1).is_some() {
568 // An iterator of all byte positions including the end of the string.
569 let positions = || s.char_indices().map(|(i, _)| i).chain(iter::once(s.len()));
571 let shrunk = format!(
572 "{before}...{after}",
573 before = &s[..positions().nth(before).unwrap_or(s.len())],
574 after = &s[positions().rev().nth(after).unwrap_or(0)..],
577 let path = tcx.output_filenames(()).temp_path_ext("long-type.txt", None);
578 let written_to_path = std::fs::write(&path, s).ok().map(|_| path);
580 (shrunk, written_to_path)
586 fn check_recursion_limit<'tcx>(
588 instance: Instance<'tcx>,
590 recursion_depths: &mut DefIdMap<usize>,
591 recursion_limit: Limit,
592 ) -> (DefId, usize) {
593 let def_id = instance.def_id();
594 let recursion_depth = recursion_depths.get(&def_id).cloned().unwrap_or(0);
595 debug!(" => recursion depth={}", recursion_depth);
597 let adjusted_recursion_depth = if Some(def_id) == tcx.lang_items().drop_in_place_fn() {
598 // HACK: drop_in_place creates tight monomorphization loops. Give
605 // Code that needs to instantiate the same function recursively
606 // more than the recursion limit is assumed to be causing an
607 // infinite expansion.
608 if !recursion_limit.value_within_limit(adjusted_recursion_depth) {
609 let def_span = tcx.def_span(def_id);
610 let def_path_str = tcx.def_path_str(def_id);
611 let (shrunk, written_to_path) = shrunk_instance_name(tcx, &instance, 32, 32);
612 let mut path = PathBuf::new();
613 let was_written = if written_to_path.is_some() {
614 path = written_to_path.unwrap();
619 tcx.sess.emit_fatal(RecursionLimit {
629 recursion_depths.insert(def_id, recursion_depth + 1);
631 (def_id, recursion_depth)
634 fn check_type_length_limit<'tcx>(tcx: TyCtxt<'tcx>, instance: Instance<'tcx>) {
635 let type_length = instance
638 .flat_map(|arg| arg.walk())
639 .filter(|arg| match arg.unpack() {
640 GenericArgKind::Type(_) | GenericArgKind::Const(_) => true,
641 GenericArgKind::Lifetime(_) => false,
644 debug!(" => type length={}", type_length);
646 // Rust code can easily create exponentially-long types using only a
647 // polynomial recursion depth. Even with the default recursion
648 // depth, you can easily get cases that take >2^60 steps to run,
649 // which means that rustc basically hangs.
651 // Bail out in these cases to avoid that bad user experience.
652 if !tcx.type_length_limit().value_within_limit(type_length) {
653 let (shrunk, written_to_path) = shrunk_instance_name(tcx, &instance, 32, 32);
654 let span = tcx.def_span(instance.def_id());
655 let mut path = PathBuf::new();
656 let was_written = if written_to_path.is_some() {
657 path = written_to_path.unwrap();
662 tcx.sess.emit_fatal(TypeLengthLimit { span, shrunk, was_written, path, type_length });
666 struct MirNeighborCollector<'a, 'tcx> {
668 body: &'a mir::Body<'tcx>,
669 output: &'a mut MonoItems<'tcx>,
670 instance: Instance<'tcx>,
673 impl<'a, 'tcx> MirNeighborCollector<'a, 'tcx> {
674 pub fn monomorphize<T>(&self, value: T) -> T
676 T: TypeFoldable<'tcx>,
678 debug!("monomorphize: self.instance={:?}", self.instance);
679 self.instance.subst_mir_and_normalize_erasing_regions(
681 ty::ParamEnv::reveal_all(),
687 impl<'a, 'tcx> MirVisitor<'tcx> for MirNeighborCollector<'a, 'tcx> {
688 fn visit_rvalue(&mut self, rvalue: &mir::Rvalue<'tcx>, location: Location) {
689 debug!("visiting rvalue {:?}", *rvalue);
691 let span = self.body.source_info(location).span;
694 // When doing an cast from a regular pointer to a fat pointer, we
695 // have to instantiate all methods of the trait being cast to, so we
696 // can build the appropriate vtable.
698 mir::CastKind::Pointer(PointerCast::Unsize),
702 let target_ty = self.monomorphize(target_ty);
703 let source_ty = operand.ty(self.body, self.tcx);
704 let source_ty = self.monomorphize(source_ty);
705 let (source_ty, target_ty) =
706 find_vtable_types_for_unsizing(self.tcx, source_ty, target_ty);
707 // This could also be a different Unsize instruction, like
708 // from a fixed sized array to a slice. But we are only
709 // interested in things that produce a vtable.
710 if target_ty.is_trait() && !source_ty.is_trait() {
711 create_mono_items_for_vtable_methods(
721 mir::CastKind::Pointer(PointerCast::ReifyFnPointer),
725 let fn_ty = operand.ty(self.body, self.tcx);
726 let fn_ty = self.monomorphize(fn_ty);
727 visit_fn_use(self.tcx, fn_ty, false, span, &mut self.output);
730 mir::CastKind::Pointer(PointerCast::ClosureFnPointer(_)),
734 let source_ty = operand.ty(self.body, self.tcx);
735 let source_ty = self.monomorphize(source_ty);
736 match *source_ty.kind() {
737 ty::Closure(def_id, substs) => {
738 let instance = Instance::resolve_closure(
742 ty::ClosureKind::FnOnce,
744 .expect("failed to normalize and resolve closure during codegen");
745 if should_codegen_locally(self.tcx, &instance) {
746 self.output.push(create_fn_mono_item(self.tcx, instance, span));
752 mir::Rvalue::ThreadLocalRef(def_id) => {
753 assert!(self.tcx.is_thread_local_static(def_id));
754 let instance = Instance::mono(self.tcx, def_id);
755 if should_codegen_locally(self.tcx, &instance) {
756 trace!("collecting thread-local static {:?}", def_id);
757 self.output.push(respan(span, MonoItem::Static(def_id)));
760 _ => { /* not interesting */ }
763 self.super_rvalue(rvalue, location);
766 /// This does not walk the constant, as it has been handled entirely here and trying
767 /// to walk it would attempt to evaluate the `ty::Const` inside, which doesn't necessarily
768 /// work, as some constants cannot be represented in the type system.
769 #[instrument(skip(self), level = "debug")]
770 fn visit_constant(&mut self, constant: &mir::Constant<'tcx>, location: Location) {
771 let literal = self.monomorphize(constant.literal);
772 let val = match literal {
773 mir::ConstantKind::Val(val, _) => val,
774 mir::ConstantKind::Ty(ct) => match ct.kind() {
775 ty::ConstKind::Value(val) => self.tcx.valtree_to_const_val((ct.ty(), val)),
776 ty::ConstKind::Unevaluated(ct) => {
778 let param_env = ty::ParamEnv::reveal_all();
779 match self.tcx.const_eval_resolve(param_env, ct, None) {
780 // The `monomorphize` call should have evaluated that constant already.
782 Err(ErrorHandled::Reported(_) | ErrorHandled::Linted) => return,
783 Err(ErrorHandled::TooGeneric) => span_bug!(
784 self.body.source_info(location).span,
785 "collection encountered polymorphic constant: {:?}",
793 collect_const_value(self.tcx, val, self.output);
794 self.visit_ty(literal.ty(), TyContext::Location(location));
797 #[instrument(skip(self), level = "debug")]
798 fn visit_const(&mut self, constant: ty::Const<'tcx>, location: Location) {
799 debug!("visiting const {:?} @ {:?}", constant, location);
801 let substituted_constant = self.monomorphize(constant);
802 let param_env = ty::ParamEnv::reveal_all();
804 match substituted_constant.kind() {
805 ty::ConstKind::Value(val) => {
806 let const_val = self.tcx.valtree_to_const_val((constant.ty(), val));
807 collect_const_value(self.tcx, const_val, self.output)
809 ty::ConstKind::Unevaluated(unevaluated) => {
810 match self.tcx.const_eval_resolve(param_env, unevaluated, None) {
811 // The `monomorphize` call should have evaluated that constant already.
812 Ok(val) => span_bug!(
813 self.body.source_info(location).span,
814 "collection encountered the unevaluated constant {} which evaluated to {:?}",
815 substituted_constant,
818 Err(ErrorHandled::Reported(_) | ErrorHandled::Linted) => {}
819 Err(ErrorHandled::TooGeneric) => span_bug!(
820 self.body.source_info(location).span,
821 "collection encountered polymorphic constant: {}",
829 self.super_const(constant);
832 fn visit_terminator(&mut self, terminator: &mir::Terminator<'tcx>, location: Location) {
833 debug!("visiting terminator {:?} @ {:?}", terminator, location);
834 let source = self.body.source_info(location).span;
837 match terminator.kind {
838 mir::TerminatorKind::Call { ref func, .. } => {
839 let callee_ty = func.ty(self.body, tcx);
840 let callee_ty = self.monomorphize(callee_ty);
841 visit_fn_use(self.tcx, callee_ty, true, source, &mut self.output);
843 mir::TerminatorKind::Drop { ref place, .. }
844 | mir::TerminatorKind::DropAndReplace { ref place, .. } => {
845 let ty = place.ty(self.body, self.tcx).ty;
846 let ty = self.monomorphize(ty);
847 visit_drop_use(self.tcx, ty, true, source, self.output);
849 mir::TerminatorKind::InlineAsm { ref operands, .. } => {
852 mir::InlineAsmOperand::SymFn { ref value } => {
853 let fn_ty = self.monomorphize(value.literal.ty());
854 visit_fn_use(self.tcx, fn_ty, false, source, &mut self.output);
856 mir::InlineAsmOperand::SymStatic { def_id } => {
857 let instance = Instance::mono(self.tcx, def_id);
858 if should_codegen_locally(self.tcx, &instance) {
859 trace!("collecting asm sym static {:?}", def_id);
860 self.output.push(respan(source, MonoItem::Static(def_id)));
867 mir::TerminatorKind::Assert { ref msg, .. } => {
868 let lang_item = match msg {
869 mir::AssertKind::BoundsCheck { .. } => LangItem::PanicBoundsCheck,
870 _ => LangItem::Panic,
872 let instance = Instance::mono(tcx, tcx.require_lang_item(lang_item, Some(source)));
873 if should_codegen_locally(tcx, &instance) {
874 self.output.push(create_fn_mono_item(tcx, instance, source));
877 mir::TerminatorKind::Abort { .. } => {
878 let instance = Instance::mono(
880 tcx.require_lang_item(LangItem::PanicNoUnwind, Some(source)),
882 if should_codegen_locally(tcx, &instance) {
883 self.output.push(create_fn_mono_item(tcx, instance, source));
886 mir::TerminatorKind::Goto { .. }
887 | mir::TerminatorKind::SwitchInt { .. }
888 | mir::TerminatorKind::Resume
889 | mir::TerminatorKind::Return
890 | mir::TerminatorKind::Unreachable => {}
891 mir::TerminatorKind::GeneratorDrop
892 | mir::TerminatorKind::Yield { .. }
893 | mir::TerminatorKind::FalseEdge { .. }
894 | mir::TerminatorKind::FalseUnwind { .. } => bug!(),
897 self.super_terminator(terminator, location);
900 fn visit_operand(&mut self, operand: &mir::Operand<'tcx>, location: Location) {
901 self.super_operand(operand, location);
902 let limit = self.tcx.move_size_limit().0;
906 let limit = Size::from_bytes(limit);
907 let ty = operand.ty(self.body, self.tcx);
908 let ty = self.monomorphize(ty);
909 let layout = self.tcx.layout_of(ty::ParamEnv::reveal_all().and(ty));
910 if let Ok(layout) = layout {
911 if layout.size > limit {
913 let source_info = self.body.source_info(location);
914 debug!(?source_info);
915 let lint_root = source_info.scope.lint_root(&self.body.source_scopes);
917 let Some(lint_root) = lint_root else {
918 // This happens when the issue is in a function from a foreign crate that
919 // we monomorphized in the current crate. We can't get a `HirId` for things
921 // FIXME: Find out where to report the lint on. Maybe simply crate-level lint root
922 // but correct span? This would make the lint at least accept crate-level lint attributes.
925 self.tcx.emit_spanned_lint(
929 LargeAssignmentsLint {
930 span: source_info.span,
931 size: layout.size.bytes(),
932 limit: limit.bytes(),
942 _context: mir::visit::PlaceContext,
948 fn visit_drop_use<'tcx>(
951 is_direct_call: bool,
953 output: &mut MonoItems<'tcx>,
955 let instance = Instance::resolve_drop_in_place(tcx, ty);
956 visit_instance_use(tcx, instance, is_direct_call, source, output);
959 fn visit_fn_use<'tcx>(
962 is_direct_call: bool,
964 output: &mut MonoItems<'tcx>,
966 if let ty::FnDef(def_id, substs) = *ty.kind() {
967 let instance = if is_direct_call {
968 ty::Instance::resolve(tcx, ty::ParamEnv::reveal_all(), def_id, substs).unwrap().unwrap()
970 ty::Instance::resolve_for_fn_ptr(tcx, ty::ParamEnv::reveal_all(), def_id, substs)
973 visit_instance_use(tcx, instance, is_direct_call, source, output);
977 fn visit_instance_use<'tcx>(
979 instance: ty::Instance<'tcx>,
980 is_direct_call: bool,
982 output: &mut MonoItems<'tcx>,
984 debug!("visit_item_use({:?}, is_direct_call={:?})", instance, is_direct_call);
985 if !should_codegen_locally(tcx, &instance) {
990 ty::InstanceDef::Virtual(..) | ty::InstanceDef::Intrinsic(_) => {
992 bug!("{:?} being reified", instance);
995 ty::InstanceDef::DropGlue(_, None) => {
996 // Don't need to emit noop drop glue if we are calling directly.
998 output.push(create_fn_mono_item(tcx, instance, source));
1001 ty::InstanceDef::DropGlue(_, Some(_))
1002 | ty::InstanceDef::VTableShim(..)
1003 | ty::InstanceDef::ReifyShim(..)
1004 | ty::InstanceDef::ClosureOnceShim { .. }
1005 | ty::InstanceDef::Item(..)
1006 | ty::InstanceDef::FnPtrShim(..)
1007 | ty::InstanceDef::CloneShim(..) => {
1008 output.push(create_fn_mono_item(tcx, instance, source));
1013 /// Returns `true` if we should codegen an instance in the local crate, or returns `false` if we
1014 /// can just link to the upstream crate and therefore don't need a mono item.
1015 fn should_codegen_locally<'tcx>(tcx: TyCtxt<'tcx>, instance: &Instance<'tcx>) -> bool {
1016 let Some(def_id) = instance.def.def_id_if_not_guaranteed_local_codegen() else {
1020 if tcx.is_foreign_item(def_id) {
1021 // Foreign items are always linked against, there's no way of instantiating them.
1025 if def_id.is_local() {
1026 // Local items cannot be referred to locally without monomorphizing them locally.
1030 if tcx.is_reachable_non_generic(def_id)
1031 || instance.polymorphize(tcx).upstream_monomorphization(tcx).is_some()
1033 // We can link to the item in question, no instance needed in this crate.
1037 if let DefKind::Static(_) = tcx.def_kind(def_id) {
1038 // We cannot monomorphize statics from upstream crates.
1042 if !tcx.is_mir_available(def_id) {
1043 bug!("no MIR available for {:?}", def_id);
1049 /// For a given pair of source and target type that occur in an unsizing coercion,
1050 /// this function finds the pair of types that determines the vtable linking
1053 /// For example, the source type might be `&SomeStruct` and the target type
1054 /// might be `&dyn SomeTrait` in a cast like:
1056 /// ```rust,ignore (not real code)
1057 /// let src: &SomeStruct = ...;
1058 /// let target = src as &dyn SomeTrait;
1061 /// Then the output of this function would be (SomeStruct, SomeTrait) since for
1062 /// constructing the `target` fat-pointer we need the vtable for that pair.
1064 /// Things can get more complicated though because there's also the case where
1065 /// the unsized type occurs as a field:
1068 /// struct ComplexStruct<T: ?Sized> {
1075 /// In this case, if `T` is sized, `&ComplexStruct<T>` is a thin pointer. If `T`
1076 /// is unsized, `&SomeStruct` is a fat pointer, and the vtable it points to is
1077 /// for the pair of `T` (which is a trait) and the concrete type that `T` was
1078 /// originally coerced from:
1080 /// ```rust,ignore (not real code)
1081 /// let src: &ComplexStruct<SomeStruct> = ...;
1082 /// let target = src as &ComplexStruct<dyn SomeTrait>;
1085 /// Again, we want this `find_vtable_types_for_unsizing()` to provide the pair
1086 /// `(SomeStruct, SomeTrait)`.
1088 /// Finally, there is also the case of custom unsizing coercions, e.g., for
1089 /// smart pointers such as `Rc` and `Arc`.
1090 fn find_vtable_types_for_unsizing<'tcx>(
1092 source_ty: Ty<'tcx>,
1093 target_ty: Ty<'tcx>,
1094 ) -> (Ty<'tcx>, Ty<'tcx>) {
1095 let ptr_vtable = |inner_source: Ty<'tcx>, inner_target: Ty<'tcx>| {
1096 let param_env = ty::ParamEnv::reveal_all();
1097 let type_has_metadata = |ty: Ty<'tcx>| -> bool {
1098 if ty.is_sized(tcx.at(DUMMY_SP), param_env) {
1101 let tail = tcx.struct_tail_erasing_lifetimes(ty, param_env);
1103 ty::Foreign(..) => false,
1104 ty::Str | ty::Slice(..) | ty::Dynamic(..) => true,
1105 _ => bug!("unexpected unsized tail: {:?}", tail),
1108 if type_has_metadata(inner_source) {
1109 (inner_source, inner_target)
1111 tcx.struct_lockstep_tails_erasing_lifetimes(inner_source, inner_target, param_env)
1115 match (&source_ty.kind(), &target_ty.kind()) {
1116 (&ty::Ref(_, a, _), &ty::Ref(_, b, _) | &ty::RawPtr(ty::TypeAndMut { ty: b, .. }))
1117 | (&ty::RawPtr(ty::TypeAndMut { ty: a, .. }), &ty::RawPtr(ty::TypeAndMut { ty: b, .. })) => {
1120 (&ty::Adt(def_a, _), &ty::Adt(def_b, _)) if def_a.is_box() && def_b.is_box() => {
1121 ptr_vtable(source_ty.boxed_ty(), target_ty.boxed_ty())
1124 (&ty::Adt(source_adt_def, source_substs), &ty::Adt(target_adt_def, target_substs)) => {
1125 assert_eq!(source_adt_def, target_adt_def);
1127 let CustomCoerceUnsized::Struct(coerce_index) =
1128 crate::custom_coerce_unsize_info(tcx, source_ty, target_ty);
1130 let source_fields = &source_adt_def.non_enum_variant().fields;
1131 let target_fields = &target_adt_def.non_enum_variant().fields;
1134 coerce_index < source_fields.len() && source_fields.len() == target_fields.len()
1137 find_vtable_types_for_unsizing(
1139 source_fields[coerce_index].ty(tcx, source_substs),
1140 target_fields[coerce_index].ty(tcx, target_substs),
1144 "find_vtable_types_for_unsizing: invalid coercion {:?} -> {:?}",
1151 #[instrument(skip(tcx), level = "debug")]
1152 fn create_fn_mono_item<'tcx>(
1154 instance: Instance<'tcx>,
1156 ) -> Spanned<MonoItem<'tcx>> {
1157 debug!("create_fn_mono_item(instance={})", instance);
1159 let def_id = instance.def_id();
1160 if tcx.sess.opts.unstable_opts.profile_closures && def_id.is_local() && tcx.is_closure(def_id) {
1161 crate::util::dump_closure_profile(tcx, instance);
1164 let respanned = respan(source, MonoItem::Fn(instance.polymorphize(tcx)));
1170 /// Creates a `MonoItem` for each method that is referenced by the vtable for
1171 /// the given trait/impl pair.
1172 fn create_mono_items_for_vtable_methods<'tcx>(
1177 output: &mut MonoItems<'tcx>,
1179 assert!(!trait_ty.has_escaping_bound_vars() && !impl_ty.has_escaping_bound_vars());
1181 if let ty::Dynamic(ref trait_ty, ..) = trait_ty.kind() {
1182 if let Some(principal) = trait_ty.principal() {
1183 let poly_trait_ref = principal.with_self_ty(tcx, impl_ty);
1184 assert!(!poly_trait_ref.has_escaping_bound_vars());
1186 // Walk all methods of the trait, including those of its supertraits
1187 let entries = tcx.vtable_entries(poly_trait_ref);
1188 let methods = entries
1190 .filter_map(|entry| match entry {
1191 VtblEntry::MetadataDropInPlace
1192 | VtblEntry::MetadataSize
1193 | VtblEntry::MetadataAlign
1194 | VtblEntry::Vacant => None,
1195 VtblEntry::TraitVPtr(_) => {
1196 // all super trait items already covered, so skip them.
1199 VtblEntry::Method(instance) => {
1200 Some(*instance).filter(|instance| should_codegen_locally(tcx, instance))
1203 .map(|item| create_fn_mono_item(tcx, item, source));
1204 output.extend(methods);
1207 // Also add the destructor.
1208 visit_drop_use(tcx, impl_ty, false, source, output);
1212 //=-----------------------------------------------------------------------------
1214 //=-----------------------------------------------------------------------------
1216 struct RootCollector<'a, 'tcx> {
1218 mode: MonoItemCollectionMode,
1219 output: &'a mut MonoItems<'tcx>,
1220 entry_fn: Option<(DefId, EntryFnType)>,
1223 impl<'v> RootCollector<'_, 'v> {
1224 fn process_item(&mut self, id: hir::ItemId) {
1225 match self.tcx.def_kind(id.def_id) {
1226 DefKind::Enum | DefKind::Struct | DefKind::Union => {
1227 let item = self.tcx.hir().item(id);
1229 hir::ItemKind::Enum(_, ref generics)
1230 | hir::ItemKind::Struct(_, ref generics)
1231 | hir::ItemKind::Union(_, ref generics) => {
1232 if generics.params.is_empty() {
1233 if self.mode == MonoItemCollectionMode::Eager {
1235 "RootCollector: ADT drop-glue for {}",
1236 self.tcx.def_path_str(item.def_id.to_def_id())
1240 Instance::new(item.def_id.to_def_id(), InternalSubsts::empty())
1241 .ty(self.tcx, ty::ParamEnv::reveal_all());
1242 visit_drop_use(self.tcx, ty, true, DUMMY_SP, self.output);
1249 DefKind::GlobalAsm => {
1251 "RootCollector: ItemKind::GlobalAsm({})",
1252 self.tcx.def_path_str(id.def_id.to_def_id())
1254 self.output.push(dummy_spanned(MonoItem::GlobalAsm(id)));
1256 DefKind::Static(..) => {
1258 "RootCollector: ItemKind::Static({})",
1259 self.tcx.def_path_str(id.def_id.to_def_id())
1261 self.output.push(dummy_spanned(MonoItem::Static(id.def_id.to_def_id())));
1264 // const items only generate mono items if they are
1265 // actually used somewhere. Just declaring them is insufficient.
1267 // but even just declaring them must collect the items they refer to
1268 if let Ok(val) = self.tcx.const_eval_poly(id.def_id.to_def_id()) {
1269 collect_const_value(self.tcx, val, &mut self.output);
1273 if self.mode == MonoItemCollectionMode::Eager {
1274 let item = self.tcx.hir().item(id);
1275 create_mono_items_for_default_impls(self.tcx, item, self.output);
1279 self.push_if_root(id.def_id);
1285 fn process_impl_item(&mut self, id: hir::ImplItemId) {
1286 if matches!(self.tcx.def_kind(id.def_id), DefKind::AssocFn) {
1287 self.push_if_root(id.def_id);
1291 fn is_root(&self, def_id: LocalDefId) -> bool {
1292 !item_requires_monomorphization(self.tcx, def_id)
1293 && match self.mode {
1294 MonoItemCollectionMode::Eager => true,
1295 MonoItemCollectionMode::Lazy => {
1296 self.entry_fn.and_then(|(id, _)| id.as_local()) == Some(def_id)
1297 || self.tcx.is_reachable_non_generic(def_id)
1300 .codegen_fn_attrs(def_id)
1302 .contains(CodegenFnAttrFlags::RUSTC_STD_INTERNAL_SYMBOL)
1307 /// If `def_id` represents a root, pushes it onto the list of
1308 /// outputs. (Note that all roots must be monomorphic.)
1309 #[instrument(skip(self), level = "debug")]
1310 fn push_if_root(&mut self, def_id: LocalDefId) {
1311 if self.is_root(def_id) {
1312 debug!("RootCollector::push_if_root: found root def_id={:?}", def_id);
1314 let instance = Instance::mono(self.tcx, def_id.to_def_id());
1315 self.output.push(create_fn_mono_item(self.tcx, instance, DUMMY_SP));
1319 /// As a special case, when/if we encounter the
1320 /// `main()` function, we also have to generate a
1321 /// monomorphized copy of the start lang item based on
1322 /// the return type of `main`. This is not needed when
1323 /// the user writes their own `start` manually.
1324 fn push_extra_entry_roots(&mut self) {
1325 let Some((main_def_id, EntryFnType::Main)) = self.entry_fn else {
1329 let start_def_id = match self.tcx.lang_items().require(LangItem::Start) {
1331 Err(error_message) => {
1332 self.tcx.sess.emit_fatal(FatalError { error_message: error_message.clone() });
1335 let main_ret_ty = self.tcx.fn_sig(main_def_id).output();
1337 // Given that `main()` has no arguments,
1338 // then its return type cannot have
1339 // late-bound regions, since late-bound
1340 // regions must appear in the argument
1342 let main_ret_ty = self.tcx.normalize_erasing_regions(
1343 ty::ParamEnv::reveal_all(),
1344 main_ret_ty.no_bound_vars().unwrap(),
1347 let start_instance = Instance::resolve(
1349 ty::ParamEnv::reveal_all(),
1351 self.tcx.intern_substs(&[main_ret_ty.into()]),
1356 self.output.push(create_fn_mono_item(self.tcx, start_instance, DUMMY_SP));
1360 fn item_requires_monomorphization(tcx: TyCtxt<'_>, def_id: LocalDefId) -> bool {
1361 let generics = tcx.generics_of(def_id);
1362 generics.requires_monomorphization(tcx)
1365 fn create_mono_items_for_default_impls<'tcx>(
1367 item: &'tcx hir::Item<'tcx>,
1368 output: &mut MonoItems<'tcx>,
1371 hir::ItemKind::Impl(ref impl_) => {
1372 for param in impl_.generics.params {
1374 hir::GenericParamKind::Lifetime { .. } => {}
1375 hir::GenericParamKind::Type { .. } | hir::GenericParamKind::Const { .. } => {
1382 "create_mono_items_for_default_impls(item={})",
1383 tcx.def_path_str(item.def_id.to_def_id())
1386 if let Some(trait_ref) = tcx.impl_trait_ref(item.def_id) {
1387 let param_env = ty::ParamEnv::reveal_all();
1388 let trait_ref = tcx.normalize_erasing_regions(param_env, trait_ref);
1389 let overridden_methods = tcx.impl_item_implementor_ids(item.def_id);
1390 for method in tcx.provided_trait_methods(trait_ref.def_id) {
1391 if overridden_methods.contains_key(&method.def_id) {
1395 if tcx.generics_of(method.def_id).own_requires_monomorphization() {
1400 InternalSubsts::for_item(tcx, method.def_id, |param, _| match param.kind {
1401 GenericParamDefKind::Lifetime => tcx.lifetimes.re_erased.into(),
1402 GenericParamDefKind::Type { .. }
1403 | GenericParamDefKind::Const { .. } => {
1404 trait_ref.substs[param.index as usize]
1407 let instance = ty::Instance::resolve(tcx, param_env, method.def_id, substs)
1411 let mono_item = create_fn_mono_item(tcx, instance, DUMMY_SP);
1412 if mono_item.node.is_instantiable(tcx) && should_codegen_locally(tcx, &instance)
1414 output.push(mono_item);
1423 /// Scans the miri alloc in order to find function calls, closures, and drop-glue.
1424 fn collect_miri<'tcx>(tcx: TyCtxt<'tcx>, alloc_id: AllocId, output: &mut MonoItems<'tcx>) {
1425 match tcx.global_alloc(alloc_id) {
1426 GlobalAlloc::Static(def_id) => {
1427 assert!(!tcx.is_thread_local_static(def_id));
1428 let instance = Instance::mono(tcx, def_id);
1429 if should_codegen_locally(tcx, &instance) {
1430 trace!("collecting static {:?}", def_id);
1431 output.push(dummy_spanned(MonoItem::Static(def_id)));
1434 GlobalAlloc::Memory(alloc) => {
1435 trace!("collecting {:?} with {:#?}", alloc_id, alloc);
1436 for &inner in alloc.inner().relocations().values() {
1437 rustc_data_structures::stack::ensure_sufficient_stack(|| {
1438 collect_miri(tcx, inner, output);
1442 GlobalAlloc::Function(fn_instance) => {
1443 if should_codegen_locally(tcx, &fn_instance) {
1444 trace!("collecting {:?} with {:#?}", alloc_id, fn_instance);
1445 output.push(create_fn_mono_item(tcx, fn_instance, DUMMY_SP));
1448 GlobalAlloc::VTable(ty, trait_ref) => {
1449 let alloc_id = tcx.vtable_allocation((ty, trait_ref));
1450 collect_miri(tcx, alloc_id, output)
1455 /// Scans the MIR in order to find function calls, closures, and drop-glue.
1456 #[instrument(skip(tcx, output), level = "debug")]
1457 fn collect_neighbours<'tcx>(
1459 instance: Instance<'tcx>,
1460 output: &mut MonoItems<'tcx>,
1462 let body = tcx.instance_mir(instance.def);
1463 MirNeighborCollector { tcx, body: &body, output, instance }.visit_body(&body);
1466 #[instrument(skip(tcx, output), level = "debug")]
1467 fn collect_const_value<'tcx>(
1469 value: ConstValue<'tcx>,
1470 output: &mut MonoItems<'tcx>,
1473 ConstValue::Scalar(Scalar::Ptr(ptr, _size)) => collect_miri(tcx, ptr.provenance, output),
1474 ConstValue::Slice { data: alloc, start: _, end: _ } | ConstValue::ByRef { alloc, .. } => {
1475 for &id in alloc.inner().relocations().values() {
1476 collect_miri(tcx, id, output);