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
|
// Copyright 2013 The Chromium Authors. All rights reserved.
// Use of this source code is governed by a BSD-style license that can be
// found in the LICENSE file.
#include <cmath>
#include "cc/output/filter_operations.h"
#include "base/values.h"
#include "cc/output/filter_operation.h"
namespace cc {
FilterOperations::FilterOperations() {}
FilterOperations::FilterOperations(const FilterOperations& other)
: operations_(other.operations_) {}
FilterOperations::~FilterOperations() {}
FilterOperations& FilterOperations::operator=(const FilterOperations& other) {
operations_ = other.operations_;
return *this;
}
bool FilterOperations::operator==(const FilterOperations& other) const {
if (other.size() != size())
return false;
for (size_t i = 0; i < size(); ++i) {
if (other.at(i) != at(i))
return false;
}
return true;
}
void FilterOperations::Append(const FilterOperation& filter) {
operations_.push_back(filter);
}
void FilterOperations::Clear() {
operations_.clear();
}
bool FilterOperations::IsEmpty() const {
return operations_.empty();
}
static int SpreadForStdDeviation(float std_deviation) {
// https://dvcs.w3.org/hg/FXTF/raw-file/tip/filters/index.html#feGaussianBlurElement
// provides this approximation for evaluating a gaussian blur by a triple box
// filter.
float d = floorf(std_deviation * 3.f * sqrt(8.f * atan(1.f)) / 4.f + 0.5f);
return static_cast<int>(ceilf(d * 3.f / 2.f));
}
void FilterOperations::GetOutsets(int* top,
int* right,
int* bottom,
int* left) const {
*top = *right = *bottom = *left = 0;
for (size_t i = 0; i < operations_.size(); ++i) {
const FilterOperation& op = operations_[i];
// TODO(ajuma): Add support for reference filters once SkImageFilter
// reports its outsets.
DCHECK(op.type() != FilterOperation::REFERENCE);
if (op.type() == FilterOperation::BLUR ||
op.type() == FilterOperation::DROP_SHADOW) {
int spread = SpreadForStdDeviation(op.amount());
if (op.type() == FilterOperation::BLUR) {
*top += spread;
*right += spread;
*bottom += spread;
*left += spread;
} else {
*top += spread - op.drop_shadow_offset().y();
*right += spread + op.drop_shadow_offset().x();
*bottom += spread + op.drop_shadow_offset().y();
*left += spread - op.drop_shadow_offset().x();
}
}
}
}
bool FilterOperations::HasFilterThatMovesPixels() const {
for (size_t i = 0; i < operations_.size(); ++i) {
const FilterOperation& op = operations_[i];
// TODO(ajuma): Once SkImageFilter reports its outsets, use those here to
// determine whether a reference filter really moves pixels.
switch (op.type()) {
case FilterOperation::BLUR:
case FilterOperation::DROP_SHADOW:
case FilterOperation::ZOOM:
case FilterOperation::REFERENCE:
return true;
case FilterOperation::OPACITY:
case FilterOperation::COLOR_MATRIX:
case FilterOperation::GRAYSCALE:
case FilterOperation::SEPIA:
case FilterOperation::SATURATE:
case FilterOperation::HUE_ROTATE:
case FilterOperation::INVERT:
case FilterOperation::BRIGHTNESS:
case FilterOperation::CONTRAST:
case FilterOperation::SATURATING_BRIGHTNESS:
case FilterOperation::ALPHA_THRESHOLD:
break;
}
}
return false;
}
bool FilterOperations::HasFilterThatAffectsOpacity() const {
for (size_t i = 0; i < operations_.size(); ++i) {
const FilterOperation& op = operations_[i];
// TODO(ajuma): Make this smarter for reference filters. Once SkImageFilter
// can report affectsOpacity(), call that.
switch (op.type()) {
case FilterOperation::OPACITY:
case FilterOperation::BLUR:
case FilterOperation::DROP_SHADOW:
case FilterOperation::ZOOM:
case FilterOperation::REFERENCE:
case FilterOperation::ALPHA_THRESHOLD:
return true;
case FilterOperation::COLOR_MATRIX: {
const SkScalar* matrix = op.matrix();
if (matrix[15] ||
matrix[16] ||
matrix[17] ||
matrix[18] != 1 ||
matrix[19])
return true;
break;
}
case FilterOperation::GRAYSCALE:
case FilterOperation::SEPIA:
case FilterOperation::SATURATE:
case FilterOperation::HUE_ROTATE:
case FilterOperation::INVERT:
case FilterOperation::BRIGHTNESS:
case FilterOperation::CONTRAST:
case FilterOperation::SATURATING_BRIGHTNESS:
break;
}
}
return false;
}
bool FilterOperations::HasReferenceFilter() const {
for (size_t i = 0; i < operations_.size(); ++i) {
if (operations_[i].type() == FilterOperation::REFERENCE)
return true;
}
return false;
}
FilterOperations FilterOperations::Blend(const FilterOperations& from,
double progress) const {
if (HasReferenceFilter() || from.HasReferenceFilter())
return *this;
bool from_is_longer = from.size() > size();
size_t shorter_size, longer_size;
if (size() == from.size()) {
shorter_size = longer_size = size();
} else if (from_is_longer) {
longer_size = from.size();
shorter_size = size();
} else {
longer_size = size();
shorter_size = from.size();
}
for (size_t i = 0; i < shorter_size; i++) {
if (from.at(i).type() != at(i).type())
return *this;
}
FilterOperations blended_filters;
for (size_t i = 0; i < shorter_size; i++) {
blended_filters.Append(
FilterOperation::Blend(&from.at(i), &at(i), progress));
}
if (from_is_longer) {
for (size_t i = shorter_size; i < longer_size; i++) {
blended_filters.Append(
FilterOperation::Blend(&from.at(i), NULL, progress));
}
} else {
for (size_t i = shorter_size; i < longer_size; i++)
blended_filters.Append(FilterOperation::Blend(NULL, &at(i), progress));
}
return blended_filters;
}
scoped_ptr<base::Value> FilterOperations::AsValue() const {
scoped_ptr<base::ListValue> value(new base::ListValue);
for (size_t i = 0; i < operations_.size(); ++i)
value->Append(operations_[i].AsValue().release());
return value.PassAs<base::Value>();
}
} // namespace cc
|
