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 bombadil.infradead.org (bombadil.infradead.org [198.137.202.133]) (using TLSv1.2 with cipher ECDHE-RSA-AES256-GCM-SHA384 (256/256 bits)) (No client certificate requested) by smtp.lore.kernel.org (Postfix) with ESMTPS id AD9ECCA0EFF for ; Wed, 27 Aug 2025 11:37:57 +0000 (UTC) DKIM-Signature: v=1; a=rsa-sha256; q=dns/txt; c=relaxed/relaxed; d=lists.infradead.org; s=bombadil.20210309; h=Sender:List-Subscribe:List-Help :List-Post:List-Archive:List-Unsubscribe:List-Id:In-Reply-To:Content-Type: MIME-Version:References:Message-ID:Subject:Cc:To:From:Date:Reply-To: Content-Transfer-Encoding:Content-ID:Content-Description:Resent-Date: Resent-From:Resent-Sender:Resent-To:Resent-Cc:Resent-Message-ID:List-Owner; bh=HfKsg1HvN1dofKpdj1ZlJSquUKuW1eNX9z6NAMkRBR8=; b=u1aFyRLYaPm1nI9RZ9/paRxTr+ pX8ch19TdVlo45m0KFO7xbXdqa9xVe9Y7CT5z/IYLfNJAruus38IngWfcHAjWQg4Zw0BK4cwj1DQd vZuGuTgG/VP2Gv6LnQ1XD2KYxBwiT0PR2UTJYVtdEakiECTYYLPh7zZhfqa7lu/BlO9nmVSTjqpZH U9pnO4tJG+Mo0dGJKh7e7+8bjf372m8FiRHZzOgEgf035VRheP+HetxxEYY5bFRJAh2mqkzum9yHX CoFsp1Y0jOlxu4/jcLTl38OIdcl0NXLu0UolalsmIKorFWkBQ4lyvGPTBHZP8cMonVwQycdKBrxvN +5+kFw9w==; Received: from localhost ([::1] helo=bombadil.infradead.org) by bombadil.infradead.org with esmtp (Exim 4.98.2 #2 (Red Hat Linux)) id 1urETQ-0000000FIJ1-3Jx1; Wed, 27 Aug 2025 11:37:52 +0000 Received: from foss.arm.com ([217.140.110.172]) by bombadil.infradead.org with esmtp (Exim 4.98.2 #2 (Red Hat Linux)) id 1urDk9-0000000F7ax-3Rec for linux-arm-kernel@lists.infradead.org; Wed, 27 Aug 2025 10:51:07 +0000 Received: from usa-sjc-imap-foss1.foss.arm.com (unknown [10.121.207.14]) by usa-sjc-mx-foss1.foss.arm.com (Postfix) with ESMTP id DC9951688; Wed, 27 Aug 2025 03:50:56 -0700 (PDT) Received: from e133380.arm.com (e133380.arm.com [10.1.197.68]) by usa-sjc-imap-foss1.foss.arm.com (Postfix) with ESMTPSA id 646113F738; Wed, 27 Aug 2025 03:50:59 -0700 (PDT) Date: Wed, 27 Aug 2025 11:50:56 +0100 From: Dave Martin To: James Morse Cc: linux-kernel@vger.kernel.org, linux-arm-kernel@lists.infradead.org, linux-acpi@vger.kernel.org, devicetree@vger.kernel.org, shameerali.kolothum.thodi@huawei.com, D Scott Phillips OS , carl@os.amperecomputing.com, lcherian@marvell.com, bobo.shaobowang@huawei.com, tan.shaopeng@fujitsu.com, baolin.wang@linux.alibaba.com, Jamie Iles , Xin Hao , peternewman@google.com, dfustini@baylibre.com, amitsinght@marvell.com, David Hildenbrand , Rex Nie , Koba Ko , Shanker Donthineni , fenghuay@nvidia.com, baisheng.gao@unisoc.com, Jonathan Cameron , Rob Herring , Rohit Mathew , Rafael Wysocki , Len Brown , Lorenzo Pieralisi , Hanjun Guo , Sudeep Holla , Krzysztof Kozlowski , Conor Dooley , Catalin Marinas , Will Deacon , Greg Kroah-Hartman , Danilo Krummrich Subject: Re: [PATCH 05/33] ACPI / PPTT: Find cache level by cache-id Message-ID: References: <20250822153048.2287-1-james.morse@arm.com> <20250822153048.2287-6-james.morse@arm.com> MIME-Version: 1.0 Content-Type: text/plain; charset=us-ascii Content-Disposition: inline In-Reply-To: <20250822153048.2287-6-james.morse@arm.com> X-CRM114-Version: 20100106-BlameMichelson ( TRE 0.8.0 (BSD) ) MR-646709E3 X-CRM114-CacheID: sfid-20250827_035105_958479_357276BD X-CRM114-Status: GOOD ( 40.50 ) X-BeenThere: linux-arm-kernel@lists.infradead.org X-Mailman-Version: 2.1.34 Precedence: list List-Id: List-Unsubscribe: , List-Archive: List-Post: List-Help: List-Subscribe: , Sender: "linux-arm-kernel" Errors-To: linux-arm-kernel-bounces+linux-arm-kernel=archiver.kernel.org@lists.infradead.org Hi, On Fri, Aug 22, 2025 at 03:29:46PM +0000, James Morse wrote: > The MPAM table identifies caches by id. The MPAM driver also wants to know > the cache level to determine if the platform is of the shape that can be > managed via resctrl. Cacheinfo has this information, but only for CPUs that > are online. > > Waiting for all CPUs to come online is a problem for platforms where > CPUs are brought online late by user-space. > > Add a helper that walks every possible cache, until it finds the one > identified by cache-id, then return the level. > Add a cleanup based free-ing mechanism for acpi_get_table(). Does this mean that the early secondaries must be spread out across the whole topology so that everything can be probed? (i.e., a random subset is no good?) If so, is this documented somewhere, such as in booting.rst? Maybe this is not a new requirement -- it's not an area that I'm very familiar with. > > CC: Jonathan Cameron > Signed-off-by: James Morse > --- > Changes since RFC: > * acpi_count_levels() now returns a value. > * Converted the table-get stuff to use Jonathan's cleanup helper. > * Dropped Sudeep's Review tag due to the cleanup change. > --- > drivers/acpi/pptt.c | 64 ++++++++++++++++++++++++++++++++++++++++++++ > include/linux/acpi.h | 17 ++++++++++++ > 2 files changed, 81 insertions(+) > > diff --git a/drivers/acpi/pptt.c b/drivers/acpi/pptt.c > index 8f9b9508acba..660457644a5b 100644 > --- a/drivers/acpi/pptt.c > +++ b/drivers/acpi/pptt.c > @@ -907,3 +907,67 @@ int find_acpi_cpu_topology_hetero_id(unsigned int cpu) > return find_acpi_cpu_topology_tag(cpu, PPTT_ABORT_PACKAGE, > ACPI_PPTT_ACPI_IDENTICAL); > } > + > +/** > + * find_acpi_cache_level_from_id() - Get the level of the specified cache > + * @cache_id: The id field of the unified cache > + * > + * Determine the level relative to any CPU for the unified cache identified by > + * cache_id. This allows the property to be found even if the CPUs are offline. > + * > + * The returned level can be used to group unified caches that are peers. > + * > + * The PPTT table must be rev 3 or later, > + * > + * If one CPUs L2 is shared with another as L3, this function will return > + * an unpredictable value. > + * > + * Return: -ENOENT if the PPTT doesn't exist, or the cache cannot be found. Nit: doesn't exist or its revision is too old. > + * Otherwise returns a value which represents the level of the specified cache. > + */ > +int find_acpi_cache_level_from_id(u32 cache_id) > +{ > + u32 acpi_cpu_id; > + int level, cpu, num_levels; > + struct acpi_pptt_cache *cache; > + struct acpi_pptt_cache_v1 *cache_v1; > + struct acpi_pptt_processor *cpu_node; > + struct acpi_table_header *table __free(acpi_table) = acpi_get_table_ret(ACPI_SIG_PPTT, 0); acpi_get_pptt() ? (See comment on patch 3.) Comments there also suggest that the acpi_put_table() may be unnecessary, at least on some paths. I haven't tried to understand the ins and outs of this. > + > + if (IS_ERR(table)) > + return PTR_ERR(table); > + > + if (table->revision < 3) > + return -ENOENT; > + > + /* > + * If we found the cache first, we'd still need to walk from each CPU > + * to find the level... > + */ ^ Possibly confusing comment? The cache id is the starting point for calling this function. Is there a world in which we are at this point without first having found the cache node? (If the comment is just a restatement of part of the kerneldoc description, maybe just drop it.) > + for_each_possible_cpu(cpu) { > + acpi_cpu_id = get_acpi_id_for_cpu(cpu); > + cpu_node = acpi_find_processor_node(table, acpi_cpu_id); > + if (!cpu_node) > + return -ENOENT; > + num_levels = acpi_count_levels(table, cpu_node, NULL); Is the initial call to acpi_count_levels() really needed here? It feels a bit like we end up enumerating the whole topology two or three times here; once to count how many levels there are, and then again to examine the nodes, and once more inside acpi_find_cache_node(). Why can't we just walk until we run out of levels? I may be missing some details of how these functions interact -- if this is only run at probe time, compact, well-factored code is more important than making things as fast as possible. > + > + /* Start at 1 for L1 */ > + for (level = 1; level <= num_levels; level++) { > + cache = acpi_find_cache_node(table, acpi_cpu_id, > + ACPI_PPTT_CACHE_TYPE_UNIFIED, > + level, &cpu_node); > + if (!cache) > + continue; > + > + cache_v1 = ACPI_ADD_PTR(struct acpi_pptt_cache_v1, > + cache, > + sizeof(struct acpi_pptt_cache)); > + > + if (cache->flags & ACPI_PPTT_CACHE_ID_VALID && > + cache_v1->cache_id == cache_id) > + return level; > + } > + } > + > + return -ENOENT; > +} > diff --git a/include/linux/acpi.h b/include/linux/acpi.h > index f97a9ff678cc..30c10b1dcdb2 100644 > --- a/include/linux/acpi.h > +++ b/include/linux/acpi.h [...] > @@ -221,6 +222,17 @@ void acpi_reserve_initial_tables (void); > void acpi_table_init_complete (void); > int acpi_table_init (void); > > +static inline struct acpi_table_header *acpi_get_table_ret(char *signature, u32 instance) > +{ > + struct acpi_table_header *table; > + int status = acpi_get_table(signature, instance, &table); > + > + if (ACPI_FAILURE(status)) > + return ERR_PTR(-ENOENT); > + return table; > +} This feels like something that ought to exist already. If not, why not? If so, are there open-coded versions of this spread around the ACPI tree that should be ported to use it? [...] Cheers ---Dave