Lines Matching full:matrix
36 // true iff the matrix contains, at most, scale and translate elements
42 * For the purposes of drawing bitmaps, if a matrix is "almost" translate
45 static bool just_trans_clamp(const SkMatrix& matrix, const SkBitmap& bitmap) {
46 SkASSERT(matrix_only_scale_translate(matrix));
48 if (matrix.getType() & SkMatrix::kScale_Mask) {
55 matrix.mapPoints(SkTCast<SkPoint*>(&dst),
62 // phase (in pixel space) that any translate in the matrix might impart.
71 static bool just_trans_general(const SkMatrix& matrix) {
72 SkASSERT(matrix_only_scale_translate(matrix));
74 if (matrix.getType() & SkMatrix::kScale_Mask) {
77 if (!SkScalarNearlyZero(matrix[SkMatrix::kMScaleX] - SK_Scalar1, tol)) {
80 if (!SkScalarNearlyZero(matrix[SkMatrix::kMScaleY] - SK_Scalar1, tol)) {
139 // Check to see if the transformation matrix is simple, and if we're
141 // remove the scaling component from the matrix.
180 // set the inv matrix type to translate-only;
199 * For now, we compute the "scale" value from the matrix, and have a
231 * for upscaling. Since we're examining the inverse matrix, we look for
319 // matrix as well as the working bitmap. It may also adjust the filter
325 // Now that all possible changes to the matrix have taken place, check
326 // to see if we're really close to a no-scale matrix. If so, explicitly
327 // set it to be so. Subsequent code may inspect this matrix to choose
330 // This code will only execute if the matrix has some scale component;
360 // recompute the triviality of the matrix here because we may have
386 // Only try bilerp if the matrix is "interesting" and
687 // When the matrix has a scale component the setup code in
688 // chooseProcs multiples the inverse matrix by the inverse of the
771 // if we get called, the matrix is too tricky, so we just draw nothing
791 // rather than running through the inverse-matrix
931 The storage requirements for the different matrix procs are as follows,
