Searched defs:quads (Results 1 - 25 of 25) sorted by relevance

/external/mesa3d/src/gallium/drivers/softpipe/
H A Dsp_quad_fs.c103 * Shade/write an array of quads
108 struct quad_header *quads[],
119 machine->InterpCoefs = quads[0]->coef;
125 * the quads' Z coordinates are step-wise interpolated with respect
128 * Z values in each pass. If interpolation starts with different quads
131 if (!shade_quad(qs, quads[i]) && i > 0)
135 coverage_quad( qs, quads[i] );
137 quads[nr_quads++] = quads[i];
141 qs->next->run(qs->next, quads, nr_quad
107 shade_quads(struct quad_stage *qs, struct quad_header *quads[], unsigned nr) argument
[all...]
H A Dsp_quad_stipple.c14 * Apply polygon stipple to quads produced by triangle rasterization
17 stipple_quad(struct quad_stage *qs, struct quad_header *quads[], unsigned nr) argument
29 struct quad_header *quad = quads[q];
51 quads[pass++] = quad;
54 qs->next->run(qs->next, quads, pass);
H A Dsp_quad_depth_test_tmp.h44 * NOTE: there's no guarantee that the quads are sequentially side by
45 * side. The fragment shader may have culled some quads, etc. Sliver
46 * triangles may generate non-sequential quads.
50 struct quad_header *quads[],
54 const unsigned ix = quads[0]->input.x0;
55 const unsigned iy = quads[0]->input.y0;
58 const float dzdx = quads[0]->posCoef->dadx[2];
59 const float dzdy = quads[0]->posCoef->dady[2];
60 const float z0 = quads[0]->posCoef->a0[2] + dzdx * fx + dzdy * fy;
77 const unsigned outmask = quads[
49 NAME(struct quad_stage *qs, struct quad_header *quads[], unsigned nr) argument
[all...]
H A Dsp_quad_blend.c919 struct quad_header *quads[],
937 quads[0]->input.x0,
938 quads[0]->input.y0);
950 struct quad_header *quad = quads[q];
1027 struct quad_header *quads[],
1039 quads[0]->input.x0,
1040 quads[0]->input.y0);
1043 struct quad_header *quad = quads[q];
1104 struct quad_header *quads[],
1113 quads[
918 blend_fallback(struct quad_stage *qs, struct quad_header *quads[], unsigned nr) argument
1026 blend_single_add_src_alpha_inv_src_alpha(struct quad_stage *qs, struct quad_header *quads[], unsigned nr) argument
1103 blend_single_add_one_one(struct quad_stage *qs, struct quad_header *quads[], unsigned nr) argument
1172 single_output_color(struct quad_stage *qs, struct quad_header *quads[], unsigned nr) argument
1208 blend_noop(struct quad_stage *qs, struct quad_header *quads[], unsigned nr) argument
1216 choose_blend_quad(struct quad_stage *qs, struct quad_header *quads[], unsigned nr) argument
[all...]
H A Dsp_quad_depth_test.c229 /* Copy quads stencil values
676 struct quad_header *quads[], \
685 const float *aaaa = quads[i]->output.color[cbuf][3]; \
693 quads[i]->inout.mask &= passMask; \
695 if (quads[i]->inout.mask) \
696 quads[pass_nr++] = quads[i]; \
715 struct quad_header *quads[],
720 return alpha_test_quads_LESS( qs, quads, nr );
722 return alpha_test_quads_EQUAL( qs, quads, n
714 alpha_test_quads(struct quad_stage *qs, struct quad_header *quads[], unsigned nr) argument
766 depth_test_quads_fallback(struct quad_stage *qs, struct quad_header *quads[], unsigned nr) argument
868 depth_noop(struct quad_stage *qs, struct quad_header *quads[], unsigned nr) argument
878 choose_depth_test(struct quad_stage *qs, struct quad_header *quads[], unsigned nr) argument
[all...]
/external/mesa3d/src/gallium/auxiliary/indices/
H A Du_unfilled_gen.py36 'quads',
176 def quads(intype, outtype): function
177 preamble(intype, outtype, prim='quads')
198 quads(intype, outtype)
H A Du_indices_gen.py41 'quads',
237 def quads(intype, outtype, inpv, outpv): function
238 preamble(intype, outtype, inpv, outpv, prim='quads')
265 quads(intype, outtype, inpv, outpv)
/external/mesa3d/src/mesa/tnl_dd/
H A Dt_dd_dmatmp2.h435 /* Emit whole number of quads in total, and in each buffer.
441 GLint quads, i; local
444 quads = (nr/2)-1;
445 dest = ALLOC_ELTS( quads*6 );
447 for ( i = j ; i < j+quads*2 ; i+=2 ) {
494 GLint quads, i; local
497 quads = nr/4;
498 dest = ALLOC_ELTS( quads*6 );
500 for ( i = j ; i < j+quads*4 ; i+=4 ) {
819 /* Emit whole number of quads i
834 GLint quads = (nr/2)-1; local
894 GLint quads = nr/4; local
[all...]
H A Dt_dd_dmatmp.h465 /* Emit whole number of quads in total, and in each buffer.
480 GLint quads = (nr/2)-1; local
482 ELTS_VARS( ALLOC_ELTS( quads*6 ) );
484 for ( i = j-start ; i < j-start+quads*2 ; i+=2 ) {
517 /* Emit whole number of quads in total, and in each buffer.
556 /* Emit whole number of quads in total. dmasz is already a multiple
587 /* Emit whole number of quads in total, and in each buffer.
604 GLint quads = nr/4; local
606 ELTS_VARS( ALLOC_ELTS( quads*6 ) );
608 for ( i = j-start ; i < j-start+quads*
1044 GLint quads = (nr/2)-1; local
1131 GLint quads = nr/4; local
[all...]
/external/opencv3/modules/calib3d/src/
H A Dcheckchessboard.cpp60 static void icvGetQuadrangleHypotheses(CvSeq* contours, std::vector<std::pair<float, int> >& quads, int class_id) argument
81 quads.push_back(std::pair<float, int>(box_size, class_id));
150 std::vector<std::pair<float, int> > quads; local
152 icvGetQuadrangleHypotheses(first, quads, 1);
162 icvGetQuadrangleHypotheses(first, quads, 0);
165 std::sort(quads.begin(), quads.end(), less_pred);
171 for(size_t i = 0; i < quads.size(); i++)
174 for(; j < quads.size(); j++)
176 if(quads[
[all...]
H A Dquadsubpix.cpp213 const std::vector<Point>* quads[4] = {&black_contours[black_order[0].first], &black_contours[black_order[1].first], local
220 for(size_t j = 0; j < quads[k]->size(); j++) temp.push_back((*quads[k])[j]);
H A Dcalibinit.cpp44 uses a graph of connected quads. It is based on the code contributed
156 static int icvGenerateQuads( CvCBQuad **quads, CvCBCorner **corners,
163 static void icvFindQuadNeighbors( CvCBQuad *quads, int quad_count );
165 static int icvFindConnectedQuads( CvCBQuad *quads, int quad_count,
173 CvCBQuad **quads, CvSize pattern_size );
175 static int icvOrderFoundConnectedQuads( int quad_count, CvCBQuad **quads,
182 static int icvTrimCol(CvCBQuad **quads, int count, int col, int dir);
184 static int icvTrimRow(CvCBQuad **quads, int count, int row, int dir);
187 static int icvAddOuterQuad(CvCBQuad *quad, CvCBQuad **quads, int quad_count,
190 static void icvRemoveQuadFromGroup(CvCBQuad **quads, in
233 CvCBQuad *quads = 0, **quad_group = 0; local
625 icvOrderFoundConnectedQuads( int quad_count, CvCBQuad **quads, int *all_count, CvCBQuad **all_quads, CvCBCorner **corners, CvSize pattern_size, CvMemStorage* storage ) argument
857 icvAddOuterQuad( CvCBQuad *quad, CvCBQuad **quads, int quad_count, CvCBQuad **all_quads, int all_count, CvCBCorner **corners ) argument
927 icvTrimCol(CvCBQuad **quads, int count, int col, int dir) argument
972 icvTrimRow(CvCBQuad **quads, int count, int row, int dir) argument
1022 icvRemoveQuadFromGroup(CvCBQuad **quads, int count, CvCBQuad *q0) argument
1507 icvFindQuadNeighbors( CvCBQuad *quads, int quad_count ) argument
[all...]
/external/mesa3d/src/gallium/auxiliary/vl/
H A Dvl_mpeg12_decoder.h57 struct pipe_vertex_buffer quads; member in struct:vl_mpeg12_decoder
/external/skia/tests/
H A DPathOpsTestCommon.cpp133 void CubicToQuads(const SkDCubic& cubic, double precision, SkTArray<SkDQuad, true>& quads) { argument
138 quads.push_back(quad);
158 quads.push_back(quad);
166 SkTArray<SkDQuad, true> quads; local
182 quads.reset();
184 CubicToQuads(cubic, cubic.calcPrecision(), quads);
185 for (int index = 0; index < quads.count(); ++index) {
187 quads[index][1].asSkPoint(),
188 quads[index][2].asSkPoint()
H A DPathOpsAngleIdeas.cpp79 // construct circle from quads
474 const SkDQuad* quads[] = {&quad1, &quad2};
483 for (unsigned index = 0; index < SK_ARRAY_COUNT(quads); ++index) {
484 const SkDQuad& q = *quads[index];
528 const SkDQuad& q = *quads[sIndex];
559 const SkDQuad quads[] = {
563 for (int index = 0; index < (int) SK_ARRAY_COUNT(quads); index += 2) {
564 testQuadAngles(reporter, quads[index], quads[index + 1], 0, &allocator);
641 const SkDQuad quads[] local
[all...]
/external/skia/src/core/
H A DSkShader.cpp156 int quads = kTempColorQuadCount; local
167 } while (--quads != 0);
/external/skia/src/pdf/
H A DSkPDFUtils.cpp166 const SkPoint* quads = converter.computeQuads(args, iter.conicWeight(), tol); local
168 append_quad(&quads[i * 2], &currentSegment);
/external/skia/src/gpu/
H A DGrPathUtils.cpp402 SkTArray<SkPoint, true>* quads,
413 SkPoint* degQuad = quads->push_back_n(3);
460 SkPoint* qpts = quads->push_back_n(6);
468 SkPoint* qpts = quads->push_back_n(3);
522 SkPoint* pts = quads->push_back_n(3);
535 quads,
541 quads,
548 SkTArray<SkPoint, true>* quads) {
558 SkPathPriv::kCCW_FirstDirection, quads);
565 SkTArray<SkPoint, true>* quads) {
398 convert_noninflect_cubic_to_quads(const SkPoint p[4], SkScalar toleranceSqd, bool constrainWithinTangents, SkPathPriv::FirstDirection dir, SkTArray<SkPoint, true>* quads, int sublevel = 0) argument
546 convertCubicToQuads(const SkPoint p[4], SkScalar tolScale, SkTArray<SkPoint, true>* quads) argument
562 convertCubicToQuadsConstrainToTangents(const SkPoint p[4], SkScalar tolScale, SkPathPriv::FirstDirection dir, SkTArray<SkPoint, true>* quads) argument
[all...]
/external/skia/src/gpu/batches/
H A DGrAAConvexPathRenderer.cpp256 SkSTArray<15, SkPoint, true> quads; local
257 GrPathUtils::convertCubicToQuadsConstrainToTangents(pts, SK_Scalar1, dir, &quads);
258 int count = quads.count();
260 add_quad_segment(&quads[q], segments);
H A DGrPLSPathRenderer.cpp39 // for quads, vert1 is the texture UV coords, and vert2 and vert3 are the line segment
176 SkSTArray<15, SkPoint, true> quads; local
177 GrPathUtils::convertCubicToQuads(pts, kCubicTolerance, &quads);
178 int count = quads.count();
180 linesOnlyPath.lineTo(quads[q + 2]);
181 quadPoints.push_back(quads[q]);
182 quadPoints.push_back(quads[q + 1]);
183 quadPoints.push_back(quads[q + 2]);
191 const SkPoint* quads = converter.computeQuads(pts, weight, kConicTolerance); local
194 linesOnlyPath.lineTo(quads[
[all...]
H A DGrAAHairLinePathRenderer.cpp76 // Each line segment is rendered as two quads and two triangles.
133 // Uses the max curvature function for quads to estimate
199 // we subdivide the quads to avoid huge overfill
229 * Generates the lines and quads to be rendered. Lines are always recorded in
234 * subdivide large quads to reduce over-fill. This subdivision has to be
241 GrAAHairLinePathRenderer::PtArray* quads,
328 // when in perspective keep quads in src space
330 SkPoint* pts = quads->push_back_n(3);
382 SkPoint* pts = quads->push_back_n(3);
843 PREALLOC_PTARRAY(128) quads;
237 gather_lines_and_quads(const SkPath& path, const SkMatrix& m, const SkIRect& devClipBounds, GrAAHairLinePathRenderer::PtArray* lines, GrAAHairLinePathRenderer::PtArray* quads, GrAAHairLinePathRenderer::PtArray* conics, GrAAHairLinePathRenderer::IntArray* quadSubdivCnts, GrAAHairLinePathRenderer::FloatArray* conicWeights) argument
[all...]
/external/deqp/modules/gles2/functional/
H A Des2fClippingTests.cpp1838 } quads[] = local
1860 for (int ndx = 0; ndx < DE_LENGTH_OF_ARRAY(quads); ++ndx)
1861 addChild(new QuadFillTest(m_context, (std::string("quad_at_origin_") + de::toString(ndx)).c_str(), "polygon edge clipping", VIEWPORT_CENTER, quads[ndx].d1, quads[ndx].d2));
/external/deqp/modules/gles3/functional/
H A Des3fClippingTests.cpp1842 } quads[] = local
1864 for (int ndx = 0; ndx < DE_LENGTH_OF_ARRAY(quads); ++ndx)
1865 addChild(new QuadFillTest(m_context, (std::string("quad_at_origin_") + de::toString(ndx)).c_str(), "polygon edge clipping", VIEWPORT_CENTER, quads[ndx].d1, quads[ndx].d2));
/external/opencv/cv/src/
H A Dcvcalibinit.cpp44 uses a graph of connected quads. It is based on the code contributed
128 static int icvGenerateQuads( CvCBQuad **quads, CvCBCorner **corners,
135 static void icvFindQuadNeighbors( CvCBQuad *quads, int quad_count );
137 static int icvFindConnectedQuads( CvCBQuad *quads, int quad_count,
145 CvCBQuad **quads, CvSize pattern_size );
147 static int icvOrderFoundConnectedQuads( int quad_count, CvCBQuad **quads,
153 static int icvTrimCol(CvCBQuad **quads, int count, int col, int dir);
155 static int icvTrimRow(CvCBQuad **quads, int count, int row, int dir);
157 static int icvAddOuterQuad(CvCBQuad *quad, CvCBQuad **quads, int quad_count,
160 static void icvRemoveQuadFromGroup(CvCBQuad **quads, in
217 CvCBQuad *quads = 0, **quad_group = 0; local
539 icvOrderFoundConnectedQuads( int quad_count, CvCBQuad **quads, int *all_count, CvCBQuad **all_quads, CvCBCorner **corners, CvSize pattern_size, CvMemStorage* storage ) argument
779 icvAddOuterQuad( CvCBQuad *quad, CvCBQuad **quads, int quad_count, CvCBQuad **all_quads, int all_count, CvCBCorner **corners ) argument
849 icvTrimCol(CvCBQuad **quads, int count, int col, int dir) argument
894 icvTrimRow(CvCBQuad **quads, int count, int row, int dir) argument
944 icvRemoveQuadFromGroup(CvCBQuad **quads, int count, CvCBQuad *q0) argument
1450 icvFindQuadNeighbors( CvCBQuad *quads, int quad_count ) argument
[all...]
/external/skia/src/device/xps/
H A DSkXPSDevice.cpp1372 const SkPoint* quads = local
1377 segmentData.push(SkScalarToFLOAT(quads[2 * i + 1].fX));
1378 segmentData.push(SkScalarToFLOAT(quads[2 * i + 1].fY));
1379 segmentData.push(SkScalarToFLOAT(quads[2 * i + 2].fX));
1380 segmentData.push(SkScalarToFLOAT(quads[2 * i + 2].fY));

Completed in 1729 milliseconds