| /external/clang/test/CodeGen/ |
| decl-in-prototype.c | 6 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/ |
| PredIteratorCache.h | 38 /// for (BasicBlock **PI = PredCache->GetPreds(BB); *PI; ++PI)
41 /// for (pred_iterator PI = pred_begin(BB), E = pred_end(BB); PI != E; ++PI)
42 BasicBlock **GetPreds(BasicBlock *BB) {
43 BasicBlock **&Entry = BlockToPredsMap[BB];
46 SmallVector<BasicBlock*, 32> PredCache(pred_begin(BB), pred_end(BB));
49 BlockToPredCountMap[BB] = PredCache.size()-1;
56 unsigned GetNumPreds(BasicBlock *BB) {
57 GetPreds(BB);
[all...] |
| InstIterator.h | 37 _BB_i_t BB; // BasicBlocksType::iterator
52 : BBs(II.BBs), BB(II.BB), BI(II.BI) {}
56 : BBs(II.BBs), BB(II.BB), BI(II.BI) {}
59 : BBs(&m.getBasicBlockList()), BB(BBs->begin()) { // begin ctor
60 if (BB != BBs->end()) {
61 BI = BB->begin();
67 : BBs(&m.getBasicBlockList()), BB(BBs->end()) { // end ctor
71 inline BBIty &getBasicBlockIterator() { return BB; }
[all...] |
| /external/llvm/include/llvm/Analysis/ |
| BranchProbabilityInfo.h | 77 BasicBlock *getHotSucc(BasicBlock *BB) const;
142 uint32_t getSumForBlock(const BasicBlock *BB) const;
144 bool calcUnreachableHeuristics(BasicBlock *BB);
145 bool calcMetadataWeights(BasicBlock *BB);
146 bool calcColdCallHeuristics(BasicBlock *BB);
147 bool calcPointerHeuristics(BasicBlock *BB);
148 bool calcLoopBranchHeuristics(BasicBlock *BB);
149 bool calcZeroHeuristics(BasicBlock *BB);
150 bool calcFloatingPointHeuristics(BasicBlock *BB);
151 bool calcInvokeHeuristics(BasicBlock *BB);
[all...] |
| LoopIterator.h | 84 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) {
[all...] |
| /external/llvm/tools/bugpoint-passes/ |
| TestPasses.cpp | 36 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)
|
| /external/clang/test/CodeGenCXX/ |
| virtual-base-cast.cpp | 5 struct B { int b; virtual int bb(); };
6 struct C : virtual A, virtual B { int c; virtual int aa(); virtual int bb(); };
8 struct BB { int b; virtual int bb(); };
9 struct CC : AA, BB { virtual int aa(); virtual int bb(); virtual int cc(); };
50 BB* c() { return x; }
75 BB* d() { return y; }
|
| /external/llvm/lib/Analysis/ |
| CFG.cpp | 29 const BasicBlock *BB = &F.getEntryBlock();
30 if (succ_begin(BB) == succ_end(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)) {
53 if (InStack.count(BB))
[all...] |
| CodeMetrics.cpp | 25 void CodeMetrics::analyzeBasicBlock(const BasicBlock *BB,
29 for (BasicBlock::const_iterator II = BB->begin(), E = BB->end();
46 if (F == BB->getParent())
78 if (isa<ReturnInst>(BB->getTerminator()))
92 notDuplicatable |= isa<IndirectBrInst>(BB->getTerminator());
94 // Remember NumInsts for this BB.
95 NumBBInsts[BB] = NumInsts - NumInstsBeforeThisBB;
|
| /external/llvm/lib/CodeGen/ |
| MachineSSAUpdater.cpp | 64 bool MachineSSAUpdater::HasValueForBlock(MachineBasicBlock *BB) const {
65 return getAvailableVals(AV).count(BB);
70 void MachineSSAUpdater::AddAvailableValue(MachineBasicBlock *BB, unsigned V) {
71 getAvailableVals(AV)[BB] = V;
76 unsigned MachineSSAUpdater::GetValueAtEndOfBlock(MachineBasicBlock *BB) {
77 return GetValueAtEndOfBlockInternal(BB);
81 unsigned LookForIdenticalPHI(MachineBasicBlock *BB,
83 if (BB->empty())
86 MachineBasicBlock::iterator I = BB->begin();
93 while (I != BB->end() && I->isPHI())
[all...] |
| IfConversion.cpp | 76 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
[all...] |
| UnreachableBlockElim.cpp | 76 BasicBlock *BB = I;
77 DeadBlocks.push_back(BB);
78 while (PHINode *PN = dyn_cast<PHINode>(BB->begin())) {
80 BB->getInstList().pop_front();
82 for (succ_iterator SI = succ_begin(BB), E = succ_end(BB); SI != E; ++SI)
83 (*SI)->removePredecessor(BB);
84 BB->dropAllReferences();
137 MachineBasicBlock *BB = I;
140 if (!Reachable.count(BB)) {
[all...] |
| /external/llvm/include/llvm/CodeGen/ |
| MachineSSAUpdater.h | 69 void AddAvailableValue(MachineBasicBlock *BB, unsigned V);
73 bool HasValueForBlock(MachineBasicBlock *BB) const;
77 unsigned GetValueAtEndOfBlock(MachineBasicBlock *BB);
84 /// 'use' in BB. Consider code like this:
98 unsigned GetValueInMiddleOfBlock(MachineBasicBlock *BB);
108 unsigned GetValueAtEndOfBlockInternal(MachineBasicBlock *BB);
|
| MachineLoopInfo.h | 97 /// getLoopFor - Return the inner most loop that BB lives in. If a basic
100 inline MachineLoop *getLoopFor(const MachineBasicBlock *BB) const {
101 return LI.getLoopFor(BB);
106 inline const MachineLoop *operator[](const MachineBasicBlock *BB) const {
107 return LI.getLoopFor(BB);
112 inline unsigned getLoopDepth(const MachineBasicBlock *BB) const {
113 return LI.getLoopDepth(BB);
117 inline bool isLoopHeader(MachineBasicBlock *BB) const {
118 return LI.isLoopHeader(BB);
134 /// changeLoopFor - Change the top-level loop that contains BB to th
[all...] |
| /external/llvm/lib/Transforms/IPO/ |
| PruneEH.cpp | 48 void DeleteBasicBlock(BasicBlock *BB);
104 for (Function::iterator BB = F->begin(), E = F->end(); BB != E; ++BB) {
105 if (CheckUnwind && isa<ResumeInst>(BB->getTerminator())) {
108 } else if (CheckReturn && isa<ReturnInst>(BB->getTerminator())) {
115 for (BasicBlock::iterator I = BB->begin(), E = BB->end(); I != E; ++I)
176 for (Function::iterator BB = F->begin(), E = F->end(); BB != E; ++BB)
[all...] |
| /external/llvm/lib/Target/Mips/ |
| Mips16ISelLowering.h | 52 MachineBasicBlock *BB) const;
56 MachineBasicBlock *BB) const;
60 MachineBasicBlock *BB) const;
64 MachineBasicBlock *BB) const;
68 MachineInstr *MI, MachineBasicBlock *BB) const;
72 MachineInstr *MI, MachineBasicBlock *BB) const;
76 MachineInstr *MI, MachineBasicBlock *BB )const;
|
| Mips16ISelLowering.cpp | 166 MachineBasicBlock *BB) const {
169 return MipsTargetLowering::EmitInstrWithCustomInserter(MI, BB);
171 return emitSel16(Mips::BeqzRxImm16, MI, BB);
173 return emitSel16(Mips::BnezRxImm16, MI, BB);
175 return emitSeliT16(Mips::Bteqz16, Mips::CmpiRxImmX16, MI, BB);
177 return emitSeliT16(Mips::Bteqz16, Mips::SltiRxImmX16, MI, BB);
179 return emitSeliT16(Mips::Bteqz16, Mips::SltiuRxImmX16, MI, BB);
181 return emitSeliT16(Mips::Btnez16, Mips::CmpiRxImmX16, MI, BB);
183 return emitSeliT16(Mips::Btnez16, Mips::SltiRxImmX16, MI, BB);
185 return emitSeliT16(Mips::Btnez16, Mips::SltiuRxImmX16, MI, BB);
[all...] |
| MipsSEISelLowering.h | 79 MachineBasicBlock *BB) const;
81 MachineBasicBlock *BB,
85 MachineBasicBlock *BB) const;
88 MachineBasicBlock *BB) const;
91 MachineBasicBlock *BB) const;
94 MachineBasicBlock *BB) const;
97 MachineBasicBlock *BB,
102 MachineBasicBlock *BB) const;
105 MachineBasicBlock *BB) const;
108 MachineBasicBlock *BB) const
[all...] |
| /external/llvm/lib/Transforms/Utils/ |
| InstructionNamer.cpp | 40 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)
|
| /external/clang/test/Sema/ |
| decl-in-prototype.c | 5 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/ |
| instantiate-member-initializers.cpp | 23 template <class T> class BB : public AA<T> {
25 BB() : AA<T>(1) {}
27 BB<int> x;
|
| /external/chromium_org/third_party/mesa/src/src/gallium/drivers/radeon/ |
| AMDGPUConvertToISA.cpp | 52 for (MachineFunction::iterator BB = MF.begin(), BB_E = MF.end();
53 BB != BB_E; ++BB) {
54 MachineBasicBlock &MBB = *BB;
|
| SIISelLowering.h | 30 void AppendS_WAITCNT(MachineInstr *MI, MachineBasicBlock &BB,
32 void LowerSI_INTERP(MachineInstr *MI, MachineBasicBlock &BB,
34 void LowerSI_INTERP_CONST(MachineInstr *MI, MachineBasicBlock &BB,
36 void LowerSI_KIL(MachineInstr *MI, MachineBasicBlock &BB,
38 void LowerSI_V_CNDLT(MachineInstr *MI, MachineBasicBlock &BB,
50 MachineBasicBlock * BB) const;
|
| /external/mesa3d/src/gallium/drivers/radeon/ |
| AMDGPUConvertToISA.cpp | 52 for (MachineFunction::iterator BB = MF.begin(), BB_E = MF.end();
53 BB != BB_E; ++BB) {
54 MachineBasicBlock &MBB = *BB;
|
| /external/llvm/lib/Transforms/Scalar/ |
| JumpThreading.cpp | 118 bool ProcessBlock(BasicBlock *BB);
119 bool ThreadEdge(BasicBlock *BB, const SmallVectorImpl<BasicBlock*> &PredBBs,
121 bool DuplicateCondBranchOnPHIIntoPred(BasicBlock *BB,
124 bool ComputeValueKnownInPredecessors(Value *V, BasicBlock *BB,
127 bool ProcessThreadableEdges(Value *Cond, BasicBlock *BB,
134 bool TryToUnfoldSelect(CmpInst *CondCmp, BasicBlock *BB);
176 BasicBlock *BB = I;
178 while (ProcessBlock(BB))
185 if (pred_begin(BB) == pred_end(BB) &
[all...] |
