| /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/Support/ |
| 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/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/llvm/include/llvm/Analysis/ |
| BlockFrequencyImpl.h | 53 std::string getBlockName(BasicBlock *BB) const {
54 return BB->getName().str();
60 ss << "BB#" << MBB->getNumber();
62 if (const BasicBlock *BB = MBB->getBasicBlock())
63 ss << " derived from LLVM BB " << BB->getName();
68 void setBlockFreq(BlockT *BB, BlockFrequency Freq) {
69 Freqs[BB] = Freq;
70 DEBUG(dbgs() << "Frequency(" << getBlockName(BB) << ") = " << Freq << "\n");
80 /// incBlockFreq - Increase BB block frequency by FREQ
[all...] |
| BranchProbabilityInfo.h | 76 BasicBlock *getHotSucc(BasicBlock *BB) const;
138 uint32_t getSumForBlock(const BasicBlock *BB) const;
140 bool calcUnreachableHeuristics(BasicBlock *BB);
141 bool calcMetadataWeights(BasicBlock *BB);
142 bool calcColdCallHeuristics(BasicBlock *BB);
143 bool calcPointerHeuristics(BasicBlock *BB);
144 bool calcLoopBranchHeuristics(BasicBlock *BB);
145 bool calcZeroHeuristics(BasicBlock *BB);
146 bool calcFloatingPointHeuristics(BasicBlock *BB);
147 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) {
37 for (BasicBlock::iterator I = BB.begin(), E = BB.end(); I != E; ++I)
59 bool runOnBasicBlock(BasicBlock &BB) {
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/Transforms/Instrumentation/ |
| EdgeProfiling.cpp | 68 for (Function::iterator BB = F->begin(), E = F->end(); BB != E; ++BB) {
72 BlocksToInstrument.insert(BB);
73 NumEdges += BB->getTerminator()->getNumSuccessors();
89 for (Function::iterator BB = F->begin(), E = F->end(); BB != E; ++BB)
90 if (BlocksToInstrument.count(BB)) { // Don't instrument inserted blocks
94 TerminatorInst *TI = BB->getTerminator()
[all...] |
| /external/llvm/lib/CodeGen/ |
| MachineSSAUpdater.cpp | 62 bool MachineSSAUpdater::HasValueForBlock(MachineBasicBlock *BB) const {
63 return getAvailableVals(AV).count(BB);
68 void MachineSSAUpdater::AddAvailableValue(MachineBasicBlock *BB, unsigned V) {
69 getAvailableVals(AV)[BB] = V;
74 unsigned MachineSSAUpdater::GetValueAtEndOfBlock(MachineBasicBlock *BB) {
75 return GetValueAtEndOfBlockInternal(BB);
79 unsigned LookForIdenticalPHI(MachineBasicBlock *BB,
81 if (BB->empty())
84 MachineBasicBlock::iterator I = BB->begin();
91 while (I != BB->end() && I->isPHI())
[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);
109 unsigned GetValueAtEndOfBlockInternal(MachineBasicBlock *BB);
|
| MachineLoopInfo.h | 96 /// getLoopFor - Return the inner most loop that BB lives in. If a basic
99 inline MachineLoop *getLoopFor(const MachineBasicBlock *BB) const {
100 return LI.getLoopFor(BB);
105 inline const MachineLoop *operator[](const MachineBasicBlock *BB) const {
106 return LI.getLoopFor(BB);
111 inline unsigned getLoopDepth(const MachineBasicBlock *BB) const {
112 return LI.getLoopDepth(BB);
116 inline bool isLoopHeader(MachineBasicBlock *BB) const {
117 return LI.isLoopHeader(BB);
133 /// changeLoopFor - Change the top-level loop that contains BB to th
[all...] |
| /external/llvm/lib/Analysis/ |
| CFG.cpp | 30 const BasicBlock *BB = &F.getEntryBlock();
31 if (succ_begin(BB) == succ_end(BB))
38 Visited.insert(BB);
39 VisitStack.push_back(std::make_pair(BB, succ_begin(BB)));
40 InStack.insert(BB);
48 BB = *I++;
49 if (Visited.insert(BB)) {
54 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;
|
| ProfileEstimatorPass.cpp | 69 virtual void recurseBasicBlock(BasicBlock *BB);
119 void ProfileEstimatorPass::recurseBasicBlock(BasicBlock *BB) {
122 if (BBToVisit.find(BB) == BBToVisit.end()) return;
125 bool BBisHeader = LI->isLoopHeader(BB);
126 Loop* BBLoop = LI->getLoopFor(BB);
131 for ( pred_iterator bbi = pred_begin(BB), bbe = pred_end(BB);
134 Edge edge = getEdge(*bbi,BB);
153 if (getExecutionCount(BB) != MissingValue) {
154 BBWeight = getExecutionCount(BB);
[all...] |
| ProfileInfoLoaderPass.cpp | 63 virtual void recurseBasicBlock(const BasicBlock *BB);
110 void LoaderPass::recurseBasicBlock(const BasicBlock *BB) {
113 if (BBisUnvisited.find(BB) == BBisUnvisited.end()) return;
114 BBisUnvisited.erase(BB);
115 if (!BB) return;
117 for (succ_const_iterator bbi = succ_begin(BB), bbe = succ_end(BB);
121 for (const_pred_iterator bbi = pred_begin(BB), bbe = pred_end(BB);
127 if (CalculateMissingEdge(BB, tocalc))
[all...] |
| /external/llvm/lib/Transforms/IPO/ |
| PruneEH.cpp | 47 void DeleteBasicBlock(BasicBlock *BB);
103 for (Function::iterator BB = F->begin(), E = F->end(); BB != E; ++BB) {
104 if (CheckUnwind && isa<ResumeInst>(BB->getTerminator())) {
107 } else if (CheckReturn && isa<ReturnInst>(BB->getTerminator())) {
114 for (BasicBlock::iterator I = BB->begin(), E = BB->end(); I != E; ++I)
175 for (Function::iterator BB = F->begin(), E = F->end(); BB != E; ++BB)
[all...] |
| /external/llvm/lib/Target/Mips/ |
| Mips16ISelLowering.h | 50 MachineBasicBlock *BB) const;
54 MachineBasicBlock *BB) const;
58 MachineBasicBlock *BB) const;
62 MachineBasicBlock *BB) const;
66 MachineInstr *MI, MachineBasicBlock *BB) const;
70 MachineInstr *MI, MachineBasicBlock *BB) const;
74 MachineInstr *MI, MachineBasicBlock *BB )const;
|
| Mips16ISelLowering.cpp | 162 MachineBasicBlock *BB) const {
165 return MipsTargetLowering::EmitInstrWithCustomInserter(MI, BB);
167 return emitSel16(Mips::BeqzRxImm16, MI, BB);
169 return emitSel16(Mips::BnezRxImm16, MI, BB);
171 return emitSeliT16(Mips::BteqzX16, Mips::CmpiRxImmX16, MI, BB);
173 return emitSeliT16(Mips::BteqzX16, Mips::SltiRxImmX16, MI, BB);
175 return emitSeliT16(Mips::BteqzX16, Mips::SltiuRxImmX16, MI, BB);
177 return emitSeliT16(Mips::BtnezX16, Mips::CmpiRxImmX16, MI, BB);
179 return emitSeliT16(Mips::BtnezX16, Mips::SltiRxImmX16, MI, BB);
181 return emitSeliT16(Mips::BtnezX16, Mips::SltiuRxImmX16, MI, BB);
[all...] |
| /external/llvm/lib/Transforms/Scalar/ |
| BasicBlockPlacement.cpp | 74 void PlaceBlocks(BasicBlock *BB);
104 void BlockPlacement::PlaceBlocks(BasicBlock *BB) {
105 assert(!PlacedBlocks.count(BB) && "Already placed this block!");
106 PlacedBlocks.insert(BB);
109 if (&*InsertPos != BB) {
113 Function::BasicBlockListType &Blocks = BB->getParent()->getBasicBlockList();
114 Blocks.splice(InsertPos, Blocks, BB);
127 succ_iterator SI = succ_begin(BB), E = succ_end(BB);
|
| SimplifyCFGPass.cpp | 72 BasicBlock *BB = I->getParent();
73 // Loop over all of the successors, removing BB's entry from any PHI
75 for (succ_iterator SI = succ_begin(BB), SE = succ_end(BB); SI != SE; ++SI)
76 (*SI)->removePredecessor(BB);
82 Intrinsic::getDeclaration(BB->getParent()->getParent(), Intrinsic::trap);
89 BasicBlock::iterator BBI = I, BBE = BB->end();
93 BB->getInstList().erase(BBI++);
115 static bool markAliveBlocks(BasicBlock *BB,
119 Worklist.push_back(BB);
[all...] |
| /external/clang/test/Sema/ |
| decl-in-prototype.c | 5 int f1(enum {AA,BB} E) {
6 return BB;
9 int f2(enum {AA=7,BB} E) {
|
| /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;
|
