blob: eb41bd2e6731a9cb679e2c680f6166acee47d31f [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
*
* 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)
{
}
static inline bool
predicate_NextHop_eq_Face(const NextHop& nexthop, shared_ptr<Face> face)
{
return nexthop.getFace() == face;
}
bool
Entry::hasNextHop(shared_ptr<Face> face) const
{
NextHopList::const_iterator it = std::find_if(m_nextHops.begin(), m_nextHops.end(),
bind(&predicate_NextHop_eq_Face, _1, face));
return it != m_nextHops.end();
}
void
Entry::addNextHop(shared_ptr<Face> face, int32_t cost)
{
NextHopList::iterator it = std::find_if(m_nextHops.begin(), m_nextHops.end(),
bind(&predicate_NextHop_eq_Face, _1, face));
if (it == m_nextHops.end()) {
m_nextHops.push_back(fib::NextHop(face));
it = m_nextHops.end() - 1;
}
// now it refers to the NextHop for face
it->setCost(cost);
this->sortNextHops();
}
void
Entry::removeNextHop(shared_ptr<Face> face)
{
NextHopList::iterator it = std::find_if(m_nextHops.begin(), m_nextHops.end(),
bind(&predicate_NextHop_eq_Face, _1, face));
if (it == m_nextHops.end()) {
return;
}
m_nextHops.erase(it);
}
static inline bool
compare_NextHop_cost(const NextHop& a, const NextHop& b)
{
return a.getCost() < b.getCost();
}
void
Entry::sortNextHops()
{
std::sort(m_nextHops.begin(), m_nextHops.end(), &compare_NextHop_cost);
}
} // namespace fib
} // namespace nfd