[go: up one dir, main page]

Menu

[r89]: / gmp / prec.cpp  Maximize  Restore  History

Download this file

182 lines (142 with data), 4.6 kB

  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
/*****************************************************************************
Copyright © 2006, 2007, The Board of Trustees of the University of Illinois.
All Rights Reserved.
Group Messaging Protocol (GMP)
National Center for Data Mining (NCDM)
University of Illinois at Chicago
http://www.ncdm.uic.edu/
GMP is free software: you can redistribute it and/or modify it under
the terms of the GNU General Public License as published by the Free
Software Foundation, either version 3 of the License, or (at your option)
any later version.
GMP 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 General Public License for more details.
You should have received a copy of the GNU General Public License along
with this program. If not, see <http://www.gnu.org/licenses/>.
*****************************************************************************/
/*****************************************************************************
written by
Yunhong Gu [gu@lac.uic.edu], last updated 01/25/2007
*****************************************************************************/
#ifndef WIN32
#include <sys/time.h>
#include <time.h>
#else
#include <windows.h>
#endif
#include <common.h>
#include <prec.h>
using namespace std;
using namespace cb;
CPeerManagement::CPeerManagement()
{
#ifndef WIN32
pthread_mutex_init(&m_PeerRecLock, NULL);
#else
m_PeerRecLock = CreateMutex(NULL, false, NULL);
#endif
}
CPeerManagement::~CPeerManagement()
{
#ifndef WIN32
pthread_mutex_destroy(&m_PeerRecLock);
#else
CloseHandle(m_PeerRecLock);
#endif
}
void CPeerManagement::insert(const string& ip, const int& port, const int& session, const int32_t& id, const int& rtt)
{
CGuard recguard(m_PeerRecLock);
CPeerRecord* pr = new CPeerRecord;
pr->m_strIP = ip;
pr->m_iPort = port;
pr->m_iSession = session;
set<CPeerRecord*, CFPeerRec>::iterator i = m_sPeerRec.find(pr);
if (i != m_sPeerRec.end())
{
if (id > 0)
(*i)->m_iID = id;
if (rtt > 0)
{
if (-1 == (*i)->m_iRTT )
(*i)->m_iRTT = rtt;
else
(*i)->m_iRTT = ((*i)->m_iRTT * 7 + rtt) >> 3;
}
(*i)->m_llTimeStamp = CTimer::getTime();
delete pr;
}
else
{
if (id > 0)
pr->m_iID = id;
else
pr->m_iID = -1;
if (rtt > 0)
pr->m_iRTT = rtt;
else
pr->m_iRTT = -1;
pr->m_llTimeStamp = CTimer::getTime();
m_sPeerRec.insert(pr);
m_sPeerRecByTS.insert(pr);
m_sPeerRecByIP.insert(pr);
if (m_sPeerRecByTS.size() > m_uiRecLimit)
{
// delete first one
set<CPeerRecord*, CFPeerRecByTS>::iterator j = m_sPeerRecByTS.begin();
CPeerRecord* t = *j;
m_sPeerRec.erase(t);
pair<multiset<CPeerRecord*, CFPeerRecByIP>::iterator, multiset<CPeerRecord*, CFPeerRecByIP>::iterator> p;
p = m_sPeerRecByIP.equal_range(t);
for (multiset<CPeerRecord*, CFPeerRecByIP>::iterator k = p.first; k != p.second; k ++)
{
if ((*k)->m_iPort == t->m_iPort)
m_sPeerRecByIP.erase(k);
}
m_sPeerRecByTS.erase(t);
delete t;
}
}
}
int CPeerManagement::getRTT(const string& ip)
{
pair<multiset<CPeerRecord*, CFPeerRecByIP>::iterator, multiset<CPeerRecord*, CFPeerRecByIP>::iterator> p;
CPeerRecord pr;
pr.m_strIP = ip;
int rtt = -1;
CGuard recguard(m_PeerRecLock);
p = m_sPeerRecByIP.equal_range(&pr);
for (multiset<CPeerRecord*, CFPeerRecByIP>::iterator i = p.first; i != p.second; i ++)
{
if ((*i)->m_iRTT > 0)
{
rtt = (*i)->m_iRTT;
break;
}
}
return rtt;
}
int CPeerManagement::getLastID(const string& ip, const int& port, const int& session)
{
CPeerRecord pr;
pr.m_strIP = ip;
pr.m_iPort = port;
pr.m_iSession = session;
int id = -1;
CGuard recguard(m_PeerRecLock);
set<CPeerRecord*, CFPeerRec>::iterator i = m_sPeerRec.find(&pr);
if (i != m_sPeerRec.end())
id = (*i)->m_iID;
return id;
}
void CPeerManagement::clearRTT(const string& ip)
{
CPeerRecord pr;
pr.m_strIP = ip;
CGuard recguard(m_PeerRecLock);
pair<multiset<CPeerRecord*, CFPeerRecByIP>::iterator, multiset<CPeerRecord*, CFPeerRecByIP>::iterator> p;
p = m_sPeerRecByIP.equal_range(&pr);
for (multiset<CPeerRecord*, CFPeerRecByIP>::iterator i = p.first; i != p.second; i ++)
(*i)->m_iRTT = -1;
}