MultiNodeStatistics.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 "MultiNodeStatistics.h"
#include "dtn/Node.h"

#include <iostream>

MultiNodeStatistics::MultiNodeStatistics() :
   Statistics(0)
{
}

unsigned long int
MultiNodeStatistics::used() const
{
   unsigned long int total = 0;
   NodeList::const_iterator itr = m_nodes.begin();
   NodeList::const_iterator end = m_nodes.end();
   for ( ; itr != end ; ++itr )
   {
      if ( 0 != *itr )
      {
         total += (*itr)->usedPersistentCap();
      }
   }

   return total;
}

unsigned long int
MultiNodeStatistics::capacity() const
{
   unsigned long int total = 0;
   NodeList::const_iterator itr = m_nodes.begin();
   NodeList::const_iterator end = m_nodes.end();
   for ( ; itr != end ; ++itr )
   {
      if ( 0 != *itr )
      {
         total += (*itr)->persistentCap();
      }
   }

   return total;
}

double
MultiNodeStatistics::maxUsed() const
{
   double retval = 0;
   NodeList::const_iterator itr = m_nodes.begin();
   NodeList::const_iterator end = m_nodes.end();
   for ( ; itr != end ; ++itr )
   {
      if ( 0 != *itr )
      {
         if ( (*itr)->persistentCap() > 0 )
         {
            double f =
               (double)((*itr)->usedPersistentCap()) / (*itr)->persistentCap();
            if ( f > retval ) retval = f;
         }
      }
   }

   return retval;
}

void
MultiNodeStatistics::persistentStore( const DTN::Bundle& b )
{
   NodeList::const_iterator itr = m_nodes.begin();
   NodeList::const_iterator end = m_nodes.end();
   for ( ; itr != end ; ++itr )
   {
      if ( 0 != *itr )
      {
         unsigned long int cap  = (*itr)->persistentCap();
         unsigned long int used = (*itr)->usedPersistentCap();
         if ( used >= cap )
         {
            m_since.setExhausted();
            m_total.setExhausted();
            return;
         }
      }
   }
}

void
MultiNodeStatistics::addNode( DTN::Node* n )
{
   if ( 0 == n ) return;
   m_nodes.push_back( n );
}

---