File: | clang/lib/Serialization/ModuleManager.cpp |
Warning: | line 202, column 5 Called C++ object pointer is null |
Press '?' to see keyboard shortcuts
Keyboard shortcuts:
1 | //===- ModuleManager.cpp - Module Manager ---------------------------------===// | ||||
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 | // This file defines the ModuleManager class, which manages a set of loaded | ||||
10 | // modules for the ASTReader. | ||||
11 | // | ||||
12 | //===----------------------------------------------------------------------===// | ||||
13 | |||||
14 | #include "clang/Serialization/ModuleManager.h" | ||||
15 | #include "clang/Basic/FileManager.h" | ||||
16 | #include "clang/Basic/LLVM.h" | ||||
17 | #include "clang/Lex/HeaderSearch.h" | ||||
18 | #include "clang/Lex/ModuleMap.h" | ||||
19 | #include "clang/Serialization/GlobalModuleIndex.h" | ||||
20 | #include "clang/Serialization/InMemoryModuleCache.h" | ||||
21 | #include "clang/Serialization/ModuleFile.h" | ||||
22 | #include "clang/Serialization/PCHContainerOperations.h" | ||||
23 | #include "llvm/ADT/STLExtras.h" | ||||
24 | #include "llvm/ADT/SetVector.h" | ||||
25 | #include "llvm/ADT/SmallPtrSet.h" | ||||
26 | #include "llvm/ADT/SmallVector.h" | ||||
27 | #include "llvm/ADT/StringRef.h" | ||||
28 | #include "llvm/ADT/iterator.h" | ||||
29 | #include "llvm/Support/Chrono.h" | ||||
30 | #include "llvm/Support/DOTGraphTraits.h" | ||||
31 | #include "llvm/Support/ErrorOr.h" | ||||
32 | #include "llvm/Support/GraphWriter.h" | ||||
33 | #include "llvm/Support/MemoryBuffer.h" | ||||
34 | #include "llvm/Support/VirtualFileSystem.h" | ||||
35 | #include <algorithm> | ||||
36 | #include <cassert> | ||||
37 | #include <memory> | ||||
38 | #include <string> | ||||
39 | #include <system_error> | ||||
40 | |||||
41 | using namespace clang; | ||||
42 | using namespace serialization; | ||||
43 | |||||
44 | ModuleFile *ModuleManager::lookupByFileName(StringRef Name) const { | ||||
45 | auto Entry = FileMgr.getFile(Name, /*OpenFile=*/false, | ||||
46 | /*CacheFailure=*/false); | ||||
47 | if (Entry) | ||||
48 | return lookup(*Entry); | ||||
49 | |||||
50 | return nullptr; | ||||
51 | } | ||||
52 | |||||
53 | ModuleFile *ModuleManager::lookupByModuleName(StringRef Name) const { | ||||
54 | if (const Module *Mod = HeaderSearchInfo.getModuleMap().findModule(Name)) | ||||
55 | if (const FileEntry *File = Mod->getASTFile()) | ||||
56 | return lookup(File); | ||||
57 | |||||
58 | return nullptr; | ||||
59 | } | ||||
60 | |||||
61 | ModuleFile *ModuleManager::lookup(const FileEntry *File) const { | ||||
62 | auto Known = Modules.find(File); | ||||
63 | if (Known == Modules.end()) | ||||
64 | return nullptr; | ||||
65 | |||||
66 | return Known->second; | ||||
67 | } | ||||
68 | |||||
69 | std::unique_ptr<llvm::MemoryBuffer> | ||||
70 | ModuleManager::lookupBuffer(StringRef Name) { | ||||
71 | auto Entry = FileMgr.getFile(Name, /*OpenFile=*/false, | ||||
72 | /*CacheFailure=*/false); | ||||
73 | if (!Entry) | ||||
74 | return nullptr; | ||||
75 | return std::move(InMemoryBuffers[*Entry]); | ||||
76 | } | ||||
77 | |||||
78 | static bool checkSignature(ASTFileSignature Signature, | ||||
79 | ASTFileSignature ExpectedSignature, | ||||
80 | std::string &ErrorStr) { | ||||
81 | if (!ExpectedSignature || Signature == ExpectedSignature) | ||||
82 | return false; | ||||
83 | |||||
84 | ErrorStr = | ||||
85 | Signature ? "signature mismatch" : "could not read module signature"; | ||||
86 | return true; | ||||
87 | } | ||||
88 | |||||
89 | static void updateModuleImports(ModuleFile &MF, ModuleFile *ImportedBy, | ||||
90 | SourceLocation ImportLoc) { | ||||
91 | if (ImportedBy) { | ||||
92 | MF.ImportedBy.insert(ImportedBy); | ||||
93 | ImportedBy->Imports.insert(&MF); | ||||
94 | } else { | ||||
95 | if (!MF.DirectlyImported) | ||||
96 | MF.ImportLoc = ImportLoc; | ||||
97 | |||||
98 | MF.DirectlyImported = true; | ||||
99 | } | ||||
100 | } | ||||
101 | |||||
102 | ModuleManager::AddModuleResult | ||||
103 | ModuleManager::addModule(StringRef FileName, ModuleKind Type, | ||||
104 | SourceLocation ImportLoc, ModuleFile *ImportedBy, | ||||
105 | unsigned Generation, | ||||
106 | off_t ExpectedSize, time_t ExpectedModTime, | ||||
107 | ASTFileSignature ExpectedSignature, | ||||
108 | ASTFileSignatureReader ReadSignature, | ||||
109 | ModuleFile *&Module, | ||||
110 | std::string &ErrorStr) { | ||||
111 | Module = nullptr; | ||||
112 | |||||
113 | // Look for the file entry. This only fails if the expected size or | ||||
114 | // modification time differ. | ||||
115 | const FileEntry *Entry; | ||||
116 | if (Type == MK_ExplicitModule || Type == MK_PrebuiltModule) { | ||||
| |||||
117 | // If we're not expecting to pull this file out of the module cache, it | ||||
118 | // might have a different mtime due to being moved across filesystems in | ||||
119 | // a distributed build. The size must still match, though. (As must the | ||||
120 | // contents, but we can't check that.) | ||||
121 | ExpectedModTime = 0; | ||||
122 | } | ||||
123 | // Note: ExpectedSize and ExpectedModTime will be 0 for MK_ImplicitModule | ||||
124 | // when using an ASTFileSignature. | ||||
125 | if (lookupModuleFile(FileName, ExpectedSize, ExpectedModTime, Entry)) { | ||||
126 | ErrorStr = "module file out of date"; | ||||
127 | return OutOfDate; | ||||
128 | } | ||||
129 | |||||
130 | if (!Entry
| ||||
131 | ErrorStr = "module file not found"; | ||||
132 | return Missing; | ||||
133 | } | ||||
134 | |||||
135 | // The ModuleManager's use of FileEntry nodes as the keys for its map of | ||||
136 | // loaded modules is less than ideal. Uniqueness for FileEntry nodes is | ||||
137 | // maintained by FileManager, which in turn uses inode numbers on hosts | ||||
138 | // that support that. When coupled with the module cache's proclivity for | ||||
139 | // turning over and deleting stale PCMs, this means entries for different | ||||
140 | // module files can wind up reusing the same underlying inode. When this | ||||
141 | // happens, subsequent accesses to the Modules map will disagree on the | ||||
142 | // ModuleFile associated with a given file. In general, it is not sufficient | ||||
143 | // to resolve this conundrum with a type like FileEntryRef that stores the | ||||
144 | // name of the FileEntry node on first access because of path canonicalization | ||||
145 | // issues. However, the paths constructed for implicit module builds are | ||||
146 | // fully under Clang's control. We *can*, therefore, rely on their structure | ||||
147 | // being consistent across operating systems and across subsequent accesses | ||||
148 | // to the Modules map. | ||||
149 | auto implicitModuleNamesMatch = [](ModuleKind Kind, const ModuleFile *MF, | ||||
150 | const FileEntry *Entry) -> bool { | ||||
151 | if (Kind != MK_ImplicitModule) | ||||
152 | return true; | ||||
153 | return Entry->getName() == MF->FileName; | ||||
154 | }; | ||||
155 | |||||
156 | // Check whether we already loaded this module, before | ||||
157 | if (ModuleFile *ModuleEntry = Modules.lookup(Entry)) { | ||||
158 | if (implicitModuleNamesMatch(Type, ModuleEntry, Entry)) { | ||||
159 | // Check the stored signature. | ||||
160 | if (checkSignature(ModuleEntry->Signature, ExpectedSignature, ErrorStr)) | ||||
161 | return OutOfDate; | ||||
162 | |||||
163 | Module = ModuleEntry; | ||||
164 | updateModuleImports(*ModuleEntry, ImportedBy, ImportLoc); | ||||
165 | return AlreadyLoaded; | ||||
166 | } | ||||
167 | } | ||||
168 | |||||
169 | // Allocate a new module. | ||||
170 | auto NewModule = std::make_unique<ModuleFile>(Type, Generation); | ||||
171 | NewModule->Index = Chain.size(); | ||||
172 | NewModule->FileName = FileName.str(); | ||||
173 | NewModule->File = Entry; | ||||
174 | NewModule->ImportLoc = ImportLoc; | ||||
175 | NewModule->InputFilesValidationTimestamp = 0; | ||||
176 | |||||
177 | if (NewModule->Kind == MK_ImplicitModule) { | ||||
178 | std::string TimestampFilename = NewModule->getTimestampFilename(); | ||||
179 | llvm::vfs::Status Status; | ||||
180 | // A cached stat value would be fine as well. | ||||
181 | if (!FileMgr.getNoncachedStatValue(TimestampFilename, Status)) | ||||
182 | NewModule->InputFilesValidationTimestamp = | ||||
183 | llvm::sys::toTimeT(Status.getLastModificationTime()); | ||||
184 | } | ||||
185 | |||||
186 | // Load the contents of the module | ||||
187 | if (std::unique_ptr<llvm::MemoryBuffer> Buffer = lookupBuffer(FileName)) { | ||||
188 | // The buffer was already provided for us. | ||||
189 | NewModule->Buffer = &ModuleCache->addBuiltPCM(FileName, std::move(Buffer)); | ||||
190 | // Since the cached buffer is reused, it is safe to close the file | ||||
191 | // descriptor that was opened while stat()ing the PCM in | ||||
192 | // lookupModuleFile() above, it won't be needed any longer. | ||||
193 | Entry->closeFile(); | ||||
194 | } else if (llvm::MemoryBuffer *Buffer = | ||||
195 | getModuleCache().lookupPCM(FileName)) { | ||||
196 | NewModule->Buffer = Buffer; | ||||
197 | // As above, the file descriptor is no longer needed. | ||||
198 | Entry->closeFile(); | ||||
199 | } else if (getModuleCache().shouldBuildPCM(FileName)) { | ||||
200 | // Report that the module is out of date, since we tried (and failed) to | ||||
201 | // import it earlier. | ||||
202 | Entry->closeFile(); | ||||
| |||||
203 | return OutOfDate; | ||||
204 | } else { | ||||
205 | // Open the AST file. | ||||
206 | llvm::ErrorOr<std::unique_ptr<llvm::MemoryBuffer>> Buf((std::error_code())); | ||||
207 | if (FileName == "-") { | ||||
208 | Buf = llvm::MemoryBuffer::getSTDIN(); | ||||
209 | } else { | ||||
210 | // Get a buffer of the file and close the file descriptor when done. | ||||
211 | // The file is volatile because in a parallel build we expect multiple | ||||
212 | // compiler processes to use the same module file rebuilding it if needed. | ||||
213 | // | ||||
214 | // RequiresNullTerminator is false because module files don't need it, and | ||||
215 | // this allows the file to still be mmapped. | ||||
216 | Buf = FileMgr.getBufferForFile(NewModule->File, | ||||
217 | /*IsVolatile=*/true, | ||||
218 | /*RequiresNullTerminator=*/false); | ||||
219 | } | ||||
220 | |||||
221 | if (!Buf) { | ||||
222 | ErrorStr = Buf.getError().message(); | ||||
223 | return Missing; | ||||
224 | } | ||||
225 | |||||
226 | NewModule->Buffer = &getModuleCache().addPCM(FileName, std::move(*Buf)); | ||||
227 | } | ||||
228 | |||||
229 | // Initialize the stream. | ||||
230 | NewModule->Data = PCHContainerRdr.ExtractPCH(*NewModule->Buffer); | ||||
231 | |||||
232 | // Read the signature eagerly now so that we can check it. Avoid calling | ||||
233 | // ReadSignature unless there's something to check though. | ||||
234 | if (ExpectedSignature && checkSignature(ReadSignature(NewModule->Data), | ||||
235 | ExpectedSignature, ErrorStr)) | ||||
236 | return OutOfDate; | ||||
237 | |||||
238 | // We're keeping this module. Store it everywhere. | ||||
239 | Module = Modules[Entry] = NewModule.get(); | ||||
240 | |||||
241 | updateModuleImports(*NewModule, ImportedBy, ImportLoc); | ||||
242 | |||||
243 | if (!NewModule->isModule()) | ||||
244 | PCHChain.push_back(NewModule.get()); | ||||
245 | if (!ImportedBy) | ||||
246 | Roots.push_back(NewModule.get()); | ||||
247 | |||||
248 | Chain.push_back(std::move(NewModule)); | ||||
249 | return NewlyLoaded; | ||||
250 | } | ||||
251 | |||||
252 | void ModuleManager::removeModules(ModuleIterator First, ModuleMap *modMap) { | ||||
253 | auto Last = end(); | ||||
254 | if (First == Last) | ||||
255 | return; | ||||
256 | |||||
257 | // Explicitly clear VisitOrder since we might not notice it is stale. | ||||
258 | VisitOrder.clear(); | ||||
259 | |||||
260 | // Collect the set of module file pointers that we'll be removing. | ||||
261 | llvm::SmallPtrSet<ModuleFile *, 4> victimSet( | ||||
262 | (llvm::pointer_iterator<ModuleIterator>(First)), | ||||
263 | (llvm::pointer_iterator<ModuleIterator>(Last))); | ||||
264 | |||||
265 | auto IsVictim = [&](ModuleFile *MF) { | ||||
266 | return victimSet.count(MF); | ||||
267 | }; | ||||
268 | // Remove any references to the now-destroyed modules. | ||||
269 | for (auto I = begin(); I != First; ++I) { | ||||
270 | I->Imports.remove_if(IsVictim); | ||||
271 | I->ImportedBy.remove_if(IsVictim); | ||||
272 | } | ||||
273 | Roots.erase(std::remove_if(Roots.begin(), Roots.end(), IsVictim), | ||||
274 | Roots.end()); | ||||
275 | |||||
276 | // Remove the modules from the PCH chain. | ||||
277 | for (auto I = First; I != Last; ++I) { | ||||
278 | if (!I->isModule()) { | ||||
279 | PCHChain.erase(llvm::find(PCHChain, &*I), PCHChain.end()); | ||||
280 | break; | ||||
281 | } | ||||
282 | } | ||||
283 | |||||
284 | // Delete the modules and erase them from the various structures. | ||||
285 | for (ModuleIterator victim = First; victim != Last; ++victim) { | ||||
286 | Modules.erase(victim->File); | ||||
287 | |||||
288 | if (modMap) { | ||||
289 | StringRef ModuleName = victim->ModuleName; | ||||
290 | if (Module *mod = modMap->findModule(ModuleName)) { | ||||
291 | mod->setASTFile(nullptr); | ||||
292 | } | ||||
293 | } | ||||
294 | } | ||||
295 | |||||
296 | // Delete the modules. | ||||
297 | Chain.erase(Chain.begin() + (First - begin()), Chain.end()); | ||||
298 | } | ||||
299 | |||||
300 | void | ||||
301 | ModuleManager::addInMemoryBuffer(StringRef FileName, | ||||
302 | std::unique_ptr<llvm::MemoryBuffer> Buffer) { | ||||
303 | const FileEntry *Entry = | ||||
304 | FileMgr.getVirtualFile(FileName, Buffer->getBufferSize(), 0); | ||||
305 | InMemoryBuffers[Entry] = std::move(Buffer); | ||||
306 | } | ||||
307 | |||||
308 | ModuleManager::VisitState *ModuleManager::allocateVisitState() { | ||||
309 | // Fast path: if we have a cached state, use it. | ||||
310 | if (FirstVisitState) { | ||||
311 | VisitState *Result = FirstVisitState; | ||||
312 | FirstVisitState = FirstVisitState->NextState; | ||||
313 | Result->NextState = nullptr; | ||||
314 | return Result; | ||||
315 | } | ||||
316 | |||||
317 | // Allocate and return a new state. | ||||
318 | return new VisitState(size()); | ||||
319 | } | ||||
320 | |||||
321 | void ModuleManager::returnVisitState(VisitState *State) { | ||||
322 | assert(State->NextState == nullptr && "Visited state is in list?")((State->NextState == nullptr && "Visited state is in list?" ) ? static_cast<void> (0) : __assert_fail ("State->NextState == nullptr && \"Visited state is in list?\"" , "/build/llvm-toolchain-snapshot-12.0.0~++20201102111116+1ed2ca68191/clang/lib/Serialization/ModuleManager.cpp" , 322, __PRETTY_FUNCTION__)); | ||||
323 | State->NextState = FirstVisitState; | ||||
324 | FirstVisitState = State; | ||||
325 | } | ||||
326 | |||||
327 | void ModuleManager::setGlobalIndex(GlobalModuleIndex *Index) { | ||||
328 | GlobalIndex = Index; | ||||
329 | if (!GlobalIndex) { | ||||
330 | ModulesInCommonWithGlobalIndex.clear(); | ||||
331 | return; | ||||
332 | } | ||||
333 | |||||
334 | // Notify the global module index about all of the modules we've already | ||||
335 | // loaded. | ||||
336 | for (ModuleFile &M : *this) | ||||
337 | if (!GlobalIndex->loadedModuleFile(&M)) | ||||
338 | ModulesInCommonWithGlobalIndex.push_back(&M); | ||||
339 | } | ||||
340 | |||||
341 | void ModuleManager::moduleFileAccepted(ModuleFile *MF) { | ||||
342 | if (!GlobalIndex || GlobalIndex->loadedModuleFile(MF)) | ||||
343 | return; | ||||
344 | |||||
345 | ModulesInCommonWithGlobalIndex.push_back(MF); | ||||
346 | } | ||||
347 | |||||
348 | ModuleManager::ModuleManager(FileManager &FileMgr, | ||||
349 | InMemoryModuleCache &ModuleCache, | ||||
350 | const PCHContainerReader &PCHContainerRdr, | ||||
351 | const HeaderSearch &HeaderSearchInfo) | ||||
352 | : FileMgr(FileMgr), ModuleCache(&ModuleCache), | ||||
353 | PCHContainerRdr(PCHContainerRdr), HeaderSearchInfo(HeaderSearchInfo) {} | ||||
354 | |||||
355 | ModuleManager::~ModuleManager() { delete FirstVisitState; } | ||||
356 | |||||
357 | void ModuleManager::visit(llvm::function_ref<bool(ModuleFile &M)> Visitor, | ||||
358 | llvm::SmallPtrSetImpl<ModuleFile *> *ModuleFilesHit) { | ||||
359 | // If the visitation order vector is the wrong size, recompute the order. | ||||
360 | if (VisitOrder.size() != Chain.size()) { | ||||
361 | unsigned N = size(); | ||||
362 | VisitOrder.clear(); | ||||
363 | VisitOrder.reserve(N); | ||||
364 | |||||
365 | // Record the number of incoming edges for each module. When we | ||||
366 | // encounter a module with no incoming edges, push it into the queue | ||||
367 | // to seed the queue. | ||||
368 | SmallVector<ModuleFile *, 4> Queue; | ||||
369 | Queue.reserve(N); | ||||
370 | llvm::SmallVector<unsigned, 4> UnusedIncomingEdges; | ||||
371 | UnusedIncomingEdges.resize(size()); | ||||
372 | for (ModuleFile &M : llvm::reverse(*this)) { | ||||
373 | unsigned Size = M.ImportedBy.size(); | ||||
374 | UnusedIncomingEdges[M.Index] = Size; | ||||
375 | if (!Size) | ||||
376 | Queue.push_back(&M); | ||||
377 | } | ||||
378 | |||||
379 | // Traverse the graph, making sure to visit a module before visiting any | ||||
380 | // of its dependencies. | ||||
381 | while (!Queue.empty()) { | ||||
382 | ModuleFile *CurrentModule = Queue.pop_back_val(); | ||||
383 | VisitOrder.push_back(CurrentModule); | ||||
384 | |||||
385 | // For any module that this module depends on, push it on the | ||||
386 | // stack (if it hasn't already been marked as visited). | ||||
387 | for (auto M = CurrentModule->Imports.rbegin(), | ||||
388 | MEnd = CurrentModule->Imports.rend(); | ||||
389 | M != MEnd; ++M) { | ||||
390 | // Remove our current module as an impediment to visiting the | ||||
391 | // module we depend on. If we were the last unvisited module | ||||
392 | // that depends on this particular module, push it into the | ||||
393 | // queue to be visited. | ||||
394 | unsigned &NumUnusedEdges = UnusedIncomingEdges[(*M)->Index]; | ||||
395 | if (NumUnusedEdges && (--NumUnusedEdges == 0)) | ||||
396 | Queue.push_back(*M); | ||||
397 | } | ||||
398 | } | ||||
399 | |||||
400 | assert(VisitOrder.size() == N && "Visitation order is wrong?")((VisitOrder.size() == N && "Visitation order is wrong?" ) ? static_cast<void> (0) : __assert_fail ("VisitOrder.size() == N && \"Visitation order is wrong?\"" , "/build/llvm-toolchain-snapshot-12.0.0~++20201102111116+1ed2ca68191/clang/lib/Serialization/ModuleManager.cpp" , 400, __PRETTY_FUNCTION__)); | ||||
401 | |||||
402 | delete FirstVisitState; | ||||
403 | FirstVisitState = nullptr; | ||||
404 | } | ||||
405 | |||||
406 | VisitState *State = allocateVisitState(); | ||||
407 | unsigned VisitNumber = State->NextVisitNumber++; | ||||
408 | |||||
409 | // If the caller has provided us with a hit-set that came from the global | ||||
410 | // module index, mark every module file in common with the global module | ||||
411 | // index that is *not* in that set as 'visited'. | ||||
412 | if (ModuleFilesHit && !ModulesInCommonWithGlobalIndex.empty()) { | ||||
413 | for (unsigned I = 0, N = ModulesInCommonWithGlobalIndex.size(); I != N; ++I) | ||||
414 | { | ||||
415 | ModuleFile *M = ModulesInCommonWithGlobalIndex[I]; | ||||
416 | if (!ModuleFilesHit->count(M)) | ||||
417 | State->VisitNumber[M->Index] = VisitNumber; | ||||
418 | } | ||||
419 | } | ||||
420 | |||||
421 | for (unsigned I = 0, N = VisitOrder.size(); I != N; ++I) { | ||||
422 | ModuleFile *CurrentModule = VisitOrder[I]; | ||||
423 | // Should we skip this module file? | ||||
424 | if (State->VisitNumber[CurrentModule->Index] == VisitNumber) | ||||
425 | continue; | ||||
426 | |||||
427 | // Visit the module. | ||||
428 | assert(State->VisitNumber[CurrentModule->Index] == VisitNumber - 1)((State->VisitNumber[CurrentModule->Index] == VisitNumber - 1) ? static_cast<void> (0) : __assert_fail ("State->VisitNumber[CurrentModule->Index] == VisitNumber - 1" , "/build/llvm-toolchain-snapshot-12.0.0~++20201102111116+1ed2ca68191/clang/lib/Serialization/ModuleManager.cpp" , 428, __PRETTY_FUNCTION__)); | ||||
429 | State->VisitNumber[CurrentModule->Index] = VisitNumber; | ||||
430 | if (!Visitor(*CurrentModule)) | ||||
431 | continue; | ||||
432 | |||||
433 | // The visitor has requested that cut off visitation of any | ||||
434 | // module that the current module depends on. To indicate this | ||||
435 | // behavior, we mark all of the reachable modules as having been visited. | ||||
436 | ModuleFile *NextModule = CurrentModule; | ||||
437 | do { | ||||
438 | // For any module that this module depends on, push it on the | ||||
439 | // stack (if it hasn't already been marked as visited). | ||||
440 | for (llvm::SetVector<ModuleFile *>::iterator | ||||
441 | M = NextModule->Imports.begin(), | ||||
442 | MEnd = NextModule->Imports.end(); | ||||
443 | M != MEnd; ++M) { | ||||
444 | if (State->VisitNumber[(*M)->Index] != VisitNumber) { | ||||
445 | State->Stack.push_back(*M); | ||||
446 | State->VisitNumber[(*M)->Index] = VisitNumber; | ||||
447 | } | ||||
448 | } | ||||
449 | |||||
450 | if (State->Stack.empty()) | ||||
451 | break; | ||||
452 | |||||
453 | // Pop the next module off the stack. | ||||
454 | NextModule = State->Stack.pop_back_val(); | ||||
455 | } while (true); | ||||
456 | } | ||||
457 | |||||
458 | returnVisitState(State); | ||||
459 | } | ||||
460 | |||||
461 | bool ModuleManager::lookupModuleFile(StringRef FileName, | ||||
462 | off_t ExpectedSize, | ||||
463 | time_t ExpectedModTime, | ||||
464 | const FileEntry *&File) { | ||||
465 | File = nullptr; | ||||
466 | if (FileName == "-") | ||||
467 | return false; | ||||
468 | |||||
469 | // Open the file immediately to ensure there is no race between stat'ing and | ||||
470 | // opening the file. | ||||
471 | auto FileOrErr = FileMgr.getFile(FileName, /*OpenFile=*/true, | ||||
472 | /*CacheFailure=*/false); | ||||
473 | if (!FileOrErr) | ||||
474 | return false; | ||||
475 | |||||
476 | File = *FileOrErr; | ||||
477 | |||||
478 | if ((ExpectedSize && ExpectedSize != File->getSize()) || | ||||
479 | (ExpectedModTime && ExpectedModTime != File->getModificationTime())) | ||||
480 | // Do not destroy File, as it may be referenced. If we need to rebuild it, | ||||
481 | // it will be destroyed by removeModules. | ||||
482 | return true; | ||||
483 | |||||
484 | return false; | ||||
485 | } | ||||
486 | |||||
487 | #ifndef NDEBUG | ||||
488 | namespace llvm { | ||||
489 | |||||
490 | template<> | ||||
491 | struct GraphTraits<ModuleManager> { | ||||
492 | using NodeRef = ModuleFile *; | ||||
493 | using ChildIteratorType = llvm::SetVector<ModuleFile *>::const_iterator; | ||||
494 | using nodes_iterator = pointer_iterator<ModuleManager::ModuleConstIterator>; | ||||
495 | |||||
496 | static ChildIteratorType child_begin(NodeRef Node) { | ||||
497 | return Node->Imports.begin(); | ||||
498 | } | ||||
499 | |||||
500 | static ChildIteratorType child_end(NodeRef Node) { | ||||
501 | return Node->Imports.end(); | ||||
502 | } | ||||
503 | |||||
504 | static nodes_iterator nodes_begin(const ModuleManager &Manager) { | ||||
505 | return nodes_iterator(Manager.begin()); | ||||
506 | } | ||||
507 | |||||
508 | static nodes_iterator nodes_end(const ModuleManager &Manager) { | ||||
509 | return nodes_iterator(Manager.end()); | ||||
510 | } | ||||
511 | }; | ||||
512 | |||||
513 | template<> | ||||
514 | struct DOTGraphTraits<ModuleManager> : public DefaultDOTGraphTraits { | ||||
515 | explicit DOTGraphTraits(bool IsSimple = false) | ||||
516 | : DefaultDOTGraphTraits(IsSimple) {} | ||||
517 | |||||
518 | static bool renderGraphFromBottomUp() { return true; } | ||||
519 | |||||
520 | std::string getNodeLabel(ModuleFile *M, const ModuleManager&) { | ||||
521 | return M->ModuleName; | ||||
522 | } | ||||
523 | }; | ||||
524 | |||||
525 | } // namespace llvm | ||||
526 | |||||
527 | void ModuleManager::viewGraph() { | ||||
528 | llvm::ViewGraph(*this, "Modules"); | ||||
529 | } | ||||
530 | #endif |
1 | // unique_ptr implementation -*- C++ -*- |
2 | |
3 | // Copyright (C) 2008-2016 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 | |
39 | namespace std _GLIBCXX_VISIBILITY(default)__attribute__ ((__visibility__ ("default"))) |
40 | { |
41 | _GLIBCXX_BEGIN_NAMESPACE_VERSION |
42 | |
43 | /** |
44 | * @addtogroup pointer_abstractions |
45 | * @{ |
46 | */ |
47 | |
48 | #if _GLIBCXX_USE_DEPRECATED1 |
49 | template<typename> class auto_ptr; |
50 | #endif |
51 | |
52 | /// Primary template of default_delete, used by unique_ptr |
53 | template<typename _Tp> |
54 | struct default_delete |
55 | { |
56 | /// Default constructor |
57 | constexpr default_delete() noexcept = default; |
58 | |
59 | /** @brief Converting constructor. |
60 | * |
61 | * Allows conversion from a deleter for arrays of another type, @p _Up, |
62 | * only if @p _Up* is convertible to @p _Tp*. |
63 | */ |
64 | template<typename _Up, typename = typename |
65 | enable_if<is_convertible<_Up*, _Tp*>::value>::type> |
66 | default_delete(const default_delete<_Up>&) noexcept { } |
67 | |
68 | /// Calls @c delete @p __ptr |
69 | void |
70 | operator()(_Tp* __ptr) const |
71 | { |
72 | static_assert(!is_void<_Tp>::value, |
73 | "can't delete pointer to incomplete type"); |
74 | static_assert(sizeof(_Tp)>0, |
75 | "can't delete pointer to incomplete type"); |
76 | delete __ptr; |
77 | } |
78 | }; |
79 | |
80 | // _GLIBCXX_RESOLVE_LIB_DEFECTS |
81 | // DR 740 - omit specialization for array objects with a compile time length |
82 | /// Specialization for arrays, default_delete. |
83 | template<typename _Tp> |
84 | struct default_delete<_Tp[]> |
85 | { |
86 | public: |
87 | /// Default constructor |
88 | constexpr default_delete() noexcept = default; |
89 | |
90 | /** @brief Converting constructor. |
91 | * |
92 | * Allows conversion from a deleter for arrays of another type, such as |
93 | * a const-qualified version of @p _Tp. |
94 | * |
95 | * Conversions from types derived from @c _Tp are not allowed because |
96 | * it is unsafe to @c delete[] an array of derived types through a |
97 | * pointer to the base type. |
98 | */ |
99 | template<typename _Up, typename = typename |
100 | enable_if<is_convertible<_Up(*)[], _Tp(*)[]>::value>::type> |
101 | default_delete(const default_delete<_Up[]>&) noexcept { } |
102 | |
103 | /// Calls @c delete[] @p __ptr |
104 | template<typename _Up> |
105 | typename enable_if<is_convertible<_Up(*)[], _Tp(*)[]>::value>::type |
106 | operator()(_Up* __ptr) const |
107 | { |
108 | static_assert(sizeof(_Tp)>0, |
109 | "can't delete pointer to incomplete type"); |
110 | delete [] __ptr; |
111 | } |
112 | }; |
113 | |
114 | /// 20.7.1.2 unique_ptr for single objects. |
115 | template <typename _Tp, typename _Dp = default_delete<_Tp> > |
116 | class unique_ptr |
117 | { |
118 | // use SFINAE to determine whether _Del::pointer exists |
119 | class _Pointer |
120 | { |
121 | template<typename _Up> |
122 | static typename _Up::pointer __test(typename _Up::pointer*); |
123 | |
124 | template<typename _Up> |
125 | static _Tp* __test(...); |
126 | |
127 | typedef typename remove_reference<_Dp>::type _Del; |
128 | |
129 | public: |
130 | typedef decltype(__test<_Del>(0)) type; |
131 | }; |
132 | |
133 | typedef std::tuple<typename _Pointer::type, _Dp> __tuple_type; |
134 | __tuple_type _M_t; |
135 | |
136 | public: |
137 | typedef typename _Pointer::type pointer; |
138 | typedef _Tp element_type; |
139 | typedef _Dp deleter_type; |
140 | |
141 | |
142 | // helper template for detecting a safe conversion from another |
143 | // unique_ptr |
144 | template<typename _Up, typename _Ep> |
145 | using __safe_conversion_up = __and_< |
146 | is_convertible<typename unique_ptr<_Up, _Ep>::pointer, pointer>, |
147 | __not_<is_array<_Up>>, |
148 | __or_<__and_<is_reference<deleter_type>, |
149 | is_same<deleter_type, _Ep>>, |
150 | __and_<__not_<is_reference<deleter_type>>, |
151 | is_convertible<_Ep, deleter_type>> |
152 | > |
153 | >; |
154 | |
155 | // Constructors. |
156 | |
157 | /// Default constructor, creates a unique_ptr that owns nothing. |
158 | constexpr unique_ptr() noexcept |
159 | : _M_t() |
160 | { static_assert(!is_pointer<deleter_type>::value, |
161 | "constructed with null function pointer deleter"); } |
162 | |
163 | /** Takes ownership of a pointer. |
164 | * |
165 | * @param __p A pointer to an object of @c element_type |
166 | * |
167 | * The deleter will be value-initialized. |
168 | */ |
169 | explicit |
170 | unique_ptr(pointer __p) noexcept |
171 | : _M_t() |
172 | { |
173 | std::get<0>(_M_t) = __p; |
174 | static_assert(!is_pointer<deleter_type>::value, |
175 | "constructed with null function pointer deleter"); |
176 | } |
177 | |
178 | /** Takes ownership of a pointer. |
179 | * |
180 | * @param __p A pointer to an object of @c element_type |
181 | * @param __d A reference to a deleter. |
182 | * |
183 | * The deleter will be initialized with @p __d |
184 | */ |
185 | unique_ptr(pointer __p, |
186 | typename conditional<is_reference<deleter_type>::value, |
187 | deleter_type, const deleter_type&>::type __d) noexcept |
188 | : _M_t(__p, __d) { } |
189 | |
190 | /** Takes ownership of a pointer. |
191 | * |
192 | * @param __p A pointer to an object of @c element_type |
193 | * @param __d An rvalue reference to a deleter. |
194 | * |
195 | * The deleter will be initialized with @p std::move(__d) |
196 | */ |
197 | unique_ptr(pointer __p, |
198 | typename remove_reference<deleter_type>::type&& __d) noexcept |
199 | : _M_t(std::move(__p), std::move(__d)) |
200 | { static_assert(!std::is_reference<deleter_type>::value, |
201 | "rvalue deleter bound to reference"); } |
202 | |
203 | /// Creates a unique_ptr that owns nothing. |
204 | constexpr unique_ptr(nullptr_t) noexcept : unique_ptr() { } |
205 | |
206 | // Move constructors. |
207 | |
208 | /// Move constructor. |
209 | unique_ptr(unique_ptr&& __u) noexcept |
210 | : _M_t(__u.release(), std::forward<deleter_type>(__u.get_deleter())) { } |
211 | |
212 | /** @brief Converting constructor from another type |
213 | * |
214 | * Requires that the pointer owned by @p __u is convertible to the |
215 | * type of pointer owned by this object, @p __u does not own an array, |
216 | * and @p __u has a compatible deleter type. |
217 | */ |
218 | template<typename _Up, typename _Ep, typename = _Require< |
219 | __safe_conversion_up<_Up, _Ep>, |
220 | typename conditional<is_reference<_Dp>::value, |
221 | is_same<_Ep, _Dp>, |
222 | is_convertible<_Ep, _Dp>>::type>> |
223 | unique_ptr(unique_ptr<_Up, _Ep>&& __u) noexcept |
224 | : _M_t(__u.release(), std::forward<_Ep>(__u.get_deleter())) |
225 | { } |
226 | |
227 | #if _GLIBCXX_USE_DEPRECATED1 |
228 | /// Converting constructor from @c auto_ptr |
229 | template<typename _Up, typename = _Require< |
230 | is_convertible<_Up*, _Tp*>, is_same<_Dp, default_delete<_Tp>>>> |
231 | unique_ptr(auto_ptr<_Up>&& __u) noexcept; |
232 | #endif |
233 | |
234 | /// Destructor, invokes the deleter if the stored pointer is not null. |
235 | ~unique_ptr() noexcept |
236 | { |
237 | auto& __ptr = std::get<0>(_M_t); |
238 | if (__ptr != nullptr) |
239 | get_deleter()(__ptr); |
240 | __ptr = pointer(); |
241 | } |
242 | |
243 | // Assignment. |
244 | |
245 | /** @brief Move assignment operator. |
246 | * |
247 | * @param __u The object to transfer ownership from. |
248 | * |
249 | * Invokes the deleter first if this object owns a pointer. |
250 | */ |
251 | unique_ptr& |
252 | operator=(unique_ptr&& __u) noexcept |
253 | { |
254 | reset(__u.release()); |
255 | get_deleter() = std::forward<deleter_type>(__u.get_deleter()); |
256 | return *this; |
257 | } |
258 | |
259 | /** @brief Assignment from another type. |
260 | * |
261 | * @param __u The object to transfer ownership from, which owns a |
262 | * convertible pointer to a non-array object. |
263 | * |
264 | * Invokes the deleter first if this object owns a pointer. |
265 | */ |
266 | template<typename _Up, typename _Ep> |
267 | typename enable_if< __and_< |
268 | __safe_conversion_up<_Up, _Ep>, |
269 | is_assignable<deleter_type&, _Ep&&> |
270 | >::value, |
271 | unique_ptr&>::type |
272 | operator=(unique_ptr<_Up, _Ep>&& __u) noexcept |
273 | { |
274 | reset(__u.release()); |
275 | get_deleter() = std::forward<_Ep>(__u.get_deleter()); |
276 | return *this; |
277 | } |
278 | |
279 | /// Reset the %unique_ptr to empty, invoking the deleter if necessary. |
280 | unique_ptr& |
281 | operator=(nullptr_t) noexcept |
282 | { |
283 | reset(); |
284 | return *this; |
285 | } |
286 | |
287 | // Observers. |
288 | |
289 | /// Dereference the stored pointer. |
290 | typename add_lvalue_reference<element_type>::type |
291 | operator*() const |
292 | { |
293 | __glibcxx_assert(get() != pointer()); |
294 | return *get(); |
295 | } |
296 | |
297 | /// Return the stored pointer. |
298 | pointer |
299 | operator->() const noexcept |
300 | { |
301 | _GLIBCXX_DEBUG_PEDASSERT(get() != pointer()); |
302 | return get(); |
303 | } |
304 | |
305 | /// Return the stored pointer. |
306 | pointer |
307 | get() const noexcept |
308 | { return std::get<0>(_M_t); } |
309 | |
310 | /// Return a reference to the stored deleter. |
311 | deleter_type& |
312 | get_deleter() noexcept |
313 | { return std::get<1>(_M_t); } |
314 | |
315 | /// Return a reference to the stored deleter. |
316 | const deleter_type& |
317 | get_deleter() const noexcept |
318 | { return std::get<1>(_M_t); } |
319 | |
320 | /// Return @c true if the stored pointer is not null. |
321 | explicit operator bool() const noexcept |
322 | { return get() == pointer() ? false : true; } |
323 | |
324 | // Modifiers. |
325 | |
326 | /// Release ownership of any stored pointer. |
327 | pointer |
328 | release() noexcept |
329 | { |
330 | pointer __p = get(); |
331 | std::get<0>(_M_t) = pointer(); |
332 | return __p; |
333 | } |
334 | |
335 | /** @brief Replace the stored pointer. |
336 | * |
337 | * @param __p The new pointer to store. |
338 | * |
339 | * The deleter will be invoked if a pointer is already owned. |
340 | */ |
341 | void |
342 | reset(pointer __p = pointer()) noexcept |
343 | { |
344 | using std::swap; |
345 | swap(std::get<0>(_M_t), __p); |
346 | if (__p != pointer()) |
347 | get_deleter()(__p); |
348 | } |
349 | |
350 | /// Exchange the pointer and deleter with another object. |
351 | void |
352 | swap(unique_ptr& __u) noexcept |
353 | { |
354 | using std::swap; |
355 | swap(_M_t, __u._M_t); |
356 | } |
357 | |
358 | // Disable copy from lvalue. |
359 | unique_ptr(const unique_ptr&) = delete; |
360 | unique_ptr& operator=(const unique_ptr&) = delete; |
361 | }; |
362 | |
363 | /// 20.7.1.3 unique_ptr for array objects with a runtime length |
364 | // [unique.ptr.runtime] |
365 | // _GLIBCXX_RESOLVE_LIB_DEFECTS |
366 | // DR 740 - omit specialization for array objects with a compile time length |
367 | template<typename _Tp, typename _Dp> |
368 | class unique_ptr<_Tp[], _Dp> |
369 | { |
370 | // use SFINAE to determine whether _Del::pointer exists |
371 | class _Pointer |
372 | { |
373 | template<typename _Up> |
374 | static typename _Up::pointer __test(typename _Up::pointer*); |
375 | |
376 | template<typename _Up> |
377 | static _Tp* __test(...); |
378 | |
379 | typedef typename remove_reference<_Dp>::type _Del; |
380 | |
381 | public: |
382 | typedef decltype(__test<_Del>(0)) type; |
383 | }; |
384 | |
385 | typedef std::tuple<typename _Pointer::type, _Dp> __tuple_type; |
386 | __tuple_type _M_t; |
387 | |
388 | template<typename _Up> |
389 | using __remove_cv = typename remove_cv<_Up>::type; |
390 | |
391 | // like is_base_of<_Tp, _Up> but false if unqualified types are the same |
392 | template<typename _Up> |
393 | using __is_derived_Tp |
394 | = __and_< is_base_of<_Tp, _Up>, |
395 | __not_<is_same<__remove_cv<_Tp>, __remove_cv<_Up>>> >; |
396 | |
397 | |
398 | public: |
399 | typedef typename _Pointer::type pointer; |
400 | typedef _Tp element_type; |
401 | typedef _Dp deleter_type; |
402 | |
403 | // helper template for detecting a safe conversion from another |
404 | // unique_ptr |
405 | template<typename _Up, typename _Ep, |
406 | typename _Up_up = unique_ptr<_Up, _Ep>, |
407 | typename _Up_element_type = typename _Up_up::element_type> |
408 | using __safe_conversion_up = __and_< |
409 | is_array<_Up>, |
410 | is_same<pointer, element_type*>, |
411 | is_same<typename _Up_up::pointer, _Up_element_type*>, |
412 | is_convertible<_Up_element_type(*)[], element_type(*)[]>, |
413 | __or_<__and_<is_reference<deleter_type>, is_same<deleter_type, _Ep>>, |
414 | __and_<__not_<is_reference<deleter_type>>, |
415 | is_convertible<_Ep, deleter_type>>> |
416 | >; |
417 | |
418 | // helper template for detecting a safe conversion from a raw pointer |
419 | template<typename _Up> |
420 | using __safe_conversion_raw = __and_< |
421 | __or_<__or_<is_same<_Up, pointer>, |
422 | is_same<_Up, nullptr_t>>, |
423 | __and_<is_pointer<_Up>, |
424 | is_same<pointer, element_type*>, |
425 | is_convertible< |
426 | typename remove_pointer<_Up>::type(*)[], |
427 | element_type(*)[]> |
428 | > |
429 | > |
430 | >; |
431 | |
432 | // Constructors. |
433 | |
434 | /// Default constructor, creates a unique_ptr that owns nothing. |
435 | constexpr unique_ptr() noexcept |
436 | : _M_t() |
437 | { static_assert(!std::is_pointer<deleter_type>::value, |
438 | "constructed with null function pointer deleter"); } |
439 | |
440 | /** Takes ownership of a pointer. |
441 | * |
442 | * @param __p A pointer to an array of a type safely convertible |
443 | * to an array of @c element_type |
444 | * |
445 | * The deleter will be value-initialized. |
446 | */ |
447 | template<typename _Up, |
448 | typename = typename enable_if< |
449 | __safe_conversion_raw<_Up>::value, bool>::type> |
450 | explicit |
451 | unique_ptr(_Up __p) noexcept |
452 | : _M_t(__p, deleter_type()) |
453 | { static_assert(!is_pointer<deleter_type>::value, |
454 | "constructed with null function pointer deleter"); } |
455 | |
456 | /** Takes ownership of a pointer. |
457 | * |
458 | * @param __p A pointer to an array of a type safely convertible |
459 | * to an array of @c element_type |
460 | * @param __d A reference to a deleter. |
461 | * |
462 | * The deleter will be initialized with @p __d |
463 | */ |
464 | template<typename _Up, |
465 | typename = typename enable_if< |
466 | __safe_conversion_raw<_Up>::value, bool>::type> |
467 | unique_ptr(_Up __p, |
468 | typename conditional<is_reference<deleter_type>::value, |
469 | deleter_type, const deleter_type&>::type __d) noexcept |
470 | : _M_t(__p, __d) { } |
471 | |
472 | /** Takes ownership of a pointer. |
473 | * |
474 | * @param __p A pointer to an array of a type safely convertible |
475 | * to an array of @c element_type |
476 | * @param __d A reference to a deleter. |
477 | * |
478 | * The deleter will be initialized with @p std::move(__d) |
479 | */ |
480 | template<typename _Up, |
481 | typename = typename enable_if< |
482 | __safe_conversion_raw<_Up>::value, bool>::type> |
483 | unique_ptr(_Up __p, typename |
484 | remove_reference<deleter_type>::type&& __d) noexcept |
485 | : _M_t(std::move(__p), std::move(__d)) |
486 | { static_assert(!is_reference<deleter_type>::value, |
487 | "rvalue deleter bound to reference"); } |
488 | |
489 | /// Move constructor. |
490 | unique_ptr(unique_ptr&& __u) noexcept |
491 | : _M_t(__u.release(), std::forward<deleter_type>(__u.get_deleter())) { } |
492 | |
493 | /// Creates a unique_ptr that owns nothing. |
494 | constexpr unique_ptr(nullptr_t) noexcept : unique_ptr() { } |
495 | |
496 | template<typename _Up, typename _Ep, |
497 | typename = _Require<__safe_conversion_up<_Up, _Ep>>> |
498 | unique_ptr(unique_ptr<_Up, _Ep>&& __u) noexcept |
499 | : _M_t(__u.release(), std::forward<_Ep>(__u.get_deleter())) |
500 | { } |
501 | |
502 | /// Destructor, invokes the deleter if the stored pointer is not null. |
503 | ~unique_ptr() |
504 | { |
505 | auto& __ptr = std::get<0>(_M_t); |
506 | if (__ptr != nullptr) |
507 | get_deleter()(__ptr); |
508 | __ptr = pointer(); |
509 | } |
510 | |
511 | // Assignment. |
512 | |
513 | /** @brief Move assignment operator. |
514 | * |
515 | * @param __u The object to transfer ownership from. |
516 | * |
517 | * Invokes the deleter first if this object owns a pointer. |
518 | */ |
519 | unique_ptr& |
520 | operator=(unique_ptr&& __u) noexcept |
521 | { |
522 | reset(__u.release()); |
523 | get_deleter() = std::forward<deleter_type>(__u.get_deleter()); |
524 | return *this; |
525 | } |
526 | |
527 | /** @brief Assignment from another type. |
528 | * |
529 | * @param __u The object to transfer ownership from, which owns a |
530 | * convertible pointer to an array object. |
531 | * |
532 | * Invokes the deleter first if this object owns a pointer. |
533 | */ |
534 | template<typename _Up, typename _Ep> |
535 | typename |
536 | enable_if<__and_<__safe_conversion_up<_Up, _Ep>, |
537 | is_assignable<deleter_type&, _Ep&&> |
538 | >::value, |
539 | unique_ptr&>::type |
540 | operator=(unique_ptr<_Up, _Ep>&& __u) noexcept |
541 | { |
542 | reset(__u.release()); |
543 | get_deleter() = std::forward<_Ep>(__u.get_deleter()); |
544 | return *this; |
545 | } |
546 | |
547 | /// Reset the %unique_ptr to empty, invoking the deleter if necessary. |
548 | unique_ptr& |
549 | operator=(nullptr_t) noexcept |
550 | { |
551 | reset(); |
552 | return *this; |
553 | } |
554 | |
555 | // Observers. |
556 | |
557 | /// Access an element of owned array. |
558 | typename std::add_lvalue_reference<element_type>::type |
559 | operator[](size_t __i) const |
560 | { |
561 | __glibcxx_assert(get() != pointer()); |
562 | return get()[__i]; |
563 | } |
564 | |
565 | /// Return the stored pointer. |
566 | pointer |
567 | get() const noexcept |
568 | { return std::get<0>(_M_t); } |
569 | |
570 | /// Return a reference to the stored deleter. |
571 | deleter_type& |
572 | get_deleter() noexcept |
573 | { return std::get<1>(_M_t); } |
574 | |
575 | /// Return a reference to the stored deleter. |
576 | const deleter_type& |
577 | get_deleter() const noexcept |
578 | { return std::get<1>(_M_t); } |
579 | |
580 | /// Return @c true if the stored pointer is not null. |
581 | explicit operator bool() const noexcept |
582 | { return get() == pointer() ? false : true; } |
583 | |
584 | // Modifiers. |
585 | |
586 | /// Release ownership of any stored pointer. |
587 | pointer |
588 | release() noexcept |
589 | { |
590 | pointer __p = get(); |
591 | std::get<0>(_M_t) = pointer(); |
592 | return __p; |
593 | } |
594 | |
595 | /** @brief Replace the stored pointer. |
596 | * |
597 | * @param __p The new pointer to store. |
598 | * |
599 | * The deleter will be invoked if a pointer is already owned. |
600 | */ |
601 | template <typename _Up, |
602 | typename = _Require< |
603 | __or_<is_same<_Up, pointer>, |
604 | __and_<is_same<pointer, element_type*>, |
605 | is_pointer<_Up>, |
606 | is_convertible< |
607 | typename remove_pointer<_Up>::type(*)[], |
608 | element_type(*)[] |
609 | > |
610 | > |
611 | > |
612 | >> |
613 | void |
614 | reset(_Up __p) noexcept |
615 | { |
616 | pointer __ptr = __p; |
617 | using std::swap; |
618 | swap(std::get<0>(_M_t), __ptr); |
619 | if (__ptr != nullptr) |
620 | get_deleter()(__ptr); |
621 | } |
622 | |
623 | void reset(nullptr_t = nullptr) noexcept |
624 | { |
625 | reset(pointer()); |
626 | } |
627 | |
628 | /// Exchange the pointer and deleter with another object. |
629 | void |
630 | swap(unique_ptr& __u) noexcept |
631 | { |
632 | using std::swap; |
633 | swap(_M_t, __u._M_t); |
634 | } |
635 | |
636 | // Disable copy from lvalue. |
637 | unique_ptr(const unique_ptr&) = delete; |
638 | unique_ptr& operator=(const unique_ptr&) = delete; |
639 | }; |
640 | |
641 | template<typename _Tp, typename _Dp> |
642 | inline void |
643 | swap(unique_ptr<_Tp, _Dp>& __x, |
644 | unique_ptr<_Tp, _Dp>& __y) noexcept |
645 | { __x.swap(__y); } |
646 | |
647 | template<typename _Tp, typename _Dp, |
648 | typename _Up, typename _Ep> |
649 | inline bool |
650 | operator==(const unique_ptr<_Tp, _Dp>& __x, |
651 | const unique_ptr<_Up, _Ep>& __y) |
652 | { return __x.get() == __y.get(); } |
653 | |
654 | template<typename _Tp, typename _Dp> |
655 | inline bool |
656 | operator==(const unique_ptr<_Tp, _Dp>& __x, nullptr_t) noexcept |
657 | { return !__x; } |
658 | |
659 | template<typename _Tp, typename _Dp> |
660 | inline bool |
661 | operator==(nullptr_t, const unique_ptr<_Tp, _Dp>& __x) noexcept |
662 | { return !__x; } |
663 | |
664 | template<typename _Tp, typename _Dp, |
665 | typename _Up, typename _Ep> |
666 | inline bool |
667 | operator!=(const unique_ptr<_Tp, _Dp>& __x, |
668 | const unique_ptr<_Up, _Ep>& __y) |
669 | { return __x.get() != __y.get(); } |
670 | |
671 | template<typename _Tp, typename _Dp> |
672 | inline bool |
673 | operator!=(const unique_ptr<_Tp, _Dp>& __x, nullptr_t) noexcept |
674 | { return (bool)__x; } |
675 | |
676 | template<typename _Tp, typename _Dp> |
677 | inline bool |
678 | operator!=(nullptr_t, const unique_ptr<_Tp, _Dp>& __x) noexcept |
679 | { return (bool)__x; } |
680 | |
681 | template<typename _Tp, typename _Dp, |
682 | typename _Up, typename _Ep> |
683 | inline bool |
684 | operator<(const unique_ptr<_Tp, _Dp>& __x, |
685 | const unique_ptr<_Up, _Ep>& __y) |
686 | { |
687 | typedef typename |
688 | std::common_type<typename unique_ptr<_Tp, _Dp>::pointer, |
689 | typename unique_ptr<_Up, _Ep>::pointer>::type _CT; |
690 | return std::less<_CT>()(__x.get(), __y.get()); |
691 | } |
692 | |
693 | template<typename _Tp, typename _Dp> |
694 | inline bool |
695 | operator<(const unique_ptr<_Tp, _Dp>& __x, nullptr_t) |
696 | { return std::less<typename unique_ptr<_Tp, _Dp>::pointer>()(__x.get(), |
697 | nullptr); } |
698 | |
699 | template<typename _Tp, typename _Dp> |
700 | inline bool |
701 | operator<(nullptr_t, const unique_ptr<_Tp, _Dp>& __x) |
702 | { return std::less<typename unique_ptr<_Tp, _Dp>::pointer>()(nullptr, |
703 | __x.get()); } |
704 | |
705 | template<typename _Tp, typename _Dp, |
706 | typename _Up, typename _Ep> |
707 | inline bool |
708 | operator<=(const unique_ptr<_Tp, _Dp>& __x, |
709 | const unique_ptr<_Up, _Ep>& __y) |
710 | { return !(__y < __x); } |
711 | |
712 | template<typename _Tp, typename _Dp> |
713 | inline bool |
714 | operator<=(const unique_ptr<_Tp, _Dp>& __x, nullptr_t) |
715 | { return !(nullptr < __x); } |
716 | |
717 | template<typename _Tp, typename _Dp> |
718 | inline bool |
719 | operator<=(nullptr_t, const unique_ptr<_Tp, _Dp>& __x) |
720 | { return !(__x < nullptr); } |
721 | |
722 | template<typename _Tp, typename _Dp, |
723 | typename _Up, typename _Ep> |
724 | inline bool |
725 | operator>(const unique_ptr<_Tp, _Dp>& __x, |
726 | const unique_ptr<_Up, _Ep>& __y) |
727 | { return (__y < __x); } |
728 | |
729 | template<typename _Tp, typename _Dp> |
730 | inline bool |
731 | operator>(const unique_ptr<_Tp, _Dp>& __x, nullptr_t) |
732 | { return std::less<typename unique_ptr<_Tp, _Dp>::pointer>()(nullptr, |
733 | __x.get()); } |
734 | |
735 | template<typename _Tp, typename _Dp> |
736 | inline bool |
737 | operator>(nullptr_t, const unique_ptr<_Tp, _Dp>& __x) |
738 | { return std::less<typename unique_ptr<_Tp, _Dp>::pointer>()(__x.get(), |
739 | nullptr); } |
740 | |
741 | template<typename _Tp, typename _Dp, |
742 | typename _Up, typename _Ep> |
743 | inline bool |
744 | operator>=(const unique_ptr<_Tp, _Dp>& __x, |
745 | const unique_ptr<_Up, _Ep>& __y) |
746 | { return !(__x < __y); } |
747 | |
748 | template<typename _Tp, typename _Dp> |
749 | inline bool |
750 | operator>=(const unique_ptr<_Tp, _Dp>& __x, nullptr_t) |
751 | { return !(__x < nullptr); } |
752 | |
753 | template<typename _Tp, typename _Dp> |
754 | inline bool |
755 | operator>=(nullptr_t, const unique_ptr<_Tp, _Dp>& __x) |
756 | { return !(nullptr < __x); } |
757 | |
758 | /// std::hash specialization for unique_ptr. |
759 | template<typename _Tp, typename _Dp> |
760 | struct hash<unique_ptr<_Tp, _Dp>> |
761 | : public __hash_base<size_t, unique_ptr<_Tp, _Dp>> |
762 | { |
763 | size_t |
764 | operator()(const unique_ptr<_Tp, _Dp>& __u) const noexcept |
765 | { |
766 | typedef unique_ptr<_Tp, _Dp> _UP; |
767 | return std::hash<typename _UP::pointer>()(__u.get()); |
768 | } |
769 | }; |
770 | |
771 | #if __cplusplus201402L > 201103L |
772 | |
773 | #define __cpp_lib_make_unique201304 201304 |
774 | |
775 | template<typename _Tp> |
776 | struct _MakeUniq |
777 | { typedef unique_ptr<_Tp> __single_object; }; |
778 | |
779 | template<typename _Tp> |
780 | struct _MakeUniq<_Tp[]> |
781 | { typedef unique_ptr<_Tp[]> __array; }; |
782 | |
783 | template<typename _Tp, size_t _Bound> |
784 | struct _MakeUniq<_Tp[_Bound]> |
785 | { struct __invalid_type { }; }; |
786 | |
787 | /// std::make_unique for single objects |
788 | template<typename _Tp, typename... _Args> |
789 | inline typename _MakeUniq<_Tp>::__single_object |
790 | make_unique(_Args&&... __args) |
791 | { return unique_ptr<_Tp>(new _Tp(std::forward<_Args>(__args)...)); } |
792 | |
793 | /// std::make_unique for arrays of unknown bound |
794 | template<typename _Tp> |
795 | inline typename _MakeUniq<_Tp>::__array |
796 | make_unique(size_t __num) |
797 | { return unique_ptr<_Tp>(new remove_extent_t<_Tp>[__num]()); } |
798 | |
799 | /// Disable std::make_unique for arrays of known bound |
800 | template<typename _Tp, typename... _Args> |
801 | inline typename _MakeUniq<_Tp>::__invalid_type |
802 | make_unique(_Args&&...) = delete; |
803 | #endif |
804 | |
805 | // @} group pointer_abstractions |
806 | |
807 | _GLIBCXX_END_NAMESPACE_VERSION |
808 | } // namespace |
809 | |
810 | #endif /* _UNIQUE_PTR_H */ |