fib-entry.cpp
Go to the documentation of this file.
1 /* -*- Mode:C++; c-file-style:"gnu"; indent-tabs-mode:nil; -*- */
2 /*
3  * Copyright (c) 2014-2019, Regents of the University of California,
4  * Arizona Board of Regents,
5  * Colorado State University,
6  * University Pierre & Marie Curie, Sorbonne University,
7  * Washington University in St. Louis,
8  * Beijing Institute of Technology,
9  * The University of Memphis.
10  *
11  * This file is part of NFD (Named Data Networking Forwarding Daemon).
12  * See AUTHORS.md for complete list of NFD authors and contributors.
13  *
14  * NFD is free software: you can redistribute it and/or modify it under the terms
15  * of the GNU General Public License as published by the Free Software Foundation,
16  * either version 3 of the License, or (at your option) any later version.
17  *
18  * NFD is distributed in the hope that it will be useful, but WITHOUT ANY WARRANTY;
19  * without even the implied warranty of MERCHANTABILITY or FITNESS FOR A PARTICULAR
20  * PURPOSE. See the GNU General Public License for more details.
21  *
22  * You should have received a copy of the GNU General Public License along with
23  * NFD, e.g., in COPYING.md file. If not, see <http://www.gnu.org/licenses/>.
24  */
25 
26 #include "fib-entry.hpp"
27 
28 namespace nfd {
29 namespace fib {
30 
31 Entry::Entry(const Name& prefix)
32  : m_prefix(prefix)
33 {
34 }
35 
36 NextHopList::iterator
37 Entry::findNextHop(const Face& face)
38 {
39  return std::find_if(m_nextHops.begin(), m_nextHops.end(),
40  [&face] (const NextHop& nexthop) {
41  return &nexthop.getFace() == &face;
42  });
43 }
44 
45 bool
46 Entry::hasNextHop(const Face& face) const
47 {
48  return const_cast<Entry*>(this)->findNextHop(face) != m_nextHops.end();
49 }
50 
51 std::pair<NextHopList::iterator, bool>
52 Entry::addOrUpdateNextHop(Face& face, uint64_t cost)
53 {
54  auto it = this->findNextHop(face);
55  bool isNew = false;
56  if (it == m_nextHops.end()) {
57  m_nextHops.emplace_back(face);
58  it = std::prev(m_nextHops.end());
59  isNew = true;
60  }
61 
62  it->setCost(cost);
63  this->sortNextHops();
64 
65  return std::make_pair(it, isNew);
66 }
67 
68 bool
69 Entry::removeNextHop(const Face& face)
70 {
71  auto it = this->findNextHop(face);
72  if (it != m_nextHops.end()) {
73  m_nextHops.erase(it);
74  return true;
75  }
76  return false;
77 }
78 
79 void
80 Entry::sortNextHops()
81 {
82  std::sort(m_nextHops.begin(), m_nextHops.end(),
83  [] (const NextHop& a, const NextHop& b) { return a.getCost() < b.getCost(); });
84 }
85 
86 } // namespace fib
87 } // namespace nfd
bool hasNextHop(const Face &face) const
Definition: fib-entry.cpp:46
represents a FIB entry
Definition: fib-entry.hpp:53
Entry(const Name &prefix)
Definition: fib-entry.cpp:31
Copyright (c) 2014-2015, Regents of the University of California, Arizona Board of Regents...
Definition: algorithm.hpp:32
Represents a nexthop record in a FIB entry.
Definition: fib-nexthop.hpp:37
uint64_t getCost() const
Definition: fib-nexthop.hpp:53