BundleCollector.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 "BundleCollector.h"
#include "pydtn/WrapNode.h"
#include "pydtn/Statistics.h"

using namespace StoreProfile;

BundleCollector::BundleCollector( std::ostream& s ) :
   m_stream(s)
{
}

BundleCollector::~BundleCollector()
{
}

void
BundleCollector::operator()( const WrapNode& wn ) const
{
   Stat storedData;
   Stat storedAcks;
   Stat queuedData;
   Stat queuedAcks;

   DTN::BundlePointer itr = wn.cachedVolatile();
   for ( ; ! itr.isNull() ; itr = itr.next() )
   {
      const DTN::Bundle* b = itr.repr()->bundle();
      size_t length = b->size();
      if ( 0 != b )
      {
         if ( DTN::Bundle::kACK & b->type() )
         {
            queuedAcks.add( length );
         }
         else
         {
            queuedData.add( length );
         }
      }
   }

   itr = wn.cachedPersistent();
   for ( ; ! itr.isNull() ; itr = itr.next() )
   {
      const DTN::Bundle* b = itr.repr()->bundle();
      size_t length = b->size();
      if ( 0 != b )
      {
         if ( DTN::Bundle::kACK & b->type() )
         {
            storedAcks.add( length );
         }
         else
         {
            storedData.add( length );
         }
      }
   }

   m_stream << wn.addrString() << " "
            << "qd: " << queuedData.n() << " " << queuedData.s() << " "
            << "qa: " << queuedAcks.n() << " " << queuedAcks.s() << " "
            << "sd: " << storedData.n() << " " << storedData.s() << " "
            << "sa: " << storedAcks.n() << " " << storedAcks.s() << std::endl;
}

---