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