HomeSort by relevance Sort by last modified time
    Searched refs:Incoming (Results 1 - 25 of 38) sorted by null

1 2

  /external/llvm/lib/CodeGen/SelectionDAG/
StatepointLowering.cpp 141 // All incoming values should have same known stack slot, otherwise result
191 /// Try to find existing copies of the incoming values in stack slots used for
192 /// statepoint spilling. If we can find a spill slot for the incoming value,
199 SDValue Incoming = Builder.getValue(IncomingValue);
201 if (isa<ConstantSDNode>(Incoming) || isa<FrameIndexSDNode>(Incoming)) {
207 SDValue OldLocation = Builder.StatepointLowering.getLocation(Incoming);
240 SDValue Loc = Builder.DAG.getTargetFrameIndex(*Index, Incoming.getValueType());
241 Builder.StatepointLowering.setLocation(Incoming, Loc);
324 /// Spill a value incoming to the statepoint. It might be either part o
    [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 250 // Handle all non-constant incoming values first
252 Value *Incoming = Phi->getIncomingValue(i);
254 if (isa<ConstantInt>(Incoming)) {
260 Value *PhiArg = handleLoopCondition(Incoming, Broken, L, Term);
268 Value *Incoming = Phi->getIncomingValue(i);
269 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 99 Value *Incoming = P->getIncomingValue(i);
100 if (isa<Constant>(Incoming)) continue;
102 Value *V = LVI->getConstantOnEdge(Incoming, P->getIncomingBlock(i), BB, P);
104 // Look if the incoming value is a select with a scalar condition for which
105 // LVI can tells us the value. In that case replace the incoming value with
109 SelectInst *SI = dyn_cast<SelectInst>(Incoming);
126 // Look if the select has a constant but LVI tells us that the incoming
127 // value can never be that constant. In that case replace the incoming
215 /// that cannot fire no matter what the incoming edge can safely be removed. If
216 /// a case fires on every incoming edge then the entire switch can be remove
    [all...]
LoopInterchange.cpp 722 // Reduction lcssa phi will have only 1 incoming block that from loop latch.
728 // Incoming value for lcssa phi's in outer loop exit can only be inner loop
    [all...]
  /external/swiftshader/third_party/LLVM/lib/Transforms/Utils/
LoopUnroll.cpp 79 // incoming edges. This occurs when there are multiple edges from
253 // incoming values from the previous block.
280 Value *Incoming = phi->getIncomingValueForBlock(*BB);
281 ValueToValueMapTy::iterator It = LastValueMap.find(Incoming);
283 Incoming = It->second;
284 phi->addIncoming(Incoming, New);
304 // Loop over the PHI nodes in the original block, setting incoming values.
  /external/swiftshader/third_party/LLVM/lib/Transforms/Scalar/
CorrelatedValuePropagation.cpp 95 Value *Incoming = P->getIncomingValue(i);
96 if (isa<Constant>(Incoming)) continue;
139 /// incoming edges, then it's true universally and we can simplify the compare.
  /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 113 BasicBlock *Incoming = nullptr, *Backedge = nullptr;
119 Incoming = *PI++;
122 if (contains(Incoming)) {
125 std::swap(Incoming, Backedge);
133 dyn_cast<ConstantInt>(PN->getIncomingValueForBlock(Incoming)))
InstructionSimplify.cpp 448 /// try to simplify the binop by seeing whether evaluating it on the incoming
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);
490 /// comparison by seeing whether comparing with all of the incoming phi values
511 // Evaluate the BinOp on the incoming phi values.
513 for (Value *Incoming : PI->incoming_values())
    [all...]
  /external/llvm/lib/Transforms/Utils/
SimplifyIndVar.cpp 205 // If this is a value incoming from the backedge, then it cannot be a loop
236 Value *Incoming = PN->getIncomingValue(i);
239 if (auto *I = dyn_cast<Instruction>(Incoming))
243 const SCEV *IncomingS = SE->getSCEV(Incoming);
246 NewLHS = Incoming;
248 NewRHS = Incoming;
LoopUnroll.cpp 99 // incoming edges. This occurs when there are multiple edges from
425 // the incoming values from the previous block.
448 Value *Incoming = phi->getIncomingValueForBlock(*BB);
449 ValueToValueMapTy::iterator It = LastValueMap.find(Incoming);
451 Incoming = It->second;
452 phi->addIncoming(Incoming, New);
488 // Loop over the PHI nodes in the original block, setting incoming values.
  /external/swiftshader/third_party/LLVM/lib/Analysis/
LoopInfo.cpp 135 BasicBlock *Incoming = 0, *Backedge = 0;
141 Incoming = *PI++;
144 if (contains(Incoming)) {
147 std::swap(Incoming, Backedge);
155 dyn_cast<ConstantInt>(PN->getIncomingValueForBlock(Incoming)))
InstructionSimplify.cpp 458 /// it on the incoming phi values yields the same result for every value. If so
481 // Evaluate the BinOp on the incoming phi values.
484 Value *Incoming = PI->getIncomingValue(i);
485 // If the incoming value is the phi node itself, it can safely be skipped.
486 if (Incoming == PI) continue;
488 SimplifyBinOp(Opcode, Incoming, RHS, TD, DT, MaxRecurse) :
489 SimplifyBinOp(Opcode, LHS, Incoming, TD, DT, MaxRecurse);
502 /// incoming phi values yields the same result every time. If so returns the
523 // Evaluate the BinOp on the incoming phi values.
526 Value *Incoming = PI->getIncomingValue(i)
    [all...]
ConstantFolding.cpp 738 Value *Incoming = PN->getIncomingValue(i);
739 // If the incoming value is undef then skip it. Note that while we could
743 if (isa<UndefValue>(Incoming))
745 // If the incoming value is not a constant, or is a different constant to
747 Constant *C = dyn_cast<Constant>(Incoming);
753 // If we reach here, all incoming values are the same constant or undef.
    [all...]
  /prebuilts/go/darwin-x86/src/math/big/
doc.go 70 Notational convention: Incoming method parameters (including the receiver)
71 are named consistently in the API to clarify their use. Incoming operands
80 Methods of this form typically return the incoming receiver as well, to
  /prebuilts/go/linux-x86/src/math/big/
doc.go 70 Notational convention: Incoming method parameters (including the receiver)
71 are named consistently in the API to clarify their use. Incoming operands
80 Methods of this form typically return the incoming receiver as well, to
  /prebuilts/go/darwin-x86/src/runtime/
signal_plan9.go 12 // Incoming notes are compared against this table using strncmp, so the
  /prebuilts/go/linux-x86/src/runtime/
signal_plan9.go 12 // Incoming notes are compared against this table using strncmp, so the
  /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/swiftshader/third_party/LLVM/bindings/ocaml/llvm/
llvm_ocaml.c     [all...]
  /external/llvm/lib/Target/Hexagon/
HexagonHardwareLoops.cpp 538 "Loop must have more than one incoming edge!");
542 MachineBasicBlock *Incoming = *PI++;
546 // Make sure there is one incoming and one backedge and determine which
548 if (L->contains(Incoming)) {
551 std::swap(Incoming, Backedge);
    [all...]

Completed in 685 milliseconds

1 2