Bug Summary

File:build/llvm-toolchain-snapshot-16~++20221003111214+1fa2019828ca/llvm/lib/Option/OptTable.cpp
Warning:line 507, column 1
Potential leak of memory pointed to by field '_M_head_impl'

Annotated Source Code

Press '?' to see keyboard shortcuts

clang -cc1 -cc1 -triple x86_64-pc-linux-gnu -analyze -disable-free -clear-ast-before-backend -disable-llvm-verifier -discard-value-names -main-file-name OptTable.cpp -analyzer-checker=core -analyzer-checker=apiModeling -analyzer-checker=unix -analyzer-checker=deadcode -analyzer-checker=cplusplus -analyzer-checker=security.insecureAPI.UncheckedReturn -analyzer-checker=security.insecureAPI.getpw -analyzer-checker=security.insecureAPI.gets -analyzer-checker=security.insecureAPI.mktemp -analyzer-checker=security.insecureAPI.mkstemp -analyzer-checker=security.insecureAPI.vfork -analyzer-checker=nullability.NullPassedToNonnull -analyzer-checker=nullability.NullReturnedFromNonnull -analyzer-output plist -w -setup-static-analyzer -analyzer-config-compatibility-mode=true -mrelocation-model pic -pic-level 2 -mframe-pointer=none -fmath-errno -ffp-contract=on -fno-rounding-math -mconstructor-aliases -funwind-tables=2 -target-cpu x86-64 -tune-cpu generic -debugger-tuning=gdb -ffunction-sections -fdata-sections -fcoverage-compilation-dir=/build/llvm-toolchain-snapshot-16~++20221003111214+1fa2019828ca/build-llvm -resource-dir /usr/lib/llvm-16/lib/clang/16.0.0 -D _DEBUG -D _GNU_SOURCE -D __STDC_CONSTANT_MACROS -D __STDC_FORMAT_MACROS -D __STDC_LIMIT_MACROS -I lib/Option -I /build/llvm-toolchain-snapshot-16~++20221003111214+1fa2019828ca/llvm/lib/Option -I include -I /build/llvm-toolchain-snapshot-16~++20221003111214+1fa2019828ca/llvm/include -D _FORTIFY_SOURCE=2 -D NDEBUG -U NDEBUG -internal-isystem /usr/lib/gcc/x86_64-linux-gnu/10/../../../../include/c++/10 -internal-isystem /usr/lib/gcc/x86_64-linux-gnu/10/../../../../include/x86_64-linux-gnu/c++/10 -internal-isystem /usr/lib/gcc/x86_64-linux-gnu/10/../../../../include/c++/10/backward -internal-isystem /usr/lib/llvm-16/lib/clang/16.0.0/include -internal-isystem /usr/local/include -internal-isystem /usr/lib/gcc/x86_64-linux-gnu/10/../../../../x86_64-linux-gnu/include -internal-externc-isystem /usr/include/x86_64-linux-gnu -internal-externc-isystem /include -internal-externc-isystem /usr/include -fmacro-prefix-map=/build/llvm-toolchain-snapshot-16~++20221003111214+1fa2019828ca/build-llvm=build-llvm -fmacro-prefix-map=/build/llvm-toolchain-snapshot-16~++20221003111214+1fa2019828ca/= -fcoverage-prefix-map=/build/llvm-toolchain-snapshot-16~++20221003111214+1fa2019828ca/build-llvm=build-llvm -fcoverage-prefix-map=/build/llvm-toolchain-snapshot-16~++20221003111214+1fa2019828ca/= -O3 -Wno-unused-command-line-argument -Wno-unused-parameter -Wwrite-strings -Wno-missing-field-initializers -Wno-long-long -Wno-maybe-uninitialized -Wno-class-memaccess -Wno-redundant-move -Wno-pessimizing-move -Wno-noexcept-type -Wno-comment -Wno-misleading-indentation -std=c++17 -fdeprecated-macro -fdebug-compilation-dir=/build/llvm-toolchain-snapshot-16~++20221003111214+1fa2019828ca/build-llvm -fdebug-prefix-map=/build/llvm-toolchain-snapshot-16~++20221003111214+1fa2019828ca/build-llvm=build-llvm -fdebug-prefix-map=/build/llvm-toolchain-snapshot-16~++20221003111214+1fa2019828ca/= -ferror-limit 19 -fvisibility-inlines-hidden -stack-protector 2 -fgnuc-version=4.2.1 -fcolor-diagnostics -vectorize-loops -vectorize-slp -analyzer-output=html -analyzer-config stable-report-filename=true -faddrsig -D__GCC_HAVE_DWARF2_CFI_ASM=1 -o /tmp/scan-build-2022-10-03-140002-15933-1 -x c++ /build/llvm-toolchain-snapshot-16~++20221003111214+1fa2019828ca/llvm/lib/Option/OptTable.cpp

