Adjust library tests for unused_tuple_struct_fields -> dead_code

Author: shepmaster

library/alloc/src/boxed.rs

@@ -24,6 +24,7 @@
 //! Creating a recursive data structure:
 //!
 //! ```
+//! ##[allow(dead_code)]
 //! #[derive(Debug)]
 //! enum List<T> {
 //! Cons(T, Box<List<T>>),

library/alloc/src/boxed/thin.rs

@@ -171,7 +171,7 @@ struct WithHeader<H>(NonNull<u8>, PhantomData<H>);
 /// An opaque representation of `WithHeader<H>` to avoid the
 /// projection invariance of `<T as Pointee>::Metadata`.
 #[repr(transparent)]
-#[allow(unused_tuple_struct_fields)] // Field only used through `WithHeader` type above.
+#[allow(dead_code)] // Field only used through `WithHeader` type above.
 struct WithOpaqueHeader(NonNull<u8>);
 
 impl WithOpaqueHeader {

library/alloc/src/collections/btree/set/tests.rs

@@ -524,7 +524,7 @@ fn test_extend_ref() {
 #[test]
 fn test_recovery() {
  #[derive(Debug)]
- struct Foo(&'static str, i32);
+ struct Foo(&'static str, #[allow(dead_code)] i32);
 
  impl PartialEq for Foo {
  fn eq(&self, other: &Self) -> bool {

library/alloc/src/collections/vec_deque/tests.rs

@@ -1085,7 +1085,7 @@ fn test_clone_from() {
 fn test_vec_deque_truncate_drop() {
  static mut DROPS: u32 = 0;
  #[derive(Clone)]
- struct Elem(i32);
+ struct Elem(#[allow(dead_code)] i32);
  impl Drop for Elem {
  fn drop(&mut self) {
  unsafe {

library/alloc/tests/autotraits.rs

@@ -1,7 +1,7 @@
 fn require_sync<T: Sync>(_: T) {}
 fn require_send_sync<T: Send + Sync>(_: T) {}
 
-struct NotSend(*const ());
+struct NotSend(#[allow(dead_code)] *const ());
 unsafe impl Sync for NotSend {}
 
 #[test]

library/alloc/tests/vec.rs

@@ -547,7 +547,7 @@ fn test_cmp() {
 #[test]
 fn test_vec_truncate_drop() {
  static mut DROPS: u32 = 0;
- struct Elem(i32);
+ struct Elem(#[allow(dead_code)] i32);
  impl Drop for Elem {
  fn drop(&mut self) {
  unsafe {
@@ -1089,7 +1089,7 @@ fn test_into_iter_advance_by() {
 
 #[test]
 fn test_into_iter_drop_allocator() {
- struct ReferenceCountedAllocator<'a>(DropCounter<'a>);
+ struct ReferenceCountedAllocator<'a>(#[allow(dead_code)] DropCounter<'a>);
 
  unsafe impl Allocator for ReferenceCountedAllocator<'_> {
  fn allocate(&self, layout: Layout) -> Result<NonNull<[u8]>, core::alloc::AllocError> {
@@ -2407,7 +2407,7 @@ fn test_vec_dedup_multiple_ident() {
 #[test]
 fn test_vec_dedup_partialeq() {
  #[derive(Debug)]
- struct Foo(i32, i32);
+ struct Foo(i32, #[allow(dead_code)] i32);
 
  impl PartialEq for Foo {
  fn eq(&self, other: &Foo) -> bool {

library/core/benches/slice.rs

@@ -91,7 +91,7 @@ fn binary_search_l3_worst_case(b: &mut Bencher) {
 }
 
 #[derive(Clone)]
-struct Rgb(u8, u8, u8);
+struct Rgb(#[allow(dead_code)] u8, #[allow(dead_code)] u8, #[allow(dead_code)] u8);
 
 impl Rgb {
  fn gen(i: usize) -> Self {
@@ -154,7 +154,7 @@ swap_with_slice!(swap_with_slice_5x_usize_3000, 3000, |i| [i; 5]);
 #[bench]
 fn fill_byte_sized(b: &mut Bencher) {
  #[derive(Copy, Clone)]
- struct NewType(u8);
+ struct NewType(#[allow(dead_code)] u8);
 
  let mut ary = [NewType(0); 1024];
 

library/core/tests/any.rs

@@ -122,7 +122,7 @@ fn any_unsized() {
 fn distinct_type_names() {
  // https://github.com/rust-lang/rust/issues/84666
 
- struct Velocity(f32, f32);
+ struct Velocity(#[allow(dead_code)] f32, #[allow(dead_code)] f32);
 
  fn type_name_of_val<T>(_: T) -> &'static str {
  type_name::<T>()

library/core/tests/array.rs

@@ -262,7 +262,7 @@ fn array_default_impl_avoids_leaks_on_panic() {
  use core::sync::atomic::{AtomicUsize, Ordering::Relaxed};
  static COUNTER: AtomicUsize = AtomicUsize::new(0);
  #[derive(Debug)]
- struct Bomb(usize);
+ struct Bomb(#[allow(dead_code)] usize);
 
  impl Default for Bomb {
  fn default() -> Bomb {

library/core/tests/atomic.rs

@@ -188,7 +188,7 @@ fn ptr_bitops() {
 #[cfg(any(not(target_arch = "arm"), target_os = "linux"))] // Missing intrinsic in compiler-builtins
 fn ptr_bitops_tagging() {
  #[repr(align(16))]
- struct Tagme(u128);
+ struct Tagme(#[allow(dead_code)] u128);
 
  let tagme = Tagme(1000);
  let ptr = &tagme as *const Tagme as *mut Tagme;