OpenGrok
Home
Sort by relevance
Sort by last modified time
Full Search
Definition
Symbol
File Path
History
|
|
Help
Searched
refs:CallGraphSCC
(Results
1 - 14
of
14
) sorted by null
/external/llvm/include/llvm/Analysis/
CallGraphSCCPass.h
32
class
CallGraphSCC
;
60
virtual bool runOnSCC(
CallGraphSCC
&SCC) = 0;
82
///
CallGraphSCC
- This is a single SCC that a CallGraphSCCPass is run on.
83
class
CallGraphSCC
{
87
CallGraphSCC
(void *context) : Context(context) {}
InlineCost.h
112
bool runOnSCC(
CallGraphSCC
&SCC) override;
/external/llvm/tools/opt/
PrintSCC.cpp
49
struct
CallGraphSCC
: public ModulePass {
51
CallGraphSCC
() : ModulePass(ID) {}
70
char
CallGraphSCC
::ID = 0;
71
static RegisterPass<
CallGraphSCC
>
93
bool
CallGraphSCC
::runOnModule(Module &M) {
PassPrinters.cpp
72
bool runOnSCC(
CallGraphSCC
&SCC) override {
77
for (
CallGraphSCC
::iterator I = SCC.begin(), E = SCC.end(); I != E; ++I) {
/external/llvm/include/llvm/Transforms/IPO/
InlinerPass.h
43
bool runOnSCC(
CallGraphSCC
&SCC) override;
/external/llvm/lib/Analysis/IPA/
CallGraphSCCPass.cpp
96
bool RunAllPassesOnSCC(
CallGraphSCC
&CurSCC, CallGraph &CG,
99
bool RunPassOnSCC(Pass *P,
CallGraphSCC
&CurSCC,
102
bool RefreshCallGraph(
CallGraphSCC
&CurSCC, CallGraph &CG,
111
bool CGPassManager::RunPassOnSCC(Pass *P,
CallGraphSCC
&CurSCC,
145
for (
CallGraphSCC
::iterator I = CurSCC.begin(), E = CurSCC.end();
171
///
CallGraphSCC
passes to verify that they correctly updated the callgraph.
178
bool CGPassManager::RefreshCallGraph(
CallGraphSCC
&CurSCC,
184
for (
CallGraphSCC
::iterator I = CurSCC.begin(), E = CurSCC.end();
194
for (
CallGraphSCC
::iterator SCCIdx = CurSCC.begin(), E = CurSCC.end();
353
for (
CallGraphSCC
::iterator I = CurSCC.begin(), E = CurSCC.end()
[
all
...]
InlineCost.cpp
[
all
...]
/external/llvm/lib/Transforms/IPO/
InlineAlways.cpp
55
bool runOnSCC(
CallGraphSCC
&SCC) override;
105
bool AlwaysInliner::runOnSCC(
CallGraphSCC
&SCC) {
InlineSimple.cpp
56
bool runOnSCC(
CallGraphSCC
&SCC) override;
93
bool SimpleInliner::runOnSCC(
CallGraphSCC
&SCC) {
PruneEH.cpp
45
bool runOnSCC(
CallGraphSCC
&SCC) override;
62
bool PruneEH::runOnSCC(
CallGraphSCC
&SCC) {
69
for (
CallGraphSCC
::iterator I = SCC.begin(), E = SCC.end(); I != E; ++I)
74
for (
CallGraphSCC
::iterator I = SCC.begin(), E = SCC.end(); I != E; ++I)
86
for (
CallGraphSCC
::iterator I = SCC.begin(), E = SCC.end();
140
for (
CallGraphSCC
::iterator I = SCC.begin(), E = SCC.end(); I != E; ++I) {
159
for (
CallGraphSCC
::iterator I = SCC.begin(), E = SCC.end(); I != E; ++I) {
FunctionAttrs.cpp
55
bool runOnSCC(
CallGraphSCC
&SCC) override;
58
bool AddReadAttrs(const
CallGraphSCC
&SCC);
61
bool AddArgumentAttrs(const
CallGraphSCC
&SCC);
68
bool AddNoAliasAttrs(const
CallGraphSCC
&SCC);
122
bool annotateLibraryCalls(const
CallGraphSCC
&SCC);
150
bool FunctionAttrs::AddReadAttrs(const
CallGraphSCC
&SCC) {
155
for (
CallGraphSCC
::iterator I = SCC.begin(), E = SCC.end(); I != E; ++I)
161
for (
CallGraphSCC
::iterator I = SCC.begin(), E = SCC.end(); I != E; ++I) {
264
for (
CallGraphSCC
::iterator I = SCC.begin(), E = SCC.end(); I != E; ++I) {
519
bool FunctionAttrs::AddArgumentAttrs(const
CallGraphSCC
&SCC)
[
all
...]
Inliner.cpp
441
bool Inliner::runOnSCC(
CallGraphSCC
&SCC) {
449
for (
CallGraphSCC
::iterator I = SCC.begin(), E = SCC.end(); I != E; ++I) {
466
for (
CallGraphSCC
::iterator I = SCC.begin(), E = SCC.end(); I != E; ++I) {
ArgumentPromotion.cpp
69
bool runOnSCC(
CallGraphSCC
&SCC) override;
105
bool ArgPromotion::runOnSCC(
CallGraphSCC
&SCC) {
114
for (
CallGraphSCC
::iterator I = SCC.begin(), E = SCC.end(); I != E; ++I) {
[
all
...]
/external/llvm/unittests/IR/
LegacyPassManagerTest.cpp
178
virtual bool runOnSCC(
CallGraphSCC
&SCMM) {
Completed in 686 milliseconds