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
8ec88e19
Commit
8ec88e19
authored
Sep 27, 2005
by
Daniel Berlin
Browse files
Options
Browse Files
Download
Email Patches
Plain Diff
Add missing part of committed patch from 21st
From-SVN: r104696
parent
affbb54a
Hide whitespace changes
Inline
Side-by-side
Showing
1 changed file
with
6 additions
and
3 deletions
+6
-3
gcc/tree-ssa-loop-niter.c
+6
-3
No files found.
gcc/tree-ssa-loop-niter.c
View file @
8ec88e19
...
...
@@ -1437,10 +1437,12 @@ infer_loop_bounds_from_undefined (struct loop *loop)
/* For each array access, analyze its access function
and record a bound on the loop iteration domain. */
if
(
TREE_CODE
(
op1
)
==
ARRAY_REF
)
if
(
TREE_CODE
(
op1
)
==
ARRAY_REF
&&
!
ref_contains_indirect_ref
(
op1
))
estimate_iters_using_array
(
stmt
,
op1
);
if
(
TREE_CODE
(
op0
)
==
ARRAY_REF
)
if
(
TREE_CODE
(
op0
)
==
ARRAY_REF
&&
!
ref_contains_indirect_ref
(
op0
))
estimate_iters_using_array
(
stmt
,
op0
);
/* For each signed type variable in LOOP, analyze its
...
...
@@ -1491,7 +1493,8 @@ infer_loop_bounds_from_undefined (struct loop *loop)
for
(
args
=
TREE_OPERAND
(
stmt
,
1
);
args
;
args
=
TREE_CHAIN
(
args
))
if
(
TREE_CODE
(
TREE_VALUE
(
args
))
==
ARRAY_REF
)
if
(
TREE_CODE
(
TREE_VALUE
(
args
))
==
ARRAY_REF
&&
!
ref_contains_indirect_ref
(
TREE_VALUE
(
args
)))
estimate_iters_using_array
(
stmt
,
TREE_VALUE
(
args
));
break
;
...
...
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