2 use crate::context::TypeLowering;
3 use crate::llvm_util::get_version;
4 use crate::type_::Type;
5 use rustc_codegen_ssa::traits::*;
7 use rustc_middle::ty::layout::{FnAbiOf, LayoutOf, TyAndLayout};
8 use rustc_middle::ty::print::{with_no_trimmed_paths, with_no_visible_paths};
9 use rustc_middle::ty::{self, Ty, TypeVisitable};
10 use rustc_target::abi::{Abi, AddressSpace, Align, FieldsShape};
11 use rustc_target::abi::{Int, Pointer, F32, F64};
12 use rustc_target::abi::{PointeeInfo, Scalar, Size, TyAbiInterface, Variants};
13 use smallvec::{smallvec, SmallVec};
17 fn uncached_llvm_type<'a, 'tcx>(
18 cx: &CodegenCx<'a, 'tcx>,
19 layout: TyAndLayout<'tcx>,
20 defer: &mut Option<(&'a Type, TyAndLayout<'tcx>)>,
21 field_remapping: &mut Option<SmallVec<[u32; 4]>>,
24 Abi::Scalar(_) => bug!("handled elsewhere"),
25 Abi::Vector { element, count } => {
26 let element = layout.scalar_llvm_type_at(cx, element, Size::ZERO);
27 return cx.type_vector(element, count);
29 Abi::ScalarPair(..) => {
30 return cx.type_struct(
32 layout.scalar_pair_element_llvm_type(cx, 0, false),
33 layout.scalar_pair_element_llvm_type(cx, 1, false),
38 Abi::Uninhabited | Abi::Aggregate { .. } => {}
41 let name = match layout.ty.kind() {
42 // FIXME(eddyb) producing readable type names for trait objects can result
43 // in problematically distinct types due to HRTB and subtyping (see #47638).
45 ty::Adt(..) | ty::Closure(..) | ty::Foreign(..) | ty::Generator(..) | ty::Str
46 // For performance reasons we use names only when emitting LLVM IR. Unless we are on
47 // LLVM < 14, where the use of unnamed types resulted in various issues, e.g., #76213,
48 // #79564, and #79246.
49 if get_version() < (14, 0, 0) || !cx.sess().fewer_names() =>
51 let mut name = with_no_visible_paths!(with_no_trimmed_paths!(layout.ty.to_string()));
52 if let (&ty::Adt(def, _), &Variants::Single { index }) =
53 (layout.ty.kind(), &layout.variants)
55 if def.is_enum() && !def.variants().is_empty() {
56 write!(&mut name, "::{}", def.variant(index).name).unwrap();
59 if let (&ty::Generator(_, _, _), &Variants::Single { index }) =
60 (layout.ty.kind(), &layout.variants)
62 write!(&mut name, "::{}", ty::GeneratorSubsts::variant_name(index)).unwrap();
66 // Use identified structure types for ADT. Due to pointee types in LLVM IR their definition
67 // might be recursive. Other cases are non-recursive and we can use literal structure types.
68 ty::Adt(..) => Some(String::new()),
73 FieldsShape::Primitive | FieldsShape::Union(_) => {
74 let fill = cx.type_padding_filler(layout.size, layout.align.abi);
77 None => cx.type_struct(&[fill], packed),
79 let llty = cx.type_named_struct(name);
80 cx.set_struct_body(llty, &[fill], packed);
85 FieldsShape::Array { count, .. } => cx.type_array(layout.field(cx, 0).llvm_type(cx), count),
86 FieldsShape::Arbitrary { .. } => match name {
88 let (llfields, packed, new_field_remapping) = struct_llfields(cx, layout);
89 *field_remapping = new_field_remapping;
90 cx.type_struct(&llfields, packed)
93 let llty = cx.type_named_struct(name);
94 *defer = Some((llty, layout));
101 fn struct_llfields<'a, 'tcx>(
102 cx: &CodegenCx<'a, 'tcx>,
103 layout: TyAndLayout<'tcx>,
104 ) -> (Vec<&'a Type>, bool, Option<SmallVec<[u32; 4]>>) {
105 debug!("struct_llfields: {:#?}", layout);
106 let field_count = layout.fields.count();
108 let mut packed = false;
109 let mut offset = Size::ZERO;
110 let mut prev_effective_align = layout.align.abi;
111 let mut result: Vec<_> = Vec::with_capacity(1 + field_count * 2);
112 let mut field_remapping = smallvec![0; field_count];
113 for i in layout.fields.index_by_increasing_offset() {
114 let target_offset = layout.fields.offset(i as usize);
115 let field = layout.field(cx, i);
116 let effective_field_align =
117 layout.align.abi.min(field.align.abi).restrict_for_offset(target_offset);
118 packed |= effective_field_align < field.align.abi;
121 "struct_llfields: {}: {:?} offset: {:?} target_offset: {:?} \
122 effective_field_align: {}",
127 effective_field_align.bytes()
129 assert!(target_offset >= offset);
130 let padding = target_offset - offset;
131 if padding != Size::ZERO {
132 let padding_align = prev_effective_align.min(effective_field_align);
133 assert_eq!(offset.align_to(padding_align) + padding, target_offset);
134 result.push(cx.type_padding_filler(padding, padding_align));
135 debug!(" padding before: {:?}", padding);
137 field_remapping[i] = result.len() as u32;
138 result.push(field.llvm_type(cx));
139 offset = target_offset + field.size;
140 prev_effective_align = effective_field_align;
142 let padding_used = result.len() > field_count;
143 if !layout.is_unsized() && field_count > 0 {
144 if offset > layout.size {
145 bug!("layout: {:#?} stride: {:?} offset: {:?}", layout, layout.size, offset);
147 let padding = layout.size - offset;
148 if padding != Size::ZERO {
149 let padding_align = prev_effective_align;
150 assert_eq!(offset.align_to(padding_align) + padding, layout.size);
152 "struct_llfields: pad_bytes: {:?} offset: {:?} stride: {:?}",
153 padding, offset, layout.size
155 result.push(cx.type_padding_filler(padding, padding_align));
158 debug!("struct_llfields: offset: {:?} stride: {:?}", offset, layout.size);
160 let field_remapping = if padding_used { Some(field_remapping) } else { None };
161 (result, packed, field_remapping)
164 impl<'a, 'tcx> CodegenCx<'a, 'tcx> {
165 pub fn align_of(&self, ty: Ty<'tcx>) -> Align {
166 self.layout_of(ty).align.abi
169 pub fn size_of(&self, ty: Ty<'tcx>) -> Size {
170 self.layout_of(ty).size
173 pub fn size_and_align_of(&self, ty: Ty<'tcx>) -> (Size, Align) {
174 let layout = self.layout_of(ty);
175 (layout.size, layout.align.abi)
179 pub trait LayoutLlvmExt<'tcx> {
180 fn is_llvm_immediate(&self) -> bool;
181 fn is_llvm_scalar_pair(&self) -> bool;
182 fn llvm_type<'a>(&self, cx: &CodegenCx<'a, 'tcx>) -> &'a Type;
183 fn immediate_llvm_type<'a>(&self, cx: &CodegenCx<'a, 'tcx>) -> &'a Type;
184 fn scalar_llvm_type_at<'a>(
186 cx: &CodegenCx<'a, 'tcx>,
190 fn scalar_pair_element_llvm_type<'a>(
192 cx: &CodegenCx<'a, 'tcx>,
196 fn llvm_field_index<'a>(&self, cx: &CodegenCx<'a, 'tcx>, index: usize) -> u64;
197 fn pointee_info_at<'a>(&self, cx: &CodegenCx<'a, 'tcx>, offset: Size) -> Option<PointeeInfo>;
200 impl<'tcx> LayoutLlvmExt<'tcx> for TyAndLayout<'tcx> {
201 fn is_llvm_immediate(&self) -> bool {
203 Abi::Scalar(_) | Abi::Vector { .. } => true,
204 Abi::ScalarPair(..) => false,
205 Abi::Uninhabited | Abi::Aggregate { .. } => self.is_zst(),
209 fn is_llvm_scalar_pair(&self) -> bool {
211 Abi::ScalarPair(..) => true,
212 Abi::Uninhabited | Abi::Scalar(_) | Abi::Vector { .. } | Abi::Aggregate { .. } => false,
216 /// Gets the LLVM type corresponding to a Rust type, i.e., `rustc_middle::ty::Ty`.
217 /// The pointee type of the pointer in `PlaceRef` is always this type.
218 /// For sized types, it is also the right LLVM type for an `alloca`
219 /// containing a value of that type, and most immediates (except `bool`).
220 /// Unsized types, however, are represented by a "minimal unit", e.g.
221 /// `[T]` becomes `T`, while `str` and `Trait` turn into `i8` - this
222 /// is useful for indexing slices, as `&[T]`'s data pointer is `T*`.
223 /// If the type is an unsized struct, the regular layout is generated,
224 /// with the inner-most trailing unsized field using the "minimal unit"
225 /// of that field's type - this is useful for taking the address of
226 /// that field and ensuring the struct has the right alignment.
227 fn llvm_type<'a>(&self, cx: &CodegenCx<'a, 'tcx>) -> &'a Type {
228 if let Abi::Scalar(scalar) = self.abi {
229 // Use a different cache for scalars because pointers to DSTs
230 // can be either fat or thin (data pointers of fat pointers).
231 if let Some(&llty) = cx.scalar_lltypes.borrow().get(&self.ty) {
234 let llty = match *self.ty.kind() {
235 ty::Ref(_, ty, _) | ty::RawPtr(ty::TypeAndMut { ty, .. }) => {
236 cx.type_ptr_to(cx.layout_of(ty).llvm_type(cx))
238 ty::Adt(def, _) if def.is_box() => {
239 cx.type_ptr_to(cx.layout_of(self.ty.boxed_ty()).llvm_type(cx))
242 cx.fn_ptr_backend_type(cx.fn_abi_of_fn_ptr(sig, ty::List::empty()))
244 _ => self.scalar_llvm_type_at(cx, scalar, Size::ZERO),
246 cx.scalar_lltypes.borrow_mut().insert(self.ty, llty);
251 let variant_index = match self.variants {
252 Variants::Single { index } => Some(index),
255 if let Some(llty) = cx.type_lowering.borrow().get(&(self.ty, variant_index)) {
259 debug!("llvm_type({:#?})", self);
261 assert!(!self.ty.has_escaping_bound_vars(), "{:?} has escaping bound vars", self.ty);
263 // Make sure lifetimes are erased, to avoid generating distinct LLVM
264 // types for Rust types that only differ in the choice of lifetimes.
265 let normal_ty = cx.tcx.erase_regions(self.ty);
267 let mut defer = None;
268 let mut field_remapping = None;
269 let llty = if self.ty != normal_ty {
270 let mut layout = cx.layout_of(normal_ty);
271 if let Some(v) = variant_index {
272 layout = layout.for_variant(cx, v);
276 uncached_llvm_type(cx, *self, &mut defer, &mut field_remapping)
278 debug!("--> mapped {:#?} to llty={:?}", self, llty);
282 .insert((self.ty, variant_index), TypeLowering { lltype: llty, field_remapping });
284 if let Some((llty, layout)) = defer {
285 let (llfields, packed, new_field_remapping) = struct_llfields(cx, layout);
286 cx.set_struct_body(llty, &llfields, packed);
289 .get_mut(&(self.ty, variant_index))
291 .field_remapping = new_field_remapping;
296 fn immediate_llvm_type<'a>(&self, cx: &CodegenCx<'a, 'tcx>) -> &'a Type {
297 if let Abi::Scalar(scalar) = self.abi {
298 if scalar.is_bool() {
305 fn scalar_llvm_type_at<'a>(
307 cx: &CodegenCx<'a, 'tcx>,
311 match scalar.primitive() {
312 Int(i, _) => cx.type_from_integer(i),
313 F32 => cx.type_f32(),
314 F64 => cx.type_f64(),
316 // If we know the alignment, pick something better than i8.
317 let (pointee, address_space) =
318 if let Some(pointee) = self.pointee_info_at(cx, offset) {
319 (cx.type_pointee_for_align(pointee.align), pointee.address_space)
321 (cx.type_i8(), AddressSpace::DATA)
323 cx.type_ptr_to_ext(pointee, address_space)
328 fn scalar_pair_element_llvm_type<'a>(
330 cx: &CodegenCx<'a, 'tcx>,
334 // HACK(eddyb) special-case fat pointers until LLVM removes
335 // pointee types, to avoid bitcasting every `OperandRef::deref`.
336 match self.ty.kind() {
337 ty::Ref(..) | ty::RawPtr(_) => {
338 return self.field(cx, index).llvm_type(cx);
340 // only wide pointer boxes are handled as pointers
341 // thin pointer boxes with scalar allocators are handled by the general logic below
342 ty::Adt(def, substs) if def.is_box() && cx.layout_of(substs.type_at(1)).is_zst() => {
343 let ptr_ty = cx.tcx.mk_mut_ptr(self.ty.boxed_ty());
344 return cx.layout_of(ptr_ty).scalar_pair_element_llvm_type(cx, index, immediate);
349 let Abi::ScalarPair(a, b) = self.abi else {
350 bug!("TyAndLayout::scalar_pair_element_llty({:?}): not applicable", self);
352 let scalar = [a, b][index];
354 // Make sure to return the same type `immediate_llvm_type` would when
355 // dealing with an immediate pair. This means that `(bool, bool)` is
356 // effectively represented as `{i8, i8}` in memory and two `i1`s as an
357 // immediate, just like `bool` is typically `i8` in memory and only `i1`
358 // when immediate. We need to load/store `bool` as `i8` to avoid
359 // crippling LLVM optimizations or triggering other LLVM bugs with `i1`.
360 if immediate && scalar.is_bool() {
364 let offset = if index == 0 { Size::ZERO } else { a.size(cx).align_to(b.align(cx).abi) };
365 self.scalar_llvm_type_at(cx, scalar, offset)
368 fn llvm_field_index<'a>(&self, cx: &CodegenCx<'a, 'tcx>, index: usize) -> u64 {
370 Abi::Scalar(_) | Abi::ScalarPair(..) => {
371 bug!("TyAndLayout::llvm_field_index({:?}): not applicable", self)
376 FieldsShape::Primitive | FieldsShape::Union(_) => {
377 bug!("TyAndLayout::llvm_field_index({:?}): not applicable", self)
380 FieldsShape::Array { .. } => index as u64,
382 FieldsShape::Arbitrary { .. } => {
383 let variant_index = match self.variants {
384 Variants::Single { index } => Some(index),
388 // Look up llvm field if indexes do not match memory order due to padding. If
389 // `field_remapping` is `None` no padding was used and the llvm field index
390 // matches the memory index.
391 match cx.type_lowering.borrow().get(&(self.ty, variant_index)) {
392 Some(TypeLowering { field_remapping: Some(ref remap), .. }) => {
395 Some(_) => self.fields.memory_index(index) as u64,
397 bug!("TyAndLayout::llvm_field_index({:?}): type info not found", self)
404 // FIXME(eddyb) this having the same name as `TyAndLayout::pointee_info_at`
405 // (the inherent method, which is lacking this caching logic) can result in
406 // the uncached version being called - not wrong, but potentially inefficient.
407 fn pointee_info_at<'a>(&self, cx: &CodegenCx<'a, 'tcx>, offset: Size) -> Option<PointeeInfo> {
408 if let Some(&pointee) = cx.pointee_infos.borrow().get(&(self.ty, offset)) {
412 let result = Ty::ty_and_layout_pointee_info_at(*self, cx, offset);
414 cx.pointee_infos.borrow_mut().insert((self.ty, offset), result);