A Discrete-Event Network Simulator
API
 All Classes Namespaces Files Functions Variables Typedefs Enumerations Enumerator Properties Friends Macros Groups Pages
ipv6-routing-helper.cc
Go to the documentation of this file.
1 /* -*- Mode:C++; c-file-style:"gnu"; indent-tabs-mode:nil; -*- */
2 /*
3  * Copyright (c) 2008 INRIA
4  *
5  * This program is free software; you can redistribute it and/or modify
6  * it under the terms of the GNU General Public License version 2 as
7  * published by the Free Software Foundation;
8  *
9  * This program is distributed in the hope that it will be useful,
10  * but WITHOUT ANY WARRANTY; without even the implied warranty of
11  * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
12  * GNU General Public License for more details.
13  *
14  * You should have received a copy of the GNU General Public License
15  * along with this program; if not, write to the Free Software
16  * Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA 02111-1307 USA
17  *
18  * Author: Mathieu Lacage <mathieu.lacage@sophia.inria.fr>
19  */
20 
21 #include "ns3/node.h"
22 #include "ns3/node-list.h"
23 #include "ns3/simulator.h"
24 #include "ns3/ipv6-routing-protocol.h"
25 #include "ns3/ipv6-list-routing.h"
26 #include "ipv6-routing-helper.h"
27 
28 namespace ns3 {
29 
31 {
32 }
33 
34 void
36 {
37  for (uint32_t i = 0; i < NodeList::GetNNodes (); i++)
38  {
39  Ptr<Node> node = NodeList::GetNode (i);
40  Simulator::Schedule (printTime, &Ipv6RoutingHelper::Print, this, node, stream);
41  }
42 }
43 
44 void
46 {
47  for (uint32_t i = 0; i < NodeList::GetNNodes (); i++)
48  {
49  Ptr<Node> node = NodeList::GetNode (i);
50  Simulator::Schedule (printInterval, &Ipv6RoutingHelper::PrintEvery, this, printInterval, node, stream);
51  }
52 }
53 
54 void
56 {
57  Simulator::Schedule (printTime, &Ipv6RoutingHelper::Print, this, node, stream);
58 }
59 
60 void
62 {
63  Simulator::Schedule (printInterval, &Ipv6RoutingHelper::PrintEvery, this, printInterval, node, stream);
64 }
65 
66 void
68 {
69  Ptr<Ipv6> ipv6 = node->GetObject<Ipv6> ();
70  Ptr<Ipv6RoutingProtocol> rp = ipv6->GetRoutingProtocol ();
71  NS_ASSERT (rp);
72  rp->PrintRoutingTable (stream);
73 }
74 
75 void
77 {
78  Ptr<Ipv6> ipv6 = node->GetObject<Ipv6> ();
79  Ptr<Ipv6RoutingProtocol> rp = ipv6->GetRoutingProtocol ();
80  NS_ASSERT (rp);
81  rp->PrintRoutingTable (stream);
82  Simulator::Schedule (printInterval, &Ipv6RoutingHelper::PrintEvery, this, printInterval, node, stream);
83 }
84 
85 } // namespace ns3
virtual ~Ipv6RoutingHelper()
Destroy an Ipv6 Ipv6RoutingHelper.
keep track of time values and allow control of global simulation resolution
Definition: nstime.h:81
static uint32_t GetNNodes(void)
Definition: node-list.cc:200
Access to the IPv6 forwarding table, interfaces, and configuration.
Definition: ipv6.h:79
static Ptr< Node > GetNode(uint32_t n)
Definition: node-list.cc:194
#define NS_ASSERT(condition)
Definition: assert.h:64
static EventId Schedule(Time const &time, MEM mem_ptr, OBJ obj)
Schedule an event to expire at the relative time "time" is reached.
Definition: simulator.h:824
void PrintRoutingTableAllEvery(Time printInterval, Ptr< OutputStreamWrapper > stream) const
prints the routing tables of all nodes at regular intervals specified by user.
void PrintRoutingTableAt(Time printTime, Ptr< Node > node, Ptr< OutputStreamWrapper > stream) const
prints the routing tables of a node at a particular time.
void Print(Ptr< Node > node, Ptr< OutputStreamWrapper > stream) const
prints the routing tables of a node.
void PrintEvery(Time printInterval, Ptr< Node > node, Ptr< OutputStreamWrapper > stream) const
prints the routing tables of a node at regular intervals specified by user.
void PrintRoutingTableEvery(Time printInterval, Ptr< Node > node, Ptr< OutputStreamWrapper > stream) const
prints the routing tables of a node at regular intervals specified by user.
Ptr< T > GetObject(void) const
Definition: object.h:361
void PrintRoutingTableAllAt(Time printTime, Ptr< OutputStreamWrapper > stream) const
prints the routing tables of all nodes at a particular time.