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/matrix-reorg.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/matrix-reorg.c')
| -rw-r--r-- | gcc/matrix-reorg.c | 10 |
1 files changed, 5 insertions, 5 deletions
diff --git a/gcc/matrix-reorg.c b/gcc/matrix-reorg.c index 7ea185c..d916f70 100644 --- a/gcc/matrix-reorg.c +++ b/gcc/matrix-reorg.c @@ -1,5 +1,5 @@ /* Matrix layout transformations. - Copyright (C) 2006, 2007, 2008 Free Software Foundation, Inc. + Copyright (C) 2006, 2007, 2008, 2009 Free Software Foundation, Inc. Contributed by Razya Ladelsky <razya@il.ibm.com> Originally written by Revital Eres and Mustafa Hagog. @@ -261,9 +261,6 @@ struct matrix_info gimple min_indirect_level_escape_stmt; - /* Is the matrix transposed. */ - bool is_transposed_p; - /* Hold the allocation site for each level (dimension). We can use NUM_DIMS as the upper bound and allocate the array once with this number of elements and no need to use realloc and @@ -272,6 +269,9 @@ struct matrix_info int max_malloced_level; + /* Is the matrix transposed. */ + bool is_transposed_p; + /* The location of the allocation sites (they must be in one function). */ tree allocation_function_decl; @@ -303,7 +303,7 @@ struct matrix_info /* An array of the accesses to be flattened. elements are of type "struct access_site_info *". */ - VEC (access_site_info_p, heap) * access_l; + VEC (access_site_info_p, heap) * access_l; /* A map of how the dimensions will be organized at the end of the analyses. */ |