/external/llvm/unittests/Transforms/Utils/ |
Local.cpp | 29 PHINode *phi = builder.CreatePHI(Type::getInt32Ty(C), 2); local 35 phi->addIncoming(phi, bb0); 36 phi->addIncoming(phi, bb1); 38 // The PHI will be removed 39 EXPECT_TRUE(RecursivelyDeleteDeadPHINode(phi)); 46 phi = builder.CreatePHI(Type::getInt32Ty(C), 0); 48 EXPECT_TRUE(RecursivelyDeleteDeadPHINode(phi)); 51 phi = builder.CreatePHI(Type::getInt32Ty(C), 0) [all...] |
/dalvik/dx/tests/083-ssa-phi-placement/ |
run | 18 dx --dump --ssa-blocks --ssa-step=phi-placement Blort.class
|
/external/llvm/lib/CodeGen/ |
UnreachableBlockElim.cpp | 175 // Cleanup PHI nodes. 178 // Prune unneeded PHI entries. 181 MachineBasicBlock::iterator phi = BB->begin(); local 182 while (phi != BB->end() && phi->isPHI()) { 183 for (unsigned i = phi->getNumOperands() - 1; i >= 2; i-=2) 184 if (!preds.count(phi->getOperand(i).getMBB())) { 185 phi->RemoveOperand(i); 186 phi->RemoveOperand(i-1); 190 if (phi->getNumOperands() == 3) [all...] |
/external/bouncycastle/src/main/java/org/bouncycastle/crypto/generators/ |
RSAKeyPairGenerator.java | 30 BigInteger p, q, n, d, e, pSub1, qSub1, phi; local 120 phi = p; 122 q = phi; 127 phi = pSub1.multiply(qSub1); 132 d = e.modInverse(phi);
|
/external/clang/test/CodeGen/ |
2007-03-05-DataLayout.c | 23 double phi; member in struct:bnode 36 #define Phi(x) ((x)->phi)
|
/development/samples/GlobalTime/src/com/android/globaltime/ |
LatLongSphere.java | 56 // phi is the latitude 57 float phi = PI * fj; local 58 float sinPhi = (float) Math.sin(phi); 59 float cosPhi = (float) Math.cos(phi);
|
/external/llvm/examples/BrainF/ |
BrainF.h | 73 void readloop(PHINode *phi, BasicBlock *oldbb,
|
BrainF.cpp | 183 void BrainF::readloop(PHINode *phi, BasicBlock *oldbb, BasicBlock *testbb, 293 // Make part of PHI instruction now, wait until end of loop to finish 417 if (!phi) { 429 //%head.%d = phi i8 *[%head.%d, %main.%d], [%head.%d, %main.%d] 430 //Finish phi made at beginning of loop 431 phi->addIncoming(curhead, builder->GetInsertBlock()); 432 Value *head_0 = phi; 448 //%head.%d = phi i8 *[%head.%d, %main.%d] 462 if (phi) {
|
/dalvik/dx/src/com/android/dx/ssa/ |
DeadCodeRemover.java | 257 public void visitPhiInsn (PhiInsn phi) { 259 if (!hasSideEffect(phi)) { 260 noSideEffectRegs.set(phi.getResult().getReg());
|
MoveParamCombiner.java | 65 public void visitPhiInsn (PhiInsn phi) {
|
SsaMethod.java | 192 * is called after edge-splitting and phi insertion, since the edges 313 * Borrows a register to use as a temp. Used in the phi removal process. 424 public void visitPhiInsn (PhiInsn phi) { 425 definitionList[phi.getResult().getReg()] = phi; 458 public void visitPhiInsn (PhiInsn phi) { 459 addToUses(phi); 734 * Visits each phi insn in this method
|
SsaRenamer.java | 473 * Phi insns have their result registers renamed. 475 public void visitPhiInsn(PhiInsn phi) { 476 /* don't process sources for phi's */ 477 processResultReg(phi); 583 * All insns that are not move or phi insns have their source registers 625 * Updates the phi insns in successor blocks with operands based 639 * Never add a version 0 register as a phi
|
/dalvik/dx/src/com/android/dx/ssa/back/ |
LivenessAnalyzer.java | 160 // If s is a phi-function with V as it's ith argument. 161 PhiInsn phi = (PhiInsn) insn; local 164 phi.predBlocksForReg(regV, ssaMeth)) { 247 * Ensures that all the phi result registers for all the phis in the 251 * a the result of a dead-end phi might be assigned the same register 252 * as the result of another phi, and the phi removal move scheduler may
|
/external/v8/src/ |
hydrogen.cc | 88 void HBasicBlock::AddPhi(HPhi* phi) { 90 phis_.Add(phi); 91 phi->SetBlock(this); 95 void HBasicBlock::RemovePhi(HPhi* phi) { 96 ASSERT(phi->block() == this); 97 ASSERT(phis_.Contains(phi)); 98 ASSERT(phi->HasNoUses() || !phi->is_live()); 99 phi->ClearOperands(); 100 phis_.RemoveElement(phi); 448 HPhi* phi = block->phis()->at(j); local 738 HPhi* phi = worklist.RemoveLast(); local 772 HPhi* phi = blocks_[i]->phis()->at(j); local 786 HPhi* phi = worklist.RemoveLast(); local 798 HPhi* phi = phi_list[i]; local 813 HPhi* phi = blocks_[i]->phis()->at(j); local 898 HPhi* phi = block->phis()->at(i); local 1573 HPhi* phi = HPhi::cast(use); local 1624 HPhi* phi = phi_list->at(i); local 1640 HPhi* phi = phi_list->at(i); local 1722 HPhi* phi = HPhi::cast(current); local 1879 HPhi* phi = phi_list()->at(i); local 1888 HPhi* phi = phi_list()->at(i); local 1906 HPhi* phi = blocks_[i]->phis()->at(j); local 1941 HPhi* phi = phi_list()->at(i); local 5652 HPhi* phi = HPhi::cast(value); local 5660 HPhi* phi = new(block->zone()) HPhi(i); local 5731 HPhi* phi = new(loop_header->zone()) HPhi(i); local 5879 HPhi* phi = current->phis()->at(j); local [all...] |
lithium-allocator.cc | 575 // All phi input operands corresponding to this successor edge are live 580 HPhi* phi = phis->at(i); local 581 if (!phi->OperandAt(index)->IsConstant()) { 582 live_out->Add(phi->OperandAt(index)->id()); 913 HPhi* phi = LookupPhi(to); local 915 if (phi != NULL) { 916 // This is a phi resolving move. 917 if (!phi->block()->IsLoopHeader()) { 918 hint = LiveRangeFor(phi->id())->FirstHint(); 1011 HPhi* phi = phis->at(i); local 1237 HPhi* phi = phis->at(i); local [all...] |
/prebuilt/linux-x86/toolchain/arm-eabi-4.4.0/lib/gcc/arm-eabi/4.4.0/plugin/include/ |
tree-flow-inline.h | 496 /* Return a use_operand_p pointer for argument I of PHI node GS. */ 504 /* Return the tree operand for argument I of PHI node GS. */ 513 /* Return a pointer to the tree operand for argument I of PHI node GS. */ 521 /* Return the edge associated with argument I of phi node GS. */ 529 /* Return the source location of gimple argument I of phi node GS. */ 537 /* Return the source location of the argument on edge E of phi node GS. */ 545 /* Set the source location of gimple argument I of phi node GS to LOC. */ 553 /* Return TRUE if argument I of phi node GS has a location record. */ 562 /* Return the PHI nodes for basic block BB, or NULL if there are no 563 PHI nodes. * 594 gimple phi; local [all...] |
/prebuilt/linux-x86/toolchain/arm-eabi-4.4.3/lib/gcc/arm-eabi/4.4.3/plugin/include/ |
tree-flow-inline.h | 496 /* Return a use_operand_p pointer for argument I of PHI node GS. */ 504 /* Return the tree operand for argument I of PHI node GS. */ 513 /* Return a pointer to the tree operand for argument I of PHI node GS. */ 521 /* Return the edge associated with argument I of phi node GS. */ 529 /* Return the source location of gimple argument I of phi node GS. */ 537 /* Return the source location of the argument on edge E of phi node GS. */ 545 /* Set the source location of gimple argument I of phi node GS to LOC. */ 553 /* Return TRUE if argument I of phi node GS has a location record. */ 562 /* Return the PHI nodes for basic block BB, or NULL if there are no 563 PHI nodes. * 594 gimple phi; local [all...] |
/prebuilt/linux-x86/toolchain/arm-linux-androideabi-4.4.x/lib/gcc/arm-linux-androideabi/4.4.3/plugin/include/ |
tree-flow-inline.h | 496 /* Return a use_operand_p pointer for argument I of PHI node GS. */ 504 /* Return the tree operand for argument I of PHI node GS. */ 513 /* Return a pointer to the tree operand for argument I of PHI node GS. */ 521 /* Return the edge associated with argument I of phi node GS. */ 529 /* Return the source location of gimple argument I of phi node GS. */ 537 /* Return the source location of the argument on edge E of phi node GS. */ 545 /* Set the source location of gimple argument I of phi node GS to LOC. */ 553 /* Return TRUE if argument I of phi node GS has a location record. */ 562 /* Return the PHI nodes for basic block BB, or NULL if there are no 563 PHI nodes. * 594 gimple phi; local [all...] |
/external/llvm/examples/OCaml-Kaleidoscope/Chapter5/ |
codegen.ml | 67 * phi. We create a new name because one is used for the phi node, and the 77 * phi. *) 84 let phi = build_phi incoming "iftmp" builder in var 98 phi 116 (* Start the PHI node with an entry for start. *) 119 (* Within the loop, the variable is defined equal to the PHI node. If it 159 (* Add a new entry to the PHI node for the backedge. *)
|
/external/llvm/lib/Transforms/Instrumentation/ |
PathProfiling.cpp | 936 PHINode* phi = PHINode::Create(Type::getInt32Ty(*Context), local 984 PHINode* phi = target->getPathPHI(); local [all...] |
/external/llvm/lib/Transforms/Utils/ |
InlineFunction.cpp | 118 // instructions that are pinned to an edge like a phi, or 132 // through multiple levels of phi, so give up if we've already 187 // %exn = phi ... 188 // %selector = phi ... 216 // For all the phis in nonDominated, make a new phi in split to join 217 // that phi with the edge from lastDominated. 220 PHINode *phi = dyn_cast<PHINode>(i); local 221 if (!phi) break; 223 PHINode *splitPhi = PHINode::Create(phi->getType(), 2, phi->getName() 323 PHINode *phi = cast<PHINode>(I); local [all...] |
LoopUnroll.cpp | 67 // if there are no PHI nodes. 76 // Resolve any PHI nodes at the start of the block. They are all 86 // Make all PHI nodes that referred to BB now refer to Pred as their 222 // PHI nodes. Insert associations now. 252 // Loop over all of the PHI nodes in the block, changing them to use the 273 // Add phi entries for newly created values to all exit blocks. 279 PHINode *phi = dyn_cast<PHINode>(BBI); ++BBI) { 280 Value *Incoming = phi->getIncomingValueForBlock(*BB); 284 phi->addIncoming(Incoming, New); 304 // Loop over the PHI nodes in the original block, setting incoming values [all...] |
/external/v8/test/mjsunit/compiler/ |
regress-rep-change.js | 28 // Regression test for the case where a phi has two input operands with
|
/dalvik/vm/compiler/ |
SSATransformation.cpp | 150 * TODO - evaluate whether phi will ever need to be inserted into exit 381 * The calculated result is used for phi-node pruning - where we only need to 382 * insert a phi node if the variable is live-in to the block. 420 /* Insert phi nodes to for each variable to the dominance frontiers */ 447 /* Calculate the phi blocks for each Dalvik register */ 477 * Insert a phi node for dalvikReg in the phiBlocks if the Dalvik 486 /* Variable will be clobbered before being used - no need for phi */ 488 MIR *phi = (MIR *) dvmCompilerNew(sizeof(MIR), true); local 489 phi->dalvikInsn.opcode = (Opcode)kMirOpPhi; 490 phi->dalvikInsn.vA = dalvikReg [all...] |
/external/llvm/examples/OCaml-Kaleidoscope/Chapter6/ |
codegen.ml | 85 * phi. We create a new name because one is used for the phi node, and the 95 * phi. *) 102 let phi = build_phi incoming "iftmp" builder in var 116 phi 134 (* Start the PHI node with an entry for start. *) 137 (* Within the loop, the variable is defined equal to the PHI node. If it 177 (* Add a new entry to the PHI node for the backedge. *)
|