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
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
251
252
253
254
255
256
257
258
259
260
261
262
263
264
265
266
267
268
269
270
271
272
273
274
275
276
277
278
279
280
281
282
283
284
285
286
287
288
289
290
291
292
293
294
295
296
297
298
299
300
301
302
303
304
305
306
307
|
/**
* Copyright (C) 2014 MongoDB Inc.
*
* This program is free software: you can redistribute it and/or modify
* it under the terms of the GNU Affero General Public License, version 3,
* as published by the Free Software Foundation.
*
* 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 Affero General Public License for more details.
*
* You should have received a copy of the GNU Affero General Public License
* along with this program. If not, see <http://www.gnu.org/licenses/>.
*
* As a special exception, the copyright holders give permission to link the
* code of portions of this program with the OpenSSL library under certain
* conditions as described in each individual source file and distribute
* linked combinations including the program with the OpenSSL library. You
* must comply with the GNU Affero General Public License in all respects for
* all of the code used other than as permitted herein. If you modify file(s)
* with this exception, you may extend this exception to your version of the
* file(s), but you are not obligated to do so. If you do not wish to do so,
* delete this exception statement from your version. If you delete this
* exception statement from all source files in the program, then also delete
* it in the license file.
*/
#pragma once
#include <queue>
#include "mongo/db/concurrency/fast_map_noalloc.h"
#include "mongo/util/concurrency/spin_lock.h"
#include "mongo/db/concurrency/locker.h"
namespace mongo {
/**
* Notfication callback, which stores the last notification result and signals a condition
* variable, which can be waited on.
*/
class CondVarLockGrantNotification : public LockGrantNotification {
MONGO_DISALLOW_COPYING(CondVarLockGrantNotification);
public:
CondVarLockGrantNotification();
/**
* Clears the object so it can be reused.
*/
void clear();
/**
* Uninterruptible blocking method, which waits for the notification to fire.
*
* @param timeoutMs How many milliseconds to wait before returning LOCK_TIMEOUT.
*/
LockResult wait(unsigned timeoutMs);
private:
virtual void notify(ResourceId resId, LockResult result);
// These two go together to implement the conditional variable pattern.
boost::mutex _mutex;
boost::condition_variable _cond;
// Result from the last call to notify
LockResult _result;
};
/**
* Interface for acquiring locks. One of those objects will have to be instantiated for each
* request (transaction).
*
* Lock/unlock methods must always be called from a single thread.
*
* All instances reference a single global lock manager.
*
* @param IsForMMAPV1 Whether to compile-in the flush lock functionality, which is specific to
* the way the MMAP V1 (legacy) storag engine does commit concurrency control.
*/
template<bool IsForMMAPV1>
class LockerImpl : public Locker {
public:
/**
* Instantiates new locker. Must be given a unique identifier for disambiguation. Lockers
* having the same identifier will not conflict on lock acquisition.
*/
LockerImpl();
virtual ~LockerImpl();
virtual LockerId getId() const { return _id; }
virtual LockResult lockGlobal(LockMode mode, unsigned timeoutMs = UINT_MAX);
virtual LockResult lockGlobalBegin(LockMode mode);
virtual LockResult lockGlobalComplete(unsigned timeoutMs);
virtual void downgradeGlobalXtoSForMMAPV1();
virtual bool unlockAll();
virtual void beginWriteUnitOfWork();
virtual void endWriteUnitOfWork();
virtual bool inAWriteUnitOfWork() const { return _wuowNestingLevel > 0; }
virtual LockResult lock(ResourceId resId,
LockMode mode,
unsigned timeoutMs = UINT_MAX,
bool checkDeadlock = false);
virtual void downgrade(ResourceId resId, LockMode newMode);
virtual bool unlock(ResourceId resId);
virtual LockMode getLockMode(ResourceId resId) const;
virtual bool isLockHeldForMode(ResourceId resId, LockMode mode) const;
virtual bool isDbLockedForMode(const StringData& dbName, LockMode mode) const;
virtual bool isCollectionLockedForMode(const StringData& ns, LockMode mode) const;
virtual ResourceId getWaitingResource() const;
virtual void getLockerInfo(LockerInfo* lockerInfo) const;
virtual bool saveLockStateAndUnlock(LockSnapshot* stateOut);
virtual void restoreLockState(const LockSnapshot& stateToRestore);
/**
* Allows for lock requests to be requested in a non-blocking way. There can be only one
* outstanding pending lock request per locker object.
*
* lockBegin posts a request to the lock manager for the specified lock to be acquired,
* which either immediately grants the lock, or puts the requestor on the conflict queue
* and returns immediately with the result of the acquisition. The result can be one of:
*
* LOCK_OK - Nothing more needs to be done. The lock is granted.
* LOCK_WAITING - The request has been queued up and will be granted as soon as the lock
* is free. If this result is returned, typically lockComplete needs to be called in
* order to wait for the actual grant to occur. If the caller no longer needs to wait
* for the grant to happen, unlock needs to be called with the same resource passed
* to lockBegin.
*
* In other words for each call to lockBegin, which does not return LOCK_OK, there needs to
* be a corresponding call to either lockComplete or unlock.
*/
LockResult lockBegin(ResourceId resId, LockMode mode);
/**
* Waits for the completion of a lock, previously requested through lockBegin or
* lockGlobalBegin. Must only be called, if lockBegin returned LOCK_WAITING. The resId
* argument must match what was previously passed to lockBegin.
*/
LockResult lockComplete(ResourceId resId, unsigned timeoutMs, bool checkDeadlock);
private:
friend class AutoYieldFlushLockForMMAPV1Commit;
typedef FastMapNoAlloc<ResourceId, LockRequest, 16> LockRequestsMap;
/**
* The main functionality of the unlock method, except accepts iterator in order to avoid
* additional lookups during unlockAll.
*/
bool _unlockImpl(LockRequestsMap::Iterator& it);
/**
* MMAP V1 locking code yields and re-acquires the flush lock occasionally in order to
* allow the flush thread proceed. This call returns in what mode the flush lock should be
* acquired. It is based on the type of the operation (IS for readers, IX for writers).
*/
LockMode _getModeForMMAPV1FlushLock() const;
// Used to disambiguate different lockers
const LockerId _id;
// The only reason we have this spin lock here is for the diagnostic tools, which could
// iterate through the LockRequestsMap on a separate thread and need it to be stable.
// Apart from that, all accesses to the LockerImpl are always from a single thread.
//
// This has to be locked inside const methods, hence the mutable.
mutable SpinLock _lock;
LockRequestsMap _requests;
// Reuse the notification object across requests so we don't have to create a new mutex
// and condition variable every time.
CondVarLockGrantNotification _notify;
// Delays release of exclusive/intent-exclusive locked resources until the write unit of
// work completes. Value of 0 means we are not inside a write unit of work.
int _wuowNestingLevel;
std::queue<ResourceId> _resourcesToUnlockAtEndOfUnitOfWork;
// For maintaining locking timing statistics
Timer _timer;
//////////////////////////////////////////////////////////////////////////////////////////
//
// Methods merged from LockState, which should eventually be removed or changed to methods
// on the LockerImpl interface.
//
public:
virtual void dump() const;
virtual bool isW() const;
virtual bool isR() const;
virtual bool isLocked() const;
virtual bool isWriteLocked() const;
virtual bool isReadLocked() const;
virtual void assertEmpty() const;
virtual bool hasLockPending() const { return getWaitingResource().isValid() || _lockPendingParallelWriter; }
virtual void setIsBatchWriter(bool newValue) { _batchWriter = newValue; }
virtual bool isBatchWriter() const { return _batchWriter; }
virtual void setLockPendingParallelWriter(bool newValue) {
_lockPendingParallelWriter = newValue;
}
private:
bool _batchWriter;
bool _lockPendingParallelWriter;
};
typedef LockerImpl<false> DefaultLockerImpl;
typedef LockerImpl<true> MMAPV1LockerImpl;
/**
* At global synchronization points, such as drop database we are running under a global
* exclusive lock and without an active write unit of work, doing changes which require global
* commit. This utility allows the flush lock to be temporarily dropped so the flush thread
* could run in such circumstances. Should not be used where write units of work are used,
* because these have different mechanism of yielding the flush lock.
*/
class AutoYieldFlushLockForMMAPV1Commit {
public:
AutoYieldFlushLockForMMAPV1Commit(Locker* locker);
~AutoYieldFlushLockForMMAPV1Commit();
private:
MMAPV1LockerImpl* const _locker;
};
/**
* This explains how the MMAP V1 durability system is implemented.
*
* Every server operation (OperationContext), must call Locker::lockGlobal as the first lock
* action (it is illegal to acquire any other locks without calling this first). This action
* acquires the global and flush locks in the appropriate modes (IS for read operations, IX
* for write operations). Having the flush lock in one of these modes indicates to the flush
* thread that there is an active reader or writer.
*
* Whenever the flush thread(dur.cpp) activates, it goes through the following steps :
*
* Acquire the flush lock in S mode using AutoAcquireFlushLockForMMAPV1Commit. This waits until
* all current write activity on the system completes and does not allow any new operations to
* start.
*
* Once the S lock is granted, the flush thread writes the journal entries to disk (it is
* guaranteed that there will not be any modifications) and applies them to the shared view.
*
* After that, it upgrades the S lock to X and remaps the private view.
*
* NOTE: There should be only one usage of this class and this should be in dur.cpp
*/
class AutoAcquireFlushLockForMMAPV1Commit {
public:
AutoAcquireFlushLockForMMAPV1Commit(Locker* locker);
~AutoAcquireFlushLockForMMAPV1Commit();
/**
* We need the exclusive lock in order to do the shared view remap.
*/
void upgradeFlushLockToExclusive();
/**
* Allows the acquired flush lock to be prematurely released. This is helpful for the case
* where we know that we won't be doing a remap after gathering the write intents, so the
* rest can be done outside of flush lock.
*/
void release();
private:
MMAPV1LockerImpl* const _locker;
};
/**
* Retrieves the global lock manager instance.
*/
LockManager* getGlobalLockManager();
} // namespace mongo
|