/external/chromium/third_party/libjingle/source/talk/p2p/base/ |
tcpport.h | 83 // Accepts incoming TCP connection. 88 struct Incoming { 109 std::list<Incoming> incoming_;
|
tcpport.cc | 71 // We can't accept TCP connections incoming on other ports 100 // recognize our incoming TCP connections. 145 Incoming incoming; local 146 incoming.addr = new_socket->GetRemoteAddress(); 147 incoming.socket = new_socket; 148 incoming.socket->SignalReadPacket.connect(this, &TCPPort::OnReadPacket); 151 << incoming.addr.ToString(); 152 incoming_.push_back(incoming); 158 for (std::list<Incoming>::iterator it = incoming_.begin() [all...] |
/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); 104 // Look if the incoming value is a select with a constant but LVI tells us 105 // that the incoming value can never be that constant. In that case replace 106 // the incoming value with the other value of the select. This often allows 109 SelectInst *SI = dyn_cast<SelectInst>(Incoming); 161 /// incoming edges, then it's true universally and we can simplify the compare. 202 /// on that edge. Cases that cannot fire no matter what the incoming edge can 203 /// safely be removed. If a case fires on every incoming edge then the entir [all...] |
/external/llvm/lib/Target/R600/ |
SIAnnotateControlFlow.cpp | 206 // Handle all non constant incoming values first 208 Value *Incoming = Phi->getIncomingValue(i); 209 if (isa<ConstantInt>(Incoming)) 213 handleLoopCondition(Incoming); 221 Value *Incoming = Phi->getIncomingValue(i); 222 if (Incoming != BoolTrue)
|
/packages/apps/Gallery2/src/com/android/gallery3d/app/ |
StateManager.java | 64 StateTransitionAnimation.Transition.Incoming); 98 StateTransitionAnimation.Transition.Incoming); 243 StateTransitionAnimation.Transition.Incoming);
|
/external/llvm/lib/Transforms/Utils/ |
LoopUnroll.cpp | 79 // incoming edges. This occurs when there are multiple edges from 279 // incoming values from the previous block. 306 Value *Incoming = phi->getIncomingValueForBlock(*BB); 307 ValueToValueMapTy::iterator It = LastValueMap.find(Incoming); 309 Incoming = It->second; 310 phi->addIncoming(Incoming, New); 330 // Loop over the PHI nodes in the original block, setting incoming values.
|
/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 | 142 BasicBlock *Incoming = 0, *Backedge = 0; 148 Incoming = *PI++; 151 if (contains(Incoming)) { 154 std::swap(Incoming, Backedge); 162 dyn_cast<ConstantInt>(PN->getIncomingValueForBlock(Incoming)))
|
InstructionSimplify.cpp | 510 /// it on the incoming phi values yields the same result for every value. If so 532 // Evaluate the BinOp on the incoming phi values. 535 Value *Incoming = PI->getIncomingValue(i); 536 // If the incoming value is the phi node itself, it can safely be skipped. 537 if (Incoming == PI) continue; 539 SimplifyBinOp(Opcode, Incoming, RHS, Q, MaxRecurse) : 540 SimplifyBinOp(Opcode, LHS, Incoming, Q, MaxRecurse); 553 /// incoming phi values yields the same result every time. If so returns the 573 // Evaluate the BinOp on the incoming phi values. 576 Value *Incoming = PI->getIncomingValue(i) [all...] |
ConstantFolding.cpp | 821 Value *Incoming = PN->getIncomingValue(i); 822 // If the incoming value is undef then skip it. Note that while we could 826 if (isa<UndefValue>(Incoming)) [all...] |
/external/llvm/lib/Target/PowerPC/ |
PPCCTRLoops.cpp | 262 "Loop must have more than one incoming edge!"); 265 MachineBasicBlock *Incoming = *PI++; 268 // make sure there is one incoming and one backedge and determine which 270 if (L->contains(Incoming)) { 273 std::swap(Incoming, Backedge);
|
/external/llvm/bindings/ocaml/llvm/ |
llvm_ocaml.c | [all...] |
/external/llvm/lib/Target/Hexagon/ |
HexagonHardwareLoops.cpp | 435 "Loop must have more than one incoming edge!"); 439 MachineBasicBlock *Incoming = *PI++; 443 // Make sure there is one incoming and one backedge and determine which 445 if (L->contains(Incoming)) { 448 std::swap(Incoming, Backedge); [all...] |
/external/llvm/lib/Transforms/ObjCARC/ |
ObjCARCOpts.cpp | [all...] |
/external/llvm/lib/CodeGen/SelectionDAG/ |
LegalizeIntegerTypes.cpp | [all...] |
/external/mdnsresponder/mDNSCore/ |
uDNS.c | [all...] |