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
|
// **********************************************************************
//
// Copyright (c) 2003-2006 ZeroC, Inc. All rights reserved.
//
// This copy of Ice is licensed to you under the terms described in the
// ICE_LICENSE file included in this distribution.
//
// **********************************************************************
#include <IceUtil/Random.h>
#include <Ice/LoggerUtil.h>
#include <Ice/Locator.h>
#include <IceGrid/AdapterCache.h>
#include <IceGrid/NodeSessionI.h>
#include <IceGrid/ServerCache.h>
#include <IceGrid/NodeCache.h>
#include <IceGrid/SessionI.h>
#include <functional>
using namespace std;
using namespace IceGrid;
namespace IceGrid
{
struct ReplicaLoadComp : binary_function<ServerAdapterEntryPtr&, ServerAdapterEntryPtr&, bool>
{
typedef ReplicaGroupEntry::ReplicaSeq::value_type Replica;
typedef pair<float, Replica> ReplicaLoad;
bool operator()(const ReplicaLoad& lhs, const ReplicaLoad& rhs)
{
return lhs.first < rhs.first;
}
};
struct ToReplicaLoad : public unary_function<const ReplicaLoadComp::Replica&, ReplicaLoadComp::ReplicaLoad>
{
ToReplicaLoad(LoadSample loadSample) : _loadSample(loadSample) { }
ReplicaLoadComp::ReplicaLoad
operator()(const ReplicaLoadComp::Replica& value)
{
try
{
return make_pair(value.second->getLeastLoadedNodeLoad(_loadSample), value);
}
catch(const Ice::Exception&)
{
return make_pair(1.0f, value);
}
}
LoadSample _loadSample;
};
struct ToReplica : public unary_function<const ReplicaLoadComp::ReplicaLoad&, ReplicaLoadComp::Replica>
{
ReplicaLoadComp::Replica
operator()(const ReplicaLoadComp::ReplicaLoad& value)
{
return value.second;
}
};
}
ServerAdapterEntryPtr
AdapterCache::addServerAdapter(const string& id, const string& rgId, const ServerEntryPtr& server)
{
Lock sync(*this);
assert(!getImpl(id));
ServerAdapterEntryPtr entry = new ServerAdapterEntry(*this, id, rgId, server);
addImpl(id, entry);
if(!rgId.empty())
{
ReplicaGroupEntryPtr repEntry = ReplicaGroupEntryPtr::dynamicCast(getImpl(rgId));
assert(repEntry);
repEntry->addReplica(id, entry);
}
return entry;
}
ReplicaGroupEntryPtr
AdapterCache::addReplicaGroup(const string& id, const string& app, const LoadBalancingPolicyPtr& loadBalancing)
{
Lock sync(*this);
assert(!getImpl(id));
ReplicaGroupEntryPtr entry = new ReplicaGroupEntry(*this, id, app, loadBalancing);
addImpl(id, entry);
return entry;
}
AdapterEntryPtr
AdapterCache::get(const string& id) const
{
Lock sync(*this);
AdapterEntryPtr entry = getImpl(id);
if(!entry)
{
throw AdapterNotExistException(id);
}
return entry;
}
ServerAdapterEntryPtr
AdapterCache::getServerAdapter(const string& id) const
{
Lock sync(*this);
ServerAdapterEntryPtr svrEntry = ServerAdapterEntryPtr::dynamicCast(getImpl(id));
if(!svrEntry)
{
throw AdapterNotExistException(id);
}
return svrEntry;
}
ReplicaGroupEntryPtr
AdapterCache::getReplicaGroup(const string& id) const
{
Lock sync(*this);
ReplicaGroupEntryPtr repEntry = ReplicaGroupEntryPtr::dynamicCast(getImpl(id));
if(!repEntry)
{
throw AdapterNotExistException(id);
}
return repEntry;
}
void
AdapterCache::removeServerAdapter(const string& id)
{
Lock sync(*this);
ServerAdapterEntryPtr entry = ServerAdapterEntryPtr::dynamicCast(getImpl(id));
assert(entry);
removeImpl(id);
string replicaGroupId = entry->getReplicaGroupId();
if(!replicaGroupId.empty())
{
ReplicaGroupEntryPtr repEntry = ReplicaGroupEntryPtr::dynamicCast(getImpl(replicaGroupId));
assert(repEntry);
repEntry->removeReplica(id);
}
}
void
AdapterCache::removeReplicaGroup(const string& id)
{
Lock sync(*this);
removeImpl(id);
}
AdapterEntryPtr
AdapterCache::addImpl(const string& id, const AdapterEntryPtr& entry)
{
if(_traceLevels && _traceLevels->adapter > 0)
{
Ice::Trace out(_traceLevels->logger, _traceLevels->adapterCat);
out << "added adapter `" << id << "'";
}
return Cache<string, AdapterEntry>::addImpl(id, entry);
}
void
AdapterCache::removeImpl(const string& id)
{
if(_traceLevels && _traceLevels->adapter > 0)
{
Ice::Trace out(_traceLevels->logger, _traceLevels->adapterCat);
out << "removed adapter `" << id << "'";
}
Cache<string, AdapterEntry>::removeImpl(id);
}
AdapterEntry::AdapterEntry(AdapterCache& cache, const string& id) :
_cache(cache),
_id(id)
{
}
bool
AdapterEntry::canRemove()
{
return true;
}
ServerAdapterEntry::ServerAdapterEntry(AdapterCache& cache,
const string& id,
const string& replicaGroupId,
const ServerEntryPtr& server) :
AdapterEntry(cache, id),
_replicaGroupId(replicaGroupId),
_server(server)
{
}
vector<pair<string, AdapterPrx> >
ServerAdapterEntry::getProxies(int& nReplicas, bool& replicaGroup)
{
vector<pair<string, AdapterPrx> > adapters;
nReplicas = 1;
replicaGroup = false;
adapters.push_back(make_pair(_id, getProxy("", true)));
return adapters;
}
float
ServerAdapterEntry::getLeastLoadedNodeLoad(LoadSample loadSample) const
{
return getServer()->getLoad(loadSample);
}
string
ServerAdapterEntry::getApplication() const
{
return getServer()->getApplication();
}
AdapterInfoSeq
ServerAdapterEntry::getAdapterInfo() const
{
AdapterInfo info;
info.id = _id;
info.replicaGroupId = _replicaGroupId;
try
{
info.proxy = getProxy("", true)->getDirectProxy();
}
catch(const Ice::Exception&)
{
}
AdapterInfoSeq infos;
infos.push_back(info);
return infos;
}
AdapterPrx
ServerAdapterEntry::getProxy(const string& replicaGroupId, bool upToDate) const
{
if(replicaGroupId.empty())
{
return getServer()->getAdapter(_id, upToDate);
}
else
{
Lock sync(*this);
if(_replicaGroupId != replicaGroupId)
{
throw Ice::InvalidReplicaGroupIdException();
}
return _server->getAdapter(_id, upToDate);
}
}
ServerEntryPtr
ServerAdapterEntry::getServer() const
{
Lock sync(*this);
assert(_server);
return _server;
}
ReplicaGroupEntry::ReplicaGroupEntry(AdapterCache& cache,
const string& id,
const string& application,
const LoadBalancingPolicyPtr& policy) :
AdapterEntry(cache, id),
_application(application),
_lastReplica(0)
{
update(policy);
}
void
ReplicaGroupEntry::addReplica(const string& replicaId, const ServerAdapterEntryPtr& adapter)
{
Lock sync(*this);
_replicas.push_back(make_pair(replicaId, adapter));
}
void
ReplicaGroupEntry::removeReplica(const string& replicaId)
{
Lock sync(*this);
for(ReplicaGroupEntry::ReplicaSeq::iterator p = _replicas.begin(); p != _replicas.end(); ++p)
{
if(replicaId == p->first)
{
_replicas.erase(p);
// Make sure _lastReplica is still within the bounds.
_lastReplica = _replicas.empty() ? 0 : _lastReplica % static_cast<int>(_replicas.size());
break;
}
}
}
void
ReplicaGroupEntry::update(const LoadBalancingPolicyPtr& policy)
{
Lock sync(*this);
_loadBalancing = policy;
if(_loadBalancing)
{
istringstream is(_loadBalancing->nReplicas);
int nReplicas = 0;
is >> nReplicas;
_loadBalancingNReplicas = nReplicas < 1 ? 1 : nReplicas;
AdaptiveLoadBalancingPolicyPtr alb = AdaptiveLoadBalancingPolicyPtr::dynamicCast(_loadBalancing);
if(alb)
{
if(alb->loadSample == "1")
{
_loadSample = LoadSample1;
}
else if(alb->loadSample == "5")
{
_loadSample = LoadSample5;
}
else if(alb->loadSample == "15")
{
_loadSample = LoadSample15;
}
else
{
_loadSample = LoadSample1;
}
}
}
}
vector<pair<string, AdapterPrx> >
ReplicaGroupEntry::getProxies(int& nReplicas, bool& replicaGroup)
{
ReplicaSeq replicas;
bool adaptive = false;
LoadSample loadSample = LoadSample1;
{
Lock sync(*this);
replicaGroup = true;
if(_replicas.empty())
{
return vector<pair<string, AdapterPrx> >();
}
nReplicas = _loadBalancingNReplicas > 0 ? _loadBalancingNReplicas : static_cast<int>(_replicas.size());
replicas.reserve(_replicas.size());
if(!_loadBalancing)
{
replicas = _replicas;
}
if(RoundRobinLoadBalancingPolicyPtr::dynamicCast(_loadBalancing))
{
for(unsigned int i = 0; i < _replicas.size(); ++i)
{
replicas.push_back(_replicas[(_lastReplica + i) % _replicas.size()]);
}
_lastReplica = (_lastReplica + 1) % static_cast<int>(_replicas.size());
}
else if(AdaptiveLoadBalancingPolicyPtr::dynamicCast(_loadBalancing))
{
replicas = _replicas;
RandomNumberGenerator rng;
random_shuffle(replicas.begin(), replicas.end(), rng);
adaptive = true;
loadSample = _loadSample;
}
else// if(RandomLoadBalancingPolicyPtr::dynamicCast(_loadBalancing))
{
replicas = _replicas;
RandomNumberGenerator rng;
random_shuffle(replicas.begin(), replicas.end(), rng);
}
}
if(adaptive)
{
//
// This must be done outside the synchronization block since
// the sort() will call and lock each server entry.
//
vector<ReplicaLoadComp::ReplicaLoad> rl;
transform(replicas.begin(), replicas.end(), back_inserter(rl), ToReplicaLoad(loadSample));
sort(rl.begin(), rl.end(), ReplicaLoadComp());
replicas.clear();
transform(rl.begin(), rl.end(), back_inserter(replicas), ToReplica());
}
//
// Retrieve the proxy of each adapter from the server. The adapter
// might not exist anymore at this time or the node might not be
// reachable.
//
vector<pair<string, AdapterPrx> > adapters;
for(ReplicaSeq::const_iterator p = replicas.begin(); p != replicas.end(); ++p)
{
try
{
adapters.push_back(make_pair(p->first, p->second->getProxy(_id, true)));
}
catch(const AdapterNotExistException&)
{
}
catch(const Ice::InvalidReplicaGroupIdException&)
{
}
catch(const NodeUnreachableException&)
{
}
}
return adapters;
}
float
ReplicaGroupEntry::getLeastLoadedNodeLoad(LoadSample loadSample) const
{
ReplicaSeq replicas;
{
Lock sync(*this);
replicas = _replicas;
}
//
// This must be done outside the synchronization block since
// min_element() will call and lock each server entry.
//
RandomNumberGenerator rng;
random_shuffle(replicas.begin(), replicas.end(), rng);
vector<ReplicaLoadComp::ReplicaLoad> rl;
transform(replicas.begin(), replicas.end(), back_inserter(rl), ToReplicaLoad(loadSample));
AdapterEntryPtr adpt = min_element(rl.begin(), rl.end(), ReplicaLoadComp())->second.second;
return adpt->getLeastLoadedNodeLoad(loadSample);
}
string
ReplicaGroupEntry::getApplication() const
{
Lock sync(*this);
return _application;
}
AdapterInfoSeq
ReplicaGroupEntry::getAdapterInfo() const
{
ReplicaSeq replicas;
{
Lock sync(*this);
replicas = _replicas;
}
AdapterInfoSeq infos;
for(ReplicaSeq::const_iterator p = replicas.begin(); p != replicas.end(); ++p)
{
AdapterInfoSeq infs = p->second->getAdapterInfo();
assert(infs.size() == 1);
infos.push_back(infs[0]);
}
return infos;
}
|