| /external/llvm/lib/CodeGen/SelectionDAG/ |
| StatepointLowering.cpp | 146 // All incoming values should have same known stack slot, otherwise result
196 /// Try to find existing copies of the incoming values in stack slots used for
197 /// statepoint spilling. If we can find a spill slot for the incoming value,
204 SDValue Incoming = Builder.getValue(IncomingValue);
206 if (isa<ConstantSDNode>(Incoming) || isa<FrameIndexSDNode>(Incoming)) {
212 SDValue OldLocation = Builder.StatepointLowering.getLocation(Incoming);
245 SDValue Loc = Builder.DAG.getTargetFrameIndex(*Index, Incoming.getValueType());
246 Builder.StatepointLowering.setLocation(Incoming, Loc);
391 /// Bases - base pointers incoming to this statepoin
[all...] |
| LegalizeIntegerTypes.cpp | [all...] |
| /external/webrtc/webrtc/p2p/base/ |
| tcpport.h | 81 // Accepts incoming TCP connection.
86 struct Incoming {
113 std::list<Incoming> incoming_;
|
| tcpport.cc | 13 * passive side just waits for an incoming connection.
120 std::list<Incoming>::iterator it;
139 // We can't accept TCP connections incoming on other ports
185 // recognize our incoming TCP connections. According to
256 Incoming incoming; local
257 incoming.addr = new_socket->GetRemoteAddress();
258 incoming.socket = new_socket;
259 incoming.socket->SignalReadPacket.connect(this, &TCPPort::OnReadPacket);
260 incoming.socket->SignalReadyToSend.connect(this, &TCPPort::OnReadyToSend)
[all...] |
| /external/llvm/lib/Target/AMDGPU/ |
| SIAnnotateControlFlow.cpp | 225 // Handle all non-constant incoming values first
227 Value *Incoming = Phi->getIncomingValue(i);
229 if (isa<ConstantInt>(Incoming)) {
235 Value *PhiArg = handleLoopCondition(Incoming, Broken, L);
243 Value *Incoming = Phi->getIncomingValue(i);
244 if (Incoming != BoolTrue)
|
| /packages/apps/Gallery2/src/com/android/gallery3d/app/ |
| StateManager.java | 63 StateTransitionAnimation.Transition.Incoming);
93 StateTransitionAnimation.Transition.Incoming);
238 StateTransitionAnimation.Transition.Incoming);
|
| /external/llvm/lib/Transforms/Scalar/ |
| CorrelatedValuePropagation.cpp | 109 Value *Incoming = P->getIncomingValue(i);
110 if (isa<Constant>(Incoming)) continue;
112 Value *V = LVI->getConstantOnEdge(Incoming, P->getIncomingBlock(i), BB, P);
114 // Look if the incoming value is a select with a scalar condition for which
115 // LVI can tells us the value. In that case replace the incoming value with
119 SelectInst *SI = dyn_cast<SelectInst>(Incoming);
136 // Look if the select has a constant but LVI tells us that the incoming
137 // value can never be that constant. In that case replace the incoming
225 /// on that edge. Cases that cannot fire no matter what the incoming edge can
226 /// safely be removed. If a case fires on every incoming edge then the entir
[all...] |
| IndVarSimplify.cpp | 217 /// common dominator for the incoming blocks.
284 // Check incoming value.
504 unsigned Ith; // Ith incoming value.
563 // We would like to be able to RAUW single-incoming value PHI nodes. We
740 Value *Incoming = P->getIncomingValueForBlock(ExitingBlocks[0]);
742 // If the Incoming value of P is found in RewritePhiSet, we know it
748 if (Phi.PN == P && (Phi.PN)->getIncomingValue(i) == Incoming) {
755 if (!found && (I = dyn_cast<Instruction>(Incoming)))
[all...] |
| LoopInterchange.cpp | 724 // Reduction lcssa phi will have only 1 incoming block that from loop latch.
730 // Incoming value for lcssa phi's in outer loop exit can only be inner loop
[all...] |
| /packages/apps/Gallery2/src/com/android/gallery3d/anim/ |
| StateTransitionAnimation.java | 32 public static final Spec INCOMING;
64 INCOMING = new Spec();
65 INCOMING.overlayAlphaFrom = 1f;
66 INCOMING.overlayAlphaTo = 0f;
67 INCOMING.overlayScaleFrom = 1f;
68 INCOMING.overlayScaleTo = 3f;
69 INCOMING.contentAlphaFrom = 0f;
70 INCOMING.contentAlphaTo = 1f;
71 INCOMING.contentScaleFrom = 0.25f;
72 INCOMING.contentScaleTo = 1f
[all...] |
| /external/llvm/lib/Analysis/ |
| LoopInfo.cpp | 145 BasicBlock *Incoming = nullptr, *Backedge = nullptr;
151 Incoming = *PI++;
154 if (contains(Incoming)) {
157 std::swap(Incoming, Backedge);
165 dyn_cast<ConstantInt>(PN->getIncomingValueForBlock(Incoming)))
|
| InstructionSimplify.cpp | 449 /// it on the incoming phi values yields the same result for every value. If so
471 // Evaluate the BinOp on the incoming phi values.
473 for (Value *Incoming : PI->incoming_values()) {
474 // If the incoming value is the phi node itself, it can safely be skipped.
475 if (Incoming == PI) continue;
477 SimplifyBinOp(Opcode, Incoming, RHS, Q, MaxRecurse) :
478 SimplifyBinOp(Opcode, LHS, Incoming, Q, MaxRecurse);
491 /// incoming phi values yields the same result every time. If so returns the
511 // Evaluate the BinOp on the incoming phi values.
513 for (Value *Incoming : PI->incoming_values())
[all...] |
| LazyValueInfo.cpp | [all...] |
| ConstantFolding.cpp | [all...] |
| /external/llvm/lib/Transforms/Utils/ |
| LoopUnroll.cpp | 92 // incoming edges. This occurs when there are multiple edges from
351 // the incoming values from the previous block.
375 Value *Incoming = phi->getIncomingValueForBlock(*BB);
376 ValueToValueMapTy::iterator It = LastValueMap.find(Incoming);
378 Incoming = It->second;
379 phi->addIncoming(Incoming, New);
399 // Loop over the PHI nodes in the original block, setting incoming values.
|
| SimplifyIndVar.cpp | 204 for (Value *Incoming : cast<PHINode>(IVOperand)->incoming_values()) {
208 const SCEV *IncomingS = SE->getSCEV(Incoming);
211 NewLHS = Incoming;
213 NewRHS = Incoming;
|
| /external/llvm/lib/Transforms/ObjCARC/ |
| ObjCARCOpts.cpp | 837 // If Arg is a PHI, and one or more incoming values to the
840 // could be pushed up to just those paths with non-null incoming values.
852 // Determine if the PHI has any null operands, or any incoming
857 Value *Incoming =
859 if (IsNullOrUndef(Incoming))
[all...] |
| /external/llvm/bindings/ocaml/llvm/ |
| llvm_ocaml.c | [all...] |
| /external/llvm/lib/Transforms/Vectorize/ |
| SLPVectorizer.cpp | [all...] |
| /external/llvm/lib/Target/Hexagon/ |
| HexagonHardwareLoops.cpp | 536 "Loop must have more than one incoming edge!");
540 MachineBasicBlock *Incoming = *PI++;
544 // Make sure there is one incoming and one backedge and determine which
546 if (L->contains(Incoming)) {
549 std::swap(Incoming, Backedge);
[all...] |
| /external/mdnsresponder/mDNSCore/ |
| uDNS.c | [all...] |
