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
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
|
/* 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; either version 2 of the License, or
(at your option) any later version.
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., 59 Temple Place, Suite 330, Boston, MA 02111-1307 USA */
#include <NDBT.hpp>
#include <NDBT_Test.hpp>
#include <HugoTransactions.hpp>
#include <UtilTransactions.hpp>
#include <NdbRestarter.hpp>
#include <Vector.hpp>
#include <ndbapi_limits.h>
const unsigned MaxTableAttrs = NDB_MAX_ATTRIBUTES_IN_TABLE;
const unsigned MaxIndexAttrs = NDB_MAX_ATTRIBUTES_IN_INDEX;
const unsigned MaxIndexes = 20;
static unsigned
urandom(unsigned n)
{
unsigned i = random();
return i % n;
}
static int
runDropIndex(NDBT_Context* ctx, NDBT_Step* step)
{
const NdbDictionary::Table* pTab = ctx->getTab();
Ndb* pNdb = GETNDB(step);
NdbDictionary::Dictionary* pDic = pNdb->getDictionary();
NdbDictionary::Dictionary::List list;
if (pDic->listIndexes(list, pTab->getName()) != 0) {
g_err << pTab->getName() << ": listIndexes failed" << endl;
ERR(pDic->getNdbError());
return NDBT_FAILED;
}
for (unsigned i = 0; i < list.count; i++) {
NDBT_Index* pInd = new NDBT_Index(list.elements[i].name);
pInd->setTable(pTab->getName());
g_info << "Drop index:" << endl << *pInd;
if (pInd->dropIndexInDb(pNdb) != 0) {
return NDBT_FAILED;
}
}
return NDBT_OK;
}
static Uint32 workaround[1000];
static void
setTableProperty(NDBT_Context* ctx, NDBT_Table* pTab, const char* name, Uint32 num)
{
char key[200];
sprintf(key, "%s-%s", name, pTab->getName());
//ctx->setProperty(key, num);
workaround[pTab->getTableId()] = num;
}
static Uint32
getTableProperty(NDBT_Context* ctx, NDBT_Table* pTab, const char* name)
{
char key[200];
sprintf(key, "%s-%s", name, pTab->getName());
//Uint32 num = ctx->getProperty(key, (Uint32)-1);
Uint32 num = workaround[pTab->getTableId()];
assert(num != (Uint32)-1);
return num;
}
static int
runCreateIndex(NDBT_Context* ctx, NDBT_Step* step)
{
srandom(1);
NDBT_Table* pTab = ctx->getTab();
Ndb* pNdb = GETNDB(step);
unsigned numTabAttrs = pTab->getNumAttributes();
unsigned numIndex = 0;
while (numIndex < MaxIndexes) {
if (numIndex != 0 && urandom(10) == 0)
break;
char buf[200];
sprintf(buf, "%s_X%03d", pTab->getName(), numIndex);
NDBT_Index* pInd = new NDBT_Index(buf);
pInd->setTable(pTab->getName());
pInd->setType(NdbDictionary::Index::OrderedIndex);
pInd->setLogging(false);
unsigned numAttrs = 0;
while (numAttrs < MaxIndexAttrs) {
if (numAttrs != 0 && urandom(5) == 0)
break;
unsigned i = urandom(numTabAttrs);
const NDBT_Attribute* pAttr = pTab->getAttribute(i);
bool found = false;
for (unsigned j = 0; j < numAttrs; j++) {
if (strcmp(pAttr->getName(), pInd->getAttribute(j)->getName()) == 0) {
found = true;
break;
}
}
if (found)
continue;
pInd->addAttribute(*pAttr);
numAttrs++;
}
g_info << "Create index:" << endl << *pInd;
if (pInd->createIndexInDb(pNdb, false) != 0)
continue;
numIndex++;
}
setTableProperty(ctx, pTab, "numIndex", numIndex);
g_info << "Created " << numIndex << " indexes on " << pTab->getName() << endl;
return NDBT_OK;
}
static int
runInsertUpdate(NDBT_Context* ctx, NDBT_Step* step)
{
NDBT_Table* pTab = ctx->getTab();
Ndb* pNdb = GETNDB(step);
int ret;
g_info << "Insert: " << pTab->getName() << endl;
HugoTransactions hugoTrans(*pTab);
ret = hugoTrans.loadTable(pNdb, ctx->getNumRecords(), 100);
if (ret != 0) {
g_err << "ERR: " << step->getName() << "failed" << endl;
return NDBT_FAILED;
}
return NDBT_OK;
}
static int
runFullScan(NDBT_Context* ctx, NDBT_Step* step)
{
NDBT_Table* pTab = ctx->getTab();
Ndb* pNdb = GETNDB(step);
unsigned cntIndex = getTableProperty(ctx, pTab, "numIndex");
for (unsigned numIndex = 0; numIndex < cntIndex; numIndex++) {
char buf[200];
sprintf(buf, "%s_X%03d", pTab->getName(), numIndex);
NDBT_Index* pInd = NDBT_Index::discoverIndexFromDb(pNdb, buf, pTab->getName());
assert(pInd != 0);
g_info << "Scan index:" << pInd->getName() << endl << *pInd;
NdbConnection* pCon = pNdb->startTransaction();
if (pCon == 0) {
ERR(pNdb->getNdbError());
return NDBT_FAILED;
}
NdbOperation* pOp = pCon->getNdbOperation(pInd->getName(),
pTab->getName());
if (pOp == 0) {
ERR(pCon->getNdbError());
pNdb->closeTransaction(pCon);
return NDBT_FAILED;
}
if (pOp->openScanRead() != 0) {
ERR(pCon->getNdbError());
pNdb->closeTransaction(pCon);
return NDBT_FAILED;
}
if (pCon->executeScan() != 0) {
ERR(pCon->getNdbError());
pNdb->closeTransaction(pCon);
return NDBT_FAILED;
}
unsigned rows = 0;
while (1) {
int ret = pCon->nextScanResult();
if (ret == 0) {
rows++;
} else if (ret == 1) {
break;
} else {
ERR(pCon->getNdbError());
pNdb->closeTransaction(pCon);
return NDBT_FAILED;
}
}
pNdb->closeTransaction(pCon);
g_info << "Scanned " << rows << " rows" << endl;
}
return NDBT_OK;
}
NDBT_TESTSUITE(testOrderedIndex);
TESTCASE(
"DropIndex",
"Drop any old indexes") {
INITIALIZER(runDropIndex);
}
TESTCASE(
"CreateIndex",
"Create ordered indexes") {
INITIALIZER(runCreateIndex);
}
TESTCASE(
"InsertUpdate",
"Run inserts and updates") {
INITIALIZER(runInsertUpdate);
}
TESTCASE(
"FullScan",
"Full scan on each ordered index") {
INITIALIZER(runFullScan);
}
NDBT_TESTSUITE_END(testOrderedIndex);
int
main(int argc, const char** argv)
{
ndb_init();
return testOrderedIndex.execute(argc, argv);
}
// vim: set sw=2:
|
