Bug Summary

File:home/maarten/src/libreoffice/core/include/rtl/ref.hxx
Warning:line 192, column 9
Use of memory after it is freed

Annotated Source Code

Press '?' to see keyboard shortcuts

clang -cc1 -cc1 -triple x86_64-unknown-linux-gnu -analyze -disable-free -disable-llvm-verifier -discard-value-names -main-file-name _bmpmask.cxx -analyzer-store=region -analyzer-opt-analyze-nested-blocks -analyzer-checker=core -analyzer-checker=apiModeling -analyzer-checker=unix -analyzer-checker=deadcode -analyzer-checker=cplusplus -analyzer-checker=security.insecureAPI.UncheckedReturn -analyzer-checker=security.insecureAPI.getpw -analyzer-checker=security.insecureAPI.gets -analyzer-checker=security.insecureAPI.mktemp -analyzer-checker=security.insecureAPI.mkstemp -analyzer-checker=security.insecureAPI.vfork -analyzer-checker=nullability.NullPassedToNonnull -analyzer-checker=nullability.NullReturnedFromNonnull -analyzer-output plist -w -setup-static-analyzer -mrelocation-model pic -pic-level 2 -mframe-pointer=all -fmath-errno -fno-rounding-math -mconstructor-aliases -munwind-tables -target-cpu x86-64 -fno-split-dwarf-inlining -debugger-tuning=gdb -resource-dir /usr/lib64/clang/11.0.0 -D BOOST_ERROR_CODE_HEADER_ONLY -D BOOST_SYSTEM_NO_DEPRECATED -D CPPU_ENV=gcc3 -D LINUX -D OSL_DEBUG_LEVEL=1 -D SAL_LOG_INFO -D SAL_LOG_WARN -D UNIX -D UNX -D X86_64 -D _PTHREADS -D _REENTRANT -D SVX_DLLIMPLEMENTATION -D EXCEPTIONS_ON -D LIBO_INTERNAL_ONLY -I /home/maarten/src/libreoffice/core/workdir/UnpackedTarball/icu/source -I /home/maarten/src/libreoffice/core/workdir/UnpackedTarball/icu/source/i18n -I /home/maarten/src/libreoffice/core/workdir/UnpackedTarball/icu/source/common -I /home/maarten/src/libreoffice/core/external/boost/include -I /home/maarten/src/libreoffice/core/workdir/UnpackedTarball/boost -I /home/maarten/src/libreoffice/core/svx/inc -I /home/maarten/src/libreoffice/core/svx/source/inc -I /home/maarten/src/libreoffice/core/include -I /usr/lib/jvm/java-11-openjdk-11.0.9.10-0.0.ea.fc33.x86_64/include -I /usr/lib/jvm/java-11-openjdk-11.0.9.10-0.0.ea.fc33.x86_64/include/linux -I /home/maarten/src/libreoffice/core/config_host -I /home/maarten/src/libreoffice/core/workdir/UnoApiHeadersTarget/udkapi/normal -I /home/maarten/src/libreoffice/core/workdir/UnoApiHeadersTarget/offapi/normal -I /home/maarten/src/libreoffice/core/workdir/CustomTarget/officecfg/registry -internal-isystem /usr/bin/../lib/gcc/x86_64-redhat-linux/10/../../../../include/c++/10 -internal-isystem /usr/bin/../lib/gcc/x86_64-redhat-linux/10/../../../../include/c++/10/x86_64-redhat-linux -internal-isystem /usr/bin/../lib/gcc/x86_64-redhat-linux/10/../../../../include/c++/10/backward -internal-isystem /usr/local/include -internal-isystem /usr/lib64/clang/11.0.0/include -internal-externc-isystem /include -internal-externc-isystem /usr/include -O0 -Wno-missing-braces -std=c++17 -fdeprecated-macro -fdebug-compilation-dir /home/maarten/src/libreoffice/core -ferror-limit 19 -fvisibility hidden -fvisibility-inlines-hidden -stack-protector 2 -fgnuc-version=4.2.1 -fcxx-exceptions -fexceptions -debug-info-kind=constructor -analyzer-output=html -faddrsig -o /home/maarten/tmp/wis/scan-build-libreoffice/output/report/2020-10-07-141433-9725-1 -x c++ /home/maarten/src/libreoffice/core/svx/source/dialog/_bmpmask.cxx

/home/maarten/src/libreoffice/core/svx/source/dialog/_bmpmask.cxx

