HomeSort by relevance Sort by last modified time
    Searched defs:PHI (Results 1 - 25 of 57) sorted by null

1 2 3

  /external/swiftshader/third_party/LLVM/include/llvm/Target/
TargetOpcodes.h 26 PHI = 0,
  /device/google/contexthub/firmware/os/algos/calibration/accelerometer/
accel_cal.c 31 #define PHI 0.707f // = 1/sqrt(2) gives a 45 degree angle for sorting data.
66 if (PHI < asd->mean_x) {
74 if (PHI < asd->mean_y) {
90 if (PHI > asd->mean_x && PHIb < asd->mean_x && PHI > asd->mean_y &&
293 if (PHI < asd->mean_x && ac1->agd.nx < ac1->agd.nfx) {
307 if (PHI < asd->mean_y && ac1->agd.ny < ac1->agd.nfy) {
335 if (PHI > asd->mean_x && PHIb < asd->mean_x && PHI > asd->mean_y &&
  /external/llvm/include/llvm/Transforms/Utils/
SSAUpdaterImpl.h 282 /// dominating definitions for non-PHI blocks.
292 // If this block already needs a PHI, there is nothing to do here.
300 // Need a PHI here.
315 /// FindAvailableVal - If this block requires a PHI, first check if an
316 /// existing PHI matches the PHI placement and reaching definitions computed
317 /// earlier, and if not, create a new PHI. Visit all the block's
319 /// the incoming values for a new PHI.
327 // Check if there needs to be a PHI in BB.
331 // Look for an existing PHI
    [all...]
  /external/llvm/lib/CodeGen/
MachineSSAUpdater.cpp 50 /// updates. ProtoValue is the value used to name PHI nodes.
109 /// InsertNewDef - Insert an empty PHI or IMPLICIT_DEF instruction which define
138 /// a block. Because of this, we need to insert a new PHI node in SomeBB to
180 // If an identical PHI is already in BB, just reuse it.
185 // Otherwise, we do need a PHI: insert one now.
187 MachineInstrBuilder InsertedPHI = InsertNewDef(TargetOpcode::PHI, BB,
190 // Fill in all the predecessors of the PHI.
194 // See if the PHI node can be merged to a single value. This can happen in
195 // loop cases when we get a PHI of itself and one other value.
204 DEBUG(dbgs() << " Inserted PHI: " << *InsertedPHI << "\n")
    [all...]
  /external/llvm/lib/Target/NVPTX/
NVPTXInferAddressSpaces.cpp 61 // %y = phi [ %generic.input, %y2 ]
69 // All address expressions (our implementation only considers phi, bitcast,
84 // %y' = phi float addrspace(3)* [ %input, undef ]
88 // %y' = phi float addrspace(3)* [ %input, %y2' ]
158 // TODO: Currently, we consider only phi, bitcast, addrspacecast, and
165 case Instruction::PHI:
182 case Instruction::PHI: {
305 case Instruction::PHI: {
307 PHINode *PHI = cast<PHINode>(I);
308 PHINode *NewPHI = PHINode::Create(NewPtrType, PHI->getNumIncomingValues())
    [all...]
  /external/llvm/lib/Transforms/Utils/
FlattenCFG.cpp 125 PHINode *PHI = dyn_cast<PHINode>(BB->begin());
126 if (PHI)
127 return false; // For simplicity, avoid cases containing PHI nodes.
262 // PS2 should not contain PHI node.
263 PHI = dyn_cast<PHINode>(PS2->begin());
264 if (PHI)
SSAUpdater.cpp 65 static bool IsEquivalentPHI(PHINode *PHI,
67 unsigned PHINumValues = PHI->getNumIncomingValues();
71 // Scan the phi to see if it matches.
73 if (ValueMapping[PHI->getIncomingBlock(i)] !=
74 PHI->getIncomingValue(i)) {
98 // is relatively slow. If we already have PHI nodes in this block, walk one
136 // Otherwise, we do need a PHI: check to see if we already have one available
153 // Fill in all the predecessors of the PHI.
157 // See if the PHI node can be merged to a single value. This can happen in
158 // loop cases when we get a PHI of itself and one other value
    [all...]
  /external/swiftshader/third_party/LLVM/include/llvm/Transforms/Utils/
SSAUpdaterImpl.h 271 /// dominating definitions for non-PHI blocks.
281 // If this block already needs a PHI, there is nothing to do here.
289 // Need a PHI here.
304 /// FindAvailableVal - If this block requires a PHI, first check if an
305 /// existing PHI matches the PHI placement and reaching definitions computed
306 /// earlier, and if not, create a new PHI. Visit all the block's
308 /// the incoming values for a new PHI.
316 // Check if there needs to be a PHI in BB.
320 // Look for an existing PHI
    [all...]
  /external/swiftshader/third_party/LLVM/lib/CodeGen/
MachineSSAUpdater.cpp 49 /// updates. ProtoValue is the value used to name PHI nodes.
108 /// InsertNewDef - Insert an empty PHI or IMPLICIT_DEF instruction which define
137 /// a block. Because of this, we need to insert a new PHI node in SomeBB to
179 // If an identical PHI is already in BB, just reuse it.
184 // Otherwise, we do need a PHI: insert one now.
186 MachineInstr *InsertedPHI = InsertNewDef(TargetOpcode::PHI, BB,
189 // Fill in all the predecessors of the PHI.
194 // See if the PHI node can be merged to a single value. This can happen in
195 // loop cases when we get a PHI of itself and one other value.
204 DEBUG(dbgs() << " Inserted PHI: " << *InsertedPHI << "\n")
    [all...]
  /prebuilts/clang/host/darwin-x86/clang-4053586/prebuilt_include/llvm/include/llvm/Transforms/Utils/
SSAUpdaterImpl.h 281 /// dominating definitions for non-PHI blocks.
291 // If this block already needs a PHI, there is nothing to do here.
299 // Need a PHI here.
314 /// FindAvailableVal - If this block requires a PHI, first check if an
315 /// existing PHI matches the PHI placement and reaching definitions computed
316 /// earlier, and if not, create a new PHI. Visit all the block's
318 /// the incoming values for a new PHI.
326 // Check if there needs to be a PHI in BB.
330 // Look for an existing PHI
    [all...]
  /prebuilts/clang/host/darwin-x86/clang-4393122/include/llvm/Transforms/Utils/
SSAUpdaterImpl.h 281 /// dominating definitions for non-PHI blocks.
291 // If this block already needs a PHI, there is nothing to do here.
299 // Need a PHI here.
314 /// FindAvailableVal - If this block requires a PHI, first check if an
315 /// existing PHI matches the PHI placement and reaching definitions computed
316 /// earlier, and if not, create a new PHI. Visit all the block's
318 /// the incoming values for a new PHI.
326 // Check if there needs to be a PHI in BB.
330 // Look for an existing PHI
    [all...]
  /prebuilts/clang/host/darwin-x86/clang-4479392/include/llvm/Transforms/Utils/
SSAUpdaterImpl.h 281 /// dominating definitions for non-PHI blocks.
291 // If this block already needs a PHI, there is nothing to do here.
299 // Need a PHI here.
314 /// FindAvailableVal - If this block requires a PHI, first check if an
315 /// existing PHI matches the PHI placement and reaching definitions computed
316 /// earlier, and if not, create a new PHI. Visit all the block's
318 /// the incoming values for a new PHI.
326 // Check if there needs to be a PHI in BB.
330 // Look for an existing PHI
    [all...]
  /prebuilts/clang/host/darwin-x86/clang-4579689/include/llvm/Transforms/Utils/
SSAUpdaterImpl.h 294 /// dominating definitions for non-PHI blocks.
304 // If this block already needs a PHI, there is nothing to do here.
312 // Need a PHI here.
327 /// FindAvailableVal - If this block requires a PHI, first check if an
328 /// existing PHI matches the PHI placement and reaching definitions computed
329 /// earlier, and if not, create a new PHI. Visit all the block's
331 /// the incoming values for a new PHI.
339 // Check if there needs to be a PHI in BB.
343 // Look for an existing PHI
    [all...]
  /prebuilts/clang/host/darwin-x86/clang-4630689/include/llvm/Transforms/Utils/
SSAUpdaterImpl.h 294 /// dominating definitions for non-PHI blocks.
304 // If this block already needs a PHI, there is nothing to do here.
312 // Need a PHI here.
327 /// FindAvailableVal - If this block requires a PHI, first check if an
328 /// existing PHI matches the PHI placement and reaching definitions computed
329 /// earlier, and if not, create a new PHI. Visit all the block's
331 /// the incoming values for a new PHI.
339 // Check if there needs to be a PHI in BB.
343 // Look for an existing PHI
    [all...]
  /prebuilts/clang/host/darwin-x86/clang-4639204/include/llvm/Transforms/Utils/
SSAUpdaterImpl.h 294 /// dominating definitions for non-PHI blocks.
304 // If this block already needs a PHI, there is nothing to do here.
312 // Need a PHI here.
327 /// FindAvailableVal - If this block requires a PHI, first check if an
328 /// existing PHI matches the PHI placement and reaching definitions computed
329 /// earlier, and if not, create a new PHI. Visit all the block's
331 /// the incoming values for a new PHI.
339 // Check if there needs to be a PHI in BB.
343 // Look for an existing PHI
    [all...]
  /prebuilts/clang/host/darwin-x86/clang-4691093/include/llvm/Transforms/Utils/
SSAUpdaterImpl.h 294 /// dominating definitions for non-PHI blocks.
304 // If this block already needs a PHI, there is nothing to do here.
312 // Need a PHI here.
327 /// FindAvailableVal - If this block requires a PHI, first check if an
328 /// existing PHI matches the PHI placement and reaching definitions computed
329 /// earlier, and if not, create a new PHI. Visit all the block's
331 /// the incoming values for a new PHI.
339 // Check if there needs to be a PHI in BB.
343 // Look for an existing PHI
    [all...]
  /prebuilts/clang/host/linux-x86/clang-4053586/prebuilt_include/llvm/include/llvm/Transforms/Utils/
SSAUpdaterImpl.h 281 /// dominating definitions for non-PHI blocks.
291 // If this block already needs a PHI, there is nothing to do here.
299 // Need a PHI here.
314 /// FindAvailableVal - If this block requires a PHI, first check if an
315 /// existing PHI matches the PHI placement and reaching definitions computed
316 /// earlier, and if not, create a new PHI. Visit all the block's
318 /// the incoming values for a new PHI.
326 // Check if there needs to be a PHI in BB.
330 // Look for an existing PHI
    [all...]
  /prebuilts/clang/host/linux-x86/clang-4393122/include/llvm/Transforms/Utils/
SSAUpdaterImpl.h 281 /// dominating definitions for non-PHI blocks.
291 // If this block already needs a PHI, there is nothing to do here.
299 // Need a PHI here.
314 /// FindAvailableVal - If this block requires a PHI, first check if an
315 /// existing PHI matches the PHI placement and reaching definitions computed
316 /// earlier, and if not, create a new PHI. Visit all the block's
318 /// the incoming values for a new PHI.
326 // Check if there needs to be a PHI in BB.
330 // Look for an existing PHI
    [all...]
  /prebuilts/clang/host/linux-x86/clang-4479392/include/llvm/Transforms/Utils/
SSAUpdaterImpl.h 281 /// dominating definitions for non-PHI blocks.
291 // If this block already needs a PHI, there is nothing to do here.
299 // Need a PHI here.
314 /// FindAvailableVal - If this block requires a PHI, first check if an
315 /// existing PHI matches the PHI placement and reaching definitions computed
316 /// earlier, and if not, create a new PHI. Visit all the block's
318 /// the incoming values for a new PHI.
326 // Check if there needs to be a PHI in BB.
330 // Look for an existing PHI
    [all...]
  /prebuilts/clang/host/linux-x86/clang-4579689/include/llvm/Transforms/Utils/
SSAUpdaterImpl.h 294 /// dominating definitions for non-PHI blocks.
304 // If this block already needs a PHI, there is nothing to do here.
312 // Need a PHI here.
327 /// FindAvailableVal - If this block requires a PHI, first check if an
328 /// existing PHI matches the PHI placement and reaching definitions computed
329 /// earlier, and if not, create a new PHI. Visit all the block's
331 /// the incoming values for a new PHI.
339 // Check if there needs to be a PHI in BB.
343 // Look for an existing PHI
    [all...]
  /prebuilts/clang/host/linux-x86/clang-4630689/include/llvm/Transforms/Utils/
SSAUpdaterImpl.h 294 /// dominating definitions for non-PHI blocks.
304 // If this block already needs a PHI, there is nothing to do here.
312 // Need a PHI here.
327 /// FindAvailableVal - If this block requires a PHI, first check if an
328 /// existing PHI matches the PHI placement and reaching definitions computed
329 /// earlier, and if not, create a new PHI. Visit all the block's
331 /// the incoming values for a new PHI.
339 // Check if there needs to be a PHI in BB.
343 // Look for an existing PHI
    [all...]
  /prebuilts/clang/host/linux-x86/clang-4639204/include/llvm/Transforms/Utils/
SSAUpdaterImpl.h 294 /// dominating definitions for non-PHI blocks.
304 // If this block already needs a PHI, there is nothing to do here.
312 // Need a PHI here.
327 /// FindAvailableVal - If this block requires a PHI, first check if an
328 /// existing PHI matches the PHI placement and reaching definitions computed
329 /// earlier, and if not, create a new PHI. Visit all the block's
331 /// the incoming values for a new PHI.
339 // Check if there needs to be a PHI in BB.
343 // Look for an existing PHI
    [all...]
  /prebuilts/clang/host/linux-x86/clang-4691093/include/llvm/Transforms/Utils/
SSAUpdaterImpl.h 294 /// dominating definitions for non-PHI blocks.
304 // If this block already needs a PHI, there is nothing to do here.
312 // Need a PHI here.
327 /// FindAvailableVal - If this block requires a PHI, first check if an
328 /// existing PHI matches the PHI placement and reaching definitions computed
329 /// earlier, and if not, create a new PHI. Visit all the block's
331 /// the incoming values for a new PHI.
339 // Check if there needs to be a PHI in BB.
343 // Look for an existing PHI
    [all...]
  /external/llvm/lib/Transforms/Instrumentation/
IndirectCallPromotion.cpp 357 // Find the PHI in BB that have the CallResult as the operand.
361 PHINode *PHI = dyn_cast<PHINode>(&I);
362 if (!PHI)
364 int IX = PHI->getBasicBlockIndex(From);
367 Value *V = PHI->getIncomingValue(IX);
374 // This method fixes up PHI nodes in BB where BB is the UnwindDest of an
379 // so the PHI node's incoming BBs need to be fixed up accordingly.
385 PHINode *PHI = dyn_cast<PHINode>(&I);
386 if (!PHI)
388 int IX = PHI->getBasicBlockIndex(OrigBB)
    [all...]
  /external/llvm/lib/Transforms/Scalar/
LoopLoadElimination.cpp 389 // %x.storeforward = phi [%x.initial, %ph] [%y, %loop]
401 PHINode *PHI = PHINode::Create(Initial->getType(), 2, "store_forwarded",
403 PHI->addIncoming(Initial, PH);
404 PHI->addIncoming(Cand.Store->getOperand(0), L->getLoopLatch());
406 Cand.Load->replaceAllUsesWith(PHI);
427 // %x.storeforward = phi [%x.initial, %ph] [%y, %loop]

Completed in 601 milliseconds

1 2 3