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
|
/*
* Copyright (C) 2013 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:
*
* * Redistributions of source code must retain the above copyright
* notice, this list of conditions and the following disclaimer.
* * 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.
* * Neither the name of Google Inc. nor the names of its
* contributors may be used to endorse or promote products derived from
* this software without specific prior written permission.
*
* THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND 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 THE COPYRIGHT
* OWNER OR 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 "core/dom/DocumentLifecycle.h"
#include "wtf/Assertions.h"
namespace WebCore {
static DocumentLifecycle::DeprecatedTransition* s_deprecatedTransitionStack = 0;
DocumentLifecycle::Scope::Scope(DocumentLifecycle& lifecycle, State finalState)
: m_lifecycle(lifecycle)
, m_finalState(finalState)
{
}
DocumentLifecycle::Scope::~Scope()
{
m_lifecycle.advanceTo(m_finalState);
}
DocumentLifecycle::DeprecatedTransition::DeprecatedTransition(State from, State to)
: m_previous(s_deprecatedTransitionStack)
, m_from(from)
, m_to(to)
{
s_deprecatedTransitionStack = this;
}
DocumentLifecycle::DeprecatedTransition::~DeprecatedTransition()
{
s_deprecatedTransitionStack = m_previous;
}
DocumentLifecycle::DocumentLifecycle()
: m_state(Uninitialized)
, m_detachCount(0)
{
}
DocumentLifecycle::~DocumentLifecycle()
{
}
#if ASSERT_ENABLED
bool DocumentLifecycle::canAdvanceTo(State state) const
{
if (state > m_state)
return true;
if (m_state == Disposed) {
// FIXME: We can dispose a document multiple times. This seems wrong.
// See https://code.google.com/p/chromium/issues/detail?id=301668.
return state == Disposed;
}
if (m_state == StyleClean) {
// We can synchronously recalc style.
if (state == InStyleRecalc)
return true;
// We can synchronously perform layout.
if (state == InPreLayout)
return true;
if (state == InPerformLayout)
return true;
// We can redundant arrive in the style clean state.
if (state == StyleClean)
return true;
return false;
}
if (m_state == InPreLayout) {
if (state == InStyleRecalc)
return true;
if (state == StyleClean)
return true;
if (state == InPreLayout)
return true;
return false;
}
if (m_state == AfterPerformLayout) {
// We can synchronously recompute layout in AfterPerformLayout.
// FIXME: Ideally, we would unnest this recursion into a loop.
return state == InPreLayout;
}
if (m_state == LayoutClean) {
// We can synchronously recalc style.
if (state == InStyleRecalc)
return true;
// We can synchronously perform layout.
if (state == InPreLayout)
return true;
if (state == InPerformLayout)
return true;
// We can redundant arrive in the layout clean state. This situation
// can happen when we call layout recursively and we unwind the stack.
if (state == LayoutClean)
return true;
if (state == StyleClean)
return true;
return false;
}
if (m_state == CompositingClean) {
if (state == InStyleRecalc)
return true;
if (state == InPreLayout)
return true;
if (state == InCompositingUpdate)
return true;
return false;
}
return false;
}
bool DocumentLifecycle::canRewindTo(State state) const
{
// This transition is bogus, but we've whitelisted it anyway.
if (s_deprecatedTransitionStack && m_state == s_deprecatedTransitionStack->from() && state == s_deprecatedTransitionStack->to())
return true;
return m_state == StyleClean || m_state == AfterPerformLayout || m_state == LayoutClean || m_state == CompositingClean;
}
#endif
void DocumentLifecycle::advanceTo(State state)
{
ASSERT(canAdvanceTo(state));
m_state = state;
}
void DocumentLifecycle::ensureStateAtMost(State state)
{
ASSERT(state == VisualUpdatePending || state == StyleClean || state == LayoutClean);
if (m_state <= state)
return;
ASSERT(canRewindTo(state));
m_state = state;
}
}
|
