geometry.c File Reference
Include dependency graph for geometry.c:
Go to the source code of this file.
Classes | |
| struct | d2d_segment_idx |
| struct | d2d_figure |
| struct | d2d_cdt_edge_ref |
| struct | d2d_cdt_edge |
| struct | d2d_cdt |
| struct | d2d_geometry_intersection |
| struct | d2d_geometry_intersections |
| struct | d2d_fp_two_vec2 |
| struct | d2d_fp_fin |
Macros | |
| #define | D2D_FIGURE_FLAG_CLOSED 0x00000001u |
| #define | D2D_FIGURE_FLAG_HOLLOW 0x00000002u |
| #define | D2D_CDT_EDGE_FLAG_FREED 0x80000000u |
| #define | D2D_CDT_EDGE_FLAG_VISITED(r) (1u << (r)) |
| #define | D2D_FP_EPS (1.0f / (1 << FLT_MANT_DIG)) |
Enumerations | |
| enum | d2d_cdt_edge_next { D2D_EDGE_NEXT_ORIGIN = 0 , D2D_EDGE_NEXT_ROT = 1 , D2D_EDGE_NEXT_SYM = 2 , D2D_EDGE_NEXT_TOR = 3 } |
| enum | d2d_vertex_type { D2D_VERTEX_TYPE_NONE , D2D_VERTEX_TYPE_LINE , D2D_VERTEX_TYPE_BEZIER , D2D_VERTEX_TYPE_SPLIT_BEZIER , D2D_VERTEX_TYPE_END } |
Variables | |
| static const D2D1_MATRIX_3X2_F | identity |
| static const struct ID2D1GeometrySinkVtbl | d2d_geometry_sink_vtbl |
| static const struct ID2D1PathGeometry1Vtbl | d2d_path_geometry_vtbl |
| static const struct ID2D1EllipseGeometryVtbl | d2d_ellipse_geometry_vtbl |
| static const struct ID2D1RectangleGeometryVtbl | d2d_rectangle_geometry_vtbl |
| static const struct ID2D1RoundedRectangleGeometryVtbl | d2d_rounded_rectangle_geometry_vtbl |
| static const struct ID2D1TransformedGeometryVtbl | d2d_transformed_geometry_vtbl |
| static const struct ID2D1GeometryGroupVtbl | d2d_geometry_group_vtbl |
Macro Definition Documentation
◆ D2D_CDT_EDGE_FLAG_FREED
| #define D2D_CDT_EDGE_FLAG_FREED 0x80000000u |
Definition at line 27 of file geometry.c.
◆ D2D_CDT_EDGE_FLAG_VISITED
◆ D2D_FIGURE_FLAG_CLOSED
| #define D2D_FIGURE_FLAG_CLOSED 0x00000001u |
Definition at line 24 of file geometry.c.
◆ D2D_FIGURE_FLAG_HOLLOW
| #define D2D_FIGURE_FLAG_HOLLOW 0x00000002u |
Definition at line 25 of file geometry.c.
◆ D2D_FP_EPS
| #define D2D_FP_EPS (1.0f / (1 << FLT_MANT_DIG)) |
Definition at line 30 of file geometry.c.
Enumeration Type Documentation
◆ d2d_cdt_edge_next
| Enumerator | |
|---|---|
| D2D_EDGE_NEXT_ORIGIN | |
| D2D_EDGE_NEXT_ROT | |
| D2D_EDGE_NEXT_SYM | |
| D2D_EDGE_NEXT_TOR | |
Definition at line 39 of file geometry.c.
40{
41 D2D_EDGE_NEXT_ORIGIN = 0,
42 D2D_EDGE_NEXT_ROT = 1,
43 D2D_EDGE_NEXT_SYM = 2,
44 D2D_EDGE_NEXT_TOR = 3,
45};
◆ d2d_vertex_type
| Enumerator | |
|---|---|
| D2D_VERTEX_TYPE_NONE | |
| D2D_VERTEX_TYPE_LINE | |
| D2D_VERTEX_TYPE_BEZIER | |
| D2D_VERTEX_TYPE_SPLIT_BEZIER | |
| D2D_VERTEX_TYPE_END | |
Definition at line 47 of file geometry.c.
48{
54};
Function Documentation
◆ d2d_cdt_ccw()
Definition at line 983 of file geometry.c.
984{
986}
static float d2d_point_ccw(const D2D1_POINT_2F *a, const D2D1_POINT_2F *b, const D2D1_POINT_2F *c)
Definition: geometry.c:432
Referenced by d2d_cdt_cut_edges(), d2d_cdt_insert_segment(), d2d_cdt_leftof(), d2d_cdt_rightof(), and d2d_cdt_triangulate().
◆ d2d_cdt_compare_vertices()
Definition at line 1553 of file geometry.c.
1554{
1558
1559 if (diff == 0.0f)
1561
1562 return diff == 0.0f ? 0 : (diff > 0.0f ? 1 : -1);
1563}
Definition: dcommon.idl:75
Referenced by d2d_cdt_insert_segments(), and d2d_path_geometry_triangulate().
◆ d2d_cdt_connect()
|
static |
Definition at line 1368 of file geometry.c.
1370{
1372
1381
1383}
static void d2d_cdt_edge_set_origin(const struct d2d_cdt *cdt, const struct d2d_cdt_edge_ref *e, size_t vertex)
Definition: geometry.c:971
static void d2d_cdt_edge_set_destination(const struct d2d_cdt *cdt, const struct d2d_cdt_edge_ref *e, size_t vertex)
Definition: geometry.c:977
static size_t d2d_cdt_edge_origin(const struct d2d_cdt *cdt, const struct d2d_cdt_edge_ref *e)
Definition: geometry.c:961
static void d2d_cdt_splice(const struct d2d_cdt *cdt, const struct d2d_cdt_edge_ref *a, const struct d2d_cdt_edge_ref *b)
Definition: geometry.c:1294
static BOOL d2d_cdt_create_edge(struct d2d_cdt *cdt, struct d2d_cdt_edge_ref *e)
Definition: geometry.c:1313
static void d2d_cdt_edge_next_left(const struct d2d_cdt *cdt, struct d2d_cdt_edge_ref *dst, const struct d2d_cdt_edge_ref *src)
Definition: geometry.c:943
static size_t d2d_cdt_edge_destination(const struct d2d_cdt *cdt, const struct d2d_cdt_edge_ref *e)
Definition: geometry.c:966
static void d2d_cdt_edge_sym(struct d2d_cdt_edge_ref *dst, const struct d2d_cdt_edge_ref *src)
Definition: geometry.c:931
Definition: geometry.c:84
Referenced by d2d_cdt_fixup(), d2d_cdt_insert_segment(), d2d_cdt_merge(), and d2d_cdt_triangulate().
◆ d2d_cdt_create_edge()
|
static |
Definition at line 1313 of file geometry.c.
1314{
1316
1318 {
1321 }
1322 else
1323 {
1324 if (!d2d_array_reserve((void **)&cdt->edges, &cdt->edges_size, cdt->edge_count + 1, sizeof(*cdt->edges)))
1325 {
1328 }
1330 }
1331 e->r = 0;
1332
1338 edge->flags = 0;
1339
1341}
static BOOL d2d_array_reserve(void **elements, size_t *capacity, size_t count, size_t size)
Definition: d2d1_private.h:897
static void d2d_cdt_edge_rot(struct d2d_cdt_edge_ref *dst, const struct d2d_cdt_edge_ref *src)
Definition: geometry.c:925
static void d2d_cdt_edge_tor(struct d2d_cdt_edge_ref *dst, const struct d2d_cdt_edge_ref *src)
Definition: geometry.c:937
GLsizei GLenum const GLvoid GLsizei GLenum GLbyte GLbyte GLbyte GLdouble GLdouble GLdouble GLfloat GLfloat GLfloat GLint GLint GLint GLshort GLshort GLshort GLubyte GLubyte GLubyte GLuint GLuint GLuint GLushort GLushort GLushort GLbyte GLbyte GLbyte GLbyte GLdouble GLdouble GLdouble GLdouble GLfloat GLfloat GLfloat GLfloat GLint GLint GLint GLint GLshort GLshort GLshort GLshort GLubyte GLubyte GLubyte GLubyte GLuint GLuint GLuint GLuint GLushort GLushort GLushort GLushort GLboolean const GLdouble const GLfloat const GLint const GLshort const GLbyte const GLdouble const GLfloat const GLint const GLshort const GLdouble const GLfloat const GLint const GLshort const GLdouble const GLfloat const GLint const GLshort const GLdouble const GLfloat const GLint const GLshort const GLdouble const GLdouble const GLfloat const GLfloat const GLint const GLint const GLshort const GLshort const GLdouble const GLfloat const GLint const GLshort const GLdouble const GLfloat const GLint const GLshort const GLdouble const GLfloat const GLint const GLshort const GLdouble const GLfloat const GLint const GLshort const GLdouble const GLfloat const GLint const GLshort const GLdouble const GLfloat const GLint const GLshort const GLdouble const GLfloat const GLint const GLshort GLenum GLenum GLenum GLfloat GLenum GLint GLenum GLenum GLenum GLfloat GLenum GLenum GLint GLenum GLfloat GLenum GLint GLint GLushort GLenum GLenum GLfloat GLenum GLenum GLint GLfloat const GLubyte GLenum GLenum GLenum const GLfloat GLenum GLenum const GLint GLenum GLint GLint GLsizei GLsizei GLint GLenum GLenum const GLvoid GLenum GLenum const GLfloat GLenum GLenum const GLint GLenum GLenum const GLdouble GLenum GLenum const GLfloat GLenum GLenum const GLint GLsizei GLuint GLfloat GLuint GLbitfield GLfloat GLint GLuint GLboolean GLenum GLfloat GLenum GLbitfield GLenum GLfloat GLfloat GLint GLint const GLfloat GLenum GLfloat GLfloat GLint GLint GLfloat GLfloat GLint GLint const GLfloat GLint GLfloat GLfloat GLint GLfloat GLfloat GLint GLfloat GLfloat const GLdouble * u
Definition: glfuncs.h:240
Definition: geometry.c:90
Referenced by d2d_cdt_connect(), and d2d_cdt_triangulate().
◆ d2d_cdt_cut_edges()
|
static |
Definition at line 1730 of file geometry.c.
1732{
1734 float ccw;
1735
1738 {
1739 *end_edge = next;
1740 return;
1741 }
1742
1744 if (ccw == 0.0f)
1745 {
1746 *end_edge = next;
1747 return;
1748 }
1749
1750 if (ccw > 0.0f)
1752
1756}
static void d2d_cdt_destroy_edge(struct d2d_cdt *cdt, const struct d2d_cdt_edge_ref *e)
Definition: geometry.c:1343
static float d2d_cdt_ccw(const struct d2d_cdt *cdt, size_t a, size_t b, size_t c)
Definition: geometry.c:983
static void d2d_cdt_cut_edges(struct d2d_cdt *cdt, struct d2d_cdt_edge_ref *end_edge, const struct d2d_cdt_edge_ref *base_edge, size_t start_vertex, size_t end_vertex)
Definition: geometry.c:1730
Referenced by d2d_cdt_cut_edges(), and d2d_cdt_insert_segment().
◆ d2d_cdt_destroy_edge()
Definition at line 1343 of file geometry.c.
1344{
1346
1349 {
1352 }
1353
1355
1358 {
1359 d2d_cdt_edge_prev_origin(cdt, &prev, &sym);
1360 d2d_cdt_splice(cdt, &sym, &prev);
1361 }
1362
1366}
static void d2d_cdt_edge_prev_origin(const struct d2d_cdt *cdt, struct d2d_cdt_edge_ref *dst, const struct d2d_cdt_edge_ref *src)
Definition: geometry.c:955
static void d2d_cdt_edge_next_origin(const struct d2d_cdt *cdt, struct d2d_cdt_edge_ref *dst, const struct d2d_cdt_edge_ref *src)
Definition: geometry.c:949
Referenced by d2d_cdt_cut_edges(), d2d_cdt_insert_segment(), and d2d_cdt_merge().
◆ d2d_cdt_edge_destination()
|
static |
Definition at line 966 of file geometry.c.
Referenced by d2d_cdt_connect(), d2d_cdt_cut_edges(), d2d_cdt_fixup(), d2d_cdt_insert_segment(), d2d_cdt_leftof(), d2d_cdt_merge(), and d2d_cdt_rightof().
◆ d2d_cdt_edge_next_left()
|
static |
Definition at line 943 of file geometry.c.
945{
947}
Referenced by d2d_cdt_connect(), d2d_cdt_cut_edges(), d2d_cdt_fixup(), d2d_cdt_insert_segment(), d2d_cdt_merge(), and d2d_path_geometry_add_fill_face().
◆ d2d_cdt_edge_next_origin()
|
static |
Definition at line 949 of file geometry.c.
Referenced by d2d_cdt_destroy_edge(), d2d_cdt_insert_segment(), and d2d_cdt_merge().
◆ d2d_cdt_edge_origin()
|
static |
Definition at line 961 of file geometry.c.
Referenced by d2d_cdt_connect(), d2d_cdt_fixup(), d2d_cdt_insert_segment(), d2d_cdt_insert_segments(), d2d_cdt_leftof(), d2d_cdt_merge(), d2d_cdt_rightof(), and d2d_path_geometry_add_fill_face().
◆ d2d_cdt_edge_prev_origin()
|
static |
Definition at line 955 of file geometry.c.
Referenced by d2d_cdt_destroy_edge(), and d2d_cdt_merge().
◆ d2d_cdt_edge_rot()
|
static |
Definition at line 925 of file geometry.c.
Referenced by d2d_cdt_create_edge(), d2d_cdt_edge_next_left(), d2d_cdt_edge_prev_origin(), and d2d_cdt_splice().
◆ d2d_cdt_edge_set_destination()
|
static |
Definition at line 977 of file geometry.c.
Referenced by d2d_cdt_connect(), and d2d_cdt_triangulate().
◆ d2d_cdt_edge_set_origin()
|
static |
Definition at line 971 of file geometry.c.
Referenced by d2d_cdt_connect(), and d2d_cdt_triangulate().
◆ d2d_cdt_edge_sym()
|
static |
Definition at line 931 of file geometry.c.
Referenced by d2d_cdt_connect(), d2d_cdt_create_edge(), d2d_cdt_cut_edges(), d2d_cdt_destroy_edge(), d2d_cdt_fixup(), d2d_cdt_generate_faces(), d2d_cdt_insert_segment(), d2d_cdt_insert_segments(), d2d_cdt_merge(), and d2d_cdt_triangulate().
◆ d2d_cdt_edge_tor()
|
static |
Definition at line 937 of file geometry.c.
Referenced by d2d_cdt_create_edge().
◆ d2d_cdt_fixup()
|
static |
Definition at line 1689 of file geometry.c.
1690{
1693
1696 {
1699 }
1700
1701 candidate = next;
1703 {
1704 if (d2d_cdt_incircle(cdt, d2d_cdt_edge_origin(cdt, base_edge), d2d_cdt_edge_destination(cdt, base_edge),
1706 candidate = next;
1708 ++count;
1709 }
1710
1712 {
1716 else
1717 next = *base_edge;
1722 d2d_cdt_edge_sym(&new_base, &new_base);
1725 }
1726
1728}
static BOOL d2d_cdt_connect(struct d2d_cdt *cdt, struct d2d_cdt_edge_ref *e, const struct d2d_cdt_edge_ref *a, const struct d2d_cdt_edge_ref *b)
Definition: geometry.c:1368
static BOOL d2d_cdt_incircle(const struct d2d_cdt *cdt, size_t a, size_t b, size_t c, size_t d)
Definition: geometry.c:1165
static BOOL d2d_cdt_fixup(struct d2d_cdt *cdt, const struct d2d_cdt_edge_ref *base_edge)
Definition: geometry.c:1689
Referenced by d2d_cdt_fixup(), and d2d_cdt_insert_segment().
◆ d2d_cdt_generate_faces()
|
static |
Definition at line 1660 of file geometry.c.
1661{
1664
1666 {
1668 continue;
1669
1670 base_edge.idx = i;
1671 base_edge.r = 0;
1673 goto fail;
1674 d2d_cdt_edge_sym(&base_edge, &base_edge);
1676 goto fail;
1677 }
1678
1680
1681fail:
1684 geometry->fill.faces_size = 0;
1685 geometry->fill.face_count = 0;
1687}
static BOOL d2d_path_geometry_add_fill_face(struct d2d_geometry *geometry, const struct d2d_cdt *cdt, const struct d2d_cdt_edge_ref *base_edge)
Definition: geometry.c:1614
GLsizei GLenum const GLvoid GLsizei GLenum GLbyte GLbyte GLbyte GLdouble GLdouble GLdouble GLfloat GLfloat GLfloat GLint GLint GLint GLshort GLshort GLshort GLubyte GLubyte GLubyte GLuint GLuint GLuint GLushort GLushort GLushort GLbyte GLbyte GLbyte GLbyte GLdouble GLdouble GLdouble GLdouble GLfloat GLfloat GLfloat GLfloat GLint GLint GLint GLint GLshort GLshort GLshort GLshort GLubyte GLubyte GLubyte GLubyte GLuint GLuint GLuint GLuint GLushort GLushort GLushort GLushort GLboolean const GLdouble const GLfloat const GLint const GLshort const GLbyte const GLdouble const GLfloat const GLint const GLshort const GLdouble const GLfloat const GLint const GLshort const GLdouble const GLfloat const GLint const GLshort const GLdouble const GLfloat const GLint const GLshort const GLdouble const GLdouble const GLfloat const GLfloat const GLint const GLint const GLshort const GLshort const GLdouble const GLfloat const GLint const GLshort const GLdouble const GLfloat const GLint const GLshort const GLdouble const GLfloat const GLint const GLshort const GLdouble const GLfloat const GLint const GLshort const GLdouble const GLfloat const GLint const GLshort const GLdouble const GLfloat const GLint const GLshort const GLdouble const GLfloat const GLint const GLshort GLenum GLenum GLenum GLfloat GLenum GLint GLenum GLenum GLenum GLfloat GLenum GLenum GLint GLenum GLfloat GLenum GLint GLint GLushort GLenum GLenum GLfloat GLenum GLenum GLint GLfloat const GLubyte GLenum GLenum GLenum const GLfloat GLenum GLenum const GLint GLenum GLint GLint GLsizei GLsizei GLint GLenum GLenum const GLvoid GLenum GLenum const GLfloat GLenum GLenum const GLint GLenum GLenum const GLdouble GLenum GLenum const GLfloat GLenum GLenum const GLint GLsizei GLuint GLfloat GLuint GLbitfield GLfloat GLint GLuint GLboolean GLenum GLfloat GLenum GLbitfield GLenum GLfloat GLfloat GLint GLint const GLfloat GLenum GLfloat GLfloat GLint GLint GLfloat GLfloat GLint GLint const GLfloat GLint GLfloat GLfloat GLint GLfloat GLfloat GLint GLfloat GLfloat const GLdouble const GLfloat const GLdouble const GLfloat GLint i
Definition: glfuncs.h:248
struct d2d_geometry::@241 fill
Referenced by d2d_path_geometry_triangulate().
◆ d2d_cdt_incircle()
|
static |
Definition at line 1165 of file geometry.c.
1166{
1171
1172 size_t axt_det_bc_len, ayt_det_bc_len, bxt_det_ca_len, byt_det_ca_len, cxt_det_ab_len, cyt_det_ab_len;
1173 float axt_det_bc[8], ayt_det_bc[8], bxt_det_ca[8], byt_det_ca[8], cxt_det_ab[8], cyt_det_ab[8];
1174 float fin1[1152], fin2[1152], temp64[64], sub_det_a[32], sub_det_b[32], sub_det_c[32];
1175 float det_bc[4], det_ca[4], det_ab[4], daz[4], dbz[4], dcz[4], temp2a[2], temp2b[2];
1176 size_t temp64_len, sub_det_a_len, sub_det_b_len, sub_det_c_len;
1177 float dbxdcy, dbydcx, dcxday, dcydax, daxdby, daydbx;
1180 float permanent, err_bound, det;
1182
1189
1190 daz[3] = da.x[1] * da.x[1] + da.y[1] * da.y[1];
1191 dbxdcy = db.x[1] * dc.y[1];
1192 dbydcx = db.y[1] * dc.x[1];
1193
1194 dbz[3] = db.x[1] * db.x[1] + db.y[1] * db.y[1];
1195 dcxday = dc.x[1] * da.y[1];
1196 dcydax = dc.y[1] * da.x[1];
1197
1199 daxdby = da.x[1] * db.y[1];
1200 daydbx = da.y[1] * db.x[1];
1201
1202 det = daz[3] * (dbxdcy - dbydcx) + dbz[3] * (dcxday - dcydax) + dcz[3] * (daxdby - daydbx);
1206 err_bound = err_bound_a * permanent;
1207 if (det > err_bound || -det > err_bound)
1208 return det > 0.0f;
1209
1210 fin.now = fin1;
1211 fin.other = fin2;
1212
1214 d2d_fp_sub_det3x3(sub_det_a, &sub_det_a_len, &da, det_bc);
1215
1217 d2d_fp_sub_det3x3(sub_det_b, &sub_det_b_len, &db, det_ca);
1218
1219 d2d_fp_four_det2x2(det_ab, da.x[1], da.y[1], db.x[1], db.y[1]);
1221
1222 d2d_fp_fast_expansion_sum_zeroelim(temp64, &temp64_len, sub_det_a, sub_det_a_len, sub_det_b, sub_det_b_len);
1223 d2d_fp_fast_expansion_sum_zeroelim(fin.now, &fin.length, temp64, temp64_len, sub_det_c, sub_det_c_len);
1224 det = d2d_fp_estimate(fin.now, fin.length);
1225 err_bound = err_bound_b * permanent;
1226 if (det >= err_bound || -det >= err_bound)
1227 return det > 0.0f;
1228
1236 && da.y[0] == 0.0f && db.y[0] == 0.0f && dc.y[0] == 0.0f)
1237 return det > 0.0f;
1238
1239 err_bound = err_bound_c * permanent + err_bound_result * fabsf(det);
1240 det += (daz[3] * ((db.x[1] * dc.y[0] + dc.y[1] * db.x[0]) - (db.y[1] * dc.x[0] + dc.x[1] * db.y[0]))
1242 + (dbz[3] * ((dc.x[1] * da.y[0] + da.y[1] * dc.x[0]) - (dc.y[1] * da.x[0] + da.x[1] * dc.y[0]))
1244 + (dcz[3] * ((da.x[1] * db.y[0] + db.y[1] * da.x[0]) - (da.y[1] * db.x[0] + db.x[1] * da.y[0]))
1246 if (det >= err_bound || -det >= err_bound)
1247 return det > 0.0f;
1248
1250 {
1251 d2d_fp_square(temp2a, da.x[1]);
1252 d2d_fp_square(temp2b, da.y[1]);
1253 d2d_fp_two_two_sum(daz, temp2a, temp2b);
1254 }
1256 {
1257 d2d_fp_square(temp2a, db.x[1]);
1258 d2d_fp_square(temp2b, db.y[1]);
1259 d2d_fp_two_two_sum(dbz, temp2a, temp2b);
1260 }
1261 if (da.x[0] != 0.0f || da.y[0] != 0.0f || db.x[0] != 0.0f || db.y[0] != 0.0f)
1262 {
1265 d2d_fp_two_two_sum(dcz, temp2a, temp2b);
1266 }
1267
1268 if (da.x[0] != 0.0f)
1269 d2d_cdt_incircle_refine1(&fin, axt_det_bc, &axt_det_bc_len, det_bc, dc.y[1], dcz, db.y[1], dbz, da.x);
1270 if (da.y[0] != 0.0f)
1271 d2d_cdt_incircle_refine1(&fin, ayt_det_bc, &ayt_det_bc_len, det_bc, db.x[1], dbz, dc.x[1], dcz, da.y);
1272 if (db.x[0] != 0.0f)
1273 d2d_cdt_incircle_refine1(&fin, bxt_det_ca, &bxt_det_ca_len, det_ca, da.y[1], daz, dc.y[1], dcz, db.x);
1274 if (db.y[0] != 0.0f)
1275 d2d_cdt_incircle_refine1(&fin, byt_det_ca, &byt_det_ca_len, det_ca, dc.x[1], dcz, da.x[1], daz, db.y);
1277 d2d_cdt_incircle_refine1(&fin, cxt_det_ab, &cxt_det_ab_len, det_ab, db.y[1], dbz, da.y[1], daz, dc.x);
1279 d2d_cdt_incircle_refine1(&fin, cyt_det_ab, &cyt_det_ab_len, det_ab, da.x[1], daz, db.x[1], dbz, dc.y);
1280
1281 if (da.x[0] != 0.0f || da.y[0] != 0.0f)
1283 axt_det_bc, axt_det_bc_len, ayt_det_bc, ayt_det_bc_len);
1284 if (db.x[0] != 0.0f || db.y[0] != 0.0f)
1286 bxt_det_ca, bxt_det_ca_len, byt_det_ca, byt_det_ca_len);
1289 cxt_det_ab, cxt_det_ab_len, cyt_det_ab, cyt_det_ab_len);
1290
1291 return fin.now[fin.length - 1] > 0.0f;
1292}
static void d2d_fp_two_two_sum(float *out, const float *a, const float *b)
Definition: geometry.c:191
static void d2d_cdt_incircle_refine1(struct d2d_fp_fin *fin, float *det_abt, size_t *det_abt_len, const float *det_ab, float a, const float *az, float b, const float *bz, const float *c)
Definition: geometry.c:1024
static void d2d_cdt_incircle_refine2(struct d2d_fp_fin *fin, const struct d2d_fp_two_vec2 *a, const struct d2d_fp_two_vec2 *b, const float *bz, const struct d2d_fp_two_vec2 *c, const float *cz, const float *axt_det_bc, size_t axt_det_bc_len, const float *ayt_det_bc, size_t ayt_det_bc_len)
Definition: geometry.c:1043
static void d2d_fp_fast_expansion_sum_zeroelim(float *out, size_t *out_len, const float *a, size_t a_len, const float *b, size_t b_len)
Definition: geometry.c:276
static void d2d_fp_four_det2x2(float *out, float ax, float ay, float bx, float by)
Definition: geometry.c:1000
static void d2d_fp_sub_det3x3(float *out, size_t *out_len, const struct d2d_fp_two_vec2 *a, const float *det2x2)
Definition: geometry.c:1010
static void d2d_fp_two_diff_tail(float *out, float a, float b, float x)
Definition: geometry.c:201
_ACRTIMP float __cdecl fabsf(float)
Definition: geometry.c:129
Definition: geometry.c:123
Referenced by d2d_cdt_fixup(), and d2d_cdt_merge().
◆ d2d_cdt_incircle_refine1()
|
static |
Definition at line 1024 of file geometry.c.
1026{
1027 size_t temp48_len, temp32_len, temp16a_len, temp16b_len, temp16c_len, temp8_len;
1028 float temp48[48], temp32[32], temp16a[16], temp16b[16], temp16c[16], temp8[8];
1030
1037 d2d_fp_fast_expansion_sum_zeroelim(temp32, &temp32_len, temp16a, temp16a_len, temp16b, temp16b_len);
1038 d2d_fp_fast_expansion_sum_zeroelim(temp48, &temp48_len, temp16c, temp16c_len, temp32, temp32_len);
1039 d2d_fp_fast_expansion_sum_zeroelim(fin->other, &fin->length, fin->now, fin->length, temp48, temp48_len);
1041}
static void d2d_fp_scale_expansion_zeroelim(float *out, size_t *out_len, const float *a, size_t a_len, float b)
Definition: geometry.c:350
Referenced by d2d_cdt_incircle().
◆ d2d_cdt_incircle_refine2()
|
static |
Definition at line 1043 of file geometry.c.
1046{
1047 size_t temp64_len, temp48_len, temp32a_len, temp32b_len, temp16a_len, temp16b_len, temp8_len;
1048 float temp64[64], temp48[48], temp32a[32], temp32b[32], temp16a[16], temp16b[16], temp8[8];
1049 float bct[8], bctt[4], temp4a[4], temp4b[4], temp2a[2], temp2b[2];
1050 size_t bct_len, bctt_len;
1052
1053 /* bct = (b->x[0] * c->y[1] + b->x[1] * c->y[0]) - (c->x[0] * b->y[1] + c->x[1] * b->y[0]) */
1054 /* bctt = b->x[0] * c->y[0] + c->x[0] * b->y[0] */
1056 {
1059 d2d_fp_two_two_sum(temp4a, temp2a, temp2b);
1062 d2d_fp_two_two_sum(temp4b, temp2a, temp2b);
1063 d2d_fp_fast_expansion_sum_zeroelim(bct, &bct_len, temp4a, 4, temp4b, 4);
1064
1067 d2d_fp_two_two_diff(bctt, temp2a, temp2b);
1068 bctt_len = 4;
1069 }
1070 else
1071 {
1072 bct[0] = 0.0f;
1073 bct_len = 1;
1074 bctt[0] = 0.0f;
1075 bctt_len = 1;
1076 }
1077
1079 {
1080 size_t axt_bct_len, axt_bctt_len;
1081 float axt_bct[16], axt_bctt[8];
1082
1083 /* fin += a->x[0] * (axt_det_bc + bct * 2.0f * a->x[1]) */
1087 d2d_fp_fast_expansion_sum_zeroelim(temp48, &temp48_len, temp16a, temp16a_len, temp32a, temp32a_len);
1088 d2d_fp_fast_expansion_sum_zeroelim(fin->other, &fin->length, fin->now, fin->length, temp48, temp48_len);
1090
1092 {
1093 /* fin += a->x[0] * cz * b->y[0] */
1096 d2d_fp_fast_expansion_sum_zeroelim(fin->other, &fin->length, fin->now, fin->length, temp16a, temp16a_len);
1098 }
1099
1101 {
1102 /* fin -= a->x[0] * bz * c->y[0] */
1105 d2d_fp_fast_expansion_sum_zeroelim(fin->other, &fin->length, fin->now, fin->length, temp16a, temp16a_len);
1107 }
1108
1109 /* fin += a->x[0] * (bct * a->x[0] + bctt * (2.0f * a->x[1] + a->x[0])) */
1112 d2d_fp_scale_expansion_zeroelim(temp16a, &temp16a_len, axt_bctt, axt_bctt_len, 2.0f * a->x[1]);
1114 d2d_fp_fast_expansion_sum_zeroelim(temp32b, &temp32b_len, temp16a, temp16a_len, temp16b, temp16b_len);
1115 d2d_fp_fast_expansion_sum_zeroelim(temp64, &temp64_len, temp32a, temp32a_len, temp32b, temp32b_len);
1116 d2d_fp_fast_expansion_sum_zeroelim(fin->other, &fin->length, fin->now, fin->length, temp64, temp64_len);
1118 }
1119
1121 {
1122 size_t ayt_bct_len, ayt_bctt_len;
1123 float ayt_bct[16], ayt_bctt[8];
1124
1125 /* fin += a->y[0] * (ayt_det_bc + bct * 2.0f * a->y[1]) */
1129 d2d_fp_fast_expansion_sum_zeroelim(temp48, &temp48_len, temp16a, temp16a_len, temp32a, temp32a_len);
1130 d2d_fp_fast_expansion_sum_zeroelim(fin->other, &fin->length, fin->now, fin->length, temp48, temp48_len);
1132
1133 /* fin += a->y[0] * (bct * a->y[0] + bctt * (2.0f * a->y[1] + a->y[0])) */
1136 d2d_fp_scale_expansion_zeroelim(temp16a, &temp16a_len, ayt_bctt, ayt_bctt_len, 2.0f * a->y[1]);
1138 d2d_fp_fast_expansion_sum_zeroelim(temp32b, &temp32b_len, temp16a, temp16a_len, temp16b, temp16b_len);
1139 d2d_fp_fast_expansion_sum_zeroelim(temp64, &temp64_len, temp32a, temp32a_len, temp32b, temp32b_len);
1140 d2d_fp_fast_expansion_sum_zeroelim(fin->other, &fin->length, fin->now, fin->length, temp64, temp64_len);
1142 }
1143}
static void d2d_fp_two_product(float *out, float a, float b)
Definition: geometry.c:246
static void d2d_fp_two_two_diff(float *out, const float *a, const float *b)
Definition: geometry.c:212
Referenced by d2d_cdt_incircle().
◆ d2d_cdt_insert_segment()
|
static |
Definition at line 1758 of file geometry.c.
1760{
1762 size_t current_destination, current_origin;
1763
1765 {
1767
1769 if (current_destination == end_vertex)
1770 {
1773 }
1774
1781 {
1784 }
1785
1787 {
1789
1790 d2d_cdt_edge_sym(&base_edge, &base_edge);
1792 d2d_cdt_destroy_edge(cdt, &base_edge);
1793
1796 *edge = base_edge;
1799 d2d_cdt_edge_sym(&base_edge, &base_edge);
1802
1805 new_origin = *edge;
1807 }
1808
1810 {
1813 }
1814 }
1815}
static BOOL d2d_cdt_leftof(const struct d2d_cdt *cdt, size_t p, const struct d2d_cdt_edge_ref *e)
Definition: geometry.c:993
static BOOL d2d_cdt_insert_segment(struct d2d_cdt *cdt, struct d2d_geometry *geometry, const struct d2d_cdt_edge_ref *origin, struct d2d_cdt_edge_ref *edge, size_t end_vertex)
Definition: geometry.c:1758
static BOOL d2d_cdt_rightof(const struct d2d_cdt *cdt, size_t p, const struct d2d_cdt_edge_ref *e)
Definition: geometry.c:988
Definition: tools.h:99
Referenced by d2d_cdt_insert_segment(), and d2d_cdt_insert_segments().
◆ d2d_cdt_insert_segments()
|
static |
Definition at line 1817 of file geometry.c.
1818{
1823 BOOL found;
1824
1826 {
1828
1830 continue;
1831
1832 /* Degenerate figure. */
1834 continue;
1835
1839
1841 {
1843 continue;
1844
1845 edge.idx = k;
1846 edge.r = 0;
1847
1849 {
1850 found = TRUE;
1851 break;
1852 }
1853 d2d_cdt_edge_sym(&edge, &edge);
1855 {
1856 found = TRUE;
1857 break;
1858 }
1859 }
1860
1861 if (!found)
1862 {
1865 }
1866
1868 {
1872
1873 if (start_vertex == end_vertex)
1874 continue;
1875
1878 edge = new_edge;
1879 }
1880 }
1881
1883}
static int __cdecl d2d_cdt_compare_vertices(const void *a, const void *b)
Definition: geometry.c:1553
GLsizei GLenum const GLvoid GLsizei GLenum GLbyte GLbyte GLbyte GLdouble GLdouble GLdouble GLfloat GLfloat GLfloat GLint GLint GLint GLshort GLshort GLshort GLubyte GLubyte GLubyte GLuint GLuint GLuint GLushort GLushort GLushort GLbyte GLbyte GLbyte GLbyte GLdouble GLdouble GLdouble GLdouble GLfloat GLfloat GLfloat GLfloat GLint GLint GLint GLint GLshort GLshort GLshort GLshort GLubyte GLubyte GLubyte GLubyte GLuint GLuint GLuint GLuint GLushort GLushort GLushort GLushort GLboolean const GLdouble const GLfloat const GLint const GLshort const GLbyte const GLdouble const GLfloat const GLint const GLshort const GLdouble const GLfloat const GLint const GLshort const GLdouble const GLfloat const GLint const GLshort const GLdouble const GLfloat const GLint const GLshort const GLdouble const GLdouble const GLfloat const GLfloat const GLint const GLint const GLshort const GLshort const GLdouble const GLfloat const GLint const GLshort const GLdouble const GLfloat const GLint const GLshort const GLdouble const GLfloat const GLint const GLshort const GLdouble const GLfloat const GLint const GLshort const GLdouble const GLfloat const GLint const GLshort const GLdouble const GLfloat const GLint const GLshort const GLdouble const GLfloat const GLint const GLshort GLenum GLenum GLenum GLfloat GLenum GLint GLenum GLenum GLenum GLfloat GLenum GLenum GLint GLenum GLfloat GLenum GLint GLint GLushort GLenum GLenum GLfloat GLenum GLenum GLint GLfloat const GLubyte GLenum GLenum GLenum const GLfloat GLenum GLenum const GLint GLenum GLint GLint GLsizei GLsizei GLint GLenum GLenum const GLvoid GLenum GLenum const GLfloat GLenum GLenum const GLint GLenum GLenum const GLdouble GLenum GLenum const GLfloat GLenum GLenum const GLint GLsizei GLuint GLfloat GLuint GLbitfield GLfloat GLint GLuint GLboolean GLenum GLfloat GLenum GLbitfield GLenum GLfloat GLfloat GLint GLint const GLfloat GLenum GLfloat GLfloat GLint GLint GLfloat GLfloat GLint GLint const GLfloat GLint GLfloat GLfloat GLint GLfloat GLfloat GLint GLfloat GLfloat const GLdouble const GLfloat const GLdouble const GLfloat GLint GLint GLint j
Definition: glfuncs.h:250
Definition: geometry.c:64
struct d2d_geometry::@243::@245 path
union d2d_geometry::@243 u
Referenced by d2d_path_geometry_triangulate().
◆ d2d_cdt_leftof()
|
static |
Definition at line 993 of file geometry.c.
994{
995 return d2d_cdt_ccw(cdt, p, d2d_cdt_edge_origin(cdt, e), d2d_cdt_edge_destination(cdt, e)) > 0.0f;
996}
Referenced by d2d_cdt_insert_segment(), d2d_cdt_merge(), and d2d_path_geometry_add_fill_face().
◆ d2d_cdt_merge()
|
static |
Definition at line 1385 of file geometry.c.
1388{
1390
1391 /* Create the base edge between both parts. */
1392 for (;;)
1393 {
1395 {
1396 d2d_cdt_edge_next_left(cdt, left_inner, left_inner);
1397 }
1399 {
1400 d2d_cdt_edge_sym(&tmp, right_inner);
1401 d2d_cdt_edge_next_origin(cdt, right_inner, &tmp);
1402 }
1403 else
1404 {
1405 break;
1406 }
1407 }
1408
1409 d2d_cdt_edge_sym(&tmp, right_inner);
1413 d2d_cdt_edge_sym(left_outer, &base_edge);
1415 *right_outer = base_edge;
1416
1417 for (;;)
1418 {
1420 BOOL left_valid, right_valid;
1421
1422 /* Find the left candidate. */
1423 d2d_cdt_edge_sym(&sym_base_edge, &base_edge);
1424 d2d_cdt_edge_next_origin(cdt, &left_candidate, &sym_base_edge);
1425 if ((left_valid = d2d_cdt_leftof(cdt, d2d_cdt_edge_destination(cdt, &left_candidate), &sym_base_edge)))
1426 {
1427 d2d_cdt_edge_next_origin(cdt, &tmp, &left_candidate);
1429 && d2d_cdt_incircle(cdt,
1432 {
1433 d2d_cdt_destroy_edge(cdt, &left_candidate);
1434 left_candidate = tmp;
1435 d2d_cdt_edge_next_origin(cdt, &tmp, &left_candidate);
1436 }
1437 }
1438 d2d_cdt_edge_sym(&left_candidate, &left_candidate);
1439
1440 /* Find the right candidate. */
1441 d2d_cdt_edge_prev_origin(cdt, &right_candidate, &base_edge);
1442 if ((right_valid = d2d_cdt_rightof(cdt, d2d_cdt_edge_destination(cdt, &right_candidate), &base_edge)))
1443 {
1444 d2d_cdt_edge_prev_origin(cdt, &tmp, &right_candidate);
1446 && d2d_cdt_incircle(cdt,
1449 {
1450 d2d_cdt_destroy_edge(cdt, &right_candidate);
1451 right_candidate = tmp;
1452 d2d_cdt_edge_prev_origin(cdt, &tmp, &right_candidate);
1453 }
1454 }
1455
1456 if (!left_valid && !right_valid)
1457 break;
1458
1459 /* Connect the appropriate candidate with the base edge. */
1463 {
1466 }
1467 else
1468 {
1471 }
1472 }
1473
1475}
Referenced by d2d_cdt_triangulate().
◆ d2d_cdt_rightof()
|
static |
Definition at line 988 of file geometry.c.
989{
990 return d2d_cdt_ccw(cdt, p, d2d_cdt_edge_destination(cdt, e), d2d_cdt_edge_origin(cdt, e)) > 0.0f;
991}
Referenced by d2d_cdt_insert_segment(), and d2d_cdt_merge().
◆ d2d_cdt_splice()
|
static |
Definition at line 1294 of file geometry.c.
Referenced by d2d_cdt_connect(), d2d_cdt_destroy_edge(), and d2d_cdt_triangulate().
◆ d2d_cdt_triangulate()
|
static |
Definition at line 1480 of file geometry.c.
1482{
1484 size_t cut;
1485
1486 /* Only two vertices, create a single edge. */
1488 {
1490
1495
1496 *left_edge = a;
1498
1500 }
1501
1502 /* Three vertices, create a triangle. */
1504 {
1506 float det;
1507
1514
1519
1520 det = d2d_cdt_ccw(cdt, start_vertex, start_vertex + 1, start_vertex + 2);
1523
1524 if (det < 0.0f)
1525 {
1527 *right_edge = c;
1528 }
1529 else
1530 {
1531 *left_edge = a;
1533 }
1534
1536 }
1537
1538 /* More than three vertices, divide. */
1539 cut = vertex_count / 2;
1542 if (!d2d_cdt_triangulate(cdt, start_vertex + cut, vertex_count - cut, &right_inner, &right_outer))
1544 /* Merge the left and right parts. */
1547
1548 *left_edge = left_outer;
1549 *right_edge = right_outer;
1551}
static BOOL d2d_cdt_merge(struct d2d_cdt *cdt, struct d2d_cdt_edge_ref *left_outer, struct d2d_cdt_edge_ref *left_inner, struct d2d_cdt_edge_ref *right_inner, struct d2d_cdt_edge_ref *right_outer)
Definition: geometry.c:1385
static BOOL d2d_cdt_triangulate(struct d2d_cdt *cdt, size_t start_vertex, size_t vertex_count, struct d2d_cdt_edge_ref *left_edge, struct d2d_cdt_edge_ref *right_edge)
Definition: geometry.c:1480
Referenced by d2d_cdt_triangulate(), and d2d_path_geometry_triangulate().
◆ d2d_curve_outline_vertex_set()
|
static |
Definition at line 158 of file geometry.c.
161{
162 a->position = *position;
163 a->p0 = *p0;
164 a->p1 = *p1;
165 a->p2 = *p2;
168}
static void d2d_point_set(D2D1_POINT_2F *dst, float x, float y)
Definition: d2d1_private.h:952
Referenced by d2d_geometry_outline_add_arc_quadrant(), and d2d_geometry_outline_add_bezier_segment().
◆ d2d_curve_vertex_set()
|
static |
Definition at line 134 of file geometry.c.
136{
141}
Referenced by d2d_geometry_fill_add_arc_triangle(), and d2d_geometry_resolve_beziers().
◆ d2d_ellipse_geometry_AddRef()
|
static |
Definition at line 4001 of file geometry.c.
4002{
4005
4007
4009}
static struct d2d_geometry * impl_from_ID2D1EllipseGeometry(ID2D1EllipseGeometry *iface)
Definition: geometry.c:3975
Definition: d2d1_private.h:502
◆ d2d_ellipse_geometry_CombineWithGeometry()
|
static |
Definition at line 4100 of file geometry.c.
4103{
4104 FIXME("iface %p, geometry %p, combine_mode %#x, transform %p, tolerance %.8e, sink %p stub!\n",
4106
4108}
◆ d2d_ellipse_geometry_CompareWithGeometry()
|
static |
Definition at line 4073 of file geometry.c.
◆ d2d_ellipse_geometry_ComputeArea()
|
static |
Definition at line 4118 of file geometry.c.
◆ d2d_ellipse_geometry_ComputeLength()
|
static |
Definition at line 4126 of file geometry.c.
◆ d2d_ellipse_geometry_ComputePointAtLength()
|
static |
Definition at line 4134 of file geometry.c.
◆ d2d_ellipse_geometry_FillContainsPoint()
|
static |
Definition at line 4064 of file geometry.c.
4066{
4069
4071}
static const char * debug_d2d_point_2f(const D2D1_POINT_2F *point)
Definition: d2d1_private.h:993
◆ d2d_ellipse_geometry_GetBounds()
|
static |
Definition at line 4036 of file geometry.c.
◆ d2d_ellipse_geometry_GetEllipse()
|
static |
Definition at line 4154 of file geometry.c.
4155{
4157
4159
4161}
◆ d2d_ellipse_geometry_GetFactory()
|
static |
Definition at line 4027 of file geometry.c.
◆ d2d_ellipse_geometry_GetWidenedBounds()
|
static |
Definition at line 4044 of file geometry.c.
◆ d2d_ellipse_geometry_init()
| HRESULT d2d_ellipse_geometry_init | ( | struct d2d_geometry * | geometry, |
| ID2D1Factory * | factory, | ||
| const D2D1_ELLIPSE * | ellipse | ||
| ) |
Definition at line 4185 of file geometry.c.
4186{
4190
4191 d2d_geometry_init(geometry, factory, &identity, (ID2D1GeometryVtbl *)&d2d_ellipse_geometry_vtbl);
4193
4195 goto fail;
4198 goto fail;
4199
4204
4209
4215 geometry->fill.vertex_count = 4;
4216
4220 geometry->fill.face_count = 2;
4221
4223 goto fail;
4225 goto fail;
4227 goto fail;
4229 goto fail;
4230
4232 goto fail;
4234 goto fail;
4236 goto fail;
4238 goto fail;
4239
4241
4242fail:
4243 d2d_geometry_cleanup(geometry);
4245}
static void d2d_geometry_cleanup(struct d2d_geometry *geometry)
Definition: geometry.c:2719
static const struct ID2D1EllipseGeometryVtbl d2d_ellipse_geometry_vtbl
Definition: geometry.c:4163
static void d2d_geometry_init(struct d2d_geometry *geometry, ID2D1Factory *factory, const D2D1_MATRIX_3X2_F *transform, const struct ID2D1GeometryVtbl *vtbl)
Definition: geometry.c:2734
static void d2d_face_set(struct d2d_face *f, UINT16 v0, UINT16 v1, UINT16 v2)
Definition: geometry.c:143
static BOOL d2d_geometry_outline_add_arc_quadrant(struct d2d_geometry *geometry, const D2D1_POINT_2F *p0, const D2D1_POINT_2F *p1, const D2D1_POINT_2F *p2)
Definition: geometry.c:2558
static BOOL d2d_geometry_fill_add_arc_triangle(struct d2d_geometry *geometry, const D2D1_POINT_2F *p0, const D2D1_POINT_2F *p1, const D2D1_POINT_2F *p2)
Definition: geometry.c:2701
Definition: d2d1_private.h:483
Definition: _function.h:322
Referenced by d2d_factory_CreateEllipseGeometry().
◆ d2d_ellipse_geometry_Outline()
|
static |
◆ d2d_ellipse_geometry_QueryInterface()
|
static |
Definition at line 3980 of file geometry.c.
3982{
3984
3986 || IsEqualGUID(iid, &IID_ID2D1Geometry)
3987 || IsEqualGUID(iid, &IID_ID2D1Resource)
3989 {
3990 ID2D1EllipseGeometry_AddRef(iface);
3991 *out = iface;
3993 }
3994
3996
3999}
wchar_t tm const _CrtWcstime_Writes_and_advances_ptr_ count wchar_t ** out
Definition: wcsftime.cpp:383
◆ d2d_ellipse_geometry_Release()
|
static |
Definition at line 4011 of file geometry.c.
◆ d2d_ellipse_geometry_Simplify()
|
static |
Definition at line 4082 of file geometry.c.
◆ d2d_ellipse_geometry_StrokeContainsPoint()
|
static |
Definition at line 4054 of file geometry.c.
4057{
4058 FIXME("iface %p, point %s, stroke_width %.8e, stroke_style %p, transform %p, tolerance %.8e, contains %p stub!\n",
4059 iface, debug_d2d_point_2f(&point), stroke_width, stroke_style, transform, tolerance, contains);
4060
4062}
◆ d2d_ellipse_geometry_Tessellate()
|
static |
◆ d2d_ellipse_geometry_Widen()
|
static |
◆ d2d_face_set()
Definition at line 143 of file geometry.c.
144{
148}
Referenced by d2d_ellipse_geometry_init(), d2d_geometry_outline_add_arc_quadrant(), d2d_geometry_outline_add_bezier_segment(), d2d_geometry_outline_add_join(), d2d_geometry_outline_add_line_segment(), d2d_rectangle_geometry_init(), and d2d_rounded_rectangle_geometry_init().
◆ d2d_figure_add_bezier_controls()
|
static |
Definition at line 894 of file geometry.c.
895{
898 {
901 }
902
903 memcpy(&figure->bezier_controls[figure->bezier_control_count], p, count * sizeof(*figure->bezier_controls));
905
907}
Referenced by d2d_geometry_sink_AddBeziers(), and d2d_geometry_sink_AddQuadraticBeziers().
◆ d2d_figure_add_original_bezier_controls()
|
static |
Definition at line 909 of file geometry.c.
910{
911 if (!d2d_array_reserve((void **)&figure->original_bezier_controls, &figure->original_bezier_controls_size,
913 {
916 }
917
921
923}
size_t original_bezier_control_count
Definition: geometry.c:77
D2D1_POINT_2F * original_bezier_controls
Definition: geometry.c:75
size_t original_bezier_controls_size
Definition: geometry.c:76
Referenced by d2d_geometry_sink_AddBeziers(), and d2d_geometry_sink_AddQuadraticBeziers().
◆ d2d_figure_add_vertex()
|
static |
Definition at line 847 of file geometry.c.
848{
850
854
857 {
860 }
861
864 {
867 }
868
872 ++figure->vertex_count;
874}
static void d2d_rect_expand(D2D1_RECT_F *dst, const D2D1_POINT_2F *point)
Definition: d2d1_private.h:969
static const LARGE_INTEGER *static const HANDLE const LARGE_INTEGER *static PSLIST_ENTRY PSLIST_ENTRY last
Definition: sync.c:64
Referenced by d2d_geometry_sink_AddArc(), d2d_geometry_sink_AddBeziers(), d2d_geometry_sink_AddLines(), d2d_geometry_sink_AddQuadraticBeziers(), and d2d_geometry_sink_BeginFigure().
◆ d2d_figure_insert_bezier_controls()
|
static |
Definition at line 876 of file geometry.c.
878{
881 {
884 }
885
890
892}
Referenced by d2d_geometry_apply_intersections(), and d2d_geometry_split_bezier().
◆ d2d_figure_insert_vertex()
|
static |
Definition at line 820 of file geometry.c.
Referenced by d2d_geometry_apply_intersections(), d2d_geometry_resolve_beziers(), and d2d_geometry_split_bezier().
◆ d2d_fp_estimate()
Definition at line 265 of file geometry.c.
266{
269
272
274}
Referenced by d2d_cdt_incircle(), and d2d_point_ccw().
◆ d2d_fp_fast_expansion_sum_zeroelim()
|
static |
Definition at line 276 of file geometry.c.
278{
280 size_t a_idx, b_idx, out_idx;
281
282 a_curr = a[0];
283 b_curr = b[0];
284 a_idx = b_idx = 0;
285 if ((b_curr > a_curr) == (b_curr > -a_curr))
286 {
287 q = a_curr;
288 a_curr = a[++a_idx];
289 }
290 else
291 {
292 q = b_curr;
293 b_curr = b[++b_idx];
294 }
295 out_idx = 0;
296 if (a_idx < a_len && b_idx < b_len)
297 {
298 if ((b_curr > a_curr) == (b_curr > -a_curr))
299 {
301 a_curr = a[++a_idx];
302 }
303 else
304 {
306 b_curr = b[++b_idx];
307 }
311 while (a_idx < a_len && b_idx < b_len)
312 {
313 if ((b_curr > a_curr) == (b_curr > -a_curr))
314 {
316 a_curr = a[++a_idx];
317 }
318 else
319 {
321 b_curr = b[++b_idx];
322 }
326 }
327 }
328 while (a_idx < a_len)
329 {
331 a_curr = a[++a_idx];
335 }
336 while (b_idx < b_len)
337 {
339 b_curr = b[++b_idx];
343 }
346
347 *out_len = out_idx;
348}
static void d2d_fp_fast_two_sum(float *out, float a, float b)
Definition: geometry.c:182
Referenced by d2d_cdt_incircle(), d2d_cdt_incircle_refine1(), d2d_cdt_incircle_refine2(), d2d_fp_sub_det3x3(), and d2d_point_ccw().
◆ d2d_fp_fast_two_sum()
Definition at line 182 of file geometry.c.
183{
184 float b_virt;
185
189}
Referenced by d2d_fp_fast_expansion_sum_zeroelim(), and d2d_fp_scale_expansion_zeroelim().
◆ d2d_fp_four_det2x2()
Definition at line 1000 of file geometry.c.
1001{
1002 float axby[2], aybx[2];
1003
1005 d2d_fp_two_product(aybx, ay, bx);
1007}
ecx edi movl ebx edx edi decl ecx esi eax jecxz decl eax andl eax esi movl edx movl TEMP incl eax andl eax ecx incl ebx testl eax jnz xchgl ecx incl TEMP esp ecx subl ebx pushl ecx ecx edx ecx shrl ecx mm0 mm4 mm0 mm4 mm1 mm5 mm1 mm5 mm2 mm6 mm2 mm6 mm3 mm7 mm3 mm7 paddd mm0 paddd mm4 paddd mm0 paddd mm4 paddd mm0 paddd mm4 movq mm1 movq mm5 psrlq mm1 psrlq mm5 paddd mm0 paddd mm4 psrad mm0 psrad mm4 packssdw mm0 packssdw mm4 mm1 punpckldq mm0 pand mm1 pand mm0 por mm1 movq edi esi edx edi decl ecx jnz popl ecx andl ecx jecxz mm0 mm0 mm1 mm1 mm2 mm2 mm3 mm3 paddd mm0 paddd mm0 paddd mm0 movq mm1 psrlq mm1 paddd mm0 psrad mm0 packssdw mm0 movd eax movw ax
Definition: synth_sse3d.h:180
Referenced by d2d_cdt_incircle().
◆ d2d_fp_scale_expansion_zeroelim()
|
static |
Definition at line 350 of file geometry.c.
351{
353 size_t a_idx, out_idx;
354
357 out_idx = 0;
360 for (a_idx = 1; a_idx < a_len; ++a_idx)
361 {
362 a_curr = a[a_idx];
370 }
373
374 *out_len = out_idx;
375}
static void d2d_fp_two_product_presplit(float *out, float a, float b, const float *b_split)
Definition: geometry.c:234
Referenced by d2d_cdt_incircle_refine1(), d2d_cdt_incircle_refine2(), and d2d_fp_sub_det3x3().
◆ d2d_fp_split()
Definition at line 224 of file geometry.c.
225{
227
232}
Referenced by d2d_fp_scale_expansion_zeroelim(), d2d_fp_square(), d2d_fp_two_product(), and d2d_fp_two_product_presplit().
◆ d2d_fp_square()
Definition at line 254 of file geometry.c.
255{
256 float a_split[2], err1, err2;
257
260 err1 = out[1] - (a_split[1] * a_split[1]);
261 err2 = err1 - ((a_split[1] + a_split[1]) * a_split[0]);
262 out[0] = (a_split[0] * a_split[0]) - err2;
263}
Referenced by d2d_cdt_incircle().
◆ d2d_fp_sub_det3x3()
|
static |
Definition at line 1010 of file geometry.c.
1011{
1012 size_t axd_len, ayd_len, axxd_len, ayyd_len;
1013 float axd[8], ayd[8], axxd[16], ayyd[16];
1014
1020}
Referenced by d2d_cdt_incircle().
◆ d2d_fp_two_diff_tail()
Definition at line 201 of file geometry.c.
202{
203 float a_virt, a_round, b_virt, b_round;
204
206 a_virt = x + b_virt;
207 b_round = b_virt - b;
208 a_round = a - a_virt;
209 *out = a_round + b_round;
210}
Referenced by d2d_cdt_incircle(), d2d_fp_two_two_diff(), and d2d_point_ccw().
◆ d2d_fp_two_product()
Definition at line 246 of file geometry.c.
247{
248 float b_split[2];
249
252}
Referenced by d2d_cdt_incircle_refine2(), d2d_fp_four_det2x2(), and d2d_point_ccw().
◆ d2d_fp_two_product_presplit()
|
static |
Definition at line 234 of file geometry.c.
235{
236 float a_split[2], err1, err2, err3;
237
240 err1 = out[1] - (a_split[1] * b_split[1]);
241 err2 = err1 - (a_split[0] * b_split[1]);
242 err3 = err2 - (a_split[1] * b_split[0]);
243 out[0] = (a_split[0] * b_split[0]) - err3;
244}
Referenced by d2d_fp_scale_expansion_zeroelim(), and d2d_fp_two_product().
◆ d2d_fp_two_sum()
Definition at line 170 of file geometry.c.
171{
172 float a_virt, a_round, b_virt, b_round;
173
176 a_virt = out[1] - b_virt;
177 b_round = b - b_virt;
178 a_round = a - a_virt;
179 out[0] = a_round + b_round;
180}
Referenced by d2d_fp_fast_expansion_sum_zeroelim(), d2d_fp_scale_expansion_zeroelim(), d2d_fp_two_two_diff(), and d2d_fp_two_two_sum().
◆ d2d_fp_two_two_diff()
Definition at line 212 of file geometry.c.
213{
215
222}
Referenced by d2d_cdt_incircle_refine2(), d2d_fp_four_det2x2(), and d2d_point_ccw().
◆ d2d_fp_two_two_sum()
Definition at line 191 of file geometry.c.
192{
194
199}
Referenced by d2d_cdt_incircle(), and d2d_cdt_incircle_refine2().
◆ d2d_geometry_add_bezier_line_intersections()
|
static |
Definition at line 1971 of file geometry.c.
1974{
1975 D2D1_POINT_2F intersection;
1977
1981 else
1983 if (t < 0.0f || t > 1.0f)
1985
1987
1988 if (s > 0.0f && s < 1.0f && !d2d_geometry_intersections_add(intersections, idx_p, s, intersection))
1990
1991 if (t > 0.0f && t < 1.0f && !d2d_geometry_intersections_add(intersections, idx_q, t, intersection))
1993
1995}
static void d2d_point_lerp(D2D1_POINT_2F *out, const D2D1_POINT_2F *a, const D2D1_POINT_2F *b, float t)
Definition: geometry.c:390
static void d2d_point_calculate_bezier(D2D1_POINT_2F *out, const D2D1_POINT_2F *p0, const D2D1_POINT_2F *p1, const D2D1_POINT_2F *p2, float t)
Definition: geometry.c:397
static BOOL d2d_geometry_intersections_add(struct d2d_geometry_intersections *i, const struct d2d_segment_idx *segment_idx, float t, D2D1_POINT_2F p)
Definition: geometry.c:1885
Referenced by d2d_geometry_intersect_bezier_line().
◆ d2d_geometry_add_figure_outline()
|
static |
Definition at line 2610 of file geometry.c.
2612{
2616
2619
2620 p0 = &figure->vertices[0];
2622 {
2625
2626 /* In case of a CLOSED path, a join between first and last vertex is
2627 * required. */
2630 else
2632 }
2633 else
2634 {
2637 prev = p0;
2638 }
2639
2641 {
2643 {
2645 continue;
2646 }
2647
2648 /* next: tangent along next segment, at p0.
2649 * p1: next vertex. */
2651 {
2653 /* type BEZIER implies i + 1 < figure->vertex_count. */
2655
2657 {
2660 }
2661 }
2662 else
2663 {
2666 else
2668 next_prev = p0;
2669
2671 {
2674 }
2675 }
2676
2678 {
2679 D2D1_POINT_2F q_next, q_prev;
2680
2681 d2d_point_subtract(&q_prev, prev, p0);
2683
2684 d2d_point_normalise(&q_prev);
2685 d2d_point_normalise(&q_next);
2686
2688 {
2691 }
2692 }
2693
2694 p0 = p1;
2695 prev = next_prev;
2696 }
2697
2699}
static BOOL d2d_geometry_outline_add_bezier_segment(struct d2d_geometry *geometry, const D2D1_POINT_2F *p0, const D2D1_POINT_2F *p1, const D2D1_POINT_2F *p2)
Definition: geometry.c:2494
static BOOL d2d_vertex_type_is_bezier(enum d2d_vertex_type t)
Definition: geometry.c:419
static void d2d_point_subtract(D2D1_POINT_2F *out, const D2D1_POINT_2F *a, const D2D1_POINT_2F *b)
Definition: geometry.c:377
static BOOL d2d_geometry_outline_add_join(struct d2d_geometry *geometry, const D2D1_POINT_2F *prev, const D2D1_POINT_2F *p0, const D2D1_POINT_2F *next)
Definition: geometry.c:2394
static BOOL d2d_geometry_outline_add_line_segment(struct d2d_geometry *geometry, const D2D1_POINT_2F *p0, const D2D1_POINT_2F *next)
Definition: geometry.c:2453
Referenced by d2d_geometry_sink_EndFigure().
◆ d2d_geometry_apply_intersections()
|
static |
Definition at line 2131 of file geometry.c.
2133{
2141
2143 {
2146 vertex_offset = control_offset = 0;
2147
2151 {
2155 ++vertex_offset;
2156 continue;
2157 }
2158
2162 {
2165 {
2167 continue;
2168 }
2170 }
2171
2176
2179
2181 if (!(d2d_figure_insert_bezier_controls(figure, inter->control_idx + control_offset + 1, 1, &q[1])))
2183 ++control_offset;
2184
2188 ++vertex_offset;
2189 }
2190
2192}
static BOOL d2d_figure_insert_vertex(struct d2d_figure *figure, size_t idx, D2D1_POINT_2F vertex)
Definition: geometry.c:820
static BOOL d2d_figure_insert_bezier_controls(struct d2d_figure *figure, size_t idx, size_t count, const D2D1_POINT_2F *p)
Definition: geometry.c:876
Definition: geometry.c:107
struct d2d_geometry_intersection * intersections
Definition: geometry.c:117
Referenced by d2d_geometry_intersect_self().
◆ d2d_geometry_bezier_ccw()
|
static |
Definition at line 3097 of file geometry.c.
3098{
3101
3104}
Referenced by d2d_geometry_resolve_beziers().
◆ d2d_geometry_check_bezier_overlap()
|
static |
Definition at line 3015 of file geometry.c.
3017{
3020 D2D1_POINT_2F v_q[3], v_p, v_qp;
3023
3028
3033
3036
3040
3041 /* Check for intersections between the edges. Strictly speaking we'd only
3042 * need to check 8 of the 9 possible intersections, since if there's any
3043 * intersection there has to be a second intersection as well. */
3045 {
3048 {
3050 if (det == 0.0f)
3051 continue;
3052
3055 if (t <= 0.0f || t >= 1.0f)
3056 continue;
3057
3059 if (t <= 0.0f || t >= 1.0f)
3060 continue;
3061
3063 }
3064 }
3065
3066 /* Check if one triangle is contained within the other. */
3068 {
3072
3074 ++score;
3075
3077 }
3078
3079 if (score & 1)
3081
3083 {
3087
3089 ++score;
3090
3092 }
3093
3094 return score & 1;
3095}
Referenced by d2d_geometry_resolve_beziers().
◆ d2d_geometry_cleanup()
|
static |
Definition at line 2719 of file geometry.c.
Referenced by d2d_ellipse_geometry_init(), d2d_ellipse_geometry_Release(), d2d_geometry_group_init(), d2d_geometry_group_Release(), d2d_path_geometry_Release(), d2d_rectangle_geometry_init(), d2d_rectangle_geometry_Release(), d2d_rounded_rectangle_geometry_init(), d2d_rounded_rectangle_geometry_Release(), and d2d_transformed_geometry_Release().
◆ d2d_geometry_fill_add_arc_triangle()
|
static |
Definition at line 2701 of file geometry.c.
2703{
2705
2706 if (!d2d_array_reserve((void **)&geometry->fill.arc_vertices, &geometry->fill.arc_vertices_size,
2709
2714 geometry->fill.arc_vertex_count += 3;
2715
2717}
static void d2d_curve_vertex_set(struct d2d_curve_vertex *b, const D2D1_POINT_2F *p, float u, float v, float sign)
Definition: geometry.c:134
Definition: d2d1_private.h:474
Referenced by d2d_ellipse_geometry_init(), and d2d_rounded_rectangle_geometry_init().
◆ d2d_geometry_flatten_cubic()
|
static |
Definition at line 3683 of file geometry.c.
3685{
3689
3690 /* It's certainly possible to calculate the maximum deviation of the
3691 * approximation from the curve, but it's a little involved. Instead, note
3692 * that if the control points were evenly spaced and collinear, p1 would
3693 * be exactly between p0 and p2, and p2 would be exactly between p1 and
3694 * p3. The deviation is a decent enough approximation, and much easier to
3695 * calculate.
3696 *
3697 * p1' = (p0 + p2) / 2
3698 * p2' = (p1 + p3) / 2
3699 * d = ‖p1 - p1'‖₁ + ‖p2 - p2'‖₁ */
3707 {
3709 return;
3710 }
3711
3713
3717
3721
3726}
@ D2D1_PATH_SEGMENT_FORCE_ROUND_LINE_JOIN
Definition: d2d1.idl:94
static void d2d_geometry_flatten_cubic(ID2D1SimplifiedGeometrySink *sink, const D2D1_POINT_2F *p0, const D2D1_BEZIER_SEGMENT *b, float tolerance)
Definition: geometry.c:3683
Definition: d2d1.idl:298
Referenced by d2d_geometry_flatten_cubic(), and d2d_path_geometry_Simplify().
◆ d2d_geometry_get_bezier_segment_idx()
|
static |
Definition at line 2978 of file geometry.c.
2979{
2981 {
2982 ++idx->vertex_idx;
2983 ++idx->control_idx;
2984 }
2985
2986 for (; idx->figure_idx < geometry->u.path.figure_count; ++idx->figure_idx, idx->vertex_idx = idx->control_idx = 0)
2987 {
2989
2991 continue;
2992
2994 {
2997 }
2998 }
2999
3001}
Referenced by d2d_geometry_get_first_bezier_segment_idx(), and d2d_geometry_get_next_bezier_segment_idx().
◆ d2d_geometry_get_first_bezier_segment_idx()
|
static |
Definition at line 3003 of file geometry.c.
3004{
3006
3008}
static BOOL d2d_geometry_get_bezier_segment_idx(struct d2d_geometry *geometry, struct d2d_segment_idx *idx, BOOL next)
Definition: geometry.c:2978
Referenced by d2d_geometry_resolve_beziers().
◆ d2d_geometry_get_next_bezier_segment_idx()
|
static |
Definition at line 3010 of file geometry.c.
Referenced by d2d_geometry_resolve_beziers().
◆ d2d_geometry_group_AddRef()
|
static |
Definition at line 5269 of file geometry.c.
5270{
5273
5275
5277}
static struct d2d_geometry * impl_from_ID2D1GeometryGroup(ID2D1GeometryGroup *iface)
Definition: geometry.c:5243
◆ d2d_geometry_group_CombineWithGeometry()
|
static |
◆ d2d_geometry_group_CompareWithGeometry()
|
static |
Definition at line 5361 of file geometry.c.
◆ d2d_geometry_group_ComputeArea()
|
static |
◆ d2d_geometry_group_ComputeLength()
|
static |
◆ d2d_geometry_group_ComputePointAtLength()
|
static |
◆ d2d_geometry_group_FillContainsPoint()
|
static |
Definition at line 5352 of file geometry.c.
5354{
5357
5359}
◆ d2d_geometry_group_GetBounds()
|
static |
Definition at line 5309 of file geometry.c.
5311{
5315
5317
5322
5324 {
5327 }
5328
5330}
static void d2d_rect_union(D2D1_RECT_F *l, const D2D1_RECT_F *r)
Definition: geometry.c:756
Definition: dcommon.idl:104
struct d2d_geometry::@243::@249 group
◆ d2d_geometry_group_GetFactory()
|
static |
Definition at line 5299 of file geometry.c.
5301{
5303
5305
5307}
◆ d2d_geometry_group_GetFillMode()
|
static |
Definition at line 5442 of file geometry.c.
5443{
5445
5447
5449}
◆ d2d_geometry_group_GetSourceGeometries()
|
static |
Definition at line 5460 of file geometry.c.
5462{
5465
5467
5471}
◆ d2d_geometry_group_GetSourceGeometryCount()
|
static |
Definition at line 5451 of file geometry.c.
5452{
5454
5456
5458}
◆ d2d_geometry_group_GetWidenedBounds()
|
static |
Definition at line 5332 of file geometry.c.
◆ d2d_geometry_group_init()
| HRESULT d2d_geometry_group_init | ( | struct d2d_geometry * | geometry, |
| ID2D1Factory * | factory, | ||
| D2D1_FILL_MODE | fill_mode, | ||
| ID2D1Geometry ** | geometries, | ||
| unsigned int | geometry_count | ||
| ) |
Definition at line 5497 of file geometry.c.
5499{
5501
5502 d2d_geometry_init(geometry, factory, &identity, (ID2D1GeometryVtbl *)&d2d_geometry_group_vtbl);
5503
5505 {
5506 d2d_geometry_cleanup(geometry);
5508 }
5509
5511 {
5513 }
5516
5518}
static const struct ID2D1GeometryGroupVtbl d2d_geometry_group_vtbl
Definition: geometry.c:5473
Referenced by d2d_factory_CreateGeometryGroup().
◆ d2d_geometry_group_Outline()
|
static |
◆ d2d_geometry_group_QueryInterface()
|
static |
Definition at line 5248 of file geometry.c.
5250{
5252
5254 || IsEqualGUID(iid, &IID_ID2D1Geometry)
5255 || IsEqualGUID(iid, &IID_ID2D1Resource)
5257 {
5258 ID2D1GeometryGroup_AddRef(iface);
5259 *out = iface;
5261 }
5262
5264
5267}
◆ d2d_geometry_group_Release()
|
static |
Definition at line 5279 of file geometry.c.
◆ d2d_geometry_group_Simplify()
|
static |
◆ d2d_geometry_group_StrokeContainsPoint()
|
static |
Definition at line 5342 of file geometry.c.
5345{
5346 FIXME("iface %p, point %s, stroke_width %.8e, stroke_style %p, transform %p, tolerance %.8e, contains %p.\n",
5347 iface, debug_d2d_point_2f(&point), stroke_width, stroke_style, transform, tolerance, contains);
5348
5350}
◆ d2d_geometry_group_Tessellate()
|
static |
◆ d2d_geometry_group_Widen()
|
static |
◆ d2d_geometry_init()
|
static |
Definition at line 2734 of file geometry.c.
Referenced by d2d_ellipse_geometry_init(), d2d_geometry_group_init(), d2d_path_geometry_init(), d2d_rectangle_geometry_init(), d2d_rounded_rectangle_geometry_init(), and d2d_transformed_geometry_init().
◆ d2d_geometry_intersect_bezier_bezier()
|
static |
Definition at line 2070 of file geometry.c.
2074{
2077 D2D_RECT_F p_bounds, q_bounds;
2078 D2D1_POINT_2F intersection;
2079 float centre_p, centre_q;
2081
2087
2093
2096
2099
2100 centre_p = (start_p + end_p) / 2.0f;
2101 centre_q = (start_q + end_q) / 2.0f;
2102
2103 if (end_p - start_p < 1e-3f)
2104 {
2107 idx_p, centre_p, intersection))
2110 idx_q, centre_q, intersection))
2113 }
2114
2116 idx_p, start_p, centre_p, idx_q, start_q, centre_q))
2119 idx_p, start_p, centre_p, idx_q, centre_q, end_q))
2122 idx_p, centre_p, end_p, idx_q, start_q, centre_q))
2125 idx_p, centre_p, end_p, idx_q, centre_q, end_q))
2127
2129}
static BOOL d2d_rect_check_overlap(const D2D_RECT_F *p, const D2D_RECT_F *q)
Definition: geometry.c:764
static BOOL d2d_geometry_intersect_bezier_bezier(struct d2d_geometry *geometry, struct d2d_geometry_intersections *intersections, const struct d2d_segment_idx *idx_p, float start_p, float end_p, const struct d2d_segment_idx *idx_q, float start_q, float end_q)
Definition: geometry.c:2070
static void d2d_rect_get_bezier_segment_bounds(D2D_RECT_F *bounds, const D2D1_POINT_2F *p0, const D2D1_POINT_2F *p1, const D2D1_POINT_2F *p2, float start, float end)
Definition: geometry.c:803
Referenced by d2d_geometry_intersect_bezier_bezier(), and d2d_geometry_intersect_self().
◆ d2d_geometry_intersect_bezier_line()
|
static |
Definition at line 1997 of file geometry.c.
2000{
2005
2011
2016 next = 0;
2018
2019 /* Align the line with x-axis. */
2024
2025 /* Intersect the transformed curve with the x-axis.
2026 *
2027 * f(t) = (1 - t)²P₀ + 2(1 - t)tP₁ + t²P₂
2028 * = (P₀ - 2P₁ + P₂)t² + 2(P₁ - P₀)t + P₀
2029 *
2030 * a = P₀ - 2P₁ + P₂
2031 * b = 2(P₁ - P₀)
2032 * c = P₀
2033 *
2034 * f(t) = 0
2035 * t = (-b ± √(b² - 4ac)) / 2a
2036 * = (-2(P₁ - P₀) ± √((2(P₁ - P₀))² - 4((P₀ - 2P₁ + P₂)P₀))) / 2(P₀ - 2P₁ + P₂)
2037 * = (2P₀ - 2P₁ ± √(4P₀² + 4P₁² - 8P₀P₁ - 4P₀² + 8P₀P₁ - 4P₀P₂)) / (2P₀ - 4P₁ + 2P₂)
2038 * = (P₀ - P₁ ± √(P₁² - P₀P₂)) / (P₀ - 2P₁ + P₂) */
2039
2042 {
2043 /* P₀ - 2P₁ + P₂ = 0
2044 * f(t) = (P₀ - 2P₁ + P₂)t² + 2(P₁ - P₀)t + P₀ = 0
2045 * t = -P₀ / 2(P₁ - P₀) */
2047 if (root < 0.0f || root > 1.0f)
2049
2050 return d2d_geometry_add_bezier_line_intersections(geometry, intersections, idx_p, p, idx_q, q, root);
2051 }
2052
2056
2061
2066
2068}
struct _root root
static BOOL d2d_geometry_add_bezier_line_intersections(struct d2d_geometry *geometry, struct d2d_geometry_intersections *intersections, const struct d2d_segment_idx *idx_p, const D2D1_POINT_2F **p, const struct d2d_segment_idx *idx_q, const D2D1_POINT_2F **q, float s)
Definition: geometry.c:1971
Definition: btrfs_drv.h:450
Referenced by d2d_geometry_intersect_self().
◆ d2d_geometry_intersect_line_line()
|
static |
Definition at line 1921 of file geometry.c.
1924{
1925 D2D1_POINT_2F v_p, v_q, v_qp, intersection;
1930
1935 next = 0;
1937
1942 next = 0;
1944
1948
1950 if (det == 0.0f)
1952
1955
1956 if (s < 0.0f || s > 1.0f || t < 0.0f || t > 1.0f)
1958
1961
1962 if (s > 0.0f && s < 1.0f && !d2d_geometry_intersections_add(intersections, idx_p, s, intersection))
1964
1965 if (t > 0.0f && t < 1.0f && !d2d_geometry_intersections_add(intersections, idx_q, t, intersection))
1967
1969}
Referenced by d2d_geometry_intersect_self().
◆ d2d_geometry_intersect_self()
|
static |
Definition at line 2197 of file geometry.c.
2198{
2204 size_t max_q;
2205
2208
2209 for (idx_p.figure_idx = 0; idx_p.figure_idx < geometry->u.path.figure_count; ++idx_p.figure_idx)
2210 {
2212 idx_p.control_idx = 0;
2214 {
2216 continue;
2217
2218 for (idx_q.figure_idx = 0; idx_q.figure_idx <= idx_p.figure_idx; ++idx_q.figure_idx)
2219 {
2221 if (idx_q.figure_idx != idx_p.figure_idx)
2222 {
2224 continue;
2227 --max_q;
2228 }
2229 else
2230 {
2231 max_q = idx_p.vertex_idx;
2232 }
2233
2234 idx_q.control_idx = 0;
2235 for (idx_q.vertex_idx = 0; idx_q.vertex_idx < max_q; ++idx_q.vertex_idx)
2236 {
2237 type_q = figure_q->vertex_types[idx_q.vertex_idx];
2239 {
2241 {
2243 &idx_p, 0.0f, 1.0f, &idx_q, 0.0f, 1.0f))
2244 goto done;
2245 }
2246 else
2247 {
2249 goto done;
2250 }
2251 ++idx_q.control_idx;
2252 }
2253 else
2254 {
2256 {
2258 goto done;
2259 }
2260 else
2261 {
2263 goto done;
2264 }
2265 }
2266 }
2267 }
2269 ++idx_p.control_idx;
2270 }
2271 }
2272
2276
2277done:
2280}
static BOOL d2d_geometry_intersect_line_line(struct d2d_geometry *geometry, struct d2d_geometry_intersections *intersections, const struct d2d_segment_idx *idx_p, const struct d2d_segment_idx *idx_q)
Definition: geometry.c:1921
static int __cdecl d2d_geometry_intersections_compare(const void *a, const void *b)
Definition: geometry.c:1907
static BOOL d2d_geometry_intersect_bezier_line(struct d2d_geometry *geometry, struct d2d_geometry_intersections *intersections, const struct d2d_segment_idx *idx_p, const struct d2d_segment_idx *idx_q)
Definition: geometry.c:1997
static BOOL d2d_geometry_apply_intersections(struct d2d_geometry *geometry, struct d2d_geometry_intersections *intersections)
Definition: geometry.c:2131
_ACRTIMP void __cdecl qsort(void *, size_t, size_t, int(__cdecl *)(const void *, const void *))
Definition: geometry.c:116
Definition: geometry.c:57
Referenced by d2d_geometry_sink_Close().
◆ d2d_geometry_intersections_add()
|
static |
Definition at line 1885 of file geometry.c.
1887{
1889
1892 {
1895 }
1896
1903
1905}
Referenced by d2d_geometry_add_bezier_line_intersections(), d2d_geometry_intersect_bezier_bezier(), and d2d_geometry_intersect_line_line().
◆ d2d_geometry_intersections_compare()
Definition at line 1907 of file geometry.c.
1908{
1911
1918 return 0;
1919}
Referenced by d2d_geometry_intersect_self().
◆ d2d_geometry_outline_add_arc_quadrant()
|
static |
Definition at line 2558 of file geometry.c.
2560{
2564 size_t base_idx;
2565
2568 {
2571 }
2572 base_idx = geometry->outline.arc_count;
2574
2575 if (!d2d_array_reserve((void **)&geometry->outline.arc_faces, &geometry->outline.arc_faces_size,
2577 {
2580 }
2582
2583 d2d_point_subtract(&r0, p1, p0);
2585
2586 d2d_point_normalise(&r0);
2588
2590 {
2591 d2d_point_scale(&r0, -1.0f);
2593 }
2594
2600 geometry->outline.arc_count += 5;
2601
2605 geometry->outline.arc_face_count += 3;
2606
2608}
static void d2d_curve_outline_vertex_set(struct d2d_curve_outline_vertex *a, const D2D1_POINT_2F *position, const D2D1_POINT_2F *p0, const D2D1_POINT_2F *p1, const D2D1_POINT_2F *p2, float prev_x, float prev_y, float next_x, float next_y)
Definition: geometry.c:158
Definition: d2d1_private.h:495
Referenced by d2d_ellipse_geometry_init(), and d2d_rounded_rectangle_geometry_init().
◆ d2d_geometry_outline_add_bezier_segment()
|
static |
Definition at line 2494 of file geometry.c.
2496{
2499 D2D1_POINT_2F q0, q1, q2;
2501 size_t base_idx;
2502
2505 {
2508 }
2509 base_idx = geometry->outline.bezier_count;
2511
2512 if (!d2d_array_reserve((void **)&geometry->outline.bezier_faces, &geometry->outline.bezier_faces_size,
2514 {
2517 }
2519
2520 d2d_point_lerp(&q0, p0, p1, 0.5f);
2521 d2d_point_lerp(&q1, p1, p2, 0.5f);
2522 d2d_point_lerp(&q2, &q0, &q1, 0.5f);
2523
2524 d2d_point_subtract(&r0, &q0, p0);
2527
2528 d2d_point_normalise(&r0);
2531
2533 {
2534 d2d_point_scale(&r0, -1.0f);
2537 }
2538
2546 geometry->outline.bezier_count += 7;
2547
2553 geometry->outline.bezier_face_count += 5;
2554
2556}
Referenced by d2d_geometry_add_figure_outline().
◆ d2d_geometry_outline_add_join()
|
static |
Definition at line 2394 of file geometry.c.
2396{
2400 size_t base_idx;
2401 float ccw;
2402
2405 {
2408 }
2409 base_idx = geometry->outline.vertex_count;
2411
2414 {
2417 }
2419
2421 if (ccw == 0.0f)
2422 {
2429 }
2430 else if (ccw < 0.0f)
2431 {
2436 }
2437 else
2438 {
2443 }
2444 geometry->outline.vertex_count += 4;
2445
2448 geometry->outline.face_count += 2;
2449
2451}
static void d2d_outline_vertex_set(struct d2d_outline_vertex *v, float x, float y, float prev_x, float prev_y, float next_x, float next_y)
Definition: geometry.c:150
Definition: d2d1_private.h:488
Referenced by d2d_geometry_add_figure_outline(), and d2d_rectangle_geometry_init().
◆ d2d_geometry_outline_add_line_segment()
|
static |
Definition at line 2453 of file geometry.c.
2455{
2457 D2D1_POINT_2F q_next;
2459 size_t base_idx;
2460
2463 {
2466 }
2467 base_idx = geometry->outline.vertex_count;
2469
2472 {
2475 }
2477
2479 d2d_point_normalise(&q_next);
2480
2485 geometry->outline.vertex_count += 4;
2486
2489 geometry->outline.face_count += 2;
2490
2492}
Referenced by d2d_geometry_add_figure_outline(), d2d_rectangle_geometry_init(), and d2d_rounded_rectangle_geometry_init().
◆ d2d_geometry_resolve_beziers()
|
static |
Definition at line 3133 of file geometry.c.
3134{
3140
3143
3144 /* Split overlapping bezier control triangles. */
3146 {
3147 d2d_geometry_get_first_bezier_segment_idx(geometry, &idx_q);
3148 while (idx_q.figure_idx < idx_p.figure_idx || idx_q.vertex_idx < idx_p.vertex_idx)
3149 {
3151 {
3152 if (fabsf(d2d_geometry_bezier_ccw(geometry, &idx_q)) > fabsf(d2d_geometry_bezier_ccw(geometry, &idx_p)))
3153 {
3156 if (idx_p.figure_idx == idx_q.figure_idx)
3157 {
3158 ++idx_p.vertex_idx;
3159 ++idx_p.control_idx;
3160 }
3161 }
3162 else
3163 {
3166 }
3167 }
3168 d2d_geometry_get_next_bezier_segment_idx(geometry, &idx_q);
3169 }
3170 }
3171
3173 {
3175 continue;
3177 }
3178
3181 {
3183 geometry->fill.bezier_vertex_count = 0;
3185 }
3186
3187 bezier_idx = 0;
3188 d2d_geometry_get_first_bezier_segment_idx(geometry, &idx_p);
3189 for (;;)
3190 {
3192
3196
3197 i = idx_p.vertex_idx + 1;
3199 {
3200 sign = 1.0f;
3202 /* Inserting a vertex potentially invalidates p[0]. */
3204 ++i;
3205 }
3206
3208 i = 0;
3210
3215
3217 break;
3218 ++bezier_idx;
3219 }
3220
3222}
static BOOL d2d_geometry_get_first_bezier_segment_idx(struct d2d_geometry *geometry, struct d2d_segment_idx *idx)
Definition: geometry.c:3003
static BOOL d2d_geometry_split_bezier(struct d2d_geometry *geometry, const struct d2d_segment_idx *idx)
Definition: geometry.c:3106
static BOOL d2d_path_geometry_point_inside(const struct d2d_geometry *geometry, const D2D1_POINT_2F *probe, BOOL triangles_only)
Definition: geometry.c:1567
static float d2d_geometry_bezier_ccw(struct d2d_geometry *geometry, const struct d2d_segment_idx *idx)
Definition: geometry.c:3097
static BOOL d2d_geometry_check_bezier_overlap(struct d2d_geometry *geometry, const struct d2d_segment_idx *idx_p, const struct d2d_segment_idx *idx_q)
Definition: geometry.c:3015
static BOOL d2d_geometry_get_next_bezier_segment_idx(struct d2d_geometry *geometry, struct d2d_segment_idx *idx)
Definition: geometry.c:3010
Referenced by d2d_geometry_sink_Close().
◆ d2d_geometry_sink_AddArc()
|
static |
Definition at line 3334 of file geometry.c.
3335{
3337
3339
3341 {
3343 return;
3344 }
3345
3346 if (!d2d_figure_add_vertex(&geometry->u.path.figures[geometry->u.path.figure_count - 1], arc->point))
3347 {
3349 return;
3350 }
3351
3353}
static BOOL d2d_figure_add_vertex(struct d2d_figure *figure, D2D1_POINT_2F vertex)
Definition: geometry.c:847
static struct d2d_geometry * impl_from_ID2D1GeometrySink(ID2D1GeometrySink *iface)
Definition: geometry.c:2743
◆ d2d_geometry_sink_AddBezier()
|
static |
Definition at line 3265 of file geometry.c.
3266{
3268
3269 d2d_geometry_sink_AddBeziers(iface, bezier, 1);
3270}
static void STDMETHODCALLTYPE d2d_geometry_sink_AddBeziers(ID2D1GeometrySink *iface, const D2D1_BEZIER_SEGMENT *beziers, UINT32 count)
Definition: geometry.c:2868
◆ d2d_geometry_sink_AddBeziers()
|
static |
Definition at line 2868 of file geometry.c.
2870{
2875
2877
2879 {
2881 return;
2882 }
2883
2885 {
2886 D2D1_RECT_F bezier_bounds;
2887
2890 {
2893 return;
2894 }
2895
2896 /* FIXME: This tries to approximate a cubic Bézier with a quadratic one. */
2902
2905
2907 {
2910 return;
2911 }
2912
2914 {
2917 return;
2918 }
2919
2921 }
2922
2924}
static BOOL d2d_figure_add_bezier_controls(struct d2d_figure *figure, size_t count, const D2D1_POINT_2F *p)
Definition: geometry.c:894
static void d2d_rect_get_bezier_bounds(D2D_RECT_F *bounds, const D2D1_POINT_2F *p0, const D2D1_POINT_2F *p1, const D2D1_POINT_2F *p2)
Definition: geometry.c:769
static BOOL d2d_figure_add_original_bezier_controls(struct d2d_figure *figure, size_t count, const D2D1_POINT_2F *p)
Definition: geometry.c:909
Referenced by d2d_geometry_sink_AddBezier().
◆ d2d_geometry_sink_AddLine()
|
static |
Definition at line 3258 of file geometry.c.
3259{
3261
3263}
static void STDMETHODCALLTYPE d2d_geometry_sink_AddLines(ID2D1GeometrySink *iface, const D2D1_POINT_2F *points, UINT32 count)
Definition: geometry.c:2840
◆ d2d_geometry_sink_AddLines()
|
static |
Definition at line 2840 of file geometry.c.
2842{
2846
2848
2850 {
2852 return;
2853 }
2854
2856 {
2859 {
2861 return;
2862 }
2863 }
2864
2866}
Referenced by d2d_geometry_sink_AddLine().
◆ d2d_geometry_sink_AddQuadraticBezier()
|
static |
Definition at line 3272 of file geometry.c.
3274{
3276
3277 ID2D1GeometrySink_AddQuadraticBeziers(iface, bezier, 1);
3278}
◆ d2d_geometry_sink_AddQuadraticBeziers()
|
static |
Definition at line 3280 of file geometry.c.
3282{
3286
3288
3290 {
3292 return;
3293 }
3294
3296 {
3297 D2D1_RECT_F bezier_bounds;
3299
3300 /* Construct a cubic curve. */
3301 d2d_point_lerp(&p[0], &figure->vertices[figure->vertex_count - 1], &beziers[i].point1, 2.0f / 3.0f);
3304 {
3307 return;
3308 }
3309
3312
3315 {
3318 return;
3319 }
3320
3322 {
3325 return;
3326 }
3327
3329 }
3330
3332}
◆ d2d_geometry_sink_AddRef()
|
static |
Definition at line 2767 of file geometry.c.
2768{
2770
2772
2774}
◆ d2d_geometry_sink_BeginFigure()
|
static |
Definition at line 2804 of file geometry.c.
2806{
2809
2811 iface, debug_d2d_point_2f(&start_point), figure_begin);
2812
2814 {
2816 return;
2817 }
2818
2820 {
2823 return;
2824 }
2825
2829
2831 {
2834 return;
2835 }
2836
2838}
static BOOL d2d_path_geometry_add_figure(struct d2d_geometry *geometry)
Definition: geometry.c:2372
◆ d2d_geometry_sink_Close()
|
static |
Definition at line 3224 of file geometry.c.
3225{
3228
3230
3232 {
3236 }
3238
3240 goto done;
3242 goto done;
3244 goto done;
3245
3246done:
3248 {
3251 geometry->fill.bezier_vertex_count = 0;
3252 d2d_path_geometry_free_figures(geometry);
3254 }
3256}
static HRESULT d2d_path_geometry_triangulate(struct d2d_geometry *geometry)
Definition: geometry.c:2282
static HRESULT d2d_geometry_resolve_beziers(struct d2d_geometry *geometry)
Definition: geometry.c:3133
static BOOL d2d_geometry_intersect_self(struct d2d_geometry *geometry)
Definition: geometry.c:2197
static void d2d_path_geometry_free_figures(struct d2d_geometry *geometry)
Definition: geometry.c:2960
Definition: metahost.idl:58
◆ d2d_geometry_sink_EndFigure()
|
static |
Definition at line 2926 of file geometry.c.
2927{
2930
2932
2934 {
2936 return;
2937 }
2938
2940 if (memcmp(&figure->vertices[0], &figure->vertices[figure->vertex_count - 1], sizeof(*figure->vertices)))
2942 else
2945 {
2948 }
2949
2951 {
2954 return;
2955 }
2956
2958}
static BOOL d2d_geometry_add_figure_outline(struct d2d_geometry *geometry, struct d2d_figure *figure, D2D1_FIGURE_END figure_end)
Definition: geometry.c:2610
◆ d2d_geometry_sink_QueryInterface()
|
static |
Definition at line 2748 of file geometry.c.
2749{
2751
2753 || IsEqualGUID(iid, &IID_ID2D1SimplifiedGeometrySink)
2755 {
2756 ID2D1GeometrySink_AddRef(iface);
2757 *out = iface;
2759 }
2760
2762
2765}
◆ d2d_geometry_sink_Release()
|
static |
Definition at line 2776 of file geometry.c.
2777{
2779
2781
2783}
◆ d2d_geometry_sink_SetFillMode()
|
static |
Definition at line 2785 of file geometry.c.
2786{
2788
2790
2792 return;
2794}
◆ d2d_geometry_sink_SetSegmentFlags()
|
static |
Definition at line 2796 of file geometry.c.
2797{
2799
2802}
◆ d2d_geometry_split_bezier()
|
static |
Definition at line 3106 of file geometry.c.
3107{
3112
3118
3122
3129
3131}
Referenced by d2d_geometry_resolve_beziers().
◆ d2d_outline_vertex_set()
|
static |
Definition at line 150 of file geometry.c.
152{
156}
Referenced by d2d_geometry_outline_add_join(), and d2d_geometry_outline_add_line_segment().
◆ d2d_path_geometry1_ComputePointAndSegmentAtLength()
|
static |
◆ d2d_path_geometry_add_figure()
|
static |
Definition at line 2372 of file geometry.c.
2373{
2375
2378 {
2381 }
2382
2389
2392}
Referenced by d2d_geometry_sink_BeginFigure().
◆ d2d_path_geometry_add_fill_face()
|
static |
Definition at line 1614 of file geometry.c.
1616{
1619 D2D1_POINT_2F probe;
1620
1623
1626 {
1629 }
1630
1632
1633 /* It may seem tempting to use the center of the face as probe origin, but
1634 * multiplying by powers of two works much better for preserving accuracy. */
1635
1636 tmp = *base_edge;
1641
1642 d2d_cdt_edge_next_left(cdt, &tmp, &tmp);
1647
1648 d2d_cdt_edge_next_left(cdt, &tmp, &tmp);
1653
1654 if (d2d_cdt_leftof(cdt, face->v[2], base_edge) && d2d_path_geometry_point_inside(geometry, &probe, TRUE))
1655 ++geometry->fill.face_count;
1656
1658}
Referenced by d2d_cdt_generate_faces().
◆ d2d_path_geometry_AddRef()
|
static |
Definition at line 3400 of file geometry.c.
3401{
3404
3406
3408}
static struct d2d_geometry * impl_from_ID2D1PathGeometry1(ID2D1PathGeometry1 *iface)
Definition: geometry.c:3374
◆ d2d_path_geometry_CombineWithGeometry()
|
static |
◆ d2d_path_geometry_CompareWithGeometry()
|
static |
Definition at line 3674 of file geometry.c.
◆ d2d_path_geometry_ComputeArea()
|
static |
◆ d2d_path_geometry_ComputeLength()
|
static |
◆ d2d_path_geometry_ComputePointAtLength()
|
static |
◆ d2d_path_geometry_FillContainsPoint()
|
static |
Definition at line 3651 of file geometry.c.
3653{
3655 D2D1_MATRIX_3X2_F g_i;
3656
3659
3661 {
3665 }
3666
3668
3670
3672}
static BOOL d2d_matrix_invert(D2D_MATRIX_3X2_F *dst, const D2D_MATRIX_3X2_F *src)
Definition: d2d1_private.h:936
static void d2d_point_transform(D2D1_POINT_2F *dst, const D2D1_MATRIX_3X2_F *matrix, float x, float y)
Definition: d2d1_private.h:963
Definition: dcommon.idl:120
◆ d2d_path_geometry_free_figures()
|
static |
Definition at line 2960 of file geometry.c.
2961{
2963
2965 return;
2966
2968 {
2972 }
2976}
Referenced by d2d_geometry_sink_Close(), and d2d_path_geometry_Release().
◆ d2d_path_geometry_GetBounds()
|
static |
Definition at line 3436 of file geometry.c.
3438{
3441
3443
3446
3451
3453 {
3456 {
3458 {
3460 continue;
3462 }
3464 {
3469 }
3470 }
3471
3474 }
3475
3477 {
3480 D2D1_RECT_F bezier_bounds;
3483
3485 continue;
3486
3488 {
3490 continue;
3491
3496 break;
3497 }
3498
3500 {
3502
3504 || d2d_vertex_type_is_split_bezier(next_type))
3505 continue;
3506
3508 {
3513 break;
3514
3516 /* FIXME: This attempts to approximate a cubic Bézier with
3517 * a quadratic one. */
3518 p1 = figure->original_bezier_controls[bezier_idx++];
3520 p2 = figure->original_bezier_controls[bezier_idx++];
3528
3531 p = p2;
3532 break;
3533
3534 default:
3539 break;
3540 }
3541
3542 type = next_type;
3543 }
3544 }
3545
3547 {
3552 }
3553
3555}
static BOOL d2d_vertex_type_is_split_bezier(enum d2d_vertex_type t)
Definition: geometry.c:424
◆ d2d_path_geometry_GetFactory()
|
static |
Definition at line 3427 of file geometry.c.
3428{
3430
3432
3434}
◆ d2d_path_geometry_GetFigureCount()
|
static |
Definition at line 3915 of file geometry.c.
3916{
3918
3920
3923
3925
3927}
◆ d2d_path_geometry_GetSegmentCount()
|
static |
Definition at line 3901 of file geometry.c.
3902{
3904
3906
3909
3911
3913}
◆ d2d_path_geometry_GetWidenedBounds()
|
static |
Definition at line 3557 of file geometry.c.
◆ d2d_path_geometry_init()
| void d2d_path_geometry_init | ( | struct d2d_geometry * | geometry, |
| ID2D1Factory * | factory | ||
| ) |
Definition at line 3965 of file geometry.c.
3966{
3973}
static const struct ID2D1PathGeometry1Vtbl d2d_path_geometry_vtbl
Definition: geometry.c:3939
static const struct ID2D1GeometrySinkVtbl d2d_geometry_sink_vtbl
Definition: geometry.c:3355
Referenced by d2d_factory_CreatePathGeometry(), and d2d_factory_CreatePathGeometry1().
◆ d2d_path_geometry_Open()
|
static |
Definition at line 3877 of file geometry.c.
◆ d2d_path_geometry_Outline()
|
static |
◆ d2d_path_geometry_point_inside()
|
static |
Definition at line 1567 of file geometry.c.
1569{
1571 D2D1_POINT_2F v_p, v_probe;
1572 unsigned int score;
1574
1576 {
1578
1581 continue;
1582
1584 if (!triangles_only)
1585 {
1587 --last;
1588 }
1591 {
1593 continue;
1594
1596 d2d_point_subtract(&v_p, p1, p0);
1597 d2d_point_subtract(&v_probe, probe, p0);
1598
1600 {
1602 ++score;
1603 else
1604 --score;
1605 }
1606
1607 p0 = p1;
1608 }
1609 }
1610
1612}
Referenced by d2d_geometry_resolve_beziers(), d2d_path_geometry_add_fill_face(), and d2d_path_geometry_FillContainsPoint().
◆ d2d_path_geometry_QueryInterface()
|
static |
Definition at line 3379 of file geometry.c.
3380{
3382
3384 || IsEqualGUID(iid, &IID_ID2D1PathGeometry)
3385 || IsEqualGUID(iid, &IID_ID2D1Geometry)
3386 || IsEqualGUID(iid, &IID_ID2D1Resource)
3388 {
3389 ID2D1PathGeometry1_AddRef(iface);
3390 *out = iface;
3392 }
3393
3395
3398}
◆ d2d_path_geometry_Release()
|
static |
Definition at line 3410 of file geometry.c.
3411{
3414
3416
3418 {
3419 d2d_path_geometry_free_figures(geometry);
3420 d2d_geometry_cleanup(geometry);
3421 free(geometry);
3422 }
3423
3425}
◆ d2d_path_geometry_Simplify()
|
static |
Definition at line 3728 of file geometry.c.
3731{
3735 D2D1_FIGURE_BEGIN begin;
3739
3742
3745 {
3747
3749 {
3751 continue;
3752
3756 begin = figure->flags & D2D_FIGURE_FLAG_HOLLOW ? D2D1_FIGURE_BEGIN_HOLLOW : D2D1_FIGURE_BEGIN_FILLED;
3759 break;
3760 }
3761
3763 {
3765
3767 || d2d_vertex_type_is_split_bezier(next_type))
3768 continue;
3769
3771 {
3777 break;
3778
3784 {
3788 }
3789
3792 else
3795 break;
3796
3797 default:
3803 break;
3804 }
3805
3806 type = next_type;
3807 }
3808
3811 }
3812
3814}
@ D2D1_GEOMETRY_SIMPLIFICATION_OPTION_LINES
Definition: d2d1.idl:154
◆ d2d_path_geometry_Stream()
|
static |
Definition at line 3894 of file geometry.c.
◆ d2d_path_geometry_StrokeContainsPoint()
|
static |
Definition at line 3566 of file geometry.c.
3569{
3575
3576 TRACE("iface %p, point %s, stroke_width %.8e, stroke_style %p, transform %p, tolerance %.8e, contains %p.\n",
3577 iface, debug_d2d_point_2f(&point), stroke_width, stroke_style, transform, tolerance, contains);
3578
3579 if (stroke_style)
3581
3584
3585 if (tolerance <= 0.0f)
3586 tolerance = D2D1_DEFAULT_FLATTENING_TOLERANCE;
3587
3588 *contains = FALSE;
3590 {
3592
3594 {
3596 continue;
3597
3600 break;
3601 }
3602
3604 {
3606
3608 || d2d_vertex_type_is_split_bezier(next_type))
3609 continue;
3610
3612 {
3615 *contains = d2d_point_on_line_segment(&point, &p, &p1, transform, stroke_width * 0.5f, tolerance);
3616 p = p1;
3617 break;
3618
3625 break;
3626
3627 default:
3630 break;
3631 }
3632 if (*contains)
3634 type = next_type;
3635 }
3636
3638 {
3639 p1 = figure->vertices[0];
3641 *contains = d2d_point_on_line_segment(&point, &p, &p1, transform, stroke_width * 0.5f, tolerance);
3642 }
3643
3644 if (*contains)
3646 }
3647
3649}
static BOOL d2d_point_on_bezier_segment(const D2D1_POINT_2F *q, const D2D1_POINT_2F *p0, const D2D1_BEZIER_SEGMENT *b, const D2D1_MATRIX_3X2_F *transform, float stroke_width, float tolerance)
Definition: geometry.c:595
static BOOL d2d_point_on_line_segment(const D2D1_POINT_2F *q, const D2D1_POINT_2F *p0, const D2D1_POINT_2F *p1, const D2D1_MATRIX_3X2_F *transform, float stroke_width, float tolerance)
Definition: geometry.c:517
◆ d2d_path_geometry_Tessellate()
|
static |
◆ d2d_path_geometry_triangulate()
|
static |
Definition at line 2282 of file geometry.c.
2283{
2288#ifdef __i386__
2290#endif
2291
2293 {
2295 continue;
2297 }
2298
2300 {
2303 }
2304
2307
2309 {
2311 continue;
2315 }
2316
2317 /* Sort vertices, eliminate duplicates. */
2320 {
2322 {
2323 --vertex_count;
2325 --i;
2326 }
2327 }
2328
2330 {
2334 }
2335
2338
2341
2342#ifdef __i386__
2343 control_word_x87 = _controlfp(0, 0);
2345#endif
2347 goto fail;
2349 goto fail;
2350#ifdef __i386__
2352 mask = 0;
2353#endif
2354
2356 goto fail;
2357
2360
2361fail:
2363 geometry->fill.vertex_count = 0;
2366#ifdef __i386__
2368#endif
2370}
static BOOL d2d_cdt_insert_segments(struct d2d_cdt *cdt, struct d2d_geometry *geometry)
Definition: geometry.c:1817
static BOOL d2d_cdt_generate_faces(const struct d2d_cdt *cdt, struct d2d_geometry *geometry)
Definition: geometry.c:1660
_ACRTIMP unsigned int __cdecl _controlfp(unsigned int, unsigned int)
Definition: math.c:1288
Definition: geometry.c:97
Referenced by d2d_geometry_sink_Close().
◆ d2d_path_geometry_Widen()
|
static |
◆ d2d_point_calculate_bezier()
|
static |
Definition at line 397 of file geometry.c.
399{
401
404}
Referenced by d2d_geometry_add_bezier_line_intersections(), d2d_geometry_intersect_bezier_bezier(), and d2d_rect_get_bezier_bounds().
◆ d2d_point_ccw()
|
static |
Definition at line 432 of file geometry.c.
433{
438 float det_d[16], det_c2[12], det_c1[8], det_b[4], temp4[4], temp2a[2], temp2b[2], abxacy[2], abyacx[2];
439 size_t det_d_len, det_c2_len, det_c1_len;
440 float det, det_sum, err_bound;
442
447
448 abxacy[1] = ab.x[1] * ac.y[1];
449 abyacx[1] = ab.y[1] * ac.x[1];
450 det = abxacy[1] - abyacx[1];
451
452 if (abxacy[1] > 0.0f)
453 {
454 if (abyacx[1] <= 0.0f)
455 return det;
456 det_sum = abxacy[1] + abyacx[1];
457 }
458 else if (abxacy[1] < 0.0f)
459 {
460 if (abyacx[1] >= 0.0f)
461 return det;
462 det_sum = -abxacy[1] - abyacx[1];
463 }
464 else
465 {
466 return det;
467 }
468
469 err_bound = err_bound_a * det_sum;
470 if (det >= err_bound || -det >= err_bound)
471 return det;
472
475 d2d_fp_two_two_diff(det_b, abxacy, abyacx);
476
477 det = d2d_fp_estimate(det_b, 4);
478 err_bound = err_bound_b * det_sum;
479 if (det >= err_bound || -det >= err_bound)
480 return det;
481
486
488 return det;
489
490 err_bound = err_bound_c * det_sum + err_bound_result * fabsf(det);
492 if (det >= err_bound || -det >= err_bound)
493 return det;
494
497 d2d_fp_two_two_diff(temp4, temp2a, temp2b);
498 d2d_fp_fast_expansion_sum_zeroelim(det_c1, &det_c1_len, det_b, 4, temp4, 4);
499
502 d2d_fp_two_two_diff(temp4, temp2a, temp2b);
503 d2d_fp_fast_expansion_sum_zeroelim(det_c2, &det_c2_len, det_c1, det_c1_len, temp4, 4);
504
507 d2d_fp_two_two_diff(temp4, temp2a, temp2b);
508 d2d_fp_fast_expansion_sum_zeroelim(det_d, &det_d_len, det_c2, det_c2_len, temp4, 4);
509
510 return det_d[det_d_len - 1];
511}
Referenced by d2d_cdt_ccw(), d2d_geometry_bezier_ccw(), d2d_geometry_check_bezier_overlap(), d2d_geometry_outline_add_arc_quadrant(), d2d_geometry_outline_add_bezier_segment(), d2d_geometry_outline_add_join(), and d2d_point_on_bezier_segment().
◆ d2d_point_length()
|
static |
Definition at line 406 of file geometry.c.
407{
409}
static float d2d_point_dot(const D2D1_POINT_2F *p0, const D2D1_POINT_2F *p1)
Definition: d2d1_private.h:958
Referenced by d2d_point_normalise(), d2d_point_on_bezier_segment(), and d2d_point_on_line_segment().
◆ d2d_point_lerp()
|
static |
Definition at line 390 of file geometry.c.
Referenced by d2d_geometry_add_bezier_line_intersections(), d2d_geometry_apply_intersections(), d2d_geometry_flatten_cubic(), d2d_geometry_outline_add_bezier_segment(), d2d_geometry_sink_AddQuadraticBeziers(), d2d_geometry_split_bezier(), d2d_point_on_bezier_segment(), and d2d_rect_get_bezier_segment_bounds().
◆ d2d_point_normalise()
|
static |
Definition at line 411 of file geometry.c.
412{
414
417}
Referenced by d2d_geometry_add_figure_outline(), d2d_geometry_outline_add_arc_quadrant(), d2d_geometry_outline_add_bezier_segment(), d2d_geometry_outline_add_line_segment(), and d2d_point_on_line_segment().
◆ d2d_point_on_bezier_segment()
|
static |
Definition at line 595 of file geometry.c.
597{
601
602 m = 1.0f;
603 w = stroke_width * 0.5f;
604
606 /* If the endpoints coincide, use the line through the control points as
607 * the direction vector. That choice is somewhat arbitrary; other choices
608 * with tighter error bounds exist. */
610 {
612 /* If the control points also coincide, the curve is in fact a line. */
614 {
618
620 }
621 m = 0.0f;
622 }
626
627 /* Calculate the width w2 of the approximation. */
628
631 /* Here, d1 and d2 are the maximum (signed) distance of the control points
632 * from the line through the start and end points. */
635 /* It can be shown that if the control points of a cubic Bézier curve lie
636 * on the same side of the line through the endpoints, the distance of the
637 * curve itself to that line will be within 3/4 of the distance of the
638 * control points to that line; if the control points lie on opposite
639 * sides, that distance will be within 4/9 of the distance of the
640 * corresponding control point. We're taking that as a given here. */
641 if (d1 * d2 > 0.0f)
642 {
643 d1 *= 0.75f;
644 d2 *= 0.75f;
645 }
646 else
647 {
648 d1 = (d1 * 4.0f) / 9.0f;
649 d2 = (d2 * 4.0f) / 9.0f;
650 }
652
653 /* Project the control points onto the line through the endpoints of the
654 * curve. We will use these to calculate the endpoints of the
655 * approximation. */
660
661 /* Calculate the start point of the approximation. Like further above, the
662 * actual curve is somewhat closer to the endpoints than the control
663 * points are. */
665 if (d1 * d2 > 0.0f)
666 d *= 0.75f;
667 else
669 /* Account for the stroke width and tolerance around the endpoints by
670 * adjusting the endpoints here. This matters because there are no joins
671 * in the original geometry for the places where we subdivide the original
672 * curve. We do this here because it's easy; alternatively we could
673 * explicitly test for this when subdividing the curve further below. */
677
678 /* Calculate the end point of the approximation. */
679 d1 -= m;
680 d2 -= m;
682 if (d1 * d2 > 0.0f)
684 else
689
690 /* Calculate the error bounds of the approximation. We do this in
691 * transformed space because we need these to be relative to the given
692 * tolerance. */
693
700
703 /* Here, d1 and d2 are the maximum (signed) distance of the control points
704 * from the line through the start and end points. */
707 if (d1 * d2 > 0.0f)
708 {
709 d1 *= 0.75f;
710 d2 *= 0.75f;
711 }
712 else
713 {
714 d1 = (d1 * 4.0f) / 9.0f;
715 d2 = (d2 * 4.0f) / 9.0f;
716 }
718
719 /* d3 and d4 are the (unsigned) distance of the endpoints of the
720 * approximation from the original endpoints. */
726
727 /* If the error of the approximation is less than the tolerance, and Q
728 * lies on the approximation, the distance of Q to the stroked curve is
729 * definitely within the tolerance. */
732 /* On the other hand, if the distance of Q to the stroked curve is more
733 * than the sum of the tolerance and d, the distance of Q to the stroked
734 * curve can't possibly be within the tolerance. */
737
738 /* Subdivide the curve. Note that simply splitting the segment in half
739 * here works and is easy, but may not be optimal. We could potentially
740 * reduce the number of iterations we need to do by splitting based on
741 * curvature or segment length. */
743
747
751
754}
GLdouble GLdouble GLint GLint GLdouble GLdouble GLint GLint GLdouble GLdouble w2
Definition: glext.h:8308
Referenced by d2d_path_geometry_StrokeContainsPoint(), and d2d_point_on_bezier_segment().
◆ d2d_point_on_line_segment()
|
static |
Definition at line 517 of file geometry.c.
519{
520 D2D1_POINT_2F v_n, v_p, v_q, v_r;
522
523 d2d_point_subtract(&v_p, p1, p0);
526
527 /* After (shear) transformation, the line segment is a parallelogram
528 * defined by p⃑' and n⃑':
529 *
530 * p⃑ = P₁ - P₀
531 * n⃑ = wp̂⟂
532 * p⃑' = p⃑T
533 * n⃑' = n⃑T */
537 d2d_point_subtract(&v_n, &v_n, &v_r);
539 d2d_point_subtract(&v_p, &v_p, &v_r);
540
541 /* Decompose the vector q⃑ = Q - P₀T into a linear combination of
542 * p⃑' and n⃑':
543 *
544 * lq⃑ = xp⃑' + yn⃑' */
550
552 {
553 l *= -1.0f;
554 v_r.x *= -1.0f;
555 }
556
557 /* Check where Q projects onto p⃑'. */
560
561 /* Check where Q projects onto n⃑'. */
564
565 /* Q lies outside the segment. Check whether the distance to the edge is
566 * within the tolerance.
567 *
568 * P₀' = P₀T + n⃑'
569 * q⃑' = Q - P₀'
570 * = q⃑ - n⃑'
571 *
572 * The distance is then q⃑' · p̂'⟂. */
573
575 d2d_point_scale(&v_n, -1.0f);
576 d2d_point_subtract(&v_q, &v_q, &v_n);
577
578 /* Check where Q projects onto p⃑' + n⃑'. */
582
585 d2d_point_normalise(&v_n);
586
588}
_ACRTIMP double __cdecl fabs(double)
Referenced by d2d_path_geometry_StrokeContainsPoint(), d2d_point_on_bezier_segment(), and d2d_rectangle_geometry_StrokeContainsPoint().
◆ d2d_point_scale()
|
static |
Definition at line 384 of file geometry.c.
385{
388}
Referenced by d2d_geometry_outline_add_arc_quadrant(), d2d_geometry_outline_add_bezier_segment(), d2d_point_normalise(), d2d_point_on_bezier_segment(), and d2d_point_on_line_segment().
◆ d2d_point_subtract()
|
static |
Definition at line 377 of file geometry.c.
Referenced by d2d_geometry_add_figure_outline(), d2d_geometry_check_bezier_overlap(), d2d_geometry_flatten_cubic(), d2d_geometry_intersect_line_line(), d2d_geometry_outline_add_arc_quadrant(), d2d_geometry_outline_add_bezier_segment(), d2d_geometry_outline_add_line_segment(), d2d_path_geometry_point_inside(), d2d_point_on_bezier_segment(), and d2d_point_on_line_segment().
◆ d2d_rect_check_overlap()
|
static |
Definition at line 764 of file geometry.c.
765{
767}
Referenced by d2d_geometry_intersect_bezier_bezier(), and d2d_geometry_intersect_self().
◆ d2d_rect_get_bezier_bounds()
|
static |
Definition at line 769 of file geometry.c.
771{
774
779
780 d2d_rect_expand(bounds, p2);
781
782 /* f(t) = (1 - t)²P₀ + 2(1 - t)tP₁ + t²P₂
783 * f'(t) = 2(1 - t)(P₁ - P₀) + 2t(P₂ - P₁)
784 * = 2(P₂ - 2P₁ + P₀)t + 2(P₁ - P₀)
785 *
786 * f'(t) = 0
787 * t = (P₀ - P₁) / (P₂ - 2P₁ + P₀) */
790 {
793 }
794
797 {
800 }
801}
Referenced by d2d_geometry_sink_AddBeziers(), d2d_geometry_sink_AddQuadraticBeziers(), d2d_path_geometry_GetBounds(), and d2d_rect_get_bezier_segment_bounds().
◆ d2d_rect_get_bezier_segment_bounds()
|
static |
Definition at line 803 of file geometry.c.
805{
807
811
816
818}
Referenced by d2d_geometry_intersect_bezier_bezier().
◆ d2d_rect_union()
|
static |
Definition at line 756 of file geometry.c.
757{
762}
Referenced by d2d_geometry_group_GetBounds(), d2d_geometry_sink_AddBeziers(), d2d_geometry_sink_AddQuadraticBeziers(), and d2d_path_geometry_GetBounds().
◆ d2d_rectangle_geometry_AddRef()
|
static |
Definition at line 4273 of file geometry.c.
4274{
4277
4279
4281}
static struct d2d_geometry * impl_from_ID2D1RectangleGeometry(ID2D1RectangleGeometry *iface)
Definition: geometry.c:4247
◆ d2d_rectangle_geometry_CombineWithGeometry()
|
static |
◆ d2d_rectangle_geometry_CompareWithGeometry()
|
static |
Definition at line 4456 of file geometry.c.
◆ d2d_rectangle_geometry_ComputeArea()
|
static |
◆ d2d_rectangle_geometry_ComputeLength()
|
static |
◆ d2d_rectangle_geometry_ComputePointAtLength()
|
static |
◆ d2d_rectangle_geometry_FillContainsPoint()
|
static |
Definition at line 4427 of file geometry.c.
4429{
4433
4436
4438 {
4439 D2D1_MATRIX_3X2_F g_i;
4440
4444 }
4445
4446 if (tolerance == 0.0f)
4447 tolerance = D2D1_DEFAULT_FLATTENING_TOLERANCE;
4448
4449 dx = max(fabsf((rect->right + rect->left) / 2.0f - point.x) - (rect->right - rect->left) / 2.0f, 0.0f);
4450 dy = max(fabsf((rect->bottom + rect->top) / 2.0f - point.y) - (rect->bottom - rect->top) / 2.0f, 0.0f);
4451
4454}
struct d2d_geometry::@243::@246 rectangle
◆ d2d_rectangle_geometry_GetBounds()
|
static |
Definition at line 4308 of file geometry.c.
4310{
4314
4316
4319 {
4322 }
4323
4328
4337
4339}
◆ d2d_rectangle_geometry_GetFactory()
|
static |
Definition at line 4299 of file geometry.c.
4300{
4302
4304
4306}
◆ d2d_rectangle_geometry_GetRect()
|
static |
Definition at line 4560 of file geometry.c.
4561{
4563
4565
4567}
◆ d2d_rectangle_geometry_GetWidenedBounds()
|
static |
Definition at line 4341 of file geometry.c.
◆ d2d_rectangle_geometry_init()
| HRESULT d2d_rectangle_geometry_init | ( | struct d2d_geometry * | geometry, |
| ID2D1Factory * | factory, | ||
| const D2D1_RECT_F * | rect | ||
| ) |
Definition at line 4591 of file geometry.c.
4592{
4596
4598 {
4599 { 1.0f, 0.0f},
4600 { 0.0f, -1.0f},
4601 {-1.0f, 0.0f},
4602 { 0.0f, 1.0f},
4603 };
4605 {
4606 { 0.0f, 1.0f},
4607 { 1.0f, 0.0f},
4608 { 0.0f, -1.0f},
4609 {-1.0f, 0.0f},
4610 };
4611
4612 d2d_geometry_init(geometry, factory, &identity, (ID2D1GeometryVtbl *)&d2d_rectangle_geometry_vtbl);
4614
4616 goto fail;
4619 goto fail;
4620
4625
4631 geometry->fill.vertex_count = 4;
4632
4636 geometry->fill.face_count = 2;
4637
4639 goto fail;
4641 goto fail;
4643 goto fail;
4645 goto fail;
4646
4648 goto fail;
4650 goto fail;
4652 goto fail;
4654 goto fail;
4655
4657
4658fail:
4659 d2d_geometry_cleanup(geometry);
4661}
static const struct ID2D1RectangleGeometryVtbl d2d_rectangle_geometry_vtbl
Definition: geometry.c:4569
Referenced by d2d_factory_CreateRectangleGeometry().
◆ d2d_rectangle_geometry_Outline()
|
static |
◆ d2d_rectangle_geometry_QueryInterface()
|
static |
Definition at line 4252 of file geometry.c.
4254{
4256
4258 || IsEqualGUID(iid, &IID_ID2D1Geometry)
4259 || IsEqualGUID(iid, &IID_ID2D1Resource)
4261 {
4262 ID2D1RectangleGeometry_AddRef(iface);
4263 *out = iface;
4265 }
4266
4268
4271}
◆ d2d_rectangle_geometry_Release()
|
static |
Definition at line 4283 of file geometry.c.
◆ d2d_rectangle_geometry_Simplify()
|
static |
Definition at line 4465 of file geometry.c.
4468{
4473
4476
4481
4483 {
4485 {
4487 }
4488 }
4489
4494
4496}
◆ d2d_rectangle_geometry_StrokeContainsPoint()
|
static |
Definition at line 4351 of file geometry.c.
4354{
4358 struct
4359 {
4361 }
4362 segments[4];
4363
4364 TRACE("iface %p, point %s, stroke_width %.8e, stroke_style %p, transform %p, tolerance %.8e, contains %p.\n",
4365 iface, debug_d2d_point_2f(&point), stroke_width, stroke_style, transform, tolerance, contains);
4366
4367 if (stroke_style)
4369
4370 tolerance = fabsf(tolerance);
4371
4373 {
4375
4380
4381 /* Inside test. */
4382 if (d.x <= (s.x - stroke_width) * 0.5f - tolerance && d.y <= (s.y - stroke_width) * 0.5f - tolerance)
4383 {
4384 *contains = FALSE;
4386 }
4387
4388 if (tolerance == 0.0f)
4389 {
4391 }
4392 else
4393 {
4396
4398 }
4399
4401 }
4402
4403 stroke_width *= 0.5f;
4404
4413
4414 *contains = FALSE;
4416 {
4417 if (d2d_point_on_line_segment(&point, &segments[i].s, &segments[i].e, transform, stroke_width, tolerance))
4418 {
4419 *contains = TRUE;
4420 break;
4421 }
4422 }
4423
4425}
◆ d2d_rectangle_geometry_Tessellate()
|
static |
◆ d2d_rectangle_geometry_Widen()
|
static |
◆ d2d_rounded_rectangle_geometry_AddRef()
|
static |
Definition at line 4689 of file geometry.c.
4690{
4693
4695
4697}
static struct d2d_geometry * impl_from_ID2D1RoundedRectangleGeometry(ID2D1RoundedRectangleGeometry *iface)
Definition: geometry.c:4663
◆ d2d_rounded_rectangle_geometry_CombineWithGeometry()
|
static |
◆ d2d_rounded_rectangle_geometry_CompareWithGeometry()
|
static |
Definition at line 4762 of file geometry.c.
◆ d2d_rounded_rectangle_geometry_ComputeArea()
|
static |
◆ d2d_rounded_rectangle_geometry_ComputeLength()
|
static |
◆ d2d_rounded_rectangle_geometry_ComputePointAtLength()
|
static |
◆ d2d_rounded_rectangle_geometry_FillContainsPoint()
|
static |
Definition at line 4753 of file geometry.c.
4755{
4758
4760}
◆ d2d_rounded_rectangle_geometry_GetBounds()
|
static |
Definition at line 4725 of file geometry.c.
◆ d2d_rounded_rectangle_geometry_GetFactory()
|
static |
Definition at line 4715 of file geometry.c.
4717{
4719
4721
4723}
◆ d2d_rounded_rectangle_geometry_GetRoundedRect()
|
static |
Definition at line 4844 of file geometry.c.
4846{
4848
4850
4852}
struct d2d_geometry::@243::@247 rounded_rectangle
◆ d2d_rounded_rectangle_geometry_GetWidenedBounds()
|
static |
Definition at line 4733 of file geometry.c.
◆ d2d_rounded_rectangle_geometry_init()
| HRESULT d2d_rounded_rectangle_geometry_init | ( | struct d2d_geometry * | geometry, |
| ID2D1Factory * | factory, | ||
| const D2D1_ROUNDED_RECT * | rounded_rect | ||
| ) |
Definition at line 4876 of file geometry.c.
4878{
4882 float rx, ry;
4883
4884 d2d_geometry_init(geometry, factory, &identity, (ID2D1GeometryVtbl *)&d2d_rounded_rectangle_geometry_vtbl);
4886
4888 goto fail;
4891 goto fail;
4892
4897
4900
4905
4915 geometry->fill.vertex_count = 8;
4916
4924 geometry->fill.face_count = 6;
4925
4927 goto fail;
4929 goto fail;
4931 goto fail;
4933 goto fail;
4934
4936 goto fail;
4938 goto fail;
4940 goto fail;
4942 goto fail;
4944 goto fail;
4946 goto fail;
4948 goto fail;
4950 goto fail;
4951
4953
4954fail:
4955 d2d_geometry_cleanup(geometry);
4957}
static const struct ID2D1RoundedRectangleGeometryVtbl d2d_rounded_rectangle_geometry_vtbl
Definition: geometry.c:4854
Referenced by d2d_factory_CreateRoundedRectangleGeometry().
◆ d2d_rounded_rectangle_geometry_Outline()
|
static |
◆ d2d_rounded_rectangle_geometry_QueryInterface()
|
static |
Definition at line 4668 of file geometry.c.
4670{
4672
4674 || IsEqualGUID(iid, &IID_ID2D1Geometry)
4675 || IsEqualGUID(iid, &IID_ID2D1Resource)
4677 {
4678 ID2D1RoundedRectangleGeometry_AddRef(iface);
4679 *out = iface;
4681 }
4682
4684
4687}
◆ d2d_rounded_rectangle_geometry_Release()
|
static |
Definition at line 4699 of file geometry.c.
◆ d2d_rounded_rectangle_geometry_Simplify()
|
static |
◆ d2d_rounded_rectangle_geometry_StrokeContainsPoint()
|
static |
Definition at line 4743 of file geometry.c.
4746{
4747 FIXME("iface %p, point %s, stroke_width %.8e, stroke_style %p, transform %p, tolerance %.8e, contains %p stub!\n",
4748 iface, debug_d2d_point_2f(&point), stroke_width, stroke_style, transform, tolerance, contains);
4749
4751}
◆ d2d_rounded_rectangle_geometry_Tessellate()
|
static |
◆ d2d_rounded_rectangle_geometry_Widen()
|
static |
◆ d2d_transformed_geometry_AddRef()
|
static |
Definition at line 4985 of file geometry.c.
4986{
4989
4991
4993}
static struct d2d_geometry * impl_from_ID2D1TransformedGeometry(ID2D1TransformedGeometry *iface)
Definition: geometry.c:4959
◆ d2d_transformed_geometry_CombineWithGeometry()
|
static |
◆ d2d_transformed_geometry_CompareWithGeometry()
|
static |
Definition at line 5095 of file geometry.c.
◆ d2d_transformed_geometry_ComputeArea()
|
static |
◆ d2d_transformed_geometry_ComputeLength()
|
static |
◆ d2d_transformed_geometry_ComputePointAtLength()
|
static |
◆ d2d_transformed_geometry_FillContainsPoint()
|
static |
Definition at line 5079 of file geometry.c.
5081{
5084
5087
5091
5092 return ID2D1Geometry_FillContainsPoint(geometry->u.transformed.src_geometry, point, &g, tolerance, contains);
5093}
static void d2d_matrix_multiply(D2D_MATRIX_3X2_F *a, const D2D_MATRIX_3X2_F *b)
Definition: d2d1_private.h:923
struct d2d_geometry::@243::@248 transformed
◆ d2d_transformed_geometry_GetBounds()
|
static |
Definition at line 5032 of file geometry.c.
5034{
5037
5039
5043
5045}
◆ d2d_transformed_geometry_GetFactory()
|
static |
Definition at line 5022 of file geometry.c.
5024{
5026
5028
5030}
◆ d2d_transformed_geometry_GetSourceGeometry()
|
static |
Definition at line 5183 of file geometry.c.
5185{
5187
5189
5191}
◆ d2d_transformed_geometry_GetTransform()
|
static |
Definition at line 5193 of file geometry.c.
5195{
5197
5199
5201}
◆ d2d_transformed_geometry_GetWidenedBounds()
|
static |
Definition at line 5047 of file geometry.c.
◆ d2d_transformed_geometry_init()
| void d2d_transformed_geometry_init | ( | struct d2d_geometry * | geometry, |
| ID2D1Factory * | factory, | ||
| ID2D1Geometry * | src_geometry, | ||
| const D2D_MATRIX_3X2_F * | transform | ||
| ) |
Definition at line 5226 of file geometry.c.
5228{
5231
5233
5241}
struct d2d_geometry * unsafe_impl_from_ID2D1Geometry(ID2D1Geometry *iface)
Definition: geometry.c:5520
static const struct ID2D1TransformedGeometryVtbl d2d_transformed_geometry_vtbl
Definition: geometry.c:5203
Referenced by d2d_factory_CreateTransformedGeometry().
◆ d2d_transformed_geometry_Outline()
|
static |
◆ d2d_transformed_geometry_QueryInterface()
|
static |
Definition at line 4964 of file geometry.c.
4966{
4968
4970 || IsEqualGUID(iid, &IID_ID2D1Geometry)
4971 || IsEqualGUID(iid, &IID_ID2D1Resource)
4973 {
4974 ID2D1TransformedGeometry_AddRef(iface);
4975 *out = iface;
4977 }
4978
4980
4983}
◆ d2d_transformed_geometry_Release()
|
static |
Definition at line 4995 of file geometry.c.
◆ d2d_transformed_geometry_Simplify()
|
static |
Definition at line 5104 of file geometry.c.
5107{
5110
5113
5117
5118 return ID2D1Geometry_Simplify(geometry->u.transformed.src_geometry, option, &g, tolerance, sink);
5119}
◆ d2d_transformed_geometry_StrokeContainsPoint()
|
static |
Definition at line 5057 of file geometry.c.
5060{
5063
5064 TRACE("iface %p, point %s, stroke_width %.8e, stroke_style %p, transform %p, tolerance %.8e, contains %p.\n",
5065 iface, debug_d2d_point_2f(&point), stroke_width, stroke_style, transform, tolerance, contains);
5066
5071
5072 if (tolerance <= 0.0f)
5073 tolerance = D2D1_DEFAULT_FLATTENING_TOLERANCE;
5074
5075 return ID2D1Geometry_StrokeContainsPoint(geometry->u.transformed.src_geometry, point, stroke_width, stroke_style,
5076 &g, tolerance, contains);
5077}
◆ d2d_transformed_geometry_Tessellate()
|
static |
◆ d2d_transformed_geometry_Widen()
|
static |
◆ d2d_vertex_type_is_bezier()
|
static |
Definition at line 419 of file geometry.c.
Referenced by d2d_geometry_add_figure_outline(), d2d_geometry_apply_intersections(), d2d_geometry_get_bezier_segment_idx(), and d2d_geometry_intersect_self().
◆ d2d_vertex_type_is_split_bezier()
|
static |
Definition at line 424 of file geometry.c.
Referenced by d2d_path_geometry_GetBounds(), d2d_path_geometry_Simplify(), and d2d_path_geometry_StrokeContainsPoint().
◆ impl_from_ID2D1EllipseGeometry()
|
inlinestatic |
Definition at line 3975 of file geometry.c.
3976{
3978}
Referenced by d2d_ellipse_geometry_AddRef(), d2d_ellipse_geometry_GetEllipse(), d2d_ellipse_geometry_GetFactory(), and d2d_ellipse_geometry_Release().
◆ impl_from_ID2D1GeometryGroup()
|
inlinestatic |
Definition at line 5243 of file geometry.c.
Referenced by d2d_geometry_group_AddRef(), d2d_geometry_group_GetBounds(), d2d_geometry_group_GetFactory(), d2d_geometry_group_GetFillMode(), d2d_geometry_group_GetSourceGeometries(), d2d_geometry_group_GetSourceGeometryCount(), and d2d_geometry_group_Release().
◆ impl_from_ID2D1GeometrySink()
|
inlinestatic |
Definition at line 2743 of file geometry.c.
2744{
2746}
Referenced by d2d_geometry_sink_AddArc(), d2d_geometry_sink_AddBeziers(), d2d_geometry_sink_AddLines(), d2d_geometry_sink_AddQuadraticBeziers(), d2d_geometry_sink_AddRef(), d2d_geometry_sink_BeginFigure(), d2d_geometry_sink_Close(), d2d_geometry_sink_EndFigure(), d2d_geometry_sink_Release(), and d2d_geometry_sink_SetFillMode().
◆ impl_from_ID2D1PathGeometry1()
|
inlinestatic |
Definition at line 3374 of file geometry.c.
Referenced by d2d_path_geometry_AddRef(), d2d_path_geometry_FillContainsPoint(), d2d_path_geometry_GetBounds(), d2d_path_geometry_GetFactory(), d2d_path_geometry_GetFigureCount(), d2d_path_geometry_GetSegmentCount(), d2d_path_geometry_Open(), d2d_path_geometry_Release(), d2d_path_geometry_Simplify(), and d2d_path_geometry_StrokeContainsPoint().
◆ impl_from_ID2D1RectangleGeometry()
|
inlinestatic |
Definition at line 4247 of file geometry.c.
Referenced by d2d_rectangle_geometry_AddRef(), d2d_rectangle_geometry_FillContainsPoint(), d2d_rectangle_geometry_GetBounds(), d2d_rectangle_geometry_GetFactory(), d2d_rectangle_geometry_GetRect(), d2d_rectangle_geometry_Release(), d2d_rectangle_geometry_Simplify(), and d2d_rectangle_geometry_StrokeContainsPoint().
◆ impl_from_ID2D1RoundedRectangleGeometry()
|
inlinestatic |
Definition at line 4663 of file geometry.c.
Referenced by d2d_rounded_rectangle_geometry_AddRef(), d2d_rounded_rectangle_geometry_GetFactory(), d2d_rounded_rectangle_geometry_GetRoundedRect(), and d2d_rounded_rectangle_geometry_Release().
◆ impl_from_ID2D1TransformedGeometry()
|
inlinestatic |
Definition at line 4959 of file geometry.c.
Referenced by d2d_transformed_geometry_AddRef(), d2d_transformed_geometry_FillContainsPoint(), d2d_transformed_geometry_GetBounds(), d2d_transformed_geometry_GetFactory(), d2d_transformed_geometry_GetSourceGeometry(), d2d_transformed_geometry_GetTransform(), d2d_transformed_geometry_Release(), d2d_transformed_geometry_Simplify(), and d2d_transformed_geometry_StrokeContainsPoint().
◆ unsafe_impl_from_ID2D1Geometry()
| struct d2d_geometry * unsafe_impl_from_ID2D1Geometry | ( | ID2D1Geometry * | iface | ) |
Definition at line 5520 of file geometry.c.
5521{
5522 if (!iface)
5531}
Referenced by d2d_device_context_draw_glyph_run_bitmap(), d2d_device_context_draw_glyph_run_outline(), d2d_device_context_DrawGeometry(), d2d_device_context_FillGeometry(), and d2d_transformed_geometry_init().
◆ WINE_DEFAULT_DEBUG_CHANNEL()
| WINE_DEFAULT_DEBUG_CHANNEL | ( | d2d | ) |
Variable Documentation
◆ d2d_ellipse_geometry_vtbl
Initial value:
=
{
}
static void STDMETHODCALLTYPE d2d_ellipse_geometry_GetEllipse(ID2D1EllipseGeometry *iface, D2D1_ELLIPSE *ellipse)
Definition: geometry.c:4154
static ULONG STDMETHODCALLTYPE d2d_ellipse_geometry_Release(ID2D1EllipseGeometry *iface)
Definition: geometry.c:4011
static HRESULT STDMETHODCALLTYPE d2d_ellipse_geometry_ComputeLength(ID2D1EllipseGeometry *iface, const D2D1_MATRIX_3X2_F *transform, float tolerance, float *length)
Definition: geometry.c:4126
static HRESULT STDMETHODCALLTYPE d2d_ellipse_geometry_FillContainsPoint(ID2D1EllipseGeometry *iface, D2D1_POINT_2F point, const D2D1_MATRIX_3X2_F *transform, float tolerance, BOOL *contains)
Definition: geometry.c:4064
static HRESULT STDMETHODCALLTYPE d2d_ellipse_geometry_Tessellate(ID2D1EllipseGeometry *iface, const D2D1_MATRIX_3X2_F *transform, float tolerance, ID2D1TessellationSink *sink)
Definition: geometry.c:4092
static ULONG STDMETHODCALLTYPE d2d_ellipse_geometry_AddRef(ID2D1EllipseGeometry *iface)
Definition: geometry.c:4001
static HRESULT STDMETHODCALLTYPE d2d_ellipse_geometry_ComputePointAtLength(ID2D1EllipseGeometry *iface, float length, const D2D1_MATRIX_3X2_F *transform, float tolerance, D2D1_POINT_2F *point, D2D1_POINT_2F *tangent)
Definition: geometry.c:4134
static HRESULT STDMETHODCALLTYPE d2d_ellipse_geometry_QueryInterface(ID2D1EllipseGeometry *iface, REFIID iid, void **out)
Definition: geometry.c:3980
static HRESULT STDMETHODCALLTYPE d2d_ellipse_geometry_CompareWithGeometry(ID2D1EllipseGeometry *iface, ID2D1Geometry *geometry, const D2D1_MATRIX_3X2_F *transform, float tolerance, D2D1_GEOMETRY_RELATION *relation)
Definition: geometry.c:4073
static void STDMETHODCALLTYPE d2d_ellipse_geometry_GetFactory(ID2D1EllipseGeometry *iface, ID2D1Factory **factory)
Definition: geometry.c:4027
static HRESULT STDMETHODCALLTYPE d2d_ellipse_geometry_Widen(ID2D1EllipseGeometry *iface, float stroke_width, ID2D1StrokeStyle *stroke_style, const D2D1_MATRIX_3X2_F *transform, float tolerance, ID2D1SimplifiedGeometrySink *sink)
Definition: geometry.c:4144
static HRESULT STDMETHODCALLTYPE d2d_ellipse_geometry_Simplify(ID2D1EllipseGeometry *iface, D2D1_GEOMETRY_SIMPLIFICATION_OPTION option, const D2D1_MATRIX_3X2_F *transform, float tolerance, ID2D1SimplifiedGeometrySink *sink)
Definition: geometry.c:4082
static HRESULT STDMETHODCALLTYPE d2d_ellipse_geometry_ComputeArea(ID2D1EllipseGeometry *iface, const D2D1_MATRIX_3X2_F *transform, float tolerance, float *area)
Definition: geometry.c:4118
static HRESULT STDMETHODCALLTYPE d2d_ellipse_geometry_GetWidenedBounds(ID2D1EllipseGeometry *iface, float stroke_width, ID2D1StrokeStyle *stroke_style, const D2D1_MATRIX_3X2_F *transform, float tolerance, D2D1_RECT_F *bounds)
Definition: geometry.c:4044
static HRESULT STDMETHODCALLTYPE d2d_ellipse_geometry_GetBounds(ID2D1EllipseGeometry *iface, const D2D1_MATRIX_3X2_F *transform, D2D1_RECT_F *bounds)
Definition: geometry.c:4036
static HRESULT STDMETHODCALLTYPE d2d_ellipse_geometry_CombineWithGeometry(ID2D1EllipseGeometry *iface, ID2D1Geometry *geometry, D2D1_COMBINE_MODE combine_mode, const D2D1_MATRIX_3X2_F *transform, float tolerance, ID2D1SimplifiedGeometrySink *sink)
Definition: geometry.c:4100
static HRESULT STDMETHODCALLTYPE d2d_ellipse_geometry_StrokeContainsPoint(ID2D1EllipseGeometry *iface, D2D1_POINT_2F point, float stroke_width, ID2D1StrokeStyle *stroke_style, const D2D1_MATRIX_3X2_F *transform, float tolerance, BOOL *contains)
Definition: geometry.c:4054
static HRESULT STDMETHODCALLTYPE d2d_ellipse_geometry_Outline(ID2D1EllipseGeometry *iface, const D2D1_MATRIX_3X2_F *transform, float tolerance, ID2D1SimplifiedGeometrySink *sink)
Definition: geometry.c:4110
Definition at line 4163 of file geometry.c.
Referenced by d2d_ellipse_geometry_init(), and unsafe_impl_from_ID2D1Geometry().
◆ d2d_geometry_group_vtbl
Initial value:
=
{
}
static HRESULT STDMETHODCALLTYPE d2d_geometry_group_GetBounds(ID2D1GeometryGroup *iface, const D2D1_MATRIX_3X2_F *transform, D2D1_RECT_F *bounds)
Definition: geometry.c:5309
static ULONG STDMETHODCALLTYPE d2d_geometry_group_Release(ID2D1GeometryGroup *iface)
Definition: geometry.c:5279
static HRESULT STDMETHODCALLTYPE d2d_geometry_group_ComputeArea(ID2D1GeometryGroup *iface, const D2D1_MATRIX_3X2_F *transform, float tolerance, float *area)
Definition: geometry.c:5406
static HRESULT STDMETHODCALLTYPE d2d_geometry_group_GetWidenedBounds(ID2D1GeometryGroup *iface, float stroke_width, ID2D1StrokeStyle *stroke_style, const D2D1_MATRIX_3X2_F *transform, float tolerance, D2D1_RECT_F *bounds)
Definition: geometry.c:5332
static HRESULT STDMETHODCALLTYPE d2d_geometry_group_FillContainsPoint(ID2D1GeometryGroup *iface, D2D1_POINT_2F point, const D2D1_MATRIX_3X2_F *transform, float tolerance, BOOL *contains)
Definition: geometry.c:5352
static HRESULT STDMETHODCALLTYPE d2d_geometry_group_ComputeLength(ID2D1GeometryGroup *iface, const D2D1_MATRIX_3X2_F *transform, float tolerance, float *length)
Definition: geometry.c:5414
static HRESULT STDMETHODCALLTYPE d2d_geometry_group_CompareWithGeometry(ID2D1GeometryGroup *iface, ID2D1Geometry *geometry, const D2D1_MATRIX_3X2_F *transform, float tolerance, D2D1_GEOMETRY_RELATION *relation)
Definition: geometry.c:5361
static HRESULT STDMETHODCALLTYPE d2d_geometry_group_Tessellate(ID2D1GeometryGroup *iface, const D2D1_MATRIX_3X2_F *transform, float tolerance, ID2D1TessellationSink *sink)
Definition: geometry.c:5380
static HRESULT STDMETHODCALLTYPE d2d_geometry_group_QueryInterface(ID2D1GeometryGroup *iface, REFIID iid, void **out)
Definition: geometry.c:5248
static void STDMETHODCALLTYPE d2d_geometry_group_GetFactory(ID2D1GeometryGroup *iface, ID2D1Factory **factory)
Definition: geometry.c:5299
static HRESULT STDMETHODCALLTYPE d2d_geometry_group_CombineWithGeometry(ID2D1GeometryGroup *iface, ID2D1Geometry *geometry, D2D1_COMBINE_MODE combine_mode, const D2D1_MATRIX_3X2_F *transform, float tolerance, ID2D1SimplifiedGeometrySink *sink)
Definition: geometry.c:5388
static HRESULT STDMETHODCALLTYPE d2d_geometry_group_Widen(ID2D1GeometryGroup *iface, float stroke_width, ID2D1StrokeStyle *stroke_style, const D2D1_MATRIX_3X2_F *transform, float tolerance, ID2D1SimplifiedGeometrySink *sink)
Definition: geometry.c:5432
static UINT32 STDMETHODCALLTYPE d2d_geometry_group_GetSourceGeometryCount(ID2D1GeometryGroup *iface)
Definition: geometry.c:5451
static void STDMETHODCALLTYPE d2d_geometry_group_GetSourceGeometries(ID2D1GeometryGroup *iface, ID2D1Geometry **geometries, UINT32 geometry_count)
Definition: geometry.c:5460
static D2D1_FILL_MODE STDMETHODCALLTYPE d2d_geometry_group_GetFillMode(ID2D1GeometryGroup *iface)
Definition: geometry.c:5442
static HRESULT STDMETHODCALLTYPE d2d_geometry_group_Simplify(ID2D1GeometryGroup *iface, D2D1_GEOMETRY_SIMPLIFICATION_OPTION option, const D2D1_MATRIX_3X2_F *transform, float tolerance, ID2D1SimplifiedGeometrySink *sink)
Definition: geometry.c:5370
static ULONG STDMETHODCALLTYPE d2d_geometry_group_AddRef(ID2D1GeometryGroup *iface)
Definition: geometry.c:5269
static HRESULT STDMETHODCALLTYPE d2d_geometry_group_StrokeContainsPoint(ID2D1GeometryGroup *iface, D2D1_POINT_2F point, float stroke_width, ID2D1StrokeStyle *stroke_style, const D2D1_MATRIX_3X2_F *transform, float tolerance, BOOL *contains)
Definition: geometry.c:5342
static HRESULT STDMETHODCALLTYPE d2d_geometry_group_ComputePointAtLength(ID2D1GeometryGroup *iface, float length, const D2D1_MATRIX_3X2_F *transform, float tolerance, D2D1_POINT_2F *point, D2D1_POINT_2F *tangent)
Definition: geometry.c:5422
static HRESULT STDMETHODCALLTYPE d2d_geometry_group_Outline(ID2D1GeometryGroup *iface, const D2D1_MATRIX_3X2_F *transform, float tolerance, ID2D1SimplifiedGeometrySink *sink)
Definition: geometry.c:5398
Definition at line 5473 of file geometry.c.
Referenced by d2d_geometry_group_init(), and unsafe_impl_from_ID2D1Geometry().
◆ d2d_geometry_sink_vtbl
Initial value:
=
{
}
static HRESULT STDMETHODCALLTYPE d2d_geometry_sink_Close(ID2D1GeometrySink *iface)
Definition: geometry.c:3224
static HRESULT STDMETHODCALLTYPE d2d_geometry_sink_QueryInterface(ID2D1GeometrySink *iface, REFIID iid, void **out)
Definition: geometry.c:2748
static void STDMETHODCALLTYPE d2d_geometry_sink_AddQuadraticBeziers(ID2D1GeometrySink *iface, const D2D1_QUADRATIC_BEZIER_SEGMENT *beziers, UINT32 bezier_count)
Definition: geometry.c:3280
static ULONG STDMETHODCALLTYPE d2d_geometry_sink_AddRef(ID2D1GeometrySink *iface)
Definition: geometry.c:2767
static void STDMETHODCALLTYPE d2d_geometry_sink_SetSegmentFlags(ID2D1GeometrySink *iface, D2D1_PATH_SEGMENT flags)
Definition: geometry.c:2796
static void STDMETHODCALLTYPE d2d_geometry_sink_BeginFigure(ID2D1GeometrySink *iface, D2D1_POINT_2F start_point, D2D1_FIGURE_BEGIN figure_begin)
Definition: geometry.c:2804
static void STDMETHODCALLTYPE d2d_geometry_sink_EndFigure(ID2D1GeometrySink *iface, D2D1_FIGURE_END figure_end)
Definition: geometry.c:2926
static ULONG STDMETHODCALLTYPE d2d_geometry_sink_Release(ID2D1GeometrySink *iface)
Definition: geometry.c:2776
static void STDMETHODCALLTYPE d2d_geometry_sink_AddBezier(ID2D1GeometrySink *iface, const D2D1_BEZIER_SEGMENT *bezier)
Definition: geometry.c:3265
static void STDMETHODCALLTYPE d2d_geometry_sink_AddArc(ID2D1GeometrySink *iface, const D2D1_ARC_SEGMENT *arc)
Definition: geometry.c:3334
static void STDMETHODCALLTYPE d2d_geometry_sink_AddLine(ID2D1GeometrySink *iface, D2D1_POINT_2F point)
Definition: geometry.c:3258
static void STDMETHODCALLTYPE d2d_geometry_sink_SetFillMode(ID2D1GeometrySink *iface, D2D1_FILL_MODE mode)
Definition: geometry.c:2785
static void STDMETHODCALLTYPE d2d_geometry_sink_AddQuadraticBezier(ID2D1GeometrySink *iface, const D2D1_QUADRATIC_BEZIER_SEGMENT *bezier)
Definition: geometry.c:3272
Definition at line 3355 of file geometry.c.
Referenced by d2d_path_geometry_init().
◆ d2d_path_geometry_vtbl
Initial value:
=
{
}
static HRESULT STDMETHODCALLTYPE d2d_path_geometry_Simplify(ID2D1PathGeometry1 *iface, D2D1_GEOMETRY_SIMPLIFICATION_OPTION option, const D2D1_MATRIX_3X2_F *transform, float tolerance, ID2D1SimplifiedGeometrySink *sink)
Definition: geometry.c:3728
static HRESULT STDMETHODCALLTYPE d2d_path_geometry_CompareWithGeometry(ID2D1PathGeometry1 *iface, ID2D1Geometry *geometry, const D2D1_MATRIX_3X2_F *transform, float tolerance, D2D1_GEOMETRY_RELATION *relation)
Definition: geometry.c:3674
static HRESULT STDMETHODCALLTYPE d2d_path_geometry_Tessellate(ID2D1PathGeometry1 *iface, const D2D1_MATRIX_3X2_F *transform, float tolerance, ID2D1TessellationSink *sink)
Definition: geometry.c:3816
static HRESULT STDMETHODCALLTYPE d2d_path_geometry_ComputePointAtLength(ID2D1PathGeometry1 *iface, float length, const D2D1_MATRIX_3X2_F *transform, float tolerance, D2D1_POINT_2F *point, D2D1_POINT_2F *tangent)
Definition: geometry.c:3858
static HRESULT STDMETHODCALLTYPE d2d_path_geometry_QueryInterface(ID2D1PathGeometry1 *iface, REFIID iid, void **out)
Definition: geometry.c:3379
static HRESULT STDMETHODCALLTYPE d2d_path_geometry_StrokeContainsPoint(ID2D1PathGeometry1 *iface, D2D1_POINT_2F point, float stroke_width, ID2D1StrokeStyle *stroke_style, const D2D1_MATRIX_3X2_F *transform, float tolerance, BOOL *contains)
Definition: geometry.c:3566
static ULONG STDMETHODCALLTYPE d2d_path_geometry_Release(ID2D1PathGeometry1 *iface)
Definition: geometry.c:3410
static HRESULT STDMETHODCALLTYPE d2d_path_geometry_ComputeLength(ID2D1PathGeometry1 *iface, const D2D1_MATRIX_3X2_F *transform, float tolerance, float *length)
Definition: geometry.c:3850
static HRESULT STDMETHODCALLTYPE d2d_path_geometry_Stream(ID2D1PathGeometry1 *iface, ID2D1GeometrySink *sink)
Definition: geometry.c:3894
static HRESULT STDMETHODCALLTYPE d2d_path_geometry_CombineWithGeometry(ID2D1PathGeometry1 *iface, ID2D1Geometry *geometry, D2D1_COMBINE_MODE combine_mode, const D2D1_MATRIX_3X2_F *transform, float tolerance, ID2D1SimplifiedGeometrySink *sink)
Definition: geometry.c:3824
static ULONG STDMETHODCALLTYPE d2d_path_geometry_AddRef(ID2D1PathGeometry1 *iface)
Definition: geometry.c:3400
static HRESULT STDMETHODCALLTYPE d2d_path_geometry_GetWidenedBounds(ID2D1PathGeometry1 *iface, float stroke_width, ID2D1StrokeStyle *stroke_style, const D2D1_MATRIX_3X2_F *transform, float tolerance, D2D1_RECT_F *bounds)
Definition: geometry.c:3557
static HRESULT STDMETHODCALLTYPE d2d_path_geometry_GetFigureCount(ID2D1PathGeometry1 *iface, UINT32 *count)
Definition: geometry.c:3915
static HRESULT STDMETHODCALLTYPE d2d_path_geometry_GetSegmentCount(ID2D1PathGeometry1 *iface, UINT32 *count)
Definition: geometry.c:3901
static HRESULT STDMETHODCALLTYPE d2d_path_geometry_GetBounds(ID2D1PathGeometry1 *iface, const D2D1_MATRIX_3X2_F *transform, D2D1_RECT_F *bounds)
Definition: geometry.c:3436
static HRESULT STDMETHODCALLTYPE d2d_path_geometry_Widen(ID2D1PathGeometry1 *iface, float stroke_width, ID2D1StrokeStyle *stroke_style, const D2D1_MATRIX_3X2_F *transform, float tolerance, ID2D1SimplifiedGeometrySink *sink)
Definition: geometry.c:3867
static void STDMETHODCALLTYPE d2d_path_geometry_GetFactory(ID2D1PathGeometry1 *iface, ID2D1Factory **factory)
Definition: geometry.c:3427
static HRESULT STDMETHODCALLTYPE d2d_path_geometry1_ComputePointAndSegmentAtLength(ID2D1PathGeometry1 *iface, float length, UINT32 start_segment, const D2D1_MATRIX_3X2_F *transform, float tolerance, D2D1_POINT_DESCRIPTION *point_desc)
Definition: geometry.c:3929
static HRESULT STDMETHODCALLTYPE d2d_path_geometry_Open(ID2D1PathGeometry1 *iface, ID2D1GeometrySink **sink)
Definition: geometry.c:3877
static HRESULT STDMETHODCALLTYPE d2d_path_geometry_FillContainsPoint(ID2D1PathGeometry1 *iface, D2D1_POINT_2F point, const D2D1_MATRIX_3X2_F *transform, float tolerance, BOOL *contains)
Definition: geometry.c:3651
static HRESULT STDMETHODCALLTYPE d2d_path_geometry_Outline(ID2D1PathGeometry1 *iface, const D2D1_MATRIX_3X2_F *transform, float tolerance, ID2D1SimplifiedGeometrySink *sink)
Definition: geometry.c:3834
static HRESULT STDMETHODCALLTYPE d2d_path_geometry_ComputeArea(ID2D1PathGeometry1 *iface, const D2D1_MATRIX_3X2_F *transform, float tolerance, float *area)
Definition: geometry.c:3842
Definition at line 3939 of file geometry.c.
Referenced by d2d_path_geometry_init(), and unsafe_impl_from_ID2D1Geometry().
◆ d2d_rectangle_geometry_vtbl
Initial value:
=
{
}
static ULONG STDMETHODCALLTYPE d2d_rectangle_geometry_Release(ID2D1RectangleGeometry *iface)
Definition: geometry.c:4283
static HRESULT STDMETHODCALLTYPE d2d_rectangle_geometry_QueryInterface(ID2D1RectangleGeometry *iface, REFIID iid, void **out)
Definition: geometry.c:4252
static HRESULT STDMETHODCALLTYPE d2d_rectangle_geometry_Simplify(ID2D1RectangleGeometry *iface, D2D1_GEOMETRY_SIMPLIFICATION_OPTION option, const D2D1_MATRIX_3X2_F *transform, float tolerance, ID2D1SimplifiedGeometrySink *sink)
Definition: geometry.c:4465
static HRESULT STDMETHODCALLTYPE d2d_rectangle_geometry_ComputePointAtLength(ID2D1RectangleGeometry *iface, float length, const D2D1_MATRIX_3X2_F *transform, float tolerance, D2D1_POINT_2F *point, D2D1_POINT_2F *tangent)
Definition: geometry.c:4540
static HRESULT STDMETHODCALLTYPE d2d_rectangle_geometry_Outline(ID2D1RectangleGeometry *iface, const D2D1_MATRIX_3X2_F *transform, float tolerance, ID2D1SimplifiedGeometrySink *sink)
Definition: geometry.c:4516
static HRESULT STDMETHODCALLTYPE d2d_rectangle_geometry_StrokeContainsPoint(ID2D1RectangleGeometry *iface, D2D1_POINT_2F point, float stroke_width, ID2D1StrokeStyle *stroke_style, const D2D1_MATRIX_3X2_F *transform, float tolerance, BOOL *contains)
Definition: geometry.c:4351
static HRESULT STDMETHODCALLTYPE d2d_rectangle_geometry_ComputeArea(ID2D1RectangleGeometry *iface, const D2D1_MATRIX_3X2_F *transform, float tolerance, float *area)
Definition: geometry.c:4524
static HRESULT STDMETHODCALLTYPE d2d_rectangle_geometry_ComputeLength(ID2D1RectangleGeometry *iface, const D2D1_MATRIX_3X2_F *transform, float tolerance, float *length)
Definition: geometry.c:4532
static HRESULT STDMETHODCALLTYPE d2d_rectangle_geometry_GetWidenedBounds(ID2D1RectangleGeometry *iface, float stroke_width, ID2D1StrokeStyle *stroke_style, const D2D1_MATRIX_3X2_F *transform, float tolerance, D2D1_RECT_F *bounds)
Definition: geometry.c:4341
static void STDMETHODCALLTYPE d2d_rectangle_geometry_GetFactory(ID2D1RectangleGeometry *iface, ID2D1Factory **factory)
Definition: geometry.c:4299
static HRESULT STDMETHODCALLTYPE d2d_rectangle_geometry_Tessellate(ID2D1RectangleGeometry *iface, const D2D1_MATRIX_3X2_F *transform, float tolerance, ID2D1TessellationSink *sink)
Definition: geometry.c:4498
static HRESULT STDMETHODCALLTYPE d2d_rectangle_geometry_CombineWithGeometry(ID2D1RectangleGeometry *iface, ID2D1Geometry *geometry, D2D1_COMBINE_MODE combine_mode, const D2D1_MATRIX_3X2_F *transform, float tolerance, ID2D1SimplifiedGeometrySink *sink)
Definition: geometry.c:4506
static HRESULT STDMETHODCALLTYPE d2d_rectangle_geometry_GetBounds(ID2D1RectangleGeometry *iface, const D2D1_MATRIX_3X2_F *transform, D2D1_RECT_F *bounds)
Definition: geometry.c:4308
static void STDMETHODCALLTYPE d2d_rectangle_geometry_GetRect(ID2D1RectangleGeometry *iface, D2D1_RECT_F *rect)
Definition: geometry.c:4560
static HRESULT STDMETHODCALLTYPE d2d_rectangle_geometry_FillContainsPoint(ID2D1RectangleGeometry *iface, D2D1_POINT_2F point, const D2D1_MATRIX_3X2_F *transform, float tolerance, BOOL *contains)
Definition: geometry.c:4427
static ULONG STDMETHODCALLTYPE d2d_rectangle_geometry_AddRef(ID2D1RectangleGeometry *iface)
Definition: geometry.c:4273
static HRESULT STDMETHODCALLTYPE d2d_rectangle_geometry_Widen(ID2D1RectangleGeometry *iface, float stroke_width, ID2D1StrokeStyle *stroke_style, const D2D1_MATRIX_3X2_F *transform, float tolerance, ID2D1SimplifiedGeometrySink *sink)
Definition: geometry.c:4550
static HRESULT STDMETHODCALLTYPE d2d_rectangle_geometry_CompareWithGeometry(ID2D1RectangleGeometry *iface, ID2D1Geometry *geometry, const D2D1_MATRIX_3X2_F *transform, float tolerance, D2D1_GEOMETRY_RELATION *relation)
Definition: geometry.c:4456
Definition at line 4569 of file geometry.c.
Referenced by d2d_rectangle_geometry_init(), and unsafe_impl_from_ID2D1Geometry().
◆ d2d_rounded_rectangle_geometry_vtbl
Initial value:
=
{
}
static HRESULT STDMETHODCALLTYPE d2d_rounded_rectangle_geometry_StrokeContainsPoint(ID2D1RoundedRectangleGeometry *iface, D2D1_POINT_2F point, float stroke_width, ID2D1StrokeStyle *stroke_style, const D2D1_MATRIX_3X2_F *transform, float tolerance, BOOL *contains)
Definition: geometry.c:4743
static HRESULT STDMETHODCALLTYPE d2d_rounded_rectangle_geometry_FillContainsPoint(ID2D1RoundedRectangleGeometry *iface, D2D1_POINT_2F point, const D2D1_MATRIX_3X2_F *transform, float tolerance, BOOL *contains)
Definition: geometry.c:4753
static void STDMETHODCALLTYPE d2d_rounded_rectangle_geometry_GetFactory(ID2D1RoundedRectangleGeometry *iface, ID2D1Factory **factory)
Definition: geometry.c:4715
static HRESULT STDMETHODCALLTYPE d2d_rounded_rectangle_geometry_CompareWithGeometry(ID2D1RoundedRectangleGeometry *iface, ID2D1Geometry *geometry, const D2D1_MATRIX_3X2_F *transform, float tolerance, D2D1_GEOMETRY_RELATION *relation)
Definition: geometry.c:4762
static HRESULT STDMETHODCALLTYPE d2d_rounded_rectangle_geometry_GetWidenedBounds(ID2D1RoundedRectangleGeometry *iface, float stroke_width, ID2D1StrokeStyle *stroke_style, const D2D1_MATRIX_3X2_F *transform, float tolerance, D2D1_RECT_F *bounds)
Definition: geometry.c:4733
static HRESULT STDMETHODCALLTYPE d2d_rounded_rectangle_geometry_GetBounds(ID2D1RoundedRectangleGeometry *iface, const D2D1_MATRIX_3X2_F *transform, D2D1_RECT_F *bounds)
Definition: geometry.c:4725
static ULONG STDMETHODCALLTYPE d2d_rounded_rectangle_geometry_Release(ID2D1RoundedRectangleGeometry *iface)
Definition: geometry.c:4699
static void STDMETHODCALLTYPE d2d_rounded_rectangle_geometry_GetRoundedRect(ID2D1RoundedRectangleGeometry *iface, D2D1_ROUNDED_RECT *rounded_rect)
Definition: geometry.c:4844
static HRESULT STDMETHODCALLTYPE d2d_rounded_rectangle_geometry_Simplify(ID2D1RoundedRectangleGeometry *iface, D2D1_GEOMETRY_SIMPLIFICATION_OPTION option, const D2D1_MATRIX_3X2_F *transform, float tolerance, ID2D1SimplifiedGeometrySink *sink)
Definition: geometry.c:4772
static ULONG STDMETHODCALLTYPE d2d_rounded_rectangle_geometry_AddRef(ID2D1RoundedRectangleGeometry *iface)
Definition: geometry.c:4689
static HRESULT STDMETHODCALLTYPE d2d_rounded_rectangle_geometry_Tessellate(ID2D1RoundedRectangleGeometry *iface, const D2D1_MATRIX_3X2_F *transform, float tolerance, ID2D1TessellationSink *sink)
Definition: geometry.c:4782
static HRESULT STDMETHODCALLTYPE d2d_rounded_rectangle_geometry_ComputeArea(ID2D1RoundedRectangleGeometry *iface, const D2D1_MATRIX_3X2_F *transform, float tolerance, float *area)
Definition: geometry.c:4808
static HRESULT STDMETHODCALLTYPE d2d_rounded_rectangle_geometry_QueryInterface(ID2D1RoundedRectangleGeometry *iface, REFIID iid, void **out)
Definition: geometry.c:4668
static HRESULT STDMETHODCALLTYPE d2d_rounded_rectangle_geometry_ComputePointAtLength(ID2D1RoundedRectangleGeometry *iface, float length, const D2D1_MATRIX_3X2_F *transform, float tolerance, D2D1_POINT_2F *point, D2D1_POINT_2F *tangent)
Definition: geometry.c:4824
static HRESULT STDMETHODCALLTYPE d2d_rounded_rectangle_geometry_Outline(ID2D1RoundedRectangleGeometry *iface, const D2D1_MATRIX_3X2_F *transform, float tolerance, ID2D1SimplifiedGeometrySink *sink)
Definition: geometry.c:4800
static HRESULT STDMETHODCALLTYPE d2d_rounded_rectangle_geometry_Widen(ID2D1RoundedRectangleGeometry *iface, float stroke_width, ID2D1StrokeStyle *stroke_style, const D2D1_MATRIX_3X2_F *transform, float tolerance, ID2D1SimplifiedGeometrySink *sink)
Definition: geometry.c:4834
static HRESULT STDMETHODCALLTYPE d2d_rounded_rectangle_geometry_ComputeLength(ID2D1RoundedRectangleGeometry *iface, const D2D1_MATRIX_3X2_F *transform, float tolerance, float *length)
Definition: geometry.c:4816
static HRESULT STDMETHODCALLTYPE d2d_rounded_rectangle_geometry_CombineWithGeometry(ID2D1RoundedRectangleGeometry *iface, ID2D1Geometry *geometry, D2D1_COMBINE_MODE combine_mode, const D2D1_MATRIX_3X2_F *transform, float tolerance, ID2D1SimplifiedGeometrySink *sink)
Definition: geometry.c:4790
Definition at line 4854 of file geometry.c.
Referenced by d2d_rounded_rectangle_geometry_init(), and unsafe_impl_from_ID2D1Geometry().
◆ d2d_transformed_geometry_vtbl
Initial value:
=
{
}
static HRESULT STDMETHODCALLTYPE d2d_transformed_geometry_CompareWithGeometry(ID2D1TransformedGeometry *iface, ID2D1Geometry *geometry, const D2D1_MATRIX_3X2_F *transform, float tolerance, D2D1_GEOMETRY_RELATION *relation)
Definition: geometry.c:5095
static void STDMETHODCALLTYPE d2d_transformed_geometry_GetFactory(ID2D1TransformedGeometry *iface, ID2D1Factory **factory)
Definition: geometry.c:5022
static HRESULT STDMETHODCALLTYPE d2d_transformed_geometry_ComputeLength(ID2D1TransformedGeometry *iface, const D2D1_MATRIX_3X2_F *transform, float tolerance, float *length)
Definition: geometry.c:5155
static HRESULT STDMETHODCALLTYPE d2d_transformed_geometry_Tessellate(ID2D1TransformedGeometry *iface, const D2D1_MATRIX_3X2_F *transform, float tolerance, ID2D1TessellationSink *sink)
Definition: geometry.c:5121
static HRESULT STDMETHODCALLTYPE d2d_transformed_geometry_FillContainsPoint(ID2D1TransformedGeometry *iface, D2D1_POINT_2F point, const D2D1_MATRIX_3X2_F *transform, float tolerance, BOOL *contains)
Definition: geometry.c:5079
static HRESULT STDMETHODCALLTYPE d2d_transformed_geometry_Simplify(ID2D1TransformedGeometry *iface, D2D1_GEOMETRY_SIMPLIFICATION_OPTION option, const D2D1_MATRIX_3X2_F *transform, float tolerance, ID2D1SimplifiedGeometrySink *sink)
Definition: geometry.c:5104
static void STDMETHODCALLTYPE d2d_transformed_geometry_GetSourceGeometry(ID2D1TransformedGeometry *iface, ID2D1Geometry **src_geometry)
Definition: geometry.c:5183
static HRESULT STDMETHODCALLTYPE d2d_transformed_geometry_Widen(ID2D1TransformedGeometry *iface, float stroke_width, ID2D1StrokeStyle *stroke_style, const D2D1_MATRIX_3X2_F *transform, float tolerance, ID2D1SimplifiedGeometrySink *sink)
Definition: geometry.c:5173
static HRESULT STDMETHODCALLTYPE d2d_transformed_geometry_ComputeArea(ID2D1TransformedGeometry *iface, const D2D1_MATRIX_3X2_F *transform, float tolerance, float *area)
Definition: geometry.c:5147
static HRESULT STDMETHODCALLTYPE d2d_transformed_geometry_QueryInterface(ID2D1TransformedGeometry *iface, REFIID iid, void **out)
Definition: geometry.c:4964
static ULONG STDMETHODCALLTYPE d2d_transformed_geometry_AddRef(ID2D1TransformedGeometry *iface)
Definition: geometry.c:4985
static HRESULT STDMETHODCALLTYPE d2d_transformed_geometry_CombineWithGeometry(ID2D1TransformedGeometry *iface, ID2D1Geometry *geometry, D2D1_COMBINE_MODE combine_mode, const D2D1_MATRIX_3X2_F *transform, float tolerance, ID2D1SimplifiedGeometrySink *sink)
Definition: geometry.c:5129
static ULONG STDMETHODCALLTYPE d2d_transformed_geometry_Release(ID2D1TransformedGeometry *iface)
Definition: geometry.c:4995
static HRESULT STDMETHODCALLTYPE d2d_transformed_geometry_ComputePointAtLength(ID2D1TransformedGeometry *iface, float length, const D2D1_MATRIX_3X2_F *transform, float tolerance, D2D1_POINT_2F *point, D2D1_POINT_2F *tangent)
Definition: geometry.c:5163
static HRESULT STDMETHODCALLTYPE d2d_transformed_geometry_Outline(ID2D1TransformedGeometry *iface, const D2D1_MATRIX_3X2_F *transform, float tolerance, ID2D1SimplifiedGeometrySink *sink)
Definition: geometry.c:5139
static void STDMETHODCALLTYPE d2d_transformed_geometry_GetTransform(ID2D1TransformedGeometry *iface, D2D1_MATRIX_3X2_F *transform)
Definition: geometry.c:5193
static HRESULT STDMETHODCALLTYPE d2d_transformed_geometry_StrokeContainsPoint(ID2D1TransformedGeometry *iface, D2D1_POINT_2F point, float stroke_width, ID2D1StrokeStyle *stroke_style, const D2D1_MATRIX_3X2_F *transform, float tolerance, BOOL *contains)
Definition: geometry.c:5057
static HRESULT STDMETHODCALLTYPE d2d_transformed_geometry_GetWidenedBounds(ID2D1TransformedGeometry *iface, float stroke_width, ID2D1StrokeStyle *stroke_style, const D2D1_MATRIX_3X2_F *transform, float tolerance, D2D1_RECT_F *bounds)
Definition: geometry.c:5047
static HRESULT STDMETHODCALLTYPE d2d_transformed_geometry_GetBounds(ID2D1TransformedGeometry *iface, const D2D1_MATRIX_3X2_F *transform, D2D1_RECT_F *bounds)
Definition: geometry.c:5032
Definition at line 5203 of file geometry.c.
Referenced by d2d_transformed_geometry_init(), and unsafe_impl_from_ID2D1Geometry().
◆ identity
|
static |
Initial value:
=
{{{
1.0f, 0.0f,
0.0f, 1.0f,
0.0f, 0.0f,
}}}
Definition at line 32 of file geometry.c.
Referenced by d2d_path_geometry_StrokeContainsPoint().
