From nobody Tue Feb 10 12:42:22 2026 Received: from smtp-out1.suse.de (smtp-out1.suse.de [195.135.223.130]) (using TLSv1.2 with cipher ECDHE-RSA-AES128-GCM-SHA256 (128/128 bits)) (No client certificate requested) by smtp.subspace.kernel.org (Postfix) with ESMTPS id 7C4AC361DB6 for ; Fri, 23 Jan 2026 06:54:20 +0000 (UTC) Authentication-Results: smtp.subspace.kernel.org; arc=none smtp.client-ip=195.135.223.130 ARC-Seal: i=1; a=rsa-sha256; d=subspace.kernel.org; s=arc-20240116; t=1769151262; cv=none; b=bNhOT6ZGlRywc4PqCKNICWJD2NeFt6V8V9W1J/M5v0HzGl2IEGFkN4Uaqh0pl/RuiSsFS0gYXoVb69o8zMWpUt2pA2BEUojC999N/1XkeywhVaHaYGsryqMX1QPzuXmS+UNy3X18lgFbjFKTvfUbl62E9+ep2Blrp5b2hote7zE= ARC-Message-Signature: i=1; a=rsa-sha256; d=subspace.kernel.org; s=arc-20240116; t=1769151262; c=relaxed/simple; bh=9Qun1kF7wP+imUKARXo2u5goeHvNK2H6MuXvrHDduEc=; h=From:Date:Subject:MIME-Version:Content-Type:Message-Id:References: In-Reply-To:To:Cc; b=nUzAwky+AtihM8l75JUY/sAW13z/9xMlOHz3podlPvQMDx1FBEXhdkqhgr98BZZZ5ZRjGqTQmiFktFvUTpg1a/NbdxWToCzGLhJ5uDPUxUkPBeZGcEOpIkOmCFLzj7p21xF1KdUmrWkRwA38U8P312YYZKZCCWG/HKl+tFJF15E= ARC-Authentication-Results: i=1; smtp.subspace.kernel.org; dmarc=none (p=none dis=none) header.from=suse.cz; spf=pass smtp.mailfrom=suse.cz; arc=none smtp.client-ip=195.135.223.130 Authentication-Results: smtp.subspace.kernel.org; dmarc=none (p=none dis=none) header.from=suse.cz Authentication-Results: smtp.subspace.kernel.org; spf=pass smtp.mailfrom=suse.cz Received: from imap1.dmz-prg2.suse.org (imap1.dmz-prg2.suse.org [IPv6:2a07:de40:b281:104:10:150:64:97]) (using TLSv1.3 with cipher TLS_AES_256_GCM_SHA384 (256/256 bits) key-exchange X25519 server-signature RSA-PSS (4096 bits) server-digest SHA256) (No client certificate requested) by smtp-out1.suse.de (Postfix) with ESMTPS id 2C50933779; Fri, 23 Jan 2026 06:53:11 +0000 (UTC) Authentication-Results: smtp-out1.suse.de; none Received: from imap1.dmz-prg2.suse.org (localhost [127.0.0.1]) (using TLSv1.3 with cipher TLS_AES_256_GCM_SHA384 (256/256 bits) key-exchange X25519 server-signature RSA-PSS (4096 bits) server-digest SHA256) (No client certificate requested) by imap1.dmz-prg2.suse.org (Postfix) with ESMTPS id 065801395E; Fri, 23 Jan 2026 06:53:11 +0000 (UTC) Received: from dovecot-director2.suse.de ([2a07:de40:b281:106:10:150:64:167]) by imap1.dmz-prg2.suse.org with ESMTPSA id YJ9FAdcac2k4YgAAD6G6ig (envelope-from ); Fri, 23 Jan 2026 06:53:11 +0000 From: Vlastimil Babka Date: Fri, 23 Jan 2026 07:52:56 +0100 Subject: [PATCH v4 18/22] slab: refill sheaves from all nodes Precedence: bulk X-Mailing-List: linux-kernel@vger.kernel.org List-Id: List-Subscribe: List-Unsubscribe: MIME-Version: 1.0 Content-Type: text/plain; charset="utf-8" Content-Transfer-Encoding: quoted-printable Message-Id: <20260123-sheaves-for-all-v4-18-041323d506f7@suse.cz> References: <20260123-sheaves-for-all-v4-0-041323d506f7@suse.cz> In-Reply-To: <20260123-sheaves-for-all-v4-0-041323d506f7@suse.cz> To: Harry Yoo , Petr Tesarik , Christoph Lameter , David Rientjes , Roman Gushchin Cc: Hao Li , Andrew Morton , Uladzislau Rezki , "Liam R. Howlett" , Suren Baghdasaryan , Sebastian Andrzej Siewior , Alexei Starovoitov , linux-mm@kvack.org, linux-kernel@vger.kernel.org, linux-rt-devel@lists.linux.dev, bpf@vger.kernel.org, kasan-dev@googlegroups.com, Vlastimil Babka X-Mailer: b4 0.14.3 X-Rspamd-Pre-Result: action=no action; module=replies; Message is reply to one we originated X-Spam-Score: -4.00 X-Rspamd-Pre-Result: action=no action; module=replies; Message is reply to one we originated X-Rspamd-Action: no action X-Rspamd-Queue-Id: 2C50933779 X-Rspamd-Server: rspamd1.dmz-prg2.suse.org X-Spam-Level: X-Spamd-Result: default: False [-4.00 / 50.00]; REPLY(-4.00)[]; R_RATELIMIT(0.00)[to_ip_from(RLfsjnp7neds983g95ihcnuzgq)] X-Spam-Flag: NO __refill_objects() currently only attempts to get partial slabs from the local node and then allocates new slab(s). Expand it to trying also other nodes while observing the remote node defrag ratio, similarly to get_any_partial(). This will prevent allocating new slabs on a node while other nodes have many free slabs. It does mean sheaves will contain non-local objects in that case. Allocations that care about specific node will still be served appropriately, but might get a slowpath allocation. Like get_any_partial() we do observe cpuset_zone_allowed(), although we might be refilling a sheaf that will be then used from a different allocation context. We can also use the resulting refill_objects() in __kmem_cache_alloc_bulk() for non-debug caches. This means kmem_cache_alloc_bulk() will get better performance when sheaves are exhausted. kmem_cache_alloc_bulk() cannot indicate a preferred node so it's compatible with sheaves refill in preferring the local node. Its users also have gfp flags that allow spinning, so document that as a requirement. Reviewed-by: Suren Baghdasaryan Reviewed-by: Hao Li Signed-off-by: Vlastimil Babka Reviewed-by: Harry Yoo --- mm/slub.c | 137 ++++++++++++++++++++++++++++++++++++++++++++++++----------= ---- 1 file changed, 106 insertions(+), 31 deletions(-) diff --git a/mm/slub.c b/mm/slub.c index 1d135baf5e9e..540e3c641d1e 100644 --- a/mm/slub.c +++ b/mm/slub.c @@ -2512,8 +2512,8 @@ static void free_empty_sheaf(struct kmem_cache *s, st= ruct slab_sheaf *sheaf) } =20 static unsigned int -__refill_objects(struct kmem_cache *s, void **p, gfp_t gfp, unsigned int m= in, - unsigned int max); +refill_objects(struct kmem_cache *s, void **p, gfp_t gfp, unsigned int min, + unsigned int max); =20 static int refill_sheaf(struct kmem_cache *s, struct slab_sheaf *sheaf, gfp_t gfp) @@ -2524,8 +2524,8 @@ static int refill_sheaf(struct kmem_cache *s, struct = slab_sheaf *sheaf, if (!to_fill) return 0; =20 - filled =3D __refill_objects(s, &sheaf->objects[sheaf->size], gfp, - to_fill, to_fill); + filled =3D refill_objects(s, &sheaf->objects[sheaf->size], gfp, to_fill, + to_fill); =20 sheaf->size +=3D filled; =20 @@ -6550,29 +6550,22 @@ void kmem_cache_free_bulk(struct kmem_cache *s, siz= e_t size, void **p) EXPORT_SYMBOL(kmem_cache_free_bulk); =20 static unsigned int -__refill_objects(struct kmem_cache *s, void **p, gfp_t gfp, unsigned int m= in, - unsigned int max) +__refill_objects_node(struct kmem_cache *s, void **p, gfp_t gfp, unsigned = int min, + unsigned int max, struct kmem_cache_node *n) { struct partial_bulk_context pc; struct slab *slab, *slab2; unsigned int refilled =3D 0; unsigned long flags; void *object; - int node; =20 pc.flags =3D gfp; pc.min_objects =3D min; pc.max_objects =3D max; =20 - node =3D numa_mem_id(); - - if (WARN_ON_ONCE(!gfpflags_allow_spinning(gfp))) + if (!get_partial_node_bulk(s, n, &pc)) return 0; =20 - /* TODO: consider also other nodes? */ - if (!get_partial_node_bulk(s, get_node(s, node), &pc)) - goto new_slab; - list_for_each_entry_safe(slab, slab2, &pc.slabs, slab_list) { =20 list_del(&slab->slab_list); @@ -6610,8 +6603,6 @@ __refill_objects(struct kmem_cache *s, void **p, gfp_= t gfp, unsigned int min, } =20 if (unlikely(!list_empty(&pc.slabs))) { - struct kmem_cache_node *n =3D get_node(s, node); - spin_lock_irqsave(&n->list_lock, flags); =20 list_for_each_entry_safe(slab, slab2, &pc.slabs, slab_list) { @@ -6633,13 +6624,92 @@ __refill_objects(struct kmem_cache *s, void **p, gf= p_t gfp, unsigned int min, } } =20 + return refilled; +} =20 - if (likely(refilled >=3D min)) - goto out; +#ifdef CONFIG_NUMA +static unsigned int +__refill_objects_any(struct kmem_cache *s, void **p, gfp_t gfp, unsigned i= nt min, + unsigned int max) +{ + struct zonelist *zonelist; + struct zoneref *z; + struct zone *zone; + enum zone_type highest_zoneidx =3D gfp_zone(gfp); + unsigned int cpuset_mems_cookie; + unsigned int refilled =3D 0; + + /* see get_from_any_partial() for the defrag ratio description */ + if (!s->remote_node_defrag_ratio || + get_cycles() % 1024 > s->remote_node_defrag_ratio) + return 0; + + do { + cpuset_mems_cookie =3D read_mems_allowed_begin(); + zonelist =3D node_zonelist(mempolicy_slab_node(), gfp); + for_each_zone_zonelist(zone, z, zonelist, highest_zoneidx) { + struct kmem_cache_node *n; + unsigned int r; + + n =3D get_node(s, zone_to_nid(zone)); + + if (!n || !cpuset_zone_allowed(zone, gfp) || + n->nr_partial <=3D s->min_partial) + continue; + + r =3D __refill_objects_node(s, p, gfp, min, max, n); + refilled +=3D r; + + if (r >=3D min) { + /* + * Don't check read_mems_allowed_retry() here - + * if mems_allowed was updated in parallel, that + * was a harmless race between allocation and + * the cpuset update + */ + return refilled; + } + p +=3D r; + min -=3D r; + max -=3D r; + } + } while (read_mems_allowed_retry(cpuset_mems_cookie)); + + return refilled; +} +#else +static inline unsigned int +__refill_objects_any(struct kmem_cache *s, void **p, gfp_t gfp, unsigned i= nt min, + unsigned int max) +{ + return 0; +} +#endif + +static unsigned int +refill_objects(struct kmem_cache *s, void **p, gfp_t gfp, unsigned int min, + unsigned int max) +{ + int local_node =3D numa_mem_id(); + unsigned int refilled; + struct slab *slab; + + if (WARN_ON_ONCE(!gfpflags_allow_spinning(gfp))) + return 0; + + refilled =3D __refill_objects_node(s, p, gfp, min, max, + get_node(s, local_node)); + if (refilled >=3D min) + return refilled; + + refilled +=3D __refill_objects_any(s, p + refilled, gfp, min - refilled, + max - refilled); + if (refilled >=3D min) + return refilled; =20 new_slab: =20 - slab =3D new_slab(s, pc.flags, node); + slab =3D new_slab(s, gfp, local_node); if (!slab) goto out; =20 @@ -6654,8 +6724,8 @@ __refill_objects(struct kmem_cache *s, void **p, gfp_= t gfp, unsigned int min, =20 if (refilled < min) goto new_slab; -out: =20 +out: return refilled; } =20 @@ -6665,18 +6735,20 @@ int __kmem_cache_alloc_bulk(struct kmem_cache *s, g= fp_t flags, size_t size, { int i; =20 - /* - * TODO: this might be more efficient (if necessary) by reusing - * __refill_objects() - */ - for (i =3D 0; i < size; i++) { + if (IS_ENABLED(CONFIG_SLUB_TINY) || kmem_cache_debug(s)) { + for (i =3D 0; i < size; i++) { =20 - p[i] =3D ___slab_alloc(s, flags, NUMA_NO_NODE, _RET_IP_, - s->object_size); - if (unlikely(!p[i])) - goto error; + p[i] =3D ___slab_alloc(s, flags, NUMA_NO_NODE, _RET_IP_, + s->object_size); + if (unlikely(!p[i])) + goto error; =20 - maybe_wipe_obj_freeptr(s, p[i]); + maybe_wipe_obj_freeptr(s, p[i]); + } + } else { + i =3D refill_objects(s, p, flags, size, size); + if (i < size) + goto error; } =20 return i; @@ -6687,7 +6759,10 @@ int __kmem_cache_alloc_bulk(struct kmem_cache *s, gf= p_t flags, size_t size, =20 } =20 -/* Note that interrupts must be enabled when calling this function. */ +/* + * Note that interrupts must be enabled when calling this function and gfp + * flags must allow spinning. + */ int kmem_cache_alloc_bulk_noprof(struct kmem_cache *s, gfp_t flags, size_t= size, void **p) { --=20 2.52.0