lp-reassembler.hpp
Go to the documentation of this file.
1 /* -*- Mode:C++; c-file-style:"gnu"; indent-tabs-mode:nil; -*- */
2 /*
3  * Copyright (c) 2014-2019, Regents of the University of California,
4  * Arizona Board of Regents,
5  * Colorado State University,
6  * University Pierre & Marie Curie, Sorbonne University,
7  * Washington University in St. Louis,
8  * Beijing Institute of Technology,
9  * The University of Memphis.
10  *
11  * This file is part of NFD (Named Data Networking Forwarding Daemon).
12  * See AUTHORS.md for complete list of NFD authors and contributors.
13  *
14  * NFD is free software: you can redistribute it and/or modify it under the terms
15  * of the GNU General Public License as published by the Free Software Foundation,
16  * either version 3 of the License, or (at your option) any later version.
17  *
18  * NFD is distributed in the hope that it will be useful, but WITHOUT ANY WARRANTY;
19  * without even the implied warranty of MERCHANTABILITY or FITNESS FOR A PARTICULAR
20  * PURPOSE. See the GNU General Public License for more details.
21  *
22  * You should have received a copy of the GNU General Public License along with
23  * NFD, e.g., in COPYING.md file. If not, see <http://www.gnu.org/licenses/>.
24  */
25 
26 #ifndef NFD_DAEMON_FACE_LP_REASSEMBLER_HPP
27 #define NFD_DAEMON_FACE_LP_REASSEMBLER_HPP
28 
29 #include "face-log.hpp"
30 #include "transport.hpp"
31 
32 #include <ndn-cxx/lp/packet.hpp>
33 
34 namespace nfd {
35 namespace face {
36 
37 class LinkService;
38 
42 class LpReassembler : noncopyable
43 {
44 public:
47  struct Options
48  {
53  size_t nMaxFragments = 400;
54 
57  time::nanoseconds reassemblyTimeout = 500_ms;
58  };
59 
60  explicit
61  LpReassembler(const Options& options, const LinkService* linkService = nullptr);
62 
65  void
66  setOptions(const Options& options);
67 
72  const LinkService*
73  getLinkService() const;
74 
84  std::tuple<bool, Block, lp::Packet>
85  receiveFragment(EndpointId remoteEndpoint, const lp::Packet& packet);
86 
89  size_t
90  size() const;
91 
99  signal::Signal<LpReassembler, EndpointId, size_t> beforeTimeout;
100 
101 private:
104  struct PartialPacket
105  {
106  std::vector<lp::Packet> fragments;
107  size_t fragCount;
108  size_t nReceivedFragments;
109  scheduler::ScopedEventId dropTimer;
110  };
111 
114  typedef std::tuple<
115  EndpointId, // remoteEndpoint
116  lp::Sequence // message identifier (sequence of the first fragment)
117  > Key;
118 
119  Block
120  doReassembly(const Key& key);
121 
122  void
123  timeoutPartialPacket(const Key& key);
124 
125 private:
126  Options m_options;
127  const LinkService* m_linkService;
128  std::map<Key, PartialPacket> m_partialPackets;
129 };
130 
131 std::ostream&
132 operator<<(std::ostream& os, const FaceLogHelper<LpReassembler>& flh);
133 
134 inline void
136 {
137  m_options = options;
138 }
139 
140 inline const LinkService*
142 {
143  return m_linkService;
144 }
145 
146 inline size_t
148 {
149  return m_partialPackets.size();
150 }
151 
152 } // namespace face
153 } // namespace nfd
154 
155 #endif // NFD_DAEMON_FACE_LP_REASSEMBLER_HPP
LpReassembler(const Options &options, const LinkService *linkService=nullptr)
std::tuple< bool, Block, lp::Packet > receiveFragment(EndpointId remoteEndpoint, const lp::Packet &packet)
adds received fragment to buffer
const LinkService * getLinkService() const
size_t size() const
count of partial packets
uint64_t EndpointId
identifies an endpoint on the link
Definition: transport.hpp:38
Copyright (c) 2014-2015, Regents of the University of California, Arizona Board of Regents...
Definition: algorithm.hpp:32
Options that control the behavior of LpReassembler.
signal::Signal< LpReassembler, EndpointId, size_t > beforeTimeout
signals before a partial packet is dropped due to timeout
reassembles fragmented network-layer packets
size_t nMaxFragments
maximum number of fragments in a packet
time::nanoseconds reassemblyTimeout
timeout before a partially reassembled packet is dropped
void setOptions(const Options &options)
set options for reassembler