Lines Matching defs:ref2
881 tree match2, tree ref2,
901 int cmp = nonoverlapping_refs_since_match_p (match1, ref1, match2, ref2,
904 || (cmp == -1 && nonoverlapping_component_refs_p (ref1, ref2)))
944 tree ref2, tree base2,
948 tree ref = ref2;
1002 ref, ref2,
1009 /* Consider access path1 base1....ref1 and access path2 base2...ref2.
1011 base1...ref1...base2...ref2.
1065 tree ref2,
1135 base2 = ref2;
1145 ref2 = TREE_OPERAND (base2, 0);
1156 /* Now search for the type1 in the access path of ref2. This
1172 ref2, base2, offset2, max_size2,
1183 int res = aliasing_component_refs_walk (ref2, type2, base2,
1198 if (!nonoverlapping_component_refs_p (ref1, ref2))
1211 || access_path_may_continue_p (TREE_TYPE (ref2), end_struct_past_end2,
1340 nonoverlapping_array_refs_p (tree ref1, tree ref2)
1343 tree index2 = TREE_OPERAND (ref2, 1);
1345 tree low_bound2 = cheap_array_ref_low_bound(ref2);
1359 if ((TREE_OPERAND (ref1, 3) == NULL) != (TREE_OPERAND (ref2, 3) == NULL))
1363 tree elmt_type2 = TREE_TYPE (TREE_TYPE (TREE_OPERAND (ref2, 0)));
1369 TREE_OPERAND (ref2, 3), 0))
1422 tree match2, tree ref2,
1434 || match2 == ref2 || !handled_component_p (ref2))
1454 while (handled_component_p (ref2) && ref2 != match2)
1456 if (ends_tbaa_access_path_p (ref2))
1460 component_refs2.safe_push (ref2);
1461 ref2 = TREE_OPERAND (ref2, 0);
1471 bool mem_ref2 = TREE_CODE (ref2) == MEM_REF && ref2 != match2;
1480 || (mem_ref2 && !mem_ref1 && !integer_zerop (TREE_OPERAND (ref2, 1)))
1483 TREE_OPERAND (ref2, 1))))
1492 && TREE_CODE (ref2) != TARGET_MEM_REF);
1557 ref2 = component_refs2.pop ();
1559 if (!operand_equal_p (TREE_OPERAND (ref2, 1),
1560 cheap_array_ref_low_bound (ref2), 0))
1633 ref2 = component_refs2.pop ();
1635 if (TREE_CODE (ref2) != COMPONENT_REF)
1645 while (!RECORD_OR_UNION_TYPE_P (TREE_TYPE (TREE_OPERAND (ref2, 0))));
1650 && TREE_CODE (ref2) == COMPONENT_REF);
1653 tree field2 = TREE_OPERAND (ref2, 1);
1860 tree ref2, tree base2,
1881 if (ref1 && ref2
1882 && handled_component_p (ref1) && handled_component_p (ref2)
1883 && nonoverlapping_refs_since_match_p (NULL, ref1, NULL, ref2, false) == 1)
1902 tree ref2 ATTRIBUTE_UNUSED, tree base2,
1969 if (!ref2)
1974 dbase2 = ref2;
2017 if (!ref1 || !ref2
2022 int res = nonoverlapping_refs_since_match_p (base1, ref1, base2, ref2,
2025 return !nonoverlapping_component_refs_p (ref1, ref2);
2030 if (ref1 && ref2
2031 && (handled_component_p (ref1) || handled_component_p (ref2)))
2035 ref2,
2055 tree ref2 ATTRIBUTE_UNUSED, tree base2,
2105 if (ref1 && ref2)
2107 int res = nonoverlapping_refs_since_match_p (NULL, ref1, NULL, ref2,
2156 if (!ref1 || !ref2
2160 int res = nonoverlapping_refs_since_match_p (base1, ref1, base2, ref2,
2163 return !nonoverlapping_component_refs_p (ref1, ref2);
2168 if (ref1 && ref2
2169 && (handled_component_p (ref1) || handled_component_p (ref2)))
2173 ref2,
2183 refs_may_alias_p_2 (ao_ref *ref1, ao_ref *ref2, bool tbaa_p)
2197 && (!ref2->ref
2198 || TREE_CODE (ref2->ref) == SSA_NAME
2199 || DECL_P (ref2->ref)
2200 || TREE_CODE (ref2->ref) == STRING_CST
2201 || handled_component_p (ref2->ref)
2202 || TREE_CODE (ref2->ref) == MEM_REF
2203 || TREE_CODE (ref2->ref) == TARGET_MEM_REF));
2209 base2 = ao_ref_base (ref2);
2210 offset2 = ref2->offset;
2211 max_size2 = ref2->max_size;
2239 && ref2->volatile_p)
2251 ref2->ref, base2, offset2, max_size2,
2252 ref2->size);
2268 rbase2 = ref2->ref;
2293 std::swap (ref1, ref2);
2304 ao_ref_alias_set (ref2)))
2319 return indirect_ref_may_alias_decl_p (ref2->ref, base2,
2320 offset2, max_size2, ref2->size,
2321 ao_ref_alias_set (ref2),
2322 ao_ref_base_alias_set (ref2),
2333 ref2->ref, base2,
2334 offset2, max_size2, ref2->size,
2335 ao_ref_alias_set (ref2),
2336 ao_ref_base_alias_set (ref2),
2346 refs_may_alias_p_1 (ao_ref *ref1, ao_ref *ref2, bool tbaa_p)
2348 bool res = refs_may_alias_p_2 (ref1, ref2, tbaa_p);
2357 refs_may_alias_p (tree ref1, ao_ref *ref2, bool tbaa_p)
2361 return refs_may_alias_p_1 (&r1, ref2, tbaa_p);
2365 refs_may_alias_p (tree ref1, tree ref2, bool tbaa_p)
2369 ao_ref_init (&r2, ref2);