mirror of
https://github.com/RetroShare/RetroShare.git
synced 2025-01-08 14:18:12 -05:00
93 lines
2.5 KiB
C
93 lines
2.5 KiB
C
|
#ifndef BITDHT_STANDARD_DHT_H
|
||
|
|
#define BITDHT_STANDARD_DHT_H
|
||
|
|
|
||
|
|
/*
|
||
|
|
* bitdht/bdstddht.h
|
||
|
|
*
|
||
|
|
* BitDHT: An Flexible DHT library.
|
||
|
|
*
|
||
|
|
* Copyright 2010 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".
|
||
|
|
*
|
||
|
|
*/
|
||
|
|
|
||
|
|
|
||
|
|
#include "bdiface.h"
|
||
|
|
|
||
|
|
#define BITDHT_STANDARD_BUCKET_SIZE 20
|
||
|
|
#define BITDHT_STANDARD_BUCKET_SIZE_BITS 5
|
||
|
|
|
||
|
|
#define BITDHT_STANDARD_N_BUCKETS BITDHT_KEY_BITLEN
|
||
|
|
|
||
|
|
#include <sys/types.h>
|
||
|
|
#include <sys/socket.h>
|
||
|
|
#include <netinet/in.h>
|
||
|
|
|
||
|
|
#include <list>
|
||
|
|
#include <string>
|
||
|
|
#include <map>
|
||
|
|
#include <vector>
|
||
|
|
|
||
|
|
|
||
|
|
|
||
|
|
|
||
|
|
void bdStdRandomNodeId(bdNodeId *id);
|
||
|
|
void bdStdZeroNodeId(bdNodeId *id);
|
||
|
|
|
||
|
|
void bdStdRandomId(bdId *id);
|
||
|
|
int bdStdDistance(const bdNodeId *a, const bdNodeId *b, bdMetric *r);
|
||
|
|
int bdStdBucketDistance(const bdMetric *m);
|
||
|
|
int bdStdBucketDistance(const bdNodeId *a, const bdNodeId *b);
|
||
|
|
|
||
|
|
void bdStdRandomMidId(const bdNodeId *target, const bdNodeId *other, bdNodeId *mid);
|
||
|
|
|
||
|
|
void bdStdPrintId(std::ostream &out, const bdId *a);
|
||
|
|
void bdStdPrintNodeId(std::ostream &out, const bdNodeId *a);
|
||
|
|
|
||
|
|
std::string bdStdConvertToPrintable(std::string input);
|
||
|
|
|
||
|
|
uint32_t bdStdLikelySameNode(const bdId*, const bdId*);
|
||
|
|
|
||
|
|
|
||
|
|
class bdStdDht: public bdDhtFunctions
|
||
|
|
{
|
||
|
|
public:
|
||
|
|
|
||
|
|
bdStdDht();
|
||
|
|
/* setup variables */
|
||
|
|
virtual uint16_t bdNumBuckets();
|
||
|
|
virtual uint16_t bdNodesPerBucket(); /* used for query + bdspace */
|
||
|
|
virtual uint16_t bdBucketBitSize();
|
||
|
|
|
||
|
|
virtual int bdDistance(const bdNodeId *n1, const bdNodeId *n2, bdMetric *metric);
|
||
|
|
virtual int bdBucketDistance(const bdNodeId *n1, const bdNodeId *n2);
|
||
|
|
virtual int bdBucketDistance(const bdMetric *metric);
|
||
|
|
|
||
|
|
virtual uint32_t bdLikelySameNode(const bdId *id1, const bdId *id2);
|
||
|
|
|
||
|
|
virtual void bdRandomMidId(const bdNodeId *target, const bdNodeId *other, bdNodeId *mid);
|
||
|
|
|
||
|
|
virtual void bdPrintId(std::ostream &out, const bdId *a);
|
||
|
|
virtual void bdPrintNodeId(std::ostream &out, const bdNodeId *a);
|
||
|
|
|
||
|
|
};
|
||
|
|
|
||
|
|
|
||
|
|
#endif
|
||
|
|
|