[PATCH 3/3 v4] mm/vmalloc: Cache the vmalloc memory info
From: Ingo Molnar
Date: Mon Aug 24 2015 - 03:34:33 EST
* George Spelvin <linux@xxxxxxxxxxx> wrote:
> First, an actual, albeit minor, bug: initializing both vmap_info_gen
> and vmap_info_cache_gen to 0 marks the cache as valid, which it's not.
Ha! :-) Fixed.
> vmap_info_gen should be initialized to 1 to force an initial
> cache update.
Yeah.
> Second, I don't see why you need a 64-bit counter. Seqlocks consider
> 32 bits (31 bits, actually, the lsbit means "update in progress") quite
> a strong enough guarantee.
Just out of general paranoia - but you are right, and this would lower the
overhead on 32-bit SMP platforms a bit, plus it avoids 64-bit word tearing
artifacts on 32 bit platforms as well.
I modified it to u32.
> Third, it seems as though vmap_info_cache_gen is basically a duplicate
> of vmap_info_lock.sequence. It should be possible to make one variable
> serve both purposes.
Correct, I alluded to that in my description:
> > Note that there's an even simpler variant possible I think: we could use just
> > the two generation counters and barriers to remove the seqlock.
> You just need a kludge to handle the case of multiple vamp_info updates
> between cache updates.
>
> There are two simple ones:
>
> 1) Avoid bumping vmap_info_gen unnecessarily. In vmap_unlock(), do
> vmap_info_gen = (vmap_info_lock.sequence | 1) + 1;
> 2) - Make vmap_info_gen a seqcount_t
> - In vmap_unlock(), do write_seqcount_barrier(&vmap_info_gen)
> - In get_vmalloc_info, inside the seqlock critical section, do
> vmap_info_lock.seqcount.sequence = vmap_info_gen.sequence - 1;
> (Using the vmap_info_gen.sequence read while validating the
> cache in the first place.)
>
> I should try to write an actual patch illustrating this.
So I think something like the patch below is even simpler than trying to kludge
generation counter semantics into seqcounts.
I used two generation counters and a spinlock. The fast path is completely
lockless and lightweight on modern SMP platforms. (where smp_rmb() is a no-op or
very cheap.)
There's not even a seqlock retry loop, instead an invalid cache causes us to fall
back to the old behavior - and the freshest result is guaranteed to end up in the
cache.
The linecount got a bit larger: but half of it is comments.
Note that the generation counters are signed integers so that this comparison can
be done:
+ if (gen-vmap_info_cache_gen > 0) {
Thanks,
Ingo
======================>