| /external/swiftshader/src/Renderer/ |
| Primitive.hpp | 66 struct Span
72 // The rasterizer adds a zero length span to the top and bottom of the polygon to allow
74 Span outlineUnderflow[2];
75 Span outline[OUTLINE_RESOLUTION];
76 Span outlineOverflow[2];
|
| QuadRasterizer.cpp | 120 Int x0a = Int(*Pointer<Short>(primitive + OFFSET(Primitive,outline->left) + (y + 0) * sizeof(Primitive::Span)));
121 Int x0b = Int(*Pointer<Short>(primitive + OFFSET(Primitive,outline->left) + (y + 1) * sizeof(Primitive::Span)));
126 x0a = Int(*Pointer<Short>(primitive + q * sizeof(Primitive) + OFFSET(Primitive,outline->left) + (y + 0) * sizeof(Primitive::Span)));
127 x0b = Int(*Pointer<Short>(primitive + q * sizeof(Primitive) + OFFSET(Primitive,outline->left) + (y + 1) * sizeof(Primitive::Span)));
133 Int x1a = Int(*Pointer<Short>(primitive + OFFSET(Primitive,outline->right) + (y + 0) * sizeof(Primitive::Span)));
134 Int x1b = Int(*Pointer<Short>(primitive + OFFSET(Primitive,outline->right) + (y + 1) * sizeof(Primitive::Span)));
139 x1a = Int(*Pointer<Short>(primitive + q * sizeof(Primitive) + OFFSET(Primitive,outline->right) + (y + 0) * sizeof(Primitive::Span)));
140 x1b = Int(*Pointer<Short>(primitive + q * sizeof(Primitive) + OFFSET(Primitive,outline->right) + (y + 1) * sizeof(Primitive::Span)));
271 xLeft[q] = *Pointer<Short4>(primitive + q * sizeof(Primitive) + OFFSET(Primitive,outline) + y * sizeof(Primitive::Span));
|
| /prebuilts/tools/linux-x86_64/kythe/proto/ |
| common.proto | 44 // A Span represents an inclusive-exclusive range inside of a file or buffer.
45 message Span {
|
| /external/skia/src/core/ |
| SkLinearBitmapPipeline_core.h | 18 // span then becomes a normal span except in special cases where an extra Y is given. The bilerp
21 // - edge span predicate.
46 // The Span class enables efficient processing horizontal spans of pixels.
47 // * start - the point where to start the span.
57 class Span {
59 Span(SkPoint start, SkScalar length, int count)
77 Span emptySpan() { return Span{{0.0, 0.0}, 0.0f, 0}; }
89 Span breakAt(SkScalar breakX, SkScalar dx)
[all...] |
| SkLinearBitmapPipeline_matrix.h | 26 bool maybeProcessSpan(Span span, Next* next) const {
28 std::tie(start, length, count) = span;
29 next->pointSpan(Span{start + SkPoint{fXOffset, fYOffset}, length, count});
48 bool maybeProcessSpan(Span span, Next* next) const {
50 std::tie(start, length, count) = span;
54 next->pointSpan(Span{newStart, newLength, count});
78 bool maybeProcessSpan(Span span, Next* next) const
[all...] |
| SkLinearBitmapPipeline_tile.h | 30 * value should be a border color. For this case, create the span using clampToSinglePixel.
44 bool maybeProcessSpan(Span originalSpan, Next* next) {
50 Span span{{x, y}, length, count};
52 if (span.completelyWithin(0.0f, fXMax)) {
53 next->pointSpan(span);
79 // corresponding to 5 samples specified in the A, B span. The distance from A to the next
80 // span starting at C is 5 * dx, so count * dx.
84 // * Under - for portions of the span < xMin, take the color at pixel {xMin, y} and use it
86 // * Middle - for the portion of the span between xMin and xMax sample normally
[all...] |
| SkLinearBitmapPipeline_sample.h | 261 static void src_strategy_blend(Span span, Next* next, Strategy* strategy) {
265 std::tie(start, length, count) = span;
327 void pointSpan(Span span) override {
328 SkASSERT(!span.isEmpty());
332 std::tie(start, length, count) = span;
335 this->spanSlowRate(span);
337 src_strategy_blend(span, fNext, &fAccessor);
339 this->spanFastRate(span);
[all...] |
| SkLinearBitmapPipeline.cpp | 31 // * maybeProcessSpan(span, next) - This represents a horizontal series of pixels
33 // span - encapsulation of span.
35 // maybeProcessSpan - returns false if it can not process the span and needs to fallback to
59 // The span you pass must not be empty.
60 void pointSpan(Span span) override {
61 SkASSERT(!span.isEmpty());
62 if (!fStrategy.maybeProcessSpan(span, fNext)) {
63 span_fallback(span, this)
[all...] |
| /frameworks/base/tools/aapt2/compile/ |
| PseudolocaleGenerator_test.cpp | 28 original_style.spans = {Span{"i", 1, 10}, Span{"b", 2, 3}, Span{"b", 6, 7}};
49 original_style.spans.insert(original_style.spans.begin(), Span{"em", 0, 11u});
75 original_style.spans = {Span{"b", 0, 3}, Span{"i", 0, 3}};
97 original_style.spans = {Span{"i", 2, 3}, Span{"b", 0, 1}};
119 original_style.spans = {Span{"b", 16u, 19u}, Span{"em", 29u, 47u}, Span{"i", 38u, 40u}
[all...] |
| /frameworks/base/tools/aapt2/ |
| StringPool.h | 34 struct Span {
42 std::vector<Span> spans;
135 struct Span {
145 std::vector<Span> spans;
|
| StringPool.cpp | 134 for (const Span& span : entry_->spans) {
135 const Span& rhs_span = *rhs_iter;
136 if (span.first_char != rhs_span.first_char || span.last_char != rhs_span.last_char ||
137 span.name != rhs_span.name) {
211 for (const aapt::Span& span : str.spans) {
212 entry->spans.emplace_back(Span{MakeRef(span.name), span.first_char, span.last_char})
424 android::ResStringPool_span* span = local
[all...] |
| Resources.proto | 241 // A Span marks a region of the string text that is styled.
242 message Span {
247 // The first character position this span applies to, in UTF-16 offset.
250 // The last character position this span applies to, in UTF-16 offset.
254 repeated Span span = 2;
|
| StringPool_test.cpp | 151 StringPool::StyleRef ref = pool.MakeRef(StyleString{{"android"}, {Span{{"b"}, 2, 6}}});
156 const StringPool::Span& span = ref->spans.front(); local
157 EXPECT_THAT(*span.name, Eq("b"));
158 EXPECT_THAT(span.first_char, Eq(2u));
159 EXPECT_THAT(span.last_char, Eq(6u));
236 pool.MakeRef(StyleString{{"style"}, {Span{{"b"}, 0, 1}, Span{{"i"}, 2, 3}}});
272 const ResStringPool_span* span = test.styleAt(0); local
273 ASSERT_THAT(span, NotNull())
[all...] |
| /external/skia/tests/ |
| SkLinearBitmapPipelineTest.cpp | 25 static SkString dump(SkScalar cut, Span prefix, Span remainder) {
38 Span span, SkScalar dx, SkScalar cut, SkPoint start, SkScalar len, int count) {
40 std::tie(originalStart, originalLen, originalCount) = span;
42 Span prefix = span.breakAt(cut, dx);
47 REPORTER_ASSERT_MESSAGE(reporter, prefixStart == start, dump(cut, prefix, span));
48 REPORTER_ASSERT_MESSAGE(reporter, prefixLen == len, dump(cut, prefix, span));
49 REPORTER_ASSERT_MESSAGE(reporter, prefixCount == count, dump(cut, prefix, span));
[all...] |
| /external/swiftshader/src/Shader/ |
| SetupRoutine.cpp | 231 *Pointer<Short>(leftEdge + y * sizeof(Primitive::Span)) = x;
232 *Pointer<Short>(rightEdge + y * sizeof(Primitive::Span)) = x;
254 For(, yMin < yMax && *Pointer<Short>(leftEdge + yMin * sizeof(Primitive::Span)) == *Pointer<Short>(rightEdge + yMin * sizeof(Primitive::Span)), yMin++)
259 For(, yMax > yMin && *Pointer<Short>(leftEdge + (yMax - 1) * sizeof(Primitive::Span)) == *Pointer<Short>(rightEdge + (yMax - 1) * sizeof(Primitive::Span)), yMax--)
269 *Pointer<Short>(leftEdge + (yMin - 1) * sizeof(Primitive::Span)) = *Pointer<Short>(leftEdge + yMin * sizeof(Primitive::Span));
270 *Pointer<Short>(rightEdge + (yMin - 1) * sizeof(Primitive::Span)) = *Pointer<Short>(leftEdge + yMin * sizeof(Primitive::Span));
[all...] |
| /prebuilts/go/darwin-x86/src/cmd/compile/internal/syntax/ |
| dumper.go | 101 // this permits printing of the unexported span and
103 // calling the Span() and Comment() instead of using
161 // if span, ok := x.Interface().(lexical.Span); ok {
162 // p.printf("%s", &span)
173 // p.printf("Span: %s\n", n.Span())
|
| /prebuilts/go/linux-x86/src/cmd/compile/internal/syntax/ |
| dumper.go | 101 // this permits printing of the unexported span and
103 // calling the Span() and Comment() instead of using
161 // if span, ok := x.Interface().(lexical.Span); ok {
162 // p.printf("%s", &span)
173 // p.printf("Span: %s\n", n.Span())
|
| /prebuilts/tools/common/m2/repository/io/opentracing/opentracing-impl/0.13.0/ |
| opentracing-impl-0.13.0.jar | |
| /prebuilts/tools/common/m2/repository/io/opentracing/opentracing-api/0.13.0/ |
| opentracing-api-0.13.0.jar | |
| /frameworks/support/v7/recyclerview/src/android/support/v7/widget/ |
| StaggeredGridLayoutManager.java | 80 * check if there are gaps in the because of full span items. If it finds, it will re-layout
112 Span[] mSpans;
126 * The width or height per span, depending on the orientation.
200 * If a full span item is invalid / or created in reverse direction; it may create gaps in
266 * When a full span item is laid out in reverse direction, it sets a flag which we check when
334 * Intermediate gaps created by full span items are tracked via mLaidOutInvalidFullSpan field.
388 // equal, check span indices.
400 private boolean checkSpanForGap(Span span) {
402 if (span.getEndLine() < mPrimaryOrientation.getEndAfterPadding())
[all...] |
| /prebuilts/go/darwin-x86/src/cmd/vet/ |
| shadow.go | 59 // Span stores the minimum range of byte positions in the file in which a
63 // shadowing variable is declared within the span of the shadowed variable.
69 // One wrinkle: A "naked return" is a silent use of a variable that the Span
79 type Span struct {
84 // contains reports whether the position is inside the span.
85 func (s Span) contains(pos token.Pos) bool {
89 // growSpan expands the span for the object to contain the instance represented
97 span, ok := pkg.spans[obj]
99 if span.min > pos {
100 span.min = po
[all...] |
| /prebuilts/go/linux-x86/src/cmd/vet/ |
| shadow.go | 59 // Span stores the minimum range of byte positions in the file in which a
63 // shadowing variable is declared within the span of the shadowed variable.
69 // One wrinkle: A "naked return" is a silent use of a variable that the Span
79 type Span struct {
84 // contains reports whether the position is inside the span.
85 func (s Span) contains(pos token.Pos) bool {
89 // growSpan expands the span for the object to contain the instance represented
97 span, ok := pkg.spans[obj]
99 if span.min > pos {
100 span.min = po
[all...] |
| /frameworks/base/core/java/android/os/ |
| StrictMode.java | 156 // How many Span tags (e.g. animations) to report.
2303 Span span = null; local
[all...] |
| /external/llvm/lib/CodeGen/AsmPrinter/ |
| DwarfDebug.cpp | [all...] |
| /external/eigen/unsupported/Eigen/src/Splines/ |
| Spline.h | 188 * \brief Returns the span within the knot vector in which u is falling.
189 * \param u The site for which the span is determined.
191 DenseIndex span(Scalar u) const;
196 static DenseIndex Span(typename SplineTraits<Spline>::Scalar u, DenseIndex degree, const typename SplineTraits<Spline>::KnotVectorType& knots);
234 DenseIndex Spline<_Scalar, _Dim, _Degree>::Span(
255 const DenseIndex i = Spline::Span(u, degree, knots);
291 DenseIndex Spline<_Scalar, _Dim, _Degree>::span(Scalar u) const function in class:Eigen::Spline
293 return Spline::Span(u, degree(), knots());
301 const DenseIndex span = this->span(u) local
324 const DenseIndex span = spline.span(u); local
386 const DenseIndex span = SplineType::Span(u, p, U); local
[all...] |
