1
/* Copyright (C) 2003 MySQL AB
3
This program is free software; you can redistribute it and/or modify
4
it under the terms of the GNU General Public License as published by
5
the Free Software Foundation; version 2 of the License.
7
This program is distributed in the hope that it will be useful,
8
but WITHOUT ANY WARRANTY; without even the implied warranty of
9
MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
10
GNU General Public License for more details.
12
You should have received a copy of the GNU General Public License
13
along with this program; if not, write to the Free Software
14
Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA 02111-1307 USA */
16
#ifndef CHECKNODEGROUPS_H
17
#define CHECKNODEGROUPS_H
20
#include <NodeBitmask.hpp>
21
#include "SignalData.hpp"
22
#include "SignalDataPrint.hpp"
25
* Ask DIH to check if a node set can survive i.e. if it
26
* has at least one node in every node group. Returns one
27
* of Win, Lose, Partitioning.
29
* Same class is used for REQ and CONF. The REQ can also
30
* be executed as a direct signal.
32
class CheckNodeGroups {
34
Uint32 blockRef; // sender's node id
36
Uint32 requestType; // direct flag, output code
40
Uint32 nodeId; // nodeId input for GetNodeGroupMembers
41
NodeBitmask mask; /* set of NDB nodes, input for ArbitCheck,
42
* output for GetNodeGroupMembers
48
GetNodeGroupMembers = 0x8
52
Lose = 1, // we cannot survive
53
Win = 2, // we and only we can survive
54
Partitioning = 3 // possible network partitioning
57
STATIC_CONST( SignalLength = 3 + NodeBitmask::Size );