Change-Id: If0ae14cbf97ee3d9b92a3467d0b6592c10e66698 Refs: #2462, #2352, #2209
259 lines
6.2 KiB
C++
259 lines
6.2 KiB
C++
/* -*- Mode:C++; c-file-style:"gnu"; indent-tabs-mode:nil; -*- */
|
|
/**
|
|
* Copyright (c) 2014-2015, 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 "rib-entry.hpp"
|
|
|
|
#include "core/logger.hpp"
|
|
|
|
#include <ndn-cxx/management/nfd-control-command.hpp>
|
|
|
|
NFD_LOG_INIT("RibEntry");
|
|
|
|
namespace nfd {
|
|
namespace rib {
|
|
|
|
RibEntry::RouteList::iterator
|
|
RibEntry::findRoute(const Route& route)
|
|
{
|
|
return std::find_if(begin(), end(), bind(&compareFaceIdAndOrigin, _1, route));
|
|
}
|
|
|
|
bool
|
|
RibEntry::insertRoute(const Route& route)
|
|
{
|
|
iterator it = findRoute(route);
|
|
|
|
if (it == end())
|
|
{
|
|
if (route.flags & ndn::nfd::ROUTE_FLAG_CAPTURE)
|
|
{
|
|
m_nRoutesWithCaptureSet++;
|
|
}
|
|
|
|
m_routes.push_back(route);
|
|
return true;
|
|
}
|
|
else
|
|
{
|
|
return false;
|
|
}
|
|
}
|
|
|
|
void
|
|
RibEntry::eraseRoute(const Route& route)
|
|
{
|
|
RibEntry::iterator it = findRoute(route);
|
|
eraseRoute(it);
|
|
}
|
|
|
|
bool
|
|
RibEntry::hasRoute(const Route& route)
|
|
{
|
|
RibEntry::const_iterator it = findRoute(route);
|
|
|
|
return it != end();
|
|
}
|
|
|
|
bool
|
|
RibEntry::hasFaceId(const uint64_t faceId) const
|
|
{
|
|
RibEntry::const_iterator it = std::find_if(begin(), end(), bind(&compareFaceId, _1, faceId));
|
|
|
|
return it != end();
|
|
}
|
|
|
|
void
|
|
RibEntry::addChild(shared_ptr<RibEntry> child)
|
|
{
|
|
BOOST_ASSERT(!static_cast<bool>(child->getParent()));
|
|
child->setParent(this->shared_from_this());
|
|
m_children.push_back(child);
|
|
}
|
|
|
|
void
|
|
RibEntry::removeChild(shared_ptr<RibEntry> child)
|
|
{
|
|
BOOST_ASSERT(child->getParent().get() == this);
|
|
child->setParent(shared_ptr<RibEntry>());
|
|
m_children.remove(child);
|
|
}
|
|
|
|
RibEntry::RouteList::iterator
|
|
RibEntry::eraseRoute(RouteList::iterator route)
|
|
{
|
|
if (route != m_routes.end())
|
|
{
|
|
if (route->flags & ndn::nfd::ROUTE_FLAG_CAPTURE)
|
|
{
|
|
m_nRoutesWithCaptureSet--;
|
|
}
|
|
|
|
//cancel any scheduled event
|
|
NFD_LOG_TRACE("Cancelling expiration eventId: " << route->getExpirationEvent());
|
|
scheduler::cancel(route->getExpirationEvent());
|
|
|
|
return m_routes.erase(route);
|
|
}
|
|
|
|
return m_routes.end();
|
|
}
|
|
|
|
void
|
|
RibEntry::addInheritedRoute(const Route& route)
|
|
{
|
|
m_inheritedRoutes.push_back(route);
|
|
}
|
|
|
|
void
|
|
RibEntry::removeInheritedRoute(const Route& route)
|
|
{
|
|
RouteList::iterator it = findInheritedRoute(route);
|
|
m_inheritedRoutes.erase(it);
|
|
}
|
|
|
|
RibEntry::RouteList::iterator
|
|
RibEntry::findInheritedRoute(const Route& route)
|
|
{
|
|
return std::find_if(m_inheritedRoutes.begin(), m_inheritedRoutes.end(),
|
|
bind(&compareFaceId, _1, route.faceId));
|
|
}
|
|
|
|
bool
|
|
RibEntry::hasInheritedRoute(const Route& route)
|
|
{
|
|
RouteList::const_iterator it = findInheritedRoute(route);
|
|
|
|
return (it != m_inheritedRoutes.end());
|
|
}
|
|
|
|
bool
|
|
RibEntry::hasCapture() const
|
|
{
|
|
return m_nRoutesWithCaptureSet > 0;
|
|
}
|
|
|
|
bool
|
|
RibEntry::hasChildInheritOnFaceId(uint64_t faceId) const
|
|
{
|
|
for (RibEntry::const_iterator it = m_routes.begin(); it != m_routes.end(); ++it)
|
|
{
|
|
if (it->faceId == faceId && (it->flags & ndn::nfd::ROUTE_FLAG_CHILD_INHERIT))
|
|
{
|
|
return true;
|
|
}
|
|
}
|
|
|
|
return false;
|
|
}
|
|
|
|
shared_ptr<Route>
|
|
RibEntry::getRouteWithLowestCostByFaceId(uint64_t faceId)
|
|
{
|
|
shared_ptr<Route> candidate;
|
|
|
|
for (const Route& route : m_routes)
|
|
{
|
|
// Correct face ID
|
|
if (route.faceId == faceId)
|
|
{
|
|
// If this is the first route with this Face ID found
|
|
if (candidate == nullptr)
|
|
{
|
|
candidate = make_shared<Route>(route);
|
|
}
|
|
else if (route.cost < candidate->cost) // Found a route with a lower cost
|
|
{
|
|
candidate = make_shared<Route>(route);
|
|
}
|
|
}
|
|
}
|
|
|
|
return candidate;
|
|
}
|
|
|
|
shared_ptr<Route>
|
|
RibEntry::getRouteWithLowestCostAndChildInheritByFaceId(uint64_t faceId)
|
|
{
|
|
shared_ptr<Route> candidate;
|
|
|
|
for (const Route& route : m_routes)
|
|
{
|
|
// Correct face ID and Child Inherit flag set
|
|
if (route.faceId == faceId &&
|
|
(route.flags & ndn::nfd::ROUTE_FLAG_CHILD_INHERIT) == ndn::nfd::ROUTE_FLAG_CHILD_INHERIT)
|
|
{
|
|
// If this is the first route with this Face ID found
|
|
if (candidate == nullptr)
|
|
{
|
|
candidate = make_shared<Route>(route);
|
|
}
|
|
else if (route.cost < candidate->cost) // Found a route with a lower cost
|
|
{
|
|
candidate = make_shared<Route>(route);
|
|
}
|
|
}
|
|
}
|
|
|
|
return candidate;
|
|
}
|
|
|
|
std::ostream&
|
|
operator<<(std::ostream& os, const Route& route)
|
|
{
|
|
os << "Route("
|
|
<< "faceid: " << route.faceId
|
|
<< ", origin: " << route.origin
|
|
<< ", cost: " << route.cost
|
|
<< ", flags: " << route.flags;
|
|
if (route.expires != time::steady_clock::TimePoint::max()) {
|
|
os << ", expires in: " << (route.expires - time::steady_clock::now());
|
|
}
|
|
else {
|
|
os << ", never expires";
|
|
}
|
|
os << ")";
|
|
|
|
return os;
|
|
}
|
|
|
|
std::ostream&
|
|
operator<<(std::ostream& os, const RibEntry& entry)
|
|
{
|
|
os << "RibEntry {\n";
|
|
os << "\tName: " << entry.getName() << "\n";
|
|
|
|
for (const Route& route : entry)
|
|
{
|
|
os << "\t" << route << "\n";
|
|
}
|
|
|
|
os << "}";
|
|
|
|
return os;
|
|
}
|
|
|
|
} // namespace rib
|
|
} // namespace nfd
|