HomeSort by relevance Sort by last modified time
    Searched refs:PN (Results 1 - 25 of 383) sorted by null

1 2 3 4 5 6 7 8 91011>>

  /prebuilts/go/darwin-x86/src/go/internal/gccgoimporter/testdata/
complexnums.go 5 const PN = 1 - 1i
  /prebuilts/go/linux-x86/src/go/internal/gccgoimporter/testdata/
complexnums.go 5 const PN = 1 - 1i
  /external/llvm/lib/Transforms/InstCombine/
InstCombinePHI.cpp 28 Instruction *InstCombiner::FoldPHIArgBinOpIntoPHI(PHINode &PN) {
29 Instruction *FirstInst = cast<Instruction>(PN.getIncomingValue(0));
39 for (unsigned i = 1; i != PN.getNumIncomingValues(); ++i) {
40 Instruction *I = dyn_cast<Instruction>(PN.getIncomingValue(i));
71 NewLHS = PHINode::Create(LHSType, PN.getNumIncomingValues(),
72 FirstInst->getOperand(0)->getName() + ".pn");
73 NewLHS->addIncoming(InLHS, PN.getIncomingBlock(0));
74 InsertNewInstBefore(NewLHS, PN);
79 NewRHS = PHINode::Create(RHSType, PN.getNumIncomingValues(),
80 FirstInst->getOperand(1)->getName() + ".pn");
    [all...]
  /external/swiftshader/third_party/LLVM/lib/Transforms/InstCombine/
InstCombinePHI.cpp 24 Instruction *InstCombiner::FoldPHIArgBinOpIntoPHI(PHINode &PN) {
25 Instruction *FirstInst = cast<Instruction>(PN.getIncomingValue(0));
44 for (unsigned i = 1; i != PN.getNumIncomingValues(); ++i) {
45 Instruction *I = dyn_cast<Instruction>(PN.getIncomingValue(i));
83 NewLHS = PHINode::Create(LHSType, PN.getNumIncomingValues(),
84 FirstInst->getOperand(0)->getName() + ".pn");
85 NewLHS->addIncoming(InLHS, PN.getIncomingBlock(0));
86 InsertNewInstBefore(NewLHS, PN);
91 NewRHS = PHINode::Create(RHSType, PN.getNumIncomingValues(),
92 FirstInst->getOperand(1)->getName() + ".pn");
    [all...]
  /external/swiftshader/third_party/LLVM/lib/VMCore/
BasicBlock.cpp 250 while (PHINode *PN = dyn_cast<PHINode>(&front())) {
252 PN->removeIncomingValue(Pred, !DontDeleteUselessPHIs);
256 if (PN->getIncomingValue(0) != PN)
257 PN->replaceAllUsesWith(PN->getIncomingValue(0));
260 PN->replaceAllUsesWith(UndefValue::get(PN->getType()));
270 PHINode *PN;
271 for (iterator II = begin(); (PN = dyn_cast<PHINode>(II)); )
    [all...]
  /external/llvm/lib/IR/
BasicBlock.cpp 315 while (PHINode *PN = dyn_cast<PHINode>(&front())) {
317 PN->removeIncomingValue(Pred, !DontDeleteUselessPHIs);
321 if (PN->getIncomingValue(0) != PN)
322 PN->replaceAllUsesWith(PN->getIncomingValue(0));
325 PN->replaceAllUsesWith(UndefValue::get(PN->getType()));
335 PHINode *PN;
336 for (iterator II = begin(); (PN = dyn_cast<PHINode>(II)); )
    [all...]
  /external/llvm/lib/Transforms/Utils/
UnifyFunctionExitNodes.cpp 91 PHINode *PN = nullptr;
96 PN = PHINode::Create(F.getReturnType(), ReturningBlocks.size(),
98 NewRetBlock->getInstList().push_back(PN);
99 ReturnInst::Create(F.getContext(), PN, NewRetBlock);
108 if (PN)
109 PN->addIncoming(BB->getTerminator()->getOperand(0), BB);
LCSSA.cpp 80 if (PHINode *PN = dyn_cast<PHINode>(User))
81 UserBB = PN->getIncomingBlock(U);
119 PHINode *PN = PHINode::Create(Inst.getType(), PredCache.size(ExitBB),
124 PN->addIncoming(&Inst, Pred);
131 &PN->getOperandUse(PN->getOperandNumForIncomingValue(
132 PN->getNumIncomingValues() - 1)));
135 AddedPHIs.push_back(PN);
138 SSAUpdate.AddAvailableValue(ExitBB, PN);
150 PostProcessPHIs.push_back(PN);
    [all...]
BreakCriticalEdges.cpp 92 PHINode *PN = dyn_cast<PHINode>(I); ++I) {
93 unsigned Idx = PN->getBasicBlockIndex(SplitBB);
94 Value *V = PN->getIncomingValue(Idx);
104 PN->getType(), Preds.size(), "split",
110 PN->setIncomingValue(Idx, NewPN);
153 PHINode *PN = cast<PHINode>(I);
160 if (PN->getIncomingBlock(BBIdx) != TIBB)
161 BBIdx = PN->getBasicBlockIndex(TIBB);
162 PN->setIncomingBlock(BBIdx, NewBB);
196 if (PHINode *PN = dyn_cast<PHINode>(DestBB->begin()))
    [all...]
  /external/swiftshader/third_party/LLVM/lib/Transforms/Utils/
LoopSimplify.cpp 265 PHINode *PN;
267 (PN = dyn_cast<PHINode>(I++)); )
268 if (Value *V = SimplifyInstruction(PN, 0, DT)) {
269 if (AA) AA->deleteValue(PN);
270 if (SE) SE->forgetValue(PN);
271 PN->replaceAllUsesWith(V);
272 PN->eraseFromParent();
457 PHINode *PN = cast<PHINode>(I);
459 if (Value *V = SimplifyInstruction(PN, 0, DT)) {
461 PN->replaceAllUsesWith(V)
    [all...]
BasicBlockUtils.cpp 77 while (PHINode *PN = dyn_cast<PHINode>(BB->begin())) {
78 if (PN->getIncomingValue(0) != PN)
79 PN->replaceAllUsesWith(PN->getIncomingValue(0));
81 PN->replaceAllUsesWith(UndefValue::get(PN->getType()));
84 MemDep->removeInstruction(PN); // Memdep updates AA itself.
85 else if (AA && isa<PointerType>(PN->getType()))
86 AA->deleteValue(PN);
    [all...]
DemoteRegToStack.cpp 54 if (PHINode *PN = dyn_cast<PHINode>(U)) {
65 for (unsigned i = 0, e = PN->getNumIncomingValues(); i != e; ++i)
66 if (PN->getIncomingValue(i) == &I) {
67 Value *&V = Loads[PN->getIncomingBlock(i)];
71 PN->getIncomingBlock(i)->getTerminator());
73 PN->setIncomingValue(i, V);
UnifyFunctionExitNodes.cpp 114 PHINode *PN = 0;
119 PN = PHINode::Create(F.getReturnType(), ReturningBlocks.size(),
121 NewRetBlock->getInstList().push_back(PN);
122 ReturnInst::Create(F.getContext(), PN, NewRetBlock);
134 if (PN)
135 PN->addIncoming(BB->getTerminator()->getOperand(0), BB);
  /frameworks/base/core/java/android/content/
ComponentName.java 158 int PN = mPackage.length();
160 if (CN > PN && mClass.charAt(PN) == '.') {
161 return mClass.substring(PN, CN);
170 int PN = packageName.length();
172 if (CN > PN && className.charAt(PN) == '.') {
173 sb.append(className, PN, CN);
183 int PN = packageName.length();
185 if (CN > PN && className.charAt(PN) == '.')
    [all...]
  /prebuilts/clang/host/darwin-x86/clang-4393122/include/llvm/IR/
BasicBlock.h 272 PHINodeT *PN;
274 phi_iterator_impl(PHINodeT *PN) : PN(PN) {}
284 : PN(Arg.PN) {}
286 bool operator==(const phi_iterator_impl &Arg) const { return PN == Arg.PN; }
288 PHINodeT &operator*() const { return *PN; }
292 assert(PN && "Cannot increment the end iterator!")
    [all...]
  /prebuilts/clang/host/darwin-x86/clang-4479392/include/llvm/IR/
BasicBlock.h 272 PHINodeT *PN;
274 phi_iterator_impl(PHINodeT *PN) : PN(PN) {}
284 : PN(Arg.PN) {}
286 bool operator==(const phi_iterator_impl &Arg) const { return PN == Arg.PN; }
288 PHINodeT &operator*() const { return *PN; }
292 assert(PN && "Cannot increment the end iterator!")
    [all...]
  /prebuilts/clang/host/darwin-x86/clang-4579689/include/llvm/IR/
BasicBlock.h 276 PHINodeT *PN;
278 phi_iterator_impl(PHINodeT *PN) : PN(PN) {}
288 : PN(Arg.PN) {}
290 bool operator==(const phi_iterator_impl &Arg) const { return PN == Arg.PN; }
292 PHINodeT &operator*() const { return *PN; }
296 assert(PN && "Cannot increment the end iterator!")
    [all...]
  /prebuilts/clang/host/darwin-x86/clang-4630689/include/llvm/IR/
BasicBlock.h 276 PHINodeT *PN;
278 phi_iterator_impl(PHINodeT *PN) : PN(PN) {}
288 : PN(Arg.PN) {}
290 bool operator==(const phi_iterator_impl &Arg) const { return PN == Arg.PN; }
292 PHINodeT &operator*() const { return *PN; }
296 assert(PN && "Cannot increment the end iterator!")
    [all...]
  /prebuilts/clang/host/darwin-x86/clang-4639204/include/llvm/IR/
BasicBlock.h 276 PHINodeT *PN;
278 phi_iterator_impl(PHINodeT *PN) : PN(PN) {}
288 : PN(Arg.PN) {}
290 bool operator==(const phi_iterator_impl &Arg) const { return PN == Arg.PN; }
292 PHINodeT &operator*() const { return *PN; }
296 assert(PN && "Cannot increment the end iterator!")
    [all...]
  /prebuilts/clang/host/darwin-x86/clang-4691093/include/llvm/IR/
BasicBlock.h 276 PHINodeT *PN;
278 phi_iterator_impl(PHINodeT *PN) : PN(PN) {}
288 : PN(Arg.PN) {}
290 bool operator==(const phi_iterator_impl &Arg) const { return PN == Arg.PN; }
292 PHINodeT &operator*() const { return *PN; }
296 assert(PN && "Cannot increment the end iterator!")
    [all...]
  /prebuilts/clang/host/linux-x86/clang-4393122/include/llvm/IR/
BasicBlock.h 272 PHINodeT *PN;
274 phi_iterator_impl(PHINodeT *PN) : PN(PN) {}
284 : PN(Arg.PN) {}
286 bool operator==(const phi_iterator_impl &Arg) const { return PN == Arg.PN; }
288 PHINodeT &operator*() const { return *PN; }
292 assert(PN && "Cannot increment the end iterator!")
    [all...]
  /prebuilts/clang/host/linux-x86/clang-4479392/include/llvm/IR/
BasicBlock.h 272 PHINodeT *PN;
274 phi_iterator_impl(PHINodeT *PN) : PN(PN) {}
284 : PN(Arg.PN) {}
286 bool operator==(const phi_iterator_impl &Arg) const { return PN == Arg.PN; }
288 PHINodeT &operator*() const { return *PN; }
292 assert(PN && "Cannot increment the end iterator!")
    [all...]
  /prebuilts/clang/host/linux-x86/clang-4579689/include/llvm/IR/
BasicBlock.h 276 PHINodeT *PN;
278 phi_iterator_impl(PHINodeT *PN) : PN(PN) {}
288 : PN(Arg.PN) {}
290 bool operator==(const phi_iterator_impl &Arg) const { return PN == Arg.PN; }
292 PHINodeT &operator*() const { return *PN; }
296 assert(PN && "Cannot increment the end iterator!")
    [all...]
  /prebuilts/clang/host/linux-x86/clang-4630689/include/llvm/IR/
BasicBlock.h 276 PHINodeT *PN;
278 phi_iterator_impl(PHINodeT *PN) : PN(PN) {}
288 : PN(Arg.PN) {}
290 bool operator==(const phi_iterator_impl &Arg) const { return PN == Arg.PN; }
292 PHINodeT &operator*() const { return *PN; }
296 assert(PN && "Cannot increment the end iterator!")
    [all...]
  /prebuilts/clang/host/linux-x86/clang-4639204/include/llvm/IR/
BasicBlock.h 276 PHINodeT *PN;
278 phi_iterator_impl(PHINodeT *PN) : PN(PN) {}
288 : PN(Arg.PN) {}
290 bool operator==(const phi_iterator_impl &Arg) const { return PN == Arg.PN; }
292 PHINodeT &operator*() const { return *PN; }
296 assert(PN && "Cannot increment the end iterator!")
    [all...]

Completed in 1007 milliseconds

1 2 3 4 5 6 7 8 91011>>