mirror of
https://github.com/RetroShare/RetroShare.git
synced 2024-12-11 08:54:34 -05:00
c415bb6158
============================================================ This is intended to be a completely independent library from RS, (hosted at sf.net/projects/bitdht) hence is being commited at the top level. As initial further development / testing will be driven by RS integration it is being added to the RS repository. Equally important is ensuring that RS can compile without requiring aux libraries. Once libbitdht is further developed, this section of the repository is expected to be removed... But that will not be for a while, I expect. drbob. git-svn-id: http://svn.code.sf.net/p/retroshare/code/trunk@3276 b45a01b8-16f6-495d-af2f-9b41ad6348cc
200 lines
4.2 KiB
C++
200 lines
4.2 KiB
C++
/*
|
|
* bitdht/bdstore.cc
|
|
*
|
|
* 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 "bdstore.h"
|
|
|
|
#include <sys/socket.h>
|
|
#include <netinet/in.h>
|
|
#include <arpa/inet.h>
|
|
|
|
#include <stdio.h>
|
|
#include <iostream>
|
|
|
|
//#define DEBUG_STORE 1
|
|
|
|
bdStore::bdStore(std::string file, bdDhtFunctions *fns)
|
|
:mFns(fns)
|
|
{
|
|
#ifdef DEBUG_STORE
|
|
std::cerr << "bdStore::bdStore(" << file << ")";
|
|
std::cerr << std::endl;
|
|
#endif
|
|
|
|
/* read data from file */
|
|
mIndex = 0;
|
|
mStoreFile = file;
|
|
|
|
FILE *fd = fopen(file.c_str(), "r");
|
|
if (!fd)
|
|
{
|
|
fprintf(stderr, "Failed to Open File: %s ... No Peers\n", file.c_str());
|
|
return;
|
|
}
|
|
|
|
|
|
char line[10240];
|
|
char addr_str[10240];
|
|
struct sockaddr_in addr;
|
|
addr.sin_family = PF_INET;
|
|
unsigned short port;
|
|
|
|
while(line == fgets(line, 10240, fd))
|
|
{
|
|
if (2 == sscanf(line, "%s %hd", addr_str, &port))
|
|
{
|
|
if (inet_aton(addr_str, &(addr.sin_addr)))
|
|
{
|
|
addr.sin_port = htons(port);
|
|
bdPeer peer;
|
|
//bdZeroNodeId(&(peer.mPeerId.id));
|
|
peer.mPeerId.addr = addr;
|
|
peer.mLastSendTime = 0;
|
|
peer.mLastRecvTime = 0;
|
|
store.push_back(peer);
|
|
#ifdef DEBUG_STORE
|
|
fprintf(stderr, "Read: %s %d\n", inet_ntoa(addr.sin_addr), ntohs(addr.sin_port));
|
|
#endif
|
|
}
|
|
}
|
|
}
|
|
|
|
fclose(fd);
|
|
|
|
#ifdef DEBUG_STORE
|
|
fprintf(stderr, "Read %ld Peers\n", (long) store.size());
|
|
#endif
|
|
|
|
}
|
|
|
|
int bdStore::getPeer(bdPeer *peer)
|
|
{
|
|
#ifdef DEBUG_STORE
|
|
fprintf(stderr, "bdStore::getPeer() %ld Peers left\n", (long) store.size());
|
|
#endif
|
|
|
|
std::list<bdPeer>::iterator it;
|
|
int i = 0;
|
|
for(it = store.begin(); (it != store.end()) && (i < mIndex); it++, i++);
|
|
if (it != store.end())
|
|
{
|
|
*peer = *it;
|
|
mIndex++;
|
|
return 1;
|
|
}
|
|
return 0;
|
|
}
|
|
|
|
#define MAX_ENTRIES 500
|
|
|
|
/* maintain a sorted list */
|
|
void bdStore::addStore(bdPeer *peer)
|
|
{
|
|
#ifdef DEBUG_STORE
|
|
std::cerr << "bdStore::addStore() ";
|
|
mFns->bdPrintId(std::cerr, &(peer->mPeerId));
|
|
std::cerr << std::endl;
|
|
#endif
|
|
|
|
/* remove old entry */
|
|
bool removed = false;
|
|
|
|
std::list<bdPeer>::iterator it;
|
|
for(it = store.begin(); it != store.end(); )
|
|
{
|
|
if ((it->mPeerId.addr.sin_addr.s_addr == peer->mPeerId.addr.sin_addr.s_addr) &&
|
|
(it->mPeerId.addr.sin_port == peer->mPeerId.addr.sin_port))
|
|
{
|
|
removed = true;
|
|
#ifdef DEBUG_STORE
|
|
std::cerr << "bdStore::addStore() Removed Existing Entry: ";
|
|
mFns->bdPrintId(std::cerr, &(it->mPeerId));
|
|
std::cerr << std::endl;
|
|
#endif
|
|
it = store.erase(it);
|
|
}
|
|
else
|
|
{
|
|
it++;
|
|
}
|
|
}
|
|
|
|
#ifdef DEBUG_STORE
|
|
std::cerr << "bdStore::addStore() Push_back";
|
|
std::cerr << std::endl;
|
|
#endif
|
|
store.push_back(*peer);
|
|
|
|
while(store.size() > MAX_ENTRIES)
|
|
{
|
|
#ifdef DEBUG_STORE
|
|
std::cerr << "bdStore::addStore() pop_front()";
|
|
std::cerr << std::endl;
|
|
#endif
|
|
store.pop_front();
|
|
}
|
|
}
|
|
|
|
void bdStore::writeStore(std::string file)
|
|
{
|
|
/* write out store */
|
|
#ifdef DEBUG_STORE
|
|
fprintf(stderr, "bdStore::writeStore(%s) = %d entries\n", file.c_str(), store.size());
|
|
#endif
|
|
|
|
FILE *fd = fopen(file.c_str(), "w");
|
|
|
|
if (!fd)
|
|
{
|
|
#ifdef DEBUG_STORE
|
|
#endif
|
|
fprintf(stderr, "bdStore::writeStore() FAILED to Open File\n");
|
|
return;
|
|
}
|
|
|
|
std::list<bdPeer>::iterator it;
|
|
for(it = store.begin(); it != store.end(); it++)
|
|
{
|
|
fprintf(fd, "%s %d\n", inet_ntoa(it->mPeerId.addr.sin_addr), ntohs(it->mPeerId.addr.sin_port));
|
|
#ifdef DEBUG_STORE
|
|
fprintf(stderr, "Storing Peer Address: %s %d\n", inet_ntoa(it->mPeerId.addr.sin_addr), ntohs(it->mPeerId.addr.sin_port));
|
|
#endif
|
|
|
|
}
|
|
fclose(fd);
|
|
}
|
|
|
|
void bdStore::writeStore()
|
|
{
|
|
#if 0
|
|
if (mStoreFile == "")
|
|
{
|
|
return;
|
|
}
|
|
#endif
|
|
return writeStore(mStoreFile);
|
|
}
|
|
|