File: | home/maarten/src/libreoffice/core/include/rtl/ref.hxx |
Warning: | line 77, column 13 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 | * 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 | #include <fumorph.hxx> | |||
21 | #include <svx/xfillit0.hxx> | |||
22 | #include <svx/xlineit0.hxx> | |||
23 | #include <svx/xlnclit.hxx> | |||
24 | #include <svx/xlnwtit.hxx> | |||
25 | #include <svx/xflclit.hxx> | |||
26 | #include <svx/svdopath.hxx> | |||
27 | #include <svx/svdogrp.hxx> | |||
28 | #include <editeng/eeitem.hxx> | |||
29 | #include <editeng/outlobj.hxx> | |||
30 | ||||
31 | #include <View.hxx> | |||
32 | #include <Window.hxx> | |||
33 | #include <basegfx/polygon/b2dpolygontools.hxx> | |||
34 | #include <basegfx/polygon/b2dpolypolygontools.hxx> | |||
35 | #include <basegfx/matrix/b2dhommatrix.hxx> | |||
36 | #include <basegfx/matrix/b2dhommatrixtools.hxx> | |||
37 | ||||
38 | #include <strings.hrc> | |||
39 | #include <sdresid.hxx> | |||
40 | ||||
41 | #include <sdabstdlg.hxx> | |||
42 | ||||
43 | #include <svx/svditer.hxx> | |||
44 | ||||
45 | #include <basegfx/color/bcolor.hxx> | |||
46 | #include <com/sun/star/drawing/LineStyle.hpp> | |||
47 | ||||
48 | using namespace com::sun::star; | |||
49 | ||||
50 | namespace sd { | |||
51 | ||||
52 | FuMorph::FuMorph ( | |||
53 | ViewShell* pViewSh, | |||
54 | ::sd::Window* pWin, | |||
55 | ::sd::View* pView, | |||
56 | SdDrawDocument* pDoc, | |||
57 | SfxRequest& rReq ) | |||
58 | : FuPoor(pViewSh, pWin, pView, pDoc, rReq) | |||
59 | { | |||
60 | } | |||
61 | ||||
62 | rtl::Reference<FuPoor> FuMorph::Create( | |||
63 | ViewShell* pViewSh, | |||
64 | ::sd::Window* pWin, | |||
65 | ::sd::View* pView, | |||
66 | SdDrawDocument* pDoc, | |||
67 | SfxRequest& rReq | |||
68 | ) | |||
69 | { | |||
70 | rtl::Reference<FuPoor> xFunc( new FuMorph( pViewSh, pWin, pView, pDoc, rReq ) ); | |||
71 | xFunc->DoExecute(rReq); | |||
72 | return xFunc; | |||
73 | } | |||
74 | ||||
75 | void FuMorph::DoExecute( SfxRequest& ) | |||
76 | { | |||
77 | const SdrMarkList& rMarkList = mpView->GetMarkedObjectList(); | |||
78 | ||||
79 | if(rMarkList.GetMarkCount() != 2) | |||
| ||||
80 | return; | |||
81 | ||||
82 | // create clones | |||
83 | SdrObject* pObj1 = rMarkList.GetMark(0)->GetMarkedSdrObj(); | |||
84 | SdrObject* pObj2 = rMarkList.GetMark(1)->GetMarkedSdrObj(); | |||
85 | SdrObject* pCloneObj1(pObj1->CloneSdrObject(pObj1->getSdrModelFromSdrObject())); | |||
86 | SdrObject* pCloneObj2(pObj2->CloneSdrObject(pObj2->getSdrModelFromSdrObject())); | |||
87 | ||||
88 | // delete text at clone, otherwise we do not get a correct PathObj | |||
89 | pCloneObj1->SetOutlinerParaObject(nullptr); | |||
90 | pCloneObj2->SetOutlinerParaObject(nullptr); | |||
91 | ||||
92 | // create path objects | |||
93 | SdrObjectUniquePtr pPolyObj1 = pCloneObj1->ConvertToPolyObj(false, false); | |||
94 | SdrObjectUniquePtr pPolyObj2 = pCloneObj2->ConvertToPolyObj(false, false); | |||
95 | SdAbstractDialogFactory* pFact = SdAbstractDialogFactory::Create(); | |||
96 | ScopedVclPtr<AbstractMorphDlg> pDlg( pFact->CreateMorphDlg(mpWindow ? mpWindow->GetFrameWeld() : nullptr, pObj1, pObj2) ); | |||
97 | if(pPolyObj1 && pPolyObj2 && (pDlg->Execute() == RET_OK)) | |||
98 | { | |||
99 | B2DPolyPolygonList_impl aPolyPolyList; | |||
100 | ::basegfx::B2DPolyPolygon aPolyPoly1; | |||
101 | ::basegfx::B2DPolyPolygon aPolyPoly2; | |||
102 | ||||
103 | pDlg->SaveSettings(); | |||
104 | ||||
105 | // #i48168# Not always is the pPolyObj1/pPolyObj2 a SdrPathObj, it may also be a group object | |||
106 | // containing SdrPathObjs. To get the polygons, I add two iters here | |||
107 | SdrObjListIter aIter1(*pPolyObj1); | |||
108 | SdrObjListIter aIter2(*pPolyObj2); | |||
109 | ||||
110 | while(aIter1.IsMore()) | |||
111 | { | |||
112 | SdrObject* pObj = aIter1.Next(); | |||
113 | if(auto pPathObj = dynamic_cast< SdrPathObj *>( pObj )) | |||
114 | aPolyPoly1.append(pPathObj->GetPathPoly()); | |||
115 | } | |||
116 | ||||
117 | while(aIter2.IsMore()) | |||
118 | { | |||
119 | SdrObject* pObj = aIter2.Next(); | |||
120 | if(auto pPathObj = dynamic_cast< SdrPathObj *>( pObj )) | |||
121 | aPolyPoly2.append(pPathObj->GetPathPoly()); | |||
122 | } | |||
123 | ||||
124 | // perform morphing | |||
125 | if(aPolyPoly1.count() && aPolyPoly2.count()) | |||
126 | { | |||
127 | aPolyPoly1 = ::basegfx::utils::correctOrientations(aPolyPoly1); | |||
128 | aPolyPoly1.removeDoublePoints(); | |||
129 | ::basegfx::B2VectorOrientation eIsClockwise1(::basegfx::utils::getOrientation(aPolyPoly1.getB2DPolygon(0))); | |||
130 | ||||
131 | aPolyPoly2 = ::basegfx::utils::correctOrientations(aPolyPoly2); | |||
132 | aPolyPoly2.removeDoublePoints(); | |||
133 | ::basegfx::B2VectorOrientation eIsClockwise2(::basegfx::utils::getOrientation(aPolyPoly2.getB2DPolygon(0))); | |||
134 | ||||
135 | // set same orientation | |||
136 | if(eIsClockwise1 != eIsClockwise2) | |||
137 | aPolyPoly2.flip(); | |||
138 | ||||
139 | // force same poly count | |||
140 | if(aPolyPoly1.count() < aPolyPoly2.count()) | |||
141 | ImpAddPolys(aPolyPoly1, aPolyPoly2); | |||
142 | else if(aPolyPoly2.count() < aPolyPoly1.count()) | |||
143 | ImpAddPolys(aPolyPoly2, aPolyPoly1); | |||
144 | ||||
145 | // use orientation flag from dialog | |||
146 | if(!pDlg->IsOrientationFade()) | |||
147 | aPolyPoly2.flip(); | |||
148 | ||||
149 | // force same point counts | |||
150 | for( sal_uInt32 a(0); a < aPolyPoly1.count(); a++ ) | |||
151 | { | |||
152 | ::basegfx::B2DPolygon aSub1(aPolyPoly1.getB2DPolygon(a)); | |||
153 | ::basegfx::B2DPolygon aSub2(aPolyPoly2.getB2DPolygon(a)); | |||
154 | ||||
155 | if(aSub1.count() < aSub2.count()) | |||
156 | ImpEqualizePolyPointCount(aSub1, aSub2); | |||
157 | else if(aSub2.count() < aSub1.count()) | |||
158 | ImpEqualizePolyPointCount(aSub2, aSub1); | |||
159 | ||||
160 | aPolyPoly1.setB2DPolygon(a, aSub1); | |||
161 | aPolyPoly2.setB2DPolygon(a, aSub2); | |||
162 | } | |||
163 | ||||
164 | ImpMorphPolygons(aPolyPoly1, aPolyPoly2, pDlg->GetFadeSteps(), aPolyPolyList); | |||
165 | ||||
166 | OUString aString = mpView->GetDescriptionOfMarkedObjects() + | |||
167 | " " + SdResId(STR_UNDO_MORPHINGreinterpret_cast<char const *>("STR_UNDO_MORPHING" "\004" u8"Cross-fading")); | |||
168 | ||||
169 | mpView->BegUndo(aString); | |||
170 | ImpInsertPolygons(aPolyPolyList, pDlg->IsAttributeFade(), pObj1, pObj2); | |||
171 | mpView->EndUndo(); | |||
172 | } | |||
173 | } | |||
174 | SdrObject::Free( pCloneObj1 ); | |||
175 | SdrObject::Free( pCloneObj2 ); | |||
176 | } | |||
177 | ||||
178 | static ::basegfx::B2DPolygon ImpGetExpandedPolygon( | |||
179 | const ::basegfx::B2DPolygon& rCandidate, | |||
180 | sal_uInt32 nNum | |||
181 | ) | |||
182 | { | |||
183 | if(rCandidate.count() && nNum && rCandidate.count() != nNum) | |||
184 | { | |||
185 | // length of step in dest poly | |||
186 | ::basegfx::B2DPolygon aRetval; | |||
187 | const double fStep(::basegfx::utils::getLength(rCandidate) / static_cast<double>(rCandidate.isClosed() ? nNum : nNum - 1)); | |||
188 | double fDestPos(0.0); | |||
189 | double fSrcPos(0.0); | |||
190 | sal_uInt32 nSrcPos(0); | |||
191 | sal_uInt32 nSrcPosNext((nSrcPos + 1 == rCandidate.count()) ? 0L : nSrcPos + 1); | |||
192 | double fNextSrcLen(::basegfx::B2DVector(rCandidate.getB2DPoint(nSrcPos) - rCandidate.getB2DPoint(nSrcPosNext)).getLength()); | |||
193 | ||||
194 | for(sal_uInt32 b(0); b < nNum; b++) | |||
195 | { | |||
196 | // calc fDestPos in source | |||
197 | while(fSrcPos + fNextSrcLen < fDestPos) | |||
198 | { | |||
199 | fSrcPos += fNextSrcLen; | |||
200 | nSrcPos++; | |||
201 | nSrcPosNext = (nSrcPos + 1 == rCandidate.count()) ? 0L : nSrcPos + 1; | |||
202 | fNextSrcLen = ::basegfx::B2DVector(rCandidate.getB2DPoint(nSrcPos) - rCandidate.getB2DPoint(nSrcPosNext)).getLength(); | |||
203 | } | |||
204 | ||||
205 | // fDestPos is between fSrcPos and (fSrcPos + fNextSrcLen) | |||
206 | const double fLenA((fDestPos - fSrcPos) / fNextSrcLen); | |||
207 | const ::basegfx::B2DPoint aOld1(rCandidate.getB2DPoint(nSrcPos)); | |||
208 | const ::basegfx::B2DPoint aOld2(rCandidate.getB2DPoint(nSrcPosNext)); | |||
209 | ::basegfx::B2DPoint aNewPoint(basegfx::interpolate(aOld1, aOld2, fLenA)); | |||
210 | aRetval.append(aNewPoint); | |||
211 | ||||
212 | // next step | |||
213 | fDestPos += fStep; | |||
214 | } | |||
215 | ||||
216 | if(aRetval.count() >= 3) | |||
217 | { | |||
218 | aRetval.setClosed(rCandidate.isClosed()); | |||
219 | } | |||
220 | ||||
221 | return aRetval; | |||
222 | } | |||
223 | else | |||
224 | { | |||
225 | return rCandidate; | |||
226 | } | |||
227 | } | |||
228 | ||||
229 | /** | |||
230 | * make the point count of the polygons equal in adding points | |||
231 | */ | |||
232 | void FuMorph::ImpEqualizePolyPointCount( | |||
233 | ::basegfx::B2DPolygon& rSmall, | |||
234 | const ::basegfx::B2DPolygon& rBig | |||
235 | ) | |||
236 | { | |||
237 | // create poly with equal point count | |||
238 | const sal_uInt32 nCnt(rBig.count()); | |||
239 | ::basegfx::B2DPolygon aPoly1(ImpGetExpandedPolygon(rSmall, nCnt)); | |||
240 | ||||
241 | // create transformation for rBig to do the compare | |||
242 | const ::basegfx::B2DRange aSrcSize(::basegfx::utils::getRange(rBig)); | |||
243 | const ::basegfx::B2DPoint aSrcPos(aSrcSize.getCenter()); | |||
244 | const ::basegfx::B2DRange aDstSize(::basegfx::utils::getRange(rSmall)); | |||
245 | const ::basegfx::B2DPoint aDstPos(aDstSize.getCenter()); | |||
246 | ||||
247 | basegfx::B2DHomMatrix aTrans(basegfx::utils::createTranslateB2DHomMatrix(-aSrcPos.getX(), -aSrcPos.getY())); | |||
248 | aTrans.scale(aDstSize.getWidth() / aSrcSize.getWidth(), aDstSize.getHeight() / aSrcSize.getHeight()); | |||
249 | aTrans.translate(aDstPos.getX(), aDstPos.getY()); | |||
250 | ||||
251 | // transpose points to have smooth linear blending | |||
252 | ::basegfx::B2DPolygon aPoly2; | |||
253 | aPoly2.append(::basegfx::B2DPoint(), nCnt); | |||
254 | sal_uInt32 nInd(ImpGetNearestIndex(aPoly1, aTrans * rBig.getB2DPoint(0))); | |||
255 | ||||
256 | for(sal_uInt32 a(0); a < nCnt; a++) | |||
257 | { | |||
258 | aPoly2.setB2DPoint((a + nCnt - nInd) % nCnt, aPoly1.getB2DPoint(a)); | |||
259 | } | |||
260 | ||||
261 | aPoly2.setClosed(rBig.isClosed()); | |||
262 | rSmall = aPoly2; | |||
263 | } | |||
264 | ||||
265 | sal_uInt32 FuMorph::ImpGetNearestIndex( | |||
266 | const ::basegfx::B2DPolygon& rPoly, | |||
267 | const ::basegfx::B2DPoint& rPos | |||
268 | ) | |||
269 | { | |||
270 | double fMinDist = 0.0; | |||
271 | sal_uInt32 nActInd = 0; | |||
272 | ||||
273 | for(sal_uInt32 a(0); a < rPoly.count(); a++) | |||
274 | { | |||
275 | double fNewDist(::basegfx::B2DVector(rPoly.getB2DPoint(a) - rPos).getLength()); | |||
276 | ||||
277 | if(!a || fNewDist < fMinDist) | |||
278 | { | |||
279 | fMinDist = fNewDist; | |||
280 | nActInd = a; | |||
281 | } | |||
282 | } | |||
283 | ||||
284 | return nActInd; | |||
285 | } | |||
286 | ||||
287 | /** | |||
288 | * add to a point reduced polys until count is same | |||
289 | */ | |||
290 | void FuMorph::ImpAddPolys( | |||
291 | ::basegfx::B2DPolyPolygon& rSmaller, | |||
292 | const ::basegfx::B2DPolyPolygon& rBigger | |||
293 | ) | |||
294 | { | |||
295 | while(rSmaller.count() < rBigger.count()) | |||
296 | { | |||
297 | const ::basegfx::B2DPolygon& aToBeCopied(rBigger.getB2DPolygon(rSmaller.count())); | |||
298 | const ::basegfx::B2DRange aToBeCopiedPolySize(::basegfx::utils::getRange(aToBeCopied)); | |||
299 | ::basegfx::B2DPoint aNewPoint(aToBeCopiedPolySize.getCenter()); | |||
300 | ::basegfx::B2DPolygon aNewPoly; | |||
301 | ||||
302 | const ::basegfx::B2DRange aSrcSize(::basegfx::utils::getRange(rBigger.getB2DPolygon(0))); | |||
303 | const ::basegfx::B2DPoint aSrcPos(aSrcSize.getCenter()); | |||
304 | const ::basegfx::B2DRange aDstSize(::basegfx::utils::getRange(rSmaller.getB2DPolygon(0))); | |||
305 | const ::basegfx::B2DPoint aDstPos(aDstSize.getCenter()); | |||
306 | aNewPoint = aNewPoint - aSrcPos + aDstPos; | |||
307 | ||||
308 | for(sal_uInt32 a(0); a < aToBeCopied.count(); a++) | |||
309 | { | |||
310 | aNewPoly.append(aNewPoint); | |||
311 | } | |||
312 | ||||
313 | rSmaller.append(aNewPoly); | |||
314 | } | |||
315 | } | |||
316 | ||||
317 | /** | |||
318 | * create group object with morphed polygons | |||
319 | */ | |||
320 | void FuMorph::ImpInsertPolygons( | |||
321 | B2DPolyPolygonList_impl& rPolyPolyList3D, | |||
322 | bool bAttributeFade, | |||
323 | const SdrObject* pObj1, | |||
324 | const SdrObject* pObj2 | |||
325 | ) | |||
326 | { | |||
327 | Color aStartFillCol; | |||
328 | Color aEndFillCol; | |||
329 | Color aStartLineCol; | |||
330 | Color aEndLineCol; | |||
331 | long nStartLineWidth = 0; | |||
332 | long nEndLineWidth = 0; | |||
333 | SdrPageView* pPageView = mpView->GetSdrPageView(); | |||
334 | SfxItemPool & rPool = pObj1->GetObjectItemPool(); | |||
335 | SfxItemSet aSet1( rPool,svl::Items<SDRATTR_START,SDRATTR_NOTPERSIST_FIRST-1,EE_ITEMS_START,EE_ITEMS_END>{} ); | |||
336 | SfxItemSet aSet2( aSet1 ); | |||
337 | bool bLineColor = false; | |||
338 | bool bFillColor = false; | |||
339 | bool bLineWidth = false; | |||
340 | bool bIgnoreLine = false; | |||
341 | bool bIgnoreFill = false; | |||
342 | ||||
343 | aSet1.Put(pObj1->GetMergedItemSet()); | |||
344 | aSet2.Put(pObj2->GetMergedItemSet()); | |||
345 | ||||
346 | const drawing::LineStyle eLineStyle1 = aSet1.Get(XATTR_LINESTYLE).GetValue(); | |||
347 | const drawing::LineStyle eLineStyle2 = aSet2.Get(XATTR_LINESTYLE).GetValue(); | |||
348 | const drawing::FillStyle eFillStyle1 = aSet1.Get(XATTR_FILLSTYLE).GetValue(); | |||
349 | const drawing::FillStyle eFillStyle2 = aSet2.Get(XATTR_FILLSTYLE).GetValue(); | |||
350 | ||||
351 | if ( bAttributeFade ) | |||
352 | { | |||
353 | if ( ( eLineStyle1 != drawing::LineStyle_NONE ) && ( eLineStyle2 != drawing::LineStyle_NONE ) ) | |||
354 | { | |||
355 | bLineWidth = bLineColor = true; | |||
356 | ||||
357 | aStartLineCol = aSet1.Get(XATTR_LINECOLOR).GetColorValue(); | |||
358 | aEndLineCol = aSet2.Get(XATTR_LINECOLOR).GetColorValue(); | |||
359 | ||||
360 | nStartLineWidth = aSet1.Get(XATTR_LINEWIDTH).GetValue(); | |||
361 | nEndLineWidth = aSet2.Get(XATTR_LINEWIDTH).GetValue(); | |||
362 | } | |||
363 | else if ( ( eLineStyle1 == drawing::LineStyle_NONE ) && ( eLineStyle2 == drawing::LineStyle_NONE ) ) | |||
364 | bIgnoreLine = true; | |||
365 | ||||
366 | if ( ( eFillStyle1 == drawing::FillStyle_SOLID ) && ( eFillStyle2 == drawing::FillStyle_SOLID ) ) | |||
367 | { | |||
368 | bFillColor = true; | |||
369 | aStartFillCol = aSet1.Get(XATTR_FILLCOLOR).GetColorValue(); | |||
370 | aEndFillCol = aSet2.Get(XATTR_FILLCOLOR).GetColorValue(); | |||
371 | } | |||
372 | else if ( ( eFillStyle1 == drawing::FillStyle_NONE ) && ( eFillStyle2 == drawing::FillStyle_NONE ) ) | |||
373 | bIgnoreFill = true; | |||
374 | } | |||
375 | ||||
376 | if ( !pPageView ) | |||
377 | return; | |||
378 | ||||
379 | SfxItemSet aSet( aSet1 ); | |||
380 | std::unique_ptr<SdrObjGroup, SdrObjectFreeOp> xObjGroup(new SdrObjGroup(mpView->getSdrModelFromSdrView())); | |||
381 | SdrObjList* pObjList = xObjGroup->GetSubList(); | |||
382 | const size_t nCount = rPolyPolyList3D.size(); | |||
383 | const double fStep = 1. / ( nCount + 1 ); | |||
384 | const double fDelta = nEndLineWidth - nStartLineWidth; | |||
385 | double fFactor = fStep; | |||
386 | ||||
387 | aSet.Put( XLineStyleItem( drawing::LineStyle_SOLID ) ); | |||
388 | aSet.Put( XFillStyleItem( drawing::FillStyle_SOLID ) ); | |||
389 | ||||
390 | for ( size_t i = 0; i < nCount; i++, fFactor += fStep ) | |||
391 | { | |||
392 | const ::basegfx::B2DPolyPolygon& rPolyPoly3D = rPolyPolyList3D[ i ]; | |||
393 | SdrPathObj* pNewObj = new SdrPathObj( | |||
394 | mpView->getSdrModelFromSdrView(), | |||
395 | OBJ_POLY, | |||
396 | rPolyPoly3D); | |||
397 | ||||
398 | // line color | |||
399 | if ( bLineColor ) | |||
400 | { | |||
401 | const basegfx::BColor aLineColor(basegfx::interpolate(aStartLineCol.getBColor(), aEndLineCol.getBColor(), fFactor)); | |||
402 | aSet.Put( XLineColorItem( "", Color(aLineColor))); | |||
403 | } | |||
404 | else if ( bIgnoreLine ) | |||
405 | aSet.Put( XLineStyleItem( drawing::LineStyle_NONE ) ); | |||
406 | ||||
407 | // fill color | |||
408 | if ( bFillColor ) | |||
409 | { | |||
410 | const basegfx::BColor aFillColor(basegfx::interpolate(aStartFillCol.getBColor(), aEndFillCol.getBColor(), fFactor)); | |||
411 | aSet.Put( XFillColorItem( "", Color(aFillColor))); | |||
412 | } | |||
413 | else if ( bIgnoreFill ) | |||
414 | aSet.Put( XFillStyleItem( drawing::FillStyle_NONE ) ); | |||
415 | ||||
416 | // line width | |||
417 | if ( bLineWidth ) | |||
418 | aSet.Put( XLineWidthItem( nStartLineWidth + static_cast<long>( fFactor * fDelta + 0.5 ) ) ); | |||
419 | ||||
420 | pNewObj->SetMergedItemSetAndBroadcast(aSet); | |||
421 | ||||
422 | pObjList->InsertObject( pNewObj ); | |||
423 | } | |||
424 | ||||
425 | if ( nCount ) | |||
426 | { | |||
427 | pObjList->InsertObject( | |||
428 | pObj1->CloneSdrObject(pObj1->getSdrModelFromSdrObject()), | |||
429 | 0 ); | |||
430 | pObjList->InsertObject( | |||
431 | pObj2->CloneSdrObject(pObj2->getSdrModelFromSdrObject()) ); | |||
432 | ||||
433 | mpView->DeleteMarked(); | |||
434 | mpView->InsertObjectAtView(xObjGroup.release(), *pPageView, SdrInsertFlags:: SETDEFLAYER); | |||
435 | } | |||
436 | } | |||
437 | ||||
438 | /** | |||
439 | * create single morphed PolyPolygon | |||
440 | */ | |||
441 | ::basegfx::B2DPolyPolygon FuMorph::ImpCreateMorphedPolygon( | |||
442 | const ::basegfx::B2DPolyPolygon& rPolyPolyStart, | |||
443 | const ::basegfx::B2DPolyPolygon& rPolyPolyEnd, | |||
444 | double fMorphingFactor | |||
445 | ) | |||
446 | { | |||
447 | ::basegfx::B2DPolyPolygon aNewPolyPolygon; | |||
448 | const double fFactor = 1.0 - fMorphingFactor; | |||
449 | ||||
450 | for(sal_uInt32 a(0); a < rPolyPolyStart.count(); a++) | |||
451 | { | |||
452 | const ::basegfx::B2DPolygon& aPolyStart(rPolyPolyStart.getB2DPolygon(a)); | |||
453 | const ::basegfx::B2DPolygon& aPolyEnd(rPolyPolyEnd.getB2DPolygon(a)); | |||
454 | const sal_uInt32 nCount(aPolyStart.count()); | |||
455 | ::basegfx::B2DPolygon aNewPolygon; | |||
456 | ||||
457 | for(sal_uInt32 b(0); b < nCount; b++) | |||
458 | { | |||
459 | const ::basegfx::B2DPoint& aPtStart(aPolyStart.getB2DPoint(b)); | |||
460 | const ::basegfx::B2DPoint& aPtEnd(aPolyEnd.getB2DPoint(b)); | |||
461 | aNewPolygon.append(aPtEnd + ((aPtStart - aPtEnd) * fFactor)); | |||
462 | } | |||
463 | ||||
464 | aNewPolygon.setClosed(aPolyStart.isClosed() && aPolyEnd.isClosed()); | |||
465 | aNewPolyPolygon.append(aNewPolygon); | |||
466 | } | |||
467 | ||||
468 | return aNewPolyPolygon; | |||
469 | } | |||
470 | ||||
471 | /** | |||
472 | * create morphed PolyPolygons | |||
473 | */ | |||
474 | void FuMorph::ImpMorphPolygons( | |||
475 | const ::basegfx::B2DPolyPolygon& rPolyPoly1, | |||
476 | const ::basegfx::B2DPolyPolygon& rPolyPoly2, | |||
477 | const sal_uInt16 nSteps, | |||
478 | B2DPolyPolygonList_impl& rPolyPolyList3D | |||
479 | ) | |||
480 | { | |||
481 | if(!nSteps) | |||
482 | return; | |||
483 | ||||
484 | const ::basegfx::B2DRange aStartPolySize(::basegfx::utils::getRange(rPolyPoly1)); | |||
485 | const ::basegfx::B2DPoint aStartCenter(aStartPolySize.getCenter()); | |||
486 | const ::basegfx::B2DRange aEndPolySize(::basegfx::utils::getRange(rPolyPoly2)); | |||
487 | const ::basegfx::B2DPoint aEndCenter(aEndPolySize.getCenter()); | |||
488 | const ::basegfx::B2DPoint aDelta(aEndCenter - aStartCenter); | |||
489 | const double fFactor(1.0 / (nSteps + 1)); | |||
490 | double fValue(0.0); | |||
491 | ||||
492 | for(sal_uInt16 i(0); i < nSteps; i++) | |||
493 | { | |||
494 | fValue += fFactor; | |||
495 | ::basegfx::B2DPolyPolygon aNewPolyPoly2D = ImpCreateMorphedPolygon(rPolyPoly1, rPolyPoly2, fValue); | |||
496 | ||||
497 | const ::basegfx::B2DRange aNewPolySize(::basegfx::utils::getRange(aNewPolyPoly2D)); | |||
498 | const ::basegfx::B2DPoint aNewS(aNewPolySize.getCenter()); | |||
499 | const ::basegfx::B2DPoint aRealS(aStartCenter + (aDelta * fValue)); | |||
500 | const ::basegfx::B2DPoint aDiff(aRealS - aNewS); | |||
501 | ||||
502 | aNewPolyPoly2D.transform(basegfx::utils::createTranslateB2DHomMatrix(aDiff)); | |||
503 | rPolyPolyList3D.push_back( std::move(aNewPolyPoly2D) ); | |||
504 | } | |||
505 | } | |||
506 | ||||
507 | } // end of namespace sd | |||
508 | ||||
509 | /* 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 |