/external/chromium-trace/trace-viewer/src/ui/ |
H A D | quad_view_test.js | 19 var quads = [ 27 quads[2].upperBorderColor = 'rgba(255,255,0,1)'; 28 quads[3].backgroundColor = 'rgba(255,0,255,0.15)'; 29 quads[3].borderColor = 'rgba(0,255,255,1)'; 31 for (var i = 0; i < quads.length; i++) 32 quadsBBox.addQuad(quads[i]); 35 quadView.quads = quads; 42 quads.forEach(function(q) { 47 quads[ [all...] |
H A D | rect_view_test.js | 16 var quads = [ 20 quads[0].stackingGroupId = 0; 21 quads[1].stackingGroupId = 1; 24 quads.forEach(function(quad) { quadsBbox.addQuad(quad); }); 30 stack.quads = quads;
|
H A D | quad_stack_test.js | 13 var quads = [ 18 quads[0].stackingGroupId = 0; 19 quads[1].stackingGroupId = 1; 20 quads[2].stackingGroupId = 2; 23 quads.forEach(function(quad) { quadsBbox.addQuad(quad); }); 29 stack.quads = quads;
|
H A D | quad_stack.js | 22 function validateQuads(quads) { 23 for (var i = 0; i < quads.length; i++) { 24 if (quads[i].stackingGroupId === undefined) 25 throw new Error('All quads must have stackingGroupIds'); 71 get quads() { 75 set quads(quads) { 76 validateQuads(quads); 77 this.quads_ = quads; 100 var quads [all...] |
H A D | quad_view.js | 108 get quads() { 112 set quads(quads) { 113 this.quads_ = quads; 162 // The quads are in the world coordinate system. We are drawing 168 var quads = this.quads_ || []; 171 for (var i = 0; i < quads.length; i++) { 172 var quad = quads[i]; 214 for (var i = 0; i < quads.length; i++) { 215 var quad = quads[ [all...] |
/external/chromium_org/third_party/skia/experimental/Intersection/ |
H A D | QuadraticParameterization_Test.cpp | 29 const Quadratic* quads[] = { local 32 size_t quadsCount = sizeof(quads) / sizeof(quads[0]); 36 if (!point_on_parameterized_curve(*quads[one], (*quads[two])[inner])) { 41 if (!implicit_matches(*quads[one], *quads[two])) {
|
H A D | CubicToQuadratics_Test.cpp | 9 SkTDArray<Quadratic> quads; local 13 (void) cubic_to_quadratics(cubic, precision, quads); 14 if (quads.count() != 1) { 16 quads.count()); 22 SkTDArray<Quadratic> quads; local 28 (void) cubic_to_quadratics(cubic, precision, quads); 29 if (quads.count() != 1) { 31 quads.count()); 37 SkTDArray<Quadratic> quads; local 42 int order = cubic_to_quadratics(cubic, precision, quads); 60 SkTDArray<Quadratic> quads; local 166 SkTDArray<Quadratic> quads; local 204 SkTDArray<Quadratic> quads; local 237 SkTDArray<Quadratic> quads; local [all...] |
H A D | SimplifyAddIntersectingTs_Test.cpp | 41 static const SkPoint quads[][3] = { variable 47 static const size_t quadCount = sizeof(quads) / sizeof(quads[0]); 68 path.moveTo(quads[outer][0].fX, quads[outer][0].fY); 69 path.quadTo(quads[outer][1].fX, quads[outer][1].fY, 70 quads[outer][2].fX, quads[outer][2].fY); 72 pts1 = quads[oute [all...] |
/external/skia/experimental/Intersection/ |
H A D | QuadraticParameterization_Test.cpp | 29 const Quadratic* quads[] = { local 32 size_t quadsCount = sizeof(quads) / sizeof(quads[0]); 36 if (!point_on_parameterized_curve(*quads[one], (*quads[two])[inner])) { 41 if (!implicit_matches(*quads[one], *quads[two])) {
|
H A D | CubicToQuadratics_Test.cpp | 9 SkTDArray<Quadratic> quads; local 13 (void) cubic_to_quadratics(cubic, precision, quads); 14 if (quads.count() != 1) { 16 quads.count()); 22 SkTDArray<Quadratic> quads; local 28 (void) cubic_to_quadratics(cubic, precision, quads); 29 if (quads.count() != 1) { 31 quads.count()); 37 SkTDArray<Quadratic> quads; local 42 int order = cubic_to_quadratics(cubic, precision, quads); 60 SkTDArray<Quadratic> quads; local 166 SkTDArray<Quadratic> quads; local 204 SkTDArray<Quadratic> quads; local 237 SkTDArray<Quadratic> quads; local [all...] |
H A D | SimplifyAddIntersectingTs_Test.cpp | 41 static const SkPoint quads[][3] = { variable 47 static const size_t quadCount = sizeof(quads) / sizeof(quads[0]); 68 path.moveTo(quads[outer][0].fX, quads[outer][0].fY); 69 path.quadTo(quads[outer][1].fX, quads[outer][1].fY, 70 quads[outer][2].fX, quads[outer][2].fY); 72 pts1 = quads[oute [all...] |
/external/chromium_org/third_party/WebKit/Source/core/dom/ |
H A D | ClientRectList.cpp | 40 ClientRectList::ClientRectList(const Vector<FloatQuad>& quads) argument 42 m_list.reserveInitialCapacity(quads.size()); 43 for (size_t i = 0; i < quads.size(); ++i) 44 m_list.append(ClientRect::create(quads[i].enclosingBoundingBox()));
|
H A D | ClientRectList.h | 49 static PassRefPtrWillBeRawPtr<ClientRectList> create(const Vector<FloatQuad>& quads) argument 51 return adoptRefWillBeNoop(new ClientRectList(quads));
|
/external/chromium_org/third_party/mesa/src/src/gallium/drivers/softpipe/ |
H A D | sp_quad_depth_test_tmp.h | 44 * 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 D | sp_quad_stipple.c | 14 * 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 D | sp_quad_fs.c | 103 * 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...] |
/external/mesa3d/src/gallium/drivers/softpipe/ |
H A D | sp_quad_depth_test_tmp.h | 44 * 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 D | sp_quad_stipple.c | 14 * 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 D | sp_quad_fs.c | 103 * 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...] |
/external/chromium_org/third_party/skia/tests/ |
H A D | PathOpsCubicToQuadsTest.cpp | 22 SkTArray<SkDQuad, true> quads; local 23 CubicToQuads(cubic, precision, quads); 24 if (quads.count() != 1 && quads.count() != 2) { 26 quads.count()); 28 REPORTER_ASSERT(reporter, quads.count() == 1); 39 SkTArray<SkDQuad, true> quads; local 40 CubicToQuads(cubic, precision, quads); 41 if (quads.count() != 1 && quads 56 SkTArray<SkDQuad, true> quads; local 79 SkTArray<SkDQuad, true> quads; local 184 SkTArray<SkDQuad, true> quads; local [all...] |
H A D | PathOpsQuadParameterizationTest.cpp | 36 const SkDQuad* quads[] = { local 39 int quadsCount = (int) SK_ARRAY_COUNT(quads); 43 REPORTER_ASSERT(reporter, point_on_parameterized_curve(*quads[one], 44 (*quads[two])[inner])); 46 REPORTER_ASSERT(reporter, SkDQuadImplicit::Match(*quads[one], *quads[two]));
|
/external/skia/tests/ |
H A D | PathOpsCubicToQuadsTest.cpp | 22 SkTArray<SkDQuad, true> quads; local 23 CubicToQuads(cubic, precision, quads); 24 if (quads.count() != 1 && quads.count() != 2) { 26 quads.count()); 28 REPORTER_ASSERT(reporter, quads.count() == 1); 39 SkTArray<SkDQuad, true> quads; local 40 CubicToQuads(cubic, precision, quads); 41 if (quads.count() != 1 && quads 56 SkTArray<SkDQuad, true> quads; local 79 SkTArray<SkDQuad, true> quads; local 184 SkTArray<SkDQuad, true> quads; local [all...] |
H A D | PathOpsQuadParameterizationTest.cpp | 36 const SkDQuad* quads[] = { local 39 int quadsCount = (int) SK_ARRAY_COUNT(quads); 43 REPORTER_ASSERT(reporter, point_on_parameterized_curve(*quads[one], 44 (*quads[two])[inner])); 46 REPORTER_ASSERT(reporter, SkDQuadImplicit::Match(*quads[one], *quads[two]));
|
/external/chromium_org/cc/surfaces/ |
H A D | surface_aggregator_test_helpers.h | 9 #include "cc/quads/draw_quad.h" 10 #include "cc/quads/render_pass_id.h" 63 Pass(Quad* quads, size_t quad_count, RenderPassId id) argument 64 : quads(quads), quad_count(quad_count), id(id) {} 65 Pass(Quad* quads, size_t quad_count) argument 66 : quads(quads), quad_count(quad_count), id(1, 1) {} 68 Quad* quads; member in struct:cc::test::Pass
|
/external/opencv/cv/src/ |
H A D | cvcalibinit.cpp | 44 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...] |