/external/pdfium/core/src/reflow/ |
H A D | layoutprocessor_reflow.cpp | 273 CFX_AffineMatrix matrix(1, 0, 0, 1, dxCell, dy); 274 Transform(&matrix, m_pReflowedPage->m_pReflowed, pCell->m_BeginPos, pCell->m_EndPos - pCell->m_BeginPos + 1); 290 CFX_AffineMatrix matrix(1, 0, 0, 1, 0, dy); 291 Transform(&matrix, m_pReflowedPage->m_pReflowed, pCell->m_BeginPos, pCell->m_EndPos - pCell->m_BeginPos + 1); 297 CFX_AffineMatrix matrix(1, 0, 0, 1, 0, dy); 298 Transform(&matrix, m_pReflowedPage->m_pReflowed, pCell->m_BeginPos, pCell->m_EndPos - pCell->m_BeginPos + 1); 329 CFX_AffineMatrix matrix; local 337 rect = pObj->GetBBox(&matrix); 339 rect.Union(pObj->GetBBox(&matrix)); 704 CFX_AffineMatrix matrix( 780 CFX_AffineMatrix matrix; local 1004 CFX_AffineMatrix matrix; local 1108 CFX_AffineMatrix matrix; local 1528 CFX_AffineMatrix matrix; local [all...] |
/external/chromium_org/cc/output/ |
H A D | filter_operations.cc | 127 const SkScalar* matrix = op.matrix(); local 128 if (matrix[15] || 129 matrix[16] || 130 matrix[17] || 131 matrix[18] != 1 || 132 matrix[19])
|
H A D | filter_operation.cc | 62 FilterOperation::FilterOperation(FilterType type, SkScalar matrix[20]) argument 70 memcpy(matrix_, matrix, sizeof(matrix_)); 152 SkScalar matrix[20]; local 153 memset(matrix, 0, 20 * sizeof(SkScalar)); 154 matrix[0] = matrix[6] = matrix[12] = matrix[18] = 1.f; 155 return FilterOperation::CreateColorMatrixFilter(matrix); 281 value->BeginArray("matrix"); [all...] |
/external/chromium_org/skia/ext/ |
H A D | bitmap_platform_device_cairo.cc | 48 void LoadMatrixToContext(cairo_t* context, const SkMatrix& matrix) { argument 51 SkScalarToFloat(matrix.getScaleX()), 52 SkScalarToFloat(matrix.getSkewY()), 53 SkScalarToFloat(matrix.getSkewX()), 54 SkScalarToFloat(matrix.getScaleY()), 55 SkScalarToFloat(matrix.getTranslateX()), 56 SkScalarToFloat(matrix.getTranslateY())); 86 // Load the identity matrix since this is what our clip is relative to.
|
H A D | platform_device_win.cc | 131 void PlatformDevice::LoadTransformToDC(HDC dc, const SkMatrix& matrix) { argument 133 xf.eM11 = matrix[SkMatrix::kMScaleX]; 134 xf.eM21 = matrix[SkMatrix::kMSkewX]; 135 xf.eDx = matrix[SkMatrix::kMTransX]; 136 xf.eM12 = matrix[SkMatrix::kMSkewY]; 137 xf.eM22 = matrix[SkMatrix::kMScaleY]; 138 xf.eDy = matrix[SkMatrix::kMTransY];
|
/external/chromium_org/third_party/skia/samplecode/ |
H A D | SampleAARects.cpp | 78 SkMatrix matrix; local 126 matrix.setRotate(45.f); 127 canvas->concat(matrix); 159 matrix.setScale(-1.f, -1.f); 160 canvas->concat(matrix); 170 matrix.setScale(2.1f, 4.1f); 171 canvas->concat(matrix);
|
/external/chromium_org/third_party/skia/src/views/ |
H A D | SkWindow.cpp | 40 void SkWindow::setMatrix(const SkMatrix& matrix) { argument 41 if (fMatrix != matrix) { 42 fMatrix = matrix; 47 void SkWindow::preConcat(const SkMatrix& matrix) { argument 49 m.setConcat(fMatrix, matrix); 53 void SkWindow::postConcat(const SkMatrix& matrix) { argument 55 m.setConcat(matrix, fMatrix);
|
/external/skia/samplecode/ |
H A D | SampleAARects.cpp | 78 SkMatrix matrix; local 126 matrix.setRotate(45.f); 127 canvas->concat(matrix); 159 matrix.setScale(-1.f, -1.f); 160 canvas->concat(matrix); 170 matrix.setScale(2.1f, 4.1f); 171 canvas->concat(matrix);
|
/external/skia/src/views/ |
H A D | SkWindow.cpp | 39 void SkWindow::setMatrix(const SkMatrix& matrix) { argument 40 if (fMatrix != matrix) { 41 fMatrix = matrix; 46 void SkWindow::preConcat(const SkMatrix& matrix) { argument 48 m.setConcat(fMatrix, matrix); 52 void SkWindow::postConcat(const SkMatrix& matrix) { argument 54 m.setConcat(matrix, fMatrix);
|
/external/ceres-solver/internal/ceres/ |
H A D | block_sparse_matrix.cc | 56 // Count the number of columns in the matrix. 62 // the matrix. 185 TripletSparseMatrix* matrix) const { 186 CHECK_NOTNULL(matrix); 188 matrix->Reserve(num_nonzeros_); 189 matrix->Resize(num_rows_, num_cols_); 190 matrix->SetZero(); 203 matrix->mutable_rows()[jac_pos] = row_block_pos + r; 204 matrix->mutable_cols()[jac_pos] = col_block_pos + c; 205 matrix [all...] |
H A D | dense_normal_cholesky_solver.cc | 74 ConstColMajorMatrixRef Aref = A->matrix(); 83 // same matrix being multiplied with itself and that the product is 92 lhs += D.array().square().matrix().asDiagonal(); 123 // Temporarily append a diagonal block to the A matrix, but undo 124 // it before returning the matrix to the user. 135 // matrix is the same as the number of rows. 145 // Undo the modifications to the matrix A. 152 A->matrix().transpose() * ConstVectorRef(b, A->num_rows());
|
/external/chromium_org/third_party/skia/src/utils/ |
H A D | SkCanvasStateUtils.cpp | 49 float matrix[9]; member in struct:SkMCState 160 static void setup_MC_state(SkMCState* state, const SkMatrix& matrix, const SkRegion& clip) { argument 164 // capture the matrix 166 state->matrix[i] = matrix.get(i); 211 // decompose the total matrix and clip 253 setup_MC_state(&layerState->mcState, layer.matrix(), layer.clip()); 274 // reconstruct the matrix 275 SkMatrix matrix; local 277 matrix [all...] |
H A D | SkCanvasStack.cpp | 64 * We need to handle setMatrix specially as it overwrites the matrix in each 65 * canvas unlike all other matrix operations (i.e. translate, scale, etc) which 66 * just pre-concatenate with the existing matrix. 68 void SkCanvasStack::didSetMatrix(const SkMatrix& matrix) { argument 72 SkMatrix tempMatrix = matrix; 77 this->SkCanvas::didSetMatrix(matrix);
|
/external/skia/src/utils/ |
H A D | SkCanvasStateUtils.cpp | 44 float matrix[9]; member in struct:SkMCState 155 static void setup_MC_state(SkMCState* state, const SkMatrix& matrix, const SkRegion& clip) { argument 159 // capture the matrix 161 state->matrix[i] = matrix.get(i); 206 // decompose the total matrix and clip 248 setup_MC_state(&layerState->mcState, layer.matrix(), layer.clip()); 269 // reconstruct the matrix 270 SkMatrix matrix; local 272 matrix [all...] |
H A D | SkCanvasStack.cpp | 64 * We need to handle setMatrix specially as it overwrites the matrix in each 65 * canvas unlike all other matrix operations (i.e. translate, scale, etc) which 66 * just pre-concatenate with the existing matrix. 68 void SkCanvasStack::didSetMatrix(const SkMatrix& matrix) { argument 72 SkMatrix tempMatrix = matrix; 77 this->SkCanvas::didSetMatrix(matrix);
|
/external/chromium_org/third_party/mesa/src/src/gallium/state_trackers/vega/ |
H A D | path.h | 34 struct matrix; 95 struct matrix *m); 107 void path_render(struct path *p, VGbitfield paintModes, struct matrix *mat);
|
/external/chromium_org/third_party/skia/include/gpu/ |
H A D | GrProcessorStage.h | 51 // We always track the coord change matrix, but it has no effect when explicit local coords 71 * @param matrix The transformation from the old coord system in which geometry is specified 74 void localCoordChange(const SkMatrix& matrix) { argument 76 fCoordChangeMatrix.preConcat(matrix); 79 fCoordChangeMatrix = matrix; 122 * Gets the matrix representing all changes of coordinate system since the GrProcessor was
|
/external/chromium_org/third_party/skia/src/core/ |
H A D | SkRecorder.cpp | 146 const SkMatrix& matrix, 148 APPEND(DrawBitmapMatrix, this->copy(paint), delay_copy(bitmap), matrix); 190 const SkMatrix* matrix, const SkPaint& paint) { 196 this->copy(matrix)); 204 void SkRecorder::onDrawPicture(const SkPicture* pic, const SkMatrix* matrix, const SkPaint* paint) { argument 205 APPEND(DrawPicture, this->copy(paint), pic, this->copy(matrix)); 264 void SkRecorder::didConcat(const SkMatrix& matrix) { argument 268 void SkRecorder::didSetMatrix(const SkMatrix& matrix) { argument 269 SkDEVCODE(if (matrix != this->getTotalMatrix()) { 270 matrix 145 drawBitmapMatrix(const SkBitmap& bitmap, const SkMatrix& matrix, const SkPaint* paint) argument 189 onDrawTextOnPath(const void* text, size_t byteLength, const SkPath& path, const SkMatrix* matrix, const SkPaint& paint) argument [all...] |
/external/chromium_org/third_party/skia/src/effects/ |
H A D | SkRectShaderImageFilter.cpp | 79 SkMatrix matrix(ctx.ctm()); 80 matrix.postTranslate(SkIntToScalar(-bounds.left()), SkIntToScalar(-bounds.top())); 81 paint.setShader(SkShader::CreateLocalMatrixShader(fShader, matrix))->unref();
|
/external/chromium_org/third_party/skia/src/gpu/gl/ |
H A D | GrGLProgramDataManager.h | 88 // matrices are column-major, the first three upload a single matrix, the latter three upload 90 void setMatrix3f(UniformHandle, const GrGLfloat matrix[]) const; 91 void setMatrix4f(UniformHandle, const GrGLfloat matrix[]) const; 95 // convenience method for uploading a SkMatrix to a 3x3 matrix uniform 100 const SkMatrix& matrix) const;
|
/external/mesa3d/src/gallium/state_trackers/vega/ |
H A D | path.h | 34 struct matrix; 95 struct matrix *m); 107 void path_render(struct path *p, VGbitfield paintModes, struct matrix *mat);
|
/external/qemu/distrib/sdl-1.2.15/src/video/dc/ |
H A D | SDL_dcevents.c | 128 if (state->matrix[i]!=old_state.matrix[i]) { 132 SDL_PrivateKeyboard(state->matrix[i]?SDL_PRESSED:SDL_RELEASED,&keysym);
|
/external/eigen/Eigen/src/Eigenvalues/ |
H A D | EigenSolver.h | 25 * \tparam _MatrixType the type of the matrix of which we are computing the 29 * The eigenvalues and eigenvectors of a matrix \f$ A \f$ are scalars 31 * \f$ D \f$ is a diagonal matrix with the eigenvalues on the diagonal, and 32 * \f$ V \f$ is a matrix with the eigenvectors as its columns, then \f$ A V = 33 * V D \f$. The matrix \f$ V \f$ is almost always invertible, in which case we 36 * The eigenvalues and eigenvectors of a matrix may be complex, even when the 37 * matrix is real. However, we can choose real matrices \f$ V \f$ and \f$ D 39 * matrix \f$ D \f$ is not required to be diagonal, but if it is allowed to 47 * a given matrix. Alternatively, you can use the 99 /** \brief Type for matrix o 146 EigenSolver(const MatrixType& matrix, bool computeEigenvectors = true) argument 365 compute(const MatrixType& matrix, bool computeEigenvectors) argument [all...] |
/external/eigen/Eigen/src/QR/ |
H A D | FullPivHouseholderQR.h | 32 * \brief Householder rank-revealing QR decomposition of a matrix with full pivoting 34 * \param MatrixType the type of the matrix of which we are computing the QR decomposition 36 * This class performs a rank-revealing QR decomposition of a matrix \b A into matrices \b P, \b Q and \b R 41 * by using Householder transformations. Here, \b P is a permutation matrix, \b Q a unitary matrix and \b R an 42 * upper triangular matrix. 104 /** \brief Constructs a QR factorization from a given matrix 106 * This constructor computes the QR factorization of the matrix \a matrix by calling 110 * FullPivHouseholderQR<MatrixType> qr(matrix 116 FullPivHouseholderQR(const MatrixType& matrix) argument 408 compute(const MatrixType& matrix) argument [all...] |
/external/eigen/Eigen/src/SparseCore/ |
H A D | SparseBlock.h | 127 _NestedMatrixType& matrix = const_cast<_NestedMatrixType&>(m_matrix);; local 129 // and/or it is not at the end of the nonzeros of the underlying matrix. 136 Index start = m_outerStart==0 ? 0 : matrix.outerIndexPtr()[m_outerStart]; // starting position of the current block 142 ? Index(matrix.data().allocatedSize()) + block_size 156 std::memcpy(&newdata.value(start+nnz), &matrix.data().value(end), tail_size*sizeof(Scalar)); 157 std::memcpy(&newdata.index(start+nnz), &matrix.data().index(end), tail_size*sizeof(Index)); 161 matrix.data().swap(newdata); 166 matrix.data().resize(start + nnz + tail_size); 168 std::memmove(&matrix.data().value(start+nnz), &matrix [all...] |