HomeSort by: relevance | last modified time | path
    Searched refs:BBs (Results 1 - 25 of 36) sorted by relevancy

1 2

  /src/external/apache2/llvm/dist/llvm/lib/IR/
StructuralHash.cpp 40 SmallVector<const BasicBlock *, 8> BBs;
43 BBs.push_back(&F.getEntryBlock());
44 VisitedBBs.insert(BBs[0]);
45 while (!BBs.empty()) {
46 const BasicBlock *BB = BBs.pop_back_val();
55 BBs.push_back(Term->getSuccessor(i));
  /src/external/apache2/llvm/dist/llvm/include/llvm/IR/
InstIterator.h 37 BB_t *BBs; // BasicBlocksType
54 : BBs(II.BBs), BB(II.BB), BI(II.BI) {}
58 : BBs(II.BBs), BB(II.BB), BI(II.BI) {}
61 : BBs(&m.getBasicBlockList()), BB(BBs->begin()) { // begin ctor
62 if (BB != BBs->end()) {
69 : BBs(&m.getBasicBlockList()), BB(BBs->end()) { // end cto
    [all...]
  /src/external/apache2/llvm/dist/llvm/lib/CodeGen/
IndirectBrExpandPass.cpp 129 SmallVector<BasicBlock *, 4> BBs;
158 int BBIndex = BBs.size() + 1;
159 BBs.push_back(&BB);
171 if (BBs.empty()) {
228 // Otherwise we need to create a new block to hold the switch across BBs,
254 auto *SI = SwitchInst::Create(SwitchValue, BBs[0], BBs.size(), SwitchBB);
257 for (int i : llvm::seq<int>(1, BBs.size()))
258 SI->addCase(ConstantInt::get(CommonITy, i + 1), BBs[i]);
263 SmallPtrSet<BasicBlock *, 8> UniqueSuccessors(BBs.begin(), BBs.end())
    [all...]
WasmEHPrepare.cpp 159 // Erase the specified BBs if the BB does not have any remaining predecessors,
162 static void eraseDeadBBsAndChildren(const Container &BBs, DomTreeUpdater *DTU) {
163 SmallVector<BasicBlock *, 8> WL(BBs.begin(), BBs.end());
MachineCSE.cpp 602 "different BBs, avoid CSE!\n");
882 SmallVector<MachineDomTreeNode *, 32> BBs;
886 BBs.push_back(DT->getRootNode());
888 auto Node = BBs.pop_back_val();
889 append_range(BBs, Node->children());
894 } while (!BBs.empty());
ShrinkWrap.cpp 314 static MachineBasicBlock *FindIDom(MachineBasicBlock &Block, ListOfBBs BBs,
317 for (MachineBasicBlock *BB : BBs) {
  /src/external/apache2/llvm/dist/llvm/lib/Transforms/IPO/
InlineSimple.cpp 59 const auto &BBs = CB.getCaller()->getBasicBlockList();
60 if (!BBs.empty()) {
61 auto DI = OptimizationRemark(DEBUG_TYPE, "", DebugLoc(), &BBs.front());
BlockExtractor.cpp 143 report_fatal_error("Missing bbs name");
210 for (auto &BBs : GroupsOfBlocks) {
212 for (BasicBlock *BB : BBs) {
225 CodeExtractorAnalysisCache CEAC(*BBs[0]->getParent());
228 LLVM_DEBUG(dbgs() << "Extracted group '" << (*BBs.begin())->getName()
232 << (*BBs.begin())->getName() << "'\n");
  /src/external/apache2/llvm/dist/llvm/lib/Transforms/Scalar/
ConstantHoisting.cpp 210 /// Given \p BBs as input, find another set of BBs which collectively
211 /// dominates \p BBs and have the minimal sum of frequencies. Return the BB
212 /// set found in \p BBs.
215 SetVector<BasicBlock *> &BBs) {
216 assert(!BBs.count(Entry) && "Assume Entry is not in BBs");
219 // Candidates includes any block 'BB' in set 'BBs' that is not strictly
220 // dominated by any other blocks in set 'BBs', and all nodes in the path
223 for (auto BB : BBs) {
    [all...]
LoopSink.cpp 23 // InsertBBs = BBs that uses I
25 // DomBBs = BBs in InsertBBs that are dominated by BB
81 /// Return adjusted total frequency of \p BBs.
89 /// Freq(BBs) = sum(50, 49) = 99
90 /// Even if Freq(BBs) < Freq(Preheader), we will not sink from Preheade to
91 /// BBs as the difference is too small to justify the code size increase.
92 /// To model this, The adjusted Freq(BBs) will be:
93 /// AdjustedFreq(BBs) = 99 / SinkFrequencyPercentThreshold%
94 static BlockFrequency adjustedSumFreq(SmallPtrSetImpl<BasicBlock *> &BBs,
97 for (BasicBlock *B : BBs)
    [all...]
PlaceSafepoints.cpp 661 DenseSet<BasicBlock *> BBs; // new BBs + insertee
672 scanInlinedCode(&*Start, &*After, Calls, BBs);
  /src/external/apache2/llvm/dist/llvm/include/llvm/Analysis/
DependenceGraphBuilder.h 44 const BasicBlockListType &BBs)
45 : Graph(G), DI(D), BBList(BBs) {}
DominanceFrontierImpl.h 138 const std::set<BlockT *> &BBs = I->second;
140 for (const BlockT *BB : BBs) {
RegionInfoImpl.h 122 // BBs that are not part of any loop are element of the Loop
899 RegionInfoBase<Tr>::getCommonRegion(SmallVectorImpl<BlockT *> &BBs) const {
900 RegionT *ret = getRegionFor(BBs.back());
901 BBs.pop_back();
903 for (BlockT *BB : BBs)
914 // starting with BB is stored. These regions can be threated as single BBS.
  /src/external/apache2/llvm/dist/llvm/tools/bugpoint/
CrashDebugger.cpp 391 void simpleSimplifyCfg(Function &F, SmallVectorImpl<BasicBlock *> &BBs) {
395 for (auto *BB : BBs) {
452 bool ReduceCrashingBlocks::TestBlocks(std::vector<const BasicBlock *> &BBs) {
459 for (unsigned i = 0, e = BBs.size(); i != e; ++i)
460 Blocks.insert(cast<BasicBlock>(VMap[BBs[i]]));
467 outs() << " " << BBs[i]->getName();
529 BBs.clear();
535 BBs.push_back(cast<BasicBlock>(V));
572 std::vector<const BasicBlock *> &BBs) {
579 for (const auto *BB : BBs)
    [all...]
Miscompilation.cpp 479 Expected<bool> TestFuncs(const std::vector<BasicBlock *> &BBs);
487 ReduceMiscompiledBlocks::TestFuncs(const std::vector<BasicBlock *> &BBs) {
491 if (!BBs.empty()) {
492 outs() << "but these " << BBs.size() << " blocks are extracted: ";
493 for (unsigned i = 0, e = BBs.size() < 10 ? BBs.size() : 10; i != e; ++i)
494 outs() << BBs[i]->getName() << " ";
495 if (BBs.size() > 10)
512 for (unsigned i = 0, e = BBs.size(); i != e; ++i) {
513 BasicBlock *BB = cast<BasicBlock>(VMap[BBs[i]])
    [all...]
ExtractFunction.cpp 372 BugDriver::extractMappedBlocksFromModule(const std::vector<BasicBlock *> &BBs,
384 // Extract all of the blocks except the ones in BBs.
389 if (!llvm::is_contained(BBs, &BB))
393 for (BasicBlock *BB : BBs) {
  /src/external/apache2/llvm/dist/llvm/lib/ExecutionEngine/Orc/
SpeculateAnalyses.cpp 28 SmallVector<const BasicBlock *, 8> BBs;
39 BBs.emplace_back(&BB);
41 return BBs;
110 decltype(BBFreqs)::const_reference BBS) {
111 return BBF.second > BBS.second ? true : false;
252 decltype(BBFreqs)::const_reference Bbs) {
253 return Bbf.second > Bbs.second;
  /src/external/apache2/llvm/dist/llvm/tools/llvm-extract/
llvm-extract.cpp 342 SmallVector<BasicBlock *, 16> BBs;
355 BBs.push_back(&*Res);
357 GroupOfBBs.push_back(BBs);
  /src/external/apache2/llvm/dist/llvm/include/llvm/Transforms/Utils/
CodeExtractor.h 119 CodeExtractor(ArrayRef<BasicBlock *> BBs, DominatorTree *DT = nullptr,
BasicBlockUtils.h 45 /// Replace contents of every block in \p BBs with single unreachable
49 void DetatchDeadBlocks(ArrayRef <BasicBlock *> BBs,
58 /// no predecessors that are not being deleted themselves. \p BBs must have no
63 void DeleteDeadBlocks(ArrayRef <BasicBlock *> BBs,
Cloning.h 301 ArrayRef<BasicBlock *> BBs, SmallVectorImpl<MDNode *> &NoAliasDeclScopes);
  /src/external/apache2/llvm/dist/llvm/lib/Transforms/Utils/
FunctionComparator.cpp 369 // They are BBs in the same function. Order by which comes first in the
942 // the strategy compare() uses to compare functions by walking the BBs in depth
953 SmallVector<const BasicBlock *, 8> BBs;
958 BBs.push_back(&F.getEntryBlock());
959 VisitedBBs.insert(BBs[0]);
960 while (!BBs.empty()) {
961 const BasicBlock *BB = BBs.pop_back_val();
963 // opcodes into BBs wouldn't affect the hash, only the order of the opcodes
972 BBs.push_back(Term->getSuccessor(i));
BasicBlockUtils.cpp 56 ArrayRef<BasicBlock *> BBs,
59 for (auto *BB : BBs) {
94 void llvm::DeleteDeadBlocks(ArrayRef <BasicBlock *> BBs, DomTreeUpdater *DTU,
98 SmallPtrSet<BasicBlock *, 4> Dead(BBs.begin(), BBs.end());
99 assert(Dead.size() == BBs.size() && "Duplicating blocks?");
106 DetatchDeadBlocks(BBs, DTU ? &Updates : nullptr, KeepOneInputPHIs);
111 for (BasicBlock *BB : BBs)
  /src/external/apache2/llvm/dist/llvm/lib/Target/WebAssembly/
WebAssemblyLowerEmscriptenEHSjLj.cpp 1030 // Because we are creating new BBs while processing and don't want to make
1031 // all these newly created BBs candidates again for longjmp processing, we
1032 // first make the vector of candidate BBs.
1033 std::vector<BasicBlock *> BBs;
1035 BBs.push_back(&BB);
1037 // BBs.size() will change within the loop, so we query it every time
1038 for (unsigned I = 0; I < BBs.size(); I++) {
1039 BasicBlock *BB = BBs[I];
1129 BBs.push_back(Tail);

Completed in 36 milliseconds

1 2