| /external/chromium_org/third_party/skia/experimental/PdfViewer/pdfparser/native/ |
| H A D | SkPdfNativeObject.cpp | 113 SkPdfReportIf(!fUsed, kInfo_SkPdfIssueSeverity, kUnusedObject_SkPdfIssue,
|
| H A D | SkPdfNativeObject.h | 113 mutable bool fUsed; member in class:SkPdfNativeObject
139 , fUsed(false)
|
| /external/skia/experimental/Intersection/ |
| H A D | LineQuadraticIntersection.cpp | 143 return intersections.fUsed;
172 return intersections.fUsed;
201 return intersections.fUsed;
261 int roots = intersections.fUsed;
|
| H A D | QuadraticIntersection.cpp | 268 for (int uIndex = 0; uIndex < i.fUsed; ) {
321 int remaining = --i.fUsed - uIndex;
399 if (i.fUsed && i.fCoincidentUsed) {
|
| H A D | LineIntersection.cpp | 31 if ((i.fUsed = used) == 2) {
34 return i.fUsed;
|
| H A D | LineQuadraticIntersection_Test.cpp | 53 result = intersections.fUsed;
|
| H A D | QuadraticImplicit.cpp | 115 SkASSERT(i.fUsed < 3);
328 i.fUsed = 2;
|
| H A D | CubicIntersection.cpp | 70 for (int s = 0; s < i.fUsed; ++s) {
119 SkDebugf(" xlocals.fUsed=%d\n", xlocals.used());
|
| H A D | EdgeWalker.cpp | 75 return intersections.fUsed;
91 return intersections.fUsed;
101 return intersections.fUsed;
|
| H A D | Simplify.cpp | 169 return intersections.fUsed;
189 return intersections.fUsed;
|
| /external/skia/experimental/PdfViewer/pdfparser/native/ |
| H A D | SkPdfNativeObject.cpp | 113 SkPdfReportIf(!fUsed, kInfo_SkPdfIssueSeverity, kUnusedObject_SkPdfIssue,
|
| H A D | SkPdfNativeObject.h | 113 mutable bool fUsed; member in class:SkPdfNativeObject
139 , fUsed(false)
|
| /external/chromium_org/third_party/skia/src/pathops/ |
| H A D | SkDQuadLineIntersection.cpp | 376 fUsed = q.intersectRay(fT[0]);
377 for (int index = 0; index < fUsed; ++index) {
380 return fUsed;
|
| H A D | SkDCubicLineIntersection.cpp | 398 fUsed = c.intersectRay(fT[0]);
399 for (int index = 0; index < fUsed; ++index) {
402 return fUsed;
|
| /external/skia/src/pathops/ |
| H A D | SkDQuadLineIntersection.cpp | 376 fUsed = q.intersectRay(fT[0]);
377 for (int index = 0; index < fUsed; ++index) {
380 return fUsed;
|
| H A D | SkDCubicLineIntersection.cpp | 398 fUsed = c.intersectRay(fT[0]);
399 for (int index = 0; index < fUsed; ++index) {
402 return fUsed;
|
| /external/chromium_org/third_party/skia/experimental/Intersection/ |
| H A D | QuadraticIntersection.cpp | 268 for (int uIndex = 0; uIndex < i.fUsed; ) {
321 int remaining = --i.fUsed - uIndex;
399 if (i.fUsed && i.fCoincidentUsed) {
|
| H A D | LineIntersection.cpp | 31 if ((i.fUsed = used) == 2) {
34 return i.fUsed;
|
| H A D | LineQuadraticIntersection_Test.cpp | 53 result = intersections.fUsed;
|
| H A D | QuadraticImplicit.cpp | 115 SkASSERT(i.fUsed < 3);
328 i.fUsed = 2;
|
| H A D | CubicIntersection.cpp | 70 for (int s = 0; s < i.fUsed; ++s) {
119 SkDebugf(" xlocals.fUsed=%d\n", xlocals.used());
|
| H A D | EdgeWalker.cpp | 75 return intersections.fUsed;
91 return intersections.fUsed;
101 return intersections.fUsed;
|
| H A D | Simplify.cpp | 169 return intersections.fUsed;
189 return intersections.fUsed;
|