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
|
/*
* Copyright (C) 2010 Google Inc. All rights reserved.
*
* Redistribution and use in source and binary forms, with or without
* modification, are permitted provided that the following conditions
* are met:
*
* 1. Redistributions of source code must retain the above copyright
* notice, this list of conditions and the following disclaimer.
* 2. Redistributions in binary form must reproduce the above copyright
* notice, this list of conditions and the following disclaimer in the
* documentation and/or other materials provided with the distribution.
*
* THIS SOFTWARE IS PROVIDED BY APPLE AND ITS CONTRIBUTORS "AS IS" AND ANY
* EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED
* WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE
* DISCLAIMED. IN NO EVENT SHALL APPLE OR ITS CONTRIBUTORS BE LIABLE FOR ANY
* DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES
* (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES;
* LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND
* ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT
* (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF
* THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
*/
#include "config.h"
#include "IDBTransactionCoordinator.h"
#if ENABLE(INDEXED_DATABASE)
#include "IDBDatabaseBackendImpl.h"
#include "IDBTransactionBackendImpl.h"
namespace WebCore {
PassOwnPtr<IDBTransactionCoordinator> IDBTransactionCoordinator::create()
{
return adoptPtr(new IDBTransactionCoordinator());
}
IDBTransactionCoordinator::IDBTransactionCoordinator()
{
}
IDBTransactionCoordinator::~IDBTransactionCoordinator()
{
}
void IDBTransactionCoordinator::didCreateTransaction(IDBTransactionBackendImpl* transaction)
{
ASSERT(!m_transactions.contains(transaction));
m_transactions.add(transaction, transaction);
}
void IDBTransactionCoordinator::didStartTransaction(IDBTransactionBackendImpl* transaction)
{
ASSERT(m_transactions.contains(transaction));
m_queuedTransactions.add(transaction);
processStartedTransactions();
}
void IDBTransactionCoordinator::didFinishTransaction(IDBTransactionBackendImpl* transaction)
{
ASSERT(m_transactions.contains(transaction));
if (m_queuedTransactions.contains(transaction)) {
ASSERT(!m_startedTransactions.contains(transaction));
m_queuedTransactions.remove(transaction);
} else if (m_startedTransactions.contains(transaction))
m_startedTransactions.remove(transaction);
m_transactions.remove(transaction);
processStartedTransactions();
}
#ifndef NDEBUG
// Verifies internal consistiency while returning whether anything is found.
bool IDBTransactionCoordinator::isActive(IDBTransactionBackendImpl* transaction)
{
bool found = false;
if (m_queuedTransactions.contains(transaction))
found = true;
if (m_startedTransactions.contains(transaction)) {
ASSERT(!found);
found = true;
}
ASSERT(found == m_transactions.contains(transaction));
return found;
}
#endif
void IDBTransactionCoordinator::processStartedTransactions()
{
if (m_queuedTransactions.isEmpty())
return;
ASSERT(m_startedTransactions.isEmpty() || (*m_startedTransactions.begin())->mode() != IndexedDB::TransactionVersionChange);
ListHashSet<IDBTransactionBackendImpl*>::const_iterator it = m_queuedTransactions.begin();
while (it != m_queuedTransactions.end()) {
IDBTransactionBackendImpl* transaction = *it;
++it;
if (canRunTransaction(transaction)) {
m_queuedTransactions.remove(transaction);
m_startedTransactions.add(transaction);
transaction->run();
}
}
}
static bool doScopesOverlap(const HashSet<int64_t>& scope1, const HashSet<int64_t>& scope2)
{
for (HashSet<int64_t>::const_iterator it = scope1.begin(); it != scope1.end(); ++it) {
if (scope2.contains(*it))
return true;
}
return false;
}
bool IDBTransactionCoordinator::canRunTransaction(IDBTransactionBackendImpl* transaction)
{
ASSERT(m_queuedTransactions.contains(transaction));
switch (transaction->mode()) {
case IndexedDB::TransactionVersionChange:
ASSERT(m_queuedTransactions.size() == 1);
ASSERT(m_startedTransactions.isEmpty());
return true;
case IndexedDB::TransactionReadOnly:
return true;
case IndexedDB::TransactionReadWrite:
for (HashSet<IDBTransactionBackendImpl*>::const_iterator it = m_startedTransactions.begin(); it != m_startedTransactions.end(); ++it) {
if ((*it)->mode() == IndexedDB::TransactionReadWrite && doScopesOverlap(transaction->scope(), (*it)->scope()))
return false;
}
for (ListHashSet<IDBTransactionBackendImpl*>::const_iterator it = m_queuedTransactions.begin(); *it != transaction; ++it) {
ASSERT(it != m_queuedTransactions.end());
if ((*it)->mode() == IndexedDB::TransactionReadWrite && doScopesOverlap(transaction->scope(), (*it)->scope()))
return false;
}
return true;
}
ASSERT_NOT_REACHED();
return false;
}
};
#endif // ENABLE(INDEXED_DATABASE)
|
