@@ -1299,6 +1299,7 @@ static bool
12991299MtmBuildConnectivityMatrix (nodemask_t * matrix ,bool nowait )
13001300{
13011301int i ,j ,n = Mtm -> nAllNodes ;
1302+ fprintf (stderr ,"Connectivity matrix:\n" );
13021303for (i = 0 ;i < n ;i ++ ) {
13031304if (i + 1 != MtmNodeId ) {
13041305void * data = RaftableGet (psprintf ("node-mask-%d" ,i + 1 ),NULL ,NULL ,nowait );
@@ -1309,7 +1310,12 @@ MtmBuildConnectivityMatrix(nodemask_t* matrix, bool nowait)
13091310}else {
13101311matrix [i ]= Mtm -> connectivityMask ;
13111312}
1313+ for (j = 0 ;j < n ;j ++ ) {
1314+ putc (BIT_CHECK (matrix [i ],j ) ?'X' :'+' ,stderr );
1315+ }
1316+ putc ('\n' ,stderr );
13121317}
1318+ fputs ("-----------------------\n" ,stderr );
13131319/* make matrix symetric: required for Bron–Kerbosch algorithm */
13141320for (i = 0 ;i < n ;i ++ ) {
13151321for (j = 0 ;j < i ;j ++ ) {
@@ -1340,6 +1346,17 @@ bool MtmRefreshClusterStatus(bool nowait)
13401346
13411347clique = MtmFindMaxClique (matrix ,Mtm -> nAllNodes ,& clique_size );
13421348if (clique_size >=Mtm -> nAllNodes /2 + 1 ) {/* have quorum */
1349+ fprintf (stderr ,"Old mask: " );
1350+ for (i = 0 ;i < Mtm -> nAllNodes ;i ++ ) {
1351+ putc (BIT_CHECK (Mtm -> disabledNodeMask ,i ) ?'-' :'+' ,stderr );
1352+ }
1353+ putc ('\n' ,stderr );
1354+ fprintf (stderr ,"New mask: " );
1355+ for (i = 0 ;i < Mtm -> nAllNodes ;i ++ ) {
1356+ putc (BIT_CHECK (clique ,i ) ?'+' :'-' ,stderr );
1357+ }
1358+ putc ('\n' ,stderr );
1359+
13431360MTM_LOG1 ("Find clique %lx, disabledNodeMask %lx" , (long )clique , (long )Mtm -> disabledNodeMask );
13441361MtmLock (LW_EXCLUSIVE );
13451362mask = ~clique & (((nodemask_t )1 <<Mtm -> nAllNodes )- 1 )& ~Mtm -> disabledNodeMask ;/* new disabled nodes mask */