OpenGrok
Home
Sort by relevance
Sort by last modified time
Full Search
Definition
Symbol
File Path
History
|
|
Help
Searched
defs:SCC
(Results
1 - 5
of
5
) sorted by null
/external/llvm/unittests/Analysis/
LazyCallGraphTest.cpp
56
// All call edges go up between SCCs, and clockwise around the
SCC
.
208
LazyCallGraph::
SCC
&D = *SCCI++;
222
LazyCallGraph::
SCC
&C = *SCCI++;
236
LazyCallGraph::
SCC
&B = *SCCI++;
252
LazyCallGraph::
SCC
&A = *SCCI++;
327
// Two interlocking cycles. The really useful thing about this
SCC
is that it
329
// children of each node in the
SCC
.
361
LazyCallGraph::
SCC
&
SCC
= *SCCI++;
369
EXPECT_EQ(&
SCC
, CG.lookupSCC(A))
[
all
...]
/external/llvm/lib/Analysis/IPA/
GlobalsModRef.cpp
359
// We do a bottom-up
SCC
traversal of the call graph. In other words, we
362
const std::vector<CallGraphNode *> &
SCC
= *I;
363
assert(!
SCC
.empty() && "
SCC
with no functions?");
365
if (!
SCC
[0]->getFunction()) {
368
for (unsigned i = 0, e =
SCC
.size(); i != e; ++i)
369
FunctionInfo.erase(
SCC
[i]->getFunction());
373
FunctionRecord &FR = FunctionInfo[
SCC
[0]->getFunction()];
380
for (unsigned i = 0, e =
SCC
.size(); i != e && !KnowNothing; ++i) {
381
Function *F =
SCC
[i]->getFunction()
[
all
...]
/external/llvm/include/llvm/Analysis/
LazyCallGraph.h
21
/// visited prior to a caller (given any
SCC
constraints), or vice versa. As
62
/// by an edge in the graph, do not invalidate a bottom-up traversal of the
SCC
64
/// that functions already visited in a bottom-up order of the
SCC
DAG are no
66
/// a bottom-up order of the
SCC
DAG are not required to have already been
70
///
SCC
DAG. The greater the fanout of the
SCC
DAG and the fewer merge points
71
/// in the
SCC
DAG, the more independence there is in optimizing within it.
106
class
SCC
;
162
friend class LazyCallGraph::
SCC
;
205
/// \brief An
SCC
of the call graph
[
all
...]
/external/chromium_org/third_party/yasm/source/patched-yasm/tools/re2c/
code.c
636
typedef struct
SCC
{
638
}
SCC
;
640
static void SCC_init(
SCC
*, unsigned int);
641
static
SCC
*SCC_new(unsigned int);
642
static void SCC_destroy(
SCC
*);
643
static void SCC_delete(
SCC
*);
644
static void SCC_traverse(
SCC
*, State*);
647
SCC_init(
SCC
*s, unsigned int size)
652
static
SCC
*
654
SCC
*s = malloc(sizeof(SCC))
729
SCC
scc
;
local
[
all
...]
/external/llvm/lib/CodeGen/SelectionDAG/
DAGCombiner.cpp
[
all
...]
Completed in 4375 milliseconds