blob: b91e94cc81029b9355a9c907b4439588f450fcd9 [file] [log] [blame]
/* -*- Mode: C++; c-file-style: "gnu"; indent-tabs-mode:nil -*- */
/*
* Copyright (c) 2011 University of California, Los Angeles
*
* This program is free software; you can redistribute it and/or modify
* it under the terms of the GNU General Public License version 2 as
* published by the Free Software Foundation;
*
* This program 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 this program; if not, write to the Free Software
* Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA 02111-1307 USA
*
* Author: Alexander Afanasyev <alexander.afanasyev@ucla.edu>
*/
#include "ndn-fib-impl.h"
#include "ns3/ndn-face.h"
#include "ns3/ndn-interest-header.h"
#include "ns3/node.h"
#include "ns3/assert.h"
#include "ns3/names.h"
#include "ns3/log.h"
#include <boost/ref.hpp>
#include <boost/lambda/lambda.hpp>
#include <boost/lambda/bind.hpp>
namespace ll = boost::lambda;
NS_LOG_COMPONENT_DEFINE ("ndn.fib.FibImpl");
namespace ns3 {
namespace ndn {
namespace fib {
NS_OBJECT_ENSURE_REGISTERED (FibImpl);
TypeId
FibImpl::GetTypeId (void)
{
static TypeId tid = TypeId ("ns3::ndn::fib::Default") // cheating ns3 object system
.SetParent<Fib> ()
.SetGroupName ("Ndn")
.AddConstructor<FibImpl> ()
;
return tid;
}
FibImpl::FibImpl ()
{
}
void
FibImpl::NotifyNewAggregate ()
{
Object::NotifyNewAggregate ();
}
void
FibImpl::DoDispose (void)
{
clear ();
Object::DoDispose ();
}
Ptr<Entry>
FibImpl::LongestPrefixMatch (const InterestHeader &interest)
{
super::iterator item = super::longest_prefix_match (interest.GetName ());
// @todo use predicate to search with exclude filters
if (item == super::end ())
return 0;
else
return item->payload ();
}
Ptr<Entry>
FibImpl::Add (const NameComponents &prefix, Ptr<Face> face, int32_t metric)
{
return Add (Create<NameComponents> (prefix), face, metric);
}
Ptr<Entry>
FibImpl::Add (const Ptr<const NameComponents> &prefix, Ptr<Face> face, int32_t metric)
{
NS_LOG_FUNCTION (this->GetObject<Node> ()->GetId () << boost::cref(*prefix) << boost::cref(*face) << metric);
// will add entry if doesn't exists, or just return an iterator to the existing entry
std::pair< super::iterator, bool > result = super::insert (*prefix, 0);
if (result.first != super::end ())
{
if (result.second)
{
Ptr<EntryImpl> newEntry = Create<EntryImpl> (prefix);
newEntry->SetTrie (result.first);
result.first->set_payload (newEntry);
}
super::modify (result.first,
ll::bind (&Entry::AddOrUpdateRoutingMetric, ll::_1, face, metric));
return result.first->payload ();
}
else
return 0;
}
void
FibImpl::Remove (const Ptr<const NameComponents> &prefix)
{
NS_LOG_FUNCTION (this->GetObject<Node> ()->GetId () << boost::cref(*prefix));
super::erase (*prefix);
}
// void
// FibImpl::Invalidate (const Ptr<const NameComponents> &prefix)
// {
// NS_LOG_FUNCTION (this->GetObject<Node> ()->GetId () << boost::cref(*prefix));
// super::iterator foundItem, lastItem;
// bool reachLast;
// boost::tie (foundItem, reachLast, lastItem) = super::getTrie ().find (*prefix);
// if (!reachLast || lastItem->payload () == 0)
// return; // nothing to invalidate
// super::modify (lastItem,
// ll::bind (&Entry::Invalidate, ll::_1));
// }
void
FibImpl::InvalidateAll ()
{
NS_LOG_FUNCTION (this->GetObject<Node> ()->GetId ());
super::parent_trie::recursive_iterator item (super::getTrie ());
super::parent_trie::recursive_iterator end (0);
for (; item != end; item++)
{
if (item->payload () == 0) continue;
super::modify (&(*item),
ll::bind (&Entry::Invalidate, ll::_1));
}
}
void
FibImpl::RemoveFace (super::parent_trie &item, Ptr<Face> face)
{
if (item.payload () == 0) return;
NS_LOG_FUNCTION (this);
super::modify (&item,
ll::bind (&Entry::RemoveFace, ll::_1, face));
}
void
FibImpl::RemoveFromAll (Ptr<Face> face)
{
NS_LOG_FUNCTION (this);
std::for_each (super::parent_trie::recursive_iterator (super::getTrie ()),
super::parent_trie::recursive_iterator (0),
ll::bind (&FibImpl::RemoveFace,
this, ll::_1, face));
super::parent_trie::recursive_iterator trieNode (super::getTrie ());
super::parent_trie::recursive_iterator end (0);
for (; trieNode != end; trieNode++)
{
if (trieNode->payload () == 0) continue;
if (trieNode->payload ()->m_faces.size () == 0)
{
trieNode = super::parent_trie::recursive_iterator (trieNode->erase ());
}
}
}
void
FibImpl::Print (std::ostream &os) const
{
// !!! unordered_set imposes "random" order of item in the same level !!!
super::parent_trie::const_recursive_iterator item (super::getTrie ());
super::parent_trie::const_recursive_iterator end (0);
for (; item != end; item++)
{
if (item->payload () == 0) continue;
os << item->payload ()->GetPrefix () << "\t" << *item->payload () << "\n";
}
}
uint32_t
FibImpl::GetSize () const
{
return super::getPolicy ().size ();
}
Ptr<const Entry>
FibImpl::Begin ()
{
super::parent_trie::const_recursive_iterator item (super::getTrie ());
super::parent_trie::const_recursive_iterator end (0);
for (; item != end; item++)
{
if (item->payload () == 0) continue;
break;
}
if (item == end)
return End ();
else
return item->payload ();
}
Ptr<const Entry>
FibImpl::End ()
{
return 0;
}
Ptr<const Entry>
FibImpl::Next (Ptr<const Entry> from)
{
if (from == 0) return 0;
super::parent_trie::const_recursive_iterator item (*StaticCast<const EntryImpl> (from)->to_iterator ());
super::parent_trie::const_recursive_iterator end (0);
for (item++; item != end; item++)
{
if (item->payload () == 0) continue;
break;
}
if (item == end)
return End ();
else
return item->payload ();
}
} // namespace fib
} // namespace ndn
} // namespace ns3