Grcov report - random-intersections-curves-nz.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

#include "cairo-test.h"

27

28

#define SIZE 512

29

#define NUM_SEGMENTS 128

30

31

static uint32_t state;

32

33

static double

34

2304

uniform_random (double minval, double maxval)

35

36

    static uint32_t const poly = 0x9a795537U;

37

2304

    uint32_t n = 32;

38

76032

    while (n-->0)

39

73728

	state = 2*state < state ? (2*state ^ poly) : 2*state;

40

2304

    return minval + state * (maxval - minval) / 4294967296.0;

41

42

43

static cairo_test_status_t

44

3

draw (cairo_t *cr, int width, int height)

45

46

    int i;

47

48

3

    cairo_set_source_rgb (cr, 0, 0, 0);

49

3

    cairo_paint (cr);

50

51

3

    state = 0x12345678;

52

3

    cairo_translate (cr, 1, 1);

53

3

    cairo_set_fill_rule (cr, CAIRO_FILL_RULE_WINDING);

54

55

3

    cairo_move_to (cr, 0, 0);

56

387

    for (i = 0; i < NUM_SEGMENTS; i++) {

57

384

        double y3 = uniform_random (0, SIZE);

58

384

        double x3 = uniform_random (0, SIZE);

59

384

        double y2 = uniform_random (-SIZE, SIZE);

60

384

        double x2 = uniform_random (-SIZE, SIZE);

61

384

        double y1 = uniform_random (-SIZE, SIZE);

62

384

        double x1 = uniform_random (-SIZE, SIZE);

63

384

        cairo_curve_to (cr,

64

                        x1, y1,

65

                        x2, y2,

66

                        x3, y3);

67

68

3

    cairo_close_path (cr);

69

70

3

    cairo_set_source_rgb (cr, 1, 0, 0);

71

3

    cairo_fill_preserve (cr);

72

3

    cairo_set_source_rgb (cr, 0, 1, 0);

73

3

    cairo_set_line_width (cr, 0.5);

74

3

    cairo_stroke (cr);

75

76

3

    return CAIRO_TEST_SUCCESS;

77

78

79

1

CAIRO_TEST (random_intersections_curves_nz,

80

	    "Tests the tessellator trapezoid generation and intersection computation",

81

	    "trap", /* keywords */

82

	    NULL, /* requirements */

83

	    SIZE+3, SIZE+3,

84

	    NULL, draw)

85