mirror of
https://github.com/RetroShare/RetroShare.git
synced 2024-10-01 02:35:48 -04:00
142 lines
4.6 KiB
C
142 lines
4.6 KiB
C
|
/*
|
||
|
* libretroshare/src/services: p3turtle.h
|
||
|
*
|
||
|
* Services for RetroShare.
|
||
|
*
|
||
|
* Copyright 2004-2008 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 2 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 "retroshare@lunamutt.com".
|
||
|
*
|
||
|
*/
|
||
|
|
||
|
// This class implements the turtle hopping router. It basically serves as
|
||
|
// - a cache of turtle tunnels which are the communicating ways between distant peers.
|
||
|
// - turtle tunnels are either end-point tunnels, or transitory points, in which case items are just
|
||
|
// re-serialized and passed on along the tunnel.
|
||
|
// - turtle tunnels are dug on request when calling diggTurtleTunnel(const std::string& hash)
|
||
|
// this command lets a trace in each peer along the tunnel of where
|
||
|
// packets come from and where they should go. Doing so, once a tunnel is
|
||
|
// dug, packets are directly forwarded to the correct peer.
|
||
|
// - an entry point for search request from the interface
|
||
|
// - search results, as they come back, are forwarded upwards with some additional info:
|
||
|
// - depth // depth of the file. This is here for debug bug will disapear for anonymity.
|
||
|
// - peer id // peer id owning the file. This is here for debug bug will disapear for anonymity.
|
||
|
// - hash // hash of the file found
|
||
|
// - name // name of the file found
|
||
|
// - search request id. //
|
||
|
//
|
||
|
#ifndef MRK_PQI_TURTLE_H
|
||
|
#define MRK_PQI_TURTLE_H
|
||
|
|
||
|
#include <string>
|
||
|
#include <list>
|
||
|
|
||
|
// system specific network headers
|
||
|
#include "pqi/pqinetwork.h"
|
||
|
#include "pqi/pqi.h"
|
||
|
#include "pqi/pqimonitor.h"
|
||
|
#include "serialiser/rsdiscitems.h"
|
||
|
#include "services/p3service.h"
|
||
|
|
||
|
class p3AuthMgr;
|
||
|
class p3ConnectMgr;
|
||
|
|
||
|
typedef uint32_t TurtleRequestId ;
|
||
|
typedef std::string TurtlePeerId ;
|
||
|
|
||
|
class RsTurtleItem: public RsItem
|
||
|
{
|
||
|
public:
|
||
|
virtual void serialize(void *& data,uint32_t& size) {} // isn't it better that items can (de)serialize themselves ?
|
||
|
virtual void deserialize(const void *data,uint32_t size) {}
|
||
|
|
||
|
virtual int size() const ;
|
||
|
};
|
||
|
|
||
|
class RsTurtleSearchResultItem: public RsTurtleItem
|
||
|
{
|
||
|
public:
|
||
|
uint16_t depth ;
|
||
|
uint8_t peer_id[16]; // peer id. This will eventually be obfuscated in some way.
|
||
|
|
||
|
TurtleRequestId request_id ; // randomly generated request id.
|
||
|
|
||
|
std::map<FileHash,FileName> result ;
|
||
|
// uint8_t hash[20] ; // sha1 hash of the file found
|
||
|
// std::string filename ; // name of the file found
|
||
|
};
|
||
|
|
||
|
class RsTurtleSearchRequestItem: public RsTurtleItem
|
||
|
{
|
||
|
public:
|
||
|
std::string match_string ; // string to match
|
||
|
uint32_t request_id ; // randomly generated request id.
|
||
|
uint16_t depth ; // Used for limiting search depth.
|
||
|
};
|
||
|
|
||
|
class TurtleTunnel
|
||
|
{
|
||
|
public:
|
||
|
TurtlePeerId in ; // where packets come from
|
||
|
TurtlePeerId out ; // where packets should go
|
||
|
uint32_t time_stamp ; // last time the tunnel was actually used. Used for cleaning old tunnels.
|
||
|
};
|
||
|
|
||
|
class p3turtle: public p3Service, public pqiMonitor
|
||
|
{
|
||
|
public:
|
||
|
p3turtle(p3AuthMgr *am, p3ConnectMgr *cm);
|
||
|
|
||
|
// Lauches a search request through the pipes, and immediately returns
|
||
|
// the request id, which will be further used by the gui to store results
|
||
|
// as they come back.
|
||
|
//
|
||
|
TurtleRequestId performSearch(const std::string& string_to_match) ;
|
||
|
|
||
|
/************* from pqiMonitor *******************/
|
||
|
// Informs the turtle router that some peers are (dis)connected. This should initiate digging new tunnels,
|
||
|
// and closing other tunnels.
|
||
|
//
|
||
|
virtual void statusChange(const std::list<pqipeer> &plist);
|
||
|
|
||
|
/************* from pqiMonitor *******************/
|
||
|
|
||
|
// Handles incoming and outgoing packets, sort search requests and
|
||
|
// forward info upward.
|
||
|
int tick();
|
||
|
|
||
|
private:
|
||
|
inline uint32_t generateRandomRequestId() const { return lrand48() ; }
|
||
|
|
||
|
/* Network Input */
|
||
|
int handleIncoming();
|
||
|
|
||
|
void recvSearchRequest(RsTurtleSearchRequestItem *item);
|
||
|
|
||
|
std::map<TurtleRequestId,TurtlePeerId> request_origins ; // keeps trace of who emmitted a given request
|
||
|
std::map<FileHash,TurtleTunnel> file_tunnels ; // stores adequate tunnels for each file hash.
|
||
|
|
||
|
p3AuthMgr *mAuthMgr;
|
||
|
p3ConnectMgr *mConnMgr;
|
||
|
|
||
|
/* data */
|
||
|
RsMutex mTurtleMtx;
|
||
|
};
|
||
|
|
||
|
#endif
|
||
|
|