* [PATCH v4 1/4] rust: macros: add derive macro for `Into`
2025-12-25 8:37 [PATCH v4 0/4] rust: add `TryFrom` and `Into` derive macros Jesung Yang via B4 Relay
@ 2025-12-25 8:37 ` Jesung Yang via B4 Relay
2025-12-25 17:40 ` Benno Lossin
2025-12-25 8:37 ` [PATCH v4 2/4] rust: macros: add derive macro for `TryFrom` Jesung Yang via B4 Relay
` (2 subsequent siblings)
3 siblings, 1 reply; 14+ messages in thread
From: Jesung Yang via B4 Relay @ 2025-12-25 8:37 UTC (permalink / raw)
To: Miguel Ojeda, Boqun Feng, Gary Guo, Björn Roy Baron,
Benno Lossin, Andreas Hindborg, Alice Ryhl, Trevor Gross,
Danilo Krummrich, Alexandre Courbot
Cc: linux-kernel, rust-for-linux, nouveau, Jesung Yang
From: Jesung Yang <y.j3ms.n@gmail.com>
Introduce a procedural macro `Into` to automatically implement the
`Into` trait for unit-only enums.
This reduces boilerplate in cases where enum variants need to be
interpreted as relevant numeric values. A concrete example can be
found in nova-core, where the `register!()` macro requires enum types
used within it to be convertible via `u32::from()` [1].
The macro not only supports primitive types such as `bool` or `i8`, but
also `Bounded`, a wrapper around integer types limiting the number of
bits usable for value representation. This accommodates the shift toward
more restrictive register field representations in nova-core where
values are constrained to specific bit ranges.
Note that the macro actually generates `From<E> for T` implementations,
where `E` is an enum identifier and `T` is an arbitrary integer type.
This automatically provides the corresponding `Into<T> for E`
implementations through the blanket implementation.
Link: https://lore.kernel.org/rust-for-linux/20250624132337.2242-1-dakr@kernel.org/ [1]
Signed-off-by: Jesung Yang <y.j3ms.n@gmail.com>
---
rust/macros/convert.rs | 467 +++++++++++++++++++++++++++++++++++++++++++++++++
rust/macros/lib.rs | 157 +++++++++++++++++
2 files changed, 624 insertions(+)
diff --git a/rust/macros/convert.rs b/rust/macros/convert.rs
new file mode 100644
index 0000000000000000000000000000000000000000..3e623cc894bff279482dd9daeaa7054937357ec6
--- /dev/null
+++ b/rust/macros/convert.rs
@@ -0,0 +1,467 @@
+// SPDX-License-Identifier: GPL-2.0
+
+use proc_macro2::{
+ Span,
+ TokenStream, //
+};
+
+use std::fmt;
+
+use syn::{
+ parse::{
+ Parse,
+ ParseStream, //
+ },
+ parse_quote,
+ parse_str,
+ punctuated::Punctuated,
+ spanned::Spanned,
+ Attribute,
+ Data,
+ DeriveInput,
+ Expr,
+ Fields,
+ Ident,
+ LitInt,
+ Token, //
+};
+
+pub(crate) fn derive_into(input: DeriveInput) -> syn::Result<TokenStream> {
+ derive(DeriveTarget::Into, input)
+}
+
+fn derive(target: DeriveTarget, input: DeriveInput) -> syn::Result<TokenStream> {
+ let mut errors: Option<syn::Error> = None;
+ let mut combine_error = |err| match errors.as_mut() {
+ Some(errors) => errors.combine(err),
+ None => errors = Some(err),
+ };
+
+ let (helper_tys, repr_ty) = parse_attrs(target, &input.attrs)?;
+ for ty in &helper_tys {
+ if let Err(err) = ty.validate() {
+ combine_error(err);
+ }
+ }
+
+ let data_enum = match input.data {
+ Data::Enum(data) => data,
+ Data::Struct(data) => {
+ let msg = format!(
+ "expected `enum`, found `struct`; \
+ `#[derive({})]` can only be applied to a unit-only enum",
+ target.get_trait_name()
+ );
+ return Err(syn::Error::new(data.struct_token.span(), msg));
+ }
+ Data::Union(data) => {
+ let msg = format!(
+ "expected `enum`, found `union`; \
+ `#[derive({})]` can only be applied to a unit-only enum",
+ target.get_trait_name()
+ );
+ return Err(syn::Error::new(data.union_token.span(), msg));
+ }
+ };
+
+ for variant in &data_enum.variants {
+ match &variant.fields {
+ Fields::Named(fields) => {
+ let msg = format!(
+ "expected unit-like variant, found struct-like variant; \
+ `#[derive({})]` can only be applied to a unit-only enum",
+ target.get_trait_name()
+ );
+ combine_error(syn::Error::new_spanned(fields, msg));
+ }
+ Fields::Unnamed(fields) => {
+ let msg = format!(
+ "expected unit-like variant, found tuple-like variant; \
+ `#[derive({})]` can only be applied to a unit-only enum",
+ target.get_trait_name()
+ );
+ combine_error(syn::Error::new_spanned(fields, msg));
+ }
+ _ => (),
+ }
+ }
+
+ if let Some(errors) = errors {
+ return Err(errors);
+ }
+
+ let variants: Vec<_> = data_enum
+ .variants
+ .into_iter()
+ .map(|variant| variant.ident)
+ .collect();
+
+ Ok(derive_for_enum(
+ target,
+ &input.ident,
+ &variants,
+ &helper_tys,
+ &repr_ty,
+ ))
+}
+
+#[derive(Clone, Copy, Debug)]
+enum DeriveTarget {
+ Into,
+}
+
+impl DeriveTarget {
+ fn get_trait_name(&self) -> &'static str {
+ match self {
+ Self::Into => "Into",
+ }
+ }
+
+ fn get_helper_name(&self) -> &'static str {
+ match self {
+ Self::Into => "into",
+ }
+ }
+}
+
+fn parse_attrs(target: DeriveTarget, attrs: &[Attribute]) -> syn::Result<(Vec<ValidTy>, Ident)> {
+ let helper = target.get_helper_name();
+
+ let mut repr_ty = None;
+ let mut helper_tys = Vec::new();
+ for attr in attrs {
+ if attr.path().is_ident("repr") {
+ attr.parse_nested_meta(|meta| {
+ let ident = meta.path.get_ident();
+ if ident.is_some_and(is_valid_primitive) {
+ repr_ty = ident.cloned();
+ }
+ // Delegate `repr` attribute validation to rustc.
+ Ok(())
+ })?;
+ } else if attr.path().is_ident(helper) && helper_tys.is_empty() {
+ let args = attr.parse_args_with(Punctuated::<ValidTy, Token![,]>::parse_terminated)?;
+ helper_tys.extend(args);
+ }
+ }
+
+ // Note on field-less `repr(C)` enums (quote from [1]):
+ //
+ // In C, enums with discriminants that do not all fit into an `int` or all fit into an
+ // `unsigned int` are a portability hazard: such enums are only permitted since C23, and not
+ // supported e.g. by MSVC.
+ //
+ // Furthermore, Rust interprets the discriminant values of `repr(C)` enums as expressions of
+ // type `isize`. This makes it impossible to implement the C23 behavior of enums where the
+ // enum discriminants have no predefined type and instead the enum uses a type large enough
+ // to hold all discriminants.
+ //
+ // Therefore, `repr(C)` enums in Rust require that either all discriminants to fit into a C
+ // `int` or they all fit into an `unsigned int`.
+ //
+ // As such, `isize` is a reasonable representation for `repr(C)` enums, as it covers the range
+ // of both `int` and `unsigned int`.
+ //
+ // For more information, see:
+ // - https://github.com/rust-lang/rust/issues/124403
+ // - https://github.com/rust-lang/rust/pull/147017
+ // - https://github.com/rust-lang/rust/blob/2ca7bcd03b87b52f7055a59b817443b0ac4a530d/compiler/rustc_lint_defs/src/builtin.rs#L5251-L5263 [1]
+
+ // Extract the representation passed by `#[repr(...)]` if present. If nothing is
+ // specified, the default is `Rust` representation, which uses `isize` for its
+ // discriminant type.
+ // See: https://doc.rust-lang.org/reference/items/enumerations.html#r-items.enum.discriminant.repr-rust
+ let repr_ty = repr_ty.unwrap_or_else(|| Ident::new("isize", Span::call_site()));
+ Ok((helper_tys, repr_ty))
+}
+
+fn derive_for_enum(
+ target: DeriveTarget,
+ enum_ident: &Ident,
+ variants: &[Ident],
+ helper_tys: &[ValidTy],
+ repr_ty: &Ident,
+) -> TokenStream {
+ let impl_fn = match target {
+ DeriveTarget::Into => impl_into,
+ };
+
+ let qualified_repr_ty: syn::Path = parse_quote! { ::core::primitive::#repr_ty };
+
+ return if helper_tys.is_empty() {
+ let ty = ValidTy::Primitive(repr_ty.clone());
+ let impls =
+ std::iter::once(ty).map(|ty| impl_fn(enum_ident, variants, &qualified_repr_ty, &ty));
+ ::quote::quote! { #(#impls)* }
+ } else {
+ let impls = helper_tys
+ .iter()
+ .map(|ty| impl_fn(enum_ident, variants, &qualified_repr_ty, ty));
+ ::quote::quote! { #(#impls)* }
+ };
+
+ fn impl_into(
+ enum_ident: &Ident,
+ variants: &[Ident],
+ repr_ty: &syn::Path,
+ input_ty: &ValidTy,
+ ) -> TokenStream {
+ let param = Ident::new("value", Span::call_site());
+
+ let overflow_assertion = emit_overflow_assert(enum_ident, variants, repr_ty, input_ty);
+ let cast = match input_ty {
+ ValidTy::Bounded(inner) => {
+ let base_ty = inner.emit_qualified_base_ty();
+ let expr = parse_quote! { #param as #base_ty };
+ // Since the discriminant of `#param`, an enum variant, is determined
+ // at compile-time, we can rely on `Bounded::from_expr()`. It requires
+ // the provided expression to be verifiable at compile-time to avoid
+ // triggering a build error.
+ inner.emit_from_expr(&expr)
+ }
+ ValidTy::Primitive(ident) if ident == "bool" => {
+ ::quote::quote! { (#param as #repr_ty) == 1 }
+ }
+ qualified @ ValidTy::Primitive(_) => ::quote::quote! { #param as #qualified },
+ };
+
+ ::quote::quote! {
+ #[automatically_derived]
+ impl ::core::convert::From<#enum_ident> for #input_ty {
+ fn from(#param: #enum_ident) -> #input_ty {
+ #overflow_assertion
+
+ #cast
+ }
+ }
+ }
+ }
+
+ fn emit_overflow_assert(
+ enum_ident: &Ident,
+ variants: &[Ident],
+ repr_ty: &syn::Path,
+ input_ty: &ValidTy,
+ ) -> TokenStream {
+ let qualified_i128: syn::Path = parse_quote! { ::core::primitive::i128 };
+ let qualified_u128: syn::Path = parse_quote! { ::core::primitive::u128 };
+
+ let input_min = input_ty.emit_min();
+ let input_max = input_ty.emit_max();
+
+ let variant_fits = variants.iter().map(|variant| {
+ let msg = format!(
+ "enum discriminant overflow: \
+ `{enum_ident}::{variant}` does not fit in `{input_ty}`",
+ );
+ ::quote::quote! {
+ ::core::assert!(fits(#enum_ident::#variant as #repr_ty), #msg);
+ }
+ });
+
+ ::quote::quote! {
+ const _: () = {
+ const fn fits(d: #repr_ty) -> ::core::primitive::bool {
+ // For every integer type, its minimum value always fits in `i128`.
+ let dst_min = #input_min;
+ // For every integer type, its maximum value always fits in `u128`.
+ let dst_max = #input_max;
+
+ #[allow(unused_comparisons)]
+ let is_src_signed = #repr_ty::MIN < 0;
+ #[allow(unused_comparisons)]
+ let is_dst_signed = dst_min < 0;
+
+ if is_src_signed && is_dst_signed {
+ // Casting from a signed value to `i128` does not overflow since
+ // `i128` is the largest signed primitive integer type.
+ (d as #qualified_i128) >= (dst_min as #qualified_i128)
+ && (d as #qualified_i128) <= (dst_max as #qualified_i128)
+ } else if is_src_signed && !is_dst_signed {
+ // Casting from a signed value greater than 0 to `u128` does not
+ // overflow since `u128::MAX` is greater than `i128::MAX`.
+ d >= 0 && (d as #qualified_u128) <= (dst_max as #qualified_u128)
+ } else {
+ // Casting from an unsigned value to `u128` does not overflow since
+ // `u128` is the largest unsigned primitive integer type.
+ (d as #qualified_u128) <= (dst_max as #qualified_u128)
+ }
+ }
+
+ #(#variant_fits)*
+ };
+ }
+ }
+}
+
+enum ValidTy {
+ Bounded(Bounded),
+ Primitive(Ident),
+}
+
+impl ValidTy {
+ fn validate(&self) -> syn::Result<()> {
+ match self {
+ Self::Bounded(inner) => inner.validate(),
+ Self::Primitive(ident) => validate_primitive(ident),
+ }
+ }
+
+ fn emit_min(&self) -> TokenStream {
+ match self {
+ Self::Bounded(inner) => inner.emit_min(),
+ Self::Primitive(ident) if ident == "bool" => {
+ ::quote::quote! { 0 }
+ }
+ qualified @ Self::Primitive(_) => ::quote::quote! { #qualified::MIN },
+ }
+ }
+
+ fn emit_max(&self) -> TokenStream {
+ match self {
+ Self::Bounded(inner) => inner.emit_max(),
+ Self::Primitive(ident) if ident == "bool" => {
+ ::quote::quote! { 1 }
+ }
+ qualified @ Self::Primitive(_) => ::quote::quote! { #qualified::MAX },
+ }
+ }
+}
+
+impl Parse for ValidTy {
+ fn parse(input: ParseStream<'_>) -> syn::Result<Self> {
+ if input.peek(Ident) && input.peek2(Token![<]) {
+ return Ok(ValidTy::Bounded(input.parse()?));
+ }
+ Ok(ValidTy::Primitive(input.parse()?))
+ }
+}
+
+impl ::quote::ToTokens for ValidTy {
+ fn to_tokens(&self, tokens: &mut TokenStream) {
+ match self {
+ Self::Bounded(inner) => inner.to_tokens(tokens),
+ Self::Primitive(ident) => {
+ let qualified_name: syn::Path = parse_quote! { ::core::primitive::#ident };
+ qualified_name.to_tokens(tokens)
+ }
+ }
+ }
+}
+
+impl fmt::Display for ValidTy {
+ fn fmt(&self, f: &mut fmt::Formatter<'_>) -> fmt::Result {
+ match self {
+ Self::Bounded(inner) => inner.fmt(f),
+ Self::Primitive(ident) => ident.fmt(f),
+ }
+ }
+}
+
+struct Bounded {
+ name: Ident,
+ open_angle: Token![<],
+ base_ty: Ident,
+ comma: Token![,],
+ bits: LitInt,
+ close_angle: Token![>],
+}
+
+impl Bounded {
+ const NAME: &'static str = "Bounded";
+ const QUALIFIED_NAME: &'static str = "::kernel::num::Bounded";
+
+ fn validate(&self) -> syn::Result<()> {
+ let name = &self.name;
+ if name != Self::NAME {
+ let msg = format!("expected `{}`, found {}", Self::NAME, name);
+ return Err(syn::Error::new(name.span(), msg));
+ }
+ validate_primitive(&self.base_ty)?;
+ Ok(())
+ }
+
+ fn emit_from_expr(&self, expr: &Expr) -> TokenStream {
+ let Self { base_ty, bits, .. } = self;
+ let qualified_name: syn::Path = parse_str(Self::QUALIFIED_NAME).expect("valid path");
+ ::quote::quote! {
+ #qualified_name::<#base_ty, #bits>::from_expr(#expr)
+ }
+ }
+
+ fn emit_qualified_base_ty(&self) -> TokenStream {
+ let base_ty = &self.base_ty;
+ ::quote::quote! { ::core::primitive::#base_ty }
+ }
+
+ fn emit_min(&self) -> TokenStream {
+ let bits = &self.bits;
+ let base_ty = self.emit_qualified_base_ty();
+ ::quote::quote! { #base_ty::MIN >> (#base_ty::BITS - #bits) }
+ }
+
+ fn emit_max(&self) -> TokenStream {
+ let bits = &self.bits;
+ let base_ty = self.emit_qualified_base_ty();
+ ::quote::quote! { #base_ty::MAX >> (#base_ty::BITS - #bits) }
+ }
+}
+
+impl Parse for Bounded {
+ fn parse(input: ParseStream<'_>) -> syn::Result<Self> {
+ Ok(Self {
+ name: input.parse()?,
+ open_angle: input.parse()?,
+ base_ty: input.parse()?,
+ comma: input.parse()?,
+ bits: input.parse()?,
+ close_angle: input.parse()?,
+ })
+ }
+}
+
+impl ::quote::ToTokens for Bounded {
+ fn to_tokens(&self, tokens: &mut TokenStream) {
+ let qualified_name: syn::Path = parse_str(Self::QUALIFIED_NAME).expect("valid path");
+ qualified_name.to_tokens(tokens);
+ self.open_angle.to_tokens(tokens);
+ self.base_ty.to_tokens(tokens);
+ self.comma.to_tokens(tokens);
+ self.bits.to_tokens(tokens);
+ self.close_angle.to_tokens(tokens);
+ }
+}
+
+impl fmt::Display for Bounded {
+ fn fmt(&self, f: &mut fmt::Formatter<'_>) -> fmt::Result {
+ write!(f, "{}<{}, {}>", Self::NAME, self.base_ty, self.bits)
+ }
+}
+
+fn validate_primitive(ident: &Ident) -> syn::Result<()> {
+ if is_valid_primitive(ident) {
+ return Ok(());
+ }
+ let msg =
+ format!("expected `bool` or primitive integer type (e.g., `u8`, `i8`), found {ident}");
+ Err(syn::Error::new(ident.span(), msg))
+}
+
+fn is_valid_primitive(ident: &Ident) -> bool {
+ matches!(
+ ident.to_string().as_str(),
+ "bool"
+ | "u8"
+ | "u16"
+ | "u32"
+ | "u64"
+ | "u128"
+ | "usize"
+ | "i8"
+ | "i16"
+ | "i32"
+ | "i64"
+ | "i128"
+ | "isize"
+ )
+}
diff --git a/rust/macros/lib.rs b/rust/macros/lib.rs
index b38002151871a33f6b4efea70be2deb6ddad38e2..02528d7212b75d28788f0c33479edb272fa12e27 100644
--- a/rust/macros/lib.rs
+++ b/rust/macros/lib.rs
@@ -14,6 +14,7 @@
#[macro_use]
mod quote;
mod concat_idents;
+mod convert;
mod export;
mod fmt;
mod helpers;
@@ -23,6 +24,10 @@
mod vtable;
use proc_macro::TokenStream;
+use syn::{
+ parse_macro_input,
+ DeriveInput, //
+};
/// Declares a kernel module.
///
@@ -475,3 +480,155 @@ pub fn paste(input: TokenStream) -> TokenStream {
pub fn kunit_tests(attr: TokenStream, ts: TokenStream) -> TokenStream {
kunit::kunit_tests(attr, ts)
}
+
+/// A derive macro for providing an implementation of the [`Into`] trait.
+///
+/// This macro automatically derives the [`Into`] trait for a given enum by generating
+/// the relevant [`From`] implementation. Currently, it only supports [unit-only enum]s.
+///
+/// [unit-only enum]: https://doc.rust-lang.org/reference/items/enumerations.html#r-items.enum.unit-only
+///
+/// # Notes
+///
+/// - Unlike its name suggests, the macro actually generates [`From`] implementations
+/// which automatically provide corresponding [`Into`] implementations.
+///
+/// - The macro uses the `into` custom attribute or `repr` attribute to generate [`From`]
+/// implementations. `into` always takes precedence over `repr`.
+///
+/// - The macro generates a compile-time assertion for every variant to ensure its
+/// discriminant value fits within the type being converted into.
+///
+/// # Supported types in `#[into(...)]`
+///
+/// - [`bool`]
+/// - Primitive integer types (e.g., [`i8`], [`u8`])
+/// - [`Bounded`]
+///
+/// [`Bounded`]: ../kernel/num/bounded/struct.Bounded.html
+///
+/// # Examples
+///
+/// ## Without Attributes
+///
+/// Since [the default `Rust` representation uses `isize` for the discriminant type][repr-rust],
+/// the macro implements `From<Foo>` for `isize`:
+///
+/// [repr-rust]: https://doc.rust-lang.org/reference/items/enumerations.html#r-items.enum.discriminant.repr-rust
+///
+/// ```
+/// use kernel::macros::Into;
+///
+/// #[derive(Debug, Default, Into)]
+/// enum Foo {
+/// #[default]
+/// A,
+/// B = 0x7,
+/// }
+///
+/// assert_eq!(0_isize, Foo::A.into());
+/// assert_eq!(0x7_isize, Foo::B.into());
+/// ```
+///
+/// ## With `#[repr(T)]`
+///
+/// The macro implements `From<Foo>` for `T`:
+///
+/// ```
+/// use kernel::macros::Into;
+///
+/// #[derive(Debug, Default, Into)]
+/// #[repr(u8)]
+/// enum Foo {
+/// #[default]
+/// A,
+/// B = 0x7,
+/// }
+///
+/// assert_eq!(0_u8, Foo::A.into());
+/// assert_eq!(0x7_u8, Foo::B.into());
+/// ```
+///
+/// ## With `#[into(...)]`
+///
+/// The macro implements `From<Foo>` for each `T` specified in `#[into(...)]`,
+/// which always overrides `#[repr(...)]`:
+///
+/// ```
+/// use kernel::{
+/// macros::Into,
+/// num::Bounded, //
+/// };
+///
+/// #[derive(Debug, Default, Into)]
+/// #[into(bool, i16, Bounded<u8, 4>)]
+/// #[repr(u8)]
+/// enum Foo {
+/// #[default]
+/// A,
+/// B,
+/// }
+///
+/// assert_eq!(false, Foo::A.into());
+/// assert_eq!(true, Foo::B.into());
+///
+/// assert_eq!(0_i16, Foo::A.into());
+/// assert_eq!(1_i16, Foo::B.into());
+///
+/// let foo_a: Bounded<u8, 4> = Foo::A.into();
+/// let foo_b: Bounded<u8, 4> = Foo::B.into();
+/// assert_eq!(Bounded::<u8, 4>::new::<0>(), foo_a);
+/// assert_eq!(Bounded::<u8, 4>::new::<1>(), foo_b);
+/// ```
+///
+/// ## Compile-time Overflow Assertion
+///
+/// The following examples do not compile:
+///
+/// ```compile_fail
+/// # use kernel::macros::Into;
+/// #[derive(Into)]
+/// #[into(u8)]
+/// enum Foo {
+/// // `256` is larger than `u8::MAX`.
+/// A = 256,
+/// }
+/// ```
+///
+/// ```compile_fail
+/// # use kernel::macros::Into;
+/// #[derive(Into)]
+/// #[into(u8)]
+/// enum Foo {
+/// // `-1` cannot be represented with `u8`.
+/// A = -1,
+/// }
+/// ```
+///
+/// ## Unsupported Cases
+///
+/// The following examples do not compile:
+///
+/// ```compile_fail
+/// # use kernel::macros::Into;
+/// // Tuple-like enums or struct-like enums are not allowed.
+/// #[derive(Into)]
+/// enum Foo {
+/// A(u8),
+/// B { inner: u8 },
+/// }
+/// ```
+///
+/// ```compile_fail
+/// # use kernel::macros::Into;
+/// // Structs are not allowed.
+/// #[derive(Into)]
+/// struct Foo(u8);
+/// ```
+#[proc_macro_derive(Into, attributes(into))]
+pub fn derive_into(input: TokenStream) -> TokenStream {
+ let input = parse_macro_input!(input as DeriveInput);
+ convert::derive_into(input)
+ .unwrap_or_else(syn::Error::into_compile_error)
+ .into()
+}
--
2.47.3
^ permalink raw reply related [flat|nested] 14+ messages in thread* Re: [PATCH v4 1/4] rust: macros: add derive macro for `Into`
2025-12-25 8:37 ` [PATCH v4 1/4] rust: macros: add derive macro for `Into` Jesung Yang via B4 Relay
@ 2025-12-25 17:40 ` Benno Lossin
2025-12-26 9:36 ` Jesung Yang
0 siblings, 1 reply; 14+ messages in thread
From: Benno Lossin @ 2025-12-25 17:40 UTC (permalink / raw)
To: y.j3ms.n, Miguel Ojeda, Boqun Feng, Gary Guo,
Björn Roy Baron, Andreas Hindborg, Alice Ryhl, Trevor Gross,
Danilo Krummrich, Alexandre Courbot
Cc: linux-kernel, rust-for-linux, nouveau
On Thu Dec 25, 2025 at 9:37 AM CET, Jesung Yang via B4 Relay wrote:
> +fn derive(target: DeriveTarget, input: DeriveInput) -> syn::Result<TokenStream> {
> + let mut errors: Option<syn::Error> = None;
> + let mut combine_error = |err| match errors.as_mut() {
> + Some(errors) => errors.combine(err),
> + None => errors = Some(err),
> + };
> +
> + let (helper_tys, repr_ty) = parse_attrs(target, &input.attrs)?;
> + for ty in &helper_tys {
> + if let Err(err) = ty.validate() {
> + combine_error(err);
> + }
> + }
> +
> + let data_enum = match input.data {
> + Data::Enum(data) => data,
> + Data::Struct(data) => {
> + let msg = format!(
> + "expected `enum`, found `struct`; \
> + `#[derive({})]` can only be applied to a unit-only enum",
> + target.get_trait_name()
> + );
> + return Err(syn::Error::new(data.struct_token.span(), msg));
> + }
> + Data::Union(data) => {
> + let msg = format!(
> + "expected `enum`, found `union`; \
> + `#[derive({})]` can only be applied to a unit-only enum",
> + target.get_trait_name()
> + );
> + return Err(syn::Error::new(data.union_token.span(), msg));
> + }
> + };
> +
> + for variant in &data_enum.variants {
> + match &variant.fields {
> + Fields::Named(fields) => {
> + let msg = format!(
> + "expected unit-like variant, found struct-like variant; \
> + `#[derive({})]` can only be applied to a unit-only enum",
> + target.get_trait_name()
> + );
> + combine_error(syn::Error::new_spanned(fields, msg));
> + }
> + Fields::Unnamed(fields) => {
> + let msg = format!(
> + "expected unit-like variant, found tuple-like variant; \
> + `#[derive({})]` can only be applied to a unit-only enum",
> + target.get_trait_name()
> + );
> + combine_error(syn::Error::new_spanned(fields, msg));
> + }
> + _ => (),
We should be exhaustive here to exclude any future additions (ie break
the build if a new `Fields::...` variant is added).
> + }
> + }
> +
> + if let Some(errors) = errors {
> + return Err(errors);
> + }
> +
> + let variants: Vec<_> = data_enum
> + .variants
> + .into_iter()
> + .map(|variant| variant.ident)
> + .collect();
> +
> + Ok(derive_for_enum(
> + target,
> + &input.ident,
> + &variants,
> + &helper_tys,
> + &repr_ty,
> + ))
> +}
> +
> +#[derive(Clone, Copy, Debug)]
> +enum DeriveTarget {
> + Into,
> +}
> +
> +impl DeriveTarget {
> + fn get_trait_name(&self) -> &'static str {
> + match self {
> + Self::Into => "Into",
> + }
> + }
> +
> + fn get_helper_name(&self) -> &'static str {
> + match self {
> + Self::Into => "into",
> + }
> + }
> +}
> +
> +fn parse_attrs(target: DeriveTarget, attrs: &[Attribute]) -> syn::Result<(Vec<ValidTy>, Ident)> {
> + let helper = target.get_helper_name();
> +
> + let mut repr_ty = None;
> + let mut helper_tys = Vec::new();
> + for attr in attrs {
> + if attr.path().is_ident("repr") {
> + attr.parse_nested_meta(|meta| {
> + let ident = meta.path.get_ident();
> + if ident.is_some_and(is_valid_primitive) {
> + repr_ty = ident.cloned();
> + }
While this works for now, writing `repr(C, {integer})` might become
meaningful in the future, see [1]. We should just accept it now as well.
[1]: https://github.com/rust-lang/rust/issues/68585
> + // Delegate `repr` attribute validation to rustc.
> + Ok(())
> + })?;
> + } else if attr.path().is_ident(helper) && helper_tys.is_empty() {
> + let args = attr.parse_args_with(Punctuated::<ValidTy, Token![,]>::parse_terminated)?;
> + helper_tys.extend(args);
> + }
> + }
> +
> + // Note on field-less `repr(C)` enums (quote from [1]):
> + //
> + // In C, enums with discriminants that do not all fit into an `int` or all fit into an
> + // `unsigned int` are a portability hazard: such enums are only permitted since C23, and not
> + // supported e.g. by MSVC.
> + //
> + // Furthermore, Rust interprets the discriminant values of `repr(C)` enums as expressions of
> + // type `isize`. This makes it impossible to implement the C23 behavior of enums where the
> + // enum discriminants have no predefined type and instead the enum uses a type large enough
> + // to hold all discriminants.
> + //
> + // Therefore, `repr(C)` enums in Rust require that either all discriminants to fit into a C
> + // `int` or they all fit into an `unsigned int`.
> + //
> + // As such, `isize` is a reasonable representation for `repr(C)` enums, as it covers the range
> + // of both `int` and `unsigned int`.
> + //
> + // For more information, see:
> + // - https://github.com/rust-lang/rust/issues/124403
> + // - https://github.com/rust-lang/rust/pull/147017
> + // - https://github.com/rust-lang/rust/blob/2ca7bcd03b87b52f7055a59b817443b0ac4a530d/compiler/rustc_lint_defs/src/builtin.rs#L5251-L5263 [1]
> +
> + // Extract the representation passed by `#[repr(...)]` if present. If nothing is
> + // specified, the default is `Rust` representation, which uses `isize` for its
> + // discriminant type.
> + // See: https://doc.rust-lang.org/reference/items/enumerations.html#r-items.enum.discriminant.repr-rust
I think we should error when no `#[repr({integer})]` attribute is
specified.
> + let repr_ty = repr_ty.unwrap_or_else(|| Ident::new("isize", Span::call_site()));
> + Ok((helper_tys, repr_ty))
> +}
> +
> +fn derive_for_enum(
> + target: DeriveTarget,
> + enum_ident: &Ident,
> + variants: &[Ident],
> + helper_tys: &[ValidTy],
> + repr_ty: &Ident,
> +) -> TokenStream {
> + let impl_fn = match target {
> + DeriveTarget::Into => impl_into,
> + };
> +
> + let qualified_repr_ty: syn::Path = parse_quote! { ::core::primitive::#repr_ty };
> +
> + return if helper_tys.is_empty() {
> + let ty = ValidTy::Primitive(repr_ty.clone());
> + let impls =
> + std::iter::once(ty).map(|ty| impl_fn(enum_ident, variants, &qualified_repr_ty, &ty));
> + ::quote::quote! { #(#impls)* }
> + } else {
> + let impls = helper_tys
> + .iter()
> + .map(|ty| impl_fn(enum_ident, variants, &qualified_repr_ty, ty));
> + ::quote::quote! { #(#impls)* }
> + };
Let's just do this when we still have the `helper_tys` vector:
helper_tys.push(ValidTy::Primitive(repr_ty));
> +
> + fn impl_into(
> + enum_ident: &Ident,
> + variants: &[Ident],
> + repr_ty: &syn::Path,
> + input_ty: &ValidTy,
> + ) -> TokenStream {
> + let param = Ident::new("value", Span::call_site());
> +
> + let overflow_assertion = emit_overflow_assert(enum_ident, variants, repr_ty, input_ty);
> + let cast = match input_ty {
> + ValidTy::Bounded(inner) => {
> + let base_ty = inner.emit_qualified_base_ty();
> + let expr = parse_quote! { #param as #base_ty };
> + // Since the discriminant of `#param`, an enum variant, is determined
> + // at compile-time, we can rely on `Bounded::from_expr()`. It requires
> + // the provided expression to be verifiable at compile-time to avoid
> + // triggering a build error.
> + inner.emit_from_expr(&expr)
> + }
> + ValidTy::Primitive(ident) if ident == "bool" => {
> + ::quote::quote! { (#param as #repr_ty) == 1 }
> + }
> + qualified @ ValidTy::Primitive(_) => ::quote::quote! { #param as #qualified },
> + };
> +
> + ::quote::quote! {
> + #[automatically_derived]
> + impl ::core::convert::From<#enum_ident> for #input_ty {
> + fn from(#param: #enum_ident) -> #input_ty {
> + #overflow_assertion
> +
> + #cast
> + }
> + }
> + }
> + }
> +
> + fn emit_overflow_assert(
> + enum_ident: &Ident,
> + variants: &[Ident],
> + repr_ty: &syn::Path,
> + input_ty: &ValidTy,
> + ) -> TokenStream {
I feel like we should track this via traits rather than using a const
assert. That approach will require & generate much less code.
> + let qualified_i128: syn::Path = parse_quote! { ::core::primitive::i128 };
> + let qualified_u128: syn::Path = parse_quote! { ::core::primitive::u128 };
> +
> + let input_min = input_ty.emit_min();
> + let input_max = input_ty.emit_max();
> +
> + let variant_fits = variants.iter().map(|variant| {
> + let msg = format!(
> + "enum discriminant overflow: \
> + `{enum_ident}::{variant}` does not fit in `{input_ty}`",
> + );
> + ::quote::quote! {
> + ::core::assert!(fits(#enum_ident::#variant as #repr_ty), #msg);
> + }
> + });
> +
> + ::quote::quote! {
> + const _: () = {
> + const fn fits(d: #repr_ty) -> ::core::primitive::bool {
> + // For every integer type, its minimum value always fits in `i128`.
> + let dst_min = #input_min;
> + // For every integer type, its maximum value always fits in `u128`.
> + let dst_max = #input_max;
> +
> + #[allow(unused_comparisons)]
> + let is_src_signed = #repr_ty::MIN < 0;
> + #[allow(unused_comparisons)]
> + let is_dst_signed = dst_min < 0;
> +
> + if is_src_signed && is_dst_signed {
> + // Casting from a signed value to `i128` does not overflow since
> + // `i128` is the largest signed primitive integer type.
> + (d as #qualified_i128) >= (dst_min as #qualified_i128)
> + && (d as #qualified_i128) <= (dst_max as #qualified_i128)
> + } else if is_src_signed && !is_dst_signed {
> + // Casting from a signed value greater than 0 to `u128` does not
> + // overflow since `u128::MAX` is greater than `i128::MAX`.
> + d >= 0 && (d as #qualified_u128) <= (dst_max as #qualified_u128)
> + } else {
> + // Casting from an unsigned value to `u128` does not overflow since
> + // `u128` is the largest unsigned primitive integer type.
> + (d as #qualified_u128) <= (dst_max as #qualified_u128)
> + }
> + }
> +
> + #(#variant_fits)*
> + };
> + }
> + }
> +}
> +
> +impl fmt::Display for ValidTy {
> + fn fmt(&self, f: &mut fmt::Formatter<'_>) -> fmt::Result {
> + match self {
> + Self::Bounded(inner) => inner.fmt(f),
> + Self::Primitive(ident) => ident.fmt(f),
> + }
> + }
> +}
> +
> +struct Bounded {
> + name: Ident,
> + open_angle: Token![<],
> + base_ty: Ident,
We should allow a type here from syntax and then emit an error when it
isn't a primitive.
> + comma: Token![,],
> + bits: LitInt,
> + close_angle: Token![>],
> +}
> diff --git a/rust/macros/lib.rs b/rust/macros/lib.rs
> index b38002151871a33f6b4efea70be2deb6ddad38e2..02528d7212b75d28788f0c33479edb272fa12e27 100644
> --- a/rust/macros/lib.rs
> +++ b/rust/macros/lib.rs
> @@ -14,6 +14,7 @@
> #[macro_use]
> mod quote;
> mod concat_idents;
> +mod convert;
> mod export;
> mod fmt;
> mod helpers;
> @@ -23,6 +24,10 @@
> mod vtable;
>
> use proc_macro::TokenStream;
> +use syn::{
> + parse_macro_input,
> + DeriveInput, //
> +};
>
> /// Declares a kernel module.
> ///
> @@ -475,3 +480,155 @@ pub fn paste(input: TokenStream) -> TokenStream {
> pub fn kunit_tests(attr: TokenStream, ts: TokenStream) -> TokenStream {
> kunit::kunit_tests(attr, ts)
> }
> +
> +/// A derive macro for providing an implementation of the [`Into`] trait.
> +///
> +/// This macro automatically derives the [`Into`] trait for a given enum by generating
> +/// the relevant [`From`] implementation. Currently, it only supports [unit-only enum]s.
> +///
> +/// [unit-only enum]: https://doc.rust-lang.org/reference/items/enumerations.html#r-items.enum.unit-only
> +///
> +/// # Notes
> +///
> +/// - Unlike its name suggests, the macro actually generates [`From`] implementations
> +/// which automatically provide corresponding [`Into`] implementations.
> +///
> +/// - The macro uses the `into` custom attribute or `repr` attribute to generate [`From`]
> +/// implementations. `into` always takes precedence over `repr`.
What do you mean by "precedence" here? You always generate it for all
helper_tys and the repr?
Cheers,
Benno
> +///
> +/// - The macro generates a compile-time assertion for every variant to ensure its
> +/// discriminant value fits within the type being converted into.
> +///
> +/// # Supported types in `#[into(...)]`
> +///
> +/// - [`bool`]
> +/// - Primitive integer types (e.g., [`i8`], [`u8`])
> +/// - [`Bounded`]
> +///
> +/// [`Bounded`]: ../kernel/num/bounded/struct.Bounded.html
^ permalink raw reply [flat|nested] 14+ messages in thread* Re: [PATCH v4 1/4] rust: macros: add derive macro for `Into`
2025-12-25 17:40 ` Benno Lossin
@ 2025-12-26 9:36 ` Jesung Yang
2025-12-27 4:57 ` Benno Lossin
0 siblings, 1 reply; 14+ messages in thread
From: Jesung Yang @ 2025-12-26 9:36 UTC (permalink / raw)
To: Benno Lossin
Cc: Miguel Ojeda, Boqun Feng, Gary Guo, Björn Roy Baron,
Andreas Hindborg, Alice Ryhl, Trevor Gross, Danilo Krummrich,
Alexandre Courbot, linux-kernel, rust-for-linux, nouveau
On Fri, Dec 26, 2025 at 2:40 AM Benno Lossin <lossin@kernel.org> wrote:
>
> On Thu Dec 25, 2025 at 9:37 AM CET, Jesung Yang via B4 Relay wrote:
> > +fn derive(target: DeriveTarget, input: DeriveInput) -> syn::Result<TokenStream> {
> > + let mut errors: Option<syn::Error> = None;
> > + let mut combine_error = |err| match errors.as_mut() {
> > + Some(errors) => errors.combine(err),
> > + None => errors = Some(err),
> > + };
> > +
> > + let (helper_tys, repr_ty) = parse_attrs(target, &input.attrs)?;
> > + for ty in &helper_tys {
> > + if let Err(err) = ty.validate() {
> > + combine_error(err);
> > + }
> > + }
> > +
> > + let data_enum = match input.data {
> > + Data::Enum(data) => data,
> > + Data::Struct(data) => {
> > + let msg = format!(
> > + "expected `enum`, found `struct`; \
> > + `#[derive({})]` can only be applied to a unit-only enum",
> > + target.get_trait_name()
> > + );
> > + return Err(syn::Error::new(data.struct_token.span(), msg));
> > + }
> > + Data::Union(data) => {
> > + let msg = format!(
> > + "expected `enum`, found `union`; \
> > + `#[derive({})]` can only be applied to a unit-only enum",
> > + target.get_trait_name()
> > + );
> > + return Err(syn::Error::new(data.union_token.span(), msg));
> > + }
> > + };
> > +
> > + for variant in &data_enum.variants {
> > + match &variant.fields {
> > + Fields::Named(fields) => {
> > + let msg = format!(
> > + "expected unit-like variant, found struct-like variant; \
> > + `#[derive({})]` can only be applied to a unit-only enum",
> > + target.get_trait_name()
> > + );
> > + combine_error(syn::Error::new_spanned(fields, msg));
> > + }
> > + Fields::Unnamed(fields) => {
> > + let msg = format!(
> > + "expected unit-like variant, found tuple-like variant; \
> > + `#[derive({})]` can only be applied to a unit-only enum",
> > + target.get_trait_name()
> > + );
> > + combine_error(syn::Error::new_spanned(fields, msg));
> > + }
> > + _ => (),
>
> We should be exhaustive here to exclude any future additions (ie break
> the build if a new `Fields::...` variant is added).
You're right, I missed that.
> > + }
> > + }
> > +
> > + if let Some(errors) = errors {
> > + return Err(errors);
> > + }
> > +
> > + let variants: Vec<_> = data_enum
> > + .variants
> > + .into_iter()
> > + .map(|variant| variant.ident)
> > + .collect();
> > +
> > + Ok(derive_for_enum(
> > + target,
> > + &input.ident,
> > + &variants,
> > + &helper_tys,
> > + &repr_ty,
> > + ))
> > +}
> > +
> > +#[derive(Clone, Copy, Debug)]
> > +enum DeriveTarget {
> > + Into,
> > +}
> > +
> > +impl DeriveTarget {
> > + fn get_trait_name(&self) -> &'static str {
> > + match self {
> > + Self::Into => "Into",
> > + }
> > + }
> > +
> > + fn get_helper_name(&self) -> &'static str {
> > + match self {
> > + Self::Into => "into",
> > + }
> > + }
> > +}
> > +
> > +fn parse_attrs(target: DeriveTarget, attrs: &[Attribute]) -> syn::Result<(Vec<ValidTy>, Ident)> {
> > + let helper = target.get_helper_name();
> > +
> > + let mut repr_ty = None;
> > + let mut helper_tys = Vec::new();
> > + for attr in attrs {
> > + if attr.path().is_ident("repr") {
> > + attr.parse_nested_meta(|meta| {
> > + let ident = meta.path.get_ident();
> > + if ident.is_some_and(is_valid_primitive) {
> > + repr_ty = ident.cloned();
> > + }
>
> While this works for now, writing `repr(C, {integer})` might become
> meaningful in the future, see [1]. We should just accept it now as well.
>
> [1]: https://github.com/rust-lang/rust/issues/68585
I think it's worth noting. I'll add a small comment for this.
> > + // Delegate `repr` attribute validation to rustc.
> > + Ok(())
> > + })?;
> > + } else if attr.path().is_ident(helper) && helper_tys.is_empty() {
> > + let args = attr.parse_args_with(Punctuated::<ValidTy, Token![,]>::parse_terminated)?;
> > + helper_tys.extend(args);
> > + }
> > + }
> > +
> > + // Note on field-less `repr(C)` enums (quote from [1]):
> > + //
> > + // In C, enums with discriminants that do not all fit into an `int` or all fit into an
> > + // `unsigned int` are a portability hazard: such enums are only permitted since C23, and not
> > + // supported e.g. by MSVC.
> > + //
> > + // Furthermore, Rust interprets the discriminant values of `repr(C)` enums as expressions of
> > + // type `isize`. This makes it impossible to implement the C23 behavior of enums where the
> > + // enum discriminants have no predefined type and instead the enum uses a type large enough
> > + // to hold all discriminants.
> > + //
> > + // Therefore, `repr(C)` enums in Rust require that either all discriminants to fit into a C
> > + // `int` or they all fit into an `unsigned int`.
> > + //
> > + // As such, `isize` is a reasonable representation for `repr(C)` enums, as it covers the range
> > + // of both `int` and `unsigned int`.
> > + //
> > + // For more information, see:
> > + // - https://github.com/rust-lang/rust/issues/124403
> > + // - https://github.com/rust-lang/rust/pull/147017
> > + // - https://github.com/rust-lang/rust/blob/2ca7bcd03b87b52f7055a59b817443b0ac4a530d/compiler/rustc_lint_defs/src/builtin.rs#L5251-L5263 [1]
> > +
> > + // Extract the representation passed by `#[repr(...)]` if present. If nothing is
> > + // specified, the default is `Rust` representation, which uses `isize` for its
> > + // discriminant type.
> > + // See: https://doc.rust-lang.org/reference/items/enumerations.html#r-items.enum.discriminant.repr-rust
>
> I think we should error when no `#[repr({integer})]` attribute is
> specified.
Not a blocker but just out of curiosity: are you concerned that the
default size might change in the future, leading to silent side
effects?
> > + let repr_ty = repr_ty.unwrap_or_else(|| Ident::new("isize", Span::call_site()));
> > + Ok((helper_tys, repr_ty))
> > +}
> > +
> > +fn derive_for_enum(
> > + target: DeriveTarget,
> > + enum_ident: &Ident,
> > + variants: &[Ident],
> > + helper_tys: &[ValidTy],
> > + repr_ty: &Ident,
> > +) -> TokenStream {
> > + let impl_fn = match target {
> > + DeriveTarget::Into => impl_into,
> > + };
> > +
> > + let qualified_repr_ty: syn::Path = parse_quote! { ::core::primitive::#repr_ty };
> > +
> > + return if helper_tys.is_empty() {
> > + let ty = ValidTy::Primitive(repr_ty.clone());
> > + let impls =
> > + std::iter::once(ty).map(|ty| impl_fn(enum_ident, variants, &qualified_repr_ty, &ty));
> > + ::quote::quote! { #(#impls)* }
> > + } else {
> > + let impls = helper_tys
> > + .iter()
> > + .map(|ty| impl_fn(enum_ident, variants, &qualified_repr_ty, ty));
> > + ::quote::quote! { #(#impls)* }
> > + };
>
> Let's just do this when we still have the `helper_tys` vector:
>
> helper_tys.push(ValidTy::Primitive(repr_ty));
The current implementation completely ignores what's in `#[repr(...)]`
when the `#[into(...)]` or `#[try_from(...)]` helper attributes are
specified. But users might expect, as you did, the macros to generate
impls not only for types specified in the helper attributes but also
for the one in `repr`. I think I should deduplicate `helper_tys` after
the push, but anyway, I'll change this in v5.
> > +
> > + fn impl_into(
> > + enum_ident: &Ident,
> > + variants: &[Ident],
> > + repr_ty: &syn::Path,
> > + input_ty: &ValidTy,
> > + ) -> TokenStream {
> > + let param = Ident::new("value", Span::call_site());
> > +
> > + let overflow_assertion = emit_overflow_assert(enum_ident, variants, repr_ty, input_ty);
> > + let cast = match input_ty {
> > + ValidTy::Bounded(inner) => {
> > + let base_ty = inner.emit_qualified_base_ty();
> > + let expr = parse_quote! { #param as #base_ty };
> > + // Since the discriminant of `#param`, an enum variant, is determined
> > + // at compile-time, we can rely on `Bounded::from_expr()`. It requires
> > + // the provided expression to be verifiable at compile-time to avoid
> > + // triggering a build error.
> > + inner.emit_from_expr(&expr)
> > + }
> > + ValidTy::Primitive(ident) if ident == "bool" => {
> > + ::quote::quote! { (#param as #repr_ty) == 1 }
> > + }
> > + qualified @ ValidTy::Primitive(_) => ::quote::quote! { #param as #qualified },
> > + };
> > +
> > + ::quote::quote! {
> > + #[automatically_derived]
> > + impl ::core::convert::From<#enum_ident> for #input_ty {
> > + fn from(#param: #enum_ident) -> #input_ty {
> > + #overflow_assertion
> > +
> > + #cast
> > + }
> > + }
> > + }
> > + }
> > +
> > + fn emit_overflow_assert(
> > + enum_ident: &Ident,
> > + variants: &[Ident],
> > + repr_ty: &syn::Path,
> > + input_ty: &ValidTy,
> > + ) -> TokenStream {
>
> I feel like we should track this via traits rather than using a const
> assert. That approach will require & generate much less code.
Sorry, but could you elaborate? A small example of what you have in
mind would help a lot.
> > + let qualified_i128: syn::Path = parse_quote! { ::core::primitive::i128 };
> > + let qualified_u128: syn::Path = parse_quote! { ::core::primitive::u128 };
> > +
> > + let input_min = input_ty.emit_min();
> > + let input_max = input_ty.emit_max();
> > +
> > + let variant_fits = variants.iter().map(|variant| {
> > + let msg = format!(
> > + "enum discriminant overflow: \
> > + `{enum_ident}::{variant}` does not fit in `{input_ty}`",
> > + );
> > + ::quote::quote! {
> > + ::core::assert!(fits(#enum_ident::#variant as #repr_ty), #msg);
> > + }
> > + });
> > +
> > + ::quote::quote! {
> > + const _: () = {
> > + const fn fits(d: #repr_ty) -> ::core::primitive::bool {
> > + // For every integer type, its minimum value always fits in `i128`.
> > + let dst_min = #input_min;
> > + // For every integer type, its maximum value always fits in `u128`.
> > + let dst_max = #input_max;
> > +
> > + #[allow(unused_comparisons)]
> > + let is_src_signed = #repr_ty::MIN < 0;
> > + #[allow(unused_comparisons)]
> > + let is_dst_signed = dst_min < 0;
> > +
> > + if is_src_signed && is_dst_signed {
> > + // Casting from a signed value to `i128` does not overflow since
> > + // `i128` is the largest signed primitive integer type.
> > + (d as #qualified_i128) >= (dst_min as #qualified_i128)
> > + && (d as #qualified_i128) <= (dst_max as #qualified_i128)
> > + } else if is_src_signed && !is_dst_signed {
> > + // Casting from a signed value greater than 0 to `u128` does not
> > + // overflow since `u128::MAX` is greater than `i128::MAX`.
> > + d >= 0 && (d as #qualified_u128) <= (dst_max as #qualified_u128)
> > + } else {
> > + // Casting from an unsigned value to `u128` does not overflow since
> > + // `u128` is the largest unsigned primitive integer type.
> > + (d as #qualified_u128) <= (dst_max as #qualified_u128)
> > + }
> > + }
> > +
> > + #(#variant_fits)*
> > + };
> > + }
> > + }
> > +}
>
> > +
> > +impl fmt::Display for ValidTy {
> > + fn fmt(&self, f: &mut fmt::Formatter<'_>) -> fmt::Result {
> > + match self {
> > + Self::Bounded(inner) => inner.fmt(f),
> > + Self::Primitive(ident) => ident.fmt(f),
> > + }
> > + }
> > +}
> > +
> > +struct Bounded {
> > + name: Ident,
> > + open_angle: Token![<],
> > + base_ty: Ident,
>
> We should allow a type here from syntax and then emit an error when it
> isn't a primitive.
Assuming you're talking about `syn::Type`, that seems better. I think I
should do the same thing for `ValidTy::Primitive`.
> > + comma: Token![,],
> > + bits: LitInt,
> > + close_angle: Token![>],
> > +}
>
> > diff --git a/rust/macros/lib.rs b/rust/macros/lib.rs
> > index b38002151871a33f6b4efea70be2deb6ddad38e2..02528d7212b75d28788f0c33479edb272fa12e27 100644
> > --- a/rust/macros/lib.rs
> > +++ b/rust/macros/lib.rs
> > @@ -14,6 +14,7 @@
> > #[macro_use]
> > mod quote;
> > mod concat_idents;
> > +mod convert;
> > mod export;
> > mod fmt;
> > mod helpers;
> > @@ -23,6 +24,10 @@
> > mod vtable;
> >
> > use proc_macro::TokenStream;
> > +use syn::{
> > + parse_macro_input,
> > + DeriveInput, //
> > +};
> >
> > /// Declares a kernel module.
> > ///
> > @@ -475,3 +480,155 @@ pub fn paste(input: TokenStream) -> TokenStream {
> > pub fn kunit_tests(attr: TokenStream, ts: TokenStream) -> TokenStream {
> > kunit::kunit_tests(attr, ts)
> > }
> > +
> > +/// A derive macro for providing an implementation of the [`Into`] trait.
> > +///
> > +/// This macro automatically derives the [`Into`] trait for a given enum by generating
> > +/// the relevant [`From`] implementation. Currently, it only supports [unit-only enum]s.
> > +///
> > +/// [unit-only enum]: https://doc.rust-lang.org/reference/items/enumerations.html#r-items.enum.unit-only
> > +///
> > +/// # Notes
> > +///
> > +/// - Unlike its name suggests, the macro actually generates [`From`] implementations
> > +/// which automatically provide corresponding [`Into`] implementations.
> > +///
> > +/// - The macro uses the `into` custom attribute or `repr` attribute to generate [`From`]
> > +/// implementations. `into` always takes precedence over `repr`.
>
> What do you mean by "precedence" here? You always generate it for all
> helper_tys and the repr?
To quote my reply above:
The current implementation completely ignores what's in
`#[repr(...)]` when the `#[into(...)]` or `#[try_from(...)]` helper
attributes are specified.
That's why I used the term "precedence." But as I said, I'll change the
logic to generate impls for both.
Thanks a lot for the time and effort you put into reviewing it!
Best regards,
Jesung
^ permalink raw reply [flat|nested] 14+ messages in thread* Re: [PATCH v4 1/4] rust: macros: add derive macro for `Into`
2025-12-26 9:36 ` Jesung Yang
@ 2025-12-27 4:57 ` Benno Lossin
2025-12-27 10:45 ` Jesung Yang
2025-12-29 12:29 ` Jesung Yang
0 siblings, 2 replies; 14+ messages in thread
From: Benno Lossin @ 2025-12-27 4:57 UTC (permalink / raw)
To: Jesung Yang
Cc: Miguel Ojeda, Boqun Feng, Gary Guo, Björn Roy Baron,
Andreas Hindborg, Alice Ryhl, Trevor Gross, Danilo Krummrich,
Alexandre Courbot, linux-kernel, rust-for-linux, nouveau
On Fri Dec 26, 2025 at 10:36 AM CET, Jesung Yang wrote:
> On Fri, Dec 26, 2025 at 2:40 AM Benno Lossin <lossin@kernel.org> wrote:
>> On Thu Dec 25, 2025 at 9:37 AM CET, Jesung Yang via B4 Relay wrote:
>> > +fn parse_attrs(target: DeriveTarget, attrs: &[Attribute]) -> syn::Result<(Vec<ValidTy>, Ident)> {
>> > + let helper = target.get_helper_name();
>> > +
>> > + let mut repr_ty = None;
>> > + let mut helper_tys = Vec::new();
>> > + for attr in attrs {
>> > + if attr.path().is_ident("repr") {
>> > + attr.parse_nested_meta(|meta| {
>> > + let ident = meta.path.get_ident();
>> > + if ident.is_some_and(is_valid_primitive) {
>> > + repr_ty = ident.cloned();
>> > + }
>>
>> While this works for now, writing `repr(C, {integer})` might become
>> meaningful in the future, see [1]. We should just accept it now as well.
>>
>> [1]: https://github.com/rust-lang/rust/issues/68585
>
> I think it's worth noting. I'll add a small comment for this.
My suggestion was to just accept `repr(C, {integer})` and make it result
in the same as `repr({integer})`.
>> > + // Delegate `repr` attribute validation to rustc.
>> > + Ok(())
>> > + })?;
>> > + } else if attr.path().is_ident(helper) && helper_tys.is_empty() {
>> > + let args = attr.parse_args_with(Punctuated::<ValidTy, Token![,]>::parse_terminated)?;
>> > + helper_tys.extend(args);
>> > + }
>> > + }
>> > +
>> > + // Note on field-less `repr(C)` enums (quote from [1]):
>> > + //
>> > + // In C, enums with discriminants that do not all fit into an `int` or all fit into an
>> > + // `unsigned int` are a portability hazard: such enums are only permitted since C23, and not
>> > + // supported e.g. by MSVC.
>> > + //
>> > + // Furthermore, Rust interprets the discriminant values of `repr(C)` enums as expressions of
>> > + // type `isize`. This makes it impossible to implement the C23 behavior of enums where the
>> > + // enum discriminants have no predefined type and instead the enum uses a type large enough
>> > + // to hold all discriminants.
>> > + //
>> > + // Therefore, `repr(C)` enums in Rust require that either all discriminants to fit into a C
>> > + // `int` or they all fit into an `unsigned int`.
>> > + //
>> > + // As such, `isize` is a reasonable representation for `repr(C)` enums, as it covers the range
>> > + // of both `int` and `unsigned int`.
>> > + //
>> > + // For more information, see:
>> > + // - https://github.com/rust-lang/rust/issues/124403
>> > + // - https://github.com/rust-lang/rust/pull/147017
>> > + // - https://github.com/rust-lang/rust/blob/2ca7bcd03b87b52f7055a59b817443b0ac4a530d/compiler/rustc_lint_defs/src/builtin.rs#L5251-L5263 [1]
>> > +
>> > + // Extract the representation passed by `#[repr(...)]` if present. If nothing is
>> > + // specified, the default is `Rust` representation, which uses `isize` for its
>> > + // discriminant type.
>> > + // See: https://doc.rust-lang.org/reference/items/enumerations.html#r-items.enum.discriminant.repr-rust
>>
>> I think we should error when no `#[repr({integer})]` attribute is
>> specified.
>
> Not a blocker but just out of curiosity: are you concerned that the
> default size might change in the future, leading to silent side
> effects?
`isize` already changes size when you switch between 64 and 32 bit
architectures. I think the author of an enum they want to convert into
integers should think about which size the enum should be.
They already can choose `repr(isize)` if that is correct in that case.
As a default, I would have choosen `i32` (but that conflicts with Rust's
default, so we can't do it).
>> > + let repr_ty = repr_ty.unwrap_or_else(|| Ident::new("isize", Span::call_site()));
>> > + Ok((helper_tys, repr_ty))
>> > +}
>> > +
>> > +fn derive_for_enum(
>> > + target: DeriveTarget,
>> > + enum_ident: &Ident,
>> > + variants: &[Ident],
>> > + helper_tys: &[ValidTy],
>> > + repr_ty: &Ident,
>> > +) -> TokenStream {
>> > + let impl_fn = match target {
>> > + DeriveTarget::Into => impl_into,
>> > + };
>> > +
>> > + let qualified_repr_ty: syn::Path = parse_quote! { ::core::primitive::#repr_ty };
>> > +
>> > + return if helper_tys.is_empty() {
>> > + let ty = ValidTy::Primitive(repr_ty.clone());
>> > + let impls =
>> > + std::iter::once(ty).map(|ty| impl_fn(enum_ident, variants, &qualified_repr_ty, &ty));
>> > + ::quote::quote! { #(#impls)* }
>> > + } else {
>> > + let impls = helper_tys
>> > + .iter()
>> > + .map(|ty| impl_fn(enum_ident, variants, &qualified_repr_ty, ty));
>> > + ::quote::quote! { #(#impls)* }
>> > + };
>>
>> Let's just do this when we still have the `helper_tys` vector:
>>
>> helper_tys.push(ValidTy::Primitive(repr_ty));
>
> The current implementation completely ignores what's in `#[repr(...)]`
> when the `#[into(...)]` or `#[try_from(...)]` helper attributes are
> specified. But users might expect, as you did, the macros to generate
> impls not only for types specified in the helper attributes but also
> for the one in `repr`. I think I should deduplicate `helper_tys` after
> the push, but anyway, I'll change this in v5.
Oh yeah I missed this, please do make this change :)
>> > +
>> > + fn impl_into(
>> > + enum_ident: &Ident,
>> > + variants: &[Ident],
>> > + repr_ty: &syn::Path,
>> > + input_ty: &ValidTy,
>> > + ) -> TokenStream {
>> > + let param = Ident::new("value", Span::call_site());
>> > +
>> > + let overflow_assertion = emit_overflow_assert(enum_ident, variants, repr_ty, input_ty);
>> > + let cast = match input_ty {
>> > + ValidTy::Bounded(inner) => {
>> > + let base_ty = inner.emit_qualified_base_ty();
>> > + let expr = parse_quote! { #param as #base_ty };
>> > + // Since the discriminant of `#param`, an enum variant, is determined
>> > + // at compile-time, we can rely on `Bounded::from_expr()`. It requires
>> > + // the provided expression to be verifiable at compile-time to avoid
>> > + // triggering a build error.
>> > + inner.emit_from_expr(&expr)
>> > + }
>> > + ValidTy::Primitive(ident) if ident == "bool" => {
>> > + ::quote::quote! { (#param as #repr_ty) == 1 }
>> > + }
>> > + qualified @ ValidTy::Primitive(_) => ::quote::quote! { #param as #qualified },
>> > + };
>> > +
>> > + ::quote::quote! {
>> > + #[automatically_derived]
>> > + impl ::core::convert::From<#enum_ident> for #input_ty {
>> > + fn from(#param: #enum_ident) -> #input_ty {
>> > + #overflow_assertion
>> > +
>> > + #cast
>> > + }
>> > + }
>> > + }
>> > + }
>> > +
>> > + fn emit_overflow_assert(
>> > + enum_ident: &Ident,
>> > + variants: &[Ident],
>> > + repr_ty: &syn::Path,
>> > + input_ty: &ValidTy,
>> > + ) -> TokenStream {
>>
>> I feel like we should track this via traits rather than using a const
>> assert. That approach will require & generate much less code.
>
> Sorry, but could you elaborate? A small example of what you have in
> mind would help a lot.
Oh yeah sorry, I had something different in mind compared to what I'll
describe now, but it achieves the same thing without introducing new
traits:
We have two options:
1) We use `<input_ty as TryFrom<repr_ty>>::try_from` instead of writing
the `fits` function ourself.
2) We require `input_ty: From<repr_ty>`.
The first option would still check every variant and should behave the
same as your current code.
Option 2 allows us to avoid the const altogether, but requires us to
choose the smallest integer as the representation (and if we want to be
able to use both `i8` and `u8`, we can't). I missed this before, so
using option 1 might be the only way to allow conversions of this kind.
>> > + let qualified_i128: syn::Path = parse_quote! { ::core::primitive::i128 };
>> > + let qualified_u128: syn::Path = parse_quote! { ::core::primitive::u128 };
>> > +
>> > + let input_min = input_ty.emit_min();
>> > + let input_max = input_ty.emit_max();
>> > +
>> > + let variant_fits = variants.iter().map(|variant| {
>> > + let msg = format!(
>> > + "enum discriminant overflow: \
>> > + `{enum_ident}::{variant}` does not fit in `{input_ty}`",
>> > + );
>> > + ::quote::quote! {
>> > + ::core::assert!(fits(#enum_ident::#variant as #repr_ty), #msg);
>> > + }
>> > + });
>> > +
>> > + ::quote::quote! {
>> > + const _: () = {
>> > + const fn fits(d: #repr_ty) -> ::core::primitive::bool {
>> > + // For every integer type, its minimum value always fits in `i128`.
>> > + let dst_min = #input_min;
>> > + // For every integer type, its maximum value always fits in `u128`.
>> > + let dst_max = #input_max;
>> > +
>> > + #[allow(unused_comparisons)]
>> > + let is_src_signed = #repr_ty::MIN < 0;
>> > + #[allow(unused_comparisons)]
>> > + let is_dst_signed = dst_min < 0;
>> > +
>> > + if is_src_signed && is_dst_signed {
>> > + // Casting from a signed value to `i128` does not overflow since
>> > + // `i128` is the largest signed primitive integer type.
>> > + (d as #qualified_i128) >= (dst_min as #qualified_i128)
>> > + && (d as #qualified_i128) <= (dst_max as #qualified_i128)
>> > + } else if is_src_signed && !is_dst_signed {
>> > + // Casting from a signed value greater than 0 to `u128` does not
>> > + // overflow since `u128::MAX` is greater than `i128::MAX`.
>> > + d >= 0 && (d as #qualified_u128) <= (dst_max as #qualified_u128)
>> > + } else {
>> > + // Casting from an unsigned value to `u128` does not overflow since
>> > + // `u128` is the largest unsigned primitive integer type.
>> > + (d as #qualified_u128) <= (dst_max as #qualified_u128)
>> > + }
>> > + }
>> > +
>> > + #(#variant_fits)*
>> > + };
>> > + }
>> > + }
>> > +}
>>
>> > +
>> > +impl fmt::Display for ValidTy {
>> > + fn fmt(&self, f: &mut fmt::Formatter<'_>) -> fmt::Result {
>> > + match self {
>> > + Self::Bounded(inner) => inner.fmt(f),
>> > + Self::Primitive(ident) => ident.fmt(f),
>> > + }
>> > + }
>> > +}
>> > +
>> > +struct Bounded {
>> > + name: Ident,
>> > + open_angle: Token![<],
>> > + base_ty: Ident,
>>
>> We should allow a type here from syntax and then emit an error when it
>> isn't a primitive.
>
> Assuming you're talking about `syn::Type`, that seems better. I think I
> should do the same thing for `ValidTy::Primitive`.
Sounds good!
>> > + comma: Token![,],
>> > + bits: LitInt,
>> > + close_angle: Token![>],
>> > +}
>>
>> > diff --git a/rust/macros/lib.rs b/rust/macros/lib.rs
>> > index b38002151871a33f6b4efea70be2deb6ddad38e2..02528d7212b75d28788f0c33479edb272fa12e27 100644
>> > --- a/rust/macros/lib.rs
>> > +++ b/rust/macros/lib.rs
>> > @@ -14,6 +14,7 @@
>> > #[macro_use]
>> > mod quote;
>> > mod concat_idents;
>> > +mod convert;
>> > mod export;
>> > mod fmt;
>> > mod helpers;
>> > @@ -23,6 +24,10 @@
>> > mod vtable;
>> >
>> > use proc_macro::TokenStream;
>> > +use syn::{
>> > + parse_macro_input,
>> > + DeriveInput, //
>> > +};
>> >
>> > /// Declares a kernel module.
>> > ///
>> > @@ -475,3 +480,155 @@ pub fn paste(input: TokenStream) -> TokenStream {
>> > pub fn kunit_tests(attr: TokenStream, ts: TokenStream) -> TokenStream {
>> > kunit::kunit_tests(attr, ts)
>> > }
>> > +
>> > +/// A derive macro for providing an implementation of the [`Into`] trait.
>> > +///
>> > +/// This macro automatically derives the [`Into`] trait for a given enum by generating
>> > +/// the relevant [`From`] implementation. Currently, it only supports [unit-only enum]s.
>> > +///
>> > +/// [unit-only enum]: https://doc.rust-lang.org/reference/items/enumerations.html#r-items.enum.unit-only
>> > +///
>> > +/// # Notes
>> > +///
>> > +/// - Unlike its name suggests, the macro actually generates [`From`] implementations
>> > +/// which automatically provide corresponding [`Into`] implementations.
>> > +///
>> > +/// - The macro uses the `into` custom attribute or `repr` attribute to generate [`From`]
>> > +/// implementations. `into` always takes precedence over `repr`.
>>
>> What do you mean by "precedence" here? You always generate it for all
>> helper_tys and the repr?
>
> To quote my reply above:
>
> The current implementation completely ignores what's in
> `#[repr(...)]` when the `#[into(...)]` or `#[try_from(...)]` helper
> attributes are specified.
>
> That's why I used the term "precedence." But as I said, I'll change the
> logic to generate impls for both.
Oh yeah now it makes sense :)
> Thanks a lot for the time and effort you put into reviewing it!
My pleasure :)
Cheers,
Benno
^ permalink raw reply [flat|nested] 14+ messages in thread* Re: [PATCH v4 1/4] rust: macros: add derive macro for `Into`
2025-12-27 4:57 ` Benno Lossin
@ 2025-12-27 10:45 ` Jesung Yang
2025-12-27 22:25 ` Benno Lossin
2025-12-29 12:29 ` Jesung Yang
1 sibling, 1 reply; 14+ messages in thread
From: Jesung Yang @ 2025-12-27 10:45 UTC (permalink / raw)
To: Benno Lossin
Cc: Miguel Ojeda, Boqun Feng, Gary Guo, Björn Roy Baron,
Andreas Hindborg, Alice Ryhl, Trevor Gross, Danilo Krummrich,
Alexandre Courbot, linux-kernel, rust-for-linux, nouveau
On Sat, Dec 27, 2025 at 1:57 PM Benno Lossin <lossin@kernel.org> wrote:
> On Fri Dec 26, 2025 at 10:36 AM CET, Jesung Yang wrote:
> > On Fri, Dec 26, 2025 at 2:40 AM Benno Lossin <lossin@kernel.org> wrote:
> >> On Thu Dec 25, 2025 at 9:37 AM CET, Jesung Yang via B4 Relay wrote:
> >> > +fn parse_attrs(target: DeriveTarget, attrs: &[Attribute]) -> syn::Result<(Vec<ValidTy>, Ident)> {
> >> > + let helper = target.get_helper_name();
> >> > +
> >> > + let mut repr_ty = None;
> >> > + let mut helper_tys = Vec::new();
> >> > + for attr in attrs {
> >> > + if attr.path().is_ident("repr") {
> >> > + attr.parse_nested_meta(|meta| {
> >> > + let ident = meta.path.get_ident();
> >> > + if ident.is_some_and(is_valid_primitive) {
> >> > + repr_ty = ident.cloned();
> >> > + }
> >>
> >> While this works for now, writing `repr(C, {integer})` might become
> >> meaningful in the future, see [1]. We should just accept it now as well.
> >>
> >> [1]: https://github.com/rust-lang/rust/issues/68585
> >
> > I think it's worth noting. I'll add a small comment for this.
>
> My suggestion was to just accept `repr(C, {integer})` and make it result
> in the same as `repr({integer})`.
Ah I misread that. Thanks for the clarification.
> >> > + // Delegate `repr` attribute validation to rustc.
> >> > + Ok(())
> >> > + })?;
> >> > + } else if attr.path().is_ident(helper) && helper_tys.is_empty() {
> >> > + let args = attr.parse_args_with(Punctuated::<ValidTy, Token![,]>::parse_terminated)?;
> >> > + helper_tys.extend(args);
> >> > + }
> >> > + }
> >> > +
> >> > + // Note on field-less `repr(C)` enums (quote from [1]):
> >> > + //
> >> > + // In C, enums with discriminants that do not all fit into an `int` or all fit into an
> >> > + // `unsigned int` are a portability hazard: such enums are only permitted since C23, and not
> >> > + // supported e.g. by MSVC.
> >> > + //
> >> > + // Furthermore, Rust interprets the discriminant values of `repr(C)` enums as expressions of
> >> > + // type `isize`. This makes it impossible to implement the C23 behavior of enums where the
> >> > + // enum discriminants have no predefined type and instead the enum uses a type large enough
> >> > + // to hold all discriminants.
> >> > + //
> >> > + // Therefore, `repr(C)` enums in Rust require that either all discriminants to fit into a C
> >> > + // `int` or they all fit into an `unsigned int`.
> >> > + //
> >> > + // As such, `isize` is a reasonable representation for `repr(C)` enums, as it covers the range
> >> > + // of both `int` and `unsigned int`.
> >> > + //
> >> > + // For more information, see:
> >> > + // - https://github.com/rust-lang/rust/issues/124403
> >> > + // - https://github.com/rust-lang/rust/pull/147017
> >> > + // - https://github.com/rust-lang/rust/blob/2ca7bcd03b87b52f7055a59b817443b0ac4a530d/compiler/rustc_lint_defs/src/builtin.rs#L5251-L5263 [1]
> >> > +
> >> > + // Extract the representation passed by `#[repr(...)]` if present. If nothing is
> >> > + // specified, the default is `Rust` representation, which uses `isize` for its
> >> > + // discriminant type.
> >> > + // See: https://doc.rust-lang.org/reference/items/enumerations.html#r-items.enum.discriminant.repr-rust
> >>
> >> I think we should error when no `#[repr({integer})]` attribute is
> >> specified.
> >
> > Not a blocker but just out of curiosity: are you concerned that the
> > default size might change in the future, leading to silent side
> > effects?
>
> `isize` already changes size when you switch between 64 and 32 bit
> architectures. I think the author of an enum they want to convert into
> integers should think about which size the enum should be.
>
> They already can choose `repr(isize)` if that is correct in that case.
> As a default, I would have choosen `i32` (but that conflicts with Rust's
> default, so we can't do it).
Makes sense, that seems better.
> >> > + fn impl_into(
> >> > + enum_ident: &Ident,
> >> > + variants: &[Ident],
> >> > + repr_ty: &syn::Path,
> >> > + input_ty: &ValidTy,
> >> > + ) -> TokenStream {
> >> > + let param = Ident::new("value", Span::call_site());
> >> > +
> >> > + let overflow_assertion = emit_overflow_assert(enum_ident, variants, repr_ty, input_ty);
> >> > + let cast = match input_ty {
> >> > + ValidTy::Bounded(inner) => {
> >> > + let base_ty = inner.emit_qualified_base_ty();
> >> > + let expr = parse_quote! { #param as #base_ty };
> >> > + // Since the discriminant of `#param`, an enum variant, is determined
> >> > + // at compile-time, we can rely on `Bounded::from_expr()`. It requires
> >> > + // the provided expression to be verifiable at compile-time to avoid
> >> > + // triggering a build error.
> >> > + inner.emit_from_expr(&expr)
> >> > + }
> >> > + ValidTy::Primitive(ident) if ident == "bool" => {
> >> > + ::quote::quote! { (#param as #repr_ty) == 1 }
> >> > + }
> >> > + qualified @ ValidTy::Primitive(_) => ::quote::quote! { #param as #qualified },
> >> > + };
> >> > +
> >> > + ::quote::quote! {
> >> > + #[automatically_derived]
> >> > + impl ::core::convert::From<#enum_ident> for #input_ty {
> >> > + fn from(#param: #enum_ident) -> #input_ty {
> >> > + #overflow_assertion
> >> > +
> >> > + #cast
> >> > + }
> >> > + }
> >> > + }
> >> > + }
> >> > +
> >> > + fn emit_overflow_assert(
> >> > + enum_ident: &Ident,
> >> > + variants: &[Ident],
> >> > + repr_ty: &syn::Path,
> >> > + input_ty: &ValidTy,
> >> > + ) -> TokenStream {
> >>
> >> I feel like we should track this via traits rather than using a const
> >> assert. That approach will require & generate much less code.
> >
> > Sorry, but could you elaborate? A small example of what you have in
> > mind would help a lot.
>
> Oh yeah sorry, I had something different in mind compared to what I'll
> describe now, but it achieves the same thing without introducing new
> traits:
>
> We have two options:
> 1) We use `<input_ty as TryFrom<repr_ty>>::try_from` instead of writing
> the `fits` function ourself.
> 2) We require `input_ty: From<repr_ty>`.
>
> The first option would still check every variant and should behave the
> same as your current code.
>
> Option 2 allows us to avoid the const altogether, but requires us to
> choose the smallest integer as the representation (and if we want to be
> able to use both `i8` and `u8`, we can't). I missed this before, so
> using option 1 might be the only way to allow conversions of this kind.
AFAIK, `<input_ty as TryFrom<repr_ty>>::try_from` cannot be called in
const contexts without `#![feature(const_trait_impl, const_convert)]`.
I assume we want to keep this validation at compile-time? If so, we
might need to stick with the custom `fits` check for now. Please let me
know if I misunderstood you.
Best regards,
Jesung
^ permalink raw reply [flat|nested] 14+ messages in thread* Re: [PATCH v4 1/4] rust: macros: add derive macro for `Into`
2025-12-27 10:45 ` Jesung Yang
@ 2025-12-27 22:25 ` Benno Lossin
0 siblings, 0 replies; 14+ messages in thread
From: Benno Lossin @ 2025-12-27 22:25 UTC (permalink / raw)
To: Jesung Yang
Cc: Miguel Ojeda, Boqun Feng, Gary Guo, Björn Roy Baron,
Andreas Hindborg, Alice Ryhl, Trevor Gross, Danilo Krummrich,
Alexandre Courbot, linux-kernel, rust-for-linux, nouveau
On Sat Dec 27, 2025 at 11:45 AM CET, Jesung Yang wrote:
> On Sat, Dec 27, 2025 at 1:57 PM Benno Lossin <lossin@kernel.org> wrote:
>> On Fri Dec 26, 2025 at 10:36 AM CET, Jesung Yang wrote:
>> > On Fri, Dec 26, 2025 at 2:40 AM Benno Lossin <lossin@kernel.org> wrote:
>> >> On Thu Dec 25, 2025 at 9:37 AM CET, Jesung Yang via B4 Relay wrote:
>> >> > + fn emit_overflow_assert(
>> >> > + enum_ident: &Ident,
>> >> > + variants: &[Ident],
>> >> > + repr_ty: &syn::Path,
>> >> > + input_ty: &ValidTy,
>> >> > + ) -> TokenStream {
>> >>
>> >> I feel like we should track this via traits rather than using a const
>> >> assert. That approach will require & generate much less code.
>> >
>> > Sorry, but could you elaborate? A small example of what you have in
>> > mind would help a lot.
>>
>> Oh yeah sorry, I had something different in mind compared to what I'll
>> describe now, but it achieves the same thing without introducing new
>> traits:
>>
>> We have two options:
>> 1) We use `<input_ty as TryFrom<repr_ty>>::try_from` instead of writing
>> the `fits` function ourself.
>> 2) We require `input_ty: From<repr_ty>`.
>>
>> The first option would still check every variant and should behave the
>> same as your current code.
>>
>> Option 2 allows us to avoid the const altogether, but requires us to
>> choose the smallest integer as the representation (and if we want to be
>> able to use both `i8` and `u8`, we can't). I missed this before, so
>> using option 1 might be the only way to allow conversions of this kind.
>
> AFAIK, `<input_ty as TryFrom<repr_ty>>::try_from` cannot be called in
> const contexts without `#![feature(const_trait_impl, const_convert)]`.
> I assume we want to keep this validation at compile-time? If so, we
> might need to stick with the custom `fits` check for now. Please let me
> know if I misunderstood you.
Oh yeah that doesn't work (yet) :(
I'll take another look at the function itself then.
Cheers,
Benno
^ permalink raw reply [flat|nested] 14+ messages in thread
* Re: [PATCH v4 1/4] rust: macros: add derive macro for `Into`
2025-12-27 4:57 ` Benno Lossin
2025-12-27 10:45 ` Jesung Yang
@ 2025-12-29 12:29 ` Jesung Yang
2025-12-30 9:09 ` Benno Lossin
1 sibling, 1 reply; 14+ messages in thread
From: Jesung Yang @ 2025-12-29 12:29 UTC (permalink / raw)
To: Benno Lossin
Cc: Miguel Ojeda, Boqun Feng, Gary Guo, Björn Roy Baron,
Andreas Hindborg, Alice Ryhl, Trevor Gross, Danilo Krummrich,
Alexandre Courbot, linux-kernel, rust-for-linux, nouveau
On Sat, Dec 27, 2025 at 1:57 PM Benno Lossin <lossin@kernel.org> wrote:
> On Fri Dec 26, 2025 at 10:36 AM CET, Jesung Yang wrote:
> > On Fri, Dec 26, 2025 at 2:40 AM Benno Lossin <lossin@kernel.org> wrote:
> >> On Thu Dec 25, 2025 at 9:37 AM CET, Jesung Yang via B4 Relay wrote:
[...]
> >> > + // Note on field-less `repr(C)` enums (quote from [1]):
> >> > + //
> >> > + // In C, enums with discriminants that do not all fit into an `int` or all fit into an
> >> > + // `unsigned int` are a portability hazard: such enums are only permitted since C23, and not
> >> > + // supported e.g. by MSVC.
> >> > + //
> >> > + // Furthermore, Rust interprets the discriminant values of `repr(C)` enums as expressions of
> >> > + // type `isize`. This makes it impossible to implement the C23 behavior of enums where the
> >> > + // enum discriminants have no predefined type and instead the enum uses a type large enough
> >> > + // to hold all discriminants.
> >> > + //
> >> > + // Therefore, `repr(C)` enums in Rust require that either all discriminants to fit into a C
> >> > + // `int` or they all fit into an `unsigned int`.
> >> > + //
> >> > + // As such, `isize` is a reasonable representation for `repr(C)` enums, as it covers the range
> >> > + // of both `int` and `unsigned int`.
> >> > + //
> >> > + // For more information, see:
> >> > + // - https://github.com/rust-lang/rust/issues/124403
> >> > + // - https://github.com/rust-lang/rust/pull/147017
> >> > + // - https://github.com/rust-lang/rust/blob/2ca7bcd03b87b52f7055a59b817443b0ac4a530d/compiler/rustc_lint_defs/src/builtin.rs#L5251-L5263 [1]
> >> > +
> >> > + // Extract the representation passed by `#[repr(...)]` if present. If nothing is
> >> > + // specified, the default is `Rust` representation, which uses `isize` for its
> >> > + // discriminant type.
> >> > + // See: https://doc.rust-lang.org/reference/items/enumerations.html#r-items.enum.discriminant.repr-rust
> >>
> >> I think we should error when no `#[repr({integer})]` attribute is
> >> specified.
> >
> > Not a blocker but just out of curiosity: are you concerned that the
> > default size might change in the future, leading to silent side
> > effects?
>
> `isize` already changes size when you switch between 64 and 32 bit
> architectures. I think the author of an enum they want to convert into
> integers should think about which size the enum should be.
>
> They already can choose `repr(isize)` if that is correct in that case.
> As a default, I would have choosen `i32` (but that conflicts with Rust's
> default, so we can't do it).
On second thought, I've realized that enforcing an error when
`#[repr({integer})]` is missing would prevent users from deriving
traits for `#[repr(C)]` enums. This is because rustc currently rejects
the combined `#[repr(C, {integer})]` syntax. For example, a user might
want to do this:
#[derive(Into)]
#[into(u8)]
#[repr(C)]
enum Foo {
A,
B,
}
In this case, the code wouldn't compile if we strictly require
`#[repr({integer})]`, even if the user carefully picked `u8`, keeping
the enum's size (more precisely, the discriminant range) in mind.
Since we already perform a compile-time check to ensure all
discriminants fit within the types specified in the helper attributes,
I believe `#[repr({integer})]` isn't strictly required. Even with
`isize` changing size across architectures, our compile-time check
remains effective and will catch any overflows.
To sum up, I see three options:
1. Drop support for `#[repr(C)]` enums entirely.
2. Special-case `#[repr(C)]` enums: allow them to default to
`isize`, otherwise require `#[repr({integer})]`.
3. Permit missing `#[repr({integer})]` generally.
I am personally leaning toward Option 3, since our existing
compile-time check provides a sufficient safety margin to allow this
flexibility.
Thoughts on these?
Best regards,
Jesung
^ permalink raw reply [flat|nested] 14+ messages in thread* Re: [PATCH v4 1/4] rust: macros: add derive macro for `Into`
2025-12-29 12:29 ` Jesung Yang
@ 2025-12-30 9:09 ` Benno Lossin
2026-01-21 3:20 ` Jesung Yang
0 siblings, 1 reply; 14+ messages in thread
From: Benno Lossin @ 2025-12-30 9:09 UTC (permalink / raw)
To: Jesung Yang
Cc: Miguel Ojeda, Boqun Feng, Gary Guo, Björn Roy Baron,
Andreas Hindborg, Alice Ryhl, Trevor Gross, Danilo Krummrich,
Alexandre Courbot, linux-kernel, rust-for-linux, nouveau
On Mon Dec 29, 2025 at 1:29 PM CET, Jesung Yang wrote:
> On Sat, Dec 27, 2025 at 1:57 PM Benno Lossin <lossin@kernel.org> wrote:
>> On Fri Dec 26, 2025 at 10:36 AM CET, Jesung Yang wrote:
>> > On Fri, Dec 26, 2025 at 2:40 AM Benno Lossin <lossin@kernel.org> wrote:
>> >> On Thu Dec 25, 2025 at 9:37 AM CET, Jesung Yang via B4 Relay wrote:
>> >> > + // Note on field-less `repr(C)` enums (quote from [1]):
>> >> > + //
>> >> > + // In C, enums with discriminants that do not all fit into an `int` or all fit into an
>> >> > + // `unsigned int` are a portability hazard: such enums are only permitted since C23, and not
>> >> > + // supported e.g. by MSVC.
>> >> > + //
>> >> > + // Furthermore, Rust interprets the discriminant values of `repr(C)` enums as expressions of
>> >> > + // type `isize`. This makes it impossible to implement the C23 behavior of enums where the
>> >> > + // enum discriminants have no predefined type and instead the enum uses a type large enough
>> >> > + // to hold all discriminants.
>> >> > + //
>> >> > + // Therefore, `repr(C)` enums in Rust require that either all discriminants to fit into a C
>> >> > + // `int` or they all fit into an `unsigned int`.
>> >> > + //
>> >> > + // As such, `isize` is a reasonable representation for `repr(C)` enums, as it covers the range
>> >> > + // of both `int` and `unsigned int`.
>> >> > + //
>> >> > + // For more information, see:
>> >> > + // - https://github.com/rust-lang/rust/issues/124403
>> >> > + // - https://github.com/rust-lang/rust/pull/147017
>> >> > + // - https://github.com/rust-lang/rust/blob/2ca7bcd03b87b52f7055a59b817443b0ac4a530d/compiler/rustc_lint_defs/src/builtin.rs#L5251-L5263 [1]
>> >> > +
>> >> > + // Extract the representation passed by `#[repr(...)]` if present. If nothing is
>> >> > + // specified, the default is `Rust` representation, which uses `isize` for its
>> >> > + // discriminant type.
>> >> > + // See: https://doc.rust-lang.org/reference/items/enumerations.html#r-items.enum.discriminant.repr-rust
>> >>
>> >> I think we should error when no `#[repr({integer})]` attribute is
>> >> specified.
>> >
>> > Not a blocker but just out of curiosity: are you concerned that the
>> > default size might change in the future, leading to silent side
>> > effects?
>>
>> `isize` already changes size when you switch between 64 and 32 bit
>> architectures. I think the author of an enum they want to convert into
>> integers should think about which size the enum should be.
>>
>> They already can choose `repr(isize)` if that is correct in that case.
>> As a default, I would have choosen `i32` (but that conflicts with Rust's
>> default, so we can't do it).
>
> On second thought, I've realized that enforcing an error when
> `#[repr({integer})]` is missing would prevent users from deriving
> traits for `#[repr(C)]` enums. This is because rustc currently rejects
> the combined `#[repr(C, {integer})]` syntax. For example, a user might
It's only rejected for field-less enums, but those are what we're
interested here.
> want to do this:
>
> #[derive(Into)]
> #[into(u8)]
> #[repr(C)]
> enum Foo {
> A,
> B,
> }
>
> In this case, the code wouldn't compile if we strictly require
> `#[repr({integer})]`, even if the user carefully picked `u8`, keeping
> the enum's size (more precisely, the discriminant range) in mind.
>
> Since we already perform a compile-time check to ensure all
> discriminants fit within the types specified in the helper attributes,
> I believe `#[repr({integer})]` isn't strictly required. Even with
> `isize` changing size across architectures, our compile-time check
> remains effective and will catch any overflows.
Hmm that's true.
> To sum up, I see three options:
>
> 1. Drop support for `#[repr(C)]` enums entirely.
> 2. Special-case `#[repr(C)]` enums: allow them to default to
> `isize`, otherwise require `#[repr({integer})]`.
> 3. Permit missing `#[repr({integer})]` generally.
>
> I am personally leaning toward Option 3, since our existing
> compile-time check provides a sufficient safety margin to allow this
> flexibility.
>
> Thoughts on these?
Looking at the nomicon documentation [1] again, I found the following:
repr(C) is equivalent to one of repr(u*) (see the next section) for
fieldless enums. The chosen size and sign is the default enum size
and sign for the target platform's C application binary interface
(ABI). Note that enum representation in C is implementation defined,
so this is really a "best guess". In particular, this may be
incorrect when the C code of interest is compiled with certain
flags.
Which to me reads as "don't use `repr(C)`, if you want to know which
repr the enum gets". Especially the last part is concerning to me, as
the kernel uses lots of (bespoke) compiler flags. So I'm thinking we
should just drop `repr(C)` enum support. Any thoughts from others?
[1]: https://doc.rust-lang.org/nomicon/other-reprs.html
Cheers,
Benno
^ permalink raw reply [flat|nested] 14+ messages in thread* Re: [PATCH v4 1/4] rust: macros: add derive macro for `Into`
2025-12-30 9:09 ` Benno Lossin
@ 2026-01-21 3:20 ` Jesung Yang
0 siblings, 0 replies; 14+ messages in thread
From: Jesung Yang @ 2026-01-21 3:20 UTC (permalink / raw)
To: Benno Lossin, Jesung Yang
Cc: Miguel Ojeda, Boqun Feng, Gary Guo, Björn Roy Baron,
Andreas Hindborg, Alice Ryhl, Trevor Gross, Danilo Krummrich,
Alexandre Courbot, linux-kernel, rust-for-linux, nouveau
OK, let me reignite this series...
On Tue Dec 30, 2025 at 6:09 PM KST, Benno Lossin wrote:
> On Mon Dec 29, 2025 at 1:29 PM CET, Jesung Yang wrote:
>> On Sat, Dec 27, 2025 at 1:57 PM Benno Lossin <lossin@kernel.org> wrote:
[...]
>> To sum up, I see three options:
>>
>> 1. Drop support for `#[repr(C)]` enums entirely.
>> 2. Special-case `#[repr(C)]` enums: allow them to default to
>> `isize`, otherwise require `#[repr({integer})]`.
>> 3. Permit missing `#[repr({integer})]` generally.
>>
>> I am personally leaning toward Option 3, since our existing
>> compile-time check provides a sufficient safety margin to allow this
>> flexibility.
>>
>> Thoughts on these?
>
> Looking at the nomicon documentation [1] again, I found the following:
>
> repr(C) is equivalent to one of repr(u*) (see the next section) for
> fieldless enums. The chosen size and sign is the default enum size
> and sign for the target platform's C application binary interface
> (ABI). Note that enum representation in C is implementation defined,
> so this is really a "best guess". In particular, this may be
> incorrect when the C code of interest is compiled with certain
> flags.
>
> Which to me reads as "don't use `repr(C)`, if you want to know which
> repr the enum gets". Especially the last part is concerning to me, as
> the kernel uses lots of (bespoke) compiler flags. So I'm thinking we
> should just drop `repr(C)` enum support. Any thoughts from others?
>
> [1]: https://doc.rust-lang.org/nomicon/other-reprs.html
I think the last part you mentioned is less of a concern in this
context, as this series does not introduce new FFI boundaries;
`try_from` and `into` themselves live only on the Rust side and do not
interact with the C side. We are indeed relying on Rust's "best guess"
about the internal representation to perform compile-time checks, but
these trait implementations do not pass enums across the boundary to C
code.
Your concern is certainly valid for anyone introducing new `#[repr(C)]`
fieldless enums that interface with the C side (and we may want to
revisit any existing ones). In our case, however, it should be safe as we
ensure that discriminants do not overflow Rust's own internal
representation of `#[repr(C)]` enums.
Best regards,
Jesung
^ permalink raw reply [flat|nested] 14+ messages in thread
* [PATCH v4 2/4] rust: macros: add derive macro for `TryFrom`
2025-12-25 8:37 [PATCH v4 0/4] rust: add `TryFrom` and `Into` derive macros Jesung Yang via B4 Relay
2025-12-25 8:37 ` [PATCH v4 1/4] rust: macros: add derive macro for `Into` Jesung Yang via B4 Relay
@ 2025-12-25 8:37 ` Jesung Yang via B4 Relay
2025-12-25 17:42 ` Benno Lossin
2025-12-25 8:37 ` [PATCH v4 3/4] rust: macros: add private doctests for `Into` derive macro Jesung Yang via B4 Relay
2025-12-25 8:37 ` [PATCH v4 4/4] rust: macros: add private doctests for `TryFrom` " Jesung Yang via B4 Relay
3 siblings, 1 reply; 14+ messages in thread
From: Jesung Yang via B4 Relay @ 2025-12-25 8:37 UTC (permalink / raw)
To: Miguel Ojeda, Boqun Feng, Gary Guo, Björn Roy Baron,
Benno Lossin, Andreas Hindborg, Alice Ryhl, Trevor Gross,
Danilo Krummrich, Alexandre Courbot
Cc: linux-kernel, rust-for-linux, nouveau, Jesung Yang
From: Jesung Yang <y.j3ms.n@gmail.com>
Introduce a procedural macro `TryFrom` to automatically implement the
`TryFrom` trait for unit-only enums.
This reduces boilerplate in cases where numeric values need to be
interpreted as relevant enum variants. This situation often arises when
working with low-level data sources. A typical example is the `Chipset`
enum in nova-core, where the value read from a GPU register should be
mapped to a corresponding variant.
The macro not only supports primitive types such as `bool` or `i8`, but
also `Bounded`, a wrapper around integer types limiting the number of
bits usable for value representation. This accommodates the shift toward
more restrictive register field representations in nova-core where
values are constrained to specific bit ranges.
Signed-off-by: Jesung Yang <y.j3ms.n@gmail.com>
---
rust/macros/convert.rs | 64 +++++++++++++++++++
rust/macros/lib.rs | 162 +++++++++++++++++++++++++++++++++++++++++++++++++
2 files changed, 226 insertions(+)
diff --git a/rust/macros/convert.rs b/rust/macros/convert.rs
index 3e623cc894bff279482dd9daeaa7054937357ec6..d49a58e85de16d13ce9a51cafa31940e42c5840f 100644
--- a/rust/macros/convert.rs
+++ b/rust/macros/convert.rs
@@ -30,6 +30,10 @@ pub(crate) fn derive_into(input: DeriveInput) -> syn::Result<TokenStream> {
derive(DeriveTarget::Into, input)
}
+pub(crate) fn derive_try_from(input: DeriveInput) -> syn::Result<TokenStream> {
+ derive(DeriveTarget::TryFrom, input)
+}
+
fn derive(target: DeriveTarget, input: DeriveInput) -> syn::Result<TokenStream> {
let mut errors: Option<syn::Error> = None;
let mut combine_error = |err| match errors.as_mut() {
@@ -108,18 +112,21 @@ fn derive(target: DeriveTarget, input: DeriveInput) -> syn::Result<TokenStream>
#[derive(Clone, Copy, Debug)]
enum DeriveTarget {
Into,
+ TryFrom,
}
impl DeriveTarget {
fn get_trait_name(&self) -> &'static str {
match self {
Self::Into => "Into",
+ Self::TryFrom => "TryFrom",
}
}
fn get_helper_name(&self) -> &'static str {
match self {
Self::Into => "into",
+ Self::TryFrom => "try_from",
}
}
}
@@ -184,6 +191,7 @@ fn derive_for_enum(
) -> TokenStream {
let impl_fn = match target {
DeriveTarget::Into => impl_into,
+ DeriveTarget::TryFrom => impl_try_from,
};
let qualified_repr_ty: syn::Path = parse_quote! { ::core::primitive::#repr_ty };
@@ -237,6 +245,54 @@ fn from(#param: #enum_ident) -> #input_ty {
}
}
+ fn impl_try_from(
+ enum_ident: &Ident,
+ variants: &[Ident],
+ repr_ty: &syn::Path,
+ input_ty: &ValidTy,
+ ) -> TokenStream {
+ let param = Ident::new("value", Span::call_site());
+
+ let overflow_assertion = emit_overflow_assert(enum_ident, variants, repr_ty, input_ty);
+ let emit_cast = |variant| {
+ let variant = ::quote::quote! { #enum_ident::#variant };
+ match input_ty {
+ ValidTy::Bounded(inner) => {
+ let base_ty = inner.emit_qualified_base_ty();
+ let expr = parse_quote! { #variant as #base_ty };
+ inner.emit_new(&expr)
+ }
+ ValidTy::Primitive(ident) if ident == "bool" => {
+ ::quote::quote! { ((#variant as #repr_ty) == 1) }
+ }
+ qualified @ ValidTy::Primitive(_) => ::quote::quote! { #variant as #qualified },
+ }
+ };
+
+ let clauses = variants.iter().map(|variant| {
+ let cast = emit_cast(variant);
+ ::quote::quote! {
+ if #param == #cast {
+ ::core::result::Result::Ok(#enum_ident::#variant)
+ } else
+ }
+ });
+
+ ::quote::quote! {
+ #[automatically_derived]
+ impl ::core::convert::TryFrom<#input_ty> for #enum_ident {
+ type Error = ::kernel::prelude::Error;
+ fn try_from(#param: #input_ty) -> Result<#enum_ident, Self::Error> {
+ #overflow_assertion
+
+ #(#clauses)* {
+ ::core::result::Result::Err(::kernel::prelude::EINVAL)
+ }
+ }
+ }
+ }
+ }
+
fn emit_overflow_assert(
enum_ident: &Ident,
variants: &[Ident],
@@ -389,6 +445,14 @@ fn emit_from_expr(&self, expr: &Expr) -> TokenStream {
}
}
+ fn emit_new(&self, expr: &Expr) -> TokenStream {
+ let Self { base_ty, bits, .. } = self;
+ let qualified_name: syn::Path = parse_str(Self::QUALIFIED_NAME).expect("valid path");
+ ::quote::quote! {
+ #qualified_name::<#base_ty, #bits>::new::<{ #expr }>()
+ }
+ }
+
fn emit_qualified_base_ty(&self) -> TokenStream {
let base_ty = &self.base_ty;
::quote::quote! { ::core::primitive::#base_ty }
diff --git a/rust/macros/lib.rs b/rust/macros/lib.rs
index 02528d7212b75d28788f0c33479edb272fa12e27..4dc7de0167a53b778562e24cd145cece50555d91 100644
--- a/rust/macros/lib.rs
+++ b/rust/macros/lib.rs
@@ -632,3 +632,165 @@ pub fn derive_into(input: TokenStream) -> TokenStream {
.unwrap_or_else(syn::Error::into_compile_error)
.into()
}
+
+/// A derive macro for generating an implementation of the [`TryFrom`] trait.
+///
+/// This macro automatically derives the [`TryFrom`] trait for a given enum. Currently,
+/// it only supports [unit-only enum]s.
+///
+/// [unit-only enum]: https://doc.rust-lang.org/reference/items/enumerations.html#r-items.enum.unit-only
+///
+/// # Notes
+///
+/// - The macro generates [`TryFrom`] implementations that:
+/// - Return `Ok(VARIANT)` when the input corresponds to a variant.
+/// - Return `Err(EINVAL)` when the input does not correspond to any variant.
+/// (where `EINVAL` is from [`kernel::error::code`]).
+///
+/// - The macro uses the `try_from` custom attribute or `repr` attribute to generate
+/// [`TryFrom`] implementations. `try_from` always takes precedence over `repr`.
+///
+/// - The macro generates a compile-time assertion for every variant to ensure its
+/// discriminant value fits within the type being converted from.
+///
+/// [`kernel::error::code`]: ../kernel/error/code/index.html
+///
+/// # Supported types in `#[try_from(...)]`
+///
+/// - [`bool`]
+/// - Primitive integer types (e.g., [`i8`], [`u8`])
+/// - [`Bounded`]
+///
+/// [`Bounded`]: ../kernel/num/bounded/struct.Bounded.html
+///
+/// # Examples
+///
+/// ## Without Attributes
+///
+/// Since [the default `Rust` representation uses `isize` for the discriminant type][repr-rust],
+/// the macro implements `TryFrom<isize>`:
+///
+/// [repr-rust]: https://doc.rust-lang.org/reference/items/enumerations.html#r-items.enum.discriminant.repr-rust
+///
+/// ```rust
+/// # use kernel::prelude::*;
+/// use kernel::macros::TryFrom;
+///
+/// #[derive(Debug, Default, PartialEq, TryFrom)]
+/// enum Foo {
+/// #[default]
+/// A,
+/// B = 0x7,
+/// }
+///
+/// assert_eq!(Err(EINVAL), Foo::try_from(-1_isize));
+/// assert_eq!(Ok(Foo::A), Foo::try_from(0_isize));
+/// assert_eq!(Ok(Foo::B), Foo::try_from(0x7_isize));
+/// assert_eq!(Err(EINVAL), Foo::try_from(0x8_isize));
+/// ```
+///
+/// ## With `#[repr(T)]`
+///
+/// The macro implements `TryFrom<T>`:
+///
+/// ```rust
+/// # use kernel::prelude::*;
+/// use kernel::macros::TryFrom;
+///
+/// #[derive(Debug, Default, PartialEq, TryFrom)]
+/// #[repr(u8)]
+/// enum Foo {
+/// #[default]
+/// A,
+/// B = 0x7,
+/// }
+///
+/// assert_eq!(Ok(Foo::A), Foo::try_from(0_u8));
+/// assert_eq!(Ok(Foo::B), Foo::try_from(0x7_u8));
+/// assert_eq!(Err(EINVAL), Foo::try_from(0x8_u8));
+/// ```
+///
+/// ## With `#[try_from(...)]`
+///
+/// The macro implements `TryFrom<T>` for each `T` specified in `#[try_from(...)]`,
+/// which always overrides `#[repr(...)]`:
+///
+/// ```rust
+/// # use kernel::prelude::*;
+/// use kernel::{
+/// macros::TryFrom,
+/// num::Bounded, //
+/// };
+///
+/// #[derive(Debug, Default, PartialEq, TryFrom)]
+/// #[try_from(bool, i16, Bounded<u8, 4>)]
+/// #[repr(u8)]
+/// enum Foo {
+/// #[default]
+/// A,
+/// B,
+/// }
+///
+/// assert_eq!(Err(EINVAL), Foo::try_from(-1_i16));
+/// assert_eq!(Ok(Foo::A), Foo::try_from(0_i16));
+/// assert_eq!(Ok(Foo::B), Foo::try_from(1_i16));
+/// assert_eq!(Err(EINVAL), Foo::try_from(2_i16));
+///
+/// assert_eq!(Ok(Foo::A), Foo::try_from(false));
+/// assert_eq!(Ok(Foo::B), Foo::try_from(true));
+///
+/// assert_eq!(Ok(Foo::A), Foo::try_from(Bounded::<u8, 4>::new::<0>()));
+/// assert_eq!(Ok(Foo::B), Foo::try_from(Bounded::<u8, 4>::new::<1>()));
+/// ```
+///
+/// ## Compile-time Overflow Assertion
+///
+/// The following examples do not compile:
+///
+/// ```compile_fail
+/// # use kernel::macros::Into;
+/// #[derive(Into)]
+/// #[into(u8)]
+/// enum Foo {
+/// // `256` is larger than `u8::MAX`.
+/// A = 256,
+/// }
+/// ```
+///
+/// ```compile_fail
+/// # use kernel::macros::Into;
+/// #[derive(Into)]
+/// #[into(u8)]
+/// enum Foo {
+/// // `-1` cannot be represented with `u8`.
+/// A = -1,
+/// }
+/// ```
+///
+/// ## Unsupported Cases
+///
+/// The following examples do not compile:
+///
+/// ```compile_fail
+/// # use kernel::macros::TryFrom;
+/// // Tuple-like enums or struct-like enums are not allowed.
+/// #[derive(TryFrom)]
+/// enum Foo {
+/// A(u8),
+/// B { inner: u8 },
+/// }
+/// ```
+///
+/// ```compile_fail
+/// # use kernel::macros::TryFrom;
+/// // Structs are not allowed.
+/// #[derive(TryFrom)]
+/// struct Foo(u8);
+/// ```
+#[proc_macro_derive(TryFrom, attributes(try_from))]
+pub fn derive_try_from(input: TokenStream) -> TokenStream {
+ let input = parse_macro_input!(input as DeriveInput);
+ convert::derive_try_from(input)
+ .unwrap_or_else(syn::Error::into_compile_error)
+ .into()
+}
--
2.47.3
^ permalink raw reply related [flat|nested] 14+ messages in thread* Re: [PATCH v4 2/4] rust: macros: add derive macro for `TryFrom`
2025-12-25 8:37 ` [PATCH v4 2/4] rust: macros: add derive macro for `TryFrom` Jesung Yang via B4 Relay
@ 2025-12-25 17:42 ` Benno Lossin
0 siblings, 0 replies; 14+ messages in thread
From: Benno Lossin @ 2025-12-25 17:42 UTC (permalink / raw)
To: y.j3ms.n, Miguel Ojeda, Boqun Feng, Gary Guo,
Björn Roy Baron, Andreas Hindborg, Alice Ryhl, Trevor Gross,
Danilo Krummrich, Alexandre Courbot
Cc: linux-kernel, rust-for-linux, nouveau
On Thu Dec 25, 2025 at 9:37 AM CET, Jesung Yang via B4 Relay wrote:
> +/// ## Compile-time Overflow Assertion
> +///
> +/// The following examples do not compile:
> +///
> +/// ```compile_fail
> +/// # use kernel::macros::Into;
> +/// #[derive(Into)]
> +/// #[into(u8)]
> +/// enum Foo {
> +/// // `256` is larger than `u8::MAX`.
> +/// A = 256,
> +/// }
> +/// ```
> +///
> +/// ```compile_fail
> +/// # use kernel::macros::Into;
> +/// #[derive(Into)]
> +/// #[into(u8)]
> +/// enum Foo {
> +/// // `-1` cannot be represented with `u8`.
> +/// A = -1,
> +/// }
> +/// ```
These two are copy-pasted from the `into` macro.
Cheers,
Benno
> +///
> +/// ## Unsupported Cases
> +///
> +/// The following examples do not compile:
> +///
> +/// ```compile_fail
> +/// # use kernel::macros::TryFrom;
> +/// // Tuple-like enums or struct-like enums are not allowed.
> +/// #[derive(TryFrom)]
> +/// enum Foo {
> +/// A(u8),
> +/// B { inner: u8 },
> +/// }
> +/// ```
> +///
> +/// ```compile_fail
> +/// # use kernel::macros::TryFrom;
> +/// // Structs are not allowed.
> +/// #[derive(TryFrom)]
> +/// struct Foo(u8);
> +/// ```
> +#[proc_macro_derive(TryFrom, attributes(try_from))]
> +pub fn derive_try_from(input: TokenStream) -> TokenStream {
> + let input = parse_macro_input!(input as DeriveInput);
> + convert::derive_try_from(input)
> + .unwrap_or_else(syn::Error::into_compile_error)
> + .into()
> +}
^ permalink raw reply [flat|nested] 14+ messages in thread
* [PATCH v4 3/4] rust: macros: add private doctests for `Into` derive macro
2025-12-25 8:37 [PATCH v4 0/4] rust: add `TryFrom` and `Into` derive macros Jesung Yang via B4 Relay
2025-12-25 8:37 ` [PATCH v4 1/4] rust: macros: add derive macro for `Into` Jesung Yang via B4 Relay
2025-12-25 8:37 ` [PATCH v4 2/4] rust: macros: add derive macro for `TryFrom` Jesung Yang via B4 Relay
@ 2025-12-25 8:37 ` Jesung Yang via B4 Relay
2025-12-25 8:37 ` [PATCH v4 4/4] rust: macros: add private doctests for `TryFrom` " Jesung Yang via B4 Relay
3 siblings, 0 replies; 14+ messages in thread
From: Jesung Yang via B4 Relay @ 2025-12-25 8:37 UTC (permalink / raw)
To: Miguel Ojeda, Boqun Feng, Gary Guo, Björn Roy Baron,
Benno Lossin, Andreas Hindborg, Alice Ryhl, Trevor Gross,
Danilo Krummrich, Alexandre Courbot
Cc: linux-kernel, rust-for-linux, nouveau, Jesung Yang
From: Jesung Yang <y.j3ms.n@gmail.com>
Add internal doctests to verify the `Into` derive macro's logic. This
ensures comprehensive testing while keeping the public-facing
documentation compact and readable.
Signed-off-by: Jesung Yang <y.j3ms.n@gmail.com>
---
rust/macros/convert.rs | 436 +++++++++++++++++++++++++++++++++++++++++++++++++
1 file changed, 436 insertions(+)
diff --git a/rust/macros/convert.rs b/rust/macros/convert.rs
index d49a58e85de16d13ce9a51cafa31940e42c5840f..63b391a47867fde3ed3d4873daccfc50b0872314 100644
--- a/rust/macros/convert.rs
+++ b/rust/macros/convert.rs
@@ -529,3 +529,439 @@ fn is_valid_primitive(ident: &Ident) -> bool {
| "isize"
)
}
+
+mod derive_into_tests {
+ /// ```
+ /// use kernel::macros::Into;
+ ///
+ /// #[derive(Into)]
+ /// #[into(u8)]
+ /// enum Foo {
+ /// // Works with const expressions.
+ /// A = add(0, 0),
+ /// B = 2_isize.pow(1) - 1,
+ /// }
+ ///
+ /// const fn add(a: isize, b: isize) -> isize {
+ /// a + b
+ /// }
+ ///
+ /// assert_eq!(0_u8, Foo::A.into());
+ /// assert_eq!(1_u8, Foo::B.into());
+ /// ```
+ mod works_with_const_expr {}
+
+ /// ```
+ /// use kernel::macros::Into;
+ ///
+ /// #[derive(Into)]
+ /// #[into(bool)]
+ /// enum Foo {
+ /// A,
+ /// B,
+ /// }
+ ///
+ /// assert_eq!(false, Foo::A.into());
+ /// assert_eq!(true, Foo::B.into());
+ /// ```
+ ///
+ /// ```compile_fail
+ /// use kernel::macros::Into;
+ ///
+ /// #[derive(Into)]
+ /// #[into(bool)]
+ /// enum Foo {
+ /// // `-1` cannot be represented with `bool`.
+ /// A = -1,
+ /// }
+ /// ```
+ ///
+ /// ```compile_fail
+ /// use kernel::macros::Into;
+ ///
+ /// #[derive(Into)]
+ /// #[into(bool)]
+ /// enum Foo {
+ /// // `2` cannot be represented with `bool`.
+ /// A = 2,
+ /// }
+ /// ```
+ mod overflow_assert_works_on_bool {}
+
+ /// ```
+ /// use kernel::{
+ /// macros::Into,
+ /// num::Bounded, //
+ /// };
+ ///
+ /// #[derive(Into)]
+ /// #[into(Bounded<i8, 7>)]
+ /// enum Foo {
+ /// A = -1 << 6, // The minimum value of `Bounded<i8, 7>`.
+ /// B = (1 << 6) - 1, // The maximum value of `Bounded<i8, 7>`.
+ /// }
+ ///
+ /// let foo_a: Bounded<i8, 7> = Foo::A.into();
+ /// let foo_b: Bounded<i8, 7> = Foo::B.into();
+ /// assert_eq!(Bounded::<i8, 7>::new::<{ -1_i8 << 6 }>(), foo_a);
+ /// assert_eq!(Bounded::<i8, 7>::new::<{ (1_i8 << 6) - 1 }>(), foo_b);
+ /// ```
+ ///
+ /// ```compile_fail
+ /// use kernel::macros::Into;
+ ///
+ /// #[derive(Into)]
+ /// #[into(Bounded<i8, 7>)]
+ /// enum Foo {
+ /// // `1 << 6` cannot be represented with `Bounded<i8, 7>`.
+ /// A = 1 << 6,
+ /// }
+ /// ```
+ ///
+ /// ```compile_fail
+ /// use kernel::macros::Into;
+ ///
+ /// #[derive(Into)]
+ /// #[into(Bounded<i8, 7>)]
+ /// enum Foo {
+ /// // `(-1 << 6) - 1` cannot be represented with `Bounded<i8, 7>`.
+ /// A = (-1 << 6) - 1,
+ /// }
+ /// ```
+ ///
+ /// ```
+ /// use kernel::{
+ /// macros::Into,
+ /// num::Bounded, //
+ /// };
+ ///
+ /// #[derive(Into)]
+ /// #[into(Bounded<i8, 1>)]
+ /// enum Foo {
+ /// A = -1, // The minimum value of `Bounded<i8, 1>`.
+ /// B, // The maximum value of `Bounded<i8, 1>`.
+ /// }
+ ///
+ /// let foo_a: Bounded<i8, 1> = Foo::A.into();
+ /// let foo_b: Bounded<i8, 1> = Foo::B.into();
+ /// assert_eq!(Bounded::<i8, 1>::new::<{ -1_i8 }>(), foo_a);
+ /// assert_eq!(Bounded::<i8, 1>::new::<{ 0_i8 } >(), foo_b);
+ /// ```
+ ///
+ /// ```compile_fail
+ /// use kernel::macros::Into;
+ ///
+ /// #[derive(Into)]
+ /// #[into(Bounded<i8, 1>)]
+ /// enum Foo {
+ /// // `1` cannot be represented with `Bounded<i8, 1>`.
+ /// A = 1,
+ /// }
+ /// ```
+ ///
+ /// ```compile_fail
+ /// use kernel::macros::Into;
+ ///
+ /// #[derive(Into)]
+ /// #[into(Bounded<i8, 1>)]
+ /// enum Foo {
+ /// // `-2` cannot be represented with `Bounded<i8, 1>`.
+ /// A = -2,
+ /// }
+ /// ```
+ ///
+ /// ```
+ /// use kernel::{
+ /// macros::Into,
+ /// num::Bounded, //
+ /// };
+ ///
+ /// #[derive(Into)]
+ /// #[into(Bounded<i32, 32>)]
+ /// #[repr(i64)]
+ /// enum Foo {
+ /// A = i32::MIN as i64,
+ /// B = i32::MAX as i64,
+ /// }
+ ///
+ /// let foo_a: Bounded<i32, 32> = Foo::A.into();
+ /// let foo_b: Bounded<i32, 32> = Foo::B.into();
+ /// assert_eq!(Bounded::<i32, 32>::new::<{ i32::MIN }>(), foo_a);
+ /// assert_eq!(Bounded::<i32, 32>::new::<{ i32::MAX }>(), foo_b);
+ /// ```
+ ///
+ /// ```compile_fail
+ /// use kernel::macros::Into;
+ ///
+ /// #[derive(Into)]
+ /// #[into(Bounded<i32, 32>)]
+ /// #[repr(i64)]
+ /// enum Foo {
+ /// // `1 << 31` cannot be represented with `Bounded<i32, 32>`.
+ /// A = 1 << 31,
+ /// }
+ /// ```
+ ///
+ /// ```compile_fail
+ /// use kernel::macros::Into;
+ ///
+ /// #[derive(Into)]
+ /// #[into(Bounded<i32, 32>)]
+ /// #[repr(i64)]
+ /// enum Foo {
+ /// // `(-1 << 31) - 1` cannot be represented with `Bounded<i32, 32>`.
+ /// A = (-1 << 31) - 1,
+ /// }
+ /// ```
+ mod overflow_assert_works_on_signed_bounded {}
+
+ /// ```
+ /// use kernel::{
+ /// macros::Into,
+ /// num::Bounded, //
+ /// };
+ ///
+ /// #[derive(Into)]
+ /// #[into(Bounded<u8, 7>)]
+ /// enum Foo {
+ /// A, // The minimum value of `Bounded<u8, 7>`.
+ /// B = (1 << 7) - 1, // The maximum value of `Bounded<u8, 7>`.
+ /// }
+ ///
+ /// let foo_a: Bounded<u8, 7> = Foo::A.into();
+ /// let foo_b: Bounded<u8, 7> = Foo::B.into();
+ /// assert_eq!(Bounded::<u8, 7>::new::<{ 0 }>(), foo_a);
+ /// assert_eq!(Bounded::<u8, 7>::new::<{ (1_u8 << 7) - 1 }>(), foo_b);
+ /// ```
+ ///
+ /// ```compile_fail
+ /// use kernel::macros::Into;
+ ///
+ /// #[derive(Into)]
+ /// #[into(Bounded<u8, 7>)]
+ /// enum Foo {
+ /// // `1 << 7` cannot be represented with `Bounded<u8, 7>`.
+ /// A = 1 << 7,
+ /// }
+ /// ```
+ ///
+ /// ```compile_fail
+ /// use kernel::macros::Into;
+ ///
+ /// #[derive(Into)]
+ /// #[into(Bounded<u8, 7>)]
+ /// enum Foo {
+ /// // `-1` cannot be represented with `Bounded<u8, 7>`.
+ /// A = -1,
+ /// }
+ /// ```
+ ///
+ /// ```
+ /// use kernel::{
+ /// macros::Into,
+ /// num::Bounded, //
+ /// };
+ ///
+ /// #[derive(Into)]
+ /// #[into(Bounded<u8, 1>)]
+ /// enum Foo {
+ /// A, // The minimum value of `Bounded<u8, 1>`.
+ /// B, // The maximum value of `Bounded<u8, 1>`.
+ /// }
+ ///
+ /// let foo_a: Bounded<u8, 1> = Foo::A.into();
+ /// let foo_b: Bounded<u8, 1> = Foo::B.into();
+ /// assert_eq!(Bounded::<u8, 1>::new::<{ 0 }>(), foo_a);
+ /// assert_eq!(Bounded::<u8, 1>::new::<{ 1 }>(), foo_b);
+ /// ```
+ ///
+ /// ```compile_fail
+ /// use kernel::macros::Into;
+ ///
+ /// #[derive(Into)]
+ /// #[into(Bounded<u8, 1>)]
+ /// enum Foo {
+ /// // `2` cannot be represented with `Bounded<u8, 1>`.
+ /// A = 2,
+ /// }
+ /// ```
+ ///
+ /// ```compile_fail
+ /// use kernel::macros::Into;
+ ///
+ /// #[derive(Into)]
+ /// #[into(Bounded<u8, 1>)]
+ /// enum Foo {
+ /// // `-1` cannot be represented with `Bounded<u8, 1>`.
+ /// A = -1,
+ /// }
+ /// ```
+ ///
+ /// ```
+ /// use kernel::{
+ /// macros::Into,
+ /// num::Bounded, //
+ /// };
+ ///
+ /// #[derive(Into)]
+ /// #[into(Bounded<u32, 32>)]
+ /// #[repr(u64)]
+ /// enum Foo {
+ /// A = u32::MIN as u64,
+ /// B = u32::MAX as u64,
+ /// }
+ ///
+ /// let foo_a: Bounded<u32, 32> = Foo::A.into();
+ /// let foo_b: Bounded<u32, 32> = Foo::B.into();
+ /// assert_eq!(Bounded::<u32, 32>::new::<{ u32::MIN }>(), foo_a);
+ /// assert_eq!(Bounded::<u32, 32>::new::<{ u32::MAX }>(), foo_b);
+ /// ```
+ ///
+ /// ```compile_fail
+ /// use kernel::macros::Into;
+ ///
+ /// #[derive(Into)]
+ /// #[into(Bounded<u32, 32>)]
+ /// #[repr(u64)]
+ /// enum Foo {
+ /// // `1 << 32` cannot be represented with `Bounded<u32, 32>`.
+ /// A = 1 << 32,
+ /// }
+ /// ```
+ ///
+ /// ```compile_fail
+ /// use kernel::macros::Into;
+ ///
+ /// #[derive(Into)]
+ /// #[into(Bounded<u32, 32>)]
+ /// #[repr(u64)]
+ /// enum Foo {
+ /// // `-1` cannot be represented with `Bounded<u32, 32>`.
+ /// A = -1,
+ /// }
+ /// ```
+ mod overflow_assert_works_on_unsigned_bounded {}
+
+ /// ```
+ /// use kernel::macros::Into;
+ ///
+ /// #[derive(Into)]
+ /// #[into(isize)]
+ /// #[repr(isize)]
+ /// enum Foo {
+ /// A = isize::MIN,
+ /// B = isize::MAX,
+ /// }
+ ///
+ /// assert_eq!(isize::MIN, Foo::A.into());
+ /// assert_eq!(isize::MAX, Foo::B.into());
+ /// ```
+ ///
+ /// ```compile_fail
+ /// use kernel::macros::Into;
+ ///
+ /// #[derive(Into)]
+ /// #[into(isize)]
+ /// #[repr(usize)]
+ /// enum Foo {
+ /// A = (isize::MAX as usize) + 1
+ /// }
+ /// ```
+ ///
+ /// ```compile_fail
+ /// use kernel::macros::Into;
+ ///
+ /// #[derive(Into)]
+ /// #[into(i32)]
+ /// #[repr(i64)]
+ /// enum Foo {
+ /// A = (i32::MIN as i64) - 1,
+ /// }
+ /// ```
+ ///
+ /// ```compile_fail
+ /// use kernel::macros::Into;
+ ///
+ /// #[derive(Into)]
+ /// #[into(i32)]
+ /// #[repr(i64)]
+ /// enum Foo {
+ /// A = (i32::MAX as i64) + 1,
+ /// }
+ /// ```
+ mod overflow_assert_works_on_signed_int {}
+
+ /// ```
+ /// use kernel::macros::Into;
+ ///
+ /// #[derive(Into)]
+ /// #[into(usize)]
+ /// #[repr(usize)]
+ /// enum Foo {
+ /// A = usize::MIN,
+ /// B = usize::MAX,
+ /// }
+ ///
+ /// assert_eq!(usize::MIN, Foo::A.into());
+ /// assert_eq!(usize::MAX, Foo::B.into());
+ /// ```
+ ///
+ /// ```compile_fail
+ /// use kernel::macros::Into;
+ ///
+ /// #[derive(Into)]
+ /// #[into(usize)]
+ /// #[repr(isize)]
+ /// enum Foo {
+ /// A = -1,
+ /// }
+ /// ```
+ ///
+ /// ```compile_fail
+ /// use kernel::macros::Into;
+ ///
+ /// #[derive(Into)]
+ /// #[into(u32)]
+ /// #[repr(i64)]
+ /// enum Foo {
+ /// A = (u32::MIN as i64) - 1,
+ /// }
+ /// ```
+ ///
+ /// ```compile_fail
+ /// use kernel::macros::Into;
+ ///
+ /// #[derive(Into)]
+ /// #[into(u32)]
+ /// #[repr(i64)]
+ /// enum Foo {
+ /// A = (u32::MAX as i64) + 1,
+ /// }
+ /// ```
+ mod overflow_assert_works_on_unsigned_int {}
+
+ /// ```compile_fail
+ /// use kernel::macros::Into;
+ ///
+ /// #[derive(Into)]
+ /// #[into(Bounded<i8, 7>, i8, i16, i32, i64)]
+ /// #[repr(i8)]
+ /// enum Foo {
+ /// // `i8::MAX` cannot be represented with `Bounded<i8, 7>`.
+ /// A = i8::MAX,
+ /// }
+ /// ```
+ ///
+ /// ```compile_fail
+ /// use kernel::macros::Into;
+ ///
+ /// #[derive(Into)]
+ /// #[into(i8, i16, i32, i64, Bounded<i8, 7>)]
+ /// #[repr(i8)]
+ /// enum Foo {
+ /// // `i8::MAX` cannot be represented with `Bounded<i8, 7>`.
+ /// A = i8::MAX,
+ /// }
+ /// ```
+ mod any_into_target_overflow_is_rejected {}
+}
--
2.47.3
^ permalink raw reply related [flat|nested] 14+ messages in thread* [PATCH v4 4/4] rust: macros: add private doctests for `TryFrom` derive macro
2025-12-25 8:37 [PATCH v4 0/4] rust: add `TryFrom` and `Into` derive macros Jesung Yang via B4 Relay
` (2 preceding siblings ...)
2025-12-25 8:37 ` [PATCH v4 3/4] rust: macros: add private doctests for `Into` derive macro Jesung Yang via B4 Relay
@ 2025-12-25 8:37 ` Jesung Yang via B4 Relay
3 siblings, 0 replies; 14+ messages in thread
From: Jesung Yang via B4 Relay @ 2025-12-25 8:37 UTC (permalink / raw)
To: Miguel Ojeda, Boqun Feng, Gary Guo, Björn Roy Baron,
Benno Lossin, Andreas Hindborg, Alice Ryhl, Trevor Gross,
Danilo Krummrich, Alexandre Courbot
Cc: linux-kernel, rust-for-linux, nouveau, Jesung Yang
From: Jesung Yang <y.j3ms.n@gmail.com>
Add internal doctests to verify the `TryFrom` derive macro's logic. This
ensures comprehensive testing while keeping the public-facing
documentation compact and readable.
Signed-off-by: Jesung Yang <y.j3ms.n@gmail.com>
---
rust/macros/convert.rs | 579 +++++++++++++++++++++++++++++++++++++++++++++++++
1 file changed, 579 insertions(+)
diff --git a/rust/macros/convert.rs b/rust/macros/convert.rs
index 63b391a47867fde3ed3d4873daccfc50b0872314..87c11a98836fe982932b0c62a4ee3b5401db2126 100644
--- a/rust/macros/convert.rs
+++ b/rust/macros/convert.rs
@@ -965,3 +965,582 @@ mod overflow_assert_works_on_unsigned_int {}
/// ```
mod any_into_target_overflow_is_rejected {}
}
+
+mod derive_try_from_tests {
+ /// ```
+ /// use kernel::{
+ /// macros::{
+ /// Into,
+ /// TryFrom, //
+ /// },
+ /// num::Bounded,
+ /// prelude::*, //
+ /// };
+ ///
+ /// #[derive(Debug, Into, PartialEq, TryFrom)]
+ /// #[into(bool, Bounded<i8, 7>, Bounded<u8, 7>, i8, i16, i32, i64, i128, isize, u8, u16, u32, u64, u128, usize)]
+ /// #[try_from(bool, Bounded<i8, 7>, Bounded<u8, 7>, i8, i16, i32, i64, i128, isize, u8, u16, u32, u64, u128, usize)]
+ /// enum Foo {
+ /// A,
+ /// B,
+ /// }
+ ///
+ /// assert_eq!(false, Foo::A.into());
+ /// assert_eq!(true, Foo::B.into());
+ /// assert_eq!(Ok(Foo::A), Foo::try_from(false));
+ /// assert_eq!(Ok(Foo::B), Foo::try_from(true));
+ ///
+ /// let foo_a: Bounded<i8, 7> = Foo::A.into();
+ /// let foo_b: Bounded<i8, 7> = Foo::B.into();
+ /// assert_eq!(Bounded::<i8, 7>::new::<0>(), foo_a);
+ /// assert_eq!(Bounded::<i8, 7>::new::<1>(), foo_b);
+ /// assert_eq!(Ok(Foo::A), Foo::try_from(Bounded::<i8, 7>::new::<0>()));
+ /// assert_eq!(Ok(Foo::B), Foo::try_from(Bounded::<i8, 7>::new::<1>()));
+ /// assert_eq!(Err(EINVAL), Foo::try_from(Bounded::<i8, 7>::new::<-1>()));
+ /// assert_eq!(Err(EINVAL), Foo::try_from(Bounded::<i8, 7>::new::<2>()));
+ ///
+ /// let foo_a: Bounded<u8, 7> = Foo::A.into();
+ /// let foo_b: Bounded<u8, 7> = Foo::B.into();
+ /// assert_eq!(Bounded::<u8, 7>::new::<0>(), foo_a);
+ /// assert_eq!(Bounded::<u8, 7>::new::<1>(), foo_b);
+ /// assert_eq!(Ok(Foo::A), Foo::try_from(Bounded::<u8, 7>::new::<0>()));
+ /// assert_eq!(Ok(Foo::B), Foo::try_from(Bounded::<u8, 7>::new::<1>()));
+ /// assert_eq!(Err(EINVAL), Foo::try_from(Bounded::<u8, 7>::new::<2>()));
+ ///
+ /// macro_rules! gen_signed_tests {
+ /// ($($type:ty),*) => {
+ /// $(
+ /// assert_eq!(0 as $type, Foo::A.into());
+ /// assert_eq!(1 as $type, Foo::B.into());
+ /// assert_eq!(Ok(Foo::A), Foo::try_from(0 as $type));
+ /// assert_eq!(Ok(Foo::B), Foo::try_from(1 as $type));
+ /// assert_eq!(Err(EINVAL), Foo::try_from((0 as $type) - 1));
+ /// assert_eq!(Err(EINVAL), Foo::try_from((1 as $type) + 1));
+ /// )*
+ /// };
+ /// }
+ /// macro_rules! gen_unsigned_tests {
+ /// ($($type:ty),*) => {
+ /// $(
+ /// assert_eq!(0 as $type, Foo::A.into());
+ /// assert_eq!(1 as $type, Foo::B.into());
+ /// assert_eq!(Ok(Foo::A), Foo::try_from(0 as $type));
+ /// assert_eq!(Ok(Foo::B), Foo::try_from(1 as $type));
+ /// assert_eq!(Err(EINVAL), Foo::try_from((1 as $type) + 1));
+ /// )*
+ /// };
+ /// }
+ /// gen_signed_tests!(i8, i16, i32, i64, i128, isize);
+ /// gen_unsigned_tests!(u8, u16, u32, u64, u128, usize);
+ /// ```
+ mod works_with_derive_into {}
+
+ /// ```
+ /// use kernel::{
+ /// macros::TryFrom,
+ /// prelude::*, //
+ /// };
+ ///
+ /// #[derive(Debug, PartialEq, TryFrom)]
+ /// #[try_from(u8)]
+ /// enum Foo {
+ /// // Works with const expressions.
+ /// A = add(0, 0),
+ /// B = 2_isize.pow(1) - 1,
+ /// }
+ ///
+ /// const fn add(a: isize, b: isize) -> isize {
+ /// a + b
+ /// }
+ ///
+ /// assert_eq!(Ok(Foo::A), Foo::try_from(0_u8));
+ /// assert_eq!(Ok(Foo::B), Foo::try_from(1_u8));
+ /// assert_eq!(Err(EINVAL), Foo::try_from(2_u8));
+ /// ```
+ mod works_with_const_expr {}
+
+ /// ```
+ /// use kernel::{
+ /// macros::TryFrom,
+ /// prelude::*, //
+ /// };
+ ///
+ /// #[derive(Debug, PartialEq, TryFrom)]
+ /// #[try_from(bool)]
+ /// enum Foo {
+ /// A,
+ /// B,
+ /// }
+ ///
+ /// assert_eq!(Ok(Foo::A), Foo::try_from(false));
+ /// assert_eq!(Ok(Foo::B), Foo::try_from(true));
+ ///
+ /// #[derive(Debug, PartialEq, TryFrom)]
+ /// #[try_from(bool)]
+ /// enum Bar {
+ /// A,
+ /// }
+ ///
+ /// assert_eq!(Ok(Bar::A), Bar::try_from(false));
+ /// assert_eq!(Err(EINVAL), Bar::try_from(true));
+ ///
+ /// #[derive(Debug, PartialEq, TryFrom)]
+ /// #[try_from(bool)]
+ /// enum Baz {
+ /// A = 1,
+ /// }
+ ///
+ /// assert_eq!(Err(EINVAL), Baz::try_from(false));
+ /// assert_eq!(Ok(Baz::A), Baz::try_from(true));
+ /// ```
+ ///
+ /// ```compile_fail
+ /// use kernel::macros::TryFrom;
+ ///
+ /// #[derive(TryFrom)]
+ /// #[try_from(bool)]
+ /// enum Foo {
+ /// // `-1` cannot be represented with `bool`.
+ /// A = -1,
+ /// }
+ /// ```
+ ///
+ /// ```compile_fail
+ /// use kernel::macros::TryFrom;
+ ///
+ /// #[derive(TryFrom)]
+ /// #[try_from(bool)]
+ /// enum Foo {
+ /// // `2` cannot be represented with `bool`.
+ /// A = 2,
+ /// }
+ /// ```
+ mod overflow_assert_works_on_bool {}
+
+ /// ```
+ /// use kernel::{
+ /// macros::TryFrom,
+ /// num::Bounded,
+ /// prelude::*, //
+ /// };
+ ///
+ /// #[derive(Debug, PartialEq, TryFrom)]
+ /// #[try_from(Bounded<i8, 7>)]
+ /// enum Foo {
+ /// A = -1 << 6, // The minimum value of `Bounded<i8, 7>`.
+ /// B = (1 << 6) - 1, // The maximum value of `Bounded<i8, 7>`.
+ /// }
+ ///
+ /// assert_eq!(Ok(Foo::A), Foo::try_from(Bounded::<i8, 7>::new::<{ -1_i8 << 6 }>()));
+ /// assert_eq!(Ok(Foo::B), Foo::try_from(Bounded::<i8, 7>::new::<{ (1_i8 << 6) - 1 }>()));
+ /// assert_eq!(Err(EINVAL), Foo::try_from(Bounded::<i8, 7>::new::<{ (-1_i8 << 6) + 1 }>()));
+ /// assert_eq!(Err(EINVAL), Foo::try_from(Bounded::<i8, 7>::new::<{ (1_i8 << 6) - 2 }>()));
+ /// ```
+ ///
+ /// ```compile_fail
+ /// use kernel::macros::TryFrom;
+ ///
+ /// #[derive(TryFrom)]
+ /// #[try_from(Bounded<i8, 7>)]
+ /// enum Foo {
+ /// // `1 << 6` cannot be represented with `Bounded<i8, 7>`.
+ /// A = 1 << 6,
+ /// }
+ /// ```
+ ///
+ /// ```compile_fail
+ /// use kernel::macros::TryFrom;
+ ///
+ /// #[derive(TryFrom)]
+ /// #[try_from(Bounded<i8, 7>)]
+ /// enum Foo {
+ /// // `(-1 << 6) - 1` cannot be represented with `Bounded<i8, 7>`.
+ /// A = (-1 << 6) - 1,
+ /// }
+ /// ```
+ ///
+ /// ```
+ /// use kernel::{
+ /// macros::TryFrom,
+ /// num::Bounded,
+ /// prelude::*, //
+ /// };
+ ///
+ /// #[derive(Debug, PartialEq, TryFrom)]
+ /// #[try_from(Bounded<i8, 1>)]
+ /// enum Foo {
+ /// A = -1, // The minimum value of `Bounded<i8, 1>`.
+ /// B, // The maximum value of `Bounded<i8, 1>`.
+ /// }
+ ///
+ /// assert_eq!(Ok(Foo::A), Foo::try_from(Bounded::<i8, 1>::new::<{ -1_i8 }>()));
+ /// assert_eq!(Ok(Foo::B), Foo::try_from(Bounded::<i8, 1>::new::<{ 0_i8 } >()));
+ ///
+ /// #[derive(Debug, PartialEq, TryFrom)]
+ /// #[try_from(Bounded<i8, 1>)]
+ /// enum Bar {
+ /// A = -1, // The minimum value of `Bounded<i8, 1>`.
+ /// }
+ ///
+ /// assert_eq!(Ok(Bar::A), Bar::try_from(Bounded::<i8, 1>::new::<{ -1_i8 }>()));
+ /// assert_eq!(Err(EINVAL), Bar::try_from(Bounded::<i8, 1>::new::<{ 0_i8 } >()));
+ ///
+ /// #[derive(Debug, PartialEq, TryFrom)]
+ /// #[try_from(Bounded<i8, 1>)]
+ /// enum Baz {
+ /// A, // The maximum value of `Bounded<i8, 1>`.
+ /// }
+ ///
+ /// assert_eq!(Err(EINVAL), Baz::try_from(Bounded::<i8, 1>::new::<{ -1_i8 }>()));
+ /// assert_eq!(Ok(Baz::A), Baz::try_from(Bounded::<i8, 1>::new::<{ 0_i8 } >()));
+ /// ```
+ ///
+ /// ```compile_fail
+ /// use kernel::macros::TryFrom;
+ ///
+ /// #[derive(TryFrom)]
+ /// #[try_from(Bounded<i8, 1>)]
+ /// enum Foo {
+ /// // `1` cannot be represented with `Bounded<i8, 1>`.
+ /// A = 1,
+ /// }
+ /// ```
+ ///
+ /// ```compile_fail
+ /// use kernel::macros::TryFrom;
+ ///
+ /// #[derive(TryFrom)]
+ /// #[try_from(Bounded<i8, 1>)]
+ /// enum Foo {
+ /// // `-2` cannot be represented with `Bounded<i8, 1>`.
+ /// A = -2,
+ /// }
+ /// ```
+ ///
+ /// ```
+ /// use kernel::{
+ /// macros::TryFrom,
+ /// num::Bounded,
+ /// prelude::*, //
+ /// };
+ ///
+ /// #[derive(Debug, PartialEq, TryFrom)]
+ /// #[try_from(Bounded<i32, 32>)]
+ /// #[repr(i64)]
+ /// enum Foo {
+ /// A = i32::MIN as i64,
+ /// B = i32::MAX as i64,
+ /// }
+ ///
+ /// assert_eq!(Ok(Foo::A), Foo::try_from(Bounded::<i32, 32>::new::<{ i32::MIN }>()));
+ /// assert_eq!(Ok(Foo::B), Foo::try_from(Bounded::<i32, 32>::new::<{ i32::MAX }>()));
+ /// assert_eq!(Err(EINVAL), Foo::try_from(Bounded::<i32, 32>::new::<{ i32::MIN + 1 }>()));
+ /// assert_eq!(Err(EINVAL), Foo::try_from(Bounded::<i32, 32>::new::<{ i32::MAX - 1 }>()));
+ /// ```
+ ///
+ /// ```compile_fail
+ /// use kernel::macros::TryFrom;
+ ///
+ /// #[derive(TryFrom)]
+ /// #[try_from(Bounded<i32, 32>)]
+ /// #[repr(i64)]
+ /// enum Foo {
+ /// // `1 << 31` cannot be represented with `Bounded<i32, 32>`.
+ /// A = 1 << 31,
+ /// }
+ /// ```
+ ///
+ /// ```compile_fail
+ /// use kernel::macros::TryFrom;
+ ///
+ /// #[derive(TryFrom)]
+ /// #[try_from(Bounded<i32, 32>)]
+ /// #[repr(i64)]
+ /// enum Foo {
+ /// // `(-1 << 31) - 1` cannot be represented with `Bounded<i32, 32>`.
+ /// A = (-1 << 31) - 1,
+ /// }
+ /// ```
+ mod overflow_assert_works_on_signed_bounded {}
+
+ /// ```
+ /// use kernel::{
+ /// macros::TryFrom,
+ /// num::Bounded,
+ /// prelude::*, //
+ /// };
+ ///
+ /// #[derive(Debug, PartialEq, TryFrom)]
+ /// #[try_from(Bounded<u8, 7>)]
+ /// enum Foo {
+ /// A, // The minimum value of `Bounded<u8, 7>`.
+ /// B = (1 << 7) - 1, // The maximum value of `Bounded<u8, 7>`.
+ /// }
+ ///
+ /// assert_eq!(Ok(Foo::A), Foo::try_from(Bounded::<u8, 7>::new::<{ 0 }>()));
+ /// assert_eq!(Ok(Foo::B), Foo::try_from(Bounded::<u8, 7>::new::<{ (1_u8 << 7) - 1 }>()));
+ /// assert_eq!(Err(EINVAL), Foo::try_from(Bounded::<u8, 7>::new::<{ 1 }>()));
+ /// assert_eq!(Err(EINVAL), Foo::try_from(Bounded::<u8, 7>::new::<{ (1_u8 << 7) - 2 }>()));
+ /// ```
+ ///
+ /// ```compile_fail
+ /// use kernel::macros::TryFrom;
+ ///
+ /// #[derive(TryFrom)]
+ /// #[try_from(Bounded<u8, 7>)]
+ /// enum Foo {
+ /// // `1 << 7` cannot be represented with `Bounded<u8, 7>`.
+ /// A = 1 << 7,
+ /// }
+ /// ```
+ ///
+ /// ```compile_fail
+ /// use kernel::macros::TryFrom;
+ ///
+ /// #[derive(TryFrom)]
+ /// #[try_from(Bounded<u8, 7>)]
+ /// enum Foo {
+ /// // `-1` cannot be represented with `Bounded<u8, 7>`.
+ /// A = -1,
+ /// }
+ /// ```
+ ///
+ /// ```
+ /// use kernel::{
+ /// macros::TryFrom,
+ /// num::Bounded,
+ /// prelude::*, //
+ /// };
+ ///
+ /// #[derive(Debug, PartialEq, TryFrom)]
+ /// #[try_from(Bounded<u8, 1>)]
+ /// enum Foo {
+ /// A, // The minimum value of `Bounded<u8, 1>`.
+ /// B, // The maximum value of `Bounded<u8, 1>`.
+ /// }
+ ///
+ /// assert_eq!(Ok(Foo::A), Foo::try_from(Bounded::<u8, 1>::new::<{ 0 }>()));
+ /// assert_eq!(Ok(Foo::B), Foo::try_from(Bounded::<u8, 1>::new::<{ 1 }>()));
+ ///
+ /// #[derive(Debug, PartialEq, TryFrom)]
+ /// #[try_from(Bounded<u8, 1>)]
+ /// enum Bar {
+ /// A, // The minimum value of `Bounded<u8, 1>`.
+ /// }
+ ///
+ /// assert_eq!(Ok(Bar::A), Bar::try_from(Bounded::<u8, 1>::new::<{ 0 }>()));
+ /// assert_eq!(Err(EINVAL), Bar::try_from(Bounded::<u8, 1>::new::<{ 1 }>()));
+ ///
+ /// #[derive(Debug, PartialEq, TryFrom)]
+ /// #[try_from(Bounded<u8, 1>)]
+ /// enum Baz {
+ /// A = 1, // The maximum value of `Bounded<u8, 1>`.
+ /// }
+ ///
+ /// assert_eq!(Err(EINVAL), Baz::try_from(Bounded::<u8, 1>::new::<{ 0 }>()));
+ /// assert_eq!(Ok(Baz::A), Baz::try_from(Bounded::<u8, 1>::new::<{ 1 }>()));
+ /// ```
+ ///
+ /// ```compile_fail
+ /// use kernel::macros::TryFrom;
+ ///
+ /// #[derive(TryFrom)]
+ /// #[try_from(Bounded<u8, 1>)]
+ /// enum Foo {
+ /// // `2` cannot be represented with `Bounded<u8, 1>`.
+ /// A = 2,
+ /// }
+ /// ```
+ ///
+ /// ```compile_fail
+ /// use kernel::macros::TryFrom;
+ ///
+ /// #[derive(TryFrom)]
+ /// #[try_from(Bounded<u8, 1>)]
+ /// enum Foo {
+ /// // `-1` cannot be represented with `Bounded<u8, 1>`.
+ /// A = -1,
+ /// }
+ /// ```
+ ///
+ /// ```
+ /// use kernel::{
+ /// macros::TryFrom,
+ /// num::Bounded,
+ /// prelude::*, //
+ /// };
+ ///
+ /// #[derive(Debug, PartialEq, TryFrom)]
+ /// #[try_from(Bounded<u32, 32>)]
+ /// #[repr(u64)]
+ /// enum Foo {
+ /// A = u32::MIN as u64,
+ /// B = u32::MAX as u64,
+ /// }
+ ///
+ /// assert_eq!(Ok(Foo::A), Foo::try_from(Bounded::<u32, 32>::new::<{ u32::MIN }>()));
+ /// assert_eq!(Ok(Foo::B), Foo::try_from(Bounded::<u32, 32>::new::<{ u32::MAX }>()));
+ /// assert_eq!(Err(EINVAL), Foo::try_from(Bounded::<u32, 32>::new::<{ u32::MIN + 1 }>()));
+ /// assert_eq!(Err(EINVAL), Foo::try_from(Bounded::<u32, 32>::new::<{ u32::MAX - 1 }>()));
+ /// ```
+ ///
+ /// ```compile_fail
+ /// use kernel::macros::TryFrom;
+ ///
+ /// #[derive(TryFrom)]
+ /// #[try_from(Bounded<u32, 32>)]
+ /// #[repr(u64)]
+ /// enum Foo {
+ /// // `1 << 32` cannot be represented with `Bounded<u32, 32>`.
+ /// A = 1 << 32,
+ /// }
+ /// ```
+ ///
+ /// ```compile_fail
+ /// use kernel::macros::TryFrom;
+ ///
+ /// #[derive(TryFrom)]
+ /// #[try_from(Bounded<u32, 32>)]
+ /// #[repr(u64)]
+ /// enum Foo {
+ /// // `-1` cannot be represented with `Bounded<u32, 32>`.
+ /// A = -1,
+ /// }
+ /// ```
+ mod overflow_assert_works_on_unsigned_bounded {}
+
+ /// ```
+ /// use kernel::{
+ /// macros::TryFrom,
+ /// num::Bounded,
+ /// prelude::*, //
+ /// };
+ ///
+ /// #[derive(Debug, PartialEq, TryFrom)]
+ /// #[try_from(isize)]
+ /// #[repr(isize)]
+ /// enum Foo {
+ /// A = isize::MIN,
+ /// B = isize::MAX,
+ /// }
+ ///
+ /// assert_eq!(Ok(Foo::A), Foo::try_from(isize::MIN));
+ /// assert_eq!(Ok(Foo::B), Foo::try_from(isize::MAX));
+ /// assert_eq!(Err(EINVAL), Foo::try_from(isize::MIN + 1));
+ /// assert_eq!(Err(EINVAL), Foo::try_from(isize::MAX - 1));
+ /// ```
+ ///
+ /// ```compile_fail
+ /// use kernel::macros::TryFrom;
+ ///
+ /// #[derive(TryFrom)]
+ /// #[try_from(isize)]
+ /// #[repr(usize)]
+ /// enum Foo {
+ /// A = (isize::MAX as usize) + 1
+ /// }
+ /// ```
+ ///
+ /// ```compile_fail
+ /// use kernel::macros::TryFrom;
+ ///
+ /// #[derive(TryFrom)]
+ /// #[try_from(i32)]
+ /// #[repr(i64)]
+ /// enum Foo {
+ /// A = (i32::MIN as i64) - 1,
+ /// }
+ /// ```
+ ///
+ /// ```compile_fail
+ /// use kernel::macros::TryFrom;
+ ///
+ /// #[derive(TryFrom)]
+ /// #[try_from(i32)]
+ /// #[repr(i64)]
+ /// enum Foo {
+ /// A = (i32::MAX as i64) + 1,
+ /// }
+ /// ```
+ mod overflow_assert_works_on_signed_int {}
+
+ /// ```
+ /// use kernel::{
+ /// macros::TryFrom,
+ /// num::Bounded,
+ /// prelude::*, //
+ /// };
+ ///
+ /// #[derive(Debug, PartialEq, TryFrom)]
+ /// #[try_from(usize)]
+ /// #[repr(usize)]
+ /// enum Foo {
+ /// A = usize::MIN,
+ /// B = usize::MAX,
+ /// }
+ ///
+ /// assert_eq!(Ok(Foo::A), Foo::try_from(usize::MIN));
+ /// assert_eq!(Ok(Foo::B), Foo::try_from(usize::MAX));
+ /// assert_eq!(Err(EINVAL), Foo::try_from(usize::MIN + 1));
+ /// assert_eq!(Err(EINVAL), Foo::try_from(usize::MAX - 1));
+ /// ```
+ ///
+ /// ```compile_fail
+ /// use kernel::macros::TryFrom;
+ ///
+ /// #[derive(TryFrom)]
+ /// #[try_from(usize)]
+ /// #[repr(isize)]
+ /// enum Foo {
+ /// A = -1,
+ /// }
+ /// ```
+ ///
+ /// ```compile_fail
+ /// use kernel::macros::TryFrom;
+ ///
+ /// #[derive(TryFrom)]
+ /// #[try_from(u32)]
+ /// #[repr(i64)]
+ /// enum Foo {
+ /// A = (u32::MIN as i64) - 1,
+ /// }
+ /// ```
+ ///
+ /// ```compile_fail
+ /// use kernel::macros::TryFrom;
+ ///
+ /// #[derive(TryFrom)]
+ /// #[try_from(u32)]
+ /// #[repr(i64)]
+ /// enum Foo {
+ /// A = (u32::MAX as i64) + 1,
+ /// }
+ /// ```
+ mod overflow_assert_works_on_unsigned_int {}
+
+ /// ```compile_fail
+ /// use kernel::macros::TryFrom;
+ ///
+ /// #[derive(TryFrom)]
+ /// #[try_from(Bounded<i8, 7>, i8, i16, i32, i64)]
+ /// #[repr(i8)]
+ /// enum Foo {
+ /// // `i8::MAX` cannot be represented with `Bounded<i8, 7>`.
+ /// A = i8::MAX,
+ /// }
+ /// ```
+ ///
+ /// ```compile_fail
+ /// use kernel::macros::TryFrom;
+ ///
+ /// #[derive(TryFrom)]
+ /// #[try_from(i8, i16, i32, i64, Bounded<i8, 7>)]
+ /// #[repr(i8)]
+ /// enum Foo {
+ /// // `i8::MAX` cannot be represented with `Bounded<i8, 7>`.
+ /// A = i8::MAX,
+ /// }
+ /// ```
+ mod any_try_from_target_overflow_is_rejected {}
+}
--
2.47.3
^ permalink raw reply related [flat|nested] 14+ messages in thread