/external/clang/test/CodeGen/ |
H A D | 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/ |
H A D | PredIteratorCache.h | 39 /// 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 D | CFG.h | 91 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 D | InstIterator.h | 36 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/swiftshader/third_party/LLVM/include/llvm/Support/ |
H A D | 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) { argument 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) { argument 57 GetPreds(BB); [all...] |
H A D | InstIterator.h | 37 _BB_i_t BB; // BasicBlocksType::iterator member in class:llvm::InstIterator 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/Transforms/Utils/ |
H A D | BypassSlowDivision.h | 26 /// This optimization identifies DIV instructions in a BB that can be 29 /// This optimization may add basic blocks immediately after BB; for obvious 32 BasicBlock *BB, const DenseMap<unsigned int, unsigned int> &BypassWidth);
|
/external/swiftshader/third_party/LLVM/include/llvm/Analysis/ |
H A D | BlockFrequencyImpl.h | 54 std::string getBlockName(BasicBlock *BB) const { 55 return BB->getNameStr(); 60 ss << "BB#" << MBB->getNumber(); 62 if (const BasicBlock *BB = MBB->getBasicBlock()) 63 ss << " derived from LLVM BB " << BB->getNameStr(); 68 void setBlockFreq(BlockT *BB, BlockFrequency Freq) { argument 69 Freqs[BB] = Freq; 70 DEBUG(dbgs() << "Frequency(" << getBlockName(BB) << ") = " << Freq << "\n"); 80 /// incBlockFreq - Increase BB bloc 82 incBlockFreq(BlockT *BB, BlockFrequency Freq) argument 90 divBlockFreq(BlockT *BB, BranchProbability Prob) argument 124 rpot_at(BlockT *BB) argument 137 isReachable(BlockT *BB) argument 155 getSingleBlockPred(BlockT *BB) argument 172 doBlock(BlockT *BB, BlockT *LoopHead, SmallPtrSet<BlockT *, 8> &BlocksInLoop) argument 228 BlockT *BB = *I; local 278 BlockT *BB = *I; local 285 BlockT *BB = *I; local 321 BlockT *BB = I++; local [all...] |
H A D | LoopIterator.h | 85 bool hasPreorder(BasicBlock *BB) const { return PostNumbers.count(BB); } 88 bool hasPostorder(BasicBlock *BB) const { 89 DenseMap<BasicBlock*, unsigned>::const_iterator I = PostNumbers.find(BB); 94 unsigned getPostorder(BasicBlock *BB) const { 95 DenseMap<BasicBlock*, unsigned>::const_iterator I = PostNumbers.find(BB); 102 unsigned getRPO(BasicBlock *BB) const { 103 return 1 + PostBlocks.size() - getPostorder(BB); 144 bool visitPreorder(BasicBlock *BB) { argument 145 if (!DFS.L->contains(LI->getLoopFor(BB))) 153 finishPostorder(BasicBlock *BB) argument 172 insert(BasicBlock *BB) argument 179 finishPostorder(BasicBlock *BB, LoopBlocksTraversal& LBT) argument [all...] |
/external/swiftshader/third_party/LLVM/lib/Transforms/Utils/ |
H A D | 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/swiftshader/third_party/LLVM/lib/Transforms/Scalar/ |
H A D | SimplifyCFGPass.cpp | 65 BasicBlock *BB = I->getParent(); local 66 // Loop over all of the successors, removing BB's entry from any PHI 68 for (succ_iterator SI = succ_begin(BB), SE = succ_end(BB); SI != SE; ++SI) 69 (*SI)->removePredecessor(BB); 75 Intrinsic::getDeclaration(BB->getParent()->getParent(), Intrinsic::trap); 82 BasicBlock::iterator BBI = I, BBE = BB->end(); 86 BB->getInstList().erase(BBI++); 92 BasicBlock *BB = II->getParent(); local 105 II->getUnwindDest()->removePredecessor(BB); 109 MarkAliveBlocks(BasicBlock *BB, SmallPtrSet<BasicBlock*, 128> &Reachable) argument 217 BasicBlock &BB = *BBI++; local [all...] |
H A D | JumpThreading.cpp | 113 bool ProcessBlock(BasicBlock *BB); 114 bool ThreadEdge(BasicBlock *BB, const SmallVectorImpl<BasicBlock*> &PredBBs, 116 bool DuplicateCondBranchOnPHIIntoPred(BasicBlock *BB, 119 bool ComputeValueKnownInPredecessors(Value *V, BasicBlock *BB, 122 bool ProcessThreadableEdges(Value *Cond, BasicBlock *BB, 155 BasicBlock *BB = I; local 157 while (ProcessBlock(BB)) 164 if (pred_begin(BB) == pred_end(BB) && 165 BB ! 215 getJumpThreadDuplicationCost(const BasicBlock *BB) argument 311 ComputeValueKnownInPredecessors(Value *V, BasicBlock *BB, PredValueInfo &Result, ConstantPreference Preference) argument 594 GetBestDestForJumpOnUndef(BasicBlock *BB) argument 612 hasAddressTakenAndUsed(BasicBlock *BB) argument 624 ProcessBlock(BasicBlock *BB) argument 978 FindMostPopularDest(BasicBlock *BB, const SmallVectorImpl<std::pair<BasicBlock*, BasicBlock*> > &PredToDestList) argument 1037 ProcessThreadableEdges(Value *Cond, BasicBlock *BB, ConstantPreference Preference) argument 1146 BasicBlock *BB = PN->getParent(); local 1176 BasicBlock *BB = BO->getParent(); local 1304 ThreadEdge(BasicBlock *BB, const SmallVectorImpl<BasicBlock*> &PredBBs, BasicBlock *SuccBB) argument 1345 << *BB << "\\n"); local 1454 DuplicateCondBranchOnPHIIntoPred(BasicBlock *BB, const SmallVectorImpl<BasicBlock *> &PredBBs) argument 1490 << DuplicationCost << " block is:" << *BB << "\\n"); local [all...] |
H A D | BasicBlockPlacement.cpp | 74 void PlaceBlocks(BasicBlock *BB); 104 void BlockPlacement::PlaceBlocks(BasicBlock *BB) { argument 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);
|
/external/swiftshader/third_party/LLVM/tools/bugpoint-passes/ |
H A D | TestPasses.cpp | 36 bool runOnBasicBlock(BasicBlock &BB) {
argument 37 for (BasicBlock::iterator I = BB.begin(), E = BB.end(); I != E; ++I)
59 bool runOnBasicBlock(BasicBlock &BB) {
argument 60 for (BasicBlock::iterator I = BB.begin(), E = BB.end(); I != E; ++I)
|
/external/clang/test/CodeGenCXX/ |
H A D | virtual-base-cast.cpp | 8 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/swiftshader/third_party/LLVM/lib/Transforms/Instrumentation/ |
H A D | 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 [all...] |
/external/llvm/lib/CodeGen/ |
H A D | MachineSSAUpdater.cpp | 63 bool MachineSSAUpdater::HasValueForBlock(MachineBasicBlock *BB) const { 64 return getAvailableVals(AV).count(BB); 69 void MachineSSAUpdater::AddAvailableValue(MachineBasicBlock *BB, unsigned V) { argument 70 getAvailableVals(AV)[BB] = V; 75 unsigned MachineSSAUpdater::GetValueAtEndOfBlock(MachineBasicBlock *BB) { argument 76 return GetValueAtEndOfBlockInternal(BB); 80 unsigned LookForIdenticalPHI(MachineBasicBlock *BB, argument 82 if (BB->empty()) 85 MachineBasicBlock::iterator I = BB->begin(); 92 while (I != BB 113 InsertNewDef(unsigned Opcode, MachineBasicBlock *BB, MachineBasicBlock::iterator I, const TargetRegisterClass *RC, MachineRegisterInfo *MRI, const TargetInstrInfo *TII) argument 141 GetValueInMiddleOfBlock(MachineBasicBlock *BB) argument 245 BlkSucc_begin(BlkT *BB) argument 246 BlkSucc_end(BlkT *BB) argument 275 FindPredecessorBlocks(MachineBasicBlock *BB, SmallVectorImpl<MachineBasicBlock*> *Preds) argument 284 GetUndefVal(MachineBasicBlock *BB, MachineSSAUpdater *Updater) argument 296 CreateEmptyPHI(MachineBasicBlock *BB, unsigned NumPreds, MachineSSAUpdater *Updater) argument 348 GetValueAtEndOfBlockInternal(MachineBasicBlock *BB) argument [all...] |
H A D | IfConversion.cpp | 78 ICNotClassfied, // BB data valid, but not classified. 80 ICSimple, // BB is entry of an one split, no rejoin sub-CFG. 84 ICTriangle, // BB is entry of a triangle sub-CFG. 85 ICDiamond // BB is entry of a diamond sub-CFG. 95 /// IsDone - True if BB is not to be considered for ifcvt. 96 /// IsBeingAnalyzed - True if BB is currently being analyzed. 97 /// IsAnalyzed - True if BB has been analyzed (info is still valid). 98 /// IsEnqueued - True if BB has been enqueued to be ifcvt'ed. 100 /// HasFallThrough - True if BB may fallthrough to the following BB 124 MachineBasicBlock *BB; member in struct:__anon12549::IfConverter::BBInfo 228 MeetIfcvtSizeLimit(MachineBasicBlock &BB, unsigned Cycle, unsigned Extra, BranchProbability Prediction) const argument 440 findFalseBlock(MachineBasicBlock *BB, MachineBasicBlock *TrueBB) argument 466 getNextBlock(MachineBasicBlock *BB) argument 804 BBState(MachineBasicBlock *BB) argument 816 MachineBasicBlock *BB = State.MBB; local 1002 canFallThroughTo(MachineBasicBlock *BB, MachineBasicBlock *ToBB) argument 1020 InvalidatePreds(MachineBasicBlock *BB) argument 1032 InsertUncondBranch(MachineBasicBlock *BB, MachineBasicBlock *ToBB, const TargetInstrInfo *TII) argument [all...] |
H A D | UnreachableBlockElim.cpp | 46 for (BasicBlock *BB : depth_first_ext(&F, Reachable)) 47 (void)BB/* Mark all reachable blocks */; 54 BasicBlock *BB = &*I; local 55 DeadBlocks.push_back(BB); 56 while (PHINode *PN = dyn_cast<PHINode>(BB->begin())) { 58 BB->getInstList().pop_front(); 60 for (succ_iterator SI = succ_begin(BB), E = succ_end(BB); SI != E; ++SI) 61 (*SI)->removePredecessor(BB); 62 BB 148 MachineBasicBlock *BB = &*I; local 184 MachineBasicBlock *BB = &*I; local [all...] |
/external/swiftshader/third_party/LLVM/lib/CodeGen/ |
H A D | MachineSSAUpdater.cpp | 62 bool MachineSSAUpdater::HasValueForBlock(MachineBasicBlock *BB) const { 63 return getAvailableVals(AV).count(BB); 68 void MachineSSAUpdater::AddAvailableValue(MachineBasicBlock *BB, unsigned V) { argument 69 getAvailableVals(AV)[BB] = V; 74 unsigned MachineSSAUpdater::GetValueAtEndOfBlock(MachineBasicBlock *BB) { argument 75 return GetValueAtEndOfBlockInternal(BB); 79 unsigned LookForIdenticalPHI(MachineBasicBlock *BB, argument 81 if (BB->empty()) 84 MachineBasicBlock::iterator I = BB->front(); 91 while (I != BB 112 InsertNewDef(unsigned Opcode, MachineBasicBlock *BB, MachineBasicBlock::iterator I, const TargetRegisterClass *RC, MachineRegisterInfo *MRI, const TargetInstrInfo *TII) argument 140 GetValueInMiddleOfBlock(MachineBasicBlock *BB) argument 280 BlkSucc_begin(BlkT *BB) argument 281 BlkSucc_end(BlkT *BB) argument 291 FindPredecessorBlocks(MachineBasicBlock *BB, SmallVectorImpl<MachineBasicBlock*> *Preds) argument 300 GetUndefVal(MachineBasicBlock *BB, MachineSSAUpdater *Updater) argument 312 CreateEmptyPHI(MachineBasicBlock *BB, unsigned NumPreds, MachineSSAUpdater *Updater) argument 365 GetValueAtEndOfBlockInternal(MachineBasicBlock *BB) argument [all...] |
/external/llvm/lib/Analysis/ |
H A D | CFG.cpp | 29 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...] |
/external/swiftshader/third_party/LLVM/lib/Transforms/IPO/ |
H A D | PruneEH.cpp | 47 void DeleteBasicBlock(BasicBlock *BB); 103 for (Function::iterator BB = F->begin(), E = F->end(); BB != E; ++BB) { 104 if (CheckUnwind && (isa<UnwindInst>(BB->getTerminator()) || 105 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) 174 for (Function::iterator BB 234 DeleteBasicBlock(BasicBlock *BB) argument [all...] |
/external/swiftshader/third_party/LLVM/lib/Analysis/ |
H A D | BranchProbabilityInfo.cpp | 88 // Return TRUE if BB leads directly to a Return Instruction. 89 static bool isReturningBlock(BasicBlock *BB) { argument 93 TerminatorInst *TI = BB->getTerminator(); 104 Visited.insert(BB); 105 BB = TI->getSuccessor(0); 108 if (Visited.count(BB)) 115 uint32_t getMaxWeightFor(BasicBlock *BB) const { 116 return UINT32_MAX / BB->getTerminator()->getNumSuccessors(); 126 bool calcMetadataWeights(BasicBlock *BB); 129 bool calcReturnHeuristics(BasicBlock *BB); 146 calcMetadataWeights(BasicBlock *BB) argument 184 calcReturnHeuristics(BasicBlock *BB) argument 224 calcPointerHeuristics(BasicBlock *BB) argument 259 calcLoopBranchHeuristics(BasicBlock *BB) argument 323 calcZeroHeuristics(BasicBlock *BB) argument 388 BasicBlock *BB = I++; local [all...] |
/external/llvm/include/llvm/Analysis/ |
H A D | 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) { argument 162 finishPostorder(BasicBlock *BB) argument 175 finishPostorder(BasicBlock *BB) argument [all...] |
/external/llvm/lib/Target/Mips/ |
H A D | Mips16ISelLowering.h | 54 MachineBasicBlock *BB) const; 58 MachineBasicBlock *BB) const; 62 MachineBasicBlock *BB) const; 66 MachineBasicBlock *BB) const; 71 MachineBasicBlock *BB) const; 74 MachineBasicBlock *BB) const; 78 MachineBasicBlock *BB) const;
|