| /external/llvm/include/llvm/Analysis/ |
| BlockFrequencyImpl.h | 158 PE = GraphTraits< Inverse<BlockT *> >::child_end(BB);
160 if (PI == PE)
166 if (PI != PE)
195 PE = GraphTraits< Inverse<BlockT *> >::child_end(BB);
196 PI != PE; ++PI) {
239 PE = GraphTraits< Inverse<BlockT *> >::child_end(Head);
240 PI != PE; ++PI) {
291 PE = GraphTraits< Inverse<BlockT *> >::child_end(BB);
292 PI != PE; ++PI) {
|
| LoopInfo.h | 301 PE = InvBlockTraits::child_end(Header); PI != PE; ++PI) {
322 typename InvBlockTraits::ChildIteratorType PE =
325 for (; PI != PE; ++PI) {
441 InvBlockTraits::child_begin(BB), PE = InvBlockTraits::child_end(BB);
442 PI != PE; ++PI) {
[all...] |
| /external/clang/include/clang/Lex/ |
| PreprocessingRecord.h | 152 static bool classof(const PreprocessedEntity *PE) {
153 return PE->getKind() == MacroDefinitionKind;
190 static bool classof(const PreprocessedEntity *PE) {
191 return PE->getKind() == MacroExpansionKind;
250 static bool classof(const PreprocessedEntity *PE) {
251 return PE->getKind() == InclusionDirectiveKind;
|
| /external/llvm/lib/CodeGen/ |
| LiveRangeCalc.cpp | 118 PE = MBB->pred_end(); PI != PE; ++PI) {
209 PE = MBB->pred_end(); PI != PE; ++PI) {
|
| DwarfEHPrepare.cpp | 381 for (pred_iterator PI = pred_begin(LPad), PE = pred_end(LPad);
382 PI != PE; ++PI) {
415 for (pred_iterator PI = pred_begin(LPad), PE = pred_end(LPad); PI != PE; ) {
426 pred_iterator PB = pred_begin(NewBB), PE = pred_end(NewBB);
431 for (pred_iterator PI = PB; PI != PE; ++PI) {
445 for (pred_iterator PI = PB; PI != PE; ++PI)
456 for (pred_iterator PI = PB; PI != PE; ++PI)
|
| GCMetadata.cpp | 166 PE = FD->end(); PI != PE; ++PI) {
|
| OptimizePHIs.cpp | 182 for (InstrSetIterator PI = PHIsInCycle.begin(), PE = PHIsInCycle.end();
183 PI != PE; ++PI) {
|
| TailDuplication.cpp | 147 PE = Preds.end(); PI != PE; ++PI) {
635 PE = BB.pred_end(); PI != PE; ++PI) {
663 PE = Preds.end(); PI != PE; ++PI) {
751 PE = Preds.end(); PI != PE; ++PI) {
[all...] |
| AggressiveAntiDepBreaker.cpp | 280 for (SUnit::const_pred_iterator P = SU->Preds.begin(), PE = SU->Preds.end();
281 P != PE; ++P) {
299 for (SUnit::const_pred_iterator P = SU->Preds.begin(), PE = SU->Preds.end();
300 P != PE; ++P) {
858 PE = PathSU->Preds.end(); P != PE; ++P) {
867 PE = PathSU->Preds.end(); P != PE; ++P) {
[all...] |
| ShrinkWrapping.cpp | 244 PE = MBB->pred_end(); PI != PE; ++PI) {
570 PE = MBB->pred_end(); PI != PE; ++PI) {
611 PE = MBB->pred_end(); PI != PE; ++PI) {
684 PE = MBB->pred_end(); PI != PE; ++PI) {
[all...] |
| CriticalAntiDepBreaker.cpp | 163 for (SUnit::const_pred_iterator P = SU->Preds.begin(), PE = SU->Preds.end();
164 P != PE; ++P) {
552 PE = CriticalPathSU->Preds.end(); P != PE; ++P)
|
| CodePlacementOpt.cpp | 165 PE = TopMBB->pred_end(); PI != PE; ++PI) {
|
| /external/llvm/lib/Transforms/Utils/ |
| LoopSimplify.cpp | 155 PE = pred_end(*BB); PI != PE; ++PI) {
222 for (pred_iterator PI = pred_begin(ExitBlock), PE = pred_end(ExitBlock);
223 PI != PE; ++PI)
367 for (pred_iterator PI = pred_begin(Header), PE = pred_end(Header);
368 PI != PE; ++PI) {
750 PE = pred_end(L->getHeader()); PI != PE; ++PI)
|
| Local.cpp | 494 for (pred_iterator PI = pred_begin(Succ), PE = pred_end(Succ);
495 PI != PE; ++PI) {
515 for (BlockSet::iterator PI = CommonPreds.begin(), PE = CommonPreds.end();
516 PI != PE; PI++) {
528 for (BlockSet::iterator PI = CommonPreds.begin(), PE = CommonPreds.end();
529 PI != PE; PI++) {
[all...] |
| /external/llvm/lib/Analysis/ |
| RegionInfo.cpp | 141 for (pred_iterator PI = pred_begin(entry), PE = pred_end(entry); PI != PE;
163 for (pred_iterator PI = pred_begin(exit), PE = pred_end(exit); PI != PE;
389 for (pred_iterator PI = pred_begin(getExit()), PE = pred_end(getExit());
390 PI != PE; ++PI)
407 for (pred_iterator PI = pred_begin(getExit()), PE = pred_end(getExit());
408 PI != PE; ++PI)
469 for (pred_iterator PI = pred_begin(BB), PE = pred_end(BB); PI != PE; ++PI)
[all...] |
| /external/llvm/lib/Transforms/Scalar/ |
| CorrelatedValuePropagation.cpp | 149 pred_iterator PI = pred_begin(C->getParent()), PE = pred_end(C->getParent());
150 if (PI == PE) return false;
157 while (PI != PE) {
|
| SimplifyCFGPass.cpp | 263 pred_iterator PB = pred_begin(RetBlock), PE = pred_end(RetBlock);
265 std::distance(PB, PE), "merge",
268 for (pred_iterator PI = PB; PI != PE; ++PI)
|
| JumpThreading.cpp | 732 pred_iterator PI = pred_begin(BB), PE = pred_end(BB);
733 if (CondBr && CondConst && CondBr->isConditional() && PI != PE &&
745 while (++PI != PE) {
753 if (PI == PE) {
[all...] |
| TailRecursionElimination.cpp | 531 pred_iterator PB = pred_begin(OldEntry), PE = pred_end(OldEntry);
534 std::distance(PB, PE) + 1,
543 for (pred_iterator PI = PB; PI != PE; ++PI) {
|
| /external/llvm/lib/Transforms/IPO/ |
| LoopExtractor.cpp | 228 PI = pred_begin(LPad), PE = pred_end(LPad); PI != PE; ++PI) {
|
| /external/clang/lib/AST/ |
| CXXInheritance.cpp | 314 for (CXXBasePath::iterator PE = P->begin(), PEEnd = P->end();
315 PE != PEEnd && !Hidden; ++PE) {
316 if (PE->Base->isVirtual()) {
318 if (const RecordType *Record = PE->Base->getType()->getAs<RecordType>())
|
| /external/llvm/tools/llvm-ar/ |
| llvm-ar.cpp | 579 for (std::set<sys::Path>::iterator PI = Paths.begin(), PE = Paths.end();
580 PI != PE; ++PI) {
677 PE = remaining.end(); PI != PE; ++PI) {
|
| /external/llvm/tools/llvm-diff/ |
| DifferenceEngine.cpp | 555 PI = Path.begin(), PE = Path.end();
556 while (PI != PE && *PI == DC_match) {
561 for (; PI != PE; ++PI) {
|
| /external/clang/lib/CodeGen/ |
| CGExprComplex.cpp | 109 ComplexPairTy VisitParenExpr(ParenExpr *PE) { return Visit(PE->getSubExpr());}
115 VisitSubstNonTypeTemplateParmExpr(SubstNonTypeTemplateParmExpr *PE) {
116 return Visit(PE->getReplacement());
|
| /external/llvm/utils/TableGen/ |
| FastISelEmitter.cpp | 616 for (PredMap::const_iterator PI = PM.begin(), PE = PM.end();
617 PI != PE; ++PI) {
707 for (PredMap::const_iterator PI = PM.begin(), PE = PM.end(); PI != PE;
|
