1 //! Codegen the completed AST to the LLVM IR.
3 //! Some functions here, such as `codegen_block` and `codegen_expr`, return a value --
4 //! the result of the codegen to LLVM -- while others, such as `codegen_fn`
5 //! and `mono_item`, are called only for the side effect of adding a
6 //! particular definition to the LLVM IR output we're producing.
8 //! Hopefully useful general knowledge about codegen:
10 //! * There's no way to find out the `Ty` type of a `Value`. Doing so
11 //! would be "trying to get the eggs out of an omelette" (credit:
12 //! pcwalton). You can, instead, find out its `llvm::Type` by calling `val_ty`,
13 //! but one `llvm::Type` corresponds to many `Ty`s; for instance, `tup(int, int,
14 //! int)` and `rec(x=int, y=int, z=int)` will have the same `llvm::Type`.
16 use crate::back::write::{
17 start_async_codegen, submit_post_lto_module_to_llvm, submit_pre_lto_module_to_llvm,
20 use crate::common::{IntPredicate, RealPredicate, TypeKind};
23 use crate::mir::operand::OperandValue;
24 use crate::mir::place::PlaceRef;
26 use crate::{CachedModuleCodegen, CrateInfo, MemFlags, ModuleCodegen, ModuleKind};
28 use rustc::middle::codegen_fn_attrs::CodegenFnAttrs;
29 use rustc::middle::cstore::EncodedMetadata;
30 use rustc::middle::cstore::{self, LinkagePreference};
31 use rustc::middle::lang_items::StartFnLangItem;
32 use rustc::middle::weak_lang_items;
33 use rustc::mir::mono::{CodegenUnit, CodegenUnitNameBuilder, MonoItem};
34 use rustc::session::config::{self, EntryFnType, Lto};
35 use rustc::session::Session;
36 use rustc::ty::layout::{self, Align, HasTyCtxt, LayoutOf, TyLayout, VariantIdx};
37 use rustc::ty::layout::{FAT_PTR_ADDR, FAT_PTR_EXTRA};
38 use rustc::ty::query::Providers;
39 use rustc::ty::{self, Instance, Ty, TyCtxt};
40 use rustc_codegen_utils::{check_for_rustc_errors_attr, symbol_names_test};
41 use rustc_data_structures::fx::FxHashMap;
42 use rustc_data_structures::profiling::print_time_passes_entry;
44 use rustc_hir::def_id::{DefId, LOCAL_CRATE};
45 use rustc_index::vec::Idx;
46 use rustc_session::cgu_reuse_tracker::CguReuse;
51 use std::ops::{Deref, DerefMut};
52 use std::time::{Duration, Instant};
54 pub fn bin_op_to_icmp_predicate(op: hir::BinOpKind, signed: bool) -> IntPredicate {
56 hir::BinOpKind::Eq => IntPredicate::IntEQ,
57 hir::BinOpKind::Ne => IntPredicate::IntNE,
58 hir::BinOpKind::Lt => {
65 hir::BinOpKind::Le => {
72 hir::BinOpKind::Gt => {
79 hir::BinOpKind::Ge => {
87 "comparison_op_to_icmp_predicate: expected comparison operator, \
94 pub fn bin_op_to_fcmp_predicate(op: hir::BinOpKind) -> RealPredicate {
96 hir::BinOpKind::Eq => RealPredicate::RealOEQ,
97 hir::BinOpKind::Ne => RealPredicate::RealUNE,
98 hir::BinOpKind::Lt => RealPredicate::RealOLT,
99 hir::BinOpKind::Le => RealPredicate::RealOLE,
100 hir::BinOpKind::Gt => RealPredicate::RealOGT,
101 hir::BinOpKind::Ge => RealPredicate::RealOGE,
104 "comparison_op_to_fcmp_predicate: expected comparison operator, \
112 pub fn compare_simd_types<'a, 'tcx, Bx: BuilderMethods<'a, 'tcx>>(
120 let signed = match t.kind {
122 let cmp = bin_op_to_fcmp_predicate(op);
123 let cmp = bx.fcmp(cmp, lhs, rhs);
124 return bx.sext(cmp, ret_ty);
126 ty::Uint(_) => false,
128 _ => bug!("compare_simd_types: invalid SIMD type"),
131 let cmp = bin_op_to_icmp_predicate(op, signed);
132 let cmp = bx.icmp(cmp, lhs, rhs);
133 // LLVM outputs an `< size x i1 >`, so we need to perform a sign extension
134 // to get the correctly sized type. This will compile to a single instruction
135 // once the IR is converted to assembly if the SIMD instruction is supported
136 // by the target architecture.
140 /// Retrieves the information we are losing (making dynamic) in an unsizing
143 /// The `old_info` argument is a bit odd. It is intended for use in an upcast,
144 /// where the new vtable for an object will be derived from the old one.
145 pub fn unsized_info<'tcx, Cx: CodegenMethods<'tcx>>(
149 old_info: Option<Cx::Value>,
151 let (source, target) =
152 cx.tcx().struct_lockstep_tails_erasing_lifetimes(source, target, cx.param_env());
153 match (&source.kind, &target.kind) {
154 (&ty::Array(_, len), &ty::Slice(_)) => {
155 cx.const_usize(len.eval_usize(cx.tcx(), ty::ParamEnv::reveal_all()))
157 (&ty::Dynamic(..), &ty::Dynamic(..)) => {
158 // For now, upcasts are limited to changes in marker
159 // traits, and hence never actually require an actual
160 // change to the vtable.
161 old_info.expect("unsized_info: missing old info for trait upcast")
163 (_, &ty::Dynamic(ref data, ..)) => {
164 let vtable_ptr = cx.layout_of(cx.tcx().mk_mut_ptr(target)).field(cx, FAT_PTR_EXTRA);
166 meth::get_vtable(cx, source, data.principal()),
167 cx.backend_type(vtable_ptr),
170 _ => bug!("unsized_info: invalid unsizing {:?} -> {:?}", source, target),
174 /// Coerces `src` to `dst_ty`. `src_ty` must be a thin pointer.
175 pub fn unsize_thin_ptr<'a, 'tcx, Bx: BuilderMethods<'a, 'tcx>>(
180 ) -> (Bx::Value, Bx::Value) {
181 debug!("unsize_thin_ptr: {:?} => {:?}", src_ty, dst_ty);
182 match (&src_ty.kind, &dst_ty.kind) {
183 (&ty::Ref(_, a, _), &ty::Ref(_, b, _))
184 | (&ty::Ref(_, a, _), &ty::RawPtr(ty::TypeAndMut { ty: b, .. }))
185 | (&ty::RawPtr(ty::TypeAndMut { ty: a, .. }), &ty::RawPtr(ty::TypeAndMut { ty: b, .. })) => {
186 assert!(bx.cx().type_is_sized(a));
187 let ptr_ty = bx.cx().type_ptr_to(bx.cx().backend_type(bx.cx().layout_of(b)));
188 (bx.pointercast(src, ptr_ty), unsized_info(bx.cx(), a, b, None))
190 (&ty::Adt(def_a, _), &ty::Adt(def_b, _)) => {
191 assert_eq!(def_a, def_b);
193 let src_layout = bx.cx().layout_of(src_ty);
194 let dst_layout = bx.cx().layout_of(dst_ty);
195 let mut result = None;
196 for i in 0..src_layout.fields.count() {
197 let src_f = src_layout.field(bx.cx(), i);
198 assert_eq!(src_layout.fields.offset(i).bytes(), 0);
199 assert_eq!(dst_layout.fields.offset(i).bytes(), 0);
203 assert_eq!(src_layout.size, src_f.size);
205 let dst_f = dst_layout.field(bx.cx(), i);
206 assert_ne!(src_f.ty, dst_f.ty);
207 assert_eq!(result, None);
208 result = Some(unsize_thin_ptr(bx, src, src_f.ty, dst_f.ty));
210 let (lldata, llextra) = result.unwrap();
211 // HACK(eddyb) have to bitcast pointers until LLVM removes pointee types.
212 // FIXME(eddyb) move these out of this `match` arm, so they're always
213 // applied, uniformly, no matter the source/destination types.
215 bx.bitcast(lldata, bx.cx().scalar_pair_element_backend_type(dst_layout, 0, true)),
216 bx.bitcast(llextra, bx.cx().scalar_pair_element_backend_type(dst_layout, 1, true)),
219 _ => bug!("unsize_thin_ptr: called on bad types"),
223 /// Coerces `src`, which is a reference to a value of type `src_ty`,
224 /// to a value of type `dst_ty`, and stores the result in `dst`.
225 pub fn coerce_unsized_into<'a, 'tcx, Bx: BuilderMethods<'a, 'tcx>>(
227 src: PlaceRef<'tcx, Bx::Value>,
228 dst: PlaceRef<'tcx, Bx::Value>,
230 let src_ty = src.layout.ty;
231 let dst_ty = dst.layout.ty;
232 match (&src_ty.kind, &dst_ty.kind) {
233 (&ty::Ref(..), &ty::Ref(..))
234 | (&ty::Ref(..), &ty::RawPtr(..))
235 | (&ty::RawPtr(..), &ty::RawPtr(..)) => {
236 let (base, info) = match bx.load_operand(src).val {
237 OperandValue::Pair(base, info) => {
238 // fat-ptr to fat-ptr unsize preserves the vtable
239 // i.e., &'a fmt::Debug+Send => &'a fmt::Debug
240 // So we need to pointercast the base to ensure
241 // the types match up.
242 // FIXME(eddyb) use `scalar_pair_element_backend_type` here,
243 // like `unsize_thin_ptr` does.
244 let thin_ptr = dst.layout.field(bx.cx(), FAT_PTR_ADDR);
245 (bx.pointercast(base, bx.cx().backend_type(thin_ptr)), info)
247 OperandValue::Immediate(base) => unsize_thin_ptr(bx, base, src_ty, dst_ty),
248 OperandValue::Ref(..) => bug!(),
250 OperandValue::Pair(base, info).store(bx, dst);
253 (&ty::Adt(def_a, _), &ty::Adt(def_b, _)) => {
254 assert_eq!(def_a, def_b);
256 for i in 0..def_a.variants[VariantIdx::new(0)].fields.len() {
257 let src_f = src.project_field(bx, i);
258 let dst_f = dst.project_field(bx, i);
260 if dst_f.layout.is_zst() {
264 if src_f.layout.ty == dst_f.layout.ty {
275 coerce_unsized_into(bx, src_f, dst_f);
279 _ => bug!("coerce_unsized_into: invalid coercion {:?} -> {:?}", src_ty, dst_ty,),
283 pub fn cast_shift_expr_rhs<'a, 'tcx, Bx: BuilderMethods<'a, 'tcx>>(
289 cast_shift_rhs(bx, op, lhs, rhs)
292 fn cast_shift_rhs<'a, 'tcx, Bx: BuilderMethods<'a, 'tcx>>(
298 // Shifts may have any size int on the rhs
300 let mut rhs_llty = bx.cx().val_ty(rhs);
301 let mut lhs_llty = bx.cx().val_ty(lhs);
302 if bx.cx().type_kind(rhs_llty) == TypeKind::Vector {
303 rhs_llty = bx.cx().element_type(rhs_llty)
305 if bx.cx().type_kind(lhs_llty) == TypeKind::Vector {
306 lhs_llty = bx.cx().element_type(lhs_llty)
308 let rhs_sz = bx.cx().int_width(rhs_llty);
309 let lhs_sz = bx.cx().int_width(lhs_llty);
311 bx.trunc(rhs, lhs_llty)
312 } else if lhs_sz > rhs_sz {
313 // FIXME (#1877: If in the future shifting by negative
314 // values is no longer undefined then this is wrong.
315 bx.zext(rhs, lhs_llty)
324 /// Returns `true` if this session's target will use SEH-based unwinding.
326 /// This is only true for MSVC targets, and even then the 64-bit MSVC target
327 /// currently uses SEH-ish unwinding with DWARF info tables to the side (same as
328 /// 64-bit MinGW) instead of "full SEH".
329 pub fn wants_msvc_seh(sess: &Session) -> bool {
330 sess.target.target.options.is_like_msvc
333 pub fn from_immediate<'a, 'tcx, Bx: BuilderMethods<'a, 'tcx>>(
337 if bx.cx().val_ty(val) == bx.cx().type_i1() {
338 bx.zext(val, bx.cx().type_i8())
344 pub fn to_immediate<'a, 'tcx, Bx: BuilderMethods<'a, 'tcx>>(
347 layout: layout::TyLayout<'_>,
349 if let layout::Abi::Scalar(ref scalar) = layout.abi {
350 return to_immediate_scalar(bx, val, scalar);
355 pub fn to_immediate_scalar<'a, 'tcx, Bx: BuilderMethods<'a, 'tcx>>(
358 scalar: &layout::Scalar,
360 if scalar.is_bool() {
361 return bx.trunc(val, bx.cx().type_i1());
366 pub fn memcpy_ty<'a, 'tcx, Bx: BuilderMethods<'a, 'tcx>>(
372 layout: TyLayout<'tcx>,
375 let size = layout.size.bytes();
380 bx.memcpy(dst, dst_align, src, src_align, bx.cx().const_usize(size), flags);
383 pub fn codegen_instance<'a, 'tcx: 'a, Bx: BuilderMethods<'a, 'tcx>>(
384 cx: &'a Bx::CodegenCx,
385 instance: Instance<'tcx>,
387 // this is an info! to allow collecting monomorphization statistics
388 // and to allow finding the last function before LLVM aborts from
390 info!("codegen_instance({})", instance);
392 mir::codegen_mir::<Bx>(cx, instance);
395 /// Creates the `main` function which will initialize the rust runtime and call
396 /// users main function.
397 pub fn maybe_create_entry_wrapper<'a, 'tcx, Bx: BuilderMethods<'a, 'tcx>>(cx: &'a Bx::CodegenCx) {
398 let (main_def_id, span) = match cx.tcx().entry_fn(LOCAL_CRATE) {
399 Some((def_id, _)) => (def_id, cx.tcx().def_span(def_id)),
403 let instance = Instance::mono(cx.tcx(), main_def_id);
405 if !cx.codegen_unit().contains_item(&MonoItem::Fn(instance)) {
406 // We want to create the wrapper in the same codegen unit as Rust's main
411 let main_llfn = cx.get_fn_addr(instance);
413 let et = cx.tcx().entry_fn(LOCAL_CRATE).map(|e| e.1);
415 Some(EntryFnType::Main) => create_entry_fn::<Bx>(cx, span, main_llfn, main_def_id, true),
416 Some(EntryFnType::Start) => create_entry_fn::<Bx>(cx, span, main_llfn, main_def_id, false),
417 None => {} // Do nothing.
420 fn create_entry_fn<'a, 'tcx, Bx: BuilderMethods<'a, 'tcx>>(
421 cx: &'a Bx::CodegenCx,
423 rust_main: Bx::Value,
424 rust_main_def_id: DefId,
425 use_start_lang_item: bool,
427 // The entry function is either `int main(void)` or `int main(int argc, char **argv)`,
428 // depending on whether the target needs `argc` and `argv` to be passed in.
429 let llfty = if cx.sess().target.target.options.main_needs_argc_argv {
430 cx.type_func(&[cx.type_int(), cx.type_ptr_to(cx.type_i8p())], cx.type_int())
432 cx.type_func(&[], cx.type_int())
435 let main_ret_ty = cx.tcx().fn_sig(rust_main_def_id).output();
436 // Given that `main()` has no arguments,
437 // then its return type cannot have
438 // late-bound regions, since late-bound
439 // regions must appear in the argument
441 let main_ret_ty = cx.tcx().erase_regions(&main_ret_ty.no_bound_vars().unwrap());
443 if cx.get_defined_value("main").is_some() {
444 // FIXME: We should be smart and show a better diagnostic here.
446 .struct_span_err(sp, "entry symbol `main` defined multiple times")
447 .help("did you use `#[no_mangle]` on `fn main`? Use `#[start]` instead")
449 cx.sess().abort_if_errors();
452 let llfn = cx.declare_cfn("main", llfty);
454 // `main` should respect same config for frame pointer elimination as rest of code
455 cx.set_frame_pointer_elimination(llfn);
456 cx.apply_target_cpu_attr(llfn);
458 let mut bx = Bx::new_block(&cx, llfn, "top");
460 bx.insert_reference_to_gdb_debug_scripts_section_global();
462 let (arg_argc, arg_argv) = get_argc_argv(cx, &mut bx);
464 let (start_fn, args) = if use_start_lang_item {
465 let start_def_id = cx.tcx().require_lang_item(StartFnLangItem, None);
466 let start_fn = cx.get_fn_addr(
467 ty::Instance::resolve(
469 ty::ParamEnv::reveal_all(),
471 cx.tcx().intern_substs(&[main_ret_ty.into()]),
477 vec![bx.pointercast(rust_main, cx.type_ptr_to(cx.type_i8p())), arg_argc, arg_argv],
480 debug!("using user-defined start fn");
481 (rust_main, vec![arg_argc, arg_argv])
484 let result = bx.call(start_fn, &args, None);
485 let cast = bx.intcast(result, cx.type_int(), true);
490 /// Obtain the `argc` and `argv` values to pass to the rust start function.
491 fn get_argc_argv<'a, 'tcx, Bx: BuilderMethods<'a, 'tcx>>(
492 cx: &'a Bx::CodegenCx,
494 ) -> (Bx::Value, Bx::Value) {
495 if cx.sess().target.target.options.main_needs_argc_argv {
496 // Params from native `main()` used as args for rust start function
497 let param_argc = bx.get_param(0);
498 let param_argv = bx.get_param(1);
499 let arg_argc = bx.intcast(param_argc, cx.type_isize(), true);
500 let arg_argv = param_argv;
503 // The Rust start function doesn't need `argc` and `argv`, so just pass zeros.
504 let arg_argc = bx.const_int(cx.type_int(), 0);
505 let arg_argv = bx.const_null(cx.type_ptr_to(cx.type_i8p()));
510 pub const CODEGEN_WORKER_ID: usize = ::std::usize::MAX;
512 pub fn codegen_crate<B: ExtraBackendMethods>(
515 metadata: EncodedMetadata,
516 need_metadata_module: bool,
517 ) -> OngoingCodegen<B> {
518 check_for_rustc_errors_attr(tcx);
520 // Skip crate items and just output metadata in -Z no-codegen mode.
521 if tcx.sess.opts.debugging_opts.no_codegen || !tcx.sess.opts.output_types.should_codegen() {
522 let ongoing_codegen = start_async_codegen(backend, tcx, metadata, 1);
524 ongoing_codegen.codegen_finished(tcx);
528 ongoing_codegen.check_for_errors(tcx.sess);
530 return ongoing_codegen;
533 let cgu_name_builder = &mut CodegenUnitNameBuilder::new(tcx);
535 // Run the monomorphization collector and partition the collected items into
537 let codegen_units = tcx.collect_and_partition_mono_items(LOCAL_CRATE).1;
538 let codegen_units = (*codegen_units).clone();
540 // Force all codegen_unit queries so they are already either red or green
541 // when compile_codegen_unit accesses them. We are not able to re-execute
542 // the codegen_unit query from just the DepNode, so an unknown color would
543 // lead to having to re-execute compile_codegen_unit, possibly
545 if tcx.dep_graph.is_fully_enabled() {
546 for cgu in &codegen_units {
547 tcx.codegen_unit(cgu.name());
551 let ongoing_codegen = start_async_codegen(backend.clone(), tcx, metadata, codegen_units.len());
552 let ongoing_codegen = AbortCodegenOnDrop::<B>(Some(ongoing_codegen));
554 // Codegen an allocator shim, if necessary.
556 // If the crate doesn't have an `allocator_kind` set then there's definitely
557 // no shim to generate. Otherwise we also check our dependency graph for all
558 // our output crate types. If anything there looks like its a `Dynamic`
559 // linkage, then it's already got an allocator shim and we'll be using that
560 // one instead. If nothing exists then it's our job to generate the
562 let any_dynamic_crate = tcx.dependency_formats(LOCAL_CRATE).iter().any(|(_, list)| {
563 use rustc::middle::dependency_format::Linkage;
564 list.iter().any(|&linkage| linkage == Linkage::Dynamic)
566 let allocator_module = if any_dynamic_crate {
568 } else if let Some(kind) = tcx.allocator_kind() {
570 cgu_name_builder.build_cgu_name(LOCAL_CRATE, &["crate"], Some("allocator")).to_string();
571 let mut modules = backend.new_metadata(tcx, &llmod_id);
573 .time("write_allocator_module", || backend.codegen_allocator(tcx, &mut modules, kind));
575 Some(ModuleCodegen { name: llmod_id, module_llvm: modules, kind: ModuleKind::Allocator })
580 if let Some(allocator_module) = allocator_module {
581 ongoing_codegen.submit_pre_codegened_module_to_llvm(tcx, allocator_module);
584 if need_metadata_module {
585 // Codegen the encoded metadata.
586 let metadata_cgu_name =
587 cgu_name_builder.build_cgu_name(LOCAL_CRATE, &["crate"], Some("metadata")).to_string();
588 let mut metadata_llvm_module = backend.new_metadata(tcx, &metadata_cgu_name);
589 tcx.sess.time("write_compressed_metadata", || {
590 backend.write_compressed_metadata(
592 &ongoing_codegen.metadata,
593 &mut metadata_llvm_module,
597 let metadata_module = ModuleCodegen {
598 name: metadata_cgu_name,
599 module_llvm: metadata_llvm_module,
600 kind: ModuleKind::Metadata,
602 ongoing_codegen.submit_pre_codegened_module_to_llvm(tcx, metadata_module);
605 // We sort the codegen units by size. This way we can schedule work for LLVM
606 // a bit more efficiently.
607 let codegen_units = {
608 let mut codegen_units = codegen_units;
609 codegen_units.sort_by_cached_key(|cgu| cmp::Reverse(cgu.size_estimate()));
613 let mut total_codegen_time = Duration::new(0, 0);
615 for cgu in codegen_units.into_iter() {
616 ongoing_codegen.wait_for_signal_to_codegen_item();
617 ongoing_codegen.check_for_errors(tcx.sess);
619 let cgu_reuse = determine_cgu_reuse(tcx, &cgu);
620 tcx.sess.cgu_reuse_tracker.set_actual_reuse(&cgu.name().as_str(), cgu_reuse);
624 let start_time = Instant::now();
625 backend.compile_codegen_unit(tcx, cgu.name(), &ongoing_codegen.coordinator_send);
626 total_codegen_time += start_time.elapsed();
629 CguReuse::PreLto => {
630 submit_pre_lto_module_to_llvm(
633 &ongoing_codegen.coordinator_send,
634 CachedModuleCodegen {
635 name: cgu.name().to_string(),
636 source: cgu.work_product(tcx),
641 CguReuse::PostLto => {
642 submit_post_lto_module_to_llvm(
644 &ongoing_codegen.coordinator_send,
645 CachedModuleCodegen {
646 name: cgu.name().to_string(),
647 source: cgu.work_product(tcx),
655 ongoing_codegen.codegen_finished(tcx);
657 // Since the main thread is sometimes blocked during codegen, we keep track
658 // -Ztime-passes output manually.
659 print_time_passes_entry(tcx.sess.time_passes(), "codegen_to_LLVM_IR", total_codegen_time);
661 ::rustc_incremental::assert_module_sources::assert_module_sources(tcx);
663 symbol_names_test::report_symbol_names(tcx);
665 ongoing_codegen.check_for_errors(tcx.sess);
669 ongoing_codegen.into_inner()
672 /// A curious wrapper structure whose only purpose is to call `codegen_aborted`
673 /// when it's dropped abnormally.
675 /// In the process of working on rust-lang/rust#55238 a mysterious segfault was
676 /// stumbled upon. The segfault was never reproduced locally, but it was
677 /// suspected to be related to the fact that codegen worker threads were
678 /// sticking around by the time the main thread was exiting, causing issues.
680 /// This structure is an attempt to fix that issue where the `codegen_aborted`
681 /// message will block until all workers have finished. This should ensure that
682 /// even if the main codegen thread panics we'll wait for pending work to
683 /// complete before returning from the main thread, hopefully avoiding
686 /// If you see this comment in the code, then it means that this workaround
687 /// worked! We may yet one day track down the mysterious cause of that
689 struct AbortCodegenOnDrop<B: ExtraBackendMethods>(Option<OngoingCodegen<B>>);
691 impl<B: ExtraBackendMethods> AbortCodegenOnDrop<B> {
692 fn into_inner(mut self) -> OngoingCodegen<B> {
693 self.0.take().unwrap()
697 impl<B: ExtraBackendMethods> Deref for AbortCodegenOnDrop<B> {
698 type Target = OngoingCodegen<B>;
700 fn deref(&self) -> &OngoingCodegen<B> {
701 self.0.as_ref().unwrap()
705 impl<B: ExtraBackendMethods> DerefMut for AbortCodegenOnDrop<B> {
706 fn deref_mut(&mut self) -> &mut OngoingCodegen<B> {
707 self.0.as_mut().unwrap()
711 impl<B: ExtraBackendMethods> Drop for AbortCodegenOnDrop<B> {
713 if let Some(codegen) = self.0.take() {
714 codegen.codegen_aborted();
719 fn finalize_tcx(tcx: TyCtxt<'_>) {
720 tcx.sess.time("assert_dep_graph", || ::rustc_incremental::assert_dep_graph(tcx));
721 tcx.sess.time("serialize_dep_graph", || ::rustc_incremental::save_dep_graph(tcx));
723 // We assume that no queries are run past here. If there are new queries
724 // after this point, they'll show up as "<unknown>" in self-profiling data.
726 let _prof_timer = tcx.prof.generic_activity("self_profile_alloc_query_strings");
727 tcx.alloc_self_profile_query_strings();
732 pub fn new(tcx: TyCtxt<'_>) -> CrateInfo {
733 let mut info = CrateInfo {
735 compiler_builtins: None,
736 profiler_runtime: None,
737 sanitizer_runtime: None,
738 is_no_builtins: Default::default(),
739 native_libraries: Default::default(),
740 used_libraries: tcx.native_libraries(LOCAL_CRATE),
741 link_args: tcx.link_args(LOCAL_CRATE),
742 crate_name: Default::default(),
743 used_crates_dynamic: cstore::used_crates(tcx, LinkagePreference::RequireDynamic),
744 used_crates_static: cstore::used_crates(tcx, LinkagePreference::RequireStatic),
745 used_crate_source: Default::default(),
746 lang_item_to_crate: Default::default(),
747 missing_lang_items: Default::default(),
748 dependency_formats: tcx.dependency_formats(LOCAL_CRATE),
750 let lang_items = tcx.lang_items();
752 let crates = tcx.crates();
754 let n_crates = crates.len();
755 info.native_libraries.reserve(n_crates);
756 info.crate_name.reserve(n_crates);
757 info.used_crate_source.reserve(n_crates);
758 info.missing_lang_items.reserve(n_crates);
760 for &cnum in crates.iter() {
761 info.native_libraries.insert(cnum, tcx.native_libraries(cnum));
762 info.crate_name.insert(cnum, tcx.crate_name(cnum).to_string());
763 info.used_crate_source.insert(cnum, tcx.used_crate_source(cnum));
764 if tcx.is_panic_runtime(cnum) {
765 info.panic_runtime = Some(cnum);
767 if tcx.is_compiler_builtins(cnum) {
768 info.compiler_builtins = Some(cnum);
770 if tcx.is_profiler_runtime(cnum) {
771 info.profiler_runtime = Some(cnum);
773 if tcx.is_sanitizer_runtime(cnum) {
774 info.sanitizer_runtime = Some(cnum);
776 if tcx.is_no_builtins(cnum) {
777 info.is_no_builtins.insert(cnum);
779 let missing = tcx.missing_lang_items(cnum);
780 for &item in missing.iter() {
781 if let Ok(id) = lang_items.require(item) {
782 info.lang_item_to_crate.insert(item, id.krate);
786 // No need to look for lang items that are whitelisted and don't
787 // actually need to exist.
788 let missing = missing
791 .filter(|&l| !weak_lang_items::whitelisted(tcx, l))
793 info.missing_lang_items.insert(cnum, missing);
800 pub fn provide_both(providers: &mut Providers<'_>) {
801 providers.backend_optimization_level = |tcx, cratenum| {
802 let for_speed = match tcx.sess.opts.optimize {
803 // If globally no optimisation is done, #[optimize] has no effect.
805 // This is done because if we ended up "upgrading" to `-O2` here, we’d populate the
806 // pass manager and it is likely that some module-wide passes (such as inliner or
807 // cross-function constant propagation) would ignore the `optnone` annotation we put
808 // on the functions, thus necessarily involving these functions into optimisations.
809 config::OptLevel::No => return config::OptLevel::No,
810 // If globally optimise-speed is already specified, just use that level.
811 config::OptLevel::Less => return config::OptLevel::Less,
812 config::OptLevel::Default => return config::OptLevel::Default,
813 config::OptLevel::Aggressive => return config::OptLevel::Aggressive,
814 // If globally optimize-for-size has been requested, use -O2 instead (if optimize(size)
816 config::OptLevel::Size => config::OptLevel::Default,
817 config::OptLevel::SizeMin => config::OptLevel::Default,
820 let (defids, _) = tcx.collect_and_partition_mono_items(cratenum);
822 let CodegenFnAttrs { optimize, .. } = tcx.codegen_fn_attrs(*id);
824 attr::OptimizeAttr::None => continue,
825 attr::OptimizeAttr::Size => continue,
826 attr::OptimizeAttr::Speed => {
831 return tcx.sess.opts.optimize;
834 providers.dllimport_foreign_items = |tcx, krate| {
835 let module_map = tcx.foreign_modules(krate);
837 module_map.iter().map(|lib| (lib.def_id, lib)).collect::<FxHashMap<_, _>>();
840 .native_libraries(krate)
843 if lib.kind != cstore::NativeLibraryKind::NativeUnknown {
846 let cfg = match lib.cfg {
847 Some(ref cfg) => cfg,
850 attr::cfg_matches(cfg, &tcx.sess.parse_sess, None)
852 .filter_map(|lib| lib.foreign_module)
853 .map(|id| &module_map[&id])
854 .flat_map(|module| module.foreign_items.iter().cloned())
856 tcx.arena.alloc(dllimports)
859 providers.is_dllimport_foreign_item =
860 |tcx, def_id| tcx.dllimport_foreign_items(def_id.krate).contains(&def_id);
863 fn determine_cgu_reuse<'tcx>(tcx: TyCtxt<'tcx>, cgu: &CodegenUnit<'tcx>) -> CguReuse {
864 if !tcx.dep_graph.is_fully_enabled() {
868 let work_product_id = &cgu.work_product_id();
869 if tcx.dep_graph.previous_work_product(work_product_id).is_none() {
870 // We don't have anything cached for this CGU. This can happen
871 // if the CGU did not exist in the previous session.
875 // Try to mark the CGU as green. If it we can do so, it means that nothing
876 // affecting the LLVM module has changed and we can re-use a cached version.
877 // If we compile with any kind of LTO, this means we can re-use the bitcode
878 // of the Pre-LTO stage (possibly also the Post-LTO version but we'll only
879 // know that later). If we are not doing LTO, there is only one optimized
880 // version of each module, so we re-use that.
881 let dep_node = cgu.codegen_dep_node(tcx);
883 !tcx.dep_graph.dep_node_exists(&dep_node),
884 "CompileCodegenUnit dep-node for CGU `{}` already exists before marking.",
888 if tcx.dep_graph.try_mark_green(tcx, &dep_node).is_some() {
889 // We can re-use either the pre- or the post-thinlto state
890 if tcx.sess.lto() != Lto::No {