File: | home/maarten/src/libreoffice/core/include/rtl/ref.hxx |
Warning: | line 192, column 9 Use of memory after it is freed |
Press '?' to see keyboard shortcuts
Keyboard shortcuts:
1 | /* -*- Mode: C++; tab-width: 4; indent-tabs-mode: nil; c-basic-offset: 4 -*- */ | |||
2 | /* | |||
3 | * This file is part of the LibreOffice project. | |||
4 | * | |||
5 | * This Source Code Form is subject to the terms of the Mozilla Public | |||
6 | * License, v. 2.0. If a copy of the MPL was not distributed with this | |||
7 | * file, You can obtain one at http://mozilla.org/MPL/2.0/. | |||
8 | * | |||
9 | */ | |||
10 | ||||
11 | #include <test/outputdevice.hxx> | |||
12 | #include <bitmapwriteaccess.hxx> | |||
13 | #include <salgdi.hxx> | |||
14 | ||||
15 | namespace vcl::test { | |||
16 | ||||
17 | namespace | |||
18 | { | |||
19 | ||||
20 | int deltaColor(BitmapColor aColor1, BitmapColor aColor2) | |||
21 | { | |||
22 | int deltaR = std::abs(aColor1.GetRed() - aColor2.GetRed()); | |||
23 | int deltaG = std::abs(aColor1.GetGreen() - aColor2.GetGreen()); | |||
24 | int deltaB = std::abs(aColor1.GetBlue() - aColor2.GetBlue()); | |||
25 | ||||
26 | return std::max(std::max(deltaR, deltaG), deltaB); | |||
27 | } | |||
28 | ||||
29 | void checkValue(BitmapScopedWriteAccess& pAccess, int x, int y, Color aExpected, | |||
30 | int& nNumberOfQuirks, int& nNumberOfErrors, bool bQuirkMode, int nColorDeltaThresh = 0) | |||
31 | { | |||
32 | const bool bColorize = false; | |||
33 | Color aColor = pAccess->GetPixel(y, x); | |||
34 | int nColorDelta = deltaColor(aColor, aExpected); | |||
35 | ||||
36 | if (nColorDelta <= nColorDeltaThresh) | |||
37 | { | |||
38 | if (bColorize) | |||
39 | pAccess->SetPixel(y, x, COL_LIGHTGREEN); | |||
40 | } | |||
41 | else if (bQuirkMode) | |||
42 | { | |||
43 | nNumberOfQuirks++; | |||
44 | if (bColorize) | |||
45 | pAccess->SetPixel(y, x, COL_YELLOW); | |||
46 | } | |||
47 | else | |||
48 | { | |||
49 | nNumberOfErrors++; | |||
50 | if (bColorize) | |||
51 | pAccess->SetPixel(y, x, COL_LIGHTRED); | |||
52 | } | |||
53 | } | |||
54 | ||||
55 | void checkValue(BitmapScopedWriteAccess& pAccess, int x, int y, Color aExpected, | |||
56 | int& nNumberOfQuirks, int& nNumberOfErrors, int nColorDeltaThresh, int nColorDeltaThreshQuirk = 0) | |||
57 | { | |||
58 | const bool bColorize = false; | |||
59 | Color aColor = pAccess->GetPixel(y, x); | |||
60 | int nColorDelta = deltaColor(aColor, aExpected); | |||
61 | nColorDeltaThreshQuirk = std::max( nColorDeltaThresh, nColorDeltaThreshQuirk); | |||
62 | ||||
63 | if (nColorDelta <= nColorDeltaThresh) | |||
64 | { | |||
65 | if (bColorize) | |||
66 | pAccess->SetPixel(y, x, COL_LIGHTGREEN); | |||
67 | } | |||
68 | else if (nColorDelta <= nColorDeltaThreshQuirk) | |||
69 | { | |||
70 | nNumberOfQuirks++; | |||
71 | if (bColorize) | |||
72 | pAccess->SetPixel(y, x, COL_YELLOW); | |||
73 | } | |||
74 | else | |||
75 | { | |||
76 | nNumberOfErrors++; | |||
77 | if (bColorize) | |||
78 | pAccess->SetPixel(y, x, COL_LIGHTRED); | |||
79 | } | |||
80 | } | |||
81 | ||||
82 | // Return all colors in the rectangle and their count. | |||
83 | std::map<Color, int> collectColors(Bitmap& bitmap, const tools::Rectangle& rectangle) | |||
84 | { | |||
85 | std::map<Color, int> colors; | |||
86 | BitmapScopedWriteAccess pAccess(bitmap); | |||
87 | for( long y = rectangle.getY(); y < rectangle.GetHeight(); ++y) | |||
88 | for( long x = rectangle.getX(); x < rectangle.GetWidth(); ++x) | |||
89 | ++colors[pAccess->GetPixel(y, x)]; // operator[] initializes to 0 (default ctor) if creating | |||
90 | return colors; | |||
91 | } | |||
92 | ||||
93 | TestResult checkRect(Bitmap& rBitmap, int aLayerNumber, Color aExpectedColor) | |||
94 | { | |||
95 | BitmapScopedWriteAccess pAccess(rBitmap); | |||
96 | long nHeight = pAccess->Height(); | |||
97 | long nWidth = pAccess->Width(); | |||
98 | ||||
99 | long firstX = 0 + aLayerNumber; | |||
100 | long firstY = 0 + aLayerNumber; | |||
101 | ||||
102 | long lastX = nWidth - aLayerNumber - 1; | |||
103 | long lastY = nHeight - aLayerNumber - 1; | |||
104 | ||||
105 | TestResult aResult = TestResult::Passed; | |||
106 | int nNumberOfQuirks = 0; | |||
107 | int nNumberOfErrors = 0; | |||
108 | ||||
109 | // check corner quirks | |||
110 | checkValue(pAccess, firstX, firstY, aExpectedColor, nNumberOfQuirks, nNumberOfErrors, true); | |||
111 | checkValue(pAccess, lastX, firstY, aExpectedColor, nNumberOfQuirks, nNumberOfErrors, true); | |||
112 | checkValue(pAccess, firstX, lastY, aExpectedColor, nNumberOfQuirks, nNumberOfErrors, true); | |||
113 | checkValue(pAccess, lastX, lastY, aExpectedColor, nNumberOfQuirks, nNumberOfErrors, true); | |||
114 | ||||
115 | for (long y = firstY + 1; y <= lastY - 1; y++) | |||
116 | { | |||
117 | checkValue(pAccess, firstX, y, aExpectedColor, nNumberOfQuirks, nNumberOfErrors, false); | |||
118 | checkValue(pAccess, lastX, y, aExpectedColor, nNumberOfQuirks, nNumberOfErrors, false); | |||
119 | } | |||
120 | for (long x = firstX + 1; x <= lastX - 1; x++) | |||
121 | { | |||
122 | checkValue(pAccess, x, firstY, aExpectedColor, nNumberOfQuirks, nNumberOfErrors, false); | |||
123 | checkValue(pAccess, x, lastY, aExpectedColor, nNumberOfQuirks, nNumberOfErrors, false); | |||
124 | } | |||
125 | if (nNumberOfQuirks > 0) | |||
126 | aResult = TestResult::PassedWithQuirks; | |||
127 | if (nNumberOfErrors > 0) | |||
128 | aResult = TestResult::Failed; | |||
129 | return aResult; | |||
130 | } | |||
131 | ||||
132 | TestResult checkHorizontalVerticalDiagonalLines(Bitmap& rBitmap, Color aExpectedColor, int nColorThresh) | |||
133 | { | |||
134 | BitmapScopedWriteAccess pAccess(rBitmap); | |||
135 | long nWidth = pAccess->Width(); | |||
136 | long nHeight = pAccess->Height(); | |||
137 | ||||
138 | TestResult aResult = TestResult::Passed; | |||
139 | int nNumberOfQuirks = 0; | |||
140 | int nNumberOfErrors = 0; | |||
141 | ||||
142 | // check horizontal line | |||
143 | { | |||
144 | long startX = 4; | |||
145 | long endX = nWidth - 2; | |||
146 | ||||
147 | long y = 1; | |||
148 | ||||
149 | checkValue(pAccess, startX, y, aExpectedColor, nNumberOfQuirks, nNumberOfErrors, true, nColorThresh); | |||
150 | checkValue(pAccess, endX, y, aExpectedColor, nNumberOfQuirks, nNumberOfErrors, true, nColorThresh); | |||
151 | ||||
152 | for (long x = startX + 1; x <= endX - 1; x++) | |||
153 | { | |||
154 | checkValue(pAccess, x, y, aExpectedColor, nNumberOfQuirks, nNumberOfErrors, false, nColorThresh); | |||
155 | } | |||
156 | } | |||
157 | ||||
158 | // check vertical line | |||
159 | { | |||
160 | long startY = 4; | |||
161 | long endY = nHeight - 2; | |||
162 | ||||
163 | long x = 1; | |||
164 | ||||
165 | checkValue(pAccess, x, startY, aExpectedColor, nNumberOfQuirks, nNumberOfErrors, true, nColorThresh); | |||
166 | checkValue(pAccess, x, endY, aExpectedColor, nNumberOfQuirks, nNumberOfErrors, true, nColorThresh); | |||
167 | ||||
168 | for (long y = startY + 1; y <= endY - 1; y++) | |||
169 | { | |||
170 | checkValue(pAccess, x, y, aExpectedColor, nNumberOfQuirks, nNumberOfErrors, false, nColorThresh); | |||
171 | } | |||
172 | } | |||
173 | ||||
174 | // check diagonal line | |||
175 | { | |||
176 | long startX = 1; | |||
177 | long endX = nWidth - 2; | |||
178 | ||||
179 | long startY = 1; | |||
180 | long endY = nHeight - 2; | |||
181 | ||||
182 | long x = startX; | |||
183 | long y = startY; | |||
184 | ||||
185 | checkValue(pAccess, startX, startY, aExpectedColor, nNumberOfQuirks, nNumberOfErrors, true, nColorThresh); | |||
186 | checkValue(pAccess, endX, endY, aExpectedColor, nNumberOfQuirks, nNumberOfErrors, true, nColorThresh); | |||
187 | ||||
188 | x++; y++; | |||
189 | ||||
190 | while(y <= endY - 1 && x <= endX - 1) | |||
191 | { | |||
192 | checkValue(pAccess, x, y, aExpectedColor, nNumberOfQuirks, nNumberOfErrors, false, nColorThresh); | |||
193 | x++; y++; | |||
194 | } | |||
195 | } | |||
196 | ||||
197 | if (nNumberOfQuirks > 0) | |||
198 | aResult = TestResult::PassedWithQuirks; | |||
199 | if (nNumberOfErrors > 0) | |||
200 | aResult = TestResult::Failed; | |||
201 | return aResult; | |||
202 | } | |||
203 | ||||
204 | TestResult checkDiamondLine(Bitmap& rBitmap, int aLayerNumber, Color aExpectedColor) | |||
205 | { | |||
206 | BitmapScopedWriteAccess pAccess(rBitmap); | |||
207 | long nHeight = pAccess->Height(); | |||
208 | long nWidth = pAccess->Width(); | |||
209 | ||||
210 | long midX = nWidth / 2; | |||
211 | long midY = nHeight / 2; | |||
212 | ||||
213 | long firstX = aLayerNumber; | |||
214 | long lastX = nWidth - aLayerNumber - 1; | |||
215 | ||||
216 | long firstY = aLayerNumber; | |||
217 | long lastY = nHeight - aLayerNumber - 1; | |||
218 | ||||
219 | long offsetFromMid = 0; | |||
220 | ||||
221 | TestResult aResult = TestResult::Passed; | |||
222 | int nNumberOfQuirks = 0; | |||
223 | int nNumberOfErrors = 0; | |||
224 | ||||
225 | checkValue(pAccess, firstX, midY, aExpectedColor, nNumberOfQuirks, nNumberOfErrors, true); | |||
226 | checkValue(pAccess, lastX, midY, aExpectedColor, nNumberOfQuirks, nNumberOfErrors, true); | |||
227 | checkValue(pAccess, midX, firstY, aExpectedColor, nNumberOfQuirks, nNumberOfErrors, true); | |||
228 | checkValue(pAccess, midX, lastY, aExpectedColor, nNumberOfQuirks, nNumberOfErrors, true); | |||
229 | ||||
230 | offsetFromMid = 1; | |||
231 | for (long x = firstX + 1; x <= midX - 1; x++) | |||
232 | { | |||
233 | checkValue(pAccess, x, midY - offsetFromMid, aExpectedColor, nNumberOfQuirks, nNumberOfErrors, false); | |||
234 | checkValue(pAccess, x, midY + offsetFromMid, aExpectedColor, nNumberOfQuirks, nNumberOfErrors, false); | |||
235 | ||||
236 | offsetFromMid++; | |||
237 | } | |||
238 | ||||
239 | offsetFromMid = midY - aLayerNumber - 1; | |||
240 | ||||
241 | for (long x = midX + 1; x <= lastX - 1; x++) | |||
242 | { | |||
243 | checkValue(pAccess, x, midY - offsetFromMid, aExpectedColor, nNumberOfQuirks, nNumberOfErrors, false); | |||
244 | checkValue(pAccess, x, midY + offsetFromMid, aExpectedColor, nNumberOfQuirks, nNumberOfErrors, false); | |||
245 | ||||
246 | offsetFromMid--; | |||
247 | } | |||
248 | ||||
249 | if (nNumberOfQuirks > 0) | |||
250 | aResult = TestResult::PassedWithQuirks; | |||
251 | if (nNumberOfErrors > 0) | |||
252 | aResult = TestResult::Failed; | |||
253 | return aResult; | |||
254 | } | |||
255 | ||||
256 | } // end anonymous namespace | |||
257 | ||||
258 | const Color OutputDeviceTestCommon::constBackgroundColor(COL_LIGHTGRAY); | |||
259 | const Color OutputDeviceTestCommon::constLineColor(COL_LIGHTBLUE); | |||
260 | const Color OutputDeviceTestCommon::constFillColor(COL_BLUE); | |||
261 | ||||
262 | OutputDeviceTestCommon::OutputDeviceTestCommon() | |||
263 | {} | |||
264 | ||||
265 | OUString OutputDeviceTestCommon::getRenderBackendName() const | |||
266 | { | |||
267 | if (mpVirtualDevice && mpVirtualDevice->GetGraphics()) | |||
268 | { | |||
269 | SalGraphics const * pGraphics = mpVirtualDevice->GetGraphics(); | |||
270 | return pGraphics->getRenderBackendName(); | |||
271 | } | |||
272 | return OUString(); | |||
273 | } | |||
274 | ||||
275 | void OutputDeviceTestCommon::initialSetup(long nWidth, long nHeight, Color aColor, bool bEnableAA, bool bAlphaVirtualDevice) | |||
276 | { | |||
277 | if (bAlphaVirtualDevice) | |||
| ||||
278 | mpVirtualDevice = VclPtr<VirtualDevice>::Create(DeviceFormat::DEFAULT, DeviceFormat::DEFAULT); | |||
279 | else | |||
280 | mpVirtualDevice = VclPtr<VirtualDevice>::Create(DeviceFormat::DEFAULT); | |||
281 | ||||
282 | maVDRectangle = tools::Rectangle(Point(), Size (nWidth, nHeight)); | |||
283 | mpVirtualDevice->SetOutputSizePixel(maVDRectangle.GetSize()); | |||
284 | if (bEnableAA) | |||
285 | mpVirtualDevice->SetAntialiasing(AntialiasingFlags::Enable | AntialiasingFlags::PixelSnapHairline); | |||
286 | else | |||
287 | mpVirtualDevice->SetAntialiasing(AntialiasingFlags::NONE); | |||
288 | mpVirtualDevice->SetBackground(Wallpaper(aColor)); | |||
289 | mpVirtualDevice->Erase(); | |||
290 | } | |||
291 | ||||
292 | TestResult OutputDeviceTestCommon::checkLines(Bitmap& rBitmap) | |||
293 | { | |||
294 | return checkHorizontalVerticalDiagonalLines(rBitmap, constLineColor, 0); | |||
295 | } | |||
296 | ||||
297 | TestResult OutputDeviceTestCommon::checkAALines(Bitmap& rBitmap) | |||
298 | { | |||
299 | return checkHorizontalVerticalDiagonalLines(rBitmap, constLineColor, 30); // 30 color values threshold delta | |||
300 | } | |||
301 | ||||
302 | static void checkResult(TestResult eResult, TestResult & eTotal) | |||
303 | { | |||
304 | if (eTotal == TestResult::Failed) | |||
305 | return; | |||
306 | ||||
307 | if (eResult == TestResult::Failed) | |||
308 | eTotal = TestResult::Failed; | |||
309 | ||||
310 | if (eResult == TestResult::PassedWithQuirks) | |||
311 | eTotal = TestResult::PassedWithQuirks; | |||
312 | } | |||
313 | ||||
314 | TestResult OutputDeviceTestCommon::checkInvertRectangle(Bitmap& aBitmap) | |||
315 | { | |||
316 | TestResult aReturnValue = TestResult::Passed; | |||
317 | TestResult eResult; | |||
318 | ||||
319 | std::vector<Color> aExpected{ COL_WHITE, COL_WHITE }; | |||
320 | eResult = checkRectangles(aBitmap, aExpected); | |||
321 | checkResult(eResult, aReturnValue); | |||
322 | ||||
323 | eResult = checkFilled(aBitmap, tools::Rectangle(Point(2, 2), Size(8, 8)), COL_LIGHTCYAN); | |||
324 | checkResult(eResult, aReturnValue); | |||
325 | ||||
326 | eResult = checkFilled(aBitmap, tools::Rectangle(Point(10, 2), Size(8, 8)), COL_LIGHTMAGENTA); | |||
327 | checkResult(eResult, aReturnValue); | |||
328 | ||||
329 | eResult = checkFilled(aBitmap, tools::Rectangle(Point(2, 10), Size(8, 8)), COL_YELLOW); | |||
330 | checkResult(eResult, aReturnValue); | |||
331 | ||||
332 | eResult = checkFilled(aBitmap, tools::Rectangle(Point(10, 10), Size(8, 8)), COL_BLACK); | |||
333 | checkResult(eResult, aReturnValue); | |||
334 | ||||
335 | return aReturnValue; | |||
336 | } | |||
337 | ||||
338 | TestResult OutputDeviceTestCommon::checkChecker(Bitmap& rBitmap, sal_Int32 nStartX, sal_Int32 nEndX, sal_Int32 nStartY, sal_Int32 nEndY, std::vector<Color> const & rExpected) | |||
339 | { | |||
340 | TestResult aReturnValue = TestResult::Passed; | |||
341 | ||||
342 | int choice = 0; | |||
343 | for (sal_Int32 y = nStartY; y <= nEndY; ++y) | |||
344 | { | |||
345 | for (sal_Int32 x = nStartX; x <= nEndX; ++x) | |||
346 | { | |||
347 | TestResult eResult = checkFilled(rBitmap, tools::Rectangle(Point(x, y), Size(1, 1)), rExpected[choice % 2]); | |||
348 | checkResult(eResult, aReturnValue); | |||
349 | choice++; | |||
350 | } | |||
351 | choice++; | |||
352 | } | |||
353 | return aReturnValue; | |||
354 | } | |||
355 | ||||
356 | TestResult OutputDeviceTestCommon::checkInvertN50Rectangle(Bitmap& aBitmap) | |||
357 | { | |||
358 | TestResult aReturnValue = TestResult::Passed; | |||
359 | TestResult eResult; | |||
360 | ||||
361 | std::vector<Color> aExpected{ COL_WHITE, COL_WHITE }; | |||
362 | eResult = checkRectangles(aBitmap, aExpected); | |||
363 | checkResult(eResult, aReturnValue); | |||
364 | ||||
365 | eResult = checkChecker(aBitmap, 2, 9, 2, 9, { COL_LIGHTCYAN, COL_LIGHTRED }); | |||
366 | checkResult(eResult, aReturnValue); | |||
367 | eResult = checkChecker(aBitmap, 2, 9, 10, 17, { COL_YELLOW, COL_LIGHTBLUE }); | |||
368 | checkResult(eResult, aReturnValue); | |||
369 | eResult = checkChecker(aBitmap, 10, 17, 2, 9, { COL_LIGHTMAGENTA, COL_LIGHTGREEN }); | |||
370 | checkResult(eResult, aReturnValue); | |||
371 | eResult = checkChecker(aBitmap, 10, 17, 10, 17, { COL_BLACK, COL_WHITE }); | |||
372 | checkResult(eResult, aReturnValue); | |||
373 | ||||
374 | return aReturnValue; | |||
375 | } | |||
376 | ||||
377 | TestResult OutputDeviceTestCommon::checkInvertTrackFrameRectangle(Bitmap& aBitmap) | |||
378 | { | |||
379 | std::vector<Color> aExpected | |||
380 | { | |||
381 | COL_WHITE, COL_WHITE | |||
382 | }; | |||
383 | return checkRectangles(aBitmap, aExpected); | |||
384 | } | |||
385 | ||||
386 | TestResult OutputDeviceTestCommon::checkRectangle(Bitmap& aBitmap) | |||
387 | { | |||
388 | std::vector<Color> aExpected | |||
389 | { | |||
390 | constBackgroundColor, constBackgroundColor, constLineColor, | |||
391 | constBackgroundColor, constBackgroundColor, constLineColor, constBackgroundColor | |||
392 | }; | |||
393 | return checkRectangles(aBitmap, aExpected); | |||
394 | } | |||
395 | ||||
396 | TestResult OutputDeviceTestCommon::checkRectangleAA(Bitmap& aBitmap) | |||
397 | { | |||
398 | std::vector<Color> aExpected | |||
399 | { | |||
400 | constBackgroundColor, constBackgroundColor, constLineColor, | |||
401 | constBackgroundColor, constBackgroundColor, constLineColor, constBackgroundColor | |||
402 | }; | |||
403 | return checkRectangles(aBitmap, aExpected); | |||
404 | } | |||
405 | ||||
406 | TestResult OutputDeviceTestCommon::checkFilledRectangle(Bitmap& aBitmap, bool useLineColor) | |||
407 | { | |||
408 | std::vector<Color> aExpected | |||
409 | { | |||
410 | constBackgroundColor, constBackgroundColor, | |||
411 | useLineColor ? constLineColor : constFillColor, | |||
412 | constFillColor, constFillColor, constFillColor, constFillColor | |||
413 | }; | |||
414 | return checkRectangles(aBitmap, aExpected); | |||
415 | } | |||
416 | ||||
417 | TestResult OutputDeviceTestCommon::checkFilled(Bitmap& rBitmap, tools::Rectangle aRectangle, Color aExpectedColor) | |||
418 | { | |||
419 | BitmapScopedWriteAccess pAccess(rBitmap); | |||
420 | ||||
421 | TestResult aResult = TestResult::Passed; | |||
422 | int nNumberOfQuirks = 0; | |||
423 | int nNumberOfErrors = 0; | |||
424 | ||||
425 | for (long y = aRectangle.Top(); y < aRectangle.Top() + aRectangle.GetHeight(); y++) | |||
426 | { | |||
427 | for (long x = aRectangle.Left(); x < aRectangle.Left() + aRectangle.GetWidth(); x++) | |||
428 | { | |||
429 | checkValue(pAccess, x, y, aExpectedColor, nNumberOfQuirks, nNumberOfErrors, false); | |||
430 | } | |||
431 | } | |||
432 | ||||
433 | if (nNumberOfQuirks > 0) | |||
434 | aResult = TestResult::PassedWithQuirks; | |||
435 | ||||
436 | if (nNumberOfErrors > 0) | |||
437 | aResult = TestResult::Failed; | |||
438 | ||||
439 | return aResult; | |||
440 | } | |||
441 | ||||
442 | TestResult OutputDeviceTestCommon::checkRectangles(Bitmap& aBitmap, std::vector<Color>& aExpectedColors) | |||
443 | { | |||
444 | TestResult aReturnValue = TestResult::Passed; | |||
445 | for (size_t i = 0; i < aExpectedColors.size(); i++) | |||
446 | { | |||
447 | TestResult eResult = checkRect(aBitmap, i, aExpectedColors[i]); | |||
448 | ||||
449 | if (eResult == TestResult::Failed) | |||
450 | aReturnValue = TestResult::Failed; | |||
451 | if (eResult == TestResult::PassedWithQuirks && aReturnValue != TestResult::Failed) | |||
452 | aReturnValue = TestResult::PassedWithQuirks; | |||
453 | } | |||
454 | return aReturnValue; | |||
455 | } | |||
456 | ||||
457 | TestResult OutputDeviceTestCommon::checkRectangle(Bitmap& rBitmap, int aLayerNumber, Color aExpectedColor) | |||
458 | { | |||
459 | return checkRect(rBitmap, aLayerNumber, aExpectedColor); | |||
460 | } | |||
461 | ||||
462 | tools::Rectangle OutputDeviceTestCommon::alignToCenter(tools::Rectangle aRect1, tools::Rectangle aRect2) | |||
463 | { | |||
464 | Point aPoint((aRect1.GetWidth() / 2.0) - (aRect2.GetWidth() / 2.0), | |||
465 | (aRect1.GetHeight() / 2.0) - (aRect2.GetHeight() / 2.0)); | |||
466 | ||||
467 | return tools::Rectangle(aPoint, aRect2.GetSize()); | |||
468 | } | |||
469 | ||||
470 | TestResult OutputDeviceTestCommon::checkDiamond(Bitmap& rBitmap) | |||
471 | { | |||
472 | return checkDiamondLine(rBitmap, 1, constLineColor); | |||
473 | } | |||
474 | ||||
475 | void OutputDeviceTestCommon::createDiamondPoints(tools::Rectangle rRect, int nOffset, | |||
476 | Point& rPoint1, Point& rPoint2, | |||
477 | Point& rPoint3, Point& rPoint4) | |||
478 | { | |||
479 | long midPointX = rRect.Left() + (rRect.Right() - rRect.Left()) / 2.0; | |||
480 | long midPointY = rRect.Top() + (rRect.Bottom() - rRect.Top()) / 2.0; | |||
481 | ||||
482 | rPoint1 = Point(midPointX , midPointY - nOffset); | |||
483 | rPoint2 = Point(midPointX + nOffset, midPointY ); | |||
484 | rPoint3 = Point(midPointX , midPointY + nOffset); | |||
485 | rPoint4 = Point(midPointX - nOffset, midPointY ); | |||
486 | } | |||
487 | ||||
488 | void OutputDeviceTestCommon::createHorizontalVerticalDiagonalLinePoints(tools::Rectangle rRect, | |||
489 | Point& rHorizontalLinePoint1, Point& rHorizontalLinePoint2, | |||
490 | Point& rVerticalLinePoint1, Point& rVerticalLinePoint2, | |||
491 | Point& rDiagonalLinePoint1, Point& rDiagonalLinePoint2) | |||
492 | { | |||
493 | rHorizontalLinePoint1 = Point(4, 1); | |||
494 | rHorizontalLinePoint2 = Point(rRect.Right() - 1, 1); | |||
495 | ||||
496 | rVerticalLinePoint1 = Point(1, 4); | |||
497 | rVerticalLinePoint2 = Point(1,rRect.Bottom() - 1); | |||
498 | ||||
499 | rDiagonalLinePoint1 = Point(1, 1); | |||
500 | rDiagonalLinePoint2 = Point(rRect.Right() - 1, rRect.Bottom() - 1); | |||
501 | } | |||
502 | ||||
503 | TestResult OutputDeviceTestCommon::checkBezier(Bitmap& rBitmap) | |||
504 | { | |||
505 | std::vector<Color> aExpected | |||
506 | { | |||
507 | constBackgroundColor, constBackgroundColor | |||
508 | }; | |||
509 | // Check the bezier doesn't go over to the margins first | |||
510 | // TODO extend the check with more exact assert | |||
511 | return checkRectangles(rBitmap, aExpected); | |||
512 | } | |||
513 | ||||
514 | // Check 'count' pixels from (x,y) in (addX,addY) direction, the color values must not decrease. | |||
515 | static bool checkGradient(BitmapScopedWriteAccess& pAccess, int x, int y, int count, int addX, int addY) | |||
516 | { | |||
517 | const bool bColorize = false; | |||
518 | Color maxColor = COL_BLACK; | |||
519 | for( int i = 0; i < count; ++i ) | |||
520 | { | |||
521 | Color color = pAccess->GetPixel(y, x); | |||
522 | if( color.GetRed() < maxColor.GetRed() || color.GetGreen() < maxColor.GetGreen() || color.GetBlue() < maxColor.GetBlue()) | |||
523 | { | |||
524 | if (bColorize) | |||
525 | pAccess->SetPixel(y, x, COL_RED); | |||
526 | return false; | |||
527 | } | |||
528 | maxColor = color; | |||
529 | if (bColorize) | |||
530 | pAccess->SetPixel(y, x, COL_LIGHTGREEN); | |||
531 | x += addX; | |||
532 | y += addY; | |||
533 | } | |||
534 | return true; | |||
535 | } | |||
536 | ||||
537 | TestResult OutputDeviceTestCommon::checkLinearGradient(Bitmap& bitmap) | |||
538 | { | |||
539 | BitmapScopedWriteAccess pAccess(bitmap); | |||
540 | TestResult aResult = TestResult::Passed; | |||
541 | int nNumberOfQuirks = 0; | |||
542 | int nNumberOfErrors = 0; | |||
543 | ||||
544 | // The lowest line is missing in the default VCL implementation => quirk. | |||
545 | checkValue(pAccess, 1, 10, COL_WHITE, nNumberOfQuirks, nNumberOfErrors, true, 255 / 10); | |||
546 | checkValue(pAccess, 10, 10, COL_BLACK, nNumberOfQuirks, nNumberOfErrors, true, 255 / 10); | |||
547 | for(int y = 1; y < 10; ++y) | |||
548 | { | |||
549 | checkValue(pAccess, 1, y, COL_WHITE, nNumberOfQuirks, nNumberOfErrors, 255 / 10); | |||
550 | checkValue(pAccess, 10, y, COL_BLACK, nNumberOfQuirks, nNumberOfErrors, 255 / 10); | |||
551 | } | |||
552 | for(int y = 1; y < 10; ++y) | |||
553 | if( !checkGradient( pAccess, 10, y, 10, -1, 0 )) | |||
554 | return TestResult::Failed; | |||
555 | if (nNumberOfQuirks > 0) | |||
556 | checkResult(TestResult::PassedWithQuirks, aResult); | |||
557 | if (nNumberOfErrors > 0) | |||
558 | checkResult(TestResult::Failed, aResult); | |||
559 | return aResult; | |||
560 | } | |||
561 | ||||
562 | TestResult OutputDeviceTestCommon::checkLinearGradientAngled(Bitmap& bitmap) | |||
563 | { | |||
564 | BitmapScopedWriteAccess pAccess(bitmap); | |||
565 | TestResult aResult = TestResult::Passed; | |||
566 | int nNumberOfQuirks = 0; | |||
567 | int nNumberOfErrors = 0; | |||
568 | ||||
569 | // The top-left pixel is not white but gray in the default VCL implementation => quirk. | |||
570 | checkValue(pAccess, 1, 1, COL_WHITE, nNumberOfQuirks, nNumberOfErrors, 50); | |||
571 | checkValue(pAccess, 10, 10, COL_BLACK, nNumberOfQuirks, nNumberOfErrors, 0, 255 / 10); // Bottom-right. | |||
572 | // Main diagonal. | |||
573 | if( !checkGradient( pAccess, 10, 10, 10, -1, -1 )) | |||
574 | return TestResult::Failed; | |||
575 | if (nNumberOfQuirks > 0) | |||
576 | checkResult(TestResult::PassedWithQuirks, aResult); | |||
577 | if (nNumberOfErrors > 0) | |||
578 | checkResult(TestResult::Failed, aResult); | |||
579 | return TestResult::Passed; | |||
580 | } | |||
581 | ||||
582 | TestResult OutputDeviceTestCommon::checkLinearGradientBorder(Bitmap& bitmap) | |||
583 | { | |||
584 | TestResult aResult = TestResult::Passed; | |||
585 | // Top half is border. | |||
586 | checkResult(checkFilled(bitmap, tools::Rectangle(Point(1, 1), Size(10, 5)), COL_WHITE), aResult); | |||
587 | BitmapScopedWriteAccess pAccess(bitmap); | |||
588 | int nNumberOfQuirks = 0; | |||
589 | int nNumberOfErrors = 0; | |||
590 | for(int x = 1; x <= 10; ++x) | |||
591 | { | |||
592 | checkValue(pAccess, x, 10, COL_BLACK, nNumberOfQuirks, nNumberOfErrors, 255 / 10, 255 / 5); | |||
593 | if( !checkGradient( pAccess, x, 10, 5, 0, -1 )) | |||
594 | return TestResult::Failed; | |||
595 | } | |||
596 | if (nNumberOfQuirks > 0) | |||
597 | checkResult(TestResult::PassedWithQuirks, aResult); | |||
598 | if (nNumberOfErrors > 0) | |||
599 | checkResult(TestResult::Failed, aResult); | |||
600 | return aResult; | |||
601 | } | |||
602 | ||||
603 | TestResult OutputDeviceTestCommon::checkLinearGradientIntensity(Bitmap& bitmap) | |||
604 | { | |||
605 | BitmapScopedWriteAccess pAccess(bitmap); | |||
606 | TestResult aResult = TestResult::Passed; | |||
607 | int nNumberOfQuirks = 0; | |||
608 | int nNumberOfErrors = 0; | |||
609 | ||||
610 | for(int x = 1; x <= 10; ++x) | |||
611 | { | |||
612 | // The gradient starts at half intensity, i.e. white's 255's are halved. | |||
613 | checkValue(pAccess, x, 1, Color(128,128,128), nNumberOfQuirks, nNumberOfErrors, false, 10); | |||
614 | checkValue(pAccess, x, 10, COL_BLACK, nNumberOfQuirks, nNumberOfErrors, 255 / 10); | |||
615 | if( !checkGradient( pAccess, x, 10, 10, 0, -1 )) | |||
616 | return TestResult::Failed; | |||
617 | } | |||
618 | if (nNumberOfQuirks > 0) | |||
619 | checkResult(TestResult::PassedWithQuirks, aResult); | |||
620 | if (nNumberOfErrors > 0) | |||
621 | checkResult(TestResult::Failed, aResult); | |||
622 | return aResult; | |||
623 | } | |||
624 | ||||
625 | TestResult OutputDeviceTestCommon::checkLinearGradientSteps(Bitmap& bitmap) | |||
626 | { | |||
627 | // Reuse the basic linear gradient check. | |||
628 | TestResult aResult = checkLinearGradient(bitmap); | |||
629 | // Only 4 steps in the gradient, there should be only 4 colors. | |||
630 | if( collectColors( bitmap, tools::Rectangle( Point( 1, 1 ), Size( 10, 10 ))).size() != 4 ) | |||
631 | return TestResult::Failed; | |||
632 | return aResult; | |||
633 | } | |||
634 | ||||
635 | TestResult OutputDeviceTestCommon::checkAxialGradient(Bitmap& bitmap) | |||
636 | { | |||
637 | BitmapScopedWriteAccess pAccess(bitmap); | |||
638 | TestResult aResult = TestResult::Passed; | |||
639 | int nNumberOfQuirks = 0; | |||
640 | int nNumberOfErrors = 0; | |||
641 | ||||
642 | for(int y = 1; y <= 11; ++y) | |||
643 | { | |||
644 | // Middle horizontal line is white, gradients to the sides. | |||
645 | checkValue(pAccess, 6, y, COL_WHITE, nNumberOfQuirks, nNumberOfErrors, false); | |||
646 | checkValue(pAccess, 1, y, COL_BLACK, nNumberOfQuirks, nNumberOfErrors, false); | |||
647 | checkValue(pAccess, 11, y, COL_BLACK, nNumberOfQuirks, nNumberOfErrors, false); | |||
648 | if( !checkGradient( pAccess, 1, y, 6, 1, 0 )) | |||
649 | return TestResult::Failed; | |||
650 | if( !checkGradient( pAccess, 11, y, 6, -1, 0 )) | |||
651 | return TestResult::Failed; | |||
652 | } | |||
653 | if (nNumberOfQuirks > 0) | |||
654 | checkResult(TestResult::PassedWithQuirks, aResult); | |||
655 | if (nNumberOfErrors > 0) | |||
656 | checkResult(TestResult::Failed, aResult); | |||
657 | return aResult; | |||
658 | } | |||
659 | ||||
660 | TestResult OutputDeviceTestCommon::checkRadialGradient(Bitmap& bitmap) | |||
661 | { | |||
662 | BitmapScopedWriteAccess pAccess(bitmap); | |||
663 | TestResult aResult = TestResult::Passed; | |||
664 | int nNumberOfQuirks = 0; | |||
665 | int nNumberOfErrors = 0; | |||
666 | // The default VCL implementation is off-center in the direction to the top-left. | |||
667 | // This means not all corners will be pure white => quirks. | |||
668 | checkValue(pAccess, 1, 1, COL_WHITE, nNumberOfQuirks, nNumberOfErrors, 255 / 10, 255 / 3); | |||
669 | checkValue(pAccess, 1, 10, COL_WHITE, nNumberOfQuirks, nNumberOfErrors, 255 / 10, 255 / 5); | |||
670 | checkValue(pAccess, 10, 1, COL_WHITE, nNumberOfQuirks, nNumberOfErrors, 255 / 10, 255 / 5); | |||
671 | checkValue(pAccess, 10, 10, COL_WHITE, nNumberOfQuirks, nNumberOfErrors, 255 / 10, 255 / 5); | |||
672 | // And not all centers will be pure black => quirks. | |||
673 | checkValue(pAccess, 5, 5, COL_BLACK, nNumberOfQuirks, nNumberOfErrors, 255 / 10, 255 / 5); | |||
674 | checkValue(pAccess, 5, 6, COL_BLACK, nNumberOfQuirks, nNumberOfErrors, 255 / 10, 255 / 3); | |||
675 | checkValue(pAccess, 6, 5, COL_BLACK, nNumberOfQuirks, nNumberOfErrors, 255 / 10, 255 / 3); | |||
676 | checkValue(pAccess, 6, 6, COL_BLACK, nNumberOfQuirks, nNumberOfErrors, 255 / 10, 255 / 2); | |||
677 | // Check diagonals, from the offset center. | |||
678 | if(!checkGradient(pAccess, 5, 5, 5, -1, -1)) | |||
679 | return TestResult::Failed; | |||
680 | if(!checkGradient(pAccess, 5, 5, 6, 1, 1)) | |||
681 | return TestResult::Failed; | |||
682 | if(!checkGradient(pAccess, 5, 5, 5, 1, -1)) | |||
683 | return TestResult::Failed; | |||
684 | if(!checkGradient(pAccess, 5, 5, 5, -1, 1)) | |||
685 | return TestResult::Failed; | |||
686 | if (nNumberOfQuirks > 0) | |||
687 | checkResult(TestResult::PassedWithQuirks, aResult); | |||
688 | if (nNumberOfErrors > 0) | |||
689 | checkResult(TestResult::Failed, aResult); | |||
690 | return aResult; | |||
691 | } | |||
692 | ||||
693 | TestResult OutputDeviceTestCommon::checkRadialGradientOfs(Bitmap& bitmap) | |||
694 | { | |||
695 | BitmapScopedWriteAccess pAccess(bitmap); | |||
696 | TestResult aResult = TestResult::Passed; | |||
697 | int nNumberOfQuirks = 0; | |||
698 | int nNumberOfErrors = 0; | |||
699 | checkValue(pAccess, 1, 1, COL_WHITE, nNumberOfQuirks, nNumberOfErrors, 255 / 10, 255 / 5); | |||
700 | checkValue(pAccess, 10, 1, COL_WHITE, nNumberOfQuirks, nNumberOfErrors, 255 / 10, 255 / 5); | |||
701 | checkValue(pAccess, 1, 10, COL_WHITE, nNumberOfQuirks, nNumberOfErrors, 255 / 10, 255 / 5); | |||
702 | checkValue(pAccess, 10, 10, COL_BLACK, nNumberOfQuirks, nNumberOfErrors, 255 / 10, 255 / 5); | |||
703 | // Check gradients from the center (=bottom-right corner). | |||
704 | if(!checkGradient(pAccess, 10, 10, 10, -1, -1)) | |||
705 | return TestResult::Failed; | |||
706 | if(!checkGradient(pAccess, 10, 10, 10, -1, 0)) | |||
707 | return TestResult::Failed; | |||
708 | if(!checkGradient(pAccess, 10, 10, 10, 0, -1)) | |||
709 | return TestResult::Failed; | |||
710 | if (nNumberOfQuirks > 0) | |||
711 | checkResult(TestResult::PassedWithQuirks, aResult); | |||
712 | if (nNumberOfErrors > 0) | |||
713 | checkResult(TestResult::Failed, aResult); | |||
714 | return aResult; | |||
715 | } | |||
716 | ||||
717 | } // end namespace vcl::test | |||
718 | ||||
719 | /* vim:set shiftwidth=4 softtabstop=4 expandtab: */ |
1 | /* -*- Mode: C++; tab-width: 4; indent-tabs-mode: nil; c-basic-offset: 4 -*- */ |
2 | /* |
3 | * This file is part of the LibreOffice project. |
4 | * |
5 | * This Source Code Form is subject to the terms of the Mozilla Public |
6 | * License, v. 2.0. If a copy of the MPL was not distributed with this |
7 | * file, You can obtain one at http://mozilla.org/MPL/2.0/. |
8 | * |
9 | * This file incorporates work covered by the following license notice: |
10 | * |
11 | * Licensed to the Apache Software Foundation (ASF) under one or more |
12 | * contributor license agreements. See the NOTICE file distributed |
13 | * with this work for additional information regarding copyright |
14 | * ownership. The ASF licenses this file to you under the Apache |
15 | * License, Version 2.0 (the "License"); you may not use this file |
16 | * except in compliance with the License. You may obtain a copy of |
17 | * the License at http://www.apache.org/licenses/LICENSE-2.0 . |
18 | */ |
19 | |
20 | #ifndef INCLUDED_VCL_PTR_HXX |
21 | #define INCLUDED_VCL_PTR_HXX |
22 | |
23 | #include <sal/config.h> |
24 | |
25 | #include <rtl/ref.hxx> |
26 | |
27 | #include <utility> |
28 | #include <type_traits> |
29 | |
30 | #ifdef DBG_UTIL |
31 | #ifndef _WIN32 |
32 | #include <vcl/vclmain.hxx> |
33 | #endif |
34 | #endif |
35 | |
36 | class VclReferenceBase; |
37 | |
38 | namespace vcl::detail { |
39 | |
40 | template<typename> |
41 | constexpr bool isIncompleteOrDerivedFromVclReferenceBase(...) { return true; } |
42 | |
43 | template<typename T> constexpr bool isIncompleteOrDerivedFromVclReferenceBase( |
44 | int (*)[sizeof(T)]) |
45 | { return std::is_base_of<VclReferenceBase, T>::value; } |
46 | |
47 | } // namespace vcl::detail |
48 | |
49 | /** |
50 | * A thin wrapper around rtl::Reference to implement the acquire and dispose semantics we want for references to vcl::Window subclasses. |
51 | * |
52 | * For more details on the design please see vcl/README.lifecycle |
53 | * |
54 | * @param reference_type must be a subclass of vcl::Window |
55 | */ |
56 | template <class reference_type> |
57 | class VclPtr |
58 | { |
59 | static_assert( |
60 | vcl::detail::isIncompleteOrDerivedFromVclReferenceBase<reference_type>( |
61 | nullptr), |
62 | "template argument type must be derived from VclReferenceBase"); |
63 | |
64 | ::rtl::Reference<reference_type> m_rInnerRef; |
65 | |
66 | public: |
67 | /** Constructor... |
68 | */ |
69 | VclPtr() |
70 | : m_rInnerRef() |
71 | {} |
72 | |
73 | /** Constructor... |
74 | */ |
75 | VclPtr (reference_type * pBody) |
76 | : m_rInnerRef(pBody) |
77 | {} |
78 | |
79 | /** Constructor... that doesn't take a ref. |
80 | */ |
81 | VclPtr (reference_type * pBody, __sal_NoAcquire) |
82 | : m_rInnerRef(pBody, SAL_NO_ACQUIRE) |
83 | {} |
84 | |
85 | /** Up-casting conversion constructor: Copies interface reference. |
86 | |
87 | Does not work for up-casts to ambiguous bases. For the special case of |
88 | up-casting to Reference< XInterface >, see the corresponding conversion |
89 | operator. |
90 | |
91 | @param rRef another reference |
92 | */ |
93 | template< class derived_type > |
94 | VclPtr( |
95 | const VclPtr< derived_type > & rRef, |
96 | typename std::enable_if< |
97 | std::is_base_of<reference_type, derived_type>::value, int>::type |
98 | = 0 ) |
99 | : m_rInnerRef( static_cast<reference_type*>(rRef) ) |
100 | { |
101 | } |
102 | |
103 | #if defined(DBG_UTIL) && !defined(_WIN32) |
104 | virtual ~VclPtr() |
105 | { |
106 | assert(m_rInnerRef.get() == nullptr || vclmain::isAlive())(static_cast <bool> (m_rInnerRef.get() == nullptr || vclmain ::isAlive()) ? void (0) : __assert_fail ("m_rInnerRef.get() == nullptr || vclmain::isAlive()" , "/home/maarten/src/libreoffice/core/include/vcl/vclptr.hxx" , 106, __extension__ __PRETTY_FUNCTION__)); |
107 | // We can be one of the intermediate counts, but if we are the last |
108 | // VclPtr keeping this object alive, then something forgot to call dispose(). |
109 | assert((!m_rInnerRef.get() || m_rInnerRef->isDisposed() || m_rInnerRef->getRefCount() > 1)(static_cast <bool> ((!m_rInnerRef.get() || m_rInnerRef ->isDisposed() || m_rInnerRef->getRefCount() > 1) && "someone forgot to call dispose()") ? void (0) : __assert_fail ("(!m_rInnerRef.get() || m_rInnerRef->isDisposed() || m_rInnerRef->getRefCount() > 1) && \"someone forgot to call dispose()\"" , "/home/maarten/src/libreoffice/core/include/vcl/vclptr.hxx" , 110, __extension__ __PRETTY_FUNCTION__)) |
110 | && "someone forgot to call dispose()")(static_cast <bool> ((!m_rInnerRef.get() || m_rInnerRef ->isDisposed() || m_rInnerRef->getRefCount() > 1) && "someone forgot to call dispose()") ? void (0) : __assert_fail ("(!m_rInnerRef.get() || m_rInnerRef->isDisposed() || m_rInnerRef->getRefCount() > 1) && \"someone forgot to call dispose()\"" , "/home/maarten/src/libreoffice/core/include/vcl/vclptr.hxx" , 110, __extension__ __PRETTY_FUNCTION__)); |
111 | } |
112 | VclPtr(VclPtr const &) = default; |
113 | VclPtr(VclPtr &&) = default; |
114 | VclPtr & operator =(VclPtr const &) = default; |
115 | VclPtr & operator =(VclPtr &&) = default; |
116 | #endif |
117 | |
118 | /** |
119 | * A construction helper for VclPtr. Since VclPtr types are created |
120 | * with a reference-count of one - to help fit into the existing |
121 | * code-flow; this helps us to construct them easily. |
122 | * |
123 | * For more details on the design please see vcl/README.lifecycle |
124 | * |
125 | * @tparam reference_type must be a subclass of vcl::Window |
126 | */ |
127 | template<typename... Arg> [[nodiscard]] static VclPtr< reference_type > Create(Arg &&... arg) |
128 | { |
129 | return VclPtr< reference_type >( new reference_type(std::forward<Arg>(arg)...), SAL_NO_ACQUIRE ); |
130 | } |
131 | |
132 | /** Probably most common used: handle->someBodyOp(). |
133 | */ |
134 | reference_type * operator->() const |
135 | { |
136 | return m_rInnerRef.get(); |
137 | } |
138 | |
139 | /** Get the body. Can be used instead of operator->(). |
140 | I.e. handle->someBodyOp() and handle.get()->someBodyOp() |
141 | are the same. |
142 | */ |
143 | reference_type * get() const |
144 | { |
145 | return m_rInnerRef.get(); |
146 | } |
147 | |
148 | void set(reference_type *pBody) |
149 | { |
150 | m_rInnerRef.set(pBody); |
151 | } |
152 | |
153 | void reset(reference_type *pBody) |
154 | { |
155 | m_rInnerRef.set(pBody); |
156 | } |
157 | |
158 | /** Up-casting copy assignment operator. |
159 | |
160 | Does not work for up-casts to ambiguous bases. |
161 | |
162 | @param rRef another reference |
163 | */ |
164 | template<typename derived_type> |
165 | typename std::enable_if< |
166 | std::is_base_of<reference_type, derived_type>::value, |
167 | VclPtr &>::type |
168 | operator =(VclPtr<derived_type> const & rRef) |
169 | { |
170 | m_rInnerRef.set(rRef.get()); |
171 | return *this; |
172 | } |
173 | |
174 | VclPtr & operator =(reference_type * pBody) |
175 | { |
176 | m_rInnerRef.set(pBody); |
177 | return *this; |
178 | } |
179 | |
180 | operator reference_type * () const |
181 | { |
182 | return m_rInnerRef.get(); |
183 | } |
184 | |
185 | explicit operator bool () const |
186 | { |
187 | return m_rInnerRef.get() != nullptr; |
188 | } |
189 | |
190 | void clear() |
191 | { |
192 | m_rInnerRef.clear(); |
193 | } |
194 | |
195 | void reset() |
196 | { |
197 | m_rInnerRef.clear(); |
198 | } |
199 | |
200 | void disposeAndClear() |
201 | { |
202 | // hold it alive for the lifetime of this method |
203 | ::rtl::Reference<reference_type> aTmp(m_rInnerRef); |
204 | m_rInnerRef.clear(); // we should use some 'swap' method ideally ;-) |
205 | if (aTmp.get()) { |
206 | aTmp->disposeOnce(); |
207 | } |
208 | } |
209 | |
210 | /** Needed to place VclPtr's into STL collection. |
211 | */ |
212 | bool operator< (const VclPtr<reference_type> & handle) const |
213 | { |
214 | return (m_rInnerRef < handle.m_rInnerRef); |
215 | } |
216 | }; // class VclPtr |
217 | |
218 | template<typename T1, typename T2> |
219 | inline bool operator ==(VclPtr<T1> const & p1, VclPtr<T2> const & p2) { |
220 | return p1.get() == p2.get(); |
221 | } |
222 | |
223 | template<typename T> inline bool operator ==(VclPtr<T> const & p1, T const * p2) |
224 | { |
225 | return p1.get() == p2; |
226 | } |
227 | |
228 | template<typename T> inline bool operator ==(VclPtr<T> const & p1, T * p2) { |
229 | return p1.get() == p2; |
230 | } |
231 | |
232 | template<typename T> inline bool operator ==(T const * p1, VclPtr<T> const & p2) |
233 | { |
234 | return p1 == p2.get(); |
235 | } |
236 | |
237 | template<typename T> inline bool operator ==(T * p1, VclPtr<T> const & p2) { |
238 | return p1 == p2.get(); |
239 | } |
240 | |
241 | template<typename T1, typename T2> |
242 | inline bool operator !=(VclPtr<T1> const & p1, VclPtr<T2> const & p2) { |
243 | return !(p1 == p2); |
244 | } |
245 | |
246 | template<typename T> inline bool operator !=(VclPtr<T> const & p1, T const * p2) |
247 | { |
248 | return !(p1 == p2); |
249 | } |
250 | |
251 | template<typename T> inline bool operator !=(VclPtr<T> const & p1, T * p2) { |
252 | return !(p1 == p2); |
253 | } |
254 | |
255 | template<typename T> inline bool operator !=(T const * p1, VclPtr<T> const & p2) |
256 | { |
257 | return !(p1 == p2); |
258 | } |
259 | |
260 | template<typename T> inline bool operator !=(T * p1, VclPtr<T> const & p2) { |
261 | return !(p1 == p2); |
262 | } |
263 | |
264 | /** |
265 | * A construction helper for a temporary VclPtr. Since VclPtr types |
266 | * are created with a reference-count of one - to help fit into |
267 | * the existing code-flow; this helps us to construct them easily. |
268 | * see also VclPtr::Create and ScopedVclPtr |
269 | * |
270 | * For more details on the design please see vcl/README.lifecycle |
271 | * |
272 | * @param reference_type must be a subclass of vcl::Window |
273 | */ |
274 | template <class reference_type> |
275 | class SAL_WARN_UNUSED__attribute__((warn_unused)) VclPtrInstance final : public VclPtr<reference_type> |
276 | { |
277 | public: |
278 | template<typename... Arg> VclPtrInstance(Arg &&... arg) |
279 | : VclPtr<reference_type>( new reference_type(std::forward<Arg>(arg)...), SAL_NO_ACQUIRE ) |
280 | { |
281 | } |
282 | |
283 | /** |
284 | * Override and disallow this, to prevent people accidentally calling it and actually |
285 | * getting VclPtr::Create and getting a naked VclPtr<> instance |
286 | */ |
287 | template<typename... Arg> static VclPtrInstance< reference_type > Create(Arg &&... ) = delete; |
288 | }; |
289 | |
290 | template <class reference_type> |
291 | class ScopedVclPtr : public VclPtr<reference_type> |
292 | { |
293 | public: |
294 | /** Constructor... |
295 | */ |
296 | ScopedVclPtr() |
297 | : VclPtr<reference_type>() |
298 | {} |
299 | |
300 | /** Constructor |
301 | */ |
302 | ScopedVclPtr (reference_type * pBody) |
303 | : VclPtr<reference_type>(pBody) |
304 | {} |
305 | |
306 | /** Copy constructor... |
307 | */ |
308 | ScopedVclPtr (const VclPtr<reference_type> & handle) |
309 | : VclPtr<reference_type>(handle) |
310 | {} |
311 | |
312 | /** |
313 | Assignment that releases the last reference. |
314 | */ |
315 | void disposeAndReset(reference_type *pBody) |
316 | { |
317 | if (pBody != this->get()) { |
318 | VclPtr<reference_type>::disposeAndClear(); |
319 | VclPtr<reference_type>::set(pBody); |
320 | } |
321 | } |
322 | |
323 | /** |
324 | Assignment that releases the last reference. |
325 | */ |
326 | ScopedVclPtr<reference_type>& operator = (reference_type * pBody) |
327 | { |
328 | disposeAndReset(pBody); |
329 | return *this; |
330 | } |
331 | |
332 | /** Up-casting conversion constructor: Copies interface reference. |
333 | |
334 | Does not work for up-casts to ambiguous bases. For the special case of |
335 | up-casting to Reference< XInterface >, see the corresponding conversion |
336 | operator. |
337 | |
338 | @param rRef another reference |
339 | */ |
340 | template< class derived_type > |
341 | ScopedVclPtr( |
342 | const VclPtr< derived_type > & rRef, |
343 | typename std::enable_if< |
344 | std::is_base_of<reference_type, derived_type>::value, int>::type |
345 | = 0 ) |
346 | : VclPtr<reference_type>( rRef ) |
347 | { |
348 | } |
349 | |
350 | /** Up-casting assignment operator. |
351 | |
352 | Does not work for up-casts to ambiguous bases. |
353 | |
354 | @param rRef another VclPtr |
355 | */ |
356 | template<typename derived_type> |
357 | typename std::enable_if< |
358 | std::is_base_of<reference_type, derived_type>::value, |
359 | ScopedVclPtr &>::type |
360 | operator =(VclPtr<derived_type> const & rRef) |
361 | { |
362 | disposeAndReset(rRef.get()); |
363 | return *this; |
364 | } |
365 | |
366 | /** |
367 | * Override and disallow this, to prevent people accidentally calling it and actually |
368 | * getting VclPtr::Create and getting a naked VclPtr<> instance |
369 | */ |
370 | template<typename... Arg> static ScopedVclPtr< reference_type > Create(Arg &&... ) = delete; |
371 | |
372 | ~ScopedVclPtr() |
373 | { |
374 | VclPtr<reference_type>::disposeAndClear(); |
375 | assert(VclPtr<reference_type>::get() == nullptr)(static_cast <bool> (VclPtr<reference_type>::get( ) == nullptr) ? void (0) : __assert_fail ("VclPtr<reference_type>::get() == nullptr" , "/home/maarten/src/libreoffice/core/include/vcl/vclptr.hxx" , 375, __extension__ __PRETTY_FUNCTION__)); // make sure there are no lingering references |
376 | } |
377 | |
378 | private: |
379 | // Most likely we don't want this default copy-constructor. |
380 | ScopedVclPtr (const ScopedVclPtr<reference_type> &) = delete; |
381 | // And certainly we don't want a default assignment operator. |
382 | ScopedVclPtr<reference_type>& operator = (const ScopedVclPtr<reference_type> &) = delete; |
383 | // And disallow reset as that doesn't call disposeAndClear on the original reference |
384 | void reset() = delete; |
385 | void reset(reference_type *pBody) = delete; |
386 | |
387 | protected: |
388 | ScopedVclPtr (reference_type * pBody, __sal_NoAcquire) |
389 | : VclPtr<reference_type>(pBody, SAL_NO_ACQUIRE) |
390 | {} |
391 | }; |
392 | |
393 | /** |
394 | * A construction helper for ScopedVclPtr. Since VclPtr types are created |
395 | * with a reference-count of one - to help fit into the existing |
396 | * code-flow; this helps us to construct them easily. |
397 | * |
398 | * For more details on the design please see vcl/README.lifecycle |
399 | * |
400 | * @param reference_type must be a subclass of vcl::Window |
401 | */ |
402 | #if defined _MSC_VER |
403 | #pragma warning(push) |
404 | #pragma warning(disable: 4521) // " multiple copy constructors specified" |
405 | #endif |
406 | template <class reference_type> |
407 | class SAL_WARN_UNUSED__attribute__((warn_unused)) ScopedVclPtrInstance final : public ScopedVclPtr<reference_type> |
408 | { |
409 | public: |
410 | template<typename... Arg> ScopedVclPtrInstance(Arg &&... arg) |
411 | : ScopedVclPtr<reference_type>( new reference_type(std::forward<Arg>(arg)...), SAL_NO_ACQUIRE ) |
412 | { |
413 | } |
414 | |
415 | /** |
416 | * Override and disallow this, to prevent people accidentally calling it and actually |
417 | * getting VclPtr::Create and getting a naked VclPtr<> instance |
418 | */ |
419 | template<typename... Arg> static ScopedVclPtrInstance< reference_type > Create(Arg &&...) = delete; |
420 | |
421 | private: |
422 | // Prevent the above perfect forwarding ctor from hijacking (accidental) |
423 | // attempts at ScopedVclPtrInstance copy construction (where the hijacking |
424 | // would typically lead to somewhat obscure error messages); both non-const |
425 | // and const variants are needed here, as the ScopedVclPtr base class has a |
426 | // const--variant copy ctor, so the implicitly declared copy ctor for |
427 | // ScopedVclPtrInstance would also be the const variant, so non-const copy |
428 | // construction attempts would be hijacked by the perfect forwarding ctor; |
429 | // but if we only declared a non-const variant here, the const variant would |
430 | // no longer be implicitly declared (as there would already be an explicitly |
431 | // declared copy ctor), so const copy construction attempts would then be |
432 | // hijacked by the perfect forwarding ctor: |
433 | ScopedVclPtrInstance(ScopedVclPtrInstance &) = delete; |
434 | ScopedVclPtrInstance(ScopedVclPtrInstance const &) = delete; |
435 | }; |
436 | #if defined _MSC_VER |
437 | #pragma warning(pop) |
438 | #endif |
439 | |
440 | #endif // INCLUDED_VCL_PTR_HXX |
441 | |
442 | /* vim:set shiftwidth=4 softtabstop=4 expandtab: */ |
1 | /* -*- Mode: C++; tab-width: 4; indent-tabs-mode: nil; c-basic-offset: 4 -*- */ | ||||||||
2 | /* | ||||||||
3 | * This file is part of the LibreOffice project. | ||||||||
4 | * | ||||||||
5 | * This Source Code Form is subject to the terms of the Mozilla Public | ||||||||
6 | * License, v. 2.0. If a copy of the MPL was not distributed with this | ||||||||
7 | * file, You can obtain one at http://mozilla.org/MPL/2.0/. | ||||||||
8 | * | ||||||||
9 | * This file incorporates work covered by the following license notice: | ||||||||
10 | * | ||||||||
11 | * Licensed to the Apache Software Foundation (ASF) under one or more | ||||||||
12 | * contributor license agreements. See the NOTICE file distributed | ||||||||
13 | * with this work for additional information regarding copyright | ||||||||
14 | * ownership. The ASF licenses this file to you under the Apache | ||||||||
15 | * License, Version 2.0 (the "License"); you may not use this file | ||||||||
16 | * except in compliance with the License. You may obtain a copy of | ||||||||
17 | * the License at http://www.apache.org/licenses/LICENSE-2.0 . | ||||||||
18 | */ | ||||||||
19 | |||||||||
20 | #ifndef INCLUDED_RTL_REF_HXX | ||||||||
21 | #define INCLUDED_RTL_REF_HXX | ||||||||
22 | |||||||||
23 | #include "sal/config.h" | ||||||||
24 | |||||||||
25 | #include <cassert> | ||||||||
26 | #include <cstddef> | ||||||||
27 | #include <functional> | ||||||||
28 | #ifdef LIBO_INTERNAL_ONLY1 | ||||||||
29 | #include <type_traits> | ||||||||
30 | #endif | ||||||||
31 | |||||||||
32 | #include "sal/types.h" | ||||||||
33 | |||||||||
34 | namespace rtl | ||||||||
35 | { | ||||||||
36 | |||||||||
37 | /** Template reference class for reference type. | ||||||||
38 | */ | ||||||||
39 | template <class reference_type> | ||||||||
40 | class Reference | ||||||||
41 | { | ||||||||
42 | /** The <b>reference_type</b> body pointer. | ||||||||
43 | */ | ||||||||
44 | reference_type * m_pBody; | ||||||||
45 | |||||||||
46 | |||||||||
47 | public: | ||||||||
48 | /** Constructor... | ||||||||
49 | */ | ||||||||
50 | Reference() | ||||||||
51 | : m_pBody (NULL__null) | ||||||||
52 | {} | ||||||||
53 | |||||||||
54 | |||||||||
55 | /** Constructor... | ||||||||
56 | */ | ||||||||
57 | Reference (reference_type * pBody, __sal_NoAcquire) | ||||||||
58 | : m_pBody (pBody) | ||||||||
59 | { | ||||||||
60 | } | ||||||||
61 | |||||||||
62 | /** Constructor... | ||||||||
63 | */ | ||||||||
64 | Reference (reference_type * pBody) | ||||||||
65 | : m_pBody (pBody) | ||||||||
66 | { | ||||||||
67 | if (m_pBody) | ||||||||
68 | m_pBody->acquire(); | ||||||||
69 | } | ||||||||
70 | |||||||||
71 | /** Copy constructor... | ||||||||
72 | */ | ||||||||
73 | Reference (const Reference<reference_type> & handle) | ||||||||
74 | : m_pBody (handle.m_pBody) | ||||||||
75 | { | ||||||||
76 | if (m_pBody) | ||||||||
77 | m_pBody->acquire(); | ||||||||
78 | } | ||||||||
79 | |||||||||
80 | #ifdef LIBO_INTERNAL_ONLY1 | ||||||||
81 | /** Move constructor... | ||||||||
82 | */ | ||||||||
83 | Reference (Reference<reference_type> && handle) noexcept | ||||||||
84 | : m_pBody (handle.m_pBody) | ||||||||
85 | { | ||||||||
86 | handle.m_pBody = nullptr; | ||||||||
87 | } | ||||||||
88 | #endif | ||||||||
89 | |||||||||
90 | #if defined LIBO_INTERNAL_ONLY1 | ||||||||
91 | /** Up-casting conversion constructor: Copies interface reference. | ||||||||
92 | |||||||||
93 | Does not work for up-casts to ambiguous bases. | ||||||||
94 | |||||||||
95 | @param rRef another reference | ||||||||
96 | */ | ||||||||
97 | template< class derived_type > | ||||||||
98 | inline Reference( | ||||||||
99 | const Reference< derived_type > & rRef, | ||||||||
100 | std::enable_if_t<std::is_base_of_v<reference_type, derived_type>, int> = 0 ) | ||||||||
101 | : m_pBody (rRef.get()) | ||||||||
102 | { | ||||||||
103 | if (m_pBody) | ||||||||
104 | m_pBody->acquire(); | ||||||||
105 | } | ||||||||
106 | #endif | ||||||||
107 | |||||||||
108 | /** Destructor... | ||||||||
109 | */ | ||||||||
110 | ~Reference() COVERITY_NOEXCEPT_FALSE | ||||||||
111 | { | ||||||||
112 | if (m_pBody) | ||||||||
113 | m_pBody->release(); | ||||||||
114 | } | ||||||||
115 | |||||||||
116 | /** Set... | ||||||||
117 | Similar to assignment. | ||||||||
118 | */ | ||||||||
119 | Reference<reference_type> & | ||||||||
120 | SAL_CALL set (reference_type * pBody) | ||||||||
121 | { | ||||||||
122 | if (pBody) | ||||||||
123 | pBody->acquire(); | ||||||||
124 | reference_type * const pOld = m_pBody; | ||||||||
125 | m_pBody = pBody; | ||||||||
126 | if (pOld) | ||||||||
127 | pOld->release(); | ||||||||
128 | return *this; | ||||||||
129 | } | ||||||||
130 | |||||||||
131 | /** Assignment. | ||||||||
132 | Unbinds this instance from its body (if bound) and | ||||||||
133 | bind it to the body represented by the handle. | ||||||||
134 | */ | ||||||||
135 | Reference<reference_type> & | ||||||||
136 | SAL_CALL operator= (const Reference<reference_type> & handle) | ||||||||
137 | { | ||||||||
138 | return set( handle.m_pBody ); | ||||||||
139 | } | ||||||||
140 | |||||||||
141 | #ifdef LIBO_INTERNAL_ONLY1 | ||||||||
142 | /** Assignment. | ||||||||
143 | * Unbinds this instance from its body (if bound), | ||||||||
144 | * bind it to the body represented by the handle, and | ||||||||
145 | * set the body represented by the handle to nullptr. | ||||||||
146 | */ | ||||||||
147 | Reference<reference_type> & | ||||||||
148 | operator= (Reference<reference_type> && handle) | ||||||||
149 | { | ||||||||
150 | // self-movement guts ourself | ||||||||
151 | if (m_pBody) | ||||||||
152 | m_pBody->release(); | ||||||||
153 | m_pBody = handle.m_pBody; | ||||||||
154 | handle.m_pBody = nullptr; | ||||||||
155 | return *this; | ||||||||
156 | } | ||||||||
157 | #endif | ||||||||
158 | |||||||||
159 | /** Assignment... | ||||||||
160 | */ | ||||||||
161 | Reference<reference_type> & | ||||||||
162 | SAL_CALL operator= (reference_type * pBody) | ||||||||
163 | { | ||||||||
164 | return set( pBody ); | ||||||||
165 | } | ||||||||
166 | |||||||||
167 | /** Unbind the body from this handle. | ||||||||
168 | Note that for a handle representing a large body, | ||||||||
169 | "handle.clear().set(new body());" _might_ | ||||||||
170 | perform a little bit better than "handle.set(new body());", | ||||||||
171 | since in the second case two large objects exist in memory | ||||||||
172 | (the old body and the new body). | ||||||||
173 | */ | ||||||||
174 | Reference<reference_type> & SAL_CALL clear() | ||||||||
175 | { | ||||||||
176 | if (m_pBody
| ||||||||
177 | { | ||||||||
178 | reference_type * const pOld = m_pBody; | ||||||||
179 | m_pBody = NULL__null; | ||||||||
180 | pOld->release(); | ||||||||
181 | } | ||||||||
182 | return *this; | ||||||||
183 | } | ||||||||
184 | |||||||||
185 | |||||||||
186 | /** Get the body. Can be used instead of operator->(). | ||||||||
187 | I.e. handle->someBodyOp() and handle.get()->someBodyOp() | ||||||||
188 | are the same. | ||||||||
189 | */ | ||||||||
190 | reference_type * SAL_CALL get() const | ||||||||
191 | { | ||||||||
192 | return m_pBody; | ||||||||
| |||||||||
193 | } | ||||||||
194 | |||||||||
195 | |||||||||
196 | /** Probably most common used: handle->someBodyOp(). | ||||||||
197 | */ | ||||||||
198 | reference_type * SAL_CALL operator->() const | ||||||||
199 | { | ||||||||
200 | assert(m_pBody != NULL)(static_cast <bool> (m_pBody != __null) ? void (0) : __assert_fail ("m_pBody != NULL", "/home/maarten/src/libreoffice/core/include/rtl/ref.hxx" , 200, __extension__ __PRETTY_FUNCTION__)); | ||||||||
201 | return m_pBody; | ||||||||
202 | } | ||||||||
203 | |||||||||
204 | |||||||||
205 | /** Allows (*handle).someBodyOp(). | ||||||||
206 | */ | ||||||||
207 | reference_type & SAL_CALL operator*() const | ||||||||
208 | { | ||||||||
209 | assert(m_pBody != NULL)(static_cast <bool> (m_pBody != __null) ? void (0) : __assert_fail ("m_pBody != NULL", "/home/maarten/src/libreoffice/core/include/rtl/ref.hxx" , 209, __extension__ __PRETTY_FUNCTION__)); | ||||||||
210 | return *m_pBody; | ||||||||
211 | } | ||||||||
212 | |||||||||
213 | |||||||||
214 | /** Returns True if the handle does point to a valid body. | ||||||||
215 | */ | ||||||||
216 | bool SAL_CALL is() const | ||||||||
217 | { | ||||||||
218 | return (m_pBody != NULL__null); | ||||||||
219 | } | ||||||||
220 | |||||||||
221 | #if defined LIBO_INTERNAL_ONLY1 | ||||||||
222 | /** Returns True if the handle does point to a valid body. | ||||||||
223 | */ | ||||||||
224 | explicit operator bool() const | ||||||||
225 | { | ||||||||
226 | return is(); | ||||||||
227 | } | ||||||||
228 | #endif | ||||||||
229 | |||||||||
230 | /** Returns True if this points to pBody. | ||||||||
231 | */ | ||||||||
232 | bool SAL_CALL operator== (const reference_type * pBody) const | ||||||||
233 | { | ||||||||
234 | return (m_pBody == pBody); | ||||||||
235 | } | ||||||||
236 | |||||||||
237 | |||||||||
238 | /** Returns True if handle points to the same body. | ||||||||
239 | */ | ||||||||
240 | bool | ||||||||
241 | SAL_CALL operator== (const Reference<reference_type> & handle) const | ||||||||
242 | { | ||||||||
243 | return (m_pBody == handle.m_pBody); | ||||||||
244 | } | ||||||||
245 | |||||||||
246 | |||||||||
247 | /** Needed to place References into STL collection. | ||||||||
248 | */ | ||||||||
249 | bool | ||||||||
250 | SAL_CALL operator!= (const Reference<reference_type> & handle) const | ||||||||
251 | { | ||||||||
252 | return (m_pBody != handle.m_pBody); | ||||||||
253 | } | ||||||||
254 | |||||||||
255 | |||||||||
256 | /** Needed to place References into STL collection. | ||||||||
257 | */ | ||||||||
258 | bool | ||||||||
259 | SAL_CALL operator< (const Reference<reference_type> & handle) const | ||||||||
260 | { | ||||||||
261 | return (m_pBody < handle.m_pBody); | ||||||||
262 | } | ||||||||
263 | |||||||||
264 | |||||||||
265 | /** Needed to place References into STL collection. | ||||||||
266 | */ | ||||||||
267 | bool | ||||||||
268 | SAL_CALL operator> (const Reference<reference_type> & handle) const | ||||||||
269 | { | ||||||||
270 | return (m_pBody > handle.m_pBody); | ||||||||
271 | } | ||||||||
272 | }; | ||||||||
273 | |||||||||
274 | } // namespace rtl | ||||||||
275 | |||||||||
276 | #if defined LIBO_INTERNAL_ONLY1 | ||||||||
277 | namespace std | ||||||||
278 | { | ||||||||
279 | |||||||||
280 | /// @cond INTERNAL | ||||||||
281 | /** | ||||||||
282 | Make rtl::Reference hashable by default for use in STL containers. | ||||||||
283 | |||||||||
284 | @since LibreOffice 6.3 | ||||||||
285 | */ | ||||||||
286 | template<typename T> | ||||||||
287 | struct hash<::rtl::Reference<T>> | ||||||||
288 | { | ||||||||
289 | std::size_t operator()(::rtl::Reference<T> const & s) const | ||||||||
290 | { return std::size_t(s.get()); } | ||||||||
291 | }; | ||||||||
292 | /// @endcond | ||||||||
293 | |||||||||
294 | } | ||||||||
295 | |||||||||
296 | #endif | ||||||||
297 | |||||||||
298 | #endif /* ! INCLUDED_RTL_REF_HXX */ | ||||||||
299 | |||||||||
300 | /* vim:set shiftwidth=4 softtabstop=4 expandtab: */ |
1 | /* -*- Mode: C++; tab-width: 4; indent-tabs-mode: nil; c-basic-offset: 4 -*- */ |
2 | /* |
3 | * This file is part of the LibreOffice project. |
4 | * |
5 | * This Source Code Form is subject to the terms of the Mozilla Public |
6 | * License, v. 2.0. If a copy of the MPL was not distributed with this |
7 | * file, You can obtain one at http://mozilla.org/MPL/2.0/. |
8 | * |
9 | * This file incorporates work covered by the following license notice: |
10 | * |
11 | * Licensed to the Apache Software Foundation (ASF) under one or more |
12 | * contributor license agreements. See the NOTICE file distributed |
13 | * with this work for additional information regarding copyright |
14 | * ownership. The ASF licenses this file to you under the Apache |
15 | * License, Version 2.0 (the "License"); you may not use this file |
16 | * except in compliance with the License. You may obtain a copy of |
17 | * the License at http://www.apache.org/licenses/LICENSE-2.0 . |
18 | */ |
19 | #ifndef INCLUDED_VCL_Reference_HXX |
20 | #define INCLUDED_VCL_Reference_HXX |
21 | |
22 | #include <vcl/dllapi.h> |
23 | #include <osl/interlck.h> |
24 | |
25 | class VCL_DLLPUBLIC__attribute__ ((visibility("default"))) VclReferenceBase |
26 | { |
27 | mutable oslInterlockedCount mnRefCnt; |
28 | |
29 | template<typename T> friend class VclPtr; |
30 | |
31 | public: |
32 | void acquire() const |
33 | { |
34 | osl_atomic_increment(&mnRefCnt)__sync_add_and_fetch((&mnRefCnt), 1); |
35 | } |
36 | |
37 | void release() const |
38 | { |
39 | if (osl_atomic_decrement(&mnRefCnt)__sync_sub_and_fetch((&mnRefCnt), 1) == 0) |
40 | delete this; |
41 | } |
42 | #ifdef DBG_UTIL |
43 | #ifndef _WIN32 |
44 | sal_Int32 getRefCount() const { return mnRefCnt; } |
45 | #endif |
46 | #endif |
47 | |
48 | |
49 | private: |
50 | VclReferenceBase(const VclReferenceBase&) = delete; |
51 | VclReferenceBase& operator=(const VclReferenceBase&) = delete; |
52 | |
53 | bool mbDisposed : 1; |
54 | |
55 | protected: |
56 | VclReferenceBase(); |
57 | protected: |
58 | virtual ~VclReferenceBase(); |
59 | |
60 | protected: |
61 | virtual void dispose(); |
62 | |
63 | public: |
64 | void disposeOnce(); |
65 | bool isDisposed() const { return mbDisposed; } |
66 | |
67 | }; |
68 | #endif |