Home
last modified time | relevance | path

Searched refs:PHI (Results 1 – 25 of 323) sorted by relevance

12345678910>>...13

/external/swiftshader/third_party/LLVM/lib/Target/X86/
DX86GenDisassemblerTables.inc19 "PHI"
46378 0 /* PHI*/
47320 0 /* PHI*/
47337 0, /* PHI*/
47338 0, /* PHI*/
47339 0, /* PHI*/
47340 0, /* PHI*/
47341 0, /* PHI*/
47342 0, /* PHI*/
47343 0, /* PHI*/
[all …]
/external/swiftshader/third_party/LLVM/lib/CodeGen/
DMachineSSAUpdater.cpp186 MachineInstr *InsertedPHI = InsertNewDef(TargetOpcode::PHI, BB, in GetValueInMiddleOfBlock()
250 MachineInstr *PHI; member in __anon2433a2920111::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 …]
DStrongPHIElimination.cpp305 MachineInstr *PHI = BBI; in runOnMachineFunction() local
307 assert(PHI->getNumOperands() > 0); in runOnMachineFunction()
309 unsigned SrcReg = PHI->getOperand(1).getReg(); in runOnMachineFunction()
318 unsigned DestReg = PHI->getOperand(0).getReg(); in runOnMachineFunction()
322 for (unsigned i = 3; i < PHI->getNumOperands(); i += 2) { in runOnMachineFunction()
323 unsigned SrcReg = PHI->getOperand(i).getReg(); in runOnMachineFunction()
328 LI->RemoveMachineInstrFromMaps(PHI); in runOnMachineFunction()
329 PHI->eraseFromParent(); in runOnMachineFunction()
460 unsigned StrongPHIElimination::getPHIColor(MachineInstr *PHI) { in getPHIColor() argument
461 assert(PHI->isPHI()); in getPHIColor()
[all …]
/external/llvm/lib/CodeGen/
DMachineSSAUpdater.cpp187 MachineInstrBuilder InsertedPHI = InsertNewDef(TargetOpcode::PHI, BB, in GetValueInMiddleOfBlock()
251 MachineInstr *PHI; member in llvm::SSAUpdaterTraits::PHI_iterator
256 : PHI(P), idx(1) {} in PHI_iterator()
258 : PHI(P), idx(PHI->getNumOperands()) {} in PHI_iterator()
263 unsigned getIncomingValue() { return PHI->getOperand(idx).getReg(); } in getIncomingValue()
265 return PHI->getOperand(idx+1).getMBB(); in getIncomingBlock()
268 static inline PHI_iterator PHI_begin(PhiT *PHI) { return PHI_iterator(PHI); } in PHI_begin() argument
269 static inline PHI_iterator PHI_end(PhiT *PHI) { in PHI_end() argument
270 return PHI_iterator(PHI, true); in PHI_end()
299 MachineInstr *PHI = InsertNewDef(TargetOpcode::PHI, BB, Loc, in CreateEmptyPHI() local
[all …]
DEarlyIfConversion.cpp111 MachineInstr *PHI; member
117 : PHI(phi), TReg(0), FReg(0), CondCycles(0), TCycles(0), FCycles(0) {} in PHIInfo()
413 for (unsigned i = 1; i != PI.PHI->getNumOperands(); i += 2) { in canConvertIf()
414 if (PI.PHI->getOperand(i+1).getMBB() == TPred) in canConvertIf()
415 PI.TReg = PI.PHI->getOperand(i).getReg(); in canConvertIf()
416 if (PI.PHI->getOperand(i+1).getMBB() == FPred) in canConvertIf()
417 PI.FReg = PI.PHI->getOperand(i).getReg(); in canConvertIf()
425 DEBUG(dbgs() << "Can't convert: " << *PI.PHI); in canConvertIf()
462 DEBUG(dbgs() << "If-converting " << *PI.PHI); in replacePHIInstrs()
463 unsigned DstReg = PI.PHI->getOperand(0).getReg(); in replacePHIInstrs()
[all …]
/external/llvm/lib/Transforms/Utils/
DSSAUpdater.cpp65 static bool IsEquivalentPHI(PHINode *PHI, in IsEquivalentPHI() argument
67 unsigned PHINumValues = PHI->getNumIncomingValues(); in IsEquivalentPHI()
73 if (ValueMapping[PHI->getIncomingBlock(i)] != in IsEquivalentPHI()
74 PHI->getIncomingValue(i)) { in IsEquivalentPHI()
221 PHINode *PHI; member in llvm::SSAUpdaterTraits::PHI_iterator
226 : PHI(P), idx(0) {} in PHI_iterator()
228 : PHI(P), idx(PHI->getNumIncomingValues()) {} in PHI_iterator()
233 Value *getIncomingValue() { return PHI->getIncomingValue(idx); } in getIncomingValue()
234 BasicBlock *getIncomingBlock() { return PHI->getIncomingBlock(idx); } in getIncomingBlock()
237 static PHI_iterator PHI_begin(PhiT *PHI) { return PHI_iterator(PHI); } in PHI_begin() argument
[all …]
DSimplifyCFG.cpp2509 PHINode *PHI = nullptr; in ensureValueAvailableInSuccessor() local
2514 PHI = cast<PHINode>(I); in ensureValueAvailableInSuccessor()
2521 if (PHI->getIncomingValueForBlock(OtherPredBB) == AlternativeV) in ensureValueAvailableInSuccessor()
2523 PHI = nullptr; in ensureValueAvailableInSuccessor()
2525 if (PHI) in ensureValueAvailableInSuccessor()
2526 return PHI; in ensureValueAvailableInSuccessor()
2533 PHI = PHINode::Create(V->getType(), 2, "simplifycfg.merge", &Succ->front()); in ensureValueAvailableInSuccessor()
2534 PHI->addIncoming(V, BB); in ensureValueAvailableInSuccessor()
2537 PHI->addIncoming( in ensureValueAvailableInSuccessor()
2539 return PHI; in ensureValueAvailableInSuccessor()
[all …]
/external/swiftshader/third_party/LLVM/lib/Transforms/Utils/
DSSAUpdater.cpp73 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 __anonf43e5f570111::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 …]
/external/swiftshader/third_party/LLVM/include/llvm/Transforms/Utils/
DSSAUpdaterImpl.h325 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/include/llvm/Transforms/Utils/
DSSAUpdaterImpl.h336 ValT PHI = Traits::CreateEmptyPHI(Info->BB, Info->NumPreds, Updater); in FindAvailableVals() local
337 Info->AvailableVal = PHI; in FindAvailableVals()
338 (*AvailableVals)[Info->BB] = PHI; in FindAvailableVals()
356 PhiT *PHI = Traits::ValueIsNewPHI(Info->AvailableVal, Updater); in FindAvailableVals() local
357 if (!PHI) in FindAvailableVals()
367 Traits::AddPHIOperand(PHI, PredInfo->AvailableVal, Pred); in FindAvailableVals()
370 DEBUG(dbgs() << " Inserted PHI: " << *PHI << "\n"); in FindAvailableVals()
373 if (InsertedPHIs) InsertedPHIs->push_back(PHI); in FindAvailableVals()
398 bool CheckIfPHIMatches(PhiT *PHI) { in CheckIfPHIMatches() argument
400 WorkList.push_back(PHI); in CheckIfPHIMatches()
[all …]
/external/llvm/test/Transforms/InstCombine/
Dphi-preserve-ir-flags.ll20 ; CHECK [[PHI:%[^ ]*]] = phi float [ %b, %cond.true ], [ %c, %cond.false ]
21 ; CHECK fsub fast float %a, [[PHI]]
42 ; CHECK [[PHI:%[^ ]*]] = phi float [ %b, %cond.true ], [ %c, %cond.false ]
43 ; CHECK fsub float %a, [[PHI]]
63 ; CHECK [[PHI:%[^ ]*]] = phi float [ %a, %cond.true ], [ %b, %cond.false ]
64 ; CHECK fadd fast float %a, [[PHI]]
84 ; CHECK [[PHI:%[^ ]*]] = phi float [ %a, %cond.true ], [ %b, %cond.false ]
85 ; CHECK fadd float %a, [[PHI]]
/external/llvm/lib/Transforms/Instrumentation/
DIndirectCallPromotion.cpp361 PHINode *PHI = dyn_cast<PHINode>(&I); in getCallRetPHINode() local
362 if (!PHI) in getCallRetPHINode()
364 int IX = PHI->getBasicBlockIndex(From); in getCallRetPHINode()
367 Value *V = PHI->getIncomingValue(IX); in getCallRetPHINode()
385 PHINode *PHI = dyn_cast<PHINode>(&I); in fixupPHINodeForUnwind() local
386 if (!PHI) in fixupPHINodeForUnwind()
388 int IX = PHI->getBasicBlockIndex(OrigBB); in fixupPHINodeForUnwind()
391 Value *V = PHI->getIncomingValue(IX); in fixupPHINodeForUnwind()
392 PHI->addIncoming(V, IndirectCallBB); in fixupPHINodeForUnwind()
393 PHI->setIncomingBlock(IX, DirectCallBB); in fixupPHINodeForUnwind()
[all …]
/external/llvm/test/CodeGen/PowerPC/
Dopt-sub-inst-cr0-live.mir107 %0 = PHI %11, %bb.0.top, %4, %bb.3.loop
108 %1 = PHI %12, %bb.0.top, %5, %bb.3.loop
109 %2 = PHI %13, %bb.0.top, %4, %bb.3.loop
110 %3 = PHI %14, %bb.0.top, %5, %bb.3.loop
139 %5 = PHI %26, %bb.2.loop, %27, %bb.4
/external/swiftshader/third_party/LLVM/test/Transforms/ADCE/
D2003-04-25-PHIPostDominateProblem.ll1 ; 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.
/external/llvm/test/Transforms/ADCE/
D2003-04-25-PHIPostDominateProblem.ll1 ; 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.
/external/llvm/lib/Transforms/Scalar/
DLoopInterchange.cpp629 PHINode *PHI = dyn_cast<PHINode>(L->getOperand(0)); in containsUnsafeInstructionsInLatch() local
630 if (!PHI) in containsUnsafeInstructionsInLatch()
705 PHINode *PHI = cast<PHINode>(I); in findInductionAndReductions() local
706 if (InductionDescriptor::isInductionPHI(PHI, SE, ID)) in findInductionAndReductions()
707 Inductions.push_back(PHI); in findInductionAndReductions()
708 else if (RecurrenceDescriptor::isReductionPHI(PHI, L, RD)) in findInductionAndReductions()
709 Reductions.push_back(PHI); in findInductionAndReductions()
721 PHINode *PHI = cast<PHINode>(I); in containsSafePHI() local
723 if (PHI->getNumIncomingValues() > 1) in containsSafePHI()
725 Instruction *Ins = dyn_cast<Instruction>(PHI->getIncomingValue(0)); in containsSafePHI()
[all …]
/external/llvm/test/Transforms/Mem2Reg/
Dpr24179.ll9 ; and a PHI node to be created.
19 ; CHECK: [[PHI:%.*]] = phi i32 [ undef, %entry ], [ %n, %loop ]
20 ; CHECK: call i1 @use(i32 [[PHI]])
D2003-10-05-DeadPHIInsertion.ll1 ; Mem2reg should not insert dead PHI nodes! The naive algorithm inserts a PHI
/external/llvm/lib/Target/NVPTX/
DNVPTXInferAddressSpaces.cpp165 case Instruction::PHI: in isAddressExpression()
182 case Instruction::PHI: { in getPointerOperands()
305 case Instruction::PHI: { in cloneInstructionWithNewAddressSpace()
307 PHINode *PHI = cast<PHINode>(I); in cloneInstructionWithNewAddressSpace() local
308 PHINode *NewPHI = PHINode::Create(NewPtrType, PHI->getNumIncomingValues()); in cloneInstructionWithNewAddressSpace()
309 for (unsigned Index = 0; Index < PHI->getNumIncomingValues(); ++Index) { in cloneInstructionWithNewAddressSpace()
312 PHI->getIncomingBlock(Index)); in cloneInstructionWithNewAddressSpace()
/external/llvm/test/Verifier/
DPhiGrouping.ll2 ; CHECK: PHI nodes not grouped at top
13 %x = add i32 %a, 0 ; Error, PHI's should be grouped!
/external/swiftshader/third_party/LLVM/test/Verifier/
DPhiGrouping.ll1 ; RUN: not llvm-as < %s |& grep {PHI nodes not grouped at top}
14 %x = add i32 %a, 0 ; Error, PHI's should be grouped!
/external/llvm/test/Transforms/LoopStrengthReduce/
Dpr25541.ll41 ; CHECK: %[[PHI:.*]] = phi i64 [ %[[IV_NEXT:.*]], {{.*}} ], [ 0, {{.*}} ]
42 ; CHECK: %[[ITOP:.*]] = inttoptr i64 %[[PHI]] to i32*
44 ; CHECK: %[[IV_NEXT]] = add i64 %[[PHI]], -4
/external/swiftshader/third_party/LLVM/test/Transforms/Mem2Reg/
D2003-10-05-DeadPHIInsertion.ll1 ; Mem2reg should not insert dead PHI nodes! The naive algorithm inserts a PHI
/external/swiftshader/third_party/LLVM/test/Transforms/SimplifyCFG/
DPhiBlockMerge2.ll1 ; 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
/external/llvm/test/Transforms/SimplifyCFG/
DPhiBlockMerge2.ll1 ; 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

12345678910>>...13