blob: 135c5f032fc62575ec1efb961e2bbf1def8ce558 [file] [log] [blame]
/* -*- Mode: C++; c-file-style: "gnu"; indent-tabs-mode:nil; -*- */
/*
* Copyright (c) 2011 University of California, Los Angeles
*
* This program is free software; you can redistribute it and/or modify
* it under the terms of the GNU General Public License version 2 as
* published by the Free Software Foundation;
*
* This program 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 this program; if not, write to the Free Software
* Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA 02111-1307 USA
*
* Author: Alexander Afanasyev <alexander.afanasyev@ucla.edu>
*/
#ifndef LOAD_STATS_NODE_H
#define LOAD_STATS_NODE_H
#include "load-stats-face.h"
#include <map>
#include "ns3/ptr.h"
namespace ns3 {
namespace ndn {
class Face;
namespace ndnSIM
{
// this thing is actually put into a tree node, associated with each "name entry"
class LoadStatsNode
{
public:
typedef std::map< ns3::Ptr<Face>, LoadStatsFace > stats_container;
LoadStatsNode () {}
LoadStatsNode (const LoadStatsNode &) {}
void
Step ();
/**
* Increment face-independent counter
*/
void
NewPitEntry ();
/**
* Increment counter to incoming list
*/
void
AddIncoming (ns3::Ptr<Face> face);
/**
* Increment counter to outgoing list
*/
void
AddOutgoing (ns3::Ptr<Face> face);
/**
* Increment counter to both incoming and outgoing lists, for all faces
*/
void
Satisfy ();
/**
* Remove a packet from all stats
*/
void
RemoveFromStats ();
/**
* Increment counter to both incoming and outgoing lists, for all faces
*/
void
Timeout ();
/**
* Increment counter for Tx amount
*/
void
Rx (ns3::Ptr<Face> face, uint32_t amount);
/**
* Increment counter for Tx amount
*/
void
Tx (ns3::Ptr<Face> face, uint32_t amount);
LoadStatsNode &
operator += (const LoadStatsNode &stats);
inline const stats_container &
incoming () const;
inline const stats_container &
outgoing () const;
inline const LoadStatsFace &
pit () const;
bool
IsZero () const;
bool
operator == (const LoadStatsNode &other) const;
bool
operator != (const LoadStatsNode &other) const
{
return !(*this == other);
}
LoadStatsNode &
operator = (const LoadStatsNode &other)
{
// don't do any copying at all
return *this;
}
void
RemoveFace (ns3::Ptr<Face> face);
private:
LoadStatsFace m_pit;
stats_container m_incoming;
stats_container m_outgoing;
friend std::ostream&
operator << (std::ostream &os, const LoadStatsNode &node);
};
inline const LoadStatsNode::stats_container &
LoadStatsNode::incoming () const
{
return m_incoming;
}
inline const LoadStatsNode::stats_container &
LoadStatsNode::outgoing () const
{
return m_outgoing;
}
inline const LoadStatsFace &
LoadStatsNode::pit () const
{
return m_pit;
}
std::ostream&
operator << (std::ostream &os, const LoadStatsNode &node);
} // ndnSIM
} // ndn
} // ns3
#endif