| /external/llvm/lib/Analysis/ |
| ProfileEstimatorPass.cpp | 131 for ( pred_iterator bbi = pred_begin(BB), bbe = pred_end(BB);
132 bbi != bbe; ++bbi ) {
263 succ_iterator bbi = succ_begin(BB), bbe = succ_end(BB); local
266 if (bbi == bbe) {
271 for ( ; bbi != bbe; ++bbi ) {
312 for (succ_iterator bbi = succ_begin(BB), bbe = succ_end(BB);
313 bbi != bbe; ++bbi) {
366 for (std::set<BasicBlock*>::iterator BBI = BBToVisit.begin(), BBE = BBToVisit.end();
367 (BBI != BBE) && (!found); ++BBI) {
370 for (pred_iterator bbi = pred_begin(BB), bbe = pred_end(BB)
[all...] |
| ProfileVerifierPass.cpp | 102 for (const_pred_iterator bbi = pred_begin(BB), bbe = pred_end(BB);
103 bbi != bbe; ++bbi ) {
117 for ( succ_const_iterator bbi = succ_begin(BB), bbe = succ_end(BB);
118 bbi != bbe; ++bbi ) {
139 for ( succ_const_iterator bbi = succ_begin(BB), bbe = succ_end(BB);
140 bbi != bbe; ++bbi ) {
263 succ_const_iterator bbi = succ_begin(BB), bbe = succ_end(BB); local
272 for (;bbi != bbe; ++bbi) {
342 for ( succ_const_iterator bbi = succ_begin(BB), bbe = succ_end(BB);
343 bbi != bbe; ++bbi )
[all...] |
| ProfileInfoLoaderPass.cpp | 117 for (succ_const_iterator bbi = succ_begin(BB), bbe = succ_end(BB);
118 bbi != bbe; ++bbi) {
121 for (const_pred_iterator bbi = pred_begin(BB), bbe = pred_end(BB);
122 bbi != bbe; ++bbi) {
|
| ProfileInfo.cpp | 386 for(succ_const_iterator BBI = succ_begin(FirstBB), BBE = succ_end(FirstBB);
387 BBI != BBE; ++BBI) {
514 const_pred_iterator bbi = pred_begin(BB), bbe = pred_end(BB); local
515 if (bbi==bbe) {
519 for (;bbi != bbe; ++bbi) {
586 const_pred_iterator bbi = pred_begin(BB), bbe = pred_end(BB); local
587 if (bbi == bbe) {
590 for( ; bbi != bbe; ++bbi ) {
[all...] |
| /external/llvm/lib/IR/ |
| Dominators.cpp | 162 bool DominatorTree::dominates(const BasicBlockEdge &BBE,
167 assert(BBE.isSingleEdge());
171 const BasicBlock *Start = BBE.getStart();
172 const BasicBlock *End = BBE.getEnd();
213 bool DominatorTree::dominates(const BasicBlockEdge &BBE,
218 assert(BBE.isSingleEdge());
223 if (PN && PN->getParent() == BBE.getEnd() &&
224 PN->getIncomingBlock(U) == BBE.getStart())
234 return dominates(BBE, UseBB);
|
| /external/llvm/lib/CodeGen/ |
| StrongPHIElimination.cpp | 241 for (MachineBasicBlock::iterator BBI = I->begin(), BBE = I->end();
242 BBI != BBE && BBI->isPHI(); ++BBI) {
274 for (MachineBasicBlock::iterator BBI = I->begin(), BBE = I->end();
275 BBI != BBE && BBI->isPHI(); ++BBI) {
285 for (MachineBasicBlock::iterator BBI = I->begin(), BBE = I->end();
286 BBI != BBE && BBI->isPHI(); ++BBI) {
302 MachineBasicBlock::iterator BBI = I->begin(), BBE = I->end();
303 while (BBI != BBE && BBI->isPHI()) {
529 BBE = DefInstrs.end(); BBI != BBE; ++BBI)
[all...] |
| StackColoring.cpp | 511 MachineFunction::iterator BB, BBE;
513 for (BB = MF->begin(), BBE = MF->end(); BB != BBE; ++BB)
597 MachineFunction::const_iterator BB, BBE;
599 for (BB = MF->begin(), BBE = MF->end(); BB != BBE; ++BB)
|
| PHIElimination.cpp | 533 for (MachineBasicBlock::const_iterator BBI = I->begin(), BBE = I->end();
534 BBI != BBE && BBI->isPHI(); ++BBI)
550 for (MachineBasicBlock::iterator BBI = MBB.begin(), BBE = MBB.end();
551 BBI != BBE && BBI->isPHI(); ++BBI) {
|
| LiveVariables.cpp | 707 for (MachineBasicBlock::const_iterator BBI = I->begin(), BBE = I->end();
708 BBI != BBE && BBI->isPHI(); ++BBI)
788 MachineBasicBlock::iterator BBI = SuccBB->begin(), BBE = SuccBB->end();
789 for (; BBI != BBE && BBI->isPHI(); ++BBI) {
800 for (; BBI != BBE; ++BBI) {
|
| GCStrategy.cpp | 380 BBE = MF.end(); BBI != BBE; ++BBI)
|
| SjLjEHPrepare.cpp | 287 BB = F.begin(), BBE = F.end(); BB != BBE; ++BB) {
|
| MachineVerifier.cpp | [all...] |
| /external/llvm/lib/Transforms/Utils/ |
| LCSSA.cpp | 228 BBE = ExitBlocks.end(); BBI != BBE; ++BBI) {
|
| LoopUnroll.cpp | 437 BBE = NewLoopBlocks.end(); BB != BBE; ++BB)
|
| /external/llvm/tools/llvm-prof/ |
| llvm-prof.cpp | 164 for (Function::iterator BB = FI->begin(), BBE = FI->end();
165 BB != BBE; ++BB) {
|
| /external/llvm/include/llvm/Transforms/Utils/ |
| SSAUpdaterImpl.h | 377 for (typename BlkT::iterator BBI = BB->begin(), BBE = BB->end();
378 BBI != BBE; ++BBI) {
|
| /external/llvm/lib/Analysis/IPA/ |
| CallGraph.cpp | 140 for (Function::iterator BB = F->begin(), BBE = F->end(); BB != BBE; ++BB)
|
| /external/llvm/lib/Transforms/Scalar/ |
| SimplifyCFGPass.cpp | 90 BasicBlock::iterator BBI = I, BBE = BB->end();
91 while (BBI != BBE) {
|
| DeadStoreElimination.cpp | 495 for (BasicBlock::iterator BBI = BB.begin(), BBE = BB.end(); BBI != BBE; ) {
|
| LICM.cpp | 252 for (Loop::block_iterator BB = L->block_begin(), BBE = L->block_end();
253 (BB != BBE) && !MayThrow ; ++BB)
[all...] |
| MemCpyOptimizer.cpp | [all...] |
| /external/webkit/Source/JavaScriptCore/wtf/ |
| dtoa.cpp | 751 int bb2, bb5, bbe, bd2, bd5, bbbits, bs2, c, dsign, local
988 d2b(bb, &rv, &bbe, &bbbits); /* rv = bb * 2^bbe */
998 if (bbe >= 0)
999 bb2 += bbe;
1001 bd2 -= bbe;
1003 j = bbe - scale;
[all...] |
| /bionic/libc/stdlib/ |
| strtod.c | 1339 int bb2, bb5, bbe, bd2, bd5, bbbits, bs2, c, dsign, local
1650 bb = d2b(value(rv), &bbe, &bbbits); /* rv = bb * 2^bbe */
1661 if (bbe >= 0)
1662 bb2 += bbe;
1664 bd2 -= bbe;
1668 j = 1 + 4*P - 3 - bbbits + ((bbe + bbbits - 1) & 3);
1673 i = bbe + bbbits - 1; /* logb(rv) */
1675 j = bbe + (P-Emin);
[all...] |
| /external/chromium/base/third_party/dmg_fp/ |
| dtoa.cc | 2432 int bb2, bb5, bbe, bd2, bd5, bbbits, bs2, c, e, e1; variable
[all...] |
| /external/llvm/include/llvm/Analysis/ |
| Dominators.h | 795 bool dominates(const BasicBlockEdge &BBE, const Use &U) const;
796 bool dominates(const BasicBlockEdge &BBE, const BasicBlock *BB) const;
|
