Lines Matching defs:dr_a1
1835 /* Deal with two ddrs (dr_a1, dr_b1) and (dr_a2, dr_b2). */
1839 dr_with_seg_len *dr_a1 = &alias_pair1->first;
1845 if (*dr_a1 == *dr_a2 && *dr_b1 == *dr_b2)
1849 DR_REF (dr_a1->dr), DR_REF (dr_b1->dr),
1861 if (*dr_a1 == *dr_a2 || *dr_b1 == *dr_b2)
1864 and DR_A1 and DR_A2 are two consecutive memrefs. */
1865 if (*dr_a1 == *dr_a2)
1867 std::swap (dr_a1, dr_b1);
1873 DR_A1 and the initial DR_A2 is known at compile time. */
1874 if (!operand_equal_p (DR_BASE_ADDRESS (dr_a1->dr),
1876 || !operand_equal_p (DR_OFFSET (dr_a1->dr),
1878 || !poly_int_tree_p (DR_INIT (dr_a1->dr), &init_a1)
1887 DR_A1 and DR_A2:
1889 - If DR_A1 and DR_A2 have equal lengths, that length is
1892 - If DR_A1 and DR_A2 both have negative "lengths", the combined
1895 - If DR_A1 and DR_A2 both have positive lengths, the combined
1903 bool new_seg_len_p = !operand_equal_p (dr_a1->seg_len,
1908 if (!poly_int_tree_p (dr_a1->seg_len, &seg_len_a1)
1912 tree indicator_a = dr_direction_indicator (dr_a1->dr);
1932 /* Make sure dr_a1 starts left of dr_a2. */
1935 std::swap (*dr_a1, *dr_a2);
1941 if (!operand_equal_p (DR_STEP (dr_a1->dr), DR_STEP (dr_a2->dr), 0))
1946 dr_a1->seg_len = build_int_cst (TREE_TYPE (dr_a1->seg_len),
1948 dr_a1->align = MIN (dr_a1->align, known_alignment (new_seg_len));
1954 /* The new check will start at DR_A1. Make sure that its access
1956 if (maybe_lt (dr_a1->access_size, diff + dr_a2->access_size))
1958 dr_a1->access_size = upper_bound (dr_a1->access_size,
1960 unsigned int new_align = known_alignment (dr_a1->access_size);
1961 dr_a1->align = MIN (dr_a1->align, new_align);
1965 DR_REF (dr_a1->dr), DR_REF (dr_b1->dr),
Indexes created Sun Mar 29 00:23:15 UTC 2026