OpenGrok
Home
Sort by relevance
Sort by last modified time
Full Search
Definition
Symbol
File Path
History
|
|
Help
Searched
defs:SCC
(Results
1 - 8
of
8
) sorted by null
/external/swiftshader/third_party/LLVM/lib/Analysis/IPA/
GlobalsModRef.cpp
370
// We do a bottom-up
SCC
traversal of the call graph. In other words, we
374
std::vector<CallGraphNode *> &
SCC
= *I;
375
assert(!
SCC
.empty() && "
SCC
with no functions?");
377
if (!
SCC
[0]->getFunction()) {
380
for (unsigned i = 0, e =
SCC
.size(); i != e; ++i)
381
FunctionInfo.erase(
SCC
[i]->getFunction());
385
FunctionRecord &FR = FunctionInfo[
SCC
[0]->getFunction()];
392
for (unsigned i = 0, e =
SCC
.size(); i != e && !KnowNothing; ++i) {
393
Function *F =
SCC
[i]->getFunction()
[
all
...]
/external/llvm/lib/Analysis/
GlobalsModRef.cpp
449
// We do a bottom-up
SCC
traversal of the call graph. In other words, we
453
const std::vector<CallGraphNode *> &
SCC
= *I;
454
assert(!
SCC
.empty() && "
SCC
with no functions?");
456
for (auto *CGN :
SCC
)
468
// We do a bottom-up
SCC
traversal of the call graph. In other words, we
471
const std::vector<CallGraphNode *> &
SCC
= *I;
472
assert(!
SCC
.empty() && "
SCC
with no functions?");
474
if (!
SCC
[0]->getFunction() || !SCC[0]->getFunction()->isDefinitionExact())
[
all
...]
/external/swiftshader/third_party/llvm-7.0/llvm/lib/Analysis/
GlobalsModRef.cpp
468
// We do a bottom-up
SCC
traversal of the call graph. In other words, we
472
const std::vector<CallGraphNode *> &
SCC
= *I;
473
assert(!
SCC
.empty() && "
SCC
with no functions?");
475
for (auto *CGN :
SCC
)
487
// We do a bottom-up
SCC
traversal of the call graph. In other words, we
490
const std::vector<CallGraphNode *> &
SCC
= *I;
491
assert(!
SCC
.empty() && "
SCC
with no functions?");
493
Function *F =
SCC
[0]->getFunction()
[
all
...]
/external/llvm/include/llvm/Analysis/
LazyCallGraph.h
21
/// visited prior to a caller (given any
SCC
constraints), or vice versa. As
64
/// by an edge in the graph, do not invalidate a bottom-up traversal of the
SCC
66
/// that functions already visited in a bottom-up order of the
SCC
DAG are no
68
/// a bottom-up order of the
SCC
DAG are not required to have already been
72
///
SCC
DAG. The greater the fanout of the
SCC
DAG and the fewer merge points
73
/// in the
SCC
DAG, the more independence there is in optimizing within it.
108
class
SCC
;
196
friend class LazyCallGraph::
SCC
;
203
// of an
SCC
(or RefSCC), or '0' when not yet reached in a DFS walk
[
all
...]
/external/swiftshader/third_party/llvm-7.0/llvm/include/llvm/Analysis/
LazyCallGraph.h
21
/// visited prior to a caller (given any
SCC
constraints), or vice versa. As
71
/// by an edge in the graph, do not invalidate a bottom-up traversal of the
SCC
73
/// that functions already visited in a bottom-up order of the
SCC
DAG are no
75
/// a bottom-up order of the
SCC
DAG are not required to have already been
79
///
SCC
DAG. The greater the fanout of the
SCC
DAG and the fewer merge points
80
/// in the
SCC
DAG, the more independence there is in optimizing within it.
116
class
SCC
;
389
// of an
SCC
(or RefSCC), or '0' when not yet reached in a DFS walk.
420
/// An
SCC
of the call graph
[
all
...]
/external/swiftshader/third_party/LLVM/lib/CodeGen/SelectionDAG/
DAGCombiner.cpp
[
all
...]
/external/llvm/lib/CodeGen/SelectionDAG/
DAGCombiner.cpp
[
all
...]
/external/swiftshader/third_party/llvm-7.0/llvm/lib/CodeGen/SelectionDAG/
DAGCombiner.cpp
[
all
...]
Completed in 434 milliseconds