cs-entry.cpp
Go to the documentation of this file.
1 /* -*- Mode:C++; c-file-style:"gnu"; indent-tabs-mode:nil; -*- */
2 /*
3  * Copyright (c) 2014-2022, 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 #include "cs-entry.hpp"
27 
28 namespace nfd::cs {
29 
30 Entry::Entry(shared_ptr<const Data> data, bool isUnsolicited)
31  : m_data(std::move(data))
32  , m_isUnsolicited(isUnsolicited)
33 {
35 }
36 
37 bool
39 {
40  return m_freshUntil >= time::steady_clock::now();
41 }
42 
43 void
45 {
46  m_freshUntil = time::steady_clock::now() + m_data->getFreshnessPeriod();
47 }
48 
49 bool
50 Entry::canSatisfy(const Interest& interest) const
51 {
52  if (!interest.matchesData(*m_data)) {
53  return false;
54  }
55 
56  if (interest.getMustBeFresh() && !this->isFresh()) {
57  return false;
58  }
59 
60  return true;
61 }
62 
63 static int
64 compareQueryWithData(const Name& queryName, const Data& data)
65 {
66  bool queryIsFullName = !queryName.empty() && queryName[-1].isImplicitSha256Digest();
67 
68  int cmp = queryIsFullName ?
69  queryName.compare(0, queryName.size() - 1, data.getName()) :
70  queryName.compare(data.getName());
71 
72  if (cmp != 0) { // Name without digest differs
73  return cmp;
74  }
75 
76  if (queryIsFullName) { // Name without digest equals, compare digest
77  return queryName[-1].compare(data.getFullName()[-1]);
78  }
79  else { // queryName is a proper prefix of Data fullName
80  return -1;
81  }
82 }
83 
84 static int
85 compareDataWithData(const Data& lhs, const Data& rhs)
86 {
87  int cmp = lhs.getName().compare(rhs.getName());
88  if (cmp != 0) {
89  return cmp;
90  }
91 
92  return lhs.getFullName()[-1].compare(rhs.getFullName()[-1]);
93 }
94 
95 bool
96 operator<(const Entry& entry, const Name& queryName)
97 {
98  return compareQueryWithData(queryName, entry.getData()) > 0;
99 }
100 
101 bool
102 operator<(const Name& queryName, const Entry& entry)
103 {
104  return compareQueryWithData(queryName, entry.getData()) < 0;
105 }
106 
107 bool
108 operator<(const Entry& lhs, const Entry& rhs)
109 {
110  return compareDataWithData(lhs.getData(), rhs.getData()) < 0;
111 }
112 
113 } // namespace nfd::cs
A ContentStore entry.
Definition: cs-entry.hpp:38
bool isFresh() const
Check if the stored Data is fresh now.
Definition: cs-entry.cpp:38
Entry(shared_ptr< const Data > data, bool isUnsolicited)
Definition: cs-entry.cpp:30
bool canSatisfy(const Interest &interest) const
Determine whether Interest can be satisified by the stored Data.
Definition: cs-entry.cpp:50
void updateFreshUntil()
Recalculate when the entry would become non-fresh, relative to current time.
Definition: cs-entry.cpp:44
const Data & getData() const
Return the stored Data.
Definition: cs-entry.hpp:43
static int compareQueryWithData(const Name &queryName, const Data &data)
Definition: cs-entry.cpp:64
static int compareDataWithData(const Data &lhs, const Data &rhs)
Definition: cs-entry.cpp:85
bool operator<(const Entry &entry, const Name &queryName)
Definition: cs-entry.cpp:96