Skip to content
GitLab
Explore
Sign in
Primary navigation
Search or go to…
Project
L
LLVM bpEVL
Manage
Activity
Members
Labels
Plan
Issues
0
Issue boards
Milestones
Wiki
Code
Merge requests
0
Repository
Branches
Commits
Tags
Repository graph
Compare revisions
Snippets
Build
Pipelines
Jobs
Pipeline schedules
Artifacts
Deploy
Releases
Package Registry
Model registry
Operate
Environments
Terraform modules
Monitor
Incidents
Analyze
Value stream analytics
Contributor analytics
CI/CD 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
Show more breadcrumbs
Lorenzo Albano
LLVM bpEVL
Commits
0ac801e2
Commit
0ac801e2
authored
21 years ago
by
Chris Lattner
Browse files
Options
Downloads
Patches
Plain Diff
new testcase
llvm-svn: 8882
parent
80471529
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/test/Regression/Transforms/Mem2Reg/2003-10-05-DeadPHIInsertion.ll
+21
-0
21 additions, 0 deletions
...ression/Transforms/Mem2Reg/2003-10-05-DeadPHIInsertion.ll
with
21 additions
and
0 deletions
llvm/test/Regression/Transforms/Mem2Reg/2003-10-05-DeadPHIInsertion.ll
0 → 100644
+
21
−
0
View file @
0ac801e2
; Mem2reg should not insert dead PHI nodes! The naive algorithm inserts a PHI
; node in L3, even though there is no load of %A in anything dominated by L3.
; RUN: llvm-as < %s | opt -mem2reg | llvm-dis | not grep phi
void
%test
(
int
%B
,
bool
%C
)
{
%A
=
alloca
int
store
int
%B
,
int
*
%A
br
bool
%C
,
label
%L1
,
label
%L2
L1:
store
int
%B
,
int
*
%A
%D
=
load
int
*
%A
call
void
%test
(
int
%D
,
bool
false
)
br
label
%L3
L2:
%E
=
load
int
*
%A
call
void
%test
(
int
%E
,
bool
true
)
br
label
%L3
L3:
ret
void
}
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