Received-SPF: pass (google.com: domain of linux-kernel+bounces-190433-linux.lists.archive=gmail.com@vger.kernel.org designates 147.75.48.161 as permitted sender) client-ip=147.75.48.161;
Date: Mon, 27 May 2024 10:31:35 +0000
To: Alice Ryhl <aliceryhl@google.com>, Miguel Ojeda <ojeda@kernel.org>, Andrew Morton <akpm@linux-foundation.org>
From: Benno Lossin <benno.lossin@proton.me>
Cc: Alex Gaynor <alex.gaynor@gmail.com>, Wedson Almeida Filho <wedsonaf@gmail.com>, Boqun Feng <boqun.feng@gmail.com>, Gary Guo <gary@garyguo.net>, =?utf-8?Q?Bj=C3=B6rn_Roy_Baron?= <bjorn3_gh@protonmail.com>, Andreas Hindborg <a.hindborg@samsung.com>, Marco Elver <elver@google.com>, Kees Cook <keescook@chromium.org>, Coly Li <colyli@suse.de>, Paolo Abeni <pabeni@redhat.com>, Pierre Gondois <pierre.gondois@arm.com>, Ingo Molnar <mingo@kernel.org>, Jakub Kicinski <kuba@kernel.org>, Wei Yang <richard.weiyang@gmail.com>, Matthew Wilcox <willy@infradead.org>, linux-kernel@vger.kernel.org, rust-for-linux@vger.kernel.org
Subject: Re: [PATCH v2 6/9] rust: list: add iterators
Message-ID: <cc65eeaf-81e1-45f5-8350-8e8259efe289@proton.me>
In-Reply-To: <20240506-linked-list-v2-6-7b910840c91f@google.com>
References: <20240506-linked-list-v2-0-7b910840c91f@google.com> <20240506-linked-list-v2-6-7b910840c91f@google.com>
Feedback-ID: 71780778:user:proton
Precedence: bulk
MIME-Version: 1.0
Content-Type: text/plain; charset=utf-8
Content-Transfer-Encoding: quoted-printable

On 06.05.24 11:53, Alice Ryhl wrote:
> Rust Binder has lists containing stuff such as all contexts or all
> processes, and sometimes need to iterate over them. This patch enables

typo: need -> needs

> Rust Binder to do that using a normal for loop.
>=20
> The iterator returns the ArcBorrow type, so it is possible to grab a
> refcount to values while iterating.
>=20
> Signed-off-by: Alice Ryhl <aliceryhl@google.com>

Two documentation nits below, with those fixed:

Reviewed-by: Benno Lossin <benno.lossin@proton.me>

> ---
>  rust/kernel/list.rs | 102 ++++++++++++++++++++++++++++++++++++++++++++++=
++++++
>  1 file changed, 102 insertions(+)
>=20
> diff --git a/rust/kernel/list.rs b/rust/kernel/list.rs
> index d0ff29a3e5d1..e36afc7ee44a 100644
> --- a/rust/kernel/list.rs
> +++ b/rust/kernel/list.rs
> @@ -5,7 +5,9 @@
>  //! A linked list implementation.
>=20
>  use crate::init::PinInit;
> +use crate::sync::ArcBorrow;
>  use crate::types::Opaque;
> +use core::iter::{DoubleEndedIterator, FusedIterator};
>  use core::marker::PhantomData;
>  use core::ptr;
>=20
> @@ -435,6 +437,17 @@ pub fn push_all_back(&mut self, other: &mut List<T, =
ID>) {
>          // INVARIANT: The other list is now empty, so update its pointer=
.
>          other.first =3D ptr::null_mut();
>      }
> +
> +    /// Creates an iterator over the list.
> +    pub fn iter(&self) -> Iter<'_, T, ID> {
> +        // INVARIANT: If the list is empty, both pointers are null. Othe=
rwise, both pointers point
> +        // at the first element of the same list.
> +        Iter {
> +            current: self.first,
> +            stop: self.first,
> +            _ty: PhantomData,
> +        }
> +    }
>  }
>=20
>  impl<T: ?Sized + ListItem<ID>, const ID: u64> Default for List<T, ID> {
> @@ -450,3 +463,92 @@ fn drop(&mut self) {
>          }
>      }
>  }
> +
> +/// An iterator into a [`List`].

I would use "over" instead of "into".

> +///
> +/// # Invariants
> +///
> +/// * There must be a [`List`] that is immutably borrowed for the durati=
on of `'a`.
> +/// * The `current` pointer is null or points at a value in that [`List`=
].
> +/// * The `stop` pointer is equal to the `first` field of the [`List`].

the -> that

---
Cheers,
Benno

> +#[derive(Clone)]
> +pub struct Iter<'a, T: ?Sized + ListItem<ID>, const ID: u64 =3D 0> {
> +    current: *mut ListLinksFields,
> +    stop: *mut ListLinksFields,
> +    _ty: PhantomData<&'a ListArc<T, ID>>,
> +}