File: | home/maarten/src/libreoffice/core/include/rtl/ref.hxx |
Warning: | line 192, column 9 Use of memory after it is freed |
Press '?' to see keyboard shortcuts
Keyboard shortcuts:
1 | /* -*- Mode: C++; tab-width: 4; indent-tabs-mode: nil; c-basic-offset: 4 -*- */ | |||
2 | /* | |||
3 | * This file is part of the LibreOffice project. | |||
4 | * | |||
5 | * This Source Code Form is subject to the terms of the Mozilla Public | |||
6 | * License, v. 2.0. If a copy of the MPL was not distributed with this | |||
7 | * file, You can obtain one at http://mozilla.org/MPL/2.0/. | |||
8 | * | |||
9 | * 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 <sfx2/dialoghelper.hxx> | |||
21 | #include <sfx2/viewsh.hxx> | |||
22 | #include <sfx2/printer.hxx> | |||
23 | #include <vcl/metric.hxx> | |||
24 | #include <vcl/svapp.hxx> | |||
25 | #include <vcl/settings.hxx> | |||
26 | #include <unicode/uchar.h> | |||
27 | #include <com/sun/star/uno/Reference.h> | |||
28 | #include <com/sun/star/i18n/BreakIterator.hpp> | |||
29 | #include <comphelper/processfactory.hxx> | |||
30 | ||||
31 | #include <com/sun/star/i18n/ScriptType.hpp> | |||
32 | ||||
33 | #include <vector> | |||
34 | #include <deque> | |||
35 | #include <svtools/colorcfg.hxx> | |||
36 | #include <svtools/sampletext.hxx> | |||
37 | ||||
38 | #include <svx/fntctrl.hxx> | |||
39 | #include <svx/svxids.hrc> | |||
40 | ||||
41 | // Item set includes | |||
42 | #include <svl/itemset.hxx> | |||
43 | #include <svl/itempool.hxx> | |||
44 | #include <svl/stritem.hxx> | |||
45 | #include <svl/languageoptions.hxx> | |||
46 | ||||
47 | #include <editeng/colritem.hxx> | |||
48 | #include <editeng/fontitem.hxx> | |||
49 | #include <editeng/editids.hrc> | |||
50 | #include <editeng/postitem.hxx> | |||
51 | #include <editeng/udlnitem.hxx> | |||
52 | #include <editeng/crossedoutitem.hxx> | |||
53 | #include <editeng/contouritem.hxx> | |||
54 | #include <editeng/wghtitem.hxx> | |||
55 | #include <editeng/fhgtitem.hxx> | |||
56 | #include <editeng/shdditem.hxx> | |||
57 | #include <editeng/escapementitem.hxx> | |||
58 | #include <editeng/wrlmitem.hxx> | |||
59 | #include <editeng/cmapitem.hxx> | |||
60 | #include <editeng/kernitem.hxx> | |||
61 | #include <editeng/brushitem.hxx> | |||
62 | #include <editeng/emphasismarkitem.hxx> | |||
63 | #include <editeng/charreliefitem.hxx> | |||
64 | #include <editeng/charscaleitem.hxx> | |||
65 | #include <editeng/langitem.hxx> | |||
66 | ||||
67 | //TODO: remove this and calculate off the actual size of text, not | |||
68 | //an arbitrary number of characters | |||
69 | #define TEXT_WIDTH80 80 | |||
70 | ||||
71 | using namespace ::com::sun::star::uno; | |||
72 | using namespace ::com::sun::star::lang; | |||
73 | using ::com::sun::star::i18n::XBreakIterator; | |||
74 | using ::com::sun::star::i18n::BreakIterator; | |||
75 | ||||
76 | ||||
77 | // small helper functions to set fonts | |||
78 | ||||
79 | namespace | |||
80 | { | |||
81 | void scaleFontWidth(vcl::Font& rFont, vcl::RenderContext const & rRenderContext,long& n100PercentFont) | |||
82 | { | |||
83 | rFont.SetAverageFontWidth(0); | |||
84 | n100PercentFont = rRenderContext.GetFontMetric(rFont).GetAverageFontWidth(); | |||
85 | } | |||
86 | ||||
87 | void initFont(vcl::Font& rFont) | |||
88 | { | |||
89 | rFont.SetTransparent(true); | |||
90 | rFont.SetAlignment(ALIGN_BASELINE); | |||
91 | } | |||
92 | ||||
93 | void setFontSize(vcl::Font& rFont) | |||
94 | { | |||
95 | Size aSize(rFont.GetFontSize()); | |||
96 | aSize.setHeight( (aSize.Height() * 3) / 5 ); | |||
97 | aSize.setWidth( (aSize.Width() * 3) / 5 ); | |||
98 | rFont.SetFontSize(aSize); | |||
99 | } | |||
100 | ||||
101 | void calcFontHeightAnyAscent(vcl::RenderContext& rRenderContext, const vcl::Font& rFont, long& nHeight, long& nAscent) | |||
102 | { | |||
103 | if (!nHeight) | |||
104 | { | |||
105 | rRenderContext.SetFont(rFont); | |||
106 | FontMetric aMetric(rRenderContext.GetFontMetric()); | |||
107 | nHeight = aMetric.GetLineHeight(); | |||
108 | nAscent = aMetric.GetAscent(); | |||
109 | } | |||
110 | } | |||
111 | ||||
112 | void setFont(const SvxFont& rNewFont, SvxFont& rImplFont) | |||
113 | { | |||
114 | rImplFont = rNewFont; | |||
115 | rImplFont.SetTransparent(true); | |||
116 | rImplFont.SetAlignment(ALIGN_BASELINE); | |||
117 | } | |||
118 | ||||
119 | /* | |||
120 | * removes line feeds and carriage returns from string | |||
121 | * returns if param is empty | |||
122 | */ | |||
123 | bool CleanAndCheckEmpty(OUString& rText) | |||
124 | { | |||
125 | bool bEmpty = true; | |||
126 | for (sal_Int32 i = 0; i < rText.getLength(); ++i) | |||
127 | { | |||
128 | if (0xa == rText[i] || 0xd == rText[i]) | |||
129 | rText = rText.replaceAt(i, 1, " "); | |||
130 | else | |||
131 | bEmpty = false; | |||
132 | } | |||
133 | return bEmpty; | |||
134 | } | |||
135 | } // end anonymous namespace | |||
136 | ||||
137 | class FontPrevWin_Impl | |||
138 | { | |||
139 | friend class SvxFontPrevWindow; | |||
140 | ||||
141 | SvxFont maFont; | |||
142 | VclPtr<Printer> mpPrinter; | |||
143 | bool mbDelPrinter; | |||
144 | ||||
145 | Reference <XBreakIterator> mxBreak; | |||
146 | std::vector<long> maTextWidth; | |||
147 | std::deque<sal_Int32> maScriptChg; | |||
148 | std::vector<sal_uInt16> maScriptType; | |||
149 | SvxFont maCJKFont; | |||
150 | SvxFont maCTLFont; | |||
151 | OUString maText; | |||
152 | OUString maScriptText; | |||
153 | std::unique_ptr<Color> mpColor; | |||
154 | std::unique_ptr<Color> mpBackColor; | |||
155 | std::unique_ptr<Color> mpTextLineColor; | |||
156 | std::unique_ptr<Color> mpOverlineColor; | |||
157 | long mnAscent; | |||
158 | sal_Unicode mcStartBracket; | |||
159 | sal_Unicode mcEndBracket; | |||
160 | ||||
161 | long mn100PercentFontWidth; // initial -1 -> not set yet | |||
162 | long mn100PercentFontWidthCJK; | |||
163 | long mn100PercentFontWidthCTL; | |||
164 | sal_uInt16 mnFontWidthScale; | |||
165 | ||||
166 | bool mbSelection : 1; | |||
167 | bool mbGetSelection : 1; | |||
168 | bool mbTwoLines : 1; | |||
169 | bool mbUseFontNameAsText : 1; | |||
170 | bool mbTextInited : 1; | |||
171 | ||||
172 | bool m_bCJKEnabled; | |||
173 | bool m_bCTLEnabled; | |||
174 | ||||
175 | ||||
176 | public: | |||
177 | FontPrevWin_Impl() : | |||
178 | mpPrinter(nullptr), | |||
179 | mbDelPrinter(false), | |||
180 | mnAscent(0), | |||
181 | mcStartBracket(0), | |||
182 | mcEndBracket(0), | |||
183 | mnFontWidthScale(100), | |||
184 | mbSelection(false), | |||
185 | mbGetSelection(false), | |||
186 | mbTwoLines(false), | |||
187 | mbUseFontNameAsText(false), | |||
188 | mbTextInited(false) | |||
189 | { | |||
190 | SvtLanguageOptions aLanguageOptions; | |||
191 | m_bCJKEnabled = aLanguageOptions.IsAnyEnabled(); | |||
192 | m_bCTLEnabled = aLanguageOptions.IsCTLFontEnabled(); | |||
193 | ||||
194 | Invalidate100PercentFontWidth(); | |||
195 | } | |||
196 | ||||
197 | ~FontPrevWin_Impl() | |||
198 | { | |||
199 | if (mbDelPrinter) | |||
200 | mpPrinter.disposeAndClear(); | |||
201 | } | |||
202 | ||||
203 | void CheckScript(); | |||
204 | Size CalcTextSize(vcl::RenderContext& rRenderContext, OutputDevice const * pPrinter, const SvxFont& rFont); | |||
205 | void DrawPrev(vcl::RenderContext& rRenderContext, Printer* pPrinter, Point& rPt, const SvxFont& rFont); | |||
206 | ||||
207 | bool SetFontWidthScale(sal_uInt16 nScaleInPercent); | |||
208 | inline void Invalidate100PercentFontWidth(); | |||
209 | inline bool Is100PercentFontWidthValid() const; | |||
210 | void ScaleFontWidth(vcl::RenderContext const & rRenderContext); | |||
211 | // scales rNonCJKFont and aCJKFont depending on nFontWidthScale and | |||
212 | // sets the 100%-Font-Widths | |||
213 | }; | |||
214 | ||||
215 | inline void FontPrevWin_Impl::Invalidate100PercentFontWidth() | |||
216 | { | |||
217 | mn100PercentFontWidth = mn100PercentFontWidthCJK = mn100PercentFontWidthCTL = -1; | |||
218 | } | |||
219 | ||||
220 | inline bool FontPrevWin_Impl::Is100PercentFontWidthValid() const | |||
221 | { | |||
222 | DBG_ASSERT( ( mn100PercentFontWidth == -1 && mn100PercentFontWidthCJK == -1 ) ||do { if (true && (!(( mn100PercentFontWidth == -1 && mn100PercentFontWidthCJK == -1 ) || ( mn100PercentFontWidth != -1 && mn100PercentFontWidthCJK != -1 ) || ( mn100PercentFontWidth == -1 && mn100PercentFontWidthCTL == -1 ) || ( mn100PercentFontWidth != -1 && mn100PercentFontWidthCTL != -1 )))) { sal_detail_logFormat ((SAL_DETAIL_LOG_LEVEL_WARN), ("legacy.tools"), ("/home/maarten/src/libreoffice/core/svx/source/dialog/fntctrl.cxx" ":" "226" ": "), "%s", "*FontPrevWin_Impl::Is100PercentFontWidthValid(): 100PercentFontWidth's not synchronous" ); } } while (false) | |||
223 | ( mn100PercentFontWidth != -1 && mn100PercentFontWidthCJK != -1 ) ||do { if (true && (!(( mn100PercentFontWidth == -1 && mn100PercentFontWidthCJK == -1 ) || ( mn100PercentFontWidth != -1 && mn100PercentFontWidthCJK != -1 ) || ( mn100PercentFontWidth == -1 && mn100PercentFontWidthCTL == -1 ) || ( mn100PercentFontWidth != -1 && mn100PercentFontWidthCTL != -1 )))) { sal_detail_logFormat ((SAL_DETAIL_LOG_LEVEL_WARN), ("legacy.tools"), ("/home/maarten/src/libreoffice/core/svx/source/dialog/fntctrl.cxx" ":" "226" ": "), "%s", "*FontPrevWin_Impl::Is100PercentFontWidthValid(): 100PercentFontWidth's not synchronous" ); } } while (false) | |||
224 | ( mn100PercentFontWidth == -1 && mn100PercentFontWidthCTL == -1 ) ||do { if (true && (!(( mn100PercentFontWidth == -1 && mn100PercentFontWidthCJK == -1 ) || ( mn100PercentFontWidth != -1 && mn100PercentFontWidthCJK != -1 ) || ( mn100PercentFontWidth == -1 && mn100PercentFontWidthCTL == -1 ) || ( mn100PercentFontWidth != -1 && mn100PercentFontWidthCTL != -1 )))) { sal_detail_logFormat ((SAL_DETAIL_LOG_LEVEL_WARN), ("legacy.tools"), ("/home/maarten/src/libreoffice/core/svx/source/dialog/fntctrl.cxx" ":" "226" ": "), "%s", "*FontPrevWin_Impl::Is100PercentFontWidthValid(): 100PercentFontWidth's not synchronous" ); } } while (false) | |||
225 | ( mn100PercentFontWidth != -1 && mn100PercentFontWidthCTL != -1 ),do { if (true && (!(( mn100PercentFontWidth == -1 && mn100PercentFontWidthCJK == -1 ) || ( mn100PercentFontWidth != -1 && mn100PercentFontWidthCJK != -1 ) || ( mn100PercentFontWidth == -1 && mn100PercentFontWidthCTL == -1 ) || ( mn100PercentFontWidth != -1 && mn100PercentFontWidthCTL != -1 )))) { sal_detail_logFormat ((SAL_DETAIL_LOG_LEVEL_WARN), ("legacy.tools"), ("/home/maarten/src/libreoffice/core/svx/source/dialog/fntctrl.cxx" ":" "226" ": "), "%s", "*FontPrevWin_Impl::Is100PercentFontWidthValid(): 100PercentFontWidth's not synchronous" ); } } while (false) | |||
226 | "*FontPrevWin_Impl::Is100PercentFontWidthValid(): 100PercentFontWidth's not synchronous" )do { if (true && (!(( mn100PercentFontWidth == -1 && mn100PercentFontWidthCJK == -1 ) || ( mn100PercentFontWidth != -1 && mn100PercentFontWidthCJK != -1 ) || ( mn100PercentFontWidth == -1 && mn100PercentFontWidthCTL == -1 ) || ( mn100PercentFontWidth != -1 && mn100PercentFontWidthCTL != -1 )))) { sal_detail_logFormat ((SAL_DETAIL_LOG_LEVEL_WARN), ("legacy.tools"), ("/home/maarten/src/libreoffice/core/svx/source/dialog/fntctrl.cxx" ":" "226" ": "), "%s", "*FontPrevWin_Impl::Is100PercentFontWidthValid(): 100PercentFontWidth's not synchronous" ); } } while (false); | |||
227 | return mn100PercentFontWidth != -1; | |||
228 | } | |||
229 | ||||
230 | /* | |||
231 | * evaluates the scripttypes of the actual string. | |||
232 | * Afterwards the positions of script change are notified in aScriptChg, | |||
233 | * the scripttypes in aScriptType. | |||
234 | * The aTextWidth array will be filled with zero. | |||
235 | */ | |||
236 | void FontPrevWin_Impl::CheckScript() | |||
237 | { | |||
238 | assert(!maText.isEmpty())(static_cast <bool> (!maText.isEmpty()) ? void (0) : __assert_fail ("!maText.isEmpty()", "/home/maarten/src/libreoffice/core/svx/source/dialog/fntctrl.cxx" , 238, __extension__ __PRETTY_FUNCTION__)); // must have a preview text here! | |||
239 | if (maText == maScriptText) | |||
240 | { | |||
241 | return; // already initialized | |||
242 | } | |||
243 | ||||
244 | maScriptText = maText; | |||
245 | ||||
246 | maScriptChg.clear(); | |||
247 | maScriptType.clear(); | |||
248 | maTextWidth.clear(); | |||
249 | ||||
250 | if (!mxBreak.is()) | |||
251 | { | |||
252 | Reference<XComponentContext> xContext = ::comphelper::getProcessComponentContext(); | |||
253 | mxBreak = BreakIterator::create(xContext); | |||
254 | } | |||
255 | ||||
256 | sal_uInt16 nScript = 0; | |||
257 | sal_Int32 nChg = 0; | |||
258 | ||||
259 | while (nChg < maText.getLength()) | |||
260 | { | |||
261 | nScript = mxBreak->getScriptType(maText, nChg); | |||
262 | nChg = mxBreak->endOfScript(maText, nChg, nScript); | |||
263 | if (nChg < maText.getLength() && nChg > 0 && | |||
264 | (css::i18n::ScriptType::WEAK == | |||
265 | mxBreak->getScriptType(maText, nChg - 1))) | |||
266 | { | |||
267 | int8_t nType = u_charTypeu_charType_67(maText[nChg]); | |||
268 | if (nType == U_NON_SPACING_MARK || nType == U_ENCLOSING_MARK || | |||
269 | nType == U_COMBINING_SPACING_MARK) | |||
270 | { | |||
271 | maScriptChg.push_back(nChg - 1); | |||
272 | } | |||
273 | else | |||
274 | { | |||
275 | maScriptChg.push_back(nChg); | |||
276 | } | |||
277 | } | |||
278 | else | |||
279 | { | |||
280 | maScriptChg.push_back(nChg); | |||
281 | } | |||
282 | maScriptType.push_back(nScript); | |||
283 | maTextWidth.push_back(0); | |||
284 | } | |||
285 | } | |||
286 | ||||
287 | /* | |||
288 | * Size FontPrevWin_Impl::CalcTextSize(..) | |||
289 | * fills the aTextWidth array with the text width of every part | |||
290 | * of the actual string without a script change inside. | |||
291 | * For Latin parts the given rFont will be used, | |||
292 | * for Asian parts the aCJKFont. | |||
293 | * The returned size contains the whole string. | |||
294 | * The member nAscent is calculated to the maximal ascent of all used fonts. | |||
295 | */ | |||
296 | ||||
297 | Size FontPrevWin_Impl::CalcTextSize(vcl::RenderContext& rRenderContext, OutputDevice const * _pPrinter, const SvxFont& rInFont) | |||
298 | { | |||
299 | sal_uInt16 nScript; | |||
300 | sal_uInt16 nIdx = 0; | |||
301 | sal_Int32 nStart = 0; | |||
302 | sal_Int32 nEnd; | |||
303 | size_t nCnt = maScriptChg.size(); | |||
304 | ||||
305 | if (nCnt) | |||
306 | { | |||
307 | nEnd = maScriptChg[nIdx]; | |||
308 | nScript = maScriptType[nIdx]; | |||
309 | } | |||
310 | else | |||
311 | { | |||
312 | nEnd = maText.getLength(); | |||
313 | nScript = css::i18n::ScriptType::LATIN; | |||
314 | } | |||
315 | long nTxtWidth = 0; | |||
316 | long nCJKHeight = 0; | |||
317 | long nCTLHeight = 0; | |||
318 | long nHeight = 0; | |||
319 | mnAscent = 0; | |||
320 | long nCJKAscent = 0; | |||
321 | long nCTLAscent = 0; | |||
322 | ||||
323 | do | |||
324 | { | |||
325 | const SvxFont& rFont = (nScript == css::i18n::ScriptType::ASIAN) ? | |||
326 | maCJKFont : | |||
327 | ((nScript == css::i18n::ScriptType::COMPLEX) ? | |||
328 | maCTLFont : | |||
329 | rInFont); | |||
330 | long nWidth = rFont.GetTextSize(_pPrinter, maText, nStart, nEnd - nStart).Width(); | |||
331 | if (nIdx >= maTextWidth.size()) | |||
332 | break; | |||
333 | ||||
334 | maTextWidth[nIdx++] = nWidth; | |||
335 | nTxtWidth += nWidth; | |||
336 | ||||
337 | switch (nScript) | |||
338 | { | |||
339 | case css::i18n::ScriptType::ASIAN: | |||
340 | calcFontHeightAnyAscent(rRenderContext, maCJKFont, nCJKHeight, nCJKAscent); | |||
341 | break; | |||
342 | case css::i18n::ScriptType::COMPLEX: | |||
343 | calcFontHeightAnyAscent(rRenderContext, maCTLFont, nCTLHeight, nCTLAscent); | |||
344 | break; | |||
345 | default: | |||
346 | calcFontHeightAnyAscent(rRenderContext, rFont, nHeight, mnAscent); | |||
347 | } | |||
348 | ||||
349 | if (nEnd < maText.getLength() && nIdx < nCnt) | |||
350 | { | |||
351 | nStart = nEnd; | |||
352 | nEnd = maScriptChg[nIdx]; | |||
353 | nScript = maScriptType[nIdx]; | |||
354 | } | |||
355 | else | |||
356 | break; | |||
357 | } | |||
358 | while(true); | |||
359 | ||||
360 | nHeight -= mnAscent; | |||
361 | nCJKHeight -= nCJKAscent; | |||
362 | nCTLHeight -= nCTLAscent; | |||
363 | ||||
364 | if (nHeight < nCJKHeight) | |||
365 | nHeight = nCJKHeight; | |||
366 | ||||
367 | if (mnAscent < nCJKAscent) | |||
368 | mnAscent = nCJKAscent; | |||
369 | ||||
370 | if (nHeight < nCTLHeight) | |||
371 | nHeight = nCTLHeight; | |||
372 | ||||
373 | if (mnAscent < nCTLAscent) | |||
374 | mnAscent = nCTLAscent; | |||
375 | ||||
376 | nHeight += mnAscent; | |||
377 | ||||
378 | Size aTxtSize(nTxtWidth, nHeight); | |||
379 | return aTxtSize; | |||
380 | } | |||
381 | ||||
382 | /* | |||
383 | * void FontPrevWin_Impl::DrawPrev(..) | |||
384 | * calls SvxFont::DrawPrev(..) for every part of the string without a script | |||
385 | * change inside, for Asian parts the aCJKFont will be used, otherwise the | |||
386 | * given rFont. | |||
387 | */ | |||
388 | ||||
389 | void FontPrevWin_Impl::DrawPrev(vcl::RenderContext& rRenderContext, Printer* _pPrinter, Point &rPt, const SvxFont& rInFont) | |||
390 | { | |||
391 | vcl::Font aOldFont = _pPrinter->GetFont(); | |||
392 | sal_uInt16 nScript; | |||
393 | sal_uInt16 nIdx = 0; | |||
394 | sal_Int32 nStart = 0; | |||
395 | sal_Int32 nEnd; | |||
396 | size_t nCnt = maScriptChg.size(); | |||
397 | if (nCnt) | |||
398 | { | |||
399 | nEnd = maScriptChg[nIdx]; | |||
400 | nScript = maScriptType[nIdx]; | |||
401 | } | |||
402 | else | |||
403 | { | |||
404 | nEnd = maText.getLength(); | |||
405 | nScript = css::i18n::ScriptType::LATIN; | |||
406 | } | |||
407 | do | |||
408 | { | |||
409 | const SvxFont& rFont = (nScript == css::i18n::ScriptType::ASIAN) | |||
410 | ? maCJKFont | |||
411 | : ((nScript == css::i18n::ScriptType::COMPLEX) | |||
412 | ? maCTLFont | |||
413 | : rInFont); | |||
414 | _pPrinter->SetFont(rFont); | |||
415 | ||||
416 | rFont.DrawPrev(&rRenderContext, _pPrinter, rPt, maText, nStart, nEnd - nStart); | |||
417 | ||||
418 | rPt.AdjustX(maTextWidth[nIdx++] ); | |||
419 | if (nEnd < maText.getLength() && nIdx < nCnt) | |||
420 | { | |||
421 | nStart = nEnd; | |||
422 | nEnd = maScriptChg[nIdx]; | |||
423 | nScript = maScriptType[nIdx]; | |||
424 | } | |||
425 | else | |||
426 | break; | |||
427 | } | |||
428 | while(true); | |||
429 | _pPrinter->SetFont(aOldFont); | |||
430 | } | |||
431 | ||||
432 | ||||
433 | bool FontPrevWin_Impl::SetFontWidthScale(sal_uInt16 nScale) | |||
434 | { | |||
435 | if (mnFontWidthScale != nScale) | |||
436 | { | |||
437 | mnFontWidthScale = nScale; | |||
438 | return true; | |||
439 | } | |||
440 | ||||
441 | return false; | |||
442 | } | |||
443 | ||||
444 | void FontPrevWin_Impl::ScaleFontWidth(vcl::RenderContext const & rOutDev) | |||
445 | { | |||
446 | if (!Is100PercentFontWidthValid()) | |||
447 | { | |||
448 | scaleFontWidth(maFont, rOutDev, mn100PercentFontWidth); | |||
449 | scaleFontWidth(maCJKFont, rOutDev, mn100PercentFontWidthCJK); | |||
450 | scaleFontWidth(maCTLFont, rOutDev, mn100PercentFontWidthCTL); | |||
451 | } | |||
452 | ||||
453 | maFont.SetAverageFontWidth(mn100PercentFontWidth * mnFontWidthScale / 100); | |||
454 | maCJKFont.SetAverageFontWidth(mn100PercentFontWidthCJK * mnFontWidthScale / 100); | |||
455 | maCTLFont.SetAverageFontWidth(mn100PercentFontWidthCTL * mnFontWidthScale / 100); | |||
456 | } | |||
457 | ||||
458 | static bool GetWhich (const SfxItemSet& rSet, sal_uInt16 nSlot, sal_uInt16& rWhich) | |||
459 | { | |||
460 | rWhich = rSet.GetPool()->GetWhich(nSlot); | |||
461 | return rSet.GetItemState(rWhich) >= SfxItemState::DEFAULT; | |||
462 | } | |||
463 | ||||
464 | static void SetPrevFont(const SfxItemSet& rSet, sal_uInt16 nSlot, SvxFont& rFont) | |||
465 | { | |||
466 | sal_uInt16 nWhich; | |||
467 | if (GetWhich(rSet, nSlot, nWhich)) | |||
468 | { | |||
469 | const SvxFontItem& rFontItem = static_cast<const SvxFontItem&>(rSet.Get(nWhich)); | |||
470 | rFont.SetFamily(rFontItem.GetFamily()); | |||
471 | rFont.SetFamilyName(rFontItem.GetFamilyName()); | |||
472 | rFont.SetPitch(rFontItem.GetPitch()); | |||
473 | rFont.SetCharSet(rFontItem.GetCharSet()); | |||
474 | rFont.SetStyleName(rFontItem.GetStyleName()); | |||
475 | } | |||
476 | } | |||
477 | ||||
478 | static void SetPrevFontStyle( const SfxItemSet& rSet, sal_uInt16 nPosture, sal_uInt16 nWeight, SvxFont& rFont ) | |||
479 | { | |||
480 | sal_uInt16 nWhich; | |||
481 | if( GetWhich( rSet, nPosture, nWhich ) ) | |||
482 | { | |||
483 | const SvxPostureItem& rItem = static_cast<const SvxPostureItem&>( rSet.Get( nWhich ) ); | |||
484 | rFont.SetItalic( rItem.GetValue() != ITALIC_NONE ? ITALIC_NORMAL : ITALIC_NONE ); | |||
485 | } | |||
486 | ||||
487 | if( GetWhich( rSet, nWeight, nWhich ) ) | |||
488 | { | |||
489 | const SvxWeightItem& rItem = static_cast<const SvxWeightItem&>( rSet.Get( nWhich ) ); | |||
490 | rFont.SetWeight( rItem.GetValue() != WEIGHT_NORMAL ? WEIGHT_BOLD : WEIGHT_NORMAL ); | |||
491 | } | |||
492 | } | |||
493 | ||||
494 | static void SetPrevFontEscapement(SvxFont& rFont, sal_uInt8 nProp, sal_uInt8 nEscProp, short nEsc) | |||
495 | { | |||
496 | rFont.SetPropr(nProp); | |||
497 | rFont.SetProprRel(nEscProp); | |||
498 | rFont.SetEscapement(nEsc); | |||
499 | } | |||
500 | ||||
501 | void SvxFontPrevWindow::ApplySettings(vcl::RenderContext& rRenderContext) | |||
502 | { | |||
503 | const StyleSettings& rStyleSettings = Application::GetSettings().GetStyleSettings(); | |||
504 | ||||
505 | svtools::ColorConfig aColorConfig; | |||
506 | Color aTextColor(aColorConfig.GetColorValue(svtools::FONTCOLOR).nColor); | |||
507 | rRenderContext.SetTextColor(aTextColor); | |||
508 | ||||
509 | rRenderContext.SetBackground(rStyleSettings.GetWindowColor()); | |||
510 | } | |||
511 | ||||
512 | void SvxFontPrevWindow::SetDrawingArea(weld::DrawingArea* pDrawingArea) | |||
513 | { | |||
514 | CustomWidgetController::SetDrawingArea(pDrawingArea); | |||
515 | Size aPrefSize(getPreviewStripSize(pDrawingArea->get_ref_device())); | |||
516 | pDrawingArea->set_size_request(aPrefSize.Width(), aPrefSize.Height()); | |||
517 | ||||
518 | pImpl.reset(new FontPrevWin_Impl); | |||
519 | SfxViewShell* pSh = SfxViewShell::Current(); | |||
520 | ||||
521 | if (pSh) | |||
522 | pImpl->mpPrinter = pSh->GetPrinter(); | |||
523 | ||||
524 | if (!pImpl->mpPrinter) | |||
525 | { | |||
526 | pImpl->mpPrinter = VclPtr<Printer>::Create(); | |||
527 | pImpl->mbDelPrinter = true; | |||
528 | } | |||
529 | initFont(pImpl->maFont); | |||
530 | initFont(pImpl->maCJKFont); | |||
531 | initFont(pImpl->maCTLFont); | |||
532 | ||||
533 | Invalidate(); | |||
534 | } | |||
535 | ||||
536 | SvxFontPrevWindow::SvxFontPrevWindow() | |||
537 | { | |||
538 | } | |||
539 | ||||
540 | SvxFontPrevWindow::~SvxFontPrevWindow() | |||
541 | { | |||
542 | } | |||
| ||||
543 | ||||
544 | SvxFont& SvxFontPrevWindow::GetCTLFont() | |||
545 | { | |||
546 | return pImpl->maCTLFont; | |||
547 | } | |||
548 | ||||
549 | SvxFont& SvxFontPrevWindow::GetCJKFont() | |||
550 | { | |||
551 | return pImpl->maCJKFont; | |||
552 | } | |||
553 | ||||
554 | SvxFont& SvxFontPrevWindow::GetFont() | |||
555 | { | |||
556 | pImpl->Invalidate100PercentFontWidth(); // because the user might change the size | |||
557 | return pImpl->maFont; | |||
558 | } | |||
559 | ||||
560 | const SvxFont& SvxFontPrevWindow::GetFont() const | |||
561 | { | |||
562 | return pImpl->maFont; | |||
563 | } | |||
564 | ||||
565 | void SvxFontPrevWindow::SetPreviewText( const OUString& rString ) | |||
566 | { | |||
567 | pImpl->maText = rString; | |||
568 | pImpl->mbTextInited = true; | |||
569 | } | |||
570 | ||||
571 | void SvxFontPrevWindow::SetFontNameAsPreviewText() | |||
572 | { | |||
573 | pImpl->mbUseFontNameAsText = true; | |||
574 | } | |||
575 | ||||
576 | void SvxFontPrevWindow::SetFont( const SvxFont& rNormalOutFont, const SvxFont& rCJKOutFont, const SvxFont& rCTLFont ) | |||
577 | { | |||
578 | setFont(rNormalOutFont, pImpl->maFont); | |||
579 | setFont(rCJKOutFont, pImpl->maCJKFont); | |||
580 | setFont(rCTLFont, pImpl->maCTLFont); | |||
581 | ||||
582 | pImpl->Invalidate100PercentFontWidth(); | |||
583 | Invalidate(); | |||
584 | } | |||
585 | ||||
586 | void SvxFontPrevWindow::SetColor(const Color &rColor) | |||
587 | { | |||
588 | pImpl->mpColor.reset(new Color(rColor)); | |||
589 | Invalidate(); | |||
590 | } | |||
591 | ||||
592 | void SvxFontPrevWindow::ResetColor() | |||
593 | { | |||
594 | pImpl->mpColor.reset(); | |||
595 | Invalidate(); | |||
596 | } | |||
597 | ||||
598 | void SvxFontPrevWindow::SetBackColor(const Color &rColor) | |||
599 | { | |||
600 | pImpl->mpBackColor.reset(new Color(rColor)); | |||
601 | Invalidate(); | |||
602 | } | |||
603 | ||||
604 | void SvxFontPrevWindow::SetTextLineColor(const Color &rColor) | |||
605 | { | |||
606 | pImpl->mpTextLineColor.reset(new Color(rColor)); | |||
607 | Invalidate(); | |||
608 | } | |||
609 | ||||
610 | void SvxFontPrevWindow::SetOverlineColor(const Color &rColor) | |||
611 | { | |||
612 | pImpl->mpOverlineColor.reset(new Color(rColor)); | |||
613 | Invalidate(); | |||
614 | } | |||
615 | ||||
616 | void SvxFontPrevWindow::Paint(vcl::RenderContext& rRenderContext, const tools::Rectangle&) | |||
617 | { | |||
618 | rRenderContext.Push(PushFlags::ALL); | |||
619 | rRenderContext.SetMapMode(MapMode(MapUnit::MapTwip)); | |||
620 | ||||
621 | ApplySettings(rRenderContext); | |||
622 | ||||
623 | Printer* pPrinter = pImpl->mpPrinter; | |||
624 | const SvxFont& rFont = pImpl->maFont; | |||
625 | const SvxFont& rCJKFont = pImpl->maCJKFont; | |||
626 | const SvxFont& rCTLFont = pImpl->maCTLFont; | |||
627 | ||||
628 | if (!IsEnabled()) | |||
629 | { | |||
630 | const StyleSettings& rStyleSettings = Application::GetSettings().GetStyleSettings(); | |||
631 | const Size aLogSize(rRenderContext.GetOutputSize()); | |||
632 | ||||
633 | tools::Rectangle aRect(Point(0, 0), aLogSize); | |||
634 | rRenderContext.SetLineColor(); | |||
635 | rRenderContext.SetFillColor(rStyleSettings.GetWindowColor()); | |||
636 | rRenderContext.DrawRect(aRect); | |||
637 | } | |||
638 | else | |||
639 | { | |||
640 | if (!pImpl->mbSelection && !pImpl->mbTextInited) | |||
641 | { | |||
642 | using namespace css::i18n::ScriptType; | |||
643 | ||||
644 | SfxViewShell* pSh = SfxViewShell::Current(); | |||
645 | ||||
646 | if (pSh && !pImpl->mbGetSelection && !pImpl->mbUseFontNameAsText) | |||
647 | { | |||
648 | pImpl->maText = pSh->GetSelectionText(); | |||
649 | pImpl->mbGetSelection = true; | |||
650 | pImpl->mbSelection = !CleanAndCheckEmpty(pImpl->maText); | |||
651 | } | |||
652 | ||||
653 | if (!pImpl->mbSelection || pImpl->mbUseFontNameAsText) | |||
654 | { | |||
655 | //If we're showing multiple sample texts, then they're all | |||
656 | //sample texts. If only showing Latin, continue to use | |||
657 | //the fontname as the preview | |||
658 | if ((pImpl->m_bCJKEnabled) || (pImpl->m_bCTLEnabled)) | |||
659 | pImpl->maText = makeRepresentativeTextForFont(LATIN, rFont); | |||
660 | else | |||
661 | pImpl->maText = rFont.GetFamilyName(); | |||
662 | ||||
663 | if (pImpl->m_bCJKEnabled) | |||
664 | { | |||
665 | if (!pImpl->maText.isEmpty()) | |||
666 | pImpl->maText += " "; | |||
667 | pImpl->maText += makeRepresentativeTextForFont(ASIAN, rCJKFont); | |||
668 | ||||
669 | } | |||
670 | if (pImpl->m_bCTLEnabled) | |||
671 | { | |||
672 | if (!pImpl->maText.isEmpty()) | |||
673 | pImpl->maText += " "; | |||
674 | pImpl->maText += makeRepresentativeTextForFont(COMPLEX, rCTLFont); | |||
675 | } | |||
676 | } | |||
677 | ||||
678 | if (pImpl->maText.isEmpty()) | |||
679 | { // fdo#58427: still no text? let's try that one... | |||
680 | pImpl->maText = makeRepresentativeTextForFont(LATIN, rFont); | |||
681 | } | |||
682 | ||||
683 | bool bEmpty = CleanAndCheckEmpty(pImpl->maText); | |||
684 | if (bEmpty) | |||
685 | pImpl->maText = OUString(); | |||
686 | ||||
687 | if (pImpl->maText.getLength() > (TEXT_WIDTH80 - 1)) | |||
688 | { | |||
689 | const sal_Int32 nSpaceIdx = pImpl->maText.indexOf(" ", TEXT_WIDTH80); | |||
690 | if (nSpaceIdx != -1) | |||
691 | pImpl->maText = pImpl->maText.copy(0, nSpaceIdx); | |||
692 | else | |||
693 | pImpl->maText = pImpl->maText.copy(0, (TEXT_WIDTH80 - 1)); | |||
694 | } | |||
695 | } | |||
696 | ||||
697 | // calculate text width scaling | |||
698 | pImpl->ScaleFontWidth(rRenderContext); | |||
699 | ||||
700 | pImpl->CheckScript(); | |||
701 | Size aTxtSize = pImpl->CalcTextSize(rRenderContext, pPrinter, rFont); | |||
702 | ||||
703 | const Size aLogSize(rRenderContext.GetOutputSize()); | |||
704 | ||||
705 | long nX = aLogSize.Width() / 2 - aTxtSize.Width() / 2; | |||
706 | long nY = aLogSize.Height() / 2 - aTxtSize.Height() / 2; | |||
707 | ||||
708 | if (nY + pImpl->mnAscent > aLogSize.Height()) | |||
709 | nY = aLogSize.Height() - pImpl->mnAscent; | |||
710 | ||||
711 | if (pImpl->mpBackColor) | |||
712 | { | |||
713 | tools::Rectangle aRect(Point(0, 0), aLogSize); | |||
714 | Color aLineCol = rRenderContext.GetLineColor(); | |||
715 | Color aFillCol = rRenderContext.GetFillColor(); | |||
716 | rRenderContext.SetLineColor(); | |||
717 | rRenderContext.SetFillColor(*pImpl->mpBackColor); | |||
718 | rRenderContext.DrawRect(aRect); | |||
719 | rRenderContext.SetLineColor(aLineCol); | |||
720 | rRenderContext.SetFillColor(aFillCol); | |||
721 | } | |||
722 | if (pImpl->mpColor) | |||
723 | { | |||
724 | tools::Rectangle aRect(Point(nX, nY), aTxtSize); | |||
725 | Color aLineCol = rRenderContext.GetLineColor(); | |||
726 | Color aFillCol = rRenderContext.GetFillColor(); | |||
727 | rRenderContext.SetLineColor(); | |||
728 | rRenderContext.SetFillColor(*pImpl->mpColor); | |||
729 | rRenderContext.DrawRect(aRect); | |||
730 | rRenderContext.SetLineColor(aLineCol); | |||
731 | rRenderContext.SetFillColor(aFillCol); | |||
732 | } | |||
733 | ||||
734 | if (pImpl->mpTextLineColor) | |||
735 | { | |||
736 | rRenderContext.SetTextLineColor(*pImpl->mpTextLineColor); | |||
737 | } | |||
738 | ||||
739 | if (pImpl->mpOverlineColor) | |||
740 | { | |||
741 | rRenderContext.SetOverlineColor(*pImpl->mpOverlineColor); | |||
742 | } | |||
743 | ||||
744 | long nStdAscent = pImpl->mnAscent; | |||
745 | nY += nStdAscent; | |||
746 | ||||
747 | if (IsTwoLines()) | |||
748 | { | |||
749 | SvxFont aSmallFont(rFont); | |||
750 | Size aOldSize = pImpl->maCJKFont.GetFontSize(); | |||
751 | setFontSize(aSmallFont); | |||
752 | setFontSize(pImpl->maCJKFont); | |||
753 | ||||
754 | long nStartBracketWidth = 0; | |||
755 | long nEndBracketWidth = 0; | |||
756 | long nTextWidth = 0; | |||
757 | if (pImpl->mcStartBracket) | |||
758 | { | |||
759 | OUString sBracket(pImpl->mcStartBracket); | |||
760 | nStartBracketWidth = rFont.GetTextSize(pPrinter, sBracket).Width(); | |||
761 | } | |||
762 | if (pImpl->mcEndBracket) | |||
763 | { | |||
764 | OUString sBracket(pImpl->mcEndBracket); | |||
765 | nEndBracketWidth = rFont.GetTextSize(pPrinter, sBracket).Width(); | |||
766 | } | |||
767 | nTextWidth = pImpl->CalcTextSize(rRenderContext, pPrinter, aSmallFont).Width(); | |||
768 | long nResultWidth = nStartBracketWidth; | |||
769 | nResultWidth += nEndBracketWidth; | |||
770 | nResultWidth += nTextWidth; | |||
771 | ||||
772 | long _nX = (aLogSize.Width() - nResultWidth) / 2; | |||
773 | rRenderContext.DrawLine(Point(0, nY), Point(_nX, nY)); | |||
774 | rRenderContext.DrawLine(Point(_nX + nResultWidth, nY), Point(aLogSize.Width(), nY)); | |||
775 | ||||
776 | long nSmallAscent = pImpl->mnAscent; | |||
777 | long nOffset = (nStdAscent - nSmallAscent) / 2; | |||
778 | ||||
779 | if (pImpl->mcStartBracket) | |||
780 | { | |||
781 | OUString sBracket(pImpl->mcStartBracket); | |||
782 | rFont.DrawPrev(&rRenderContext, pPrinter, Point(_nX, nY - nOffset - 4), sBracket); | |||
783 | _nX += nStartBracketWidth; | |||
784 | } | |||
785 | ||||
786 | Point aTmpPoint1(_nX, nY - nSmallAscent - 2); | |||
787 | Point aTmpPoint2(_nX, nY); | |||
788 | pImpl->DrawPrev(rRenderContext, pPrinter, aTmpPoint1, aSmallFont); | |||
789 | pImpl->DrawPrev(rRenderContext, pPrinter, aTmpPoint2, aSmallFont); | |||
790 | ||||
791 | _nX += nTextWidth; | |||
792 | if (pImpl->mcEndBracket) | |||
793 | { | |||
794 | Point aTmpPoint( _nX + 1, nY - nOffset - 4); | |||
795 | OUString sBracket(pImpl->mcEndBracket); | |||
796 | rFont.DrawPrev(&rRenderContext, pPrinter, aTmpPoint, sBracket); | |||
797 | } | |||
798 | pImpl->maCJKFont.SetFontSize(aOldSize); | |||
799 | } | |||
800 | else | |||
801 | { | |||
802 | ||||
803 | Color aLineCol = rRenderContext.GetLineColor(); | |||
804 | ||||
805 | rRenderContext.SetLineColor(rFont.GetColor()); | |||
806 | rRenderContext.DrawLine(Point(0, nY), Point(nX, nY)); | |||
807 | rRenderContext.DrawLine(Point(nX + aTxtSize.Width(), nY), Point(aLogSize.Width(), nY)); | |||
808 | rRenderContext.SetLineColor(aLineCol); | |||
809 | ||||
810 | Point aTmpPoint(nX, nY); | |||
811 | pImpl->DrawPrev(rRenderContext, pPrinter, aTmpPoint, rFont); | |||
812 | } | |||
813 | } | |||
814 | rRenderContext.Pop(); | |||
815 | } | |||
816 | ||||
817 | bool SvxFontPrevWindow::IsTwoLines() const | |||
818 | { | |||
819 | return pImpl->mbTwoLines; | |||
820 | } | |||
821 | ||||
822 | void SvxFontPrevWindow::SetTwoLines(bool bSet) | |||
823 | { | |||
824 | pImpl->mbTwoLines = bSet; | |||
825 | } | |||
826 | ||||
827 | void SvxFontPrevWindow::SetBrackets(sal_Unicode cStart, sal_Unicode cEnd) | |||
828 | { | |||
829 | pImpl->mcStartBracket = cStart; | |||
830 | pImpl->mcEndBracket = cEnd; | |||
831 | } | |||
832 | ||||
833 | void SvxFontPrevWindow::SetFontWidthScale( sal_uInt16 n ) | |||
834 | { | |||
835 | if (pImpl->SetFontWidthScale(n)) | |||
836 | Invalidate(); | |||
837 | } | |||
838 | ||||
839 | void SvxFontPrevWindow::AutoCorrectFontColor() | |||
840 | { | |||
841 | const StyleSettings& rStyleSettings = Application::GetSettings().GetStyleSettings(); | |||
842 | Color aFontColor(rStyleSettings.GetWindowTextColor()); | |||
843 | ||||
844 | if (COL_AUTO == pImpl->maFont.GetColor()) | |||
845 | pImpl->maFont.SetColor(aFontColor); | |||
846 | ||||
847 | if (COL_AUTO == pImpl->maCJKFont.GetColor()) | |||
848 | pImpl->maCJKFont.SetColor(aFontColor); | |||
849 | ||||
850 | if (COL_AUTO == pImpl->maCTLFont.GetColor()) | |||
851 | pImpl->maCTLFont.SetColor(aFontColor); | |||
852 | } | |||
853 | ||||
854 | void SvxFontPrevWindow::SetFontSize( const SfxItemSet& rSet, sal_uInt16 nSlot, SvxFont& rFont ) | |||
855 | { | |||
856 | sal_uInt16 nWhich; | |||
857 | long nH; | |||
858 | if (GetWhich(rSet, nSlot, nWhich)) | |||
859 | { | |||
860 | nH = OutputDevice::LogicToLogic(static_cast<const SvxFontHeightItem&>(rSet.Get(nWhich)).GetHeight(), | |||
861 | rSet.GetPool()->GetMetric(nWhich), | |||
862 | MapUnit::MapTwip); | |||
863 | } | |||
864 | else | |||
865 | nH = 240;// as default 12pt | |||
866 | ||||
867 | rFont.SetFontSize(Size(0, nH)); | |||
868 | } | |||
869 | ||||
870 | void SvxFontPrevWindow::SetFontLang(const SfxItemSet& rSet, sal_uInt16 nSlot, SvxFont& rFont) | |||
871 | { | |||
872 | sal_uInt16 nWhich; | |||
873 | LanguageType nLang; | |||
874 | if( GetWhich( rSet, nSlot, nWhich ) ) | |||
875 | nLang = static_cast<const SvxLanguageItem&>(rSet.Get(nWhich)).GetLanguage(); | |||
876 | else | |||
877 | nLang = LANGUAGE_NONELanguageType(0x00FF); | |||
878 | rFont.SetLanguage(nLang); | |||
879 | } | |||
880 | ||||
881 | void SvxFontPrevWindow::SetFromItemSet(const SfxItemSet &rSet, bool bPreviewBackgroundToCharacter) | |||
882 | { | |||
883 | sal_uInt16 nWhich; | |||
884 | SvxFont& rFont = GetFont(); | |||
885 | SvxFont& rCJKFont = GetCJKFont(); | |||
886 | SvxFont& rCTLFont = GetCTLFont(); | |||
887 | ||||
888 | // Preview string | |||
889 | if( GetWhich( rSet, SID_CHAR_DLG_PREVIEW_STRING( 10000 + 1090 ), nWhich ) ) | |||
890 | { | |||
891 | const SfxStringItem& rItem = static_cast<const SfxStringItem&>( rSet.Get( nWhich ) ); | |||
892 | const OUString& aString = rItem.GetValue(); | |||
893 | if( !aString.isEmpty() ) | |||
894 | SetPreviewText( aString ); | |||
895 | else | |||
896 | SetFontNameAsPreviewText(); | |||
897 | } | |||
898 | ||||
899 | // Underline | |||
900 | FontLineStyle eUnderline; | |||
901 | if( GetWhich( rSet, SID_ATTR_CHAR_UNDERLINE( 10000 + 14 ), nWhich ) ) | |||
902 | { | |||
903 | const SvxUnderlineItem& rItem = static_cast<const SvxUnderlineItem&>( rSet.Get( nWhich ) ); | |||
904 | eUnderline = rItem.GetValue(); | |||
905 | } | |||
906 | else | |||
907 | eUnderline = LINESTYLE_NONE; | |||
908 | ||||
909 | rFont.SetUnderline( eUnderline ); | |||
910 | rCJKFont.SetUnderline( eUnderline ); | |||
911 | rCTLFont.SetUnderline( eUnderline ); | |||
912 | ||||
913 | // Overline | |||
914 | FontLineStyle eOverline; | |||
915 | if( GetWhich( rSet, SID_ATTR_CHAR_OVERLINE( ((10000 + 1499) + 1) + 68 ), nWhich ) ) | |||
916 | { | |||
917 | const SvxOverlineItem& rItem = static_cast<const SvxOverlineItem&>( rSet.Get( nWhich ) ); | |||
918 | eOverline = rItem.GetValue(); | |||
919 | } | |||
920 | else | |||
921 | eOverline = LINESTYLE_NONE; | |||
922 | ||||
923 | rFont.SetOverline( eOverline ); | |||
924 | rCJKFont.SetOverline( eOverline ); | |||
925 | rCTLFont.SetOverline( eOverline ); | |||
926 | ||||
927 | // Strikeout | |||
928 | FontStrikeout eStrikeout; | |||
929 | if( GetWhich( rSet, SID_ATTR_CHAR_STRIKEOUT( 10000 + 13 ), nWhich ) ) | |||
930 | { | |||
931 | const SvxCrossedOutItem& rItem = static_cast<const SvxCrossedOutItem&>( rSet.Get( nWhich ) ); | |||
932 | eStrikeout = rItem.GetValue(); | |||
933 | } | |||
934 | else | |||
935 | eStrikeout = STRIKEOUT_NONE; | |||
936 | ||||
937 | rFont.SetStrikeout( eStrikeout ); | |||
938 | rCJKFont.SetStrikeout( eStrikeout ); | |||
939 | rCTLFont.SetStrikeout( eStrikeout ); | |||
940 | ||||
941 | // WordLineMode | |||
942 | if( GetWhich( rSet, SID_ATTR_CHAR_WORDLINEMODE( 10000 + 11 ), nWhich ) ) | |||
943 | { | |||
944 | const SvxWordLineModeItem& rItem = static_cast<const SvxWordLineModeItem&>( rSet.Get( nWhich ) ); | |||
945 | rFont.SetWordLineMode( rItem.GetValue() ); | |||
946 | rCJKFont.SetWordLineMode( rItem.GetValue() ); | |||
947 | rCTLFont.SetWordLineMode( rItem.GetValue() ); | |||
948 | } | |||
949 | ||||
950 | // Emphasis | |||
951 | if( GetWhich( rSet, SID_ATTR_CHAR_EMPHASISMARK( 10000 + 899 ), nWhich ) ) | |||
952 | { | |||
953 | const SvxEmphasisMarkItem& rItem = static_cast<const SvxEmphasisMarkItem&>( rSet.Get( nWhich ) ); | |||
954 | FontEmphasisMark eMark = rItem.GetEmphasisMark(); | |||
955 | rFont.SetEmphasisMark( eMark ); | |||
956 | rCJKFont.SetEmphasisMark( eMark ); | |||
957 | rCTLFont.SetEmphasisMark( eMark ); | |||
958 | } | |||
959 | ||||
960 | // Relief | |||
961 | if( GetWhich( rSet, SID_ATTR_CHAR_RELIEF( 10000 + 920 ), nWhich ) ) | |||
962 | { | |||
963 | const SvxCharReliefItem& rItem = static_cast<const SvxCharReliefItem&>( rSet.Get( nWhich ) ); | |||
964 | FontRelief eFontRelief = rItem.GetValue(); | |||
965 | rFont.SetRelief( eFontRelief ); | |||
966 | rCJKFont.SetRelief( eFontRelief ); | |||
967 | rCTLFont.SetRelief( eFontRelief ); | |||
968 | } | |||
969 | ||||
970 | // Effects | |||
971 | if( GetWhich( rSet, SID_ATTR_CHAR_CASEMAP( 10000 + 19 ), nWhich ) ) | |||
972 | { | |||
973 | const SvxCaseMapItem& rItem = static_cast<const SvxCaseMapItem&>( rSet.Get( nWhich ) ); | |||
974 | SvxCaseMap eCaseMap = rItem.GetValue(); | |||
975 | rFont.SetCaseMap( eCaseMap ); | |||
976 | rCJKFont.SetCaseMap( eCaseMap ); | |||
977 | // #i78474# small caps do not exist in CTL fonts | |||
978 | rCTLFont.SetCaseMap( eCaseMap == SvxCaseMap::SmallCaps ? SvxCaseMap::NotMapped : eCaseMap ); | |||
979 | } | |||
980 | ||||
981 | // Outline | |||
982 | if( GetWhich( rSet, SID_ATTR_CHAR_CONTOUR( 10000 + 12 ), nWhich ) ) | |||
983 | { | |||
984 | const SvxContourItem& rItem = static_cast<const SvxContourItem&>( rSet.Get( nWhich ) ); | |||
985 | bool bOutline = rItem.GetValue(); | |||
986 | rFont.SetOutline( bOutline ); | |||
987 | rCJKFont.SetOutline( bOutline ); | |||
988 | rCTLFont.SetOutline( bOutline ); | |||
989 | } | |||
990 | ||||
991 | // Shadow | |||
992 | if( GetWhich( rSet, SID_ATTR_CHAR_SHADOWED( 10000 + 10 ), nWhich ) ) | |||
993 | { | |||
994 | const SvxShadowedItem& rItem = static_cast<const SvxShadowedItem&>( rSet.Get( nWhich ) ); | |||
995 | bool bShadow = rItem.GetValue(); | |||
996 | rFont.SetShadow( bShadow ); | |||
997 | rCJKFont.SetShadow( bShadow ); | |||
998 | rCTLFont.SetShadow( bShadow ); | |||
999 | } | |||
1000 | ||||
1001 | // Background | |||
1002 | bool bTransparent; | |||
1003 | if( GetWhich( rSet, bPreviewBackgroundToCharacter ? SID_ATTR_BRUSH( 10000 + 1 ) : SID_ATTR_BRUSH_CHAR( 10000 + 591 ), nWhich ) ) | |||
1004 | { | |||
1005 | const SvxBrushItem& rBrush = static_cast<const SvxBrushItem&>( rSet.Get( nWhich ) ); | |||
1006 | const Color& rColor = rBrush.GetColor(); | |||
1007 | bTransparent = rColor.GetTransparency() > 0; | |||
1008 | rFont.SetFillColor( rColor ); | |||
1009 | rCJKFont.SetFillColor( rColor ); | |||
1010 | rCTLFont.SetFillColor( rColor ); | |||
1011 | } | |||
1012 | else | |||
1013 | bTransparent = true; | |||
1014 | ||||
1015 | rFont.SetTransparent( bTransparent ); | |||
1016 | rCJKFont.SetTransparent( bTransparent ); | |||
1017 | rCTLFont.SetTransparent( bTransparent ); | |||
1018 | ||||
1019 | Color aBackCol( COL_TRANSPARENT ); | |||
1020 | if( !bPreviewBackgroundToCharacter ) | |||
1021 | { | |||
1022 | if( GetWhich( rSet, SID_ATTR_BRUSH( 10000 + 1 ), nWhich ) ) | |||
1023 | { | |||
1024 | const SvxBrushItem& rBrush = static_cast<const SvxBrushItem&>( rSet.Get( nWhich ) ); | |||
1025 | if( GPOS_NONE == rBrush.GetGraphicPos() ) | |||
1026 | aBackCol = rBrush.GetColor(); | |||
1027 | } | |||
1028 | } | |||
1029 | SetBackColor( aBackCol ); | |||
1030 | ||||
1031 | // Font | |||
1032 | SetPrevFont( rSet, SID_ATTR_CHAR_FONT( 10000 + 7 ), rFont ); | |||
1033 | SetPrevFont( rSet, SID_ATTR_CHAR_CJK_FONT( 10000 + 887 ), rCJKFont ); | |||
1034 | SetPrevFont( rSet, SID_ATTR_CHAR_CTL_FONT( 10000 + 892 ), rCTLFont ); | |||
1035 | ||||
1036 | // Style | |||
1037 | SetPrevFontStyle( rSet, SID_ATTR_CHAR_POSTURE( 10000 + 8 ), SID_ATTR_CHAR_WEIGHT( 10000 + 9 ), rFont ); | |||
1038 | SetPrevFontStyle( rSet, SID_ATTR_CHAR_CJK_POSTURE( 10000 + 890 ), SID_ATTR_CHAR_CJK_WEIGHT( 10000 + 891 ), rCJKFont ); | |||
1039 | SetPrevFontStyle( rSet, SID_ATTR_CHAR_CTL_POSTURE( 10000 + 895 ), SID_ATTR_CHAR_CTL_WEIGHT( 10000 + 896 ), rCTLFont ); | |||
1040 | ||||
1041 | // Size | |||
1042 | SetFontSize( rSet, SID_ATTR_CHAR_FONTHEIGHT( 10000 + 15 ), rFont ); | |||
1043 | SetFontSize( rSet, SID_ATTR_CHAR_CJK_FONTHEIGHT( 10000 + 888 ), rCJKFont ); | |||
1044 | SetFontSize( rSet, SID_ATTR_CHAR_CTL_FONTHEIGHT( 10000 + 893 ), rCTLFont ); | |||
1045 | ||||
1046 | // Language | |||
1047 | SetFontLang( rSet, SID_ATTR_CHAR_LANGUAGE( 10000 + 20 ), rFont ); | |||
1048 | SetFontLang( rSet, SID_ATTR_CHAR_CJK_LANGUAGE( 10000 + 889 ), rCJKFont ); | |||
1049 | SetFontLang( rSet, SID_ATTR_CHAR_CTL_LANGUAGE( 10000 + 894 ), rCTLFont ); | |||
1050 | ||||
1051 | // Color | |||
1052 | if( GetWhich( rSet, SID_ATTR_CHAR_COLOR( 10000 + 17 ), nWhich ) ) | |||
1053 | { | |||
1054 | const SvxColorItem& rItem = static_cast<const SvxColorItem&>( rSet.Get( nWhich ) ); | |||
1055 | Color aCol( rItem.GetValue() ); | |||
1056 | rFont.SetColor( aCol ); | |||
1057 | ||||
1058 | rCJKFont.SetColor( aCol ); | |||
1059 | rCTLFont.SetColor( aCol ); | |||
1060 | ||||
1061 | AutoCorrectFontColor(); // handle color COL_AUTO | |||
1062 | } | |||
1063 | ||||
1064 | // Kerning | |||
1065 | if( GetWhich( rSet, SID_ATTR_CHAR_KERNING( 10000 + 18 ), nWhich ) ) | |||
1066 | { | |||
1067 | const SvxKerningItem& rItem = static_cast<const SvxKerningItem&>( rSet.Get( nWhich ) ); | |||
1068 | short nKern = static_cast<short>(OutputDevice::LogicToLogic(rItem.GetValue(), rSet.GetPool()->GetMetric(nWhich), MapUnit::MapTwip)); | |||
1069 | rFont.SetFixKerning( nKern ); | |||
1070 | rCJKFont.SetFixKerning( nKern ); | |||
1071 | rCTLFont.SetFixKerning( nKern ); | |||
1072 | } | |||
1073 | ||||
1074 | // Escapement | |||
1075 | const sal_uInt8 nProp = 100; | |||
1076 | short nEsc; | |||
1077 | sal_uInt8 nEscProp; | |||
1078 | if( GetWhich( rSet, SID_ATTR_CHAR_ESCAPEMENT( 10000 + 21 ), nWhich ) ) | |||
1079 | { | |||
1080 | const SvxEscapementItem& rItem = static_cast<const SvxEscapementItem&>( rSet.Get( nWhich ) ); | |||
1081 | nEsc = rItem.GetEsc(); | |||
1082 | nEscProp = rItem.GetProportionalHeight(); | |||
1083 | ||||
1084 | if( nEsc == DFLT_ESC_AUTO_SUPER(13999 +1) ) | |||
1085 | nEsc = DFLT_ESC_SUPER33; | |||
1086 | else if( nEsc == DFLT_ESC_AUTO_SUB-(13999 +1) ) | |||
1087 | nEsc = DFLT_ESC_SUB-8; | |||
1088 | } | |||
1089 | else | |||
1090 | { | |||
1091 | nEsc = 0; | |||
1092 | nEscProp = 100; | |||
1093 | } | |||
1094 | SetPrevFontEscapement( rFont, nProp, nEscProp, nEsc ); | |||
1095 | SetPrevFontEscapement( rCJKFont, nProp, nEscProp, nEsc ); | |||
1096 | SetPrevFontEscapement( rCTLFont, nProp, nEscProp, nEsc ); | |||
1097 | ||||
1098 | // Font width scale | |||
1099 | if( GetWhich( rSet, SID_ATTR_CHAR_SCALEWIDTH( 10000 + 911 ), nWhich ) ) | |||
1100 | { | |||
1101 | const SvxCharScaleWidthItem&rItem = static_cast<const SvxCharScaleWidthItem&>( rSet.Get( nWhich ) ); | |||
1102 | SetFontWidthScale( rItem.GetValue() ); | |||
1103 | } | |||
1104 | ||||
1105 | Invalidate(); | |||
1106 | } | |||
1107 | ||||
1108 | /* vim:set shiftwidth=4 softtabstop=4 expandtab: */ |
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 | |
45 | namespace 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)...)); } |
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 */ |
1 | /* -*- Mode: C++; tab-width: 4; indent-tabs-mode: nil; c-basic-offset: 4 -*- */ |
2 | /* |
3 | * This file is part of the LibreOffice project. |
4 | * |
5 | * This Source Code Form is subject to the terms of the Mozilla Public |
6 | * License, v. 2.0. If a copy of the MPL was not distributed with this |
7 | * file, You can obtain one at http://mozilla.org/MPL/2.0/. |
8 | * |
9 | * This file incorporates work covered by the following license notice: |
10 | * |
11 | * Licensed to the Apache Software Foundation (ASF) under one or more |
12 | * contributor license agreements. See the NOTICE file distributed |
13 | * with this work for additional information regarding copyright |
14 | * ownership. The ASF licenses this file to you under the Apache |
15 | * License, Version 2.0 (the "License"); you may not use this file |
16 | * except in compliance with the License. You may obtain a copy of |
17 | * the License at http://www.apache.org/licenses/LICENSE-2.0 . |
18 | */ |
19 | |
20 | #ifndef INCLUDED_VCL_PTR_HXX |
21 | #define INCLUDED_VCL_PTR_HXX |
22 | |
23 | #include <sal/config.h> |
24 | |
25 | #include <rtl/ref.hxx> |
26 | |
27 | #include <utility> |
28 | #include <type_traits> |
29 | |
30 | #ifdef DBG_UTIL |
31 | #ifndef _WIN32 |
32 | #include <vcl/vclmain.hxx> |
33 | #endif |
34 | #endif |
35 | |
36 | class VclReferenceBase; |
37 | |
38 | namespace vcl::detail { |
39 | |
40 | template<typename> |
41 | constexpr bool isIncompleteOrDerivedFromVclReferenceBase(...) { return true; } |
42 | |
43 | template<typename T> constexpr bool isIncompleteOrDerivedFromVclReferenceBase( |
44 | int (*)[sizeof(T)]) |
45 | { return std::is_base_of<VclReferenceBase, T>::value; } |
46 | |
47 | } // namespace vcl::detail |
48 | |
49 | /** |
50 | * A thin wrapper around rtl::Reference to implement the acquire and dispose semantics we want for references to vcl::Window subclasses. |
51 | * |
52 | * For more details on the design please see vcl/README.lifecycle |
53 | * |
54 | * @param reference_type must be a subclass of vcl::Window |
55 | */ |
56 | template <class reference_type> |
57 | class VclPtr |
58 | { |
59 | static_assert( |
60 | vcl::detail::isIncompleteOrDerivedFromVclReferenceBase<reference_type>( |
61 | nullptr), |
62 | "template argument type must be derived from VclReferenceBase"); |
63 | |
64 | ::rtl::Reference<reference_type> m_rInnerRef; |
65 | |
66 | public: |
67 | /** Constructor... |
68 | */ |
69 | VclPtr() |
70 | : m_rInnerRef() |
71 | {} |
72 | |
73 | /** Constructor... |
74 | */ |
75 | VclPtr (reference_type * pBody) |
76 | : m_rInnerRef(pBody) |
77 | {} |
78 | |
79 | /** Constructor... that doesn't take a ref. |
80 | */ |
81 | VclPtr (reference_type * pBody, __sal_NoAcquire) |
82 | : m_rInnerRef(pBody, SAL_NO_ACQUIRE) |
83 | {} |
84 | |
85 | /** Up-casting conversion constructor: Copies interface reference. |
86 | |
87 | Does not work for up-casts to ambiguous bases. For the special case of |
88 | up-casting to Reference< XInterface >, see the corresponding conversion |
89 | operator. |
90 | |
91 | @param rRef another reference |
92 | */ |
93 | template< class derived_type > |
94 | VclPtr( |
95 | const VclPtr< derived_type > & rRef, |
96 | typename std::enable_if< |
97 | std::is_base_of<reference_type, derived_type>::value, int>::type |
98 | = 0 ) |
99 | : m_rInnerRef( static_cast<reference_type*>(rRef) ) |
100 | { |
101 | } |
102 | |
103 | #if defined(DBG_UTIL) && !defined(_WIN32) |
104 | virtual ~VclPtr() |
105 | { |
106 | assert(m_rInnerRef.get() == nullptr || vclmain::isAlive())(static_cast <bool> (m_rInnerRef.get() == nullptr || vclmain ::isAlive()) ? void (0) : __assert_fail ("m_rInnerRef.get() == nullptr || vclmain::isAlive()" , "/home/maarten/src/libreoffice/core/include/vcl/vclptr.hxx" , 106, __extension__ __PRETTY_FUNCTION__)); |
107 | // We can be one of the intermediate counts, but if we are the last |
108 | // VclPtr keeping this object alive, then something forgot to call dispose(). |
109 | assert((!m_rInnerRef.get() || m_rInnerRef->isDisposed() || m_rInnerRef->getRefCount() > 1)(static_cast <bool> ((!m_rInnerRef.get() || m_rInnerRef ->isDisposed() || m_rInnerRef->getRefCount() > 1) && "someone forgot to call dispose()") ? void (0) : __assert_fail ("(!m_rInnerRef.get() || m_rInnerRef->isDisposed() || m_rInnerRef->getRefCount() > 1) && \"someone forgot to call dispose()\"" , "/home/maarten/src/libreoffice/core/include/vcl/vclptr.hxx" , 110, __extension__ __PRETTY_FUNCTION__)) |
110 | && "someone forgot to call dispose()")(static_cast <bool> ((!m_rInnerRef.get() || m_rInnerRef ->isDisposed() || m_rInnerRef->getRefCount() > 1) && "someone forgot to call dispose()") ? void (0) : __assert_fail ("(!m_rInnerRef.get() || m_rInnerRef->isDisposed() || m_rInnerRef->getRefCount() > 1) && \"someone forgot to call dispose()\"" , "/home/maarten/src/libreoffice/core/include/vcl/vclptr.hxx" , 110, __extension__ __PRETTY_FUNCTION__)); |
111 | } |
112 | VclPtr(VclPtr const &) = default; |
113 | VclPtr(VclPtr &&) = default; |
114 | VclPtr & operator =(VclPtr const &) = default; |
115 | VclPtr & operator =(VclPtr &&) = default; |
116 | #endif |
117 | |
118 | /** |
119 | * A construction helper for VclPtr. Since VclPtr types are created |
120 | * with a reference-count of one - to help fit into the existing |
121 | * code-flow; this helps us to construct them easily. |
122 | * |
123 | * For more details on the design please see vcl/README.lifecycle |
124 | * |
125 | * @tparam reference_type must be a subclass of vcl::Window |
126 | */ |
127 | template<typename... Arg> [[nodiscard]] static VclPtr< reference_type > Create(Arg &&... arg) |
128 | { |
129 | return VclPtr< reference_type >( new reference_type(std::forward<Arg>(arg)...), SAL_NO_ACQUIRE ); |
130 | } |
131 | |
132 | /** Probably most common used: handle->someBodyOp(). |
133 | */ |
134 | reference_type * operator->() const |
135 | { |
136 | return m_rInnerRef.get(); |
137 | } |
138 | |
139 | /** Get the body. Can be used instead of operator->(). |
140 | I.e. handle->someBodyOp() and handle.get()->someBodyOp() |
141 | are the same. |
142 | */ |
143 | reference_type * get() const |
144 | { |
145 | return m_rInnerRef.get(); |
146 | } |
147 | |
148 | void set(reference_type *pBody) |
149 | { |
150 | m_rInnerRef.set(pBody); |
151 | } |
152 | |
153 | void reset(reference_type *pBody) |
154 | { |
155 | m_rInnerRef.set(pBody); |
156 | } |
157 | |
158 | /** Up-casting copy assignment operator. |
159 | |
160 | Does not work for up-casts to ambiguous bases. |
161 | |
162 | @param rRef another reference |
163 | */ |
164 | template<typename derived_type> |
165 | typename std::enable_if< |
166 | std::is_base_of<reference_type, derived_type>::value, |
167 | VclPtr &>::type |
168 | operator =(VclPtr<derived_type> const & rRef) |
169 | { |
170 | m_rInnerRef.set(rRef.get()); |
171 | return *this; |
172 | } |
173 | |
174 | VclPtr & operator =(reference_type * pBody) |
175 | { |
176 | m_rInnerRef.set(pBody); |
177 | return *this; |
178 | } |
179 | |
180 | operator reference_type * () const |
181 | { |
182 | return m_rInnerRef.get(); |
183 | } |
184 | |
185 | explicit operator bool () const |
186 | { |
187 | return m_rInnerRef.get() != nullptr; |
188 | } |
189 | |
190 | void clear() |
191 | { |
192 | m_rInnerRef.clear(); |
193 | } |
194 | |
195 | void reset() |
196 | { |
197 | m_rInnerRef.clear(); |
198 | } |
199 | |
200 | void disposeAndClear() |
201 | { |
202 | // hold it alive for the lifetime of this method |
203 | ::rtl::Reference<reference_type> aTmp(m_rInnerRef); |
204 | m_rInnerRef.clear(); // we should use some 'swap' method ideally ;-) |
205 | if (aTmp.get()) { |
206 | aTmp->disposeOnce(); |
207 | } |
208 | } |
209 | |
210 | /** Needed to place VclPtr's into STL collection. |
211 | */ |
212 | bool operator< (const VclPtr<reference_type> & handle) const |
213 | { |
214 | return (m_rInnerRef < handle.m_rInnerRef); |
215 | } |
216 | }; // class VclPtr |
217 | |
218 | template<typename T1, typename T2> |
219 | inline bool operator ==(VclPtr<T1> const & p1, VclPtr<T2> const & p2) { |
220 | return p1.get() == p2.get(); |
221 | } |
222 | |
223 | template<typename T> inline bool operator ==(VclPtr<T> const & p1, T const * p2) |
224 | { |
225 | return p1.get() == p2; |
226 | } |
227 | |
228 | template<typename T> inline bool operator ==(VclPtr<T> const & p1, T * p2) { |
229 | return p1.get() == p2; |
230 | } |
231 | |
232 | template<typename T> inline bool operator ==(T const * p1, VclPtr<T> const & p2) |
233 | { |
234 | return p1 == p2.get(); |
235 | } |
236 | |
237 | template<typename T> inline bool operator ==(T * p1, VclPtr<T> const & p2) { |
238 | return p1 == p2.get(); |
239 | } |
240 | |
241 | template<typename T1, typename T2> |
242 | inline bool operator !=(VclPtr<T1> const & p1, VclPtr<T2> const & p2) { |
243 | return !(p1 == p2); |
244 | } |
245 | |
246 | template<typename T> inline bool operator !=(VclPtr<T> const & p1, T const * p2) |
247 | { |
248 | return !(p1 == p2); |
249 | } |
250 | |
251 | template<typename T> inline bool operator !=(VclPtr<T> const & p1, T * p2) { |
252 | return !(p1 == p2); |
253 | } |
254 | |
255 | template<typename T> inline bool operator !=(T const * p1, VclPtr<T> const & p2) |
256 | { |
257 | return !(p1 == p2); |
258 | } |
259 | |
260 | template<typename T> inline bool operator !=(T * p1, VclPtr<T> const & p2) { |
261 | return !(p1 == p2); |
262 | } |
263 | |
264 | /** |
265 | * A construction helper for a temporary VclPtr. Since VclPtr types |
266 | * are created with a reference-count of one - to help fit into |
267 | * the existing code-flow; this helps us to construct them easily. |
268 | * see also VclPtr::Create and ScopedVclPtr |
269 | * |
270 | * For more details on the design please see vcl/README.lifecycle |
271 | * |
272 | * @param reference_type must be a subclass of vcl::Window |
273 | */ |
274 | template <class reference_type> |
275 | class SAL_WARN_UNUSED__attribute__((warn_unused)) VclPtrInstance final : public VclPtr<reference_type> |
276 | { |
277 | public: |
278 | template<typename... Arg> VclPtrInstance(Arg &&... arg) |
279 | : VclPtr<reference_type>( new reference_type(std::forward<Arg>(arg)...), SAL_NO_ACQUIRE ) |
280 | { |
281 | } |
282 | |
283 | /** |
284 | * Override and disallow this, to prevent people accidentally calling it and actually |
285 | * getting VclPtr::Create and getting a naked VclPtr<> instance |
286 | */ |
287 | template<typename... Arg> static VclPtrInstance< reference_type > Create(Arg &&... ) = delete; |
288 | }; |
289 | |
290 | template <class reference_type> |
291 | class ScopedVclPtr : public VclPtr<reference_type> |
292 | { |
293 | public: |
294 | /** Constructor... |
295 | */ |
296 | ScopedVclPtr() |
297 | : VclPtr<reference_type>() |
298 | {} |
299 | |
300 | /** Constructor |
301 | */ |
302 | ScopedVclPtr (reference_type * pBody) |
303 | : VclPtr<reference_type>(pBody) |
304 | {} |
305 | |
306 | /** Copy constructor... |
307 | */ |
308 | ScopedVclPtr (const VclPtr<reference_type> & handle) |
309 | : VclPtr<reference_type>(handle) |
310 | {} |
311 | |
312 | /** |
313 | Assignment that releases the last reference. |
314 | */ |
315 | void disposeAndReset(reference_type *pBody) |
316 | { |
317 | if (pBody != this->get()) { |
318 | VclPtr<reference_type>::disposeAndClear(); |
319 | VclPtr<reference_type>::set(pBody); |
320 | } |
321 | } |
322 | |
323 | /** |
324 | Assignment that releases the last reference. |
325 | */ |
326 | ScopedVclPtr<reference_type>& operator = (reference_type * pBody) |
327 | { |
328 | disposeAndReset(pBody); |
329 | return *this; |
330 | } |
331 | |
332 | /** Up-casting conversion constructor: Copies interface reference. |
333 | |
334 | Does not work for up-casts to ambiguous bases. For the special case of |
335 | up-casting to Reference< XInterface >, see the corresponding conversion |
336 | operator. |
337 | |
338 | @param rRef another reference |
339 | */ |
340 | template< class derived_type > |
341 | ScopedVclPtr( |
342 | const VclPtr< derived_type > & rRef, |
343 | typename std::enable_if< |
344 | std::is_base_of<reference_type, derived_type>::value, int>::type |
345 | = 0 ) |
346 | : VclPtr<reference_type>( rRef ) |
347 | { |
348 | } |
349 | |
350 | /** Up-casting assignment operator. |
351 | |
352 | Does not work for up-casts to ambiguous bases. |
353 | |
354 | @param rRef another VclPtr |
355 | */ |
356 | template<typename derived_type> |
357 | typename std::enable_if< |
358 | std::is_base_of<reference_type, derived_type>::value, |
359 | ScopedVclPtr &>::type |
360 | operator =(VclPtr<derived_type> const & rRef) |
361 | { |
362 | disposeAndReset(rRef.get()); |
363 | return *this; |
364 | } |
365 | |
366 | /** |
367 | * Override and disallow this, to prevent people accidentally calling it and actually |
368 | * getting VclPtr::Create and getting a naked VclPtr<> instance |
369 | */ |
370 | template<typename... Arg> static ScopedVclPtr< reference_type > Create(Arg &&... ) = delete; |
371 | |
372 | ~ScopedVclPtr() |
373 | { |
374 | VclPtr<reference_type>::disposeAndClear(); |
375 | assert(VclPtr<reference_type>::get() == nullptr)(static_cast <bool> (VclPtr<reference_type>::get( ) == nullptr) ? void (0) : __assert_fail ("VclPtr<reference_type>::get() == nullptr" , "/home/maarten/src/libreoffice/core/include/vcl/vclptr.hxx" , 375, __extension__ __PRETTY_FUNCTION__)); // make sure there are no lingering references |
376 | } |
377 | |
378 | private: |
379 | // Most likely we don't want this default copy-constructor. |
380 | ScopedVclPtr (const ScopedVclPtr<reference_type> &) = delete; |
381 | // And certainly we don't want a default assignment operator. |
382 | ScopedVclPtr<reference_type>& operator = (const ScopedVclPtr<reference_type> &) = delete; |
383 | // And disallow reset as that doesn't call disposeAndClear on the original reference |
384 | void reset() = delete; |
385 | void reset(reference_type *pBody) = delete; |
386 | |
387 | protected: |
388 | ScopedVclPtr (reference_type * pBody, __sal_NoAcquire) |
389 | : VclPtr<reference_type>(pBody, SAL_NO_ACQUIRE) |
390 | {} |
391 | }; |
392 | |
393 | /** |
394 | * A construction helper for ScopedVclPtr. Since VclPtr types are created |
395 | * with a reference-count of one - to help fit into the existing |
396 | * code-flow; this helps us to construct them easily. |
397 | * |
398 | * For more details on the design please see vcl/README.lifecycle |
399 | * |
400 | * @param reference_type must be a subclass of vcl::Window |
401 | */ |
402 | #if defined _MSC_VER |
403 | #pragma warning(push) |
404 | #pragma warning(disable: 4521) // " multiple copy constructors specified" |
405 | #endif |
406 | template <class reference_type> |
407 | class SAL_WARN_UNUSED__attribute__((warn_unused)) ScopedVclPtrInstance final : public ScopedVclPtr<reference_type> |
408 | { |
409 | public: |
410 | template<typename... Arg> ScopedVclPtrInstance(Arg &&... arg) |
411 | : ScopedVclPtr<reference_type>( new reference_type(std::forward<Arg>(arg)...), SAL_NO_ACQUIRE ) |
412 | { |
413 | } |
414 | |
415 | /** |
416 | * Override and disallow this, to prevent people accidentally calling it and actually |
417 | * getting VclPtr::Create and getting a naked VclPtr<> instance |
418 | */ |
419 | template<typename... Arg> static ScopedVclPtrInstance< reference_type > Create(Arg &&...) = delete; |
420 | |
421 | private: |
422 | // Prevent the above perfect forwarding ctor from hijacking (accidental) |
423 | // attempts at ScopedVclPtrInstance copy construction (where the hijacking |
424 | // would typically lead to somewhat obscure error messages); both non-const |
425 | // and const variants are needed here, as the ScopedVclPtr base class has a |
426 | // const--variant copy ctor, so the implicitly declared copy ctor for |
427 | // ScopedVclPtrInstance would also be the const variant, so non-const copy |
428 | // construction attempts would be hijacked by the perfect forwarding ctor; |
429 | // but if we only declared a non-const variant here, the const variant would |
430 | // no longer be implicitly declared (as there would already be an explicitly |
431 | // declared copy ctor), so const copy construction attempts would then be |
432 | // hijacked by the perfect forwarding ctor: |
433 | ScopedVclPtrInstance(ScopedVclPtrInstance &) = delete; |
434 | ScopedVclPtrInstance(ScopedVclPtrInstance const &) = delete; |
435 | }; |
436 | #if defined _MSC_VER |
437 | #pragma warning(pop) |
438 | #endif |
439 | |
440 | #endif // INCLUDED_VCL_PTR_HXX |
441 | |
442 | /* vim:set shiftwidth=4 softtabstop=4 expandtab: */ |
1 | /* -*- Mode: C++; tab-width: 4; indent-tabs-mode: nil; c-basic-offset: 4 -*- */ | ||||||||||
2 | /* | ||||||||||
3 | * This file is part of the LibreOffice project. | ||||||||||
4 | * | ||||||||||
5 | * This Source Code Form is subject to the terms of the Mozilla Public | ||||||||||
6 | * License, v. 2.0. If a copy of the MPL was not distributed with this | ||||||||||
7 | * file, You can obtain one at http://mozilla.org/MPL/2.0/. | ||||||||||
8 | * | ||||||||||
9 | * This file incorporates work covered by the following license notice: | ||||||||||
10 | * | ||||||||||
11 | * Licensed to the Apache Software Foundation (ASF) under one or more | ||||||||||
12 | * contributor license agreements. See the NOTICE file distributed | ||||||||||
13 | * with this work for additional information regarding copyright | ||||||||||
14 | * ownership. The ASF licenses this file to you under the Apache | ||||||||||
15 | * License, Version 2.0 (the "License"); you may not use this file | ||||||||||
16 | * except in compliance with the License. You may obtain a copy of | ||||||||||
17 | * the License at http://www.apache.org/licenses/LICENSE-2.0 . | ||||||||||
18 | */ | ||||||||||
19 | |||||||||||
20 | #ifndef INCLUDED_RTL_REF_HXX | ||||||||||
21 | #define INCLUDED_RTL_REF_HXX | ||||||||||
22 | |||||||||||
23 | #include "sal/config.h" | ||||||||||
24 | |||||||||||
25 | #include <cassert> | ||||||||||
26 | #include <cstddef> | ||||||||||
27 | #include <functional> | ||||||||||
28 | #ifdef LIBO_INTERNAL_ONLY1 | ||||||||||
29 | #include <type_traits> | ||||||||||
30 | #endif | ||||||||||
31 | |||||||||||
32 | #include "sal/types.h" | ||||||||||
33 | |||||||||||
34 | namespace rtl | ||||||||||
35 | { | ||||||||||
36 | |||||||||||
37 | /** Template reference class for reference type. | ||||||||||
38 | */ | ||||||||||
39 | template <class reference_type> | ||||||||||
40 | class Reference | ||||||||||
41 | { | ||||||||||
42 | /** The <b>reference_type</b> body pointer. | ||||||||||
43 | */ | ||||||||||
44 | reference_type * m_pBody; | ||||||||||
45 | |||||||||||
46 | |||||||||||
47 | public: | ||||||||||
48 | /** Constructor... | ||||||||||
49 | */ | ||||||||||
50 | Reference() | ||||||||||
51 | : m_pBody (NULL__null) | ||||||||||
52 | {} | ||||||||||
53 | |||||||||||
54 | |||||||||||
55 | /** Constructor... | ||||||||||
56 | */ | ||||||||||
57 | Reference (reference_type * pBody, __sal_NoAcquire) | ||||||||||
58 | : m_pBody (pBody) | ||||||||||
59 | { | ||||||||||
60 | } | ||||||||||
61 | |||||||||||
62 | /** Constructor... | ||||||||||
63 | */ | ||||||||||
64 | Reference (reference_type * pBody) | ||||||||||
65 | : m_pBody (pBody) | ||||||||||
66 | { | ||||||||||
67 | if (m_pBody) | ||||||||||
68 | m_pBody->acquire(); | ||||||||||
69 | } | ||||||||||
70 | |||||||||||
71 | /** Copy constructor... | ||||||||||
72 | */ | ||||||||||
73 | Reference (const Reference<reference_type> & handle) | ||||||||||
74 | : m_pBody (handle.m_pBody) | ||||||||||
75 | { | ||||||||||
76 | if (m_pBody) | ||||||||||
77 | m_pBody->acquire(); | ||||||||||
78 | } | ||||||||||
79 | |||||||||||
80 | #ifdef LIBO_INTERNAL_ONLY1 | ||||||||||
81 | /** Move constructor... | ||||||||||
82 | */ | ||||||||||
83 | Reference (Reference<reference_type> && handle) noexcept | ||||||||||
84 | : m_pBody (handle.m_pBody) | ||||||||||
85 | { | ||||||||||
86 | handle.m_pBody = nullptr; | ||||||||||
87 | } | ||||||||||
88 | #endif | ||||||||||
89 | |||||||||||
90 | #if defined LIBO_INTERNAL_ONLY1 | ||||||||||
91 | /** Up-casting conversion constructor: Copies interface reference. | ||||||||||
92 | |||||||||||
93 | Does not work for up-casts to ambiguous bases. | ||||||||||
94 | |||||||||||
95 | @param rRef another reference | ||||||||||
96 | */ | ||||||||||
97 | template< class derived_type > | ||||||||||
98 | inline Reference( | ||||||||||
99 | const Reference< derived_type > & rRef, | ||||||||||
100 | std::enable_if_t<std::is_base_of_v<reference_type, derived_type>, int> = 0 ) | ||||||||||
101 | : m_pBody (rRef.get()) | ||||||||||
102 | { | ||||||||||
103 | if (m_pBody) | ||||||||||
104 | m_pBody->acquire(); | ||||||||||
105 | } | ||||||||||
106 | #endif | ||||||||||
107 | |||||||||||
108 | /** Destructor... | ||||||||||
109 | */ | ||||||||||
110 | ~Reference() COVERITY_NOEXCEPT_FALSE | ||||||||||
111 | { | ||||||||||
112 | if (m_pBody) | ||||||||||
113 | m_pBody->release(); | ||||||||||
114 | } | ||||||||||
115 | |||||||||||
116 | /** Set... | ||||||||||
117 | Similar to assignment. | ||||||||||
118 | */ | ||||||||||
119 | Reference<reference_type> & | ||||||||||
120 | SAL_CALL set (reference_type * pBody) | ||||||||||
121 | { | ||||||||||
122 | if (pBody) | ||||||||||
123 | pBody->acquire(); | ||||||||||
124 | reference_type * const pOld = m_pBody; | ||||||||||
125 | m_pBody = pBody; | ||||||||||
126 | if (pOld) | ||||||||||
127 | pOld->release(); | ||||||||||
128 | return *this; | ||||||||||
129 | } | ||||||||||
130 | |||||||||||
131 | /** Assignment. | ||||||||||
132 | Unbinds this instance from its body (if bound) and | ||||||||||
133 | bind it to the body represented by the handle. | ||||||||||
134 | */ | ||||||||||
135 | Reference<reference_type> & | ||||||||||
136 | SAL_CALL operator= (const Reference<reference_type> & handle) | ||||||||||
137 | { | ||||||||||
138 | return set( handle.m_pBody ); | ||||||||||
139 | } | ||||||||||
140 | |||||||||||
141 | #ifdef LIBO_INTERNAL_ONLY1 | ||||||||||
142 | /** Assignment. | ||||||||||
143 | * Unbinds this instance from its body (if bound), | ||||||||||
144 | * bind it to the body represented by the handle, and | ||||||||||
145 | * set the body represented by the handle to nullptr. | ||||||||||
146 | */ | ||||||||||
147 | Reference<reference_type> & | ||||||||||
148 | operator= (Reference<reference_type> && handle) | ||||||||||
149 | { | ||||||||||
150 | // self-movement guts ourself | ||||||||||
151 | if (m_pBody) | ||||||||||
152 | m_pBody->release(); | ||||||||||
153 | m_pBody = handle.m_pBody; | ||||||||||
154 | handle.m_pBody = nullptr; | ||||||||||
155 | return *this; | ||||||||||
156 | } | ||||||||||
157 | #endif | ||||||||||
158 | |||||||||||
159 | /** Assignment... | ||||||||||
160 | */ | ||||||||||
161 | Reference<reference_type> & | ||||||||||
162 | SAL_CALL operator= (reference_type * pBody) | ||||||||||
163 | { | ||||||||||
164 | return set( pBody ); | ||||||||||
165 | } | ||||||||||
166 | |||||||||||
167 | /** Unbind the body from this handle. | ||||||||||
168 | Note that for a handle representing a large body, | ||||||||||
169 | "handle.clear().set(new body());" _might_ | ||||||||||
170 | perform a little bit better than "handle.set(new body());", | ||||||||||
171 | since in the second case two large objects exist in memory | ||||||||||
172 | (the old body and the new body). | ||||||||||
173 | */ | ||||||||||
174 | Reference<reference_type> & SAL_CALL clear() | ||||||||||
175 | { | ||||||||||
176 | if (m_pBody
| ||||||||||
177 | { | ||||||||||
178 | reference_type * const pOld = m_pBody; | ||||||||||
179 | m_pBody = NULL__null; | ||||||||||
180 | pOld->release(); | ||||||||||
181 | } | ||||||||||
182 | return *this; | ||||||||||
183 | } | ||||||||||
184 | |||||||||||
185 | |||||||||||
186 | /** Get the body. Can be used instead of operator->(). | ||||||||||
187 | I.e. handle->someBodyOp() and handle.get()->someBodyOp() | ||||||||||
188 | are the same. | ||||||||||
189 | */ | ||||||||||
190 | reference_type * SAL_CALL get() const | ||||||||||
191 | { | ||||||||||
192 | return m_pBody; | ||||||||||
| |||||||||||
193 | } | ||||||||||
194 | |||||||||||
195 | |||||||||||
196 | /** Probably most common used: handle->someBodyOp(). | ||||||||||
197 | */ | ||||||||||
198 | reference_type * SAL_CALL operator->() const | ||||||||||
199 | { | ||||||||||
200 | assert(m_pBody != NULL)(static_cast <bool> (m_pBody != __null) ? void (0) : __assert_fail ("m_pBody != NULL", "/home/maarten/src/libreoffice/core/include/rtl/ref.hxx" , 200, __extension__ __PRETTY_FUNCTION__)); | ||||||||||
201 | return m_pBody; | ||||||||||
202 | } | ||||||||||
203 | |||||||||||
204 | |||||||||||
205 | /** Allows (*handle).someBodyOp(). | ||||||||||
206 | */ | ||||||||||
207 | reference_type & SAL_CALL operator*() const | ||||||||||
208 | { | ||||||||||
209 | assert(m_pBody != NULL)(static_cast <bool> (m_pBody != __null) ? void (0) : __assert_fail ("m_pBody != NULL", "/home/maarten/src/libreoffice/core/include/rtl/ref.hxx" , 209, __extension__ __PRETTY_FUNCTION__)); | ||||||||||
210 | return *m_pBody; | ||||||||||
211 | } | ||||||||||
212 | |||||||||||
213 | |||||||||||
214 | /** Returns True if the handle does point to a valid body. | ||||||||||
215 | */ | ||||||||||
216 | bool SAL_CALL is() const | ||||||||||
217 | { | ||||||||||
218 | return (m_pBody != NULL__null); | ||||||||||
219 | } | ||||||||||
220 | |||||||||||
221 | #if defined LIBO_INTERNAL_ONLY1 | ||||||||||
222 | /** Returns True if the handle does point to a valid body. | ||||||||||
223 | */ | ||||||||||
224 | explicit operator bool() const | ||||||||||
225 | { | ||||||||||
226 | return is(); | ||||||||||
227 | } | ||||||||||
228 | #endif | ||||||||||
229 | |||||||||||
230 | /** Returns True if this points to pBody. | ||||||||||
231 | */ | ||||||||||
232 | bool SAL_CALL operator== (const reference_type * pBody) const | ||||||||||
233 | { | ||||||||||
234 | return (m_pBody == pBody); | ||||||||||
235 | } | ||||||||||
236 | |||||||||||
237 | |||||||||||
238 | /** Returns True if handle points to the same body. | ||||||||||
239 | */ | ||||||||||
240 | bool | ||||||||||
241 | SAL_CALL operator== (const Reference<reference_type> & handle) const | ||||||||||
242 | { | ||||||||||
243 | return (m_pBody == handle.m_pBody); | ||||||||||
244 | } | ||||||||||
245 | |||||||||||
246 | |||||||||||
247 | /** Needed to place References into STL collection. | ||||||||||
248 | */ | ||||||||||
249 | bool | ||||||||||
250 | SAL_CALL operator!= (const Reference<reference_type> & handle) const | ||||||||||
251 | { | ||||||||||
252 | return (m_pBody != handle.m_pBody); | ||||||||||
253 | } | ||||||||||
254 | |||||||||||
255 | |||||||||||
256 | /** Needed to place References into STL collection. | ||||||||||
257 | */ | ||||||||||
258 | bool | ||||||||||
259 | SAL_CALL operator< (const Reference<reference_type> & handle) const | ||||||||||
260 | { | ||||||||||
261 | return (m_pBody < handle.m_pBody); | ||||||||||
262 | } | ||||||||||
263 | |||||||||||
264 | |||||||||||
265 | /** Needed to place References into STL collection. | ||||||||||
266 | */ | ||||||||||
267 | bool | ||||||||||
268 | SAL_CALL operator> (const Reference<reference_type> & handle) const | ||||||||||
269 | { | ||||||||||
270 | return (m_pBody > handle.m_pBody); | ||||||||||
271 | } | ||||||||||
272 | }; | ||||||||||
273 | |||||||||||
274 | } // namespace rtl | ||||||||||
275 | |||||||||||
276 | #if defined LIBO_INTERNAL_ONLY1 | ||||||||||
277 | namespace std | ||||||||||
278 | { | ||||||||||
279 | |||||||||||
280 | /// @cond INTERNAL | ||||||||||
281 | /** | ||||||||||
282 | Make rtl::Reference hashable by default for use in STL containers. | ||||||||||
283 | |||||||||||
284 | @since LibreOffice 6.3 | ||||||||||
285 | */ | ||||||||||
286 | template<typename T> | ||||||||||
287 | struct hash<::rtl::Reference<T>> | ||||||||||
288 | { | ||||||||||
289 | std::size_t operator()(::rtl::Reference<T> const & s) const | ||||||||||
290 | { return std::size_t(s.get()); } | ||||||||||
291 | }; | ||||||||||
292 | /// @endcond | ||||||||||
293 | |||||||||||
294 | } | ||||||||||
295 | |||||||||||
296 | #endif | ||||||||||
297 | |||||||||||
298 | #endif /* ! INCLUDED_RTL_REF_HXX */ | ||||||||||
299 | |||||||||||
300 | /* vim:set shiftwidth=4 softtabstop=4 expandtab: */ |
1 | /* -*- Mode: C++; tab-width: 4; indent-tabs-mode: nil; c-basic-offset: 4 -*- */ |
2 | /* |
3 | * This file is part of the LibreOffice project. |
4 | * |
5 | * This Source Code Form is subject to the terms of the Mozilla Public |
6 | * License, v. 2.0. If a copy of the MPL was not distributed with this |
7 | * file, You can obtain one at http://mozilla.org/MPL/2.0/. |
8 | * |
9 | * This file incorporates work covered by the following license notice: |
10 | * |
11 | * Licensed to the Apache Software Foundation (ASF) under one or more |
12 | * contributor license agreements. See the NOTICE file distributed |
13 | * with this work for additional information regarding copyright |
14 | * ownership. The ASF licenses this file to you under the Apache |
15 | * License, Version 2.0 (the "License"); you may not use this file |
16 | * except in compliance with the License. You may obtain a copy of |
17 | * the License at http://www.apache.org/licenses/LICENSE-2.0 . |
18 | */ |
19 | #ifndef INCLUDED_VCL_Reference_HXX |
20 | #define INCLUDED_VCL_Reference_HXX |
21 | |
22 | #include <vcl/dllapi.h> |
23 | #include <osl/interlck.h> |
24 | |
25 | class VCL_DLLPUBLIC__attribute__ ((visibility("default"))) VclReferenceBase |
26 | { |
27 | mutable oslInterlockedCount mnRefCnt; |
28 | |
29 | template<typename T> friend class VclPtr; |
30 | |
31 | public: |
32 | void acquire() const |
33 | { |
34 | osl_atomic_increment(&mnRefCnt)__sync_add_and_fetch((&mnRefCnt), 1); |
35 | } |
36 | |
37 | void release() const |
38 | { |
39 | if (osl_atomic_decrement(&mnRefCnt)__sync_sub_and_fetch((&mnRefCnt), 1) == 0) |
40 | delete this; |
41 | } |
42 | #ifdef DBG_UTIL |
43 | #ifndef _WIN32 |
44 | sal_Int32 getRefCount() const { return mnRefCnt; } |
45 | #endif |
46 | #endif |
47 | |
48 | |
49 | private: |
50 | VclReferenceBase(const VclReferenceBase&) = delete; |
51 | VclReferenceBase& operator=(const VclReferenceBase&) = delete; |
52 | |
53 | bool mbDisposed : 1; |
54 | |
55 | protected: |
56 | VclReferenceBase(); |
57 | protected: |
58 | virtual ~VclReferenceBase(); |
59 | |
60 | protected: |
61 | virtual void dispose(); |
62 | |
63 | public: |
64 | void disposeOnce(); |
65 | bool isDisposed() const { return mbDisposed; } |
66 | |
67 | }; |
68 | #endif |