ashiqopu
92 lines
2.9 KiB
C++
92 lines
2.9 KiB
C++
/* -*- Mode:C++; c-file-style:"gnu"; indent-tabs-mode:nil; -*- */
|
|
/*
|
|
* Copyright (c) 2014-2019, 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-entry.hpp"
|
|
|
|
namespace nfd {
|
|
namespace fib {
|
|
|
|
Entry::Entry(const Name& prefix)
|
|
: m_prefix(prefix)
|
|
, m_nameTreeEntry(nullptr)
|
|
{
|
|
}
|
|
|
|
NextHopList::iterator
|
|
Entry::findNextHop(const Face& face, uint64_t endpointId)
|
|
{
|
|
return std::find_if(m_nextHops.begin(), m_nextHops.end(),
|
|
[&face, endpointId] (const NextHop& nexthop) {
|
|
return &nexthop.getFace() == &face && nexthop.getEndpointId() == endpointId;
|
|
});
|
|
}
|
|
|
|
bool
|
|
Entry::hasNextHop(const Face& face, uint64_t endpointId) const
|
|
{
|
|
return const_cast<Entry*>(this)->findNextHop(face, endpointId) != m_nextHops.end();
|
|
}
|
|
|
|
void
|
|
Entry::addOrUpdateNextHop(Face& face, uint64_t endpointId, uint64_t cost)
|
|
{
|
|
auto it = this->findNextHop(face, endpointId);
|
|
if (it == m_nextHops.end()) {
|
|
m_nextHops.emplace_back(face, endpointId);
|
|
it = std::prev(m_nextHops.end());
|
|
}
|
|
it->setCost(cost);
|
|
this->sortNextHops();
|
|
}
|
|
|
|
void
|
|
Entry::removeNextHop(const Face& face, uint64_t endpointId)
|
|
{
|
|
auto it = this->findNextHop(face, endpointId);
|
|
if (it != m_nextHops.end()) {
|
|
m_nextHops.erase(it);
|
|
}
|
|
}
|
|
|
|
void
|
|
Entry::removeNextHopByFace(const Face& face)
|
|
{
|
|
auto it = std::remove_if(m_nextHops.begin(), m_nextHops.end(),
|
|
[&face] (const NextHop& nexthop) {
|
|
return &nexthop.getFace() == &face;
|
|
});
|
|
m_nextHops.erase(it, m_nextHops.end());
|
|
}
|
|
|
|
void
|
|
Entry::sortNextHops()
|
|
{
|
|
std::sort(m_nextHops.begin(), m_nextHops.end(),
|
|
[] (const NextHop& a, const NextHop& b) { return a.getCost() < b.getCost(); });
|
|
}
|
|
|
|
} // namespace fib
|
|
} // namespace nfd
|