blob: 6e9ce43db36a94b33b892e8d9a01efbfa4d1ef69 [file] [log] [blame]
laqinfan35731852017-08-08 06:17:39 -05001/* -*- Mode:C++; c-file-style:"gnu"; indent-tabs-mode:nil; -*- */
2/**
Tianxing Ma9ea36392018-10-05 14:32:55 -05003 * Copyright (c) 2014-2019, The University of Memphis,
laqinfan35731852017-08-08 06:17:39 -05004 * Regents of the University of California,
5 * Arizona Board of Regents.
6 *
7 * This file is part of NLSR (Named-data Link State Routing).
8 * See AUTHORS.md for complete list of NLSR authors and contributors.
9 *
10 * NLSR is free software: you can redistribute it and/or modify it under the terms
11 * of the GNU General Public License as published by the Free Software Foundation,
12 * either version 3 of the License, or (at your option) any later version.
13 *
14 * NLSR is distributed in the hope that it will be useful, but WITHOUT ANY WARRANTY;
15 * without even the implied warranty of MERCHANTABILITY or FITNESS FOR A PARTICULAR
16 * PURPOSE. See the GNU General Public License for more details.
17 *
18 * You should have received a copy of the GNU General Public License along with
19 * NLSR, e.g., in COPYING.md file. If not, see <http://www.gnu.org/licenses/>.
20 **/
21
22#include "tlv/routing-table-status.hpp"
23
24#include "../boost-test.hpp"
25
26namespace nlsr {
27namespace tlv {
28namespace test {
29
30BOOST_AUTO_TEST_SUITE(TlvTestRoutingTable)
31
32const uint8_t RoutingTableData1[] =
33{
34 // Header
Tianxing Ma9ea36392018-10-05 14:32:55 -050035 0x90, 0x22,
laqinfan35731852017-08-08 06:17:39 -050036 // Routing table entry
Tianxing Ma9ea36392018-10-05 14:32:55 -050037 0x91, 0x20,
38 // Destination
39 0x8e, 0x09, 0x07, 0x07, 0x08, 0x05, 0x64, 0x65, 0x73, 0x74, 0x31,
40 // Nexthop
41 0x8f, 0x13, 0x8d, 0x07, 0x6e, 0x65, 0x78, 0x74, 0x68, 0x6f, 0x70, 0x86, 0x08, 0x3f,
42 0xfa, 0x66, 0x66, 0x66, 0x66, 0x66, 0x66
laqinfan35731852017-08-08 06:17:39 -050043};
44
45const uint8_t RoutingTableData2[] =
46{
47 // Header
48 0x90, 0x00
49};
50
51BOOST_AUTO_TEST_CASE(RoutingTableEncode1)
52{
53 RoutingTableStatus rtStatus;
54
55 Destination des;
56 des.setName("dest1");
57
58 // RoutingtableEntry
59 RoutingTable rt;
60 rt.setDestination(des);
61
62 NextHop nexthops;
63 nexthops.setUri("nexthop");
64 nexthops.setCost(1.65);
65 rt.addNexthops(nexthops);
66
67 rtStatus.addRoutingTable(rt);
68
69 const ndn::Block& wire = rtStatus.wireEncode();
70
71 BOOST_REQUIRE_EQUAL_COLLECTIONS(RoutingTableData1,
72 RoutingTableData1 + sizeof(RoutingTableData1),
73 wire.begin(), wire.end());
74}
75
76BOOST_AUTO_TEST_CASE(RoutingTableEncode2)
77{
78 RoutingTableStatus rtStatus;
79
80 const ndn::Block& wire = rtStatus.wireEncode();
81
82 BOOST_REQUIRE_EQUAL_COLLECTIONS(RoutingTableData2,
83 RoutingTableData2 + sizeof(RoutingTableData2),
84 wire.begin(), wire.end());
85}
86
87BOOST_AUTO_TEST_CASE(RoutingTableDecode1)
88{
89 RoutingTableStatus rtStatus;
90
91 rtStatus.wireDecode(ndn::Block(RoutingTableData1, sizeof(RoutingTableData1)));
92
93 std::list<RoutingTable> rte = rtStatus.getRoutingtable();
94 std::list<RoutingTable>::const_iterator it1 = rte.begin();
95
96 Destination des1 = it1->getDestination();
97 BOOST_CHECK_EQUAL(des1.getName(), "dest1");
98
99 std::list<NextHop> nexthops = it1->getNextHops();
100 std::list<NextHop>::const_iterator it2 = nexthops.begin();
101 BOOST_CHECK_EQUAL(it2->getUri(), "nexthop");
102 BOOST_CHECK_EQUAL(it2->getCost(), 1.65);
103
104 BOOST_CHECK_EQUAL(rtStatus.hasRoutingTable(), true);
105}
106
107BOOST_AUTO_TEST_CASE(RoutingTableDecode2)
108{
109 RoutingTableStatus rtStatus;
110
111 rtStatus.wireDecode(ndn::Block(RoutingTableData2, sizeof(RoutingTableData2)));
112
113 BOOST_CHECK_EQUAL(rtStatus.hasRoutingTable(), false);
114}
115
116BOOST_AUTO_TEST_CASE(RoutingTableClear)
117{
118 RoutingTableStatus rtStatus;
119 Destination des;
120 des.setName("dest1");
121
122 // RoutingtableEntry
123 RoutingTable rt;
124 rt.setDestination(des);
125
126 NextHop nexthops;
127 nexthops.setUri("nexthop");
128 nexthops.setCost(1.65);
129 rt.addNexthops(nexthops);
130
131 rtStatus.addRoutingTable(rt);
132
133 BOOST_CHECK_EQUAL(rtStatus.hasRoutingTable(), true);
134 rtStatus.clearRoutingTable();
135 BOOST_CHECK_EQUAL(rtStatus.hasRoutingTable(), false);
136}
137
138BOOST_AUTO_TEST_CASE(RoutingTableOutputStream)
139{
140 RoutingTableStatus rtStatus;
141 Destination des;
142 des.setName("dest1");
143
144 // RoutingtableEntry
145 RoutingTable rt;
146 rt.setDestination(des);
147
148 NextHop nexthops;
149 nexthops.setUri("nexthop");
150 nexthops.setCost(99);
151 rt.addNexthops(nexthops);
152
153 rtStatus.addRoutingTable(rt);
154
155 std::ostringstream os;
156 os << rtStatus;
157
158 BOOST_CHECK_EQUAL(os.str(), "Routing Table Status: \n"
laqinfan35731852017-08-08 06:17:39 -0500159 "Destination: /dest1\n"
laqinfana073e2e2018-01-15 21:17:24 +0000160 "NexthopList(\n"
laqinfan35731852017-08-08 06:17:39 -0500161 "NextHop(Uri: nexthop, Cost: 99)\n"
laqinfana073e2e2018-01-15 21:17:24 +0000162 ")");
laqinfan35731852017-08-08 06:17:39 -0500163}
164
165BOOST_AUTO_TEST_SUITE_END()
166
167} // namespace test
168} // namespace tlv
169} // namespace nlsr