/external/chromium_org/third_party/skia/src/core/ |
H A D | SkBBoxHierarchyRecord.cpp | 67 void SkBBoxHierarchyRecord::didConcat(const SkMatrix& matrix) { argument 69 INHERITED::didConcat(matrix); 72 void SkBBoxHierarchyRecord::didSetMatrix(const SkMatrix& matrix) { argument 74 INHERITED::didSetMatrix(matrix);
|
H A D | SkDrawProcs.h | 67 * the matrix is <= 1.0, then this returns true, and sets coverage (simulating 71 inline bool SkDrawTreatAsHairline(const SkPaint& paint, const SkMatrix& matrix, argument 87 return SkDrawTreatAAStrokeAsHairline(strokeWidth, matrix, coverage);
|
H A D | SkPictureStateTree.cpp | 102 void SkPictureStateTree::Iterator::setCurrentMatrix(const SkMatrix* matrix) { argument 103 SkASSERT(NULL != matrix); 105 if (matrix == fCurrentMatrix) { 109 // The matrix is in recording space, but we also inherit 110 // a playback matrix from out target canvas. 111 SkMatrix m = *matrix; 114 fCurrentMatrix = matrix; 169 // restore() may change the matrix, so we need to reapply. 174 // restore() may change the matrix, so we need to reapply. 188 // restore() may change the matrix, s [all...] |
H A D | SkRRect.cpp | 310 static bool matrix_only_scale_and_translate(const SkMatrix& matrix) { argument 313 return (matrix.getType() & m) == 0; 316 bool SkRRect::transform(const SkMatrix& matrix, SkRRect* dst) const { argument 326 if (matrix.isIdentity()) { 333 if (!matrix_only_scale_and_translate(matrix)) { 338 if (!matrix.mapRect(&newRect, fRect)) { 346 SkScalar xScale = matrix.getScaleX(); 351 SkScalar yScale = matrix.getScaleY();
|
/external/chromium_org/third_party/skia/src/effects/ |
H A D | Sk1DPathEffect.cpp | 94 SkMatrix matrix; local 98 matrix.setSinCos(tangent.fY, tangent.fX, 0, 0); 99 matrix.preTranslate(-sx, 0); 100 matrix.postTranslate(pos.fX, pos.fY); 101 matrix.mapPoints(&dst[i], &pt, 1); 188 SkMatrix matrix; local 189 if (meas.getMatrix(distance, &matrix)) { 190 dst->addPath(fPath, matrix);
|
H A D | SkColorFilterImageFilter.cpp | 29 // To detect if we need to apply clamping after applying a matrix, we check if 51 bool matrix_needs_clamping(SkScalar matrix[20]) { argument 52 return component_needs_clamping(matrix) 53 || component_needs_clamping(matrix+5) 54 || component_needs_clamping(matrix+10) 55 || component_needs_clamping(matrix+15);
|
H A D | SkDashPathEffect.cpp | 43 // allow kRound_Cap capping (could allow rotations in the matrix with this) 48 const SkMatrix& matrix, 79 if (!matrix.rectStaysRect()) { 45 asPoints(PointData* results, const SkPath& src, const SkStrokeRec& rec, const SkMatrix& matrix, const SkRect* cullRect) const argument
|
H A D | SkEmbossMaskFilter.cpp | 78 const SkMatrix& matrix, SkIPoint* margin) const { 79 SkScalar sigma = matrix.mapRadius(fBlurSigma); 107 // run the light direction through the matrix... 109 matrix.mapVectors((SkVector*)(void*)light.fDirection, 77 filterMask(SkMask* dst, const SkMask& src, const SkMatrix& matrix, SkIPoint* margin) const argument
|
H A D | SkMatrixImageFilter.cpp | 63 SkMatrix matrix; local 64 if (!ctx.ctm().invert(&matrix)) { 67 matrix.postConcat(fTransform); 68 matrix.postConcat(ctx.ctm()); 69 matrix.mapRect(&dstRect, srcRect); 79 canvas.concat(matrix); 97 SkMatrix matrix; local 98 matrix.setTranslate(-bounds.x(), -bounds.y()); 99 matrix.postConcat(fTransform); 100 matrix 110 SkMatrix matrix; local [all...] |
/external/chromium_org/third_party/skia/src/gpu/ |
H A D | GrSWMaskHelper.cpp | 93 const SkMatrix* matrix) { 94 if (NULL != matrix) { 95 fMatrix = *matrix; 185 * Software rasterizes path to A8 mask (possibly using the context's matrix) 194 SkMatrix* matrix) { 197 if (!helper.init(resultBounds, matrix)) { 229 // We want to use device coords to compute the texture coordinates. We set our matrix to be 230 // equal to the view matrix followed by a translation so that the top-left of the device bounds 231 // maps to 0,0, and then a scaling matrix to normalized coords. We apply this matrix t 92 init(const SkIRect& resultBounds, const SkMatrix* matrix) argument 189 DrawPathMaskToTexture(GrContext* context, const SkPath& path, const SkStrokeRec& stroke, const SkIRect& resultBounds, bool antiAlias, SkMatrix* matrix) argument [all...] |
/external/chromium_org/third_party/skia/src/utils/ |
H A D | SkGatherPixelRefsAndRects.h | 118 const SkMatrix& matrix, const SkPaint& paint) SK_OVERRIDE { 120 totMatrix.setConcat(*draw.fMatrix, matrix); 135 // Sprites aren't affected by current matrix, so we can't reuse drawRect. 136 SkMatrix matrix; variable 137 matrix.setTranslate(SkIntToScalar(x), SkIntToScalar(y)); 142 matrix.mapRect(&mappedRect, bitmapRect); 156 SkMatrix matrix; variable 157 matrix.setRectToRect(bitmapRect, dst, SkMatrix::kFill_ScaleToFit); 158 this->drawBitmap(draw, bitmap, matrix, paint); 250 const SkPath& path, const SkMatrix* matrix, [all...] |
H A D | SkLayer.cpp | 77 void SkLayer::setMatrix(const SkMatrix& matrix) { argument 78 fMatrix = matrix; 81 void SkLayer::setChildrenMatrix(const SkMatrix& matrix) { argument 82 fChildrenMatrix = matrix; 141 void SkLayer::getLocalTransform(SkMatrix* matrix) const { 142 matrix->setTranslate(m_position.fX, m_position.fY); 146 matrix->preTranslate(tx, ty); 147 matrix->preConcat(this->getMatrix()); 148 matrix->preTranslate(-tx, -ty); 151 void SkLayer::localToGlobal(SkMatrix* matrix) cons [all...] |
/external/chromium_org/third_party/skia/src/views/animated/ |
H A D | SkImageView.cpp | 72 bool SkImageView::getImageMatrix(SkMatrix* matrix) const 77 if (matrix) 78 *matrix = *fMatrix; 83 if (matrix) 84 matrix->reset(); 89 void SkImageView::setImageMatrix(const SkMatrix* matrix) argument 93 if (matrix && !matrix->isIdentity()) 97 *fMatrix = *matrix; 111 // only redraw if we changed our matrix an 152 SkMatrix matrix; local [all...] |
/external/chromium_org/third_party/skia/tests/ |
H A D | GLProgramsTest.cpp | 266 SkScalar matrix[20]; local 267 SkAutoTUnref<SkColorMatrixFilter> cmf(SkColorMatrixFilter::Create(matrix));
|
/external/chromium_org/ui/gfx/geometry/ |
H A D | matrix3_f.cc | 60 Matrix3F matrix; local 61 matrix.set(0.0f, 0.0f, 0.0f, 0.0f, 0.0f, 0.0f, 0.0f, 0.0f, 0.0f); 62 return matrix; 67 Matrix3F matrix; local 68 matrix.set(1.0f, 1.0f, 1.0f, 1.0f, 1.0f, 1.0f, 1.0f, 1.0f, 1.0f); 69 return matrix; 74 Matrix3F matrix; local 75 matrix.set(1.0f, 0.0f, 0.0f, 0.0f, 1.0f, 0.0f, 0.0f, 0.0f, 1.0f); 76 return matrix; 81 Matrix3F matrix; local [all...] |
/external/chromium_org/ui/gfx/ |
H A D | transform.h | 23 // 4x4 transformation matrix. Transform is cheap and explicitly allows 34 // Skips initializing this matrix to avoid overhead, when we know it will be 42 // Constructs a transform from explicit 16 matrix elements. Elements 60 // Constructs a transform from explicit 2d elements. All other matrix 62 // matrix. 118 // Returns true if this is the identity matrix. 121 // Returns true if the matrix is either identity or pure translation. 126 // Returns true if the matrix is either identity or pure translation, 130 // Returns true if the matrix is either a positive scale and/or a translation. 138 // Returns true if the matrix i 254 const SkMatrix44& matrix() const { return matrix_; } function in class:gfx::Transform 255 SkMatrix44& matrix() { return matrix_; } function in class:gfx::Transform [all...] |
/external/eigen/Eigen/src/Core/ |
H A D | ArrayWrapper.h | 18 * \brief Expression of a mathematical vector or matrix as an array object 51 inline ArrayWrapper(ExpressionType& matrix) : m_expression(matrix) {} argument 138 * \brief Expression of an array as a mathematical vector or matrix 140 * This class is the return type of ArrayBase::matrix(), and most of the time 143 * \sa MatrixBase::matrix(), class ArrayWrapper
|
H A D | Diagonal.h | 19 * \brief Expression of a diagonal/subdiagonal/superdiagonal in a matrix 26 * The matrix is not required to be square. 29 * of a square matrix. It is the return type of MatrixBase::diagonal() and MatrixBase::diagonal(Index) and most of the 73 inline Diagonal(MatrixType& matrix, Index a_index = DiagIndex) : m_matrix(matrix), m_index(a_index) {} argument 158 /** \returns an expression of the main diagonal of the matrix \c *this 181 /** \returns an expression of the \a DiagIndex-th sub or super diagonal of the matrix \c *this 207 /** \returns an expression of the \a DiagIndex-th sub or super diagonal of the matrix \c *this
|
H A D | DiagonalProduct.h | 52 inline DiagonalProduct(const MatrixType& matrix, const DiagonalType& diagonal) argument 53 : m_matrix(matrix), m_diagonal(diagonal) 55 eigen_assert(diagonal.diagonal().size() == (ProductOrder == OnTheLeft ? matrix.rows() : matrix.cols())); 118 /** \returns the diagonal matrix product of \c *this by the diagonal matrix \a diagonal.
|
/external/eigen/Eigen/src/Eigenvalues/ |
H A D | ComplexEigenSolver.h | 26 * \tparam _MatrixType the type of the matrix of which we are 30 * The eigenvalues and eigenvectors of a matrix \f$ A \f$ are scalars 32 * \f$. If \f$ D \f$ is a diagonal matrix with the eigenvalues on 33 * the diagonal, and \f$ V \f$ is a matrix with the eigenvectors as 34 * its columns, then \f$ A V = V D \f$. The matrix \f$ V \f$ is 80 /** \brief Type for matrix of eigenvectors as returned by eigenvectors(). 82 * This is a square matrix with entries of type #ComplexScalar. 116 /** \brief Constructor; computes eigendecomposition of given matrix. 118 * \param[in] matrix Square matrix whos 125 ComplexEigenSolver(const MatrixType& matrix, bool computeEigenvectors = true) argument 252 compute(const MatrixType& matrix, bool computeEigenvectors) argument [all...] |
/external/eigen/Eigen/src/Geometry/ |
H A D | RotationBase.h | 36 /** corresponding linear transformation matrix type */ 44 /** \returns an equivalent rotation matrix */ 47 /** \returns an equivalent rotation matrix 50 inline RotationMatrixType matrix() const { return derived().toRotationMatrix(); } function in class:Eigen::RotationBase 65 * - a DimxDim linear transformation matrix 66 * - a DimxDim diagonal matrix (axis aligned scaling) 99 // implementation of the generic product rotation * matrix 136 * \brief Constructs a Dim x Dim rotation matrix from the rotation \a r 149 * \brief Set a Dim x Dim rotation matrix from the rotation \a r 165 * Helper function to return an arbitrary rotation object to a rotation matrix [all...] |
/external/eigen/Eigen/src/SVD/ |
H A D | UpperBidiagonalization.h | 55 UpperBidiagonalization(const MatrixType& matrix) argument 56 : m_householder(matrix.rows(), matrix.cols()), 57 m_bidiagonal(matrix.cols(), matrix.cols()), 60 compute(matrix); 63 UpperBidiagonalization& compute(const MatrixType& matrix); 89 UpperBidiagonalization<_MatrixType>& UpperBidiagonalization<_MatrixType>::compute(const _MatrixType& matrix) argument 91 Index rows = matrix.rows(); 92 Index cols = matrix [all...] |
/external/eigen/Eigen/src/SparseCore/ |
H A D | SparseTriangularView.h | 49 inline SparseTriangularView(const MatrixType& matrix) : m_matrix(matrix) {} argument
|
/external/eigen/unsupported/Eigen/src/IterativeSolvers/ |
H A D | Scaling.h | 20 * NOTE It is assumed that the matrix does not have empty row or column, 28 * // Compute the left and right scaling vectors. The matrix is equilibrated at output 38 * \tparam _MatrixType the type of the matrix. It should be a real square sparsematrix 57 IterScaling(const MatrixType& matrix) argument 60 compute(matrix); 66 * Compute the left and right diagonal matrices to scale the input matrix @p mat 76 eigen_assert((m>0 && m == n) && "Please give a non - empty matrix"); 113 // Scale the rows and the columns of the matrix 137 * the input matrix is scaled with the computed vectors at output 146 /** Get the vector to scale the rows of the matrix [all...] |
/external/freetype/include/ |
H A D | ftglyph.h | 275 /* matrix :: A pointer to a 2x2 matrix to apply. */ 284 /* The 2x2 transformation matrix is also applied to the glyph's */ 289 FT_Matrix* matrix, 572 /* Perform the matrix operation `b = a*b'. */ 575 /* a :: A pointer to matrix `a'. */ 578 /* b :: A pointer to matrix `b'. */ 594 /* Invert a 2x2 matrix. Return an error if it can't be inverted. */ 597 /* matrix :: A pointer to the target matrix 604 FT_Matrix_Invert( FT_Matrix* matrix ); variable [all...] |