random-intersections-nonzero.c 2.4 KB

12345678910111213141516171819202122232425262728293031323334353637383940414243444546474849505152535455565758596061626364656667686970717273747576777879
  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. #include "cairo-test.h"
  27. #define SIZE 512
  28. #define NUM_SEGMENTS 128
  29. static uint32_t state;
  30. static double
  31. uniform_random (double minval, double maxval)
  32. {
  33. static uint32_t const poly = 0x9a795537U;
  34. uint32_t n = 32;
  35. while (n-->0)
  36. state = 2*state < state ? (2*state ^ poly) : 2*state;
  37. return minval + state * (maxval - minval) / 4294967296.0;
  38. }
  39. static cairo_test_status_t
  40. draw (cairo_t *cr, int width, int height)
  41. {
  42. int i;
  43. cairo_set_source_rgb (cr, 0, 0, 0);
  44. cairo_paint (cr);
  45. state = 0x12345678;
  46. cairo_translate (cr, 1, 1);
  47. cairo_set_fill_rule (cr, CAIRO_FILL_RULE_WINDING);
  48. cairo_move_to (cr, 0, 0);
  49. for (i = 0; i < NUM_SEGMENTS; i++) {
  50. double x = uniform_random (0, width);
  51. double y = uniform_random (0, height);
  52. cairo_line_to (cr, x, y);
  53. }
  54. cairo_close_path (cr);
  55. cairo_set_source_rgb (cr, 1, 0, 0);
  56. cairo_fill_preserve (cr);
  57. cairo_set_source_rgb (cr, 0, 1, 0);
  58. cairo_set_line_width (cr, 0.5);
  59. cairo_stroke (cr);
  60. return CAIRO_TEST_SUCCESS;
  61. }
  62. CAIRO_TEST (random_intersections_nonzero,
  63. "Tests the tessellator trapezoid generation and intersection computation",
  64. "trap", /* keywords */
  65. NULL, /* requirements */
  66. SIZE+3, SIZE+3,
  67. NULL, draw)