31 #include <boost/range/adaptor/map.hpp> 32 #include <boost/range/algorithm/copy.hpp> 40 Strategy::getRegistry()
42 static Registry registry;
46 Strategy::Registry::const_iterator
47 Strategy::find(
const Name& instanceName)
49 const Registry& registry = getRegistry();
55 auto found = registry.lower_bound(parsed.strategyName);
56 if (found != registry.end()) {
57 if (parsed.strategyName.getPrefix(-1).isPrefixOf(found->first)) {
58 NFD_LOG_TRACE(
"find " << instanceName <<
" versioned found=" << found->first);
63 NFD_LOG_TRACE(
"find " << instanceName <<
" versioned not-found");
64 return registry.end();
69 if (!parsed.strategyName.empty()) {
70 auto found = registry.lower_bound(parsed.strategyName.getSuccessor());
71 if (found != registry.begin()) {
73 if (parsed.strategyName.isPrefixOf(found->first)) {
74 NFD_LOG_TRACE(
"find " << instanceName <<
" unversioned found=" << found->first);
80 NFD_LOG_TRACE(
"find " << instanceName <<
" unversioned not-found");
81 return registry.end();
87 return Strategy::find(instanceName) != getRegistry().end();
93 auto found = Strategy::find(instanceName);
94 if (found == getRegistry().end()) {
99 unique_ptr<Strategy> instance = found->second(forwarder, instanceName);
100 NFD_LOG_DEBUG(
"create " << instanceName <<
" found=" << found->first <<
101 " created=" << instance->getInstanceName());
102 BOOST_ASSERT(!instance->getInstanceName().empty());
109 return Strategy::find(instanceNameA) == Strategy::find(instanceNameB);
115 std::set<Name> strategyNames;
116 boost::copy(getRegistry() | boost::adaptors::map_keys,
117 std::inserter(strategyNames, strategyNames.end()));
118 return strategyNames;
124 for (ssize_t i = input.size() - 1; i > 0; --i) {
125 if (input[i].isVersion()) {
126 return {input.getPrefix(i + 1), input[i].toVersion(), input.getSubName(i + 1)};
129 return {input, nullopt, PartialName()};
135 BOOST_ASSERT(strategyName.at(-1).isVersion());
137 bool hasVersion = std::any_of(input.rbegin(), input.rend(),
138 [] (
const name::Component& comp) {
return comp.isVersion(); });
139 return hasVersion ? input : Name(input).append(strategyName.at(-1));
145 , m_forwarder(forwarder)
146 , m_measurements(m_forwarder.
getMeasurements(), m_forwarder.getStrategyChoice(), *this)
154 const Face& inFace,
const Data& data)
156 NFD_LOG_DEBUG(
"beforeSatisfyInterest pitEntry=" << pitEntry->getName() <<
157 " inFace=" << inFace.getId() <<
" data=" << data.getName());
162 const Face& inFace,
const Data& data)
164 NFD_LOG_DEBUG(
"afterContentStoreHit pitEntry=" << pitEntry->getName() <<
165 " inFace=" << inFace.getId() <<
" data=" << data.getName());
167 this->
sendData(pitEntry, data, inFace);
172 const Face& inFace,
const Data& data)
174 NFD_LOG_DEBUG(
"afterReceiveData pitEntry=" << pitEntry->getName() <<
175 " inFace=" << inFace.getId() <<
" data=" << data.getName());
184 const shared_ptr<pit::Entry>& pitEntry)
186 NFD_LOG_DEBUG(
"afterReceiveNack inFace=" << inFace.getId() <<
187 " pitEntry=" << pitEntry->getName());
193 NFD_LOG_DEBUG(
"onDroppedInterest outFace=" << outFace.getId() <<
" name=" << interest.getName());
199 BOOST_ASSERT(pitEntry->getInterest().matchesData(data));
203 pitEntry->deleteInRecord(outFace);
205 m_forwarder.onOutgoingData(data, *const_pointer_cast<Face>(outFace.shared_from_this()));
211 std::set<Face*> pendingDownstreams;
212 auto now = time::steady_clock::now();
215 for (
const pit::InRecord& inRecord : pitEntry->getInRecords()) {
216 if (inRecord.getExpiry() > now) {
217 if (inRecord.getFace().getId() == inFace.getId() &&
218 inRecord.getFace().getLinkType() != ndn::nfd::LINK_TYPE_AD_HOC) {
221 pendingDownstreams.insert(&inRecord.getFace());
225 for (
const Face* pendingDownstream : pendingDownstreams) {
226 this->
sendData(pitEntry, data, *pendingDownstream);
232 std::initializer_list<const Face*> exceptFaces)
235 std::unordered_set<const Face*> downstreams;
236 std::transform(pitEntry->in_begin(), pitEntry->in_end(), std::inserter(downstreams, downstreams.end()),
241 for (
const Face* exceptFace : exceptFaces) {
242 downstreams.erase(exceptFace);
246 for (
const Face* downstream : downstreams) {
247 this->
sendNack(pitEntry, *downstream, header);
255 const Fib& fib = m_forwarder.
getFib();
259 if (interest.getForwardingHint().empty()) {
261 const fib::Entry& fibEntry = fib.findLongestPrefixMatch(pitEntry);
266 const DelegationList& fh = interest.getForwardingHint();
271 for (
const Delegation& del : fh) {
272 fibEntry = &fib.findLongestPrefixMatch(del.name);
273 if (fibEntry->hasNextHops()) {
274 if (fibEntry->getPrefix().size() == 0) {
276 NFD_LOG_TRACE(
"lookupFib inConsumerRegion found=" << fibEntry->getPrefix());
280 NFD_LOG_TRACE(
"lookupFib delegation=" << del.name <<
" found=" << fibEntry->getPrefix());
284 BOOST_ASSERT(fibEntry->getPrefix().size() == 0);
286 BOOST_ASSERT(fibEntry !=
nullptr && fibEntry->getPrefix().size() == 0);
Strategy(Forwarder &forwarder)
construct a strategy instance
void sendNacks(const shared_ptr< pit::Entry > &pitEntry, const lp::NackHeader &header, std::initializer_list< const Face * > exceptFaces=std::initializer_list< const Face * >())
send Nack to every face that has an in-record, except those in exceptFaces
void sendData(const shared_ptr< pit::Entry > &pitEntry, const Data &data, const Face &outFace)
send data to outFace
const FaceTable & getFaceTable() const
virtual void afterReceiveData(const shared_ptr< pit::Entry > &pitEntry, const Face &inFace, const Data &data)
trigger after Data is received
void sendNack(const shared_ptr< pit::Entry > &pitEntry, const Face &outFace, const lp::NackHeader &header)
send Nack to outFace
virtual void beforeSatisfyInterest(const shared_ptr< pit::Entry > &pitEntry, const Face &inFace, const Data &data)
trigger before PIT entry is satisfied
static Name makeInstanceName(const Name &input, const Name &strategyName)
construct a strategy instance name
static bool canCreate(const Name &instanceName)
MeasurementsAccessor & getMeasurements()
static bool areSameType(const Name &instanceNameA, const Name &instanceNameB)
const Name & getPrefix() const
Copyright (c) 2014-2015, Regents of the University of California, Arizona Board of Regents...
signal::Signal< FaceTable, Face & > & afterAddFace
contains information about an Interest from an incoming face
virtual void afterReceiveNack(const Face &inFace, const lp::Nack &nack, const shared_ptr< pit::Entry > &pitEntry)
trigger after Nack is received
void sendDataToAll(const shared_ptr< pit::Entry > &pitEntry, const Face &inFace, const Data &data)
send data to all matched and qualified faces
const Interest & getInterest() const
static unique_ptr< Strategy > create(const Name &instanceName, Forwarder &forwarder)
virtual void onDroppedInterest(const Face &outFace, const Interest &interest)
trigger after Interest dropped for exceeding allowed retransmissions
virtual void afterContentStoreHit(const shared_ptr< pit::Entry > &pitEntry, const Face &inFace, const Data &data)
trigger after a Data is matched in CS
#define NFD_LOG_INIT(name)
signal::Signal< FaceTable, Face & > & beforeRemoveFace
Declares the global pseudorandom number generator (PRNG) for NFD.
static ParsedInstanceName parseInstanceName(const Name &input)
parse a strategy instance name
static std::set< Name > listRegistered()
bool isInProducerRegion(const DelegationList &forwardingHint) const
determines whether an Interest has reached a producer region
NetworkRegionTable & getNetworkRegionTable()
const fib::Entry & lookupFib(const pit::Entry &pitEntry) const
performs a FIB lookup, considering Link object if present