blob: 6f3ad083df032e1ef35c876c36870f37e002bcce [file] [log] [blame]
Junxiao Shi99540072017-01-27 19:57:33 +00001/* -*- Mode:C++; c-file-style:"gnu"; indent-tabs-mode:nil; -*- */
Junxiao Shif940ae72017-09-11 03:24:29 +00002/*
ashiqopud3ae85d2019-02-17 02:29:55 +00003 * Copyright (c) 2014-2019, Regents of the University of California,
Junxiao Shi99540072017-01-27 19:57:33 +00004 * 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#include "process-nack-traits.hpp"
Davide Pesavento2cae8ca2019-04-18 20:48:05 -040027#include "common/logger.hpp"
Junxiao Shi99540072017-01-27 19:57:33 +000028
29namespace nfd {
30namespace fw {
31
Davide Pesaventoa3148082018-04-12 18:21:54 -040032NFD_LOG_INIT(ProcessNackTraits);
Junxiao Shi99540072017-01-27 19:57:33 +000033
Junxiao Shi99540072017-01-27 19:57:33 +000034void
35ProcessNackTraitsBase::processNack(const Face& inFace, const lp::Nack& nack,
36 const shared_ptr<pit::Entry>& pitEntry)
37{
38 int nOutRecordsNotNacked = 0;
39 Face* lastFaceNotNacked = nullptr;
40 lp::NackReason leastSevereReason = lp::NackReason::NONE;
41 for (const pit::OutRecord& outR : pitEntry->getOutRecords()) {
42 const lp::NackHeader* inNack = outR.getIncomingNack();
43 if (inNack == nullptr) {
44 ++nOutRecordsNotNacked;
45 lastFaceNotNacked = &outR.getFace();
46 continue;
47 }
48
49 if (isLessSevere(inNack->getReason(), leastSevereReason)) {
50 leastSevereReason = inNack->getReason();
51 }
52 }
53
54 lp::NackHeader outNack;
55 outNack.setReason(leastSevereReason);
56
57 if (nOutRecordsNotNacked == 1) {
58 BOOST_ASSERT(lastFaceNotNacked != nullptr);
ashiqopud3ae85d2019-02-17 02:29:55 +000059 pit::InRecordCollection::iterator inR = pitEntry->getInRecord(*lastFaceNotNacked, 0);
Junxiao Shi99540072017-01-27 19:57:33 +000060 if (inR != pitEntry->in_end()) {
61 // one out-record not Nacked, which is also a downstream
62 NFD_LOG_DEBUG(nack.getInterest() << " nack-from=" << inFace.getId() <<
63 " nack=" << nack.getReason() <<
64 " nack-to(bidirectional)=" << lastFaceNotNacked->getId() <<
65 " out-nack=" << outNack.getReason());
66 this->sendNackForProcessNackTraits(pitEntry, *lastFaceNotNacked, outNack);
67 return;
68 }
69 }
70
71 if (nOutRecordsNotNacked > 0) {
72 NFD_LOG_DEBUG(nack.getInterest() << " nack-from=" << inFace.getId() <<
73 " nack=" << nack.getReason() <<
74 " waiting=" << nOutRecordsNotNacked);
75 // continue waiting
76 return;
77 }
78
79 NFD_LOG_DEBUG(nack.getInterest() << " nack-from=" << inFace.getId() <<
80 " nack=" << nack.getReason() <<
81 " nack-to=all out-nack=" << outNack.getReason());
82 this->sendNacksForProcessNackTraits(pitEntry, outNack);
83}
84
85} // namespace fw
86} // namespace nfd