diff options
| author | Jakub Jelinek <jakub@redhat.com> | 2009-03-18 18:04:26 +0100 |
|---|---|---|
| committer | Jakub Jelinek <jakub@gcc.gnu.org> | 2009-03-18 18:04:26 +0100 |
| commit | 8f5929e11fa965fd2ad5d63c55de1cebc1b06af3 (patch) | |
| tree | 9ffa72fee709efb6885ad516b9076279d60c9e24 /gcc/tree-ssa-loop-ivopts.c | |
| parent | 9968d233b33186f70cbf9b265ec15b8b97153128 (diff) | |
| download | gcc-8f5929e11fa965fd2ad5d63c55de1cebc1b06af3.zip gcc-8f5929e11fa965fd2ad5d63c55de1cebc1b06af3.tar.gz gcc-8f5929e11fa965fd2ad5d63c55de1cebc1b06af3.tar.bz2 | |
dse.c (struct group_info): Reorder fields for 64-bit hosts.
* dse.c (struct group_info): Reorder fields for 64-bit hosts.
* matrix-reorg.c (struct matrix_info): Likewise.
* tree-ssa-loop-ivopts.c (struct ivopts_data): Likewise.
* rtl.h (struct mem_attrs): Likewise.
* df.h (struct df): Likewise.
* tree-data-ref.h (struct data_dependence_relation): Likewise.
* ira-int.h (struct ira_allocno): Likewise.
* df-scan.c (struct df_collection_rec): Likewise.
* ira.c (struct equivalence): Likewise.
* function.c (struct temp_slot): Likewise.
* cfgloop.h (struct loop): Likewise.
* parser.c (struct cp_token): Reorder fields for 64-bit hosts.
(eof_token): Adjust.
* include/cpplib.h (struct cpp_dir): Reorder fields for 64-bit hosts.
From-SVN: r144938
Diffstat (limited to 'gcc/tree-ssa-loop-ivopts.c')
| -rw-r--r-- | gcc/tree-ssa-loop-ivopts.c | 20 |
1 files changed, 10 insertions, 10 deletions
diff --git a/gcc/tree-ssa-loop-ivopts.c b/gcc/tree-ssa-loop-ivopts.c index c7bfa07..fcaf784 100644 --- a/gcc/tree-ssa-loop-ivopts.c +++ b/gcc/tree-ssa-loop-ivopts.c @@ -1,6 +1,6 @@ /* Induction variable optimizations. - Copyright (C) 2003, 2004, 2005, 2006, 2007, 2008 Free Software - Foundation, Inc. + Copyright (C) 2003, 2004, 2005, 2006, 2007, 2008, 2009 + Free Software Foundation, Inc. This file is part of GCC. @@ -219,15 +219,12 @@ struct ivopts_data /* The currently optimized loop. */ struct loop *current_loop; - /* Are we optimizing for speed? */ - bool speed; + /* Numbers of iterations for all exits of the current loop. */ + struct pointer_map_t *niters; /* Number of registers used in it. */ unsigned regs_used; - /* Numbers of iterations for all exits of the current loop. */ - struct pointer_map_t *niters; - /* The size of version_info array allocated. */ unsigned version_info_size; @@ -237,9 +234,6 @@ struct ivopts_data /* The bitmap of indices in version_info whose value was changed. */ bitmap relevant; - /* The maximum invariant id. */ - unsigned max_inv_id; - /* The uses of induction variables. */ VEC(iv_use_p,heap) *iv_uses; @@ -249,9 +243,15 @@ struct ivopts_data /* A bitmap of important candidates. */ bitmap important_candidates; + /* The maximum invariant id. */ + unsigned max_inv_id; + /* Whether to consider just related and important candidates when replacing a use. */ bool consider_all_candidates; + + /* Are we optimizing for speed? */ + bool speed; }; /* An assignment of iv candidates to uses. */ |