fib.hpp

Go to the documentation of this file.

/* -*- Mode:C++; c-file-style:"gnu"; indent-tabs-mode:nil; -*- */
/*
 * Copyright (c) 2014-2022,  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_HPP
#define NFD_DAEMON_TABLE_FIB_HPP
 
#include "fib-entry.hpp"
#include "name-tree.hpp"
 
#include <boost/range/adaptor/transformed.hpp>
 
namespace nfd {
 
namespace measurements {
class Entry;
} // namespace measurements
 
namespace pit {
class Entry;
} // namespace pit
 
namespace fib {
 
class Fib : noncopyable
{
public:
  explicit
  Fib(NameTree& nameTree);
 
  size_t
  size() const noexcept
  {
    return m_nItems;
  }
 
public: // lookup
  const Entry&
  findLongestPrefixMatch(const Name& prefix) const;
 
  const Entry&
  findLongestPrefixMatch(const pit::Entry& pitEntry) const;
 
  const Entry&
  findLongestPrefixMatch(const measurements::Entry& measurementsEntry) const;
 
  Entry*
  findExactMatch(const Name& prefix);
 
public: // mutation
  static constexpr size_t
  getMaxDepth()
  {
    return NameTree::getMaxDepth();
  }
 
  std::pair<Entry*, bool>
  insert(const Name& prefix);
 
  void
  erase(const Name& prefix);
 
  void
  erase(const Entry& entry);
 
  void
  addOrUpdateNextHop(Entry& entry, Face& face, uint64_t cost);
 
  enum class RemoveNextHopResult {
    NO_SUCH_NEXTHOP, 
    NEXTHOP_REMOVED, 
    FIB_ENTRY_REMOVED 
  };
 
  RemoveNextHopResult
  removeNextHop(Entry& entry, const Face& face);
 
public: // enumeration
  using Range = boost::transformed_range<name_tree::GetTableEntry<Entry>, const name_tree::Range>;
  using const_iterator = boost::range_iterator<Range>::type;
 
  const_iterator
  begin() const
  {
    return this->getRange().begin();
  }
 
  const_iterator
  end() const
  {
    return this->getRange().end();
  }
 
public: // signal
  signal::Signal<Fib, Name, NextHop> afterNewNextHop;
 
private:
  template<typename K>
  const Entry&
  findLongestPrefixMatchImpl(const K& key) const;
 
  void
  erase(name_tree::Entry* nte, bool canDeleteNte = true);
 
  Range
  getRange() const;
 
private:
  NameTree& m_nameTree;
  size_t m_nItems = 0;
 
  static const unique_ptr<Entry> s_emptyEntry;
};
 
} // namespace fib
 
using fib::Fib;
 
} // namespace nfd
 
#endif // NFD_DAEMON_TABLE_FIB_HPP