NamTracer.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 "NamTracer.h"
#include "pydtn/WrapNode.h"
#include "pydtn/WrapLink.h"
#include "simlpy/Clock.h"
#include <iostream>
#include <ctype.h>
#include <netinet/in.h>

bool
NamTraceEvent::handle()
{
   return m_destination->handler( *this );
}

NamTracer::NamTracer( std::ostream& s ) :
   m_stream( s ),
   m_lastNode( 0 ),
   m_queueState( false ),
   m_tracing( false ),
   m_notified( false )
{
   m_stream << std::fixed;
}

NamTracer::~NamTracer()
{
}

void
NamTracer::node( const WrapNode& wn )
{
   if ( m_tracing )
   {
      traceNode(wn);
   }
   else
   {
      if ( ! m_notified )
      {
         Clock::schedule( new NamTraceEvent(this,this,Clock::time()) );
         m_notified = true;
      }
      m_nodeSet.insert( &wn );
   }
}

void
NamTracer::link( const WrapLink& wl )
{
   if ( m_tracing )
   {
      traceLink(wl);
   }
   else
   {
      if ( ! m_notified )
      {
         Clock::schedule( new NamTraceEvent(this,this,Clock::time()) );
         m_notified = true;
      }
      m_linkSet.insert( &wl );
   }
}

void
NamTracer::enqueue( const DTN::Bundle& b, const DTN::Node* n )
{
   if ( ! m_queueState ) return;
   if ( 0 == n ) return;
   m_stream << "+ ";
   traceBundle(b);
   m_stream << std::endl;
}

void
NamTracer::dequeue( const DTN::Bundle& b, const DTN::Node* n )
{
   if ( ! m_queueState ) return;
   if ( 0 == n ) return;
   m_stream << "- ";
   traceBundle(b);
   m_stream << std::endl;
}

void
NamTracer::send( const DTN::Bundle& b, const DTN::Node* n )
{
   if ( 0 == n ) return;
   m_stream << "h ";
   traceBundle(b);
   m_stream << std::endl;
}

void
NamTracer::receive( const DTN::Bundle& b, const DTN::Node* n )
{
   if ( 0 == n ) return;
   m_stream << "r ";
   traceBundle(b);
   m_stream << std::endl;
}

void
NamTracer::drop( const DTN::Bundle& b,
                 const DTN::DropCause& c,
                 const DTN::Node* n )
{
   if ( 0 == n ) return;
   m_stream << "d ";
   traceBundle(b);
   m_stream << std::endl;
}

bool
NamTracer::handler( NamTraceEvent& event )
{
   m_tracing = true;
   m_stream << "V -t * -v 1.11" << std::endl;
   NodeSet::const_iterator nItr = m_nodeSet.begin();
   NodeSet::const_iterator nEnd = m_nodeSet.end();
   for ( ; nItr != nEnd ; ++nItr )
   {
      if ( 0 != *nItr )
      {
         traceNode(**nItr,true);
      }
   }
   m_nodeSet.clear();
   LinkSet::const_iterator lItr = m_linkSet.begin();
   LinkSet::const_iterator lEnd = m_linkSet.end();
   for ( ; lItr != lEnd ; ++lItr )
   {
      if ( 0 != *lItr )
      {
         traceLink(**lItr,true);
      }
   }
   m_linkSet.clear();
   return true;
}

void
NamTracer::traceNode( const WrapNode& wn, bool initial )
{
   int n = nodeID(wn);
   m_stream << "n ";
   if ( initial )
   {
      m_stream << "-t * ";
   }
   else
   {
      m_stream << "-t " << time(Clock::time()) << " ";
   }
   m_stream << "-s " << n << " "
            << "-v circle -z 0.15 "
            << "-l " << stringify(wn.addr()) << " "
            << "-S UP"
            << std::endl;
   if ( initial )
   {
      int nv = nodeID( vQueue(wn) );
      m_stream << "n -t * "
               << "-s " << nv << " "
               << "-v square -z 0.05 "
               << "-S UP"
               << std::endl;
      m_stream << "l -t * "
               << "-s " << n << " "
               << "-d " << nv << " "
               << "-r " << 0 << " "
               << "-D " << 0 << " "
               << "-S " << "UP"
               << std::endl;
      m_stream << "q -t * "
               << "-s " << n << " "
               << "-d " << nv << " "
               << "-a 1"
               << std::endl;
   }
}

void
NamTracer::traceLink( const WrapLink& wl, bool initial )
{
   if ( 0 == wl.source() )
   {
      return;
   }
   if ( 0 == wl.destination() )
   {
      return;
   }
   int s = nodeID(*(wl.source()));
   int d = nodeID(*(wl.destination()));
   m_stream << "l ";
   if ( initial )
   {
      m_stream << "-t * ";
   }
   else
   {
      m_stream << "-t " << time(Clock::time()) << " ";
   }
   m_stream << "-s " << s << " "
            << "-d " << d << " "
            << "-r " << wl.link().bandwidth() << " "
            << "-D " << time(wl.link().latency()) << " "
            << "-S " << ( wl.link().up() ? "UP" : "DOWN" )
            << std::endl;
}

void
NamTracer::traceBundle( const DTN::Bundle& b )
{
   DTN::ByteString dest = b.recv();
   if ( b.send() == b.recv() )
   {
      dest = vQueue( b.send() );
   }
   m_stream << "-t " << time(Clock::time()) << " "
            << "-s " << nodeID(b.send()) << " "
            << "-d " << nodeID(dest) << " "
            << "-e " << b.size() << " "
            << "-i " << ntohl(b.seqNum()) << " "
            << "-c " << stringify(b.source()) << " ";
   if ( b.type() & DTN::Bundle::kACK )
   {
      m_stream << "-p " << "ack" << " ";
   }
   else
   {
      m_stream << "-p " << "udp" << " ";
   }
}

int
NamTracer::nodeID( const WrapNode& wn )
{
   return nodeID(wn.addr());
}

int
NamTracer::nodeID( const DTN::ByteString& addr )
{
   int n = m_nodes[addr];
   if ( 0 == n )
   {
      n = m_nodes[addr] = ++m_lastNode;
   }
   return n;
}

DTN::ByteString
NamTracer::vQueue( const WrapNode& wn )
{
   return vQueue( wn.addr() );
}

DTN::ByteString
NamTracer::vQueue( const DTN::ByteString& addr )
{
   return DTN::ByteString((const unsigned char*)"volatile_queue:") + addr;
}

double
NamTracer::time( const Time& t )
{
   return t.tv.tv_sec + 1.0*t.tv.tv_usec/Time::MILLION;
}

std::string
NamTracer::stringify( const DTN::ByteString& b ) const
{
   std::string s;
   bool printable = true;
   for ( unsigned int i = 0 ; i < b.length() ; ++i )
   {
      if ( !isprint(b[i]) ) printable = false;
      if ( isspace(b[i]) ) printable = false;
   }
   if ( ! printable )
   {
      s += "0x";
   }
   for ( unsigned int i = 0 ; i < b.length() ; ++i )
   {
      if ( printable )
      {
         s += b[i];
      }
      else
      {
         char tmp[3];
         ::sprintf(tmp,"%02X",b[i]);
         s += tmp[0];
         s += tmp[1];
      }
   }

   return s;
}

---