Message ID | 20230411054543.21278-11-wedsonaf@gmail.com |
---|---|
State | New |
Headers |
Return-Path: <linux-kernel-owner@vger.kernel.org> Delivered-To: ouuuleilei@gmail.com Received: by 2002:a59:b0ea:0:b0:3b6:4342:cba0 with SMTP id b10csp2349894vqo; Mon, 10 Apr 2023 22:49:18 -0700 (PDT) X-Google-Smtp-Source: AKy350atvGJbMFGlrDNdPj9ubtnE/AqVmTLWmHYe/Z/hIJ/72GdN0ykWZv3+mnAKOcYdsmQVr55+ X-Received: by 2002:a17:906:1057:b0:94a:921b:c805 with SMTP id j23-20020a170906105700b0094a921bc805mr5536610ejj.45.1681192158390; Mon, 10 Apr 2023 22:49:18 -0700 (PDT) ARC-Seal: i=1; a=rsa-sha256; t=1681192158; cv=none; d=google.com; s=arc-20160816; b=baPdlxGWx/n2aKeYIogOuMVsWzilceKLgPp96RFs9IOr/QGK6LMLaBDQhF/aSYrueE E2F6Y5Gy/q5uOFoel6kc5ATPQCq6TdWcM59/dKN2GIbSjcBWxvlB5/s69ZBrfP6K8pwE iOHBfXbFsYNWv6P+czj/SVa4WiJaInprDZO2ubcWeTncw2naIQIEKFZxD0nKzDsdZDo5 YPLgbav8Sg0dJOid5+/9H3DhCb9UnUyRibYS4VPhNlRqw4UN/FJAjP2k+v2pxm4ykHqP A10DuSe0Zre5oML7oF6pZ2iAjDs2DXnxOCmQb8demSR0j2rRxNdefu01Dbf2I85bftMP wdKA== ARC-Message-Signature: i=1; a=rsa-sha256; c=relaxed/relaxed; d=google.com; s=arc-20160816; h=list-id:precedence:content-transfer-encoding:mime-version :references:in-reply-to:message-id:date:subject:cc:to:from :dkim-signature; bh=aaXy46x7GR5XrSzVHQC7SvsfS2kUsSvNQ00pK7ZlJKE=; b=MfVSLje7WL+UU5d6FPeTwOVL8I9h/FahAPXCXu6cGr/1HO3sjMDhC3V+OG8nk5ikvK p3UuTpAgvSjB2vmUob7eTZ+L8uQywXKtCuLk6EYndp1HZ14DGc9nYuFNhEuBpr4M88lF T9w54EiqoeFo59Qez7o1tG8K48YsWBSa7S6tXicoeeKN+DcdO7eo3u8uv857ymP8NQAg xhrpw4OPts6cEHV9JsrREUOY0W+D2EnhxrwjiOi9OdNsTCdzwhrI54Hggm60NUc0Xw+Z koKJMJF6Fwl/7b9fXrBJwhxdMS1w5e4Nhr0yR7dABVM+IJVrKbStpXF52zWDFYE4wXK+ uINA== ARC-Authentication-Results: i=1; mx.google.com; dkim=pass header.i=@gmail.com header.s=20210112 header.b=UJLg+Vs5; spf=pass (google.com: domain of linux-kernel-owner@vger.kernel.org designates 2620:137:e000::1:20 as permitted sender) smtp.mailfrom=linux-kernel-owner@vger.kernel.org; dmarc=pass (p=NONE sp=QUARANTINE dis=NONE) header.from=gmail.com Received: from out1.vger.email (out1.vger.email. [2620:137:e000::1:20]) by mx.google.com with ESMTP id ca23-20020aa7cd77000000b004c698b5018esi157379edb.347.2023.04.10.22.48.55; Mon, 10 Apr 2023 22:49:18 -0700 (PDT) Received-SPF: pass (google.com: domain of linux-kernel-owner@vger.kernel.org designates 2620:137:e000::1:20 as permitted sender) client-ip=2620:137:e000::1:20; Authentication-Results: mx.google.com; dkim=pass header.i=@gmail.com header.s=20210112 header.b=UJLg+Vs5; spf=pass (google.com: domain of linux-kernel-owner@vger.kernel.org designates 2620:137:e000::1:20 as permitted sender) smtp.mailfrom=linux-kernel-owner@vger.kernel.org; dmarc=pass (p=NONE sp=QUARANTINE dis=NONE) header.from=gmail.com Received: (majordomo@vger.kernel.org) by vger.kernel.org via listexpand id S230159AbjDKFrU (ORCPT <rfc822;yuanzuo1009@gmail.com> + 99 others); Tue, 11 Apr 2023 01:47:20 -0400 Received: from lindbergh.monkeyblade.net ([23.128.96.19]:56902 "EHLO lindbergh.monkeyblade.net" rhost-flags-OK-OK-OK-OK) by vger.kernel.org with ESMTP id S229759AbjDKFqz (ORCPT <rfc822;linux-kernel@vger.kernel.org>); Tue, 11 Apr 2023 01:46:55 -0400 Received: from mail-oi1-x233.google.com (mail-oi1-x233.google.com [IPv6:2607:f8b0:4864:20::233]) by lindbergh.monkeyblade.net (Postfix) with ESMTPS id DF772359F; Mon, 10 Apr 2023 22:46:33 -0700 (PDT) Received: by mail-oi1-x233.google.com with SMTP id bf5so4751729oib.8; Mon, 10 Apr 2023 22:46:33 -0700 (PDT) DKIM-Signature: v=1; a=rsa-sha256; c=relaxed/relaxed; d=gmail.com; s=20210112; t=1681191992; h=content-transfer-encoding:mime-version:references:in-reply-to :message-id:date:subject:cc:to:from:from:to:cc:subject:date :message-id:reply-to; bh=aaXy46x7GR5XrSzVHQC7SvsfS2kUsSvNQ00pK7ZlJKE=; b=UJLg+Vs59cCQxvgXFa0R/s2/3v6HTFoRsrG7JRs6qN2ByOGN0VWBkXMrs7MXStX3Yb z+swJtuQTgsm8GL26/3D6foDwZlhExpvKItRwG/WjKwjr7O/aenzMS/Q3XEuxQL/aDM9 m0VB2YmR16oQUIafVzMct0GKJUuMheRK800QUR1ZSrBW+P7iAejmOjlWuOl2qMnVMzT6 qBQZ8Dc2M5twSX3EDsjvFUl6MaL2ZAkmAOSk0R8b1k3HvGB7H3nPrpYDsEg86rXq//9z zDlU+Yuh/rEEWTpaD5KyqzrDxblHI6yVm1ybOz2zhpEteqxF2StSb7axrNuBtwdB+1H+ kdmQ== X-Google-DKIM-Signature: v=1; a=rsa-sha256; c=relaxed/relaxed; d=1e100.net; s=20210112; t=1681191992; h=content-transfer-encoding:mime-version:references:in-reply-to :message-id:date:subject:cc:to:from:x-gm-message-state:from:to:cc :subject:date:message-id:reply-to; bh=aaXy46x7GR5XrSzVHQC7SvsfS2kUsSvNQ00pK7ZlJKE=; b=Y0n8I0aXDFGq558+vH6xm+yzRhfCHlDRMfM0Jo/yzK17OJAb9JuOXZXlJ3gNo3JwgP 0Hufk3GTvKgvZHDNh0id+Ugk2bw2GZ2sUUa2maPRn5hdIyHrEjunkLw3qebePBONGlJi OjLw+Y2X7vskDd6fPBajyluLi1DlTwG5G8cTx8GyoL9Y4CUA4XS8Us3Qk/D9bPNaHUUF qRJJYWAYJpTAqWXdRvnqnuB3wU7SS+8TmV5lSVz1ueyA2iEvjyZQf0MqOcVZzjcro9Ne Pk7OP34jm3gfMOjp811xb/hUnU1DLIeSU7v7vzsDSerGQe27yRjlPQuTcRRb3qaM/wyL 5dYA== X-Gm-Message-State: AAQBX9cR4u0Gp/gsY4Wl9SC0J/gsZ4+KWB13c0k+TwHM1gNJeG83FeB8 ey+1TVNoP9fLpIjuLcoLc6vvwqLUah4= X-Received: by 2002:a05:6808:4092:b0:389:607:f41f with SMTP id db18-20020a056808409200b003890607f41fmr643215oib.4.1681191992528; Mon, 10 Apr 2023 22:46:32 -0700 (PDT) Received: from wedsonaf-dev.home.lan ([189.124.190.154]) by smtp.googlemail.com with ESMTPSA id z186-20020a4a49c3000000b005252d376caesm5440706ooa.22.2023.04.10.22.46.29 (version=TLS1_3 cipher=TLS_AES_256_GCM_SHA384 bits=256/256); Mon, 10 Apr 2023 22:46:32 -0700 (PDT) From: Wedson Almeida Filho <wedsonaf@gmail.com> To: rust-for-linux@vger.kernel.org Cc: Miguel Ojeda <ojeda@kernel.org>, Alex Gaynor <alex.gaynor@gmail.com>, Boqun Feng <boqun.feng@gmail.com>, Gary Guo <gary@garyguo.net>, =?utf-8?q?B?= =?utf-8?q?j=C3=B6rn_Roy_Baron?= <bjorn3_gh@protonmail.com>, linux-kernel@vger.kernel.org, Wedson Almeida Filho <walmeida@microsoft.com>, Martin Rodriguez Reboredo <yakoyoku@gmail.com> Subject: [PATCH v4 11/13] rust: lock: add `Guard::do_unlocked` Date: Tue, 11 Apr 2023 02:45:41 -0300 Message-Id: <20230411054543.21278-11-wedsonaf@gmail.com> X-Mailer: git-send-email 2.34.1 In-Reply-To: <20230411054543.21278-1-wedsonaf@gmail.com> References: <20230411054543.21278-1-wedsonaf@gmail.com> MIME-Version: 1.0 Content-Transfer-Encoding: 8bit X-Spam-Status: No, score=-0.2 required=5.0 tests=DKIM_SIGNED,DKIM_VALID, DKIM_VALID_AU,DKIM_VALID_EF,FREEMAIL_FROM,RCVD_IN_DNSWL_NONE, SPF_HELO_NONE,SPF_PASS autolearn=unavailable autolearn_force=no version=3.4.6 X-Spam-Checker-Version: SpamAssassin 3.4.6 (2021-04-09) on lindbergh.monkeyblade.net Precedence: bulk List-ID: <linux-kernel.vger.kernel.org> X-Mailing-List: linux-kernel@vger.kernel.org X-getmail-retrieved-from-mailbox: =?utf-8?q?INBOX?= X-GMAIL-THRID: =?utf-8?q?1762857748671520653?= X-GMAIL-MSGID: =?utf-8?q?1762857748671520653?= |
Series |
[v4,01/13] rust: sync: introduce `LockClassKey`
|
|
Commit Message
Wedson Almeida Filho
April 11, 2023, 5:45 a.m. UTC
From: Wedson Almeida Filho <walmeida@microsoft.com> It releases the lock, executes some function provided by the caller, then reacquires the lock. This is preparation for the implementation of condvars, which will sleep after between unlocking and relocking. We need an explicit `relock` method for primitives like `SpinLock` that have an irqsave variant: we use the guard state to determine if the lock was originally acquired with the regular `lock` function or `lock_irqsave`. Reviewed-by: Martin Rodriguez Reboredo <yakoyoku@gmail.com> Signed-off-by: Wedson Almeida Filho <walmeida@microsoft.com> --- v1 -> v2: No changes v2 -> v3: No changes v3 -> v4: No changes rust/kernel/sync/lock.rs | 25 +++++++++++++++++++++++++ rust/kernel/sync/lock/spinlock.rs | 17 +++++++++++++++-- 2 files changed, 40 insertions(+), 2 deletions(-)
Comments
On Tue, 11 Apr 2023 02:45:41 -0300 Wedson Almeida Filho <wedsonaf@gmail.com> wrote: > From: Wedson Almeida Filho <walmeida@microsoft.com> > > It releases the lock, executes some function provided by the caller, > then reacquires the lock. This is preparation for the implementation of > condvars, which will sleep after between unlocking and relocking. > > We need an explicit `relock` method for primitives like `SpinLock` that > have an irqsave variant: we use the guard state to determine if the lock > was originally acquired with the regular `lock` function or > `lock_irqsave`. > > Reviewed-by: Martin Rodriguez Reboredo <yakoyoku@gmail.com> > Signed-off-by: Wedson Almeida Filho <walmeida@microsoft.com> > --- > v1 -> v2: No changes > v2 -> v3: No changes > v3 -> v4: No changes > > rust/kernel/sync/lock.rs | 25 +++++++++++++++++++++++++ > rust/kernel/sync/lock/spinlock.rs | 17 +++++++++++++++-- > 2 files changed, 40 insertions(+), 2 deletions(-) > > diff --git a/rust/kernel/sync/lock.rs b/rust/kernel/sync/lock.rs > index 819b8ea5ba2b..cde57756795f 100644 > --- a/rust/kernel/sync/lock.rs > +++ b/rust/kernel/sync/lock.rs > @@ -22,6 +22,9 @@ pub mod spinlock; > /// > /// - Implementers must ensure that only one thread/CPU may access the protected data once the lock > /// is owned, that is, between calls to `lock` and `unlock`. > +/// - Implementers must also ensure that `relock` uses the same locking method as the original > +/// lock operation. For example, it should disable interrupts if [`IrqSaveBackend::lock_irqsave`] > +/// is used. > pub unsafe trait Backend { > /// The state required by the lock. > type State; > @@ -55,6 +58,17 @@ pub unsafe trait Backend { > /// > /// It must only be called by the current owner of the lock. > unsafe fn unlock(ptr: *mut Self::State, guard_state: &Self::GuardState); > + > + /// Reacquires the lock, making the caller its owner. > + /// > + /// # Safety > + /// > + /// Callers must ensure that `state` comes from a previous call to [`Backend::lock`] (or > + /// variant) that has been unlocked with [`Backend::unlock`] and will be relocked now. > + unsafe fn relock(ptr: *mut Self::State, guard_state: &mut Self::GuardState) { > + // SAFETY: The safety requirements ensure that the lock is initialised. > + *guard_state = unsafe { Self::lock(ptr) }; > + } > } > > /// The "backend" of a lock that supports the irq-save variant. > @@ -164,6 +178,17 @@ pub struct Guard<'a, T: ?Sized, B: Backend> { > // SAFETY: `Guard` is sync when the data protected by the lock is also sync. > unsafe impl<T: Sync + ?Sized, B: Backend> Sync for Guard<'_, T, B> {} > > +impl<T: ?Sized, B: Backend> Guard<'_, T, B> { > + #[allow(dead_code)] > + pub(crate) fn do_unlocked(&mut self, cb: impl FnOnce()) { > + // SAFETY: The caller owns the lock, so it is safe to unlock it. > + unsafe { B::unlock(self.lock.state.get(), &self.state) }; > + cb(); > + // SAFETY: The lock was just unlocked above and is being relocked now. > + unsafe { B::relock(self.lock.state.get(), &mut self.state) }; This should be let _guard = ScopeGuard::new(|| unsafe { B::relock(self.lock.state.get(), &mut self.state) } }); cb(); Although we currently use `-Cpanic=abort`, I think as a general rule we should still try to make code unwind-safe, so it can remain sound if someone takes the code and use it for userspace (e.g. for testing purpose, or maybe sharing codebase with tools). > + } > +} > + > impl<T: ?Sized, B: Backend> core::ops::Deref for Guard<'_, T, B> { > type Target = T; > > diff --git a/rust/kernel/sync/lock/spinlock.rs b/rust/kernel/sync/lock/spinlock.rs > index 34dec09a97c0..e2a2f68e6d93 100644 > --- a/rust/kernel/sync/lock/spinlock.rs > +++ b/rust/kernel/sync/lock/spinlock.rs > @@ -4,6 +4,7 @@ > //! > //! This module allows Rust code to use the kernel's `spinlock_t`. > > +use super::IrqSaveBackend; > use crate::bindings; > > /// Creates a [`SpinLock`] initialiser with the given name and a newly-created lock class. > @@ -95,7 +96,8 @@ pub type SpinLock<T> = super::Lock<T, SpinLockBackend>; > /// A kernel `spinlock_t` lock backend. > pub struct SpinLockBackend; > > -// SAFETY: The underlying kernel `spinlock_t` object ensures mutual exclusion. > +// SAFETY: The underlying kernel `spinlock_t` object ensures mutual exclusion. `relock` uses the > +// same scheme as `unlock` to figure out which locking method was used originally. > unsafe impl super::Backend for SpinLockBackend { > type State = bindings::spinlock_t; > type GuardState = Option<core::ffi::c_ulong>; > @@ -127,13 +129,24 @@ unsafe impl super::Backend for SpinLockBackend { > None => unsafe { bindings::spin_unlock(ptr) }, > } > } > + > + unsafe fn relock(ptr: *mut Self::State, guard_state: &mut Self::GuardState) { > + let _ = match guard_state { > + // SAFETY: The safety requiments of this function ensure that `ptr` has been > + // initialised. > + None => unsafe { Self::lock(ptr) }, > + // SAFETY: The safety requiments of this function ensure that `ptr` has been > + // initialised. > + Some(_) => unsafe { Self::lock_irqsave(ptr) }, > + }; > + } > } > > // SAFETY: The underlying kernel `spinlock_t` object ensures mutual exclusion. We use the `irqsave` > // variant of the C lock acquisition functions to disable interrupts and retrieve the original > // interrupt state, and the `irqrestore` variant of the lock release functions to restore the state > // in `unlock` -- we use the guard context to determine which method was used to acquire the lock. > -unsafe impl super::IrqSaveBackend for SpinLockBackend { > +unsafe impl IrqSaveBackend for SpinLockBackend { > unsafe fn lock_irqsave(ptr: *mut Self::State) -> Self::GuardState { > // SAFETY: The safety requirements of this function ensure that `ptr` points to valid > // memory, and that it has been initialised before.
On Tue, Apr 11, 2023 at 02:45:41AM -0300, Wedson Almeida Filho wrote: > From: Wedson Almeida Filho <walmeida@microsoft.com> > > It releases the lock, executes some function provided by the caller, > then reacquires the lock. This is preparation for the implementation of > condvars, which will sleep after between unlocking and relocking. > > We need an explicit `relock` method for primitives like `SpinLock` that > have an irqsave variant: we use the guard state to determine if the lock > was originally acquired with the regular `lock` function or > `lock_irqsave`. > > Reviewed-by: Martin Rodriguez Reboredo <yakoyoku@gmail.com> > Signed-off-by: Wedson Almeida Filho <walmeida@microsoft.com> > --- > v1 -> v2: No changes > v2 -> v3: No changes > v3 -> v4: No changes > > rust/kernel/sync/lock.rs | 25 +++++++++++++++++++++++++ > rust/kernel/sync/lock/spinlock.rs | 17 +++++++++++++++-- > 2 files changed, 40 insertions(+), 2 deletions(-) > > diff --git a/rust/kernel/sync/lock.rs b/rust/kernel/sync/lock.rs > index 819b8ea5ba2b..cde57756795f 100644 > --- a/rust/kernel/sync/lock.rs > +++ b/rust/kernel/sync/lock.rs > @@ -22,6 +22,9 @@ pub mod spinlock; > /// > /// - Implementers must ensure that only one thread/CPU may access the protected data once the lock > /// is owned, that is, between calls to `lock` and `unlock`. > +/// - Implementers must also ensure that `relock` uses the same locking method as the original > +/// lock operation. For example, it should disable interrupts if [`IrqSaveBackend::lock_irqsave`] > +/// is used. > pub unsafe trait Backend { > /// The state required by the lock. > type State; > @@ -55,6 +58,17 @@ pub unsafe trait Backend { > /// > /// It must only be called by the current owner of the lock. > unsafe fn unlock(ptr: *mut Self::State, guard_state: &Self::GuardState); > + > + /// Reacquires the lock, making the caller its owner. > + /// > + /// # Safety > + /// > + /// Callers must ensure that `state` comes from a previous call to [`Backend::lock`] (or I think you mean "Callers must ensure that `guard_state` comes ..." , right? Regards, Boqun > + /// variant) that has been unlocked with [`Backend::unlock`] and will be relocked now. > + unsafe fn relock(ptr: *mut Self::State, guard_state: &mut Self::GuardState) { > + // SAFETY: The safety requirements ensure that the lock is initialised. > + *guard_state = unsafe { Self::lock(ptr) }; > + } > } > > /// The "backend" of a lock that supports the irq-save variant. > @@ -164,6 +178,17 @@ pub struct Guard<'a, T: ?Sized, B: Backend> { > // SAFETY: `Guard` is sync when the data protected by the lock is also sync. > unsafe impl<T: Sync + ?Sized, B: Backend> Sync for Guard<'_, T, B> {} > > +impl<T: ?Sized, B: Backend> Guard<'_, T, B> { > + #[allow(dead_code)] > + pub(crate) fn do_unlocked(&mut self, cb: impl FnOnce()) { > + // SAFETY: The caller owns the lock, so it is safe to unlock it. > + unsafe { B::unlock(self.lock.state.get(), &self.state) }; > + cb(); > + // SAFETY: The lock was just unlocked above and is being relocked now. > + unsafe { B::relock(self.lock.state.get(), &mut self.state) }; > + } > +} > + > impl<T: ?Sized, B: Backend> core::ops::Deref for Guard<'_, T, B> { > type Target = T; > > diff --git a/rust/kernel/sync/lock/spinlock.rs b/rust/kernel/sync/lock/spinlock.rs > index 34dec09a97c0..e2a2f68e6d93 100644 > --- a/rust/kernel/sync/lock/spinlock.rs > +++ b/rust/kernel/sync/lock/spinlock.rs > @@ -4,6 +4,7 @@ > //! > //! This module allows Rust code to use the kernel's `spinlock_t`. > > +use super::IrqSaveBackend; > use crate::bindings; > > /// Creates a [`SpinLock`] initialiser with the given name and a newly-created lock class. > @@ -95,7 +96,8 @@ pub type SpinLock<T> = super::Lock<T, SpinLockBackend>; > /// A kernel `spinlock_t` lock backend. > pub struct SpinLockBackend; > > -// SAFETY: The underlying kernel `spinlock_t` object ensures mutual exclusion. > +// SAFETY: The underlying kernel `spinlock_t` object ensures mutual exclusion. `relock` uses the > +// same scheme as `unlock` to figure out which locking method was used originally. > unsafe impl super::Backend for SpinLockBackend { > type State = bindings::spinlock_t; > type GuardState = Option<core::ffi::c_ulong>; > @@ -127,13 +129,24 @@ unsafe impl super::Backend for SpinLockBackend { > None => unsafe { bindings::spin_unlock(ptr) }, > } > } > + > + unsafe fn relock(ptr: *mut Self::State, guard_state: &mut Self::GuardState) { > + let _ = match guard_state { > + // SAFETY: The safety requiments of this function ensure that `ptr` has been > + // initialised. > + None => unsafe { Self::lock(ptr) }, > + // SAFETY: The safety requiments of this function ensure that `ptr` has been > + // initialised. > + Some(_) => unsafe { Self::lock_irqsave(ptr) }, > + }; > + } > } > > // SAFETY: The underlying kernel `spinlock_t` object ensures mutual exclusion. We use the `irqsave` > // variant of the C lock acquisition functions to disable interrupts and retrieve the original > // interrupt state, and the `irqrestore` variant of the lock release functions to restore the state > // in `unlock` -- we use the guard context to determine which method was used to acquire the lock. > -unsafe impl super::IrqSaveBackend for SpinLockBackend { > +unsafe impl IrqSaveBackend for SpinLockBackend { > unsafe fn lock_irqsave(ptr: *mut Self::State) -> Self::GuardState { > // SAFETY: The safety requirements of this function ensure that `ptr` points to valid > // memory, and that it has been initialised before. > -- > 2.34.1 >
On Tue, Apr 11, 2023 at 02:45:41AM -0300, Wedson Almeida Filho wrote: [...] > + > + unsafe fn relock(ptr: *mut Self::State, guard_state: &mut Self::GuardState) { > + let _ = match guard_state { > + // SAFETY: The safety requiments of this function ensure that `ptr` has been > + // initialised. > + None => unsafe { Self::lock(ptr) }, > + // SAFETY: The safety requiments of this function ensure that `ptr` has been > + // initialised. > + Some(_) => unsafe { Self::lock_irqsave(ptr) }, > + }; > + } > } > One thing I'm little worried about the above is that we don't store back the new GuardState into `guard_state`, the particular case I'm worried about is as follow: // IRQ is enabled. // Disabling IRQ unsafe { bindings::local_irq_disable(); } let mut g = unsafe { SpinLockBackend::lock(&mut lock as *mut _) }; // `g` records irq state is "irq disabled" unsafe { SpinLockBackend::unlock(&mut lock as *mut _, &g); } // restore into "irq disabled" mode. // IRQ is disabled. // Enabling IRQ unsafe { bindings::local_irq_enable(); } // IRQ is enabled. unsafe { SpinLockBackend::relock(&mut lock as *mut _, &mut g) } // `g` still records irq state is "irq disabled" unsafe { SpinLockBackend::unlock(&mut lock as *mut _, &g); } // restore into "irq disabled" mode. // IRQ is disabled. This looks pretty scary to me, I would expect `relock()` updates the latest GuardState to the guard. Any reason it's implemented this way? Regards, Boqun > // SAFETY: The underlying kernel `spinlock_t` object ensures mutual exclusion. We use the `irqsave` > // variant of the C lock acquisition functions to disable interrupts and retrieve the original > // interrupt state, and the `irqrestore` variant of the lock release functions to restore the state > // in `unlock` -- we use the guard context to determine which method was used to acquire the lock. > -unsafe impl super::IrqSaveBackend for SpinLockBackend { > +unsafe impl IrqSaveBackend for SpinLockBackend { > unsafe fn lock_irqsave(ptr: *mut Self::State) -> Self::GuardState { > // SAFETY: The safety requirements of this function ensure that `ptr` points to valid > // memory, and that it has been initialised before. > -- > 2.34.1 >
On Wed, 12 Apr 2023 at 03:25, Boqun Feng <boqun.feng@gmail.com> wrote: > > On Tue, Apr 11, 2023 at 02:45:41AM -0300, Wedson Almeida Filho wrote: > [...] > > + > > + unsafe fn relock(ptr: *mut Self::State, guard_state: &mut Self::GuardState) { > > + let _ = match guard_state { > > + // SAFETY: The safety requiments of this function ensure that `ptr` has been > > + // initialised. > > + None => unsafe { Self::lock(ptr) }, > > + // SAFETY: The safety requiments of this function ensure that `ptr` has been > > + // initialised. > > + Some(_) => unsafe { Self::lock_irqsave(ptr) }, > > + }; > > + } > > } > > > > One thing I'm little worried about the above is that we don't store back > the new GuardState into `guard_state`, the particular case I'm worried > about is as follow: > > // IRQ is enabled. > // Disabling IRQ > unsafe { bindings::local_irq_disable(); } > > let mut g = unsafe { SpinLockBackend::lock(&mut lock as *mut _) }; > // `g` records irq state is "irq disabled" > > unsafe { SpinLockBackend::unlock(&mut lock as *mut _, &g); } > // restore into "irq disabled" mode. > // IRQ is disabled. > > // Enabling IRQ > unsafe { bindings::local_irq_enable(); } > // IRQ is enabled. > > unsafe { SpinLockBackend::relock(&mut lock as *mut _, &mut g) } > // `g` still records irq state is "irq disabled" Yes, that's by design. If you want it to record the new "irq enabled" state, then you should call `lock()`, not `relock()`. > unsafe { SpinLockBackend::unlock(&mut lock as *mut _, &g); } > // restore into "irq disabled" mode. > // IRQ is disabled. > > > This looks pretty scary to me, I would expect `relock()` updates the > latest GuardState to the guard. Any reason it's implemented this way? A `relock()` followed by an `unlock()` takes the state back to how it was when `lock()` was originally called: this is precisely why `relock()` exists. Consider the following case: ``` local_disable_irq(); let mut guard = spinlock.lock(); guard.do_unlocked(|| { local_irq_enable(); schedule(); }); drop(guard); ``` What would you expect the state to be? It's meant to be the state right before `spinlock.lock()` was called, that's what the guard represents. If you want to preserve a new state, then you don't want `relock()`, you just want a new `lock()` call. > Regards, > Boqun > > > // SAFETY: The underlying kernel `spinlock_t` object ensures mutual exclusion. We use the `irqsave` > > // variant of the C lock acquisition functions to disable interrupts and retrieve the original > > // interrupt state, and the `irqrestore` variant of the lock release functions to restore the state > > // in `unlock` -- we use the guard context to determine which method was used to acquire the lock. > > -unsafe impl super::IrqSaveBackend for SpinLockBackend { > > +unsafe impl IrqSaveBackend for SpinLockBackend { > > unsafe fn lock_irqsave(ptr: *mut Self::State) -> Self::GuardState { > > // SAFETY: The safety requirements of this function ensure that `ptr` points to valid > > // memory, and that it has been initialised before. > > -- > > 2.34.1 > >
On Tue, 11 Apr 2023 at 18:18, Boqun Feng <boqun.feng@gmail.com> wrote: > > On Tue, Apr 11, 2023 at 02:45:41AM -0300, Wedson Almeida Filho wrote: > > From: Wedson Almeida Filho <walmeida@microsoft.com> > > > > It releases the lock, executes some function provided by the caller, > > then reacquires the lock. This is preparation for the implementation of > > condvars, which will sleep after between unlocking and relocking. > > > > We need an explicit `relock` method for primitives like `SpinLock` that > > have an irqsave variant: we use the guard state to determine if the lock > > was originally acquired with the regular `lock` function or > > `lock_irqsave`. > > > > Reviewed-by: Martin Rodriguez Reboredo <yakoyoku@gmail.com> > > Signed-off-by: Wedson Almeida Filho <walmeida@microsoft.com> > > --- > > v1 -> v2: No changes > > v2 -> v3: No changes > > v3 -> v4: No changes > > > > rust/kernel/sync/lock.rs | 25 +++++++++++++++++++++++++ > > rust/kernel/sync/lock/spinlock.rs | 17 +++++++++++++++-- > > 2 files changed, 40 insertions(+), 2 deletions(-) > > > > diff --git a/rust/kernel/sync/lock.rs b/rust/kernel/sync/lock.rs > > index 819b8ea5ba2b..cde57756795f 100644 > > --- a/rust/kernel/sync/lock.rs > > +++ b/rust/kernel/sync/lock.rs > > @@ -22,6 +22,9 @@ pub mod spinlock; > > /// > > /// - Implementers must ensure that only one thread/CPU may access the protected data once the lock > > /// is owned, that is, between calls to `lock` and `unlock`. > > +/// - Implementers must also ensure that `relock` uses the same locking method as the original > > +/// lock operation. For example, it should disable interrupts if [`IrqSaveBackend::lock_irqsave`] > > +/// is used. > > pub unsafe trait Backend { > > /// The state required by the lock. > > type State; > > @@ -55,6 +58,17 @@ pub unsafe trait Backend { > > /// > > /// It must only be called by the current owner of the lock. > > unsafe fn unlock(ptr: *mut Self::State, guard_state: &Self::GuardState); > > + > > + /// Reacquires the lock, making the caller its owner. > > + /// > > + /// # Safety > > + /// > > + /// Callers must ensure that `state` comes from a previous call to [`Backend::lock`] (or > > I think you mean > > "Callers must ensure that `guard_state` comes ..." > > , right? That's right, thanks for spotting this! I renamed the parameter names (based on your feedback :)) but didn't update the comment accordingly. Will do. > Regards, > Boqun > > > + /// variant) that has been unlocked with [`Backend::unlock`] and will be relocked now. > > + unsafe fn relock(ptr: *mut Self::State, guard_state: &mut Self::GuardState) { > > + // SAFETY: The safety requirements ensure that the lock is initialised. > > + *guard_state = unsafe { Self::lock(ptr) }; > > + } > > } > > > > /// The "backend" of a lock that supports the irq-save variant. > > @@ -164,6 +178,17 @@ pub struct Guard<'a, T: ?Sized, B: Backend> { > > // SAFETY: `Guard` is sync when the data protected by the lock is also sync. > > unsafe impl<T: Sync + ?Sized, B: Backend> Sync for Guard<'_, T, B> {} > > > > +impl<T: ?Sized, B: Backend> Guard<'_, T, B> { > > + #[allow(dead_code)] > > + pub(crate) fn do_unlocked(&mut self, cb: impl FnOnce()) { > > + // SAFETY: The caller owns the lock, so it is safe to unlock it. > > + unsafe { B::unlock(self.lock.state.get(), &self.state) }; > > + cb(); > > + // SAFETY: The lock was just unlocked above and is being relocked now. > > + unsafe { B::relock(self.lock.state.get(), &mut self.state) }; > > + } > > +} > > + > > impl<T: ?Sized, B: Backend> core::ops::Deref for Guard<'_, T, B> { > > type Target = T; > > > > diff --git a/rust/kernel/sync/lock/spinlock.rs b/rust/kernel/sync/lock/spinlock.rs > > index 34dec09a97c0..e2a2f68e6d93 100644 > > --- a/rust/kernel/sync/lock/spinlock.rs > > +++ b/rust/kernel/sync/lock/spinlock.rs > > @@ -4,6 +4,7 @@ > > //! > > //! This module allows Rust code to use the kernel's `spinlock_t`. > > > > +use super::IrqSaveBackend; > > use crate::bindings; > > > > /// Creates a [`SpinLock`] initialiser with the given name and a newly-created lock class. > > @@ -95,7 +96,8 @@ pub type SpinLock<T> = super::Lock<T, SpinLockBackend>; > > /// A kernel `spinlock_t` lock backend. > > pub struct SpinLockBackend; > > > > -// SAFETY: The underlying kernel `spinlock_t` object ensures mutual exclusion. > > +// SAFETY: The underlying kernel `spinlock_t` object ensures mutual exclusion. `relock` uses the > > +// same scheme as `unlock` to figure out which locking method was used originally. > > unsafe impl super::Backend for SpinLockBackend { > > type State = bindings::spinlock_t; > > type GuardState = Option<core::ffi::c_ulong>; > > @@ -127,13 +129,24 @@ unsafe impl super::Backend for SpinLockBackend { > > None => unsafe { bindings::spin_unlock(ptr) }, > > } > > } > > + > > + unsafe fn relock(ptr: *mut Self::State, guard_state: &mut Self::GuardState) { > > + let _ = match guard_state { > > + // SAFETY: The safety requiments of this function ensure that `ptr` has been > > + // initialised. > > + None => unsafe { Self::lock(ptr) }, > > + // SAFETY: The safety requiments of this function ensure that `ptr` has been > > + // initialised. > > + Some(_) => unsafe { Self::lock_irqsave(ptr) }, > > + }; > > + } > > } > > > > // SAFETY: The underlying kernel `spinlock_t` object ensures mutual exclusion. We use the `irqsave` > > // variant of the C lock acquisition functions to disable interrupts and retrieve the original > > // interrupt state, and the `irqrestore` variant of the lock release functions to restore the state > > // in `unlock` -- we use the guard context to determine which method was used to acquire the lock. > > -unsafe impl super::IrqSaveBackend for SpinLockBackend { > > +unsafe impl IrqSaveBackend for SpinLockBackend { > > unsafe fn lock_irqsave(ptr: *mut Self::State) -> Self::GuardState { > > // SAFETY: The safety requirements of this function ensure that `ptr` points to valid > > // memory, and that it has been initialised before. > > -- > > 2.34.1 > >
On Tue, 11 Apr 2023 at 17:54, Gary Guo <gary@garyguo.net> wrote: > > On Tue, 11 Apr 2023 02:45:41 -0300 > Wedson Almeida Filho <wedsonaf@gmail.com> wrote: > > > From: Wedson Almeida Filho <walmeida@microsoft.com> > > > > It releases the lock, executes some function provided by the caller, > > then reacquires the lock. This is preparation for the implementation of > > condvars, which will sleep after between unlocking and relocking. > > > > We need an explicit `relock` method for primitives like `SpinLock` that > > have an irqsave variant: we use the guard state to determine if the lock > > was originally acquired with the regular `lock` function or > > `lock_irqsave`. > > > > Reviewed-by: Martin Rodriguez Reboredo <yakoyoku@gmail.com> > > Signed-off-by: Wedson Almeida Filho <walmeida@microsoft.com> > > --- > > v1 -> v2: No changes > > v2 -> v3: No changes > > v3 -> v4: No changes > > > > rust/kernel/sync/lock.rs | 25 +++++++++++++++++++++++++ > > rust/kernel/sync/lock/spinlock.rs | 17 +++++++++++++++-- > > 2 files changed, 40 insertions(+), 2 deletions(-) > > > > diff --git a/rust/kernel/sync/lock.rs b/rust/kernel/sync/lock.rs > > index 819b8ea5ba2b..cde57756795f 100644 > > --- a/rust/kernel/sync/lock.rs > > +++ b/rust/kernel/sync/lock.rs > > @@ -22,6 +22,9 @@ pub mod spinlock; > > /// > > /// - Implementers must ensure that only one thread/CPU may access the protected data once the lock > > /// is owned, that is, between calls to `lock` and `unlock`. > > +/// - Implementers must also ensure that `relock` uses the same locking method as the original > > +/// lock operation. For example, it should disable interrupts if [`IrqSaveBackend::lock_irqsave`] > > +/// is used. > > pub unsafe trait Backend { > > /// The state required by the lock. > > type State; > > @@ -55,6 +58,17 @@ pub unsafe trait Backend { > > /// > > /// It must only be called by the current owner of the lock. > > unsafe fn unlock(ptr: *mut Self::State, guard_state: &Self::GuardState); > > + > > + /// Reacquires the lock, making the caller its owner. > > + /// > > + /// # Safety > > + /// > > + /// Callers must ensure that `state` comes from a previous call to [`Backend::lock`] (or > > + /// variant) that has been unlocked with [`Backend::unlock`] and will be relocked now. > > + unsafe fn relock(ptr: *mut Self::State, guard_state: &mut Self::GuardState) { > > + // SAFETY: The safety requirements ensure that the lock is initialised. > > + *guard_state = unsafe { Self::lock(ptr) }; > > + } > > } > > > > /// The "backend" of a lock that supports the irq-save variant. > > @@ -164,6 +178,17 @@ pub struct Guard<'a, T: ?Sized, B: Backend> { > > // SAFETY: `Guard` is sync when the data protected by the lock is also sync. > > unsafe impl<T: Sync + ?Sized, B: Backend> Sync for Guard<'_, T, B> {} > > > > +impl<T: ?Sized, B: Backend> Guard<'_, T, B> { > > + #[allow(dead_code)] > > + pub(crate) fn do_unlocked(&mut self, cb: impl FnOnce()) { > > + // SAFETY: The caller owns the lock, so it is safe to unlock it. > > + unsafe { B::unlock(self.lock.state.get(), &self.state) }; > > + cb(); > > + // SAFETY: The lock was just unlocked above and is being relocked now. > > + unsafe { B::relock(self.lock.state.get(), &mut self.state) }; > > This should be > > let _guard = ScopeGuard::new(|| unsafe { > B::relock(self.lock.state.get(), &mut self.state) } > }); > cb(); > > Although we currently use `-Cpanic=abort`, I think as a general rule we > should still try to make code unwind-safe, so it can remain sound if > someone takes the code and use it for userspace (e.g. for testing > purpose, or maybe sharing codebase with tools). Good point. Although this has not been something we cared about in the last couple of years because we abort, I think we should carefully review code for this as we upstream. It is also important for async scenarios: we need to go back to a consistent state when we tear down `Future` instances. > > + } > > +} > > + > > impl<T: ?Sized, B: Backend> core::ops::Deref for Guard<'_, T, B> { > > type Target = T; > > > > diff --git a/rust/kernel/sync/lock/spinlock.rs b/rust/kernel/sync/lock/spinlock.rs > > index 34dec09a97c0..e2a2f68e6d93 100644 > > --- a/rust/kernel/sync/lock/spinlock.rs > > +++ b/rust/kernel/sync/lock/spinlock.rs > > @@ -4,6 +4,7 @@ > > //! > > //! This module allows Rust code to use the kernel's `spinlock_t`. > > > > +use super::IrqSaveBackend; > > use crate::bindings; > > > > /// Creates a [`SpinLock`] initialiser with the given name and a newly-created lock class. > > @@ -95,7 +96,8 @@ pub type SpinLock<T> = super::Lock<T, SpinLockBackend>; > > /// A kernel `spinlock_t` lock backend. > > pub struct SpinLockBackend; > > > > -// SAFETY: The underlying kernel `spinlock_t` object ensures mutual exclusion. > > +// SAFETY: The underlying kernel `spinlock_t` object ensures mutual exclusion. `relock` uses the > > +// same scheme as `unlock` to figure out which locking method was used originally. > > unsafe impl super::Backend for SpinLockBackend { > > type State = bindings::spinlock_t; > > type GuardState = Option<core::ffi::c_ulong>; > > @@ -127,13 +129,24 @@ unsafe impl super::Backend for SpinLockBackend { > > None => unsafe { bindings::spin_unlock(ptr) }, > > } > > } > > + > > + unsafe fn relock(ptr: *mut Self::State, guard_state: &mut Self::GuardState) { > > + let _ = match guard_state { > > + // SAFETY: The safety requiments of this function ensure that `ptr` has been > > + // initialised. > > + None => unsafe { Self::lock(ptr) }, > > + // SAFETY: The safety requiments of this function ensure that `ptr` has been > > + // initialised. > > + Some(_) => unsafe { Self::lock_irqsave(ptr) }, > > + }; > > + } > > } > > > > // SAFETY: The underlying kernel `spinlock_t` object ensures mutual exclusion. We use the `irqsave` > > // variant of the C lock acquisition functions to disable interrupts and retrieve the original > > // interrupt state, and the `irqrestore` variant of the lock release functions to restore the state > > // in `unlock` -- we use the guard context to determine which method was used to acquire the lock. > > -unsafe impl super::IrqSaveBackend for SpinLockBackend { > > +unsafe impl IrqSaveBackend for SpinLockBackend { > > unsafe fn lock_irqsave(ptr: *mut Self::State) -> Self::GuardState { > > // SAFETY: The safety requirements of this function ensure that `ptr` points to valid > > // memory, and that it has been initialised before. >
On Wed, Apr 12, 2023 at 08:07:40AM -0300, Wedson Almeida Filho wrote: > On Wed, 12 Apr 2023 at 03:25, Boqun Feng <boqun.feng@gmail.com> wrote: > > > > On Tue, Apr 11, 2023 at 02:45:41AM -0300, Wedson Almeida Filho wrote: > > [...] > > > + > > > + unsafe fn relock(ptr: *mut Self::State, guard_state: &mut Self::GuardState) { > > > + let _ = match guard_state { > > > + // SAFETY: The safety requiments of this function ensure that `ptr` has been > > > + // initialised. > > > + None => unsafe { Self::lock(ptr) }, > > > + // SAFETY: The safety requiments of this function ensure that `ptr` has been > > > + // initialised. > > > + Some(_) => unsafe { Self::lock_irqsave(ptr) }, > > > + }; > > > + } > > > } > > > > > > > One thing I'm little worried about the above is that we don't store back > > the new GuardState into `guard_state`, the particular case I'm worried > > about is as follow: > > > > // IRQ is enabled. > > // Disabling IRQ > > unsafe { bindings::local_irq_disable(); } > > > > let mut g = unsafe { SpinLockBackend::lock(&mut lock as *mut _) }; > > // `g` records irq state is "irq disabled" > > > > unsafe { SpinLockBackend::unlock(&mut lock as *mut _, &g); } > > // restore into "irq disabled" mode. > > // IRQ is disabled. > > > > // Enabling IRQ > > unsafe { bindings::local_irq_enable(); } > > // IRQ is enabled. > > > > unsafe { SpinLockBackend::relock(&mut lock as *mut _, &mut g) } > > // `g` still records irq state is "irq disabled" > > Yes, that's by design. If you want it to record the new "irq enabled" > state, then you should call `lock()`, not `relock()`. > > > unsafe { SpinLockBackend::unlock(&mut lock as *mut _, &g); } > > // restore into "irq disabled" mode. > > // IRQ is disabled. > > > > > > This looks pretty scary to me, I would expect `relock()` updates the > > latest GuardState to the guard. Any reason it's implemented this way? > > A `relock()` followed by an `unlock()` takes the state back to how it > was when `lock()` was originally called: this is precisely why > `relock()` exists. > > Consider the following case: > > ``` > local_disable_irq(); > let mut guard = spinlock.lock(); I think you meant `spinlock.lock_irqsave()` here, right? > > guard.do_unlocked(|| { > local_irq_enable(); > schedule(); > }); > > drop(guard); > ``` > > What would you expect the state to be? It's meant to be the state I understand your point but I would expect people to code like: ``` local_disable_irq(); let mut guard = spinlock.lock(); // or lock_irqsave(), doesn't matter guard.do_unlocked(|| { local_irq_enable(); schedule(); local_irq_disable(); }); drop(guard); ``` And the closure in do_unlocked() can also be something like: ``` guard.do_unlocked(|| { local_irq_enabled(); let _g = ScopeGuard::new(|| { local_irq_disabled(); }); schedule(); if (some_cond) { return; // return early } if (other_cond) { return; } }) ``` One benefit (other that code looks symmetric) is we can use the same closure in other place. Also it helps klint since we keep the irq enablement state change as local as possible: we can go ahead and require irq enabled state should not be changed between the closure in do_unlock(). Maybe I'm missing something, but the current `relock` semantics is really tricky to get ;-) Regards, Boqun > right before `spinlock.lock()` was called, that's what the guard > represents. > > If you want to preserve a new state, then you don't want `relock()`, > you just want a new `lock()` call. > > > Regards, > > Boqun > > > > > // SAFETY: The underlying kernel `spinlock_t` object ensures mutual exclusion. We use the `irqsave` > > > // variant of the C lock acquisition functions to disable interrupts and retrieve the original > > > // interrupt state, and the `irqrestore` variant of the lock release functions to restore the state > > > // in `unlock` -- we use the guard context to determine which method was used to acquire the lock. > > > -unsafe impl super::IrqSaveBackend for SpinLockBackend { > > > +unsafe impl IrqSaveBackend for SpinLockBackend { > > > unsafe fn lock_irqsave(ptr: *mut Self::State) -> Self::GuardState { > > > // SAFETY: The safety requirements of this function ensure that `ptr` points to valid > > > // memory, and that it has been initialised before. > > > -- > > > 2.34.1 > > >
On Wed, 12 Apr 2023 at 11:35, Boqun Feng <boqun.feng@gmail.com> wrote: > > On Wed, Apr 12, 2023 at 08:07:40AM -0300, Wedson Almeida Filho wrote: > > On Wed, 12 Apr 2023 at 03:25, Boqun Feng <boqun.feng@gmail.com> wrote: > > > > > > On Tue, Apr 11, 2023 at 02:45:41AM -0300, Wedson Almeida Filho wrote: > > > [...] > > > > + > > > > + unsafe fn relock(ptr: *mut Self::State, guard_state: &mut Self::GuardState) { > > > > + let _ = match guard_state { > > > > + // SAFETY: The safety requiments of this function ensure that `ptr` has been > > > > + // initialised. > > > > + None => unsafe { Self::lock(ptr) }, > > > > + // SAFETY: The safety requiments of this function ensure that `ptr` has been > > > > + // initialised. > > > > + Some(_) => unsafe { Self::lock_irqsave(ptr) }, > > > > + }; > > > > + } > > > > } > > > > > > > > > > One thing I'm little worried about the above is that we don't store back > > > the new GuardState into `guard_state`, the particular case I'm worried > > > about is as follow: > > > > > > // IRQ is enabled. > > > // Disabling IRQ > > > unsafe { bindings::local_irq_disable(); } > > > > > > let mut g = unsafe { SpinLockBackend::lock(&mut lock as *mut _) }; > > > // `g` records irq state is "irq disabled" > > > > > > unsafe { SpinLockBackend::unlock(&mut lock as *mut _, &g); } > > > // restore into "irq disabled" mode. > > > // IRQ is disabled. > > > > > > // Enabling IRQ > > > unsafe { bindings::local_irq_enable(); } > > > // IRQ is enabled. > > > > > > unsafe { SpinLockBackend::relock(&mut lock as *mut _, &mut g) } > > > // `g` still records irq state is "irq disabled" > > > > Yes, that's by design. If you want it to record the new "irq enabled" > > state, then you should call `lock()`, not `relock()`. > > > > > unsafe { SpinLockBackend::unlock(&mut lock as *mut _, &g); } > > > // restore into "irq disabled" mode. > > > // IRQ is disabled. > > > > > > > > > This looks pretty scary to me, I would expect `relock()` updates the > > > latest GuardState to the guard. Any reason it's implemented this way? > > > > A `relock()` followed by an `unlock()` takes the state back to how it > > was when `lock()` was originally called: this is precisely why > > `relock()` exists. > > > > Consider the following case: > > > > ``` > > local_disable_irq(); > > let mut guard = spinlock.lock(); > > I think you meant `spinlock.lock_irqsave()` here, right? Yes, sorry, I meant `lock_irqsave()`. > > > > guard.do_unlocked(|| { > > local_irq_enable(); > > schedule(); > > }); > > > > drop(guard); > > ``` > > > > What would you expect the state to be? It's meant to be the state > > I understand your point but I would expect people to code like: > > ``` > local_disable_irq(); > let mut guard = spinlock.lock(); // or lock_irqsave(), doesn't matter > > guard.do_unlocked(|| { > local_irq_enable(); > schedule(); > local_irq_disable(); > }); > > drop(guard); > ``` Well, `relock` works with the code above as well. > And the closure in do_unlocked() can also be something like: > ``` > guard.do_unlocked(|| { > local_irq_enabled(); > let _g = ScopeGuard::new(|| { > local_irq_disabled(); > }); > > schedule(); > > if (some_cond) { > return; // return early > } > > if (other_cond) { > return; > } > }) > > ``` > > One benefit (other that code looks symmetric) is we can use the same > closure in other place. Also it helps klint since we keep the irq > enablement state change as local as possible: we can go ahead and > require irq enabled state should not be changed between the closure in > do_unlock(). Note that the only user of `do_unlocked` at the moment works for any type of lock, including mutexes, so we can't really have this kind of code there. All irq handling needs to happen on the backends. > Maybe I'm missing something, but the current `relock` semantics is > really tricky to get ;-) It seems straightforward to me: reacquire the lock in the same mode as the original lock() call (e.g., lock() vs lock_irqsave()) such that the `unlock()` will restore any state it manages to what it was right before the original locking call. But callers are not going to deal with these unsafe backend functions directly, they'll deal with guards, so the high-level requirement that `relock()` enforces is the following, given something like: ``` // 1 let guard = spinlock.lock_irqsave(); // Some code, which may include calls to a condvar, and may change the irq state. drop(guard); // 2 ``` At 2, the irq state must be the same as in 1, that's why one would use the `lock_irqsave` variant. This is a common pattern (seen in a bunch of unrelated places): save the current state, make changes to the state, and eventually restore the saved state (independently of what changes were made between saving and restoring). > Regards, > Boqun > > > right before `spinlock.lock()` was called, that's what the guard > > represents. > > > > If you want to preserve a new state, then you don't want `relock()`, > > you just want a new `lock()` call. > > > > > Regards, > > > Boqun > > > > > > > // SAFETY: The underlying kernel `spinlock_t` object ensures mutual exclusion. We use the `irqsave` > > > > // variant of the C lock acquisition functions to disable interrupts and retrieve the original > > > > // interrupt state, and the `irqrestore` variant of the lock release functions to restore the state > > > > // in `unlock` -- we use the guard context to determine which method was used to acquire the lock. > > > > -unsafe impl super::IrqSaveBackend for SpinLockBackend { > > > > +unsafe impl IrqSaveBackend for SpinLockBackend { > > > > unsafe fn lock_irqsave(ptr: *mut Self::State) -> Self::GuardState { > > > > // SAFETY: The safety requirements of this function ensure that `ptr` points to valid > > > > // memory, and that it has been initialised before. > > > > -- > > > > 2.34.1 > > > >
diff --git a/rust/kernel/sync/lock.rs b/rust/kernel/sync/lock.rs index 819b8ea5ba2b..cde57756795f 100644 --- a/rust/kernel/sync/lock.rs +++ b/rust/kernel/sync/lock.rs @@ -22,6 +22,9 @@ pub mod spinlock; /// /// - Implementers must ensure that only one thread/CPU may access the protected data once the lock /// is owned, that is, between calls to `lock` and `unlock`. +/// - Implementers must also ensure that `relock` uses the same locking method as the original +/// lock operation. For example, it should disable interrupts if [`IrqSaveBackend::lock_irqsave`] +/// is used. pub unsafe trait Backend { /// The state required by the lock. type State; @@ -55,6 +58,17 @@ pub unsafe trait Backend { /// /// It must only be called by the current owner of the lock. unsafe fn unlock(ptr: *mut Self::State, guard_state: &Self::GuardState); + + /// Reacquires the lock, making the caller its owner. + /// + /// # Safety + /// + /// Callers must ensure that `state` comes from a previous call to [`Backend::lock`] (or + /// variant) that has been unlocked with [`Backend::unlock`] and will be relocked now. + unsafe fn relock(ptr: *mut Self::State, guard_state: &mut Self::GuardState) { + // SAFETY: The safety requirements ensure that the lock is initialised. + *guard_state = unsafe { Self::lock(ptr) }; + } } /// The "backend" of a lock that supports the irq-save variant. @@ -164,6 +178,17 @@ pub struct Guard<'a, T: ?Sized, B: Backend> { // SAFETY: `Guard` is sync when the data protected by the lock is also sync. unsafe impl<T: Sync + ?Sized, B: Backend> Sync for Guard<'_, T, B> {} +impl<T: ?Sized, B: Backend> Guard<'_, T, B> { + #[allow(dead_code)] + pub(crate) fn do_unlocked(&mut self, cb: impl FnOnce()) { + // SAFETY: The caller owns the lock, so it is safe to unlock it. + unsafe { B::unlock(self.lock.state.get(), &self.state) }; + cb(); + // SAFETY: The lock was just unlocked above and is being relocked now. + unsafe { B::relock(self.lock.state.get(), &mut self.state) }; + } +} + impl<T: ?Sized, B: Backend> core::ops::Deref for Guard<'_, T, B> { type Target = T; diff --git a/rust/kernel/sync/lock/spinlock.rs b/rust/kernel/sync/lock/spinlock.rs index 34dec09a97c0..e2a2f68e6d93 100644 --- a/rust/kernel/sync/lock/spinlock.rs +++ b/rust/kernel/sync/lock/spinlock.rs @@ -4,6 +4,7 @@ //! //! This module allows Rust code to use the kernel's `spinlock_t`. +use super::IrqSaveBackend; use crate::bindings; /// Creates a [`SpinLock`] initialiser with the given name and a newly-created lock class. @@ -95,7 +96,8 @@ pub type SpinLock<T> = super::Lock<T, SpinLockBackend>; /// A kernel `spinlock_t` lock backend. pub struct SpinLockBackend; -// SAFETY: The underlying kernel `spinlock_t` object ensures mutual exclusion. +// SAFETY: The underlying kernel `spinlock_t` object ensures mutual exclusion. `relock` uses the +// same scheme as `unlock` to figure out which locking method was used originally. unsafe impl super::Backend for SpinLockBackend { type State = bindings::spinlock_t; type GuardState = Option<core::ffi::c_ulong>; @@ -127,13 +129,24 @@ unsafe impl super::Backend for SpinLockBackend { None => unsafe { bindings::spin_unlock(ptr) }, } } + + unsafe fn relock(ptr: *mut Self::State, guard_state: &mut Self::GuardState) { + let _ = match guard_state { + // SAFETY: The safety requiments of this function ensure that `ptr` has been + // initialised. + None => unsafe { Self::lock(ptr) }, + // SAFETY: The safety requiments of this function ensure that `ptr` has been + // initialised. + Some(_) => unsafe { Self::lock_irqsave(ptr) }, + }; + } } // SAFETY: The underlying kernel `spinlock_t` object ensures mutual exclusion. We use the `irqsave` // variant of the C lock acquisition functions to disable interrupts and retrieve the original // interrupt state, and the `irqrestore` variant of the lock release functions to restore the state // in `unlock` -- we use the guard context to determine which method was used to acquire the lock. -unsafe impl super::IrqSaveBackend for SpinLockBackend { +unsafe impl IrqSaveBackend for SpinLockBackend { unsafe fn lock_irqsave(ptr: *mut Self::State) -> Self::GuardState { // SAFETY: The safety requirements of this function ensure that `ptr` points to valid // memory, and that it has been initialised before.