rib.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_RIB_RIB_HPP
#define NFD_DAEMON_RIB_RIB_HPP
 
#include "rib-entry.hpp"
#include "rib-update-batch.hpp"
 
#include <ndn-cxx/mgmt/nfd/control-parameters.hpp>
 
namespace nfd::rib {
 
using ndn::nfd::ControlParameters;
 
class FibUpdater;
 
struct RibRouteRef
{
  shared_ptr<RibEntry> entry;
  RibEntry::const_iterator route;
};
 
bool
operator<(const RibRouteRef& lhs, const RibRouteRef& rhs);
 
class Rib : noncopyable
{
public:
  using RibEntryList = std::list<shared_ptr<RibEntry>>;
  using RibTable = std::map<Name, shared_ptr<RibEntry>>;
  using const_iterator = RibTable::const_iterator;
 
  void
  setFibUpdater(FibUpdater* updater);
 
  const_iterator
  find(const Name& prefix) const;
 
  Route*
  find(const Name& prefix, const Route& route) const;
 
  Route*
  findLongestPrefix(const Name& prefix, const Route& route) const;
 
  const_iterator
  begin() const
  {
    return m_rib.begin();
  }
 
  const_iterator
  end() const
  {
    return m_rib.end();
  }
 
  size_t
  size() const noexcept
  {
    return m_nItems;
  }
 
  [[nodiscard]] bool
  empty() const noexcept
  {
    return m_rib.empty();
  }
 
  shared_ptr<RibEntry>
  findParent(const Name& prefix) const;
 
public:
  using UpdateSuccessCallback = std::function<void()>;
  using UpdateFailureCallback = std::function<void(uint32_t code, const std::string& error)>;
 
  void
  beginApplyUpdate(const RibUpdate& update,
                   const UpdateSuccessCallback& onSuccess,
                   const UpdateFailureCallback& onFailure);
 
  void
  beginRemoveFace(uint64_t faceId);
 
  void
  beginRemoveFailedFaces(const std::set<uint64_t>& activeFaceIds);
 
  void
  onRouteExpiration(const Name& prefix, const Route& route);
 
  void
  insert(const Name& prefix, const Route& route);
 
private:
  void
  enqueueRemoveFace(const RibEntry& entry, uint64_t faceId);
 
  void
  addUpdateToQueue(const RibUpdate& update,
                   const Rib::UpdateSuccessCallback& onSuccess,
                   const Rib::UpdateFailureCallback& onFailure);
 
  void
  sendBatchFromQueue();
 
  void
  onFibUpdateSuccess(const RibUpdateBatch& batch,
                     const RibUpdateList& inheritedRoutes,
                     const Rib::UpdateSuccessCallback& onSuccess);
 
  void
  onFibUpdateFailure(const Rib::UpdateFailureCallback& onFailure,
                     uint32_t code, const std::string& error);
 
NFD_PUBLIC_WITH_TESTS_ELSE_PRIVATE:
  void
  erase(const Name& prefix, const Route& route);
 
private:
  using RouteComparePredicate = bool (*)(const Route&, const Route&);
  using RouteSet = std::set<Route, RouteComparePredicate>;
 
  std::list<shared_ptr<RibEntry>>
  findDescendants(const Name& prefix) const;
 
  std::list<shared_ptr<RibEntry>>
  findDescendantsForNonInsertedName(const Name& prefix) const;
 
  RibTable::iterator
  eraseEntry(RibTable::iterator it);
 
  void
  updateRib(const RibUpdateBatch& batch);
 
  RouteSet
  getAncestorRoutes(const RibEntry& entry) const;
 
  RouteSet
  getAncestorRoutes(const Name& name) const;
 
  void
  modifyInheritedRoutes(const RibUpdateList& inheritedRoutes);
 
public:
  signal::Signal<Rib, Name> afterInsertEntry;
 
  signal::Signal<Rib, Name> afterEraseEntry;
 
  signal::Signal<Rib, RibRouteRef> afterAddRoute;
 
  signal::Signal<Rib, RibRouteRef> beforeRemoveRoute;
 
private:
  RibTable m_rib;
  // FaceId => Entry with Route on this face
  std::multimap<uint64_t, shared_ptr<RibEntry>> m_faceEntries;
  size_t m_nItems = 0;
  FibUpdater* m_fibUpdater = nullptr;
 
  struct UpdateQueueItem
  {
    RibUpdateBatch batch;
    const Rib::UpdateSuccessCallback managerSuccessCallback;
    const Rib::UpdateFailureCallback managerFailureCallback;
  };
 
  using UpdateQueue = std::list<UpdateQueueItem>;
  UpdateQueue m_updateBatches;
  bool m_isUpdateInProgress = false;
 
  friend FibUpdater;
};
 
std::ostream&
operator<<(std::ostream& os, const Rib& rib);
 
} // namespace nfd::rib
 
#endif // NFD_DAEMON_RIB_RIB_HPP