Lines Matching +full:- +full:m

46     matrix->m[0][0] = 1.0f;  in lv_matrix_identity()
47 matrix->m[0][1] = 0.0f; in lv_matrix_identity()
48 matrix->m[0][2] = 0.0f; in lv_matrix_identity()
49 matrix->m[1][0] = 0.0f; in lv_matrix_identity()
50 matrix->m[1][1] = 1.0f; in lv_matrix_identity()
51 matrix->m[1][2] = 0.0f; in lv_matrix_identity()
52 matrix->m[2][0] = 0.0f; in lv_matrix_identity()
53 matrix->m[2][1] = 0.0f; in lv_matrix_identity()
54 matrix->m[2][2] = 1.0f; in lv_matrix_identity()
61 matrix->m[0][2] += dx; in lv_matrix_translate()
62 matrix->m[1][2] += dy; in lv_matrix_translate()
95 {cos_r, -sin_r, 0.0f}, in lv_matrix_rotate()
128 tmp.m[y][x] = (matrix->m[y][0] * mul->m[0][x]) in lv_matrix_multiply()
129 + (matrix->m[y][1] * mul->m[1][x]) in lv_matrix_multiply()
130 + (matrix->m[y][2] * mul->m[2][x]); in lv_matrix_multiply()
137 bool lv_matrix_inverse(lv_matrix_t * matrix, const lv_matrix_t * m) in lv_matrix_inverse() argument
144 if(m == NULL) { in lv_matrix_inverse()
149 det00 = (m->m[1][1] * m->m[2][2]) - (m->m[2][1] * m->m[1][2]); in lv_matrix_inverse()
150 det01 = (m->m[2][0] * m->m[1][2]) - (m->m[1][0] * m->m[2][2]); in lv_matrix_inverse()
151 det02 = (m->m[1][0] * m->m[2][1]) - (m->m[2][0] * m->m[1][1]); in lv_matrix_inverse()
154 d = (m->m[0][0] * det00) + (m->m[0][1] * det01) + (m->m[0][2] * det02); in lv_matrix_inverse()
164 is_affine = (m->m[2][0] == 0.0f) && (m->m[2][1] == 0.0f) && (m->m[2][2] == 1.0f); in lv_matrix_inverse()
166 matrix->m[0][0] = d * det00; in lv_matrix_inverse()
167 matrix->m[0][1] = d * ((m->m[2][1] * m->m[0][2]) - (m->m[0][1] * m->m[2][2])); in lv_matrix_inverse()
168 matrix->m[0][2] = d * ((m->m[0][1] * m->m[1][2]) - (m->m[1][1] * m->m[0][2])); in lv_matrix_inverse()
169 matrix->m[1][0] = d * det01; in lv_matrix_inverse()
170 matrix->m[1][1] = d * ((m->m[0][0] * m->m[2][2]) - (m->m[2][0] * m->m[0][2])); in lv_matrix_inverse()
171 matrix->m[1][2] = d * ((m->m[1][0] * m->m[0][2]) - (m->m[0][0] * m->m[1][2])); in lv_matrix_inverse()
172 matrix->m[2][0] = is_affine ? 0.0f : d * det02; in lv_matrix_inverse()
173 … matrix->m[2][1] = is_affine ? 0.0f : d * ((m->m[2][0] * m->m[0][1]) - (m->m[0][0] * m->m[2][1])); in lv_matrix_inverse()
174 … matrix->m[2][2] = is_affine ? 1.0f : d * ((m->m[0][0] * m->m[1][1]) - (m->m[1][0] * m->m[0][1])); in lv_matrix_inverse()
183 …p.x = (lv_value_precise_t)roundf(point->x * matrix->m[0][0] + point->y * matrix->m[0][1] + matrix- in lv_matrix_transform_precise_point()
184 …p.y = (lv_value_precise_t)roundf(point->x * matrix->m[1][0] + point->y * matrix->m[1][1] + matrix- in lv_matrix_transform_precise_point()
192 {area->x1, area->y1}, in lv_matrix_transform_area()
193 {area->x1, area->y2}, in lv_matrix_transform_area()
194 {area->x2, area->y1}, in lv_matrix_transform_area()
195 {area->x2, area->y2}, in lv_matrix_transform_area()
212 return (matrix->m[0][0] == 1.0f && in lv_matrix_is_identity_or_translation()
213 matrix->m[0][1] == 0.0f && in lv_matrix_is_identity_or_translation()
214 matrix->m[1][0] == 0.0f && in lv_matrix_is_identity_or_translation()
215 matrix->m[1][1] == 1.0f && in lv_matrix_is_identity_or_translation()
216 matrix->m[2][0] == 0.0f && in lv_matrix_is_identity_or_translation()
217 matrix->m[2][1] == 0.0f && in lv_matrix_is_identity_or_translation()
218 matrix->m[2][2] == 1.0f); in lv_matrix_is_identity_or_translation()