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
|
/* Copyright (C) 2006 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., 59 Temple Place, Suite 330, Boston, MA 02111-1307 USA */
// RecoveryObjects.cpp: implementation of the RecoveryObjects class.
//
//////////////////////////////////////////////////////////////////////
#include <memory.h>
#include <stdio.h>
#include "Engine.h"
#include "RecoveryObjects.h"
#include "RecoveryPage.h"
#include "SerialLog.h"
#include "SyncObject.h"
#include "Sync.h"
#ifdef _DEBUG
#undef THIS_FILE
static const char THIS_FILE[]=__FILE__;
#endif
//////////////////////////////////////////////////////////////////////
// Construction/Destruction
//////////////////////////////////////////////////////////////////////
RecoveryObjects::RecoveryObjects(SerialLog *log)
{
serialLog = log;
memset(recoveryObjects, 0, sizeof(recoveryObjects));
for (int n = 0; n < RPG_HASH_SIZE; n++)
syncArray[n].setName("RecoveryObjects::syncArray");
}
RecoveryObjects::~RecoveryObjects()
{
clear();
}
void RecoveryObjects::clear()
{
for (int n = 0; n < RPG_HASH_SIZE; ++n)
for (RecoveryPage *object; (object = recoveryObjects[n]);)
{
recoveryObjects[n] = object->collision;
delete object;
}
}
bool RecoveryObjects::bumpIncarnation(int objectNumber, int tableSpaceId, int state, bool pass1)
{
RecoveryPage *object = getRecoveryObject(objectNumber, tableSpaceId);
if (object->state != state)
{
if (pass1)
++object->pass1Count;
else
++object->currentCount;
object->state = state;
}
if (pass1)
return object->pass1Count == 1;
return object->pass1Count == object->currentCount;
}
void RecoveryObjects::reset()
{
for (int n = 0; n < RPG_HASH_SIZE; ++n)
for (RecoveryPage *object = recoveryObjects[n]; object; object = object->collision)
{
object->currentCount = 0;
object->state = 0;
}
}
bool RecoveryObjects::isObjectActive(int objectNumber, int tableSpaceId)
{
RecoveryPage *object = findRecoveryObject(objectNumber, tableSpaceId);
if (!object)
return true;
return object->pass1Count == object->currentCount;
}
static inline RecoveryPage * findInHashBucket(RecoveryPage *head, int objectNumber, int tableSpaceId)
{
for (RecoveryPage *object = head ; object; object = object->collision)
if (object->objectNumber == objectNumber && object->tableSpaceId == tableSpaceId)
return object;
return NULL;
}
RecoveryPage* RecoveryObjects::findRecoveryObject(int objectNumber, int tableSpaceId)
{
int slot = objectNumber % RPG_HASH_SIZE;
Sync sync(&syncArray[slot], "RecoveryObjects::findRecoveryObject");
sync.lock(Shared);
return findInHashBucket(recoveryObjects[slot], objectNumber, tableSpaceId);
}
void RecoveryObjects::setActive(int objectNumber, int tableSpaceId)
{
RecoveryPage *object = findRecoveryObject(objectNumber, tableSpaceId);
if (!object)
return;
object->pass1Count = 0;
object->currentCount = 0;
}
void RecoveryObjects::setInactive(int objectNumber, int tableSpaceId)
{
RecoveryPage *object = getRecoveryObject(objectNumber, tableSpaceId);
object->pass1Count = 0;
object->currentCount = 1;
}
RecoveryPage* RecoveryObjects::getRecoveryObject(int objectNumber, int tableSpaceId)
{
int slot = objectNumber % RPG_HASH_SIZE;
RecoveryPage *object;
Sync sync(&syncArray[slot], "RecoveryObjects::getRecoveryObject");
sync.lock(Shared);
object = findInHashBucket(recoveryObjects[slot], objectNumber, tableSpaceId);
if(object)
return object;
// Object not found, insert (need exlusive lock for this)
sync.unlock();
sync.lock(Exclusive);
// We need to traverse the collision list once again. Another thread
// may have inserted the entry while current thread was waiting
// for exclusive lock.
object = findInHashBucket(recoveryObjects[slot], objectNumber, tableSpaceId);
if (object)
return object;
// Add object to the start of the collision list
object = new RecoveryPage(objectNumber, tableSpaceId);
object->collision = recoveryObjects[slot];
recoveryObjects[slot] = object;
return object;
}
void RecoveryObjects::deleteObject(int objectNumber, int tableSpaceId)
{
int slot = objectNumber % RPG_HASH_SIZE;
Sync sync(&syncArray[slot], "RecoveryObjects::deleteObject");
sync.lock(Exclusive);
for (RecoveryPage **ptr = recoveryObjects + slot, *object; (object = *ptr); ptr = &object->collision)
if (object->objectNumber == objectNumber && object->tableSpaceId == tableSpaceId)
{
*ptr = object->collision;
delete object;
return;
}
}
int RecoveryObjects::getCurrentState(int objectNumber, int tableSpaceId)
{
RecoveryPage *object = findRecoveryObject(objectNumber, tableSpaceId);
return (object) ? object->state : objUnknown;
}
|