Skip to content
GitLab
Explore
Sign in
Primary navigation
Search or go to…
Project
llvm-epi-0.8
Manage
Activity
Members
Code
Repository
Branches
Commits
Tags
Repository graph
Compare revisions
Deploy
Releases
Model registry
Analyze
Contributor analytics
Repository analytics
Model experiments
Help
Help
Support
GitLab documentation
Compare GitLab plans
Community forum
Contribute to GitLab
Provide feedback
Keyboard shortcuts
?
Snippets
Groups
Projects
This is an archived project. Repository and other project resources are read-only.
Show more breadcrumbs
Roger Ferrer
llvm-epi-0.8
Commits
19fb2aba
Commit
19fb2aba
authored
16 years ago
by
Andrew Lenharth
Browse files
Options
Downloads
Patches
Plain Diff
try to seperate the mechanism into something others can use
llvm-svn: 55785
parent
57d3d8ab
No related branches found
Branches containing commit
No related tags found
No related merge requests found
Changes
1
Hide whitespace changes
Inline
Side-by-side
Showing
1 changed file
llvm/lib/Transforms/IPO/PartialSpecialization.cpp
+70
-20
70 additions, 20 deletions
llvm/lib/Transforms/IPO/PartialSpecialization.cpp
with
70 additions
and
20 deletions
llvm/lib/Transforms/IPO/PartialSpecialization.cpp
+
70
−
20
View file @
19fb2aba
...
@@ -26,7 +26,9 @@
...
@@ -26,7 +26,9 @@
#include
"llvm/Pass.h"
#include
"llvm/Pass.h"
#include
"llvm/ADT/Statistic.h"
#include
"llvm/ADT/Statistic.h"
#include
"llvm/Transforms/Utils/Cloning.h"
#include
"llvm/Transforms/Utils/Cloning.h"
#include
"llvm/Support/CallSite.h"
#include
"llvm/Support/Compiler.h"
#include
"llvm/Support/Compiler.h"
#include
"llvm/ADT/DenseSet.h"
#include
<map>
#include
<map>
using
namespace
llvm
;
using
namespace
llvm
;
...
@@ -41,7 +43,6 @@ static const double ConstValPercent = .1;
...
@@ -41,7 +43,6 @@ static const double ConstValPercent = .1;
namespace
{
namespace
{
class
VISIBILITY_HIDDEN
PartSpec
:
public
ModulePass
{
class
VISIBILITY_HIDDEN
PartSpec
:
public
ModulePass
{
void
scanForInterest
(
Function
&
,
SmallVector
<
int
,
6
>&
);
void
scanForInterest
(
Function
&
,
SmallVector
<
int
,
6
>&
);
void
replaceUsersFor
(
Function
&
,
int
,
Constant
*
,
Function
*
);
int
scanDistribution
(
Function
&
,
int
,
std
::
map
<
Constant
*
,
int
>&
);
int
scanDistribution
(
Function
&
,
int
,
std
::
map
<
Constant
*
,
int
>&
);
public
:
public
:
static
char
ID
;
// Pass identification, replacement for typeid
static
char
ID
;
// Pass identification, replacement for typeid
...
@@ -54,6 +55,55 @@ char PartSpec::ID = 0;
...
@@ -54,6 +55,55 @@ char PartSpec::ID = 0;
static
RegisterPass
<
PartSpec
>
static
RegisterPass
<
PartSpec
>
X
(
"partialspecialization"
,
"Partial Specialization"
);
X
(
"partialspecialization"
,
"Partial Specialization"
);
// Specialize F by replacing the arguments (keys) in replacements with the
// constants (values). Replace all calls to F with those constants with
// a call to the specialized function. Returns the specialized function
static
Function
*
SpecializeFunction
(
Function
*
F
,
DenseMap
<
const
Value
*
,
Value
*>&
replacements
)
{
// arg numbers of deleted arguments
DenseSet
<
unsigned
>
deleted
;
for
(
DenseMap
<
const
Value
*
,
Value
*>::
iterator
repb
=
replacements
.
begin
(),
repe
=
replacements
.
end
();
repb
!=
repe
;
++
repb
)
deleted
.
insert
(
cast
<
Argument
>
(
repb
->
first
)
->
getArgNo
());
Function
*
NF
=
CloneFunction
(
F
,
replacements
);
NF
->
setLinkage
(
GlobalValue
::
InternalLinkage
);
F
->
getParent
()
->
getFunctionList
().
push_back
(
NF
);
for
(
Value
::
use_iterator
ii
=
F
->
use_begin
(),
ee
=
F
->
use_end
();
ii
!=
ee
;
)
{
Value
::
use_iterator
i
=
ii
;;
++
ii
;
if
(
isa
<
CallInst
>
(
i
)
||
isa
<
InvokeInst
>
(
i
))
{
CallSite
CS
(
cast
<
Instruction
>
(
i
));
if
(
CS
.
getCalledFunction
()
==
F
)
{
SmallVector
<
Value
*
,
6
>
args
;
for
(
unsigned
x
=
0
;
x
<
CS
.
arg_size
();
++
x
)
if
(
!
deleted
.
count
(
x
))
args
.
push_back
(
CS
.
getArgument
(
x
));
Value
*
NCall
;
if
(
isa
<
CallInst
>
(
i
))
NCall
=
CallInst
::
Create
(
NF
,
args
.
begin
(),
args
.
end
(),
CS
.
getInstruction
()
->
getName
(),
CS
.
getInstruction
());
else
NCall
=
InvokeInst
::
Create
(
NF
,
cast
<
InvokeInst
>
(
i
)
->
getNormalDest
(),
cast
<
InvokeInst
>
(
i
)
->
getUnwindDest
(),
args
.
begin
(),
args
.
end
(),
CS
.
getInstruction
()
->
getName
(),
CS
.
getInstruction
());
CS
.
getInstruction
()
->
replaceAllUsesWith
(
NCall
);
CS
.
getInstruction
()
->
eraseFromParent
();
}
}
}
return
NF
;
}
bool
PartSpec
::
runOnModule
(
Module
&
M
)
{
bool
PartSpec
::
runOnModule
(
Module
&
M
)
{
bool
Changed
=
false
;
bool
Changed
=
false
;
for
(
Module
::
iterator
I
=
M
.
begin
();
I
!=
M
.
end
();
++
I
)
{
for
(
Module
::
iterator
I
=
M
.
begin
();
I
!=
M
.
end
();
++
I
)
{
...
@@ -74,10 +124,13 @@ bool PartSpec::runOnModule(Module &M) {
...
@@ -74,10 +124,13 @@ bool PartSpec::runOnModule(Module &M) {
ee
=
distribution
.
end
();
ii
!=
ee
;
++
ii
)
ee
=
distribution
.
end
();
ii
!=
ee
;
++
ii
)
if
(
total
>
ii
->
second
&&
ii
->
first
&&
if
(
total
>
ii
->
second
&&
ii
->
first
&&
ii
->
second
>
total
*
ConstValPercent
)
{
ii
->
second
>
total
*
ConstValPercent
)
{
Function
*
NF
=
CloneFunction
(
&
F
);
DenseMap
<
const
Value
*
,
Value
*>
m
;
NF
->
setLinkage
(
GlobalValue
::
InternalLinkage
);
Function
::
arg_iterator
arg
=
F
.
arg_begin
();
M
.
getFunctionList
().
push_back
(
NF
);
for
(
int
y
=
0
;
y
<
interestingArgs
[
x
];
++
y
)
replaceUsersFor
(
F
,
interestingArgs
[
x
],
ii
->
first
,
NF
);
++
arg
;
m
[
&*
arg
]
=
ii
->
first
;
SpecializeFunction
(
&
F
,
m
);
++
numSpecialized
;
breakOuter
=
true
;
breakOuter
=
true
;
Changed
=
true
;
Changed
=
true
;
}
}
...
@@ -93,9 +146,18 @@ void PartSpec::scanForInterest(Function& F, SmallVector<int, 6>& args) {
...
@@ -93,9 +146,18 @@ void PartSpec::scanForInterest(Function& F, SmallVector<int, 6>& args) {
ii
!=
ee
;
++
ii
)
{
ii
!=
ee
;
++
ii
)
{
for
(
Value
::
use_iterator
ui
=
ii
->
use_begin
(),
ue
=
ii
->
use_end
();
for
(
Value
::
use_iterator
ui
=
ii
->
use_begin
(),
ue
=
ii
->
use_end
();
ui
!=
ue
;
++
ui
)
{
ui
!=
ue
;
++
ui
)
{
// As an initial proxy for control flow, specialize on arguments
// that are used in comparisons.
bool
interesting
=
false
;
if
(
isa
<
CmpInst
>
(
ui
))
{
if
(
isa
<
CmpInst
>
(
ui
))
interesting
=
true
;
else
if
(
isa
<
CallInst
>
(
ui
))
interesting
=
ui
->
getOperand
(
0
)
==
ii
;
else
if
(
isa
<
InvokeInst
>
(
ui
))
interesting
=
ui
->
getOperand
(
0
)
==
ii
;
else
if
(
isa
<
SwitchInst
>
(
ui
))
interesting
=
true
;
else
if
(
isa
<
BranchInst
>
(
ui
))
interesting
=
true
;
if
(
interesting
)
{
args
.
push_back
(
std
::
distance
(
F
.
arg_begin
(),
ii
));
args
.
push_back
(
std
::
distance
(
F
.
arg_begin
(),
ii
));
break
;
break
;
}
}
...
@@ -103,18 +165,6 @@ void PartSpec::scanForInterest(Function& F, SmallVector<int, 6>& args) {
...
@@ -103,18 +165,6 @@ void PartSpec::scanForInterest(Function& F, SmallVector<int, 6>& args) {
}
}
}
}
/// replaceUsersFor - Replace direct calls to F with NF if the arg argnum is
/// the constant val
void
PartSpec
::
replaceUsersFor
(
Function
&
F
,
int
argnum
,
Constant
*
val
,
Function
*
NF
)
{
++
numSpecialized
;
for
(
Value
::
use_iterator
ii
=
F
.
use_begin
(),
ee
=
F
.
use_end
();
ii
!=
ee
;
++
ii
)
if
(
CallInst
*
CI
=
dyn_cast
<
CallInst
>
(
ii
))
if
(
CI
->
getOperand
(
0
)
==
&
F
&&
CI
->
getOperand
(
argnum
+
1
)
==
val
)
CI
->
setOperand
(
0
,
NF
);
}
int
PartSpec
::
scanDistribution
(
Function
&
F
,
int
arg
,
int
PartSpec
::
scanDistribution
(
Function
&
F
,
int
arg
,
std
::
map
<
Constant
*
,
int
>&
dist
)
{
std
::
map
<
Constant
*
,
int
>&
dist
)
{
bool
hasIndirect
=
false
;
bool
hasIndirect
=
false
;
...
...
This diff is collapsed.
Click to expand it.
Preview
0%
Loading
Try again
or
attach a new file
.
Cancel
You are about to add
0
people
to the discussion. Proceed with caution.
Finish editing this message first!
Save comment
Cancel
Please
register
or
sign in
to comment