26 #ifndef NFD_DAEMON_FW_ALGORITHM_HPP 27 #define NFD_DAEMON_FW_ALGORITHM_HPP 44 wouldViolateScope(
const Face& inFace,
const Interest& interest,
const Face& outFace);
84 time::steady_clock::TimePoint
90 fib::NextHopList::const_iterator
93 const shared_ptr<pit::Entry>& pitEntry);
106 const shared_ptr<pit::Entry>& pitEntry,
107 bool wantUnused =
false,
108 time::steady_clock::TimePoint now = time::steady_clock::TimePoint::min());
113 #endif // NFD_DAEMON_FW_ALGORITHM_HPP bool canForwardToLegacy(const pit::Entry &pitEntry, const Face &face)
decide whether Interest can be forwarded to face
fib::NextHopList::const_iterator 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
int findDuplicateNonce(const pit::Entry &pitEntry, Interest::Nonce nonce, const Face &face)
determine whether pitEntry has duplicate Nonce nonce
Copyright (c) 2014-2015, Regents of the University of California, Arizona Board of Regents...
bool isNextHopEligible(const Face &inFace, const Interest &interest, const fib::NextHop &nexthop, const shared_ptr< pit::Entry > &pitEntry, bool wantUnused, time::steady_clock::TimePoint now)
determines whether a NextHop is eligible i.e.
generalization of a network interface
Represents a collection of nexthops.
bool hasPendingOutRecords(const pit::Entry &pitEntry)
determine whether pitEntry has any pending out-records
no duplicate Nonce is found
time::steady_clock::TimePoint getLastOutgoing(const pit::Entry &pitEntry)
DuplicateNonceWhere
indicates where duplicate Nonces are found
Represents a nexthop record in a FIB entry.
bool wouldViolateScope(const Face &inFace, const Interest &interest, const Face &outFace)
determine whether forwarding the Interest in pitEntry to outFace would violate scope ...