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

FlowTracer::FlowTracer( std::ostream& s ) :
   m_stream( s )
{
   m_stream << std::fixed;
}

FlowTracer::~FlowTracer()
{
}

void
FlowTracer::node( const WrapNode& wn )
{
}

void
FlowTracer::link( const WrapLink& wl )
{
}

void
FlowTracer::enqueue( const DTN::Bundle& b, const DTN::Node* n )
{
}

void
FlowTracer::dequeue( const DTN::Bundle& b, const DTN::Node* n )
{
}

void
FlowTracer::send( const DTN::Bundle& b, const DTN::Node* n )
{
   if ( 0 == n ) return;
   if ( n->addr() != b.source() ) return;
   traceBundle(b,"inject",*n);
}

void
FlowTracer::receive( const DTN::Bundle& b, const DTN::Node* n )
{
   if ( 0 == n ) return;
   if ( n->addr() != b.destination() ) return;
   traceBundle(b,"deliver",*n);
}

void
FlowTracer::drop( const DTN::Bundle& b,
                  const DTN::DropCause& c,
                  const DTN::Node* n )
{
   if ( 0 == n ) return;
   std::string cause = "unknown";
   if ( DTN::BitErrorDrop::inst.isType(c) )
   {
      cause = "ber";
   }
   else if ( DTN::CustodyPolicyDrop::inst.isType(c) )
   {
      cause = "custody";
   }
   else if ( DTN::ExpiryDrop::inst.isType(c) )
   {
      cause = "expiry";
   }
   else if ( DTN::FullQueueDrop::inst.isType(c) )
   {
      cause = "fullq";
   }
   else if ( DTN::LinkFailureDrop::inst.isType(c) )
   {
      cause = "linkfail";
   }
   else if ( DTN::NoRouteDrop::inst.isType(c) )
   {
      cause = "noroute";
   }
   traceBundle(b,"drop",*n,cause);
}

void
FlowTracer::traceBundle( const DTN::Bundle& b,
                         const std::string& func,
                         const DTN::Node& n,
                         const std::string& xtra )
{
   if ( b.type() & DTN::Bundle::kACK )
   {
      return;
   }
   Time t = Clock::time();
   m_stream << t.tv.tv_sec << "," << t.tv.tv_usec << " "
            << stringify(b.source()) << " "
            << stringify(b.destination()) << " "
            << stringify(b.app()) << " "
            << ntohl(b.seqNum()) << " "
            << func << " "
            << b.size() << " "
            << b.hopCount() << " "
            << stringify(n.addr()) << " "
            << xtra
            << std::endl;
}

std::string
FlowTracer::stringify( const DTN::ByteString& b ) const
{
   if ( 0 == b.length() ) return "-";
   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;
}

---