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 X-Spam-Level: X-Spam-Status: No, score=-13.6 required=3.0 tests=BAYES_00,DKIM_INVALID, DKIM_SIGNED,HEADER_FROM_DIFFERENT_DOMAINS,INCLUDES_CR_TRAILER,INCLUDES_PATCH, MAILING_LIST_MULTI,SPF_HELO_NONE,SPF_PASS,URIBL_BLOCKED autolearn=ham autolearn_force=no version=3.4.0 Received: from mail.kernel.org (mail.kernel.org [198.145.29.99]) by smtp.lore.kernel.org (Postfix) with ESMTP id 20A45C433E0 for ; Mon, 22 Mar 2021 16:03:03 +0000 (UTC) Received: from kanga.kvack.org (kanga.kvack.org [205.233.56.17]) by mail.kernel.org (Postfix) with ESMTP id 8F97C619A6 for ; Mon, 22 Mar 2021 16:03:02 +0000 (UTC) DMARC-Filter: OpenDMARC Filter v1.3.2 mail.kernel.org 8F97C619A6 Authentication-Results: mail.kernel.org; dmarc=fail (p=none dis=none) header.from=redhat.com Authentication-Results: mail.kernel.org; spf=pass smtp.mailfrom=owner-linux-mm@kvack.org Received: by kanga.kvack.org (Postfix) id 76EEA6B00E9; Mon, 22 Mar 2021 11:44:11 -0400 (EDT) Received: by kanga.kvack.org (Postfix, from userid 40) id 745086B00EA; Mon, 22 Mar 2021 11:44:11 -0400 (EDT) X-Delivered-To: int-list-linux-mm@kvack.org Received: by kanga.kvack.org (Postfix, from userid 63042) id 5E7DC6B00EB; Mon, 22 Mar 2021 11:44:11 -0400 (EDT) X-Delivered-To: linux-mm@kvack.org Received: from forelay.hostedemail.com (smtprelay0114.hostedemail.com [216.40.44.114]) by kanga.kvack.org (Postfix) with ESMTP id 4185C6B00E9 for ; Mon, 22 Mar 2021 11:44:11 -0400 (EDT) Received: from smtpin05.hostedemail.com (10.5.19.251.rfc1918.com [10.5.19.251]) by forelay03.hostedemail.com (Postfix) with ESMTP id A89FF8249980 for ; Mon, 22 Mar 2021 16:03:01 +0000 (UTC) X-FDA: 77947978962.05.97CE850 Received: from us-smtp-delivery-124.mimecast.com (us-smtp-delivery-124.mimecast.com [216.205.24.124]) by imf27.hostedemail.com (Postfix) with ESMTP id 3F2C5801C7C6 for ; Mon, 22 Mar 2021 16:02:50 +0000 (UTC) DKIM-Signature: v=1; a=rsa-sha256; c=relaxed/relaxed; d=redhat.com; s=mimecast20190719; t=1616428970; h=from:from:reply-to:subject:subject:date:date:message-id:message-id: to:to:cc:cc:mime-version:mime-version: content-transfer-encoding:content-transfer-encoding: in-reply-to:in-reply-to:references:references; bh=LqOpzQ5E3UoOxNTBZgEFRvoRZrE/JCGJXNffde/NB38=; b=NR8zyZrm38s3agy6c2shzUgRCNcO7e/i2ipVw1apn5wBfv5NXpbDze6Eoe4uhX3wYSJNDm 7TL2SWOGbA5HHw1/ut/czbFLwju8pXSTAPftL44yKDsQprPa2/w2FThscDEfV/cegHQoz0 RjATIGShs19T06vTTnGKV/1MApDneuE= Received: from mimecast-mx01.redhat.com (mimecast-mx01.redhat.com [209.132.183.4]) (Using TLS) by relay.mimecast.com with ESMTP id us-mta-233-_gux_uh5O-SwGLTpjNedKQ-1; Mon, 22 Mar 2021 12:02:45 -0400 X-MC-Unique: _gux_uh5O-SwGLTpjNedKQ-1 Received: from smtp.corp.redhat.com (int-mx01.intmail.prod.int.phx2.redhat.com [10.5.11.11]) (using TLSv1.2 with cipher AECDH-AES256-SHA (256/256 bits)) (No client certificate requested) by mimecast-mx01.redhat.com (Postfix) with ESMTPS id C7303107B786; Mon, 22 Mar 2021 16:02:42 +0000 (UTC) Received: from t480s.redhat.com (ovpn-115-54.ams2.redhat.com [10.36.115.54]) by smtp.corp.redhat.com (Postfix) with ESMTP id 448B29CA0; Mon, 22 Mar 2021 16:02:37 +0000 (UTC) From: David Hildenbrand To: linux-kernel@vger.kernel.org Cc: linux-mm@kvack.org, David Hildenbrand , Andrew Morton , Greg Kroah-Hartman , Dan Williams , Daniel Vetter , Andy Shevchenko , Mauro Carvalho Chehab , Dave Young , Baoquan He , Vivek Goyal , Dave Hansen , Keith Busch , Michal Hocko , Qian Cai , Oscar Salvador , Eric Biederman , Thomas Gleixner , Ingo Molnar , Borislav Petkov , "H. Peter Anvin" , Tom Lendacky , Brijesh Singh , x86@kernel.org, kexec@lists.infradead.org Subject: [PATCH v1 3/3] kernel/resource: remove first_lvl / siblings_only logic Date: Mon, 22 Mar 2021 17:02:00 +0100 Message-Id: <20210322160200.19633-4-david@redhat.com> In-Reply-To: <20210322160200.19633-1-david@redhat.com> References: <20210322160200.19633-1-david@redhat.com> MIME-Version: 1.0 X-Scanned-By: MIMEDefang 2.79 on 10.5.11.11 X-Stat-Signature: 3yfk7tiqzfi6kst61dydpbmf39nyxxeb X-Rspamd-Server: rspam02 X-Rspamd-Queue-Id: 3F2C5801C7C6 Received-SPF: none (redhat.com>: No applicable sender policy available) receiver=imf27; identity=mailfrom; envelope-from=""; helo=us-smtp-delivery-124.mimecast.com; client-ip=216.205.24.124 X-HE-DKIM-Result: pass/pass X-HE-Tag: 1616428970-955941 Content-Transfer-Encoding: quoted-printable X-Bogosity: Ham, tests=bogofilter, spamicity=0.000000, version=1.2.4 Sender: owner-linux-mm@kvack.org Precedence: bulk X-Loop: owner-majordomo@kvack.org List-ID: All IORESOURCE_SYSTEM_RAM and IORESOURCE_MEM now properly consider the whole resource tree, not just the first level. Let's drop the unused first_lvl / siblings_only logic. All functions properly search the whole tree, so remove documentation that indicates that some functions behave differently. Cc: Andrew Morton Cc: Greg Kroah-Hartman Cc: Dan Williams Cc: Daniel Vetter Cc: Andy Shevchenko Cc: Mauro Carvalho Chehab Cc: Signed-off-by: David Hildenbrand Cc: Dave Young Cc: Baoquan He Cc: Vivek Goyal Cc: Dave Hansen Cc: Keith Busch Cc: Michal Hocko Cc: Qian Cai Cc: Oscar Salvador Cc: Eric Biederman Cc: Thomas Gleixner Cc: Ingo Molnar Cc: Borislav Petkov Cc: "H. Peter Anvin" Cc: Tom Lendacky Cc: Brijesh Singh Cc: x86@kernel.org Cc: kexec@lists.infradead.org Signed-off-by: David Hildenbrand --- kernel/resource.c | 45 ++++++++++++--------------------------------- 1 file changed, 12 insertions(+), 33 deletions(-) diff --git a/kernel/resource.c b/kernel/resource.c index 16e0c7e8ed24..7e00239a023a 100644 --- a/kernel/resource.c +++ b/kernel/resource.c @@ -64,12 +64,8 @@ static DEFINE_RWLOCK(resource_lock); static struct resource *bootmem_resource_free; static DEFINE_SPINLOCK(bootmem_resource_lock); =20 -static struct resource *next_resource(struct resource *p, bool sibling_o= nly) +static struct resource *next_resource(struct resource *p) { - /* Caller wants to traverse through siblings only */ - if (sibling_only) - return p->sibling; - if (p->child) return p->child; while (!p->sibling && p->parent) @@ -81,7 +77,7 @@ static void *r_next(struct seq_file *m, void *v, loff_t= *pos) { struct resource *p =3D v; (*pos)++; - return (void *)next_resource(p, false); + return (void *)next_resource(p); } =20 #ifdef CONFIG_PROC_FS @@ -330,14 +326,10 @@ EXPORT_SYMBOL(release_resource); * of the resource that's within [@start..@end]; if none is found, retur= ns * -ENODEV. Returns -EINVAL for invalid parameters. * - * This function walks the whole tree and not just first level children - * unless @first_lvl is true. - * * @start: start address of the resource searched for * @end: end address of same resource * @flags: flags which the resource must have * @desc: descriptor the resource must have - * @first_lvl: walk only the first level children, if set * @res: return ptr, if resource found * * The caller must specify @start, @end, @flags, and @desc @@ -345,9 +337,8 @@ EXPORT_SYMBOL(release_resource); */ static int find_next_iomem_res(resource_size_t start, resource_size_t en= d, unsigned long flags, unsigned long desc, - bool first_lvl, struct resource *res) + struct resource *res) { - bool siblings_only =3D true; struct resource *p; =20 if (!res) @@ -358,7 +349,7 @@ static int find_next_iomem_res(resource_size_t start,= resource_size_t end, =20 read_lock(&resource_lock); =20 - for (p =3D iomem_resource.child; p; p =3D next_resource(p, siblings_onl= y)) { + for (p =3D iomem_resource.child; p; p =3D next_resource(p)) { /* If we passed the resource we are looking for, stop */ if (p->start > end) { p =3D NULL; @@ -369,13 +360,6 @@ static int find_next_iomem_res(resource_size_t start= , resource_size_t end, if (p->end < start) continue; =20 - /* - * Now that we found a range that matches what we look for, - * check the flags and the descriptor. If we were not asked to - * use only the first level, start looking at children as well. - */ - siblings_only =3D first_lvl; - if ((p->flags & flags) !=3D flags) continue; if ((desc !=3D IORES_DESC_NONE) && (desc !=3D p->desc)) @@ -402,14 +386,14 @@ static int find_next_iomem_res(resource_size_t star= t, resource_size_t end, =20 static int __walk_iomem_res_desc(resource_size_t start, resource_size_t = end, unsigned long flags, unsigned long desc, - bool first_lvl, void *arg, + void *arg, int (*func)(struct resource *, void *)) { struct resource res; int ret =3D -EINVAL; =20 while (start < end && - !find_next_iomem_res(start, end, flags, desc, first_lvl, &res)) = { + !find_next_iomem_res(start, end, flags, desc, &res)) { ret =3D (*func)(&res, arg); if (ret) break; @@ -431,7 +415,6 @@ static int __walk_iomem_res_desc(resource_size_t star= t, resource_size_t end, * @arg: function argument for the callback @func * @func: callback function that is called for each qualifying resource = area * - * This walks through whole tree and not just first level children. * All the memory ranges which overlap start,end and also match flags an= d * desc are valid candidates. * @@ -441,7 +424,7 @@ static int __walk_iomem_res_desc(resource_size_t star= t, resource_size_t end, int walk_iomem_res_desc(unsigned long desc, unsigned long flags, u64 sta= rt, u64 end, void *arg, int (*func)(struct resource *, void *)) { - return __walk_iomem_res_desc(start, end, flags, desc, false, arg, func)= ; + return __walk_iomem_res_desc(start, end, flags, desc, arg, func); } EXPORT_SYMBOL_GPL(walk_iomem_res_desc); =20 @@ -457,8 +440,8 @@ int walk_system_ram_res(u64 start, u64 end, void *arg= , { unsigned long flags =3D IORESOURCE_SYSTEM_RAM | IORESOURCE_BUSY; =20 - return __walk_iomem_res_desc(start, end, flags, IORES_DESC_NONE, false, - arg, func); + return __walk_iomem_res_desc(start, end, flags, IORES_DESC_NONE, arg, + func); } =20 /* @@ -470,17 +453,14 @@ int walk_mem_res(u64 start, u64 end, void *arg, { unsigned long flags =3D IORESOURCE_MEM | IORESOURCE_BUSY; =20 - return __walk_iomem_res_desc(start, end, flags, IORES_DESC_NONE, false, - arg, func); + return __walk_iomem_res_desc(start, end, flags, IORES_DESC_NONE, arg, + func); } =20 /* * This function calls the @func callback against all memory ranges of t= ype * System RAM which are marked as IORESOURCE_SYSTEM_RAM and IORESOUCE_BU= SY. * It is to be used only for System RAM. - * - * This will find System RAM ranges that are children of top-level resou= rces - * in addition to top-level System RAM resources. */ int walk_system_ram_range(unsigned long start_pfn, unsigned long nr_page= s, void *arg, int (*func)(unsigned long, unsigned long, void *)) @@ -495,8 +475,7 @@ int walk_system_ram_range(unsigned long start_pfn, un= signed long nr_pages, end =3D ((u64)(start_pfn + nr_pages) << PAGE_SHIFT) - 1; flags =3D IORESOURCE_SYSTEM_RAM | IORESOURCE_BUSY; while (start < end && - !find_next_iomem_res(start, end, flags, IORES_DESC_NONE, - false, &res)) { + !find_next_iomem_res(start, end, flags, IORES_DESC_NONE, &res)) = { pfn =3D PFN_UP(res.start); end_pfn =3D PFN_DOWN(res.end + 1); if (end_pfn > pfn) --=20 2.29.2