algorithm.cpp File Reference

#include "algorithm.hpp"

Include dependency graph for algorithm.cpp:

Go to the source code of this file.

Namespaces
	nfd
	Copyright (c) 2014-2015, Regents of the University of California, Arizona Board of Regents, Colorado State University, University Pierre & Marie Curie, Sorbonne University, Washington University in St.
	nfd::fw

Functions
bool	nfd::fw::canForwardToLegacy (const pit::Entry &pitEntry, const Face &face)
	decide whether Interest can be forwarded to face More...
int	nfd::fw::findDuplicateNonce (const pit::Entry &pitEntry, uint32_t 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::TimePoint	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::TimePoint now=time::steady_clock::TimePoint::min())
	determines whether a NextHop is eligible i.e. 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...