Searched defs:BBInfo (Results 1 - 9 of 9) sorted by relevance

/external/llvm/include/llvm/Support/
H A DGenericDomTreeConstruction.h63 typename DominatorTreeBase<typename GraphT::NodeType>::InfoRec &BBInfo = local
68 BBInfo.DFSNum = BBInfo.Semi = ++N;
69 BBInfo.Label = BB;
74 BBInfo.Parent = 1;
79 // store the DFS number of the current BB - the reference to BBInfo might
81 unsigned BBDFSNum = BBInfo.DFSNum;
158 typename DominatorTreeBase<typename GraphT::NodeType>::InfoRec &BBInfo = local
160 BBInfo.DFSNum = BBInfo
[all...]
/external/llvm/lib/Target/X86/
H A DX86PadShortFunction.cpp179 VisitedBBInfo BBInfo = it->second; local
180 Cycles += BBInfo.Cycles;
181 return BBInfo.HasReturn;
/external/llvm/include/llvm/Transforms/Utils/
H A DSSAUpdaterImpl.h42 /// BBInfo - Per-basic block information used internally by SSAUpdaterImpl.
45 class BBInfo { class in class:llvm::SSAUpdaterImpl
49 BBInfo *DefBB; // Block that defines the available value.
51 BBInfo *IDom; // Immediate dominator.
53 BBInfo **Preds; // Array[NumPreds] of predecessor blocks.
56 BBInfo(BlkT *ThisBB, ValT V) function in class:llvm::SSAUpdaterImpl::BBInfo
66 typedef SmallVectorImpl<BBInfo*> BlockListTy;
67 typedef DenseMap<BlkT*, BBInfo*> BBMapTy;
81 SmallVector<BBInfo*, 100> BlockList;
82 BBInfo *PseudoEntr
[all...]
/external/clang/include/clang/Analysis/Analyses/
H A DThreadSafetyCommon.h372 std::vector<BlockInfo> BBInfo; // Extra information per BB. member in class:clang::threadSafety::SExprBuilder
/external/llvm/lib/MC/MCAnalysis/
H A DMCObjectDisassembler.cpp155 struct BBInfo;
156 typedef SmallPtrSet<BBInfo*, 2> BBInfoSetTy;
158 struct BBInfo { struct in namespace:__anon25875
165 BBInfo() : Atom(nullptr), BB(nullptr) {} function in struct:__anon25875::BBInfo
167 void addSucc(BBInfo &Succ) {
180 typedef std::map<uint64_t, BBInfo> BBInfoByAddrTy;
245 BBInfo &CurBB = BBInfos[TA->getBeginAddr()];
261 BBInfo &BBI = BBInfos[*CI];
267 SmallSetVector<BBInfo*, 16> Worklist;
270 BBInfo *BB
[all...]
/external/llvm/lib/CodeGen/
H A DIfConversion.cpp86 /// BBInfo - One per MachineBasicBlock, this is used to cache the result
109 struct BBInfo { struct in class:__anon25750::IfConverter
127 BBInfo() : IsDone(false), IsBeingAnalyzed(false), function in struct:__anon25750::IfConverter::BBInfo
136 /// BBI - Corresponding BBInfo.
147 BBInfo &BBI;
152 IfcvtToken(BBInfo &b, IfcvtKind k, bool s, unsigned d, unsigned d2 = 0)
158 std::vector<BBInfo> BBAnalysis;
187 bool ReverseBranchCondition(BBInfo &BBI);
188 bool ValidSimple(BBInfo &TrueBBI, unsigned &Dups,
190 bool ValidTriangle(BBInfo
[all...]
H A DMachineVerifier.cpp99 struct BBInfo { struct in struct:__anon25778::MachineVerifier
126 BBInfo() : reachable(false) {} function in struct:__anon25778::MachineVerifier::BBInfo
182 DenseMap<const MachineBasicBlock*, BBInfo> MBBInfoMap;
445 BBInfo &MInfo = MBBInfoMap[MBB];
474 BBInfo &MInfo = MBBInfoMap[&MBB];
1056 BBInfo &MInfo = MBBInfoMap[MI->getParent()];
1122 BBInfo &MInfo = MBBInfoMap[MI->getParent()];
1161 BBInfo &MInfo = MBBInfoMap[&MBB];
1166 BBInfo &SInfo = MBBInfoMap[*SuI];
1177 BBInfo
[all...]
/external/llvm/lib/Target/ARM/
H A DARMConstantIslandPass.cpp159 std::vector<BasicBlockInfo> BBInfo; member in class:__anon25967::ARMConstantIslands
336 assert(!MBBId || BBInfo[MBBId - 1].postOffset() <= BBInfo[MBBId].Offset);
360 for (unsigned J = 0, E = BBInfo.size(); J !=E; ++J) {
361 const BasicBlockInfo &BBI = BBInfo[J];
366 << format(" size=%#x\n", BBInfo[J].Size);
492 BBInfo.clear();
636 BBInfo.clear();
637 BBInfo.resize(MF->getNumBlockIDs());
648 BBInfo
[all...]
/external/llvm/lib/Target/Mips/
H A DMipsConstantIslandPass.cpp240 std::vector<BasicBlockInfo> BBInfo; member in class:__anon26048::MipsConstantIslands
435 for (unsigned J = 0, E = BBInfo.size(); J !=E; ++J) {
436 const BasicBlockInfo &BBI = BBInfo[J];
438 << format(" size=%#x\n", BBInfo[J].Size);
527 BBInfo.clear();
655 BBInfo.clear();
656 BBInfo.resize(MF->getNumBlockIDs());
815 /// This function updates BBInfo directly.
817 BasicBlockInfo &BBI = BBInfo[MBB->getNumber()];
835 unsigned Offset = BBInfo[MB
[all...]

Completed in 240 milliseconds