Lines Matching defs:Blocks
320 /// all terminators except the specified basic blocks to a 'ret' instruction,
352 SmallPtrSet<BasicBlock*, 8> Blocks;
354 Blocks.insert(cast<BasicBlock>(VMap[BBs[i]]));
356 outs() << "Checking for crash with only these blocks:";
357 unsigned NumPrint = Blocks.size();
361 if (NumPrint < Blocks.size())
362 outs() << "... <" << Blocks.size() << " total>";
365 // Loop over and delete any hack up any blocks that are not listed...
368 if (!Blocks.count(&*BB) && BB->getTerminator()->getNumSuccessors()) {
386 // The CFG Simplifier pass may delete one of the basic blocks we are
388 // a "persistent mapping" by turning basic blocks into <function, name> pairs.
389 // This won't work well if blocks are unnamed, but that is just the risk we
393 for (BasicBlock *BB : Blocks)
413 // module, and that they don't include any deleted blocks.
496 // module, and that they don't include any deleted blocks.
637 // module, and that they don't include any deleted blocks.
725 // Attempt to delete entire basic blocks at a time to speed up
726 // convergence... this actually works by setting the terminator of the blocks
731 std::vector<const BasicBlock*> Blocks;
734 Blocks.push_back(&BB);
735 unsigned OldSize = Blocks.size();
736 ReduceCrashingBlocks(BD, TestFn).reduceList(Blocks, Error);
737 if (Blocks.size() < OldSize)
738 BD.EmitProgressBitcode(BD.getProgram(), "reduced-blocks");
742 // cases with large basic blocks where the problem is at one end.
