| /external/llvm/include/llvm/Target/ |
| TargetOpcodes.h | 26 PHI = 0,
|
| /device/google/contexthub/firmware/src/algos/ |
| accel_cal.c | 26 #define PHI 0.707f // = 1/sqrt(2) gives a 45 degree angle for sorting data.
59 if (PHI < asd->mean_x) {
67 if (PHI < asd->mean_y) {
83 if (PHI > asd->mean_x && PHIb < asd->mean_x &&
84 PHI > asd->mean_y && PHIb < asd->mean_y &&
311 if (PHI < asd->mean_x && ac1->agd.nx < ac1->agd.nfx) {
325 if (PHI < asd->mean_y && ac1->agd.ny < ac1->agd.nfy) {
353 if (PHI > asd->mean_x && PHIb < asd->mean_x &&
354 PHI > asd->mean_y && PHIb < asd->mean_y &&
|
| /external/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...] |
| /external/llvm/lib/CodeGen/ |
| MachineSSAUpdater.cpp | 51 /// updates. ProtoValue is the value used to name PHI nodes.
110 /// InsertNewDef - Insert an empty PHI or IMPLICIT_DEF instruction which define
139 /// a block. Because of this, we need to insert a new PHI node in SomeBB to
181 // If an identical PHI is already in BB, just reuse it.
186 // Otherwise, we do need a PHI: insert one now.
188 MachineInstrBuilder InsertedPHI = InsertNewDef(TargetOpcode::PHI, BB,
191 // Fill in all the predecessors of the PHI.
195 // See if the PHI node can be merged to a single value. This can happen in
196 // loop cases when we get a PHI of itself and one other value.
205 DEBUG(dbgs() << " Inserted PHI: " << *InsertedPHI << "\n")
[all...] |
| EarlyIfConversion.cpp | 109 /// Information about each phi in the Tail block.
111 MachineInstr *PHI;
116 PHIInfo(MachineInstr *phi)
117 : PHI(phi), TReg(0), FReg(0), CondCycles(0), TCycles(0), FCycles(0) {}
147 /// Replace PHI instructions in Tail with selects.
150 /// Insert selects and rewrite PHI operands to use them.
412 // Find PHI operands corresponding to TPred and FPred.
413 for (unsigned i = 1; i != PI.PHI->getNumOperands(); i += 2) {
414 if (PI.PHI->getOperand(i+1).getMBB() == TPred
[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...] |
| InlineFunction.cpp | 73 PHINode *InnerEHValuesPHI; ///< PHI for EH values from landingpad insts.
80 // If there are PHI nodes in the unwind destination block, we need to keep
87 PHINode *PHI = cast<PHINode>(I);
88 UnwindDestPHIValues.push_back(PHI->getIncomingValueForBlock(InvokeBB));
112 /// Add incoming-PHI values to the unwind destination block for the given
121 PHINode *phi = cast<PHINode>(I); local
122 phi->addIncoming(UnwindDestPHIValues[i], src);
153 // Create a PHI for the exception values.
185 /// it rewrites them to be invokes that jump to InvokeDest and fills in the PHI
276 // Update any PHI nodes in the exceptional block to indicate that ther
[all...] |
| SimplifyCFG.cpp | 61 PHINodeFoldingThreshold("phi-node-folding-threshold", cl::Hidden, cl::init(2),
62 cl::desc("Control the amount of phi node folding to perform (default = 2)"));
106 // The first field contains the phi node that generates a result of the switch
108 // switch for that PHI.
164 // successor, and if that successor has a PHI node, and if *that* PHI node has
185 /// store all PHI nodes in common successors.
193 // We fold the unconditional branch if we can easily update all PHI nodes in
222 /// Update PHI nodes in Succ to indicate that there will now be entries in it
223 /// from the 'NewPred' block. The values that will be flowing into the PHI node
[all...] |
| /external/llvm/lib/Transforms/Scalar/ |
| LoopLoadElimination.cpp | 369 // %x.storeforward = phi [%x.initial, %ph] [%y, %loop]
381 PHINode *PHI = PHINode::Create(Initial->getType(), 2, "store_forwarded",
383 PHI->addIncoming(Initial, PH);
384 PHI->addIncoming(Cand.Store->getOperand(0), L->getLoopLatch());
386 Cand.Load->replaceAllUsesWith(PHI);
407 // %x.storeforward = phi [%x.initial, %ph] [%y, %loop]
|
| LoopUnrollPass.cpp | 568 auto *PHI = dyn_cast<PHINode>(&I);
569 if (!PHI)
572 // The loop header PHI nodes must have exactly two input: one from the
575 PHI->getNumIncomingValues() == 2 &&
578 Value *V = PHI->getIncomingValueForBlock(
584 SimplifiedInputValues.push_back({PHI, C});
[all...] |
| IndVarSimplify.cpp | 216 /// loop. For PHI nodes, there may be multiple uses, so compute the nearest
220 PHINode *PHI = dyn_cast<PHINode>(User);
221 if (!PHI)
225 for (unsigned i = 0, e = PHI->getNumIncomingValues(); i != e; ++i) {
226 if (PHI->getIncomingValue(i) != Def)
229 BasicBlock *InsertBB = PHI->getIncomingBlock(i);
237 assert(InsertPt && "Missing phi operand");
296 // If this is not an add of the PHI with a constantfp, or if the constant fp
500 // Collect information about PHI nodes which can be transformed in
551 // Because of LCSSA, these values will only occur in LCSSA PHI Nodes. Sca
[all...] |
| /external/clang/lib/CodeGen/ |
| CGVTables.cpp | 117 llvm::PHINode *PHI = CGF.Builder.CreatePHI(ReturnValue->getType(), 2);
118 PHI->addIncoming(ReturnValue, AdjustNotNull);
119 PHI->addIncoming(llvm::Constant::getNullValue(ReturnValue->getType()),
121 ReturnValue = PHI;
[all...] |
| CGAtomic.cpp | [all...] |
| CGExprCXX.cpp | [all...] |
| TargetInfo.cpp | 312 llvm::PHINode *PHI = CGF.Builder.CreatePHI(Addr1.getType(), 2, Name);
313 PHI->addIncoming(Addr1.getPointer(), Block1);
314 PHI->addIncoming(Addr2.getPointer(), Block2);
316 return Address(PHI, Align);
[all...] |
| CGClass.cpp | 351 // Build a phi if we needed a null check.
357 llvm::PHINode *PHI = Builder.CreatePHI(BasePtrTy, 2, "cast.result");
358 PHI->addIncoming(Value.getPointer(), notNullBB);
359 PHI->addIncoming(llvm::Constant::getNullValue(BasePtrTy), origBB);
360 Value = Address(PHI, Value.getAlignment());
408 // Produce a PHI if we had a null-check.
415 llvm::PHINode *PHI = Builder.CreatePHI(Value->getType(), 2);
416 PHI->addIncoming(Value, CastNotNull);
417 PHI->addIncoming(llvm::Constant::getNullValue(Value->getType()), CastNull);
418 Value = PHI;
[all...] |
| /external/speex/libspeex/ |
| mdf.c | 157 spx_word32_t *PHI; /* scratch */
464 st->PHI = (spx_word32_t*)speex_alloc(N*sizeof(spx_word32_t));
611 speex_free(st->PHI);
822 weighted_spectral_mul_conj(st->power_1, FLOAT_SHL(PSEUDOFLOAT(st->prop[j]),-15), &st->X[(j+1)*N*K+speak*N], st->E+chan*N, st->PHI, N);
824 st->W[chan*N*K*M + j*N*K + speak*N + i] += st->PHI[i];
[all...] |
| /external/llvm/bindings/ocaml/llvm/ |
| llvm.ml | 200 | PHI
[all...] |
| /external/llvm/lib/Transforms/Instrumentation/ |
| AddressSanitizer.cpp | [all...] |
| /external/google-tv-pairing-protocol/java/jar/ |
| bcprov-jdk15-143.jar | |
| /prebuilts/tools/common/m2/repository/org/bouncycastle/bcprov-jdk16/1.46/ |
| bcprov-jdk16-1.46.jar | |
| /prebuilts/devtools/tools/lib/ |
| bcprov-jdk15on-1.48.jar | |
| /prebuilts/tools/common/m2/repository/org/bouncycastle/bcprov-jdk15on/1.48/ |
| bcprov-jdk15on-1.48.jar | |
| /prebuilts/tools/common/offline-m2/org/bouncycastle/bcprov-jdk15on/1.48/ |
| bcprov-jdk15on-1.48.jar | |
