HomeSort by: relevance | last modified time | path
    Searched refs:DeadBlocks (Results 1 - 13 of 13) sorted by relevancy

  /src/external/apache2/llvm/dist/clang/lib/AST/Interp/
InterpState.cpp 36 while (DeadBlocks) {
37 DeadBlock *Next = DeadBlocks->Next;
38 free(DeadBlocks);
39 DeadBlocks = Next;
64 auto *D = new (Memory) DeadBlock(DeadBlocks, B);
InterpState.h 92 DeadBlock *DeadBlocks = nullptr;
  /src/external/apache2/llvm/dist/llvm/lib/CodeGen/
UnreachableBlockElim.cpp 116 std::vector<MachineBasicBlock*> DeadBlocks;
120 DeadBlocks.push_back(&BB);
147 for (unsigned i = 0, e = DeadBlocks.size(); i != e; ++i) {
149 for (auto &I : DeadBlocks[i]->instrs())
151 DeadBlocks[i]->getParent()->eraseCallSiteInfo(&I);
153 DeadBlocks[i]->eraseFromParent();
207 return (!DeadBlocks.empty() || ModifiedPHI);
  /src/external/apache2/llvm/dist/llvm/lib/Transforms/Scalar/
SimplifyCFGPass.cpp 86 SmallVector<BasicBlock *, 8> DeadBlocks;
159 DeadBlocks.emplace_back(&BB);
190 DeleteDeadBlocks(DeadBlocks, DTU);
GVN.cpp 1153 if (DeadBlocks.count(DepBB)) {
2496 // Do not cleanup DeadBlocks in cleanupGlobalSets() as it's called for each
2498 DeadBlocks.clear();
2511 if (DeadBlocks.count(BB))
2908 /// function is to add all these blocks to "DeadBlocks". For the dead blocks'
2918 if (DeadBlocks.count(D))
2924 DeadBlocks.insert(Dom.begin(), Dom.end());
2929 if (DeadBlocks.count(S))
2934 if (!DeadBlocks.count(P)) {
2956 if (DeadBlocks.count(B)
    [all...]
MergeICmps.cpp 746 SmallVector<BasicBlock *, 16> DeadBlocks;
749 DeadBlocks.push_back(Cmp.BB);
751 DeleteDeadBlocks(DeadBlocks, &DTU);
SimpleLoopUnswitch.cpp 1512 SmallVector<BasicBlock *, 16> DeadBlocks;
1519 DeadBlocks.push_back(ClonedBB);
1524 SmallSetVector<BasicBlock *, 8> DeadBlockSet(DeadBlocks.begin(),
1525 DeadBlocks.end());
1530 for (BasicBlock *BB : DeadBlocks)
1533 for (BasicBlock *BB : DeadBlocks)
  /src/external/apache2/llvm/dist/llvm/include/llvm/Analysis/
MemorySSAUpdater.h 234 /// Phi nodes may already be updated. Instructions in DeadBlocks should be
236 void removeBlocks(const SmallSetVector<BasicBlock *, 8> &DeadBlocks);
  /src/external/apache2/llvm/dist/llvm/lib/IR/
SafepointIRVerifier.cpp 73 SetVector<const BasicBlock *> DeadBlocks;
103 return DeadBlocks.count(BB);
133 DeadBlocks.insert(&BB);
176 DeadBlocks.insert(Dom.begin(), Dom.end());
  /src/external/apache2/llvm/dist/llvm/include/llvm/Transforms/Scalar/
GVN.h 220 SetVector<BasicBlock *> DeadBlocks;
  /src/external/apache2/llvm/dist/llvm/lib/Analysis/
MemorySSAUpdater.cpp 1373 const SmallSetVector<BasicBlock *, 8> &DeadBlocks) {
1375 for (BasicBlock *BB : DeadBlocks) {
1379 if (!DeadBlocks.count(Succ))
1391 for (BasicBlock *BB : DeadBlocks) {
InlineCost.cpp 322 SetVector<BasicBlock *> DeadBlocks;
820 if (DeadBlocks.count(L->getHeader()))
1106 if (DeadBlocks.count(Pred))
2221 return (DeadBlocks.count(Pred) ||
2227 return (!DeadBlocks.count(BB) &&
2239 if (DeadBlocks.insert(Dead))
  /src/external/apache2/llvm/dist/llvm/lib/Transforms/Utils/
BasicBlockUtils.cpp 127 std::vector<BasicBlock*> DeadBlocks;
130 DeadBlocks.push_back(&BB);
133 DeleteDeadBlocks(DeadBlocks, DTU, KeepOneInputPHIs);
135 return !DeadBlocks.empty();

Completed in 31 milliseconds