Skip to content
Projects
Groups
Snippets
Help
This project
Loading...
Sign in / Register
Toggle navigation
R
riscv-gcc-1
Overview
Overview
Details
Activity
Cycle Analytics
Repository
Repository
Files
Commits
Branches
Tags
Contributors
Graph
Compare
Charts
Issues
0
Issues
0
List
Board
Labels
Milestones
Merge Requests
0
Merge Requests
0
CI / CD
CI / CD
Pipelines
Jobs
Schedules
Charts
Wiki
Wiki
Snippets
Snippets
Members
Members
Collapse sidebar
Close sidebar
Activity
Graph
Charts
Create a new issue
Jobs
Commits
Issue Boards
Open sidebar
lvzhengyang
riscv-gcc-1
Commits
e5b1fae4
Commit
e5b1fae4
authored
May 30, 2016
by
Jan Hubicka
Committed by
Jan Hubicka
May 30, 2016
Browse files
Options
Browse Files
Download
Email Patches
Plain Diff
* tree-vect-loop.c (vect_transform_loop): Update likely bounds.
From-SVN: r236880
parent
eb897cfc
Show whitespace changes
Inline
Side-by-side
Showing
2 changed files
with
14 additions
and
2 deletions
+14
-2
gcc/ChangeLog
+4
-0
gcc/tree-vect-loop.c
+10
-2
No files found.
gcc/ChangeLog
View file @
e5b1fae4
2016-05-30 Jan Hubicka <hubicka@ucw.cz>
2016-05-30 Jan Hubicka <hubicka@ucw.cz>
* tree-vect-loop.c (vect_transform_loop): Update likely bounds.
2016-05-30 Jan Hubicka <hubicka@ucw.cz>
* tree-ssa-loop-ivcanon.c (try_peel_loop): Correctly set wont_exit
* tree-ssa-loop-ivcanon.c (try_peel_loop): Correctly set wont_exit
for peeled copies; avoid underflow when updating estimates; correctly
for peeled copies; avoid underflow when updating estimates; correctly
scale loop profile.
scale loop profile.
...
...
gcc/tree-vect-loop.c
View file @
e5b1fae4
...
@@ -6918,12 +6918,20 @@ vect_transform_loop (loop_vec_info loop_vinfo)
...
@@ -6918,12 +6918,20 @@ vect_transform_loop (loop_vec_info loop_vinfo)
/* Reduce loop iterations by the vectorization factor. */
/* Reduce loop iterations by the vectorization factor. */
scale_loop_profile
(
loop
,
GCOV_COMPUTE_SCALE
(
1
,
vectorization_factor
),
scale_loop_profile
(
loop
,
GCOV_COMPUTE_SCALE
(
1
,
vectorization_factor
),
expected_iterations
/
vectorization_factor
);
expected_iterations
/
vectorization_factor
);
if
(
LOOP_VINFO_PEELING_FOR_GAPS
(
loop_vinfo
)
if
(
LOOP_VINFO_PEELING_FOR_GAPS
(
loop_vinfo
))
&&
loop
->
nb_iterations_upper_bound
!=
0
)
{
if
(
loop
->
nb_iterations_upper_bound
!=
0
)
loop
->
nb_iterations_upper_bound
=
loop
->
nb_iterations_upper_bound
-
1
;
loop
->
nb_iterations_upper_bound
=
loop
->
nb_iterations_upper_bound
-
1
;
if
(
loop
->
nb_iterations_likely_upper_bound
!=
0
)
loop
->
nb_iterations_likely_upper_bound
=
loop
->
nb_iterations_likely_upper_bound
-
1
;
}
loop
->
nb_iterations_upper_bound
loop
->
nb_iterations_upper_bound
=
wi
::
udiv_floor
(
loop
->
nb_iterations_upper_bound
+
1
,
=
wi
::
udiv_floor
(
loop
->
nb_iterations_upper_bound
+
1
,
vectorization_factor
)
-
1
;
vectorization_factor
)
-
1
;
loop
->
nb_iterations_likely_upper_bound
=
wi
::
udiv_floor
(
loop
->
nb_iterations_likely_upper_bound
+
1
,
vectorization_factor
)
-
1
;
if
(
loop
->
any_estimate
)
if
(
loop
->
any_estimate
)
{
{
...
...
Write
Preview
Markdown
is supported
0%
Try again
or
attach a new file
Attach a file
Cancel
You are about to add
0
people
to the discussion. Proceed with caution.
Finish editing this message first!
Cancel
Please
register
or
sign in
to comment