OpenGrok
Home
Sort by relevance
Sort by last modified time
Full Search
Definition
Symbol
File Path
History
|
|
Help
Searched
defs:Preds
(Results
1 - 6
of
6
) sorted by null
/external/llvm/lib/Transforms/Utils/
BreakCriticalEdges.cpp
100
assert(I != E && "No
preds
, but we have an edge to the block?");
107
// non-critical iff all
preds
come from TI's block.
122
/// new PHIs, as needed.
Preds
is a list of
preds
inside the loop, SplitBB
125
static void createPHIsForSplitLoopExit(ArrayRef<BasicBlock *>
Preds
,
146
PHINode::Create(PN->getType(),
Preds
.size(), "split",
149
for (unsigned i = 0, e =
Preds
.size(); i != e; ++i)
150
NewPN->addIncoming(V,
Preds
[i]);
353
// Collect all the
preds
that are inside the loop, and note
354
// whether there are any
preds
outside the loop
[
all
...]
/external/llvm/include/llvm/Transforms/Utils/
SSAUpdaterImpl.h
51
BBInfo **
Preds
; // Array[NumPreds] of predecessor blocks.
56
NumPreds(0),
Preds
(0), PHITag(0) { }
111
SmallVector<BlkT*, 10>
Preds
;
114
Preds
.clear();
115
Traits::FindPredecessorBlocks(Info->BB, &
Preds
);
116
Info->NumPreds =
Preds
.size();
118
Info->
Preds
= 0;
120
Info->
Preds
= static_cast<BBInfo**>
125
BlkT *Pred =
Preds
[p];
130
Info->
Preds
[p] = BBMapBucket.second
[
all
...]
/external/clang/include/clang/StaticAnalyzer/Core/PathSensitive/
ExplodedGraph.h
117
///
Preds
- The predecessors of this node.
118
NodeGroup
Preds
;
178
unsigned pred_size() const { return
Preds
.size(); }
180
bool pred_empty() const { return
Preds
.empty(); }
202
pred_iterator pred_begin() { return
Preds
.begin(); }
203
pred_iterator pred_end() { return
Preds
.end(); }
236
void replacePredecessor(ExplodedNode *node) {
Preds
.replaceNode(node); }
/external/llvm/include/llvm/CodeGen/
ScheduleDAG.h
257
//
Preds
/Succs - The SUnits before/after us in the graph.
258
SmallVector<SDep, 4>
Preds
; // All sunit predecessors.
268
unsigned NumPreds; // # of SDep::Data
preds
.
270
unsigned NumPredsLeft; // # of
preds
not scheduled.
422
for (unsigned i = 0, e = (unsigned)
Preds
.size(); i != e; ++i)
423
if (
Preds
[i].getSUnit() == N)
607
return Node->
Preds
[Operand].getSUnit();
621
return SUnitIterator(N, (unsigned)N->
Preds
.size());
634
return Node->
Preds
[Operand];
/external/llvm/lib/CodeGen/
MachineVerifier.cpp
124
BlockSet
Preds
, Succs;
453
MInfo.
Preds
.insert(I->pred_begin(), I->pred_end());
454
if (MInfo.
Preds
.size() != I->pred_size())
499
if (!MBBInfoMap[*I].
Preds
.count(MBB)) {
[
all
...]
/external/llvm/lib/Transforms/Scalar/
ObjCARC.cpp
[
all
...]
Completed in 250 milliseconds