Home
last modified time | relevance | path

Searched refs:lIndex (Results 1 – 13 of 13) sorted by relevance

/external/angle/src/libANGLE/renderer/metal/shaders/
Dgen_mipmap.metal40 kernel void generate3DMipmaps(uint lIndex [[thread_index_in_threadgroup]],
75 lIndex = 0xffffffff;
90 TEXEL_STORE(lIndex, texel1);
95 if ((lIndex & 0x49) == 0) // (lIndex & b1001001) == 0
101 float4 texel2 = OUT_OF_BOUND_CHECK(texel1, TEXEL_LOAD(lIndex + 1), atEdge.x);
103 float4 texel3 = OUT_OF_BOUND_CHECK(texel1, TEXEL_LOAD(lIndex + kThreadGroupX), atEdge.y);
105 float4 texel4 = OUT_OF_BOUND_CHECK(texel1, TEXEL_LOAD(lIndex + kThreadGroupXY), atEdge.z);
107 float4 texel5 = OUT_OF_BOUND_CHECK(texel2, TEXEL_LOAD(lIndex + (kThreadGroupX + 1)),
110 float4 texel6 = OUT_OF_BOUND_CHECK(texel2, TEXEL_LOAD(lIndex + (kThreadGroupXY + 1)),
114 texel3, TEXEL_LOAD(lIndex + (kThreadGroupXY + kThreadGroupX)), atEdge.y | atEdge.z);
[all …]
Dmtl_default_shaders_src_autogen.inc947 kernel void generate3DMipmaps(uint lIndex [[thread_index_in_threadgroup]],
982 lIndex = 0xffffffff;
997 sR[lIndex] = texel1.r; sG[lIndex] = texel1.g; sB[lIndex] = texel1.b; sA[lIndex] = texel1.a;;
1002 if ((lIndex & 0x49) == 0)
1008 …oat4 texel2 = (atEdge.x) ? (texel1) : (float4(sR[lIndex + 1], sG[lIndex + 1], sB[lIndex + 1], sA[l…
1010 …oat4 texel3 = (atEdge.y) ? (texel1) : (float4(sR[lIndex + 8], sG[lIndex + 8], sB[lIndex + 8], sA[l…
1012 …l4 = (atEdge.z) ? (texel1) : (float4(sR[lIndex + (8 * 8)], sG[lIndex + (8 * 8)], sB[lIndex + (8 * …
1014 …e.x | atEdge.y) ? (texel2) : (float4(sR[lIndex + (8 + 1)], sG[lIndex + (8 + 1)], sB[lIndex + (8 + …
1017 …dge.z) ? (texel2) : (float4(sR[lIndex + ((8 * 8) + 1)], sG[lIndex + ((8 * 8) + 1)], sB[lIndex + ((…
1020 …dge.z) ? (texel3) : (float4(sR[lIndex + ((8 * 8) + 8)], sG[lIndex + ((8 * 8) + 8)], sB[lIndex + ((…
[all …]
/external/skia/tests/
DPathOpsTightBoundsTest.cpp21 for (int lIndex = 0; lIndex < lineCount; ++lIndex) { in testTightBoundsLines() local
66 for (int lIndex = 0; lIndex < lineCount; ++lIndex) { in testTightBoundsQuads() local
/external/skqp/tests/
DPathOpsTightBoundsTest.cpp22 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/
DSkDQuadLineIntersection.cpp305 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()
DSkDCubicLineIntersection.cpp300 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()
DSkDConicLineIntersection.cpp205 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()
DSkPathOpsTSect.cpp1087 for (int lIndex = 0; lIndex < (int) SK_ARRAY_COUNT(thisLine.fPts); ++lIndex) { in linesIntersect() local
1088 ptMatches += thisRayI.pt(tIndex).approximatelyEqual(thisLine.fPts[lIndex]); in linesIntersect()
1098 for (int lIndex = 0; lIndex < (int) SK_ARRAY_COUNT(oppLine.fPts); ++lIndex) { in linesIntersect() local
1099 ptMatches += oppRayI.pt(oIndex).approximatelyEqual(oppLine.fPts[lIndex]); in linesIntersect()
/external/skqp/src/pathops/
DSkDQuadLineIntersection.cpp305 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()
DSkDConicLineIntersection.cpp205 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()
DSkDCubicLineIntersection.cpp300 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()
DSkPathOpsTSect.cpp1086 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/
Dmct.c554 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()