34 if (outFace.
getScope() == ndn::nfd::FACE_SCOPE_LOCAL) {
46 return inFace.
getScope() != ndn::nfd::FACE_SCOPE_LOCAL;
56 time::steady_clock::TimePoint now = time::steady_clock::now();
58 bool hasUnexpiredOutRecord = std::any_of(pitEntry.
out_begin(), pitEntry.
out_end(),
60 return &outRecord.getFace() == &face && outRecord.getExpiry() >= now;
62 if (hasUnexpiredOutRecord) {
66 bool hasUnexpiredOtherInRecord = std::any_of(pitEntry.
in_begin(), pitEntry.
in_end(),
68 return &inRecord.getFace() != &face && inRecord.getExpiry() >= now;
70 if (!hasUnexpiredOtherInRecord) {
83 if (inRecord.getLastNonce() == nonce) {
84 if (&inRecord.getFace() == &face) {
94 if (outRecord.getLastNonce() == nonce) {
95 if (&outRecord.getFace() == &face) {
110 time::steady_clock::TimePoint now = time::steady_clock::now();
113 return outRecord.getExpiry() >= now &&
114 outRecord.getIncomingNack() ==
nullptr;
118 time::steady_clock::TimePoint
121 pit::OutRecordCollection::const_iterator lastOutgoing = std::max_element(
126 BOOST_ASSERT(lastOutgoing != pitEntry.
out_end());
128 return lastOutgoing->getLastRenewed();
131 fib::NextHopList::const_iterator
134 const shared_ptr<pit::Entry>& pitEntry)
136 auto found = nexthops.end();
137 auto earliestRenewed = time::steady_clock::TimePoint::max();
139 for (
auto it = nexthops.begin(); it != nexthops.end(); ++it) {
143 auto outRecord = pitEntry->getOutRecord(it->getFace());
144 BOOST_ASSERT(outRecord != pitEntry->out_end());
145 if (outRecord->getLastRenewed() < earliestRenewed) {
147 earliestRenewed = outRecord->getLastRenewed();
156 const shared_ptr<pit::Entry>& pitEntry,
158 time::steady_clock::TimePoint now)
169 auto outRecord = pitEntry->getOutRecord(outFace);
170 if (outRecord != pitEntry->out_end() && outRecord->getExpiry() > now) {
bool canForwardToLegacy(const pit::Entry &pitEntry, const Face &face)
decide whether Interest can be forwarded to face
Contains information about an Interest toward an outgoing 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
time::steady_clock::TimePoint getLastRenewed() const
ndn::nfd::LinkType getLinkType() const
ndn::nfd::FaceScope getScope() const
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...
Contains information about an Interest from an incoming face.
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.
const Name LOCALHOP
ndn:/localhop
generalization of a network interface
InRecordCollection::iterator in_end()
Represents a collection of nexthops.
bool hasPendingOutRecords(const pit::Entry &pitEntry)
determine whether pitEntry has any pending out-records
const InRecordCollection & getInRecords() const
const Name LOCALHOST
ndn:/localhost
no duplicate Nonce is found
time::steady_clock::TimePoint getLastOutgoing(const pit::Entry &pitEntry)
const OutRecordCollection & getOutRecords() const
OutRecordCollection::iterator out_begin()
This file contains common algorithms used by forwarding strategies.
OutRecordCollection::iterator out_end()
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 ...
InRecordCollection::iterator in_begin()