From patchwork Tue Aug 29 17:11:20 2023 Content-Type: text/plain; charset="utf-8" MIME-Version: 1.0 Content-Transfer-Encoding: 7bit X-Patchwork-Submitter: andrey.konovalov@linux.dev X-Patchwork-Id: 13369239 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 kanga.kvack.org (kanga.kvack.org [205.233.56.17]) by smtp.lore.kernel.org (Postfix) with ESMTP id 4017AC6FA8F for ; Tue, 29 Aug 2023 17:12:50 +0000 (UTC) Received: by kanga.kvack.org (Postfix) id 9FBCD8E0037; Tue, 29 Aug 2023 13:12:45 -0400 (EDT) Received: by kanga.kvack.org (Postfix, from userid 40) id 982B18E0036; Tue, 29 Aug 2023 13:12:45 -0400 (EDT) X-Delivered-To: int-list-linux-mm@kvack.org Received: by kanga.kvack.org (Postfix, from userid 63042) id 760248E0037; Tue, 29 Aug 2023 13:12:45 -0400 (EDT) X-Delivered-To: linux-mm@kvack.org Received: from relay.hostedemail.com (smtprelay0013.hostedemail.com [216.40.44.13]) by kanga.kvack.org (Postfix) with ESMTP id 52BC38E0036 for ; Tue, 29 Aug 2023 13:12:45 -0400 (EDT) Received: from smtpin25.hostedemail.com (a10.router.float.18 [10.200.18.1]) by unirelay06.hostedemail.com (Postfix) with ESMTP id 15477B245D for ; Tue, 29 Aug 2023 17:12:45 +0000 (UTC) X-FDA: 81177786690.25.E183873 Received: from out-249.mta1.migadu.com (out-249.mta1.migadu.com [95.215.58.249]) by imf07.hostedemail.com (Postfix) with ESMTP id 4EA0C40024 for ; Tue, 29 Aug 2023 17:12:43 +0000 (UTC) Authentication-Results: imf07.hostedemail.com; dkim=pass header.d=linux.dev header.s=key1 header.b=aVdkqRkg; spf=pass (imf07.hostedemail.com: domain of andrey.konovalov@linux.dev designates 95.215.58.249 as permitted sender) smtp.mailfrom=andrey.konovalov@linux.dev; dmarc=pass (policy=none) header.from=linux.dev ARC-Seal: i=1; s=arc-20220608; d=hostedemail.com; t=1693329163; a=rsa-sha256; cv=none; b=Zr5pCUgYdFUYsbfBN99FDM3SJLzw4i+TdBKPeYM5MFLJ6m2xOfcB8u+KMV3a8VLQm+4VMB vJtusSOL6N0d44MuSXJBI4lm6D3Owf5OjRIIT+Y/MAFqDly1u0CLLWZGvTnaRYOzz2COQe Ep34/0IHZRcXAOorHNa73AHdyVK3rsk= ARC-Authentication-Results: i=1; imf07.hostedemail.com; dkim=pass header.d=linux.dev header.s=key1 header.b=aVdkqRkg; spf=pass (imf07.hostedemail.com: domain of andrey.konovalov@linux.dev designates 95.215.58.249 as permitted sender) smtp.mailfrom=andrey.konovalov@linux.dev; dmarc=pass (policy=none) header.from=linux.dev ARC-Message-Signature: i=1; a=rsa-sha256; c=relaxed/relaxed; d=hostedemail.com; s=arc-20220608; t=1693329163; h=from:from:sender:reply-to:subject:subject:date:date: message-id:message-id:to:to:cc:cc:mime-version:mime-version: content-type:content-transfer-encoding:content-transfer-encoding: in-reply-to:in-reply-to:references:references:dkim-signature; bh=78m2o0At4EqoxYvPO8GgUXqZmV/z9BTR2roI196o/ig=; b=BaJxm5FItQUAFOArT+EHMi5yQDIBF3bW/lx3wK+R8pQNYMd3df4g5+lXmGR+pS4zWbHWbK HxKDfjUAzCOi8+N++gt3j3LGKlJdWQ8hDr1JiwRlra2sT9vxnvU6wFs22lGFtr0V9ybtIG ABI7SS4iOopzOePPqpeqG6kHHCB0huE= X-Report-Abuse: Please report any abuse attempt to abuse@migadu.com and include these headers. DKIM-Signature: v=1; a=rsa-sha256; c=relaxed/relaxed; d=linux.dev; s=key1; t=1693329161; 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=78m2o0At4EqoxYvPO8GgUXqZmV/z9BTR2roI196o/ig=; b=aVdkqRkgoIFSKNeh42TLnbqZmPMoSkLTIn6T1JEhVD3Qqk6MuAku7bMKEsC8wSyrSX5enC FPGjSthHCdAdFwFBUcruYbc6A6xXWGBHMtC2szN93Qqo9L4dPl6NYeHve9SBanQLnxvT1U U8zvI/sIeAjU3YhEOjSFZSV+LFNUxSw= From: andrey.konovalov@linux.dev To: Marco Elver , Alexander Potapenko Cc: Andrey Konovalov , Dmitry Vyukov , Vlastimil Babka , kasan-dev@googlegroups.com, Evgenii Stepanov , Andrew Morton , linux-mm@kvack.org, linux-kernel@vger.kernel.org, Andrey Konovalov Subject: [PATCH 10/15] stackdepot: store free stack records in a freelist Date: Tue, 29 Aug 2023 19:11:20 +0200 Message-Id: <0853a38f849f75a428a76fe9bcd093c0502d26f4.1693328501.git.andreyknvl@google.com> In-Reply-To: References: MIME-Version: 1.0 X-Migadu-Flow: FLOW_OUT X-Rspamd-Server: rspam08 X-Rspamd-Queue-Id: 4EA0C40024 X-Stat-Signature: d6kortwwuytr7q67y5k4eqgq794ytnuf X-Rspam-User: X-HE-Tag: 1693329163-371807 X-HE-Meta: U2FsdGVkX19ZUpHGEBTHikOiHYfXRZtnFjBpT96eM8bCqg2mfax8gks+zVQIlsV1NWxmaLepbCYTJNsMnCHmJkvJ38FroIlBubEaSNSyufl8Ux+yjXIqNRa7F67L14DBIuqiZT2nDBhhU+SXjxGsNGCav1KxWO+zpOjTmeex+DEDh5QI87HsBl20Zycw/gFuo5vRviekkrrATgcVtTFy1QMvb7+tyXc4MDXfIzUHI6C3N46hEWcdRS8ZGWB4gzQH1DSdLADrnMBBcTwOJTBhEau8RA4X7b60lNLscdJThdKwomCB6NOJc8nLEvaK+MsbcQsEeG2jAwqT6IZ1XxUY3VqKtHZQEgbgu9hnSzckpaGJN8NINItovoXwBo4PU4tToj8pOSkLBGPgfVme6Ghnm1CLexwICSwBvrZJfbMdTrQqSE7mZjGliHryiLvNYbgwm0cgHD2LUZpm3nqUkGQjN///rQVuPUR4wxqkcuG9n1mDlt81Uw0hBVPZWztf0DenYA2UvHtxQm5Hos7dGSKK6tryZC+IUDN33tOgNaLcGsmqt7xK97bYj0R+RFtF0a9tk0cEU5Ebum7D54nj2oSaBIufn7+JOX6PKl/cVKWnE13Do352++Qqsa2BYzMjAt2xdZ3WAxBE3aYhyeq6EMu5jVBPe59vtwuV14T5DbjbYPChKU86erSX2m05eJAAUwMjtW1wHeHrswxA2LbbJOEvz1sRCORHM62YnfN6ihIRHem6dFzGcSE57LdcEFK20py1W90qyivhfU5xBK7ZSBm6svlDQZjyZUXw33nTxDGTTy8IAznlgKnxK5d1YRNzAt+77VxE77cR549uJDst8aAGLSLUB5v28M9Fb/HjEs6ou1sRPXpNDyGSL273iMoSEcGZaAynGhtscsj2P9woQd9lBhC+waLYga4r0YDw+IwJTOYTdfoKyxFit41HlwIpw1mm73w49vtVk0985VwF9C+ YunrL4Wa 8I8M/zfX6BP9vxrDs2N6dWyfoJrAjFeRSLkYdDyVZ/wqXHtJv0kPCef+sU8y7eTrNtB5enx/D/Nx/lEAF3U+/q7/y/n40A1eCwjua 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: From: Andrey Konovalov Instead of using the global pool_offset variable to find a free slot when storing a new stack record, mainlain a freelist of free slots within the allocated stack pools. A global next_stack variable is used as the head of the freelist, and the next field in the stack_record struct is reused as freelist link (when the record is not in the freelist, this field is used as a link in the hash table). This is preparatory patch for implementing the eviction of stack records from the stack depot. Signed-off-by: Andrey Konovalov --- lib/stackdepot.c | 130 +++++++++++++++++++++++++++++------------------ 1 file changed, 81 insertions(+), 49 deletions(-) diff --git a/lib/stackdepot.c b/lib/stackdepot.c index 5982ea79939d..9011f4adcf20 100644 --- a/lib/stackdepot.c +++ b/lib/stackdepot.c @@ -55,8 +55,8 @@ union handle_parts { }; struct stack_record { - struct stack_record *next; /* Link in the hash table */ - u32 hash; /* Hash in the hash table */ + struct stack_record *next; /* Link in hash table or freelist */ + u32 hash; /* Hash in hash table */ u32 size; /* Number of stored frames */ union handle_parts handle; unsigned long entries[DEPOT_STACK_MAX_FRAMES]; /* Frames */ @@ -88,10 +88,10 @@ static unsigned int stack_hash_mask; static void *stack_pools[DEPOT_MAX_POOLS]; /* Newly allocated pool that is not yet added to stack_pools. */ static void *new_pool; -/* Currently used pool in stack_pools. */ -static int pool_index; -/* Offset to the unused space in the currently used pool. */ -static size_t pool_offset; +/* Number of pools in stack_pools. */ +static int pools_num; +/* Next stack in the freelist of stack records within stack_pools. */ +static struct stack_record *next_stack; /* Lock that protects the variables above. */ static DEFINE_RAW_SPINLOCK(pool_lock); /* @@ -221,6 +221,41 @@ int stack_depot_init(void) } EXPORT_SYMBOL_GPL(stack_depot_init); +/* Initializes a stack depol pool. */ +static void depot_init_pool(void *pool) +{ + const int records_in_pool = DEPOT_POOL_SIZE / DEPOT_STACK_RECORD_SIZE; + int i, offset; + + /* Initialize handles and link stack records to each other. */ + for (i = 0, offset = 0; offset < DEPOT_POOL_SIZE; + i++, offset += DEPOT_STACK_RECORD_SIZE) { + struct stack_record *stack = pool + offset; + + stack->handle.pool_index = pools_num; + stack->handle.offset = offset >> DEPOT_STACK_ALIGN; + stack->handle.extra = 0; + + if (i < records_in_pool - 1) + stack->next = (void *)stack + DEPOT_STACK_RECORD_SIZE; + else + stack->next = NULL; + } + + /* Link stack records into the freelist. */ + WARN_ON(next_stack); + next_stack = pool; + + /* Save reference to the pool to be used by depot_fetch_stack. */ + stack_pools[pools_num] = pool; + + /* + * WRITE_ONCE pairs with potential concurrent read in + * depot_fetch_stack. + */ + WRITE_ONCE(pools_num, pools_num + 1); +} + /* Keeps the preallocated memory to be used for a new stack depot pool. */ static void depot_keep_new_pool(void **prealloc) { @@ -237,7 +272,7 @@ static void depot_keep_new_pool(void **prealloc) * Use the preallocated memory for the new pool * as long as we do not exceed the maximum number of pools. */ - if (pool_index + 1 < DEPOT_MAX_POOLS) { + if (pools_num < DEPOT_MAX_POOLS) { new_pool = *prealloc; *prealloc = NULL; } @@ -252,45 +287,42 @@ static void depot_keep_new_pool(void **prealloc) } /* Updates refences to the current and the next stack depot pools. */ -static bool depot_update_pools(size_t required_size, void **prealloc) +static bool depot_update_pools(void **prealloc) { - /* Check if there is not enough space in the current pool. */ - if (unlikely(pool_offset + required_size > DEPOT_POOL_SIZE)) { - /* Bail out if we reached the pool limit. */ - if (unlikely(pool_index + 1 >= DEPOT_MAX_POOLS)) { - WARN_ONCE(1, "Stack depot reached limit capacity"); - return false; - } + /* Check if we still have objects in the freelist. */ + if (next_stack) + goto out_keep_prealloc; - /* - * Move on to the new pool. - * WRITE_ONCE pairs with potential concurrent read in - * stack_depot_fetch. - */ - WRITE_ONCE(pool_index, pool_index + 1); - stack_pools[pool_index] = new_pool; + /* Check if we have a new pool saved and use it. */ + if (new_pool) { + depot_init_pool(new_pool); new_pool = NULL; - pool_offset = 0; - /* - * If the maximum number of pools is not reached, take note - * that yet another new pool needs to be allocated. - * smp_store_release pairs with smp_load_acquire in - * stack_depot_save. - */ - if (pool_index + 1 < DEPOT_MAX_POOLS) + /* Take note that we might need a new new_pool. */ + if (pools_num < DEPOT_MAX_POOLS) smp_store_release(&new_pool_required, 1); + + /* Try keeping the preallocated memory for new_pool. */ + goto out_keep_prealloc; + } + + /* Bail out if we reached the pool limit. */ + if (unlikely(pools_num >= DEPOT_MAX_POOLS)) { + WARN_ONCE(1, "Stack depot reached limit capacity"); + return false; } - /* Check if the current pool is not yet allocated. */ - if (*prealloc && stack_pools[pool_index] == NULL) { - /* Use the preallocated memory for the current pool. */ - stack_pools[pool_index] = *prealloc; + /* Check if we have preallocated memory and use it. */ + if (*prealloc) { + depot_init_pool(*prealloc); *prealloc = NULL; return true; } - /* Otherwise, try using the preallocated memory for a new pool. */ + return false; + +out_keep_prealloc: + /* Keep the preallocated memory for a new pool if required. */ if (*prealloc) depot_keep_new_pool(prealloc); return true; @@ -301,35 +333,35 @@ static struct stack_record * depot_alloc_stack(unsigned long *entries, int size, u32 hash, void **prealloc) { struct stack_record *stack; - size_t required_size = DEPOT_STACK_RECORD_SIZE; /* Update current and new pools if required and possible. */ - if (!depot_update_pools(required_size, prealloc)) + if (!depot_update_pools(prealloc)) return NULL; - /* Check if we have a pool to save the stack trace. */ - if (stack_pools[pool_index] == NULL) + /* Check if we have a stack record to save the stack trace. */ + stack = next_stack; + if (!stack) return NULL; + /* Advance the freelist. */ + next_stack = stack->next; + /* Limit number of saved frames to DEPOT_STACK_MAX_FRAMES. */ if (size > DEPOT_STACK_MAX_FRAMES) size = DEPOT_STACK_MAX_FRAMES; /* Save the stack trace. */ - stack = stack_pools[pool_index] + pool_offset; + stack->next = NULL; stack->hash = hash; stack->size = size; - stack->handle.pool_index = pool_index; - stack->handle.offset = pool_offset >> DEPOT_STACK_ALIGN; - stack->handle.extra = 0; + /* stack->handle is already filled in by depot_init_pool. */ memcpy(stack->entries, entries, flex_array_size(stack, entries, size)); - pool_offset += required_size; /* * Let KMSAN know the stored stack record is initialized. This shall * prevent false positive reports if instrumented code accesses it. */ - kmsan_unpoison_memory(stack, required_size); + kmsan_unpoison_memory(stack, DEPOT_STACK_RECORD_SIZE); return stack; } @@ -339,16 +371,16 @@ static struct stack_record *depot_fetch_stack(depot_stack_handle_t handle) union handle_parts parts = { .handle = handle }; /* * READ_ONCE pairs with potential concurrent write in - * depot_update_pools. + * depot_init_pool. */ - int pool_index_cached = READ_ONCE(pool_index); + int pools_num_cached = READ_ONCE(pools_num); void *pool; size_t offset = parts.offset << DEPOT_STACK_ALIGN; struct stack_record *stack; - if (parts.pool_index > pool_index_cached) { + if (parts.pool_index > pools_num_cached) { WARN(1, "pool index %d out of bounds (%d) for stack id %08x\n", - parts.pool_index, pool_index_cached, handle); + parts.pool_index, pools_num_cached, handle); return NULL; }