src/cpml/cpml-segment.c

   1 /* CPML - Cairo Path Manipulation Library
   2  * Copyright (C) 2007-2015  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-segment
  23  * @Section_Id:Segment
  24  * @title: CpmlSegment
  25  * @short_description: Contiguous segment that can be a fragment
  26  *                     or a whole cairo path
  27  *
  28  * A segment is a single contiguous line got from a cairo path. The
  29  * CPML library relies on one assumption to let the data be independent
  30  * from the current point (and thus from the cairo context): any segment
  31  * MUST be preceded by at least one %CPML_MOVE primitive.
  32  * This means a valid segment in cairo could be rejected by CPML.
  33  *
  34  * #CpmlSegment provides an unobtrusive way to access a cairo path.
  35  * This means #CpmlSegment itsself does not hold any coordinates but
  36  * instead a bunch of pointers to the original #cairo_path_t struct:
  37  * modifying data throught this struct also changes the original path.
  38  *
  39  * Every #cairo_path_t struct can contain more than one segment: the CPML
  40  * library provides iteration APIs to browse the segments of a path.
  41  * Use cpml_segment_reset() to reset the iterator at the start of the
  42  * cairo path (will point the first segment) and cpml_segment_next()
  43  * to get the next segment. Getting the previous segment is not provided
  44  * as the underlying cairo struct is not accessible in reverse order.
  45  *
  46  * When initialized, #CpmlSegment yet refers to the first segment so
  47  * the initial reset is not required.
  48  *
  49  * Since: 1.0
  50  **/
  51
  52 /**
  53  * CpmlSegment:
  54  * @path:     the source #cairo_path_t struct
  55  * @data:     the data points of the segment; the first primitive
  56  *            will always be a %CPML_MOVE
  57  * @num_data: size of @data
  58  *
  59  * This is an unobtrusive struct to identify a segment inside a
  60  * cairo path. Unobtrusive means that the real coordinates are
  61  * still stored in @path: CpmlSegment only provides a way to
  62  * access them.
  63  *
  64  * Since: 1.0
  65  **/
  66
  67
  68 #include "cpml-internal.h"
  69 #include "cpml-extents.h"
  70 #include "cpml-segment.h"
  71 #include "cpml-primitive.h"
  72 #include "cpml-curve.h"
  73 #include <stdio.h>
  74 #include <string.h>
  75
  76 static int              normalize               (CpmlSegment       *segment);
  77 static int              ensure_one_leading_move (CpmlSegment       *segment);
  78 static int              reshape                 (CpmlSegment       *segment);
  79
  80
  81 /**
  82  * cpml_segment_from_cairo:
  83  * @segment: a #CpmlSegment
  84  * @path: (type gpointer): the source #cairo_path_t
  85  *
  86  * Builds a CpmlSegment from a #cairo_path_t structure. This operation
  87  * involves stripping the duplicate %CPML_MOVE primitives at the
  88  * start of the path and setting <structfield>num_data</structfield>
  89  * field to the end of the contiguous line, that is when another
  90  * %CPML_MOVE primitive is found or at the end of the path.
  91  * A pointer to the source cairo path is kept though.
  92  *
  93  * This function will fail if @path is null, empty or if its
  94  * <structfield>status</structfield> member is not %CAIRO_STATUS_SUCCESS.
  95  * Also, the first primitive must be a %CPML_MOVE, so no
  96  * dependency on the cairo context is needed.
  97  *
  98  * Returns: (type gboolean): 1 if @segment has been succesfully computed, 0 on errors.
  99  *
 100  * Since: 1.0
 101  **/
 102 int
 103 cpml_segment_from_cairo(CpmlSegment *segment, cairo_path_t *path)
 104 {
 105     /* segment and  path must be non-NULL and path must be valid */
 106     if (path == NULL || segment == NULL ||
 107         path->num_data == 0 || path->status != CAIRO_STATUS_SUCCESS)
 108         return 0;
 109
 110     segment->path = path;
 111     segment->data = path->data;
 112     segment->num_data = path->num_data;
 113
 114     return normalize(segment);
 115 }
 116
 117 /**
 118  * cpml_segment_copy:
 119  * @segment: a #CpmlSegment
 120  * @src: the source segment to copy
 121  *
 122  * Makes a shallow copy of @src into @segment.
 123  *
 124  * Since: 1.0
 125  **/
 126 void
 127 cpml_segment_copy(CpmlSegment *segment, const CpmlSegment *src)
 128 {
 129     memcpy(segment, src, sizeof(CpmlSegment));
 130 }
 131
 132 /**
 133  * cpml_segment_reset:
 134  * @segment: a #CpmlSegment
 135  *
 136  * Modifies @segment to point to the first segment of the source cairo path.
 137  *
 138  * Since: 1.0
 139  **/
 140 void
 141 cpml_segment_reset(CpmlSegment *segment)
 142 {
 143     segment->data = segment->path->data;
 144     segment->num_data = segment->path->num_data;
 145     normalize(segment);
 146 }
 147
 148 /**
 149  * cpml_segment_next:
 150  * @segment: a #CpmlSegment
 151  *
 152  * Modifies @segment to point to the next segment of the source cairo path.
 153  *
 154  * Returns: (type gboolean): 1 on success, 0 if no next segment found or errors.
 155  *
 156  * Since: 1.0
 157  **/
 158 int
 159 cpml_segment_next(CpmlSegment *segment)
 160 {
 161     cairo_path_data_t *new_data;
 162     const cairo_path_data_t *end_data;
 163
 164     new_data = segment->data + segment->num_data;
 165     end_data = segment->path->data + segment->path->num_data;
 166
 167     if (new_data >= end_data)
 168         return 0;
 169
 170     segment->data = new_data;
 171     segment->num_data = end_data - new_data;
 172
 173     return normalize(segment);
 174 }
 175
 176 /**
 177  * cpml_segment_get_length:
 178  * @segment: a #CpmlSegment
 179  *
 180  * Gets the whole length of @segment.
 181  *
 182  * Returns: the requested length
 183  *
 184  * Since: 1.0
 185  **/
 186 double
 187 cpml_segment_get_length(const CpmlSegment *segment)
 188 {
 189     CpmlPrimitive primitive;
 190     double length;
 191
 192     if (segment == NULL)
 193         return 0;
 194
 195     cpml_primitive_from_segment(&primitive, (CpmlSegment *) segment);
 196     length = 0;
 197
 198     do {
 199         length += cpml_primitive_get_length(&primitive);
 200     } while (cpml_primitive_next(&primitive));
 201
 202     return length;
 203 }
 204
 205 /**
 206  * cpml_segment_put_extents:
 207  * @segment: a #CpmlSegment
 208  * @extents: where to store the extents
 209  *
 210  * Gets the whole extents of @segment.
 211  *
 212  * Since: 1.0
 213  **/
 214 void
 215 cpml_segment_put_extents(const CpmlSegment *segment, CpmlExtents *extents)
 216 {
 217     CpmlPrimitive primitive;
 218     CpmlExtents primitive_extents;
 219
 220     extents->is_defined = 0;
 221
 222     cpml_primitive_from_segment(&primitive, (CpmlSegment *) segment);
 223
 224     do {
 225         cpml_primitive_put_extents(&primitive, &primitive_extents);
 226         cpml_extents_add(extents, &primitive_extents);
 227     } while (cpml_primitive_next(&primitive));
 228 }
 229
 230 /**
 231  * cpml_segment_put_pair_at:
 232  * @segment: a #CpmlSegment
 233  * @pos:     the position value
 234  * @pair:    the destination #CpmlPair
 235  *
 236  * Gets the coordinates of the point lying on @segment at position
 237  * @pos. @pos is an homogeneous factor where 0 is the start point,
 238  * 1 the end point, 0.5 the mid point and so on.
 239  * The relation <constant>0 < @pos < 1</constant> should be satisfied,
 240  * although some cases accept value outside this range.
 241  *
 242  * <important>
 243  * <title>TODO</title>
 244  * <itemizedlist>
 245  * <listitem>The actual implementation returns only the start and end points,
 246  *           that is only when @pos is 0 or 1.</listitem>
 247  * </itemizedlist>
 248  * </important>
 249  *
 250  * Since: 1.0
 251  **/
 252 void
 253 cpml_segment_put_pair_at(const CpmlSegment *segment, double pos,
 254                          CpmlPair *pair)
 255 {
 256     CpmlPrimitive primitive;
 257
 258     cpml_primitive_from_segment(&primitive, (CpmlSegment *) segment);
 259
 260     /* Handle the common cases: start and end points */
 261     if (pos == 0) {
 262         cpml_primitive_put_pair_at(&primitive, 0, pair);
 263     } if (pos == 1) {
 264         while (cpml_primitive_next(&primitive))
 265             ;
 266         cpml_primitive_put_pair_at(&primitive, 1, pair);
 267     }
 268 }
 269
 270 /**
 271  * cpml_segment_put_vector_at:
 272  * @segment: a #CpmlSegment
 273  * @pos:     the position value
 274  * @vector:  the destination #CpmlVector
 275  *
 276  * Gets the steepness of the point lying on @segment at position
 277  * @pos. @pos is an homogeneous factor where 0 is the start point,
 278  * 1 the end point, 0.5 the mid point and so on.
 279  * The relation <constant>0 < @pos < 1</constant> should be satisfied,
 280  * although some cases accept value outside this range.
 281  *
 282  * <important>
 283  * <title>TODO</title>
 284  * <itemizedlist>
 285  * <listitem>The actual implementation returns only the start and end
 286  *           steepness, that is only when @pos is 0 or 1.</listitem>
 287  * </itemizedlist>
 288  * </important>
 289  *
 290  * Since: 1.0
 291  **/
 292 void
 293 cpml_segment_put_vector_at(const CpmlSegment *segment, double pos,
 294                            CpmlVector *vector)
 295 {
 296     CpmlPrimitive primitive;
 297
 298     cpml_primitive_from_segment(&primitive, (CpmlSegment *) segment);
 299
 300     /* Handle the common cases: start and end points */
 301     if (pos == 0) {
 302         cpml_primitive_put_vector_at(&primitive, 0, vector);
 303         return;
 304     }
 305
 306     if (pos == 1) {
 307         while (cpml_primitive_next(&primitive))
 308             ;
 309         cpml_primitive_put_vector_at(&primitive, 1, vector);
 310         return;
 311     }
 312 }
 313
 314 /**
 315  * cpml_segment_put_intersections:
 316  * @segment:  the first #CpmlSegment
 317  * @segment2: the second #CpmlSegment
 318  * @n_dest:   maximum number of intersections to return
 319  * @dest:     the destination vector of #CpmlPair
 320  *
 321  * Computes the intersections between @segment and @segment2 and
 322  * returns the found points in @dest. If the intersections are more
 323  * than @n_dest, only the first @n_dest pairs are stored in @dest.
 324  *
 325  * To get the job done, the primitives of @segment are sequentially
 326  * scanned for intersections with any primitive in @segment2. This
 327  * means @segment has a higher precedence over @segment2.
 328  *
 329  * Returns: the number of intersections found
 330  *
 331  * Since: 1.0
 332  **/
 333 size_t
 334 cpml_segment_put_intersections(const CpmlSegment *segment,
 335                                const CpmlSegment *segment2,
 336                                size_t n_dest, CpmlPair *dest)
 337 {
 338     CpmlPrimitive portion;
 339     size_t partial, total;
 340
 341     cpml_primitive_from_segment(&portion, (CpmlSegment *) segment);
 342     total = 0;
 343
 344     do {
 345         partial = cpml_primitive_put_intersections_with_segment(&portion,
 346                                                                 segment2,
 347                                                                 n_dest - total,
 348                                                                 dest + total);
 349         total += partial;
 350     } while (total < n_dest && cpml_primitive_next(&portion));
 351
 352     return total;
 353 }
 354
 355 /**
 356  * cpml_segment_offset:
 357  * @segment: a #CpmlSegment
 358  * @offset: the offset distance
 359  *
 360  * Offsets a segment of the specified amount, that is builds a "parallel"
 361  * segment at the @offset distance from the original one and returns the
 362  * result by replacing the original @segment.
 363  *
 364  * <important>
 365  * <title>TODO</title>
 366  * <itemizedlist>
 367  * <listitem>Closed path are not yet managed: an elegant solution is not
 368  *           so obvious: use <function>cpml_close_offset</function> when
 369  *           will be available.</listitem>
 370  * <listitem>Degenerated primitives, such as lines of length 0, are not
 371  *           managed properly.</listitem>
 372  * </itemizedlist>
 373  * </important>
 374  *
 375  * Since: 1.0
 376  **/
 377 void
 378 cpml_segment_offset(CpmlSegment *segment, double offset)
 379 {
 380     CpmlPrimitive primitive;
 381     CpmlPrimitive last_primitive;
 382     CpmlPair old_end;
 383     cairo_path_data_t org, *old_org;
 384     int first_cycle;
 385
 386     cpml_primitive_from_segment(&primitive, segment);
 387     first_cycle = 1;
 388
 389     do {
 390         if (! first_cycle) {
 391             cpml_pair_to_cairo(&old_end, &org);
 392             old_org = primitive.org;
 393             primitive.org = &org;
 394         }
 395
 396         cpml_primitive_put_point(&primitive, -1, &old_end);
 397         cpml_primitive_offset(&primitive, offset);
 398
 399         if (! first_cycle) {
 400             cpml_primitive_join(&last_primitive, &primitive);
 401             primitive.org = old_org;
 402         }
 403
 404         cpml_primitive_copy(&last_primitive, &primitive);
 405         first_cycle = 0;
 406     } while (cpml_primitive_next(&primitive));
 407 }
 408
 409 /**
 410  * cpml_segment_transform:
 411  * @segment: a #CpmlSegment
 412  * @matrix: the matrix to be applied
 413  *
 414  * Applies @matrix on all the points of @segment.
 415  *
 416  * Since: 1.0
 417  **/
 418 void
 419 cpml_segment_transform(CpmlSegment *segment, const cairo_matrix_t *matrix)
 420 {
 421     CpmlPrimitive primitive;
 422     cairo_path_data_t *data;
 423     size_t n_points;
 424
 425     cpml_primitive_from_segment(&primitive, segment);
 426     cairo_matrix_transform_point(matrix, &(primitive.org)->point.x,
 427                                  &(primitive.org)->point.y);
 428
 429     do {
 430         data = primitive.data;
 431         if (data->header.type != CAIRO_PATH_CLOSE_PATH) {
 432             n_points = cpml_primitive_get_n_points(&primitive);
 433
 434             while (--n_points > 0) {
 435                 ++data;
 436                 cairo_matrix_transform_point(matrix,
 437                                              &data->point.x, &data->point.y);
 438             }
 439         }
 440     } while (cpml_primitive_next(&primitive));
 441 }
 442
 443 /**
 444  * cpml_segment_reverse:
 445  * @segment: a #CpmlSegment
 446  *
 447  * Reverses @segment in-place. The resulting rendering will be the same,
 448  * but with the primitives generated in reverse order.
 449  *
 450  * It is assumed that @segment has yet been sanitized, that is returned
 451  * by some CPML API function or it is a path yet conforming to the
 452  * segment rules described by the cpml_segment_from_cairo() function.
 453  *
 454  * Since: 1.0
 455  **/
 456 void
 457 cpml_segment_reverse(CpmlSegment *segment)
 458 {
 459     cairo_path_data_t *data, *dst_data;
 460     size_t data_size;
 461     double end_x, end_y;
 462     int n, length;
 463     size_t n_points, n_point;
 464     const cairo_path_data_t *src_data;
 465
 466     data_size = sizeof(cairo_path_data_t) * segment->num_data;
 467     data = malloc(data_size);
 468     end_x = segment->data[1].point.x;
 469     end_y = segment->data[1].point.y;
 470
 471     n = segment->data->header.length;
 472     data->header.type = CAIRO_PATH_CLOSE_PATH;
 473     data->header.length = n;
 474
 475     while (n < segment->num_data) {
 476         src_data = segment->data + n;
 477         n_points = cpml_primitive_type_get_n_points(src_data->header.type);
 478         length = src_data->header.length;
 479         n += length;
 480         dst_data = data + segment->num_data - n + data->header.length;
 481         dst_data->header.type = src_data->header.type;
 482         dst_data->header.length = length;
 483
 484         for (n_point = 1; n_point < n_points; ++n_point) {
 485             dst_data[n_points - n_point].point.x = end_x;
 486             dst_data[n_points - n_point].point.y = end_y;
 487             end_x = src_data[n_point].point.x;
 488             end_y = src_data[n_point].point.y;
 489         }
 490
 491         /* Copy also the embedded data, if any */
 492         if (n_points < length) {
 493             size_t size = (length - n_points) * sizeof(cairo_path_data_t);
 494             memcpy(dst_data + n_points, src_data + n_points, size);
 495         }
 496     }
 497
 498     data[1].point.x = end_x;
 499     data[1].point.y = end_y;
 500     memcpy(segment->data, data, data_size);
 501
 502     free(data);
 503 }
 504
 505 /**
 506  * cpml_segment_to_cairo:
 507  * @segment: a #CpmlSegment
 508  * @cr: the destination cairo context
 509  *
 510  * Appends the path of @segment to @cr. The segment is "flattened",
 511  * that is %CPML_ARC primitives are approximated by one or more
 512  * %CPML_CURVE using cpml_arc_to_cairo(). Check its documentation
 513  * for further details.
 514  *
 515  * Since: 1.0
 516  **/
 517 void
 518 cpml_segment_to_cairo(const CpmlSegment *segment, cairo_t *cr)
 519 {
 520     CpmlPrimitive primitive;
 521
 522     if (segment == NULL || cr == NULL)
 523         return;
 524
 525     cpml_primitive_from_segment(&primitive, (CpmlSegment *) segment);
 526
 527     do {
 528         cpml_primitive_to_cairo(&primitive, cr);
 529     } while (cpml_primitive_next(&primitive));
 530 }
 531
 532 /**
 533  * cpml_segment_dump:
 534  * @segment: a #CpmlSegment
 535  *
 536  * Dumps the specified @segment to stdout. Useful for debugging purposes.
 537  *
 538  * Since: 1.0
 539  **/
 540 void
 541 cpml_segment_dump(const CpmlSegment *segment)
 542 {
 543     CpmlPrimitive primitive;
 544     int first_call;
 545
 546     if (segment == NULL) {
 547         printf("NULL segment\n");
 548         return;
 549     }
 550
 551     cpml_primitive_from_segment(&primitive, (CpmlSegment *) segment);
 552
 553     first_call = 1;
 554     do {
 555         cpml_primitive_dump(&primitive, first_call);
 556         first_call = 0;
 557     } while (cpml_primitive_next(&primitive));
 558 }
 559
 560
 561 /*
 562  * normalize:
 563  * @segment: a #CpmlSegment
 564  *
 565  * Sanitizes @segment by calling ensure_one_leading_move() and reshape().
 566  *
 567  * Returns: 1 on success, 0 on no leading MOVE_TOs or on errors.
 568  **/
 569 static int
 570 normalize(CpmlSegment *segment)
 571 {
 572     if (!ensure_one_leading_move(segment))
 573         return 0;
 574
 575     return reshape(segment);
 576 }
 577
 578 /*
 579  * ensure_one_leading_move:
 580  * @segment: a #CpmlSegment
 581  *
 582  * Strips the leading %CPML_MOVE primitives, updating the
 583  * <structname>CpmlSegment</structname> structure accordingly.
 584  * One, and only one, %CPML_MOVE primitive is left.
 585  *
 586  * Returns: 1 on success, 0 on no leading MOVE_TOs or on empty path
 587  **/
 588 static int
 589 ensure_one_leading_move(CpmlSegment *segment)
 590 {
 591     cairo_path_data_t *new_data;
 592     int new_num_data, move_length;
 593
 594     /* Check for at least one move to */
 595     if (segment->data->header.type != CAIRO_PATH_MOVE_TO)
 596         return 0;
 597
 598     new_data = segment->data;
 599     new_num_data = segment->num_data;
 600
 601     while (1) {
 602         move_length = new_data->header.length;
 603
 604         /* Check for the end of cairo path data, that is when
 605          * @segment is composed by only CAIRO_PATH_MOVE_TO */
 606         if (new_num_data <= move_length)
 607             return 0;
 608
 609         /* Check if this is the last CAIRO_PATH_MOVE_TO */
 610         if (new_data[move_length].header.type != CAIRO_PATH_MOVE_TO)
 611             break;
 612
 613         new_data += move_length;
 614         new_num_data -= move_length;
 615     }
 616
 617     segment->data = new_data;
 618     segment->num_data = new_num_data;
 619
 620     return 1;
 621 }
 622
 623 /*
 624  * reshape:
 625  * @segment: a #CpmlSegment
 626  *
 627  * Looks for the segment termination, that is the end of the underlying
 628  * cairo path or a %CPML_MOVE operation. <structfield>num_data</structfield>
 629  * field is modified to properly point to the end of @segment.
 630  * @segment must have only one leading %CPML_MOVE and it is supposed
 631  * to be non-empty, conditions yet imposed by the ensure_one_leading_move().
 632  *
 633  * This function also checks that all the components of @segment
 634  * are valid primitives.
 635  *
 636  * Returns: 1 on success, 0 on invalid primitive found.
 637  **/
 638 static int
 639 reshape(CpmlSegment *segment)
 640 {
 641     const cairo_path_data_t *data;
 642     int trailing_data, new_num_data, length;
 643
 644     data = segment->data;
 645     new_num_data = 0;
 646     trailing_data = segment->num_data;
 647
 648     while (1) {
 649         length = data->header.length;
 650         new_num_data += length;
 651         trailing_data -= length;
 652         data += length;
 653
 654         /* Check for invalid data size */
 655         if (trailing_data < 0)
 656             return 0;
 657
 658         if (trailing_data == 0 || data->header.type == CAIRO_PATH_MOVE_TO)
 659             break;
 660
 661         /* Ensure that all the components are valid primitives */
 662         if (cpml_primitive_type_get_n_points(data->header.type) == 0)
 663             return 0;
 664     }
 665
 666     segment->num_data = new_num_data;
 667     return 1;
 668 }