mirror of
https://github.com/RetroShare/RetroShare.git
synced 2024-10-01 02:35:48 -04:00
39708cdd0b
git-svn-id: http://svn.code.sf.net/p/retroshare/code/trunk@4566 b45a01b8-16f6-495d-af2f-9b41ad6348cc
222 lines
6.3 KiB
C++
222 lines
6.3 KiB
C++
#include <iostream>
|
|
#include <QTimer>
|
|
#include <QObject>
|
|
#include <retroshare/rsturtle.h>
|
|
#include <retroshare/rspeers.h>
|
|
#include "TurtleRouterDialog.h"
|
|
#include <QPainter>
|
|
#include <QStylePainter>
|
|
|
|
#include "gui/settings/rsharesettings.h"
|
|
|
|
static const uint MAX_TUNNEL_REQUESTS_DISPLAY = 10 ;
|
|
|
|
|
|
TurtleRouterDialog::TurtleRouterDialog(QWidget *parent)
|
|
: RsAutoUpdatePage(2000,parent)
|
|
{
|
|
setupUi(this) ;
|
|
|
|
m_bProcessSettings = false;
|
|
|
|
// Init the basic setup.
|
|
//
|
|
QStringList stl ;
|
|
int n=0 ;
|
|
|
|
stl.clear() ;
|
|
stl.push_back(tr("Search requests")) ;
|
|
top_level_s_requests = new QTreeWidgetItem(_f2f_TW,stl) ;
|
|
_f2f_TW->insertTopLevelItem(n++,top_level_s_requests) ;
|
|
|
|
stl.clear() ;
|
|
stl.push_back(tr("Tunnel requests")) ;
|
|
top_level_t_requests = new QTreeWidgetItem(_f2f_TW,stl) ;
|
|
_f2f_TW->insertTopLevelItem(n++,top_level_t_requests) ;
|
|
|
|
top_level_hashes.clear() ;
|
|
|
|
// load settings
|
|
processSettings(true);
|
|
}
|
|
|
|
TurtleRouterDialog::~TurtleRouterDialog()
|
|
{
|
|
|
|
// save settings
|
|
processSettings(false);
|
|
}
|
|
|
|
void TurtleRouterDialog::processSettings(bool bLoad)
|
|
{
|
|
m_bProcessSettings = true;
|
|
|
|
Settings->beginGroup(QString("TurtleRouterDialog"));
|
|
|
|
if (bLoad) {
|
|
// load settings
|
|
|
|
// state of splitter
|
|
//splitter->restoreState(Settings->value("Splitter").toByteArray());
|
|
} else {
|
|
// save settings
|
|
|
|
// state of splitter
|
|
//Settings->setValue("Splitter", splitter->saveState());
|
|
|
|
}
|
|
|
|
Settings->endGroup();
|
|
|
|
m_bProcessSettings = false;
|
|
|
|
}
|
|
|
|
|
|
void TurtleRouterDialog::updateDisplay()
|
|
{
|
|
std::vector<std::vector<std::string> > hashes_info ;
|
|
std::vector<std::vector<std::string> > tunnels_info ;
|
|
std::vector<TurtleRequestDisplayInfo > search_reqs_info ;
|
|
std::vector<TurtleRequestDisplayInfo > tunnel_reqs_info ;
|
|
|
|
rsTurtle->getInfo(hashes_info,tunnels_info,search_reqs_info,tunnel_reqs_info) ;
|
|
|
|
updateTunnelRequests(hashes_info,tunnels_info,search_reqs_info,tunnel_reqs_info) ;
|
|
|
|
}
|
|
|
|
QString TurtleRouterDialog::getPeerName(const std::string& peer_id)
|
|
{
|
|
static std::map<std::string, QString> names ;
|
|
|
|
std::map<std::string,QString>::const_iterator it = names.find(peer_id) ;
|
|
|
|
if( it != names.end())
|
|
return it->second ;
|
|
else
|
|
{
|
|
RsPeerDetails detail ;
|
|
if(!rsPeers->getPeerDetails(peer_id,detail))
|
|
return "unknown peer";
|
|
|
|
return (names[peer_id] = QString::fromUtf8(detail.name.c_str())) ;
|
|
}
|
|
}
|
|
|
|
void TurtleRouterDialog::updateTunnelRequests( const std::vector<std::vector<std::string> >& hashes_info,
|
|
const std::vector<std::vector<std::string> >& tunnels_info,
|
|
const std::vector<TurtleRequestDisplayInfo >& search_reqs_info,
|
|
const std::vector<TurtleRequestDisplayInfo >& tunnel_reqs_info)
|
|
{
|
|
// now display this in the QTableWidgets
|
|
|
|
QStringList stl ;
|
|
|
|
// remove all children of top level objects
|
|
for(int i=0;i<_f2f_TW->topLevelItemCount();++i)
|
|
{
|
|
QTreeWidgetItem *taken ;
|
|
while( (taken = _f2f_TW->topLevelItem(i)->takeChild(0)) != NULL)
|
|
delete taken ;
|
|
}
|
|
|
|
for(uint i=0;i<hashes_info.size();++i)
|
|
findParentHashItem(hashes_info[i][0]) ;
|
|
|
|
bool unknown_hash_found = false ;
|
|
|
|
// check that an entry exist for all hashes
|
|
for(uint i=0;i<tunnels_info.size();++i)
|
|
{
|
|
const std::string& hash(tunnels_info[i][3]) ;
|
|
|
|
QTreeWidgetItem *parent = findParentHashItem(hash) ;
|
|
|
|
if(parent->text(0).left(14) == QString("Unknown hashes"))
|
|
unknown_hash_found = true ;
|
|
|
|
QString str = "Tunnel id: " + QString::fromUtf8(tunnels_info[i][0].c_str()) + "\t [" + QString::fromUtf8(tunnels_info[i][2].c_str()) + "] --> [" + QString::fromUtf8(tunnels_info[i][1].c_str()) + "]\t\t last transfer: " + QString::fromStdString(tunnels_info[i][4]) + "\t Speed: " + QString::fromStdString(tunnels_info[i][5]) ;
|
|
stl.clear() ;
|
|
stl.push_back(str) ;
|
|
|
|
parent->addChild(new QTreeWidgetItem(stl)) ;
|
|
}
|
|
|
|
for(uint i=0;i<search_reqs_info.size();++i)
|
|
{
|
|
QString str = "Request id: " + QString::number(search_reqs_info[i].request_id,16) + "\t from [" + getPeerName(search_reqs_info[i].source_peer_id) + "]\t " + QString::number(search_reqs_info[i].age)+" secs ago" ;
|
|
|
|
stl.clear() ;
|
|
stl.push_back(str) ;
|
|
|
|
top_level_s_requests->addChild(new QTreeWidgetItem(stl)) ;
|
|
}
|
|
top_level_s_requests->setText(0, tr("Search requests") + "(" + QString::number(search_reqs_info.size()) + ")" ) ;
|
|
|
|
for(uint i=0;i<tunnel_reqs_info.size();++i)
|
|
if(i+MAX_TUNNEL_REQUESTS_DISPLAY >= tunnel_reqs_info.size() || i < MAX_TUNNEL_REQUESTS_DISPLAY)
|
|
{
|
|
QString str = "Request id: " + QString::number(tunnel_reqs_info[i].request_id,16) + "\t from [" + getPeerName(tunnel_reqs_info[i].source_peer_id) + "]\t " + QString::number(tunnel_reqs_info[i].age)+" secs ago" ;
|
|
|
|
stl.clear() ;
|
|
stl.push_back(str) ;
|
|
|
|
top_level_t_requests->addChild(new QTreeWidgetItem(stl)) ;
|
|
}
|
|
else if(i == MAX_TUNNEL_REQUESTS_DISPLAY)
|
|
{
|
|
stl.clear() ;
|
|
stl.push_back(QString("...")) ;
|
|
top_level_t_requests->addChild(new QTreeWidgetItem(stl)) ;
|
|
|
|
}
|
|
|
|
top_level_t_requests->setText(0, tr("Tunnel requests") + "("+QString::number(tunnel_reqs_info.size()) + ")") ;
|
|
|
|
QTreeWidgetItem *unknown_hashs_item = findParentHashItem("") ;
|
|
unknown_hashs_item->setText(0,QString("Unknown hashes (") + QString::number(unknown_hashs_item->childCount())+QString(")")) ;
|
|
|
|
// Ok, this is a N2 search, but there are very few elements in the list.
|
|
for(int i=2;i<_f2f_TW->topLevelItemCount();)
|
|
{
|
|
bool found = false ;
|
|
|
|
if(_f2f_TW->topLevelItem(i)->text(0).left(14) == "Unknown hashes" && unknown_hash_found)
|
|
found = true ;
|
|
|
|
if(_f2f_TW->topLevelItem(i)->childCount() > 0) // this saves uploading hashes
|
|
found = true ;
|
|
|
|
for(uint j=0;j<hashes_info.size() && !found;++j)
|
|
if(_f2f_TW->topLevelItem(i)->text(0).toStdString() == hashes_info[j][0])
|
|
found=true ;
|
|
|
|
if(!found)
|
|
delete _f2f_TW->takeTopLevelItem(i) ;
|
|
else
|
|
++i ;
|
|
}
|
|
}
|
|
|
|
QTreeWidgetItem *TurtleRouterDialog::findParentHashItem(const std::string& hash)
|
|
{
|
|
// look for the hash, and insert a new element if necessary.
|
|
//
|
|
QList<QTreeWidgetItem*> items = _f2f_TW->findItems((hash=="")?QString("Unknown hashes"):QString::fromStdString(hash),Qt::MatchStartsWith) ;
|
|
|
|
if(items.empty())
|
|
{
|
|
QStringList stl ;
|
|
stl.push_back((hash=="")?QString("Unknown hashes"):QString::fromStdString(hash)) ;
|
|
QTreeWidgetItem *item = new QTreeWidgetItem(_f2f_TW,stl) ;
|
|
_f2f_TW->insertTopLevelItem(0,item) ;
|
|
|
|
return item ;
|
|
}
|
|
else
|
|
return items.front() ;
|
|
}
|
|
|
|
|