OpenGrok
Home
Sort by relevance
Sort by last modified time
Full Search
Definition
Symbol
File Path
History
|
|
Help
Searched
defs:Successors
(Results
1 - 6
of
6
) sorted by null
/external/llvm/include/llvm/Analysis/
Interval.h
57
///
Successors
- List of BasicBlocks that are reachable directly from nodes in
61
std::vector<BasicBlock*>
Successors
;
64
/// as one of their
successors
.
79
for (unsigned i = 0; i <
Successors
.size(); ++i)
80
if (
Successors
[i] == BB) return true;
83
//return find(
Successors
.begin(),
Successors
.end(), BB) !=
Successors
.end();
105
return I->
Successors
.begin();
108
return I->
Successors
.end()
[
all
...]
/external/llvm/include/llvm/MC/MCAnalysis/
MCFunction.h
42
/// \name Predecessors/
Successors
, to represent the CFG.
45
BasicBlockListTy
Successors
;
59
/// MC CFG access: Predecessors/
Successors
.
62
succ_const_iterator succ_begin() const { return
Successors
.begin(); }
63
succ_const_iterator succ_end() const { return
Successors
.end(); }
76
/// This moves all
successors
to \p SplitBB, and
/external/llvm/lib/Support/
DAGDeltaAlgorithm.cpp
79
std::map<change_ty, std::vector<change_ty> >
Successors
;
104
assert(
Successors
.count(Node) && "Invalid node!");
105
return
Successors
[Node].begin();
108
assert(
Successors
.count(Node) && "Invalid node!");
109
return
Successors
[Node].end();
195
Successors
.insert(std::make_pair(*it, std::vector<change_ty>()));
200
Successors
[it->first].push_back(it->second);
/external/llvm/include/llvm/CodeGen/
MachineBasicBlock.h
69
/// Predecessors/
Successors
- Keep track of the predecessor / successor
72
std::vector<MachineBasicBlock *>
Successors
;
74
/// Weights - Keep track of the weights to the
successors
. This vector
75
/// has the same order as
Successors
, or it is empty if we don't use it
286
succ_iterator succ_begin() { return
Successors
.begin(); }
287
const_succ_iterator succ_begin() const { return
Successors
.begin(); }
288
succ_iterator succ_end() { return
Successors
.end(); }
289
const_succ_iterator succ_end() const { return
Successors
.end(); }
291
{ return
Successors
.rbegin(); }
293
{ return
Successors
.rbegin();
309
inline iterator_range<succ_iterator>
successors
() {
function in class:llvm::MachineBasicBlock
312
inline iterator_range<const_succ_iterator>
successors
() const {
function in class:llvm::MachineBasicBlock
[
all
...]
/external/llvm/lib/Transforms/Instrumentation/
GCOVProfiling.cpp
515
if (int
successors
= TI->getNumSuccessors()) {
516
for (int i = 0; i !=
successors
; ++i) {
606
int
Successors
= isa<ReturnInst>(TI) ? 1 : TI->getNumSuccessors();
607
if (
Successors
) {
608
if (
Successors
== 1) {
629
for (int i = 0; i !=
Successors
; ++i)
633
Edge +=
Successors
;
703
// All edges with
successors
that aren't branches are "complex", because it
727
int
Successors
= isa<ReturnInst>(TI) ? 1 : TI->getNumSuccessors();
728
if (
Successors
> 1 && !isa<BranchInst>(TI) && !isa<ReturnInst>(TI))
[
all
...]
/external/llvm/lib/Transforms/Scalar/
SampleProfile.cpp
210
/// \brief
Successors
for each basic block in the CFG.
211
BlockEdgeMap
Successors
;
782
for (size_t I = 0; I <
Successors
[BB].size(); I++) {
783
Edge E = std::make_pair(BB,
Successors
[BB][I]);
[
all
...]
Completed in 445 milliseconds