Searched defs:PB (Results 1 - 11 of 11) sorted by relevance

/external/arduino/hardware/arduino/cores/arduino/
H A Dpins_arduino.c69 #define PB 2 macro
143 PB , // PB 4 ** 10 ** PWM10
144 PB , // PB 5 ** 11 ** PWM11
145 PB , // PB 6 ** 12 ** PWM12
146 PB , // PB 7 ** 13 ** PWM13
183 PB , // P
[all...]
/external/llvm/lib/Analysis/
H A DProfileDataLoaderPass.cpp94 ProfileData &PB, ProfileData::Edge e,
100 PB.addEdgeWeight(e, weight);
104 << PB.getEdgeWeight(e) << "\n");
108 unsigned ProfileMetadataLoaderPass::matchEdges(Module &M, ProfileData &PB, argument
117 readEdge(ReadCount++, PB, PB.getEdge(0, &F->getEntryBlock()), Counters);
121 readEdge(ReadCount++, PB, PB.getEdge(BB,TI->getSuccessor(s)),
134 ProfileData &PB) {
152 ProfileData::Edge edge = PB
93 readEdge(unsigned ReadCount, ProfileData &PB, ProfileData::Edge e, ArrayRef<unsigned> Counters) argument
133 setBranchWeightMetadata(Module &M, ProfileData &PB) argument
173 ProfileData PB; local
[all...]
/external/llvm/lib/Target/PowerPC/
H A DPPCMCInstLower.cpp146 const MCExpr *PB = MCSymbolRefExpr::Create(MF->getPICBaseSymbol(), Ctx); local
147 Expr = MCBinaryExpr::CreateSub(Expr, PB, Ctx);
/external/llvm/lib/Transforms/Scalar/
H A DSimplifyCFGPass.cpp279 pred_iterator PB = pred_begin(RetBlock), PE = pred_end(RetBlock); local
281 std::distance(PB, PE), "merge",
284 for (pred_iterator PI = PB; PI != PE; ++PI)
H A DTailRecursionElimination.cpp568 pred_iterator PB = pred_begin(OldEntry), PE = pred_end(OldEntry); local
571 std::distance(PB, PE) + 1,
580 for (pred_iterator PI = PB; PI != PE; ++PI) {
H A DJumpThreading.cpp978 pred_iterator PB = pred_begin(LoadBB), PE = pred_end(LoadBB); local
979 PHINode *PN = PHINode::Create(LI->getType(), std::distance(PB, PE), "",
986 for (pred_iterator PI = PB; PI != PE; ++PI) {
/external/harfbuzz/src/
H A Dharfbuzz-shaper.cpp61 NU->EX from PB to IB
70 ProhibitedBreak, // PB in table
80 #define PB ProhibitedBreak macro
85 /* OP */ { PB, PB, PB, PB, PB, PB, PB, P
116 #undef PB macro
[all...]
/external/llvm/lib/Target/Hexagon/
H A DHexagonHardwareLoops.cpp1439 MachineBasicBlock *PB = *I; local
1440 if (PB != Latch) {
1441 bool NotAnalyzed = TII->AnalyzeBranch(*PB, TB, FB, Tmp1, false);
1522 MachineBasicBlock *PB = *I; local
1523 if (PB != Latch) {
1525 bool NotAnalyzed = TII->AnalyzeBranch(*PB, TB, FB, Tmp2, false);
1529 TII->InsertBranch(*PB, NewPH, 0, EmptyCond, DL);
1530 PB->ReplaceUsesOfBlockWith(Header, NewPH);
/external/llvm/lib/Transforms/Instrumentation/
H A DPathProfiling.cpp934 pred_iterator PB = pred_begin(node->getBlock()), local
937 std::distance(PB, PE), "pathNumber",
943 for(pred_iterator predIt = PB; predIt != PE; predIt++) {
/external/llvm/utils/TableGen/
H A DCodeGenRegisters.cpp816 static int TopoOrderRC(const void *PA, const void *PB) { argument
818 const CodeGenRegisterClass *B = *(const CodeGenRegisterClass* const*)PB;
/external/llvm/lib/Transforms/Utils/
H A DSimplifyCFG.cpp1928 static bool checkCSEInPredecessor(Instruction *Inst, BasicBlock *PB) { argument
1931 for (BasicBlock::iterator I = PB->begin(), E = PB->end(); I != E; I++) {
1957 if (BasicBlock *PB = BB->getSinglePredecessor())
1958 if (BranchInst *PBI = dyn_cast<BranchInst>(PB->getTerminator()))
1970 if (!checkCSEInPredecessor(Curr, PB))
2287 pred_iterator PB = pred_begin(BB), PE = pred_end(BB); local
2289 std::distance(PB, PE),
2295 for (pred_iterator PI = PB; PI != PE; ++PI) {

Completed in 270 milliseconds