→
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 <vcl/event.hxx>
21#include <vcl/metaact.hxx>
22#include <vcl/virdev.hxx>
23#include <svtools/valueset.hxx>
24#include <svl/eitem.hxx>
25#include <sfx2/dispatch.hxx>
26#include <svtools/colrdlg.hxx>
27
28#include <svx/colorbox.hxx>
29#include <svx/dialmgr.hxx>
30#include <svx/bmpmask.hxx>
31#include <svx/strings.hrc>
32#include <svx/svxids.hrc>
33#include <memory>
34#include <helpids.h>
35
36#define OWN_CALLMODESfxCallMode::ASYNCHRON | SfxCallMode::RECORD SfxCallMode::ASYNCHRON | SfxCallMode::RECORD
37
38
39#define TEST_COLS(){ nR = aCol.GetRed(); nG = aCol.GetGreen(); nB = aCol.GetBlue
(); for( i = 0; i < nCount; i++ ) { if ( ( pMinR[i] <= nR
) && ( pMaxR[i] >= nR ) && ( pMinG[i] <=
nG ) && ( pMaxG[i] >= nG ) && ( pMinB[i] <=
nB ) && ( pMaxB[i] >= nB ) ) { aCol = pDstCols[i]
; bReplace = true; break; } } } \
40{ \
41 nR = aCol.GetRed(); nG = aCol.GetGreen(); nB = aCol.GetBlue(); \
42 for( i = 0; i < nCount; i++ ) \
43 { \
44 if ( ( pMinR[i] <= nR ) && ( pMaxR[i] >= nR ) && \
45 ( pMinG[i] <= nG ) && ( pMaxG[i] >= nG ) && \
46 ( pMinB[i] <= nB ) && ( pMaxB[i] >= nB ) ) \
47 { \
48 aCol = pDstCols[i]; bReplace = true; break; \
49 } \
50 } \
51}
52
53SFX_IMPL_DOCKINGWINDOW_WITHID( SvxBmpMaskChildWindow, SID_BMPMASK )std::unique_ptr<SfxChildWindow> SvxBmpMaskChildWindow::
CreateImpl( vcl::Window *pParent, sal_uInt16 nId, SfxBindings
*pBindings, SfxChildWinInfo* pInfo ) { return std::make_unique
<SvxBmpMaskChildWindow>(pParent, nId, pBindings, pInfo)
; } void SvxBmpMaskChildWindow::RegisterChildWindow (bool bVis
, SfxModule *pMod, SfxChildWindowFlags nFlags) { auto pFact =
std::make_unique<SfxChildWinFactory>( SvxBmpMaskChildWindow
::CreateImpl, ( 10000 + 350 ), (32767 *2 +1) ); pFact->aInfo
.nFlags |= nFlags; pFact->aInfo.bVisible = bVis; SfxChildWindow
::RegisterChildWindow(pMod, std::move(pFact)); } sal_uInt16 SvxBmpMaskChildWindow
::GetChildWindowId () { return ( 10000 + 350 ); } SfxChildWinInfo
SvxBmpMaskChildWindow::GetInfo() const { SfxChildWinInfo aInfo
= SfxChildWindow::GetInfo(); static_cast<SfxDockingWindow
*>(GetWindow())->FillInfo( aInfo ); return aInfo; }
1
Calling 'make_unique<SvxBmpMaskChildWindow, vcl::Window *&, unsigned short &, SfxBindings *&, SfxChildWinInfo *&>'
→
54
55class BmpColorWindow : public weld::CustomWidgetController
56{
57 Color aColor;
58
59
60public:
61 explicit BmpColorWindow()
62 : aColor( COL_WHITE )
63 {
64 }
65
66 void SetColor( const Color& rColor )
67 {
68 aColor = rColor;
69 Invalidate();
70 }
71
72 virtual void Paint( vcl::RenderContext& rRenderContext, const tools::Rectangle& rRect ) override;
73
74 virtual void SetDrawingArea(weld::DrawingArea* pArea) override
75 {
76 Size aSize(pArea->get_ref_device().LogicToPixel(Size(43, 14), MapMode(MapUnit::MapAppFont)));
77 CustomWidgetController::SetDrawingArea(pArea);
78 pArea->set_size_request(aSize.Width(), aSize.Height());
79 SetOutputSizePixel(aSize);
80 }
81};
82
83class MaskSet : public ValueSet
84{
85 VclPtr<SvxBmpMask> pSvxBmpMask;
86
87public:
88 MaskSet(SvxBmpMask* pMask);
89 virtual void Select() override;
90 virtual bool KeyInput( const KeyEvent& rKEvt ) override;
91 virtual void GetFocus() override;
92 virtual void SetDrawingArea(weld::DrawingArea* pArea) override
93 {
94 Size aSize(pArea->get_ref_device().LogicToPixel(Size(24, 12), MapMode(MapUnit::MapAppFont)));
95 ValueSet::SetDrawingArea(pArea);
96 pArea->set_size_request(aSize.Width(), aSize.Height());
97 SetOutputSizePixel(aSize);
98 SetHelpId(HID_BMPMASK_CTL_QCOL_1"SVX_HID_BMPMASK_CTL_QCOL_1");
99 }
100 void onEditColor();
101};
102
103MaskSet::MaskSet(SvxBmpMask* pMask)
104 : ValueSet(nullptr)
105 , pSvxBmpMask(pMask)
106{
107}
108
109void MaskSet::Select()
110{
111 ValueSet::Select();
112
113 pSvxBmpMask->onSelect( this );
114}
115
116void MaskSet::GetFocus()
117{
118 ValueSet::GetFocus();
119 SelectItem( 1 );
120 pSvxBmpMask->onSelect( this );
121}
122
123bool MaskSet::KeyInput( const KeyEvent& rKEvt )
124{
125 bool bRet = false;
126
127 vcl::KeyCode aCode = rKEvt.GetKeyCode();
128
129 // if the key has a modifier we don't care
130 if( aCode.GetModifier() )
131 {
132 bRet = ValueSet::KeyInput( rKEvt );
133 }
134 else
135 {
136 // check for keys that interests us
137 switch ( aCode.GetCode() )
138 {
139 case KEY_SPACE:
140 onEditColor();
141 bRet = true;
142 break;
143 default:
144 bRet = ValueSet::KeyInput( rKEvt );
145 }
146 }
147 return bRet;
148}
149
150void MaskSet::onEditColor()
151{
152 SvColorDialog aColorDlg;
153
154 aColorDlg.SetColor(GetItemColor(1));
155
156 if (aColorDlg.Execute(pSvxBmpMask->GetFrameWeld()))
157 SetItemColor(1, aColorDlg.GetColor());
158}
159
160class MaskData
161{
162 VclPtr<SvxBmpMask> pMask;
163 bool bIsReady;
164 bool bExecState;
165 SfxBindings& rBindings;
166
167public:
168 MaskData( SvxBmpMask* pBmpMask, SfxBindings& rBind );
169
170 bool IsCbxReady() const { return bIsReady; }
171 void SetExecState( bool bState ) { bExecState = bState; }
172 bool IsExecReady() const { return bExecState; }
173
174 DECL_LINK( PipetteHdl, const OString&, void )static void LinkStubPipetteHdl(void *, const OString&); void
PipetteHdl(const OString&);
175 DECL_LINK( CbxHdl, weld::ToggleButton&, void)static void LinkStubCbxHdl(void *, weld::ToggleButton&); void
CbxHdl(weld::ToggleButton&);
176 DECL_LINK( CbxTransHdl, weld::ToggleButton&, void )static void LinkStubCbxTransHdl(void *, weld::ToggleButton&
); void CbxTransHdl(weld::ToggleButton&);
177 DECL_LINK( FocusLbHdl, weld::Widget&, void )static void LinkStubFocusLbHdl(void *, weld::Widget&); void
FocusLbHdl(weld::Widget&);
178 DECL_LINK(ExecHdl, weld::Button&, void)static void LinkStubExecHdl(void *, weld::Button&); void ExecHdl
(weld::Button&);
179};
180
181
182MaskData::MaskData( SvxBmpMask* pBmpMask, SfxBindings& rBind ) :
183
184 pMask ( pBmpMask ),
185 bIsReady ( false ),
186 bExecState ( false ),
187 rBindings ( rBind )
188
189{
190}
191
192IMPL_LINK( MaskData, PipetteHdl, const OString&, rId, void )void MaskData::LinkStubPipetteHdl(void * instance, const OString
& data) { return static_cast<MaskData *>(instance)->
PipetteHdl(data); } void MaskData::PipetteHdl(const OString&
rId)
193{
194 SfxBoolItem aBItem( SID_BMPMASK_PIPETTE( 10000 + 351 ),
195 pMask->m_xTbxPipette->get_item_active(rId) );
196
197 rBindings.GetDispatcher()->ExecuteList(SID_BMPMASK_PIPETTE( 10000 + 351 ), OWN_CALLMODESfxCallMode::ASYNCHRON | SfxCallMode::RECORD,
198 { &aBItem });
199}
200
201IMPL_LINK( MaskData, CbxHdl, weld::ToggleButton&, rCbx, void )void MaskData::LinkStubCbxHdl(void * instance, weld::ToggleButton
& data) { return static_cast<MaskData *>(instance)->
CbxHdl(data); } void MaskData::CbxHdl(weld::ToggleButton&
rCbx)
202{
203 bIsReady = pMask->m_xCbx1->get_active() || pMask->m_xCbx2->get_active() ||
204 pMask->m_xCbx3->get_active() || pMask->m_xCbx4->get_active();
205
206 if ( bIsReady && IsExecReady() )
207 pMask->m_xBtnExec->set_sensitive(true);
208 else
209 pMask->m_xBtnExec->set_sensitive(false);
210
211 // When a checkbox is checked, the pipette is enabled
212 if ( !rCbx.get_active() )
213 return;
214
215 MaskSet* pSet = nullptr;
216
217 if (&rCbx == pMask->m_xCbx1.get())
218 pSet = pMask->m_xQSet1.get();
219 else if (&rCbx == pMask->m_xCbx2.get())
220 pSet = pMask->m_xQSet2.get();
221 else if (&rCbx == pMask->m_xCbx3.get())
222 pSet = pMask->m_xQSet3.get();
223 else // if ( &rCbx == pMask->m_xCbx4 )
224 pSet = pMask->m_xQSet4.get();
225
226 pSet->SelectItem( 1 );
227 pSet->Select();
228
229 pMask->m_xTbxPipette->set_item_active("pipette", true);
230 PipetteHdl("pipette");
231}
232
233IMPL_LINK( MaskData, CbxTransHdl, weld::ToggleButton&, rCbx, void )void MaskData::LinkStubCbxTransHdl(void * instance, weld::ToggleButton
& data) { return static_cast<MaskData *>(instance)->
CbxTransHdl(data); } void MaskData::CbxTransHdl(weld::ToggleButton
& rCbx)
234{
235 bIsReady = rCbx.get_active();
236 if ( bIsReady )
237 {
238 pMask->m_xQSet1->Disable();
239 pMask->m_xQSet2->Disable();
240 pMask->m_xQSet3->Disable();
241 pMask->m_xQSet4->Disable();
242 pMask->m_xCtlPipette->Disable();
243 pMask->m_xCbx1->set_sensitive(false);
244 pMask->m_xSp1->set_sensitive(false);
245 pMask->m_xCbx2->set_sensitive(false);
246 pMask->m_xSp2->set_sensitive(false);
247 pMask->m_xCbx3->set_sensitive(false);
248 pMask->m_xSp3->set_sensitive(false);
249 pMask->m_xCbx4->set_sensitive(false);
250 pMask->m_xSp4->set_sensitive(false);
251 pMask->m_xTbxPipette->set_sensitive(false);
252
253 pMask->m_xLbColor1->set_sensitive(false);
254 pMask->m_xLbColor2->set_sensitive(false);
255 pMask->m_xLbColor3->set_sensitive(false);
256 pMask->m_xLbColor4->set_sensitive(false);
257 pMask->m_xLbColorTrans->set_sensitive(true);
258 }
259 else
260 {
261 pMask->m_xQSet1->Enable();
262 pMask->m_xQSet2->Enable();
263 pMask->m_xQSet3->Enable();
264 pMask->m_xQSet4->Enable();
265 pMask->m_xCtlPipette->Enable();
266 pMask->m_xCbx1->set_sensitive(true);
267 pMask->m_xSp1->set_sensitive(true);
268 pMask->m_xCbx2->set_sensitive(true);
269 pMask->m_xSp2->set_sensitive(true);
270 pMask->m_xCbx3->set_sensitive(true);
271 pMask->m_xSp3->set_sensitive(true);
272 pMask->m_xCbx4->set_sensitive(true);
273 pMask->m_xSp4->set_sensitive(true);
274 pMask->m_xTbxPipette->set_sensitive(true);
275
276 pMask->m_xLbColor1->set_sensitive(true);
277 pMask->m_xLbColor2->set_sensitive(true);
278 pMask->m_xLbColor3->set_sensitive(true);
279 pMask->m_xLbColor4->set_sensitive(true);
280 pMask->m_xLbColorTrans->set_sensitive(false);
281
282 bIsReady = pMask->m_xCbx1->get_active() || pMask->m_xCbx2->get_active() ||
283 pMask->m_xCbx3->get_active() || pMask->m_xCbx4->get_active();
284 }
285
286 if ( bIsReady && IsExecReady() )
287 pMask->m_xBtnExec->set_sensitive(true);
288 else
289 pMask->m_xBtnExec->set_sensitive(false);
290}
291
292IMPL_LINK( MaskData, FocusLbHdl, weld::Widget&, rLb, void )void MaskData::LinkStubFocusLbHdl(void * instance, weld::Widget
& data) { return static_cast<MaskData *>(instance)->
FocusLbHdl(data); } void MaskData::FocusLbHdl(weld::Widget&
rLb)
293{
294 pMask->m_xQSet1->SelectItem( &rLb == &pMask->m_xLbColor1->get_widget() ? 1 : 0 /* , false */ );
295 pMask->m_xQSet2->SelectItem( &rLb == &pMask->m_xLbColor2->get_widget() ? 1 : 0 /* , false */ );
296 pMask->m_xQSet3->SelectItem( &rLb == &pMask->m_xLbColor3->get_widget() ? 1 : 0 /* , false */ );
297 pMask->m_xQSet4->SelectItem( &rLb == &pMask->m_xLbColor4->get_widget() ? 1 : 0 /* , false */ );
298}
299
300IMPL_LINK_NOARG(MaskData, ExecHdl, weld::Button&, void)void MaskData::LinkStubExecHdl(void * instance, weld::Button&
data) { return static_cast<MaskData *>(instance)->ExecHdl
(data); } void MaskData::ExecHdl(__attribute__ ((unused)) weld
::Button&)
301{
302 SfxBoolItem aBItem( SID_BMPMASK_EXEC( 10000 + 353 ), true );
303 rBindings.GetDispatcher()->ExecuteList(SID_BMPMASK_EXEC( 10000 + 353 ), OWN_CALLMODESfxCallMode::ASYNCHRON | SfxCallMode::RECORD,
304 { &aBItem });
305}
306
307void BmpColorWindow::Paint( vcl::RenderContext& rRenderContext, const tools::Rectangle& /*Rect*/)
308{
309 rRenderContext.Push(PushFlags::LINECOLOR | PushFlags::FILLCOLOR);
310 rRenderContext.SetLineColor(aColor);
311 rRenderContext.SetFillColor(aColor);
312 rRenderContext.DrawRect(tools::Rectangle(Point(), GetOutputSizePixel()));
313 rRenderContext.Pop();
314}
315
316SvxBmpMaskSelectItem::SvxBmpMaskSelectItem( SvxBmpMask& rMask,
317 SfxBindings& rBindings ) :
318 SfxControllerItem ( SID_BMPMASK_EXEC( 10000 + 353 ), rBindings ),
319 rBmpMask ( rMask)
320{
321}
322
323void SvxBmpMaskSelectItem::StateChanged( sal_uInt16 nSID, SfxItemState /*eState*/,
324 const SfxPoolItem* pItem )
325{
326 if ( ( nSID == SID_BMPMASK_EXEC( 10000 + 353 ) ) && pItem )
327 {
328 const SfxBoolItem* pStateItem = dynamic_cast<const SfxBoolItem*>( pItem );
329 assert(pStateItem)(static_cast <bool> (pStateItem) ? void (0) : __assert_fail
("pStateItem", "/home/maarten/src/libreoffice/core/svx/source/dialog/_bmpmask.cxx"
, 329, __extension__ __PRETTY_FUNCTION__)); // SfxBoolItem expected
330 if (pStateItem)
331 rBmpMask.SetExecState( pStateItem->GetValue() );
332 }
333}
334
335SvxBmpMaskChildWindow::SvxBmpMaskChildWindow(vcl::Window* pParent_, sal_uInt16 nId,
336 SfxBindings* pBindings,
337 SfxChildWinInfo* pInfo)
338 : SfxChildWindow(pParent_, nId)
339{
340 VclPtr<SvxBmpMask> pDlg = VclPtr<SvxBmpMask>::Create(pBindings, this, pParent_);
3
←
Calling 'VclPtr::Create'
→
5
←
Returned allocated memory
→
341
342 SetWindow( pDlg );
6
←
Calling implicit destructor for 'VclPtr<vcl::Window>'
→
7
←
Calling '~Reference'
→
14
←
Returning from '~Reference'
→
15
←
Returning from destructor for 'VclPtr<vcl::Window>'
→
343
344 pDlg->Initialize( pInfo );
16
←
Calling 'VclPtr::operator->'
→
345}
346
347SvxBmpMask::SvxBmpMask(SfxBindings *pBindinx, SfxChildWindow *pCW, vcl::Window* pParent)
348 : SfxDockingWindow(pBindinx, pCW, pParent, "DockingColorReplace",
349 "svx/ui/dockingcolorreplace.ui")
350 , m_xTbxPipette(m_xBuilder->weld_toolbar("toolbar"))
351 , m_xCtlPipette(new BmpColorWindow)
352 , m_xCtlPipetteWin(new weld::CustomWeld(*m_xBuilder, "toolcolor", *m_xCtlPipette))
353 , m_xBtnExec(m_xBuilder->weld_button("replace"))
354 , m_xCbx1(m_xBuilder->weld_check_button("cbx1"))
355 , m_xQSet1(new MaskSet(this))
356 , m_xQSetWin1(new weld::CustomWeld(*m_xBuilder, "qset1", *m_xQSet1))
357 , m_xSp1(m_xBuilder->weld_metric_spin_button("tol1", FieldUnit::PERCENT))
358 , m_xLbColor1(new ColorListBox(m_xBuilder->weld_menu_button("color1"), GetFrameWeld()))
359 , m_xCbx2(m_xBuilder->weld_check_button("cbx2"))
360 , m_xQSet2(new MaskSet(this))
361 , m_xQSetWin2(new weld::CustomWeld(*m_xBuilder, "qset2", *m_xQSet2))
362 , m_xSp2(m_xBuilder->weld_metric_spin_button("tol2", FieldUnit::PERCENT))
363 , m_xLbColor2(new ColorListBox(m_xBuilder->weld_menu_button("color2"), GetFrameWeld()))
364 , m_xCbx3(m_xBuilder->weld_check_button("cbx3"))
365 , m_xQSet3(new MaskSet(this))
366 , m_xQSetWin3(new weld::CustomWeld(*m_xBuilder, "qset3", *m_xQSet3))
367 , m_xSp3(m_xBuilder->weld_metric_spin_button("tol3", FieldUnit::PERCENT))
368 , m_xLbColor3(new ColorListBox(m_xBuilder->weld_menu_button("color3"), GetFrameWeld()))
369 , m_xCbx4(m_xBuilder->weld_check_button("cbx4"))
370 , m_xQSet4(new MaskSet(this))
371 , m_xQSetWin4(new weld::CustomWeld(*m_xBuilder, "qset4", *m_xQSet4))
372 , m_xSp4(m_xBuilder->weld_metric_spin_button("tol4", FieldUnit::PERCENT))
373 , m_xLbColor4(new ColorListBox(m_xBuilder->weld_menu_button("color4"), GetFrameWeld()))
374 , m_xCbxTrans(m_xBuilder->weld_check_button("cbx5"))
375 , m_xLbColorTrans(new ColorListBox(m_xBuilder->weld_menu_button("color5"), GetFrameWeld()))
376 , m_xData(new MaskData(this, *pBindinx))
377 , aPipetteColor(COL_WHITE)
378 , aSelItem(*this, *pBindinx)
379{
380 SetText(SvxResId(RID_SVXDLG_BMPMASK_STR_TITLEreinterpret_cast<char const *>("RID_SVXDLG_BMPMASK_STR_TITLE"
"\004" u8"Color Replacer")));
381
382 m_xLbColor1->SetSlotId(SID_BMPMASK_COLOR( 10000 + 1169 ));
383 m_xLbColor2->SetSlotId(SID_BMPMASK_COLOR( 10000 + 1169 ));
384 m_xLbColor3->SetSlotId(SID_BMPMASK_COLOR( 10000 + 1169 ));
385 m_xLbColor4->SetSlotId(SID_BMPMASK_COLOR( 10000 + 1169 ));
386
387 m_xLbColorTrans->SelectEntry(COL_BLACK);
388 m_xLbColor1->SelectEntry(COL_TRANSPARENT);
389 m_xLbColor2->SelectEntry(COL_TRANSPARENT);
390 m_xLbColor3->SelectEntry(COL_TRANSPARENT);
391 m_xLbColor4->SelectEntry(COL_TRANSPARENT);
392
393 m_xTbxPipette->connect_clicked( LINK( m_xData.get(), MaskData, PipetteHdl )::tools::detail::makeLink( ::tools::detail::castTo<MaskData
*>(m_xData.get()), &MaskData::LinkStubPipetteHdl) );
394 m_xBtnExec->connect_clicked( LINK( m_xData.get(), MaskData, ExecHdl )::tools::detail::makeLink( ::tools::detail::castTo<MaskData
*>(m_xData.get()), &MaskData::LinkStubExecHdl) );
395
396 m_xCbx1->connect_toggled( LINK( m_xData.get(), MaskData, CbxHdl )::tools::detail::makeLink( ::tools::detail::castTo<MaskData
*>(m_xData.get()), &MaskData::LinkStubCbxHdl) );
397 m_xCbx2->connect_toggled( LINK( m_xData.get(), MaskData, CbxHdl )::tools::detail::makeLink( ::tools::detail::castTo<MaskData
*>(m_xData.get()), &MaskData::LinkStubCbxHdl) );
398 m_xCbx3->connect_toggled( LINK( m_xData.get(), MaskData, CbxHdl )::tools::detail::makeLink( ::tools::detail::castTo<MaskData
*>(m_xData.get()), &MaskData::LinkStubCbxHdl) );
399 m_xCbx4->connect_toggled( LINK( m_xData.get(), MaskData, CbxHdl )::tools::detail::makeLink( ::tools::detail::castTo<MaskData
*>(m_xData.get()), &MaskData::LinkStubCbxHdl) );
400 m_xCbxTrans->connect_toggled( LINK( m_xData.get(), MaskData, CbxTransHdl )::tools::detail::makeLink( ::tools::detail::castTo<MaskData
*>(m_xData.get()), &MaskData::LinkStubCbxTransHdl) );
401
402 SetAccessibleNames ();
403
404 m_xLbColor1->connect_focus_in( LINK( m_xData.get(), MaskData, FocusLbHdl )::tools::detail::makeLink( ::tools::detail::castTo<MaskData
*>(m_xData.get()), &MaskData::LinkStubFocusLbHdl) );
405 m_xLbColor2->connect_focus_in( LINK( m_xData.get(), MaskData, FocusLbHdl )::tools::detail::makeLink( ::tools::detail::castTo<MaskData
*>(m_xData.get()), &MaskData::LinkStubFocusLbHdl) );
406 m_xLbColor3->connect_focus_in( LINK( m_xData.get(), MaskData, FocusLbHdl )::tools::detail::makeLink( ::tools::detail::castTo<MaskData
*>(m_xData.get()), &MaskData::LinkStubFocusLbHdl) );
407 m_xLbColor4->connect_focus_in( LINK( m_xData.get(), MaskData, FocusLbHdl )::tools::detail::makeLink( ::tools::detail::castTo<MaskData
*>(m_xData.get()), &MaskData::LinkStubFocusLbHdl) );
408 m_xLbColorTrans->set_sensitive(false);
409
410 OUString sColorPalette (SvxResId( RID_SVXDLG_BMPMASK_STR_PALETTEreinterpret_cast<char const *>("RID_SVXDLG_BMPMASK_STR_PALETTE"
"\004" u8"Color Palette")));
411 OUString sColorPaletteN;
412
413 m_xQSet1->SetStyle( m_xQSet1->GetStyle() | WB_DOUBLEBORDER(WinBits(0x00020000)) | WB_ITEMBORDER(WinBits(0x00010000)) );
414 m_xQSet1->SetColCount();
415 m_xQSet1->SetLineCount( 1 );
416 sColorPaletteN = sColorPalette + " 1";
417 m_xQSet1->InsertItem( 1, aPipetteColor, sColorPaletteN);
418 m_xQSet1->SelectItem( 1 );
419
420 m_xQSet2->SetStyle( m_xQSet2->GetStyle() | WB_DOUBLEBORDER(WinBits(0x00020000)) | WB_ITEMBORDER(WinBits(0x00010000)) );
421 m_xQSet2->SetColCount();
422 m_xQSet2->SetLineCount( 1 );
423 sColorPaletteN = sColorPalette + " 2";
424 m_xQSet2->InsertItem( 1, aPipetteColor, sColorPaletteN);
425 m_xQSet2->SelectItem( 0 );
426
427 m_xQSet3->SetStyle( m_xQSet3->GetStyle() | WB_DOUBLEBORDER(WinBits(0x00020000)) | WB_ITEMBORDER(WinBits(0x00010000)) );
428 m_xQSet3->SetColCount();
429 m_xQSet3->SetLineCount( 1 );
430 sColorPaletteN = sColorPalette + " 3";
431 m_xQSet3->InsertItem( 1, aPipetteColor, sColorPaletteN);
432 m_xQSet3->SelectItem( 0 );
433
434 m_xQSet4->SetStyle( m_xQSet4->GetStyle() | WB_DOUBLEBORDER(WinBits(0x00020000)) | WB_ITEMBORDER(WinBits(0x00010000)) );
435 m_xQSet4->SetColCount();
436 m_xQSet4->SetLineCount( 1 );
437 sColorPaletteN = sColorPalette + " 4";
438 m_xQSet4->InsertItem( 1, aPipetteColor, sColorPaletteN);
439 m_xQSet4->SelectItem( 0 );
440
441 m_xQSet1->Show();
442 m_xQSet2->Show();
443 m_xQSet3->Show();
444 m_xQSet4->Show();
445}
446
447SvxBmpMask::~SvxBmpMask()
448{
449 disposeOnce();
450}
451
452void SvxBmpMask::dispose()
453{
454 m_xQSetWin1.reset();
455 m_xQSet1.reset();
456 m_xQSetWin2.reset();
457 m_xQSet2.reset();
458 m_xQSetWin3.reset();
459 m_xQSet3.reset();
460 m_xQSetWin4.reset();
461 m_xQSet4.reset();
462 m_xCtlPipetteWin.reset();
463 m_xCtlPipette.reset();
464 m_xData.reset();
465 m_xTbxPipette.reset();
466 m_xBtnExec.reset();
467 m_xCbx1.reset();
468 m_xSp1.reset();
469 m_xLbColor1.reset();
470 m_xCbx2.reset();
471 m_xSp2.reset();
472 m_xLbColor2.reset();
473 m_xCbx3.reset();
474 m_xSp3.reset();
475 m_xLbColor3.reset();
476 m_xCbx4.reset();
477 m_xSp4.reset();
478 m_xLbColor4.reset();
479 m_xCbxTrans.reset();
480 m_xLbColorTrans.reset();
481 aSelItem.dispose();
482 SfxDockingWindow::dispose();
483}
484
485/** is called by a MaskSet when it is selected */
486void SvxBmpMask::onSelect( const MaskSet* pSet )
487{
488 // now deselect all other value sets
489 if( pSet != m_xQSet1.get() )
490 m_xQSet1->SelectItem( 0 );
491
492 if( pSet != m_xQSet2.get() )
493 m_xQSet2->SelectItem( 0 );
494
495 if( pSet != m_xQSet3.get() )
496 m_xQSet3->SelectItem( 0 );
497
498 if( pSet != m_xQSet4.get() )
499 m_xQSet4->SelectItem( 0 );
500}
501
502bool SvxBmpMask::Close()
503{
504 SfxBoolItem aItem2( SID_BMPMASK_PIPETTE( 10000 + 351 ), false );
505 GetBindings().GetDispatcher()->ExecuteList(SID_BMPMASK_PIPETTE( 10000 + 351 ),
506 OWN_CALLMODESfxCallMode::ASYNCHRON | SfxCallMode::RECORD, { &aItem2 });
507
508 return SfxDockingWindow::Close();
509}
510
511void SvxBmpMask::SetColor( const Color& rColor )
512{
513 aPipetteColor = rColor;
514 m_xCtlPipette->SetColor( aPipetteColor );
515}
516
517void SvxBmpMask::PipetteClicked()
518{
519 if( m_xQSet1->GetSelectedItemId() == 1 )
520 {
521 m_xCbx1->set_active(true);
522 m_xData->CbxHdl(*m_xCbx1);
523 m_xQSet1->SetItemColor( 1, aPipetteColor );
524 m_xQSet1->SetFormat();
525 }
526 else if( m_xQSet2->GetSelectedItemId() == 1 )
527 {
528 m_xCbx2->set_active(true);
529 m_xData->CbxHdl(*m_xCbx2);
530 m_xQSet2->SetItemColor( 1, aPipetteColor );
531 m_xQSet2->SetFormat();
532 }
533 else if( m_xQSet3->GetSelectedItemId() == 1 )
534 {
535 m_xCbx3->set_active(true);
536 m_xData->CbxHdl(*m_xCbx3);
537 m_xQSet3->SetItemColor( 1, aPipetteColor );
538 m_xQSet3->SetFormat();
539 }
540 else if( m_xQSet4->GetSelectedItemId() == 1 )
541 {
542 m_xCbx4->set_active(true);
543 m_xData->CbxHdl(*m_xCbx4);
544 m_xQSet4->SetItemColor( 1, aPipetteColor );
545 m_xQSet4->SetFormat();
546 }
547
548 m_xTbxPipette->set_item_active("pipette", false);
549 m_xData->PipetteHdl("pipette");
550}
551
552void SvxBmpMask::SetExecState( bool bEnable )
553{
554 m_xData->SetExecState( bEnable );
555
556 if ( m_xData->IsExecReady() && m_xData->IsCbxReady() )
557 m_xBtnExec->set_sensitive(true);
558 else
559 m_xBtnExec->set_sensitive(false);
560}
561
562
563sal_uInt16 SvxBmpMask::InitColorArrays( Color* pSrcCols, Color* pDstCols, sal_uInt8* pTols )
564{
565 sal_uInt16 nCount = 0;
566
567 if ( m_xCbx1->get_active() )
568 {
569 pSrcCols[nCount] = m_xQSet1->GetItemColor( 1 );
570 pDstCols[nCount] = m_xLbColor1->GetSelectEntryColor();
571 pTols[nCount++] = static_cast<sal_uInt8>(m_xSp1->get_value(FieldUnit::PERCENT));
572 }
573
574 if ( m_xCbx2->get_active() )
575 {
576 pSrcCols[nCount] = m_xQSet2->GetItemColor( 1 );
577 pDstCols[nCount] = m_xLbColor2->GetSelectEntryColor();
578 pTols[nCount++] = static_cast<sal_uInt8>(m_xSp2->get_value(FieldUnit::PERCENT));
579 }
580
581 if ( m_xCbx3->get_active() )
582 {
583 pSrcCols[nCount] = m_xQSet3->GetItemColor( 1 );
584 pDstCols[nCount] = m_xLbColor3->GetSelectEntryColor();
585 pTols[nCount++] = static_cast<sal_uInt8>(m_xSp3->get_value(FieldUnit::PERCENT));
586 }
587
588 if ( m_xCbx4->get_active() )
589 {
590 pSrcCols[nCount] = m_xQSet4->GetItemColor( 1 );
591 pDstCols[nCount] = m_xLbColor4->GetSelectEntryColor();
592 pTols[nCount++] = static_cast<sal_uInt8>(m_xSp4->get_value(FieldUnit::PERCENT));
593 }
594
595 return nCount;
596}
597
598void SvxBmpMask::ImpMask( BitmapEx& rBitmap )
599{
600 Color pSrcCols[4];
601 Color pDstCols[4];
602 sal_uInt8 pTols[4];
603 const sal_uInt16 nCount = InitColorArrays( pSrcCols, pDstCols, pTols );
604
605 EnterWait();
606 rBitmap.Replace( pSrcCols, pDstCols, nCount, pTols );
607 LeaveWait();
608}
609
610BitmapEx SvxBmpMask::ImpMaskTransparent( const BitmapEx& rBitmapEx, const Color& rColor, const sal_uInt8 nTol )
611{
612 EnterWait();
613
614 BitmapEx aBmpEx;
615 Bitmap aMask( rBitmapEx.GetBitmap().CreateMask( rColor, nTol ) );
616
617 if( rBitmapEx.IsTransparent() )
618 aMask.CombineSimple( rBitmapEx.GetMask(), BmpCombine::Or );
619
620 aBmpEx = BitmapEx( rBitmapEx.GetBitmap(), aMask );
621 LeaveWait();
622
623 return aBmpEx;
624}
625
626
627Animation SvxBmpMask::ImpMask( const Animation& rAnimation )
628{
629 Animation aAnimation( rAnimation );
630 Color pSrcCols[4];
631 Color pDstCols[4];
632 sal_uInt8 pTols[4];
633 InitColorArrays( pSrcCols, pDstCols, pTols );
634 sal_uInt16 nAnimationCount = aAnimation.Count();
635
636 for( sal_uInt16 i = 0; i < nAnimationCount; i++ )
637 {
638 AnimationBitmap aAnimationBitmap( aAnimation.Get( i ) );
639 aAnimationBitmap.maBitmapEx = Mask(aAnimationBitmap.maBitmapEx).GetBitmapEx();
640 aAnimation.Replace(aAnimationBitmap, i);
641 }
642
643 return aAnimation;
644}
645
646
647GDIMetaFile SvxBmpMask::ImpMask( const GDIMetaFile& rMtf )
648{
649 GDIMetaFile aMtf;
650 Color pSrcCols[4];
651 Color pDstCols[4];
652 sal_uInt8 pTols[4];
653 sal_uInt16 nCount = InitColorArrays( pSrcCols, pDstCols, pTols );
654
655 // If no color is selected, we copy only the Mtf
656 if( !nCount )
657 aMtf = rMtf;
658 else
659 {
660 bool pTrans[4];
661 Color aCol;
662 long nR;
663 long nG;
664 long nB;
665 std::unique_ptr<long[]> pMinR(new long[nCount]);
666 std::unique_ptr<long[]> pMaxR(new long[nCount]);
667 std::unique_ptr<long[]> pMinG(new long[nCount]);
668 std::unique_ptr<long[]> pMaxG(new long[nCount]);
669 std::unique_ptr<long[]> pMinB(new long[nCount]);
670 std::unique_ptr<long[]> pMaxB(new long[nCount]);
671 sal_uInt16 i;
672
673 aMtf.SetPrefSize( rMtf.GetPrefSize() );
674 aMtf.SetPrefMapMode( rMtf.GetPrefMapMode() );
675
676 // Prepare Color comparison array
677 for( i = 0; i < nCount; i++ )
678 {
679 long nTol = ( pTols[i] * 255 ) / 100;
680
681 long nVal = static_cast<long>(pSrcCols[i].GetRed());
682 pMinR[i] = std::max( nVal - nTol, 0L );
683 pMaxR[i] = std::min( nVal + nTol, 255L );
684
685 nVal = static_cast<long>(pSrcCols[i].GetGreen());
686 pMinG[i] = std::max( nVal - nTol, 0L );
687 pMaxG[i] = std::min( nVal + nTol, 255L );
688
689 nVal = static_cast<long>(pSrcCols[i].GetBlue());
690 pMinB[i] = std::max( nVal - nTol, 0L );
691 pMaxB[i] = std::min( nVal + nTol, 255L );
692
693 pTrans[ i ] = (pDstCols[ i ] == COL_TRANSPARENT);
694 }
695
696 // Investigate actions and if necessary replace colors
697 for( size_t nAct = 0, nActCount = rMtf.GetActionSize(); nAct < nActCount; nAct++ )
698 {
699 MetaAction* pAction = rMtf.GetAction( nAct );
700
701 bool bReplace = false;
702
703 switch( pAction->GetType() )
704 {
705 case MetaActionType::PIXEL:
706 {
707 MetaPixelAction* pAct = static_cast<MetaPixelAction*>(pAction);
708
709 aCol = pAct->GetColor();
710 TEST_COLS(){ nR = aCol.GetRed(); nG = aCol.GetGreen(); nB = aCol.GetBlue
(); for( i = 0; i < nCount; i++ ) { if ( ( pMinR[i] <= nR
) && ( pMaxR[i] >= nR ) && ( pMinG[i] <=
nG ) && ( pMaxG[i] >= nG ) && ( pMinB[i] <=
nB ) && ( pMaxB[i] >= nB ) ) { aCol = pDstCols[i]
; bReplace = true; break; } } };
711
712 if( bReplace )
713 pAct = new MetaPixelAction( pAct->GetPoint(), aCol );
714
715 aMtf.AddAction( pAct );
716 }
717 break;
718
719 case MetaActionType::LINECOLOR:
720 {
721 MetaLineColorAction* pAct = static_cast<MetaLineColorAction*>(pAction);
722
723 aCol = pAct->GetColor();
724 TEST_COLS(){ nR = aCol.GetRed(); nG = aCol.GetGreen(); nB = aCol.GetBlue
(); for( i = 0; i < nCount; i++ ) { if ( ( pMinR[i] <= nR
) && ( pMaxR[i] >= nR ) && ( pMinG[i] <=
nG ) && ( pMaxG[i] >= nG ) && ( pMinB[i] <=
nB ) && ( pMaxB[i] >= nB ) ) { aCol = pDstCols[i]
; bReplace = true; break; } } };
725
726 if( bReplace )
727 pAct = new MetaLineColorAction( aCol, !pTrans[ i ] );
728
729 aMtf.AddAction( pAct );
730 }
731 break;
732
733 case MetaActionType::FILLCOLOR:
734 {
735 MetaFillColorAction* pAct = static_cast<MetaFillColorAction*>(pAction);
736
737 aCol = pAct->GetColor();
738 TEST_COLS(){ nR = aCol.GetRed(); nG = aCol.GetGreen(); nB = aCol.GetBlue
(); for( i = 0; i < nCount; i++ ) { if ( ( pMinR[i] <= nR
) && ( pMaxR[i] >= nR ) && ( pMinG[i] <=
nG ) && ( pMaxG[i] >= nG ) && ( pMinB[i] <=
nB ) && ( pMaxB[i] >= nB ) ) { aCol = pDstCols[i]
; bReplace = true; break; } } };
739
740 if( bReplace )
741 pAct = new MetaFillColorAction( aCol, !pTrans[ i ] );
742
743 aMtf.AddAction( pAct );
744 }
745 break;
746
747 case MetaActionType::TEXTCOLOR:
748 {
749 MetaTextColorAction* pAct = static_cast<MetaTextColorAction*>(pAction);
750
751 aCol = pAct->GetColor();
752 TEST_COLS(){ nR = aCol.GetRed(); nG = aCol.GetGreen(); nB = aCol.GetBlue
(); for( i = 0; i < nCount; i++ ) { if ( ( pMinR[i] <= nR
) && ( pMaxR[i] >= nR ) && ( pMinG[i] <=
nG ) && ( pMaxG[i] >= nG ) && ( pMinB[i] <=
nB ) && ( pMaxB[i] >= nB ) ) { aCol = pDstCols[i]
; bReplace = true; break; } } };
753
754 if( bReplace )
755 pAct = new MetaTextColorAction( aCol );
756
757 aMtf.AddAction( pAct );
758 }
759 break;
760
761 case MetaActionType::TEXTFILLCOLOR:
762 {
763 MetaTextFillColorAction* pAct = static_cast<MetaTextFillColorAction*>(pAction);
764
765 aCol = pAct->GetColor();
766 TEST_COLS(){ nR = aCol.GetRed(); nG = aCol.GetGreen(); nB = aCol.GetBlue
(); for( i = 0; i < nCount; i++ ) { if ( ( pMinR[i] <= nR
) && ( pMaxR[i] >= nR ) && ( pMinG[i] <=
nG ) && ( pMaxG[i] >= nG ) && ( pMinB[i] <=
nB ) && ( pMaxB[i] >= nB ) ) { aCol = pDstCols[i]
; bReplace = true; break; } } };
767
768 if( bReplace )
769 pAct = new MetaTextFillColorAction( aCol, !pTrans[ i ] );
770
771 aMtf.AddAction( pAct );
772 }
773 break;
774
775 case MetaActionType::FONT:
776 {
777 MetaFontAction* pAct = static_cast<MetaFontAction*>(pAction);
778 vcl::Font aFont( pAct->GetFont() );
779
780 aCol = aFont.GetColor();
781 TEST_COLS(){ nR = aCol.GetRed(); nG = aCol.GetGreen(); nB = aCol.GetBlue
(); for( i = 0; i < nCount; i++ ) { if ( ( pMinR[i] <= nR
) && ( pMaxR[i] >= nR ) && ( pMinG[i] <=
nG ) && ( pMaxG[i] >= nG ) && ( pMinB[i] <=
nB ) && ( pMaxB[i] >= nB ) ) { aCol = pDstCols[i]
; bReplace = true; break; } } };
782
783 if( bReplace )
784 {
785 aFont.SetColor( aCol );
786 pAct = new MetaFontAction( aFont );
787 }
788
789 aMtf.AddAction( pAct );
790 }
791 break;
792
793 case MetaActionType::WALLPAPER:
794 {
795 MetaWallpaperAction* pAct = static_cast<MetaWallpaperAction*>(pAction);
796 Wallpaper aWall( pAct->GetWallpaper() );
797
798 aCol = aWall.GetColor();
799 TEST_COLS(){ nR = aCol.GetRed(); nG = aCol.GetGreen(); nB = aCol.GetBlue
(); for( i = 0; i < nCount; i++ ) { if ( ( pMinR[i] <= nR
) && ( pMaxR[i] >= nR ) && ( pMinG[i] <=
nG ) && ( pMaxG[i] >= nG ) && ( pMinB[i] <=
nB ) && ( pMaxB[i] >= nB ) ) { aCol = pDstCols[i]
; bReplace = true; break; } } };
800
801 if( bReplace )
802 {
803 aWall.SetColor( aCol );
804 pAct = new MetaWallpaperAction( pAct->GetRect(), aWall );
805 }
806
807 aMtf.AddAction( pAct );
808 }
809 break;
810
811 case MetaActionType::BMP:
812 {
813 MetaBmpAction* pAct = static_cast<MetaBmpAction*>(pAction);
814 const Bitmap aBmp( Mask(BitmapEx(pAct->GetBitmap())).GetBitmapEx().GetBitmap() );
815
816 pAct = new MetaBmpAction( pAct->GetPoint(), aBmp );
817 aMtf.AddAction( pAct );
818 }
819 break;
820
821 case MetaActionType::BMPSCALE:
822 {
823 MetaBmpScaleAction* pAct = static_cast<MetaBmpScaleAction*>(pAction);
824 const Bitmap aBmp( Mask(BitmapEx(pAct->GetBitmap())).GetBitmapEx().GetBitmap() );
825
826 pAct = new MetaBmpScaleAction( pAct->GetPoint(), pAct->GetSize(), aBmp );
827 aMtf.AddAction( pAct );
828 }
829 break;
830
831 case MetaActionType::BMPSCALEPART:
832 {
833 MetaBmpScalePartAction* pAct = static_cast<MetaBmpScalePartAction*>(pAction);
834 const Bitmap aBmp( Mask(BitmapEx(pAct->GetBitmap())).GetBitmapEx().GetBitmap() );
835
836 pAct = new MetaBmpScalePartAction( pAct->GetDestPoint(), pAct->GetDestSize(),
837 pAct->GetSrcPoint(), pAct->GetSrcSize(), aBmp );
838 aMtf.AddAction( pAct );
839 }
840 break;
841
842 case MetaActionType::BMPEX:
843 {
844 MetaBmpExAction* pAct = static_cast<MetaBmpExAction*>(pAction);
845 const BitmapEx aBmpEx( Mask( pAct->GetBitmapEx() ).GetBitmapEx() );
846
847 pAct = new MetaBmpExAction( pAct->GetPoint(), aBmpEx );
848 aMtf.AddAction( pAct );
849 }
850 break;
851
852 case MetaActionType::BMPEXSCALE:
853 {
854 MetaBmpExScaleAction* pAct = static_cast<MetaBmpExScaleAction*>(pAction);
855 const BitmapEx aBmpEx( Mask( pAct->GetBitmapEx() ).GetBitmapEx() );
856
857 pAct = new MetaBmpExScaleAction( pAct->GetPoint(), pAct->GetSize(), aBmpEx );
858 aMtf.AddAction( pAct );
859 }
860 break;
861
862 case MetaActionType::BMPEXSCALEPART:
863 {
864 MetaBmpExScalePartAction* pAct = static_cast<MetaBmpExScalePartAction*>(pAction);
865 const BitmapEx aBmpEx( Mask( pAct->GetBitmapEx() ).GetBitmapEx() );
866
867 pAct = new MetaBmpExScalePartAction( pAct->GetDestPoint(), pAct->GetDestSize(),
868 pAct->GetSrcPoint(), pAct->GetSrcSize(), aBmpEx );
869 aMtf.AddAction( pAct );
870 }
871 break;
872
873 default:
874 {
875 aMtf.AddAction( pAction );
876 }
877 break;
878 }
879 }
880 }
881
882 LeaveWait();
883
884 return aMtf;
885}
886
887
888Animation SvxBmpMask::ImpReplaceTransparency( const Animation& rAnim, const Color& rColor )
889{
890 Animation aAnimation( rAnim );
891 sal_uInt16 nAnimationCount = aAnimation.Count();
892
893 for( sal_uInt16 i = 0; i < nAnimationCount; i++ )
894 {
895 AnimationBitmap aAnimationBitmap(aAnimation.Get(i));
896 aAnimationBitmap.maBitmapEx.ReplaceTransparency(rColor);
897 aAnimation.Replace(aAnimationBitmap, i);
898 }
899
900 return aAnimation;
901}
902
903
904GDIMetaFile SvxBmpMask::ImpReplaceTransparency( const GDIMetaFile& rMtf, const Color& rColor )
905{
906 ScopedVclPtrInstance< VirtualDevice > pVDev;
907 GDIMetaFile aMtf;
908 const MapMode& rPrefMap = rMtf.GetPrefMapMode();
909 const Size& rPrefSize = rMtf.GetPrefSize();
910 const size_t nActionCount = rMtf.GetActionSize();
911
912 pVDev->EnableOutput( false );
913 aMtf.Record( pVDev );
914 aMtf.SetPrefSize( rPrefSize );
915 aMtf.SetPrefMapMode( rPrefMap );
916 pVDev->SetLineColor( rColor );
917 pVDev->SetFillColor( rColor );
918
919 // retrieve one action at the time; first
920 // set the whole area to the replacement color.
921 pVDev->DrawRect( tools::Rectangle( rPrefMap.GetOrigin(), rPrefSize ) );
922 for ( size_t i = 0; i < nActionCount; i++ )
923 {
924 MetaAction* pAct = rMtf.GetAction( i );
925 aMtf.AddAction( pAct );
926 }
927
928 aMtf.Stop();
929 aMtf.WindStart();
930
931 return aMtf;
932}
933
934GDIMetaFile SvxBmpMask::GetMetaFile(const Graphic& rGraphic)
935{
936 // Replace transparency?
937 if (m_xCbxTrans->get_active())
938 return ImpReplaceTransparency(rGraphic.GetGDIMetaFile(), m_xLbColorTrans->GetSelectEntryColor());
939 return ImpMask(rGraphic.GetGDIMetaFile());
940}
941
942Graphic SvxBmpMask::Mask( const Graphic& rGraphic )
943{
944 Graphic aGraphic( rGraphic );
945 const Color aReplColor( m_xLbColorTrans->GetSelectEntryColor() );
946
947 switch( rGraphic.GetType() )
948 {
949 case GraphicType::Bitmap:
950 {
951 if( rGraphic.IsAnimated() )
952 {
953 // Replace transparency?
954 if ( m_xCbxTrans->get_active() )
955 aGraphic = ImpReplaceTransparency( rGraphic.GetAnimation(), aReplColor );
956 else
957 aGraphic = ImpMask( rGraphic.GetAnimation() );
958 }
959 else
960 {
961 // Replace transparency?
962 if( m_xCbxTrans->get_active() )
963 {
964 BitmapEx aBmpEx = aGraphic.GetBitmapEx();
965 aBmpEx.ReplaceTransparency(aReplColor);
966 aGraphic = aBmpEx;
967 }
968 else
969 {
970 Color pSrcCols[4];
971 Color pDstCols[4];
972 sal_uInt8 pTols[4];
973 sal_uInt16 nCount = InitColorArrays( pSrcCols, pDstCols, pTols );
974
975 if( nCount )
976 {
977 // first set all transparent colors
978 for( sal_uInt16 i = 0; i < nCount; i++ )
979 {
980 // Do we have a transparent color?
981 if (pDstCols[i] == COL_TRANSPARENT)
982 {
983 BitmapEx aBmpEx( ImpMaskTransparent( aGraphic.GetBitmapEx(),
984 pSrcCols[ i ], pTols[ i ] ) );
985 const Size aSize( aBmpEx.GetSizePixel() );
986
987 if( aSize.Width() && aSize.Height() )
988 aGraphic = aBmpEx;
989 }
990 }
991
992 // now replace it again with the normal colors
993 BitmapEx aBitmapEx( aGraphic.GetBitmapEx() );
994 if ( aBitmapEx.GetSizePixel().Width() && aBitmapEx.GetSizePixel().Height() )
995 {
996 ImpMask( aBitmapEx );
997 if ( aGraphic.IsTransparent() )
998 aGraphic = Graphic( BitmapEx( aBitmapEx.GetBitmap(), aBitmapEx.GetMask() ) );
999 else
1000 aGraphic = aBitmapEx;
1001 }
1002 }
1003 }
1004 }
1005 }
1006 break;
1007
1008 case GraphicType::GdiMetafile:
1009 {
1010 GDIMetaFile aMtf(GetMetaFile(rGraphic));
1011 Size aSize( aMtf.GetPrefSize() );
1012 if ( aSize.Width() && aSize.Height() )
1013 aGraphic = Graphic( aMtf );
1014 else
1015 aGraphic = rGraphic;
1016 }
1017 break;
1018
1019 default:
1020 aGraphic = rGraphic;
1021 break;
1022 }
1023
1024 if( aGraphic != rGraphic )
1025 {
1026 aGraphic.SetPrefSize( rGraphic.GetPrefSize() );
1027 aGraphic.SetPrefMapMode( rGraphic.GetPrefMapMode() );
1028 }
1029
1030 return aGraphic;
1031}
1032
1033bool SvxBmpMask::IsEyedropping() const
1034{
1035 return m_xTbxPipette->get_item_active("pipette");
1036}
1037
1038/** Set an accessible name for the source color check boxes. Without this
1039 the lengthy description is read.
1040*/
1041void SvxBmpMask::SetAccessibleNames()
1042{
1043 // set the accessible name for valueset
1044 OUString sColorPalette (SvxResId( RID_SVXDLG_BMPMASK_STR_PALETTEreinterpret_cast<char const *>("RID_SVXDLG_BMPMASK_STR_PALETTE"
"\004" u8"Color Palette")));
1045 OUString sColorPaletteN;
1046
1047 sColorPaletteN = sColorPalette + " 1";
1048 m_xQSet1->SetText (sColorPaletteN);
1049 sColorPaletteN = sColorPalette + " 2";
1050 m_xQSet2->SetText (sColorPaletteN);
1051 sColorPaletteN = sColorPalette + " 3";
1052 m_xQSet3->SetText (sColorPaletteN);
1053 sColorPaletteN = sColorPalette + " 4";
1054 m_xQSet4->SetText (sColorPaletteN);
1055}
1056
1057/* vim:set shiftwidth=4 softtabstop=4 expandtab: */
←

