File: | include/llvm/Support/Error.h |
Warning: | line 201, column 5 Potential leak of memory pointed to by 'Payload._M_t._M_head_impl' |
Press '?' to see keyboard shortcuts
Keyboard shortcuts:
1 | //===- CrashDebugger.cpp - Debug compilation crashes ----------------------===// | |||
2 | // | |||
3 | // The LLVM Compiler Infrastructure | |||
4 | // | |||
5 | // This file is distributed under the University of Illinois Open Source | |||
6 | // License. See LICENSE.TXT for details. | |||
7 | // | |||
8 | //===----------------------------------------------------------------------===// | |||
9 | // | |||
10 | // This file defines the bugpoint internals that narrow down compilation crashes | |||
11 | // | |||
12 | //===----------------------------------------------------------------------===// | |||
13 | ||||
14 | #include "BugDriver.h" | |||
15 | #include "ListReducer.h" | |||
16 | #include "ToolRunner.h" | |||
17 | #include "llvm/ADT/SmallPtrSet.h" | |||
18 | #include "llvm/ADT/StringSet.h" | |||
19 | #include "llvm/Analysis/TargetTransformInfo.h" | |||
20 | #include "llvm/Transforms/Utils/Local.h" | |||
21 | #include "llvm/IR/CFG.h" | |||
22 | #include "llvm/IR/Constants.h" | |||
23 | #include "llvm/IR/DebugInfo.h" | |||
24 | #include "llvm/IR/DerivedTypes.h" | |||
25 | #include "llvm/IR/Instructions.h" | |||
26 | #include "llvm/IR/LegacyPassManager.h" | |||
27 | #include "llvm/IR/Module.h" | |||
28 | #include "llvm/IR/ValueSymbolTable.h" | |||
29 | #include "llvm/IR/Verifier.h" | |||
30 | #include "llvm/Pass.h" | |||
31 | #include "llvm/Support/CommandLine.h" | |||
32 | #include "llvm/Support/FileUtilities.h" | |||
33 | #include "llvm/Transforms/Scalar.h" | |||
34 | #include "llvm/Transforms/Utils/BasicBlockUtils.h" | |||
35 | #include "llvm/Transforms/Utils/Cloning.h" | |||
36 | #include <set> | |||
37 | using namespace llvm; | |||
38 | ||||
39 | namespace { | |||
40 | cl::opt<bool> KeepMain("keep-main", | |||
41 | cl::desc("Force function reduction to keep main"), | |||
42 | cl::init(false)); | |||
43 | cl::opt<bool> NoGlobalRM("disable-global-remove", | |||
44 | cl::desc("Do not remove global variables"), | |||
45 | cl::init(false)); | |||
46 | ||||
47 | cl::opt<bool> ReplaceFuncsWithNull( | |||
48 | "replace-funcs-with-null", | |||
49 | cl::desc("When stubbing functions, replace all uses will null"), | |||
50 | cl::init(false)); | |||
51 | cl::opt<bool> DontReducePassList("disable-pass-list-reduction", | |||
52 | cl::desc("Skip pass list reduction steps"), | |||
53 | cl::init(false)); | |||
54 | ||||
55 | cl::opt<bool> NoNamedMDRM("disable-namedmd-remove", | |||
56 | cl::desc("Do not remove global named metadata"), | |||
57 | cl::init(false)); | |||
58 | cl::opt<bool> NoStripDebugInfo("disable-strip-debuginfo", | |||
59 | cl::desc("Do not strip debug info metadata"), | |||
60 | cl::init(false)); | |||
61 | cl::opt<bool> NoStripDebugTypeInfo("disable-strip-debug-types", | |||
62 | cl::desc("Do not strip debug type info metadata"), | |||
63 | cl::init(false)); | |||
64 | cl::opt<bool> VerboseErrors("verbose-errors", | |||
65 | cl::desc("Print the output of crashing program"), | |||
66 | cl::init(false)); | |||
67 | } | |||
68 | ||||
69 | namespace llvm { | |||
70 | class ReducePassList : public ListReducer<std::string> { | |||
71 | BugDriver &BD; | |||
72 | ||||
73 | public: | |||
74 | ReducePassList(BugDriver &bd) : BD(bd) {} | |||
75 | ||||
76 | // Return true iff running the "removed" passes succeeds, and running the | |||
77 | // "Kept" passes fail when run on the output of the "removed" passes. If we | |||
78 | // return true, we update the current module of bugpoint. | |||
79 | Expected<TestResult> doTest(std::vector<std::string> &Removed, | |||
80 | std::vector<std::string> &Kept) override; | |||
81 | }; | |||
82 | } | |||
83 | ||||
84 | Expected<ReducePassList::TestResult> | |||
85 | ReducePassList::doTest(std::vector<std::string> &Prefix, | |||
86 | std::vector<std::string> &Suffix) { | |||
87 | std::string PrefixOutput; | |||
88 | std::unique_ptr<Module> OrigProgram; | |||
89 | if (!Prefix.empty()) { | |||
90 | outs() << "Checking to see if these passes crash: " | |||
91 | << getPassesString(Prefix) << ": "; | |||
92 | if (BD.runPasses(BD.getProgram(), Prefix, PrefixOutput)) | |||
93 | return KeepPrefix; | |||
94 | ||||
95 | OrigProgram = std::move(BD.Program); | |||
96 | ||||
97 | BD.Program = parseInputFile(PrefixOutput, BD.getContext()); | |||
98 | if (BD.Program == nullptr) { | |||
99 | errs() << BD.getToolName() << ": Error reading bitcode file '" | |||
100 | << PrefixOutput << "'!\n"; | |||
101 | exit(1); | |||
102 | } | |||
103 | sys::fs::remove(PrefixOutput); | |||
104 | } | |||
105 | ||||
106 | outs() << "Checking to see if these passes crash: " << getPassesString(Suffix) | |||
107 | << ": "; | |||
108 | ||||
109 | if (BD.runPasses(BD.getProgram(), Suffix)) | |||
110 | return KeepSuffix; // The suffix crashes alone... | |||
111 | ||||
112 | // Nothing failed, restore state... | |||
113 | if (OrigProgram) | |||
114 | BD.Program = std::move(OrigProgram); | |||
115 | return NoFailure; | |||
116 | } | |||
117 | ||||
118 | using BugTester = bool (*)(const BugDriver &, Module *); | |||
119 | ||||
120 | namespace { | |||
121 | /// ReduceCrashingGlobalInitializers - This works by removing global variable | |||
122 | /// initializers and seeing if the program still crashes. If it does, then we | |||
123 | /// keep that program and try again. | |||
124 | class ReduceCrashingGlobalInitializers : public ListReducer<GlobalVariable *> { | |||
125 | BugDriver &BD; | |||
126 | BugTester TestFn; | |||
127 | ||||
128 | public: | |||
129 | ReduceCrashingGlobalInitializers(BugDriver &bd, BugTester testFn) | |||
130 | : BD(bd), TestFn(testFn) {} | |||
131 | ||||
132 | Expected<TestResult> doTest(std::vector<GlobalVariable *> &Prefix, | |||
133 | std::vector<GlobalVariable *> &Kept) override { | |||
134 | if (!Kept.empty() && TestGlobalVariables(Kept)) | |||
135 | return KeepSuffix; | |||
136 | if (!Prefix.empty() && TestGlobalVariables(Prefix)) | |||
137 | return KeepPrefix; | |||
138 | return NoFailure; | |||
139 | } | |||
140 | ||||
141 | bool TestGlobalVariables(std::vector<GlobalVariable *> &GVs); | |||
142 | }; | |||
143 | } | |||
144 | ||||
145 | bool ReduceCrashingGlobalInitializers::TestGlobalVariables( | |||
146 | std::vector<GlobalVariable *> &GVs) { | |||
147 | // Clone the program to try hacking it apart... | |||
148 | ValueToValueMapTy VMap; | |||
149 | std::unique_ptr<Module> M = CloneModule(BD.getProgram(), VMap); | |||
150 | ||||
151 | // Convert list to set for fast lookup... | |||
152 | std::set<GlobalVariable *> GVSet; | |||
153 | ||||
154 | for (unsigned i = 0, e = GVs.size(); i != e; ++i) { | |||
155 | GlobalVariable *CMGV = cast<GlobalVariable>(VMap[GVs[i]]); | |||
156 | assert(CMGV && "Global Variable not in module?!")((CMGV && "Global Variable not in module?!") ? static_cast <void> (0) : __assert_fail ("CMGV && \"Global Variable not in module?!\"" , "/build/llvm-toolchain-snapshot-8~svn345461/tools/bugpoint/CrashDebugger.cpp" , 156, __PRETTY_FUNCTION__)); | |||
157 | GVSet.insert(CMGV); | |||
158 | } | |||
159 | ||||
160 | outs() << "Checking for crash with only these global variables: "; | |||
161 | PrintGlobalVariableList(GVs); | |||
162 | outs() << ": "; | |||
163 | ||||
164 | // Loop over and delete any global variables which we aren't supposed to be | |||
165 | // playing with... | |||
166 | for (GlobalVariable &I : M->globals()) | |||
167 | if (I.hasInitializer() && !GVSet.count(&I)) { | |||
168 | DeleteGlobalInitializer(&I); | |||
169 | I.setLinkage(GlobalValue::ExternalLinkage); | |||
170 | I.setComdat(nullptr); | |||
171 | } | |||
172 | ||||
173 | // Try running the hacked up program... | |||
174 | if (TestFn(BD, M.get())) { | |||
175 | BD.setNewProgram(std::move(M)); // It crashed, keep the trimmed version... | |||
176 | ||||
177 | // Make sure to use global variable pointers that point into the now-current | |||
178 | // module. | |||
179 | GVs.assign(GVSet.begin(), GVSet.end()); | |||
180 | return true; | |||
181 | } | |||
182 | ||||
183 | return false; | |||
184 | } | |||
185 | ||||
186 | namespace { | |||
187 | /// ReduceCrashingFunctions reducer - This works by removing functions and | |||
188 | /// seeing if the program still crashes. If it does, then keep the newer, | |||
189 | /// smaller program. | |||
190 | /// | |||
191 | class ReduceCrashingFunctions : public ListReducer<Function *> { | |||
192 | BugDriver &BD; | |||
193 | BugTester TestFn; | |||
194 | ||||
195 | public: | |||
196 | ReduceCrashingFunctions(BugDriver &bd, BugTester testFn) | |||
197 | : BD(bd), TestFn(testFn) {} | |||
198 | ||||
199 | Expected<TestResult> doTest(std::vector<Function *> &Prefix, | |||
200 | std::vector<Function *> &Kept) override { | |||
201 | if (!Kept.empty() && TestFuncs(Kept)) | |||
202 | return KeepSuffix; | |||
203 | if (!Prefix.empty() && TestFuncs(Prefix)) | |||
204 | return KeepPrefix; | |||
205 | return NoFailure; | |||
206 | } | |||
207 | ||||
208 | bool TestFuncs(std::vector<Function *> &Prefix); | |||
209 | }; | |||
210 | } | |||
211 | ||||
212 | static void RemoveFunctionReferences(Module *M, const char *Name) { | |||
213 | auto *UsedVar = M->getGlobalVariable(Name, true); | |||
214 | if (!UsedVar || !UsedVar->hasInitializer()) | |||
215 | return; | |||
216 | if (isa<ConstantAggregateZero>(UsedVar->getInitializer())) { | |||
217 | assert(UsedVar->use_empty())((UsedVar->use_empty()) ? static_cast<void> (0) : __assert_fail ("UsedVar->use_empty()", "/build/llvm-toolchain-snapshot-8~svn345461/tools/bugpoint/CrashDebugger.cpp" , 217, __PRETTY_FUNCTION__)); | |||
218 | UsedVar->eraseFromParent(); | |||
219 | return; | |||
220 | } | |||
221 | auto *OldUsedVal = cast<ConstantArray>(UsedVar->getInitializer()); | |||
222 | std::vector<Constant *> Used; | |||
223 | for (Value *V : OldUsedVal->operand_values()) { | |||
224 | Constant *Op = cast<Constant>(V->stripPointerCasts()); | |||
225 | if (!Op->isNullValue()) { | |||
226 | Used.push_back(cast<Constant>(V)); | |||
227 | } | |||
228 | } | |||
229 | auto *NewValElemTy = OldUsedVal->getType()->getElementType(); | |||
230 | auto *NewValTy = ArrayType::get(NewValElemTy, Used.size()); | |||
231 | auto *NewUsedVal = ConstantArray::get(NewValTy, Used); | |||
232 | UsedVar->mutateType(NewUsedVal->getType()->getPointerTo()); | |||
233 | UsedVar->setInitializer(NewUsedVal); | |||
234 | } | |||
235 | ||||
236 | bool ReduceCrashingFunctions::TestFuncs(std::vector<Function *> &Funcs) { | |||
237 | // If main isn't present, claim there is no problem. | |||
238 | if (KeepMain && !is_contained(Funcs, BD.getProgram().getFunction("main"))) | |||
239 | return false; | |||
240 | ||||
241 | // Clone the program to try hacking it apart... | |||
242 | ValueToValueMapTy VMap; | |||
243 | std::unique_ptr<Module> M = CloneModule(BD.getProgram(), VMap); | |||
244 | ||||
245 | // Convert list to set for fast lookup... | |||
246 | std::set<Function *> Functions; | |||
247 | for (unsigned i = 0, e = Funcs.size(); i != e; ++i) { | |||
248 | Function *CMF = cast<Function>(VMap[Funcs[i]]); | |||
249 | assert(CMF && "Function not in module?!")((CMF && "Function not in module?!") ? static_cast< void> (0) : __assert_fail ("CMF && \"Function not in module?!\"" , "/build/llvm-toolchain-snapshot-8~svn345461/tools/bugpoint/CrashDebugger.cpp" , 249, __PRETTY_FUNCTION__)); | |||
250 | assert(CMF->getFunctionType() == Funcs[i]->getFunctionType() && "wrong ty")((CMF->getFunctionType() == Funcs[i]->getFunctionType() && "wrong ty") ? static_cast<void> (0) : __assert_fail ("CMF->getFunctionType() == Funcs[i]->getFunctionType() && \"wrong ty\"" , "/build/llvm-toolchain-snapshot-8~svn345461/tools/bugpoint/CrashDebugger.cpp" , 250, __PRETTY_FUNCTION__)); | |||
251 | assert(CMF->getName() == Funcs[i]->getName() && "wrong name")((CMF->getName() == Funcs[i]->getName() && "wrong name" ) ? static_cast<void> (0) : __assert_fail ("CMF->getName() == Funcs[i]->getName() && \"wrong name\"" , "/build/llvm-toolchain-snapshot-8~svn345461/tools/bugpoint/CrashDebugger.cpp" , 251, __PRETTY_FUNCTION__)); | |||
252 | Functions.insert(CMF); | |||
253 | } | |||
254 | ||||
255 | outs() << "Checking for crash with only these functions: "; | |||
256 | PrintFunctionList(Funcs); | |||
257 | outs() << ": "; | |||
258 | if (!ReplaceFuncsWithNull) { | |||
259 | // Loop over and delete any functions which we aren't supposed to be playing | |||
260 | // with... | |||
261 | for (Function &I : *M) | |||
262 | if (!I.isDeclaration() && !Functions.count(&I)) | |||
263 | DeleteFunctionBody(&I); | |||
264 | } else { | |||
265 | std::vector<GlobalValue *> ToRemove; | |||
266 | // First, remove aliases to functions we're about to purge. | |||
267 | for (GlobalAlias &Alias : M->aliases()) { | |||
268 | GlobalObject *Root = Alias.getBaseObject(); | |||
269 | Function *F = dyn_cast_or_null<Function>(Root); | |||
270 | if (F) { | |||
271 | if (Functions.count(F)) | |||
272 | // We're keeping this function. | |||
273 | continue; | |||
274 | } else if (Root->isNullValue()) { | |||
275 | // This referenced a globalalias that we've already replaced, | |||
276 | // so we still need to replace this alias. | |||
277 | } else if (!F) { | |||
278 | // Not a function, therefore not something we mess with. | |||
279 | continue; | |||
280 | } | |||
281 | ||||
282 | PointerType *Ty = cast<PointerType>(Alias.getType()); | |||
283 | Constant *Replacement = ConstantPointerNull::get(Ty); | |||
284 | Alias.replaceAllUsesWith(Replacement); | |||
285 | ToRemove.push_back(&Alias); | |||
286 | } | |||
287 | ||||
288 | for (Function &I : *M) { | |||
289 | if (!I.isDeclaration() && !Functions.count(&I)) { | |||
290 | PointerType *Ty = cast<PointerType>(I.getType()); | |||
291 | Constant *Replacement = ConstantPointerNull::get(Ty); | |||
292 | I.replaceAllUsesWith(Replacement); | |||
293 | ToRemove.push_back(&I); | |||
294 | } | |||
295 | } | |||
296 | ||||
297 | for (auto *F : ToRemove) { | |||
298 | F->eraseFromParent(); | |||
299 | } | |||
300 | ||||
301 | // Finally, remove any null members from any global intrinsic. | |||
302 | RemoveFunctionReferences(M.get(), "llvm.used"); | |||
303 | RemoveFunctionReferences(M.get(), "llvm.compiler.used"); | |||
304 | } | |||
305 | // Try running the hacked up program... | |||
306 | if (TestFn(BD, M.get())) { | |||
307 | BD.setNewProgram(std::move(M)); // It crashed, keep the trimmed version... | |||
308 | ||||
309 | // Make sure to use function pointers that point into the now-current | |||
310 | // module. | |||
311 | Funcs.assign(Functions.begin(), Functions.end()); | |||
312 | return true; | |||
313 | } | |||
314 | return false; | |||
315 | } | |||
316 | ||||
317 | namespace { | |||
318 | /// Simplify the CFG without completely destroying it. | |||
319 | /// This is not well defined, but basically comes down to "try to eliminate | |||
320 | /// unreachable blocks and constant fold terminators without deciding that | |||
321 | /// certain undefined behavior cuts off the program at the legs". | |||
322 | void simpleSimplifyCfg(Function &F, SmallVectorImpl<BasicBlock *> &BBs) { | |||
323 | if (F.empty()) | |||
324 | return; | |||
325 | ||||
326 | for (auto *BB : BBs) { | |||
327 | ConstantFoldTerminator(BB); | |||
328 | MergeBlockIntoPredecessor(BB); | |||
329 | } | |||
330 | ||||
331 | // Remove unreachable blocks | |||
332 | // removeUnreachableBlocks can't be used here, it will turn various | |||
333 | // undefined behavior into unreachables, but bugpoint was the thing that | |||
334 | // generated the undefined behavior, and we don't want it to kill the entire | |||
335 | // program. | |||
336 | SmallPtrSet<BasicBlock *, 16> Visited; | |||
337 | for (auto *BB : depth_first(&F.getEntryBlock())) | |||
338 | Visited.insert(BB); | |||
339 | ||||
340 | SmallVector<BasicBlock *, 16> Unreachable; | |||
341 | for (auto &BB : F) | |||
342 | if (!Visited.count(&BB)) | |||
343 | Unreachable.push_back(&BB); | |||
344 | ||||
345 | // The dead BB's may be in a dead cycle or otherwise have references to each | |||
346 | // other. Because of this, we have to drop all references first, then delete | |||
347 | // them all at once. | |||
348 | for (auto *BB : Unreachable) { | |||
349 | for (BasicBlock *Successor : successors(&*BB)) | |||
350 | if (Visited.count(Successor)) | |||
351 | Successor->removePredecessor(&*BB); | |||
352 | BB->dropAllReferences(); | |||
353 | } | |||
354 | for (auto *BB : Unreachable) | |||
355 | BB->eraseFromParent(); | |||
356 | } | |||
357 | /// ReduceCrashingBlocks reducer - This works by setting the terminators of | |||
358 | /// all terminators except the specified basic blocks to a 'ret' instruction, | |||
359 | /// then running the simplify-cfg pass. This has the effect of chopping up | |||
360 | /// the CFG really fast which can reduce large functions quickly. | |||
361 | /// | |||
362 | class ReduceCrashingBlocks : public ListReducer<const BasicBlock *> { | |||
363 | BugDriver &BD; | |||
364 | BugTester TestFn; | |||
365 | ||||
366 | public: | |||
367 | ReduceCrashingBlocks(BugDriver &BD, BugTester testFn) | |||
368 | : BD(BD), TestFn(testFn) {} | |||
369 | ||||
370 | Expected<TestResult> doTest(std::vector<const BasicBlock *> &Prefix, | |||
371 | std::vector<const BasicBlock *> &Kept) override { | |||
372 | if (!Kept.empty() && TestBlocks(Kept)) | |||
373 | return KeepSuffix; | |||
374 | if (!Prefix.empty() && TestBlocks(Prefix)) | |||
375 | return KeepPrefix; | |||
376 | return NoFailure; | |||
377 | } | |||
378 | ||||
379 | bool TestBlocks(std::vector<const BasicBlock *> &Prefix); | |||
380 | }; | |||
381 | } | |||
382 | ||||
383 | bool ReduceCrashingBlocks::TestBlocks(std::vector<const BasicBlock *> &BBs) { | |||
384 | // Clone the program to try hacking it apart... | |||
385 | ValueToValueMapTy VMap; | |||
386 | std::unique_ptr<Module> M = CloneModule(BD.getProgram(), VMap); | |||
387 | ||||
388 | // Convert list to set for fast lookup... | |||
389 | SmallPtrSet<BasicBlock *, 8> Blocks; | |||
390 | for (unsigned i = 0, e = BBs.size(); i != e; ++i) | |||
391 | Blocks.insert(cast<BasicBlock>(VMap[BBs[i]])); | |||
392 | ||||
393 | outs() << "Checking for crash with only these blocks:"; | |||
394 | unsigned NumPrint = Blocks.size(); | |||
395 | if (NumPrint > 10) | |||
396 | NumPrint = 10; | |||
397 | for (unsigned i = 0, e = NumPrint; i != e; ++i) | |||
398 | outs() << " " << BBs[i]->getName(); | |||
399 | if (NumPrint < Blocks.size()) | |||
400 | outs() << "... <" << Blocks.size() << " total>"; | |||
401 | outs() << ": "; | |||
402 | ||||
403 | // Loop over and delete any hack up any blocks that are not listed... | |||
404 | for (Function &F : M->functions()) { | |||
405 | for (BasicBlock &BB : F) { | |||
406 | if (!Blocks.count(&BB) && BB.getTerminator()->getNumSuccessors()) { | |||
407 | // Loop over all of the successors of this block, deleting any PHI nodes | |||
408 | // that might include it. | |||
409 | for (BasicBlock *Succ : successors(&BB)) | |||
410 | Succ->removePredecessor(&BB); | |||
411 | ||||
412 | Instruction *BBTerm = BB.getTerminator(); | |||
413 | if (BBTerm->isEHPad() || BBTerm->getType()->isTokenTy()) | |||
414 | continue; | |||
415 | if (!BBTerm->getType()->isVoidTy()) | |||
416 | BBTerm->replaceAllUsesWith(Constant::getNullValue(BBTerm->getType())); | |||
417 | ||||
418 | // Replace the old terminator instruction. | |||
419 | BB.getInstList().pop_back(); | |||
420 | new UnreachableInst(BB.getContext(), &BB); | |||
421 | } | |||
422 | } | |||
423 | } | |||
424 | ||||
425 | // The CFG Simplifier pass may delete one of the basic blocks we are | |||
426 | // interested in. If it does we need to take the block out of the list. Make | |||
427 | // a "persistent mapping" by turning basic blocks into <function, name> pairs. | |||
428 | // This won't work well if blocks are unnamed, but that is just the risk we | |||
429 | // have to take. FIXME: Can we just name the blocks? | |||
430 | std::vector<std::pair<std::string, std::string>> BlockInfo; | |||
431 | ||||
432 | for (BasicBlock *BB : Blocks) | |||
433 | BlockInfo.emplace_back(BB->getParent()->getName(), BB->getName()); | |||
434 | ||||
435 | SmallVector<BasicBlock *, 16> ToProcess; | |||
436 | for (auto &F : *M) { | |||
437 | for (auto &BB : F) | |||
438 | if (!Blocks.count(&BB)) | |||
439 | ToProcess.push_back(&BB); | |||
440 | simpleSimplifyCfg(F, ToProcess); | |||
441 | ToProcess.clear(); | |||
442 | } | |||
443 | // Verify we didn't break anything | |||
444 | std::vector<std::string> Passes; | |||
445 | Passes.push_back("verify"); | |||
446 | std::unique_ptr<Module> New = BD.runPassesOn(M.get(), Passes); | |||
447 | if (!New) { | |||
448 | errs() << "verify failed!\n"; | |||
449 | exit(1); | |||
450 | } | |||
451 | M = std::move(New); | |||
452 | ||||
453 | // Try running on the hacked up program... | |||
454 | if (TestFn(BD, M.get())) { | |||
455 | BD.setNewProgram(std::move(M)); // It crashed, keep the trimmed version... | |||
456 | ||||
457 | // Make sure to use basic block pointers that point into the now-current | |||
458 | // module, and that they don't include any deleted blocks. | |||
459 | BBs.clear(); | |||
460 | const ValueSymbolTable &GST = BD.getProgram().getValueSymbolTable(); | |||
461 | for (const auto &BI : BlockInfo) { | |||
462 | Function *F = cast<Function>(GST.lookup(BI.first)); | |||
463 | Value *V = F->getValueSymbolTable()->lookup(BI.second); | |||
464 | if (V && V->getType() == Type::getLabelTy(V->getContext())) | |||
465 | BBs.push_back(cast<BasicBlock>(V)); | |||
466 | } | |||
467 | return true; | |||
468 | } | |||
469 | // It didn't crash, try something else. | |||
470 | return false; | |||
471 | } | |||
472 | ||||
473 | namespace { | |||
474 | /// ReduceCrashingConditionals reducer - This works by changing | |||
475 | /// conditional branches to unconditional ones, then simplifying the CFG | |||
476 | /// This has the effect of chopping up the CFG really fast which can reduce | |||
477 | /// large functions quickly. | |||
478 | /// | |||
479 | class ReduceCrashingConditionals : public ListReducer<const BasicBlock *> { | |||
480 | BugDriver &BD; | |||
481 | BugTester TestFn; | |||
482 | bool Direction; | |||
483 | ||||
484 | public: | |||
485 | ReduceCrashingConditionals(BugDriver &bd, BugTester testFn, bool Direction) | |||
486 | : BD(bd), TestFn(testFn), Direction(Direction) {} | |||
487 | ||||
488 | Expected<TestResult> doTest(std::vector<const BasicBlock *> &Prefix, | |||
489 | std::vector<const BasicBlock *> &Kept) override { | |||
490 | if (!Kept.empty() && TestBlocks(Kept)) | |||
491 | return KeepSuffix; | |||
492 | if (!Prefix.empty() && TestBlocks(Prefix)) | |||
493 | return KeepPrefix; | |||
494 | return NoFailure; | |||
495 | } | |||
496 | ||||
497 | bool TestBlocks(std::vector<const BasicBlock *> &Prefix); | |||
498 | }; | |||
499 | } | |||
500 | ||||
501 | bool ReduceCrashingConditionals::TestBlocks( | |||
502 | std::vector<const BasicBlock *> &BBs) { | |||
503 | // Clone the program to try hacking it apart... | |||
504 | ValueToValueMapTy VMap; | |||
505 | std::unique_ptr<Module> M = CloneModule(BD.getProgram(), VMap); | |||
506 | ||||
507 | // Convert list to set for fast lookup... | |||
508 | SmallPtrSet<const BasicBlock *, 8> Blocks; | |||
509 | for (const auto *BB : BBs) | |||
510 | Blocks.insert(cast<BasicBlock>(VMap[BB])); | |||
511 | ||||
512 | outs() << "Checking for crash with changing conditionals to always jump to " | |||
513 | << (Direction ? "true" : "false") << ":"; | |||
514 | unsigned NumPrint = Blocks.size(); | |||
515 | if (NumPrint > 10) | |||
516 | NumPrint = 10; | |||
517 | for (unsigned i = 0, e = NumPrint; i != e; ++i) | |||
518 | outs() << " " << BBs[i]->getName(); | |||
519 | if (NumPrint < Blocks.size()) | |||
520 | outs() << "... <" << Blocks.size() << " total>"; | |||
521 | outs() << ": "; | |||
522 | ||||
523 | // Loop over and delete any hack up any blocks that are not listed... | |||
524 | for (auto &F : *M) | |||
525 | for (auto &BB : F) | |||
526 | if (!Blocks.count(&BB)) { | |||
527 | auto *BR = dyn_cast<BranchInst>(BB.getTerminator()); | |||
528 | if (!BR || !BR->isConditional()) | |||
529 | continue; | |||
530 | if (Direction) | |||
531 | BR->setCondition(ConstantInt::getTrue(BR->getContext())); | |||
532 | else | |||
533 | BR->setCondition(ConstantInt::getFalse(BR->getContext())); | |||
534 | } | |||
535 | ||||
536 | // The following may destroy some blocks, so we save them first | |||
537 | std::vector<std::pair<std::string, std::string>> BlockInfo; | |||
538 | ||||
539 | for (const BasicBlock *BB : Blocks) | |||
540 | BlockInfo.emplace_back(BB->getParent()->getName(), BB->getName()); | |||
541 | ||||
542 | SmallVector<BasicBlock *, 16> ToProcess; | |||
543 | for (auto &F : *M) { | |||
544 | for (auto &BB : F) | |||
545 | if (!Blocks.count(&BB)) | |||
546 | ToProcess.push_back(&BB); | |||
547 | simpleSimplifyCfg(F, ToProcess); | |||
548 | ToProcess.clear(); | |||
549 | } | |||
550 | // Verify we didn't break anything | |||
551 | std::vector<std::string> Passes; | |||
552 | Passes.push_back("verify"); | |||
553 | std::unique_ptr<Module> New = BD.runPassesOn(M.get(), Passes); | |||
554 | if (!New) { | |||
555 | errs() << "verify failed!\n"; | |||
556 | exit(1); | |||
557 | } | |||
558 | M = std::move(New); | |||
559 | ||||
560 | // Try running on the hacked up program... | |||
561 | if (TestFn(BD, M.get())) { | |||
562 | BD.setNewProgram(std::move(M)); // It crashed, keep the trimmed version... | |||
563 | ||||
564 | // Make sure to use basic block pointers that point into the now-current | |||
565 | // module, and that they don't include any deleted blocks. | |||
566 | BBs.clear(); | |||
567 | const ValueSymbolTable &GST = BD.getProgram().getValueSymbolTable(); | |||
568 | for (auto &BI : BlockInfo) { | |||
569 | auto *F = cast<Function>(GST.lookup(BI.first)); | |||
570 | Value *V = F->getValueSymbolTable()->lookup(BI.second); | |||
571 | if (V && V->getType() == Type::getLabelTy(V->getContext())) | |||
572 | BBs.push_back(cast<BasicBlock>(V)); | |||
573 | } | |||
574 | return true; | |||
575 | } | |||
576 | // It didn't crash, try something else. | |||
577 | return false; | |||
578 | } | |||
579 | ||||
580 | namespace { | |||
581 | /// SimplifyCFG reducer - This works by calling SimplifyCFG on each basic block | |||
582 | /// in the program. | |||
583 | ||||
584 | class ReduceSimplifyCFG : public ListReducer<const BasicBlock *> { | |||
585 | BugDriver &BD; | |||
586 | BugTester TestFn; | |||
587 | TargetTransformInfo TTI; | |||
588 | ||||
589 | public: | |||
590 | ReduceSimplifyCFG(BugDriver &bd, BugTester testFn) | |||
591 | : BD(bd), TestFn(testFn), TTI(bd.getProgram().getDataLayout()) {} | |||
592 | ||||
593 | Expected<TestResult> doTest(std::vector<const BasicBlock *> &Prefix, | |||
594 | std::vector<const BasicBlock *> &Kept) override { | |||
595 | if (!Kept.empty() && TestBlocks(Kept)) | |||
596 | return KeepSuffix; | |||
597 | if (!Prefix.empty() && TestBlocks(Prefix)) | |||
598 | return KeepPrefix; | |||
599 | return NoFailure; | |||
600 | } | |||
601 | ||||
602 | bool TestBlocks(std::vector<const BasicBlock *> &Prefix); | |||
603 | }; | |||
604 | } | |||
605 | ||||
606 | bool ReduceSimplifyCFG::TestBlocks(std::vector<const BasicBlock *> &BBs) { | |||
607 | // Clone the program to try hacking it apart... | |||
608 | ValueToValueMapTy VMap; | |||
609 | std::unique_ptr<Module> M = CloneModule(BD.getProgram(), VMap); | |||
610 | ||||
611 | // Convert list to set for fast lookup... | |||
612 | SmallPtrSet<const BasicBlock *, 8> Blocks; | |||
613 | for (const auto *BB : BBs) | |||
614 | Blocks.insert(cast<BasicBlock>(VMap[BB])); | |||
615 | ||||
616 | outs() << "Checking for crash with CFG simplifying:"; | |||
617 | unsigned NumPrint = Blocks.size(); | |||
618 | if (NumPrint > 10) | |||
619 | NumPrint = 10; | |||
620 | for (unsigned i = 0, e = NumPrint; i != e; ++i) | |||
621 | outs() << " " << BBs[i]->getName(); | |||
622 | if (NumPrint < Blocks.size()) | |||
623 | outs() << "... <" << Blocks.size() << " total>"; | |||
624 | outs() << ": "; | |||
625 | ||||
626 | // The following may destroy some blocks, so we save them first | |||
627 | std::vector<std::pair<std::string, std::string>> BlockInfo; | |||
628 | ||||
629 | for (const BasicBlock *BB : Blocks) | |||
630 | BlockInfo.emplace_back(BB->getParent()->getName(), BB->getName()); | |||
631 | ||||
632 | // Loop over and delete any hack up any blocks that are not listed... | |||
633 | for (auto &F : *M) | |||
634 | // Loop over all of the basic blocks and remove them if they are unneeded. | |||
635 | for (Function::iterator BBIt = F.begin(); BBIt != F.end();) { | |||
636 | if (!Blocks.count(&*BBIt)) { | |||
637 | ++BBIt; | |||
638 | continue; | |||
639 | } | |||
640 | simplifyCFG(&*BBIt++, TTI); | |||
641 | } | |||
642 | // Verify we didn't break anything | |||
643 | std::vector<std::string> Passes; | |||
644 | Passes.push_back("verify"); | |||
645 | std::unique_ptr<Module> New = BD.runPassesOn(M.get(), Passes); | |||
646 | if (!New) { | |||
647 | errs() << "verify failed!\n"; | |||
648 | exit(1); | |||
649 | } | |||
650 | M = std::move(New); | |||
651 | ||||
652 | // Try running on the hacked up program... | |||
653 | if (TestFn(BD, M.get())) { | |||
654 | BD.setNewProgram(std::move(M)); // It crashed, keep the trimmed version... | |||
655 | ||||
656 | // Make sure to use basic block pointers that point into the now-current | |||
657 | // module, and that they don't include any deleted blocks. | |||
658 | BBs.clear(); | |||
659 | const ValueSymbolTable &GST = BD.getProgram().getValueSymbolTable(); | |||
660 | for (auto &BI : BlockInfo) { | |||
661 | auto *F = cast<Function>(GST.lookup(BI.first)); | |||
662 | Value *V = F->getValueSymbolTable()->lookup(BI.second); | |||
663 | if (V && V->getType() == Type::getLabelTy(V->getContext())) | |||
664 | BBs.push_back(cast<BasicBlock>(V)); | |||
665 | } | |||
666 | return true; | |||
667 | } | |||
668 | // It didn't crash, try something else. | |||
669 | return false; | |||
670 | } | |||
671 | ||||
672 | namespace { | |||
673 | /// ReduceCrashingInstructions reducer - This works by removing the specified | |||
674 | /// non-terminator instructions and replacing them with undef. | |||
675 | /// | |||
676 | class ReduceCrashingInstructions : public ListReducer<const Instruction *> { | |||
677 | BugDriver &BD; | |||
678 | BugTester TestFn; | |||
679 | ||||
680 | public: | |||
681 | ReduceCrashingInstructions(BugDriver &bd, BugTester testFn) | |||
682 | : BD(bd), TestFn(testFn) {} | |||
683 | ||||
684 | Expected<TestResult> doTest(std::vector<const Instruction *> &Prefix, | |||
685 | std::vector<const Instruction *> &Kept) override { | |||
686 | if (!Kept.empty() && TestInsts(Kept)) | |||
687 | return KeepSuffix; | |||
688 | if (!Prefix.empty() && TestInsts(Prefix)) | |||
689 | return KeepPrefix; | |||
690 | return NoFailure; | |||
691 | } | |||
692 | ||||
693 | bool TestInsts(std::vector<const Instruction *> &Prefix); | |||
694 | }; | |||
695 | } | |||
696 | ||||
697 | bool ReduceCrashingInstructions::TestInsts( | |||
698 | std::vector<const Instruction *> &Insts) { | |||
699 | // Clone the program to try hacking it apart... | |||
700 | ValueToValueMapTy VMap; | |||
701 | std::unique_ptr<Module> M = CloneModule(BD.getProgram(), VMap); | |||
702 | ||||
703 | // Convert list to set for fast lookup... | |||
704 | SmallPtrSet<Instruction *, 32> Instructions; | |||
705 | for (unsigned i = 0, e = Insts.size(); i != e; ++i) { | |||
706 | assert(!Insts[i]->isTerminator())((!Insts[i]->isTerminator()) ? static_cast<void> (0) : __assert_fail ("!Insts[i]->isTerminator()", "/build/llvm-toolchain-snapshot-8~svn345461/tools/bugpoint/CrashDebugger.cpp" , 706, __PRETTY_FUNCTION__)); | |||
707 | Instructions.insert(cast<Instruction>(VMap[Insts[i]])); | |||
708 | } | |||
709 | ||||
710 | outs() << "Checking for crash with only " << Instructions.size(); | |||
711 | if (Instructions.size() == 1) | |||
712 | outs() << " instruction: "; | |||
713 | else | |||
714 | outs() << " instructions: "; | |||
715 | ||||
716 | for (Module::iterator MI = M->begin(), ME = M->end(); MI != ME; ++MI) | |||
717 | for (Function::iterator FI = MI->begin(), FE = MI->end(); FI != FE; ++FI) | |||
718 | for (BasicBlock::iterator I = FI->begin(), E = FI->end(); I != E;) { | |||
719 | Instruction *Inst = &*I++; | |||
720 | if (!Instructions.count(Inst) && !Inst->isTerminator() && | |||
721 | !Inst->isEHPad() && !Inst->getType()->isTokenTy() && | |||
722 | !Inst->isSwiftError()) { | |||
723 | if (!Inst->getType()->isVoidTy()) | |||
724 | Inst->replaceAllUsesWith(UndefValue::get(Inst->getType())); | |||
725 | Inst->eraseFromParent(); | |||
726 | } | |||
727 | } | |||
728 | ||||
729 | // Verify that this is still valid. | |||
730 | legacy::PassManager Passes; | |||
731 | Passes.add(createVerifierPass(/*FatalErrors=*/false)); | |||
732 | Passes.run(*M); | |||
733 | ||||
734 | // Try running on the hacked up program... | |||
735 | if (TestFn(BD, M.get())) { | |||
736 | BD.setNewProgram(std::move(M)); // It crashed, keep the trimmed version... | |||
737 | ||||
738 | // Make sure to use instruction pointers that point into the now-current | |||
739 | // module, and that they don't include any deleted blocks. | |||
740 | Insts.clear(); | |||
741 | for (Instruction *Inst : Instructions) | |||
742 | Insts.push_back(Inst); | |||
743 | return true; | |||
744 | } | |||
745 | // It didn't crash, try something else. | |||
746 | return false; | |||
747 | } | |||
748 | ||||
749 | namespace { | |||
750 | // Reduce the list of Named Metadata nodes. We keep this as a list of | |||
751 | // names to avoid having to convert back and forth every time. | |||
752 | class ReduceCrashingNamedMD : public ListReducer<std::string> { | |||
753 | BugDriver &BD; | |||
754 | BugTester TestFn; | |||
755 | ||||
756 | public: | |||
757 | ReduceCrashingNamedMD(BugDriver &bd, BugTester testFn) | |||
758 | : BD(bd), TestFn(testFn) {} | |||
759 | ||||
760 | Expected<TestResult> doTest(std::vector<std::string> &Prefix, | |||
761 | std::vector<std::string> &Kept) override { | |||
762 | if (!Kept.empty() && TestNamedMDs(Kept)) | |||
763 | return KeepSuffix; | |||
764 | if (!Prefix.empty() && TestNamedMDs(Prefix)) | |||
765 | return KeepPrefix; | |||
766 | return NoFailure; | |||
767 | } | |||
768 | ||||
769 | bool TestNamedMDs(std::vector<std::string> &NamedMDs); | |||
770 | }; | |||
771 | } | |||
772 | ||||
773 | bool ReduceCrashingNamedMD::TestNamedMDs(std::vector<std::string> &NamedMDs) { | |||
774 | ||||
775 | ValueToValueMapTy VMap; | |||
776 | std::unique_ptr<Module> M = CloneModule(BD.getProgram(), VMap); | |||
777 | ||||
778 | outs() << "Checking for crash with only these named metadata nodes:"; | |||
779 | unsigned NumPrint = std::min<size_t>(NamedMDs.size(), 10); | |||
780 | for (unsigned i = 0, e = NumPrint; i != e; ++i) | |||
781 | outs() << " " << NamedMDs[i]; | |||
782 | if (NumPrint < NamedMDs.size()) | |||
783 | outs() << "... <" << NamedMDs.size() << " total>"; | |||
784 | outs() << ": "; | |||
785 | ||||
786 | // Make a StringMap for faster lookup | |||
787 | StringSet<> Names; | |||
788 | for (const std::string &Name : NamedMDs) | |||
789 | Names.insert(Name); | |||
790 | ||||
791 | // First collect all the metadata to delete in a vector, then | |||
792 | // delete them all at once to avoid invalidating the iterator | |||
793 | std::vector<NamedMDNode *> ToDelete; | |||
794 | ToDelete.reserve(M->named_metadata_size() - Names.size()); | |||
795 | for (auto &NamedMD : M->named_metadata()) | |||
796 | // Always keep a nonempty llvm.dbg.cu because the Verifier would complain. | |||
797 | if (!Names.count(NamedMD.getName()) && | |||
798 | (!(NamedMD.getName() == "llvm.dbg.cu" && NamedMD.getNumOperands() > 0))) | |||
799 | ToDelete.push_back(&NamedMD); | |||
800 | ||||
801 | for (auto *NamedMD : ToDelete) | |||
802 | NamedMD->eraseFromParent(); | |||
803 | ||||
804 | // Verify that this is still valid. | |||
805 | legacy::PassManager Passes; | |||
806 | Passes.add(createVerifierPass(/*FatalErrors=*/false)); | |||
807 | Passes.run(*M); | |||
808 | ||||
809 | // Try running on the hacked up program... | |||
810 | if (TestFn(BD, M.get())) { | |||
811 | BD.setNewProgram(std::move(M)); // It crashed, keep the trimmed version... | |||
812 | return true; | |||
813 | } | |||
814 | return false; | |||
815 | } | |||
816 | ||||
817 | namespace { | |||
818 | // Reduce the list of operands to named metadata nodes | |||
819 | class ReduceCrashingNamedMDOps : public ListReducer<const MDNode *> { | |||
820 | BugDriver &BD; | |||
821 | BugTester TestFn; | |||
822 | ||||
823 | public: | |||
824 | ReduceCrashingNamedMDOps(BugDriver &bd, BugTester testFn) | |||
825 | : BD(bd), TestFn(testFn) {} | |||
826 | ||||
827 | Expected<TestResult> doTest(std::vector<const MDNode *> &Prefix, | |||
828 | std::vector<const MDNode *> &Kept) override { | |||
829 | if (!Kept.empty() && TestNamedMDOps(Kept)) | |||
830 | return KeepSuffix; | |||
831 | if (!Prefix.empty() && TestNamedMDOps(Prefix)) | |||
832 | return KeepPrefix; | |||
833 | return NoFailure; | |||
834 | } | |||
835 | ||||
836 | bool TestNamedMDOps(std::vector<const MDNode *> &NamedMDOps); | |||
837 | }; | |||
838 | } | |||
839 | ||||
840 | bool ReduceCrashingNamedMDOps::TestNamedMDOps( | |||
841 | std::vector<const MDNode *> &NamedMDOps) { | |||
842 | // Convert list to set for fast lookup... | |||
843 | SmallPtrSet<const MDNode *, 32> OldMDNodeOps; | |||
844 | for (unsigned i = 0, e = NamedMDOps.size(); i != e; ++i) { | |||
845 | OldMDNodeOps.insert(NamedMDOps[i]); | |||
846 | } | |||
847 | ||||
848 | outs() << "Checking for crash with only " << OldMDNodeOps.size(); | |||
849 | if (OldMDNodeOps.size() == 1) | |||
850 | outs() << " named metadata operand: "; | |||
851 | else | |||
852 | outs() << " named metadata operands: "; | |||
853 | ||||
854 | ValueToValueMapTy VMap; | |||
855 | std::unique_ptr<Module> M = CloneModule(BD.getProgram(), VMap); | |||
856 | ||||
857 | // This is a little wasteful. In the future it might be good if we could have | |||
858 | // these dropped during cloning. | |||
859 | for (auto &NamedMD : BD.getProgram().named_metadata()) { | |||
860 | // Drop the old one and create a new one | |||
861 | M->eraseNamedMetadata(M->getNamedMetadata(NamedMD.getName())); | |||
862 | NamedMDNode *NewNamedMDNode = | |||
863 | M->getOrInsertNamedMetadata(NamedMD.getName()); | |||
864 | for (MDNode *op : NamedMD.operands()) | |||
865 | if (OldMDNodeOps.count(op)) | |||
866 | NewNamedMDNode->addOperand(cast<MDNode>(MapMetadata(op, VMap))); | |||
867 | } | |||
868 | ||||
869 | // Verify that this is still valid. | |||
870 | legacy::PassManager Passes; | |||
871 | Passes.add(createVerifierPass(/*FatalErrors=*/false)); | |||
872 | Passes.run(*M); | |||
873 | ||||
874 | // Try running on the hacked up program... | |||
875 | if (TestFn(BD, M.get())) { | |||
876 | // Make sure to use instruction pointers that point into the now-current | |||
877 | // module, and that they don't include any deleted blocks. | |||
878 | NamedMDOps.clear(); | |||
879 | for (const MDNode *Node : OldMDNodeOps) | |||
880 | NamedMDOps.push_back(cast<MDNode>(*VMap.getMappedMD(Node))); | |||
881 | ||||
882 | BD.setNewProgram(std::move(M)); // It crashed, keep the trimmed version... | |||
883 | return true; | |||
884 | } | |||
885 | // It didn't crash, try something else. | |||
886 | return false; | |||
887 | } | |||
888 | ||||
889 | /// Attempt to eliminate as many global initializers as possible. | |||
890 | static Error ReduceGlobalInitializers(BugDriver &BD, BugTester TestFn) { | |||
891 | Module &OrigM = BD.getProgram(); | |||
892 | if (OrigM.global_empty()) | |||
893 | return Error::success(); | |||
894 | ||||
895 | // Now try to reduce the number of global variable initializers in the | |||
896 | // module to something small. | |||
897 | std::unique_ptr<Module> M = CloneModule(OrigM); | |||
898 | bool DeletedInit = false; | |||
899 | ||||
900 | for (GlobalVariable &GV : M->globals()) { | |||
901 | if (GV.hasInitializer()) { | |||
902 | DeleteGlobalInitializer(&GV); | |||
903 | GV.setLinkage(GlobalValue::ExternalLinkage); | |||
904 | GV.setComdat(nullptr); | |||
905 | DeletedInit = true; | |||
906 | } | |||
907 | } | |||
908 | ||||
909 | if (!DeletedInit) | |||
910 | return Error::success(); | |||
911 | ||||
912 | // See if the program still causes a crash... | |||
913 | outs() << "\nChecking to see if we can delete global inits: "; | |||
914 | ||||
915 | if (TestFn(BD, M.get())) { // Still crashes? | |||
916 | BD.setNewProgram(std::move(M)); | |||
917 | outs() << "\n*** Able to remove all global initializers!\n"; | |||
918 | return Error::success(); | |||
919 | } | |||
920 | ||||
921 | // No longer crashes. | |||
922 | outs() << " - Removing all global inits hides problem!\n"; | |||
923 | ||||
924 | std::vector<GlobalVariable *> GVs; | |||
925 | for (GlobalVariable &GV : OrigM.globals()) | |||
926 | if (GV.hasInitializer()) | |||
927 | GVs.push_back(&GV); | |||
928 | ||||
929 | if (GVs.size() > 1 && !BugpointIsInterrupted) { | |||
930 | outs() << "\n*** Attempting to reduce the number of global initializers " | |||
931 | << "in the testcase\n"; | |||
932 | ||||
933 | unsigned OldSize = GVs.size(); | |||
934 | Expected<bool> Result = | |||
935 | ReduceCrashingGlobalInitializers(BD, TestFn).reduceList(GVs); | |||
936 | if (Error E = Result.takeError()) | |||
937 | return E; | |||
938 | ||||
939 | if (GVs.size() < OldSize) | |||
940 | BD.EmitProgressBitcode(BD.getProgram(), "reduced-global-variables"); | |||
941 | } | |||
942 | return Error::success(); | |||
943 | } | |||
944 | ||||
945 | static Error ReduceInsts(BugDriver &BD, BugTester TestFn) { | |||
946 | // Attempt to delete instructions using bisection. This should help out nasty | |||
947 | // cases with large basic blocks where the problem is at one end. | |||
948 | if (!BugpointIsInterrupted) { | |||
949 | std::vector<const Instruction *> Insts; | |||
950 | for (const Function &F : BD.getProgram()) | |||
951 | for (const BasicBlock &BB : F) | |||
952 | for (const Instruction &I : BB) | |||
953 | if (!I.isTerminator()) | |||
954 | Insts.push_back(&I); | |||
955 | ||||
956 | Expected<bool> Result = | |||
957 | ReduceCrashingInstructions(BD, TestFn).reduceList(Insts); | |||
958 | if (Error E = Result.takeError()) | |||
959 | return E; | |||
960 | } | |||
961 | ||||
962 | unsigned Simplification = 2; | |||
963 | do { | |||
964 | if (BugpointIsInterrupted) | |||
965 | // TODO: Should we distinguish this with an "interrupted error"? | |||
966 | return Error::success(); | |||
967 | --Simplification; | |||
968 | outs() << "\n*** Attempting to reduce testcase by deleting instruc" | |||
969 | << "tions: Simplification Level #" << Simplification << '\n'; | |||
970 | ||||
971 | // Now that we have deleted the functions that are unnecessary for the | |||
972 | // program, try to remove instructions that are not necessary to cause the | |||
973 | // crash. To do this, we loop through all of the instructions in the | |||
974 | // remaining functions, deleting them (replacing any values produced with | |||
975 | // nulls), and then running ADCE and SimplifyCFG. If the transformed input | |||
976 | // still triggers failure, keep deleting until we cannot trigger failure | |||
977 | // anymore. | |||
978 | // | |||
979 | unsigned InstructionsToSkipBeforeDeleting = 0; | |||
980 | TryAgain: | |||
981 | ||||
982 | // Loop over all of the (non-terminator) instructions remaining in the | |||
983 | // function, attempting to delete them. | |||
984 | unsigned CurInstructionNum = 0; | |||
985 | for (Module::const_iterator FI = BD.getProgram().begin(), | |||
986 | E = BD.getProgram().end(); | |||
987 | FI != E; ++FI) | |||
988 | if (!FI->isDeclaration()) | |||
989 | for (Function::const_iterator BI = FI->begin(), E = FI->end(); BI != E; | |||
990 | ++BI) | |||
991 | for (BasicBlock::const_iterator I = BI->begin(), E = --BI->end(); | |||
992 | I != E; ++I, ++CurInstructionNum) { | |||
993 | if (InstructionsToSkipBeforeDeleting) { | |||
994 | --InstructionsToSkipBeforeDeleting; | |||
995 | } else { | |||
996 | if (BugpointIsInterrupted) | |||
997 | // TODO: Should this be some kind of interrupted error? | |||
998 | return Error::success(); | |||
999 | ||||
1000 | if (I->isEHPad() || I->getType()->isTokenTy() || | |||
1001 | I->isSwiftError()) | |||
1002 | continue; | |||
1003 | ||||
1004 | outs() << "Checking instruction: " << *I; | |||
1005 | std::unique_ptr<Module> M = | |||
1006 | BD.deleteInstructionFromProgram(&*I, Simplification); | |||
1007 | ||||
1008 | // Find out if the pass still crashes on this pass... | |||
1009 | if (TestFn(BD, M.get())) { | |||
1010 | // Yup, it does, we delete the old module, and continue trying | |||
1011 | // to reduce the testcase... | |||
1012 | BD.setNewProgram(std::move(M)); | |||
1013 | InstructionsToSkipBeforeDeleting = CurInstructionNum; | |||
1014 | goto TryAgain; // I wish I had a multi-level break here! | |||
1015 | } | |||
1016 | } | |||
1017 | } | |||
1018 | ||||
1019 | if (InstructionsToSkipBeforeDeleting) { | |||
1020 | InstructionsToSkipBeforeDeleting = 0; | |||
1021 | goto TryAgain; | |||
1022 | } | |||
1023 | ||||
1024 | } while (Simplification); | |||
1025 | BD.EmitProgressBitcode(BD.getProgram(), "reduced-instructions"); | |||
1026 | return Error::success(); | |||
1027 | } | |||
1028 | ||||
1029 | /// DebugACrash - Given a predicate that determines whether a component crashes | |||
1030 | /// on a program, try to destructively reduce the program while still keeping | |||
1031 | /// the predicate true. | |||
1032 | static Error DebugACrash(BugDriver &BD, BugTester TestFn) { | |||
1033 | // See if we can get away with nuking some of the global variable initializers | |||
1034 | // in the program... | |||
1035 | if (!NoGlobalRM) | |||
1036 | if (Error E = ReduceGlobalInitializers(BD, TestFn)) | |||
1037 | return E; | |||
1038 | ||||
1039 | // Now try to reduce the number of functions in the module to something small. | |||
1040 | std::vector<Function *> Functions; | |||
1041 | for (Function &F : BD.getProgram()) | |||
1042 | if (!F.isDeclaration()) | |||
1043 | Functions.push_back(&F); | |||
1044 | ||||
1045 | if (Functions.size() > 1 && !BugpointIsInterrupted) { | |||
1046 | outs() << "\n*** Attempting to reduce the number of functions " | |||
1047 | "in the testcase\n"; | |||
1048 | ||||
1049 | unsigned OldSize = Functions.size(); | |||
1050 | Expected<bool> Result = | |||
1051 | ReduceCrashingFunctions(BD, TestFn).reduceList(Functions); | |||
1052 | if (Error E = Result.takeError()) | |||
1053 | return E; | |||
1054 | ||||
1055 | if (Functions.size() < OldSize) | |||
1056 | BD.EmitProgressBitcode(BD.getProgram(), "reduced-function"); | |||
1057 | } | |||
1058 | ||||
1059 | // Attempt to change conditional branches into unconditional branches to | |||
1060 | // eliminate blocks. | |||
1061 | if (!DisableSimplifyCFG && !BugpointIsInterrupted) { | |||
1062 | std::vector<const BasicBlock *> Blocks; | |||
1063 | for (Function &F : BD.getProgram()) | |||
1064 | for (BasicBlock &BB : F) | |||
1065 | Blocks.push_back(&BB); | |||
1066 | unsigned OldSize = Blocks.size(); | |||
1067 | Expected<bool> Result = | |||
1068 | ReduceCrashingConditionals(BD, TestFn, true).reduceList(Blocks); | |||
1069 | if (Error E = Result.takeError()) | |||
1070 | return E; | |||
1071 | Result = ReduceCrashingConditionals(BD, TestFn, false).reduceList(Blocks); | |||
1072 | if (Error E = Result.takeError()) | |||
1073 | return E; | |||
1074 | if (Blocks.size() < OldSize) | |||
1075 | BD.EmitProgressBitcode(BD.getProgram(), "reduced-conditionals"); | |||
1076 | } | |||
1077 | ||||
1078 | // Attempt to delete entire basic blocks at a time to speed up | |||
1079 | // convergence... this actually works by setting the terminator of the blocks | |||
1080 | // to a return instruction then running simplifycfg, which can potentially | |||
1081 | // shrinks the code dramatically quickly | |||
1082 | // | |||
1083 | if (!DisableSimplifyCFG && !BugpointIsInterrupted) { | |||
1084 | std::vector<const BasicBlock *> Blocks; | |||
1085 | for (Function &F : BD.getProgram()) | |||
1086 | for (BasicBlock &BB : F) | |||
1087 | Blocks.push_back(&BB); | |||
1088 | unsigned OldSize = Blocks.size(); | |||
1089 | Expected<bool> Result = ReduceCrashingBlocks(BD, TestFn).reduceList(Blocks); | |||
1090 | if (Error E = Result.takeError()) | |||
1091 | return E; | |||
1092 | if (Blocks.size() < OldSize) | |||
1093 | BD.EmitProgressBitcode(BD.getProgram(), "reduced-blocks"); | |||
1094 | } | |||
1095 | ||||
1096 | if (!DisableSimplifyCFG && !BugpointIsInterrupted) { | |||
1097 | std::vector<const BasicBlock *> Blocks; | |||
1098 | for (Function &F : BD.getProgram()) | |||
1099 | for (BasicBlock &BB : F) | |||
1100 | Blocks.push_back(&BB); | |||
1101 | unsigned OldSize = Blocks.size(); | |||
1102 | Expected<bool> Result = ReduceSimplifyCFG(BD, TestFn).reduceList(Blocks); | |||
1103 | if (Error E = Result.takeError()) | |||
1104 | return E; | |||
1105 | if (Blocks.size() < OldSize) | |||
1106 | BD.EmitProgressBitcode(BD.getProgram(), "reduced-simplifycfg"); | |||
1107 | } | |||
1108 | ||||
1109 | // Attempt to delete instructions using bisection. This should help out nasty | |||
1110 | // cases with large basic blocks where the problem is at one end. | |||
1111 | if (!BugpointIsInterrupted) | |||
1112 | if (Error E = ReduceInsts(BD, TestFn)) | |||
1113 | return E; | |||
1114 | ||||
1115 | // Attempt to strip debug info metadata. | |||
1116 | auto stripMetadata = [&](std::function<bool(Module &)> strip) { | |||
1117 | std::unique_ptr<Module> M = CloneModule(BD.getProgram()); | |||
1118 | strip(*M); | |||
1119 | if (TestFn(BD, M.get())) | |||
1120 | BD.setNewProgram(std::move(M)); | |||
1121 | }; | |||
1122 | if (!NoStripDebugInfo && !BugpointIsInterrupted) { | |||
1123 | outs() << "\n*** Attempting to strip the debug info: "; | |||
1124 | stripMetadata(StripDebugInfo); | |||
1125 | } | |||
1126 | if (!NoStripDebugTypeInfo && !BugpointIsInterrupted) { | |||
1127 | outs() << "\n*** Attempting to strip the debug type info: "; | |||
1128 | stripMetadata(stripNonLineTableDebugInfo); | |||
1129 | } | |||
1130 | ||||
1131 | if (!NoNamedMDRM) { | |||
1132 | if (!BugpointIsInterrupted) { | |||
1133 | // Try to reduce the amount of global metadata (particularly debug info), | |||
1134 | // by dropping global named metadata that anchors them | |||
1135 | outs() << "\n*** Attempting to remove named metadata: "; | |||
1136 | std::vector<std::string> NamedMDNames; | |||
1137 | for (auto &NamedMD : BD.getProgram().named_metadata()) | |||
1138 | NamedMDNames.push_back(NamedMD.getName().str()); | |||
1139 | Expected<bool> Result = | |||
1140 | ReduceCrashingNamedMD(BD, TestFn).reduceList(NamedMDNames); | |||
1141 | if (Error E = Result.takeError()) | |||
1142 | return E; | |||
1143 | } | |||
1144 | ||||
1145 | if (!BugpointIsInterrupted) { | |||
1146 | // Now that we quickly dropped all the named metadata that doesn't | |||
1147 | // contribute to the crash, bisect the operands of the remaining ones | |||
1148 | std::vector<const MDNode *> NamedMDOps; | |||
1149 | for (auto &NamedMD : BD.getProgram().named_metadata()) | |||
1150 | for (auto op : NamedMD.operands()) | |||
1151 | NamedMDOps.push_back(op); | |||
1152 | Expected<bool> Result = | |||
1153 | ReduceCrashingNamedMDOps(BD, TestFn).reduceList(NamedMDOps); | |||
1154 | if (Error E = Result.takeError()) | |||
1155 | return E; | |||
1156 | } | |||
1157 | BD.EmitProgressBitcode(BD.getProgram(), "reduced-named-md"); | |||
1158 | } | |||
1159 | ||||
1160 | // Try to clean up the testcase by running funcresolve and globaldce... | |||
1161 | if (!BugpointIsInterrupted) { | |||
1162 | outs() << "\n*** Attempting to perform final cleanups: "; | |||
1163 | std::unique_ptr<Module> M = CloneModule(BD.getProgram()); | |||
1164 | M = BD.performFinalCleanups(std::move(M), true); | |||
1165 | ||||
1166 | // Find out if the pass still crashes on the cleaned up program... | |||
1167 | if (M && TestFn(BD, M.get())) | |||
1168 | BD.setNewProgram( | |||
1169 | std::move(M)); // Yup, it does, keep the reduced version... | |||
1170 | } | |||
1171 | ||||
1172 | BD.EmitProgressBitcode(BD.getProgram(), "reduced-simplified"); | |||
1173 | ||||
1174 | return Error::success(); | |||
1175 | } | |||
1176 | ||||
1177 | static bool TestForOptimizerCrash(const BugDriver &BD, Module *M) { | |||
1178 | return BD.runPasses(*M, BD.getPassesToRun()); | |||
1179 | } | |||
1180 | ||||
1181 | /// debugOptimizerCrash - This method is called when some pass crashes on input. | |||
1182 | /// It attempts to prune down the testcase to something reasonable, and figure | |||
1183 | /// out exactly which pass is crashing. | |||
1184 | /// | |||
1185 | Error BugDriver::debugOptimizerCrash(const std::string &ID) { | |||
1186 | outs() << "\n*** Debugging optimizer crash!\n"; | |||
1187 | ||||
1188 | // Reduce the list of passes which causes the optimizer to crash... | |||
1189 | if (!BugpointIsInterrupted && !DontReducePassList) { | |||
1190 | Expected<bool> Result = ReducePassList(*this).reduceList(PassesToRun); | |||
1191 | if (Error E = Result.takeError()) | |||
1192 | return E; | |||
1193 | } | |||
1194 | ||||
1195 | outs() << "\n*** Found crashing pass" | |||
1196 | << (PassesToRun.size() == 1 ? ": " : "es: ") | |||
1197 | << getPassesString(PassesToRun) << '\n'; | |||
1198 | ||||
1199 | EmitProgressBitcode(*Program, ID); | |||
1200 | ||||
1201 | return DebugACrash(*this, TestForOptimizerCrash); | |||
1202 | } | |||
1203 | ||||
1204 | static bool TestForCodeGenCrash(const BugDriver &BD, Module *M) { | |||
1205 | if (Error E = BD.compileProgram(*M)) { | |||
1206 | if (VerboseErrors) | |||
1207 | errs() << toString(std::move(E)) << "\n"; | |||
1208 | else { | |||
1209 | consumeError(std::move(E)); | |||
1210 | errs() << "<crash>\n"; | |||
1211 | } | |||
1212 | return true; // Tool is still crashing. | |||
1213 | } | |||
1214 | errs() << '\n'; | |||
1215 | return false; | |||
1216 | } | |||
1217 | ||||
1218 | /// debugCodeGeneratorCrash - This method is called when the code generator | |||
1219 | /// crashes on an input. It attempts to reduce the input as much as possible | |||
1220 | /// while still causing the code generator to crash. | |||
1221 | Error BugDriver::debugCodeGeneratorCrash() { | |||
1222 | errs() << "*** Debugging code generator crash!\n"; | |||
1223 | ||||
1224 | return DebugACrash(*this, TestForCodeGenCrash); | |||
| ||||
1225 | } |
1 | //===- llvm/Support/Error.h - Recoverable error handling --------*- C++ -*-===// | |||
2 | // | |||
3 | // The LLVM Compiler Infrastructure | |||
4 | // | |||
5 | // This file is distributed under the University of Illinois Open Source | |||
6 | // License. See LICENSE.TXT for details. | |||
7 | // | |||
8 | //===----------------------------------------------------------------------===// | |||
9 | // | |||
10 | // This file defines an API used to report recoverable errors. | |||
11 | // | |||
12 | //===----------------------------------------------------------------------===// | |||
13 | ||||
14 | #ifndef LLVM_SUPPORT_ERROR_H | |||
15 | #define LLVM_SUPPORT_ERROR_H | |||
16 | ||||
17 | #include "llvm-c/Error.h" | |||
18 | #include "llvm/ADT/STLExtras.h" | |||
19 | #include "llvm/ADT/SmallVector.h" | |||
20 | #include "llvm/ADT/StringExtras.h" | |||
21 | #include "llvm/ADT/Twine.h" | |||
22 | #include "llvm/Config/abi-breaking.h" | |||
23 | #include "llvm/Support/AlignOf.h" | |||
24 | #include "llvm/Support/Compiler.h" | |||
25 | #include "llvm/Support/Debug.h" | |||
26 | #include "llvm/Support/ErrorHandling.h" | |||
27 | #include "llvm/Support/ErrorOr.h" | |||
28 | #include "llvm/Support/Format.h" | |||
29 | #include "llvm/Support/raw_ostream.h" | |||
30 | #include <algorithm> | |||
31 | #include <cassert> | |||
32 | #include <cstdint> | |||
33 | #include <cstdlib> | |||
34 | #include <functional> | |||
35 | #include <memory> | |||
36 | #include <new> | |||
37 | #include <string> | |||
38 | #include <system_error> | |||
39 | #include <type_traits> | |||
40 | #include <utility> | |||
41 | #include <vector> | |||
42 | ||||
43 | namespace llvm { | |||
44 | ||||
45 | class ErrorSuccess; | |||
46 | ||||
47 | /// Base class for error info classes. Do not extend this directly: Extend | |||
48 | /// the ErrorInfo template subclass instead. | |||
49 | class ErrorInfoBase { | |||
50 | public: | |||
51 | virtual ~ErrorInfoBase() = default; | |||
52 | ||||
53 | /// Print an error message to an output stream. | |||
54 | virtual void log(raw_ostream &OS) const = 0; | |||
55 | ||||
56 | /// Return the error message as a string. | |||
57 | virtual std::string message() const { | |||
58 | std::string Msg; | |||
59 | raw_string_ostream OS(Msg); | |||
60 | log(OS); | |||
61 | return OS.str(); | |||
62 | } | |||
63 | ||||
64 | /// Convert this error to a std::error_code. | |||
65 | /// | |||
66 | /// This is a temporary crutch to enable interaction with code still | |||
67 | /// using std::error_code. It will be removed in the future. | |||
68 | virtual std::error_code convertToErrorCode() const = 0; | |||
69 | ||||
70 | // Returns the class ID for this type. | |||
71 | static const void *classID() { return &ID; } | |||
72 | ||||
73 | // Returns the class ID for the dynamic type of this ErrorInfoBase instance. | |||
74 | virtual const void *dynamicClassID() const = 0; | |||
75 | ||||
76 | // Check whether this instance is a subclass of the class identified by | |||
77 | // ClassID. | |||
78 | virtual bool isA(const void *const ClassID) const { | |||
79 | return ClassID == classID(); | |||
80 | } | |||
81 | ||||
82 | // Check whether this instance is a subclass of ErrorInfoT. | |||
83 | template <typename ErrorInfoT> bool isA() const { | |||
84 | return isA(ErrorInfoT::classID()); | |||
85 | } | |||
86 | ||||
87 | private: | |||
88 | virtual void anchor(); | |||
89 | ||||
90 | static char ID; | |||
91 | }; | |||
92 | ||||
93 | /// Lightweight error class with error context and mandatory checking. | |||
94 | /// | |||
95 | /// Instances of this class wrap a ErrorInfoBase pointer. Failure states | |||
96 | /// are represented by setting the pointer to a ErrorInfoBase subclass | |||
97 | /// instance containing information describing the failure. Success is | |||
98 | /// represented by a null pointer value. | |||
99 | /// | |||
100 | /// Instances of Error also contains a 'Checked' flag, which must be set | |||
101 | /// before the destructor is called, otherwise the destructor will trigger a | |||
102 | /// runtime error. This enforces at runtime the requirement that all Error | |||
103 | /// instances be checked or returned to the caller. | |||
104 | /// | |||
105 | /// There are two ways to set the checked flag, depending on what state the | |||
106 | /// Error instance is in. For Error instances indicating success, it | |||
107 | /// is sufficient to invoke the boolean conversion operator. E.g.: | |||
108 | /// | |||
109 | /// @code{.cpp} | |||
110 | /// Error foo(<...>); | |||
111 | /// | |||
112 | /// if (auto E = foo(<...>)) | |||
113 | /// return E; // <- Return E if it is in the error state. | |||
114 | /// // We have verified that E was in the success state. It can now be safely | |||
115 | /// // destroyed. | |||
116 | /// @endcode | |||
117 | /// | |||
118 | /// A success value *can not* be dropped. For example, just calling 'foo(<...>)' | |||
119 | /// without testing the return value will raise a runtime error, even if foo | |||
120 | /// returns success. | |||
121 | /// | |||
122 | /// For Error instances representing failure, you must use either the | |||
123 | /// handleErrors or handleAllErrors function with a typed handler. E.g.: | |||
124 | /// | |||
125 | /// @code{.cpp} | |||
126 | /// class MyErrorInfo : public ErrorInfo<MyErrorInfo> { | |||
127 | /// // Custom error info. | |||
128 | /// }; | |||
129 | /// | |||
130 | /// Error foo(<...>) { return make_error<MyErrorInfo>(...); } | |||
131 | /// | |||
132 | /// auto E = foo(<...>); // <- foo returns failure with MyErrorInfo. | |||
133 | /// auto NewE = | |||
134 | /// handleErrors(E, | |||
135 | /// [](const MyErrorInfo &M) { | |||
136 | /// // Deal with the error. | |||
137 | /// }, | |||
138 | /// [](std::unique_ptr<OtherError> M) -> Error { | |||
139 | /// if (canHandle(*M)) { | |||
140 | /// // handle error. | |||
141 | /// return Error::success(); | |||
142 | /// } | |||
143 | /// // Couldn't handle this error instance. Pass it up the stack. | |||
144 | /// return Error(std::move(M)); | |||
145 | /// ); | |||
146 | /// // Note - we must check or return NewE in case any of the handlers | |||
147 | /// // returned a new error. | |||
148 | /// @endcode | |||
149 | /// | |||
150 | /// The handleAllErrors function is identical to handleErrors, except | |||
151 | /// that it has a void return type, and requires all errors to be handled and | |||
152 | /// no new errors be returned. It prevents errors (assuming they can all be | |||
153 | /// handled) from having to be bubbled all the way to the top-level. | |||
154 | /// | |||
155 | /// *All* Error instances must be checked before destruction, even if | |||
156 | /// they're moved-assigned or constructed from Success values that have already | |||
157 | /// been checked. This enforces checking through all levels of the call stack. | |||
158 | class LLVM_NODISCARD[[clang::warn_unused_result]] Error { | |||
159 | // Both ErrorList and FileError need to be able to yank ErrorInfoBase | |||
160 | // pointers out of this class to add to the error list. | |||
161 | friend class ErrorList; | |||
162 | friend class FileError; | |||
163 | ||||
164 | // handleErrors needs to be able to set the Checked flag. | |||
165 | template <typename... HandlerTs> | |||
166 | friend Error handleErrors(Error E, HandlerTs &&... Handlers); | |||
167 | ||||
168 | // Expected<T> needs to be able to steal the payload when constructed from an | |||
169 | // error. | |||
170 | template <typename T> friend class Expected; | |||
171 | ||||
172 | // wrap needs to be able to steal the payload. | |||
173 | friend LLVMErrorRef wrap(Error); | |||
174 | ||||
175 | protected: | |||
176 | /// Create a success value. Prefer using 'Error::success()' for readability | |||
177 | Error() { | |||
178 | setPtr(nullptr); | |||
179 | setChecked(false); | |||
180 | } | |||
181 | ||||
182 | public: | |||
183 | /// Create a success value. | |||
184 | static ErrorSuccess success(); | |||
185 | ||||
186 | // Errors are not copy-constructable. | |||
187 | Error(const Error &Other) = delete; | |||
188 | ||||
189 | /// Move-construct an error value. The newly constructed error is considered | |||
190 | /// unchecked, even if the source error had been checked. The original error | |||
191 | /// becomes a checked Success value, regardless of its original state. | |||
192 | Error(Error &&Other) { | |||
193 | setChecked(true); | |||
194 | *this = std::move(Other); | |||
195 | } | |||
196 | ||||
197 | /// Create an error value. Prefer using the 'make_error' function, but | |||
198 | /// this constructor can be useful when "re-throwing" errors from handlers. | |||
199 | Error(std::unique_ptr<ErrorInfoBase> Payload) { | |||
200 | setPtr(Payload.release()); | |||
201 | setChecked(false); | |||
| ||||
202 | } | |||
203 | ||||
204 | // Errors are not copy-assignable. | |||
205 | Error &operator=(const Error &Other) = delete; | |||
206 | ||||
207 | /// Move-assign an error value. The current error must represent success, you | |||
208 | /// you cannot overwrite an unhandled error. The current error is then | |||
209 | /// considered unchecked. The source error becomes a checked success value, | |||
210 | /// regardless of its original state. | |||
211 | Error &operator=(Error &&Other) { | |||
212 | // Don't allow overwriting of unchecked values. | |||
213 | assertIsChecked(); | |||
214 | setPtr(Other.getPtr()); | |||
215 | ||||
216 | // This Error is unchecked, even if the source error was checked. | |||
217 | setChecked(false); | |||
218 | ||||
219 | // Null out Other's payload and set its checked bit. | |||
220 | Other.setPtr(nullptr); | |||
221 | Other.setChecked(true); | |||
222 | ||||
223 | return *this; | |||
224 | } | |||
225 | ||||
226 | /// Destroy a Error. Fails with a call to abort() if the error is | |||
227 | /// unchecked. | |||
228 | ~Error() { | |||
229 | assertIsChecked(); | |||
230 | delete getPtr(); | |||
231 | } | |||
232 | ||||
233 | /// Bool conversion. Returns true if this Error is in a failure state, | |||
234 | /// and false if it is in an accept state. If the error is in a Success state | |||
235 | /// it will be considered checked. | |||
236 | explicit operator bool() { | |||
237 | setChecked(getPtr() == nullptr); | |||
238 | return getPtr() != nullptr; | |||
239 | } | |||
240 | ||||
241 | /// Check whether one error is a subclass of another. | |||
242 | template <typename ErrT> bool isA() const { | |||
243 | return getPtr() && getPtr()->isA(ErrT::classID()); | |||
244 | } | |||
245 | ||||
246 | /// Returns the dynamic class id of this error, or null if this is a success | |||
247 | /// value. | |||
248 | const void* dynamicClassID() const { | |||
249 | if (!getPtr()) | |||
250 | return nullptr; | |||
251 | return getPtr()->dynamicClassID(); | |||
252 | } | |||
253 | ||||
254 | private: | |||
255 | #if LLVM_ENABLE_ABI_BREAKING_CHECKS1 | |||
256 | // assertIsChecked() happens very frequently, but under normal circumstances | |||
257 | // is supposed to be a no-op. So we want it to be inlined, but having a bunch | |||
258 | // of debug prints can cause the function to be too large for inlining. So | |||
259 | // it's important that we define this function out of line so that it can't be | |||
260 | // inlined. | |||
261 | LLVM_ATTRIBUTE_NORETURN__attribute__((noreturn)) | |||
262 | void fatalUncheckedError() const; | |||
263 | #endif | |||
264 | ||||
265 | void assertIsChecked() { | |||
266 | #if LLVM_ENABLE_ABI_BREAKING_CHECKS1 | |||
267 | if (LLVM_UNLIKELY(!getChecked() || getPtr())__builtin_expect((bool)(!getChecked() || getPtr()), false)) | |||
268 | fatalUncheckedError(); | |||
269 | #endif | |||
270 | } | |||
271 | ||||
272 | ErrorInfoBase *getPtr() const { | |||
273 | return reinterpret_cast<ErrorInfoBase*>( | |||
274 | reinterpret_cast<uintptr_t>(Payload) & | |||
275 | ~static_cast<uintptr_t>(0x1)); | |||
276 | } | |||
277 | ||||
278 | void setPtr(ErrorInfoBase *EI) { | |||
279 | #if LLVM_ENABLE_ABI_BREAKING_CHECKS1 | |||
280 | Payload = reinterpret_cast<ErrorInfoBase*>( | |||
281 | (reinterpret_cast<uintptr_t>(EI) & | |||
282 | ~static_cast<uintptr_t>(0x1)) | | |||
283 | (reinterpret_cast<uintptr_t>(Payload) & 0x1)); | |||
284 | #else | |||
285 | Payload = EI; | |||
286 | #endif | |||
287 | } | |||
288 | ||||
289 | bool getChecked() const { | |||
290 | #if LLVM_ENABLE_ABI_BREAKING_CHECKS1 | |||
291 | return (reinterpret_cast<uintptr_t>(Payload) & 0x1) == 0; | |||
292 | #else | |||
293 | return true; | |||
294 | #endif | |||
295 | } | |||
296 | ||||
297 | void setChecked(bool V) { | |||
298 | Payload = reinterpret_cast<ErrorInfoBase*>( | |||
299 | (reinterpret_cast<uintptr_t>(Payload) & | |||
300 | ~static_cast<uintptr_t>(0x1)) | | |||
301 | (V ? 0 : 1)); | |||
302 | } | |||
303 | ||||
304 | std::unique_ptr<ErrorInfoBase> takePayload() { | |||
305 | std::unique_ptr<ErrorInfoBase> Tmp(getPtr()); | |||
306 | setPtr(nullptr); | |||
307 | setChecked(true); | |||
308 | return Tmp; | |||
309 | } | |||
310 | ||||
311 | friend raw_ostream &operator<<(raw_ostream &OS, const Error &E) { | |||
312 | if (auto P = E.getPtr()) | |||
313 | P->log(OS); | |||
314 | else | |||
315 | OS << "success"; | |||
316 | return OS; | |||
317 | } | |||
318 | ||||
319 | ErrorInfoBase *Payload = nullptr; | |||
320 | }; | |||
321 | ||||
322 | /// Subclass of Error for the sole purpose of identifying the success path in | |||
323 | /// the type system. This allows to catch invalid conversion to Expected<T> at | |||
324 | /// compile time. | |||
325 | class ErrorSuccess final : public Error {}; | |||
326 | ||||
327 | inline ErrorSuccess Error::success() { return ErrorSuccess(); } | |||
328 | ||||
329 | /// Make a Error instance representing failure using the given error info | |||
330 | /// type. | |||
331 | template <typename ErrT, typename... ArgTs> Error make_error(ArgTs &&... Args) { | |||
332 | return Error(llvm::make_unique<ErrT>(std::forward<ArgTs>(Args)...)); | |||
333 | } | |||
334 | ||||
335 | /// Base class for user error types. Users should declare their error types | |||
336 | /// like: | |||
337 | /// | |||
338 | /// class MyError : public ErrorInfo<MyError> { | |||
339 | /// .... | |||
340 | /// }; | |||
341 | /// | |||
342 | /// This class provides an implementation of the ErrorInfoBase::kind | |||
343 | /// method, which is used by the Error RTTI system. | |||
344 | template <typename ThisErrT, typename ParentErrT = ErrorInfoBase> | |||
345 | class ErrorInfo : public ParentErrT { | |||
346 | public: | |||
347 | using ParentErrT::ParentErrT; // inherit constructors | |||
348 | ||||
349 | static const void *classID() { return &ThisErrT::ID; } | |||
350 | ||||
351 | const void *dynamicClassID() const override { return &ThisErrT::ID; } | |||
352 | ||||
353 | bool isA(const void *const ClassID) const override { | |||
354 | return ClassID == classID() || ParentErrT::isA(ClassID); | |||
355 | } | |||
356 | }; | |||
357 | ||||
358 | /// Special ErrorInfo subclass representing a list of ErrorInfos. | |||
359 | /// Instances of this class are constructed by joinError. | |||
360 | class ErrorList final : public ErrorInfo<ErrorList> { | |||
361 | // handleErrors needs to be able to iterate the payload list of an | |||
362 | // ErrorList. | |||
363 | template <typename... HandlerTs> | |||
364 | friend Error handleErrors(Error E, HandlerTs &&... Handlers); | |||
365 | ||||
366 | // joinErrors is implemented in terms of join. | |||
367 | friend Error joinErrors(Error, Error); | |||
368 | ||||
369 | public: | |||
370 | void log(raw_ostream &OS) const override { | |||
371 | OS << "Multiple errors:\n"; | |||
372 | for (auto &ErrPayload : Payloads) { | |||
373 | ErrPayload->log(OS); | |||
374 | OS << "\n"; | |||
375 | } | |||
376 | } | |||
377 | ||||
378 | std::error_code convertToErrorCode() const override; | |||
379 | ||||
380 | // Used by ErrorInfo::classID. | |||
381 | static char ID; | |||
382 | ||||
383 | private: | |||
384 | ErrorList(std::unique_ptr<ErrorInfoBase> Payload1, | |||
385 | std::unique_ptr<ErrorInfoBase> Payload2) { | |||
386 | assert(!Payload1->isA<ErrorList>() && !Payload2->isA<ErrorList>() &&((!Payload1->isA<ErrorList>() && !Payload2-> isA<ErrorList>() && "ErrorList constructor payloads should be singleton errors" ) ? static_cast<void> (0) : __assert_fail ("!Payload1->isA<ErrorList>() && !Payload2->isA<ErrorList>() && \"ErrorList constructor payloads should be singleton errors\"" , "/build/llvm-toolchain-snapshot-8~svn345461/include/llvm/Support/Error.h" , 387, __PRETTY_FUNCTION__)) | |||
387 | "ErrorList constructor payloads should be singleton errors")((!Payload1->isA<ErrorList>() && !Payload2-> isA<ErrorList>() && "ErrorList constructor payloads should be singleton errors" ) ? static_cast<void> (0) : __assert_fail ("!Payload1->isA<ErrorList>() && !Payload2->isA<ErrorList>() && \"ErrorList constructor payloads should be singleton errors\"" , "/build/llvm-toolchain-snapshot-8~svn345461/include/llvm/Support/Error.h" , 387, __PRETTY_FUNCTION__)); | |||
388 | Payloads.push_back(std::move(Payload1)); | |||
389 | Payloads.push_back(std::move(Payload2)); | |||
390 | } | |||
391 | ||||
392 | static Error join(Error E1, Error E2) { | |||
393 | if (!E1) | |||
394 | return E2; | |||
395 | if (!E2) | |||
396 | return E1; | |||
397 | if (E1.isA<ErrorList>()) { | |||
398 | auto &E1List = static_cast<ErrorList &>(*E1.getPtr()); | |||
399 | if (E2.isA<ErrorList>()) { | |||
400 | auto E2Payload = E2.takePayload(); | |||
401 | auto &E2List = static_cast<ErrorList &>(*E2Payload); | |||
402 | for (auto &Payload : E2List.Payloads) | |||
403 | E1List.Payloads.push_back(std::move(Payload)); | |||
404 | } else | |||
405 | E1List.Payloads.push_back(E2.takePayload()); | |||
406 | ||||
407 | return E1; | |||
408 | } | |||
409 | if (E2.isA<ErrorList>()) { | |||
410 | auto &E2List = static_cast<ErrorList &>(*E2.getPtr()); | |||
411 | E2List.Payloads.insert(E2List.Payloads.begin(), E1.takePayload()); | |||
412 | return E2; | |||
413 | } | |||
414 | return Error(std::unique_ptr<ErrorList>( | |||
415 | new ErrorList(E1.takePayload(), E2.takePayload()))); | |||
416 | } | |||
417 | ||||
418 | std::vector<std::unique_ptr<ErrorInfoBase>> Payloads; | |||
419 | }; | |||
420 | ||||
421 | /// Concatenate errors. The resulting Error is unchecked, and contains the | |||
422 | /// ErrorInfo(s), if any, contained in E1, followed by the | |||
423 | /// ErrorInfo(s), if any, contained in E2. | |||
424 | inline Error joinErrors(Error E1, Error E2) { | |||
425 | return ErrorList::join(std::move(E1), std::move(E2)); | |||
426 | } | |||
427 | ||||
428 | /// Tagged union holding either a T or a Error. | |||
429 | /// | |||
430 | /// This class parallels ErrorOr, but replaces error_code with Error. Since | |||
431 | /// Error cannot be copied, this class replaces getError() with | |||
432 | /// takeError(). It also adds an bool errorIsA<ErrT>() method for testing the | |||
433 | /// error class type. | |||
434 | template <class T> class LLVM_NODISCARD[[clang::warn_unused_result]] Expected { | |||
435 | template <class T1> friend class ExpectedAsOutParameter; | |||
436 | template <class OtherT> friend class Expected; | |||
437 | ||||
438 | static const bool isRef = std::is_reference<T>::value; | |||
439 | ||||
440 | using wrap = std::reference_wrapper<typename std::remove_reference<T>::type>; | |||
441 | ||||
442 | using error_type = std::unique_ptr<ErrorInfoBase>; | |||
443 | ||||
444 | public: | |||
445 | using storage_type = typename std::conditional<isRef, wrap, T>::type; | |||
446 | using value_type = T; | |||
447 | ||||
448 | private: | |||
449 | using reference = typename std::remove_reference<T>::type &; | |||
450 | using const_reference = const typename std::remove_reference<T>::type &; | |||
451 | using pointer = typename std::remove_reference<T>::type *; | |||
452 | using const_pointer = const typename std::remove_reference<T>::type *; | |||
453 | ||||
454 | public: | |||
455 | /// Create an Expected<T> error value from the given Error. | |||
456 | Expected(Error Err) | |||
457 | : HasError(true) | |||
458 | #if LLVM_ENABLE_ABI_BREAKING_CHECKS1 | |||
459 | // Expected is unchecked upon construction in Debug builds. | |||
460 | , Unchecked(true) | |||
461 | #endif | |||
462 | { | |||
463 | assert(Err && "Cannot create Expected<T> from Error success value.")((Err && "Cannot create Expected<T> from Error success value." ) ? static_cast<void> (0) : __assert_fail ("Err && \"Cannot create Expected<T> from Error success value.\"" , "/build/llvm-toolchain-snapshot-8~svn345461/include/llvm/Support/Error.h" , 463, __PRETTY_FUNCTION__)); | |||
464 | new (getErrorStorage()) error_type(Err.takePayload()); | |||
465 | } | |||
466 | ||||
467 | /// Forbid to convert from Error::success() implicitly, this avoids having | |||
468 | /// Expected<T> foo() { return Error::success(); } which compiles otherwise | |||
469 | /// but triggers the assertion above. | |||
470 | Expected(ErrorSuccess) = delete; | |||
471 | ||||
472 | /// Create an Expected<T> success value from the given OtherT value, which | |||
473 | /// must be convertible to T. | |||
474 | template <typename OtherT> | |||
475 | Expected(OtherT &&Val, | |||
476 | typename std::enable_if<std::is_convertible<OtherT, T>::value>::type | |||
477 | * = nullptr) | |||
478 | : HasError(false) | |||
479 | #if LLVM_ENABLE_ABI_BREAKING_CHECKS1 | |||
480 | // Expected is unchecked upon construction in Debug builds. | |||
481 | , Unchecked(true) | |||
482 | #endif | |||
483 | { | |||
484 | new (getStorage()) storage_type(std::forward<OtherT>(Val)); | |||
485 | } | |||
486 | ||||
487 | /// Move construct an Expected<T> value. | |||
488 | Expected(Expected &&Other) { moveConstruct(std::move(Other)); } | |||
489 | ||||
490 | /// Move construct an Expected<T> value from an Expected<OtherT>, where OtherT | |||
491 | /// must be convertible to T. | |||
492 | template <class OtherT> | |||
493 | Expected(Expected<OtherT> &&Other, | |||
494 | typename std::enable_if<std::is_convertible<OtherT, T>::value>::type | |||
495 | * = nullptr) { | |||
496 | moveConstruct(std::move(Other)); | |||
497 | } | |||
498 | ||||
499 | /// Move construct an Expected<T> value from an Expected<OtherT>, where OtherT | |||
500 | /// isn't convertible to T. | |||
501 | template <class OtherT> | |||
502 | explicit Expected( | |||
503 | Expected<OtherT> &&Other, | |||
504 | typename std::enable_if<!std::is_convertible<OtherT, T>::value>::type * = | |||
505 | nullptr) { | |||
506 | moveConstruct(std::move(Other)); | |||
507 | } | |||
508 | ||||
509 | /// Move-assign from another Expected<T>. | |||
510 | Expected &operator=(Expected &&Other) { | |||
511 | moveAssign(std::move(Other)); | |||
512 | return *this; | |||
513 | } | |||
514 | ||||
515 | /// Destroy an Expected<T>. | |||
516 | ~Expected() { | |||
517 | assertIsChecked(); | |||
518 | if (!HasError) | |||
519 | getStorage()->~storage_type(); | |||
520 | else | |||
521 | getErrorStorage()->~error_type(); | |||
522 | } | |||
523 | ||||
524 | /// Return false if there is an error. | |||
525 | explicit operator bool() { | |||
526 | #if LLVM_ENABLE_ABI_BREAKING_CHECKS1 | |||
527 | Unchecked = HasError; | |||
528 | #endif | |||
529 | return !HasError; | |||
530 | } | |||
531 | ||||
532 | /// Returns a reference to the stored T value. | |||
533 | reference get() { | |||
534 | assertIsChecked(); | |||
535 | return *getStorage(); | |||
536 | } | |||
537 | ||||
538 | /// Returns a const reference to the stored T value. | |||
539 | const_reference get() const { | |||
540 | assertIsChecked(); | |||
541 | return const_cast<Expected<T> *>(this)->get(); | |||
542 | } | |||
543 | ||||
544 | /// Check that this Expected<T> is an error of type ErrT. | |||
545 | template <typename ErrT> bool errorIsA() const { | |||
546 | return HasError && (*getErrorStorage())->template isA<ErrT>(); | |||
547 | } | |||
548 | ||||
549 | /// Take ownership of the stored error. | |||
550 | /// After calling this the Expected<T> is in an indeterminate state that can | |||
551 | /// only be safely destructed. No further calls (beside the destructor) should | |||
552 | /// be made on the Expected<T> vaule. | |||
553 | Error takeError() { | |||
554 | #if LLVM_ENABLE_ABI_BREAKING_CHECKS1 | |||
555 | Unchecked = false; | |||
556 | #endif | |||
557 | return HasError ? Error(std::move(*getErrorStorage())) : Error::success(); | |||
558 | } | |||
559 | ||||
560 | /// Returns a pointer to the stored T value. | |||
561 | pointer operator->() { | |||
562 | assertIsChecked(); | |||
563 | return toPointer(getStorage()); | |||
564 | } | |||
565 | ||||
566 | /// Returns a const pointer to the stored T value. | |||
567 | const_pointer operator->() const { | |||
568 | assertIsChecked(); | |||
569 | return toPointer(getStorage()); | |||
570 | } | |||
571 | ||||
572 | /// Returns a reference to the stored T value. | |||
573 | reference operator*() { | |||
574 | assertIsChecked(); | |||
575 | return *getStorage(); | |||
576 | } | |||
577 | ||||
578 | /// Returns a const reference to the stored T value. | |||
579 | const_reference operator*() const { | |||
580 | assertIsChecked(); | |||
581 | return *getStorage(); | |||
582 | } | |||
583 | ||||
584 | private: | |||
585 | template <class T1> | |||
586 | static bool compareThisIfSameType(const T1 &a, const T1 &b) { | |||
587 | return &a == &b; | |||
588 | } | |||
589 | ||||
590 | template <class T1, class T2> | |||
591 | static bool compareThisIfSameType(const T1 &a, const T2 &b) { | |||
592 | return false; | |||
593 | } | |||
594 | ||||
595 | template <class OtherT> void moveConstruct(Expected<OtherT> &&Other) { | |||
596 | HasError = Other.HasError; | |||
597 | #if LLVM_ENABLE_ABI_BREAKING_CHECKS1 | |||
598 | Unchecked = true; | |||
599 | Other.Unchecked = false; | |||
600 | #endif | |||
601 | ||||
602 | if (!HasError) | |||
603 | new (getStorage()) storage_type(std::move(*Other.getStorage())); | |||
604 | else | |||
605 | new (getErrorStorage()) error_type(std::move(*Other.getErrorStorage())); | |||
606 | } | |||
607 | ||||
608 | template <class OtherT> void moveAssign(Expected<OtherT> &&Other) { | |||
609 | assertIsChecked(); | |||
610 | ||||
611 | if (compareThisIfSameType(*this, Other)) | |||
612 | return; | |||
613 | ||||
614 | this->~Expected(); | |||
615 | new (this) Expected(std::move(Other)); | |||
616 | } | |||
617 | ||||
618 | pointer toPointer(pointer Val) { return Val; } | |||
619 | ||||
620 | const_pointer toPointer(const_pointer Val) const { return Val; } | |||
621 | ||||
622 | pointer toPointer(wrap *Val) { return &Val->get(); } | |||
623 | ||||
624 | const_pointer toPointer(const wrap *Val) const { return &Val->get(); } | |||
625 | ||||
626 | storage_type *getStorage() { | |||
627 | assert(!HasError && "Cannot get value when an error exists!")((!HasError && "Cannot get value when an error exists!" ) ? static_cast<void> (0) : __assert_fail ("!HasError && \"Cannot get value when an error exists!\"" , "/build/llvm-toolchain-snapshot-8~svn345461/include/llvm/Support/Error.h" , 627, __PRETTY_FUNCTION__)); | |||
628 | return reinterpret_cast<storage_type *>(TStorage.buffer); | |||
629 | } | |||
630 | ||||
631 | const storage_type *getStorage() const { | |||
632 | assert(!HasError && "Cannot get value when an error exists!")((!HasError && "Cannot get value when an error exists!" ) ? static_cast<void> (0) : __assert_fail ("!HasError && \"Cannot get value when an error exists!\"" , "/build/llvm-toolchain-snapshot-8~svn345461/include/llvm/Support/Error.h" , 632, __PRETTY_FUNCTION__)); | |||
633 | return reinterpret_cast<const storage_type *>(TStorage.buffer); | |||
634 | } | |||
635 | ||||
636 | error_type *getErrorStorage() { | |||
637 | assert(HasError && "Cannot get error when a value exists!")((HasError && "Cannot get error when a value exists!" ) ? static_cast<void> (0) : __assert_fail ("HasError && \"Cannot get error when a value exists!\"" , "/build/llvm-toolchain-snapshot-8~svn345461/include/llvm/Support/Error.h" , 637, __PRETTY_FUNCTION__)); | |||
638 | return reinterpret_cast<error_type *>(ErrorStorage.buffer); | |||
639 | } | |||
640 | ||||
641 | const error_type *getErrorStorage() const { | |||
642 | assert(HasError && "Cannot get error when a value exists!")((HasError && "Cannot get error when a value exists!" ) ? static_cast<void> (0) : __assert_fail ("HasError && \"Cannot get error when a value exists!\"" , "/build/llvm-toolchain-snapshot-8~svn345461/include/llvm/Support/Error.h" , 642, __PRETTY_FUNCTION__)); | |||
643 | return reinterpret_cast<const error_type *>(ErrorStorage.buffer); | |||
644 | } | |||
645 | ||||
646 | // Used by ExpectedAsOutParameter to reset the checked flag. | |||
647 | void setUnchecked() { | |||
648 | #if LLVM_ENABLE_ABI_BREAKING_CHECKS1 | |||
649 | Unchecked = true; | |||
650 | #endif | |||
651 | } | |||
652 | ||||
653 | #if LLVM_ENABLE_ABI_BREAKING_CHECKS1 | |||
654 | LLVM_ATTRIBUTE_NORETURN__attribute__((noreturn)) | |||
655 | LLVM_ATTRIBUTE_NOINLINE__attribute__((noinline)) | |||
656 | void fatalUncheckedExpected() const { | |||
657 | dbgs() << "Expected<T> must be checked before access or destruction.\n"; | |||
658 | if (HasError) { | |||
659 | dbgs() << "Unchecked Expected<T> contained error:\n"; | |||
660 | (*getErrorStorage())->log(dbgs()); | |||
661 | } else | |||
662 | dbgs() << "Expected<T> value was in success state. (Note: Expected<T> " | |||
663 | "values in success mode must still be checked prior to being " | |||
664 | "destroyed).\n"; | |||
665 | abort(); | |||
666 | } | |||
667 | #endif | |||
668 | ||||
669 | void assertIsChecked() { | |||
670 | #if LLVM_ENABLE_ABI_BREAKING_CHECKS1 | |||
671 | if (LLVM_UNLIKELY(Unchecked)__builtin_expect((bool)(Unchecked), false)) | |||
672 | fatalUncheckedExpected(); | |||
673 | #endif | |||
674 | } | |||
675 | ||||
676 | union { | |||
677 | AlignedCharArrayUnion<storage_type> TStorage; | |||
678 | AlignedCharArrayUnion<error_type> ErrorStorage; | |||
679 | }; | |||
680 | bool HasError : 1; | |||
681 | #if LLVM_ENABLE_ABI_BREAKING_CHECKS1 | |||
682 | bool Unchecked : 1; | |||
683 | #endif | |||
684 | }; | |||
685 | ||||
686 | /// Report a serious error, calling any installed error handler. See | |||
687 | /// ErrorHandling.h. | |||
688 | LLVM_ATTRIBUTE_NORETURN__attribute__((noreturn)) void report_fatal_error(Error Err, | |||
689 | bool gen_crash_diag = true); | |||
690 | ||||
691 | /// Report a fatal error if Err is a failure value. | |||
692 | /// | |||
693 | /// This function can be used to wrap calls to fallible functions ONLY when it | |||
694 | /// is known that the Error will always be a success value. E.g. | |||
695 | /// | |||
696 | /// @code{.cpp} | |||
697 | /// // foo only attempts the fallible operation if DoFallibleOperation is | |||
698 | /// // true. If DoFallibleOperation is false then foo always returns | |||
699 | /// // Error::success(). | |||
700 | /// Error foo(bool DoFallibleOperation); | |||
701 | /// | |||
702 | /// cantFail(foo(false)); | |||
703 | /// @endcode | |||
704 | inline void cantFail(Error Err, const char *Msg = nullptr) { | |||
705 | if (Err) { | |||
706 | if (!Msg) | |||
707 | Msg = "Failure value returned from cantFail wrapped call"; | |||
708 | llvm_unreachable(Msg)::llvm::llvm_unreachable_internal(Msg, "/build/llvm-toolchain-snapshot-8~svn345461/include/llvm/Support/Error.h" , 708); | |||
709 | } | |||
710 | } | |||
711 | ||||
712 | /// Report a fatal error if ValOrErr is a failure value, otherwise unwraps and | |||
713 | /// returns the contained value. | |||
714 | /// | |||
715 | /// This function can be used to wrap calls to fallible functions ONLY when it | |||
716 | /// is known that the Error will always be a success value. E.g. | |||
717 | /// | |||
718 | /// @code{.cpp} | |||
719 | /// // foo only attempts the fallible operation if DoFallibleOperation is | |||
720 | /// // true. If DoFallibleOperation is false then foo always returns an int. | |||
721 | /// Expected<int> foo(bool DoFallibleOperation); | |||
722 | /// | |||
723 | /// int X = cantFail(foo(false)); | |||
724 | /// @endcode | |||
725 | template <typename T> | |||
726 | T cantFail(Expected<T> ValOrErr, const char *Msg = nullptr) { | |||
727 | if (ValOrErr) | |||
728 | return std::move(*ValOrErr); | |||
729 | else { | |||
730 | if (!Msg) | |||
731 | Msg = "Failure value returned from cantFail wrapped call"; | |||
732 | llvm_unreachable(Msg)::llvm::llvm_unreachable_internal(Msg, "/build/llvm-toolchain-snapshot-8~svn345461/include/llvm/Support/Error.h" , 732); | |||
733 | } | |||
734 | } | |||
735 | ||||
736 | /// Report a fatal error if ValOrErr is a failure value, otherwise unwraps and | |||
737 | /// returns the contained reference. | |||
738 | /// | |||
739 | /// This function can be used to wrap calls to fallible functions ONLY when it | |||
740 | /// is known that the Error will always be a success value. E.g. | |||
741 | /// | |||
742 | /// @code{.cpp} | |||
743 | /// // foo only attempts the fallible operation if DoFallibleOperation is | |||
744 | /// // true. If DoFallibleOperation is false then foo always returns a Bar&. | |||
745 | /// Expected<Bar&> foo(bool DoFallibleOperation); | |||
746 | /// | |||
747 | /// Bar &X = cantFail(foo(false)); | |||
748 | /// @endcode | |||
749 | template <typename T> | |||
750 | T& cantFail(Expected<T&> ValOrErr, const char *Msg = nullptr) { | |||
751 | if (ValOrErr) | |||
752 | return *ValOrErr; | |||
753 | else { | |||
754 | if (!Msg) | |||
755 | Msg = "Failure value returned from cantFail wrapped call"; | |||
756 | llvm_unreachable(Msg)::llvm::llvm_unreachable_internal(Msg, "/build/llvm-toolchain-snapshot-8~svn345461/include/llvm/Support/Error.h" , 756); | |||
757 | } | |||
758 | } | |||
759 | ||||
760 | /// Helper for testing applicability of, and applying, handlers for | |||
761 | /// ErrorInfo types. | |||
762 | template <typename HandlerT> | |||
763 | class ErrorHandlerTraits | |||
764 | : public ErrorHandlerTraits<decltype( | |||
765 | &std::remove_reference<HandlerT>::type::operator())> {}; | |||
766 | ||||
767 | // Specialization functions of the form 'Error (const ErrT&)'. | |||
768 | template <typename ErrT> class ErrorHandlerTraits<Error (&)(ErrT &)> { | |||
769 | public: | |||
770 | static bool appliesTo(const ErrorInfoBase &E) { | |||
771 | return E.template isA<ErrT>(); | |||
772 | } | |||
773 | ||||
774 | template <typename HandlerT> | |||
775 | static Error apply(HandlerT &&H, std::unique_ptr<ErrorInfoBase> E) { | |||
776 | assert(appliesTo(*E) && "Applying incorrect handler")((appliesTo(*E) && "Applying incorrect handler") ? static_cast <void> (0) : __assert_fail ("appliesTo(*E) && \"Applying incorrect handler\"" , "/build/llvm-toolchain-snapshot-8~svn345461/include/llvm/Support/Error.h" , 776, __PRETTY_FUNCTION__)); | |||
777 | return H(static_cast<ErrT &>(*E)); | |||
778 | } | |||
779 | }; | |||
780 | ||||
781 | // Specialization functions of the form 'void (const ErrT&)'. | |||
782 | template <typename ErrT> class ErrorHandlerTraits<void (&)(ErrT &)> { | |||
783 | public: | |||
784 | static bool appliesTo(const ErrorInfoBase &E) { | |||
785 | return E.template isA<ErrT>(); | |||
786 | } | |||
787 | ||||
788 | template <typename HandlerT> | |||
789 | static Error apply(HandlerT &&H, std::unique_ptr<ErrorInfoBase> E) { | |||
790 | assert(appliesTo(*E) && "Applying incorrect handler")((appliesTo(*E) && "Applying incorrect handler") ? static_cast <void> (0) : __assert_fail ("appliesTo(*E) && \"Applying incorrect handler\"" , "/build/llvm-toolchain-snapshot-8~svn345461/include/llvm/Support/Error.h" , 790, __PRETTY_FUNCTION__)); | |||
791 | H(static_cast<ErrT &>(*E)); | |||
792 | return Error::success(); | |||
793 | } | |||
794 | }; | |||
795 | ||||
796 | /// Specialization for functions of the form 'Error (std::unique_ptr<ErrT>)'. | |||
797 | template <typename ErrT> | |||
798 | class ErrorHandlerTraits<Error (&)(std::unique_ptr<ErrT>)> { | |||
799 | public: | |||
800 | static bool appliesTo(const ErrorInfoBase &E) { | |||
801 | return E.template isA<ErrT>(); | |||
802 | } | |||
803 | ||||
804 | template <typename HandlerT> | |||
805 | static Error apply(HandlerT &&H, std::unique_ptr<ErrorInfoBase> E) { | |||
806 | assert(appliesTo(*E) && "Applying incorrect handler")((appliesTo(*E) && "Applying incorrect handler") ? static_cast <void> (0) : __assert_fail ("appliesTo(*E) && \"Applying incorrect handler\"" , "/build/llvm-toolchain-snapshot-8~svn345461/include/llvm/Support/Error.h" , 806, __PRETTY_FUNCTION__)); | |||
807 | std::unique_ptr<ErrT> SubE(static_cast<ErrT *>(E.release())); | |||
808 | return H(std::move(SubE)); | |||
809 | } | |||
810 | }; | |||
811 | ||||
812 | /// Specialization for functions of the form 'void (std::unique_ptr<ErrT>)'. | |||
813 | template <typename ErrT> | |||
814 | class ErrorHandlerTraits<void (&)(std::unique_ptr<ErrT>)> { | |||
815 | public: | |||
816 | static bool appliesTo(const ErrorInfoBase &E) { | |||
817 | return E.template isA<ErrT>(); | |||
818 | } | |||
819 | ||||
820 | template <typename HandlerT> | |||
821 | static Error apply(HandlerT &&H, std::unique_ptr<ErrorInfoBase> E) { | |||
822 | assert(appliesTo(*E) && "Applying incorrect handler")((appliesTo(*E) && "Applying incorrect handler") ? static_cast <void> (0) : __assert_fail ("appliesTo(*E) && \"Applying incorrect handler\"" , "/build/llvm-toolchain-snapshot-8~svn345461/include/llvm/Support/Error.h" , 822, __PRETTY_FUNCTION__)); | |||
823 | std::unique_ptr<ErrT> SubE(static_cast<ErrT *>(E.release())); | |||
824 | H(std::move(SubE)); | |||
825 | return Error::success(); | |||
826 | } | |||
827 | }; | |||
828 | ||||
829 | // Specialization for member functions of the form 'RetT (const ErrT&)'. | |||
830 | template <typename C, typename RetT, typename ErrT> | |||
831 | class ErrorHandlerTraits<RetT (C::*)(ErrT &)> | |||
832 | : public ErrorHandlerTraits<RetT (&)(ErrT &)> {}; | |||
833 | ||||
834 | // Specialization for member functions of the form 'RetT (const ErrT&) const'. | |||
835 | template <typename C, typename RetT, typename ErrT> | |||
836 | class ErrorHandlerTraits<RetT (C::*)(ErrT &) const> | |||
837 | : public ErrorHandlerTraits<RetT (&)(ErrT &)> {}; | |||
838 | ||||
839 | // Specialization for member functions of the form 'RetT (const ErrT&)'. | |||
840 | template <typename C, typename RetT, typename ErrT> | |||
841 | class ErrorHandlerTraits<RetT (C::*)(const ErrT &)> | |||
842 | : public ErrorHandlerTraits<RetT (&)(ErrT &)> {}; | |||
843 | ||||
844 | // Specialization for member functions of the form 'RetT (const ErrT&) const'. | |||
845 | template <typename C, typename RetT, typename ErrT> | |||
846 | class ErrorHandlerTraits<RetT (C::*)(const ErrT &) const> | |||
847 | : public ErrorHandlerTraits<RetT (&)(ErrT &)> {}; | |||
848 | ||||
849 | /// Specialization for member functions of the form | |||
850 | /// 'RetT (std::unique_ptr<ErrT>)'. | |||
851 | template <typename C, typename RetT, typename ErrT> | |||
852 | class ErrorHandlerTraits<RetT (C::*)(std::unique_ptr<ErrT>)> | |||
853 | : public ErrorHandlerTraits<RetT (&)(std::unique_ptr<ErrT>)> {}; | |||
854 | ||||
855 | /// Specialization for member functions of the form | |||
856 | /// 'RetT (std::unique_ptr<ErrT>) const'. | |||
857 | template <typename C, typename RetT, typename ErrT> | |||
858 | class ErrorHandlerTraits<RetT (C::*)(std::unique_ptr<ErrT>) const> | |||
859 | : public ErrorHandlerTraits<RetT (&)(std::unique_ptr<ErrT>)> {}; | |||
860 | ||||
861 | inline Error handleErrorImpl(std::unique_ptr<ErrorInfoBase> Payload) { | |||
862 | return Error(std::move(Payload)); | |||
863 | } | |||
864 | ||||
865 | template <typename HandlerT, typename... HandlerTs> | |||
866 | Error handleErrorImpl(std::unique_ptr<ErrorInfoBase> Payload, | |||
867 | HandlerT &&Handler, HandlerTs &&... Handlers) { | |||
868 | if (ErrorHandlerTraits<HandlerT>::appliesTo(*Payload)) | |||
869 | return ErrorHandlerTraits<HandlerT>::apply(std::forward<HandlerT>(Handler), | |||
870 | std::move(Payload)); | |||
871 | return handleErrorImpl(std::move(Payload), | |||
872 | std::forward<HandlerTs>(Handlers)...); | |||
873 | } | |||
874 | ||||
875 | /// Pass the ErrorInfo(s) contained in E to their respective handlers. Any | |||
876 | /// unhandled errors (or Errors returned by handlers) are re-concatenated and | |||
877 | /// returned. | |||
878 | /// Because this function returns an error, its result must also be checked | |||
879 | /// or returned. If you intend to handle all errors use handleAllErrors | |||
880 | /// (which returns void, and will abort() on unhandled errors) instead. | |||
881 | template <typename... HandlerTs> | |||
882 | Error handleErrors(Error E, HandlerTs &&... Hs) { | |||
883 | if (!E) | |||
884 | return Error::success(); | |||
885 | ||||
886 | std::unique_ptr<ErrorInfoBase> Payload = E.takePayload(); | |||
887 | ||||
888 | if (Payload->isA<ErrorList>()) { | |||
889 | ErrorList &List = static_cast<ErrorList &>(*Payload); | |||
890 | Error R; | |||
891 | for (auto &P : List.Payloads) | |||
892 | R = ErrorList::join( | |||
893 | std::move(R), | |||
894 | handleErrorImpl(std::move(P), std::forward<HandlerTs>(Hs)...)); | |||
895 | return R; | |||
896 | } | |||
897 | ||||
898 | return handleErrorImpl(std::move(Payload), std::forward<HandlerTs>(Hs)...); | |||
899 | } | |||
900 | ||||
901 | /// Behaves the same as handleErrors, except that by contract all errors | |||
902 | /// *must* be handled by the given handlers (i.e. there must be no remaining | |||
903 | /// errors after running the handlers, or llvm_unreachable is called). | |||
904 | template <typename... HandlerTs> | |||
905 | void handleAllErrors(Error E, HandlerTs &&... Handlers) { | |||
906 | cantFail(handleErrors(std::move(E), std::forward<HandlerTs>(Handlers)...)); | |||
907 | } | |||
908 | ||||
909 | /// Check that E is a non-error, then drop it. | |||
910 | /// If E is an error, llvm_unreachable will be called. | |||
911 | inline void handleAllErrors(Error E) { | |||
912 | cantFail(std::move(E)); | |||
913 | } | |||
914 | ||||
915 | /// Handle any errors (if present) in an Expected<T>, then try a recovery path. | |||
916 | /// | |||
917 | /// If the incoming value is a success value it is returned unmodified. If it | |||
918 | /// is a failure value then it the contained error is passed to handleErrors. | |||
919 | /// If handleErrors is able to handle the error then the RecoveryPath functor | |||
920 | /// is called to supply the final result. If handleErrors is not able to | |||
921 | /// handle all errors then the unhandled errors are returned. | |||
922 | /// | |||
923 | /// This utility enables the follow pattern: | |||
924 | /// | |||
925 | /// @code{.cpp} | |||
926 | /// enum FooStrategy { Aggressive, Conservative }; | |||
927 | /// Expected<Foo> foo(FooStrategy S); | |||
928 | /// | |||
929 | /// auto ResultOrErr = | |||
930 | /// handleExpected( | |||
931 | /// foo(Aggressive), | |||
932 | /// []() { return foo(Conservative); }, | |||
933 | /// [](AggressiveStrategyError&) { | |||
934 | /// // Implicitly conusme this - we'll recover by using a conservative | |||
935 | /// // strategy. | |||
936 | /// }); | |||
937 | /// | |||
938 | /// @endcode | |||
939 | template <typename T, typename RecoveryFtor, typename... HandlerTs> | |||
940 | Expected<T> handleExpected(Expected<T> ValOrErr, RecoveryFtor &&RecoveryPath, | |||
941 | HandlerTs &&... Handlers) { | |||
942 | if (ValOrErr) | |||
943 | return ValOrErr; | |||
944 | ||||
945 | if (auto Err = handleErrors(ValOrErr.takeError(), | |||
946 | std::forward<HandlerTs>(Handlers)...)) | |||
947 | return std::move(Err); | |||
948 | ||||
949 | return RecoveryPath(); | |||
950 | } | |||
951 | ||||
952 | /// Log all errors (if any) in E to OS. If there are any errors, ErrorBanner | |||
953 | /// will be printed before the first one is logged. A newline will be printed | |||
954 | /// after each error. | |||
955 | /// | |||
956 | /// This is useful in the base level of your program to allow clean termination | |||
957 | /// (allowing clean deallocation of resources, etc.), while reporting error | |||
958 | /// information to the user. | |||
959 | void logAllUnhandledErrors(Error E, raw_ostream &OS, Twine ErrorBanner); | |||
960 | ||||
961 | /// Write all error messages (if any) in E to a string. The newline character | |||
962 | /// is used to separate error messages. | |||
963 | inline std::string toString(Error E) { | |||
964 | SmallVector<std::string, 2> Errors; | |||
965 | handleAllErrors(std::move(E), [&Errors](const ErrorInfoBase &EI) { | |||
966 | Errors.push_back(EI.message()); | |||
967 | }); | |||
968 | return join(Errors.begin(), Errors.end(), "\n"); | |||
969 | } | |||
970 | ||||
971 | /// Consume a Error without doing anything. This method should be used | |||
972 | /// only where an error can be considered a reasonable and expected return | |||
973 | /// value. | |||
974 | /// | |||
975 | /// Uses of this method are potentially indicative of design problems: If it's | |||
976 | /// legitimate to do nothing while processing an "error", the error-producer | |||
977 | /// might be more clearly refactored to return an Optional<T>. | |||
978 | inline void consumeError(Error Err) { | |||
979 | handleAllErrors(std::move(Err), [](const ErrorInfoBase &) {}); | |||
980 | } | |||
981 | ||||
982 | /// Helper for converting an Error to a bool. | |||
983 | /// | |||
984 | /// This method returns true if Err is in an error state, or false if it is | |||
985 | /// in a success state. Puts Err in a checked state in both cases (unlike | |||
986 | /// Error::operator bool(), which only does this for success states). | |||
987 | inline bool errorToBool(Error Err) { | |||
988 | bool IsError = static_cast<bool>(Err); | |||
989 | if (IsError) | |||
990 | consumeError(std::move(Err)); | |||
991 | return IsError; | |||
992 | } | |||
993 | ||||
994 | /// Helper for Errors used as out-parameters. | |||
995 | /// | |||
996 | /// This helper is for use with the Error-as-out-parameter idiom, where an error | |||
997 | /// is passed to a function or method by reference, rather than being returned. | |||
998 | /// In such cases it is helpful to set the checked bit on entry to the function | |||
999 | /// so that the error can be written to (unchecked Errors abort on assignment) | |||
1000 | /// and clear the checked bit on exit so that clients cannot accidentally forget | |||
1001 | /// to check the result. This helper performs these actions automatically using | |||
1002 | /// RAII: | |||
1003 | /// | |||
1004 | /// @code{.cpp} | |||
1005 | /// Result foo(Error &Err) { | |||
1006 | /// ErrorAsOutParameter ErrAsOutParam(&Err); // 'Checked' flag set | |||
1007 | /// // <body of foo> | |||
1008 | /// // <- 'Checked' flag auto-cleared when ErrAsOutParam is destructed. | |||
1009 | /// } | |||
1010 | /// @endcode | |||
1011 | /// | |||
1012 | /// ErrorAsOutParameter takes an Error* rather than Error& so that it can be | |||
1013 | /// used with optional Errors (Error pointers that are allowed to be null). If | |||
1014 | /// ErrorAsOutParameter took an Error reference, an instance would have to be | |||
1015 | /// created inside every condition that verified that Error was non-null. By | |||
1016 | /// taking an Error pointer we can just create one instance at the top of the | |||
1017 | /// function. | |||
1018 | class ErrorAsOutParameter { | |||
1019 | public: | |||
1020 | ErrorAsOutParameter(Error *Err) : Err(Err) { | |||
1021 | // Raise the checked bit if Err is success. | |||
1022 | if (Err) | |||
1023 | (void)!!*Err; | |||
1024 | } | |||
1025 | ||||
1026 | ~ErrorAsOutParameter() { | |||
1027 | // Clear the checked bit. | |||
1028 | if (Err && !*Err) | |||
1029 | *Err = Error::success(); | |||
1030 | } | |||
1031 | ||||
1032 | private: | |||
1033 | Error *Err; | |||
1034 | }; | |||
1035 | ||||
1036 | /// Helper for Expected<T>s used as out-parameters. | |||
1037 | /// | |||
1038 | /// See ErrorAsOutParameter. | |||
1039 | template <typename T> | |||
1040 | class ExpectedAsOutParameter { | |||
1041 | public: | |||
1042 | ExpectedAsOutParameter(Expected<T> *ValOrErr) | |||
1043 | : ValOrErr(ValOrErr) { | |||
1044 | if (ValOrErr) | |||
1045 | (void)!!*ValOrErr; | |||
1046 | } | |||
1047 | ||||
1048 | ~ExpectedAsOutParameter() { | |||
1049 | if (ValOrErr) | |||
1050 | ValOrErr->setUnchecked(); | |||
1051 | } | |||
1052 | ||||
1053 | private: | |||
1054 | Expected<T> *ValOrErr; | |||
1055 | }; | |||
1056 | ||||
1057 | /// This class wraps a std::error_code in a Error. | |||
1058 | /// | |||
1059 | /// This is useful if you're writing an interface that returns a Error | |||
1060 | /// (or Expected) and you want to call code that still returns | |||
1061 | /// std::error_codes. | |||
1062 | class ECError : public ErrorInfo<ECError> { | |||
1063 | friend Error errorCodeToError(std::error_code); | |||
1064 | ||||
1065 | public: | |||
1066 | void setErrorCode(std::error_code EC) { this->EC = EC; } | |||
1067 | std::error_code convertToErrorCode() const override { return EC; } | |||
1068 | void log(raw_ostream &OS) const override { OS << EC.message(); } | |||
1069 | ||||
1070 | // Used by ErrorInfo::classID. | |||
1071 | static char ID; | |||
1072 | ||||
1073 | protected: | |||
1074 | ECError() = default; | |||
1075 | ECError(std::error_code EC) : EC(EC) {} | |||
1076 | ||||
1077 | std::error_code EC; | |||
1078 | }; | |||
1079 | ||||
1080 | /// The value returned by this function can be returned from convertToErrorCode | |||
1081 | /// for Error values where no sensible translation to std::error_code exists. | |||
1082 | /// It should only be used in this situation, and should never be used where a | |||
1083 | /// sensible conversion to std::error_code is available, as attempts to convert | |||
1084 | /// to/from this error will result in a fatal error. (i.e. it is a programmatic | |||
1085 | ///error to try to convert such a value). | |||
1086 | std::error_code inconvertibleErrorCode(); | |||
1087 | ||||
1088 | /// Helper for converting an std::error_code to a Error. | |||
1089 | Error errorCodeToError(std::error_code EC); | |||
1090 | ||||
1091 | /// Helper for converting an ECError to a std::error_code. | |||
1092 | /// | |||
1093 | /// This method requires that Err be Error() or an ECError, otherwise it | |||
1094 | /// will trigger a call to abort(). | |||
1095 | std::error_code errorToErrorCode(Error Err); | |||
1096 | ||||
1097 | /// Convert an ErrorOr<T> to an Expected<T>. | |||
1098 | template <typename T> Expected<T> errorOrToExpected(ErrorOr<T> &&EO) { | |||
1099 | if (auto EC = EO.getError()) | |||
1100 | return errorCodeToError(EC); | |||
1101 | return std::move(*EO); | |||
1102 | } | |||
1103 | ||||
1104 | /// Convert an Expected<T> to an ErrorOr<T>. | |||
1105 | template <typename T> ErrorOr<T> expectedToErrorOr(Expected<T> &&E) { | |||
1106 | if (auto Err = E.takeError()) | |||
1107 | return errorToErrorCode(std::move(Err)); | |||
1108 | return std::move(*E); | |||
1109 | } | |||
1110 | ||||
1111 | /// This class wraps a string in an Error. | |||
1112 | /// | |||
1113 | /// StringError is useful in cases where the client is not expected to be able | |||
1114 | /// to consume the specific error message programmatically (for example, if the | |||
1115 | /// error message is to be presented to the user). | |||
1116 | /// | |||
1117 | /// StringError can also be used when additional information is to be printed | |||
1118 | /// along with a error_code message. Depending on the constructor called, this | |||
1119 | /// class can either display: | |||
1120 | /// 1. the error_code message (ECError behavior) | |||
1121 | /// 2. a string | |||
1122 | /// 3. the error_code message and a string | |||
1123 | /// | |||
1124 | /// These behaviors are useful when subtyping is required; for example, when a | |||
1125 | /// specific library needs an explicit error type. In the example below, | |||
1126 | /// PDBError is derived from StringError: | |||
1127 | /// | |||
1128 | /// @code{.cpp} | |||
1129 | /// Expected<int> foo() { | |||
1130 | /// return llvm::make_error<PDBError>(pdb_error_code::dia_failed_loading, | |||
1131 | /// "Additional information"); | |||
1132 | /// } | |||
1133 | /// @endcode | |||
1134 | /// | |||
1135 | class StringError : public ErrorInfo<StringError> { | |||
1136 | public: | |||
1137 | static char ID; | |||
1138 | ||||
1139 | // Prints EC + S and converts to EC | |||
1140 | StringError(std::error_code EC, const Twine &S = Twine()); | |||
1141 | ||||
1142 | // Prints S and converts to EC | |||
1143 | StringError(const Twine &S, std::error_code EC); | |||
1144 | ||||
1145 | void log(raw_ostream &OS) const override; | |||
1146 | std::error_code convertToErrorCode() const override; | |||
1147 | ||||
1148 | const std::string &getMessage() const { return Msg; } | |||
1149 | ||||
1150 | private: | |||
1151 | std::string Msg; | |||
1152 | std::error_code EC; | |||
1153 | const bool PrintMsgOnly = false; | |||
1154 | }; | |||
1155 | ||||
1156 | /// Create formatted StringError object. | |||
1157 | template <typename... Ts> | |||
1158 | Error createStringError(std::error_code EC, char const *Fmt, | |||
1159 | const Ts &... Vals) { | |||
1160 | std::string Buffer; | |||
1161 | raw_string_ostream Stream(Buffer); | |||
1162 | Stream << format(Fmt, Vals...); | |||
1163 | return make_error<StringError>(Stream.str(), EC); | |||
1164 | } | |||
1165 | ||||
1166 | Error createStringError(std::error_code EC, char const *Msg); | |||
1167 | ||||
1168 | /// This class wraps a filename and another Error. | |||
1169 | /// | |||
1170 | /// In some cases, an error needs to live along a 'source' name, in order to | |||
1171 | /// show more detailed information to the user. | |||
1172 | class FileError final : public ErrorInfo<FileError> { | |||
1173 | ||||
1174 | friend Error createFileError(std::string, Error); | |||
1175 | ||||
1176 | public: | |||
1177 | void log(raw_ostream &OS) const override { | |||
1178 | assert(Err && !FileName.empty() && "Trying to log after takeError().")((Err && !FileName.empty() && "Trying to log after takeError()." ) ? static_cast<void> (0) : __assert_fail ("Err && !FileName.empty() && \"Trying to log after takeError().\"" , "/build/llvm-toolchain-snapshot-8~svn345461/include/llvm/Support/Error.h" , 1178, __PRETTY_FUNCTION__)); | |||
1179 | OS << "'" << FileName << "': "; | |||
1180 | Err->log(OS); | |||
1181 | } | |||
1182 | ||||
1183 | Error takeError() { return Error(std::move(Err)); } | |||
1184 | ||||
1185 | std::error_code convertToErrorCode() const override; | |||
1186 | ||||
1187 | // Used by ErrorInfo::classID. | |||
1188 | static char ID; | |||
1189 | ||||
1190 | private: | |||
1191 | FileError(std::string F, std::unique_ptr<ErrorInfoBase> E) { | |||
1192 | assert(E && "Cannot create FileError from Error success value.")((E && "Cannot create FileError from Error success value." ) ? static_cast<void> (0) : __assert_fail ("E && \"Cannot create FileError from Error success value.\"" , "/build/llvm-toolchain-snapshot-8~svn345461/include/llvm/Support/Error.h" , 1192, __PRETTY_FUNCTION__)); | |||
1193 | assert(!F.empty() &&((!F.empty() && "The file name provided to FileError must not be empty." ) ? static_cast<void> (0) : __assert_fail ("!F.empty() && \"The file name provided to FileError must not be empty.\"" , "/build/llvm-toolchain-snapshot-8~svn345461/include/llvm/Support/Error.h" , 1194, __PRETTY_FUNCTION__)) | |||
1194 | "The file name provided to FileError must not be empty.")((!F.empty() && "The file name provided to FileError must not be empty." ) ? static_cast<void> (0) : __assert_fail ("!F.empty() && \"The file name provided to FileError must not be empty.\"" , "/build/llvm-toolchain-snapshot-8~svn345461/include/llvm/Support/Error.h" , 1194, __PRETTY_FUNCTION__)); | |||
1195 | FileName = F; | |||
1196 | Err = std::move(E); | |||
1197 | } | |||
1198 | ||||
1199 | static Error build(std::string F, Error E) { | |||
1200 | return Error(std::unique_ptr<FileError>(new FileError(F, E.takePayload()))); | |||
1201 | } | |||
1202 | ||||
1203 | std::string FileName; | |||
1204 | std::unique_ptr<ErrorInfoBase> Err; | |||
1205 | }; | |||
1206 | ||||
1207 | /// Concatenate a source file path and/or name with an Error. The resulting | |||
1208 | /// Error is unchecked. | |||
1209 | inline Error createFileError(std::string F, Error E) { | |||
1210 | return FileError::build(F, std::move(E)); | |||
1211 | } | |||
1212 | ||||
1213 | Error createFileError(std::string F, ErrorSuccess) = delete; | |||
1214 | ||||
1215 | /// Helper for check-and-exit error handling. | |||
1216 | /// | |||
1217 | /// For tool use only. NOT FOR USE IN LIBRARY CODE. | |||
1218 | /// | |||
1219 | class ExitOnError { | |||
1220 | public: | |||
1221 | /// Create an error on exit helper. | |||
1222 | ExitOnError(std::string Banner = "", int DefaultErrorExitCode = 1) | |||
1223 | : Banner(std::move(Banner)), | |||
1224 | GetExitCode([=](const Error &) { return DefaultErrorExitCode; }) {} | |||
1225 | ||||
1226 | /// Set the banner string for any errors caught by operator(). | |||
1227 | void setBanner(std::string Banner) { this->Banner = std::move(Banner); } | |||
1228 | ||||
1229 | /// Set the exit-code mapper function. | |||
1230 | void setExitCodeMapper(std::function<int(const Error &)> GetExitCode) { | |||
1231 | this->GetExitCode = std::move(GetExitCode); | |||
1232 | } | |||
1233 | ||||
1234 | /// Check Err. If it's in a failure state log the error(s) and exit. | |||
1235 | void operator()(Error Err) const { checkError(std::move(Err)); } | |||
1236 | ||||
1237 | /// Check E. If it's in a success state then return the contained value. If | |||
1238 | /// it's in a failure state log the error(s) and exit. | |||
1239 | template <typename T> T operator()(Expected<T> &&E) const { | |||
1240 | checkError(E.takeError()); | |||
1241 | return std::move(*E); | |||
1242 | } | |||
1243 | ||||
1244 | /// Check E. If it's in a success state then return the contained reference. If | |||
1245 | /// it's in a failure state log the error(s) and exit. | |||
1246 | template <typename T> T& operator()(Expected<T&> &&E) const { | |||
1247 | checkError(E.takeError()); | |||
1248 | return *E; | |||
1249 | } | |||
1250 | ||||
1251 | private: | |||
1252 | void checkError(Error Err) const { | |||
1253 | if (Err) { | |||
1254 | int ExitCode = GetExitCode(Err); | |||
1255 | logAllUnhandledErrors(std::move(Err), errs(), Banner); | |||
1256 | exit(ExitCode); | |||
1257 | } | |||
1258 | } | |||
1259 | ||||
1260 | std::string Banner; | |||
1261 | std::function<int(const Error &)> GetExitCode; | |||
1262 | }; | |||
1263 | ||||
1264 | /// Conversion from Error to LLVMErrorRef for C error bindings. | |||
1265 | inline LLVMErrorRef wrap(Error Err) { | |||
1266 | return reinterpret_cast<LLVMErrorRef>(Err.takePayload().release()); | |||
1267 | } | |||
1268 | ||||
1269 | /// Conversion from LLVMErrorRef to Error for C error bindings. | |||
1270 | inline Error unwrap(LLVMErrorRef ErrRef) { | |||
1271 | return Error(std::unique_ptr<ErrorInfoBase>( | |||
1272 | reinterpret_cast<ErrorInfoBase *>(ErrRef))); | |||
1273 | } | |||
1274 | ||||
1275 | } // end namespace llvm | |||
1276 | ||||
1277 | #endif // LLVM_SUPPORT_ERROR_H |