/build/llvm-toolchain-snapshot-16~++20221003111214+1fa2019828ca/llvm/lib/Option/OptTable.cpp

1//===- OptTable.cpp - Option Table Implementation -------------------------===//
2//
3// Part of the LLVM Project, under the Apache License v2.0 with LLVM Exceptions.
4// See https://llvm.org/LICENSE.txt for license information.
5// SPDX-License-Identifier: Apache-2.0 WITH LLVM-exception
6//
7//===----------------------------------------------------------------------===//
8
9#include "llvm/Option/OptTable.h"
10#include "llvm/ADT/STLExtras.h"
11#include "llvm/ADT/StringRef.h"
12#include "llvm/ADT/StringSet.h"
13#include "llvm/Option/Arg.h"
14#include "llvm/Option/ArgList.h"
15#include "llvm/Option/OptSpecifier.h"
16#include "llvm/Option/Option.h"
17#include "llvm/Support/CommandLine.h" // for expandResponseFiles
18#include "llvm/Support/Compiler.h"
19#include "llvm/Support/ErrorHandling.h"
20#include "llvm/Support/raw_ostream.h"
21#include <algorithm>
22#include <cassert>
23#include <cctype>
24#include <cstring>
25#include <map>
26#include <string>
27#include <utility>
28#include <vector>
29
30using namespace llvm;
31using namespace llvm::opt;
32
33namespace llvm {
34namespace opt {
35
36// Ordering on Info. The ordering is *almost* case-insensitive lexicographic,
37// with an exception. '\0' comes at the end of the alphabet instead of the
38// beginning (thus options precede any other options which prefix them).
39static int StrCmpOptionNameIgnoreCase(const char *A, const char *B) {
40 const char *X = A, *Y = B;
41 char a = tolower(*A), b = tolower(*B);
42 while (a == b) {
43 if (a == '\0')
44 return 0;
45
46 a = tolower(*++X);
47 b = tolower(*++Y);
48 }
49
50 if (a == '\0') // A is a prefix of B.
51 return 1;
52 if (b == '\0') // B is a prefix of A.
53 return -1;
54
55 // Otherwise lexicographic.
56 return (a < b) ? -1 : 1;
57}
58
59#ifndef NDEBUG
60static int StrCmpOptionName(const char *A, const char *B) {
61 if (int N = StrCmpOptionNameIgnoreCase(A, B))
62 return N;
63 return strcmp(A, B);
64}
65
66static inline bool operator<(const OptTable::Info &A, const OptTable::Info &B) {
67 if (&A == &B)
68 return false;
69
70 if (int N = StrCmpOptionName(A.Name, B.Name))
71 return N < 0;
72
73 for (const char * const *APre = A.Prefixes,
74 * const *BPre = B.Prefixes;
75 *APre != nullptr && *BPre != nullptr; ++APre, ++BPre){
76 if (int N = StrCmpOptionName(*APre, *BPre))
77 return N < 0;
78 }
79
80 // Names are the same, check that classes are in order; exactly one
81 // should be joined, and it should succeed the other.
82 assert(((A.Kind == Option::JoinedClass) ^ (B.Kind == Option::JoinedClass)) &&(static_cast <bool> (((A.Kind == Option::JoinedClass) ^
(B.Kind == Option::JoinedClass)) && "Unexpected classes for options with same name."
) ? void (0) : __assert_fail ("((A.Kind == Option::JoinedClass) ^ (B.Kind == Option::JoinedClass)) && \"Unexpected classes for options with same name.\""
, "llvm/lib/Option/OptTable.cpp", 83, __extension__ __PRETTY_FUNCTION__
))
83 "Unexpected classes for options with same name.")(static_cast <bool> (((A.Kind == Option::JoinedClass) ^
(B.Kind == Option::JoinedClass)) && "Unexpected classes for options with same name."
) ? void (0) : __assert_fail ("((A.Kind == Option::JoinedClass) ^ (B.Kind == Option::JoinedClass)) && \"Unexpected classes for options with same name.\""
, "llvm/lib/Option/OptTable.cpp", 83, __extension__ __PRETTY_FUNCTION__
))
;
84 return B.Kind == Option::JoinedClass;
85}
86#endif
87
88// Support lower_bound between info and an option name.
89static inline bool operator<(const OptTable::Info &I, const char *Name) {
90 return StrCmpOptionNameIgnoreCase(I.Name, Name) < 0;
91}
92
93} // end namespace opt
94} // end namespace llvm
95
96OptSpecifier::OptSpecifier(const Option *Opt) : ID(Opt->getID()) {}
97
98OptTable::OptTable(ArrayRef<Info> OptionInfos, bool IgnoreCase)
99 : OptionInfos(OptionInfos), IgnoreCase(IgnoreCase) {
100 // Explicitly zero initialize the error to work around a bug in array
101 // value-initialization on MinGW with gcc 4.3.5.
102
103 // Find start of normal options.
104 for (unsigned i = 0, e = getNumOptions(); i != e; ++i) {
105 unsigned Kind = getInfo(i + 1).Kind;
106 if (Kind == Option::InputClass) {
107 assert(!InputOptionID && "Cannot have multiple input options!")(static_cast <bool> (!InputOptionID && "Cannot have multiple input options!"
) ? void (0) : __assert_fail ("!InputOptionID && \"Cannot have multiple input options!\""
, "llvm/lib/Option/OptTable.cpp", 107, __extension__ __PRETTY_FUNCTION__
))
;
108 InputOptionID = getInfo(i + 1).ID;
109 } else if (Kind == Option::UnknownClass) {
110 assert(!UnknownOptionID && "Cannot have multiple unknown options!")(static_cast <bool> (!UnknownOptionID && "Cannot have multiple unknown options!"
) ? void (0) : __assert_fail ("!UnknownOptionID && \"Cannot have multiple unknown options!\""
, "llvm/lib/Option/OptTable.cpp", 110, __extension__ __PRETTY_FUNCTION__
))
;
111 UnknownOptionID = getInfo(i + 1).ID;
112 } else if (Kind != Option::GroupClass) {
113 FirstSearchableIndex = i;
114 break;
115 }
116 }
117 assert(FirstSearchableIndex != 0 && "No searchable options?")(static_cast <bool> (FirstSearchableIndex != 0 &&
"No searchable options?") ? void (0) : __assert_fail ("FirstSearchableIndex != 0 && \"No searchable options?\""
, "llvm/lib/Option/OptTable.cpp", 117, __extension__ __PRETTY_FUNCTION__
))
;
118
119#ifndef NDEBUG
120 // Check that everything after the first searchable option is a
121 // regular option class.
122 for (unsigned i = FirstSearchableIndex, e = getNumOptions(); i != e; ++i) {
123 Option::OptionClass Kind = (Option::OptionClass) getInfo(i + 1).Kind;
124 assert((Kind != Option::InputClass && Kind != Option::UnknownClass &&(static_cast <bool> ((Kind != Option::InputClass &&
Kind != Option::UnknownClass && Kind != Option::GroupClass
) && "Special options should be defined first!") ? void
(0) : __assert_fail ("(Kind != Option::InputClass && Kind != Option::UnknownClass && Kind != Option::GroupClass) && \"Special options should be defined first!\""
, "llvm/lib/Option/OptTable.cpp", 126, __extension__ __PRETTY_FUNCTION__
))
125 Kind != Option::GroupClass) &&(static_cast <bool> ((Kind != Option::InputClass &&
Kind != Option::UnknownClass && Kind != Option::GroupClass
) && "Special options should be defined first!") ? void
(0) : __assert_fail ("(Kind != Option::InputClass && Kind != Option::UnknownClass && Kind != Option::GroupClass) && \"Special options should be defined first!\""
, "llvm/lib/Option/OptTable.cpp", 126, __extension__ __PRETTY_FUNCTION__
))
126 "Special options should be defined first!")(static_cast <bool> ((Kind != Option::InputClass &&
Kind != Option::UnknownClass && Kind != Option::GroupClass
) && "Special options should be defined first!") ? void
(0) : __assert_fail ("(Kind != Option::InputClass && Kind != Option::UnknownClass && Kind != Option::GroupClass) && \"Special options should be defined first!\""
, "llvm/lib/Option/OptTable.cpp", 126, __extension__ __PRETTY_FUNCTION__
))
;
127 }
128
129 // Check that options are in order.
130 for (unsigned i = FirstSearchableIndex + 1, e = getNumOptions(); i != e; ++i){
131 if (!(getInfo(i) < getInfo(i + 1))) {
132 getOption(i).dump();
133 getOption(i + 1).dump();
134 llvm_unreachable("Options are not in order!")::llvm::llvm_unreachable_internal("Options are not in order!"
, "llvm/lib/Option/OptTable.cpp", 134)
;
135 }
136 }
137#endif
138
139 // Build prefixes.
140 for (unsigned i = FirstSearchableIndex + 1, e = getNumOptions() + 1;
141 i != e; ++i) {
142 if (const char *const *P = getInfo(i).Prefixes) {
143 for (; *P != nullptr; ++P) {
144 PrefixesUnion.insert(*P);
145 }
146 }
147 }
148
149 // Build prefix chars.
150 for (StringSet<>::const_iterator I = PrefixesUnion.begin(),
151 E = PrefixesUnion.end(); I != E; ++I) {
152 StringRef Prefix = I->getKey();
153 for (char C : Prefix)
154 if (!is_contained(PrefixChars, C))
155 PrefixChars.push_back(C);
156 }
157}
158
159OptTable::~OptTable() = default;
160
161const Option OptTable::getOption(OptSpecifier Opt) const {
162 unsigned id = Opt.getID();
163 if (id == 0)
164 return Option(nullptr, nullptr);
165 assert((unsigned) (id - 1) < getNumOptions() && "Invalid ID.")(static_cast <bool> ((unsigned) (id - 1) < getNumOptions
() && "Invalid ID.") ? void (0) : __assert_fail ("(unsigned) (id - 1) < getNumOptions() && \"Invalid ID.\""
, "llvm/lib/Option/OptTable.cpp", 165, __extension__ __PRETTY_FUNCTION__
))
;
166 return Option(&getInfo(id), this);
167}
168
169static bool isInput(const StringSet<> &Prefixes, StringRef Arg) {
170 if (Arg == "-")
171 return true;
172 for (StringSet<>::const_iterator I = Prefixes.begin(),
173 E = Prefixes.end(); I != E; ++I)
174 if (Arg.startswith(I->getKey()))
175 return false;
176 return true;
177}
178
179/// \returns Matched size. 0 means no match.
180static unsigned matchOption(const OptTable::Info *I, StringRef Str,
181 bool IgnoreCase) {
182 for (const char * const *Pre = I->Prefixes; *Pre != nullptr; ++Pre) {
183 StringRef Prefix(*Pre);
184 if (Str.startswith(Prefix)) {
185 StringRef Rest = Str.substr(Prefix.size());
186 bool Matched = IgnoreCase ? Rest.startswith_insensitive(I->Name)
187 : Rest.startswith(I->Name);
188 if (Matched)
189 return Prefix.size() + StringRef(I->Name).size();
190 }
191 }
192 return 0;
193}
194
195// Returns true if one of the Prefixes + In.Names matches Option
196static bool optionMatches(const OptTable::Info &In, StringRef Option) {
197 if (In.Prefixes) {
198 StringRef InName(In.Name);
199 for (size_t I = 0; In.Prefixes[I]; I++)
200 if (Option.endswith(InName))
201 if (Option.slice(0, Option.size() - InName.size()) == In.Prefixes[I])
202 return true;
203 }
204 return false;
205}
206
207// This function is for flag value completion.
208// Eg. When "-stdlib=" and "l" was passed to this function, it will return
209// appropiriate values for stdlib, which starts with l.
210std::vector<std::string>
211OptTable::suggestValueCompletions(StringRef Option, StringRef Arg) const {
212 // Search all options and return possible values.
213 for (size_t I = FirstSearchableIndex, E = OptionInfos.size(); I < E; I++) {
214 const Info &In = OptionInfos[I];
215 if (!In.Values || !optionMatches(In, Option))
216 continue;
217
218 SmallVector<StringRef, 8> Candidates;
219 StringRef(In.Values).split(Candidates, ",", -1, false);
220
221 std::vector<std::string> Result;
222 for (StringRef Val : Candidates)
223 if (Val.startswith(Arg) && Arg.compare(Val))
224 Result.push_back(std::string(Val));
225 return Result;
226 }
227 return {};
228}
229
230std::vector<std::string>
231OptTable::findByPrefix(StringRef Cur, unsigned int DisableFlags) const {
232 std::vector<std::string> Ret;
233 for (size_t I = FirstSearchableIndex, E = OptionInfos.size(); I < E; I++) {
234 const Info &In = OptionInfos[I];
235 if (!In.Prefixes || (!In.HelpText && !In.GroupID))
236 continue;
237 if (In.Flags & DisableFlags)
238 continue;
239
240 for (int I = 0; In.Prefixes[I]; I++) {
241 std::string S = std::string(In.Prefixes[I]) + std::string(In.Name) + "\t";
242 if (In.HelpText)
243 S += In.HelpText;
244 if (StringRef(S).startswith(Cur) && S != std::string(Cur) + "\t")
245 Ret.push_back(S);
246 }
247 }
248 return Ret;
249}
250
251unsigned OptTable::findNearest(StringRef Option, std::string &NearestString,
252 unsigned FlagsToInclude, unsigned FlagsToExclude,
253 unsigned MinimumLength) const {
254 assert(!Option.empty())(static_cast <bool> (!Option.empty()) ? void (0) : __assert_fail
("!Option.empty()", "llvm/lib/Option/OptTable.cpp", 254, __extension__
__PRETTY_FUNCTION__))
;
255
256 // Consider each [option prefix + option name] pair as a candidate, finding
257 // the closest match.
258 unsigned BestDistance = UINT_MAX(2147483647 *2U +1U);
259 for (const Info &CandidateInfo :
260 ArrayRef<Info>(OptionInfos).drop_front(FirstSearchableIndex)) {
261 StringRef CandidateName = CandidateInfo.Name;
262
263 // We can eliminate some option prefix/name pairs as candidates right away:
264 // * Ignore option candidates with empty names, such as "--", or names
265 // that do not meet the minimum length.
266 if (CandidateName.empty() || CandidateName.size() < MinimumLength)
267 continue;
268
269 // * If FlagsToInclude were specified, ignore options that don't include
270 // those flags.
271 if (FlagsToInclude && !(CandidateInfo.Flags & FlagsToInclude))
272 continue;
273 // * Ignore options that contain the FlagsToExclude.
274 if (CandidateInfo.Flags & FlagsToExclude)
275 continue;
276
277 // * Ignore positional argument option candidates (which do not
278 // have prefixes).
279 if (!CandidateInfo.Prefixes)
280 continue;
281
282 // Now check if the candidate ends with a character commonly used when
283 // delimiting an option from its value, such as '=' or ':'. If it does,
284 // attempt to split the given option based on that delimiter.
285 StringRef LHS, RHS;
286 char Last = CandidateName.back();
287 bool CandidateHasDelimiter = Last == '=' || Last == ':';
288 std::string NormalizedName = std::string(Option);
289 if (CandidateHasDelimiter) {
290 std::tie(LHS, RHS) = Option.split(Last);
291 NormalizedName = std::string(LHS);
292 if (Option.find(Last) == LHS.size())
293 NormalizedName += Last;
294 }
295
296 // Consider each possible prefix for each candidate to find the most
297 // appropriate one. For example, if a user asks for "--helm", suggest
298 // "--help" over "-help".
299 for (int P = 0;
300 const char *const CandidatePrefix = CandidateInfo.Prefixes[P]; P++) {
301 std::string Candidate = (CandidatePrefix + CandidateName).str();
302 StringRef CandidateRef = Candidate;
303 unsigned Distance =
304 CandidateRef.edit_distance(NormalizedName, /*AllowReplacements=*/true,
305 /*MaxEditDistance=*/BestDistance);
306 if (RHS.empty() && CandidateHasDelimiter) {
307 // The Candidate ends with a = or : delimiter, but the option passed in
308 // didn't contain the delimiter (or doesn't have anything after it).
309 // In that case, penalize the correction: `-nodefaultlibs` is more
310 // likely to be a spello for `-nodefaultlib` than `-nodefaultlib:` even
311 // though both have an unmodified editing distance of 1, since the
312 // latter would need an argument.
313 ++Distance;
314 }
315 if (Distance < BestDistance) {
316 BestDistance = Distance;
317 NearestString = (Candidate + RHS).str();
318 }
319 }
320 }
321 return BestDistance;
322}
323
324bool OptTable::addValues(const char *Option, const char *Values) {
325 for (size_t I = FirstSearchableIndex, E = OptionInfos.size(); I < E; I++) {
326 Info &In = OptionInfos[I];
327 if (optionMatches(In, Option)) {
328 In.Values = Values;
329 return true;
330 }
331 }
332 return false;
333}
334
335// Parse a single argument, return the new argument, and update Index. If
336// GroupedShortOptions is true, -a matches "-abc" and the argument in Args will
337// be updated to "-bc". This overload does not support
338// FlagsToInclude/FlagsToExclude or case insensitive options.
339std::unique_ptr<Arg> OptTable::parseOneArgGrouped(InputArgList &Args,
340 unsigned &Index) const {
341 // Anything that doesn't start with PrefixesUnion is an input, as is '-'
342 // itself.
343 const char *CStr = Args.getArgString(Index);
344 StringRef Str(CStr);
345 if (isInput(PrefixesUnion, Str))
346 return std::make_unique<Arg>(getOption(InputOptionID), Str, Index++, CStr);
347
348 const Info *End = OptionInfos.data() + OptionInfos.size();
349 StringRef Name = Str.ltrim(PrefixChars);
350 const Info *Start = std::lower_bound(
351 OptionInfos.data() + FirstSearchableIndex, End, Name.data());
352 const Info *Fallback = nullptr;
353 unsigned Prev = Index;
354
355 // Search for the option which matches Str.
356 for (; Start != End; ++Start) {
357 unsigned ArgSize = matchOption(Start, Str, IgnoreCase);
358 if (!ArgSize)
359 continue;
360
361 Option Opt(Start, this);
362 if (std::unique_ptr<Arg> A =
363 Opt.accept(Args, StringRef(Args.getArgString(Index), ArgSize),
364 /*GroupedShortOption=*/false, Index))
365 return A;
366
367 // If Opt is a Flag of length 2 (e.g. "-a"), we know it is a prefix of
368 // the current argument (e.g. "-abc"). Match it as a fallback if no longer
369 // option (e.g. "-ab") exists.
370 if (ArgSize == 2 && Opt.getKind() == Option::FlagClass)
371 Fallback = Start;
372
373 // Otherwise, see if the argument is missing.
374 if (Prev != Index)
375 return nullptr;
376 }
377 if (Fallback) {
378 Option Opt(Fallback, this);
379 // Check that the last option isn't a flag wrongly given an argument.
380 if (Str[2] == '=')
381 return std::make_unique<Arg>(getOption(UnknownOptionID), Str, Index++,
382 CStr);
383
384 if (std::unique_ptr<Arg> A = Opt.accept(
385 Args, Str.substr(0, 2), /*GroupedShortOption=*/true, Index)) {
386 Args.replaceArgString(Index, Twine('-') + Str.substr(2));
387 return A;
388 }
389 }
390
391 // In the case of an incorrect short option extract the character and move to
392 // the next one.
393 if (Str[1] != '-') {
394 CStr = Args.MakeArgString(Str.substr(0, 2));
395 Args.replaceArgString(Index, Twine('-') + Str.substr(2));
396 return std::make_unique<Arg>(getOption(UnknownOptionID), CStr, Index, CStr);
397 }
398
399 return std::make_unique<Arg>(getOption(UnknownOptionID), Str, Index++, CStr);
400}
401
402std::unique_ptr<Arg> OptTable::ParseOneArg(const ArgList &Args, unsigned &Index,
403 unsigned FlagsToInclude,
404 unsigned FlagsToExclude) const {
405 unsigned Prev = Index;
406 const char *Str = Args.getArgString(Index);
407
408 // Anything that doesn't start with PrefixesUnion is an input, as is '-'
409 // itself.
410 if (isInput(PrefixesUnion, Str))
11
Assuming the condition is true
12
Taking true branch
411 return std::make_unique<Arg>(getOption(InputOptionID), Str, Index++, Str);
13
Calling 'make_unique<llvm::opt::Arg, const llvm::opt::Option, const char *&, unsigned int, const char *&>'
15
Returned allocated memory
412
413 const Info *Start = OptionInfos.data() + FirstSearchableIndex;
414 const Info *End = OptionInfos.data() + OptionInfos.size();
415 StringRef Name = StringRef(Str).ltrim(PrefixChars);
416
417 // Search for the first next option which could be a prefix.
418 Start = std::lower_bound(Start, End, Name.data());
419
420 // Options are stored in sorted order, with '\0' at the end of the
421 // alphabet. Since the only options which can accept a string must
422 // prefix it, we iteratively search for the next option which could
423 // be a prefix.
424 //
425 // FIXME: This is searching much more than necessary, but I am
426 // blanking on the simplest way to make it fast. We can solve this
427 // problem when we move to TableGen.
428 for (; Start != End; ++Start) {
429 unsigned ArgSize = 0;
430 // Scan for first option which is a proper prefix.
431 for (; Start != End; ++Start)
432 if ((ArgSize = matchOption(Start, Str, IgnoreCase)))
433 break;
434 if (Start == End)
435 break;
436
437 Option Opt(Start, this);
438
439 if (FlagsToInclude && !Opt.hasFlag(FlagsToInclude))
440 continue;
441 if (Opt.hasFlag(FlagsToExclude))
442 continue;
443
444 // See if this option matches.
445 if (std::unique_ptr<Arg> A =
446 Opt.accept(Args, StringRef(Args.getArgString(Index), ArgSize),
447 /*GroupedShortOption=*/false, Index))
448 return A;
449
450 // Otherwise, see if this argument was missing values.
451 if (Prev != Index)
452 return nullptr;
453 }
454
455 // If we failed to find an option and this arg started with /, then it's
456 // probably an input path.
457 if (Str[0] == '/')
458 return std::make_unique<Arg>(getOption(InputOptionID), Str, Index++, Str);
459
460 return std::make_unique<Arg>(getOption(UnknownOptionID), Str, Index++, Str);
461}
462
463InputArgList OptTable::ParseArgs(ArrayRef<const char *> ArgArr,
464 unsigned &MissingArgIndex,
465 unsigned &MissingArgCount,
466 unsigned FlagsToInclude,
467 unsigned FlagsToExclude) const {
468 InputArgList Args(ArgArr.begin(), ArgArr.end());
469
470 // FIXME: Handle '@' args (or at least error on them).
471
472 MissingArgIndex = MissingArgCount = 0;
473 unsigned Index = 0, End = ArgArr.size();
474 while (Index < End) {
2
Assuming 'Index' is < 'End'
3
Loop condition is true. Entering loop body
19
Assuming 'Index' is >= 'End'
20
Loop condition is false. Execution continues on line 506
475 // Ingore nullptrs, they are response file's EOL markers
476 if (Args.getArgString(Index) == nullptr) {
4
Assuming the condition is false
5
Taking false branch
477 ++Index;
478 continue;
479 }
480 // Ignore empty arguments (other things may still take them as arguments).
481 StringRef Str = Args.getArgString(Index);
482 if (Str == "") {
6
Assuming the condition is false
7
Taking false branch
483 ++Index;
484 continue;
485 }
486
487 unsigned Prev = Index;
488 std::unique_ptr<Arg> A = GroupedShortOptions
8
Assuming field 'GroupedShortOptions' is false
9
'?' condition is false
489 ? parseOneArgGrouped(Args, Index)
490 : ParseOneArg(Args, Index, FlagsToInclude, FlagsToExclude);
10
Calling 'OptTable::ParseOneArg'
16
Returned allocated memory
491 assert((Index > Prev || GroupedShortOptions) &&(static_cast <bool> ((Index > Prev || GroupedShortOptions
) && "Parser failed to consume argument.") ? void (0)
: __assert_fail ("(Index > Prev || GroupedShortOptions) && \"Parser failed to consume argument.\""
, "llvm/lib/Option/OptTable.cpp", 492, __extension__ __PRETTY_FUNCTION__
))
17
'?' condition is true
492 "Parser failed to consume argument.")(static_cast <bool> ((Index > Prev || GroupedShortOptions
) && "Parser failed to consume argument.") ? void (0)
: __assert_fail ("(Index > Prev || GroupedShortOptions) && \"Parser failed to consume argument.\""
, "llvm/lib/Option/OptTable.cpp", 492, __extension__ __PRETTY_FUNCTION__
))
;
493
494 // Check for missing argument error.
495 if (!A) {
18
Taking false branch
496 assert(Index >= End && "Unexpected parser error.")(static_cast <bool> (Index >= End && "Unexpected parser error."
) ? void (0) : __assert_fail ("Index >= End && \"Unexpected parser error.\""
, "llvm/lib/Option/OptTable.cpp", 496, __extension__ __PRETTY_FUNCTION__
))
;
497 assert(Index - Prev - 1 && "No missing arguments!")(static_cast <bool> (Index - Prev - 1 && "No missing arguments!"
) ? void (0) : __assert_fail ("Index - Prev - 1 && \"No missing arguments!\""
, "llvm/lib/Option/OptTable.cpp", 497, __extension__ __PRETTY_FUNCTION__
))
;
498 MissingArgIndex = Prev;
499 MissingArgCount = Index - Prev - 1;
500 break;
501 }
502
503 Args.append(A.release());
504 }
505
506 return Args;
507}
21
Potential leak of memory pointed to by field '_M_head_impl'
508
509InputArgList OptTable::parseArgs(int Argc, char *const *Argv,
510 OptSpecifier Unknown, StringSaver &Saver,
511 function_ref<void(StringRef)> ErrorFn) const {
512 SmallVector<const char *, 0> NewArgv;
513 // The environment variable specifies initial options which can be overridden
514 // by commnad line options.
515 cl::expandResponseFiles(Argc, Argv, EnvVar, Saver, NewArgv);
516
517 unsigned MAI, MAC;
518 opt::InputArgList Args = ParseArgs(makeArrayRef(NewArgv), MAI, MAC);
1
Calling 'OptTable::ParseArgs'
519 if (MAC)
520 ErrorFn((Twine(Args.getArgString(MAI)) + ": missing argument").str());
521
522 // For each unknwon option, call ErrorFn with a formatted error message. The
523 // message includes a suggested alternative option spelling if available.
524 std::string Nearest;
525 for (const opt::Arg *A : Args.filtered(Unknown)) {
526 std::string Spelling = A->getAsString(Args);
527 if (findNearest(Spelling, Nearest) > 1)
528 ErrorFn("unknown argument '" + A->getAsString(Args) + "'");
529 else
530 ErrorFn("unknown argument '" + A->getAsString(Args) +
531 "', did you mean '" + Nearest + "'?");
532 }
533 return Args;
534}
535
536static std::string getOptionHelpName(const OptTable &Opts, OptSpecifier Id) {
537 const Option O = Opts.getOption(Id);
538 std::string Name = O.getPrefixedName();
539
540 // Add metavar, if used.
541 switch (O.getKind()) {
542 case Option::GroupClass: case Option::InputClass: case Option::UnknownClass:
543 llvm_unreachable("Invalid option with help text.")::llvm::llvm_unreachable_internal("Invalid option with help text."
, "llvm/lib/Option/OptTable.cpp", 543)
;
544
545 case Option::MultiArgClass:
546 if (const char *MetaVarName = Opts.getOptionMetaVar(Id)) {
547 // For MultiArgs, metavar is full list of all argument names.
548 Name += ' ';
549 Name += MetaVarName;
550 }
551 else {
552 // For MultiArgs<N>, if metavar not supplied, print <value> N times.
553 for (unsigned i=0, e=O.getNumArgs(); i< e; ++i) {
554 Name += " <value>";
555 }
556 }
557 break;
558
559 case Option::FlagClass:
560 break;
561
562 case Option::ValuesClass:
563 break;
564
565 case Option::SeparateClass: case Option::JoinedOrSeparateClass:
566 case Option::RemainingArgsClass: case Option::RemainingArgsJoinedClass:
567 Name += ' ';
568 [[fallthrough]];
569 case Option::JoinedClass: case Option::CommaJoinedClass:
570 case Option::JoinedAndSeparateClass:
571 if (const char *MetaVarName = Opts.getOptionMetaVar(Id))
572 Name += MetaVarName;
573 else
574 Name += "<value>";
575 break;
576 }
577
578 return Name;
579}
580
581namespace {
582struct OptionInfo {
583 std::string Name;
584 StringRef HelpText;
585};
586} // namespace
587
588static void PrintHelpOptionList(raw_ostream &OS, StringRef Title,
589 std::vector<OptionInfo> &OptionHelp) {
590 OS << Title << ":\n";
591
592 // Find the maximum option length.
593 unsigned OptionFieldWidth = 0;
594 for (const OptionInfo &Opt : OptionHelp) {
595 // Limit the amount of padding we are willing to give up for alignment.
596 unsigned Length = Opt.Name.size();
597 if (Length <= 23)
598 OptionFieldWidth = std::max(OptionFieldWidth, Length);
599 }
600
601 const unsigned InitialPad = 2;
602 for (const OptionInfo &Opt : OptionHelp) {
603 const std::string &Option = Opt.Name;
604 int Pad = OptionFieldWidth - int(Option.size());
605 OS.indent(InitialPad) << Option;
606
607 // Break on long option names.
608 if (Pad < 0) {
609 OS << "\n";
610 Pad = OptionFieldWidth + InitialPad;
611 }
612 OS.indent(Pad + 1) << Opt.HelpText << '\n';
613 }
614}
615
616static const char *getOptionHelpGroup(const OptTable &Opts, OptSpecifier Id) {
617 unsigned GroupID = Opts.getOptionGroupID(Id);
618
619 // If not in a group, return the default help group.
620 if (!GroupID)
621 return "OPTIONS";
622
623 // Abuse the help text of the option groups to store the "help group"
624 // name.
625 //
626 // FIXME: Split out option groups.
627 if (const char *GroupHelp = Opts.getOptionHelpText(GroupID))
628 return GroupHelp;
629
630 // Otherwise keep looking.
631 return getOptionHelpGroup(Opts, GroupID);
632}
633
634void OptTable::printHelp(raw_ostream &OS, const char *Usage, const char *Title,
635 bool ShowHidden, bool ShowAllAliases) const {
636 printHelp(OS, Usage, Title, /*Include*/ 0, /*Exclude*/
637 (ShowHidden ? 0 : HelpHidden), ShowAllAliases);
638}
639
640void OptTable::printHelp(raw_ostream &OS, const char *Usage, const char *Title,
641 unsigned FlagsToInclude, unsigned FlagsToExclude,
642 bool ShowAllAliases) const {
643 OS << "OVERVIEW: " << Title << "\n\n";
644 OS << "USAGE: " << Usage << "\n\n";
645
646 // Render help text into a map of group-name to a list of (option, help)
647 // pairs.
648 std::map<std::string, std::vector<OptionInfo>> GroupedOptionHelp;
649
650 for (unsigned Id = 1, e = getNumOptions() + 1; Id != e; ++Id) {
651 // FIXME: Split out option groups.
652 if (getOptionKind(Id) == Option::GroupClass)
653 continue;
654
655 unsigned Flags = getInfo(Id).Flags;
656 if (FlagsToInclude && !(Flags & FlagsToInclude))
657 continue;
658 if (Flags & FlagsToExclude)
659 continue;
660
661 // If an alias doesn't have a help text, show a help text for the aliased
662 // option instead.
663 const char *HelpText = getOptionHelpText(Id);
664 if (!HelpText && ShowAllAliases) {
665 const Option Alias = getOption(Id).getAlias();
666 if (Alias.isValid())
667 HelpText = getOptionHelpText(Alias.getID());
668 }
669
670 if (HelpText && (strlen(HelpText) != 0)) {
671 const char *HelpGroup = getOptionHelpGroup(*this, Id);
672 const std::string &OptName = getOptionHelpName(*this, Id);
673 GroupedOptionHelp[HelpGroup].push_back({OptName, HelpText});
674 }
675 }
676
677 for (auto& OptionGroup : GroupedOptionHelp) {
678 if (OptionGroup.first != GroupedOptionHelp.begin()->first)
679 OS << "\n";
680 PrintHelpOptionList(OS, OptionGroup.first, OptionGroup.second);
681 }
682
683 OS.flush();
684}

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

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