in-memory-storage-lru.cpp
Go to the documentation of this file.
1 /* -*- Mode:C++; c-file-style:"gnu"; indent-tabs-mode:nil; -*- */
2 /*
3  * Copyright (c) 2013-2018 Regents of the University of California.
4  *
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 
23 
24 namespace ndn {
25 
27  : InMemoryStorage(limit)
28 {
29 }
30 
31 InMemoryStorageLru::InMemoryStorageLru(boost::asio::io_service& ioService,
32  size_t limit)
33  : InMemoryStorage(ioService, limit)
34 {
35 }
36 
37 void
39 {
40  BOOST_ASSERT(m_cleanupIndex.size() <= size());
41  InMemoryStorageEntry* ptr = entry;
42  m_cleanupIndex.insert(ptr);
43 }
44 
45 bool
47 {
48  if (!m_cleanupIndex.get<byUsedTime>().empty()) {
49  CleanupIndex::index<byUsedTime>::type::iterator it = m_cleanupIndex.get<byUsedTime>().begin();
50  eraseImpl((*it)->getFullName());
51  m_cleanupIndex.get<byUsedTime>().erase(it);
52  return true;
53  }
54 
55  return false;
56 }
57 
58 void
60 {
61  CleanupIndex::index<byEntity>::type::iterator it = m_cleanupIndex.get<byEntity>().find(entry);
62  if (it != m_cleanupIndex.get<byEntity>().end())
63  m_cleanupIndex.get<byEntity>().erase(it);
64 }
65 
66 void
68 {
69  beforeErase(entry);
70  afterInsert(entry);
71 }
72 
73 } // namespace ndn
Represents an in-memory storage entry.
void beforeErase(InMemoryStorageEntry *entry) override
Update the entry or other data structures before a entry is successfully erased, erase it from the cl...
void afterAccess(InMemoryStorageEntry *entry) override
Update the entry when the entry is returned by the find() function, update the last used time accordi...
bool evictItem() override
Removes one Data packet from in-memory storage based on LRU, i.e.
void afterInsert(InMemoryStorageEntry *entry) override
Update the entry after a entry is successfully inserted, add it to the cleanupIndex.
Represents in-memory storage.
void erase(const Name &prefix, const bool isPrefix=true)
Deletes in-memory storage entry by prefix by default.
shared_ptr< const Data > find(const Interest &interest)
Finds the best match Data for an Interest.
InMemoryStorage::const_iterator begin() const
Returns begin iterator of the in-memory storage ordering by name with digest.
void eraseImpl(const Name &name)
Deletes in-memory storage entries by the Name with implicit digest.
Definition: data.cpp:25