This file contains common algorithms used by forwarding strategies. More...
Go to the source code of this file.
Namespaces | |
nfd | |
-status-http-server | |
nfd::fw | |
Enumerations | |
enum | nfd::fw::DuplicateNonceWhere { nfd::fw::DUPLICATE_NONCE_NONE = 0 , nfd::fw::DUPLICATE_NONCE_IN_SAME = (1 << 0) , nfd::fw::DUPLICATE_NONCE_IN_OTHER = (1 << 1) , nfd::fw::DUPLICATE_NONCE_OUT_SAME = (1 << 2) , nfd::fw::DUPLICATE_NONCE_OUT_OTHER = (1 << 3) } |
Indicates where duplicate Nonces are found. More... | |
Functions | |
int | nfd::fw::findDuplicateNonce (const pit::Entry &pitEntry, Interest::Nonce nonce, const Face &face) |
Determine whether pitEntry has duplicate Nonce nonce . More... | |
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. More... | |
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. More... | |
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 . More... | |
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. More... | |
This file contains common algorithms used by forwarding strategies.
Definition in file algorithm.hpp.