| /* -*- Mode:C++; c-file-style:"gnu"; indent-tabs-mode:nil; -*- */ |
| /** |
| * Copyright (c) 2014-2016, 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/>. |
| */ |
| |
| #include "forwarder.hpp" |
| #include "pit-algorithm.hpp" |
| #include "core/logger.hpp" |
| #include "core/random.hpp" |
| #include "strategy.hpp" |
| #include "table/cleanup.hpp" |
| #include <boost/random/uniform_int_distribution.hpp> |
| |
| namespace nfd { |
| |
| NFD_LOG_INIT("Forwarder"); |
| |
| using fw::Strategy; |
| |
| Forwarder::Forwarder() |
| : m_fib(m_nameTree) |
| , m_pit(m_nameTree) |
| , m_measurements(m_nameTree) |
| , m_strategyChoice(m_nameTree, fw::makeDefaultStrategy(*this)) |
| { |
| fw::installStrategies(*this); |
| |
| m_faceTable.afterAdd.connect([this] (Face& face) { |
| face.afterReceiveInterest.connect( |
| [this, &face] (const Interest& interest) { |
| this->startProcessInterest(face, interest); |
| }); |
| face.afterReceiveData.connect( |
| [this, &face] (const Data& data) { |
| this->startProcessData(face, data); |
| }); |
| face.afterReceiveNack.connect( |
| [this, &face] (const lp::Nack& nack) { |
| this->startProcessNack(face, nack); |
| }); |
| }); |
| |
| m_faceTable.beforeRemove.connect([this] (Face& face) { |
| cleanupOnFaceRemoval(m_nameTree, m_fib, m_pit, face); |
| }); |
| } |
| |
| Forwarder::~Forwarder() = default; |
| |
| void |
| Forwarder::startProcessInterest(Face& face, const Interest& interest) |
| { |
| // check fields used by forwarding are well-formed |
| try { |
| if (interest.hasLink()) { |
| interest.getLink(); |
| } |
| } |
| catch (const tlv::Error&) { |
| NFD_LOG_DEBUG("startProcessInterest face=" << face.getId() << |
| " interest=" << interest.getName() << " malformed"); |
| // It's safe to call interest.getName() because Name has been fully parsed |
| return; |
| } |
| |
| this->onIncomingInterest(face, interest); |
| } |
| |
| void |
| Forwarder::startProcessData(Face& face, const Data& data) |
| { |
| // check fields used by forwarding are well-formed |
| // (none needed) |
| |
| this->onIncomingData(face, data); |
| } |
| |
| void |
| Forwarder::startProcessNack(Face& face, const lp::Nack& nack) |
| { |
| // check fields used by forwarding are well-formed |
| try { |
| if (nack.getInterest().hasLink()) { |
| nack.getInterest().getLink(); |
| } |
| } |
| catch (const tlv::Error&) { |
| NFD_LOG_DEBUG("startProcessNack face=" << face.getId() << |
| " nack=" << nack.getInterest().getName() << |
| "~" << nack.getReason() << " malformed"); |
| return; |
| } |
| |
| this->onIncomingNack(face, nack); |
| } |
| |
| void |
| Forwarder::onIncomingInterest(Face& inFace, const Interest& interest) |
| { |
| // receive Interest |
| NFD_LOG_DEBUG("onIncomingInterest face=" << inFace.getId() << |
| " interest=" << interest.getName()); |
| interest.setTag(make_shared<lp::IncomingFaceIdTag>(inFace.getId())); |
| ++m_counters.nInInterests; |
| |
| // /localhost scope control |
| bool isViolatingLocalhost = inFace.getScope() == ndn::nfd::FACE_SCOPE_NON_LOCAL && |
| scope_prefix::LOCALHOST.isPrefixOf(interest.getName()); |
| if (isViolatingLocalhost) { |
| NFD_LOG_DEBUG("onIncomingInterest face=" << inFace.getId() << |
| " interest=" << interest.getName() << " violates /localhost"); |
| // (drop) |
| return; |
| } |
| |
| // detect duplicate Nonce with Dead Nonce List |
| bool hasDuplicateNonceInDnl = m_deadNonceList.has(interest.getName(), interest.getNonce()); |
| if (hasDuplicateNonceInDnl) { |
| // goto Interest loop pipeline |
| this->onInterestLoop(inFace, interest); |
| return; |
| } |
| |
| // PIT insert |
| shared_ptr<pit::Entry> pitEntry = m_pit.insert(interest).first; |
| |
| // detect duplicate Nonce in PIT entry |
| bool hasDuplicateNonceInPit = fw::findDuplicateNonce(*pitEntry, interest.getNonce(), inFace) != |
| fw::DUPLICATE_NONCE_NONE; |
| if (hasDuplicateNonceInPit) { |
| // goto Interest loop pipeline |
| this->onInterestLoop(inFace, interest); |
| return; |
| } |
| |
| // cancel unsatisfy & straggler timer |
| this->cancelUnsatisfyAndStragglerTimer(pitEntry); |
| |
| // is pending? |
| if (!pitEntry->hasInRecords()) { |
| m_cs.find(interest, |
| bind(&Forwarder::onContentStoreHit, this, ref(inFace), pitEntry, _1, _2), |
| bind(&Forwarder::onContentStoreMiss, this, ref(inFace), pitEntry, _1)); |
| } |
| else { |
| this->onContentStoreMiss(inFace, pitEntry, interest); |
| } |
| } |
| |
| void |
| Forwarder::onInterestLoop(Face& inFace, const Interest& interest) |
| { |
| // if multi-access face, drop |
| if (inFace.getLinkType() == ndn::nfd::LINK_TYPE_MULTI_ACCESS) { |
| NFD_LOG_DEBUG("onInterestLoop face=" << inFace.getId() << |
| " interest=" << interest.getName() << |
| " drop"); |
| return; |
| } |
| |
| NFD_LOG_DEBUG("onInterestLoop face=" << inFace.getId() << |
| " interest=" << interest.getName() << |
| " send-Nack-duplicate"); |
| |
| // send Nack with reason=DUPLICATE |
| // note: Don't enter outgoing Nack pipeline because it needs an in-record. |
| lp::Nack nack(interest); |
| nack.setReason(lp::NackReason::DUPLICATE); |
| inFace.sendNack(nack); |
| } |
| |
| void |
| Forwarder::onContentStoreMiss(const Face& inFace, |
| shared_ptr<pit::Entry> pitEntry, |
| const Interest& interest) |
| { |
| NFD_LOG_DEBUG("onContentStoreMiss interest=" << interest.getName()); |
| |
| // insert in-record |
| pitEntry->insertOrUpdateInRecord(const_cast<Face&>(inFace), interest); |
| |
| // set PIT unsatisfy timer |
| this->setUnsatisfyTimer(pitEntry); |
| |
| // dispatch to strategy: after incoming Interest |
| this->dispatchToStrategy(pitEntry, |
| [&] (fw::Strategy* strategy) { strategy->afterReceiveInterest(inFace, interest, pitEntry); }); |
| } |
| |
| void |
| Forwarder::onContentStoreHit(const Face& inFace, |
| shared_ptr<pit::Entry> pitEntry, |
| const Interest& interest, |
| const Data& data) |
| { |
| NFD_LOG_DEBUG("onContentStoreHit interest=" << interest.getName()); |
| |
| data.setTag(make_shared<lp::IncomingFaceIdTag>(face::FACEID_CONTENT_STORE)); |
| // XXX should we lookup PIT for other Interests that also match csMatch? |
| |
| // set PIT straggler timer |
| this->setStragglerTimer(pitEntry, true, data.getFreshnessPeriod()); |
| |
| // goto outgoing Data pipeline |
| this->onOutgoingData(data, *const_pointer_cast<Face>(inFace.shared_from_this())); |
| } |
| |
| void |
| Forwarder::onOutgoingInterest(shared_ptr<pit::Entry> pitEntry, Face& outFace, |
| bool wantNewNonce) |
| { |
| if (outFace.getId() == face::INVALID_FACEID) { |
| NFD_LOG_WARN("onOutgoingInterest face=invalid interest=" << pitEntry->getName()); |
| return; |
| } |
| NFD_LOG_DEBUG("onOutgoingInterest face=" << outFace.getId() << |
| " interest=" << pitEntry->getName()); |
| |
| // scope control |
| if (fw::violatesScope(*pitEntry, outFace)) { |
| NFD_LOG_DEBUG("onOutgoingInterest face=" << outFace.getId() << |
| " interest=" << pitEntry->getName() << " violates scope"); |
| return; |
| } |
| |
| // pick Interest |
| // The outgoing Interest picked is the last incoming Interest that does not come from outFace. |
| // If all in-records come from outFace, it's fine to pick that. |
| // This happens when there's only one in-record that comes from outFace. |
| // The legit use is for vehicular network; otherwise, strategy shouldn't send to the sole inFace. |
| pit::InRecordCollection::iterator pickedInRecord = std::max_element( |
| pitEntry->in_begin(), pitEntry->in_end(), |
| [&outFace] (const pit::InRecord& a, const pit::InRecord& b) { |
| bool isOutFaceA = &a.getFace() == &outFace; |
| bool isOutFaceB = &b.getFace() == &outFace; |
| return (isOutFaceA > isOutFaceB) || |
| (isOutFaceA == isOutFaceB && a.getLastRenewed() < b.getLastRenewed()); |
| }); |
| BOOST_ASSERT(pickedInRecord != pitEntry->in_end()); |
| auto interest = const_pointer_cast<Interest>(pickedInRecord->getInterest().shared_from_this()); |
| |
| if (wantNewNonce) { |
| interest = make_shared<Interest>(*interest); |
| static boost::random::uniform_int_distribution<uint32_t> dist; |
| interest->setNonce(dist(getGlobalRng())); |
| } |
| |
| // insert out-record |
| pitEntry->insertOrUpdateOutRecord(outFace, *interest); |
| |
| // send Interest |
| outFace.sendInterest(*interest); |
| ++m_counters.nOutInterests; |
| } |
| |
| void |
| Forwarder::onInterestReject(shared_ptr<pit::Entry> pitEntry) |
| { |
| if (fw::hasPendingOutRecords(*pitEntry)) { |
| NFD_LOG_ERROR("onInterestReject interest=" << pitEntry->getName() << |
| " cannot reject forwarded Interest"); |
| return; |
| } |
| NFD_LOG_DEBUG("onInterestReject interest=" << pitEntry->getName()); |
| |
| // cancel unsatisfy & straggler timer |
| this->cancelUnsatisfyAndStragglerTimer(pitEntry); |
| |
| // set PIT straggler timer |
| this->setStragglerTimer(pitEntry, false); |
| } |
| |
| void |
| Forwarder::onInterestUnsatisfied(shared_ptr<pit::Entry> pitEntry) |
| { |
| NFD_LOG_DEBUG("onInterestUnsatisfied interest=" << pitEntry->getName()); |
| |
| // invoke PIT unsatisfied callback |
| this->dispatchToStrategy(pitEntry, |
| [&] (fw::Strategy* strategy) { strategy->beforeExpirePendingInterest(pitEntry); }); |
| |
| // goto Interest Finalize pipeline |
| this->onInterestFinalize(pitEntry, false); |
| } |
| |
| void |
| Forwarder::onInterestFinalize(shared_ptr<pit::Entry> pitEntry, bool isSatisfied, |
| const time::milliseconds& dataFreshnessPeriod) |
| { |
| NFD_LOG_DEBUG("onInterestFinalize interest=" << pitEntry->getName() << |
| (isSatisfied ? " satisfied" : " unsatisfied")); |
| |
| // Dead Nonce List insert if necessary |
| this->insertDeadNonceList(*pitEntry, isSatisfied, dataFreshnessPeriod, 0); |
| |
| // PIT delete |
| this->cancelUnsatisfyAndStragglerTimer(pitEntry); |
| m_pit.erase(pitEntry); |
| } |
| |
| void |
| Forwarder::onIncomingData(Face& inFace, const Data& data) |
| { |
| // receive Data |
| NFD_LOG_DEBUG("onIncomingData face=" << inFace.getId() << " data=" << data.getName()); |
| data.setTag(make_shared<lp::IncomingFaceIdTag>(inFace.getId())); |
| ++m_counters.nInData; |
| |
| // /localhost scope control |
| bool isViolatingLocalhost = inFace.getScope() == ndn::nfd::FACE_SCOPE_NON_LOCAL && |
| scope_prefix::LOCALHOST.isPrefixOf(data.getName()); |
| if (isViolatingLocalhost) { |
| NFD_LOG_DEBUG("onIncomingData face=" << inFace.getId() << |
| " data=" << data.getName() << " violates /localhost"); |
| // (drop) |
| return; |
| } |
| |
| // PIT match |
| pit::DataMatchResult pitMatches = m_pit.findAllDataMatches(data); |
| if (pitMatches.begin() == pitMatches.end()) { |
| // goto Data unsolicited pipeline |
| this->onDataUnsolicited(inFace, data); |
| return; |
| } |
| |
| // CS insert |
| m_cs.insert(data); |
| |
| std::set<Face*> pendingDownstreams; |
| // foreach PitEntry |
| auto now = time::steady_clock::now(); |
| for (const shared_ptr<pit::Entry>& pitEntry : pitMatches) { |
| NFD_LOG_DEBUG("onIncomingData matching=" << pitEntry->getName()); |
| |
| // cancel unsatisfy & straggler timer |
| this->cancelUnsatisfyAndStragglerTimer(pitEntry); |
| |
| // remember pending downstreams |
| for (const pit::InRecord& inRecord : pitEntry->getInRecords()) { |
| if (inRecord.getExpiry() > now) { |
| pendingDownstreams.insert(&inRecord.getFace()); |
| } |
| } |
| |
| // invoke PIT satisfy callback |
| this->dispatchToStrategy(pitEntry, |
| [&] (fw::Strategy* strategy) { strategy->beforeSatisfyInterest(pitEntry, inFace, data); }); |
| |
| // Dead Nonce List insert if necessary (for out-record of inFace) |
| this->insertDeadNonceList(*pitEntry, true, data.getFreshnessPeriod(), &inFace); |
| |
| // mark PIT satisfied |
| pitEntry->clearInRecords(); |
| pitEntry->deleteOutRecord(inFace); |
| |
| // set PIT straggler timer |
| this->setStragglerTimer(pitEntry, true, data.getFreshnessPeriod()); |
| } |
| |
| // foreach pending downstream |
| for (Face* pendingDownstream : pendingDownstreams) { |
| if (pendingDownstream == &inFace) { |
| continue; |
| } |
| // goto outgoing Data pipeline |
| this->onOutgoingData(data, *pendingDownstream); |
| } |
| } |
| |
| void |
| Forwarder::onDataUnsolicited(Face& inFace, const Data& data) |
| { |
| // accept to cache? |
| bool acceptToCache = inFace.getScope() == ndn::nfd::FACE_SCOPE_LOCAL; |
| if (acceptToCache) { |
| // CS insert |
| m_cs.insert(data, true); |
| } |
| |
| NFD_LOG_DEBUG("onDataUnsolicited face=" << inFace.getId() << |
| " data=" << data.getName() << |
| (acceptToCache ? " cached" : " not cached")); |
| } |
| |
| void |
| Forwarder::onOutgoingData(const Data& data, Face& outFace) |
| { |
| if (outFace.getId() == face::INVALID_FACEID) { |
| NFD_LOG_WARN("onOutgoingData face=invalid data=" << data.getName()); |
| return; |
| } |
| NFD_LOG_DEBUG("onOutgoingData face=" << outFace.getId() << " data=" << data.getName()); |
| |
| // /localhost scope control |
| bool isViolatingLocalhost = outFace.getScope() == ndn::nfd::FACE_SCOPE_NON_LOCAL && |
| scope_prefix::LOCALHOST.isPrefixOf(data.getName()); |
| if (isViolatingLocalhost) { |
| NFD_LOG_DEBUG("onOutgoingData face=" << outFace.getId() << |
| " data=" << data.getName() << " violates /localhost"); |
| // (drop) |
| return; |
| } |
| |
| // TODO traffic manager |
| |
| // send Data |
| outFace.sendData(data); |
| ++m_counters.nOutData; |
| } |
| |
| void |
| Forwarder::onIncomingNack(Face& inFace, const lp::Nack& nack) |
| { |
| // receive Nack |
| nack.setTag(make_shared<lp::IncomingFaceIdTag>(inFace.getId())); |
| ++m_counters.nInNacks; |
| |
| // if multi-access face, drop |
| if (inFace.getLinkType() == ndn::nfd::LINK_TYPE_MULTI_ACCESS) { |
| NFD_LOG_DEBUG("onIncomingNack face=" << inFace.getId() << |
| " nack=" << nack.getInterest().getName() << |
| "~" << nack.getReason() << " face-is-multi-access"); |
| return; |
| } |
| |
| // PIT match |
| shared_ptr<pit::Entry> pitEntry = m_pit.find(nack.getInterest()); |
| // if no PIT entry found, drop |
| if (pitEntry == nullptr) { |
| NFD_LOG_DEBUG("onIncomingNack face=" << inFace.getId() << |
| " nack=" << nack.getInterest().getName() << |
| "~" << nack.getReason() << " no-PIT-entry"); |
| return; |
| } |
| |
| // has out-record? |
| pit::OutRecordCollection::iterator outRecord = pitEntry->getOutRecord(inFace); |
| // if no out-record found, drop |
| if (outRecord == pitEntry->out_end()) { |
| NFD_LOG_DEBUG("onIncomingNack face=" << inFace.getId() << |
| " nack=" << nack.getInterest().getName() << |
| "~" << nack.getReason() << " no-out-record"); |
| return; |
| } |
| |
| // if out-record has different Nonce, drop |
| if (nack.getInterest().getNonce() != outRecord->getLastNonce()) { |
| NFD_LOG_DEBUG("onIncomingNack face=" << inFace.getId() << |
| " nack=" << nack.getInterest().getName() << |
| "~" << nack.getReason() << " wrong-Nonce " << |
| nack.getInterest().getNonce() << "!=" << outRecord->getLastNonce()); |
| return; |
| } |
| |
| NFD_LOG_DEBUG("onIncomingNack face=" << inFace.getId() << |
| " nack=" << nack.getInterest().getName() << |
| "~" << nack.getReason() << " OK"); |
| |
| // record Nack on out-record |
| outRecord->setIncomingNack(nack); |
| |
| // trigger strategy: after receive NACK |
| this->dispatchToStrategy(pitEntry, |
| [&] (fw::Strategy* strategy) { strategy->afterReceiveNack(inFace, nack, pitEntry); }); |
| } |
| |
| void |
| Forwarder::onOutgoingNack(shared_ptr<pit::Entry> pitEntry, const Face& outFace, |
| const lp::NackHeader& nack) |
| { |
| if (outFace.getId() == face::INVALID_FACEID) { |
| NFD_LOG_WARN("onOutgoingNack face=invalid" << |
| " nack=" << pitEntry->getInterest().getName() << |
| "~" << nack.getReason() << " no-in-record"); |
| return; |
| } |
| |
| // has in-record? |
| pit::InRecordCollection::iterator inRecord = pitEntry->getInRecord(outFace); |
| |
| // if no in-record found, drop |
| if (inRecord == pitEntry->in_end()) { |
| NFD_LOG_DEBUG("onOutgoingNack face=" << outFace.getId() << |
| " nack=" << pitEntry->getInterest().getName() << |
| "~" << nack.getReason() << " no-in-record"); |
| return; |
| } |
| |
| // if multi-access face, drop |
| if (outFace.getLinkType() == ndn::nfd::LINK_TYPE_MULTI_ACCESS) { |
| NFD_LOG_DEBUG("onOutgoingNack face=" << outFace.getId() << |
| " nack=" << pitEntry->getInterest().getName() << |
| "~" << nack.getReason() << " face-is-multi-access"); |
| return; |
| } |
| |
| NFD_LOG_DEBUG("onOutgoingNack face=" << outFace.getId() << |
| " nack=" << pitEntry->getInterest().getName() << |
| "~" << nack.getReason() << " OK"); |
| |
| // create Nack packet with the Interest from in-record |
| lp::Nack nackPkt(inRecord->getInterest()); |
| nackPkt.setHeader(nack); |
| |
| // erase in-record |
| pitEntry->deleteInRecord(outFace); |
| |
| // send Nack on face |
| const_cast<Face&>(outFace).sendNack(nackPkt); |
| ++m_counters.nOutNacks; |
| } |
| |
| const fib::Entry& |
| Forwarder::lookupFib(const pit::Entry& pitEntry) const |
| { |
| const Interest& interest = pitEntry.getInterest(); |
| // has Link object? |
| if (!interest.hasLink()) { |
| // FIB lookup with Interest name |
| const fib::Entry& fibEntry = m_fib.findLongestPrefixMatch(pitEntry); |
| NFD_LOG_TRACE("lookupFib noLinkObject found=" << fibEntry.getPrefix()); |
| return fibEntry; |
| } |
| |
| const Link& link = interest.getLink(); |
| |
| // in producer region? |
| if (m_networkRegionTable.isInProducerRegion(link)) { |
| // FIB lookup with Interest name |
| const fib::Entry& fibEntry = m_fib.findLongestPrefixMatch(pitEntry); |
| NFD_LOG_TRACE("lookupFib inProducerRegion found=" << fibEntry.getPrefix()); |
| return fibEntry; |
| } |
| |
| // has SelectedDelegation? |
| if (interest.hasSelectedDelegation()) { |
| // FIB lookup with SelectedDelegation |
| Name selectedDelegation = interest.getSelectedDelegation(); |
| const fib::Entry& fibEntry = m_fib.findLongestPrefixMatch(selectedDelegation); |
| NFD_LOG_TRACE("lookupFib hasSelectedDelegation=" << selectedDelegation << " found=" << fibEntry.getPrefix()); |
| return fibEntry; |
| } |
| |
| // FIB lookup with first delegation Name |
| const fib::Entry& fibEntry0 = m_fib.findLongestPrefixMatch(link.getDelegations().begin()->second); |
| // in default-free zone? |
| bool isDefaultFreeZone = !(fibEntry0.getPrefix().size() == 0 && fibEntry0.hasNextHops()); |
| if (!isDefaultFreeZone) { |
| NFD_LOG_TRACE("onContentStoreMiss inConsumerRegion found=" << fibEntry0.getPrefix()); |
| return fibEntry0; |
| } |
| |
| // choose and set SelectedDelegation |
| for (const std::pair<uint32_t, Name>& delegation : link.getDelegations()) { |
| const Name& delegationName = delegation.second; |
| const fib::Entry& fibEntry = m_fib.findLongestPrefixMatch(delegationName); |
| if (fibEntry.hasNextHops()) { |
| /// \todo Don't modify in-record Interests. |
| /// Set SelectedDelegation in outgoing Interest pipeline. |
| std::for_each(pitEntry.in_begin(), pitEntry.in_end(), |
| [&delegationName] (const pit::InRecord& inR) { |
| const_cast<Interest&>(inR.getInterest()).setSelectedDelegation(delegationName); |
| }); |
| NFD_LOG_TRACE("onContentStoreMiss enterDefaultFreeZone" |
| << " setSelectedDelegation=" << delegationName); |
| return fibEntry; |
| } |
| } |
| BOOST_ASSERT(false); |
| return fibEntry0; |
| } |
| |
| static inline bool |
| compare_InRecord_expiry(const pit::InRecord& a, const pit::InRecord& b) |
| { |
| return a.getExpiry() < b.getExpiry(); |
| } |
| |
| void |
| Forwarder::setUnsatisfyTimer(shared_ptr<pit::Entry> pitEntry) |
| { |
| pit::InRecordCollection::iterator lastExpiring = |
| std::max_element(pitEntry->in_begin(), pitEntry->in_end(), &compare_InRecord_expiry); |
| |
| time::steady_clock::TimePoint lastExpiry = lastExpiring->getExpiry(); |
| time::nanoseconds lastExpiryFromNow = lastExpiry - time::steady_clock::now(); |
| if (lastExpiryFromNow <= time::seconds::zero()) { |
| // TODO all in-records are already expired; will this happen? |
| } |
| |
| scheduler::cancel(pitEntry->m_unsatisfyTimer); |
| pitEntry->m_unsatisfyTimer = scheduler::schedule(lastExpiryFromNow, |
| bind(&Forwarder::onInterestUnsatisfied, this, pitEntry)); |
| } |
| |
| void |
| Forwarder::setStragglerTimer(shared_ptr<pit::Entry> pitEntry, bool isSatisfied, |
| const time::milliseconds& dataFreshnessPeriod) |
| { |
| time::nanoseconds stragglerTime = time::milliseconds(100); |
| |
| scheduler::cancel(pitEntry->m_stragglerTimer); |
| pitEntry->m_stragglerTimer = scheduler::schedule(stragglerTime, |
| bind(&Forwarder::onInterestFinalize, this, pitEntry, isSatisfied, dataFreshnessPeriod)); |
| } |
| |
| void |
| Forwarder::cancelUnsatisfyAndStragglerTimer(shared_ptr<pit::Entry> pitEntry) |
| { |
| scheduler::cancel(pitEntry->m_unsatisfyTimer); |
| scheduler::cancel(pitEntry->m_stragglerTimer); |
| } |
| |
| static inline void |
| insertNonceToDnl(DeadNonceList& dnl, const pit::Entry& pitEntry, |
| const pit::OutRecord& outRecord) |
| { |
| dnl.add(pitEntry.getName(), outRecord.getLastNonce()); |
| } |
| |
| void |
| Forwarder::insertDeadNonceList(pit::Entry& pitEntry, bool isSatisfied, |
| const time::milliseconds& dataFreshnessPeriod, |
| Face* upstream) |
| { |
| // need Dead Nonce List insert? |
| bool needDnl = false; |
| if (isSatisfied) { |
| bool hasFreshnessPeriod = dataFreshnessPeriod >= time::milliseconds::zero(); |
| // Data never becomes stale if it doesn't have FreshnessPeriod field |
| needDnl = static_cast<bool>(pitEntry.getInterest().getMustBeFresh()) && |
| (hasFreshnessPeriod && dataFreshnessPeriod < m_deadNonceList.getLifetime()); |
| } |
| else { |
| needDnl = true; |
| } |
| |
| if (!needDnl) { |
| return; |
| } |
| |
| // Dead Nonce List insert |
| if (upstream == 0) { |
| // insert all outgoing Nonces |
| const pit::OutRecordCollection& outRecords = pitEntry.getOutRecords(); |
| std::for_each(outRecords.begin(), outRecords.end(), |
| bind(&insertNonceToDnl, ref(m_deadNonceList), cref(pitEntry), _1)); |
| } |
| else { |
| // insert outgoing Nonce of a specific face |
| pit::OutRecordCollection::iterator outRecord = pitEntry.getOutRecord(*upstream); |
| if (outRecord != pitEntry.getOutRecords().end()) { |
| m_deadNonceList.add(pitEntry.getName(), outRecord->getLastNonce()); |
| } |
| } |
| } |
| |
| } // namespace nfd |