mirrors/haproxy
1
0
Fork 0
mirror of https://git.haproxy.org/git/haproxy.git/ synced 2026-05-05 04:56:10 +02:00
Code Issues Projects Releases Wiki Activity

MINOR: pool: rely on pool_free_nocache() in pool_put_to_shared_cache()

Browse Source 
At the moment pool_put_to_shared_cache() checks if the pool is crowded,
and if so it does the exact same job as pool_free_nocache(), otherwise
it adds the object there.

This patch rearranges the code so that the function is split in two and
either uses one path or the other, and always relies on pool_free_nocache()
in case we don't want to store the object. This way there will be a common
path with the variant not using the shared cache. The patch is better viewed
using git show -b since a whole block got reindented.

It's worth noting that there is a tiny difference now in the local cache
usage measurement, as the decrement of "used" used to be performed before
checking for pool_is_crowded() instead of being done after. This used to
result in always one less object being kept in the cache than what was
configured in minavail. The rearrangement of the code aligns it with
other call places.
This commit is contained in:
Willy Tarreau 2021-12-30 17:20:27 +01:00
parent 594775d17c
commit 57c5c6db0c
1 changed files with 14 additions and 14 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

28
include/haproxy/pool.h
View File

@ -142,22 +142,22 @@ static inline void pool_put_to_shared_cache(struct pool_head *pool, void *ptr)
{
void **free_list;
_HA_ATOMIC_DEC(&pool->used);
if (unlikely(pool_is_crowded(pool))) {
pool_put_to_os(pool, ptr);
} else {
free_list = _HA_ATOMIC_LOAD(&pool->free_list);
do {
while (unlikely(free_list == POOL_BUSY)) {
__ha_cpu_relax();
free_list = _HA_ATOMIC_LOAD(&pool->free_list);
}
_HA_ATOMIC_STORE((void **)ptr, (void *)free_list);
__ha_barrier_atomic_store();
} while (!_HA_ATOMIC_CAS(&pool->free_list, &free_list, ptr));
__ha_barrier_atomic_store();
pool_free_nocache(pool, ptr);
return;
}
_HA_ATOMIC_DEC(&pool->used);
free_list = _HA_ATOMIC_LOAD(&pool->free_list);
do {
while (unlikely(free_list == POOL_BUSY)) {
__ha_cpu_relax();
free_list = _HA_ATOMIC_LOAD(&pool->free_list);
}
_HA_ATOMIC_STORE((void **)ptr, (void *)free_list);
__ha_barrier_atomic_store();
} while (!_HA_ATOMIC_CAS(&pool->free_list, &free_list, ptr));
__ha_barrier_atomic_store();
swrate_add(&pool->needed_avg, POOL_AVG_SAMPLES, pool->used);
}