Searched refs:fEdges (Results 1 – 10 of 10) sorted by relevance
| /external/chromium_org/third_party/skia/src/gpu/effects/ |
| D | GrConvexPolyEffect.h | 69 const SkScalar* getEdges() const { return fEdges; } in getEdges()
84 SkScalar fEdges[3 * kMaxEdges]; variable
|
| D | GrConvexPolyEffect.cpp | 344 memcpy(fEdges, edges, 3 * n * sizeof(SkScalar)); in GrConvexPolyEffect()
348 fEdges[3 * i + 2] += SK_ScalarHalf; in GrConvexPolyEffect()
357 0 == memcmp(cpe.fEdges, fEdges, 3 * fEdgeCount * sizeof(SkScalar))); in onIsEqual()
|
| /external/skia/src/gpu/effects/ |
| D | GrConvexPolyEffect.h | 68 const SkScalar* getEdges() const { return fEdges; } in getEdges()
83 SkScalar fEdges[3 * kMaxEdges]; variable
|
| D | GrConvexPolyEffect.cpp | 337 memcpy(fEdges, edges, 3 * n * sizeof(SkScalar)); in GrConvexPolyEffect()
341 fEdges[3 * i + 2] += SK_ScalarHalf; in GrConvexPolyEffect()
350 0 == memcmp(cpe.fEdges, fEdges, 3 * fEdgeCount * sizeof(SkScalar))); in onIsEqual()
|
| /external/skia/experimental/Intersection/ |
| D | SkAntiEdge.cpp | 331 SkAntiEdge* edge = fEdges.append(); in build()
334 edge = fEdges.append(); in build()
337 int result = fEdges.count(); in build()
338 fEdges.setCount(--result); in build()
343 *fList.append() = &fEdges[index]; in build()
350 for (SkAntiEdge* active = fEdges.begin(); active != fEdges.end(); ++active) { in calc()
503 SkAntiEdge* tail = fEdges.end(); in link()
505 SkAntiEdge* prev = fEdges.begin(); in link()
520 prev = fEdges.begin() - 1; in link()
556 SkAntiEdge* lower = fEdges.append(); in split()
|
| D | SkAntiEdge.h | 66 SkTDArray<SkAntiEdge> fEdges; variable
|
| D | EdgeWalker.cpp | 362 OutEdge& newEdge = fEdges.push_back(); in addCurve()
370 size_t count = fEdges.count(); in trimLine()
372 OutEdge& edge = fEdges[count]; in trimLine()
397 size_t listCount = fEdges.count(); in assemble()
422 SkPoint* ptArray = fEdges[listIndex].fPts; in assemble()
423 uint8_t verb = fEdges[listIndex].fVerb; in assemble()
628 size_t count = fEdges.count(); in bridge()
644 QSort<SkTArray<OutEdge>, int>(fEdges, order.begin(), order.end() - 1, lessThan); in bridge()
650 const OutEdge& left = fEdges[leftOutIndex]; in bridge()
654 const OutEdge& right = fEdges[rightOutIndex]; in bridge()
[all …]
|
| /external/chromium_org/third_party/skia/experimental/Intersection/ |
| D | SkAntiEdge.cpp | 331 SkAntiEdge* edge = fEdges.append(); in build()
334 edge = fEdges.append(); in build()
337 int result = fEdges.count(); in build()
338 fEdges.setCount(--result); in build()
343 *fList.append() = &fEdges[index]; in build()
350 for (SkAntiEdge* active = fEdges.begin(); active != fEdges.end(); ++active) { in calc()
503 SkAntiEdge* tail = fEdges.end(); in link()
505 SkAntiEdge* prev = fEdges.begin(); in link()
520 prev = fEdges.begin() - 1; in link()
556 SkAntiEdge* lower = fEdges.append(); in split()
|
| D | SkAntiEdge.h | 66 SkTDArray<SkAntiEdge> fEdges; variable
|
| D | EdgeWalker.cpp | 362 OutEdge& newEdge = fEdges.push_back(); in addCurve()
370 size_t count = fEdges.count(); in trimLine()
372 OutEdge& edge = fEdges[count]; in trimLine()
397 size_t listCount = fEdges.count(); in assemble()
422 SkPoint* ptArray = fEdges[listIndex].fPts; in assemble()
423 uint8_t verb = fEdges[listIndex].fVerb; in assemble()
628 size_t count = fEdges.count(); in bridge()
644 QSort<SkTArray<OutEdge>, int>(fEdges, order.begin(), order.end() - 1, lessThan); in bridge()
650 const OutEdge& left = fEdges[leftOutIndex]; in bridge()
654 const OutEdge& right = fEdges[rightOutIndex]; in bridge()
[all …]
|