/external/v8/test/cctest/compiler/ |
H A D | test-phi-reducer.cc | 55 Node* Phi(Node* a) { function in class:PhiReducerTester 56 return SetSelfReferences(graph.NewNode(common.Phi(kMachAnyTagged, 1), a)); 59 Node* Phi(Node* a, Node* b) { function in class:PhiReducerTester 61 graph.NewNode(common.Phi(kMachAnyTagged, 2), a, b)); 64 Node* Phi(Node* a, Node* b, Node* c) { function in class:PhiReducerTester 66 graph.NewNode(common.Phi(kMachAnyTagged, 3), a, b, c)); 69 Node* Phi(Node* a, Node* b, Node* c, Node* d) { function in class:PhiReducerTester 71 graph.NewNode(common.Phi(kMachAnyTagged, 4), a, b, c, d)); 76 graph.NewNode(common.Phi(kMachAnyTagged, 1), a, control)); 81 graph.NewNode(common.Phi(kMachAnyTagge [all...] |
H A D | test-scheduler.cc | 847 op = common_builder.Phi(kMachAnyTagged, 2); 869 op = common_builder.Phi(kMachAnyTagged, 2); 894 op = common_builder.Phi(kMachAnyTagged, 2); 965 op = common_builder.Phi(kMachAnyTagged, 2); 968 op = common_builder.Phi(kMachAnyTagged, 2); 975 op = common_builder.Phi(kMachAnyTagged, 2); 993 op = common_builder.Phi(kMachAnyTagged, 2); 1000 op = common_builder.Phi(kMachAnyTagged, 2); 1028 op = common_builder.Phi(kMachAnyTagged, 2); 1031 op = common_builder.Phi(kMachAnyTagge [all...] |
H A D | test-run-machops.cc | 223 Node* phi = m->Phi(type, true_node, false_node); 292 Node* phi = m.Phi(kMachInt32, false_node, true_node); 312 Node* phi = m.Phi(kMachInt32, m.Parameter(1), m.Parameter(2)); 313 Node* cond = m.Phi(kMachInt32, m.Parameter(0), m.Int32Constant(0)); 344 Node* phi = m.Phi(kMachInt32, false_node, false_node); 371 Node* phi = m.Phi(kMachInt32, zero, zero); 399 Node* phi = m.Phi(kMachInt32, zero, zero); 428 Node* phi = m.Phi(kMachInt32, zero, zero); 456 Node* phi = m.Phi(kMachInt32, bt.param0, m.Int32Constant(0)); 484 Node* phi = m.Phi(kMachFloat6 [all...] |
/external/llvm/lib/Target/R600/ |
H A D | SIAnnotateControlFlow.cpp | 78 bool isElse(PHINode *Phi); 80 void eraseIfUnused(PHINode *Phi); 172 bool SIAnnotateControlFlow::isElse(PHINode *Phi) { argument 173 BasicBlock *IDom = DT->getNode(Phi->getParent())->getIDom()->getBlock(); 174 for (unsigned i = 0, e = Phi->getNumIncomingValues(); i != e; ++i) { 175 if (Phi->getIncomingBlock(i) == IDom) { 177 if (Phi->getIncomingValue(i) != BoolTrue) 181 if (Phi->getIncomingValue(i) != BoolFalse) 189 // \brief Erase "Phi" if it is not used any more 190 void SIAnnotateControlFlow::eraseIfUnused(PHINode *Phi) { argument 339 PHINode *Phi = dyn_cast<PHINode>(Term->getCondition()); local [all...] |
/external/clang/lib/Analysis/ |
H A D | ThreadSafetyTIL.cpp | 61 if (Phi* Ph = dyn_cast<Phi>(E)) { 73 if (Phi* Ph = dyn_cast<Phi>(E)) { 81 // Phi nodes to find the canonical definition. 90 if (const Phi *Ph = dyn_cast<Phi>(E)) { 91 if (Ph->status() == Phi::PH_SingleVal) { 103 // Phi nodes to find the canonical definition. 104 // The non-const version will simplify incomplete Phi node [all...] |
H A D | ThreadSafetyCommon.cpp | 60 // Return true if E is a variable that points to an incomplete Phi node. 62 if (const auto *Ph = dyn_cast<til::Phi>(E)) 63 return Ph->status() == til::Phi::PH_Incomplete; 310 if (auto *Ph = dyn_cast<til::Phi>(E)) 689 // Make a Phi node in the current block for the i^th variable in CurrentVarMap. 690 // If E != null, sets Phi[CurrentBlockInfo->ArgIndex] = E. 698 // We already have a Phi node in the current block, 699 // so just add the new variable to the Phi node. 700 til::Phi *Ph = dyn_cast<til::Phi>(Curr [all...] |
/external/llvm/lib/Transforms/Scalar/ |
H A D | PartiallyInlineLibCalls.cpp | 133 PHINode *Phi = Builder.CreatePHI(Call->getType(), 2); local 134 Call->replaceAllUsesWith(Phi); 154 Phi->addIncoming(Call, &CurrBB); 155 Phi->addIncoming(LibCall, LibCallBB);
|
H A D | IndVarSimplify.cpp | 578 // Do not count the Phi as a use. LCSSA may have inserted 759 assert(L->getHeader() == OrigPhi->getParent() && "Phi must be an IV"); 1329 PHINode *Phi = dyn_cast<PHINode>(IncI->getOperand(0)); local 1330 if (Phi && Phi->getParent() == L->getHeader()) { 1332 return Phi; 1339 Phi = dyn_cast<PHINode>(IncI->getOperand(1)); 1340 if (Phi && Phi->getParent() == L->getHeader()) { 1342 return Phi; 1384 PHINode *Phi = dyn_cast<PHINode>(LHS); local 1445 AlmostDeadIV(PHINode *Phi, BasicBlock *LatchBlock, Value *Cond) argument 1484 PHINode *Phi = cast<PHINode>(I); local [all...] |
H A D | StructurizeCFG.cpp | 568 PHINode &Phi = cast<PHINode>(*I++); local 569 while (Phi.getBasicBlockIndex(From) != -1) { 570 Value *Deleted = Phi.removeIncomingValue(From, false); 571 Map[&Phi].push_back(std::make_pair(From, Deleted)); 581 PHINode &Phi = cast<PHINode>(*I++); local 582 Value *Undef = UndefValue::get(Phi.getType()); 583 Phi.addIncoming(Undef, From); 604 PHINode *Phi = PI->first; local 605 Value *Undef = UndefValue::get(Phi->getType()); 606 Updater.Initialize(Phi [all...] |
H A D | GVN.cpp | 2589 PHINode *Phi = local 2594 Phi->addIncoming(V, predMap[i].second); 2596 Phi->addIncoming(PREInstr, PREPred); 2599 VN.add(Phi, ValNo); 2600 addToLeaderTable(ValNo, Phi, CurrentBlock); 2601 Phi->setDebugLoc(CurInst->getDebugLoc()); 2602 CurInst->replaceAllUsesWith(Phi); 2603 if (Phi->getType()->getScalarType()->isPointerTy()) { 2607 for (unsigned ii = 0, ee = Phi->getNumIncomingValues(); ii != ee; ++ii) { 2609 VN.getAliasAnalysis()->addEscapingUse(Phi 2800 PHINode &Phi = cast<PHINode>(*II); local [all...] |
H A D | LoopIdiomRecognize.cpp | 422 PHINode *Phi = dyn_cast<PHINode>(Inst->getOperand(0)); local 423 if (!Phi || Phi->getParent() != LoopEntry) 436 CountPhi = Phi;
|
/external/llvm/lib/Analysis/ |
H A D | ScalarEvolutionExpander.cpp | 917 // Check that the chain of IV operands leading back to Phi can be hoisted. 1000 const SCEVAddRecExpr *Phi, 1003 Type *PhiTy = SE.getEffectiveSCEVType(Phi->getType()); 1010 Phi = dyn_cast<SCEVAddRecExpr>(SE.getTruncateOrNoop(Phi, RequestedTy)); 1011 if (!Phi) 1015 if (Phi == Requested) { 1022 SE.getNegativeSCEV(Requested)) == Phi) { 1691 PHINode *Phi = dyn_cast<PHINode>(I); ++I) { 1692 Phis.push_back(Phi); 999 canBeCheaplyTransformed(ScalarEvolution &SE, const SCEVAddRecExpr *Phi, const SCEVAddRecExpr *Requested, bool &InvertStep) argument 1709 PHINode *Phi = *PIter; local [all...] |
/external/llvm/lib/Transforms/Vectorize/ |
H A D | LoopVectorize.cpp | 823 /// Returns True, if 'Phi' is the kind of reduction variable for type 825 bool AddReductionVar(PHINode *Phi, ReductionKind Kind); 837 /// Returns the induction kind of Phi and record the step. This function may 839 InductionKind isInductionVariable(PHINode *Phi, ConstantInt *&StepValue); 1629 PHINode *Phi = dyn_cast_or_null<PHINode>(Ptr); 1630 if (Phi && Inductions.count(Phi)) { 1631 InductionInfo II = Inductions[Phi]; 1643 Phi = dyn_cast<PHINode>(GpPtr); 1644 if (Phi 3429 PHINode *Phi = dyn_cast<PHINode>(I); local 4052 AddReductionVar(PHINode *Phi, ReductionKind Kind) argument 4320 isInductionPHI(PHINode *Phi, ScalarEvolution *SE, ConstantInt *&StepValue) argument 4364 isInductionVariable(PHINode *Phi, ConstantInt *&StepValue) argument [all...] |
/external/v8/src/compiler/ |
H A D | change-lowering.cc | 115 common()->Phi(static_cast<MachineType>(kTypeBool | kRepTagged), 2), 154 Node* phi = graph()->NewNode(common()->Phi(kMachAnyTagged, 2), heap_number, 181 common()->Phi((signedness == kSigned) ? kMachInt32 : kMachUint32, 2), 205 graph()->NewNode(common()->Phi(kMachFloat64, 2), load, number, merge); 232 Node* phi = graph()->NewNode(common()->Phi(kMachAnyTagged, 2), smi,
|
H A D | raw-machine-assembler.h | 393 Node* Phi(MachineType type, Node* n1, Node* n2) { function in class:v8::internal::compiler::RawMachineAssembler 394 return NewNode(common()->Phi(type, 2), n1, n2); 396 Node* Phi(MachineType type, Node* n1, Node* n2, Node* n3) { function in class:v8::internal::compiler::RawMachineAssembler 397 return NewNode(common()->Phi(type, 3), n1, n2, n3); 399 Node* Phi(MachineType type, Node* n1, Node* n2, Node* n3, Node* n4) { function in class:v8::internal::compiler::RawMachineAssembler 400 return NewNode(common()->Phi(type, 4), n1, n2, n3, n4);
|
H A D | common-operator.h | 93 const Operator* Phi(MachineType type, int arguments);
|
H A D | graph-builder.cc | 145 // Introduce Phi nodes for values that have differing input at merge points, 146 // potentially extending an existing Phi node if possible. 165 const Operator* phi_op = common()->Phi(kMachAnyTagged, count); 210 // Phi already exists, add input. 214 // Phi does not exist yet, introduce one. 227 // Phi already exists, add input. 228 value->set_op(common()->Phi(kMachAnyTagged, inputs)); 231 // Phi does not exist yet, introduce one.
|
H A D | common-operator.cc | 176 const Operator* CommonOperatorBuilder::Phi(MachineType type, int arguments) { function in class:v8::internal::compiler::CommonOperatorBuilder 179 arguments, 1, "Phi", type);
|
H A D | js-builtin-reducer.cc | 134 value = graph()->NewNode(common()->Phi(kMachNone, 2), p, value, merge);
|
H A D | opcodes.h | 35 V(Phi) \
|
/external/llvm/lib/Target/Hexagon/ |
H A D | HexagonHardwareLoops.cpp | 340 MachineInstr *Phi = &*I; local 345 for (unsigned i = 1, n = Phi->getNumOperands(); i < n; i += 2) { 346 if (Phi->getOperand(i+1).getMBB() != Latch) 349 unsigned PhiOpReg = Phi->getOperand(i).getReg(); 358 if (MRI->getVRegDef(IndReg) == Phi) { 1262 MachineInstr *Phi = &*I; local 1265 for (unsigned i = 1, n = Phi->getNumOperands(); i < n; i += 2) { 1266 if (Phi->getOperand(i+1).getMBB() != Latch) 1269 unsigned PhiReg = Phi->getOperand(i).getReg(); 1278 if (MRI->getVRegDef(IndReg) == Phi) { [all...] |
/external/clang/include/clang/Analysis/Analyses/ |
H A D | ThreadSafetyCommon.h | 487 std::vector<til::Phi*> CurrentArguments; 489 std::vector<til::Phi*> IncompleteArgs;
|
H A D | ThreadSafetyTIL.h | 1295 /// Phi Node, for code in SSA form. 1296 /// Each Phi node has an array of possible values that it can take, 1298 class Phi : public SExpr { class in namespace:clang::threadSafety 1302 // In minimal SSA form, all Phi nodes are MultiVal. 1303 // During conversion to SSA, incomplete Phi nodes may be introduced, which 1306 PH_MultiVal = 0, // Phi node has multiple distinct values. (Normal) 1307 PH_SingleVal, // Phi node has one distinct value, and can be eliminated 1308 PH_Incomplete // Phi node is incomplete 1313 Phi() function in class:clang::threadSafety::Phi 1315 Phi(MemRegionRe function in class:clang::threadSafety::Phi 1317 Phi(const Phi &P, ValArray &&Vs) function in class:clang::threadSafety::Phi [all...] |
H A D | ThreadSafetyTraverse.h | 136 // SExprs of variable arity, such as Phi, Goto, and SCFG. 233 R_SExpr reducePhi(Phi &Orig, Container<R_SExpr> &As) { 828 void printPhi(const Phi *E, StreamType &SS) { 830 if (E->status() == Phi::PH_SingleVal)
|
/external/llvm/lib/Transforms/Utils/ |
H A D | LoopUnroll.cpp | 459 PHINode *Phi = dyn_cast<PHINode>(BBI); ++BBI) { 460 Phi->removeIncomingValue(BB, false);
|