NS-3 based Named Data Networking (NDN) simulator
ndnSIM: NDN, CCN, CCNx, content centric networks
API Documentation
 All Classes Namespaces Files Functions Variables Typedefs Enumerations Enumerator Groups Pages
ndn-pit-entry-impl.h
1 /* -*- Mode: C++; c-file-style: "gnu"; indent-tabs-mode:nil -*- */
2 /*
3  * Copyright (c) 2011 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 #ifndef _NDN_PIT_ENTRY_IMPL_H_
22 #define _NDN_PIT_ENTRY_IMPL_H_
23 
24 namespace ns3 {
25 namespace ndn {
26 
27 class Pit;
28 
29 namespace pit {
30 
35 template<class Pit>
36 class EntryImpl : public Entry
37 {
38 public:
39  typedef Entry base_type;
40 
41  typedef Entry super;
42  #define CONTAINER static_cast<Pit&> (m_container)
43 
44 public:
45  EntryImpl (Pit &pit,
46  Ptr<const Interest> header,
47  Ptr<fib::Entry> fibEntry)
48  : Entry (pit, header, fibEntry)
49  , item_ (0)
50  {
51  CONTAINER.i_time.insert (*this);
52  CONTAINER.RescheduleCleaning ();
53  }
54 
55  virtual ~EntryImpl ()
56  {
57  CONTAINER.i_time.erase (Pit::time_index::s_iterator_to (*this));
58 
59  CONTAINER.RescheduleCleaning ();
60  }
61 
62  virtual void
63  UpdateLifetime (const Time &offsetTime)
64  {
65  CONTAINER.i_time.erase (Pit::time_index::s_iterator_to (*this));
66  super::UpdateLifetime (offsetTime);
67  CONTAINER.i_time.insert (*this);
68 
69  CONTAINER.RescheduleCleaning ();
70  }
71 
72  virtual void
73  OffsetLifetime (const Time &offsetTime)
74  {
75  CONTAINER.i_time.erase (Pit::time_index::s_iterator_to (*this));
76  super::OffsetLifetime (offsetTime);
77  CONTAINER.i_time.insert (*this);
78 
79  CONTAINER.RescheduleCleaning ();
80  }
81 
82  // to make sure policies work
83  void
84  SetTrie (typename Pit::super::iterator item) { item_ = item; }
85 
86  typename Pit::super::iterator to_iterator () { return item_; }
87  typename Pit::super::const_iterator to_iterator () const { return item_; }
88 
89 public:
90  boost::intrusive::set_member_hook<> time_hook_;
91 
92 private:
93  typename Pit::super::iterator item_;
94 };
95 
97 template<class T>
98 struct TimestampIndex
99 {
100  bool
101  operator () (const T &a, const T &b) const
102  {
103  return a.GetExpireTime () < b.GetExpireTime ();
104  }
105 };
107 
108 } // namespace pit
109 } // namespace ndn
110 } // namespace ns3
111 
112 #endif
structure for PIT entry
Definition: ndn-pit-entry.h:57
Entry(Pit &container, Ptr< const Interest > header, Ptr< fib::Entry > fibEntry)
PIT entry constructor.
virtual void UpdateLifetime(const Time &offsetTime)
Update lifetime of PIT entry.
Class implementing Pending Interests Table.
Definition: ndn-pit.h:60
virtual void OffsetLifetime(const Time &offsetTime)
Offset the currently set PIT lifetime (allowed both negative and positive offsets) ...
virtual void UpdateLifetime(const Time &lifetime)
Update lifetime of PIT entry.
PIT entry implementation with additional pointers to the underlying container.
virtual void OffsetLifetime(const Time &offsetTime)
Offset the currently set PIT lifetime (allowed both negative and positive offsets) ...