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