/usr/include/libktorrent/dht/node.h is in libktorrent-dev 1.3.1-5.
This file is owned by root:root, with mode 0o644.
The actual contents of the file can be viewed below.
1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 59 60 61 62 63 64 65 66 67 68 69 70 71 72 73 74 75 76 77 78 79 80 81 82 83 84 85 86 87 88 89 90 91 92 93 94 95 96 97 98 99 100 101 102 103 | /***************************************************************************
* Copyright (C) 2005 by Joris Guisson *
* joris.guisson@gmail.com *
* *
* This program is free software; you can redistribute it and/or modify *
* it under the terms of the GNU General Public License as published by *
* the Free Software Foundation; either version 2 of the License, or *
* (at your option) any later version. *
* *
* This program is distributed in the hope that it will be useful, *
* but WITHOUT ANY WARRANTY; without even the implied warranty of *
* MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the *
* GNU General Public License for more details. *
* *
* You should have received a copy of the GNU General Public License *
* along with this program; if not, write to the *
* Free Software Foundation, Inc., *
* 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301, USA. *
***************************************************************************/
#ifndef DHTNODE_H
#define DHTNODE_H
#include <qobject.h>
#include "key.h"
#include "kbucket.h"
using bt::Uint8;
namespace dht
{
class DHT;
class RPCMsg;
class RPCServer;
class KClosestNodesSearch;
const bt::Uint32 WANT_IPV4 = 1;
const bt::Uint32 WANT_IPV6 = 2;
const bt::Uint32 WANT_BOTH = WANT_IPV4 | WANT_IPV6;
/**
* @author Joris Guisson
*
* A Node represents us in the kademlia network. It contains
* our id and 160 KBucket's.
* A KBucketEntry is in node i, when the difference between our id and
* the KBucketEntry's id is between 2 to the power i and 2 to the power i+1.
*/
class Node : public QObject
{
Q_OBJECT
public:
Node(RPCServer* srv, const QString & key_file);
virtual ~Node();
/**
* An RPC message was received, the node must now update
* the right bucket.
* @param dh_table The DHT
* @param msg The message
* @param srv The RPCServer to send a ping if necessary
*/
void received(DHT* dh_table, const RPCMsg & msg);
/// Get our own ID
const dht::Key & getOurID() const {return our_id;}
/**
* Find the K closest entries to a key and store them in the KClosestNodesSearch
* object.
* @param kns The object to storre the search results
* @param want Which protocol(s) are wanted
*/
void findKClosestNodes(KClosestNodesSearch & kns, bt::Uint32 want);
/**
* Increase the failed queries count of the bucket entry we sent the message to
*/
void onTimeout(RPCMsg::Ptr msg);
/// Check if a buckets needs to be refreshed, and refresh if necesarry
void refreshBuckets(DHT* dh_table);
/// Save the routing table to a file
void saveTable(const QString & file);
/// Load the routing table from a file
void loadTable(const QString & file);
/// Get the number of entries in the routing table
bt::Uint32 getNumEntriesInRoutingTable() const {return num_entries;}
private:
class Private;
Private* d;
dht::Key our_id;
bt::Uint32 num_entries;
};
}
#endif
|