| /external/skia/tests/ |
| D | PathOpsTightBoundsTest.cpp | 22 for (int lIndex = 0; lIndex < lineCount; ++lIndex) { in testTightBoundsLines() local
67 for (int lIndex = 0; lIndex < lineCount; ++lIndex) { in testTightBoundsQuads() local
|
| /external/skqp/tests/ |
| D | PathOpsTightBoundsTest.cpp | 22 for (int lIndex = 0; lIndex < lineCount; ++lIndex) { in testTightBoundsLines() local
67 for (int lIndex = 0; lIndex < lineCount; ++lIndex) { in testTightBoundsQuads() local
|
| /external/skia/src/pathops/ |
| D | SkDQuadLineIntersection.cpp | 305 for (int lIndex = 0; lIndex < 2; ++lIndex) { in addLineNearEndPoints() local
306 double lineT = (double) lIndex; in addLineNearEndPoints()
311 (*fLine)[lIndex], (*fLine)[!lIndex]); in addLineNearEndPoints()
315 fIntersections->insert(quadT, lineT, (*fLine)[lIndex]); in addLineNearEndPoints()
|
| D | SkDCubicLineIntersection.cpp | 300 for (int lIndex = 0; lIndex < 2; ++lIndex) { in addLineNearEndPoints() local
301 double lineT = (double) lIndex; in addLineNearEndPoints()
306 fLine[lIndex], fLine[!lIndex]); in addLineNearEndPoints()
310 fIntersections->insert(cubicT, lineT, fLine[lIndex]); in addLineNearEndPoints()
|
| D | SkDConicLineIntersection.cpp | 205 for (int lIndex = 0; lIndex < 2; ++lIndex) { in addLineNearEndPoints() local
206 double lineT = (double) lIndex; in addLineNearEndPoints()
211 (*fLine)[lIndex], (*fLine)[!lIndex]); in addLineNearEndPoints()
215 fIntersections->insert(conicT, lineT, (*fLine)[lIndex]); in addLineNearEndPoints()
|
| D | SkPathOpsTSect.cpp | 1086 for (int lIndex = 0; lIndex < (int) SK_ARRAY_COUNT(thisLine.fPts); ++lIndex) { in linesIntersect() local
1087 ptMatches += thisRayI.pt(tIndex).approximatelyEqual(thisLine.fPts[lIndex]); in linesIntersect()
1097 for (int lIndex = 0; lIndex < (int) SK_ARRAY_COUNT(oppLine.fPts); ++lIndex) { in linesIntersect() local
1098 ptMatches += oppRayI.pt(oIndex).approximatelyEqual(oppLine.fPts[lIndex]); in linesIntersect()
|
| /external/skqp/src/pathops/ |
| D | SkDQuadLineIntersection.cpp | 305 for (int lIndex = 0; lIndex < 2; ++lIndex) { in addLineNearEndPoints() local
306 double lineT = (double) lIndex; in addLineNearEndPoints()
311 (*fLine)[lIndex], (*fLine)[!lIndex]); in addLineNearEndPoints()
315 fIntersections->insert(quadT, lineT, (*fLine)[lIndex]); in addLineNearEndPoints()
|
| D | SkDCubicLineIntersection.cpp | 300 for (int lIndex = 0; lIndex < 2; ++lIndex) { in addLineNearEndPoints() local
301 double lineT = (double) lIndex; in addLineNearEndPoints()
306 fLine[lIndex], fLine[!lIndex]); in addLineNearEndPoints()
310 fIntersections->insert(cubicT, lineT, fLine[lIndex]); in addLineNearEndPoints()
|
| D | SkDConicLineIntersection.cpp | 205 for (int lIndex = 0; lIndex < 2; ++lIndex) { in addLineNearEndPoints() local
206 double lineT = (double) lIndex; in addLineNearEndPoints()
211 (*fLine)[lIndex], (*fLine)[!lIndex]); in addLineNearEndPoints()
215 fIntersections->insert(conicT, lineT, (*fLine)[lIndex]); in addLineNearEndPoints()
|
| D | SkPathOpsTSect.cpp | 1086 for (int lIndex = 0; lIndex < (int) SK_ARRAY_COUNT(thisLine.fPts); ++lIndex) { in linesIntersect() local
1087 ptMatches += thisRayI.pt(tIndex).approximatelyEqual(thisLine.fPts[lIndex]); in linesIntersect()
1097 for (int lIndex = 0; lIndex < (int) SK_ARRAY_COUNT(oppLine.fPts); ++lIndex) { in linesIntersect() local
1098 ptMatches += oppRayI.pt(oIndex).approximatelyEqual(oppLine.fPts[lIndex]); in linesIntersect()
|
| /external/pdfium/third_party/libopenjpeg20/ |
| D | mct.c | 554 OPJ_UINT32 i, j, lIndex; in opj_calculate_norms() local
561 lIndex = i; in opj_calculate_norms()
564 lCurrentValue = lMatrix[lIndex]; in opj_calculate_norms()
565 lIndex += pNbComps; in opj_calculate_norms()
|