tree-data-ref.h (data_dependence_relation): New flag reversed_p.

* tree-data-ref.h (data_dependence_relation): New flag reversed_p.
	(DDR_REVERSED_P): New.
	* tree-data-ref.c (initialize_data_dependence_relation,
	build_classic_dist_vector): Set DDR_REVERSED_P.

From-SVN: r126306
This commit is contained in:
Sebastian Pop 2007-07-04 07:19:01 +00:00 committed by Sebastian Pop
parent fd727b3451
commit 71d5b5e165
3 changed files with 13 additions and 0 deletions

View File

@ -1,3 +1,10 @@
2007-07-04 Sebastian Pop <sebpop@gmail.com>
* tree-data-ref.h (data_dependence_relation): New flag reversed_p.
(DDR_REVERSED_P): New.
* tree-data-ref.c (initialize_data_dependence_relation,
build_classic_dist_vector): Set DDR_REVERSED_P.
2007-07-04 Sebastian Pop <sebpop@gmail.com>
PR middle-end/32457

View File

@ -1208,6 +1208,7 @@ initialize_data_dependence_relation (struct data_reference *a,
DDR_A (res) = a;
DDR_B (res) = b;
DDR_LOOP_NEST (res) = NULL;
DDR_REVERSED_P (res) = false;
if (a == NULL || b == NULL)
{
@ -2996,6 +2997,7 @@ build_classic_dist_vector (struct data_dependence_relation *ddr,
build_classic_dist_vector_1 (ddr, DDR_B (ddr), DDR_A (ddr),
save_v, &init_b, &index_carry);
save_dist_v (ddr, save_v);
DDR_REVERSED_P (ddr) = true;
/* In this case there is a dependence forward for all the
outer loops:

View File

@ -251,6 +251,9 @@ struct data_dependence_relation
/* The classic distance vector. */
VEC (lambda_vector, heap) *dist_vects;
/* Is the dependence reversed with respect to the lexicographic order? */
bool reversed_p;
};
typedef struct data_dependence_relation *ddr_p;
@ -281,6 +284,7 @@ DEF_VEC_ALLOC_P(ddr_p,heap);
VEC_index (lambda_vector, DDR_DIR_VECTS (DDR), I)
#define DDR_DIST_VECT(DDR, I) \
VEC_index (lambda_vector, DDR_DIST_VECTS (DDR), I)
#define DDR_REVERSED_P(DDR) DDR->reversed_p