1
1
/*
2
- Copyright (c) 2003, 2010, 2011, 2013 , Oracle and/or its affiliates. All rights reserved.
2
+ Copyright (c) 2003, 2014 , Oracle and/or its affiliates. All rights reserved.
3
3
4
4
This program is free software; you can redistribute it and/or modify
5
5
it under the terms of the GNU General Public License as published by
@@ -16436,33 +16436,33 @@ void Dbdih::makeNodeGroups(Uint32 nodeArray[])
16436
16436
*/
16437
16437
void Dbdih::execCHECKNODEGROUPSREQ(Signal* signal)
16438
16438
{
16439
- jamEntry ();
16439
+ jamNoBlock ();
16440
16440
CheckNodeGroups* sd = (CheckNodeGroups*)&signal->theData[0];
16441
16441
16442
16442
bool direct = (sd->requestType & CheckNodeGroups::Direct);
16443
16443
bool ok = false;
16444
16444
switch(sd->requestType & ~CheckNodeGroups::Direct){
16445
16445
case CheckNodeGroups::ArbitCheck:{
16446
16446
ok = true;
16447
- jam ();
16447
+ jamNoBlock ();
16448
16448
unsigned missall = 0;
16449
16449
unsigned haveall = 0;
16450
16450
for (Uint32 i = 0; i < cnoOfNodeGroups; i++) {
16451
- jam ();
16451
+ jamNoBlock ();
16452
16452
NodeGroupRecordPtr ngPtr;
16453
16453
ngPtr.i = c_node_groups[i];
16454
16454
ptrAss(ngPtr, nodeGroupRecord);
16455
16455
Uint32 count = 0;
16456
16456
for (Uint32 j = 0; j < ngPtr.p->nodeCount; j++) {
16457
- jam ();
16457
+ jamNoBlock ();
16458
16458
Uint32 nodeId = ngPtr.p->nodesInGroup[j];
16459
16459
if (sd->mask.get(nodeId)) {
16460
- jam ();
16460
+ jamNoBlock ();
16461
16461
count++;
16462
16462
}//if
16463
16463
}//for
16464
16464
if (count == 0) {
16465
- jam ();
16465
+ jamNoBlock ();
16466
16466
missall++;
16467
16467
}//if
16468
16468
if (count == ngPtr.p->nodeCount) {
@@ -16471,13 +16471,13 @@ void Dbdih::execCHECKNODEGROUPSREQ(Signal* signal)
16471
16471
}//for
16472
16472
16473
16473
if (missall) {
16474
- jam ();
16474
+ jamNoBlock ();
16475
16475
sd->output = CheckNodeGroups::Lose;
16476
16476
} else if (haveall) {
16477
- jam ();
16477
+ jamNoBlock ();
16478
16478
sd->output = CheckNodeGroups::Win;
16479
16479
} else {
16480
- jam ();
16480
+ jamNoBlock ();
16481
16481
sd->output = CheckNodeGroups::Partitioning;
16482
16482
}//if
16483
16483
}
@@ -16503,17 +16503,17 @@ void Dbdih::execCHECKNODEGROUPSREQ(Signal* signal)
16503
16503
ngPtr.i = ng;
16504
16504
if (ngPtr.i != RNIL)
16505
16505
{
16506
- jam ();
16506
+ jamNoBlock ();
16507
16507
ptrAss(ngPtr, nodeGroupRecord);
16508
16508
for (Uint32 j = 0; j < ngPtr.p->nodeCount; j++) {
16509
- jam ();
16509
+ jamNoBlock ();
16510
16510
sd->mask.set(ngPtr.p->nodesInGroup[j]);
16511
16511
}
16512
16512
}
16513
16513
break;
16514
16514
}
16515
16515
case CheckNodeGroups::GetDefaultFragments:
16516
- jam ();
16516
+ jamNoBlock ();
16517
16517
ok = true;
16518
16518
sd->output = (cnoOfNodeGroups + sd->extraNodeGroups)
16519
16519
* getFragmentsPerNode() * cnoReplicas;
0 commit comments