1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
|
/*
* Copyright (C) 2015 Canonical Ltd.
*
* This program is free software: you can redistribute it and/or modify
* it under the terms of the GNU Lesser General Public License version 3 as
* published by the Free Software Foundation.
*
* This program is distributed in the hope that it will be useful,
* but WITHOUT ANY WARRANTY; without even the implied warranty of
* MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
* GNU Lesser General Public License for more details.
*
* You should have received a copy of the GNU Lesser General Public License
* along with this program. If not, see <http://www.gnu.org/licenses/>.
*
* Authored by: Michi Henning <michi.henning@canonical.com>
*/
#pragma once
namespace core
{
/**
\brief Indicates the discard policy to make room for entries when the cache is full.
Once the cache is full and another entry is added,
`lru_ttl` unconditionally deletes all entries that have expired and then,
if deleting these entries did not create sufficient free space, deletes entries
in least-recently-used order until enough space is available.
If the discard policy is set to `lru_only`, entries do not maintain an expiry time and
are therefore discarded strictly in LRU order.
*/
enum class CacheDiscardPolicy
{
lru_ttl, ///< Evict expired entries first, followed by eviction in LRU order
lru_only ///< Evict in LRU order
};
} // namespace core
|
