test/fill-degenerate-sort-order.c

   1 /*
   2  * Copyright © 2006 M Joonas Pihlaja
   3  *
   4  * Permission is hereby granted, free of charge, to any person
   5  * obtaining a copy of this software and associated documentation
   6  * files (the "Software"), to deal in the Software without
   7  * restriction, including without limitation the rights to use, copy,
   8  * modify, merge, publish, distribute, sublicense, and/or sell copies
   9  * of the Software, and to permit persons to whom the Software is
  10  * furnished to do so, subject to the following conditions:
  11  *
  12  * The above copyright notice and this permission notice shall be
  13  * included in all copies or substantial portions of the Software.
  14  *
  15  * THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND,
  16  * EXPRESS OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF
  17  * MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND
  18  * NONINFRINGEMENT. IN NO EVENT SHALL THE AUTHORS OR COPYRIGHT HOLDERS
  19  * BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER LIABILITY, WHETHER IN AN
  20  * ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM, OUT OF OR IN
  21  * CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE
  22  * SOFTWARE.
  23  *
  24  * Author: M Joonas Pihlaja <jpihlaja@cc.helsinki.fi>
  25  */
  26
  27 /* Bug history
  28  *
  29  * 2006-12-05  M Joonas Pihlaja <jpihlaja@cc.helsinki.fi>
  30  *
  31  *   There's currently a regression bug in the tessellation code from
  32  *   switching to the "new tessellator".  The bug is caused by
  33  *   confusion in the comparator used to order events when there are
  34  *   degenerate edges.
  35  */
  36
  37 #include "cairo-test.h"
  38
  39 static cairo_test_draw_function_t draw;
  40
  41 cairo_test_t test = {
  42     "fill-degenerate-sort-order",
  43     "Tests the tessellator's event comparator with degenerate input",
  44     190, 120,
  45     draw
  46 };
  47
  48 /* Derived from zrusin's "another" polygon in the performance suite. */
  49 static cairo_test_status_t
  50 draw (cairo_t *cr, int width, int height)
  51 {
  52     cairo_set_source_rgb (cr, 1, 0, 0);
  53
  54     /* The polygon uses (43,103) as its "base point".  Closed
  55      * subpaths are simulated by going from the base point to the
  56      * subpath's first point, doing the subpath, and returning to the
  57      * base point.  The moving to and from the base point causes
  58      * degenerate edges which shouldn't result in anything visible. */
  59     cairo_move_to (cr, 43, 103);
  60
  61     /* First subpath. */
  62     cairo_line_to (cr, 91, 101);
  63     cairo_line_to (cr, 0, 112);
  64     cairo_line_to (cr, 60, 0);
  65     cairo_line_to (cr, 91, 101);
  66
  67     cairo_line_to (cr, 43, 103);
  68
  69     /* Second subpath. */
  70     cairo_line_to (cr, 176, 110);
  71     cairo_line_to (cr, 116, 100);
  72     cairo_line_to (cr, 176, 0);
  73     cairo_line_to (cr, 176, 110);
  74
  75     cairo_close_path (cr);
  76     cairo_fill (cr);
  77
  78     return CAIRO_TEST_SUCCESS;
  79 }
  80
  81 int
  82 main (void)
  83 {
  84     return cairo_test (&test);
  85 }