Searched refs:Phi (Results 1 - 25 of 39) sorted by relevance

12

/external/clang/lib/Analysis/
H A DThreadSafetyTIL.cpp56 if (Phi* Ph = dyn_cast<Phi>(V->definition())) {
67 if (Phi* Ph = dyn_cast<Phi>(V->definition())) {
93 // Phi nodes to find the canonical definition.
111 if (Phi *Ph = dyn_cast<Phi>(D)) {
112 if (Ph->status() == Phi::PH_Incomplete)
115 if (Ph->status() == Phi::PH_SingleVal) {
126 // Trace the arguments of an incomplete Phi nod
[all...]
H A DThreadSafetyCommon.cpp65 // Return true if E is a variable that points to an incomplete Phi node.
68 if (const auto *Ph = dyn_cast<Phi>(V->definition()))
69 return Ph->status() == Phi::PH_Incomplete;
492 // Make a Phi node in the current block for the i^th variable in CurrentVarMap.
493 // If E != null, sets Phi[CurrentBlockInfo->ArgIndex] = E.
501 // We already have a Phi node in the current block,
502 // so just add the new variable to the Phi node.
503 til::Phi *Ph = dyn_cast<til::Phi>(V->definition());
504 assert(Ph && "Expecting Phi nod
[all...]
/external/chromium_org/v8/test/cctest/compiler/
H A Dtest-phi-reducer.cc55 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 Dtest-scheduler.cc847 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 Dtest-run-machops.cc223 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 DSIAnnotateControlFlow.cpp75 bool isElse(PHINode *Phi);
77 void eraseIfUnused(PHINode *Phi);
168 bool SIAnnotateControlFlow::isElse(PHINode *Phi) { argument
169 BasicBlock *IDom = DT->getNode(Phi->getParent())->getIDom()->getBlock();
170 for (unsigned i = 0, e = Phi->getNumIncomingValues(); i != e; ++i) {
171 if (Phi->getIncomingBlock(i) == IDom) {
173 if (Phi->getIncomingValue(i) != BoolTrue)
177 if (Phi->getIncomingValue(i) != BoolFalse)
185 // \brief Erase "Phi" if it is not used any more
186 void SIAnnotateControlFlow::eraseIfUnused(PHINode *Phi) { argument
311 PHINode *Phi = dyn_cast<PHINode>(Term->getCondition()); local
[all...]
/external/llvm/lib/Transforms/Scalar/
H A DPartiallyInlineLibCalls.cpp127 PHINode *Phi = Builder.CreatePHI(Call->getType(), 2); local
128 Call->replaceAllUsesWith(Phi);
148 Phi->addIncoming(Call, &CurrBB);
149 Phi->addIncoming(LibCall, LibCallBB);
H A DIndVarSimplify.cpp577 // Do not count the Phi as a use. LCSSA may have inserted
745 assert(L->getHeader() == OrigPhi->getParent() && "Phi must be an IV");
1301 PHINode *Phi = dyn_cast<PHINode>(IncI->getOperand(0)); local
1302 if (Phi && Phi->getParent() == L->getHeader()) {
1304 return Phi;
1311 Phi = dyn_cast<PHINode>(IncI->getOperand(1));
1312 if (Phi && Phi->getParent() == L->getHeader()) {
1314 return Phi;
1356 PHINode *Phi = dyn_cast<PHINode>(LHS); local
1417 AlmostDeadIV(PHINode *Phi, BasicBlock *LatchBlock, Value *Cond) argument
1457 PHINode *Phi = cast<PHINode>(I); local
[all...]
H A DStructurizeCFG.cpp503 PHINode &Phi = cast<PHINode>(*I++); local
504 while (Phi.getBasicBlockIndex(From) != -1) {
505 Value *Deleted = Phi.removeIncomingValue(From, false);
506 Map[&Phi].push_back(std::make_pair(From, Deleted));
516 PHINode &Phi = cast<PHINode>(*I++); local
517 Value *Undef = UndefValue::get(Phi.getType());
518 Phi.addIncoming(Undef, From);
539 PHINode *Phi = PI->first; local
540 Value *Undef = UndefValue::get(Phi->getType());
541 Updater.Initialize(Phi
[all...]
H A DGVN.cpp2572 PHINode* Phi = PHINode::Create(CurInst->getType(), predMap.size(), local
2577 Phi->addIncoming(V, predMap[i].second);
2579 Phi->addIncoming(PREInstr, PREPred);
2582 VN.add(Phi, ValNo);
2583 addToLeaderTable(ValNo, Phi, CurrentBlock);
2584 Phi->setDebugLoc(CurInst->getDebugLoc());
2585 CurInst->replaceAllUsesWith(Phi);
2586 if (Phi->getType()->getScalarType()->isPointerTy()) {
2590 for (unsigned ii = 0, ee = Phi->getNumIncomingValues(); ii != ee;
2593 VN.getAliasAnalysis()->addEscapingUse(Phi
2764 PHINode &Phi = cast<PHINode>(*II); local
[all...]
/external/chromium_org/third_party/WebKit/PerformanceTests/SunSpider/tests/sunspider-0.9/
H A D3d-cube.js144 function RotateX(M, Phi) {
145 var a = Phi;
158 function RotateY(M, Phi) {
159 var a = Phi;
172 function RotateZ(M, Phi) {
173 var a = Phi;
/external/chromium_org/third_party/WebKit/PerformanceTests/SunSpider/tests/sunspider-0.9.1/
H A D3d-cube.js144 function RotateX(M, Phi) {
145 var a = Phi;
158 function RotateY(M, Phi) {
159 var a = Phi;
172 function RotateZ(M, Phi) {
173 var a = Phi;
/external/chromium_org/third_party/WebKit/PerformanceTests/SunSpider/tests/sunspider-1.0/
H A D3d-cube.js144 function RotateX(M, Phi) {
145 var a = Phi;
158 function RotateY(M, Phi) {
159 var a = Phi;
172 function RotateZ(M, Phi) {
173 var a = Phi;
/external/llvm/lib/Analysis/
H A DScalarEvolutionExpander.cpp953 // Check that the chain of IV operands leading back to Phi can be hoisted.
1036 const SCEVAddRecExpr *Phi,
1039 Type *PhiTy = SE.getEffectiveSCEVType(Phi->getType());
1046 Phi = dyn_cast<SCEVAddRecExpr>(SE.getTruncateOrNoop(Phi, RequestedTy));
1047 if (!Phi)
1051 if (Phi == Requested) {
1058 SE.getNegativeSCEV(Requested)) == Phi) {
1688 PHINode *Phi = dyn_cast<PHINode>(I); ++I) {
1689 Phis.push_back(Phi);
1035 canBeCheaplyTransformed(ScalarEvolution &SE, const SCEVAddRecExpr *Phi, const SCEVAddRecExpr *Requested, bool &InvertStep) argument
1706 PHINode *Phi = *PIter; local
[all...]
/external/chromium_org/v8/src/compiler/
H A Dchange-lowering.cc115 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 Draw-machine-assembler.h393 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 Dcommon-operator.h93 const Operator* Phi(MachineType type, int arguments);
H A Dgraph-builder.cc145 // 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 Dcommon-operator.cc176 const Operator* CommonOperatorBuilder::Phi(MachineType type, int arguments) { function in class:v8::internal::compiler::CommonOperatorBuilder
179 arguments, 1, "Phi", type);
H A Djs-builtin-reducer.cc134 value = graph()->NewNode(common()->Phi(kMachNone, 2), p, value, merge);
H A Dopcodes.h35 V(Phi) \
/external/llvm/lib/Transforms/Vectorize/
H A DLoopVectorize.cpp751 /// Returns True, if 'Phi' is the kind of reduction variable for type
753 bool AddReductionVar(PHINode *Phi, ReductionKind Kind);
765 /// Returns the induction kind of Phi. This function may return NoInduction
767 InductionKind isInductionVariable(PHINode *Phi);
1492 PHINode *Phi = dyn_cast_or_null<PHINode>(Ptr);
1493 if (Phi && Inductions.count(Phi)) {
1494 InductionInfo II = Inductions[Phi];
1509 Phi = dyn_cast<PHINode>(GpPtr);
1510 if (Phi
3298 PHINode *Phi = dyn_cast<PHINode>(I); local
[all...]
/external/llvm/lib/Target/Hexagon/
H A DHexagonHardwareLoops.cpp345 MachineInstr *Phi = &*I; local
350 for (unsigned i = 1, n = Phi->getNumOperands(); i < n; i += 2) {
351 if (Phi->getOperand(i+1).getMBB() != Latch)
354 unsigned PhiOpReg = Phi->getOperand(i).getReg();
363 if (MRI->getVRegDef(IndReg) == Phi) {
1267 MachineInstr *Phi = &*I; local
1270 for (unsigned i = 1, n = Phi->getNumOperands(); i < n; i += 2) {
1271 if (Phi->getOperand(i+1).getMBB() != Latch)
1274 unsigned PhiReg = Phi->getOperand(i).getReg();
1283 if (MRI->getVRegDef(IndReg) == Phi) {
[all...]
/external/clang/include/clang/Analysis/Analyses/
H A DThreadSafetyTraverse.h129 // SExprs of variable arity, such as Phi, Goto, and SCFG.
240 R_SExpr reducePhi(Phi &Orig, Container<R_SExpr> &As) {
241 return new (Arena) Phi(Orig, std::move(As.Elems));
373 R_SExpr reducePhi(Phi &Orig, Container<R_SExpr> &As) {
879 void printPhi(Phi *E, StreamType &SS) {
881 if (E->status() == Phi::PH_SingleVal)
/external/llvm/lib/Transforms/Utils/
H A DLoopUnroll.cpp414 PHINode *Phi = dyn_cast<PHINode>(BBI); ++BBI) {
415 Phi->removeIncomingValue(BB, false);

Completed in 378 milliseconds

12