blob: c28a6954153045d915d0854c677023a2dff61b62 [file] [log] [blame]
/* -*- Mode:C++; c-file-style:"gnu"; indent-tabs-mode:nil; -*- */
/**
* Copyright (c) 2014, Regents of the University of California,
* Arizona Board of Regents,
* Colorado State University,
* University Pierre & Marie Curie, Sorbonne University,
* Washington University in St. Louis,
* Beijing Institute of Technology,
* The University of Memphis
*
* This file is part of NFD (Named Data Networking Forwarding Daemon).
* See AUTHORS.md for complete list of NFD authors and contributors.
*
* NFD is free software: you can redistribute it and/or modify it under the terms
* of the GNU General Public License as published by the Free Software Foundation,
* either version 3 of the License, or (at your option) any later version.
*
* NFD 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 General Public License for more details.
*
* You should have received a copy of the GNU General Public License along with
* NFD, e.g., in COPYING.md file. If not, see <http://www.gnu.org/licenses/>.
*/
#include "fib.hpp"
#include "pit-entry.hpp"
#include "measurements-entry.hpp"
namespace nfd {
const shared_ptr<fib::Entry> Fib::s_emptyEntry = make_shared<fib::Entry>(Name());
Fib::Fib(NameTree& nameTree)
: m_nameTree(nameTree)
, m_nItems(0)
{
}
Fib::~Fib()
{
}
static inline bool
predicate_NameTreeEntry_hasFibEntry(const name_tree::Entry& entry)
{
return static_cast<bool>(entry.getFibEntry());
}
shared_ptr<fib::Entry>
Fib::findLongestPrefixMatch(const Name& prefix) const
{
shared_ptr<name_tree::Entry> nameTreeEntry =
m_nameTree.findLongestPrefixMatch(prefix, &predicate_NameTreeEntry_hasFibEntry);
if (static_cast<bool>(nameTreeEntry)) {
return nameTreeEntry->getFibEntry();
}
return s_emptyEntry;
}
shared_ptr<fib::Entry>
Fib::findLongestPrefixMatch(shared_ptr<name_tree::Entry> nameTreeEntry) const
{
shared_ptr<fib::Entry> entry = nameTreeEntry->getFibEntry();
if (static_cast<bool>(entry))
return entry;
nameTreeEntry = m_nameTree.findLongestPrefixMatch(nameTreeEntry,
&predicate_NameTreeEntry_hasFibEntry);
if (static_cast<bool>(nameTreeEntry)) {
return nameTreeEntry->getFibEntry();
}
return s_emptyEntry;
}
shared_ptr<fib::Entry>
Fib::findLongestPrefixMatch(const pit::Entry& pitEntry) const
{
shared_ptr<name_tree::Entry> nameTreeEntry = m_nameTree.get(pitEntry);
BOOST_ASSERT(static_cast<bool>(nameTreeEntry));
return findLongestPrefixMatch(nameTreeEntry);
}
shared_ptr<fib::Entry>
Fib::findLongestPrefixMatch(const measurements::Entry& measurementsEntry) const
{
shared_ptr<name_tree::Entry> nameTreeEntry = m_nameTree.get(measurementsEntry);
BOOST_ASSERT(static_cast<bool>(nameTreeEntry));
return findLongestPrefixMatch(nameTreeEntry);
}
shared_ptr<fib::Entry>
Fib::findExactMatch(const Name& prefix) const
{
shared_ptr<name_tree::Entry> nameTreeEntry = m_nameTree.findExactMatch(prefix);
if (static_cast<bool>(nameTreeEntry))
return nameTreeEntry->getFibEntry();
return shared_ptr<fib::Entry>();
}
std::pair<shared_ptr<fib::Entry>, bool>
Fib::insert(const Name& prefix)
{
shared_ptr<name_tree::Entry> nameTreeEntry = m_nameTree.lookup(prefix);
shared_ptr<fib::Entry> entry = nameTreeEntry->getFibEntry();
if (static_cast<bool>(entry))
return std::make_pair(entry, false);
entry = make_shared<fib::Entry>(prefix);
nameTreeEntry->setFibEntry(entry);
++m_nItems;
return std::make_pair(entry, true);
}
void
Fib::erase(shared_ptr<name_tree::Entry> nameTreeEntry)
{
nameTreeEntry->setFibEntry(shared_ptr<fib::Entry>());
m_nameTree.eraseEntryIfEmpty(nameTreeEntry);
--m_nItems;
}
void
Fib::erase(const Name& prefix)
{
shared_ptr<name_tree::Entry> nameTreeEntry = m_nameTree.findExactMatch(prefix);
if (static_cast<bool>(nameTreeEntry)) {
this->erase(nameTreeEntry);
}
}
void
Fib::erase(const fib::Entry& entry)
{
shared_ptr<name_tree::Entry> nameTreeEntry = m_nameTree.get(entry);
if (static_cast<bool>(nameTreeEntry)) {
this->erase(nameTreeEntry);
}
}
void
Fib::removeNextHopFromAllEntries(shared_ptr<Face> face)
{
std::list<fib::Entry*> toErase;
auto&& enumerable = m_nameTree.fullEnumerate(&predicate_NameTreeEntry_hasFibEntry);
for (const name_tree::Entry& nte : enumerable) {
shared_ptr<fib::Entry> entry = nte.getFibEntry();
entry->removeNextHop(face);
if (!entry->hasNextHops()) {
toErase.push_back(entry.get());
// entry needs to be erased, but we must wait until the enumeration ends,
// because otherwise NameTree iterator would be invalidated
}
}
for (fib::Entry* entry : toErase) {
this->erase(*entry);
}
}
Fib::const_iterator
Fib::begin() const
{
return const_iterator(m_nameTree.fullEnumerate(&predicate_NameTreeEntry_hasFibEntry).begin());
}
} // namespace nfd