NFD: Named Data Networking Forwarding Daemon 24.07-28-gdcc0e6e0
Loading...
Searching...
No Matches
algorithm.cpp File Reference
#include "algorithm.hpp"
#include "scope-prefix.hpp"
#include "face/face.hpp"
+ Include dependency graph for algorithm.cpp:

Go to the source code of this file.

Namespaces

namespace  nfd
 
namespace  nfd::fw
 

Functions

int nfd::fw::findDuplicateNonce (const pit::Entry &pitEntry, Interest::Nonce nonce, const Face &face)
 Determine whether pitEntry has duplicate Nonce nonce.
 
fib::NextHopList::const_iterator nfd::fw::findEligibleNextHopWithEarliestOutRecord (const Face &inFace, const Interest &interest, const fib::NextHopList &nexthops, const shared_ptr< pit::Entry > &pitEntry)
 Pick an eligible NextHop with earliest out-record.
 
time::steady_clock::time_point nfd::fw::getLastOutgoing (const pit::Entry &pitEntry)
 
bool nfd::fw::hasPendingOutRecords (const pit::Entry &pitEntry)
 Determine whether pitEntry has any pending out-records.
 
bool nfd::fw::isNextHopEligible (const Face &inFace, const Interest &interest, const fib::NextHop &nexthop, const shared_ptr< pit::Entry > &pitEntry, bool wantUnused=false, time::steady_clock::time_point now=time::steady_clock::time_point::min())
 Determines whether a NextHop is eligible, i.e., not the same inFace.
 
bool nfd::fw::wouldViolateScope (const Face &inFace, const Interest &interest, const Face &outFace)
 Determine whether forwarding the Interest in pitEntry to outFace would violate scope.