synapse-old/synapse/util/caches/expiringcache.py

180 lines
5.2 KiB
Python
Raw Normal View History

# -*- coding: utf-8 -*-
2016-01-06 21:26:29 -07:00
# Copyright 2015, 2016 OpenMarket Ltd
#
# Licensed under the Apache License, Version 2.0 (the "License");
# you may not use this file except in compliance with the License.
# You may obtain a copy of the License at
#
# http://www.apache.org/licenses/LICENSE-2.0
#
# Unless required by applicable law or agreed to in writing, software
# distributed under the License is distributed on an "AS IS" BASIS,
# WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
# See the License for the specific language governing permissions and
# limitations under the License.
import logging
2018-07-09 00:09:20 -06:00
from collections import OrderedDict
from six import iteritems, itervalues
from synapse.metrics.background_process_metrics import run_as_background_process
2018-07-09 00:09:20 -06:00
from synapse.util.caches import register_cache
logger = logging.getLogger(__name__)
SENTINEL = object()
class ExpiringCache(object):
2019-06-20 03:32:02 -06:00
def __init__(
self,
cache_name,
clock,
max_len=0,
expiry_ms=0,
reset_expiry_on_get=False,
iterable=False,
):
"""
Args:
cache_name (str): Name of this cache, used for logging.
clock (Clock)
max_len (int): Max size of dict. If the dict grows larger than this
then the oldest items get automatically evicted. Default is 0,
which indicates there is no max limit.
expiry_ms (int): How long before an item is evicted from the cache
in milliseconds. Default is 0, indicating items never get
evicted based on time.
reset_expiry_on_get (bool): If true, will reset the expiry time for
an item on access. Defaults to False.
iterable (bool): If true, the size is calculated by summing the
sizes of all entries, rather than the number of entries.
"""
self._cache_name = cache_name
self._clock = clock
self._max_len = max_len
self._expiry_ms = expiry_ms
self._reset_expiry_on_get = reset_expiry_on_get
2017-01-16 08:33:22 -07:00
self._cache = OrderedDict()
self.iterable = iterable
2016-02-23 04:54:48 -07:00
2018-05-21 18:47:37 -06:00
self.metrics = register_cache("expiring", cache_name, self)
if not self._expiry_ms:
# Don't bother starting the loop if things never expire
return
def f():
return run_as_background_process(
2019-06-20 03:32:02 -06:00
"prune_cache_%s" % self._cache_name, self._prune_cache
)
2016-02-02 10:18:50 -07:00
self._clock.looping_call(f, self._expiry_ms / 2)
def __setitem__(self, key, value):
now = self._clock.time_msec()
self._cache[key] = _CacheEntry(now, value)
# Evict if there are now too many items
2017-01-16 08:33:22 -07:00
while self._max_len and len(self) > self._max_len:
_key, value = self._cache.popitem(last=False)
if self.iterable:
self.metrics.inc_evictions(len(value.value))
else:
self.metrics.inc_evictions()
def __getitem__(self, key):
2016-02-23 04:54:48 -07:00
try:
entry = self._cache[key]
self.metrics.inc_hits()
2016-03-01 03:59:17 -07:00
except KeyError:
self.metrics.inc_misses()
2016-03-01 04:00:10 -07:00
raise
if self._reset_expiry_on_get:
entry.time = self._clock.time_msec()
return entry.value
2018-10-01 05:25:27 -06:00
def pop(self, key, default=SENTINEL):
"""Removes and returns the value with the given key from the cache.
If the key isn't in the cache then `default` will be returned if
specified, otherwise `KeyError` will get raised.
Identical functionality to `dict.pop(..)`.
"""
value = self._cache.pop(key, default)
if value is SENTINEL:
2018-10-01 05:25:27 -06:00
raise KeyError(key)
return value
def __contains__(self, key):
return key in self._cache
def get(self, key, default=None):
try:
return self[key]
except KeyError:
return default
2017-03-10 03:30:38 -07:00
def setdefault(self, key, value):
try:
return self[key]
except KeyError:
self[key] = value
return value
2015-02-17 08:44:41 -07:00
def _prune_cache(self):
if not self._expiry_ms:
# zero expiry time means don't expire. This should never get called
# since we have this check in start too.
return
begin_length = len(self)
now = self._clock.time_msec()
keys_to_delete = set()
for key, cache_entry in iteritems(self._cache):
if now - cache_entry.time > self._expiry_ms:
keys_to_delete.add(key)
for k in keys_to_delete:
value = self._cache.pop(k)
if self.iterable:
self.metrics.inc_evictions(len(value.value))
else:
self.metrics.inc_evictions()
logger.debug(
"[%s] _prune_cache before: %d, after len: %d",
2019-06-20 03:32:02 -06:00
self._cache_name,
begin_length,
len(self),
)
2016-02-23 04:54:48 -07:00
def __len__(self):
if self.iterable:
return sum(len(entry.value) for entry in itervalues(self._cache))
else:
return len(self._cache)
2016-02-23 04:54:48 -07:00
class _CacheEntry(object):
__slots__ = ["time", "value"]
def __init__(self, time, value):
self.time = time
self.value = value