Junxiao Shi | 9954007 | 2017-01-27 19:57:33 +0000 | [diff] [blame] | 1 | /* -*- Mode:C++; c-file-style:"gnu"; indent-tabs-mode:nil; -*- */ |
| 2 | /** |
| 3 | * Copyright (c) 2014-2017, 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_FW_PROCESS_NACK_TRAITS_HPP |
| 27 | #define NFD_DAEMON_FW_PROCESS_NACK_TRAITS_HPP |
| 28 | |
| 29 | #include "strategy.hpp" |
| 30 | |
| 31 | namespace nfd { |
| 32 | namespace fw { |
| 33 | |
| 34 | /** \brief provides a common procedure for processing Nacks |
| 35 | * |
| 36 | * This procedure works as follows: |
| 37 | * 1. If Nacks have been received from all upstream faces, return a Nack with least severe reason |
| 38 | * to downstream faces. |
| 39 | * 2. If there are more than one upstream face, Nacks have been received from all but one of |
| 40 | * them, and that face is also a downstream, return a Nack to that face. This is to address a |
| 41 | * specific "live deadlock" scenario where two hosts are waiting for each other to return the |
| 42 | * Nack. |
| 43 | * 3. Otherwise, wait for the arrival of more Nacks or Data. |
| 44 | * |
| 45 | * To use this helper, the strategy should inherit from ProcessNackTraits<MyStrategy>, |
| 46 | * and declare that specialization as a friend class. |
| 47 | * Then, invoke processNack from afterReceiveNack trigger. |
| 48 | */ |
| 49 | class ProcessNackTraitsBase : noncopyable |
| 50 | { |
| 51 | protected: |
| 52 | virtual |
| 53 | ~ProcessNackTraitsBase() = default; |
| 54 | |
| 55 | void |
| 56 | processNack(const Face& inFace, const lp::Nack& nack, |
| 57 | const shared_ptr<pit::Entry>& pitEntry); |
| 58 | |
| 59 | private: |
| 60 | virtual void |
| 61 | sendNackForProcessNackTraits(const shared_ptr<pit::Entry>& pitEntry, const Face& outFace, |
| 62 | const lp::NackHeader& header) = 0; |
| 63 | |
| 64 | virtual void |
| 65 | sendNacksForProcessNackTraits(const shared_ptr<pit::Entry>& pitEntry, |
| 66 | const lp::NackHeader& header) = 0; |
| 67 | }; |
| 68 | |
| 69 | template<typename S> |
| 70 | class ProcessNackTraits : public ProcessNackTraitsBase |
| 71 | { |
| 72 | protected: |
| 73 | explicit |
| 74 | ProcessNackTraits(S* strategy) |
| 75 | : m_strategy(strategy) |
| 76 | { |
| 77 | } |
| 78 | |
| 79 | private: |
| 80 | void |
| 81 | sendNackForProcessNackTraits(const shared_ptr<pit::Entry>& pitEntry, const Face& outFace, |
| 82 | const lp::NackHeader& header) override |
| 83 | { |
| 84 | m_strategy->sendNack(pitEntry, outFace, header); |
| 85 | } |
| 86 | |
| 87 | void |
| 88 | sendNacksForProcessNackTraits(const shared_ptr<pit::Entry>& pitEntry, |
| 89 | const lp::NackHeader& header) override |
| 90 | { |
| 91 | m_strategy->sendNacks(pitEntry, header); |
| 92 | } |
| 93 | |
| 94 | private: |
| 95 | S* m_strategy; |
| 96 | }; |
| 97 | |
| 98 | } // namespace fw |
| 99 | } // namespace nfd |
| 100 | |
| 101 | #endif // NFD_DAEMON_FW_PROCESS_NACK_TRAITS_HPP |