blob: 465fd9ad26c75db413f5c0fb365ae4f20bfb0a64 [file] [log] [blame]
/* -*- Mode:C++; c-file-style:"gnu"; indent-tabs-mode:nil; -*- */
/**
* Copyright (c) 2014-2017, The University of Memphis,
* Regents of the University of California,
* Arizona Board of Regents.
*
* This file is part of NLSR (Named-data Link State Routing).
* See AUTHORS.md for complete list of NLSR authors and contributors.
*
* NLSR is free software: you can redistribute it and/or modify it under the terms
* of the GNU General Public License as published by the Free Software Foundation,
* either version 3 of the License, or (at your option) any later version.
*
* NLSR is distributed in the hope that it will be useful, but WITHOUT ANY WARRANTY;
* without even the implied warranty of MERCHANTABILITY or FITNESS FOR A PARTICULAR
* PURPOSE. See the GNU General Public License for more details.
*
* You should have received a copy of the GNU General Public License along with
* NLSR, e.g., in COPYING.md file. If not, see <http://www.gnu.org/licenses/>.
**/
#include "common.hpp"
#include "adjacency-list.hpp"
#include "adjacent.hpp"
#include "conf-parameter.hpp"
#include <boost/test/unit_test.hpp>
namespace nlsr {
namespace test {
BOOST_AUTO_TEST_SUITE(TestAdjacencyList)
BOOST_AUTO_TEST_CASE(Basic)
{
const std::string ADJ_NAME_1 = "testname";
const std::string ADJ_NAME_2 = "testname2";
//adjacent needed to test adjacency list.
Adjacent adjacent1(ADJ_NAME_1);
Adjacent adjacent2(ADJ_NAME_2);
adjacent1.setLinkCost(4);
adjacent2.setLinkCost(5);
AdjacencyList adjacentList1;
AdjacencyList adjacentList2;
adjacentList1.insert(adjacent1);
adjacentList2.insert(adjacent2);
BOOST_CHECK_EQUAL(adjacentList1.getSize(), (uint32_t)1);
BOOST_CHECK_EQUAL(adjacentList1 == adjacentList2, false);
BOOST_CHECK(adjacentList1.isNeighbor("testname"));
BOOST_CHECK_EQUAL(adjacentList1.isNeighbor("adjacent"), false);
std::string n1 = "testname";
BOOST_CHECK_EQUAL(adjacentList1.getStatusOfNeighbor(n1), Adjacent::STATUS_INACTIVE);
adjacentList1.setStatusOfNeighbor(n1, Adjacent::STATUS_ACTIVE);
BOOST_CHECK_EQUAL(adjacentList1.getStatusOfNeighbor(n1), Adjacent::STATUS_ACTIVE);
}
BOOST_AUTO_TEST_CASE(findAdjacentByFaceUri)
{
ndn::util::FaceUri faceUri("udp4://10.0.0.1:6363");
Adjacent adj1("/ndn/test/1", faceUri, 10, Adjacent::STATUS_INACTIVE, 0, 0);
AdjacencyList adjList;
adjList.insert(adj1);
std::list<Adjacent>::iterator adjIter = adjList.findAdjacent(faceUri);
BOOST_CHECK(adjIter != adjList.end());
}
BOOST_AUTO_TEST_CASE(AdjLsaIsBuildableWithOneNodeActive)
{
Adjacent adjacencyA("/router/A");
Adjacent adjacencyB("/router/B");
adjacencyA.setStatus(Adjacent::STATUS_ACTIVE);
adjacencyB.setStatus(Adjacent::STATUS_INACTIVE);
AdjacencyList adjacencies;
adjacencies.insert(adjacencyA);
adjacencies.insert(adjacencyB);
ConfParameter conf;
BOOST_CHECK(adjacencies.isAdjLsaBuildable(conf.getInterestRetryNumber()));
}
BOOST_AUTO_TEST_CASE(AdjLsaIsBuildableWithAllNodesTimedOut)
{
Adjacent adjacencyA("/router/A");
Adjacent adjacencyB("/router/B");
adjacencyA.setStatus(Adjacent::STATUS_INACTIVE);
adjacencyB.setStatus(Adjacent::STATUS_INACTIVE);
adjacencyA.setInterestTimedOutNo(HELLO_RETRIES_DEFAULT);
adjacencyB.setInterestTimedOutNo(HELLO_RETRIES_DEFAULT);
AdjacencyList adjacencies;
adjacencies.insert(adjacencyA);
adjacencies.insert(adjacencyB);
ConfParameter conf;
conf.setInterestRetryNumber(HELLO_RETRIES_DEFAULT);
BOOST_CHECK(adjacencies.isAdjLsaBuildable(conf.getInterestRetryNumber()));
}
BOOST_AUTO_TEST_CASE(AdjLsaIsNotBuildable)
{
Adjacent adjacencyA("/router/A");
Adjacent adjacencyB("/router/B");
adjacencyA.setStatus(Adjacent::STATUS_INACTIVE);
adjacencyB.setStatus(Adjacent::STATUS_INACTIVE);
adjacencyA.setInterestTimedOutNo(HELLO_RETRIES_DEFAULT);
adjacencyB.setInterestTimedOutNo(0);
AdjacencyList adjacencies;
adjacencies.insert(adjacencyA);
adjacencies.insert(adjacencyB);
ConfParameter conf;
conf.setInterestRetryNumber(HELLO_RETRIES_DEFAULT);
BOOST_CHECK(!adjacencies.isAdjLsaBuildable(conf.getInterestRetryNumber()));
}
BOOST_AUTO_TEST_SUITE_END()
} // namespace test
} // namespace nlsr