@@ -1291,6 +1291,7 @@ static bool
12911291MtmBuildConnectivityMatrix (nodemask_t * matrix ,bool nowait )
12921292{
12931293int i ,j ,n = Mtm -> nAllNodes ;
1294+ fprintf (stderr ,"Connectivity matrix:\n" );
12941295for (i = 0 ;i < n ;i ++ ) {
12951296if (i + 1 != MtmNodeId ) {
12961297void * data = RaftableGet (psprintf ("node-mask-%d" ,i + 1 ),NULL ,NULL ,nowait );
@@ -1301,7 +1302,12 @@ MtmBuildConnectivityMatrix(nodemask_t* matrix, bool nowait)
13011302}else {
13021303matrix [i ]= Mtm -> connectivityMask ;
13031304}
1305+ for (j = 0 ;j < n ;j ++ ) {
1306+ putc (BIT_CHECK (matrix [i ],j ) ?'X' :'+' ,stderr );
1307+ }
1308+ putc ('\n' ,stderr );
13041309}
1310+ fputs ("-----------------------\n" ,stderr );
13051311/* make matrix symetric: required for Bron–Kerbosch algorithm */
13061312for (i = 0 ;i < n ;i ++ ) {
13071313for (j = 0 ;j < i ;j ++ ) {
@@ -1332,6 +1338,17 @@ bool MtmRefreshClusterStatus(bool nowait)
13321338
13331339clique = MtmFindMaxClique (matrix ,Mtm -> nAllNodes ,& clique_size );
13341340if (clique_size >=Mtm -> nAllNodes /2 + 1 ) {/* have quorum */
1341+ fprintf (stderr ,"Old mask: " );
1342+ for (i = 0 ;i < Mtm -> nAllNodes ;i ++ ) {
1343+ putc (BIT_CHECK (Mtm -> disabledNodeMask ,i ) ?'-' :'+' ,stderr );
1344+ }
1345+ putc ('\n' ,stderr );
1346+ fprintf (stderr ,"New mask: " );
1347+ for (i = 0 ;i < Mtm -> nAllNodes ;i ++ ) {
1348+ putc (BIT_CHECK (clique ,i ) ?'+' :'-' ,stderr );
1349+ }
1350+ putc ('\n' ,stderr );
1351+
13351352MTM_LOG1 ("Find clique %lx, disabledNodeMask %lx" , (long )clique , (long )Mtm -> disabledNodeMask );
13361353MtmLock (LW_EXCLUSIVE );
13371354mask = ~clique & (((nodemask_t )1 <<Mtm -> nAllNodes )- 1 )& ~Mtm -> disabledNodeMask ;/* new disabled nodes mask */