Bug Summary

File:home/maarten/src/libreoffice/core/sw/source/uibase/frmdlg/colex.cxx
Warning:line 547, column 76
Division by zero

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 colex.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 -isystem /usr/include/libxml2 -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 SW_DLLIMPLEMENTATION -D SWUI_DLL_NAME="libswuilo.so" -D SYSTEM_LIBXML -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/sw/source/core/inc -I /home/maarten/src/libreoffice/core/sw/source/filter/inc -I /home/maarten/src/libreoffice/core/sw/source/uibase/inc -I /home/maarten/src/libreoffice/core/sw/inc -I /home/maarten/src/libreoffice/core/workdir/SdiTarget/sw/sdi -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/CustomTarget/officecfg/registry -I /home/maarten/src/libreoffice/core/workdir/CustomTarget/sw/generated -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/UnoApiHeadersTarget/oovbaapi/normal -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/sw/source/uibase/frmdlg/colex.cxx

/home/maarten/src/libreoffice/core/sw/source/uibase/frmdlg/colex.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 <cmdid.h>
21#include <hintids.hxx>
22#include <svl/eitem.hxx>
23#include <tools/fract.hxx>
24#include <editeng/lrspitem.hxx>
25#include <editeng/ulspitem.hxx>
26#include <editeng/sizeitem.hxx>
27#include <svx/pageitem.hxx>
28#include <editeng/brushitem.hxx>
29#include <editeng/frmdiritem.hxx>
30#include <vcl/outdev.hxx>
31#include <vcl/settings.hxx>
32#include <tgrditem.hxx>
33#include <viewopt.hxx>
34#include <colex.hxx>
35#include <colmgr.hxx>
36#include <svx/unobrushitemhelper.hxx>
37
38void SwPageExample::UpdateExample( const SfxItemSet& rSet )
39{
40 if (SfxItemState::DEFAULT <= rSet.GetItemState(RES_FRAMEDIR))
41 {
42 const SvxFrameDirectionItem& rDirItem = rSet.Get(RES_FRAMEDIR);
43 m_bVertical = rDirItem.GetValue() == SvxFrameDirection::Vertical_RL_TB||
44 rDirItem.GetValue() == SvxFrameDirection::Vertical_LR_TB;
45 }
46
47 SfxItemPool* pPool = rSet.GetPool();
48 sal_uInt16 nWhich = pPool->GetWhich( SID_ATTR_PAGETypedWhichId<SvxPageItem>( 10000 + 50 ) );
49 if ( rSet.GetItemState( nWhich, false ) == SfxItemState::SET )
50 {
51 // alignment
52 const SvxPageItem& rPage = static_cast<const SvxPageItem&>(rSet.Get(nWhich));
53 SetUsage(rPage.GetPageUsage());
54 }
55
56 nWhich = pPool->GetWhich( SID_ATTR_PAGE_SIZETypedWhichId<SvxSizeItem>( 10000 + 51 ) );
57
58 if ( rSet.GetItemState( nWhich, false ) == SfxItemState::SET )
59 {
60 // orientation and size from PageItem
61 const SvxSizeItem& rSize = static_cast<const SvxSizeItem&>(rSet.Get( nWhich ));
62 SetSize( rSize.GetSize() );
63 }
64 nWhich = RES_LR_SPACE;
65 if ( rSet.GetItemState( nWhich, false ) == SfxItemState::SET )
66 {
67 // set left and right border
68 const SvxLRSpaceItem& rLRSpace = static_cast<const SvxLRSpaceItem&>(rSet.Get( nWhich ));
69
70 SetLeft( rLRSpace.GetLeft() );
71 SetRight( rLRSpace.GetRight() );
72 }
73 else
74 {
75 SetLeft( 0 );
76 SetRight( 0 );
77 }
78
79 nWhich = RES_UL_SPACE;
80
81 if ( rSet.GetItemState( nWhich, false ) == SfxItemState::SET )
82 {
83 // set upper and lower border
84 const SvxULSpaceItem& rULSpace = static_cast<const SvxULSpaceItem&>(rSet.Get( nWhich ));
85
86 SetTop( rULSpace.GetUpper() );
87 SetBottom( rULSpace.GetLower() );
88 }
89 else
90 {
91 SetTop( 0 );
92 SetBottom( 0 );
93 }
94
95 // evaluate header-attributes
96 const SfxPoolItem* pItem;
97 if( SfxItemState::SET == rSet.GetItemState( pPool->GetWhich( SID_ATTR_PAGE_HEADERSETTypedWhichId<SvxSetItem>( 10000 + 57 )),
98 false, &pItem ) )
99 {
100 const SfxItemSet& rHeaderSet = static_cast<const SvxSetItem*>(pItem)->GetItemSet();
101 const SfxBoolItem& rHeaderOn =
102 static_cast<const SfxBoolItem&>(rHeaderSet.Get( pPool->GetWhich( SID_ATTR_PAGE_ONTypedWhichId<SfxBoolItem>( 10000 + 59 ) ) ) );
103
104 if ( rHeaderOn.GetValue() )
105 {
106 const SvxSizeItem& rSize =
107 static_cast<const SvxSizeItem&>(rHeaderSet.Get(pPool->GetWhich(SID_ATTR_PAGE_SIZETypedWhichId<SvxSizeItem>( 10000 + 51 ))));
108
109 const SvxULSpaceItem& rUL = static_cast<const SvxULSpaceItem&>(rHeaderSet.Get(
110 pPool->GetWhich(SID_ATTR_ULSPACE( 10000 + 49 ))));
111 const SvxLRSpaceItem& rLR = static_cast<const SvxLRSpaceItem&>(rHeaderSet.Get(
112 pPool->GetWhich(SID_ATTR_LRSPACE( 10000 + 48 ))));
113
114 SetHdHeight( rSize.GetSize().Height() - rUL.GetLower());
115 SetHdDist( rUL.GetLower() );
116 SetHdLeft( rLR.GetLeft() );
117 SetHdRight( rLR.GetRight() );
118 SetHeader( true );
119
120 if(SfxItemState::SET == rHeaderSet.GetItemState(RES_BACKGROUND))
121 {
122 // create FillAttributes from SvxBrushItem //SetHdColor(rItem.GetColor());
123 const SvxBrushItem& rItem = rHeaderSet.Get(RES_BACKGROUND);
124 SfxItemSet aTempSet(*rHeaderSet.GetPool(), svl::Items<XATTR_FILL_FIRST, XATTR_FILL_LAST>{});
125
126 setSvxBrushItemAsFillAttributesToTargetSet(rItem, aTempSet);
127 setHeaderFillAttributes(
128 std::make_shared<drawinglayer::attribute::SdrAllFillAttributesHelper>(
129 aTempSet));
130 }
131 }
132 else
133 SetHeader( false );
134 }
135
136 if( SfxItemState::SET == rSet.GetItemState( pPool->GetWhich( SID_ATTR_PAGE_FOOTERSETTypedWhichId<SvxSetItem>( 10000 + 58 )),
137 false, &pItem ) )
138 {
139 const SfxItemSet& rFooterSet = static_cast<const SvxSetItem*>(pItem)->GetItemSet();
140 const SfxBoolItem& rFooterOn = rFooterSet.Get( SID_ATTR_PAGE_ONTypedWhichId<SfxBoolItem>( 10000 + 59 ) );
141
142 if ( rFooterOn.GetValue() )
143 {
144 const SvxSizeItem& rSize =
145 static_cast<const SvxSizeItem&>(rFooterSet.Get( pPool->GetWhich( SID_ATTR_PAGE_SIZETypedWhichId<SvxSizeItem>( 10000 + 51 ) ) ));
146
147 const SvxULSpaceItem& rUL = static_cast<const SvxULSpaceItem&>(rFooterSet.Get(
148 pPool->GetWhich( SID_ATTR_ULSPACE( 10000 + 49 ) ) ));
149 const SvxLRSpaceItem& rLR = static_cast<const SvxLRSpaceItem&>(rFooterSet.Get(
150 pPool->GetWhich( SID_ATTR_LRSPACE( 10000 + 48 ) ) ));
151
152 SetFtHeight( rSize.GetSize().Height() - rUL.GetUpper());
153 SetFtDist( rUL.GetUpper() );
154 SetFtLeft( rLR.GetLeft() );
155 SetFtRight( rLR.GetRight() );
156 SetFooter( true );
157
158 if( rFooterSet.GetItemState( RES_BACKGROUND ) == SfxItemState::SET )
159 {
160 // create FillAttributes from SvxBrushItem //SetFtColor(rItem.GetColor());
161 const SvxBrushItem& rItem = rFooterSet.Get(RES_BACKGROUND);
162 SfxItemSet aTempSet(*rFooterSet.GetPool(), svl::Items<XATTR_FILL_FIRST, XATTR_FILL_LAST>{});
163
164 setSvxBrushItemAsFillAttributesToTargetSet(rItem, aTempSet);
165 setFooterFillAttributes(
166 std::make_shared<drawinglayer::attribute::SdrAllFillAttributesHelper>(
167 aTempSet));
168 }
169 }
170 else
171 SetFooter( false );
172 }
173
174 if(SfxItemState::SET == rSet.GetItemState(RES_BACKGROUND, false, &pItem))
175 {
176 // create FillAttributes from SvxBrushItem
177 const SvxBrushItem& rItem = static_cast< const SvxBrushItem& >(*pItem);
178 SfxItemSet aTempSet(*rSet.GetPool(), svl::Items<XATTR_FILL_FIRST, XATTR_FILL_LAST>{});
179
180 setSvxBrushItemAsFillAttributesToTargetSet(rItem, aTempSet);
181 setPageFillAttributes(
182 std::make_shared<drawinglayer::attribute::SdrAllFillAttributesHelper>(
183 aTempSet));
184 }
185
186 Invalidate();
187}
188
189void SwColExample::DrawPage(vcl::RenderContext& rRenderContext, const Point& rOrg,
190 const bool bSecond, const bool bEnabled)
191{
192 SwPageExample::DrawPage(rRenderContext, rOrg, bSecond, bEnabled);
193 if (!pColMgr)
194 return;
195 sal_uInt16 nColumnCount = pColMgr->GetCount();
196 if (!nColumnCount)
197 return;
198
199 long nL = GetLeft();
200 long nR = GetRight();
201
202 if (GetUsage() == SvxPageUsage::Mirror && !bSecond)
203 {
204 // swap for mirrored
205 nL = GetRight();
206 nR = GetLeft();
207 }
208
209 rRenderContext.SetFillColor(COL_LIGHTGRAY);
210 tools::Rectangle aRect;
211 aRect.SetRight( rOrg.X() + GetSize().Width() - nR );
212 aRect.SetLeft( rOrg.X() + nL );
213 aRect.SetTop( rOrg.Y() + GetTop() + GetHdHeight() + GetHdDist() );
214 aRect.SetBottom( rOrg.Y() + GetSize().Height() - GetBottom() - GetFtHeight() - GetFtDist() );
215 rRenderContext.DrawRect(aRect);
216
217 const tools::Rectangle aDefineRect(aRect);
218 const drawinglayer::attribute::SdrAllFillAttributesHelperPtr& rFillAttributes = getPageFillAttributes();
219
220 if (!rFillAttributes || !rFillAttributes->isUsed())
221 {
222 // If there is no fill, use fallback color
223 const StyleSettings& rStyleSettings = rRenderContext.GetSettings().GetStyleSettings();
224 const Color& rFieldColor = rStyleSettings.GetFieldColor();
225
226 setPageFillAttributes(
227 std::make_shared<drawinglayer::attribute::SdrAllFillAttributesHelper>(
228 rFieldColor));
229 }
230
231 // #97495# make sure that the automatic column width's are always equal
232 bool bAutoWidth = pColMgr->IsAutoWidth();
233 sal_Int32 nAutoColWidth = 0;
234 if (bAutoWidth)
235 {
236 sal_Int32 nColumnWidthSum = 0;
237 for (sal_uInt16 i = 0; i < nColumnCount; ++i)
238 nColumnWidthSum += pColMgr->GetColWidth( i );
239 nAutoColWidth = nColumnWidthSum / nColumnCount;
240 }
241
242 for (sal_uInt16 i = 0; i < nColumnCount; ++i)
243 {
244 if (!bAutoWidth)
245 nAutoColWidth = pColMgr->GetColWidth(i);
246
247 if (!m_bVertical)
248 aRect.SetRight( aRect.Left() + nAutoColWidth );
249 else
250 aRect.SetBottom( aRect.Top() + nAutoColWidth );
251
252 // use primitive draw command
253 drawFillAttributes(rRenderContext, getPageFillAttributes(), aRect, aDefineRect);
254
255 if (i < nColumnCount - 1)
256 {
257 if (!m_bVertical)
258 aRect.SetLeft( aRect.Right() + pColMgr->GetGutterWidth(i) );
259 else
260 aRect.SetTop( aRect.Bottom() + pColMgr->GetGutterWidth(i) );
261 }
262 }
263 if (!pColMgr->HasLine())
264 return;
265
266 Point aUp(rOrg.X() + nL, rOrg.Y() + GetTop());
267 Point aDown(rOrg.X() + nL,
268 rOrg.Y() + GetSize().Height() - GetBottom() - GetFtHeight() - GetFtDist());
269
270 if (pColMgr->GetLineHeightPercent() != 100)
271 {
272 long nLength = !m_bVertical ? aDown.Y() - aUp.Y() : aDown.X() - aUp.X();
273 nLength -= nLength * pColMgr->GetLineHeightPercent() / 100;
274 switch (pColMgr->GetAdjust())
275 {
276 case COLADJ_BOTTOM:
277 if (!m_bVertical)
278 aUp.AdjustY(nLength );
279 else
280 aUp.AdjustX(nLength );
281 break;
282 case COLADJ_TOP:
283 if (!m_bVertical)
284 aDown.AdjustY( -nLength );
285 else
286 aDown.AdjustX( -nLength );
287 break;
288 case COLADJ_CENTER:
289 if (!m_bVertical)
290 {
291 aUp.AdjustY(nLength / 2 );
292 aDown.AdjustY( -(nLength / 2) );
293 }
294 else
295 {
296 aUp.AdjustX(nLength / 2 );
297 aDown.AdjustX( -(nLength / 2) );
298 }
299 break;
300 default:
301 break; // prevent warning
302 }
303 }
304
305 for (sal_uInt16 i = 0; i < nColumnCount - 1; ++i)
306 {
307 int nGutter = pColMgr->GetGutterWidth(i);
308 int nDist = pColMgr->GetColWidth( i ) + nGutter;
309 nDist -= (i == 0) ? nGutter / 2 : 0;
310 if (!m_bVertical)
311 {
312 aUp.AdjustX(nDist );
313 aDown.AdjustX(nDist );
314 }
315 else
316 {
317 aUp.AdjustY(nDist );
318 aDown.AdjustY(nDist );
319 }
320
321 rRenderContext.DrawLine(aUp, aDown);
322 }
323}
324
325SwColumnOnlyExample::SwColumnOnlyExample()
326 : m_aFrameSize(SvxPaperInfo::GetPaperSize(PAPER_A4)) // DIN A4
327{
328 ::FitToActualSize(m_aCols, static_cast<sal_uInt16>(m_aFrameSize.Width()));
329}
330
331void SwColumnOnlyExample::Paint(vcl::RenderContext& rRenderContext, const tools::Rectangle& /*rRect*/)
332{
333 rRenderContext.Push(PushFlags::MAPMODE);
334
335 Fraction aScale(m_aWinSize.Height(), m_aFrameSize.Height());
336 MapMode aMapMode(MapUnit::MapTwip);
337 aMapMode.SetScaleX(aScale);
338 aMapMode.SetScaleY(aScale);
339 rRenderContext.SetMapMode(aMapMode);
340
341 const StyleSettings& rStyleSettings = rRenderContext.GetSettings().GetStyleSettings();
342 const Color& rFieldColor = rStyleSettings.GetFieldColor();
343 const Color& rDlgColor = rStyleSettings.GetDialogColor();
344 const Color& rFieldTextColor = SwViewOption::GetFontColor();
345 Color aGrayColor(COL_LIGHTGRAY);
346 if (rFieldColor == aGrayColor)
347 aGrayColor.Invert();
348
349 Size aLogSize(rRenderContext.PixelToLogic(GetOutputSizePixel()));
350 tools::Rectangle aCompleteRect(Point(0,0), aLogSize);
351 rRenderContext.SetLineColor(rDlgColor);
352 rRenderContext.SetFillColor(rDlgColor);
353 rRenderContext.DrawRect(aCompleteRect);
354
355 rRenderContext.SetLineColor(rFieldTextColor);
356 Point aTL((aLogSize.Width() - m_aFrameSize.Width()) / 2,
357 (aLogSize.Height() - m_aFrameSize.Height()) / 2);
358 tools::Rectangle aRect(aTL, m_aFrameSize);
359
360 //draw a shadow rectangle
361 rRenderContext.SetFillColor(COL_GRAY);
362 tools::Rectangle aShadowRect(aRect);
363 aShadowRect.Move(aTL.Y(), aTL.Y());
364 rRenderContext.DrawRect(aShadowRect);
365
366 rRenderContext.SetFillColor(rFieldColor);
367 rRenderContext.DrawRect(aRect);
368
369 rRenderContext.SetFillColor(aGrayColor);
370
371 //column separator?
372 long nLength = aLogSize.Height() - 2 * aTL.Y();
373 Point aUp(aTL);
374 Point aDown(aTL.X(), nLength);
375 bool bLines = false;
376 if (m_aCols.GetLineAdj() != COLADJ_NONE)
377 {
378 bLines = true;
379
380 sal_uInt16 nPercent = m_aCols.GetLineHeight();
381 if (nPercent != 100)
382 {
383 nLength -= nLength * nPercent / 100;
384 switch(m_aCols.GetLineAdj())
385 {
386 case COLADJ_BOTTOM: aUp.AdjustY(nLength ); break;
387 case COLADJ_TOP: aDown.AdjustY( -nLength ); break;
388 case COLADJ_CENTER:
389 aUp.AdjustY(nLength / 2 );
390 aDown.AdjustY( -(nLength / 2) );
391 break;
392 default:
393 break; //prevent warning
394 }
395 }
396
397 }
398 const SwColumns& rCols = m_aCols.GetColumns();
399 sal_uInt16 nColCount = rCols.size();
400 if (nColCount)
401 {
402 rRenderContext.DrawRect(aRect);
403 rRenderContext.SetFillColor(rFieldColor);
404 tools::Rectangle aFrameRect(aTL, m_aFrameSize);
405 long nSum = aTL.X();
406 for (sal_uInt16 i = 0; i < nColCount; i++)
407 {
408 const SwColumn* pCol = &rCols[i];
409 aFrameRect.SetLeft( nSum + pCol->GetLeft() ); //nSum + pCol->GetLeft() + aTL.X();
410 nSum += pCol->GetWishWidth();
411 aFrameRect.SetRight( nSum - pCol->GetRight() );
412 rRenderContext.DrawRect(aFrameRect);
413 }
414 if (bLines)
415 {
416 nSum = aTL.X();
417 for (sal_uInt16 i = 0; i < nColCount - 1; i++)
418 {
419 nSum += rCols[i].GetWishWidth();
420 aUp.setX( nSum );
421 aDown.setX( nSum );
422 rRenderContext.DrawLine(aUp, aDown);
423 }
424 }
425 }
426 rRenderContext.Pop();
427}
428
429void SwColumnOnlyExample::SetColumns(const SwFormatCol& rCol)
430{
431 m_aCols = rCol;
432 sal_uInt16 nWishSum = m_aCols.GetWishWidth();
433 long nFrameWidth = m_aFrameSize.Width();
434 SwColumns& rCols = m_aCols.GetColumns();
435 sal_uInt16 nColCount = rCols.size();
436
437 for(sal_uInt16 i = 0; i < nColCount; i++)
438 {
439 SwColumn* pCol = &rCols[i];
440 long nWish = pCol->GetWishWidth();
441 nWish *= nFrameWidth;
442 nWish /= nWishSum;
443 pCol->SetWishWidth(static_cast<sal_uInt16>(nWish));
444 long nLeft = pCol->GetLeft();
445 nLeft *= nFrameWidth;
446 nLeft /= nWishSum;
447 pCol->SetLeft(static_cast<sal_uInt16>(nLeft));
448 long nRight = pCol->GetRight();
449 nRight *= nFrameWidth;
450 nRight /= nWishSum;
451 pCol->SetRight(static_cast<sal_uInt16>(nRight));
452 }
453 // #97495# make sure that the automatic column width's are always equal
454 if(!(nColCount && m_aCols.IsOrtho()))
455 return;
456
457 sal_Int32 nColumnWidthSum = 0;
458 sal_uInt16 i;
459 for(i = 0; i < nColCount; ++i)
460 {
461 SwColumn* pCol = &rCols[i];
462 nColumnWidthSum += pCol->GetWishWidth();
463 nColumnWidthSum -= (pCol->GetRight() + pCol->GetLeft());
464 }
465 nColumnWidthSum /= nColCount;
466 for(i = 0; i < nColCount; ++i)
467 {
468 SwColumn* pCol = &rCols[i];
469 pCol->SetWishWidth( static_cast< sal_uInt16 >(nColumnWidthSum + pCol->GetRight() + pCol->GetLeft()));
470 }
471}
472
473void SwColumnOnlyExample::SetDrawingArea(weld::DrawingArea* pDrawingArea)
474{
475 weld::CustomWidgetController::SetDrawingArea(pDrawingArea);
476 OutputDevice& rRefDevice = pDrawingArea->get_ref_device();
477 Size aPrefSize(rRefDevice.LogicToPixel(Size(75, 46), MapMode(MapUnit::MapAppFont)));
478 pDrawingArea->set_size_request(aPrefSize.Width(), aPrefSize.Height());
479}
480
481void SwColumnOnlyExample::Resize()
482{
483 OutputDevice& rRefDevice = GetDrawingArea()->get_ref_device();
484 rRefDevice.Push(PushFlags::MAPMODE);
485 rRefDevice.SetMapMode(MapMode(MapUnit::MapTwip));
486 m_aWinSize = GetOutputSizePixel();
487 m_aWinSize.AdjustHeight( -4 );
488 m_aWinSize.AdjustWidth( -4 );
489 m_aWinSize = rRefDevice.PixelToLogic(m_aWinSize);
490 rRefDevice.Pop();
491 Invalidate();
492}
493
494SwPageGridExample::SwPageGridExample()
495{
496}
497
498void SwPageGridExample::DrawPage(vcl::RenderContext& rRenderContext, const Point& rOrg,
499 const bool bSecond, const bool bEnabled)
500{
501 SwPageExample::DrawPage(rRenderContext, rOrg, bSecond, bEnabled);
502
503 if (!pGridItem || !pGridItem->GetGridType())
1
Calling 'unique_ptr::operator bool'
→
5
←
Returning from 'unique_ptr::operator bool'
→
6
←
Assuming the condition is false
→
7
←
Taking false branch
→
504 return;
505
506 //paint the grid now
507 Color aLineColor = pGridItem->GetColor();
508 if (aLineColor == COL_AUTO)
8
←
Taking false branch
→
509 {
510 aLineColor = rRenderContext.GetFillColor();
511 aLineColor.Invert();
512 }
513 rRenderContext.SetLineColor(aLineColor);
514 long nL = GetLeft();
515 long nR = GetRight();
516
517 if (GetUsage() == SvxPageUsage::Mirror && !bSecond)
9
←
Assuming the condition is false
→
518 {
519 // rotate for mirrored
520 nL = GetRight();
521 nR = GetLeft();
522 }
523
524 tools::Rectangle aRect;
525 aRect.SetRight( rOrg.X() + GetSize().Width() - nR );
526 aRect.SetLeft( rOrg.X() + nL );
527 aRect.SetTop( rOrg.Y() + GetTop() + GetHdHeight() + GetHdDist() );
528 aRect.SetBottom( rOrg.Y() + GetSize().Height() - GetBottom() - GetFtHeight() - GetFtDist() );
529
530 //increase the values to get a 'viewable' preview
531 sal_Int32 nBaseHeight = pGridItem->GetBaseHeight() * 3;
532 sal_Int32 nRubyHeight = pGridItem->GetRubyHeight() * 3;
533
534 //detect height of rectangles
535 tools::Rectangle aRubyRect(aRect.TopLeft(),
536 m_bVertical ?
10
←
Assuming field 'm_bVertical' is true
→
11
←
'?' condition is true
→
537 Size(nRubyHeight, aRect.GetHeight()) :
538 Size(aRect.GetWidth(), nRubyHeight));
539 tools::Rectangle aCharRect(aRect.TopLeft(),
540 m_bVertical
11.1
Field 'm_bVertical' is true
11.1
Field 'm_bVertical' is true
 ?
12
←
'?' condition is true
→
541 Size(nBaseHeight, aRect.GetHeight()) :
542 Size(aRect.GetWidth(), nBaseHeight));
543
544 sal_Int32 nLineHeight = nBaseHeight + nRubyHeight;
13
←
'nLineHeight' initialized to 0
→
545
546 //detect count of rectangles
547 sal_Int32 nLines = (m_bVertical
13.1
Field 'm_bVertical' is true
13.1
Field 'm_bVertical' is true
 ? aRect.GetWidth(): aRect.GetHeight()) / nLineHeight;
14
←
'?' condition is true
→
15
←
Division by zero
548 if (nLines > pGridItem->GetLines())
549 nLines = pGridItem->GetLines();
550
551 // determine start position
552 if (m_bVertical)
553 {
554 sal_Int16 nXStart = static_cast<sal_Int16>(aRect.GetWidth() / 2 - nLineHeight * nLines /2);
555 aRubyRect.Move(nXStart, 0);
556 aCharRect.Move(nXStart, 0);
557 }
558 else
559 {
560 sal_Int16 nYStart = static_cast<sal_Int16>(aRect.GetHeight() / 2 - nLineHeight * nLines /2);
561 aRubyRect.Move(0, nYStart);
562 aCharRect.Move(0, nYStart);
563 }
564
565 if (pGridItem->IsRubyTextBelow())
566 m_bVertical ? aRubyRect.Move(nBaseHeight, 0) : aRubyRect.Move(0, nBaseHeight);
567 else
568 m_bVertical ? aCharRect.Move(nRubyHeight, 0) : aCharRect.Move(0, nRubyHeight);
569
570 //vertical lines
571 bool bBothLines = pGridItem->GetGridType() == GRID_LINES_CHARS;
572 rRenderContext.SetFillColor(COL_TRANSPARENT);
573 sal_Int32 nXMove = m_bVertical ? nLineHeight : 0;
574 sal_Int32 nYMove = m_bVertical ? 0 : nLineHeight;
575 for (sal_Int32 nLine = 0; nLine < nLines; nLine++)
576 {
577 rRenderContext.DrawRect(aRubyRect);
578 rRenderContext.DrawRect(aCharRect);
579 if (bBothLines)
580 {
581 Point aStart = aCharRect.TopLeft();
582 Point aEnd = m_bVertical ? aCharRect.TopRight() : aCharRect.BottomLeft();
583 while (m_bVertical ? aStart.Y() < aRect.Bottom(): aStart.X() < aRect.Right())
584 {
585 rRenderContext.DrawLine(aStart, aEnd);
586 if (m_bVertical)
587 aStart.setY( aEnd.AdjustY(nBaseHeight ) );
588 else
589 aStart.setX( aEnd.AdjustX(nBaseHeight ) );
590 }
591 }
592 aRubyRect.Move(nXMove, nYMove);
593 aCharRect.Move(nXMove, nYMove);
594 }
595
596}
597
598void SwPageGridExample::UpdateExample( const SfxItemSet& rSet )
599{
600 pGridItem.reset();
601 //get the grid information
602 if (SfxItemState::DEFAULT <= rSet.GetItemState(RES_TEXTGRID))
603 pGridItem.reset(rSet.Get(RES_TEXTGRID).Clone());
604 SwPageExample::UpdateExample(rSet);
605}
606
607/* 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; }
2
←
Assuming the condition is false
→
3
←
'?' condition is false
→
4
←
Returning the value 1, which participates in a condition later
→
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)...)); }
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 */