SpaceAvailCustody.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 "config.h"
#include "SpaceAvailCustody.h"
#include "Node.h"

using namespace DTN;

CustodyPolicy::CustodyReturn
SpaceAvailCustody::takeCustody( const Bundle& b )
{
   if ( 0 == m_owner )
   {
      return kDropBundle;
   }
   if ( 0 == m_store )
   {
      return kNoCustody;
   }
   Bundle::BundleType t = b.type();
   if ( ( Bundle::kBcast & t ) ||
        ( Bundle::kACK & t ) ||
        !( Bundle::kCustodial & t ) )
   {
      // This isn't a custodial bundle type.
      return kNoCustody;
   }
   if ( m_owner->addr() == b.custodian() )
   {
      // We're already the custodian.
      return kNoCustody;
   }

   unsigned int size = b.size();
   unsigned int avail =
      m_owner->persistentCap() - m_owner->usedPersistentCap();
   if ( size > avail )
   {
      m_owner->signalExhausted(b);
      return kNoCustody;
   }

   Bundle* pB = b.clone();
   pB->custodian() = m_owner->addr();
   BundlePointer ptr = m_store->addBundle( pB );
   if ( ptr.isNull() )
   {
      return kNoCustody;
   }
   return kCustodyTaken;
}

void
SpaceAvailCustody::retry()
{
   if ( ( 0 == m_owner ) || ( 0 == m_store ) ) return;

   // very simple semantics -- try to send each stored Bundle
   BundlePointer itr = m_store->getPointer( BundlePointer() );
   for ( ; ! itr.isNull() ; itr = itr.next() )
   {
      m_owner->forward( itr.repr()->bundle()->clone() );
   }
}

---