blob: 017de7e2888435703b7c63f8f03c18f00429d81b [file] [log] [blame]
Minsheng Zhang03152692015-07-28 11:53:21 -05001/* -*- Mode:C++; c-file-style:"gnu"; indent-tabs-mode:nil; -*- */
Junxiao Shi07f2e2f2019-07-22 09:10:06 -06002/*
3 * Copyright (c) 2014-2019, Regents of the University of California,
Minsheng Zhang03152692015-07-28 11:53:21 -05004 * Arizona Board of Regents,
5 * Colorado State University,
6 * University Pierre & Marie Curie, Sorbonne University,
7 * Washington University in St. Louis,
8 * Beijing Institute of Technology,
9 * The University of Memphis.
10 *
11 * This file is part of NFD (Named Data Networking Forwarding Daemon).
12 * See AUTHORS.md for complete list of NFD authors and contributors.
13 *
14 * NFD is free software: you can redistribute it and/or modify it under the terms
15 * of the GNU General Public License as published by the Free Software Foundation,
16 * either version 3 of the License, or (at your option) any later version.
17 *
18 * NFD is distributed in the hope that it will be useful, but WITHOUT ANY WARRANTY;
19 * without even the implied warranty of MERCHANTABILITY or FITNESS FOR A PARTICULAR
20 * PURPOSE. See the GNU General Public License for more details.
21 *
22 * You should have received a copy of the GNU General Public License along with
23 * NFD, e.g., in COPYING.md file. If not, see <http://www.gnu.org/licenses/>.
24 */
25
26#ifndef NFD_DAEMON_TABLE_CS_POLICY_LRU_HPP
27#define NFD_DAEMON_TABLE_CS_POLICY_LRU_HPP
28
29#include "cs-policy.hpp"
Minsheng Zhang03152692015-07-28 11:53:21 -050030
31#include <boost/multi_index_container.hpp>
32#include <boost/multi_index/sequenced_index.hpp>
Junxiao Shi07f2e2f2019-07-22 09:10:06 -060033#include <boost/multi_index/ordered_index.hpp>
Minsheng Zhang03152692015-07-28 11:53:21 -050034
35namespace nfd {
36namespace cs {
37namespace lru {
38
Junxiao Shi07f2e2f2019-07-22 09:10:06 -060039using Queue = boost::multi_index_container<
40 Policy::EntryRef,
41 boost::multi_index::indexed_by<
42 boost::multi_index::sequenced<>,
43 boost::multi_index::ordered_unique<boost::multi_index::identity<Policy::EntryRef>>
44 >
45 >;
Minsheng Zhang03152692015-07-28 11:53:21 -050046
Junxiao Shi07f2e2f2019-07-22 09:10:06 -060047/** \brief Least-Recently-Used (LRU) replacement policy
Minsheng Zhang03152692015-07-28 11:53:21 -050048 */
49class LruPolicy : public Policy
50{
51public:
52 LruPolicy();
53
54public:
55 static const std::string POLICY_NAME;
56
57private:
Junxiao Shi07f2e2f2019-07-22 09:10:06 -060058 void
59 doAfterInsert(EntryRef i) override;
Minsheng Zhang03152692015-07-28 11:53:21 -050060
Junxiao Shi07f2e2f2019-07-22 09:10:06 -060061 void
62 doAfterRefresh(EntryRef i) override;
Minsheng Zhang03152692015-07-28 11:53:21 -050063
Junxiao Shi07f2e2f2019-07-22 09:10:06 -060064 void
65 doBeforeErase(EntryRef i) override;
Minsheng Zhang03152692015-07-28 11:53:21 -050066
Junxiao Shi07f2e2f2019-07-22 09:10:06 -060067 void
68 doBeforeUse(EntryRef i) override;
Minsheng Zhang03152692015-07-28 11:53:21 -050069
Junxiao Shi07f2e2f2019-07-22 09:10:06 -060070 void
Davide Pesaventob84bd3a2016-04-22 02:21:45 +020071 evictEntries() override;
Minsheng Zhang03152692015-07-28 11:53:21 -050072
73private:
74 /** \brief moves an entry to the end of queue
75 */
76 void
Junxiao Shi07f2e2f2019-07-22 09:10:06 -060077 insertToQueue(EntryRef i, bool isNewEntry);
Minsheng Zhang03152692015-07-28 11:53:21 -050078
79private:
80 Queue m_queue;
81};
82
83} // namespace lru
84
85using lru::LruPolicy;
86
87} // namespace cs
88} // namespace nfd
89
Junxiao Shi9f5b01d2016-08-05 03:54:28 +000090#endif // NFD_DAEMON_TABLE_CS_POLICY_LRU_HPP