| /external/llvm/lib/Transforms/Scalar/ |
| H A D | SimplifyCFGPass.cpp | 106 pred_iterator PB = pred_begin(RetBlock), PE = pred_end(RetBlock); local
108 std::distance(PB, PE), "merge",
111 for (pred_iterator PI = PB; PI != PE; ++PI)
|
| H A D | TailRecursionElimination.cpp | 738 pred_iterator PB = pred_begin(OldEntry), PE = pred_end(OldEntry); local
741 std::distance(PB, PE) + 1,
750 for (pred_iterator PI = PB; PI != PE; ++PI) {
|
| H A D | JumpThreading.cpp | 1019 pred_iterator PB = pred_begin(LoadBB), PE = pred_end(LoadBB); local
1020 PHINode *PN = PHINode::Create(LI->getType(), std::distance(PB, PE), "",
1027 for (pred_iterator PI = PB; PI != PE; ++PI) {
|
| /external/llvm/lib/Target/PowerPC/ |
| H A D | PPCMCInstLower.cpp | 156 const MCExpr *PB = MCSymbolRefExpr::Create(MF->getPICBaseSymbol(), Ctx); local
157 Expr = MCBinaryExpr::CreateSub(Expr, PB, Ctx);
|
| H A D | PPCAsmPrinter.cpp | 506 const MCExpr *PB = local
515 MCOperand::CreateExpr(MCBinaryExpr::CreateSub(Exp, PB, OutContext));
559 const MCExpr *PB = local
562 Exp = MCBinaryExpr::CreateSub(Exp, PB, OutContext);
|
| /external/clang/test/Layout/ |
| H A D | ms-x86-pack-and-align.cpp | 659 typedef __declspec(align(8)) PA PB; variable
664 PB x;
687 typedef PB PD;
|
| /external/apache-commons-math/src/main/java/org/apache/commons/math/util/ |
| H A D | MathUtils.java | 57 private static final byte PB = (byte)1; field in class:MathUtils
1075 return (x >= ZB) ? PB : NB;
1630 return (x == ZB) ? ZB : (x > ZB) ? PB : NB;
|
| /external/llvm/lib/Target/Hexagon/ |
| H A D | HexagonExpandCondsets.cpp | 475 MachineBasicBlock *PB = LIS->getMBBFromIndex(PE); local
476 if (PB != MB && !LIS->isLiveInToMBB(LID, MB))
564 MachineBasicBlock *PB = LIS->getMBBFromIndex(PE); local
565 if (PB != MB && !LIS->isLiveInToMBB(LID, MB)) {
|
| H A D | HexagonHardwareLoops.cpp | 1434 MachineBasicBlock *PB = *I; local
1435 if (PB != Latch) {
1436 bool NotAnalyzed = TII->AnalyzeBranch(*PB, TB, FB, Tmp1, false);
1517 MachineBasicBlock *PB = *I; local
1518 if (PB != Latch) {
1520 bool NotAnalyzed = TII->AnalyzeBranch(*PB, TB, FB, Tmp2, false);
1524 TII->InsertBranch(*PB, NewPH, nullptr, EmptyCond, DL);
1525 PB->ReplaceUsesOfBlockWith(Header, NewPH);
|
| /external/llvm/utils/TableGen/ |
| H A D | CodeGenRegisters.cpp | 813 const CodeGenRegisterClass &PB) {
815 auto *B = &PB;
812 TopoOrderRC(const CodeGenRegisterClass &PA, const CodeGenRegisterClass &PB) argument
|
| /external/llvm/lib/Transforms/Utils/ |
| H A D | SimplifyCFG.cpp | 2034 static bool checkCSEInPredecessor(Instruction *Inst, BasicBlock *PB) { argument
2037 for (BasicBlock::iterator I = PB->begin(), E = PB->end(); I != E; I++) {
2063 if (BasicBlock *PB = BB->getSinglePredecessor())
2064 if (BranchInst *PBI = dyn_cast<BranchInst>(PB->getTerminator()))
2076 if (!checkCSEInPredecessor(Curr, PB))
2372 pred_iterator PB = pred_begin(BB), PE = pred_end(BB); local
2374 std::distance(PB, PE),
2380 for (pred_iterator PI = PB; PI != PE; ++PI) {
|