fib-entry.hpp

Go to the documentation of this file.

/* -*- 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/>.
 */
 
#ifndef NFD_DAEMON_TABLE_FIB_ENTRY_HPP
#define NFD_DAEMON_TABLE_FIB_ENTRY_HPP
 
#include "fib-nexthop.hpp"
 
namespace nfd {
 
namespace name_tree {
class Entry;
} // namespace name_tree
 
namespace fib {
 
class Fib;
 
using NextHopList = std::vector<NextHop>;
 
class Entry : noncopyable
{
public:
  explicit
  Entry(const Name& prefix);
 
  const Name&
  getPrefix() const
  {
    return m_prefix;
  }
 
  const NextHopList&
  getNextHops() const
  {
    return m_nextHops;
  }
 
  bool
  hasNextHops() const
  {
    return !m_nextHops.empty();
  }
 
  bool
  hasNextHop(const Face& face) const;
 
private:
  std::pair<NextHopList::iterator, bool>
  addOrUpdateNextHop(Face& face, uint64_t cost);
 
  bool
  removeNextHop(const Face& face);
 
  NextHopList::iterator
  findNextHop(const Face& face);
 
  void
  sortNextHops();
 
private:
  Name m_prefix;
  NextHopList m_nextHops;
 
  name_tree::Entry* m_nameTreeEntry = nullptr;
 
  friend class name_tree::Entry;
  friend class Fib;
};
 
} // namespace fib
} // namespace nfd
 
#endif // NFD_DAEMON_TABLE_FIB_ENTRY_HPP