1 /* <!-- copyright */
2 /*
3 * aria2 - The high speed download utility
4 *
5 * Copyright (C) 2006 Tatsuhiro Tsujikawa
6 *
7 * This program is free software; you can redistribute it and/or modify
8 * it under the terms of the GNU General Public License as published by
9 * the Free Software Foundation; either version 2 of the License, or
10 * (at your option) any later version.
11 *
12 * This program is distributed in the hope that it will be useful,
13 * but WITHOUT ANY WARRANTY; without even the implied warranty of
14 * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
15 * GNU General Public License for more details.
16 *
17 * You should have received a copy of the GNU General Public License
18 * along with this program; if not, write to the Free Software
19 * Foundation, Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301 USA
20 *
21 * In addition, as a special exception, the copyright holders give
22 * permission to link the code of portions of this program with the
23 * OpenSSL library under certain conditions as described in each
24 * individual source file, and distribute linked combinations
25 * including the two.
26 * You must obey the GNU General Public License in all respects
27 * for all of the code used other than OpenSSL. If you modify
28 * file(s) with this exception, you may extend this exception to your
29 * version of the file(s), but you are not obligated to do so. If you
30 * do not wish to do so, delete this exception statement from your
31 * version. If you delete this exception statement from all source
32 * files in the program, then also delete it here.
33 */
34 /* copyright --> */
35 #include "DHTPeerAnnounceEntry.h"
36
37 #include <cstring>
38 #include <algorithm>
39
40 #include "Peer.h"
41 #include "wallclock.h"
42
43 namespace aria2 {
44
DHTPeerAnnounceEntry(const unsigned char * infoHash)45 DHTPeerAnnounceEntry::DHTPeerAnnounceEntry(const unsigned char* infoHash)
46 {
47 memcpy(infoHash_, infoHash, DHT_ID_LENGTH);
48 }
49
50 DHTPeerAnnounceEntry::~DHTPeerAnnounceEntry() = default;
51
addPeerAddrEntry(const PeerAddrEntry & entry)52 void DHTPeerAnnounceEntry::addPeerAddrEntry(const PeerAddrEntry& entry)
53 {
54 auto i = std::find(peerAddrEntries_.begin(), peerAddrEntries_.end(), entry);
55 if (i == peerAddrEntries_.end()) {
56 peerAddrEntries_.push_back(entry);
57 }
58 else {
59 (*i).notifyUpdate();
60 }
61 notifyUpdate();
62 }
63
countPeerAddrEntry() const64 size_t DHTPeerAnnounceEntry::countPeerAddrEntry() const
65 {
66 return peerAddrEntries_.size();
67 }
68
removeStalePeerAddrEntry(const std::chrono::seconds & timeout)69 void DHTPeerAnnounceEntry::removeStalePeerAddrEntry(
70 const std::chrono::seconds& timeout)
71 {
72 peerAddrEntries_.erase(
73 std::remove_if(std::begin(peerAddrEntries_), std::end(peerAddrEntries_),
74 [&timeout](const PeerAddrEntry& entry) {
75 return entry.getLastUpdated().difference(
76 global::wallclock()) >= timeout;
77 }),
78 std::end(peerAddrEntries_));
79 }
80
empty() const81 bool DHTPeerAnnounceEntry::empty() const { return peerAddrEntries_.empty(); }
82
getPeers(std::vector<std::shared_ptr<Peer>> & peers) const83 void DHTPeerAnnounceEntry::getPeers(
84 std::vector<std::shared_ptr<Peer>>& peers) const
85 {
86 for (const auto& p : peerAddrEntries_) {
87 peers.push_back(std::make_shared<Peer>(p.getIPAddress(), p.getPort()));
88 }
89 }
90
notifyUpdate()91 void DHTPeerAnnounceEntry::notifyUpdate()
92 {
93 lastUpdated_ = global::wallclock();
94 }
95
96 } // namespace aria2
97