Jiewen Tan | 9913596 | 2014-09-20 02:18:53 -0700 | [diff] [blame^] | 1 | /* -*- Mode:C++; c-file-style:"gnu"; indent-tabs-mode:nil; -*- */ |
| 2 | /** |
| 3 | * Copyright (c) 2013-2014 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 | |
| 22 | #include "in-memory-storage-lru.hpp" |
| 23 | |
| 24 | namespace ndn { |
| 25 | namespace util { |
| 26 | |
| 27 | InMemoryStorageLru::InMemoryStorageLru(size_t limit) |
| 28 | : InMemoryStorage(limit) |
| 29 | { |
| 30 | } |
| 31 | |
| 32 | InMemoryStorageLru::~InMemoryStorageLru() |
| 33 | { |
| 34 | } |
| 35 | |
| 36 | void |
| 37 | InMemoryStorageLru::afterInsert(InMemoryStorageEntry* entry) |
| 38 | { |
| 39 | BOOST_ASSERT(m_cleanupIndex.size() <= size()); |
| 40 | InMemoryStorageEntry* ptr = entry; |
| 41 | m_cleanupIndex.insert(ptr); |
| 42 | } |
| 43 | |
| 44 | bool |
| 45 | InMemoryStorageLru::evictItem() |
| 46 | { |
| 47 | if (!m_cleanupIndex.get<byUsedTime>().empty()) { |
| 48 | CleanupIndex::index<byUsedTime>::type::iterator it = m_cleanupIndex.get<byUsedTime>().begin(); |
| 49 | eraseImpl((*it)->getFullName()); |
| 50 | m_cleanupIndex.get<byUsedTime>().erase(it); |
| 51 | return true; |
| 52 | } |
| 53 | |
| 54 | return false; |
| 55 | } |
| 56 | |
| 57 | void |
| 58 | InMemoryStorageLru::beforeErase(InMemoryStorageEntry* entry) |
| 59 | { |
| 60 | CleanupIndex::index<byEntity>::type::iterator it = m_cleanupIndex.get<byEntity>().find(entry); |
| 61 | if (it != m_cleanupIndex.get<byEntity>().end()) |
| 62 | m_cleanupIndex.get<byEntity>().erase(it); |
| 63 | } |
| 64 | |
| 65 | void |
| 66 | InMemoryStorageLru::afterAccess(InMemoryStorageEntry* entry) |
| 67 | { |
| 68 | beforeErase(entry); |
| 69 | afterInsert(entry); |
| 70 | } |
| 71 | |
| 72 | } // namespace util |
| 73 | } // namespace ndn |