HomeSort by relevance Sort by last modified time
    Searched refs:NewPhi (Results 1 - 9 of 9) sorted by null

  /external/llvm/lib/Target/AMDGPU/
SIAnnotateControlFlow.cpp 222 PHINode *NewPhi = PHINode::Create(Int64, 0, "", &Parent->front());
223 Value *Ret = NewPhi;
230 NewPhi->addIncoming(Broken, From);
236 NewPhi->addIncoming(PhiArg, From);
251 Value *Args[] = { OldEnd->getArgOperand(0), NewPhi };
258 NewPhi->setIncomingValue(i, PhiArg);
  /external/llvm/lib/Transforms/InstCombine/
InstCombinePHI.cpp 465 PHINode *NewPhi = PHINode::Create(NarrowType, NumIncomingValues,
468 NewPhi->addIncoming(NewIncoming[i], Phi.getIncomingBlock(i));
470 InsertNewInstBefore(NewPhi, Phi);
471 return CastInst::CreateZExtOrBitCast(NewPhi, Phi.getType());
    [all...]
  /external/v8/src/compiler/
bytecode-graph-builder.h 101 Node* NewPhi(int count, Node* input, Node* control);
ast-graph-builder.h 212 Node* NewPhi(int count, Node* input, Node* control);
bytecode-graph-builder.cc 283 context_ = builder()->NewPhi(1, context_, control);
286 values()->at(i) = builder()->NewPhi(1, values()->at(i), control);
    [all...]
ast-graph-builder.cc     [all...]
  /external/v8/test/unittests/compiler/
loop-peeling-unittest.cc 121 Node* NewPhi(While* w, Node* a, Node* b) {
274 Node* phi = NewPhi(&outer, Int32Constant(11), c.phi);
  /external/llvm/lib/Transforms/Vectorize/
SLPVectorizer.cpp     [all...]
  /art/compiler/optimizing/
bounds_check_elimination.cc     [all...]

Completed in 356 milliseconds