algorithm.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_FW_PIT_ALGORITHM_HPP
#define NFD_DAEMON_FW_PIT_ALGORITHM_HPP
 
#include "fw/scope-prefix.hpp"
#include "table/fib.hpp"
#include "table/pit-entry.hpp"
 
namespace nfd {
namespace fw {
 
bool
wouldViolateScope(const Face& inFace, const Interest& interest, const Face& outFace);
 
bool
canForwardToLegacy(const pit::Entry& pitEntry, const Face& face);
 
enum DuplicateNonceWhere {
  DUPLICATE_NONCE_NONE      = 0,        
  DUPLICATE_NONCE_IN_SAME   = (1 << 0), 
  DUPLICATE_NONCE_IN_OTHER  = (1 << 1), 
  DUPLICATE_NONCE_OUT_SAME  = (1 << 2), 
  DUPLICATE_NONCE_OUT_OTHER = (1 << 3)  
};
 
int
findDuplicateNonce(const pit::Entry& pitEntry, uint32_t nonce, const Face& face);
 
bool
hasPendingOutRecords(const pit::Entry& pitEntry);
 
time::steady_clock::TimePoint
getLastOutgoing(const pit::Entry& pitEntry);
 
fib::NextHopList::const_iterator
findEligibleNextHopWithEarliestOutRecord(const Face& inFace, const Interest& interest,
                                         const fib::NextHopList& nexthops,
                                         const shared_ptr<pit::Entry>& pitEntry);
 
bool
isNextHopEligible(const Face& inFace, const Interest& interest,
                  const fib::NextHop& nexthop,
                  const shared_ptr<pit::Entry>& pitEntry,
                  bool wantUnused = false,
                  time::steady_clock::TimePoint now = time::steady_clock::TimePoint::min());
 
} // namespace fw
} // namespace nfd
 
#endif // NFD_DAEMON_FW_PIT_ALGORITHM_HPP