diff options
| author | jakub <jakub@138bc75d-0d04-0410-961f-82ee72b054a4> | 2009-03-18 17:04:26 +0000 |
|---|---|---|
| committer | jakub <jakub@138bc75d-0d04-0410-961f-82ee72b054a4> | 2009-03-18 17:04:26 +0000 |
| commit | 0ac758f73d7757418f92a4468cf11cb5517f1b19 (patch) | |
| tree | 9ffa72fee709efb6885ad516b9076279d60c9e24 /gcc/tree-data-ref.h | |
| parent | 8fa85fc5e4c9e98608d5a0d8281b8f8b75ac7096 (diff) | |
| download | gcc-0ac758f73d7757418f92a4468cf11cb5517f1b19.tar.gz | |
* 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.
git-svn-id: svn+ssh://gcc.gnu.org/svn/gcc/trunk@144938 138bc75d-0d04-0410-961f-82ee72b054a4
Diffstat (limited to 'gcc/tree-data-ref.h')
| -rw-r--r-- | gcc/tree-data-ref.h | 24 |
1 files changed, 12 insertions, 12 deletions
diff --git a/gcc/tree-data-ref.h b/gcc/tree-data-ref.h index 6477542879d..4a12f3946d8 100644 --- a/gcc/tree-data-ref.h +++ b/gcc/tree-data-ref.h @@ -291,14 +291,6 @@ struct data_dependence_relation struct data_reference *a; struct data_reference *b; - /* When the dependence relation is affine, it can be represented by - a distance vector. */ - bool affine_p; - - /* Set to true when the dependence relation is on the same data - access. */ - bool self_reference_p; - /* A "yes/no/maybe" field for the dependence relation: - when "ARE_DEPENDENT == NULL_TREE", there exist a dependence @@ -320,18 +312,26 @@ struct data_dependence_relation /* The analyzed loop nest. */ VEC (loop_p, heap) *loop_nest; - /* An index in loop_nest for the innermost loop that varies for - this data dependence relation. */ - unsigned inner_loop; - /* The classic direction vector. */ VEC (lambda_vector, heap) *dir_vects; /* The classic distance vector. */ VEC (lambda_vector, heap) *dist_vects; + /* An index in loop_nest for the innermost loop that varies for + this data dependence relation. */ + unsigned inner_loop; + /* Is the dependence reversed with respect to the lexicographic order? */ bool reversed_p; + + /* When the dependence relation is affine, it can be represented by + a distance vector. */ + bool affine_p; + + /* Set to true when the dependence relation is on the same data + access. */ + bool self_reference_p; }; typedef struct data_dependence_relation *ddr_p; |