blob: e987043e4ba5ebba721aa708739c646572223491 [file] [log] [blame]
Alexander Afanasyev0845c092012-07-13 17:45:33 -07001/* -*- Mode: C++; c-file-style: "gnu"; indent-tabs-mode:nil; -*- */
2/*
3 * Copyright (c) 2012 University of California, Los Angeles
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: Alexander Afanasyev <alexander.afanasyev@ucla.edu>
19 */
20
21#include "stats-tree.h"
22#include "ns3/ccnx-face.h"
23#include "ns3/log.h"
24
25using namespace ns3;
26
27NS_LOG_COMPONENT_DEFINE ("StatsTree");
28
29namespace ndnSIM
30{
31
32StatsTree::StatsTree ()
33 : m_tree ("")
34{
35}
36
37void
38StatsTree::Step ()
39{
Alexander Afanasyev0560eec2012-07-16 15:44:31 -070040 NS_LOG_FUNCTION (this);
41
Alexander Afanasyev0845c092012-07-13 17:45:33 -070042 // walking the tree, aggregating and stepping on every node, starting the leaves
43 // for (trie_type::
44
45 WalkLeftRightRoot (&m_tree);
Alexander Afanasyev0560eec2012-07-16 15:44:31 -070046 m_tree.payload ().Step ();
47 NS_LOG_DEBUG ("[" << m_tree.key () << "] " << m_tree.payload ());
Alexander Afanasyev0845c092012-07-13 17:45:33 -070048}
49
50void
51StatsTree::NewPitEntry (const ns3::CcnxNameComponents &key)
52{
53 std::pair<tree_type::iterator, bool> item = m_tree.insert (key, LoadStatsNode ());
Alexander Afanasyev0845c092012-07-13 17:45:33 -070054
55 item.first->payload ().NewPitEntry ();
Alexander Afanasyev0845c092012-07-13 17:45:33 -070056}
57
58void
59StatsTree::Incoming (const CcnxNameComponents &key, Ptr<CcnxFace> face)
60{
61 std::pair<tree_type::iterator, bool> item = m_tree.insert (key, LoadStatsNode ());
Alexander Afanasyev0845c092012-07-13 17:45:33 -070062
63 item.first->payload ().AddIncoming (face);
64}
65
66void
67StatsTree::Outgoing (const CcnxNameComponents &key, Ptr<CcnxFace> face)
68{
69 std::pair<tree_type::iterator, bool> item = m_tree.insert (key, LoadStatsNode ());
Alexander Afanasyev0845c092012-07-13 17:45:33 -070070
71 item.first->payload ().AddOutgoing (face);
72}
73
74void
75StatsTree::Satisfy (const CcnxNameComponents &key)
76{
77 std::pair<tree_type::iterator, bool> item = m_tree.insert (key, LoadStatsNode ());
Alexander Afanasyev0845c092012-07-13 17:45:33 -070078
79 item.first->payload ().Satisfy ();
80}
81
82void
83StatsTree::Timeout (const CcnxNameComponents &key)
84{
85 std::pair<tree_type::iterator, bool> item = m_tree.insert (key, LoadStatsNode ());
Alexander Afanasyev0845c092012-07-13 17:45:33 -070086
87 item.first->payload ().Timeout ();
88}
89
Alexander Afanasyev1c0248b2012-07-24 15:59:50 -070090void
91StatsTree::Rx (const ns3::CcnxNameComponents &key, ns3::Ptr<ns3::CcnxFace> face, uint32_t amount)
92{
93 std::pair<tree_type::iterator, bool> item = m_tree.insert (key, LoadStatsNode ());
94
95 item.first->payload ().Rx (face, amount);
96}
97
98void
99StatsTree::Tx (const ns3::CcnxNameComponents &key, ns3::Ptr<ns3::CcnxFace> face, uint32_t amount)
100{
101 std::pair<tree_type::iterator, bool> item = m_tree.insert (key, LoadStatsNode ());
102
103 item.first->payload ().Tx (face, amount);
104}
105
Alexander Afanasyev0560eec2012-07-16 15:44:31 -0700106// const LoadStatsNode &
107// StatsTree::Get (const ns3::CcnxNameComponents &key) const
Alexander Afanasyev0845c092012-07-13 17:45:33 -0700108const LoadStatsNode &
Alexander Afanasyev0560eec2012-07-16 15:44:31 -0700109StatsTree::operator [] (const ns3::CcnxNameComponents &key) const
Alexander Afanasyev0845c092012-07-13 17:45:33 -0700110{
111 tree_type::iterator foundItem, lastItem;
112 bool reachLast;
113 boost::tie (foundItem, reachLast, lastItem) = const_cast<tree_type&> (m_tree).find (key);
114
Alexander Afanasyev0560eec2012-07-16 15:44:31 -0700115 return lastItem->payload ();
Alexander Afanasyev0845c092012-07-13 17:45:33 -0700116}
117
118const LoadStatsNode&
119StatsTree::WalkLeftRightRoot (tree_type *node)
120{
121 tree_type::point_iterator item (*node), end;
Alexander Afanasyev0560eec2012-07-16 15:44:31 -0700122
123 while (item != end)
Alexander Afanasyev0845c092012-07-13 17:45:33 -0700124 {
125 node->payload () += WalkLeftRightRoot (&*item);
Alexander Afanasyev0560eec2012-07-16 15:44:31 -0700126 item->payload ().Step ();
Alexander Afanasyev0845c092012-07-13 17:45:33 -0700127
Alexander Afanasyev0560eec2012-07-16 15:44:31 -0700128 NS_LOG_DEBUG ("[" << item->key () << "] " << item->payload ());
129 // item->prune (); // will do only if necessary
130
131 tree_type::point_iterator prune_iterator = item;
132 item++;
133
134 prune_iterator->prune ();
135 }
136
Alexander Afanasyev0845c092012-07-13 17:45:33 -0700137 return node->payload ();
138}
139
140std::ostream &
141operator << (std::ostream &os, const StatsTree &tree)
142{
Alexander Afanasyev0560eec2012-07-16 15:44:31 -0700143 // os << "[" << tree.m_tree.key () << "]: " << tree.m_tree.payload ();
144 os << tree.m_tree;
Alexander Afanasyev0845c092012-07-13 17:45:33 -0700145 return os;
146}
147
148
149}