blob: aacb0a3ba3062384cddbbf1cb36b2b4dc109c21c [file] [log] [blame]
akmhoque3d06e792014-05-27 16:23:20 -05001/* -*- Mode:C++; c-file-style:"gnu"; indent-tabs-mode:nil; -*- */
2/**
3 * Copyright (c) 2014 University of Memphis,
4 * Regents of the University of California
5 *
6 * This file is part of NLSR (Named-data Link State Routing).
7 * See AUTHORS.md for complete list of NLSR authors and contributors.
8 *
9 * NLSR is free software: you can redistribute it and/or modify it under the terms
10 * of the GNU General Public License as published by the Free Software Foundation,
11 * either version 3 of the License, or (at your option) any later version.
12 *
13 * NLSR is distributed in the hope that it will be useful, but WITHOUT ANY WARRANTY;
14 * without even the implied warranty of MERCHANTABILITY or FITNESS FOR A PARTICULAR
15 * PURPOSE. See the GNU General Public License for more details.
16 *
17 * You should have received a copy of the GNU General Public License along with
18 * NLSR, e.g., in COPYING.md file. If not, see <http://www.gnu.org/licenses/>.
19 *
20 * \author A K M Mahmudul Hoque <ahoque1@memphis.edu>
21 *
22 **/
akmhoque53353462014-04-22 08:43:45 -050023#include <list>
24#include "fib-entry.hpp"
25#include "nexthop.hpp"
akmhoque674b0b12014-05-20 14:33:28 -050026#include "logger.hpp"
akmhoque53353462014-04-22 08:43:45 -050027
28namespace nlsr {
29
akmhoque674b0b12014-05-20 14:33:28 -050030INIT_LOGGER("FibEntry");
31
akmhoque53353462014-04-22 08:43:45 -050032using namespace std;
33
34bool
akmhoquec8a10f72014-04-25 18:42:55 -050035FibEntry::isEqualNextHops(NexthopList& nhlOther)
akmhoque53353462014-04-22 08:43:45 -050036{
akmhoque157b0a42014-05-13 00:26:37 -050037 if (m_nexthopList.getSize() != nhlOther.getSize()) {
akmhoque53353462014-04-22 08:43:45 -050038 return false;
39 }
akmhoque157b0a42014-05-13 00:26:37 -050040 else {
akmhoquefdbddb12014-05-02 18:35:19 -050041 uint32_t nhCount = 0;
akmhoque53353462014-04-22 08:43:45 -050042 std::list<NextHop>::iterator it1, it2;
akmhoquefdbddb12014-05-02 18:35:19 -050043 for (it1 = m_nexthopList.getNextHops().begin(),
44 it2 = nhlOther.getNextHops().begin() ;
akmhoque157b0a42014-05-13 00:26:37 -050045 it1 != m_nexthopList.getNextHops().end() ; it1++, it2++) {
46 if (it1->getConnectingFaceUri() == it2->getConnectingFaceUri()) {
akmhoque53353462014-04-22 08:43:45 -050047 it1->setRouteCost(it2->getRouteCost());
48 nhCount++;
49 }
akmhoque157b0a42014-05-13 00:26:37 -050050 else {
akmhoque53353462014-04-22 08:43:45 -050051 break;
52 }
53 }
akmhoquefdbddb12014-05-02 18:35:19 -050054 return nhCount == m_nexthopList.getSize();
akmhoque53353462014-04-22 08:43:45 -050055 }
56}
57
akmhoque674b0b12014-05-20 14:33:28 -050058void
59FibEntry::writeLog()
60{
61 _LOG_DEBUG("Name Prefix: " << m_name);
akmhoquec7a79b22014-05-26 08:06:19 -050062 _LOG_DEBUG("Time to Refresh: " << m_expirationTimePoint);
akmhoque674b0b12014-05-20 14:33:28 -050063 _LOG_DEBUG("Seq No: " << m_seqNo);
64 m_nexthopList.writeLog();
65}
66
akmhoque53353462014-04-22 08:43:45 -050067ostream&
68operator<<(ostream& os, FibEntry fe)
69{
70 os << "Name Prefix: " << fe.getName() << endl;
akmhoquec7a79b22014-05-26 08:06:19 -050071 os << "Time to Refresh: " << fe.getExpirationTimePoint() << endl;
akmhoquefdbddb12014-05-02 18:35:19 -050072 os << fe.getNexthopList() << endl;
akmhoque53353462014-04-22 08:43:45 -050073 return os;
74}
75
76}//namespace nlsr