-
Notifications
You must be signed in to change notification settings - Fork 171
/
region.c
1883 lines (1572 loc) · 50.6 KB
/
region.c
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
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
251
252
253
254
255
256
257
258
259
260
261
262
263
264
265
266
267
268
269
270
271
272
273
274
275
276
277
278
279
280
281
282
283
284
285
286
287
288
289
290
291
292
293
294
295
296
297
298
299
300
301
302
303
304
305
306
307
308
309
310
311
312
313
314
315
316
317
318
319
320
321
322
323
324
325
326
327
328
329
330
331
332
333
334
335
336
337
338
339
340
341
342
343
344
345
346
347
348
349
350
351
352
353
354
355
356
357
358
359
360
361
362
363
364
365
366
367
368
369
370
371
372
373
374
375
376
377
378
379
380
381
382
383
384
385
386
387
388
389
390
391
392
393
394
395
396
397
398
399
400
401
402
403
404
405
406
407
408
409
410
411
412
413
414
415
416
417
418
419
420
421
422
423
424
425
426
427
428
429
430
431
432
433
434
435
436
437
438
439
440
441
442
443
444
445
446
447
448
449
450
451
452
453
454
455
456
457
458
459
460
461
462
463
464
465
466
467
468
469
470
471
472
473
474
475
476
477
478
479
480
481
482
483
484
485
486
487
488
489
490
491
492
493
494
495
496
497
498
499
500
501
502
503
504
505
506
507
508
509
510
511
512
513
514
515
516
517
518
519
520
521
522
523
524
525
526
527
528
529
530
531
532
533
534
535
536
537
538
539
540
541
542
543
544
545
546
547
548
549
550
551
552
553
554
555
556
557
558
559
560
561
562
563
564
565
566
567
568
569
570
571
572
573
574
575
576
577
578
579
580
581
582
583
584
585
586
587
588
589
590
591
592
593
594
595
596
597
598
599
600
601
602
603
604
605
606
607
608
609
610
611
612
613
614
615
616
617
618
619
620
621
622
623
624
625
626
627
628
629
630
631
632
633
634
635
636
637
638
639
640
641
642
643
644
645
646
647
648
649
650
651
652
653
654
655
656
657
658
659
660
661
662
663
664
665
666
667
668
669
670
671
672
673
674
675
676
677
678
679
680
681
682
683
684
685
686
687
688
689
690
691
692
693
694
695
696
697
698
699
700
701
702
703
704
705
706
707
708
709
710
711
712
713
714
715
716
717
718
719
720
721
722
723
724
725
726
727
728
729
730
731
732
733
734
735
736
737
738
739
740
741
742
743
744
745
746
747
748
749
750
751
752
753
754
755
756
757
758
759
760
761
762
763
764
765
766
767
768
769
770
771
772
773
774
775
776
777
778
779
780
781
782
783
784
785
786
787
788
789
790
791
792
793
794
795
796
797
798
799
800
801
802
803
804
805
806
807
808
809
810
811
812
813
814
815
816
817
818
819
820
821
822
823
824
825
826
827
828
829
830
831
832
833
834
835
836
837
838
839
840
841
842
843
844
845
846
847
848
849
850
851
852
853
854
855
856
857
858
859
860
861
862
863
864
865
866
867
868
869
870
871
872
873
874
875
876
877
878
879
880
881
882
883
884
885
886
887
888
889
890
891
892
893
894
895
896
897
898
899
900
901
902
903
904
905
906
907
908
909
910
911
912
913
914
915
916
917
918
919
920
921
922
923
924
925
926
927
928
929
930
931
932
933
934
935
936
937
938
939
940
941
942
943
944
945
946
947
948
949
950
951
952
953
954
955
956
957
958
959
960
961
962
963
964
965
966
967
968
969
970
971
972
973
974
975
976
977
978
979
980
981
982
983
984
985
986
987
988
989
990
991
992
993
994
995
996
997
998
999
1000
/*
* Copyright (c) 2004-2005 Ximian
* Copyright (C) 2006-2007 Novell, Inc (http://www.novell.com)
*
* Permission is hereby granted, free of charge, to any person obtaining a copy of this software
* and associated documentation files (the "Software"), to deal in the Software without restriction,
* including without limitation the rights to use, copy, modify, merge, publish, distribute, sublicense,
* and/or sell copies of the Software, and to permit persons to whom the Software is furnished to do so,
* subject to the following conditions:
*
* The above copyright notice and this permission notice shall be included in all copies or substantial
* portions of the Software.
*
* THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR IMPLIED, INCLUDING BUT
* NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT.
* IN NO EVENT SHALL THE AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER LIABILITY,
* WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM, OUT OF OR IN CONNECTION WITH THE SOFTWARE
* OR THE USE OR OTHER DEALINGS IN THE SOFTWARE.
*
* Authors:
* Jordi Mas i Hernandez <jordi@ximian.com>, 2004-2005
* Sebastien Pouliot <sebastien@ximian.com>
*
*/
#include "region-private.h"
#include "graphics-path-private.h"
/*
Helper functions
*/
static void
gdip_from_Rect_To_RectF (GpRect* rect, GpRectF* rectf)
{
rectf->X = rect->X;
rectf->Y = rect->Y;
rectf->Width = rect->Width;
rectf->Height = rect->Height;
}
static void
gdip_add_rect_to_array (GpRectF** srcarray, int* elements, GpRectF* rect)
{
GpRectF *array, *next;
array = GdipAlloc (sizeof (GpRectF) * (*elements + 1));
memcpy (array, *srcarray, sizeof (GpRectF) * (*elements));
if (*srcarray)
GdipFree (*srcarray);
next = array;
next += (*elements);
memcpy (next, rect, sizeof (GpRectF));
*srcarray = array;
*elements = *elements + 1;
}
static BOOL
gdip_is_Point_in_RectF_Visible (float x, float y, GpRectF* rect)
{
if ((x >= rect->X && x < (rect->X + rect->Width))
&& (y >= rect->Y && y < (rect->Y + rect->Height)))
return TRUE;
else
return FALSE;
}
static BOOL
gdip_is_Point_in_RectFs_Visible (float x, float y, GpRectF* r, int cnt)
{
GpRectF* rect = r;
int i;
for (i = 0; i < cnt; i++, rect++) {
if (gdip_is_Point_in_RectF_Visible (x, y, rect)) {
return TRUE;
}
}
return FALSE;
}
static void
gdip_get_bounds (GpRectF *allrects, int allcnt, GpRectF *bound)
{
float nx, ny, fx, fy;
int i;
GpRectF *rect;
if (allrects == NULL || allcnt == 0) {
bound->X = bound->Y = bound->Width = bound->Height = 0;
return;
}
/* Build a rect that contains all the rects inside. Smallest x,y and biggest x,y*/
nx = allrects->X; ny = allrects->Y;
fx = allrects->X + allrects->Width; fy = allrects->Y + allrects->Height;
for (i = 0, rect = allrects; i < allcnt; i++, rect++) {
if (rect->X < nx)
nx = rect->X;
if (rect->Y < ny)
ny = rect->Y;
if (rect->X + rect->Width > fx)
fx = rect->X + rect->Width;
if (rect->Y + rect->Height > fy)
fy = rect->Y + rect->Height;
}
bound->X = nx; bound->Y = ny;
bound->Width = fx - nx; bound->Height = fy - ny;
}
/* This internal version doesn't require a Graphic object to work */
static BOOL
gdip_is_region_empty (GpRegion *region)
{
GpRectF rect;
if (!region)
return FALSE;
if (region->type == RegionTypePath) {
/* check for an existing, but empty, path list */
if (!region->tree)
return TRUE;
if (region->tree->path)
return (region->tree->path->count == 0);
return FALSE;
}
if (!region->rects || (region->cnt == 0))
return TRUE;
gdip_get_bounds (region->rects, region->cnt, &rect);
return ((rect.Width == 0) || (rect.Height == 0));
}
static BOOL
gdip_is_rect_infinite (GpRectF *rect)
{
return (rect && (rect->X == REGION_INFINITE_POSITION) &&
(rect->Y == REGION_INFINITE_POSITION) &&
(rect->Width == REGION_INFINITE_LENGTH) &&
(rect->Height == REGION_INFINITE_LENGTH));
}
BOOL
gdip_is_InfiniteRegion (GpRegion *region)
{
switch (region->type) {
case RegionTypeRectF:
if (region->cnt != 1)
return FALSE;
return gdip_is_rect_infinite (region->rects);
case RegionTypePath:
/* FIXME: incomplete and not 100% accurate (curves) - but cover the most common case */
if (region->tree && region->tree->path && (region->tree->path->count == 4)) {
GpRectF bounds;
if (GdipGetPathWorldBounds (region->tree->path, &bounds, NULL, NULL) != Ok)
return gdip_is_rect_infinite (&bounds);
}
break;
default:
g_warning ("unknown type %d", region->type);
break;
}
return FALSE;
}
static BOOL
gdip_intersects (GpRectF *rect1, GpRectF *rect2)
{
if (rect1->X + rect1->Width == rect2->X) {
return TRUE;
}
return (rect1->X < rect2->X + rect2->Width &&
rect1->X + rect1->Width > rect2->X &&
rect1->Y < rect2->Y + rect2->Height &&
rect1->Y + rect1->Height > rect2->Y);
}
/* Is source contained in target ? */
static BOOL
gdip_contains (GpRectF *rect1, GpRectF *rect2)
{
return (rect1->X >= rect2->X &&
rect1->X + rect1->Width <= rect2->X + rect2->Width &&
rect1->Y >= rect2->Y &&
rect1->Y + rect1->Height <= rect2->Y + rect2->Height);
}
static BOOL
gdip_add_rect_to_array_notcontained (GpRectF** srcarray, int* elements, GpRectF* rect)
{
int i;
GpRectF* rectarray = *srcarray;
if (rect->Height <= 0 || rect->Width <= 0)
return FALSE;
for (i = 0; i < *elements; i++, rectarray++) {
if (gdip_contains (rect, rectarray) == TRUE) {
return FALSE;
}
}
gdip_add_rect_to_array (srcarray, elements, rect);
return TRUE;
}
static BOOL
gdip_equals (GpRectF *rect1, GpRectF *rect2)
{
if (!rect1)
return (rect2 == NULL);
return (rect1->X == rect2->X &&
rect1->Width == rect2->Width &&
rect1->Y == rect2->Y &&
rect1->Height == rect2->Height);
}
BOOL
gdip_is_Point_in_RectF_inclusive (float x, float y, GpRectF* rect)
{
if ((x >= rect->X && x <= (rect->X + rect->Width))
&& (y >= rect->Y && y <= (rect->Y + rect->Height)))
return TRUE;
else
return FALSE;
}
/* Finds a rect that has the lowest x and y after the src rect provided */
static BOOL
gdip_getlowestrect (GpRectF *rects, int cnt, GpRectF* src, GpRectF* rslt)
{
int i;
GpRectF *current;
GpRectF *lowest = NULL;
for (i = 0, current = rects; i < cnt; i++, current++) {
if (current->Width <= 0 || current->Height <= 0)
continue;
if (current->Y > src->Y ||
(current->Y == src->Y && current->X > src->X)) {
if (lowest == NULL) {
lowest = current;
}
else {
if (current->Y < lowest->Y ||
(current->Y == lowest->Y && current->X < lowest->X)) {
lowest = current;
}
}
}
}
if (lowest == NULL) {
return FALSE;
}
rslt->X = lowest->X; rslt->Y = lowest->Y;
rslt->Width = lowest->Width; rslt->Height = lowest->Height;
return TRUE;
}
void
gdip_clear_region (GpRegion *region)
{
region->type = RegionTypeEmpty;
if (region->rects) {
GdipFree (region->rects);
region->rects = NULL;
}
if (region->tree) {
gdip_region_clear_tree (region->tree);
GdipFree (region->tree);
region->tree = NULL;
}
if (region->bitmap) {
gdip_region_bitmap_free (region->bitmap);
region->bitmap = NULL;
}
region->cnt = 0;
}
void
gdip_copy_region (GpRegion *source, GpRegion *dest)
{
dest->type = source->type;
if (source->rects) {
dest->cnt = source->cnt;
dest->rects = (GpRectF *) GdipAlloc (sizeof (GpRectF) * source->cnt);
memcpy (dest->rects, source->rects, sizeof (GpRectF) * source->cnt);
} else {
dest->cnt = 0;
dest->rects = NULL;
}
if (source->tree) {
dest->tree = (GpPathTree *) GdipAlloc (sizeof (GpPathTree));
gdip_region_copy_tree (source->tree, dest->tree);
} else {
dest->tree = NULL;
}
if (source->bitmap) {
dest->bitmap = gdip_region_bitmap_clone (source->bitmap);
} else {
dest->bitmap = NULL;
}
}
/* convert a rectangle-based region to a path based region */
static void
gdip_region_convert_to_path (GpRegion *region)
{
int i;
GpRectF *rect;
/* no conversion is required for complex regions */
if (!region || (region->type != RegionTypeRectF))
return;
region->type = RegionTypePath;
region->tree = (GpPathTree *) GdipAlloc (sizeof (GpPathTree));
GdipCreatePath (FillModeAlternate, ®ion->tree->path);
/* all rectangles are converted into a single path */
for (i = 0, rect = region->rects; i < region->cnt; i++, rect++) {
GdipAddPathRectangle (region->tree->path, rect->X, rect->Y, rect->Width, rect->Height);
}
if (region->rects) {
GdipFree (region->rects);
region->rects = NULL;
}
}
/*
* Create a region (path-tree) from a path.
*/
static GpStatus
gdip_region_create_from_path (GpRegion *region, GpPath *path)
{
region->type = RegionTypePath;
region->tree = (GpPathTree *) GdipAlloc (sizeof (GpPathTree));
return GdipClonePath (path, ®ion->tree->path);
}
static GpStatus
gdip_createRegion (GpRegion **region, RegionType type, void *src)
{
GpRegion *result;
GpRectF rect;
result = (GpRegion *) GdipAlloc (sizeof (GpRegion));
result->type = type;
result->cnt = 0;
result->rects = NULL;
result->tree = NULL;
result->bitmap = NULL;
switch (type) {
case RegionTypeRect:
gdip_from_Rect_To_RectF ((GpRect *)src, &rect);
gdip_add_rect_to_array (&result->rects, &result->cnt, &rect);
result->type = RegionTypeRectF;
break;
case RegionTypeRectF:
gdip_add_rect_to_array (&result->rects, &result->cnt, (GpRectF *)src);
break;
case RegionTypeEmpty:
GdipSetInfinite (result);
/* note: GdipSetInfinite converts type to RegionTypeRectF */
break;
case RegionTypePath:
gdip_region_create_from_path (result, (GpPath*)src);
break;
default:
g_warning ("unknown type %d", result->type);
return NotImplemented;
}
*region = result;
return Ok;
}
/*
API implementation
*/
// coverity[+alloc : arg-*0]
GpStatus
GdipCreateRegion (GpRegion **region)
{
if (!region)
return InvalidParameter;
return gdip_createRegion (region, RegionTypeEmpty, NULL);
}
// coverity[+alloc : arg-*1]
GpStatus
GdipCreateRegionRect (GDIPCONST GpRectF *rect, GpRegion **region)
{
if (!region || !rect)
return InvalidParameter;
return gdip_createRegion (region, RegionTypeRectF, (void*) rect);
}
// coverity[+alloc : arg-*1]
GpStatus
GdipCreateRegionRectI (GDIPCONST GpRect *rect, GpRegion **region)
{
if (!region || !rect)
return InvalidParameter;
return gdip_createRegion (region, RegionTypeRect, (void*) rect);
}
// coverity[+alloc : arg-*2]
GpStatus
GdipCreateRegionRgnData (GDIPCONST BYTE *regionData, int size, GpRegion **region)
{
GpRegion *result;
if (!region || !regionData)
return InvalidParameter;
if (size < 8)
return GenericError;
result = (GpRegion *) GdipAlloc (sizeof (GpRegion));
memcpy (&result->type, regionData, sizeof (guint32));
result->cnt = 0;
result->rects = NULL;
result->tree = NULL;
result->bitmap = NULL;
switch (result->type) {
case RegionTypeRectF: {
guint32 count;
GpRectF *rect;
int i;
memcpy (&count, regionData + 4, sizeof (guint32));
if (count != (size - 8) / sizeof (GpRectF)) {
GdipFree (result);
return InvalidParameter;
}
for (i = 0, rect = (GpRectF*)(regionData + 8); i < count; i++, rect++)
gdip_add_rect_to_array (&result->rects, &result->cnt, rect);
}
break;
case RegionTypePath:
if (size < 16) {
GdipFree (result);
return InvalidParameter;
}
result->tree = (GpPathTree*) GdipAlloc (sizeof (GpPathTree));
if (!gdip_region_deserialize_tree ((BYTE*)(regionData + 4), (size - 4), result->tree)) {
GdipFree (result);
return InvalidParameter;
}
break;
default:
g_warning ("unknown type %d", result->type);
GdipFree (result);
return NotImplemented;
}
*region = result;
return Ok;
}
// coverity[+alloc : arg-*1]
GpStatus
GdipCloneRegion (GpRegion *region, GpRegion **cloneRegion)
{
GpRegion *result;
if (!region || !cloneRegion)
return InvalidParameter;
result = (GpRegion *) GdipAlloc (sizeof (GpRegion));
if (!result)
return OutOfMemory;
gdip_copy_region (region, result);
*cloneRegion = result;
return Ok;
}
GpStatus
GdipDeleteRegion (GpRegion *region)
{
if (!region)
return InvalidParameter;
gdip_clear_region (region);
GdipFree (region);
return Ok;
}
GpStatus
GdipSetInfinite (GpRegion *region)
{
GpRectF rect;
if (!region)
return InvalidParameter;
gdip_clear_region (region);
region->type = RegionTypeRectF;
rect.X = rect.Y = REGION_INFINITE_POSITION;
rect.Width = rect.Height = REGION_INFINITE_LENGTH;
gdip_add_rect_to_array (®ion->rects, ®ion->cnt, &rect);
return Ok;
}
GpStatus
GdipSetEmpty (GpRegion *region)
{
if (!region)
return InvalidParameter;
gdip_clear_region (region);
region->type = RegionTypeRectF;
return Ok;
}
/* pre-process negative width and height, without modifying the originals, see bug #383878 */
static void
gdip_normalize_rectangle (GpRectF *rect, GpRectF *normalized)
{
if (rect->Width < 0) {
normalized->X = rect->X + rect->Width;
normalized->Width = fabs (rect->Width);
} else {
normalized->X = rect->X;
normalized->Width = rect->Width;
}
if (rect->Height < 0) {
normalized->Y = rect->Y + rect->Height;
normalized->Height = fabs (rect->Height);
} else {
normalized->Y = rect->Y;
normalized->Height = rect->Height;
}
}
/* Exclude */
static void
gdip_combine_exclude (GpRegion *region, GpRectF *rtrg, int cntt)
{
GpRectF *allsrcrects = NULL, *rects = NULL;
GpRectF *alltrgrects = NULL, *rect, *rectop, *recttrg;
int allsrccnt = 0, cnt = 0, i, n, alltrgcnt = 0;
GpRectF current, rslt, newrect;
BOOL storecomplete;
/* Create the list of source rectangles to process, it will contain splitted ones later */
for (i = 0, rect = region->rects; i < region->cnt; i++, rect++)
gdip_add_rect_to_array (&allsrcrects, &allsrccnt, rect);
/* Create the list of target rectangles to process, it will contain splitted ones later */
for (i = 0, rect = rtrg; i < cntt; i++, rect++) {
/* normalize */
GpRectF normal;
gdip_normalize_rectangle (rect, &normal);
gdip_add_rect_to_array (&alltrgrects, &alltrgcnt, &normal);
}
/* Init current with the first element in the array */
current.X = REGION_INFINITE_POSITION - 1;
current.Y = REGION_INFINITE_POSITION - 1;
current.Width = 0; current.Height = 0;
while (gdip_getlowestrect (allsrcrects, allsrccnt, ¤t, &rslt)) {
current.X = rslt.X; current.Y = rslt.Y;
current.Width = rslt.Width; current.Height = rslt.Height;
storecomplete = TRUE;
/* Current rect with lowest y and X against the target ones */
for (i = 0, recttrg = alltrgrects; i < alltrgcnt; i++, recttrg++) {
if (gdip_intersects (¤t, recttrg) == FALSE
|| gdip_equals (¤t, recttrg) == TRUE ||
recttrg->Height < 0 || recttrg->Width < 0) {
continue;
}
/* Once a rect is splitted, we do not want to take into account anymore */
for (rectop = allsrcrects, n = 0; n < allsrccnt; n++, rectop++) {
if (gdip_equals (¤t, rectop)) {
rectop->X = 0; rectop->Y = 0;
rectop->Width = 0; rectop->Height = 0;
break;
}
}
/* Result rect */
newrect.Y = current.Y;
if (current.Y >= recttrg->Y) { /* Our rect intersects in the upper part with another rect */
newrect.Height = MIN (recttrg->Y + recttrg->Height - current.Y, current.Height);
if (newrect.Height < 0)
newrect.Height = current.Height;
if (current.X >= recttrg->X) { /* Hit from behind */
newrect.X = recttrg->X + recttrg->Width;
newrect.Width = MAX (current.X + current.Width - newrect.X, 0);
}
else {
newrect.X = current.X;
newrect.Width = MAX (recttrg->X - current.X, 0);
}
}
else {
newrect.Height = MIN (recttrg->Y - current.Y, current.Height);
newrect.X = current.X;
newrect.Width = current.Width;
}
gdip_add_rect_to_array_notcontained (&rects, &cnt, &newrect);
/* What's left to process from the source region */
if (current.Y >= recttrg->Y) { /* Our rect intersects in the upper part with another rect */
/* A whole part from the top has been taken*/
if (recttrg->X <= current.X && recttrg->X + recttrg->Width >= current.X + current.Width)
rslt.Y = recttrg->Y + recttrg->Height;
else
rslt.Y = newrect.Y + newrect.Height;
rslt.Height = current.Y + current.Height - rslt.Y;
}
else {
rslt.Y = recttrg->Y;
rslt.Height = current.Y + current.Height - recttrg->Y;
}
rslt.X = current.X;
rslt.Width = current.Width;
if (rslt.Height > 0 && rslt.Width > 0) {
gdip_add_rect_to_array (&allsrcrects, &allsrccnt, &rslt);
}
/* Special case where our rect is hit and split in two parts IIIUIII */
if (recttrg->X >= current.X && recttrg->X + recttrg->Width <= current.X + current.Width) {
/* Generate extra right rect, keep previous values of Y and Height */
newrect.Width = current.X + current.Width - (recttrg->X + recttrg->Width);
newrect.X = recttrg->X + recttrg->Width;
gdip_add_rect_to_array_notcontained (&rects, &cnt, &newrect);
}
storecomplete = FALSE;
break;
}
/* don't include a rectangle identical to the excluded one! */
if (storecomplete && !gdip_equals (rtrg, ¤t)) {
gdip_add_rect_to_array_notcontained (&rects, &cnt, ¤t);
}
}
GdipFree (allsrcrects);
GdipFree (alltrgrects);
if (region->rects)
GdipFree (region->rects);
region->rects = rects;
region->cnt = cnt;
}
/*
Complement: the part of the second region not shared with the first region.
Scans the region to be combined and store the rects not present in the region
*/
static void
gdip_combine_complement (GpRegion *region, GpRectF *rtrg, int cntt)
{
GpRegion regsrc;
GpRectF* trg, *rect;
GpRectF* allsrcrects = NULL;
int allsrccnt = 0, i, trgcnt;
/* Create the list of source rectangles to process */
for (i = 0, rect = rtrg; i < cntt; i++, rect++) {
/* normalize */
GpRectF normal;
gdip_normalize_rectangle (rect, &normal);
gdip_add_rect_to_array (&allsrcrects, &allsrccnt, &normal);
}
regsrc.rects = allsrcrects;
regsrc.cnt = allsrccnt;
trg = region->rects;
trgcnt = region->cnt;
gdip_combine_exclude (®src, trg, trgcnt);
if ((regsrc.rects != allsrcrects) || (regsrc.cnt != allsrccnt)) {
if (region->rects)
GdipFree (region->rects);
region->rects = regsrc.rects;
region->cnt = regsrc.cnt;
}
}
/* Union */
static void
gdip_combine_union (GpRegion *region, GpRectF *rtrg, int cnttrg)
{
GpRectF *allrects = NULL, *rects = NULL;
GpRectF *recttrg, *rect, *rectop;
int allcnt = 0, cnt = 0, i, n;
GpRectF current, rslt, newrect;
BOOL storecomplete, contained;
/* All the src and trg rects in a single array*/
for (i = 0, rect = region->rects; i < region->cnt; i++, rect++)
gdip_add_rect_to_array (&allrects, &allcnt, rect);
for (i = 0, rect = rtrg; i < cnttrg; i++, rect++) {
/* normalize */
GpRectF normal;
gdip_normalize_rectangle (rect, &normal);
gdip_add_rect_to_array (&allrects, &allcnt, &normal);
}
if (allcnt == 0) {
GdipFree (allrects);
return;
}
/* Init current with the first element in the array */
current.X = REGION_INFINITE_POSITION;
current.Y = REGION_INFINITE_POSITION;
current.Width = 0; current.Height = 0;
while (gdip_getlowestrect (allrects, allcnt, ¤t, &rslt)) {
current.X = rslt.X; current.Y = rslt.Y;
current.Width = rslt.Width; current.Height = rslt.Height;
storecomplete = TRUE;
/* Current rect with lowest y and X againt the stored ones */
for (i = 0, recttrg = allrects; i < allcnt; i++, recttrg++) {
/* If it has lower coordinates it has been already processed */
if (current.Y > recttrg->Y ||
(current.Y == recttrg->Y && current.X > recttrg->X)) {
continue;
}
if (gdip_intersects (¤t, recttrg) == FALSE
|| gdip_equals (¤t, recttrg) == TRUE ||
recttrg->Height < 0 || recttrg->Width < 0) {
continue;
}
if (gdip_contains (recttrg, ¤t) == TRUE) {
continue;
}
/* Once a rect is splitted, we do not want to take into account anymore */
for (rectop = allrects, n = 0; n < allcnt; n++, rectop++) {
if (gdip_equals (¤t, rectop)) {
rectop->X = 0; rectop->Y = 0;
rectop->Width = 0; rectop->Height = 0;
break;
}
}
/* Our rect intersects in the lower part with another rect */
newrect.Y = current.Y;
if (current.Y == recttrg->Y) {
newrect.X = MIN (current.X, recttrg->X);
newrect.Width = MAX (current.X + current.Width, recttrg->X + recttrg->Width) - newrect.X;
newrect.Height = MIN (current.Height, recttrg->Height);
}
else {
newrect.X = current.X;
newrect.Width = current.Width;
newrect.Height = recttrg->Y - current.Y;
/* If it's contained inside, get the > height */
if (recttrg->X >= current.X && recttrg->X + recttrg->Width <= current.X + current.Width)
newrect.Height = MAX (current.Height, recttrg->Height);
}
gdip_add_rect_to_array_notcontained (&rects, &cnt, &newrect);
/* Push what's left from the current the rect in the list of rects to process
if it's already not contained in other rects except the current (we just split from there) */
rslt.X = current.X;
rslt.Y = newrect.Y + newrect.Height;
rslt.Width = current.Width;
rslt.Height = current.Height - newrect.Height;
contained = FALSE;
for (rectop = allrects, n = 0; n < allcnt; n++, rectop++) {
if (gdip_equals (rectop, ¤t)) /* If it's contained with the current does not count */
continue;
if (gdip_contains (&rslt, rectop)) {
contained = TRUE;
break;
}
}
if (contained == FALSE && rslt.Height > 0 && rslt.Width > 0) {
gdip_add_rect_to_array (&allrects, &allcnt, &rslt);
recttrg = allrects;
}
/* If both we at the same Y when take into account the X also to process the following
that exceeds the X also */
if (recttrg->Y == current.Y) {
if (recttrg->Height <= current.Height) { /* Takes all part */
recttrg->Width = recttrg->X + recttrg->Width - (recttrg->X + recttrg->Width);
recttrg->X = newrect.X + newrect.Width;
recttrg->Y += newrect.Height;
recttrg->Height -= newrect.Height;
} else {
if (newrect.X + newrect.Width >= recttrg->X + recttrg->Width) {
recttrg->Y += newrect.Height;
recttrg->Height -= newrect.Height;
}
}
}
/* If it's contained inside, get the > height */
if (recttrg->X >= current.X && recttrg->X + recttrg->Width <= current.X + current.Width) {
recttrg->Height = MAX (recttrg->Y + recttrg->Height - (current.Y + current.Height), 0);
recttrg->Y = newrect.Y + newrect.Height;
}
storecomplete = FALSE;
break;
}
if (storecomplete) {
gdip_add_rect_to_array_notcontained (&rects, &cnt, ¤t);
}
}
GdipFree (allrects);
if (region->rects)
GdipFree (region->rects);
region->rects = rects;
region->cnt = cnt;
}
/* Intersect */
static void
gdip_combine_intersect (GpRegion *region, GpRectF *rtrg, int cnttrg)
{
GpRectF *rectsrc;
int src, trg;
GpRectF rectcur;
GpRegion regunion;
GpRectF *recttrg;
regunion.rects = NULL;
regunion.cnt = 0;
for (rectsrc = region->rects, src = 0; src < region->cnt; src++, rectsrc++) {
for (recttrg = rtrg, trg = 0; trg < cnttrg; trg++, recttrg++) {
/* normalize */
GpRectF normal;
gdip_normalize_rectangle (recttrg, &normal);
/* Intersects With */
if ((rectsrc->X >= normal.X + normal.Width) || (rectsrc->X + rectsrc->Width <= normal.X) ||
(rectsrc->Y >= normal.Y + normal.Height) || (rectsrc->Y + rectsrc->Height <= normal.Y)) {
continue;
}
/* Area that intersects */
rectcur.X = rectsrc->X > normal.X ? rectsrc->X : normal.X;
rectcur.Y = rectsrc->Y > normal.Y ? rectsrc->Y : normal.Y;
rectcur.Width = rectsrc->X + rectsrc->Width < normal.X + normal.Width ?
rectsrc->X + rectsrc->Width - rectcur.X : normal.X + normal.Width - rectcur.X;
rectcur.Height = rectsrc->Y + rectsrc->Height < normal.Y + normal.Height ?
rectsrc->Y + rectsrc->Height - rectcur.Y : normal.Y + normal.Height - rectcur.Y;
/* Combine with previous areas that intersect with rect */
gdip_combine_union (®union, &rectcur, 1);
}
}
if (region->rects)
GdipFree (region->rects);
region->rects = regunion.rects;
region->cnt = regunion.cnt;
}
/* Xor */
static void
gdip_combine_xor (GpRegion *region, GpRectF *recttrg, int cnttrg)
{
GpRegion *rgnsrc; /* All rectangles of both regions*/
GpRegion *rgntrg; /* Only the ones that intersect*/
GpRectF *allrects = NULL, *rect;
int allcnt = 0, i;
/* All the src and trg rects in a single array*/
for (i = 0, rect = region->rects; i < region->cnt; i++, rect++)
gdip_add_rect_to_array (&allrects, &allcnt, rect);
for (i = 0, rect = recttrg; i < cnttrg; i++, rect++) {
/* normalize */
GpRectF normal;
gdip_normalize_rectangle (rect, &normal);
gdip_add_rect_to_array (&allrects, &allcnt, &normal);
}
rgnsrc = (GpRegion *) GdipAlloc (sizeof (GpRegion));
rgnsrc->type = RegionTypeRectF;
rgnsrc->cnt = allcnt;
rgnsrc->rects = allrects;
GdipCloneRegion (region, &rgntrg);
gdip_combine_intersect (rgntrg, recttrg, cnttrg);
/* exclude the intersecting rectangles (if any) */
if (rgntrg->cnt > 0)
gdip_combine_exclude (rgnsrc, rgntrg->rects, rgntrg->cnt);
if (region->rects)
GdipFree (region->rects);
region->rects = rgnsrc->rects;
region->cnt = rgnsrc->cnt;
GdipFree (rgnsrc);
GdipDeleteRegion (rgntrg);
}
GpStatus
GdipCombineRegionRect (GpRegion *region, GDIPCONST GpRectF *rect, CombineMode combineMode)
{
if (!region || !rect)
return InvalidParameter;
/* allow the current region to "revert" to a simple RegionTypeRect if possible */
if (combineMode == CombineModeReplace)
GdipSetEmpty (region);
/* Union with infinity is a no-op (still an infinite region) */
if ((combineMode == CombineModeUnion) && gdip_is_InfiniteRegion (region))
return Ok;
if (region->type == RegionTypePath) {
GpPath *path = NULL;
GpStatus status;
/* Convert GpRectF to GpPath and use GdipCombineRegionPath */
status = GdipCreatePath (FillModeAlternate, &path);
if (status != Ok) {
if (path)
GdipDeletePath (path);
return status;
}
GdipAddPathRectangle (path, rect->X, rect->Y, rect->Width, rect->Height);
status = GdipCombineRegionPath (region, path, combineMode);