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
|
/* 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 */
#ifndef TABLEINFO_PS_HPP
#define TABLEINFO_PS_HPP
#include <Vector.hpp>
#include <ndb_types.h>
#include <string.h>
#include <NdbMem.h>
struct TableInfo {
Uint32 tableId;
char* tableName;
};
/**
* @class TableInfoPS
* @brief Meta information about tables stored on PS
*/
class TableInfoPs {
public:
inline void insert(const Uint32 tableId, const char * tableName);
inline bool del(const Uint32 tableId);
inline char * getTableName(const Uint32 tableId) const;
private:
Vector<struct TableInfo*> tableInfo;
inline TableInfo * lookup(const Uint32 tableId) const;
inline TableInfo * lookup(const Uint32 tableId , Uint32 * pos) const;
};
inline
TableInfo *
TableInfoPs::lookup(const Uint32 tableId) const{
TableInfo * table;
Uint32 i=0;
while(i<tableInfo.size()) {
table=tableInfo[i];
if(table->tableId == tableId)
return table;
i++;
}
return 0;
}
inline
TableInfo *
TableInfoPs::lookup(const Uint32 tableId, Uint32 * pos ) const{
TableInfo * table;
Uint32 i=0;
while(i<tableInfo.size()) {
table=tableInfo[i];
if(table->tableId == tableId) {
*pos=i;
return table;
}
i++;
}
return 0;
}
inline
char *
TableInfoPs::getTableName(const Uint32 tableId) const{
TableInfo * table;
table=lookup(tableId);
if(table!=0)
return table->tableName;
return 0;
}
inline
void
TableInfoPs::insert(const Uint32 tableId, const char * tableName) {
TableInfo * table = new TableInfo;
table->tableId=tableId;
table->tableName=strdup(tableName);
tableInfo.push_back(table);
}
inline
bool
TableInfoPs::del(const Uint32 tableId) {
TableInfo * table;
Uint32 i=0;
table = lookup(tableId, &i);
if(table!=0) {
NdbMem_Free(table->tableName);
delete table;
tableInfo.erase(i);
return true;
}
return false;
}
#endif
|
