OpenGrok
Home
Sort by relevance
Sort by last modified time
Full Search
Definition
Symbol
File Path
History
|
|
Help
Searched
defs:Incoming
(Results
1 - 13
of
13
) sorted by null
/external/chromium/third_party/libjingle/source/talk/p2p/base/
tcpport.h
83
// Accepts
incoming
TCP connection.
88
struct
Incoming
{
109
std::list<
Incoming
> incoming_;
/external/chromium_org/third_party/libjingle/source/talk/p2p/base/
tcpport.h
87
// Accepts
incoming
TCP connection.
92
struct
Incoming
{
115
std::list<
Incoming
> 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);
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/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.
/external/llvm/lib/Analysis/
LoopInfo.cpp
145
BasicBlock *
Incoming
= 0, *Backedge = 0;
151
Incoming
= *PI++;
154
if (contains(
Incoming
)) {
157
std::swap(
Incoming
, Backedge);
165
dyn_cast<ConstantInt>(PN->getIncomingValueForBlock(
Incoming
)))
ConstantFolding.cpp
822
Value *
Incoming
= PN->getIncomingValue(i);
823
// If the
incoming
value is undef then skip it. Note that while we could
[
all
...]
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
...]
/external/llvm/lib/Target/R600/
SIAnnotateControlFlow.cpp
208
// Handle all non constant
incoming
values first
210
Value *
Incoming
= Phi->getIncomingValue(i);
211
if (isa<ConstantInt>(
Incoming
))
215
handleLoopCondition(
Incoming
);
223
Value *
Incoming
= Phi->getIncomingValue(i);
224
if (
Incoming
!= BoolTrue)
/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
...]
/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/Vectorize/
SLPVectorizer.cpp
[
all
...]
/external/llvm/lib/CodeGen/SelectionDAG/
LegalizeIntegerTypes.cpp
[
all
...]
/external/llvm/lib/Transforms/ObjCARC/
ObjCARCOpts.cpp
[
all
...]
Completed in 667 milliseconds