/usr/bin/../lib/gcc/x86_64-redhat-linux/10/../../../../include/c++/10/bits/unique_ptr.h

→
1// unique_ptr implementation -*- C++ -*-
2
3// Copyright (C) 2008-2020 Free Software Foundation, Inc.
4//
5// This file is part of the GNU ISO C++ Library. This library is free
6// software; you can redistribute it and/or modify it under the
7// terms of the GNU General Public License as published by the
8// Free Software Foundation; either version 3, or (at your option)
9// any later version.
10
11// This library is distributed in the hope that it will be useful,
12// but WITHOUT ANY WARRANTY; without even the implied warranty of
13// MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
14// GNU General Public License for more details.
15
16// Under Section 7 of GPL version 3, you are granted additional
17// permissions described in the GCC Runtime Library Exception, version
18// 3.1, as published by the Free Software Foundation.
19
20// You should have received a copy of the GNU General Public License and
21// a copy of the GCC Runtime Library Exception along with this program;
22// see the files COPYING3 and COPYING.RUNTIME respectively. If not, see
23// <http://www.gnu.org/licenses/>.
24
25/** @file bits/unique_ptr.h
26 * This is an internal header file, included by other library headers.
27 * Do not attempt to use it directly. @headername{memory}
28 */
29
30#ifndef _UNIQUE_PTR_H1
31#define _UNIQUE_PTR_H1 1
32
33#include <bits/c++config.h>
34#include <debug/assertions.h>
35#include <type_traits>
36#include <utility>
37#include <tuple>
38#include <bits/stl_function.h>
39#include <bits/functional_hash.h>
40#if __cplusplus201703L > 201703L
41# include <compare>
42# include <ostream>
43#endif
44
45namespace std _GLIBCXX_VISIBILITY(default)__attribute__ ((__visibility__ ("default")))
46{
47_GLIBCXX_BEGIN_NAMESPACE_VERSION
48
49 /**
50 * @addtogroup pointer_abstractions
51 * @{
52 */
53
54#if _GLIBCXX_USE_DEPRECATED1
55#pragma GCC diagnostic push
56#pragma GCC diagnostic ignored "-Wdeprecated-declarations"
57 template<typename> class auto_ptr;
58#pragma GCC diagnostic pop
59#endif
60
61 /// Primary template of default_delete, used by unique_ptr for single objects
62 template<typename _Tp>
63 struct default_delete
64 {
65 /// Default constructor
66 constexpr default_delete() noexcept = default;
67
68 /** @brief Converting constructor.
69 *
70 * Allows conversion from a deleter for objects of another type, `_Up`,
71 * only if `_Up*` is convertible to `_Tp*`.
72 */
73 template<typename _Up,
74 typename = _Require<is_convertible<_Up*, _Tp*>>>
75 default_delete(const default_delete<_Up>&) noexcept { }
76
77 /// Calls `delete __ptr`
78 void
79 operator()(_Tp* __ptr) const
80 {
81 static_assert(!is_void<_Tp>::value,
82 "can't delete pointer to incomplete type");
83 static_assert(sizeof(_Tp)>0,
84 "can't delete pointer to incomplete type");
85 delete __ptr;
86 }
87 };
88
89 // _GLIBCXX_RESOLVE_LIB_DEFECTS
90 // DR 740 - omit specialization for array objects with a compile time length
91
92 /// Specialization of default_delete for arrays, used by `unique_ptr<T[]>`
93 template<typename _Tp>
94 struct default_delete<_Tp[]>
95 {
96 public:
97 /// Default constructor
98 constexpr default_delete() noexcept = default;
99
100 /** @brief Converting constructor.
101 *
102 * Allows conversion from a deleter for arrays of another type, such as
103 * a const-qualified version of `_Tp`.
104 *
105 * Conversions from types derived from `_Tp` are not allowed because
106 * it is undefined to `delete[]` an array of derived types through a
107 * pointer to the base type.
108 */
109 template<typename _Up,
110 typename = _Require<is_convertible<_Up(*)[], _Tp(*)[]>>>
111 default_delete(const default_delete<_Up[]>&) noexcept { }
112
113 /// Calls `delete[] __ptr`
114 template<typename _Up>
115 typename enable_if<is_convertible<_Up(*)[], _Tp(*)[]>::value>::type
116 operator()(_Up* __ptr) const
117 {
118 static_assert(sizeof(_Tp)>0,
119 "can't delete pointer to incomplete type");
120 delete [] __ptr;
121 }
122 };
123
124 /// @cond undocumented
125
126 // Manages the pointer and deleter of a unique_ptr
127 template <typename _Tp, typename _Dp>
128 class __uniq_ptr_impl
129 {
130 template <typename _Up, typename _Ep, typename = void>
131 struct _Ptr
132 {
133 using type = _Up*;
134 };
135
136 template <typename _Up, typename _Ep>
137 struct
138 _Ptr<_Up, _Ep, __void_t<typename remove_reference<_Ep>::type::pointer>>
139 {
140 using type = typename remove_reference<_Ep>::type::pointer;
141 };
142
143 public:
144 using _DeleterConstraint = enable_if<
145 __and_<__not_<is_pointer<_Dp>>,
146 is_default_constructible<_Dp>>::value>;
147
148 using pointer = typename _Ptr<_Tp, _Dp>::type;
149
150 static_assert( !is_rvalue_reference<_Dp>::value,
151 "unique_ptr's deleter type must be a function object type"
152 " or an lvalue reference type" );
153
154 __uniq_ptr_impl() = default;
155 __uniq_ptr_impl(pointer __p) : _M_t() { _M_ptr() = __p; }
156
157 template<typename _Del>
158 __uniq_ptr_impl(pointer __p, _Del&& __d)
159 : _M_t(__p, std::forward<_Del>(__d)) { }
160
161 __uniq_ptr_impl(__uniq_ptr_impl&& __u) noexcept
162 : _M_t(std::move(__u._M_t))
163 { __u._M_ptr() = nullptr; }
164
165 __uniq_ptr_impl& operator=(__uniq_ptr_impl&& __u) noexcept
166 {
167 reset(__u.release());
168 _M_deleter() = std::forward<_Dp>(__u._M_deleter());
169 return *this;
170 }
171
172 pointer& _M_ptr() { return std::get<0>(_M_t); }
173 pointer _M_ptr() const { return std::get<0>(_M_t); }
174 _Dp& _M_deleter() { return std::get<1>(_M_t); }
175 const _Dp& _M_deleter() const { return std::get<1>(_M_t); }
176
177 void reset(pointer __p) noexcept
178 {
179 const pointer __old_p = _M_ptr();
180 _M_ptr() = __p;
181 if (__old_p)
182 _M_deleter()(__old_p);
183 }
184
185 pointer release() noexcept
186 {
187 pointer __p = _M_ptr();
188 _M_ptr() = nullptr;
189 return __p;
190 }
191
192 void
193 swap(__uniq_ptr_impl& __rhs) noexcept
194 {
195 using std::swap;
196 swap(this->_M_ptr(), __rhs._M_ptr());
197 swap(this->_M_deleter(), __rhs._M_deleter());
198 }
199
200 private:
201 tuple<pointer, _Dp> _M_t;
202 };
203
204 // Defines move construction + assignment as either defaulted or deleted.
205 template <typename _Tp, typename _Dp,
206 bool = is_move_constructible<_Dp>::value,
207 bool = is_move_assignable<_Dp>::value>
208 struct __uniq_ptr_data : __uniq_ptr_impl<_Tp, _Dp>
209 {
210 using __uniq_ptr_impl<_Tp, _Dp>::__uniq_ptr_impl;
211 __uniq_ptr_data(__uniq_ptr_data&&) = default;
212 __uniq_ptr_data& operator=(__uniq_ptr_data&&) = default;
213 };
214
215 template <typename _Tp, typename _Dp>
216 struct __uniq_ptr_data<_Tp, _Dp, true, false> : __uniq_ptr_impl<_Tp, _Dp>
217 {
218 using __uniq_ptr_impl<_Tp, _Dp>::__uniq_ptr_impl;
219 __uniq_ptr_data(__uniq_ptr_data&&) = default;
220 __uniq_ptr_data& operator=(__uniq_ptr_data&&) = delete;
221 };
222
223 template <typename _Tp, typename _Dp>
224 struct __uniq_ptr_data<_Tp, _Dp, false, true> : __uniq_ptr_impl<_Tp, _Dp>
225 {
226 using __uniq_ptr_impl<_Tp, _Dp>::__uniq_ptr_impl;
227 __uniq_ptr_data(__uniq_ptr_data&&) = delete;
228 __uniq_ptr_data& operator=(__uniq_ptr_data&&) = default;
229 };
230
231 template <typename _Tp, typename _Dp>
232 struct __uniq_ptr_data<_Tp, _Dp, false, false> : __uniq_ptr_impl<_Tp, _Dp>
233 {
234 using __uniq_ptr_impl<_Tp, _Dp>::__uniq_ptr_impl;
235 __uniq_ptr_data(__uniq_ptr_data&&) = delete;
236 __uniq_ptr_data& operator=(__uniq_ptr_data&&) = delete;
237 };
238 /// @endcond
239
240 /// 20.7.1.2 unique_ptr for single objects.
241 template <typename _Tp, typename _Dp = default_delete<_Tp>>
242 class unique_ptr
243 {
244 template <typename _Up>
245 using _DeleterConstraint =
246 typename __uniq_ptr_impl<_Tp, _Up>::_DeleterConstraint::type;
247
248 __uniq_ptr_data<_Tp, _Dp> _M_t;
249
250 public:
251 using pointer = typename __uniq_ptr_impl<_Tp, _Dp>::pointer;
252 using element_type = _Tp;
253 using deleter_type = _Dp;
254
255 private:
256 // helper template for detecting a safe conversion from another
257 // unique_ptr
258 template<typename _Up, typename _Ep>
259 using __safe_conversion_up = __and_<
260 is_convertible<typename unique_ptr<_Up, _Ep>::pointer, pointer>,
261 __not_<is_array<_Up>>
262 >;
263
264 public:
265 // Constructors.
266
267 /// Default constructor, creates a unique_ptr that owns nothing.
268 template<typename _Del = _Dp, typename = _DeleterConstraint<_Del>>
269 constexpr unique_ptr() noexcept
270 : _M_t()
271 { }
272
273 /** Takes ownership of a pointer.
274 *
275 * @param __p A pointer to an object of @c element_type
276 *
277 * The deleter will be value-initialized.
278 */
279 template<typename _Del = _Dp, typename = _DeleterConstraint<_Del>>
280 explicit
281 unique_ptr(pointer __p) noexcept
282 : _M_t(__p)
283 { }
284
285 /** Takes ownership of a pointer.
286 *
287 * @param __p A pointer to an object of @c element_type
288 * @param __d A reference to a deleter.
289 *
290 * The deleter will be initialized with @p __d
291 */
292 template<typename _Del = deleter_type,
293 typename = _Require<is_copy_constructible<_Del>>>
294 unique_ptr(pointer __p, const deleter_type& __d) noexcept
295 : _M_t(__p, __d) { }
296
297 /** Takes ownership of a pointer.
298 *
299 * @param __p A pointer to an object of @c element_type
300 * @param __d An rvalue reference to a (non-reference) deleter.
301 *
302 * The deleter will be initialized with @p std::move(__d)
303 */
304 template<typename _Del = deleter_type,
305 typename = _Require<is_move_constructible<_Del>>>
306 unique_ptr(pointer __p,
307 __enable_if_t<!is_lvalue_reference<_Del>::value,
308 _Del&&> __d) noexcept
309 : _M_t(__p, std::move(__d))
310 { }
311
312 template<typename _Del = deleter_type,
313 typename _DelUnref = typename remove_reference<_Del>::type>
314 unique_ptr(pointer,
315 __enable_if_t<is_lvalue_reference<_Del>::value,
316 _DelUnref&&>) = delete;
317
318 /// Creates a unique_ptr that owns nothing.
319 template<typename _Del = _Dp, typename = _DeleterConstraint<_Del>>
320 constexpr unique_ptr(nullptr_t) noexcept
321 : _M_t()
322 { }
323
324 // Move constructors.
325
326 /// Move constructor.
327 unique_ptr(unique_ptr&&) = default;
328
329 /** @brief Converting constructor from another type
330 *
331 * Requires that the pointer owned by @p __u is convertible to the
332 * type of pointer owned by this object, @p __u does not own an array,
333 * and @p __u has a compatible deleter type.
334 */
335 template<typename _Up, typename _Ep, typename = _Require<
336 __safe_conversion_up<_Up, _Ep>,
337 typename conditional<is_reference<_Dp>::value,
338 is_same<_Ep, _Dp>,
339 is_convertible<_Ep, _Dp>>::type>>
340 unique_ptr(unique_ptr<_Up, _Ep>&& __u) noexcept
341 : _M_t(__u.release(), std::forward<_Ep>(__u.get_deleter()))
342 { }
343
344#if _GLIBCXX_USE_DEPRECATED1
345#pragma GCC diagnostic push
346#pragma GCC diagnostic ignored "-Wdeprecated-declarations"
347 /// Converting constructor from @c auto_ptr
348 template<typename _Up, typename = _Require<
349 is_convertible<_Up*, _Tp*>, is_same<_Dp, default_delete<_Tp>>>>
350 unique_ptr(auto_ptr<_Up>&& __u) noexcept;
351#pragma GCC diagnostic pop
352#endif
353
354 /// Destructor, invokes the deleter if the stored pointer is not null.
355 ~unique_ptr() noexcept
356 {
357 static_assert(__is_invocable<deleter_type&, pointer>::value,
358 "unique_ptr's deleter must be invocable with a pointer");
359 auto& __ptr = _M_t._M_ptr();
360 if (__ptr != nullptr)
361 get_deleter()(std::move(__ptr));
362 __ptr = pointer();
363 }
364
365 // Assignment.
366
367 /** @brief Move assignment operator.
368 *
369 * Invokes the deleter if this object owns a pointer.
370 */
371 unique_ptr& operator=(unique_ptr&&) = default;
372
373 /** @brief Assignment from another type.
374 *
375 * @param __u The object to transfer ownership from, which owns a
376 * convertible pointer to a non-array object.
377 *
378 * Invokes the deleter if this object owns a pointer.
379 */
380 template<typename _Up, typename _Ep>
381 typename enable_if< __and_<
382 __safe_conversion_up<_Up, _Ep>,
383 is_assignable<deleter_type&, _Ep&&>
384 >::value,
385 unique_ptr&>::type
386 operator=(unique_ptr<_Up, _Ep>&& __u) noexcept
387 {
388 reset(__u.release());
389 get_deleter() = std::forward<_Ep>(__u.get_deleter());
390 return *this;
391 }
392
393 /// Reset the %unique_ptr to empty, invoking the deleter if necessary.
394 unique_ptr&
395 operator=(nullptr_t) noexcept
396 {
397 reset();
398 return *this;
399 }
400
401 // Observers.
402
403 /// Dereference the stored pointer.
404 typename add_lvalue_reference<element_type>::type
405 operator*() const
406 {
407 __glibcxx_assert(get() != pointer());
408 return *get();
409 }
410
411 /// Return the stored pointer.
412 pointer
413 operator->() const noexcept
414 {
415 _GLIBCXX_DEBUG_PEDASSERT(get() != pointer());
416 return get();
417 }
418
419 /// Return the stored pointer.
420 pointer
421 get() const noexcept
422 { return _M_t._M_ptr(); }
423
424 /// Return a reference to the stored deleter.
425 deleter_type&
426 get_deleter() noexcept
427 { return _M_t._M_deleter(); }
428
429 /// Return a reference to the stored deleter.
430 const deleter_type&
431 get_deleter() const noexcept
432 { return _M_t._M_deleter(); }
433
434 /// Return @c true if the stored pointer is not null.
435 explicit operator bool() const noexcept
436 { return get() == pointer() ? false : true; }
437
438 // Modifiers.
439
440 /// Release ownership of any stored pointer.
441 pointer
442 release() noexcept
443 { return _M_t.release(); }
444
445 /** @brief Replace the stored pointer.
446 *
447 * @param __p The new pointer to store.
448 *
449 * The deleter will be invoked if a pointer is already owned.
450 */
451 void
452 reset(pointer __p = pointer()) noexcept
453 {
454 static_assert(__is_invocable<deleter_type&, pointer>::value,
455 "unique_ptr's deleter must be invocable with a pointer");
456 _M_t.reset(std::move(__p));
457 }
458
459 /// Exchange the pointer and deleter with another object.
460 void
461 swap(unique_ptr& __u) noexcept
462 {
463 static_assert(__is_swappable<_Dp>::value, "deleter must be swappable");
464 _M_t.swap(__u._M_t);
465 }
466
467 // Disable copy from lvalue.
468 unique_ptr(const unique_ptr&) = delete;
469 unique_ptr& operator=(const unique_ptr&) = delete;
470 };
471
472 /// 20.7.1.3 unique_ptr for array objects with a runtime length
473 // [unique.ptr.runtime]
474 // _GLIBCXX_RESOLVE_LIB_DEFECTS
475 // DR 740 - omit specialization for array objects with a compile time length
476 template<typename _Tp, typename _Dp>
477 class unique_ptr<_Tp[], _Dp>
478 {
479 template <typename _Up>
480 using _DeleterConstraint =
481 typename __uniq_ptr_impl<_Tp, _Up>::_DeleterConstraint::type;
482
483 __uniq_ptr_data<_Tp, _Dp> _M_t;
484
485 template<typename _Up>
486 using __remove_cv = typename remove_cv<_Up>::type;
487
488 // like is_base_of<_Tp, _Up> but false if unqualified types are the same
489 template<typename _Up>
490 using __is_derived_Tp
491 = __and_< is_base_of<_Tp, _Up>,
492 __not_<is_same<__remove_cv<_Tp>, __remove_cv<_Up>>> >;
493
494 public:
495 using pointer = typename __uniq_ptr_impl<_Tp, _Dp>::pointer;
496 using element_type = _Tp;
497 using deleter_type = _Dp;
498
499 // helper template for detecting a safe conversion from another
500 // unique_ptr
501 template<typename _Up, typename _Ep,
502 typename _UPtr = unique_ptr<_Up, _Ep>,
503 typename _UP_pointer = typename _UPtr::pointer,
504 typename _UP_element_type = typename _UPtr::element_type>
505 using __safe_conversion_up = __and_<
506 is_array<_Up>,
507 is_same<pointer, element_type*>,
508 is_same<_UP_pointer, _UP_element_type*>,
509 is_convertible<_UP_element_type(*)[], element_type(*)[]>
510 >;
511
512 // helper template for detecting a safe conversion from a raw pointer
513 template<typename _Up>
514 using __safe_conversion_raw = __and_<
515 __or_<__or_<is_same<_Up, pointer>,
516 is_same<_Up, nullptr_t>>,
517 __and_<is_pointer<_Up>,
518 is_same<pointer, element_type*>,
519 is_convertible<
520 typename remove_pointer<_Up>::type(*)[],
521 element_type(*)[]>
522 >
523 >
524 >;
525
526 // Constructors.
527
528 /// Default constructor, creates a unique_ptr that owns nothing.
529 template<typename _Del = _Dp, typename = _DeleterConstraint<_Del>>
530 constexpr unique_ptr() noexcept
531 : _M_t()
532 { }
533
534 /** Takes ownership of a pointer.
535 *
536 * @param __p A pointer to an array of a type safely convertible
537 * to an array of @c element_type
538 *
539 * The deleter will be value-initialized.
540 */
541 template<typename _Up,
542 typename _Vp = _Dp,
543 typename = _DeleterConstraint<_Vp>,
544 typename = typename enable_if<
545 __safe_conversion_raw<_Up>::value, bool>::type>
546 explicit
547 unique_ptr(_Up __p) noexcept
548 : _M_t(__p)
549 { }
550
551 /** Takes ownership of a pointer.
552 *
553 * @param __p A pointer to an array of a type safely convertible
554 * to an array of @c element_type
555 * @param __d A reference to a deleter.
556 *
557 * The deleter will be initialized with @p __d
558 */
559 template<typename _Up, typename _Del = deleter_type,
560 typename = _Require<__safe_conversion_raw<_Up>,
561 is_copy_constructible<_Del>>>
562 unique_ptr(_Up __p, const deleter_type& __d) noexcept
563 : _M_t(__p, __d) { }
564
565 /** Takes ownership of a pointer.
566 *
567 * @param __p A pointer to an array of a type safely convertible
568 * to an array of @c element_type
569 * @param __d A reference to a deleter.
570 *
571 * The deleter will be initialized with @p std::move(__d)
572 */
573 template<typename _Up, typename _Del = deleter_type,
574 typename = _Require<__safe_conversion_raw<_Up>,
575 is_move_constructible<_Del>>>
576 unique_ptr(_Up __p,
577 __enable_if_t<!is_lvalue_reference<_Del>::value,
578 _Del&&> __d) noexcept
579 : _M_t(std::move(__p), std::move(__d))
580 { }
581
582 template<typename _Up, typename _Del = deleter_type,
583 typename _DelUnref = typename remove_reference<_Del>::type,
584 typename = _Require<__safe_conversion_raw<_Up>>>
585 unique_ptr(_Up,
586 __enable_if_t<is_lvalue_reference<_Del>::value,
587 _DelUnref&&>) = delete;
588
589 /// Move constructor.
590 unique_ptr(unique_ptr&&) = default;
591
592 /// Creates a unique_ptr that owns nothing.
593 template<typename _Del = _Dp, typename = _DeleterConstraint<_Del>>
594 constexpr unique_ptr(nullptr_t) noexcept
595 : _M_t()
596 { }
597
598 template<typename _Up, typename _Ep, typename = _Require<
599 __safe_conversion_up<_Up, _Ep>,
600 typename conditional<is_reference<_Dp>::value,
601 is_same<_Ep, _Dp>,
602 is_convertible<_Ep, _Dp>>::type>>
603 unique_ptr(unique_ptr<_Up, _Ep>&& __u) noexcept
604 : _M_t(__u.release(), std::forward<_Ep>(__u.get_deleter()))
605 { }
606
607 /// Destructor, invokes the deleter if the stored pointer is not null.
608 ~unique_ptr()
609 {
610 auto& __ptr = _M_t._M_ptr();
611 if (__ptr != nullptr)
612 get_deleter()(__ptr);
613 __ptr = pointer();
614 }
615
616 // Assignment.
617
618 /** @brief Move assignment operator.
619 *
620 * Invokes the deleter if this object owns a pointer.
621 */
622 unique_ptr&
623 operator=(unique_ptr&&) = default;
624
625 /** @brief Assignment from another type.
626 *
627 * @param __u The object to transfer ownership from, which owns a
628 * convertible pointer to an array object.
629 *
630 * Invokes the deleter if this object owns a pointer.
631 */
632 template<typename _Up, typename _Ep>
633 typename
634 enable_if<__and_<__safe_conversion_up<_Up, _Ep>,
635 is_assignable<deleter_type&, _Ep&&>
636 >::value,
637 unique_ptr&>::type
638 operator=(unique_ptr<_Up, _Ep>&& __u) noexcept
639 {
640 reset(__u.release());
641 get_deleter() = std::forward<_Ep>(__u.get_deleter());
642 return *this;
643 }
644
645 /// Reset the %unique_ptr to empty, invoking the deleter if necessary.
646 unique_ptr&
647 operator=(nullptr_t) noexcept
648 {
649 reset();
650 return *this;
651 }
652
653 // Observers.
654
655 /// Access an element of owned array.
656 typename std::add_lvalue_reference<element_type>::type
657 operator[](size_t __i) const
658 {
659 __glibcxx_assert(get() != pointer());
660 return get()[__i];
661 }
662
663 /// Return the stored pointer.
664 pointer
665 get() const noexcept
666 { return _M_t._M_ptr(); }
667
668 /// Return a reference to the stored deleter.
669 deleter_type&
670 get_deleter() noexcept
671 { return _M_t._M_deleter(); }
672
673 /// Return a reference to the stored deleter.
674 const deleter_type&
675 get_deleter() const noexcept
676 { return _M_t._M_deleter(); }
677
678 /// Return @c true if the stored pointer is not null.
679 explicit operator bool() const noexcept
680 { return get() == pointer() ? false : true; }
681
682 // Modifiers.
683
684 /// Release ownership of any stored pointer.
685 pointer
686 release() noexcept
687 { return _M_t.release(); }
688
689 /** @brief Replace the stored pointer.
690 *
691 * @param __p The new pointer to store.
692 *
693 * The deleter will be invoked if a pointer is already owned.
694 */
695 template <typename _Up,
696 typename = _Require<
697 __or_<is_same<_Up, pointer>,
698 __and_<is_same<pointer, element_type*>,
699 is_pointer<_Up>,
700 is_convertible<
701 typename remove_pointer<_Up>::type(*)[],
702 element_type(*)[]
703 >
704 >
705 >
706 >>
707 void
708 reset(_Up __p) noexcept
709 { _M_t.reset(std::move(__p)); }
710
711 void reset(nullptr_t = nullptr) noexcept
712 { reset(pointer()); }
713
714 /// Exchange the pointer and deleter with another object.
715 void
716 swap(unique_ptr& __u) noexcept
717 {
718 static_assert(__is_swappable<_Dp>::value, "deleter must be swappable");
719 _M_t.swap(__u._M_t);
720 }
721
722 // Disable copy from lvalue.
723 unique_ptr(const unique_ptr&) = delete;
724 unique_ptr& operator=(const unique_ptr&) = delete;
725 };
726
727 /// @relates unique_ptr @{
728
729 /// Swap overload for unique_ptr
730 template<typename _Tp, typename _Dp>
731 inline
732#if __cplusplus201703L > 201402L || !defined(__STRICT_ANSI__1) // c++1z or gnu++11
733 // Constrained free swap overload, see p0185r1
734 typename enable_if<__is_swappable<_Dp>::value>::type
735#else
736 void
737#endif
738 swap(unique_ptr<_Tp, _Dp>& __x,
739 unique_ptr<_Tp, _Dp>& __y) noexcept
740 { __x.swap(__y); }
741
742#if __cplusplus201703L > 201402L || !defined(__STRICT_ANSI__1) // c++1z or gnu++11
743 template<typename _Tp, typename _Dp>
744 typename enable_if<!__is_swappable<_Dp>::value>::type
745 swap(unique_ptr<_Tp, _Dp>&,
746 unique_ptr<_Tp, _Dp>&) = delete;
747#endif
748
749 /// Equality operator for unique_ptr objects, compares the owned pointers
750 template<typename _Tp, typename _Dp,
751 typename _Up, typename _Ep>
752 _GLIBCXX_NODISCARD[[__nodiscard__]] inline bool
753 operator==(const unique_ptr<_Tp, _Dp>& __x,
754 const unique_ptr<_Up, _Ep>& __y)
755 { return __x.get() == __y.get(); }
756
757 /// unique_ptr comparison with nullptr
758 template<typename _Tp, typename _Dp>
759 _GLIBCXX_NODISCARD[[__nodiscard__]] inline bool
760 operator==(const unique_ptr<_Tp, _Dp>& __x, nullptr_t) noexcept
761 { return !__x; }
762
763#ifndef __cpp_lib_three_way_comparison
764 /// unique_ptr comparison with nullptr
765 template<typename _Tp, typename _Dp>
766 _GLIBCXX_NODISCARD[[__nodiscard__]] inline bool
767 operator==(nullptr_t, const unique_ptr<_Tp, _Dp>& __x) noexcept
768 { return !__x; }
769
770 /// Inequality operator for unique_ptr objects, compares the owned pointers
771 template<typename _Tp, typename _Dp,
772 typename _Up, typename _Ep>
773 _GLIBCXX_NODISCARD[[__nodiscard__]] inline bool
774 operator!=(const unique_ptr<_Tp, _Dp>& __x,
775 const unique_ptr<_Up, _Ep>& __y)
776 { return __x.get() != __y.get(); }
777
778 /// unique_ptr comparison with nullptr
779 template<typename _Tp, typename _Dp>
780 _GLIBCXX_NODISCARD[[__nodiscard__]] inline bool
781 operator!=(const unique_ptr<_Tp, _Dp>& __x, nullptr_t) noexcept
782 { return (bool)__x; }
783
784 /// unique_ptr comparison with nullptr
785 template<typename _Tp, typename _Dp>
786 _GLIBCXX_NODISCARD[[__nodiscard__]] inline bool
787 operator!=(nullptr_t, const unique_ptr<_Tp, _Dp>& __x) noexcept
788 { return (bool)__x; }
789#endif // three way comparison
790
791 /// Relational operator for unique_ptr objects, compares the owned pointers
792 template<typename _Tp, typename _Dp,
793 typename _Up, typename _Ep>
794 _GLIBCXX_NODISCARD[[__nodiscard__]] inline bool
795 operator<(const unique_ptr<_Tp, _Dp>& __x,
796 const unique_ptr<_Up, _Ep>& __y)
797 {
798 typedef typename
799 std::common_type<typename unique_ptr<_Tp, _Dp>::pointer,
800 typename unique_ptr<_Up, _Ep>::pointer>::type _CT;
801 return std::less<_CT>()(__x.get(), __y.get());
802 }
803
804 /// unique_ptr comparison with nullptr
805 template<typename _Tp, typename _Dp>
806 _GLIBCXX_NODISCARD[[__nodiscard__]] inline bool
807 operator<(const unique_ptr<_Tp, _Dp>& __x, nullptr_t)
808 {
809 return std::less<typename unique_ptr<_Tp, _Dp>::pointer>()(__x.get(),
810 nullptr);
811 }
812
813 /// unique_ptr comparison with nullptr
814 template<typename _Tp, typename _Dp>
815 _GLIBCXX_NODISCARD[[__nodiscard__]] inline bool
816 operator<(nullptr_t, const unique_ptr<_Tp, _Dp>& __x)
817 {
818 return std::less<typename unique_ptr<_Tp, _Dp>::pointer>()(nullptr,
819 __x.get());
820 }
821
822 /// Relational operator for unique_ptr objects, compares the owned pointers
823 template<typename _Tp, typename _Dp,
824 typename _Up, typename _Ep>
825 _GLIBCXX_NODISCARD[[__nodiscard__]] inline bool
826 operator<=(const unique_ptr<_Tp, _Dp>& __x,
827 const unique_ptr<_Up, _Ep>& __y)
828 { return !(__y < __x); }
829
830 /// unique_ptr comparison with nullptr
831 template<typename _Tp, typename _Dp>
832 _GLIBCXX_NODISCARD[[__nodiscard__]] inline bool
833 operator<=(const unique_ptr<_Tp, _Dp>& __x, nullptr_t)
834 { return !(nullptr < __x); }
835
836 /// unique_ptr comparison with nullptr
837 template<typename _Tp, typename _Dp>
838 _GLIBCXX_NODISCARD[[__nodiscard__]] inline bool
839 operator<=(nullptr_t, const unique_ptr<_Tp, _Dp>& __x)
840 { return !(__x < nullptr); }
841
842 /// Relational operator for unique_ptr objects, compares the owned pointers
843 template<typename _Tp, typename _Dp,
844 typename _Up, typename _Ep>
845 _GLIBCXX_NODISCARD[[__nodiscard__]] inline bool
846 operator>(const unique_ptr<_Tp, _Dp>& __x,
847 const unique_ptr<_Up, _Ep>& __y)
848 { return (__y < __x); }
849
850 /// unique_ptr comparison with nullptr
851 template<typename _Tp, typename _Dp>
852 _GLIBCXX_NODISCARD[[__nodiscard__]] inline bool
853 operator>(const unique_ptr<_Tp, _Dp>& __x, nullptr_t)
854 {
855 return std::less<typename unique_ptr<_Tp, _Dp>::pointer>()(nullptr,
856 __x.get());
857 }
858
859 /// unique_ptr comparison with nullptr
860 template<typename _Tp, typename _Dp>
861 _GLIBCXX_NODISCARD[[__nodiscard__]] inline bool
862 operator>(nullptr_t, const unique_ptr<_Tp, _Dp>& __x)
863 {
864 return std::less<typename unique_ptr<_Tp, _Dp>::pointer>()(__x.get(),
865 nullptr);
866 }
867
868 /// Relational operator for unique_ptr objects, compares the owned pointers
869 template<typename _Tp, typename _Dp,
870 typename _Up, typename _Ep>
871 _GLIBCXX_NODISCARD[[__nodiscard__]] inline bool
872 operator>=(const unique_ptr<_Tp, _Dp>& __x,
873 const unique_ptr<_Up, _Ep>& __y)
874 { return !(__x < __y); }
875
876 /// unique_ptr comparison with nullptr
877 template<typename _Tp, typename _Dp>
878 _GLIBCXX_NODISCARD[[__nodiscard__]] inline bool
879 operator>=(const unique_ptr<_Tp, _Dp>& __x, nullptr_t)
880 { return !(__x < nullptr); }
881
882 /// unique_ptr comparison with nullptr
883 template<typename _Tp, typename _Dp>
884 _GLIBCXX_NODISCARD[[__nodiscard__]] inline bool
885 operator>=(nullptr_t, const unique_ptr<_Tp, _Dp>& __x)
886 { return !(nullptr < __x); }
887
888#ifdef __cpp_lib_three_way_comparison
889 template<typename _Tp, typename _Dp, typename _Up, typename _Ep>
890 requires three_way_comparable_with<typename unique_ptr<_Tp, _Dp>::pointer,
891 typename unique_ptr<_Up, _Ep>::pointer>
892 inline
893 compare_three_way_result_t<typename unique_ptr<_Tp, _Dp>::pointer,
894 typename unique_ptr<_Up, _Ep>::pointer>
895 operator<=>(const unique_ptr<_Tp, _Dp>& __x,
896 const unique_ptr<_Up, _Ep>& __y)
897 { return compare_three_way()(__x.get(), __y.get()); }
898
899 template<typename _Tp, typename _Dp>
900 requires three_way_comparable<typename unique_ptr<_Tp, _Dp>::pointer>
901 inline
902 compare_three_way_result_t<typename unique_ptr<_Tp, _Dp>::pointer>
903 operator<=>(const unique_ptr<_Tp, _Dp>& __x, nullptr_t)
904 {
905 using pointer = typename unique_ptr<_Tp, _Dp>::pointer;
906 return compare_three_way()(__x.get(), static_cast<pointer>(nullptr));
907 }
908#endif
909 // @} relates unique_ptr
910
911 /// @cond undocumented
912 template<typename _Up, typename _Ptr = typename _Up::pointer,
913 bool = __poison_hash<_Ptr>::__enable_hash_call>
914 struct __uniq_ptr_hash
915#if ! _GLIBCXX_INLINE_VERSION0
916 : private __poison_hash<_Ptr>
917#endif
918 {
919 size_t
920 operator()(const _Up& __u) const
921 noexcept(noexcept(std::declval<hash<_Ptr>>()(std::declval<_Ptr>())))
922 { return hash<_Ptr>()(__u.get()); }
923 };
924
925 template<typename _Up, typename _Ptr>
926 struct __uniq_ptr_hash<_Up, _Ptr, false>
927 : private __poison_hash<_Ptr>
928 { };
929 /// @endcond
930
931 /// std::hash specialization for unique_ptr.
932 template<typename _Tp, typename _Dp>
933 struct hash<unique_ptr<_Tp, _Dp>>
934 : public __hash_base<size_t, unique_ptr<_Tp, _Dp>>,
935 public __uniq_ptr_hash<unique_ptr<_Tp, _Dp>>
936 { };
937
938#if __cplusplus201703L >= 201402L
939 /// @relates unique_ptr @{
940#define __cpp_lib_make_unique201304 201304
941
942 /// @cond undocumented
943
944 template<typename _Tp>
945 struct _MakeUniq
946 { typedef unique_ptr<_Tp> __single_object; };
947
948 template<typename _Tp>
949 struct _MakeUniq<_Tp[]>
950 { typedef unique_ptr<_Tp[]> __array; };
951
952 template<typename _Tp, size_t _Bound>
953 struct _MakeUniq<_Tp[_Bound]>
954 { struct __invalid_type { }; };
955
956 /// @endcond
957
958 /// std::make_unique for single objects
959 template<typename _Tp, typename... _Args>
960 inline typename _MakeUniq<_Tp>::__single_object
961 make_unique(_Args&&... __args)
962 { return unique_ptr<_Tp>(new _Tp(std::forward<_Args>(__args)...)); }
2
←
Calling constructor for 'SvxBmpMaskChildWindow'
→
963
964 /// std::make_unique for arrays of unknown bound
965 template<typename _Tp>
966 inline typename _MakeUniq<_Tp>::__array
967 make_unique(size_t __num)
968 { return unique_ptr<_Tp>(new remove_extent_t<_Tp>[__num]()); }
969
970 /// Disable std::make_unique for arrays of known bound
971 template<typename _Tp, typename... _Args>
972 inline typename _MakeUniq<_Tp>::__invalid_type
973 make_unique(_Args&&...) = delete;
974 // @} relates unique_ptr
975#endif // C++14
976
977#if __cplusplus201703L > 201703L && __cpp_concepts
978 // _GLIBCXX_RESOLVE_LIB_DEFECTS
979 // 2948. unique_ptr does not define operator<< for stream output
980 /// Stream output operator for unique_ptr
981 template<typename _CharT, typename _Traits, typename _Tp, typename _Dp>
982 inline basic_ostream<_CharT, _Traits>&
983 operator<<(basic_ostream<_CharT, _Traits>& __os,
984 const unique_ptr<_Tp, _Dp>& __p)
985 requires requires { __os << __p.get(); }
986 {
987 __os << __p.get();
988 return __os;
989 }
990#endif // C++20
991
992 // @} group pointer_abstractions
993
994#if __cplusplus201703L >= 201703L
995 namespace __detail::__variant
996 {
997 template<typename> struct _Never_valueless_alt; // see <variant>
998
999 // Provide the strong exception-safety guarantee when emplacing a
1000 // unique_ptr into a variant.
1001 template<typename _Tp, typename _Del>
1002 struct _Never_valueless_alt<std::unique_ptr<_Tp, _Del>>
1003 : std::true_type
1004 { };
1005 } // namespace __detail::__variant
1006#endif // C++17
1007
1008_GLIBCXX_END_NAMESPACE_VERSION
1009} // namespace
1010
1011#endif /* _UNIQUE_PTR_H */
←

