@@ -1167,7 +1167,7 @@ impl<Cx: HasDataLayout> LayoutCalculator<Cx> {
11671167 // To allow unsizing `&Foo<Type>` -> `&Foo<dyn Trait>`, the layout of the struct must
11681168 // not depend on the layout of the tail.
11691169 let max_field_align =
1170- fields_excluding_tail. iter ( ) . map ( |f| f. align . abi . bytes ( ) ) . max ( ) . unwrap_or ( 1 ) ;
1170+ fields_excluding_tail. iter ( ) . map ( |f| f. align . bytes ( ) ) . max ( ) . unwrap_or ( 1 ) ;
11711171 let largest_niche_size = fields_excluding_tail
11721172 . iter ( )
11731173 . filter_map ( |f| f. largest_niche )
@@ -1187,7 +1187,7 @@ impl<Cx: HasDataLayout> LayoutCalculator<Cx> {
11871187 } else {
11881188 // Returns `log2(effective-align)`. The calculation assumes that size is an
11891189 // integer multiple of align, except for ZSTs.
1190- let align = layout. align . abi . bytes ( ) ;
1190+ let align = layout. align . bytes ( ) ;
11911191 let size = layout. size . bytes ( ) ;
11921192 let niche_size = layout. largest_niche . map ( |n| n. available ( dl) ) . unwrap_or ( 0 ) ;
11931193 // Group [u8; 4] with align-4 or [u8; 6] with align-2 fields.
@@ -1485,7 +1485,7 @@ impl<Cx: HasDataLayout> LayoutCalculator<Cx> {
14851485 for i in layout. fields . index_by_increasing_offset ( ) {
14861486 let offset = layout. fields . offset ( i) ;
14871487 let f = & fields[ FieldIdx :: new ( i) ] ;
1488- write ! ( s, "[o{}a{}s{}" , offset. bytes( ) , f. align. abi . bytes( ) , f. size. bytes( ) ) . unwrap ( ) ;
1488+ write ! ( s, "[o{}a{}s{}" , offset. bytes( ) , f. align. bytes( ) , f. size. bytes( ) ) . unwrap ( ) ;
14891489 if let Some ( n) = f. largest_niche {
14901490 write ! (
14911491 s,
0 commit comments