Tracer.cc

// Copyright 2008 Michael Marsh, University of Maryland.
//
// This file is part of pydtn.
//
// pydtn 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.
//
// pydtn 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 pydtn.  If not, see <http://www.gnu.org/licenses/>.
//
// The views and conclusions contained in the software and documentation
// are those of the authors and should not be interpreted as representing
// official policies, either expressed or implied, of the University
// of Maryland.
//
// pydtn extends and embeds the Python interpreter, which is
// Copyright 2001-2006 Python Software Foundation, All Rights Reserved,
// and is released under the PSF License Agreement.
//
// RANLUX random number generation uses the Boost library,
// Copyright 1994-2006 by various authors (details in individual files),
// which is released under the Boost Software License, Version 1.0.

#include "simlpy/interpreter_defs.h"

#include "Tracer.h"
#include "WrapNode.h"
#include "WrapLink.h"

TracerChain::~TracerChain()
{
   ChainType::iterator itr = m_chain.begin();
   ChainType::iterator end = m_chain.end();
   for ( ; itr != end ; ++itr )
   {
      if ( 0 != *itr )
      {
         delete *itr;
      }
   }
}

void
TracerChain::node( const WrapNode& wn )
{
   ChainType::iterator itr = m_chain.begin();
   ChainType::iterator end = m_chain.end();
   for ( ; itr != end ; ++itr )
   {
      if ( 0 != *itr )
      {
         (*itr)->node(wn);
      }
   }
}

void
TracerChain::link( const WrapLink& wn )
{
   ChainType::iterator itr = m_chain.begin();
   ChainType::iterator end = m_chain.end();
   for ( ; itr != end ; ++itr )
   {
      if ( 0 != *itr )
      {
         (*itr)->link(wn);
      }
   }
}

void
TracerChain::enqueue( const DTN::Bundle& b, const DTN::Node* n )
{
   if ( 0 == n ) return;
   ChainType::iterator itr = m_chain.begin();
   ChainType::iterator end = m_chain.end();
   for ( ; itr != end ; ++itr )
   {
      if ( 0 != *itr )
      {
         (*itr)->enqueue(b,n);
      }
   }
}

void
TracerChain::dequeue( const DTN::Bundle& b, const DTN::Node* n )
{
   if ( 0 == n ) return;
   ChainType::iterator itr = m_chain.begin();
   ChainType::iterator end = m_chain.end();
   for ( ; itr != end ; ++itr )
   {
      if ( 0 != *itr )
      {
         (*itr)->dequeue(b,n);
      }
   }
}

void
TracerChain::send( const DTN::Bundle& b, const DTN::Node* n )
{
   if ( 0 == n ) return;
   ChainType::iterator itr = m_chain.begin();
   ChainType::iterator end = m_chain.end();
   for ( ; itr != end ; ++itr )
   {
      if ( 0 != *itr )
      {
         (*itr)->send(b,n);
      }
   }
}

void
TracerChain::receive( const DTN::Bundle& b, const DTN::Node* n )
{
   if ( 0 == n ) return;
   ChainType::iterator itr = m_chain.begin();
   ChainType::iterator end = m_chain.end();
   for ( ; itr != end ; ++itr )
   {
      if ( 0 != *itr )
      {
         (*itr)->receive(b,n);
      }
   }
}

void
TracerChain::drop( const DTN::Bundle& b,
                   const DTN::DropCause& c,
                   const DTN::Node* n )
{
   if ( 0 == n ) return;
   ChainType::iterator itr = m_chain.begin();
   ChainType::iterator end = m_chain.end();
   for ( ; itr != end ; ++itr )
   {
      if ( 0 != *itr )
      {
         (*itr)->drop(b,c,n);
      }
   }
}

void
TracerChain::addTracer( Tracer* t )
{
   if ( 0 != t )
   {
      m_chain.push_back(t);
   }
}

GlobalTracer* GlobalTracer::m_instance = 0;

GlobalTracer::GlobalTracer()
{
}

GlobalTracer::~GlobalTracer()
{
}

void
GlobalTracer::enable()
{
   if ( 0 != m_instance ) return;
   m_instance = new GlobalTracer();
}

GlobalTracer*
GlobalTracer::instance()
{
   return m_instance;
}

---