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
|
/*
* 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 TimingCalculations_h
#define TimingCalculations_h
#include "core/animation/AnimationEffectReadOnly.h"
#include "core/animation/Timing.h"
#include "platform/animation/AnimationUtilities.h"
#include "wtf/MathExtras.h"
namespace blink {
static inline double multiplyZeroAlwaysGivesZero(double x, double y) {
DCHECK(!isNull(x));
DCHECK(!isNull(y));
return x && y ? x * y : 0;
}
static inline AnimationEffectReadOnly::Phase calculatePhase(
double activeDuration,
double localTime,
const Timing& specified) {
DCHECK_GE(activeDuration, 0);
if (isNull(localTime))
return AnimationEffectReadOnly::PhaseNone;
double endTime = specified.startDelay + activeDuration + specified.endDelay;
if (localTime < std::min(specified.startDelay, endTime))
return AnimationEffectReadOnly::PhaseBefore;
if (localTime >= std::min(specified.startDelay + activeDuration, endTime))
return AnimationEffectReadOnly::PhaseAfter;
return AnimationEffectReadOnly::PhaseActive;
}
static inline bool isActiveInParentPhase(
AnimationEffectReadOnly::Phase parentPhase,
Timing::FillMode fillMode) {
switch (parentPhase) {
case AnimationEffectReadOnly::PhaseBefore:
return fillMode == Timing::FillMode::BACKWARDS ||
fillMode == Timing::FillMode::BOTH;
case AnimationEffectReadOnly::PhaseActive:
return true;
case AnimationEffectReadOnly::PhaseAfter:
return fillMode == Timing::FillMode::FORWARDS ||
fillMode == Timing::FillMode::BOTH;
default:
NOTREACHED();
return false;
}
}
static inline double calculateActiveTime(
double activeDuration,
Timing::FillMode fillMode,
double localTime,
AnimationEffectReadOnly::Phase parentPhase,
AnimationEffectReadOnly::Phase phase,
const Timing& specified) {
DCHECK_GE(activeDuration, 0);
DCHECK_EQ(phase, calculatePhase(activeDuration, localTime, specified));
switch (phase) {
case AnimationEffectReadOnly::PhaseBefore:
if (fillMode == Timing::FillMode::BACKWARDS ||
fillMode == Timing::FillMode::BOTH)
return 0;
return nullValue();
case AnimationEffectReadOnly::PhaseActive:
if (isActiveInParentPhase(parentPhase, fillMode))
return localTime - specified.startDelay;
return nullValue();
case AnimationEffectReadOnly::PhaseAfter:
if (fillMode == Timing::FillMode::FORWARDS ||
fillMode == Timing::FillMode::BOTH)
return std::max(
0.0, std::min(activeDuration, activeDuration + specified.endDelay));
return nullValue();
case AnimationEffectReadOnly::PhaseNone:
DCHECK(isNull(localTime));
return nullValue();
default:
NOTREACHED();
return nullValue();
}
}
static inline double calculateScaledActiveTime(double activeDuration,
double activeTime,
double startOffset,
const Timing& specified) {
DCHECK_GE(activeDuration, 0);
DCHECK_GE(startOffset, 0);
if (isNull(activeTime))
return nullValue();
DCHECK(activeTime >= 0 && activeTime <= activeDuration);
if (specified.playbackRate == 0)
return startOffset;
if (!std::isfinite(activeTime))
return std::numeric_limits<double>::infinity();
return multiplyZeroAlwaysGivesZero(specified.playbackRate < 0
? activeTime - activeDuration
: activeTime,
specified.playbackRate) +
startOffset;
}
static inline bool endsOnIterationBoundary(double iterationCount,
double iterationStart) {
DCHECK(std::isfinite(iterationCount));
return !fmod(iterationCount + iterationStart, 1);
}
// TODO(crbug.com/630915): Align this function with current Web Animations spec
// text.
static inline double calculateIterationTime(
double iterationDuration,
double repeatedDuration,
double scaledActiveTime,
double startOffset,
AnimationEffectReadOnly::Phase phase,
const Timing& specified) {
DCHECK_GT(iterationDuration, 0);
DCHECK_EQ(repeatedDuration, multiplyZeroAlwaysGivesZero(
iterationDuration, specified.iterationCount));
if (isNull(scaledActiveTime))
return nullValue();
DCHECK_GE(scaledActiveTime, 0);
DCHECK_LE(scaledActiveTime, repeatedDuration + startOffset);
if (!std::isfinite(scaledActiveTime) ||
(scaledActiveTime - startOffset == repeatedDuration &&
specified.iterationCount &&
endsOnIterationBoundary(specified.iterationCount,
specified.iterationStart)))
return iterationDuration;
DCHECK(std::isfinite(scaledActiveTime));
double iterationTime = fmod(scaledActiveTime, iterationDuration);
// This implements step 3 of
// http://w3c.github.io/web-animations/#calculating-the-simple-iteration-progress
if (iterationTime == 0 && phase == AnimationEffectReadOnly::PhaseAfter &&
repeatedDuration != 0 && scaledActiveTime != 0)
return iterationDuration;
return iterationTime;
}
static inline double calculateCurrentIteration(double iterationDuration,
double iterationTime,
double scaledActiveTime,
const Timing& specified) {
DCHECK_GT(iterationDuration, 0);
DCHECK(isNull(iterationTime) || iterationTime >= 0);
if (isNull(scaledActiveTime))
return nullValue();
DCHECK_GE(iterationTime, 0);
DCHECK_LE(iterationTime, iterationDuration);
DCHECK_GE(scaledActiveTime, 0);
if (!scaledActiveTime)
return 0;
if (iterationTime == iterationDuration)
return specified.iterationStart + specified.iterationCount - 1;
return floor(scaledActiveTime / iterationDuration);
}
static inline double calculateDirectedTime(double currentIteration,
double iterationDuration,
double iterationTime,
const Timing& specified) {
DCHECK(isNull(currentIteration) || currentIteration >= 0);
DCHECK_GT(iterationDuration, 0);
if (isNull(iterationTime))
return nullValue();
DCHECK_GE(currentIteration, 0);
DCHECK_GE(iterationTime, 0);
DCHECK_LE(iterationTime, iterationDuration);
const bool currentIterationIsOdd = fmod(currentIteration, 2) >= 1;
const bool currentDirectionIsForwards =
specified.direction == Timing::PlaybackDirection::NORMAL ||
(specified.direction == Timing::PlaybackDirection::ALTERNATE_NORMAL &&
!currentIterationIsOdd) ||
(specified.direction == Timing::PlaybackDirection::ALTERNATE_REVERSE &&
currentIterationIsOdd);
return currentDirectionIsForwards ? iterationTime
: iterationDuration - iterationTime;
}
static inline double calculateTransformedTime(double currentIteration,
double iterationDuration,
double iterationTime,
const Timing& specified) {
DCHECK(isNull(currentIteration) || currentIteration >= 0);
DCHECK_GT(iterationDuration, 0);
DCHECK(isNull(iterationTime) ||
(iterationTime >= 0 && iterationTime <= iterationDuration));
double directedTime = calculateDirectedTime(
currentIteration, iterationDuration, iterationTime, specified);
if (isNull(directedTime))
return nullValue();
if (!std::isfinite(iterationDuration))
return directedTime;
double timeFraction = directedTime / iterationDuration;
DCHECK(timeFraction >= 0 && timeFraction <= 1);
return multiplyZeroAlwaysGivesZero(
iterationDuration,
specified.timingFunction->evaluate(
timeFraction, accuracyForDuration(iterationDuration)));
}
} // namespace blink
#endif
|