src/cpml/cpml-primitive.c

   1 /* CPML - Cairo Path Manipulation Library
   2  * Copyright (C) 2007,2008,2009,2010,2011,2012,2013  Nicola Fontana <ntd at entidi.it>
   3  *
   4  * This library is free software; you can redistribute it and/or
   5  * modify it under the terms of the GNU Lesser General Public
   6  * License as published by the Free Software Foundation; either
   7  * version 2 of the License, or (at your option) any later version.
   8  *
   9  * This library is distributed in the hope that it will be useful,
  10  * but WITHOUT ANY WARRANTY; without even the implied warranty of
  11  * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU
  12  * Lesser General Public License for more details.
  13  *
  14  * You should have received a copy of the GNU Lesser General Public
  15  * License along with this library; if not, write to the
  16  * Free Software Foundation, Inc., 51 Franklin Street, Fifth Floor,
  17  * Boston, MA  02110-1301, USA.
  18  */
  19
  20
  21 /**
  22  * SECTION:cpml-primitive
  23  * @Section_Id:CpmlPrimitive
  24  * @title: CpmlPrimitive
  25  * @short_description: Basic component of segments
  26  *
  27  * A primitive is an atomic geometric element found inside #CpmlSegment.
  28  * The available primitives are the same defined by #cairo_path_data_type_t
  29  * with the additional #CPML_ARC type (check #CpmlPrimitiveType
  30  * for further information) and without #CPML_MOVE as it is not
  31  * considered a primitive and it is managed in different way: the move-to
  32  * primitives are only used to define the origin of a segment.
  33  *
  34  * Since: 1.0
  35  **/
  36
  37 /**
  38  * CpmlPrimitiveType:
  39  * @CPML_MOVE:  equivalent to %CAIRO_PATH_MOVE_TO
  40  * @CPML_LINE:  equivalent to %CAIRO_PATH_LINE_TO
  41  * @CPML_CURVE: equivalent to %CAIRO_PATH_CURVE_TO
  42  * @CPML_CLOSE: equivalent to %CAIRO_PATH_CLOSE_PATH
  43  * @CPML_ARC:   an arc representation at CPML level
  44  *
  45  * This is a type compatible with #cairo_path_data_type_t type. It is
  46  * basically the same enum but it embodies an important difference:
  47  * it can be used to specify the special #CPML_ARC primitive. Having
  48  * two different types is a good way to make clear when a function
  49  * expect or not embedded #CPML_ARC primitives.
  50  *
  51  * Arcs are used extensively in technical drawing: some operations are
  52  * trivials with arcs and a nightmare with cubic Bézier curves. Actually,
  53  * at least up to version 1.10.2, the cairo library does not support arc
  54  * primitives natively and there is no plan they will be ever supported.
  55  *
  56  * The CPML library supports arc natively, converting them to curves
  57  * when the #CpmlSegment is returned to the cairo context, for instance
  58  * when using cpml_segment_to_cairo().
  59  *
  60  * Since: 1.0
  61  **/
  62
  63 /**
  64  * CpmlPrimitive:
  65  * @segment: the source #CpmlSegment
  66  * @org: a pointer to the first point of the primitive
  67  * @data: the array of the path data, prepended by the header
  68  *
  69  * As for #CpmlSegment, also the primitive is unobtrusive. This
  70  * means CpmlPrimitive does not include any coordinates but instead
  71  * keeps pointers to the original segment (and, by transition, to
  72  * the underlying #CpmlPath struct).
  73  *
  74  * Since: 1.0
  75  **/
  76
  77
  78 #include "cpml-internal.h"
  79 #include "cpml-extents.h"
  80 #include "cpml-segment.h"
  81 #include "cpml-primitive.h"
  82 #include "cpml-primitive-private.h"
  83 #include "cpml-arc.h"
  84 #include "cpml-curve.h"
  85 #include <string.h>
  86 #include <stdio.h>
  87
  88
  89 static const _CpmlPrimitiveClass *
  90                 _cpml_class_from_type   (CpmlPrimitiveType        type);
  91 static const _CpmlPrimitiveClass *
  92                 _cpml_class_from_obj    (const CpmlPrimitive     *primitive);
  93 static cairo_path_data_t *
  94                 _cpml_get_point         (const CpmlPrimitive     *primitive,
  95                                          int                      n_point);
  96 static void     _cpml_dump_point        (const cairo_path_data_t *path_data);
  97
  98
  99 /**
 100  * cpml_primitive_type_get_n_points:
 101  * @type: a primitive type
 102  *
 103  * Gets the number of points required to identify the @type primitive.
 104  *
 105  * Returns: the number of points or %0 on errors
 106  *
 107  * Since: 1.0
 108  **/
 109 size_t
 110 cpml_primitive_type_get_n_points(CpmlPrimitiveType type)
 111 {
 112     const _CpmlPrimitiveClass *class_data = _cpml_class_from_type(type);
 113
 114     if (class_data == NULL)
 115         return 0;
 116
 117     return class_data->n_points;
 118 }
 119
 120 /**
 121  * cpml_primitive_from_segment:
 122  * @primitive:             the destination #CpmlPrimitive struct
 123  * @segment: (allow-none): the source segment
 124  *
 125  * Initializes @primitive to the first primitive of @segment.
 126  *
 127  * Since: 1.0
 128  **/
 129 void
 130 cpml_primitive_from_segment(CpmlPrimitive *primitive, CpmlSegment *segment)
 131 {
 132     primitive->segment = segment;
 133
 134     if (segment != NULL) {
 135         /* The first element of a CpmlSegment is always a CPML_MOVE,
 136          * as ensured by cpml_segment_from_cairo() and by the browsing APIs,
 137          * so the origin is in the second data item */
 138         primitive->org = segment->data + 1;
 139
 140         /* Also, the segment APIs ensure that @segment is prepended by
 141          * only one CPML_MOVE */
 142         primitive->data = segment->data + segment->data->header.length;
 143     } else {
 144         primitive->org = NULL;
 145         primitive->data = NULL;
 146     }
 147 }
 148
 149 /**
 150  * cpml_primitive_copy:
 151  * @primitive:         the destination #CpmlPrimitive
 152  * @src: (allow-none): the source #CpmlPrimitive
 153  *
 154  * Copies @src in @primitive. This is a shallow copy: the internal fields
 155  * of @primitive refer to the same memory as the original @src primitive.
 156  *
 157  * Since: 1.0
 158  **/
 159 void
 160 cpml_primitive_copy(CpmlPrimitive *primitive, const CpmlPrimitive *src)
 161 {
 162     if (src != NULL) {
 163         memcpy(primitive, src, sizeof(CpmlPrimitive));
 164     }
 165 }
 166
 167 /**
 168  * cpml_primitive_reset:
 169  * @primitive: a #CpmlPrimitive
 170  *
 171  * Resets @primitive so it refers to the first primitive of the
 172  * source segment.
 173  *
 174  * Since: 1.0
 175  **/
 176 void
 177 cpml_primitive_reset(CpmlPrimitive *primitive)
 178 {
 179     cpml_primitive_from_segment(primitive, primitive->segment);
 180 }
 181
 182 /**
 183  * cpml_primitive_next:
 184  * @primitive: a #CpmlPrimitive
 185  *
 186  * Changes @primitive so it refers to the next primitive on the
 187  * source segment. If there are no more primitives, @primitive is
 188  * not changed and 0 is returned.
 189  *
 190  * Returns: (type boolean): %1 on success, %0 if no next primitive found or errors.
 191  *
 192  * Since: 1.0
 193  **/
 194 int
 195 cpml_primitive_next(CpmlPrimitive *primitive)
 196 {
 197     cairo_path_data_t *new_data;
 198     const cairo_path_data_t *end_data;
 199
 200     new_data = primitive->data + primitive->data->header.length;
 201     end_data = primitive->segment->data + primitive->segment->num_data;
 202
 203     if (new_data >= end_data)
 204         return 0;
 205
 206     primitive->org = _cpml_get_point(primitive, -1);
 207     primitive->data = new_data;
 208
 209     return 1;
 210 }
 211
 212 /**
 213  * cpml_primitive_get_n_points:
 214  * @primitive: a #CpmlPrimitive
 215  *
 216  * Gets the number of points required to identify @primitive.
 217  * It is similar to cpml_primitive_type_get_n_points() but using
 218  * a @primitive instance instead of a type.
 219  *
 220  * Returns: the number of points or %0 on errors.
 221  *
 222  * <!-- Virtual: n_points -->
 223  *
 224  * Since: 1.0
 225  **/
 226 size_t
 227 cpml_primitive_get_n_points(const CpmlPrimitive *primitive)
 228 {
 229     return cpml_primitive_type_get_n_points(primitive->data->header.type);
 230 }
 231
 232 /**
 233  * cpml_primitive_get_length:
 234  * @primitive: a #CpmlPrimitive
 235  *
 236  * Abstracts the length() family functions by providing a common
 237  * way to access the underlying primitive-specific implementation.
 238  * The function returns the length of @primitive.
 239  *
 240  * Returns: the requested length or 0 on errors
 241  *
 242  * <!-- Virtual: get_length -->
 243  *
 244  * Since: 1.0
 245  **/
 246 double
 247 cpml_primitive_get_length(const CpmlPrimitive *primitive)
 248 {
 249     const _CpmlPrimitiveClass *class_data = _cpml_class_from_obj(primitive);
 250
 251     if (class_data == NULL || class_data->get_length == NULL)
 252         return 0;
 253
 254     return class_data->get_length(primitive);
 255 }
 256
 257 /**
 258  * cpml_primitive_put_extents:
 259  * @primitive:                       a #CpmlPrimitive
 260  * @extents: (out caller-allocates): where to store the extents
 261  *
 262  * Abstracts the extents() family functions by providing a common
 263  * way to access the underlying primitive-specific implementation.
 264  *
 265  * This function stores in @extents the bounding box of @primitive.
 266  *
 267  * On errors, that is if the extents cannot be calculated for some
 268  * reason, this function does nothing.
 269  *
 270  * <!-- Virtual: put_extents -->
 271  *
 272  * Since: 1.0
 273  **/
 274 void
 275 cpml_primitive_put_extents(const CpmlPrimitive *primitive,
 276                            CpmlExtents *extents)
 277 {
 278     const _CpmlPrimitiveClass *class_data = _cpml_class_from_obj(primitive);
 279
 280     if (class_data == NULL || class_data->put_extents == NULL)
 281         return;
 282
 283     class_data->put_extents(primitive, extents);
 284 }
 285
 286 /**
 287  * cpml_primitive_set_point:
 288  * @primitive:          a #CpmlPrimitive
 289  * @n_point:            the index of the point to retrieve
 290  * @pair: (allow-none): the source #CpmlPair
 291  *
 292  * Sets the specified @n_point of @primitive to @pair. The @n_point
 293  * index starts from 0: if @n_point is 0, the start point (the origin)
 294  * is changed, 1 for the second point and so on. If @n_point is
 295  * negative, it is considered as a negative index from the end, so
 296  * that -1 is the end point, -2 the point before the end point and
 297  * so on.
 298  *
 299  * #CPML_CLOSE is managed in a special way: if @n_point
 300  * is -1 or 1 and @primitive is a close-path, this function cycles
 301  * the source #CpmlSegment and returns the first point. This is
 302  * needed because requesting the end point (or the second point)
 303  * of a close path is a valid operation and must returns the origin
 304  * of the segment.
 305  *
 306  * Returns: (type gboolean): %1 if the point to be set is existent, %0 otherwise.
 307  *
 308  * Since: 1.0
 309  **/
 310 int
 311 cpml_primitive_set_point(CpmlPrimitive *primitive,
 312                          int n_point, const CpmlPair *pair)
 313 {
 314     cairo_path_data_t *point = _cpml_get_point(primitive, n_point);
 315
 316     if (point == NULL)
 317         return 0;
 318
 319     if (pair != NULL)
 320         cpml_pair_to_cairo(pair, point);
 321
 322     return 1;
 323 }
 324
 325 /**
 326  * cpml_primitive_put_point:
 327  * @primitive:                                 a #CpmlPrimitive
 328  * @n_point:                                   the index of the point to retrieve
 329  * @pair: (out caller-allocates) (allow-none): the destination #CpmlPair
 330  *
 331  * Gets the specified @n_point from @primitive and stores it into
 332  * @pair. The @n_point index is subject to the same rules explained
 333  * in the cpml_primitive_set_point() function.
 334  *
 335  * Returns: (type gboolean): %1 if the point is found, %0 otherwise.
 336  *
 337  * Since: 1.0
 338  **/
 339 int
 340 cpml_primitive_put_point(const CpmlPrimitive *primitive,
 341                          int n_point, CpmlPair *pair)
 342 {
 343     const cairo_path_data_t *point = _cpml_get_point(primitive, n_point);
 344
 345     if (point == NULL)
 346         return 0;
 347
 348     if (pair != NULL)
 349         cpml_pair_from_cairo(pair, point);
 350
 351     return 1;
 352 }
 353
 354 /**
 355  * cpml_primitive_put_pair_at:
 356  * @primitive:                    a #CpmlPrimitive
 357  * @pos:                          the position value
 358  * @pair: (out caller-allocates): the destination #CpmlPair
 359  *
 360  * Abstracts the put_pair_at() family functions by providing a common
 361  * way to access the underlying primitive-specific implementation.
 362  *
 363  * It gets the coordinates of the point lying on @primitive
 364  * at position @pos. @pos is an homogeneous factor where 0 is the
 365  * start point, 1 the end point, 0.5 the mid point and so on.
 366  * @pos can be less than 0 or greater than %1, in which case the
 367  * coordinates of @pair are interpolated.
 368  *
 369  * On errors, that is if the coordinates cannot be calculated for
 370  * some reason, this function does nothing.
 371  *
 372  * <!-- Virtual: put_pair_at -->
 373  *
 374  * Since: 1.0
 375  **/
 376 void
 377 cpml_primitive_put_pair_at(const CpmlPrimitive *primitive,
 378                            double pos, CpmlPair *pair)
 379 {
 380     const _CpmlPrimitiveClass *class_data = _cpml_class_from_obj(primitive);
 381
 382     if (class_data == NULL || class_data->put_pair_at == NULL)
 383         return;
 384
 385     class_data->put_pair_at(primitive, pos, pair);
 386 }
 387
 388 /**
 389  * cpml_primitive_put_vector_at:
 390  * @primitive:                      a #CpmlPrimitive
 391  * @pos:                            the position value
 392  * @vector: (out caller-allocates): the destination #CpmlVector
 393  *
 394  * Abstracts the put_vector_at() family functions by providing a common
 395  * way to access the underlying primitive-specific implementation.
 396  *
 397  * It gets the steepness of the point at position @pos on @primitive.
 398  * @pos is an homogeneous factor where 0 is the start point, 1 the
 399  * end point, 0.5 the mid point and so on.
 400  * @pos can be less than 0 or greater than %1, in which case the
 401  * coordinates of @pair are interpolated.
 402  *
 403  * On errors, that is if the steepness cannot be calculated for
 404  * some reason, this function does nothing.
 405  *
 406  * <!-- Virtual: put_vector_at -->
 407  *
 408  * Since: 1.0
 409  **/
 410 void
 411 cpml_primitive_put_vector_at(const CpmlPrimitive *primitive,
 412                              double pos, CpmlVector *vector)
 413 {
 414     const _CpmlPrimitiveClass *class_data = _cpml_class_from_obj(primitive);
 415
 416     if (class_data == NULL || class_data->put_vector_at == NULL)
 417         return;
 418
 419     class_data->put_vector_at(primitive, pos, vector);
 420 }
 421
 422 /**
 423  * cpml_primitive_get_closest_pos:
 424  * @primitive:          a #CpmlPrimitive
 425  * @pair: (allow-none): the coordinates of the subject point
 426  *
 427  * Returns the pos value of the point on @primitive nearest to @pair.
 428  * The returned value is always clamped between %0 and %1.
 429  *
 430  * Returns: the requested pos value between %0 and %1, or %-1 on errors.
 431  *
 432  * <!-- Virtual: get_closest_pos -->
 433  *
 434  * Since: 1.0
 435  **/
 436 double
 437 cpml_primitive_get_closest_pos(const CpmlPrimitive *primitive,
 438                                const CpmlPair *pair)
 439 {
 440     const _CpmlPrimitiveClass *class_data;
 441
 442     if (pair == NULL)
 443         return -1;
 444
 445     class_data = _cpml_class_from_obj(primitive);
 446     if (class_data == NULL || class_data->get_closest_pos == NULL)
 447         return -1;
 448
 449     return class_data->get_closest_pos(primitive, pair);
 450 }
 451
 452 /**
 453  * cpml_primitive_put_intersections:
 454  * @primitive:                                                       the first #CpmlPrimitive
 455  * @primitive2: (allow-none)                                         the second #CpmlPrimitive
 456  * @n_dest:                                                          maximum number of intersections to return
 457  * @dest: (out caller-allocates) (array length=n_dest) (allow-none): the destination buffer that can contain @n_dest #CpmlPair
 458  *
 459  * Finds the intersection points between the given primitives and
 460  * returns the result in @dest. The size of @dest should be enough
 461  * to store @n_dest #CpmlPair. The maximum number of intersections
 462  * is dependent on the type of the primitive involved in the
 463  * operation. If there are at least one Bézier curve involved, up to
 464  * %4 intersections could be returned. Otherwise, if there is an arc
 465  * the intersections will be %2 at maximum. For line primitives, there
 466  * is only %1 point (or %0 if the lines are parallel).
 467  *
 468  * <note>
 469  * <para>
 470  * The convention used by the CPML library is that a primitive should
 471  * implement only the intersection algorithms with lower degree
 472  * primitives. This is required to avoid code duplication: intersection
 473  * between arc and Bézier curves must be implemented by #CPML_CURVE and
 474  * intersection between lines and arcs must be implemented by #CPML_ARC.
 475  * cpml_primitive_put_intersections() will take care of swapping the
 476  * arguments if they are not properly ordered.
 477  * </para>
 478  * </note>
 479  *
 480  * Returns: the number of intersection points found or 0 if the
 481  *          primitives do not intersect or on errors.
 482  *
 483  * <!-- Virtual: put_intersections -->
 484  *
 485  * Since: 1.0
 486  **/
 487 size_t
 488 cpml_primitive_put_intersections(const CpmlPrimitive *primitive,
 489                                  const CpmlPrimitive *primitive2,
 490                                  size_t n_dest, CpmlPair *dest)
 491 {
 492     const _CpmlPrimitiveClass *class_data;
 493     size_t n_points, n_points2;
 494
 495     if (primitive2 == NULL || dest == NULL)
 496         return 0;
 497
 498     class_data = _cpml_class_from_obj(primitive);
 499     if (class_data == NULL || class_data->put_intersections == NULL)
 500         return 0;
 501
 502     n_points = cpml_primitive_get_n_points(primitive);
 503     n_points2 = cpml_primitive_get_n_points(primitive2);
 504
 505     if (n_points == 0 || n_points2 == 0)
 506         return 0;
 507
 508     /* Primitives reordering: the first must be the more complex one */
 509     if (n_points < n_points2) {
 510         const CpmlPrimitive *old_primitive2 = primitive2;
 511         primitive2 = primitive;
 512         primitive = old_primitive2;
 513     }
 514
 515     return class_data->put_intersections(primitive, primitive2, n_dest, dest);
 516 }
 517
 518 /**
 519  * cpml_primitive_put_intersections_with_segment:
 520  * @primitive:                                                       a #CpmlPrimitive
 521  * @segment: (allow-none):                                           a #CpmlSegment
 522  * @n_dest:                                                          maximum number of intersections to return
 523  * @dest: (out caller-allocates) (array length=n_dest) (allow-none): the destination buffer that can contain @n_dest #CpmlPair
 524  *
 525  * Computes the intersections between @segment and @primitive by
 526  * sequentially scanning the primitives in @segment and looking
 527  * for their intersections with @primitive.
 528  *
 529  * If the intersections are more than @n_dest, only the first
 530  * @n_dest pairs are stored.
 531  *
 532  * Returns: the number of intersection points found or 0 if the
 533  *          items do not intersect or on errors.
 534  *
 535  * Since: 1.0
 536  **/
 537 size_t
 538 cpml_primitive_put_intersections_with_segment(const CpmlPrimitive *primitive,
 539                                               const CpmlSegment *segment,
 540                                               size_t n_dest, CpmlPair *dest)
 541 {
 542     CpmlPrimitive portion;
 543     size_t found;
 544
 545     if (segment == NULL || dest == NULL)
 546         return 0;
 547
 548     cpml_primitive_from_segment(&portion, (CpmlSegment *) segment);
 549     found = 0;
 550
 551     while (found < n_dest) {
 552         found += cpml_primitive_put_intersections(&portion, primitive,
 553                                                   n_dest-found, dest+found);
 554         if (!cpml_primitive_next(&portion))
 555             break;
 556     }
 557
 558     return found;
 559 }
 560
 561 /**
 562  * cpml_primitive_offset:
 563  * @primitive: a #CpmlPrimitive
 564  * @offset:   distance for the computed offset primitive
 565  *
 566  * Given a primitive, computes the same (or approximated) parallel
 567  * primitive distant @offset from the original one and returns
 568  * the result by changing @primitive.
 569  *
 570  * On errors, that is if the offset primitive cannot be calculated
 571  * for some reason, this function does nothing.
 572  *
 573  * <!-- Virtual: offset -->
 574  *
 575  * Since: 1.0
 576  **/
 577 void
 578 cpml_primitive_offset(CpmlPrimitive *primitive, double offset)
 579 {
 580     const _CpmlPrimitiveClass *class_data = _cpml_class_from_obj(primitive);
 581
 582     if (class_data == NULL || class_data->offset == NULL)
 583         return;
 584
 585     class_data->offset(primitive, offset);
 586 }
 587
 588 /**
 589  * cpml_primitive_join:
 590  * @primitive:                           the first #CpmlPrimitive
 591  * @primitive2: (inout) (transfer none): the second #CpmlPrimitive
 592  *
 593  * Joins two primitive modifying the end point of @primitive and the
 594  * start point of @primitive2 so that the resulting points will overlap.
 595  *
 596  * <important>
 597  * <title>TODO</title>
 598  * <itemizedlist>
 599  * <listitem>Actually, the join is done by extending the end vector
 600  *           of @primitive and the start vector of @primitive2 and
 601  *           interpolating the intersection: this means no primitive
 602  *           dependent code is needed. Anyway, it is likely to change
 603  *           in the future because this approach is quite naive when
 604  *           curves are involved.</listitem>
 605  * </itemizedlist>
 606  * </important>
 607  *
 608  * Returns: (type boolean): %1 on success, %0 if the primitives cannot be joint.
 609  *
 610  * <!-- Virtual: join -->
 611  *
 612  * Since: 1.0
 613  **/
 614 int
 615 cpml_primitive_join(CpmlPrimitive *primitive, CpmlPrimitive *primitive2)
 616 {
 617     cairo_path_data_t *end1, *start2;
 618     CpmlPrimitive line1, line2;
 619     cairo_path_data_t data1[2], data2[2];
 620     CpmlPair joint;
 621
 622     end1 = _cpml_get_point(primitive, -1);
 623     start2 = _cpml_get_point(primitive2, 0);
 624
 625     /* Check if the primitives are yet connected */
 626     if (end1->point.x == start2->point.x && end1->point.y == start2->point.y)
 627         return 1;
 628
 629     line1.org = _cpml_get_point(primitive, -2);
 630     line1.data = data1;
 631     data1[0].header.type = CPML_LINE;
 632     data1[1] = *end1;
 633
 634     line2.org = start2;
 635     line2.data = data2;
 636     data2[0].header.type = CPML_LINE;
 637     data2[1] = *_cpml_get_point(primitive2, 1);
 638
 639     if (!cpml_primitive_put_intersections(&line1, &line2, 1, &joint))
 640         return 0;
 641
 642     cpml_pair_to_cairo(&joint, end1);
 643     cpml_pair_to_cairo(&joint, start2);
 644
 645     return 1;
 646 }
 647
 648 /**
 649  * cpml_primitive_to_cairo:
 650  * @primitive:                   a #CpmlPrimitive
 651  * @cr: (inout) (transfer none): the destination cairo context
 652  *
 653  * Renders a single @primitive to the @cr cairo context.
 654  * As a special case, if the primitive is a #CPML_CLOSE, an
 655  * equivalent line is rendered, because a close path left alone
 656  * is not renderable.
 657  *
 658  * Also a #CPML_ARC primitive is treated specially, as it is not
 659  * natively supported by cairo and has its own rendering API.
 660  *
 661  * Since: 1.0
 662  **/
 663 void
 664 cpml_primitive_to_cairo(const CpmlPrimitive *primitive, cairo_t *cr)
 665 {
 666     CpmlPrimitiveType type;
 667     cairo_path_t path;
 668     cairo_path_data_t *path_data;
 669
 670     cairo_move_to(cr, primitive->org->point.x, primitive->org->point.y);
 671
 672     type = primitive->data->header.type;
 673
 674     if (type == CPML_CLOSE) {
 675         path_data = _cpml_get_point(primitive, -1);
 676         cairo_line_to(cr, path_data->point.x, path_data->point.y);
 677     } else if (type == CPML_ARC) {
 678         cpml_arc_to_cairo(primitive, cr);
 679     } else {
 680         path.status = CAIRO_STATUS_SUCCESS;
 681         path.data = primitive->data;
 682         path.num_data = primitive->data->header.length;
 683         cairo_append_path(cr, &path);
 684     }
 685 }
 686
 687 /**
 688  * cpml_primitive_dump:
 689  * @primitive: a #CpmlPrimitive
 690  * @org_also:  whether to output also the origin coordinates
 691  *
 692  * Dumps info on the specified @primitive to stdout: useful for
 693  * debugging purposes. If @org_also is 1, a #CPML_MOVE to the
 694  * origin is prepended to the data otherwise the
 695  * <structfield>org</structfield> field is not used.
 696  *
 697  * Since: 1.0
 698  **/
 699 void
 700 cpml_primitive_dump(const CpmlPrimitive *primitive, int org_also)
 701 {
 702     const cairo_path_data_t *data;
 703     int type;
 704     const _CpmlPrimitiveClass *class_data;
 705     size_t n, n_points;
 706
 707     data = primitive->data;
 708     type = data->header.type;
 709     class_data = _cpml_class_from_type(type);
 710
 711     if (class_data == NULL) {
 712         printf("Unknown primitive type (%d)\n", type);
 713         return;
 714     }
 715
 716     /* Dump the origin, if requested */
 717     if (org_also) {
 718         printf("move to ");
 719         _cpml_dump_point(primitive->org);
 720         printf("\n");
 721     }
 722
 723     printf("%s ", class_data->name);
 724
 725     n_points = cpml_primitive_get_n_points(primitive);
 726     for (n = 1; n < n_points; ++n)
 727         _cpml_dump_point(_cpml_get_point(primitive, n));
 728
 729     printf("\n");
 730 }
 731
 732
 733 static const _CpmlPrimitiveClass *
 734 _cpml_class_from_type(CpmlPrimitiveType type)
 735 {
 736     if (type == CPML_LINE)
 737         return _cpml_line_get_class();
 738     else if (type == CPML_ARC)
 739         return _cpml_arc_get_class();
 740     else if (type == CPML_CURVE)
 741         return _cpml_curve_get_class();
 742     else if (type == CPML_CLOSE)
 743         return _cpml_close_get_class();
 744
 745     return NULL;
 746 }
 747
 748 static const _CpmlPrimitiveClass *
 749 _cpml_class_from_obj(const CpmlPrimitive *primitive)
 750 {
 751     return _cpml_class_from_type(primitive->data->header.type);
 752 }
 753
 754 /*
 755  * _cpml_get_point:
 756  * @primitive: a #CpmlPrimitive
 757  * @n_point:   the index of the point to retrieve
 758  *
 759  * Gets the specified @n_point from @primitive. The index starts
 760  * at 0: if @n_point is 0, the start point (the origin) is
 761  * returned, 1 for the second point and so on. If @n_point is
 762  * negative, it is considered as a negative index from the end,
 763  * so that -1 is the end point, -2 the point before the end point
 764  * and so on.
 765  *
 766  * #CPML_CLOSE is managed in a special way: if @n_point
 767  * is -1 or 1 and @primitive is a close-path, this function cycles
 768  * the source #CpmlSegment and returns the first point. This is
 769  * needed because requesting the end point (or the second point)
 770  * of a close path is a valid operation and must returns the start
 771  * of the segment.
 772  *
 773  * Returns: a pointer to the requested point (in cairo format)
 774  *          or %NULL if the point is outside the valid range
 775  *
 776  * Since: 1.0
 777  **/
 778 static cairo_path_data_t *
 779 _cpml_get_point(const CpmlPrimitive *primitive, int n_point)
 780 {
 781     size_t n_points;
 782
 783     /* For a start point request, simply return the origin
 784      * without further checking */
 785     if (n_point == 0)
 786         return primitive->org;
 787
 788     /* The CPML_CLOSE special case */
 789     if (primitive->data->header.type == CAIRO_PATH_CLOSE_PATH &&
 790         (n_point == 1 || n_point == -1))
 791         return &primitive->segment->data[1];
 792
 793     n_points = cpml_primitive_get_n_points(primitive);
 794     if (n_points == 0)
 795         return NULL;
 796
 797     /* If n_point is negative, consider it as a negative index from the end */
 798     if (n_point < 0)
 799         n_point = n_points + n_point;
 800
 801     /* Out of range condition */
 802     if (n_point < 0 || n_point >= n_points)
 803         return NULL;
 804
 805     return n_point == 0 ? primitive->org : &primitive->data[n_point];
 806 }
 807
 808 static void
 809 _cpml_dump_point(const cairo_path_data_t *path_data)
 810 {
 811     printf("(%g %g) ", path_data->point.x, path_data->point.y);
 812 }