daemon/src/routing/NeighborDatabase.cpp

Go to the documentation of this file.

/*
 * NeighborDatabase.cpp
 *
 *  Created on: 23.07.2010
 *      Author: morgenro
 */

#include "routing/NeighborDatabase.h"
#include <ibrdtn/utils/Clock.h>

namespace dtn
{
        namespace routing
        {
                NeighborDatabase::NeighborEntry::NeighborEntry()
                 : _eid(), _filter(), _filter_age(0), _lastseen(0), _lastupdate(0), _available(false), _transfer_semaphore(5), _transfer_max(5)
                {};

                NeighborDatabase::NeighborEntry::NeighborEntry(const dtn::data::EID &eid)
                 : _eid(eid), _filter(), _filter_age(0), _lastseen(0), _lastupdate(0), _available(false), _transfer_semaphore(5), _transfer_max(5)
                { }

                NeighborDatabase::NeighborEntry::~NeighborEntry()
                { }

                void NeighborDatabase::NeighborEntry::updateLastSeen()
                {
                        _lastseen = dtn::utils::Clock::getTime();
                }

                void NeighborDatabase::NeighborEntry::updateBundles(const ibrcommon::BloomFilter &bf)
                {
                        _filter = bf;
                        _lastupdate = dtn::utils::Clock::getTime();
                }

                void NeighborDatabase::NeighborEntry::acquireTransfer() throw (NoMoreTransfersAvailable)
                {
                        ibrcommon::MutexLock l(_transfer_lock);
                        if (_transfer_semaphore == 0) throw NoMoreTransfersAvailable();
                        _transfer_semaphore--;
                }

                void NeighborDatabase::NeighborEntry::releaseTransfer()
                {
                        ibrcommon::MutexLock l(_transfer_lock);
                        if (_transfer_semaphore >= _transfer_max) return;
                        _transfer_semaphore++;
                }

                NeighborDatabase::NeighborDatabase()
                {
                }

                NeighborDatabase::~NeighborDatabase()
                {
                }

                NeighborDatabase::NeighborEntry& NeighborDatabase::get(const dtn::data::EID &eid)
                {
                        if (_entries.find(eid) == _entries.end())
                        {
                                NeighborEntry entry(eid);
                                _entries[eid] = entry;
                        }

                        return _entries[eid];
                }

                void NeighborDatabase::updateBundles(const dtn::data::EID &eid, const ibrcommon::BloomFilter &bf)
                {
                        NeighborEntry &entry = get(eid);
                        entry.updateBundles(bf);
                }

                bool NeighborDatabase::knowBundle(const dtn::data::EID &eid, const dtn::data::BundleID &bundle) throw (BloomfilterNotAvailableException)
                {
                        NeighborEntry &entry = get(eid);
                        return entry._filter.contains(bundle.toString());
                }

                void NeighborDatabase::setAvailable(const dtn::data::EID &eid)
                {
                        NeighborEntry &entry = get(eid);
                        entry.updateLastSeen();
                        entry._available = true;
                }

                void NeighborDatabase::setUnavailable(const dtn::data::EID &eid)
                {
                        NeighborEntry &entry = get(eid);
                        entry.updateLastSeen();
                        entry._available = false;
                }

                const std::set<dtn::data::EID> NeighborDatabase::getAvailable() const
                {
                        std::set<dtn::data::EID> ret;

                        for (std::map<dtn::data::EID, NeighborDatabase::NeighborEntry>::const_iterator iter = _entries.begin(); iter != _entries.end(); iter++)
                        {
                                if ((*iter).second._available)
                                {
                                        ret.insert((*iter).first);
                                }
                        }

                        return ret;
                }
        }
}