1 // Copyright 2012-2015 The Rust Project Developers. See the COPYRIGHT
2 // file at the top-level directory of this distribution and at
3 // http://rust-lang.org/COPYRIGHT.
5 // Licensed under the Apache License, Version 2.0 <LICENSE-APACHE or
6 // http://www.apache.org/licenses/LICENSE-2.0> or the MIT license
7 // <LICENSE-MIT or http://opensource.org/licenses/MIT>, at your
8 // option. This file may not be copied, modified, or distributed
9 // except according to those terms.
11 //! Translate the completed AST to the LLVM IR.
13 //! Some functions here, such as trans_block and trans_expr, return a value --
14 //! the result of the translation to LLVM -- while others, such as trans_fn
15 //! and trans_item, are called only for the side effect of adding a
16 //! particular definition to the LLVM IR output we're producing.
18 //! Hopefully useful general knowledge about trans:
20 //! * There's no way to find out the Ty type of a ValueRef. Doing so
21 //! would be "trying to get the eggs out of an omelette" (credit:
22 //! pcwalton). You can, instead, find out its TypeRef by calling val_ty,
23 //! but one TypeRef corresponds to many `Ty`s; for instance, tup(int, int,
24 //! int) and rec(x=int, y=int, z=int) will have the same TypeRef.
26 use super::CrateTranslation;
27 use super::ModuleLlvm;
28 use super::ModuleSource;
29 use super::ModuleTranslation;
31 use assert_module_sources;
33 use back::linker::LinkerInfo;
34 use back::symbol_export::{self, ExportedSymbols};
35 use llvm::{Linkage, ValueRef, Vector, get_param};
37 use rustc::hir::def_id::LOCAL_CRATE;
38 use middle::lang_items::StartFnLangItem;
39 use middle::cstore::EncodedMetadata;
40 use rustc::ty::{self, Ty, TyCtxt};
41 use rustc::dep_graph::{AssertDepGraphSafe, DepNode, WorkProduct};
42 use rustc::hir::map as hir_map;
43 use rustc::util::common::time;
44 use session::config::{self, NoDebugInfo};
45 use rustc_incremental::IncrementalHashesMap;
46 use session::{self, DataTypeKind, Session};
48 use mir::lvalue::LvalueRef;
52 use common::{C_bool, C_bytes_in_context, C_i32, C_uint};
53 use collector::{self, TransItemCollectionMode};
54 use common::{C_struct_in_context, C_u64, C_undef, C_array};
55 use common::CrateContext;
56 use common::{type_is_zero_size, val_ty};
59 use context::{SharedCrateContext, CrateContextList};
65 use monomorphize::{self, Instance};
66 use partitioning::{self, PartitioningStrategy, CodegenUnit};
67 use symbol_map::SymbolMap;
68 use symbol_names_test;
69 use trans_item::{TransItem, DefPathBasedNames};
73 use util::nodemap::{NodeSet, FxHashMap, FxHashSet};
76 use std::ffi::{CStr, CString};
83 use rustc::ty::layout::{self, Layout};
86 use mir::lvalue::Alignment;
88 pub struct StatRecorder<'a, 'tcx: 'a> {
89 ccx: &'a CrateContext<'a, 'tcx>,
94 impl<'a, 'tcx> StatRecorder<'a, 'tcx> {
95 pub fn new(ccx: &'a CrateContext<'a, 'tcx>, name: String) -> StatRecorder<'a, 'tcx> {
96 let istart = ccx.stats().n_llvm_insns.get();
105 impl<'a, 'tcx> Drop for StatRecorder<'a, 'tcx> {
107 if self.ccx.sess().trans_stats() {
108 let iend = self.ccx.stats().n_llvm_insns.get();
109 self.ccx.stats().fn_stats.borrow_mut()
110 .push((self.name.take().unwrap(), iend - self.istart));
111 self.ccx.stats().n_fns.set(self.ccx.stats().n_fns.get() + 1);
112 // Reset LLVM insn count to avoid compound costs.
113 self.ccx.stats().n_llvm_insns.set(self.istart);
118 pub fn get_meta(bcx: &Builder, fat_ptr: ValueRef) -> ValueRef {
119 bcx.struct_gep(fat_ptr, abi::FAT_PTR_EXTRA)
122 pub fn get_dataptr(bcx: &Builder, fat_ptr: ValueRef) -> ValueRef {
123 bcx.struct_gep(fat_ptr, abi::FAT_PTR_ADDR)
126 pub fn bin_op_to_icmp_predicate(op: hir::BinOp_,
128 -> llvm::IntPredicate {
130 hir::BiEq => llvm::IntEQ,
131 hir::BiNe => llvm::IntNE,
132 hir::BiLt => if signed { llvm::IntSLT } else { llvm::IntULT },
133 hir::BiLe => if signed { llvm::IntSLE } else { llvm::IntULE },
134 hir::BiGt => if signed { llvm::IntSGT } else { llvm::IntUGT },
135 hir::BiGe => if signed { llvm::IntSGE } else { llvm::IntUGE },
137 bug!("comparison_op_to_icmp_predicate: expected comparison operator, \
144 pub fn bin_op_to_fcmp_predicate(op: hir::BinOp_) -> llvm::RealPredicate {
146 hir::BiEq => llvm::RealOEQ,
147 hir::BiNe => llvm::RealUNE,
148 hir::BiLt => llvm::RealOLT,
149 hir::BiLe => llvm::RealOLE,
150 hir::BiGt => llvm::RealOGT,
151 hir::BiGe => llvm::RealOGE,
153 bug!("comparison_op_to_fcmp_predicate: expected comparison operator, \
160 pub fn compare_simd_types<'a, 'tcx>(
161 bcx: &Builder<'a, 'tcx>,
168 let signed = match t.sty {
170 let cmp = bin_op_to_fcmp_predicate(op);
171 return bcx.sext(bcx.fcmp(cmp, lhs, rhs), ret_ty);
173 ty::TyUint(_) => false,
174 ty::TyInt(_) => true,
175 _ => bug!("compare_simd_types: invalid SIMD type"),
178 let cmp = bin_op_to_icmp_predicate(op, signed);
179 // LLVM outputs an `< size x i1 >`, so we need to perform a sign extension
180 // to get the correctly sized type. This will compile to a single instruction
181 // once the IR is converted to assembly if the SIMD instruction is supported
182 // by the target architecture.
183 bcx.sext(bcx.icmp(cmp, lhs, rhs), ret_ty)
186 /// Retrieve the information we are losing (making dynamic) in an unsizing
189 /// The `old_info` argument is a bit funny. It is intended for use
190 /// in an upcast, where the new vtable for an object will be drived
191 /// from the old one.
192 pub fn unsized_info<'ccx, 'tcx>(ccx: &CrateContext<'ccx, 'tcx>,
195 old_info: Option<ValueRef>)
197 let (source, target) = ccx.tcx().struct_lockstep_tails(source, target);
198 match (&source.sty, &target.sty) {
199 (&ty::TyArray(_, len), &ty::TySlice(_)) => C_uint(ccx, len),
200 (&ty::TyDynamic(..), &ty::TyDynamic(..)) => {
201 // For now, upcasts are limited to changes in marker
202 // traits, and hence never actually require an actual
203 // change to the vtable.
204 old_info.expect("unsized_info: missing old info for trait upcast")
206 (_, &ty::TyDynamic(ref data, ..)) => {
207 consts::ptrcast(meth::get_vtable(ccx, source, data.principal()),
208 Type::vtable_ptr(ccx))
210 _ => bug!("unsized_info: invalid unsizing {:?} -> {:?}",
216 /// Coerce `src` to `dst_ty`. `src_ty` must be a thin pointer.
217 pub fn unsize_thin_ptr<'a, 'tcx>(
218 bcx: &Builder<'a, 'tcx>,
222 ) -> (ValueRef, ValueRef) {
223 debug!("unsize_thin_ptr: {:?} => {:?}", src_ty, dst_ty);
224 match (&src_ty.sty, &dst_ty.sty) {
225 (&ty::TyRef(_, ty::TypeAndMut { ty: a, .. }),
226 &ty::TyRef(_, ty::TypeAndMut { ty: b, .. })) |
227 (&ty::TyRef(_, ty::TypeAndMut { ty: a, .. }),
228 &ty::TyRawPtr(ty::TypeAndMut { ty: b, .. })) |
229 (&ty::TyRawPtr(ty::TypeAndMut { ty: a, .. }),
230 &ty::TyRawPtr(ty::TypeAndMut { ty: b, .. })) => {
231 assert!(bcx.ccx.shared().type_is_sized(a));
232 let ptr_ty = type_of::in_memory_type_of(bcx.ccx, b).ptr_to();
233 (bcx.pointercast(src, ptr_ty), unsized_info(bcx.ccx, a, b, None))
235 (&ty::TyAdt(def_a, _), &ty::TyAdt(def_b, _)) if def_a.is_box() && def_b.is_box() => {
236 let (a, b) = (src_ty.boxed_ty(), dst_ty.boxed_ty());
237 assert!(bcx.ccx.shared().type_is_sized(a));
238 let ptr_ty = type_of::in_memory_type_of(bcx.ccx, b).ptr_to();
239 (bcx.pointercast(src, ptr_ty), unsized_info(bcx.ccx, a, b, None))
241 _ => bug!("unsize_thin_ptr: called on bad types"),
245 /// Coerce `src`, which is a reference to a value of type `src_ty`,
246 /// to a value of type `dst_ty` and store the result in `dst`
247 pub fn coerce_unsized_into<'a, 'tcx>(bcx: &Builder<'a, 'tcx>,
248 src: &LvalueRef<'tcx>,
249 dst: &LvalueRef<'tcx>) {
250 let src_ty = src.ty.to_ty(bcx.tcx());
251 let dst_ty = dst.ty.to_ty(bcx.tcx());
252 let coerce_ptr = || {
253 let (base, info) = if common::type_is_fat_ptr(bcx.ccx, src_ty) {
254 // fat-ptr to fat-ptr unsize preserves the vtable
255 // i.e. &'a fmt::Debug+Send => &'a fmt::Debug
256 // So we need to pointercast the base to ensure
257 // the types match up.
258 let (base, info) = load_fat_ptr(bcx, src.llval, src.alignment, src_ty);
259 let llcast_ty = type_of::fat_ptr_base_ty(bcx.ccx, dst_ty);
260 let base = bcx.pointercast(base, llcast_ty);
263 let base = load_ty(bcx, src.llval, src.alignment, src_ty);
264 unsize_thin_ptr(bcx, base, src_ty, dst_ty)
266 store_fat_ptr(bcx, base, info, dst.llval, dst.alignment, dst_ty);
268 match (&src_ty.sty, &dst_ty.sty) {
269 (&ty::TyRef(..), &ty::TyRef(..)) |
270 (&ty::TyRef(..), &ty::TyRawPtr(..)) |
271 (&ty::TyRawPtr(..), &ty::TyRawPtr(..)) => {
274 (&ty::TyAdt(def_a, _), &ty::TyAdt(def_b, _)) if def_a.is_box() && def_b.is_box() => {
278 (&ty::TyAdt(def_a, substs_a), &ty::TyAdt(def_b, substs_b)) => {
279 assert_eq!(def_a, def_b);
281 let src_fields = def_a.variants[0].fields.iter().map(|f| {
282 monomorphize::field_ty(bcx.tcx(), substs_a, f)
284 let dst_fields = def_b.variants[0].fields.iter().map(|f| {
285 monomorphize::field_ty(bcx.tcx(), substs_b, f)
288 let iter = src_fields.zip(dst_fields).enumerate();
289 for (i, (src_fty, dst_fty)) in iter {
290 if type_is_zero_size(bcx.ccx, dst_fty) {
294 let (src_f, src_f_align) = src.trans_field_ptr(bcx, i);
295 let (dst_f, dst_f_align) = dst.trans_field_ptr(bcx, i);
296 if src_fty == dst_fty {
297 memcpy_ty(bcx, dst_f, src_f, src_fty, None);
301 &LvalueRef::new_sized_ty(src_f, src_fty, src_f_align),
302 &LvalueRef::new_sized_ty(dst_f, dst_fty, dst_f_align)
307 _ => bug!("coerce_unsized_into: invalid coercion {:?} -> {:?}",
313 pub fn cast_shift_expr_rhs(
314 cx: &Builder, op: hir::BinOp_, lhs: ValueRef, rhs: ValueRef
316 cast_shift_rhs(op, lhs, rhs, |a, b| cx.trunc(a, b), |a, b| cx.zext(a, b))
319 pub fn cast_shift_const_rhs(op: hir::BinOp_, lhs: ValueRef, rhs: ValueRef) -> ValueRef {
323 |a, b| unsafe { llvm::LLVMConstTrunc(a, b.to_ref()) },
324 |a, b| unsafe { llvm::LLVMConstZExt(a, b.to_ref()) })
327 fn cast_shift_rhs<F, G>(op: hir::BinOp_,
333 where F: FnOnce(ValueRef, Type) -> ValueRef,
334 G: FnOnce(ValueRef, Type) -> ValueRef
336 // Shifts may have any size int on the rhs
338 let mut rhs_llty = val_ty(rhs);
339 let mut lhs_llty = val_ty(lhs);
340 if rhs_llty.kind() == Vector {
341 rhs_llty = rhs_llty.element_type()
343 if lhs_llty.kind() == Vector {
344 lhs_llty = lhs_llty.element_type()
346 let rhs_sz = rhs_llty.int_width();
347 let lhs_sz = lhs_llty.int_width();
350 } else if lhs_sz > rhs_sz {
351 // FIXME (#1877: If shifting by negative
352 // values becomes not undefined then this is wrong.
362 /// Returns whether this session's target will use SEH-based unwinding.
364 /// This is only true for MSVC targets, and even then the 64-bit MSVC target
365 /// currently uses SEH-ish unwinding with DWARF info tables to the side (same as
366 /// 64-bit MinGW) instead of "full SEH".
367 pub fn wants_msvc_seh(sess: &Session) -> bool {
368 sess.target.target.options.is_like_msvc
371 pub fn call_assume<'a, 'tcx>(b: &Builder<'a, 'tcx>, val: ValueRef) {
372 let assume_intrinsic = b.ccx.get_intrinsic("llvm.assume");
373 b.call(assume_intrinsic, &[val], None);
376 /// Helper for loading values from memory. Does the necessary conversion if the in-memory type
377 /// differs from the type used for SSA values. Also handles various special cases where the type
378 /// gives us better information about what we are loading.
379 pub fn load_ty<'a, 'tcx>(b: &Builder<'a, 'tcx>, ptr: ValueRef,
380 alignment: Alignment, t: Ty<'tcx>) -> ValueRef {
382 if type_is_zero_size(ccx, t) {
383 return C_undef(type_of::type_of(ccx, t));
387 let global = llvm::LLVMIsAGlobalVariable(ptr);
388 if !global.is_null() && llvm::LLVMIsGlobalConstant(global) == llvm::True {
389 let val = llvm::LLVMGetInitializer(global);
392 return llvm::LLVMConstTrunc(val, Type::i1(ccx).to_ref());
400 b.trunc(b.load_range_assert(ptr, 0, 2, llvm::False, alignment.to_align()),
402 } else if t.is_char() {
403 // a char is a Unicode codepoint, and so takes values from 0
404 // to 0x10FFFF inclusive only.
405 b.load_range_assert(ptr, 0, 0x10FFFF + 1, llvm::False, alignment.to_align())
406 } else if (t.is_region_ptr() || t.is_box() || t.is_fn())
407 && !common::type_is_fat_ptr(ccx, t)
409 b.load_nonnull(ptr, alignment.to_align())
411 b.load(ptr, alignment.to_align())
415 /// Helper for storing values in memory. Does the necessary conversion if the in-memory type
416 /// differs from the type used for SSA values.
417 pub fn store_ty<'a, 'tcx>(cx: &Builder<'a, 'tcx>, v: ValueRef, dst: ValueRef,
418 dst_align: Alignment, t: Ty<'tcx>) {
419 debug!("store_ty: {:?} : {:?} <- {:?}", Value(dst), t, Value(v));
421 if common::type_is_fat_ptr(cx.ccx, t) {
422 let lladdr = cx.extract_value(v, abi::FAT_PTR_ADDR);
423 let llextra = cx.extract_value(v, abi::FAT_PTR_EXTRA);
424 store_fat_ptr(cx, lladdr, llextra, dst, dst_align, t);
426 cx.store(from_immediate(cx, v), dst, dst_align.to_align());
430 pub fn store_fat_ptr<'a, 'tcx>(cx: &Builder<'a, 'tcx>,
434 dst_align: Alignment,
436 // FIXME: emit metadata
437 cx.store(data, get_dataptr(cx, dst), dst_align.to_align());
438 cx.store(extra, get_meta(cx, dst), dst_align.to_align());
441 pub fn load_fat_ptr<'a, 'tcx>(
442 b: &Builder<'a, 'tcx>, src: ValueRef, alignment: Alignment, t: Ty<'tcx>
443 ) -> (ValueRef, ValueRef) {
444 let ptr = get_dataptr(b, src);
445 let ptr = if t.is_region_ptr() || t.is_box() {
446 b.load_nonnull(ptr, alignment.to_align())
448 b.load(ptr, alignment.to_align())
451 let meta = get_meta(b, src);
452 let meta_ty = val_ty(meta);
453 // If the 'meta' field is a pointer, it's a vtable, so use load_nonnull
455 let meta = if meta_ty.element_type().kind() == llvm::TypeKind::Pointer {
456 b.load_nonnull(meta, None)
464 pub fn from_immediate(bcx: &Builder, val: ValueRef) -> ValueRef {
465 if val_ty(val) == Type::i1(bcx.ccx) {
466 bcx.zext(val, Type::i8(bcx.ccx))
472 pub fn to_immediate(bcx: &Builder, val: ValueRef, ty: Ty) -> ValueRef {
474 bcx.trunc(val, Type::i1(bcx.ccx))
480 pub enum Lifetime { Start, End }
483 // If LLVM lifetime intrinsic support is enabled (i.e. optimizations
484 // on), and `ptr` is nonzero-sized, then extracts the size of `ptr`
485 // and the intrinsic for `lt` and passes them to `emit`, which is in
486 // charge of generating code to call the passed intrinsic on whatever
487 // block of generated code is targetted for the intrinsic.
489 // If LLVM lifetime intrinsic support is disabled (i.e. optimizations
490 // off) or `ptr` is zero-sized, then no-op (does not call `emit`).
491 pub fn call(self, b: &Builder, ptr: ValueRef) {
492 if b.ccx.sess().opts.optimize == config::OptLevel::No {
496 let size = machine::llsize_of_alloc(b.ccx, val_ty(ptr).element_type());
501 let lifetime_intrinsic = b.ccx.get_intrinsic(match self {
502 Lifetime::Start => "llvm.lifetime.start",
503 Lifetime::End => "llvm.lifetime.end"
506 let ptr = b.pointercast(ptr, Type::i8p(b.ccx));
507 b.call(lifetime_intrinsic, &[C_u64(b.ccx, size), ptr], None);
511 pub fn call_memcpy<'a, 'tcx>(b: &Builder<'a, 'tcx>,
517 let ptr_width = &ccx.sess().target.target.target_pointer_width;
518 let key = format!("llvm.memcpy.p0i8.p0i8.i{}", ptr_width);
519 let memcpy = ccx.get_intrinsic(&key);
520 let src_ptr = b.pointercast(src, Type::i8p(ccx));
521 let dst_ptr = b.pointercast(dst, Type::i8p(ccx));
522 let size = b.intcast(n_bytes, ccx.int_type(), false);
523 let align = C_i32(ccx, align as i32);
524 let volatile = C_bool(ccx, false);
525 b.call(memcpy, &[dst_ptr, src_ptr, size, align, volatile], None);
528 pub fn memcpy_ty<'a, 'tcx>(
529 bcx: &Builder<'a, 'tcx>,
537 let size = ccx.size_of(t);
542 let align = align.unwrap_or_else(|| ccx.align_of(t));
543 call_memcpy(bcx, dst, src, C_uint(ccx, size), align);
546 pub fn call_memset<'a, 'tcx>(b: &Builder<'a, 'tcx>,
551 volatile: bool) -> ValueRef {
552 let ptr_width = &b.ccx.sess().target.target.target_pointer_width;
553 let intrinsic_key = format!("llvm.memset.p0i8.i{}", ptr_width);
554 let llintrinsicfn = b.ccx.get_intrinsic(&intrinsic_key);
555 let volatile = C_bool(b.ccx, volatile);
556 b.call(llintrinsicfn, &[ptr, fill_byte, size, align, volatile], None)
559 pub fn trans_instance<'a, 'tcx>(ccx: &CrateContext<'a, 'tcx>, instance: Instance<'tcx>) {
560 let _s = if ccx.sess().trans_stats() {
561 let mut instance_name = String::new();
562 DefPathBasedNames::new(ccx.tcx(), true, true)
563 .push_def_path(instance.def_id(), &mut instance_name);
564 Some(StatRecorder::new(ccx, instance_name))
569 // this is an info! to allow collecting monomorphization statistics
570 // and to allow finding the last function before LLVM aborts from
572 info!("trans_instance({})", instance);
574 let fn_ty = common::instance_ty(ccx.shared(), &instance);
575 let sig = common::ty_fn_sig(ccx, fn_ty);
576 let sig = ccx.tcx().erase_late_bound_regions_and_normalize(&sig);
578 let lldecl = match ccx.instances().borrow().get(&instance) {
580 None => bug!("Instance `{:?}` not already declared", instance)
583 ccx.stats().n_closures.set(ccx.stats().n_closures.get() + 1);
585 // The `uwtable` attribute according to LLVM is:
587 // This attribute indicates that the ABI being targeted requires that an
588 // unwind table entry be produced for this function even if we can show
589 // that no exceptions passes by it. This is normally the case for the
590 // ELF x86-64 abi, but it can be disabled for some compilation units.
592 // Typically when we're compiling with `-C panic=abort` (which implies this
593 // `no_landing_pads` check) we don't need `uwtable` because we can't
594 // generate any exceptions! On Windows, however, exceptions include other
595 // events such as illegal instructions, segfaults, etc. This means that on
596 // Windows we end up still needing the `uwtable` attribute even if the `-C
597 // panic=abort` flag is passed.
599 // You can also find more info on why Windows is whitelisted here in:
600 // https://bugzilla.mozilla.org/show_bug.cgi?id=1302078
601 if !ccx.sess().no_landing_pads() ||
602 ccx.sess().target.target.options.is_like_windows {
603 attributes::emit_uwtable(lldecl, true);
606 let mir = ccx.tcx().instance_mir(instance.def);
607 mir::trans_mir(ccx, lldecl, &mir, instance, sig);
610 pub fn llvm_linkage_by_name(name: &str) -> Option<Linkage> {
611 // Use the names from src/llvm/docs/LangRef.rst here. Most types are only
612 // applicable to variable declarations and may not really make sense for
613 // Rust code in the first place but whitelist them anyway and trust that
614 // the user knows what s/he's doing. Who knows, unanticipated use cases
615 // may pop up in the future.
617 // ghost, dllimport, dllexport and linkonce_odr_autohide are not supported
618 // and don't have to be, LLVM treats them as no-ops.
620 "appending" => Some(llvm::Linkage::AppendingLinkage),
621 "available_externally" => Some(llvm::Linkage::AvailableExternallyLinkage),
622 "common" => Some(llvm::Linkage::CommonLinkage),
623 "extern_weak" => Some(llvm::Linkage::ExternalWeakLinkage),
624 "external" => Some(llvm::Linkage::ExternalLinkage),
625 "internal" => Some(llvm::Linkage::InternalLinkage),
626 "linkonce" => Some(llvm::Linkage::LinkOnceAnyLinkage),
627 "linkonce_odr" => Some(llvm::Linkage::LinkOnceODRLinkage),
628 "private" => Some(llvm::Linkage::PrivateLinkage),
629 "weak" => Some(llvm::Linkage::WeakAnyLinkage),
630 "weak_odr" => Some(llvm::Linkage::WeakODRLinkage),
635 pub fn set_link_section(ccx: &CrateContext,
637 attrs: &[ast::Attribute]) {
638 if let Some(sect) = attr::first_attr_value_str_by_name(attrs, "link_section") {
639 if contains_null(§.as_str()) {
640 ccx.sess().fatal(&format!("Illegal null byte in link_section value: `{}`", §));
643 let buf = CString::new(sect.as_str().as_bytes()).unwrap();
644 llvm::LLVMSetSection(llval, buf.as_ptr());
649 /// Create the `main` function which will initialise the rust runtime and call
650 /// users main function.
651 pub fn maybe_create_entry_wrapper(ccx: &CrateContext) {
652 let (main_def_id, span) = match *ccx.sess().entry_fn.borrow() {
653 Some((id, span)) => {
654 (ccx.tcx().hir.local_def_id(id), span)
659 // check for the #[rustc_error] annotation, which forces an
660 // error in trans. This is used to write compile-fail tests
661 // that actually test that compilation succeeds without
662 // reporting an error.
663 if ccx.tcx().has_attr(main_def_id, "rustc_error") {
664 ccx.tcx().sess.span_fatal(span, "compilation successful");
667 let instance = Instance::mono(ccx.tcx(), main_def_id);
669 if !ccx.codegen_unit().contains_item(&TransItem::Fn(instance)) {
670 // We want to create the wrapper in the same codegen unit as Rust's main
675 let main_llfn = callee::get_fn(ccx, instance);
677 let et = ccx.sess().entry_type.get().unwrap();
679 config::EntryMain => create_entry_fn(ccx, span, main_llfn, true),
680 config::EntryStart => create_entry_fn(ccx, span, main_llfn, false),
681 config::EntryNone => {} // Do nothing.
684 fn create_entry_fn(ccx: &CrateContext,
687 use_start_lang_item: bool) {
688 let llfty = Type::func(&[ccx.int_type(), Type::i8p(ccx).ptr_to()], &ccx.int_type());
690 if declare::get_defined_value(ccx, "main").is_some() {
691 // FIXME: We should be smart and show a better diagnostic here.
692 ccx.sess().struct_span_err(sp, "entry symbol `main` defined multiple times")
693 .help("did you use #[no_mangle] on `fn main`? Use #[start] instead")
695 ccx.sess().abort_if_errors();
698 let llfn = declare::declare_cfn(ccx, "main", llfty);
700 // `main` should respect same config for frame pointer elimination as rest of code
701 attributes::set_frame_pointer_elimination(ccx, llfn);
703 let bld = Builder::new_block(ccx, llfn, "top");
705 debuginfo::gdb::insert_reference_to_gdb_debug_scripts_section_global(ccx, &bld);
707 let (start_fn, args) = if use_start_lang_item {
708 let start_def_id = ccx.tcx().require_lang_item(StartFnLangItem);
709 let start_instance = Instance::mono(ccx.tcx(), start_def_id);
710 let start_fn = callee::get_fn(ccx, start_instance);
711 (start_fn, vec![bld.pointercast(rust_main, Type::i8p(ccx).ptr_to()), get_param(llfn, 0),
714 debug!("using user-defined start fn");
715 (rust_main, vec![get_param(llfn, 0 as c_uint), get_param(llfn, 1 as c_uint)])
718 let result = bld.call(start_fn, &args, None);
723 fn contains_null(s: &str) -> bool {
724 s.bytes().any(|b| b == 0)
727 fn write_metadata(cx: &SharedCrateContext,
728 exported_symbols: &NodeSet)
732 #[derive(PartialEq, Eq, PartialOrd, Ord)]
739 let kind = cx.sess().crate_types.borrow().iter().map(|ty| {
741 config::CrateTypeExecutable |
742 config::CrateTypeStaticlib |
743 config::CrateTypeCdylib => MetadataKind::None,
745 config::CrateTypeRlib => MetadataKind::Uncompressed,
747 config::CrateTypeDylib |
748 config::CrateTypeProcMacro => MetadataKind::Compressed,
752 if kind == MetadataKind::None {
753 return EncodedMetadata {
759 let cstore = &cx.tcx().sess.cstore;
760 let metadata = cstore.encode_metadata(cx.tcx(),
763 if kind == MetadataKind::Uncompressed {
767 assert!(kind == MetadataKind::Compressed);
768 let mut compressed = cstore.metadata_encoding_version().to_vec();
769 compressed.extend_from_slice(&flate::deflate_bytes(&metadata.raw_data));
771 let llmeta = C_bytes_in_context(cx.metadata_llcx(), &compressed);
772 let llconst = C_struct_in_context(cx.metadata_llcx(), &[llmeta], false);
773 let name = cx.metadata_symbol_name();
774 let buf = CString::new(name).unwrap();
775 let llglobal = unsafe {
776 llvm::LLVMAddGlobal(cx.metadata_llmod(), val_ty(llconst).to_ref(), buf.as_ptr())
779 llvm::LLVMSetInitializer(llglobal, llconst);
781 cx.tcx().sess.cstore.metadata_section_name(&cx.sess().target.target);
782 let name = CString::new(section_name).unwrap();
783 llvm::LLVMSetSection(llglobal, name.as_ptr());
785 // Also generate a .section directive to force no
786 // flags, at least for ELF outputs, so that the
787 // metadata doesn't get loaded into memory.
788 let directive = format!(".section {}", section_name);
789 let directive = CString::new(directive).unwrap();
790 llvm::LLVMSetModuleInlineAsm(cx.metadata_llmod(), directive.as_ptr())
795 /// Find any symbols that are defined in one compilation unit, but not declared
796 /// in any other compilation unit. Give these symbols internal linkage.
797 fn internalize_symbols<'a, 'tcx>(sess: &Session,
798 ccxs: &CrateContextList<'a, 'tcx>,
799 symbol_map: &SymbolMap<'tcx>,
800 exported_symbols: &ExportedSymbols) {
801 let export_threshold =
802 symbol_export::crates_export_threshold(&sess.crate_types.borrow());
804 let exported_symbols = exported_symbols
805 .exported_symbols(LOCAL_CRATE)
807 .filter(|&&(_, export_level)| {
808 symbol_export::is_below_threshold(export_level, export_threshold)
810 .map(|&(ref name, _)| &name[..])
811 .collect::<FxHashSet<&str>>();
813 let scx = ccxs.shared();
816 let incr_comp = sess.opts.debugging_opts.incremental.is_some();
818 // 'unsafe' because we are holding on to CStr's from the LLVM module within
821 let mut referenced_somewhere = FxHashSet();
823 // Collect all symbols that need to stay externally visible because they
824 // are referenced via a declaration in some other codegen unit. In
825 // incremental compilation, we don't need to collect. See below for more
828 for ccx in ccxs.iter_need_trans() {
829 for val in iter_globals(ccx.llmod()).chain(iter_functions(ccx.llmod())) {
830 let linkage = llvm::LLVMRustGetLinkage(val);
831 // We only care about external declarations (not definitions)
832 // and available_externally definitions.
833 let is_available_externally =
834 linkage == llvm::Linkage::AvailableExternallyLinkage;
835 let is_decl = llvm::LLVMIsDeclaration(val) == llvm::True;
837 if is_decl || is_available_externally {
838 let symbol_name = CStr::from_ptr(llvm::LLVMGetValueName(val));
839 referenced_somewhere.insert(symbol_name);
845 // Also collect all symbols for which we cannot adjust linkage, because
846 // it is fixed by some directive in the source code.
847 let (locally_defined_symbols, linkage_fixed_explicitly) = {
848 let mut locally_defined_symbols = FxHashSet();
849 let mut linkage_fixed_explicitly = FxHashSet();
851 for trans_item in scx.translation_items().borrow().iter() {
852 let symbol_name = symbol_map.get_or_compute(scx, *trans_item);
853 if trans_item.explicit_linkage(tcx).is_some() {
854 linkage_fixed_explicitly.insert(symbol_name.clone());
856 locally_defined_symbols.insert(symbol_name);
859 (locally_defined_symbols, linkage_fixed_explicitly)
862 // Examine each external definition. If the definition is not used in
863 // any other compilation unit, and is not reachable from other crates,
864 // then give it internal linkage.
865 for ccx in ccxs.iter_need_trans() {
866 for val in iter_globals(ccx.llmod()).chain(iter_functions(ccx.llmod())) {
867 let linkage = llvm::LLVMRustGetLinkage(val);
869 let is_externally_visible = (linkage == llvm::Linkage::ExternalLinkage) ||
870 (linkage == llvm::Linkage::LinkOnceODRLinkage) ||
871 (linkage == llvm::Linkage::WeakODRLinkage);
873 if !is_externally_visible {
874 // This symbol is not visible outside of its codegen unit,
875 // so there is nothing to do for it.
879 let name_cstr = CStr::from_ptr(llvm::LLVMGetValueName(val));
880 let name_str = name_cstr.to_str().unwrap();
882 if exported_symbols.contains(&name_str) {
883 // This symbol is explicitly exported, so we can't
884 // mark it as internal or hidden.
888 let is_declaration = llvm::LLVMIsDeclaration(val) == llvm::True;
891 if locally_defined_symbols.contains(name_str) {
892 // Only mark declarations from the current crate as hidden.
893 // Otherwise we would mark things as hidden that are
894 // imported from other crates or native libraries.
895 llvm::LLVMRustSetVisibility(val, llvm::Visibility::Hidden);
898 let has_fixed_linkage = linkage_fixed_explicitly.contains(name_str);
900 if !has_fixed_linkage {
901 // In incremental compilation mode, we can't be sure that
902 // we saw all references because we don't know what's in
903 // cached compilation units, so we always assume that the
904 // given item has been referenced.
905 if incr_comp || referenced_somewhere.contains(&name_cstr) {
906 llvm::LLVMRustSetVisibility(val, llvm::Visibility::Hidden);
908 llvm::LLVMRustSetLinkage(val, llvm::Linkage::InternalLinkage);
911 llvm::LLVMSetDLLStorageClass(val, llvm::DLLStorageClass::Default);
912 llvm::UnsetComdat(val);
920 // Create a `__imp_<symbol> = &symbol` global for every public static `symbol`.
921 // This is required to satisfy `dllimport` references to static data in .rlibs
922 // when using MSVC linker. We do this only for data, as linker can fix up
923 // code references on its own.
924 // See #26591, #27438
925 fn create_imps(cx: &CrateContextList) {
926 // The x86 ABI seems to require that leading underscores are added to symbol
927 // names, so we need an extra underscore on 32-bit. There's also a leading
928 // '\x01' here which disables LLVM's symbol mangling (e.g. no extra
929 // underscores added in front).
930 let prefix = if cx.shared().sess().target.target.target_pointer_width == "32" {
936 for ccx in cx.iter_need_trans() {
937 let exported: Vec<_> = iter_globals(ccx.llmod())
939 llvm::LLVMRustGetLinkage(val) ==
940 llvm::Linkage::ExternalLinkage &&
941 llvm::LLVMIsDeclaration(val) == 0
945 let i8p_ty = Type::i8p(&ccx);
946 for val in exported {
947 let name = CStr::from_ptr(llvm::LLVMGetValueName(val));
948 let mut imp_name = prefix.as_bytes().to_vec();
949 imp_name.extend(name.to_bytes());
950 let imp_name = CString::new(imp_name).unwrap();
951 let imp = llvm::LLVMAddGlobal(ccx.llmod(),
953 imp_name.as_ptr() as *const _);
954 let init = llvm::LLVMConstBitCast(val, i8p_ty.to_ref());
955 llvm::LLVMSetInitializer(imp, init);
956 llvm::LLVMRustSetLinkage(imp, llvm::Linkage::ExternalLinkage);
964 step: unsafe extern "C" fn(ValueRef) -> ValueRef,
967 impl Iterator for ValueIter {
968 type Item = ValueRef;
970 fn next(&mut self) -> Option<ValueRef> {
973 self.cur = unsafe { (self.step)(old) };
981 fn iter_globals(llmod: llvm::ModuleRef) -> ValueIter {
984 cur: llvm::LLVMGetFirstGlobal(llmod),
985 step: llvm::LLVMGetNextGlobal,
990 fn iter_functions(llmod: llvm::ModuleRef) -> ValueIter {
993 cur: llvm::LLVMGetFirstFunction(llmod),
994 step: llvm::LLVMGetNextFunction,
999 /// The context provided lists a set of reachable ids as calculated by
1000 /// middle::reachable, but this contains far more ids and symbols than we're
1001 /// actually exposing from the object file. This function will filter the set in
1002 /// the context to the set of ids which correspond to symbols that are exposed
1003 /// from the object file being generated.
1005 /// This list is later used by linkers to determine the set of symbols needed to
1006 /// be exposed from a dynamic library and it's also encoded into the metadata.
1007 pub fn find_exported_symbols(tcx: TyCtxt, reachable: NodeSet) -> NodeSet {
1008 reachable.into_iter().filter(|&id| {
1009 // Next, we want to ignore some FFI functions that are not exposed from
1010 // this crate. Reachable FFI functions can be lumped into two
1013 // 1. Those that are included statically via a static library
1014 // 2. Those included otherwise (e.g. dynamically or via a framework)
1016 // Although our LLVM module is not literally emitting code for the
1017 // statically included symbols, it's an export of our library which
1018 // needs to be passed on to the linker and encoded in the metadata.
1020 // As a result, if this id is an FFI item (foreign item) then we only
1021 // let it through if it's included statically.
1022 match tcx.hir.get(id) {
1023 hir_map::NodeForeignItem(..) => {
1024 let def_id = tcx.hir.local_def_id(id);
1025 tcx.sess.cstore.is_statically_included_foreign_item(def_id)
1028 // Only consider nodes that actually have exported symbols.
1029 hir_map::NodeItem(&hir::Item {
1030 node: hir::ItemStatic(..), .. }) |
1031 hir_map::NodeItem(&hir::Item {
1032 node: hir::ItemFn(..), .. }) |
1033 hir_map::NodeImplItem(&hir::ImplItem {
1034 node: hir::ImplItemKind::Method(..), .. }) => {
1035 let def_id = tcx.hir.local_def_id(id);
1036 let generics = tcx.item_generics(def_id);
1037 let attributes = tcx.get_attrs(def_id);
1038 (generics.parent_types == 0 && generics.types.is_empty()) &&
1039 // Functions marked with #[inline] are only ever translated
1040 // with "internal" linkage and are never exported.
1041 !attr::requests_inline(&attributes)
1049 pub fn trans_crate<'a, 'tcx>(tcx: TyCtxt<'a, 'tcx, 'tcx>,
1050 analysis: ty::CrateAnalysis,
1051 incremental_hashes_map: &IncrementalHashesMap)
1052 -> CrateTranslation {
1053 let _task = tcx.dep_graph.in_task(DepNode::TransCrate);
1055 // Be careful with this krate: obviously it gives access to the
1056 // entire contents of the krate. So if you push any subtasks of
1057 // `TransCrate`, you need to be careful to register "reads" of the
1058 // particular items that will be processed.
1059 let krate = tcx.hir.krate();
1061 let ty::CrateAnalysis { reachable, name, .. } = analysis;
1062 let exported_symbols = find_exported_symbols(tcx, reachable);
1064 let check_overflow = tcx.sess.overflow_checks();
1066 let link_meta = link::build_link_meta(incremental_hashes_map, &name);
1068 let shared_ccx = SharedCrateContext::new(tcx,
1072 // Translate the metadata.
1073 let metadata = time(tcx.sess.time_passes(), "write metadata", || {
1074 write_metadata(&shared_ccx, shared_ccx.exported_symbols())
1077 let metadata_module = ModuleTranslation {
1078 name: link::METADATA_MODULE_NAME.to_string(),
1079 symbol_name_hash: 0, // we always rebuild metadata, at least for now
1080 source: ModuleSource::Translated(ModuleLlvm {
1081 llcx: shared_ccx.metadata_llcx(),
1082 llmod: shared_ccx.metadata_llmod(),
1085 let no_builtins = attr::contains_name(&krate.attrs, "no_builtins");
1087 // Skip crate items and just output metadata in -Z no-trans mode.
1088 if tcx.sess.opts.debugging_opts.no_trans ||
1089 !tcx.sess.opts.output_types.should_trans() {
1090 let empty_exported_symbols = ExportedSymbols::empty();
1091 let linker_info = LinkerInfo::new(&shared_ccx, &empty_exported_symbols);
1092 return CrateTranslation {
1094 metadata_module: metadata_module,
1097 exported_symbols: empty_exported_symbols,
1098 no_builtins: no_builtins,
1099 linker_info: linker_info,
1100 windows_subsystem: None,
1104 // Run the translation item collector and partition the collected items into
1106 let (codegen_units, symbol_map) = collect_and_partition_translation_items(&shared_ccx);
1108 let symbol_map = Rc::new(symbol_map);
1110 let previous_work_products = trans_reuse_previous_work_products(&shared_ccx,
1114 let crate_context_list = CrateContextList::new(&shared_ccx,
1116 previous_work_products,
1117 symbol_map.clone());
1118 let modules: Vec<_> = crate_context_list.iter_all()
1120 let source = match ccx.previous_work_product() {
1121 Some(buf) => ModuleSource::Preexisting(buf.clone()),
1122 None => ModuleSource::Translated(ModuleLlvm {
1129 name: String::from(ccx.codegen_unit().name()),
1130 symbol_name_hash: ccx.codegen_unit()
1131 .compute_symbol_name_hash(&shared_ccx,
1138 assert_module_sources::assert_module_sources(tcx, &modules);
1140 // Instantiate translation items without filling out definitions yet...
1141 for ccx in crate_context_list.iter_need_trans() {
1142 let dep_node = ccx.codegen_unit().work_product_dep_node();
1143 tcx.dep_graph.with_task(dep_node,
1145 AssertDepGraphSafe(symbol_map.clone()),
1148 fn trans_decl_task<'a, 'tcx>(ccx: CrateContext<'a, 'tcx>,
1149 symbol_map: AssertDepGraphSafe<Rc<SymbolMap<'tcx>>>) {
1150 // FIXME(#40304): Instead of this, the symbol-map should be an
1151 // on-demand thing that we compute.
1152 let AssertDepGraphSafe(symbol_map) = symbol_map;
1153 let cgu = ccx.codegen_unit();
1154 let trans_items = cgu.items_in_deterministic_order(ccx.tcx(), &symbol_map);
1155 for (trans_item, linkage) in trans_items {
1156 trans_item.predefine(&ccx, linkage);
1161 // ... and now that we have everything pre-defined, fill out those definitions.
1162 for ccx in crate_context_list.iter_need_trans() {
1163 let dep_node = ccx.codegen_unit().work_product_dep_node();
1164 tcx.dep_graph.with_task(dep_node,
1166 AssertDepGraphSafe(symbol_map.clone()),
1169 fn trans_def_task<'a, 'tcx>(ccx: CrateContext<'a, 'tcx>,
1170 symbol_map: AssertDepGraphSafe<Rc<SymbolMap<'tcx>>>) {
1171 // FIXME(#40304): Instead of this, the symbol-map should be an
1172 // on-demand thing that we compute.
1173 let AssertDepGraphSafe(symbol_map) = symbol_map;
1174 let cgu = ccx.codegen_unit();
1175 let trans_items = cgu.items_in_deterministic_order(ccx.tcx(), &symbol_map);
1176 for (trans_item, _) in trans_items {
1177 trans_item.define(&ccx);
1180 // If this codegen unit contains the main function, also create the
1182 maybe_create_entry_wrapper(&ccx);
1184 // Run replace-all-uses-with for statics that need it
1185 for &(old_g, new_g) in ccx.statics_to_rauw().borrow().iter() {
1187 let bitcast = llvm::LLVMConstPointerCast(new_g, llvm::LLVMTypeOf(old_g));
1188 llvm::LLVMReplaceAllUsesWith(old_g, bitcast);
1189 llvm::LLVMDeleteGlobal(old_g);
1193 // Create the llvm.used variable
1194 // This variable has type [N x i8*] and is stored in the llvm.metadata section
1195 if !ccx.used_statics().borrow().is_empty() {
1196 let name = CString::new("llvm.used").unwrap();
1197 let section = CString::new("llvm.metadata").unwrap();
1198 let array = C_array(Type::i8(&ccx).ptr_to(), &*ccx.used_statics().borrow());
1201 let g = llvm::LLVMAddGlobal(ccx.llmod(),
1202 val_ty(array).to_ref(),
1204 llvm::LLVMSetInitializer(g, array);
1205 llvm::LLVMRustSetLinkage(g, llvm::Linkage::AppendingLinkage);
1206 llvm::LLVMSetSection(g, section.as_ptr());
1210 // Finalize debuginfo
1211 if ccx.sess().opts.debuginfo != NoDebugInfo {
1212 debuginfo::finalize(&ccx);
1217 symbol_names_test::report_symbol_names(&shared_ccx);
1219 if shared_ccx.sess().trans_stats() {
1220 let stats = shared_ccx.stats();
1221 println!("--- trans stats ---");
1222 println!("n_glues_created: {}", stats.n_glues_created.get());
1223 println!("n_null_glues: {}", stats.n_null_glues.get());
1224 println!("n_real_glues: {}", stats.n_real_glues.get());
1226 println!("n_fns: {}", stats.n_fns.get());
1227 println!("n_inlines: {}", stats.n_inlines.get());
1228 println!("n_closures: {}", stats.n_closures.get());
1229 println!("fn stats:");
1230 stats.fn_stats.borrow_mut().sort_by(|&(_, insns_a), &(_, insns_b)| {
1231 insns_b.cmp(&insns_a)
1233 for tuple in stats.fn_stats.borrow().iter() {
1235 (ref name, insns) => {
1236 println!("{} insns, {}", insns, *name);
1242 if shared_ccx.sess().count_llvm_insns() {
1243 for (k, v) in shared_ccx.stats().llvm_insns.borrow().iter() {
1244 println!("{:7} {}", *v, *k);
1248 let sess = shared_ccx.sess();
1250 let exported_symbols = ExportedSymbols::compute_from(&shared_ccx,
1253 // Now that we have all symbols that are exported from the CGUs of this
1254 // crate, we can run the `internalize_symbols` pass.
1255 time(shared_ccx.sess().time_passes(), "internalize symbols", || {
1256 internalize_symbols(sess,
1257 &crate_context_list,
1262 if tcx.sess.opts.debugging_opts.print_type_sizes {
1263 gather_type_sizes(tcx);
1266 if sess.target.target.options.is_like_msvc &&
1267 sess.crate_types.borrow().iter().any(|ct| *ct == config::CrateTypeRlib) {
1268 create_imps(&crate_context_list);
1271 let linker_info = LinkerInfo::new(&shared_ccx, &exported_symbols);
1273 let subsystem = attr::first_attr_value_str_by_name(&krate.attrs,
1274 "windows_subsystem");
1275 let windows_subsystem = subsystem.map(|subsystem| {
1276 if subsystem != "windows" && subsystem != "console" {
1277 tcx.sess.fatal(&format!("invalid windows subsystem `{}`, only \
1278 `windows` and `console` are allowed",
1281 subsystem.to_string()
1286 metadata_module: metadata_module,
1289 exported_symbols: exported_symbols,
1290 no_builtins: no_builtins,
1291 linker_info: linker_info,
1292 windows_subsystem: windows_subsystem,
1296 fn gather_type_sizes<'a, 'tcx>(tcx: TyCtxt<'a, 'tcx, 'tcx>) {
1297 let layout_cache = tcx.layout_cache.borrow();
1298 for (ty, layout) in layout_cache.iter() {
1300 // (delay format until we actually need it)
1301 let record = |kind, opt_discr_size, variants| {
1302 let type_desc = format!("{:?}", ty);
1303 let overall_size = layout.size(tcx);
1304 let align = layout.align(tcx);
1305 tcx.sess.code_stats.borrow_mut().record_type_size(kind,
1313 let (adt_def, substs) = match ty.sty {
1314 ty::TyAdt(ref adt_def, substs) => {
1315 debug!("print-type-size t: `{:?}` process adt", ty);
1319 ty::TyClosure(..) => {
1320 debug!("print-type-size t: `{:?}` record closure", ty);
1321 record(DataTypeKind::Closure, None, vec![]);
1326 debug!("print-type-size t: `{:?}` skip non-nominal", ty);
1331 let adt_kind = adt_def.adt_kind();
1333 let build_field_info = |(field_name, field_ty): (ast::Name, Ty), offset: &layout::Size| {
1334 match layout_cache.get(&field_ty) {
1335 None => bug!("no layout found for field {} type: `{:?}`", field_name, field_ty),
1336 Some(field_layout) => {
1337 session::FieldInfo {
1338 name: field_name.to_string(),
1339 offset: offset.bytes(),
1340 size: field_layout.size(tcx).bytes(),
1341 align: field_layout.align(tcx).abi(),
1347 let build_primitive_info = |name: ast::Name, value: &layout::Primitive| {
1348 session::VariantInfo {
1349 name: Some(name.to_string()),
1350 kind: session::SizeKind::Exact,
1351 align: value.align(tcx).abi(),
1352 size: value.size(tcx).bytes(),
1358 WithDiscrim(&'a layout::Struct),
1359 NoDiscrim(&'a layout::Struct),
1362 let build_variant_info = |n: Option<ast::Name>, flds: &[(ast::Name, Ty)], layout: Fields| {
1363 let (s, field_offsets) = match layout {
1364 Fields::WithDiscrim(s) => (s, &s.offsets[1..]),
1365 Fields::NoDiscrim(s) => (s, &s.offsets[0..]),
1367 let field_info: Vec<_> = flds.iter()
1368 .zip(field_offsets.iter())
1369 .map(|(&field_name_ty, offset)| build_field_info(field_name_ty, offset))
1372 session::VariantInfo {
1373 name: n.map(|n|n.to_string()),
1375 session::SizeKind::Exact
1377 session::SizeKind::Min
1379 align: s.align.abi(),
1380 size: s.min_size.bytes(),
1386 Layout::StructWrappedNullablePointer { nonnull: ref variant_layout,
1389 discrfield_source: _ } => {
1390 debug!("print-type-size t: `{:?}` adt struct-wrapped nullable nndiscr {} is {:?}",
1391 ty, nndiscr, variant_layout);
1392 let variant_def = &adt_def.variants[nndiscr as usize];
1393 let fields: Vec<_> = variant_def.fields.iter()
1394 .map(|field_def| (field_def.name, field_def.ty(tcx, substs)))
1396 record(adt_kind.into(),
1398 vec![build_variant_info(Some(variant_def.name),
1400 Fields::NoDiscrim(variant_layout))]);
1402 Layout::RawNullablePointer { nndiscr, value } => {
1403 debug!("print-type-size t: `{:?}` adt raw nullable nndiscr {} is {:?}",
1404 ty, nndiscr, value);
1405 let variant_def = &adt_def.variants[nndiscr as usize];
1406 record(adt_kind.into(), None,
1407 vec![build_primitive_info(variant_def.name, &value)]);
1409 Layout::Univariant { variant: ref variant_layout, non_zero: _ } => {
1410 let variant_names = || {
1411 adt_def.variants.iter().map(|v|format!("{}", v.name)).collect::<Vec<_>>()
1413 debug!("print-type-size t: `{:?}` adt univariant {:?} variants: {:?}",
1414 ty, variant_layout, variant_names());
1415 assert!(adt_def.variants.len() <= 1,
1416 "univariant with variants {:?}", variant_names());
1417 if adt_def.variants.len() == 1 {
1418 let variant_def = &adt_def.variants[0];
1419 let fields: Vec<_> = variant_def.fields.iter()
1420 .map(|field_def| (field_def.name, field_def.ty(tcx, substs)))
1422 record(adt_kind.into(),
1424 vec![build_variant_info(Some(variant_def.name),
1426 Fields::NoDiscrim(variant_layout))]);
1428 // (This case arises for *empty* enums; so give it
1430 record(adt_kind.into(), None, vec![]);
1434 Layout::General { ref variants, discr, .. } => {
1435 debug!("print-type-size t: `{:?}` adt general variants def {} layouts {} {:?}",
1436 ty, adt_def.variants.len(), variants.len(), variants);
1437 let variant_infos: Vec<_> = adt_def.variants.iter()
1438 .zip(variants.iter())
1439 .map(|(variant_def, variant_layout)| {
1440 let fields: Vec<_> = variant_def.fields.iter()
1441 .map(|field_def| (field_def.name, field_def.ty(tcx, substs)))
1443 build_variant_info(Some(variant_def.name),
1445 Fields::WithDiscrim(variant_layout))
1448 record(adt_kind.into(), Some(discr.size()), variant_infos);
1451 Layout::UntaggedUnion { ref variants } => {
1452 debug!("print-type-size t: `{:?}` adt union variants {:?}",
1454 // layout does not currently store info about each
1456 record(adt_kind.into(), None, Vec::new());
1459 Layout::CEnum { discr, .. } => {
1460 debug!("print-type-size t: `{:?}` adt c-like enum", ty);
1461 let variant_infos: Vec<_> = adt_def.variants.iter()
1462 .map(|variant_def| {
1463 build_primitive_info(variant_def.name,
1464 &layout::Primitive::Int(discr))
1467 record(adt_kind.into(), Some(discr.size()), variant_infos);
1470 // other cases provide little interesting (i.e. adjustable
1471 // via representation tweaks) size info beyond total size.
1472 Layout::Scalar { .. } |
1473 Layout::Vector { .. } |
1474 Layout::Array { .. } |
1475 Layout::FatPointer { .. } => {
1476 debug!("print-type-size t: `{:?}` adt other", ty);
1477 record(adt_kind.into(), None, Vec::new())
1483 /// For each CGU, identify if we can reuse an existing object file (or
1484 /// maybe other context).
1485 fn trans_reuse_previous_work_products(scx: &SharedCrateContext,
1486 codegen_units: &[CodegenUnit],
1487 symbol_map: &SymbolMap)
1488 -> Vec<Option<WorkProduct>> {
1489 debug!("trans_reuse_previous_work_products()");
1493 let id = cgu.work_product_id();
1495 let hash = cgu.compute_symbol_name_hash(scx, symbol_map);
1497 debug!("trans_reuse_previous_work_products: id={:?} hash={}", id, hash);
1499 if let Some(work_product) = scx.dep_graph().previous_work_product(&id) {
1500 if work_product.input_hash == hash {
1501 debug!("trans_reuse_previous_work_products: reusing {:?}", work_product);
1502 return Some(work_product);
1504 if scx.sess().opts.debugging_opts.incremental_info {
1505 println!("incremental: CGU `{}` invalidated because of \
1506 changed partitioning hash.",
1509 debug!("trans_reuse_previous_work_products: \
1510 not reusing {:?} because hash changed to {:?}",
1511 work_product, hash);
1520 fn collect_and_partition_translation_items<'a, 'tcx>(scx: &SharedCrateContext<'a, 'tcx>)
1521 -> (Vec<CodegenUnit<'tcx>>, SymbolMap<'tcx>) {
1522 let time_passes = scx.sess().time_passes();
1524 let collection_mode = match scx.sess().opts.debugging_opts.print_trans_items {
1526 let mode_string = s.to_lowercase();
1527 let mode_string = mode_string.trim();
1528 if mode_string == "eager" {
1529 TransItemCollectionMode::Eager
1531 if mode_string != "lazy" {
1532 let message = format!("Unknown codegen-item collection mode '{}'. \
1533 Falling back to 'lazy' mode.",
1535 scx.sess().warn(&message);
1538 TransItemCollectionMode::Lazy
1541 None => TransItemCollectionMode::Lazy
1544 let (items, inlining_map) =
1545 time(time_passes, "translation item collection", || {
1546 collector::collect_crate_translation_items(&scx, collection_mode)
1549 let symbol_map = SymbolMap::build(scx, items.iter().cloned());
1551 let strategy = if scx.sess().opts.debugging_opts.incremental.is_some() {
1552 PartitioningStrategy::PerModule
1554 PartitioningStrategy::FixedUnitCount(scx.sess().opts.cg.codegen_units)
1557 let codegen_units = time(time_passes, "codegen unit partitioning", || {
1558 partitioning::partition(scx,
1559 items.iter().cloned(),
1564 assert!(scx.tcx().sess.opts.cg.codegen_units == codegen_units.len() ||
1565 scx.tcx().sess.opts.debugging_opts.incremental.is_some());
1568 let mut ccx_map = scx.translation_items().borrow_mut();
1570 for trans_item in items.iter().cloned() {
1571 ccx_map.insert(trans_item);
1575 if scx.sess().opts.debugging_opts.print_trans_items.is_some() {
1576 let mut item_to_cgus = FxHashMap();
1578 for cgu in &codegen_units {
1579 for (&trans_item, &linkage) in cgu.items() {
1580 item_to_cgus.entry(trans_item)
1581 .or_insert(Vec::new())
1582 .push((cgu.name().clone(), linkage));
1586 let mut item_keys: Vec<_> = items
1589 let mut output = i.to_string(scx.tcx());
1590 output.push_str(" @@");
1591 let mut empty = Vec::new();
1592 let mut cgus = item_to_cgus.get_mut(i).unwrap_or(&mut empty);
1593 cgus.as_mut_slice().sort_by_key(|&(ref name, _)| name.clone());
1595 for &(ref cgu_name, linkage) in cgus.iter() {
1596 output.push_str(" ");
1597 output.push_str(&cgu_name);
1599 let linkage_abbrev = match linkage {
1600 llvm::Linkage::ExternalLinkage => "External",
1601 llvm::Linkage::AvailableExternallyLinkage => "Available",
1602 llvm::Linkage::LinkOnceAnyLinkage => "OnceAny",
1603 llvm::Linkage::LinkOnceODRLinkage => "OnceODR",
1604 llvm::Linkage::WeakAnyLinkage => "WeakAny",
1605 llvm::Linkage::WeakODRLinkage => "WeakODR",
1606 llvm::Linkage::AppendingLinkage => "Appending",
1607 llvm::Linkage::InternalLinkage => "Internal",
1608 llvm::Linkage::PrivateLinkage => "Private",
1609 llvm::Linkage::ExternalWeakLinkage => "ExternalWeak",
1610 llvm::Linkage::CommonLinkage => "Common",
1613 output.push_str("[");
1614 output.push_str(linkage_abbrev);
1615 output.push_str("]");
1623 for item in item_keys {
1624 println!("TRANS_ITEM {}", item);
1628 (codegen_units, symbol_map)