diff options
author | Bernd Schmidt <bernd.schmidt@analog.com> | 2006-09-15 14:41:43 +0000 |
---|---|---|
committer | Bernd Schmidt <bernds@gcc.gnu.org> | 2006-09-15 14:41:43 +0000 |
commit | e54273ebeca55f85a6d35b48ac5f5c8a808a25ee (patch) | |
tree | 5d43d34de617c8f2b978eb593bca0382e7c2544e /gcc/ada | |
parent | 61943a216576f8e1f7de347d2ef56883e2b746d8 (diff) | |
download | gcc-e54273ebeca55f85a6d35b48ac5f5c8a808a25ee.zip gcc-e54273ebeca55f85a6d35b48ac5f5c8a808a25ee.tar.gz gcc-e54273ebeca55f85a6d35b48ac5f5c8a808a25ee.tar.bz2 |
bfin.c (struct loop_info): New members block_bitmap and bad.
* config/bfin/bfin.c (struct loop_info): New members block_bitmap and
bad.
(struct loop_work and related VEC declarations): Delete.
(bfin_dump_loops): Print out new member bad.
(bfin_bb_in_loop): Use plain bitmap test. Don't recurse.
(bfin_scan_loop): Don't recurse.
(bfin_optimize_loop): Don't use a loop depth of -1 to indicate bad
loops. No longer need to update outer loops if the current one is
found bad. Move some validitiy checks to bfin_discover_loop.
(bfin_discover_loop): New function, mostly split from bfin_reorg_loops,
but changed not to check for nesting. Also changed to use the new bad
flag.
(bfin_reorg_loops): Use bfin_discover_loop to find single loops one at a
time. Use bitmap based test to discover loop nesting.
From-SVN: r116972
Diffstat (limited to 'gcc/ada')
0 files changed, 0 insertions, 0 deletions