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
|
/* Copyright (C) 2003 MySQL AB
This program is free software; you can redistribute it and/or modify
it under the terms of the GNU General Public License as published by
the Free Software Foundation; version 2 of the License.
This program is distributed in the hope that it will be useful,
but WITHOUT ANY WARRANTY; without even the implied warranty of
MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
GNU General Public License for more details.
You should have received a copy of the GNU General Public License
along with this program; if not, write to the Free Software
Foundation, Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301, USA */
#include <RefConvert.hpp>
#include <signaldata/LCP.hpp>
#include <DebuggerNames.hpp>
bool
printSTART_LCP_REQ(FILE * output, const Uint32 * theData,
Uint32 len, Uint16 receiverBlockNo){
const StartLcpReq * const sig = (StartLcpReq *) theData;
char buf1[8*_NDB_NODE_BITMASK_SIZE+1];
char buf2[8*_NDB_NODE_BITMASK_SIZE+1];
fprintf(output,
" Sender: %d LcpId: %d\n"
" ParticipatingDIH = %s\n"
" ParticipatingLQH = %s\n",
refToNode(sig->senderRef), sig->lcpId,
sig->participatingDIH.getText(buf1),
sig->participatingLQH.getText(buf2));
return true;
}
bool
printSTART_LCP_CONF(FILE * output, const Uint32 * theData,
Uint32 len, Uint16 receiverBlockNo){
const StartLcpConf * const sig = (StartLcpConf *) theData;
fprintf(output, " Sender: %d LcpId: %d\n",
refToNode(sig->senderRef), sig->lcpId);
return true;
}
bool
printLCP_FRAG_ORD(FILE * output, const Uint32 * theData,
Uint32 len, Uint16 receiverBlockNo){
const LcpFragOrd * const sig = (LcpFragOrd *) theData;
fprintf(output, " LcpId: %d LcpNo: %d Table: %d Fragment: %d\n",
sig->lcpId, sig->lcpNo, sig->tableId, sig->fragmentId);
fprintf(output, " KeepGCI: %d LastFragmentFlag: %d\n",
sig->keepGci, sig->lastFragmentFlag);
return true;
}
bool
printLCP_FRAG_REP(FILE * output, const Uint32 * theData,
Uint32 len, Uint16 receiverBlockNo){
const LcpFragRep * const sig = (LcpFragRep *) theData;
fprintf(output, " LcpId: %d LcpNo: %d NodeId: %d Table: %d Fragment: %d\n",
sig->lcpId, sig->lcpNo, sig->nodeId, sig->tableId, sig->fragId);
fprintf(output, " Max GCI Started: %d Max GCI Completed: %d\n",
sig->maxGciStarted, sig->maxGciCompleted);
return true;
}
bool
printLCP_COMPLETE_REP(FILE * output, const Uint32 * theData,
Uint32 len, Uint16 receiverBlockNo){
const LcpCompleteRep * const sig = (LcpCompleteRep *) theData;
fprintf(output, " LcpId: %d NodeId: %d Block: %s\n",
sig->lcpId, sig->nodeId, getBlockName(sig->blockNo));
return true;
}
|
