OpenGrok
Home
Sort by relevance
Sort by last modified time
Full Search
Definition
Symbol
File Path
History
|
|
Help
Searched
defs:Incoming
(Results
1 - 8
of
8
) 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/llvm/lib/Transforms/Scalar/
CorrelatedValuePropagation.cpp
97
Value *
Incoming
= P->getIncomingValue(i);
98
if (isa<Constant>(
Incoming
)) continue;
142
///
incoming
edges, then it's true universally and we can simplify the compare.
183
/// on that edge. Cases that cannot fire no matter what the
incoming
edge can
184
/// safely be removed. If a case fires on every
incoming
edge then the entire
207
// value on every
incoming
edge, equal/not equal being the same each time.
ObjCARC.cpp
[
all
...]
/external/llvm/lib/Transforms/Utils/
LoopUnroll.cpp
79
//
incoming
edges. This occurs when there are multiple edges from
275
//
incoming
values from the previous block.
302
Value *
Incoming
= phi->getIncomingValueForBlock(*BB);
303
ValueToValueMapTy::iterator It = LastValueMap.find(
Incoming
);
305
Incoming
= It->second;
306
phi->addIncoming(
Incoming
, New);
326
// Loop over the PHI nodes in the original block, setting
incoming
values.
/external/llvm/lib/Analysis/
LoopInfo.cpp
136
BasicBlock *
Incoming
= 0, *Backedge = 0;
142
Incoming
= *PI++;
145
if (contains(
Incoming
)) {
148
std::swap(
Incoming
, Backedge);
156
dyn_cast<ConstantInt>(PN->getIncomingValueForBlock(
Incoming
)))
ConstantFolding.cpp
768
Value *
Incoming
= PN->getIncomingValue(i);
769
// If the
incoming
value is undef then skip it. Note that while we could
773
if (isa<UndefValue>(
Incoming
))
775
// If the
incoming
value is not a constant, or is a different constant to
777
Constant *C = dyn_cast<Constant>(
Incoming
);
783
// If we reach here, all
incoming
values are the same constant or undef.
[
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/CodeGen/SelectionDAG/
LegalizeIntegerTypes.cpp
[
all
...]
Completed in 1059 milliseconds