/home/maarten/src/libreoffice/core/include/vcl/vclptr.hxx

→
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
36class VclReferenceBase;
37
38namespace vcl::detail {
39
40template<typename>
41constexpr bool isIncompleteOrDerivedFromVclReferenceBase(...) { return true; }
42
43template<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 */
56template <class reference_type>
57class 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
66public:
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 );
4
←
Memory is allocated
→
130 }
131
132 /** Probably most common used: handle->someBodyOp().
133 */
134 reference_type * operator->() const
135 {
136 return m_rInnerRef.get();
17
←
Calling 'Reference::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
218template<typename T1, typename T2>
219inline bool operator ==(VclPtr<T1> const & p1, VclPtr<T2> const & p2) {
220 return p1.get() == p2.get();
221}
222
223template<typename T> inline bool operator ==(VclPtr<T> const & p1, T const * p2)
224{
225 return p1.get() == p2;
226}
227
228template<typename T> inline bool operator ==(VclPtr<T> const & p1, T * p2) {
229 return p1.get() == p2;
230}
231
232template<typename T> inline bool operator ==(T const * p1, VclPtr<T> const & p2)
233{
234 return p1 == p2.get();
235}
236
237template<typename T> inline bool operator ==(T * p1, VclPtr<T> const & p2) {
238 return p1 == p2.get();
239}
240
241template<typename T1, typename T2>
242inline bool operator !=(VclPtr<T1> const & p1, VclPtr<T2> const & p2) {
243 return !(p1 == p2);
244}
245
246template<typename T> inline bool operator !=(VclPtr<T> const & p1, T const * p2)
247{
248 return !(p1 == p2);
249}
250
251template<typename T> inline bool operator !=(VclPtr<T> const & p1, T * p2) {
252 return !(p1 == p2);
253}
254
255template<typename T> inline bool operator !=(T const * p1, VclPtr<T> const & p2)
256{
257 return !(p1 == p2);
258}
259
260template<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 */
274template <class reference_type>
275class SAL_WARN_UNUSED__attribute__((warn_unused)) VclPtrInstance final : public VclPtr<reference_type>
276{
277public:
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
290template <class reference_type>
291class ScopedVclPtr : public VclPtr<reference_type>
292{
293public:
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
378private:
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
387protected:
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
406template <class reference_type>
407class SAL_WARN_UNUSED__attribute__((warn_unused)) ScopedVclPtrInstance final : public ScopedVclPtr<reference_type>
408{
409public:
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
421private:
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: */
←

/home/maarten/src/libreoffice/core/include/rtl/ref.hxx

→
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
34namespace rtl
35{
36
37/** Template reference class for reference type.
38*/
39template <class reference_type>
40class Reference
41{
42 /** The <b>reference_type</b> body pointer.
43 */
44 reference_type * m_pBody;
45
46
47public:
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
7.1
Field 'm_pBody' is non-null
7.1
Field 'm_pBody' is non-null
7.1
Field 'm_pBody' is non-null
7.1
Field 'm_pBody' is non-null
7.1
Field 'm_pBody' is non-null
)
8
←
Taking true branch
→
113 m_pBody->release();
9
←
Calling 'VclReferenceBase::release'
→
13
←
Returning; memory was released
→
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;
18
←
Use of memory after it is freed
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
277namespace 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*/
286template<typename T>
287struct 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: */
←

/home/maarten/src/libreoffice/core/include/vcl/vclreferencebase.hxx

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
25class VCL_DLLPUBLIC__attribute__ ((visibility("default"))) VclReferenceBase
26{
27 mutable oslInterlockedCount mnRefCnt;
28
29 template<typename T> friend class VclPtr;
30
31public:
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)
10
←
Assuming the condition is true
→
11
←
Taking true branch
→
40 delete this;
12
←
Memory is released
→
41 }
42#ifdef DBG_UTIL
43#ifndef _WIN32
44 sal_Int32 getRefCount() const { return mnRefCnt; }
45#endif
46#endif
47
48
49private:
50 VclReferenceBase(const VclReferenceBase&) = delete;
51 VclReferenceBase& operator=(const VclReferenceBase&) = delete;
52
53 bool mbDisposed : 1;
54
55protected:
56 VclReferenceBase();
57protected:
58 virtual ~VclReferenceBase();
59
60protected:
61 virtual void dispose();
62
63public:
64 void disposeOnce();
65 bool isDisposed() const { return mbDisposed; }
66
67};
68#endif