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
|
/*
* 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.
*/
#ifndef THIRD_PARTY_BLINK_RENDERER_CORE_ANIMATION_DOCUMENT_ANIMATIONS_H_
#define THIRD_PARTY_BLINK_RENDERER_CORE_ANIMATION_DOCUMENT_ANIMATIONS_H_
#include "third_party/blink/renderer/core/animation/animation.h"
#include "third_party/blink/renderer/core/dom/document_lifecycle.h"
#include "third_party/blink/renderer/platform/heap/member.h"
namespace blink {
class AnimationTimeline;
class CSSScrollTimeline;
class Document;
class PaintArtifactCompositor;
class CORE_EXPORT DocumentAnimations final
: public GarbageCollected<DocumentAnimations> {
public:
DocumentAnimations(Document*);
~DocumentAnimations() = default;
uint64_t TransitionGeneration() const {
return current_transition_generation_;
}
void IncrementTrasitionGeneration() { current_transition_generation_++; }
void AddTimeline(AnimationTimeline&);
void UpdateAnimationTimingForAnimationFrame();
bool NeedsAnimationTimingUpdate();
void UpdateAnimationTimingIfNeeded();
void GetAnimationsTargetingTreeScope(HeapVector<Member<Animation>>&,
const TreeScope&);
// Updates existing animations as part of generating a new (document
// lifecycle) frame. Note that this considers and updates state for
// both composited and non-composited animations.
void UpdateAnimations(
DocumentLifecycle::LifecycleState required_lifecycle_state,
const PaintArtifactCompositor* paint_artifact_compositor);
size_t GetAnimationsCount();
void MarkAnimationsCompositorPending();
HeapVector<Member<Animation>> getAnimations(const TreeScope&);
// All newly created AnimationTimelines are considered "unvalidated". This
// means that the internal state of the timeline is considered tentative,
// and that computing the actual state may require an additional style/layout
// pass.
//
// The lifecycle update will call this function after style and layout has
// completed. The function will then go though all unvalidated timelines,
// and compare the current state snapshot to a fresh state snapshot. If they
// are equal, then the tentative state turned out to be correct, and no
// further action is needed. Otherwise, all effects targets associated with
// the timeline are marked for recalc, which causes the style/layout phase
// to run again.
//
// https://github.com/w3c/csswg-drafts/issues/5261
void ValidateTimelines();
void CacheCSSScrollTimeline(CSSScrollTimeline&);
CSSScrollTimeline* FindCachedCSSScrollTimeline(const AtomicString&);
const HeapHashSet<WeakMember<AnimationTimeline>>& GetTimelinesForTesting()
const {
return timelines_;
}
const HeapHashSet<WeakMember<AnimationTimeline>>&
GetUnvalidatedTimelinesForTesting() const {
return unvalidated_timelines_;
}
uint64_t current_transition_generation_;
void Trace(Visitor*) const;
protected:
using ReplaceableAnimationsMap =
HeapHashMap<Member<Element>, Member<HeapVector<Member<Animation>>>>;
void RemoveReplacedAnimations(ReplaceableAnimationsMap*);
private:
Member<Document> document_;
HeapHashSet<WeakMember<AnimationTimeline>> timelines_;
HeapHashSet<WeakMember<AnimationTimeline>> unvalidated_timelines_;
// We cache CSSScrollTimelines by name, such that multiple animations using
// the same timeline can use the same CSSScrollTimeline instance.
//
// Note that timelines present in |cached_css_timelines_| are also present
// in |timelines_|.
HeapHashMap<AtomicString, WeakMember<AnimationTimeline>>
cached_css_timelines_;
};
} // namespace blink
#endif
|
