mirror of
https://github.com/RetroShare/RetroShare.git
synced 2024-12-11 08:54:34 -05:00
90 lines
2.2 KiB
C
90 lines
2.2 KiB
C
|
#ifndef BITDHT_FRIEND_LIST_H
|
||
|
|
#define BITDHT_FRIEND_LIST_H
|
||
|
|
|
||
|
|
/*
|
||
|
|
* bitdht/bdfriendlist.h
|
||
|
|
*
|
||
|
|
* BitDHT: An Flexible DHT library.
|
||
|
|
*
|
||
|
|
* Copyright 2011 by Robert Fernie
|
||
|
|
*
|
||
|
|
* This library is free software; you can redistribute it and/or
|
||
|
|
* modify it under the terms of the GNU Library General Public
|
||
|
|
* License Version 3 as published by the Free Software Foundation.
|
||
|
|
*
|
||
|
|
* This library 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
|
||
|
|
* Library General Public License for more details.
|
||
|
|
*
|
||
|
|
* You should have received a copy of the GNU Library General Public
|
||
|
|
* License along with this library; if not, write to the Free Software
|
||
|
|
* Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA 02111-1307
|
||
|
|
* USA.
|
||
|
|
*
|
||
|
|
* Please report all bugs and problems to "bitdht@lunamutt.com".
|
||
|
|
*
|
||
|
|
*/
|
||
|
|
|
||
|
|
/*
|
||
|
|
* This class maintains a list of current friends and friends-of-friends.
|
||
|
|
* It should also be updated when a peer's address has been identified.
|
||
|
|
*
|
||
|
|
* It is used for selecting preferential peers for DHT Connections.
|
||
|
|
* and for detecting bad peers that are duplicating real RS peers.
|
||
|
|
*
|
||
|
|
*/
|
||
|
|
|
||
|
|
|
||
|
|
#include "bitdht/bdiface.h"
|
||
|
|
#include <set>
|
||
|
|
|
||
|
|
#define BD_FRIEND_ENTRY_TIMEOUT 10
|
||
|
|
|
||
|
|
|
||
|
|
//#define BD_FRIEND_ENTRY_ONLINE 0x0001
|
||
|
|
//#define BD_FRIEND_ENTRY_ADDR_OK 0x0002
|
||
|
|
|
||
|
|
//#define BD_FRIEND_ENTRY_WHITELIST BITDHT_PEER_STATUS_DHT_WHITELIST
|
||
|
|
//#define BD_FRIEND_ENTRY_FOF BITDHT_PEER_STATUS_DHT_FOF
|
||
|
|
//#define BD_FRIEND_ENTRY_FRIEND BITDHT_PEER_STATUS_DHT_FRIEND
|
||
|
|
//#define BD_FRIEND_ENTRY_RELAY_SERVER BITDHT_PEER_STATUS_DHT_RELAY_SERVER
|
||
|
|
|
||
|
|
//#define BD_FRIEND_ENTRY_SELF BITDHT_PEER_STATUS_DHT_SELF
|
||
|
|
|
||
|
|
//#define BD_FRIEND_ENTRY_MASK_KNOWN BITDHT_PEER_STATUS_MASK_KNOWN
|
||
|
|
|
||
|
|
class bdFriendEntry
|
||
|
|
{
|
||
|
|
public:
|
||
|
|
bdFriendEntry();
|
||
|
|
|
||
|
|
bool addrKnown(struct sockaddr_in *addr);
|
||
|
|
uint32_t getPeerFlags();
|
||
|
|
|
||
|
|
bdId mPeerId;
|
||
|
|
uint32_t mFlags;
|
||
|
|
time_t mLastSeen;
|
||
|
|
};
|
||
|
|
|
||
|
|
class bdFriendList
|
||
|
|
{
|
||
|
|
|
||
|
|
public:
|
||
|
|
bdFriendList(const bdNodeId *ownid);
|
||
|
|
|
||
|
|
bool updatePeer(const bdId *id, uint32_t flags);
|
||
|
|
bool removePeer(const bdNodeId *id);
|
||
|
|
|
||
|
|
bool findPeerEntry(const bdNodeId *id, bdFriendEntry &entry);
|
||
|
|
|
||
|
|
bool print(std::ostream &out);
|
||
|
|
private:
|
||
|
|
|
||
|
|
std::map<bdNodeId, bdFriendEntry> mPeers;
|
||
|
|
};
|
||
|
|
|
||
|
|
|
||
|
|
#endif
|
||
|
|
|