OpenGrok
Home
Sort by relevance
Sort by last modified time
Full Search
Definition
Symbol
File Path
History
|
|
Help
Searched
refs:Predecessors
(Results
1 - 15
of
15
) 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
63
///
Predecessors
- List of BasicBlocks that have this Interval's header block
66
std::vector<BasicBlock*>
Predecessors
;
115
return I->
Predecessors
.begin();
118
return I->
Predecessors
.end();
/external/v8/src/compiler/
schedule.cc
40
BasicBlock::
Predecessors
predecessors
= block->
predecessors
();
local
42
for (BasicBlock::
Predecessors
::iterator j =
predecessors
.begin();
43
j !=
predecessors
.end(); ++j) {
schedule.h
101
typedef Inputs
Predecessors
;
104
Predecessors
predecessors
() { return static_cast<
Predecessors
>(inputs()); }
function in class:v8::internal::compiler::FINAL
113
BasicBlock::
Predecessors
predecessors
= this->
predecessors
();
local
114
for (BasicBlock::
Predecessors
::iterator i =
predecessors
.begin();
115
i !=
predecessors
.end(); ++i)
[
all
...]
instruction.cc
436
<< ")\n
predecessors
:";
438
BasicBlock::
Predecessors
predecessors
= block->
predecessors
();
local
439
for (BasicBlock::
Predecessors
::iterator iter =
predecessors
.begin();
440
iter !=
predecessors
.end(); ++iter) {
scheduler.cc
329
BasicBlock::
Predecessors
::iterator current_pred =
330
current_rpo->
predecessors
().begin();
331
BasicBlock::
Predecessors
::iterator end =
332
current_rpo->
predecessors
().end();
336
// For multiple
predecessors
, walk up the rpo ordering until a common
532
*hoist_block->
predecessors
().begin() == pre_header);
805
// Push the member onto the queue and process its
predecessors
.
812
// Propagate loop membership backwards. All
predecessors
of M up to the
[
all
...]
register-allocator.cc
1268
BasicBlock::Predecessors
predecessors
= block->
predecessors
();
local
[
all
...]
/external/clang/lib/Analysis/
ThreadSafetyTIL.cpp
57
unsigned Idx =
Predecessors
.size();
58
Predecessors
.reserveCheck(1, Arena);
59
Predecessors
.push_back(Pred);
71
Predecessors
.reserve(NumPreds, Arena);
182
// following back-edges. The dominator is serialized before any
predecessors
,
198
for (auto *Pred :
Predecessors
)
207
// its
predecessors
have already computed their dominators. This is achieved
212
for (auto *Pred :
Predecessors
) {
/external/llvm/include/llvm/CodeGen/
MachineBasicBlock.h
69
///
Predecessors
/Successors - Keep track of the predecessor / successor
71
std::vector<MachineBasicBlock *>
Predecessors
;
270
pred_iterator pred_begin() { return
Predecessors
.begin(); }
271
const_pred_iterator pred_begin() const { return
Predecessors
.begin(); }
272
pred_iterator pred_end() { return
Predecessors
.end(); }
273
const_pred_iterator pred_end() const { return
Predecessors
.end(); }
275
{ return
Predecessors
.rbegin();}
277
{ return
Predecessors
.rbegin();}
279
{ return
Predecessors
.rend(); }
281
{ return
Predecessors
.rend();
303
inline iterator_range<pred_iterator>
predecessors
() {
function in class:llvm::MachineBasicBlock
306
inline iterator_range<const_pred_iterator>
predecessors
() const {
function in class:llvm::MachineBasicBlock
[
all
...]
/external/llvm/lib/Support/
DAGDeltaAlgorithm.cpp
75
std::map<change_ty, std::vector<change_ty> >
Predecessors
;
83
assert(
Predecessors
.count(Node) && "Invalid node!");
84
return
Predecessors
[Node].begin();
87
assert(
Predecessors
.count(Node) && "Invalid node!");
88
return
Predecessors
[Node].end();
186
Predecessors
.insert(std::make_pair(*it, std::vector<change_ty>()));
191
Predecessors
[it->second].push_back(it->first);
/external/llvm/lib/Transforms/Scalar/
SampleProfile.cpp
156
/// \brief
Predecessors
for each basic block in the CFG.
157
BlockEdgeMap
Predecessors
;
450
for (auto *Pred :
Predecessors
[BB]) {
540
// Add
predecessors
for B1.
542
if (!
Predecessors
[B1].empty())
543
llvm_unreachable("Found a stale
predecessors
list in a basic block.");
547
Predecessors
[B1].push_back(B2);
584
// unique
predecessors
and successors. This is necessary to handle
/external/llvm/lib/CodeGen/
MachineBasicBlock.cpp
295
OS << "
Predecessors
according to CFG:";
393
assert(!B && "UpdateTerminators requires analyzable
predecessors
!");
562
Predecessors
.push_back(pred);
566
pred_iterator I = std::find(
Predecessors
.begin(),
Predecessors
.end(), pred);
567
assert(I !=
Predecessors
.end() && "Pred is not a predecessor of this block!");
568
Predecessors
.erase(I);
866
assert(VNI && "PHI sources should be live out of their
predecessors
.");
[
all
...]
/external/clang/include/clang/Analysis/Analyses/
ThreadSafetyTIL.h
1579
BlockArray &
predecessors
() { return Predecessors; }
function in class:clang::threadSafety::BasicBlock
1580
const BlockArray &
predecessors
() const { return Predecessors; }
function in class:clang::threadSafety::BasicBlock
[
all
...]
/art/compiler/dex/
mir_optimization.cc
38
static unsigned int
Predecessors
(BasicBlock* bb) {
39
return bb->
predecessors
.size();
126
if ((bb == nullptr) ||
Predecessors
(bb) != 1) {
180
if (bb == nullptr || (
Predecessors
(bb) != 1)) {
618
(
Predecessors
(tk) == 1) && (
Predecessors
(ft) == 1)) {
771
if ((walker->block_type == kEntryBlock) || (
Predecessors
(walker) != 1)) {
774
DCHECK(!walker->
predecessors
.empty());
775
BasicBlock* prev = GetBasicBlock(walker->
predecessors
[0]);
[
all
...]
Completed in 396 milliseconds