Home | History | Annotate | Download | only in gcc

Lines Matching refs:ddr

145 ddr_hasher::hash (const data_dependence_relation *ddr)
148   h.add_ptr (DDR_A (ddr));
149   h.add_ptr (DDR_B (ddr));
559      graph RDG.  We firstly try to find ddr from global ddr hash table.  If
560      it doesn't exist, compute the ddr and cache it.  */
1376   struct data_dependence_relation *ddr;
1386       ddr = initialize_data_dependence_relation (a, b, loop_nest);
1387       compute_affine_dependence (ddr, loop_nest[0]);
1388       *slot = ddr;
1399   struct data_dependence_relation *ddr;
1406   ddr = get_data_dependence (rdg, dr1, dr2);
1409   if (DDR_ARE_DEPENDENT (ddr) == chrec_known)
1415   else if (DDR_ARE_DEPENDENT (ddr) == chrec_dont_know
1416 	   || DDR_NUM_DIST_VECTS (ddr) == 0)
1417     return !runtime_alias_check_p (ddr, NULL, true);
1418   else if (DDR_NUM_DIST_VECTS (ddr) > 1)
1420   else if (DDR_REVERSED_P (ddr)
1421 	   || lambda_vector_zerop (DDR_DIST_VECT (ddr, 0), 1))
1791   ddr_p ddr = get_data_dependence (rdg, src_dr, dst_dr);
1794   if (DDR_ARE_DEPENDENT (ddr) == chrec_known)
1803   if (DDR_ARE_DEPENDENT (ddr) == chrec_dont_know
1804       || DDR_NUM_DIST_VECTS (ddr) == 0)
1809   int num_lev = (DDR_LOOP_NEST (ddr)).length ();
1810   FOR_EACH_VEC_ELT (DDR_DIST_VECTS (ddr), i, dist_v)
1814       if (dep_lev > 0 && dist_v[dep_lev - 1] > 0 && !DDR_REVERSED_P (ddr))
2078 	  ddr_p ddr;
2094 	  ddr = get_data_dependence (rdg, dr1, dr2);
2095 	  if (DDR_ARE_DEPENDENT (ddr) == chrec_dont_know)
2115 		alias_ddrs->safe_push (ddr);
2118 	  else if (DDR_ARE_DEPENDENT (ddr) == NULL_TREE)
2123 	      if (DDR_NUM_DIST_VECTS (ddr) != 1)
2128 		  if (lambda_vector_zerop (DDR_DIST_VECT (ddr, 0),
2129 					   DDR_NB_LOOPS (ddr)))
2135 		      if (DDR_REVERSED_P (ddr))
2146 						DDR_LOOP_NEST (ddr));
2147 		  if (DDR_DIST_VECT (ddr, 0)[idx] == 0
2674       ddr_p ddr = (*alias_ddrs)[i];
2675       struct data_reference *dr_a = DDR_A (ddr);
2676       struct data_reference *dr_b = DDR_B (ddr);