Searched defs:phi (Results 1 - 4 of 4) sorted by relevance

/dalvik/dx/src/com/android/dx/ssa/
H A DDeadCodeRemover.java257 public void visitPhiInsn (PhiInsn phi) { argument
259 if (!hasSideEffect(phi)) {
260 noSideEffectRegs.set(phi.getResult().getReg());
H A DSsaRenamer.java475 public void visitPhiInsn(PhiInsn phi) { argument
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/vm/compiler/
H A DDataflow.cpp1431 /* If the bb doesn't have a phi it cannot contain an induction variable */
1446 * 1) use[0] should belong to the output of a phi node
1447 * 2) def[0] should belong to the input of the same phi node
1450 MIR *phi; local
1451 for (phi = bb->firstMIRInsn; phi; phi = phi->next) {
1452 if ((int)phi->dalvikInsn.opcode != (int)kMirOpPhi) break;
1454 if (phi
[all...]
H A DSSATransformation.cpp150 * 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
[all...]

Completed in 132 milliseconds