OpenGrok
Home
Sort by relevance
Sort by last modified time
Full Search
Definition
Symbol
File Path
History
|
|
Help
Searched
refs:Predecessors
(Results
1 - 6
of
6
) sorted by null
/external/llvm/lib/Analysis/
Interval.cpp
30
// There is a loop in this interval iff one of the
predecessors
of the header
49
OS << "Interval
Predecessors
:\n";
50
for (std::vector<BasicBlock*>::const_iterator I =
Predecessors
.begin(),
51
E =
Predecessors
.end(); I != E; ++I)
IntervalPartition.cpp
62
getBlockInterval(*I)->
Predecessors
.push_back(Header);
82
//
predecessors
for each block.
110
//
predecessors
for each block.
/external/llvm/include/llvm/Analysis/
Interval.h
34
/// in the interval has all of its
predecessors
in the interval (except for the
66
///
Predecessors
- List of BasicBlocks that have this Interval's header block
69
std::vector<BasicBlock*>
Predecessors
;
118
return I->
Predecessors
.begin();
121
return I->
Predecessors
.end();
/external/llvm/include/llvm/CodeGen/
MachineBasicBlock.h
69
///
Predecessors
/Successors - Keep track of the predecessor / successor
71
std::vector<MachineBasicBlock *>
Predecessors
;
257
pred_iterator pred_begin() { return
Predecessors
.begin(); }
258
const_pred_iterator pred_begin() const { return
Predecessors
.begin(); }
259
pred_iterator pred_end() { return
Predecessors
.end(); }
260
const_pred_iterator pred_end() const { return
Predecessors
.end(); }
262
{ return
Predecessors
.rbegin();}
264
{ return
Predecessors
.rbegin();}
266
{ return
Predecessors
.rend(); }
268
{ return
Predecessors
.rend();
[
all
...]
/external/llvm/lib/Support/
DAGDeltaAlgorithm.cpp
76
std::map<change_ty, std::vector<change_ty> >
Predecessors
;
84
assert(
Predecessors
.count(Node) && "Invalid node!");
85
return
Predecessors
[Node].begin();
88
assert(
Predecessors
.count(Node) && "Invalid node!");
89
return
Predecessors
[Node].end();
192
Predecessors
.insert(std::make_pair(*it, std::vector<change_ty>()));
197
Predecessors
[it->second].push_back(it->first);
/external/llvm/lib/CodeGen/
MachineBasicBlock.cpp
297
OS << "
Predecessors
according to CFG:";
359
assert(!B && "UpdateTerminators requires analyzable
predecessors
!");
528
Predecessors
.push_back(pred);
532
pred_iterator I = std::find(
Predecessors
.begin(),
Predecessors
.end(), pred);
533
assert(I !=
Predecessors
.end() && "Pred is not a predecessor of this block!");
534
Predecessors
.erase(I);
826
assert(VNI && "PHI sources should be live out of their
predecessors
.");
877
// If all the other
predecessors
of "Succ" are dominated by "Succ" itself
[
all
...]
Completed in 867 milliseconds