Lines Matching refs:Blocks
244 /// all terminators except the specified basic blocks to a 'ret' instruction,
276 SmallPtrSet<BasicBlock*, 8> Blocks;
278 Blocks.insert(cast<BasicBlock>(VMap[BBs[i]]));
280 outs() << "Checking for crash with only these blocks:";
281 unsigned NumPrint = Blocks.size();
285 if (NumPrint < Blocks.size())
286 outs() << "... <" << Blocks.size() << " total>";
289 // Loop over and delete any hack up any blocks that are not listed...
292 if (!Blocks.count(BB) && BB->getTerminator()->getNumSuccessors()) {
308 // The CFG Simplifier pass may delete one of the basic blocks we are
310 // a "persistent mapping" by turning basic blocks into <function, name> pairs.
311 // This won't work well if blocks are unnamed, but that is just the risk we
315 for (SmallPtrSet<BasicBlock*, 8>::iterator I = Blocks.begin(),
316 E = Blocks.end(); I != E; ++I)
337 // module, and that they don't include any deleted blocks.
420 // module, and that they don't include any deleted blocks.
508 // Attempt to delete entire basic blocks at a time to speed up
509 // convergence... this actually works by setting the terminator of the blocks
514 std::vector<const BasicBlock*> Blocks;
518 Blocks.push_back(FI);
519 unsigned OldSize = Blocks.size();
520 ReduceCrashingBlocks(BD, TestFn).reduceList(Blocks, Error);
521 if (Blocks.size() < OldSize)
522 BD.EmitProgressBitcode(BD.getProgram(), "reduced-blocks");
526 // cases with large basic blocks where the problem is at one end.
