From mboxrd@z Thu Jan 1 00:00:00 1970 Return-Path: X-Spam-Checker-Version: SpamAssassin 3.4.0 (2014-02-07) on aws-us-west-2-korg-lkml-1.web.codeaurora.org Received: from vger.kernel.org (vger.kernel.org [23.128.96.18]) by smtp.lore.kernel.org (Postfix) with ESMTP id 1777EC38145 for ; Thu, 8 Sep 2022 00:26:35 +0000 (UTC) Received: (majordomo@vger.kernel.org) by vger.kernel.org via listexpand id S229853AbiIHA0c (ORCPT ); Wed, 7 Sep 2022 20:26:32 -0400 Received: from lindbergh.monkeyblade.net ([23.128.96.19]:34620 "EHLO lindbergh.monkeyblade.net" rhost-flags-OK-OK-OK-OK) by vger.kernel.org with ESMTP id S229673AbiIHA0b (ORCPT ); Wed, 7 Sep 2022 20:26:31 -0400 Received: from mx0a-00082601.pphosted.com (mx0b-00082601.pphosted.com [67.231.153.30]) by lindbergh.monkeyblade.net (Postfix) with ESMTPS id 7EFC613F7B for ; Wed, 7 Sep 2022 17:26:30 -0700 (PDT) Received: from pps.filterd (m0089730.ppops.net [127.0.0.1]) by m0089730.ppops.net (8.17.1.5/8.17.1.5) with ESMTP id 287Hndq7020481 for ; Wed, 7 Sep 2022 17:26:29 -0700 DKIM-Signature: v=1; a=rsa-sha256; c=relaxed/relaxed; d=fb.com; h=from : to : cc : subject : date : message-id : in-reply-to : references : mime-version : content-transfer-encoding : content-type; s=facebook; bh=dDEz00zliKIpzfOoURpM+cs2uiLbplotBqEkHQfuUf8=; b=iIPlJXM7C2TU+OE61FhNgf8RLiK3Gmsq9m5tg5qfPyULlzkqsGNnQX6tAjgAuBqTUaAU 1gLsrMw64sAaHykWvXDKop1rVxtSrP4TovLRxUTGqOMHt8oUOjzMVxuS/xp9snszxrru g3r6CBziOoRYsTaAZemUGg2cwI+l/9qXXZI= Received: from mail.thefacebook.com ([163.114.132.120]) by m0089730.ppops.net (PPS) with ESMTPS id 3jee6bgeuc-1 (version=TLSv1.2 cipher=ECDHE-RSA-AES128-GCM-SHA256 bits=128 verify=NOT) for ; Wed, 07 Sep 2022 17:26:29 -0700 Received: from twshared15978.04.prn5.facebook.com (2620:10d:c085:208::11) by mail.thefacebook.com (2620:10d:c085:21d::5) with Microsoft SMTP Server (version=TLS1_2, cipher=TLS_ECDHE_RSA_WITH_AES_128_GCM_SHA256) id 15.1.2375.31; Wed, 7 Sep 2022 17:26:28 -0700 Received: by dev1180.prn1.facebook.com (Postfix, from userid 425415) id B794D1D2F036; Wed, 7 Sep 2022 17:26:19 -0700 (PDT) From: Stefan Roesch To: , , CC: , , , Subject: [PATCH v2 02/12] btrfs: implement a nowait option for tree searches Date: Wed, 7 Sep 2022 17:26:06 -0700 Message-ID: <20220908002616.3189675-3-shr@fb.com> X-Mailer: git-send-email 2.30.2 In-Reply-To: <20220908002616.3189675-1-shr@fb.com> References: <20220908002616.3189675-1-shr@fb.com> MIME-Version: 1.0 Content-Transfer-Encoding: quoted-printable X-FB-Internal: Safe Content-Type: text/plain X-Proofpoint-ORIG-GUID: NFcM8-THOXb1JmI_Kbgywj-MkABhaHrw X-Proofpoint-GUID: NFcM8-THOXb1JmI_Kbgywj-MkABhaHrw X-Proofpoint-Virus-Version: vendor=baseguard engine=ICAP:2.0.205,Aquarius:18.0.895,Hydra:6.0.528,FMLib:17.11.122.1 definitions=2022-09-07_10,2022-09-07_02,2022-06-22_01 Precedence: bulk List-ID: X-Mailing-List: io-uring@vger.kernel.org From: Josef Bacik For NOWAIT IOCB's we'll need a way to tell search to not wait on locks or anything. Accomplish this by adding a path->nowait flag that will use trylocks and skip reading of metadata, returning -EWOULDBLOCK in either of these cases. For now we only need this for reads, so only the read side is handled. Add an ASSERT() to catch anybody trying to use this for writes so they know they'll have to implement the write side. Signed-off-by: Josef Bacik Signed-off-by: Stefan Roesch --- fs/btrfs/ctree.c | 39 ++++++++++++++++++++++++++++++++++++--- fs/btrfs/ctree.h | 1 + fs/btrfs/locking.c | 23 +++++++++++++++++++++++ fs/btrfs/locking.h | 1 + 4 files changed, 61 insertions(+), 3 deletions(-) diff --git a/fs/btrfs/ctree.c b/fs/btrfs/ctree.c index ebfa35fe1c38..71b238364939 100644 --- a/fs/btrfs/ctree.c +++ b/fs/btrfs/ctree.c @@ -1447,6 +1447,11 @@ read_block_for_search(struct btrfs_root *root, str= uct btrfs_path *p, return 0; } =20 + if (p->nowait) { + free_extent_buffer(tmp); + return -EAGAIN; + } + if (unlock_up) btrfs_unlock_up_safe(p, level + 1); =20 @@ -1467,6 +1472,8 @@ read_block_for_search(struct btrfs_root *root, stru= ct btrfs_path *p, ret =3D -EAGAIN; =20 goto out; + } else if (p->nowait) { + return -EAGAIN; } =20 if (unlock_up) { @@ -1634,7 +1641,13 @@ static struct extent_buffer *btrfs_search_slot_get= _root(struct btrfs_root *root, * We don't know the level of the root node until we actually * have it read locked */ - b =3D btrfs_read_lock_root_node(root); + if (p->nowait) { + b =3D btrfs_try_read_lock_root_node(root); + if (IS_ERR(b)) + return b; + } else { + b =3D btrfs_read_lock_root_node(root); + } level =3D btrfs_header_level(b); if (level > write_lock_level) goto out; @@ -1910,6 +1923,13 @@ int btrfs_search_slot(struct btrfs_trans_handle *t= rans, struct btrfs_root *root, WARN_ON(p->nodes[0] !=3D NULL); BUG_ON(!cow && ins_len); =20 + /* + * For now only allow nowait for read only operations. There's no + * strict reason why we can't, we just only need it for reads so I'm + * only implementing it for reads right now. + */ + ASSERT(!p->nowait || !cow); + if (ins_len < 0) { lowest_unlock =3D 2; =20 @@ -1936,7 +1956,12 @@ int btrfs_search_slot(struct btrfs_trans_handle *t= rans, struct btrfs_root *root, =20 if (p->need_commit_sem) { ASSERT(p->search_commit_root); - down_read(&fs_info->commit_root_sem); + if (p->nowait) { + if (!down_read_trylock(&fs_info->commit_root_sem)) + return -EAGAIN; + } else { + down_read(&fs_info->commit_root_sem); + } } =20 again: @@ -2082,7 +2107,15 @@ int btrfs_search_slot(struct btrfs_trans_handle *t= rans, struct btrfs_root *root, btrfs_tree_lock(b); p->locks[level] =3D BTRFS_WRITE_LOCK; } else { - btrfs_tree_read_lock(b); + if (p->nowait) { + if (!btrfs_try_tree_read_lock(b)) { + free_extent_buffer(b); + ret =3D -EAGAIN; + goto done; + } + } else { + btrfs_tree_read_lock(b); + } p->locks[level] =3D BTRFS_READ_LOCK; } p->nodes[level] =3D b; diff --git a/fs/btrfs/ctree.h b/fs/btrfs/ctree.h index 9ef162dbd4bc..d6d05450198d 100644 --- a/fs/btrfs/ctree.h +++ b/fs/btrfs/ctree.h @@ -443,6 +443,7 @@ struct btrfs_path { * header (ie. sizeof(struct btrfs_item) is not included). */ unsigned int search_for_extension:1; + unsigned int nowait:1; }; #define BTRFS_MAX_EXTENT_ITEM_SIZE(r) ((BTRFS_LEAF_DATA_SIZE(r->fs_info)= >> 4) - \ sizeof(struct btrfs_item)) diff --git a/fs/btrfs/locking.c b/fs/btrfs/locking.c index 9063072b399b..d6c88922d3e2 100644 --- a/fs/btrfs/locking.c +++ b/fs/btrfs/locking.c @@ -285,6 +285,29 @@ struct extent_buffer *btrfs_read_lock_root_node(stru= ct btrfs_root *root) return eb; } =20 +/* + * Loop around taking references on and locking the root node of the tre= e in + * nowait mode until we end up with a lock on the root node or returning= to + * avoid blocking. + * + * Return: root extent buffer with read lock held or -EWOULDBLOCK. + */ +struct extent_buffer *btrfs_try_read_lock_root_node(struct btrfs_root *r= oot) +{ + struct extent_buffer *eb; + + while (1) { + eb =3D btrfs_root_node(root); + if (!btrfs_try_tree_read_lock(eb)) + return ERR_PTR(-EAGAIN); + if (eb =3D=3D root->node) + break; + btrfs_tree_read_unlock(eb); + free_extent_buffer(eb); + } + return eb; +} + /* * DREW locks * =3D=3D=3D=3D=3D=3D=3D=3D=3D=3D diff --git a/fs/btrfs/locking.h b/fs/btrfs/locking.h index ab268be09bb5..490c7a79e995 100644 --- a/fs/btrfs/locking.h +++ b/fs/btrfs/locking.h @@ -94,6 +94,7 @@ int btrfs_try_tree_read_lock(struct extent_buffer *eb); int btrfs_try_tree_write_lock(struct extent_buffer *eb); struct extent_buffer *btrfs_lock_root_node(struct btrfs_root *root); struct extent_buffer *btrfs_read_lock_root_node(struct btrfs_root *root)= ; +struct extent_buffer *btrfs_try_read_lock_root_node(struct btrfs_root *r= oot); =20 #ifdef CONFIG_BTRFS_DEBUG static inline void btrfs_assert_tree_write_locked(struct extent_buffer *= eb) --=20 2.30.2