1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
|
#include <assert.h>
#include <stdlib.h>
#include <stdio.h>
#include "pixman.h"
int
main ()
{
pixman_region32_t r1;
pixman_region32_t r2;
pixman_region32_t r3;
pixman_box32_t boxes[] = {
{ 10, 10, 20, 20 },
{ 30, 30, 30, 40 },
{ 50, 45, 60, 44 },
};
pixman_box32_t boxes2[] = {
{ 2, 6, 7, 6 },
{ 4, 1, 6, 7 },
};
pixman_box32_t boxes3[] = {
{ 2, 6, 7, 6 },
{ 4, 1, 6, 1 },
};
int i;
pixman_box32_t *b;
/* This used to go into an infinite loop before pixman-region.c
* was fixed to not use explict "short" variables
*/
pixman_region32_init_rect (&r1, 0, 0, 20, 64000);
pixman_region32_init_rect (&r2, 0, 0, 20, 64000);
pixman_region32_init_rect (&r3, 0, 0, 20, 64000);
pixman_region32_subtract (&r1, &r2, &r3);
/* This would produce a region containing an empty
* rectangle in it. Such regions are considered malformed,
* but using an empty rectangle for initialization should
* work.
*/
pixman_region32_init_rects (&r1, boxes, 3);
b = pixman_region32_rectangles (&r1, &i);
assert (i == 1);
while (i--)
{
assert (b[i].x1 < b[i].x2);
assert (b[i].y1 < b[i].y2);
}
/* This would produce a rectangle containing the bounding box
* of the two rectangles. The correct result is to eliminate
* the broken rectangle.
*/
pixman_region32_init_rects (&r1, boxes2, 2);
b = pixman_region32_rectangles (&r1, &i);
assert (i == 1);
assert (b[0].x1 == 4);
assert (b[0].y1 == 1);
assert (b[0].x2 == 6);
assert (b[0].y2 == 7);
/* This should produce an empty region */
pixman_region32_init_rects (&r1, boxes3, 2);
b = pixman_region32_rectangles (&r1, &i);
assert (i == 0);
return 0;
}
|
