Searched refs:BB (Results 1 - 25 of 523) sorted by relevance

1234567891011>>

/external/clang/test/CodeGen/
H A Ddecl-in-prototype.c6 int f1(enum {AA,BB} E) {
8 return BB;
12 int f2(enum {AA=7,BB} E) {
18 int f(void (*g)(), enum {AA,BB} h) {
/external/llvm/include/llvm/IR/
H A DPredIteratorCache.h39 /// for (BasicBlock **PI = PredCache->GetPreds(BB); *PI; ++PI)
42 /// for (pred_iterator PI = pred_begin(BB), E = pred_end(BB); PI != E; ++PI)
43 BasicBlock **GetPreds(BasicBlock *BB) { argument
44 BasicBlock **&Entry = BlockToPredsMap[BB];
48 SmallVector<BasicBlock *, 32> PredCache(pred_begin(BB), pred_end(BB));
51 BlockToPredCountMap[BB] = PredCache.size() - 1;
58 unsigned GetNumPreds(BasicBlock *BB) { argument
59 GetPreds(BB);
64 size(BasicBlock *BB) argument
65 get(BasicBlock *BB) argument
[all...]
H A DCFG.h91 inline pred_iterator pred_begin(BasicBlock *BB) { return pred_iterator(BB); } argument
92 inline const_pred_iterator pred_begin(const BasicBlock *BB) { argument
93 return const_pred_iterator(BB);
95 inline pred_iterator pred_end(BasicBlock *BB) { return pred_iterator(BB, true);} argument
96 inline const_pred_iterator pred_end(const BasicBlock *BB) { argument
97 return const_pred_iterator(BB, true);
99 inline bool pred_empty(const BasicBlock *BB) { argument
100 return pred_begin(BB)
102 predecessors(BasicBlock *BB) argument
105 predecessors(const BasicBlock *BB) argument
120 succ_begin(BasicBlock *BB) argument
123 succ_begin(const BasicBlock *BB) argument
126 succ_end(BasicBlock *BB) argument
129 succ_end(const BasicBlock *BB) argument
132 succ_empty(const BasicBlock *BB) argument
135 successors(BasicBlock *BB) argument
138 successors(const BasicBlock *BB) argument
160 getEntryNode(BasicBlock *BB) argument
173 getEntryNode(const BasicBlock *BB) argument
[all...]
H A DInstIterator.h36 BB_i_t BB; // BasicBlocksType::iterator member in class:llvm::InstIterator
51 : BBs(II.BBs), BB(II.BB), BI(II.BI) {}
55 : BBs(II.BBs), BB(II.BB), BI(II.BI) {}
58 : BBs(&m.getBasicBlockList()), BB(BBs->begin()) { // begin ctor
59 if (BB != BBs->end()) {
60 BI = BB->begin();
66 : BBs(&m.getBasicBlockList()), BB(BBs->end()) { // end ctor
70 inline BBIty &getBasicBlockIterator() { return BB; }
[all...]
/external/clang/test/CodeGenCXX/
H A Dvirtual-base-cast.cpp8 struct BB { int b; virtual int bb(); }; struct
9 struct CC : AA, BB { virtual int aa(); virtual int bb(); virtual int cc(); };
48 BB* c() { return x; }
72 BB* d() { return y; }
/external/llvm/lib/CodeGen/
H A DMachineSSAUpdater.cpp64 bool MachineSSAUpdater::HasValueForBlock(MachineBasicBlock *BB) const {
65 return getAvailableVals(AV).count(BB);
70 void MachineSSAUpdater::AddAvailableValue(MachineBasicBlock *BB, unsigned V) { argument
71 getAvailableVals(AV)[BB] = V;
76 unsigned MachineSSAUpdater::GetValueAtEndOfBlock(MachineBasicBlock *BB) { argument
77 return GetValueAtEndOfBlockInternal(BB);
81 unsigned LookForIdenticalPHI(MachineBasicBlock *BB, argument
83 if (BB->empty())
86 MachineBasicBlock::iterator I = BB->begin();
93 while (I != BB
114 InsertNewDef(unsigned Opcode, MachineBasicBlock *BB, MachineBasicBlock::iterator I, const TargetRegisterClass *RC, MachineRegisterInfo *MRI, const TargetInstrInfo *TII) argument
142 GetValueInMiddleOfBlock(MachineBasicBlock *BB) argument
246 BlkSucc_begin(BlkT *BB) argument
247 BlkSucc_end(BlkT *BB) argument
276 FindPredecessorBlocks(MachineBasicBlock *BB, SmallVectorImpl<MachineBasicBlock*> *Preds) argument
285 GetUndefVal(MachineBasicBlock *BB, MachineSSAUpdater *Updater) argument
297 CreateEmptyPHI(MachineBasicBlock *BB, unsigned NumPreds, MachineSSAUpdater *Updater) argument
349 GetValueAtEndOfBlockInternal(MachineBasicBlock *BB) argument
[all...]
H A DUnreachableBlockElim.cpp67 for (BasicBlock *BB : depth_first_ext(&F, Reachable))
68 (void)BB/* Mark all reachable blocks */;
75 BasicBlock *BB = &*I; local
76 DeadBlocks.push_back(BB);
77 while (PHINode *PN = dyn_cast<PHINode>(BB->begin())) {
79 BB->getInstList().pop_front();
81 for (succ_iterator SI = succ_begin(BB), E = succ_end(BB); SI != E; ++SI)
82 (*SI)->removePredecessor(BB);
83 BB
134 MachineBasicBlock *BB = &*I; local
170 MachineBasicBlock *BB = &*I; local
[all...]
H A DIfConversion.cpp76 ICNotClassfied, // BB data valid, but not classified.
78 ICSimple, // BB is entry of an one split, no rejoin sub-CFG.
82 ICTriangle, // BB is entry of a triangle sub-CFG.
83 ICDiamond // BB is entry of a diamond sub-CFG.
93 /// IsDone - True if BB is not to be considered for ifcvt.
94 /// IsBeingAnalyzed - True if BB is currently being analyzed.
95 /// IsAnalyzed - True if BB has been analyzed (info is still valid).
96 /// IsEnqueued - True if BB has been enqueued to be ifcvt'ed.
98 /// HasFallThrough - True if BB may fallthrough to the following BB
122 MachineBasicBlock *BB; member in struct:__anon11779::IfConverter::BBInfo
220 MeetIfcvtSizeLimit(MachineBasicBlock &BB, unsigned Cycle, unsigned Extra, BranchProbability Prediction) const argument
439 findFalseBlock(MachineBasicBlock *BB, MachineBasicBlock *TrueBB) argument
465 getNextBlock(MachineBasicBlock *BB) argument
770 BBState(MachineBasicBlock *BB) argument
782 MachineBasicBlock *BB = State.MBB; local
962 canFallThroughTo(MachineBasicBlock *BB, MachineBasicBlock *ToBB) argument
980 InvalidatePreds(MachineBasicBlock *BB) argument
992 InsertUncondBranch(MachineBasicBlock *BB, MachineBasicBlock *ToBB, const TargetInstrInfo *TII) argument
[all...]
/external/llvm/lib/Analysis/
H A DCFG.cpp29 const BasicBlock *BB = &F.getEntryBlock(); local
30 if (succ_empty(BB))
37 Visited.insert(BB);
38 VisitStack.push_back(std::make_pair(BB, succ_begin(BB)));
39 InStack.insert(BB);
47 BB = *I++;
48 if (Visited.insert(BB).second) {
53 if (InStack.count(BB))
54 Result.push_back(std::make_pair(ParentBB, BB));
72 GetSuccessorNumber(const BasicBlock *BB, const BasicBlock *Succ) argument
113 getOutermostLoop(const LoopInfo *LI, const BasicBlock *BB) argument
143 BasicBlock *BB = Worklist.pop_back_val(); local
199 BasicBlock *BB = const_cast<BasicBlock *>(A->getParent()); local
[all...]
H A DBranchProbabilityInfo.cpp122 bool BranchProbabilityInfo::calcUnreachableHeuristics(BasicBlock *BB) { argument
123 TerminatorInst *TI = BB->getTerminator();
126 PostDominatedByUnreachable.insert(BB);
133 for (succ_iterator I = succ_begin(BB), E = succ_end(BB); I != E; ++I) {
143 PostDominatedByUnreachable.insert(BB);
154 PostDominatedByUnreachable.insert(BB);
165 setEdgeWeight(BB, *I, UnreachableWeight);
175 setEdgeWeight(BB, *I, ReachableWeight);
182 bool BranchProbabilityInfo::calcMetadataWeights(BasicBlock *BB) { argument
244 calcColdCallHeuristics(BasicBlock *BB) argument
299 calcPointerHeuristics(BasicBlock *BB) argument
332 calcLoopBranchHeuristics(BasicBlock *BB, const LoopInfo &LI) argument
390 calcZeroHeuristics(BasicBlock *BB) argument
472 calcFloatingPointHeuristics(BasicBlock *BB) argument
508 calcInvokeHeuristics(BasicBlock *BB) argument
[all...]
/external/llvm/include/llvm/Analysis/
H A DLoopIterator.h84 bool hasPreorder(BasicBlock *BB) const { return PostNumbers.count(BB); }
87 bool hasPostorder(BasicBlock *BB) const {
88 DenseMap<BasicBlock*, unsigned>::const_iterator I = PostNumbers.find(BB);
93 unsigned getPostorder(BasicBlock *BB) const {
94 DenseMap<BasicBlock*, unsigned>::const_iterator I = PostNumbers.find(BB);
101 unsigned getRPO(BasicBlock *BB) const {
102 return 1 + PostBlocks.size() - getPostorder(BB);
118 void finishPostorder(BasicBlock *BB);
153 bool visitPreorder(BasicBlock *BB) { argument
162 finishPostorder(BasicBlock *BB) argument
175 finishPostorder(BasicBlock *BB) argument
[all...]
/external/llvm/lib/Target/Mips/
H A DMips16ISelLowering.h54 MachineBasicBlock *BB) const;
58 MachineBasicBlock *BB) const;
62 MachineBasicBlock *BB) const;
66 MachineBasicBlock *BB) const;
70 MachineInstr *MI, MachineBasicBlock *BB) const;
74 MachineInstr *MI, MachineBasicBlock *BB) const;
78 MachineInstr *MI, MachineBasicBlock *BB )const;
H A DMips16ISelLowering.cpp171 MachineBasicBlock *BB) const {
174 return MipsTargetLowering::EmitInstrWithCustomInserter(MI, BB);
176 return emitSel16(Mips::BeqzRxImm16, MI, BB);
178 return emitSel16(Mips::BnezRxImm16, MI, BB);
180 return emitSeliT16(Mips::Bteqz16, Mips::CmpiRxImmX16, MI, BB);
182 return emitSeliT16(Mips::Bteqz16, Mips::SltiRxImmX16, MI, BB);
184 return emitSeliT16(Mips::Bteqz16, Mips::SltiuRxImmX16, MI, BB);
186 return emitSeliT16(Mips::Btnez16, Mips::CmpiRxImmX16, MI, BB);
188 return emitSeliT16(Mips::Btnez16, Mips::SltiRxImmX16, MI, BB);
190 return emitSeliT16(Mips::Btnez16, Mips::SltiuRxImmX16, MI, BB);
[all...]
H A DMipsSEISelLowering.h81 MachineBasicBlock *BB) const;
83 MachineBasicBlock *BB,
87 MachineBasicBlock *BB) const;
90 MachineBasicBlock *BB) const;
93 MachineBasicBlock *BB) const;
96 MachineBasicBlock *BB) const;
99 MachineBasicBlock *BB,
104 MachineBasicBlock *BB) const;
107 MachineBasicBlock *BB) const;
110 MachineBasicBlock *BB) cons
[all...]
/external/llvm/lib/Transforms/Utils/
H A DInstructionNamer.cpp40 for (Function::iterator BB = F.begin(), E = F.end(); BB != E; ++BB) {
41 if (!BB->hasName())
42 BB->setName("bb");
44 for (BasicBlock::iterator I = BB->begin(), E = BB->end(); I != E; ++I)
H A DUnifyFunctionExitNodes.cpp71 BasicBlock *BB = *I; local
72 BB->getInstList().pop_back(); // Remove the unreachable inst.
73 BranchInst::Create(UnreachableBlock, BB);
109 BasicBlock *BB = *I; local
114 PN->addIncoming(BB->getTerminator()->getOperand(0), BB);
116 BB->getInstList().pop_back(); // Remove the return insn
117 BranchInst::Create(NewRetBlock, BB);
H A DLowerInvoke.cpp56 for (Function::iterator BB = F.begin(), E = F.end(); BB != E; ++BB)
57 if (InvokeInst *II = dyn_cast<InvokeInst>(BB->getTerminator())) {
72 II->getUnwindDest()->removePredecessor(&*BB);
75 BB->getInstList().erase(II);
/external/clang/test/Sema/
H A Ddecl-in-prototype.c5 int f1(enum {AA,BB} E) { // expected-warning {{will not be visible outside of this function}}
6 return BB;
9 int f2(enum {AA=7,BB} E) { // expected-warning {{will not be visible outside of this function}}
/external/clang/test/SemaTemplate/
H A Dinstantiate-member-initializers.cpp23 template <class T> class BB : public AA<T> { class in inherits:AA
25 BB() : AA<T>(1) {} function in class:BB
27 BB<int> x;
/external/llvm/include/llvm/CodeGen/
H A DMachineLoopInfo.h92 /// getLoopFor - Return the inner most loop that BB lives in. If a basic
95 inline MachineLoop *getLoopFor(const MachineBasicBlock *BB) const {
96 return LI.getLoopFor(BB);
101 inline const MachineLoop *operator[](const MachineBasicBlock *BB) const {
102 return LI.getLoopFor(BB);
107 inline unsigned getLoopDepth(const MachineBasicBlock *BB) const {
108 return LI.getLoopDepth(BB);
112 inline bool isLoopHeader(const MachineBasicBlock *BB) const {
113 return LI.isLoopHeader(BB);
129 /// changeLoopFor - Change the top-level loop that contains BB t
132 changeLoopFor(MachineBasicBlock *BB, MachineLoop *L) argument
151 removeBlock(MachineBasicBlock *BB) argument
[all...]
/external/llvm/lib/Transforms/Scalar/
H A DJumpThreading.cpp146 bool ProcessBlock(BasicBlock *BB);
147 bool ThreadEdge(BasicBlock *BB, const SmallVectorImpl<BasicBlock*> &PredBBs,
149 bool DuplicateCondBranchOnPHIIntoPred(BasicBlock *BB,
152 bool ComputeValueKnownInPredecessors(Value *V, BasicBlock *BB,
156 bool ProcessThreadableEdges(Value *Cond, BasicBlock *BB,
162 bool ProcessImpliedCondition(BasicBlock *BB);
165 bool TryToUnfoldSelect(CmpInst *CondCmp, BasicBlock *BB);
168 BasicBlock *SplitBlockPreds(BasicBlock *BB, ArrayRef<BasicBlock *> Preds,
170 void UpdateBlockFreqAndEdgeWeight(BasicBlock *PredBB, BasicBlock *BB,
221 BasicBlock *BB local
281 getJumpThreadDuplicationCost(const BasicBlock *BB, unsigned Threshold) argument
391 ComputeValueKnownInPredecessors(Value *V, BasicBlock *BB, PredValueInfo &Result, ConstantPreference Preference, Instruction *CxtI) argument
677 GetBestDestForJumpOnUndef(BasicBlock *BB) argument
695 hasAddressTakenAndUsed(BasicBlock *BB) argument
707 ProcessBlock(BasicBlock *BB) argument
888 ProcessImpliedCondition(BasicBlock *BB) argument
1116 FindMostPopularDest(BasicBlock *BB, const SmallVectorImpl<std::pair<BasicBlock*, BasicBlock*> > &PredToDestList) argument
1175 ProcessThreadableEdges(Value *Cond, BasicBlock *BB, ConstantPreference Preference, Instruction *CxtI) argument
1285 BasicBlock *BB = PN->getParent(); local
1315 BasicBlock *BB = BO->getParent(); local
1443 ThreadEdge(BasicBlock *BB, const SmallVectorImpl<BasicBlock*> &PredBBs, BasicBlock *SuccBB) argument
1483 << *BB << "\\n"); local
1599 SplitBlockPreds(BasicBlock *BB, ArrayRef<BasicBlock *> Preds, const char *Suffix) argument
1621 UpdateBlockFreqAndEdgeWeight(BasicBlock *PredBB, BasicBlock *BB, BasicBlock *NewBB, BasicBlock *SuccBB) argument
1672 DuplicateCondBranchOnPHIIntoPred(BasicBlock *BB, const SmallVectorImpl<BasicBlock *> &PredBBs) argument
1707 << DuplicationCost << " block is:" << *BB << "\\n"); local
1822 TryToUnfoldSelect(CmpInst *CondCmp, BasicBlock *BB) argument
[all...]
/external/mesa3d/src/gallium/drivers/radeon/
H A DAMDGPUConvertToISA.cpp52 for (MachineFunction::iterator BB = MF.begin(), BB_E = MF.end();
53 BB != BB_E; ++BB) {
54 MachineBasicBlock &MBB = *BB;
/external/llvm/unittests/Transforms/Utils/
H A DLocal.cpp70 BasicBlock *BB(BasicBlock::Create(C, "", F.get()));
71 BranchInst::Create(BB, Entry);
73 B.SetInsertPoint(BB);
83 P3->addIncoming(B.getInt32(23), BB);
87 P4->addIncoming(B.getInt32(23), BB);
89 P1->addIncoming(P3, BB);
90 P2->addIncoming(P4, BB);
91 BranchInst::Create(BB, BB);
95 EXPECT_TRUE(EliminateDuplicatePHINodes(BB));
[all...]
/external/llvm/lib/Transforms/IPO/
H A DPruneEH.cpp51 void DeleteBasicBlock(BasicBlock *BB);
112 for (const BasicBlock &BB : *F) {
113 const TerminatorInst *TI = BB.getTerminator();
120 for (const Instruction &I : BB) {
186 for (Function::iterator BB = F->begin(), E = F->end(); BB != E; ++BB) {
187 if (InvokeInst *II = dyn_cast<InvokeInst>(BB->getTerminator()))
214 BB->getInstList().pop_back();
218 DeleteBasicBlock(UnwindBlock); // Delete the new BB
250 DeleteBasicBlock(BasicBlock *BB) argument
[all...]
/external/llvm/tools/bugpoint-passes/
H A DTestPasses.cpp36 bool runOnBasicBlock(BasicBlock &BB) override {
37 for (BasicBlock::iterator I = BB.begin(), E = BB.end(); I != E; ++I)
59 bool runOnBasicBlock(BasicBlock &BB) override {
60 for (BasicBlock::iterator I = BB.begin(), E = BB.end(); I != E; ++I)

Completed in 998 milliseconds

1234567891011>>