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
|
/* -*- Mode: C++; tab-width: 4; indent-tabs-mode: nil; c-basic-offset: 4 -*- */
/*
* This file is part of the LibreOffice project.
*
* This Source Code Form is subject to the terms of the Mozilla Public
* License, v. 2.0. If a copy of the MPL was not distributed with this
* file, You can obtain one at http://mozilla.org/MPL/2.0/.
*
* This file incorporates work covered by the following license notice:
*
* Licensed to the Apache Software Foundation (ASF) under one or more
* contributor license agreements. See the NOTICE file distributed
* with this work for additional information regarding copyright
* ownership. The ASF licenses this file to you under the Apache
* License, Version 2.0 (the "License"); you may not use this file
* except in compliance with the License. You may obtain a copy of
* the License at http://www.apache.org/licenses/LICENSE-2.0 .
*/
#include <sal/types.h>
#include <basegfx/matrix/b2dhommatrix.hxx>
#include <tools/poly.hxx>
#include <vcl/metaact.hxx>
#include <vcl/virdev.hxx>
#include <salgdi.hxx>
#include <cassert>
#include <memory>
#define OUTDEV_POLYPOLY_STACKBUF 32
void OutputDevice::DrawPolyPolygon( const tools::PolyPolygon& rPolyPoly )
{
assert(!is_double_buffered_window());
if( mpMetaFile )
mpMetaFile->AddAction( new MetaPolyPolygonAction( rPolyPoly ) );
sal_uInt16 nPoly = rPolyPoly.Count();
if ( !IsDeviceOutputNecessary() || (!mbLineColor && !mbFillColor) || !nPoly || ImplIsRecordLayout() )
return;
// we need a graphics
if ( !mpGraphics && !AcquireGraphics() )
return;
assert(mpGraphics);
if ( mbInitClipRegion )
InitClipRegion();
if ( mbOutputClipped )
return;
if ( mbInitLineColor )
InitLineColor();
if ( mbInitFillColor )
InitFillColor();
// use b2dpolygon drawing if possible
if (RasterOp::OverPaint == GetRasterOp() && (IsLineColor() || IsFillColor()))
{
const basegfx::B2DHomMatrix aTransform(ImplGetDeviceTransformation());
basegfx::B2DPolyPolygon aB2DPolyPolygon(rPolyPoly.getB2DPolyPolygon());
// ensure closed - may be asserted, will prevent buffering
if(!aB2DPolyPolygon.isClosed())
{
aB2DPolyPolygon.setClosed(true);
}
if (IsFillColor())
{
mpGraphics->DrawPolyPolygon(
aTransform,
aB2DPolyPolygon,
0.0,
*this);
}
bool bSuccess(true);
if (IsLineColor())
{
const bool bPixelSnapHairline(mnAntialiasing & AntialiasingFlags::PixelSnapHairline);
for(auto const& rPolygon : std::as_const(aB2DPolyPolygon))
{
bSuccess = mpGraphics->DrawPolyLine(
aTransform,
rPolygon,
0.0,
0.0, // tdf#124848 hairline
nullptr, // MM01
basegfx::B2DLineJoin::NONE,
css::drawing::LineCap_BUTT,
basegfx::deg2rad(15.0), // not used with B2DLineJoin::NONE, but the correct default
bPixelSnapHairline,
*this);
if (!bSuccess)
break;
}
}
if(bSuccess)
{
if( mpAlphaVDev )
mpAlphaVDev->DrawPolyPolygon( rPolyPoly );
return;
}
}
if ( nPoly == 1 )
{
// #100127# Map to DrawPolygon
const tools::Polygon& aPoly = rPolyPoly.GetObject( 0 );
if( aPoly.GetSize() >= 2 )
{
GDIMetaFile* pOldMF = mpMetaFile;
mpMetaFile = nullptr;
DrawPolygon( aPoly );
mpMetaFile = pOldMF;
}
}
else
{
// #100127# moved real tools::PolyPolygon draw to separate method,
// have to call recursively, avoiding duplicate
// ImplLogicToDevicePixel calls
ImplDrawPolyPolygon( nPoly, ImplLogicToDevicePixel( rPolyPoly ) );
}
if( mpAlphaVDev )
mpAlphaVDev->DrawPolyPolygon( rPolyPoly );
}
void OutputDevice::DrawPolygon( const basegfx::B2DPolygon& rB2DPolygon)
{
assert(!is_double_buffered_window());
// AW: Do NOT paint empty polygons
if(rB2DPolygon.count())
{
basegfx::B2DPolyPolygon aPP( rB2DPolygon );
DrawPolyPolygon( aPP );
}
}
void OutputDevice::DrawPolygon( const tools::Polygon& rPoly )
{
assert(!is_double_buffered_window());
if( mpMetaFile )
mpMetaFile->AddAction( new MetaPolygonAction( rPoly ) );
sal_uInt16 nPoints = rPoly.GetSize();
if ( !IsDeviceOutputNecessary() || (!mbLineColor && !mbFillColor) || (nPoints < 2) || ImplIsRecordLayout() )
return;
// we need a graphics
if ( !mpGraphics && !AcquireGraphics() )
return;
assert(mpGraphics);
if ( mbInitClipRegion )
InitClipRegion();
if ( mbOutputClipped )
return;
if ( mbInitLineColor )
InitLineColor();
if ( mbInitFillColor )
InitFillColor();
// use b2dpolygon drawing if possible
if (RasterOp::OverPaint == GetRasterOp() && (IsLineColor() || IsFillColor()))
{
const basegfx::B2DHomMatrix aTransform(ImplGetDeviceTransformation());
basegfx::B2DPolygon aB2DPolygon(rPoly.getB2DPolygon());
// ensure closed - maybe assert, hinders buffering
if(!aB2DPolygon.isClosed())
{
aB2DPolygon.setClosed(true);
}
if (IsFillColor())
{
mpGraphics->DrawPolyPolygon(
aTransform,
basegfx::B2DPolyPolygon(aB2DPolygon),
0.0,
*this);
}
bool bSuccess(true);
if (IsLineColor())
{
const bool bPixelSnapHairline(mnAntialiasing & AntialiasingFlags::PixelSnapHairline);
bSuccess = mpGraphics->DrawPolyLine(
aTransform,
aB2DPolygon,
0.0,
0.0, // tdf#124848 hairline
nullptr, // MM01
basegfx::B2DLineJoin::NONE,
css::drawing::LineCap_BUTT,
basegfx::deg2rad(15.0), // not used with B2DLineJoin::NONE, but the correct default
bPixelSnapHairline,
*this);
}
if(bSuccess)
{
if( mpAlphaVDev )
mpAlphaVDev->DrawPolygon( rPoly );
return;
}
}
tools::Polygon aPoly = ImplLogicToDevicePixel( rPoly );
const Point* pPtAry = aPoly.GetConstPointAry();
// #100127# Forward beziers to sal, if any
if( aPoly.HasFlags() )
{
const PolyFlags* pFlgAry = aPoly.GetConstFlagAry();
if( !mpGraphics->DrawPolygonBezier( nPoints, pPtAry, pFlgAry, *this ) )
{
aPoly = tools::Polygon::SubdivideBezier(aPoly);
pPtAry = aPoly.GetConstPointAry();
mpGraphics->DrawPolygon( aPoly.GetSize(), pPtAry, *this );
}
}
else
{
mpGraphics->DrawPolygon( nPoints, pPtAry, *this );
}
if( mpAlphaVDev )
mpAlphaVDev->DrawPolygon( rPoly );
}
// Caution: This method is nearly the same as
// OutputDevice::DrawTransparent( const basegfx::B2DPolyPolygon& rB2DPolyPoly, double fTransparency),
// so when changes are made here do not forget to make changes there, too
void OutputDevice::DrawPolyPolygon( const basegfx::B2DPolyPolygon& rB2DPolyPoly )
{
assert(!is_double_buffered_window());
if( mpMetaFile )
mpMetaFile->AddAction( new MetaPolyPolygonAction( tools::PolyPolygon( rB2DPolyPoly ) ) );
// call helper
ImplDrawPolyPolygonWithB2DPolyPolygon(rB2DPolyPoly);
}
void OutputDevice::ImplDrawPolyPolygonWithB2DPolyPolygon(const basegfx::B2DPolyPolygon& rB2DPolyPoly)
{
// Do not paint empty PolyPolygons
if(!rB2DPolyPoly.count() || !IsDeviceOutputNecessary())
return;
// we need a graphics
if( !mpGraphics && !AcquireGraphics() )
return;
assert(mpGraphics);
if( mbInitClipRegion )
InitClipRegion();
if( mbOutputClipped )
return;
if( mbInitLineColor )
InitLineColor();
if( mbInitFillColor )
InitFillColor();
bool bSuccess(false);
if (RasterOp::OverPaint == GetRasterOp() && (IsLineColor() || IsFillColor()))
{
const basegfx::B2DHomMatrix aTransform(ImplGetDeviceTransformation());
basegfx::B2DPolyPolygon aB2DPolyPolygon(rB2DPolyPoly);
bSuccess = true;
// ensure closed - maybe assert, hinders buffering
if(!aB2DPolyPolygon.isClosed())
{
aB2DPolyPolygon.setClosed(true);
}
if (IsFillColor())
{
mpGraphics->DrawPolyPolygon(
aTransform,
aB2DPolyPolygon,
0.0,
*this);
}
if (IsLineColor())
{
const bool bPixelSnapHairline(mnAntialiasing & AntialiasingFlags::PixelSnapHairline);
for(auto const& rPolygon : std::as_const(aB2DPolyPolygon))
{
bSuccess = mpGraphics->DrawPolyLine(
aTransform,
rPolygon,
0.0,
0.0, // tdf#124848 hairline
nullptr, // MM01
basegfx::B2DLineJoin::NONE,
css::drawing::LineCap_BUTT,
basegfx::deg2rad(15.0), // not used with B2DLineJoin::NONE, but the correct default
bPixelSnapHairline,
*this);
if (!bSuccess)
break;
}
}
}
if (!bSuccess)
{
// fallback to old polygon drawing if needed
const tools::PolyPolygon aToolsPolyPolygon(rB2DPolyPoly);
const tools::PolyPolygon aPixelPolyPolygon = ImplLogicToDevicePixel(aToolsPolyPolygon);
ImplDrawPolyPolygon(aPixelPolyPolygon.Count(), aPixelPolyPolygon);
}
if (mpAlphaVDev)
mpAlphaVDev->ImplDrawPolyPolygonWithB2DPolyPolygon(rB2DPolyPoly);
}
// #100127# Extracted from OutputDevice::DrawPolyPolygon()
void OutputDevice::ImplDrawPolyPolygon( sal_uInt16 nPoly, const tools::PolyPolygon& rPolyPoly )
{
// AW: This crashes on empty PolyPolygons, avoid that
if(!nPoly)
return;
sal_uInt32 aStackAry1[OUTDEV_POLYPOLY_STACKBUF];
const Point* aStackAry2[OUTDEV_POLYPOLY_STACKBUF];
PolyFlags* aStackAry3[OUTDEV_POLYPOLY_STACKBUF];
sal_uInt32* pPointAry;
const Point** pPointAryAry;
const PolyFlags** pFlagAryAry;
sal_uInt16 i = 0;
sal_uInt16 j = 0;
sal_uInt16 last = 0;
bool bHaveBezier = false;
if ( nPoly > OUTDEV_POLYPOLY_STACKBUF )
{
pPointAry = new sal_uInt32[nPoly];
pPointAryAry = new const Point*[nPoly];
pFlagAryAry = new const PolyFlags*[nPoly];
}
else
{
pPointAry = aStackAry1;
pPointAryAry = aStackAry2;
pFlagAryAry = const_cast<const PolyFlags**>(aStackAry3);
}
do
{
const tools::Polygon& rPoly = rPolyPoly.GetObject( i );
sal_uInt16 nSize = rPoly.GetSize();
if ( nSize )
{
pPointAry[j] = nSize;
pPointAryAry[j] = rPoly.GetConstPointAry();
pFlagAryAry[j] = rPoly.GetConstFlagAry();
last = i;
if( pFlagAryAry[j] )
bHaveBezier = true;
++j;
}
++i;
}
while ( i < nPoly );
if ( j == 1 )
{
// #100127# Forward beziers to sal, if any
if( bHaveBezier )
{
if( !mpGraphics->DrawPolygonBezier( *pPointAry, *pPointAryAry, *pFlagAryAry, *this ) )
{
tools::Polygon aPoly = tools::Polygon::SubdivideBezier( rPolyPoly.GetObject( last ) );
mpGraphics->DrawPolygon( aPoly.GetSize(), aPoly.GetConstPointAry(), *this );
}
}
else
{
mpGraphics->DrawPolygon( *pPointAry, *pPointAryAry, *this );
}
}
else
{
// #100127# Forward beziers to sal, if any
if( bHaveBezier )
{
if (!mpGraphics->DrawPolyPolygonBezier(j, pPointAry, pPointAryAry, pFlagAryAry, *this))
{
tools::PolyPolygon aPolyPoly = tools::PolyPolygon::SubdivideBezier( rPolyPoly );
ImplDrawPolyPolygon( aPolyPoly.Count(), aPolyPoly );
}
}
else
{
mpGraphics->DrawPolyPolygon( j, pPointAry, pPointAryAry, *this );
}
}
if ( pPointAry != aStackAry1 )
{
delete[] pPointAry;
delete[] pPointAryAry;
delete[] pFlagAryAry;
}
}
void OutputDevice::ImplDrawPolygon( const tools::Polygon& rPoly, const tools::PolyPolygon* pClipPolyPoly )
{
if( pClipPolyPoly )
{
ImplDrawPolyPolygon( tools::PolyPolygon(rPoly), pClipPolyPoly );
}
else
{
sal_uInt16 nPoints = rPoly.GetSize();
if ( nPoints < 2 )
return;
const Point* pPtAry = rPoly.GetConstPointAry();
mpGraphics->DrawPolygon( nPoints, pPtAry, *this );
}
}
void OutputDevice::ImplDrawPolyPolygon( const tools::PolyPolygon& rPolyPoly, const tools::PolyPolygon* pClipPolyPoly )
{
tools::PolyPolygon* pPolyPoly;
if( pClipPolyPoly )
{
pPolyPoly = new tools::PolyPolygon;
rPolyPoly.GetIntersection( *pClipPolyPoly, *pPolyPoly );
}
else
{
pPolyPoly = const_cast<tools::PolyPolygon*>(&rPolyPoly);
}
if( pPolyPoly->Count() == 1 )
{
const tools::Polygon& rPoly = pPolyPoly->GetObject( 0 );
sal_uInt16 nSize = rPoly.GetSize();
if( nSize >= 2 )
{
const Point* pPtAry = rPoly.GetConstPointAry();
mpGraphics->DrawPolygon( nSize, pPtAry, *this );
}
}
else if( pPolyPoly->Count() )
{
sal_uInt16 nCount = pPolyPoly->Count();
std::unique_ptr<sal_uInt32[]> pPointAry(new sal_uInt32[nCount]);
std::unique_ptr<const Point*[]> pPointAryAry(new const Point*[nCount]);
sal_uInt16 i = 0;
do
{
const tools::Polygon& rPoly = pPolyPoly->GetObject( i );
sal_uInt16 nSize = rPoly.GetSize();
if ( nSize )
{
pPointAry[i] = nSize;
pPointAryAry[i] = rPoly.GetConstPointAry();
i++;
}
else
nCount--;
}
while( i < nCount );
if( nCount == 1 )
mpGraphics->DrawPolygon( pPointAry[0], pPointAryAry[0], *this );
else
mpGraphics->DrawPolyPolygon( nCount, pPointAry.get(), pPointAryAry.get(), *this );
}
if( pClipPolyPoly )
delete pPolyPoly;
}
/* vim:set shiftwidth=4 softtabstop=4 expandtab: */
|