summaryrefslogtreecommitdiff
path: root/items.h
diff options
context:
space:
mode:
authordormando <dormando@rydia.net>2011-10-02 02:02:35 -0700
committerdormando <dormando@rydia.net>2011-11-09 16:06:08 -0800
commitca5016c54111e062c771d20fcc4662400713c634 (patch)
tree2185b6a408d8d9aa8f4d36489d11a924dd708f74 /items.h
parentbab9acd115828e44176a3671bd65089d6fdeff85 (diff)
downloadmemcached-ca5016c54111e062c771d20fcc4662400713c634.tar.gz
Remove the depth search from item_alloc
Code checked 50 items before checking up to 50 more items to expire one, if none were expired. Given the shallow depth search (50) by any sizeable cache (as low as 1000 items, even), I believe that whole optimization was pointless. Flattening it to be a single test is shorter code and benches a bit faster as it holds the lock for less time. I may have made a mess of the logic, could be cleaned up a little.
Diffstat (limited to 'items.h')
0 files changed, 0 insertions, 0 deletions