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
084b0dde
Commit
084b0dde
authored
15 years ago
by
David Greene
Browse files
Options
Downloads
Patches
Plain Diff
Change errs() to dbgs().
llvm-svn: 92606
parent
76a4e852
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/Utils/Local.cpp
+4
-4
4 additions, 4 deletions
llvm/lib/Transforms/Utils/Local.cpp
with
4 additions
and
4 deletions
llvm/lib/Transforms/Utils/Local.cpp
+
4
−
4
View file @
084b0dde
...
@@ -421,7 +421,7 @@ void llvm::MergeBasicBlockIntoOnlyPred(BasicBlock *DestBB, Pass *P) {
...
@@ -421,7 +421,7 @@ void llvm::MergeBasicBlockIntoOnlyPred(BasicBlock *DestBB, Pass *P) {
static
bool
CanPropagatePredecessorsForPHIs
(
BasicBlock
*
BB
,
BasicBlock
*
Succ
)
{
static
bool
CanPropagatePredecessorsForPHIs
(
BasicBlock
*
BB
,
BasicBlock
*
Succ
)
{
assert
(
*
succ_begin
(
BB
)
==
Succ
&&
"Succ is not successor of BB!"
);
assert
(
*
succ_begin
(
BB
)
==
Succ
&&
"Succ is not successor of BB!"
);
DEBUG
(
err
s
()
<<
"Looking to fold "
<<
BB
->
getName
()
<<
" into "
DEBUG
(
dbg
s
()
<<
"Looking to fold "
<<
BB
->
getName
()
<<
" into "
<<
Succ
->
getName
()
<<
"
\n
"
);
<<
Succ
->
getName
()
<<
"
\n
"
);
// Shortcut, if there is only a single predecessor it must be BB and merging
// Shortcut, if there is only a single predecessor it must be BB and merging
// is always safe
// is always safe
...
@@ -456,7 +456,7 @@ static bool CanPropagatePredecessorsForPHIs(BasicBlock *BB, BasicBlock *Succ) {
...
@@ -456,7 +456,7 @@ static bool CanPropagatePredecessorsForPHIs(BasicBlock *BB, BasicBlock *Succ) {
PI
!=
PE
;
PI
++
)
{
PI
!=
PE
;
PI
++
)
{
if
(
BBPN
->
getIncomingValueForBlock
(
*
PI
)
if
(
BBPN
->
getIncomingValueForBlock
(
*
PI
)
!=
PN
->
getIncomingValueForBlock
(
*
PI
))
{
!=
PN
->
getIncomingValueForBlock
(
*
PI
))
{
DEBUG
(
err
s
()
<<
"Can't fold, phi node "
<<
PN
->
getName
()
<<
" in "
DEBUG
(
dbg
s
()
<<
"Can't fold, phi node "
<<
PN
->
getName
()
<<
" in "
<<
Succ
->
getName
()
<<
" is conflicting with "
<<
Succ
->
getName
()
<<
" is conflicting with "
<<
BBPN
->
getName
()
<<
" with regard to common predecessor "
<<
BBPN
->
getName
()
<<
" with regard to common predecessor "
<<
(
*
PI
)
->
getName
()
<<
"
\n
"
);
<<
(
*
PI
)
->
getName
()
<<
"
\n
"
);
...
@@ -471,7 +471,7 @@ static bool CanPropagatePredecessorsForPHIs(BasicBlock *BB, BasicBlock *Succ) {
...
@@ -471,7 +471,7 @@ static bool CanPropagatePredecessorsForPHIs(BasicBlock *BB, BasicBlock *Succ) {
// one for BB, in which case this phi node will not prevent the merging
// one for BB, in which case this phi node will not prevent the merging
// of the block.
// of the block.
if
(
Val
!=
PN
->
getIncomingValueForBlock
(
*
PI
))
{
if
(
Val
!=
PN
->
getIncomingValueForBlock
(
*
PI
))
{
DEBUG
(
err
s
()
<<
"Can't fold, phi node "
<<
PN
->
getName
()
<<
" in "
DEBUG
(
dbg
s
()
<<
"Can't fold, phi node "
<<
PN
->
getName
()
<<
" in "
<<
Succ
->
getName
()
<<
" is conflicting with regard to common "
<<
Succ
->
getName
()
<<
" is conflicting with regard to common "
<<
"predecessor "
<<
(
*
PI
)
->
getName
()
<<
"
\n
"
);
<<
"predecessor "
<<
(
*
PI
)
->
getName
()
<<
"
\n
"
);
return
false
;
return
false
;
...
@@ -525,7 +525,7 @@ bool llvm::TryToSimplifyUncondBranchFromEmptyBlock(BasicBlock *BB) {
...
@@ -525,7 +525,7 @@ bool llvm::TryToSimplifyUncondBranchFromEmptyBlock(BasicBlock *BB) {
}
}
}
}
DEBUG
(
err
s
()
<<
"Killing Trivial BB:
\n
"
<<
*
BB
);
DEBUG
(
dbg
s
()
<<
"Killing Trivial BB:
\n
"
<<
*
BB
);
if
(
isa
<
PHINode
>
(
Succ
->
begin
()))
{
if
(
isa
<
PHINode
>
(
Succ
->
begin
()))
{
// If there is more than one pred of succ, and there are PHI nodes in
// If there is more than one pred of succ, and there are PHI nodes in
...
...
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