/external/skia/src/pathops/ |
SkDCubicToQuads.cpp | 36 SkDQuad quad; local 37 quad[0] = fPts[0]; 40 quad[1].fX = (fromC1.fX + fromC2.fX) / 2; 41 quad[1].fY = (fromC1.fY + fromC2.fY) / 2; 42 quad[2] = fPts[3]; 43 return quad;
|
SkPathOpsQuad.h | 90 static void SetABC(const double* quad, double* a, double* b, double* c); 93 SkDQuad quad; local 94 quad.set(a); 95 return quad.subDivide(t1, t2); 100 SkDQuad quad; local 101 quad.set(pts); 102 return quad.subDivide(a, c, t1, t2);
|
SkReduceOrder.cpp | 17 static int coincident_line(const SkDQuad& quad, SkDQuad& reduction) { 18 reduction[0] = reduction[1] = quad[0]; 26 static int vertical_line(const SkDQuad& quad, SkDQuad& reduction) { 27 reduction[0] = quad[0]; 28 reduction[1] = quad[2]; 32 static int horizontal_line(const SkDQuad& quad, SkDQuad& reduction) { 33 reduction[0] = quad[0]; 34 reduction[1] = quad[2]; 38 static int check_linear(const SkDQuad& quad, 40 if (!quad.isLinear(0, 2)) 247 SkDQuad quad; local [all...] |
/external/skqp/src/pathops/ |
SkDCubicToQuads.cpp | 36 SkDQuad quad; local 37 quad[0] = fPts[0]; 40 quad[1].fX = (fromC1.fX + fromC2.fX) / 2; 41 quad[1].fY = (fromC1.fY + fromC2.fY) / 2; 42 quad[2] = fPts[3]; 43 return quad;
|
SkPathOpsQuad.h | 90 static void SetABC(const double* quad, double* a, double* b, double* c); 93 SkDQuad quad; local 94 quad.set(a); 95 return quad.subDivide(t1, t2); 100 SkDQuad quad; local 101 quad.set(pts); 102 return quad.subDivide(a, c, t1, t2);
|
/external/mesa3d/src/gallium/auxiliary/vl/ |
vl_bicubic_filter.h | 38 struct pipe_vertex_buffer quad; member in struct:vl_bicubic_filter
|
vl_matrix_filter.h | 39 struct pipe_vertex_buffer quad; member in struct:vl_matrix_filter
|
vl_median_filter.h | 47 struct pipe_vertex_buffer quad; member in struct:vl_median_filter
|
vl_deint_filter.h | 38 struct pipe_vertex_buffer quad; member in struct:vl_deint_filter
|
vl_vertex_buffers.c | 33 /* vertices for a quad covering a block */ 41 struct pipe_vertex_buffer quad; local 50 quad.stride = sizeof(struct vertex2f); 51 quad.buffer_offset = 0; 52 quad.buffer = pipe_buffer_create 59 quad.user_buffer = NULL; 61 if(!quad.buffer) 62 return quad; 68 quad.buffer, 80 return quad; [all...] |
/external/mesa3d/src/gallium/drivers/softpipe/ |
sp_quad_stipple.c | 3 * quad polygon stipple stage 29 struct quad_header *quad = quads[q]; local 31 const int col0 = quad->input.x0 % 32; 32 const int y0 = quad->input.y0; 37 /* turn off quad mask bits that fail the stipple test */ 39 quad->inout.mask &= ~MASK_TOP_LEFT; 42 quad->inout.mask &= ~MASK_TOP_RIGHT; 45 quad->inout.mask &= ~MASK_BOTTOM_LEFT; 48 quad->inout.mask &= ~MASK_BOTTOM_RIGHT; 50 if (quad->inout.mask [all...] |
/external/mesa3d/src/mesa/tnl_dd/ |
t_dd_triemit.h | 31 static __inline void TAG(quad)( CTX_ARG, function 55 static __inline void TAG(quad)( CTX_ARG, function
|
/external/skia/tests/ |
PathOpsDRectTest.cpp | 31 static void setRawBounds(const SkDQuad& quad, SkDRect* rect) { 32 rect->set(quad[0]); 33 rect->add(quad[1]); 34 rect->add(quad[2]); 49 SkDQuad quad; local 50 quad.debugSet(q.fPts); 51 SkASSERT(ValidQuad(quad)); 52 setRawBounds(quad, &rect); 53 rect2.setBounds(quad);
|
PathOpsConicQuadIntersectionTest.cpp | 16 QuadPts quad; member in struct:conicQuad 32 const QuadPts& q = conicQuadTests[index].quad; 33 SkDQuad quad; local 34 quad.debugSet(q.fPts); 35 SkASSERT(ValidQuad(quad)); 39 int order2 = reduce1.reduce(quad); 45 SkDebugf("[%d] quad order=%d\n", index, order2); 49 int roots = i.intersect(conic, quad); 54 SkDPoint xy2 = quad.ptAtT(tt2);
|
PathOpsCubicQuadIntersectionTest.cpp | 17 QuadPts quad; member in struct:quadCubic 60 const QuadPts& q = quadCubicTests[index].quad; 61 SkDQuad quad; local 62 quad.debugSet(q.fPts); 63 SkASSERT(ValidQuad(quad)); 67 int order2 = reduce2.reduce(quad); 73 SkDebugf("[%d] quad order=%d\n", iIndex, order2); 77 int roots = i.intersect(cubic, quad); 82 SkDPoint xy2 = quad.ptAtT(tt2);
|
PathOpsQuadReduceOrderTest.cpp | 23 SkDQuad quad; local 24 quad.debugSet(q.fPts); 26 SkDEBUGCODE(int result = ) reducer.reduce(quad); 53 SkDQuad quad; local 54 quad.debugSet(q.fPts); 55 order = reducer.reduce(quad); 57 SkDebugf("[%d] line quad order=%d\n", (int) index, order); 62 SkDQuad quad; local 63 quad.debugSet(q.fPts); 64 order = reducer.reduce(quad); [all...] |
StrokerTest.cpp | 164 SkDebugf("\n%s quad=%d width=%1.9g\n", __FUNCTION__, gMaxRecursion[2], 179 SkDebugf("\n%s max quad=%d\n", __FUNCTION__, best); 236 SkPoint quad[3]; local 237 quad[0].fX = r.nextRangeF(0, 500); 238 quad[0].fY = r.nextRangeF(0, 500); 241 quad[1].fX = r.nextRangeF(0, 500); 242 quad[1].fY = r.nextRangeF(0, 500); 243 } while (SkPointPriv::DistanceToSqd(quad[0], quad[1]) < halfSquared); 245 quad[2].fX = r.nextRangeF(0, 500) 346 SkPoint quad[3]; local [all...] |
/external/skqp/tests/ |
PathOpsDRectTest.cpp | 31 static void setRawBounds(const SkDQuad& quad, SkDRect* rect) { 32 rect->set(quad[0]); 33 rect->add(quad[1]); 34 rect->add(quad[2]); 49 SkDQuad quad; local 50 quad.debugSet(q.fPts); 51 SkASSERT(ValidQuad(quad)); 52 setRawBounds(quad, &rect); 53 rect2.setBounds(quad);
|
PathOpsConicQuadIntersectionTest.cpp | 16 QuadPts quad; member in struct:conicQuad 32 const QuadPts& q = conicQuadTests[index].quad; 33 SkDQuad quad; local 34 quad.debugSet(q.fPts); 35 SkASSERT(ValidQuad(quad)); 39 int order2 = reduce1.reduce(quad); 45 SkDebugf("[%d] quad order=%d\n", index, order2); 49 int roots = i.intersect(conic, quad); 54 SkDPoint xy2 = quad.ptAtT(tt2);
|
PathOpsCubicQuadIntersectionTest.cpp | 17 QuadPts quad; member in struct:quadCubic 60 const QuadPts& q = quadCubicTests[index].quad; 61 SkDQuad quad; local 62 quad.debugSet(q.fPts); 63 SkASSERT(ValidQuad(quad)); 67 int order2 = reduce2.reduce(quad); 73 SkDebugf("[%d] quad order=%d\n", iIndex, order2); 77 int roots = i.intersect(cubic, quad); 82 SkDPoint xy2 = quad.ptAtT(tt2);
|
PathOpsQuadReduceOrderTest.cpp | 23 SkDQuad quad; local 24 quad.debugSet(q.fPts); 26 SkDEBUGCODE(int result = ) reducer.reduce(quad); 53 SkDQuad quad; local 54 quad.debugSet(q.fPts); 55 order = reducer.reduce(quad); 57 SkDebugf("[%d] line quad order=%d\n", (int) index, order); 62 SkDQuad quad; local 63 quad.debugSet(q.fPts); 64 order = reducer.reduce(quad); [all...] |
StrokerTest.cpp | 164 SkDebugf("\n%s quad=%d width=%1.9g\n", __FUNCTION__, gMaxRecursion[2], 179 SkDebugf("\n%s max quad=%d\n", __FUNCTION__, best); 236 SkPoint quad[3]; local 237 quad[0].fX = r.nextRangeF(0, 500); 238 quad[0].fY = r.nextRangeF(0, 500); 241 quad[1].fX = r.nextRangeF(0, 500); 242 quad[1].fY = r.nextRangeF(0, 500); 243 } while (SkPointPriv::DistanceToSqd(quad[0], quad[1]) < halfSquared); 245 quad[2].fX = r.nextRangeF(0, 500) 346 SkPoint quad[3]; local [all...] |
/frameworks/base/libs/hwui/renderstate/ |
MeshState.cpp | 39 uint16_t quad = i * 4; local 41 regionIndices[index] = quad; // top-left 42 regionIndices[index + 1] = quad + 1; // top-right 43 regionIndices[index + 2] = quad + 2; // bottom-left 44 regionIndices[index + 3] = quad + 2; // bottom-left 45 regionIndices[index + 4] = quad + 1; // top-right 46 regionIndices[index + 5] = quad + 3; // bottom-right
|
/external/deqp/modules/glshared/ |
glsInteractionTestUtil.hpp | 117 gls::FragmentOpUtil::IntegerQuad quad; member in struct:deqp::gls::InteractionTestUtil::RenderCommand 122 void computeRandomQuad (de::Random& rnd, gls::FragmentOpUtil::IntegerQuad& quad, int targetWidth, int targetHeight);
|
/external/skia/src/core/ |
SkEdgeBuilder.cpp | 169 SkQuad* quad = fAlloc.make<SkQuad>(); local 170 if (quad->set(pts)) { 171 fList.push(quad); 299 // the corresponding line/quad/cubic verbs 321 // the corresponding line/quad/cubic verbs 374 // the corresponding line/quad/cubic verbs 412 // the corresponding line/quad/cubic verbs
|