diff --git a/compiler/rustc_transmute/src/layout/dfa.rs b/compiler/rustc_transmute/src/layout/dfa.rs index 09a60cf6a626a..b60ea6e7a24f2 100644 --- a/compiler/rustc_transmute/src/layout/dfa.rs +++ b/compiler/rustc_transmute/src/layout/dfa.rs @@ -1,7 +1,7 @@ use super::{nfa, Byte, Nfa, Ref}; use crate::Map; use std::fmt; -use std::sync::atomic::{AtomicU64, Ordering}; +use std::sync::atomic::{AtomicU32, Ordering}; #[derive(PartialEq, Clone, Debug)] pub(crate) struct Dfa @@ -49,7 +49,7 @@ where /// The states in a `Nfa` represent byte offsets. #[derive(Hash, Eq, PartialEq, PartialOrd, Ord, Copy, Clone)] -pub(crate) struct State(u64); +pub(crate) struct State(u32); #[derive(Hash, Eq, PartialEq, Clone, Copy)] pub(crate) enum Transition @@ -166,7 +166,7 @@ where impl State { pub(crate) fn new() -> Self { - static COUNTER: AtomicU64 = AtomicU64::new(0); + static COUNTER: AtomicU32 = AtomicU32::new(0); Self(COUNTER.fetch_add(1, Ordering::SeqCst)) } } diff --git a/compiler/rustc_transmute/src/layout/nfa.rs b/compiler/rustc_transmute/src/layout/nfa.rs index 3b2548e7aedf7..f25e3c1fd8a30 100644 --- a/compiler/rustc_transmute/src/layout/nfa.rs +++ b/compiler/rustc_transmute/src/layout/nfa.rs @@ -1,7 +1,7 @@ use super::{Byte, Ref, Tree, Uninhabited}; use crate::{Map, Set}; use std::fmt; -use std::sync::atomic::{AtomicU64, Ordering}; +use std::sync::atomic::{AtomicU32, Ordering}; /// A non-deterministic finite automaton (NFA) that represents the layout of a type. /// The transmutability of two given types is computed by comparing their `Nfa`s. @@ -17,7 +17,7 @@ where /// The states in a `Nfa` represent byte offsets. #[derive(Hash, Eq, PartialEq, PartialOrd, Ord, Copy, Clone)] -pub(crate) struct State(u64); +pub(crate) struct State(u32); /// The transitions between states in a `Nfa` reflect bit validity. #[derive(Hash, Eq, PartialEq, Clone, Copy)] @@ -173,7 +173,7 @@ where impl State { pub(crate) fn new() -> Self { - static COUNTER: AtomicU64 = AtomicU64::new(0); + static COUNTER: AtomicU32 = AtomicU32::new(0); Self(COUNTER.fetch_add(1, Ordering::SeqCst)) } }