| /external/llvm/lib/CodeGen/ |
| D | MachineSSAUpdater.cpp | 186 MachineInstr *InsertedPHI = InsertNewDef(TargetOpcode::PHI, BB, in GetValueInMiddleOfBlock()
250 MachineInstr *PHI; member in __anon7a05692a0111::MachinePHIiter
255 : PHI(P), idx(1) {} in MachinePHIiter()
257 : PHI(P), idx(PHI->getNumOperands()) {} in MachinePHIiter()
262 unsigned getIncomingValue() { return PHI->getOperand(idx).getReg(); } in getIncomingValue()
264 return PHI->getOperand(idx+1).getMBB(); in getIncomingBlock()
284 static inline PHI_iterator PHI_begin(PhiT *PHI) { return PHI_iterator(PHI); } in PHI_begin() argument
285 static inline PHI_iterator PHI_end(PhiT *PHI) { in PHI_end() argument
286 return PHI_iterator(PHI, true); in PHI_end()
315 MachineInstr *PHI = InsertNewDef(TargetOpcode::PHI, BB, Loc, in CreateEmptyPHI() local
[all …]
|
| D | StrongPHIElimination.cpp | 304 MachineInstr *PHI = BBI; in runOnMachineFunction() local
306 assert(PHI->getNumOperands() > 0); in runOnMachineFunction()
308 unsigned SrcReg = PHI->getOperand(1).getReg(); in runOnMachineFunction()
317 unsigned DestReg = PHI->getOperand(0).getReg(); in runOnMachineFunction()
321 for (unsigned i = 3; i < PHI->getNumOperands(); i += 2) { in runOnMachineFunction()
322 unsigned SrcReg = PHI->getOperand(i).getReg(); in runOnMachineFunction()
327 LI->RemoveMachineInstrFromMaps(PHI); in runOnMachineFunction()
328 PHI->eraseFromParent(); in runOnMachineFunction()
459 unsigned StrongPHIElimination::getPHIColor(MachineInstr *PHI) { in getPHIColor() argument
460 assert(PHI->isPHI()); in getPHIColor()
[all …]
|
| /external/llvm/lib/Transforms/Utils/ |
| D | SSAUpdater.cpp | 73 static bool IsEquivalentPHI(PHINode *PHI, in IsEquivalentPHI() argument
75 unsigned PHINumValues = PHI->getNumIncomingValues(); in IsEquivalentPHI()
81 if (ValueMapping[PHI->getIncomingBlock(i)] != in IsEquivalentPHI()
82 PHI->getIncomingValue(i)) { in IsEquivalentPHI()
238 PHINode *PHI; member in __anon059c2bef0111::PHIiter
243 : PHI(P), idx(0) {} in PHIiter()
245 : PHI(P), idx(PHI->getNumIncomingValues()) {} in PHIiter()
250 Value *getIncomingValue() { return PHI->getIncomingValue(idx); } in getIncomingValue()
251 BasicBlock *getIncomingBlock() { return PHI->getIncomingBlock(idx); } in getIncomingBlock()
270 static inline PHI_iterator PHI_begin(PhiT *PHI) { return PHI_iterator(PHI); } in PHI_begin() argument
[all …]
|
| D | InlineFunction.cpp | 1102 PHINode *PHI = 0; in InlineFunction() local
1107 PHI = PHINode::Create(RTy, Returns.size(), TheCall->getName(), in InlineFunction()
1111 TheCall->replaceAllUsesWith(PHI); in InlineFunction()
1116 if (PHI) { in InlineFunction()
1119 assert(RI->getReturnValue()->getType() == PHI->getType() && in InlineFunction()
1121 PHI->addIncoming(RI->getReturnValue(), RI->getParent()); in InlineFunction()
1182 if (PHI) in InlineFunction()
1183 if (Value *V = SimplifyInstruction(PHI, IFI.TD)) { in InlineFunction()
1184 PHI->replaceAllUsesWith(V); in InlineFunction()
1185 PHI->eraseFromParent(); in InlineFunction()
|
| /external/llvm/include/llvm/Transforms/Utils/ |
| D | SSAUpdaterImpl.h | 325 ValT PHI = Traits::CreateEmptyPHI(Info->BB, Info->NumPreds, Updater); in FindAvailableVals() local
326 Info->AvailableVal = PHI; in FindAvailableVals()
327 (*AvailableVals)[Info->BB] = PHI; in FindAvailableVals()
345 PhiT *PHI = Traits::ValueIsNewPHI(Info->AvailableVal, Updater); in FindAvailableVals() local
346 if (!PHI) in FindAvailableVals()
356 Traits::AddPHIOperand(PHI, PredInfo->AvailableVal, Pred); in FindAvailableVals()
359 DEBUG(dbgs() << " Inserted PHI: " << *PHI << "\n"); in FindAvailableVals()
362 if (InsertedPHIs) InsertedPHIs->push_back(PHI); in FindAvailableVals()
387 bool CheckIfPHIMatches(PhiT *PHI) { in CheckIfPHIMatches() argument
389 WorkList.push_back(PHI); in CheckIfPHIMatches()
[all …]
|
| /external/llvm/test/Transforms/ADCE/ |
| D | 2003-04-25-PHIPostDominateProblem.ll | 1 ; THis testcase caused an assertion failure because a PHI node did not have
3 ; PHI node is dead, so we just avoid patching up dead PHI nodes.
|
| D | 2002-05-23-ZeroArgPHITest.ll | 3 ; into was that when the reg109 PHI was getting zero predecessors, it was
5 ; in with a dummy value before the PHI is deleted.
|
| D | 2002-05-22-PHITest.ll | 1 ; It is illegal to remove BB1 because it will mess up the PHI node!
|
| /external/llvm/test/Verifier/ |
| D | PhiGrouping.ll | 1 ; RUN: not llvm-as < %s |& grep {PHI nodes not grouped at top}
14 %x = add i32 %a, 0 ; Error, PHI's should be grouped!
|
| D | SelfReferential.ll | 1 ; RUN: not llvm-as %s -o /dev/null |& grep {Only PHI nodes may reference their own value}
|
| /external/llvm/test/Transforms/SimplifyCFG/ |
| D | PhiBlockMerge2.ll | 1 ; Test merging of blocks that only have PHI nodes in them. This tests the case
2 ; where the mergedinto block doesn't have any PHI nodes, and is in fact
|
| D | PhiEliminate.ll | 2 ; be able to fold PHI nodes into computation in common cases. Folding the PHI
|
| D | 2002-06-24-PHINode.ll | 1 ; -simplifycfg is not folding blocks if there is a PHI node involved. This
|
| /external/llvm/test/Transforms/Mem2Reg/ |
| D | 2003-10-05-DeadPHIInsertion.ll | 1 ; Mem2reg should not insert dead PHI nodes! The naive algorithm inserts a PHI
|
| /external/llvm/test/Transforms/InstCombine/ |
| D | 2004-01-13-InstCombineInvokePHI.ll | 3 ; inserting a cast of the return value after the PHI instruction, but which is
4 ; used by the PHI instruction. This is bad: because of the semantics of the
|
| /external/llvm/lib/CodeGen/SelectionDAG/ |
| D | SelectionDAGISel.cpp | 999 MachineInstr *PHI = FuncInfo->PHINodesToUpdate[i].first; in FinishBasicBlock() local
1000 assert(PHI->isPHI() && in FinishBasicBlock()
1002 if (!FuncInfo->MBB->isSuccessor(PHI->getParent())) in FinishBasicBlock()
1004 PHI->addOperand( in FinishBasicBlock()
1006 PHI->addOperand(MachineOperand::CreateMBB(FuncInfo->MBB)); in FinishBasicBlock()
1051 MachineInstr *PHI = FuncInfo->PHINodesToUpdate[pi].first; in FinishBasicBlock() local
1052 MachineBasicBlock *PHIBB = PHI->getParent(); in FinishBasicBlock()
1053 assert(PHI->isPHI() && in FinishBasicBlock()
1058 PHI->addOperand(MachineOperand:: in FinishBasicBlock()
1061 PHI->addOperand(MachineOperand::CreateMBB(SDB->BitTestCases[i].Parent)); in FinishBasicBlock()
[all …]
|
| /external/llvm/include/llvm/Target/ |
| D | TargetOpcodes.h | 26 PHI = 0, enumerator
|
| /external/llvm/test/MC/Disassembler/ARM/ |
| D | invalid-SRS-arm.txt | 3 # Opcode=0 Name=PHI Format=(42)
|
| D | invalid-LDRT-arm.txt | 3 # Opcode=0 Name=PHI Format=(42)
|
| D | invalid-LDC-form-arm.txt | 3 # Opcode=0 Name=PHI Format=(42)
|
| D | invalid-MOVr-arm.txt | 3 # Opcode=0 Name=PHI Format=(42)
|
| D | invalid-MOVs-arm.txt | 3 # Opcode=0 Name=PHI Format=(42)
|
| /external/llvm/test/CodeGen/X86/ |
| D | 2010-09-30-CMOV-JumpTable-PHI.ll | 8 ; That causes the PHI to be updated wrong because the jumptable data structure is remembering the o…
10 ; -cgp-critical-edge-splitting=0 prevents the edge to PHI from being split.
|
| /external/llvm/lib/Transforms/IPO/ |
| D | LowerSetJmp.cpp | 433 PHINode* PHI = PHINode::Create(Type::getInt32Ty(Inst->getContext()), 2, in TransformSetJmpCall() local
437 PHI->addIncoming(Constant::getNullValue(Type::getInt32Ty(Inst->getContext())), in TransformSetJmpCall()
447 PHI->addIncoming(SVP.second, SVP.second->getParent()); in TransformSetJmpCall()
451 Inst->replaceAllUsesWith(PHI); in TransformSetJmpCall()
|
| /external/llvm/test/Transforms/Inline/ |
| D | 2003-10-26-InlineInvokeExceptionDestPhi.ll | 1 ; The inliner is breaking inlining invoke instructions where there is a PHI
|