blob: 0c08f1c0a91862b7ea0e9b820b77c4836d70ad18 [file] [log] [blame]
Jiewen Tan99135962014-09-20 02:18:53 -07001/* -*- Mode:C++; c-file-style:"gnu"; indent-tabs-mode:nil; -*- */
2/**
Yingdi Yu404eafd2016-03-06 14:54:25 -08003 * Copyright (c) 2013-2016 Regents of the University of California.
Jiewen Tan99135962014-09-20 02:18:53 -07004 *
5 * This file is part of ndn-cxx library (NDN C++ library with eXperimental eXtensions).
6 *
7 * ndn-cxx library is free software: you can redistribute it and/or modify it under the
8 * terms of the GNU Lesser General Public License as published by the Free Software
9 * Foundation, either version 3 of the License, or (at your option) any later version.
10 *
11 * ndn-cxx library is distributed in the hope that it will be useful, but WITHOUT ANY
12 * WARRANTY; without even the implied warranty of MERCHANTABILITY or FITNESS FOR A
13 * PARTICULAR PURPOSE. See the GNU Lesser General Public License for more details.
14 *
15 * You should have received copies of the GNU General Public License and GNU Lesser
16 * General Public License along with ndn-cxx, e.g., in COPYING.md file. If not, see
17 * <http://www.gnu.org/licenses/>.
18 *
19 * See AUTHORS.md for complete list of ndn-cxx authors and contributors.
20 */
21
22#include "in-memory-storage-lfu.hpp"
23
24namespace ndn {
25namespace util {
26
27InMemoryStorageLfu::InMemoryStorageLfu(size_t limit)
28 : InMemoryStorage(limit)
29{
30}
31
Yingdi Yu404eafd2016-03-06 14:54:25 -080032InMemoryStorageLfu::InMemoryStorageLfu(boost::asio::io_service& ioService, size_t limit)
33 : InMemoryStorage(ioService, limit)
34{
35}
36
Jiewen Tan99135962014-09-20 02:18:53 -070037void
38InMemoryStorageLfu::afterInsert(InMemoryStorageEntry* entry)
39{
40 BOOST_ASSERT(m_cleanupIndex.size() <= size());
41 CleanupEntry cleanupEntry;
42 cleanupEntry.entry = entry;
43 cleanupEntry.frequency = 0;
44 m_cleanupIndex.insert(cleanupEntry);
45}
46
47bool
48InMemoryStorageLfu::evictItem()
49{
50 if (!m_cleanupIndex.get<byFrequency>().empty()) {
51 CleanupIndex::index<byFrequency>::type::iterator it = m_cleanupIndex.get<byFrequency>().begin();
52 eraseImpl(((*it).entry)->getFullName());
53 m_cleanupIndex.get<byFrequency>().erase(it);
54 return true;
55 }
56
57 return false;
58}
59
60void
61InMemoryStorageLfu::beforeErase(InMemoryStorageEntry* entry)
62{
63 CleanupIndex::index<byEntity>::type::iterator it = m_cleanupIndex.get<byEntity>().find(entry);
64 if (it != m_cleanupIndex.get<byEntity>().end())
65 m_cleanupIndex.get<byEntity>().erase(it);
66}
67
68void
69InMemoryStorageLfu::afterAccess(InMemoryStorageEntry* entry)
70{
71 CleanupIndex::index<byEntity>::type::iterator it = m_cleanupIndex.get<byEntity>().find(entry);
72 m_cleanupIndex.get<byEntity>().modify(it, &incrementFrequency);
73}
74
75} // namespace util
76} // namespace ndn