-
Notifications
You must be signed in to change notification settings - Fork 0
/
Copy pathtracker_stats.cpp
959 lines (744 loc) · 33.9 KB
/
tracker_stats.cpp
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
251
252
253
254
255
256
257
258
259
260
261
262
263
264
265
266
267
268
269
270
271
272
273
274
275
276
277
278
279
280
281
282
283
284
285
286
287
288
289
290
291
292
293
294
295
296
297
298
299
300
301
302
303
304
305
306
307
308
309
310
311
312
313
314
315
316
317
318
319
320
321
322
323
324
325
326
327
328
329
330
331
332
333
334
335
336
337
338
339
340
341
342
343
344
345
346
347
348
349
350
351
352
353
354
355
356
357
358
359
360
361
362
363
364
365
366
367
368
369
370
371
372
373
374
375
376
377
378
379
380
381
382
383
384
385
386
387
388
389
390
391
392
393
394
395
396
397
398
399
400
401
402
403
404
405
406
407
408
409
410
411
412
413
414
415
416
417
418
419
420
421
422
423
424
425
426
427
428
429
430
431
432
433
434
435
436
437
438
439
440
441
442
443
444
445
446
447
448
449
450
451
452
453
454
455
456
457
458
459
460
461
462
463
464
465
466
467
468
469
470
471
472
473
474
475
476
477
478
479
480
481
482
483
484
485
486
487
488
489
490
491
492
493
494
495
496
497
498
499
500
501
502
503
504
505
506
507
508
509
510
511
512
513
514
515
516
517
518
519
520
521
522
523
524
525
526
527
528
529
530
531
532
533
534
535
536
537
538
539
540
541
542
543
544
545
546
547
548
549
550
551
552
553
554
555
556
557
558
559
560
561
562
563
564
565
566
567
568
569
570
571
572
573
574
575
576
577
578
579
580
581
582
583
584
585
586
587
588
589
590
591
592
593
594
595
596
597
598
599
600
601
602
603
604
605
606
607
608
609
610
611
612
613
614
615
616
617
618
619
620
621
622
623
624
625
626
627
628
629
630
631
632
633
634
635
636
637
638
639
640
641
642
643
644
645
646
647
648
649
650
651
652
653
654
655
656
657
658
659
660
661
662
663
664
665
666
667
668
669
670
671
672
673
674
675
676
677
678
679
680
681
682
683
684
685
686
687
688
689
690
691
692
693
694
695
696
697
698
699
700
701
702
703
704
705
706
707
708
709
710
711
712
713
714
715
716
717
718
719
720
721
722
723
724
725
726
727
728
729
730
731
732
733
734
735
736
737
738
739
740
741
742
743
744
745
746
747
748
749
750
751
752
753
754
755
756
757
758
759
760
761
762
763
764
765
766
767
768
769
770
771
772
773
774
775
776
777
778
779
780
781
782
783
784
785
786
787
788
789
790
791
792
793
794
795
796
797
798
799
800
801
802
803
804
805
806
807
808
809
810
811
812
813
814
815
816
817
818
819
820
821
822
823
824
825
826
827
828
829
830
831
832
833
834
835
836
837
838
839
840
841
842
843
844
845
846
847
848
849
850
851
852
853
854
855
856
857
858
859
860
861
862
863
864
865
866
867
868
869
870
871
872
873
874
875
876
877
878
879
880
881
882
883
884
885
886
887
888
889
890
891
892
893
894
895
896
897
898
899
900
901
902
903
904
905
906
907
908
909
910
911
912
913
914
915
916
917
918
919
920
921
922
923
924
925
926
927
928
929
930
931
932
933
934
935
936
937
938
939
940
941
942
943
944
945
946
947
948
949
950
951
952
953
954
955
956
957
958
959
/***
*
* BNBT Beta 8.0 - A C++ BitTorrent Tracker
* Copyright (C) 2003-2004 Trevor Hogan
*
* CBTT variations (C) 2003-2005 Harold Feit
*
* This library is free software; you can redistribute it and/or
* modify it under the terms of the GNU Lesser General Public
* License as published by the Free Software Foundation; either
* version 2.1 of the License, or (at your option) any later version.
*
* 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
* Lesser General Public License for more details.
*
* You should have received a copy of the GNU Lesser 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
*
***/
#include "bnbt.h"
#include "atom.h"
#include "bencode.h"
#include "sort.h"
#include "tracker.h"
#include "util.h"
void CTracker :: serverResponseStats( struct request_t *pRequest, struct response_t *pResponse, user_t user )
{
struct bnbttv btv = UTIL_CurrentTime( );
if( !m_bShowStats )
{
pResponse->strCode = "403 Forbidden";
return;
}
pResponse->strCode = "200 OK";
pResponse->mapHeaders.insert( pair<string, string>( "Content-Type", string( "text/html; charset=" ) + gstrCharSet ) );
pResponse->strContent += "<html>\n";
pResponse->strContent += "<head>\n";
if ( !gstrTrackerTitle.empty( ) )
pResponse->strContent += "<title>" + gstrTrackerTitle + " - File Statistics</title>\n";
else
pResponse->strContent += "<title>BNBT File Statistics</title>\n";
if( !gstrStyle.empty( ) )
pResponse->strContent += "<link rel=stylesheet type=\"text/css\" href=\"" + gstrStyle + "\">\n";
pResponse->strContent += "</head>\n";
pResponse->strContent += "<body>\n";
if( !m_bDisableLogon )
{
if( user.strLogin.empty( ) )
pResponse->strContent += "<p class=\"login1_index\">You are not logged in. Click <a href=\"/login.html\">here</a> to login.</p>\n";
else
pResponse->strContent += "<p class=\"login2_index\">You are logged in as <span class=\"username\">" + UTIL_RemoveHTML( user.strLogin ) + "</span>. Click <a href=\"/login.html?logout=1\">here</a> to logout.</p>\n";
}
if ( !gstrTrackerTitle.empty( ) )
pResponse->strContent += "<h3>" + gstrTrackerTitle + " - File Statistics</h3>\n";
else
pResponse->strContent += "<h3>BNBT File Statistics</h3>\n";
// The Trinity Edition - Addition Begins
// The following adds an RTT link to the TORRENT STATS page
pResponse->strContent += "<p><a href=\"/index.html\">Return to Tracker</a></p>\n";
// ------------------------------------------------- End of Addition
if( user.iAccess & ACCESS_VIEW )
{
string strHashString = pRequest->mapParams["info_hash"];
string strHash = UTIL_StringToHash( strHashString );
if( !strHash.empty( ) )
{
//
// admin
//
if( user.iAccess & ACCESS_EDIT )
{
if( m_pTags )
{
string strName = pRequest->mapParams["name"];
string strTag = pRequest->mapParams["tag"];
string strUploader = pRequest->mapParams["uploader"];
string strInfoLink = pRequest->mapParams["infolink"];
string strOK = pRequest->mapParams["ok"];
if( !strName.empty( ) || !strTag.empty( ) || !strUploader.empty( ) || !strInfoLink.empty( ) )
{
if( strOK == "1" )
{
addTag( strHash, strTag, strName, strUploader, strInfoLink );
pResponse->strContent += "<ul>\n";
pResponse->strContent += "<li>Changed name to \"" + UTIL_RemoveHTML( strName ) + "\" (blank values mean no change).</li>\n";
pResponse->strContent += "<li>Changed tag to \"" + UTIL_RemoveHTML( strTag ) + "\" (blank values mean no change).</li>\n";
pResponse->strContent += "<li>Changed uploader to \"" + UTIL_RemoveHTML( strUploader ) + "\" (blank values mean no change).</li>\n";
pResponse->strContent += "<li>Changed info link to \"" + UTIL_RemoveHTML( strInfoLink ) + "\" (blank values mean no change).</li>\n";
pResponse->strContent += "</ul>\n";
pResponse->strContent += "<p>Click <a href=\"/stats.html?info_hash=" + strHashString + "\">here</a> to return to the stats page.</p>\n";
if( m_bGen )
pResponse->strContent += "<p class=\"gen\">Generated in " + UTIL_ElapsedTimeStr( btv, UTIL_CurrentTime( ) ) + " seconds.</p>\n";
pResponse->strContent += "</body>\n";
pResponse->strContent += "</html>\n";
return;
}
else
{
pResponse->strContent += "<p>Are you sure you want to change the torrent's info?</p>\n";
// The Trinity Edition - Modification Begins
// The following replaces the OK response with a YES | NO option
// when CHANGING A TORRENT'S INFORMATION - name/uploader/infolink
pResponse->strContent += "<p><a href=\"/stats.html?info_hash=" + strHashString + "&name=" + UTIL_StringToEscaped( strName ) + "&uploader=" + UTIL_StringToEscaped( strUploader ) + "&infolink=" + UTIL_StringToEscaped( strInfoLink ) + "&tag=" + UTIL_StringToEscaped( strTag ) + "&ok=1\">";
pResponse->strContent += "YES</a> | <a href=\"javascript:history.back()\">NO</a></p>\n";
/* Original Source Code:
pResponse->strContent += "<p><a href=\"/stats.html?info_hash=" + strHashString + "&name=" + UTIL_StringToEscaped( strName ) + "&uploader=" + UTIL_StringToEscaped( strUploader ) + "&infolink=" + UTIL_StringToEscaped( strInfoLink ) + "&tag=" + UTIL_StringToEscaped( strTag ) + "&ok=1\">OK</a></p>\n";
*/
// ------------------------------------------------- End of Modification
if( m_bGen )
pResponse->strContent += "<p class=\"gen\">Generated in " + UTIL_ElapsedTimeStr( btv, UTIL_CurrentTime( ) ) + " seconds.</p>\n";
pResponse->strContent += "</body>\n";
pResponse->strContent += "</html>\n";
return;
}
}
// The Trinity Edition - Modification Begins
// Horizontal Ruled Line has a 100% width
// Removed "(blank values mean no change)" from each field; This information now appears once after the form
pResponse->strContent += "<hr>\n";
pResponse->strContent += "<p>Change Info</p>\n";
pResponse->strContent += "<form method=\"get\" action=\"/stats.html\">\n";
pResponse->strContent += "<input name=\"info_hash\" type=hidden value=\"" + strHashString + "\">\n";
pResponse->strContent += "<input name=\"name\" type=text size=64 maxlength=" + CAtomInt( MAX_FILENAME_LEN ).toString( ) + "> New Name (blank values mean no change)<br><br>\n";
pResponse->strContent += "<input name=\"uploader\" type=text size=64 maxlength=" + CAtomInt( m_iNameLength ).toString( ) + "> New Uploader (blank values mean no change)<br><br>\n";
pResponse->strContent += "<p><input name=\"infolink\" type=text size=64 maxlength=" + CAtomInt( MAX_INFOLINK_LEN ).toString( ) + "> New Info Link (†‡)</p>\n";
/* Original Source Code:
pResponse->strContent += "<hr width=\"80%\">\n";
pResponse->strContent += "<p>Change Info</p>\n";
pResponse->strContent += "<form method=\"get\" action=\"/stats.html\">\n";
pResponse->strContent += "<input name=\"info_hash\" type=hidden value=\"" + strHashString + "\">\n";
pResponse->strContent += "<input name=\"name\" type=text size=64 maxlength=" + CAtomInt( MAX_FILENAME_LEN ).toString( ) + "> New Name (blank values mean no change)<br><br>\n";
pResponse->strContent += "<input name=\"uploader\" type=text size=64 maxlength=" + CAtomInt( MAX_NAME_LEN ).toString( ) + "> New Uploader (blank values mean no change)<br><br>\n";
pResponse->strContent += "<input name=\"infolink\" type=text size=64 maxlength=" + CAtomInt( MAX_INFOLINK_LEN ).toString( ) + "> New Info Link (blank values mean no change)<br><br>\n";
*/
// ------------------------------------------------- End of Modification
string strCur;
CAtom *pTagInfo = m_pTags->getItem( strHash );
if( pTagInfo && pTagInfo->isDicti( ) )
{
CAtom *pCur = ( (CAtomDicti *)pTagInfo )->getItem( "tag" );
if( pCur )
strCur = pCur->toString( );
}
if( !m_vecTags.empty( ) )
pResponse->strContent += "<select name=\"tag\">\n";
for( vector< pair<string, string> > :: iterator i = m_vecTags.begin( ); i != m_vecTags.end( ); i++ )
{
pResponse->strContent += "<option";
if( (*i).first == strCur )
pResponse->strContent += " selected";
pResponse->strContent += ">" + (*i).first + "\n";
}
if( !m_vecTags.empty( ) )
pResponse->strContent += "</select> New Tag<br><br>\n";
pResponse->strContent += "<input type=submit value=\"Change Info\">\n";
// The Trinity Edition - Addition Begins
// The following explains how to leave values unchanged
// and how to remove values from the database
pResponse->strContent += "<p>† If this field is left blank, this value will remain unchanged.</p>\n";
pResponse->strContent += "<p>‡ Type <u>REMOVE</u> to clear this value from the database.</p>\n";
// ------------------------------------------------- End of Addition
pResponse->strContent += "</form>\n";
// The Trinity Edition - Modification Begins
// Changes the width of the Horizontal Ruled Line to 100%
pResponse->strContent += "<hr>\n";
/* Original Source Code:
pResponse->strContent += "<hr width=\"80%\">\n";
*/
// ------------------------------------------------- End of Modification
}
}
// display torrent information list
string strFileName;
int64 iSize = 0;
int iFiles = 1;
if( m_pAllowed )
{
CAtom *pTorrent = m_pAllowed->getItem( strHash );
if( pTorrent && pTorrent->isList( ) )
{
vector<CAtom *> vecTorrent = ( (CAtomList *)pTorrent )->getValue( );
if( vecTorrent.size( ) == 6 )
{
CAtom *pFileName = vecTorrent[0];
CAtom *pName = vecTorrent[1];
CAtom *pAdded = vecTorrent[2];
CAtom *pSize = vecTorrent[3];
CAtom *pFiles = vecTorrent[4];
CAtom *pComment = vecTorrent[5];
pResponse->strContent += "<p>File Information</p>\n";
pResponse->strContent += "<ul>\n";
if( pFileName )
strFileName = pFileName->toString( );
if( pName )
pResponse->strContent += "<li><strong>Name:</strong> " + UTIL_RemoveHTML( pName->toString( ) ) + "</li>\n";
pResponse->strContent += "<li><strong>Info Hash:</strong> " + strHashString + "</li>\n";
if( pAdded )
pResponse->strContent += "<li><strong>Added:</strong> " + pAdded->toString( ) + "</li>\n";
if( pSize && dynamic_cast<CAtomLong *>( pSize ) && dynamic_cast<CAtomLong *>( pSize ) != NULL )
{
// cache iSize
iSize = dynamic_cast<CAtomLong *>( pSize )->getValue( );
pResponse->strContent += "<li><strong>Size:</strong> " + UTIL_BytesToString( iSize ) + "</li>\n";
}
if( pFiles && dynamic_cast<CAtomInt *>( pFiles ) && dynamic_cast<CAtomInt *>( pFiles ) != NULL )
{
// cache iFiles
iFiles = dynamic_cast<CAtomInt *>( pFiles )->getValue( );
pResponse->strContent += "<li><strong>Files:</strong> " + pFiles->toString( ) + "</li>\n";
}
pResponse->strContent += "</ul>\n";
if( pComment )
{
if( m_bShowFileComment )
{
pResponse->strContent += "<p>File Comment</p>\n";
pResponse->strContent += "<table summary=\"file comment\">\n";
pResponse->strContent += "<tr><td class=\"com_body\"><code>" + UTIL_RemoveHTML( pComment->toString( ) ) + "</code></td></tr>\n";
pResponse->strContent += "</table>\n";
}
}
}
}
}
if( m_pAllowed && m_bAllowTorrentDownloads && ( user.iAccess & ACCESS_DL ) )
{
pResponse->strContent += "<p><a class=\"download\" href=\"";
if( m_strExternalTorrentDir.empty( ) )
pResponse->strContent += "/torrents/" + UTIL_StringToEscapedStrict( strFileName ) + "?info_hash=" + strHashString;
// pResponse->strContent += "/torrent.html?info_hash=" + strHashString;
else
pResponse->strContent += m_strExternalTorrentDir + UTIL_StringToEscapedStrict( strFileName );
pResponse->strContent += "\">DOWNLOAD TORRENT</a></p>";
}
// The Trinity Edition - Addition Begins
// The following adds a link to DELETE TORRENT
// when viewing the TORRENT'S STATS page
// This link is ONLY DISPLAYED when the user had EDIT ACCESS - Moderators and Admins
if( user.iAccess & ACCESS_EDIT ) {
pResponse->strContent += "<p class=\"deletelink\"><a href=\"/index.html?del=" + strHashString + "\">DELETE THIS TORRENT</a></p>\n";
}
// ------------------------------------------------- End of Addition
if( m_bShowFileContents && iFiles > 1 )
{
CAtom *pDecoded = DecodeFile( ( m_strAllowedDir + strFileName ).c_str( ) );
if( pDecoded && pDecoded->isDicti( ) )
{
CAtom *pInfo = ( (CAtomDicti *)pDecoded )->getItem( "info" );
if( pInfo && pInfo->isDicti( ) )
{
CAtom *pFiles = ( (CAtomDicti *)pInfo )->getItem( "files" );
if( pFiles && pFiles->isList( ) )
{
bool bFound = false;
int iAdded = 0;
vector<CAtom *> *pvecFiles = ( (CAtomList *)pFiles )->getValuePtr( );
for( vector<CAtom *> :: iterator i = pvecFiles->begin( ); i != pvecFiles->end( ); i++ )
{
if( (*i)->isDicti( ) )
{
CAtom *pPath = ( (CAtomDicti *)(*i) )->getItem( "path" );
CAtom *pLen = ( (CAtomDicti *)(*i) )->getItem( "length" );
if( pPath && pPath->isList( ) )
{
if( !bFound )
{
pResponse->strContent += "<p>Contents</p>\n";
pResponse->strContent += "<table summary=\"contents\">\n";
bFound = true;
}
string strPath;
vector<CAtom *> *pvecPath = ( (CAtomList *)pPath )->getValuePtr( );
for( vector<CAtom *> :: iterator j = pvecPath->begin( ); j != pvecPath->end( ); j++ )
{
if( j != pvecPath->begin( ) )
strPath += '/';
strPath += (*j)->toString( );
}
if( !strPath.empty( ) )
{
if( iAdded % 2 )
pResponse->strContent += "<tr class=\"even\">";
else
pResponse->strContent += "<tr class=\"odd\">";
pResponse->strContent += "<td class=\"path\">" + UTIL_RemoveHTML( strPath ) + "</td>";
if( pLen && pLen->isLong( ) )
pResponse->strContent += "<td class=\"bytes\">" + UTIL_BytesToString( ( (CAtomLong *)pLen )->getValue( ) ) + "</td>";
pResponse->strContent += "</tr>\n";
iAdded++;
}
}
}
}
if( bFound )
pResponse->strContent += "</table>\n";
}
}
}
if( pDecoded )
delete pDecoded;
}
if( m_pDFile )
{
CAtom *pPeers = m_pDFile->getItem( strHash );
if( pPeers && pPeers->isDicti( ) )
{
map<string, CAtom *> *pmapPeersDicti = ( (CAtomDicti *)pPeers )->getValuePtr( );
// add the peers into this structure one by one and sort it afterwards
struct peer_t *pPeersT = new struct peer_t[pmapPeersDicti->size( )];
unsigned long i = 0;
for( map<string, CAtom *> :: iterator it = pmapPeersDicti->begin( ); it != pmapPeersDicti->end( ); it++ )
{
pPeersT[i].iUpped = 0;
pPeersT[i].iDowned = 0;
pPeersT[i].iLeft = 0;
pPeersT[i].iConnected = 0;
pPeersT[i].flShareRatio = 0.0;
if( (*it).second->isDicti( ) )
{
CAtomDicti *pPeerDicti = (CAtomDicti *)(*it).second;
CAtom *pIP = pPeerDicti->getItem( "ip" );
CAtom *pUpped = pPeerDicti->getItem( "uploaded" );
CAtom *pDowned = pPeerDicti->getItem( "downloaded" );
CAtom *pLef = pPeerDicti->getItem( "left" );
CAtom *pConn = pPeerDicti->getItem( "connected" );
if( pIP )
{
pPeersT[i].strIP = pIP->toString( );
// strip ip
string :: size_type iStart = pPeersT[i].strIP.rfind( "." );
if( iStart != string :: npos )
{
// don't strip ip for mods
if( !( user.iAccess & ACCESS_EDIT ) )
pPeersT[i].strIP = pPeersT[i].strIP.substr( 0, iStart + 1 ) + "xxx";
}
}
if( pUpped && pUpped->isLong( ) )
pPeersT[i].iUpped = ( (CAtomLong *)pUpped )->getValue( );
if( pDowned && pDowned->isLong( ) )
{
pPeersT[i].iDowned = ( (CAtomLong *)pDowned )->getValue( );
if( m_bShowShareRatios )
{
if( pPeersT[i].iDowned > 0 )
pPeersT[i].flShareRatio = (float)pPeersT[i].iUpped / (float)pPeersT[i].iDowned;
else if( pPeersT[i].iUpped == 0 )
pPeersT[i].flShareRatio = 0.0;
else
pPeersT[i].flShareRatio = -1.0;
}
}
if( pLef && pLef->isLong( ) )
pPeersT[i].iLeft = ( (CAtomLong *)pLef )->getValue( );
if( pConn && pConn->isLong( ) )
pPeersT[i].iConnected = GetTime( ) - (unsigned long)( (CAtomLong *)pConn )->getValue( );
}
i++;
}
string strSort = pRequest->mapParams["sort"];
if( m_bSort )
{
if( !strSort.empty( ) )
{
int iSort = atoi( strSort.c_str( ) );
if( iSort == SORTP_AUPPED )
qsort( pPeersT, pmapPeersDicti->size( ), sizeof( struct peer_t ), asortpByUpped );
else if( iSort == SORTP_ADOWNED )
qsort( pPeersT, pmapPeersDicti->size( ), sizeof( struct peer_t ), asortpByDowned );
else if( iSort == SORTP_ALEFT )
qsort( pPeersT, pmapPeersDicti->size( ), sizeof( struct peer_t ), asortpByLeft );
else if( iSort == SORTP_ACONNECTED )
qsort( pPeersT, pmapPeersDicti->size( ), sizeof( struct peer_t ), asortpByConnected );
else if( iSort == SORTP_ASHARERATIO )
{
if( m_bShowShareRatios )
qsort( pPeersT, pmapPeersDicti->size( ), sizeof( struct peer_t ), asortpByShareRatio );
}
else if( iSort == SORTP_DUPPED )
qsort( pPeersT, pmapPeersDicti->size( ), sizeof( struct peer_t ), dsortpByUpped );
else if( iSort == SORTP_DDOWNED )
qsort( pPeersT, pmapPeersDicti->size( ), sizeof( struct peer_t ), dsortpByDowned );
else if( iSort == SORTP_DLEFT )
qsort( pPeersT, pmapPeersDicti->size( ), sizeof( struct peer_t ), dsortpByLeft );
else if( iSort == SORTP_DCONNECTED )
qsort( pPeersT, pmapPeersDicti->size( ), sizeof( struct peer_t ), dsortpByConnected );
else if( iSort == SORTP_DSHARERATIO )
{
if( m_bShowShareRatios )
qsort( pPeersT, pmapPeersDicti->size( ), sizeof( struct peer_t ), dsortpByShareRatio );
}
else
{
// default action is to sort by left
qsort( pPeersT, pmapPeersDicti->size( ), sizeof( struct peer_t ), asortpByLeft );
}
}
else
{
// default action is to sort by left
qsort( pPeersT, pmapPeersDicti->size( ), sizeof( struct peer_t ), asortpByLeft );
}
}
else
{
// sort is disabled, but default action is to sort by left
qsort( pPeersT, pmapPeersDicti->size( ), sizeof( struct peer_t ), asortpByLeft );
}
bool bFound = false;
int iAdded = 0;
//
// seeders
//
string :: size_type iCountGoesHere = string :: npos;
for( unsigned long i = 0; i < pmapPeersDicti->size( ); i++ )
{
if( iAdded >= m_iMaxPeersDisplay )
break;
if( pPeersT[i].iLeft == 0 )
{
if( !bFound )
{
// output table headers
pResponse->strContent += "<p>Seeders</p>\n";
// to save on calculations, we're going to insert the number of seeders later, keep track of where
iCountGoesHere = pResponse->strContent.size( ) - strlen( "</p>\n" );
pResponse->strContent += "<table summary=\"seeders\">\n";
pResponse->strContent += "<tr><th class=\"ip\">Peer IP</th><th class=\"bytes\">Uploaded";
if( m_bSort )
{
pResponse->strContent += "<br><a class=\"sort\" href=\"/stats.html?info_hash=";
pResponse->strContent += strHashString;
pResponse->strContent += "&sort=";
pResponse->strContent += SORTPSTR_AUPPED;
pResponse->strContent += "\">A</a> <a class=\"sort\" href=\"/stats.html?info_hash=";
pResponse->strContent += strHashString;
pResponse->strContent += "&sort=";
pResponse->strContent += SORTPSTR_DUPPED;
pResponse->strContent += "\">Z</a>";
}
pResponse->strContent += "</th><th class=\"bytes\">Downloaded";
if( m_bSort )
{
pResponse->strContent += "<br><a class=\"sort\" href=\"/stats.html?info_hash=";
pResponse->strContent += strHashString;
pResponse->strContent += "&sort=";
pResponse->strContent += SORTPSTR_ADOWNED;
pResponse->strContent += "\">A</a> <a class=\"sort\" href=\"/stats.html?info_hash=";
pResponse->strContent += strHashString;
pResponse->strContent += "&sort=";
pResponse->strContent += SORTPSTR_DDOWNED;
pResponse->strContent += "\">Z</a>";
}
pResponse->strContent += "</th><th class=\"connected\">Connected";
if( m_bSort )
{
pResponse->strContent += "<br><a class=\"sort\" href=\"/stats.html?info_hash=";
pResponse->strContent += strHashString;
pResponse->strContent += "&sort=";
pResponse->strContent += SORTPSTR_ACONNECTED;
pResponse->strContent += "\">A</a> <a class=\"sort\" href=\"/stats.html?info_hash=";
pResponse->strContent += strHashString;
pResponse->strContent += "&sort=";
pResponse->strContent += SORTPSTR_DCONNECTED;
pResponse->strContent += "\">Z</a>";
}
pResponse->strContent += "</th>";
if( m_bShowShareRatios )
{
pResponse->strContent += "<th class=\"number\">Share Ratio";
if( m_bSort )
{
pResponse->strContent += "<br><a class=\"sort\" href=\"/stats.html?info_hash=";
pResponse->strContent += strHashString;
pResponse->strContent += "&sort=";
pResponse->strContent += SORTPSTR_ASHARERATIO;
pResponse->strContent += "\">A</a> <a class=\"sort\" href=\"/stats.html?info_hash=";
pResponse->strContent += strHashString;
pResponse->strContent += "&sort=";
pResponse->strContent += SORTPSTR_DSHARERATIO;
pResponse->strContent += "\">Z</a>";
}
pResponse->strContent += "</th>";
}
if( m_bShowAvgULRate )
pResponse->strContent += "<th class=\"number\">Average Upload Rate</th>";
pResponse->strContent += "</tr>\n";
bFound = true;
}
// output table rows
if( iAdded % 2 )
pResponse->strContent += "<tr class=\"even\">";
else
pResponse->strContent += "<tr class=\"odd\">";
pResponse->strContent += "<td class=\"ip\">" + pPeersT[i].strIP + "</td>";
pResponse->strContent += "<td class=\"bytes\">" + UTIL_BytesToString( pPeersT[i].iUpped ) + "</td>";
pResponse->strContent += "<td class=\"bytes\">" + UTIL_BytesToString( pPeersT[i].iDowned ) + "</td>";
pResponse->strContent += "<td class=\"connected\">" + UTIL_SecondsToString( pPeersT[i].iConnected ) + "</td>";
if( m_bShowShareRatios )
{
pResponse->strContent += "<td class=\"number_";
if( pPeersT[i].flShareRatio == -1.0 )
pResponse->strContent += "green\">";
else if( pPeersT[i].flShareRatio < 0.8 )
pResponse->strContent += "red\">";
else if( pPeersT[i].flShareRatio < 1.2 )
pResponse->strContent += "yellow\">";
else
pResponse->strContent += "green\">";
// turn the share ratio into a string
if( pPeersT[i].flShareRatio == -1.0 )
pResponse->strContent += "Perfect";
else
{
char szFloat[16];
memset( szFloat, 0, sizeof( char ) * 16 );
sprintf( szFloat, "%0.3f", pPeersT[i].flShareRatio );
pResponse->strContent += szFloat;
}
pResponse->strContent += "</td>";
}
if( m_bShowAvgULRate )
{
pResponse->strContent += "<td class=\"number\">";
if( pPeersT[i].iConnected > 0 )
pResponse->strContent += UTIL_BytesToString( pPeersT[i].iUpped / pPeersT[i].iConnected ) + "/sec";
else
pResponse->strContent += "N/A";
pResponse->strContent += "</td>";
}
pResponse->strContent += "</tr>\n";
iAdded++;
}
}
// insert the number of seeders
string strTemp = " (" + CAtomInt( iAdded ).toString( ) + ")";
if( iCountGoesHere != string :: npos )
pResponse->strContent.insert( iCountGoesHere, strTemp );
iCountGoesHere = string :: npos;
if( bFound )
pResponse->strContent += "</table>\n";
bFound = false;
iAdded = 0;
//
// leechers
//
for( unsigned long i = 0; i < pmapPeersDicti->size( ); i++ )
{
if( iAdded >= m_iMaxPeersDisplay )
break;
if( pPeersT[i].iLeft != 0 )
{
if( !bFound )
{
// output table headers
pResponse->strContent += "<p>Leechers</p>\n";
// to save on calculations, we're going to insert the number of leechers later, keep track of where
iCountGoesHere = pResponse->strContent.size( ) - strlen( "</p>\n" );
pResponse->strContent += "<table summary=\"leechers\">\n";
pResponse->strContent += "<tr><th class=\"ip\">Peer IP</th><th class=\"bytes\">Uploaded";
if( m_bSort )
{
pResponse->strContent += "<br><a class=\"sort\" href=\"/stats.html?info_hash=";
pResponse->strContent += strHashString;
pResponse->strContent += "&sort=";
pResponse->strContent += SORTPSTR_AUPPED;
pResponse->strContent += "\">A</a> <a class=\"sort\" href=\"/stats.html?info_hash=";
pResponse->strContent += strHashString;
pResponse->strContent += "&sort=";
pResponse->strContent += SORTPSTR_DUPPED;
pResponse->strContent += "\">Z</a>";
}
pResponse->strContent += "</th><th class=\"bytes\">Downloaded";
if( m_bSort )
{
pResponse->strContent += "<br><a class=\"sort\" href=\"/stats.html?info_hash=";
pResponse->strContent += strHashString;
pResponse->strContent += "&sort=";
pResponse->strContent += SORTPSTR_ADOWNED;
pResponse->strContent += "\">A</a> <a class=\"sort\" href=\"/stats.html?info_hash=";
pResponse->strContent += strHashString;
pResponse->strContent += "&sort=";
pResponse->strContent += SORTPSTR_DDOWNED;
pResponse->strContent += "\">Z</a>";
}
if( m_pAllowed && m_bShowLeftAsProgress )
pResponse->strContent += "</th><th class=\"bytes\">Progress";
else
pResponse->strContent += "</th><th class=\"bytes\">Left";
if( m_bSort )
{
pResponse->strContent += "<br><a class=\"sort\" href=\"/stats.html?info_hash=";
pResponse->strContent += strHashString;
pResponse->strContent += "&sort=";
pResponse->strContent += SORTPSTR_ALEFT;
pResponse->strContent += "\">A</a> <a class=\"sort\" href=\"/stats.html?info_hash=";
pResponse->strContent += strHashString;
pResponse->strContent += "&sort=";
pResponse->strContent += SORTPSTR_DLEFT;
pResponse->strContent += "\">Z</a>";
}
pResponse->strContent += "</th><th class=\"connected\">Connected";
if( m_bSort )
{
pResponse->strContent += "<br><a class=\"sort\" href=\"/stats.html?info_hash=";
pResponse->strContent += strHashString;
pResponse->strContent += "&sort=";
pResponse->strContent += SORTPSTR_ACONNECTED;
pResponse->strContent += "\">A</a> <a class=\"sort\" href=\"/stats.html?info_hash=";
pResponse->strContent += strHashString;
pResponse->strContent += "&sort=";
pResponse->strContent += SORTPSTR_DCONNECTED;
pResponse->strContent += "\">Z</a>";
}
pResponse->strContent += "</th>";
if( m_bShowShareRatios )
{
pResponse->strContent += "<th class=\"number\">Share Ratio";
if( m_bSort )
{
pResponse->strContent += "<br><a class=\"sort\" href=\"/stats.html?info_hash=";
pResponse->strContent += strHashString;
pResponse->strContent += "&sort=";
pResponse->strContent += SORTPSTR_ASHARERATIO;
pResponse->strContent += "\">A</a> <a class=\"sort\" href=\"/stats.html?info_hash=";
pResponse->strContent += strHashString;
pResponse->strContent += "&sort=";
pResponse->strContent += SORTPSTR_DSHARERATIO;
pResponse->strContent += "\">Z</a>";
}
pResponse->strContent += "</th>";
}
if( m_bShowAvgULRate )
pResponse->strContent += "<th class=\"number\">Average Upload Rate</th>";
if( m_bShowAvgDLRate )
pResponse->strContent += "<th class=\"number\">Average Download Rate</th>";
pResponse->strContent += "</tr>\n";
bFound = true;
}
// output table rows
if( iAdded % 2 )
pResponse->strContent += "<tr class=\"even\">";
else
pResponse->strContent += "<tr class=\"odd\">";
pResponse->strContent += "<td class=\"ip\">" + pPeersT[i].strIP + "</td>";
pResponse->strContent += "<td class=\"bytes\">" + UTIL_BytesToString( pPeersT[i].iUpped ) + "</td>";
pResponse->strContent += "<td class=\"bytes\">" + UTIL_BytesToString( pPeersT[i].iDowned ) + "</td>";
pResponse->strContent += "<td class=\"percent\">";
if( m_pAllowed && m_bShowLeftAsProgress )
pResponse->strContent += UTIL_BytesToString( iSize - pPeersT[i].iLeft );
else
pResponse->strContent += UTIL_BytesToString( pPeersT[i].iLeft );
if( m_pAllowed )
{
pResponse->strContent += " (";
int iPercent = 0;
if( iSize > 0 )
{
if( m_bShowLeftAsProgress )
iPercent = 100 - (int)( ( (float)pPeersT[i].iLeft / iSize ) * 100 );
else
iPercent = (int)( ( (float)pPeersT[i].iLeft / iSize ) * 100 );
}
pResponse->strContent += CAtomInt( iPercent ).toString( ) + "%)";
if( !m_strImageBarFill.empty( ) && !m_strImageBarTrans.empty( ) )
{
pResponse->strContent += "<br>";
if( iPercent < 0 )
iPercent = 0;
if( iPercent > 100 )
iPercent = 100;
if( iPercent > 0 )
pResponse->strContent += "<img src=\"" + m_strImageBarFill + "\" width=" + CAtomInt( iPercent ).toString( ) + " height=8>";
if( iPercent < 100 )
pResponse->strContent += "<img src=\"" + m_strImageBarTrans + "\" width=" + CAtomInt( 100 - iPercent ).toString( ) + " height=8>";
}
}
pResponse->strContent += "</td><td class=\"connected\">" + UTIL_SecondsToString( pPeersT[i].iConnected ) + "</td>";
if( m_bShowShareRatios )
{
pResponse->strContent += "<td class=\"number_";
if( pPeersT[i].flShareRatio == -1.0 )
pResponse->strContent += "green\">";
else if( pPeersT[i].flShareRatio < 0.8 )
pResponse->strContent += "red\">";
else if( pPeersT[i].flShareRatio < 1.2 )
pResponse->strContent += "yellow\">";
else
pResponse->strContent += "green\">";
// turn the share ratio into a string
if( pPeersT[i].flShareRatio == -1.0 )
pResponse->strContent += "Perfect";
else
{
char szFloat[16];
memset( szFloat, 0, sizeof( char ) * 16 );
sprintf( szFloat, "%0.3f", pPeersT[i].flShareRatio );
pResponse->strContent += szFloat;
}
pResponse->strContent += "</td>";
}
if( m_bShowAvgULRate )
{
pResponse->strContent += "<td class=\"number\">";
if( pPeersT[i].iConnected > 0 )
pResponse->strContent += UTIL_BytesToString( pPeersT[i].iUpped / pPeersT[i].iConnected ) + "/sec";
else
pResponse->strContent += "N/A";
pResponse->strContent += "</td>";
}
if( m_bShowAvgDLRate )
{
pResponse->strContent += "<td class=\"number\">";
if( pPeersT[i].iConnected > 0 )
pResponse->strContent += UTIL_BytesToString( pPeersT[i].iDowned / pPeersT[i].iConnected ) + "/sec";
else
pResponse->strContent += "N/A";
pResponse->strContent += "</td>";
}
pResponse->strContent += "</tr>\n";
iAdded++;
}
}
// insert the number of leechers
strTemp = " (" + CAtomInt( iAdded ).toString( ) + ")";
if( iCountGoesHere != string :: npos )
pResponse->strContent.insert( iCountGoesHere, strTemp );
delete [] pPeersT;
if( bFound )
pResponse->strContent += "</table>\n";
}
}
}
}
else
pResponse->strContent += "<p class=\"denied\">You are not authorized to view this page.</p>\n";
if( m_bGen )
pResponse->strContent += "<p class=\"gen\">Generated in " + UTIL_ElapsedTimeStr( btv, UTIL_CurrentTime( ) ) + " seconds.</p>\n";
pResponse->strContent += "</body>\n";
pResponse->strContent += "</html>\n";
}