185 lines
4.0 KiB
C++
185 lines
4.0 KiB
C++
/* -*- Mode: C++; c-file-style: "gnu"; indent-tabs-mode:nil; -*- */
|
|
/*
|
|
* Copyright (c) 2007 INRIA
|
|
*
|
|
* 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
|
|
*
|
|
* Authors:
|
|
* Mathieu Lacage <mathieu.lacage@sophia.inria.fr>,
|
|
*/
|
|
|
|
#include "ns3/simulator.h"
|
|
#include "ns3/object-vector.h"
|
|
#include "ns3/config.h"
|
|
#include "ns3/log.h"
|
|
#include "ns3/assert.h"
|
|
#include "node-list.h"
|
|
#include "node.h"
|
|
|
|
namespace ns3 {
|
|
|
|
NS_LOG_COMPONENT_DEFINE ("NodeList");
|
|
|
|
/**
|
|
* \brief private implementation detail of the NodeList API.
|
|
*/
|
|
class NodeListPriv : public Object
|
|
{
|
|
public:
|
|
static TypeId GetTypeId (void);
|
|
NodeListPriv ();
|
|
~NodeListPriv ();
|
|
|
|
uint32_t Add (Ptr<Node> node);
|
|
NodeList::Iterator Begin (void) const;
|
|
NodeList::Iterator End (void) const;
|
|
Ptr<Node> GetNode (uint32_t n);
|
|
uint32_t GetNNodes (void);
|
|
|
|
static Ptr<NodeListPriv> Get (void);
|
|
|
|
private:
|
|
static Ptr<NodeListPriv> *DoGet (void);
|
|
static void Delete (void);
|
|
std::vector<Ptr<Node> > m_nodes;
|
|
};
|
|
|
|
NS_OBJECT_ENSURE_REGISTERED (NodeListPriv);
|
|
|
|
TypeId
|
|
NodeListPriv::GetTypeId (void)
|
|
{
|
|
static TypeId tid = TypeId ("ns3::NodeListPriv")
|
|
.SetParent<Object> ()
|
|
.AddAttribute ("NodeList", "The list of all nodes created during the simulation.",
|
|
ObjectVectorValue (),
|
|
MakeObjectVectorAccessor (&NodeListPriv::m_nodes),
|
|
MakeObjectVectorChecker<Node> ())
|
|
;
|
|
return tid;
|
|
}
|
|
|
|
Ptr<NodeListPriv>
|
|
NodeListPriv::Get (void)
|
|
{
|
|
return *DoGet ();
|
|
}
|
|
Ptr<NodeListPriv> *
|
|
NodeListPriv::DoGet (void)
|
|
{
|
|
static Ptr<NodeListPriv> ptr = 0;
|
|
if (ptr == 0)
|
|
{
|
|
ptr = CreateObject<NodeListPriv> ();
|
|
Config::RegisterRootNamespaceObject (ptr);
|
|
Simulator::ScheduleDestroy (&NodeListPriv::Delete);
|
|
}
|
|
return &ptr;
|
|
}
|
|
void
|
|
NodeListPriv::Delete (void)
|
|
{
|
|
NS_LOG_FUNCTION_NOARGS ();
|
|
Config::UnregisterRootNamespaceObject (Get ());
|
|
(*DoGet ()) = 0;
|
|
}
|
|
|
|
|
|
NodeListPriv::NodeListPriv ()
|
|
{
|
|
NS_LOG_FUNCTION_NOARGS ();
|
|
}
|
|
NodeListPriv::~NodeListPriv ()
|
|
{
|
|
NS_LOG_FUNCTION_NOARGS ();
|
|
for (std::vector<Ptr<Node> >::iterator i = m_nodes.begin ();
|
|
i != m_nodes.end (); i++)
|
|
{
|
|
Ptr<Node> node = *i;
|
|
node->Dispose ();
|
|
*i = 0;
|
|
}
|
|
m_nodes.erase (m_nodes.begin (), m_nodes.end ());
|
|
}
|
|
|
|
|
|
uint32_t
|
|
NodeListPriv::Add (Ptr<Node> node)
|
|
{
|
|
uint32_t index = m_nodes.size ();
|
|
m_nodes.push_back (node);
|
|
return index;
|
|
|
|
}
|
|
NodeList::Iterator
|
|
NodeListPriv::Begin (void) const
|
|
{
|
|
return m_nodes.begin ();
|
|
}
|
|
NodeList::Iterator
|
|
NodeListPriv::End (void) const
|
|
{
|
|
return m_nodes.end ();
|
|
}
|
|
uint32_t
|
|
NodeListPriv::GetNNodes (void)
|
|
{
|
|
return m_nodes.size ();
|
|
}
|
|
|
|
Ptr<Node>
|
|
NodeListPriv::GetNode (uint32_t n)
|
|
{
|
|
NS_ASSERT_MSG (n < m_nodes.size (), "Node index " << n <<
|
|
" is out of range (only have " << m_nodes.size () << " nodes).");
|
|
return m_nodes[n];
|
|
}
|
|
|
|
}
|
|
|
|
/**
|
|
* The implementation of the public static-based API
|
|
* which calls into the private implementation through
|
|
* the simulation singleton.
|
|
*/
|
|
namespace ns3 {
|
|
|
|
uint32_t
|
|
NodeList::Add (Ptr<Node> node)
|
|
{
|
|
return NodeListPriv::Get ()->Add (node);
|
|
}
|
|
NodeList::Iterator
|
|
NodeList::Begin (void)
|
|
{
|
|
return NodeListPriv::Get ()->Begin ();
|
|
}
|
|
NodeList::Iterator
|
|
NodeList::End (void)
|
|
{
|
|
return NodeListPriv::Get ()->End ();
|
|
}
|
|
Ptr<Node>
|
|
NodeList::GetNode (uint32_t n)
|
|
{
|
|
return NodeListPriv::Get ()->GetNode (n);
|
|
}
|
|
uint32_t
|
|
NodeList::GetNNodes (void)
|
|
{
|
|
return NodeListPriv::Get ()->GetNNodes ();
|
|
}
|
|
|
|
}//namespace ns3
|