Lines Matching refs:base2
1093 tree ref2, tree base2,
1141 || ref == base2))
1158 /* Consider access path1 base1....ref1 and access path2 base2...ref2.
1160 base1...ref1...base2...ref2.
1166 BASE_TYPE2 is type of base2. END_STRUCT_REF2 is non-NULL if there is
1168 BASE2_ALIAS_SET is the alias set of base2. */
1225 tree base1, base2;
1284 base2 = ref2;
1285 while (handled_component_p (base2))
1287 if (component_ref_to_zero_sized_trailing_array_p (base2))
1290 end_struct_ref2 = base2;
1292 if (ends_tbaa_access_path_p (base2))
1294 ref2 = TREE_OPERAND (base2, 0);
1301 base2 = TREE_OPERAND (base2, 0);
1303 type2 = TREE_TYPE (base2);
1321 ref2, base2, offset2, max_size2,
1332 int res = aliasing_component_refs_walk (ref2, type2, base2,
1998 and BASE2 constrained to [OFFSET1, OFFSET1 + MAX_SIZE1) and
2006 tree ref2, tree base2,
2010 gcc_checking_assert (DECL_P (base1) && DECL_P (base2));
2013 if (compare_base_decls (base1, base2) == 0)
2051 to [OFFSET1, OFFSET1 + MAX_SIZE1) may alias a variable based on BASE2
2052 constrained to [OFFSET2, OFFSET2 + MAX_SIZE2). *PTR1 and BASE2 have
2063 tree ref2 ATTRIBUTE_UNUSED, tree base2,
2074 && DECL_P (base2));
2095 && poly_int_tree_p (DECL_SIZE (base2), &dsize2)
2100 if (!ptr_deref_may_alias_decl_p (ptr1, base2))
2137 && compare_sizes (DECL_SIZE (base2),
2194 int res = nonoverlapping_refs_since_match_p (base1, ref1, base2, ref2,
2227 tree ref2 ATTRIBUTE_UNUSED, tree base2,
2239 && (TREE_CODE (base2) == MEM_REF
2240 || TREE_CODE (base2) == TARGET_MEM_REF));
2243 ptr2 = TREE_OPERAND (base2, 0);
2252 && (TREE_CODE (base2) != TARGET_MEM_REF
2253 || (!TMR_INDEX (base2) && !TMR_INDEX2 (base2))))
2255 && TREE_CODE (base2) == TARGET_MEM_REF
2256 && (TMR_STEP (base1) == TMR_STEP (base2)
2257 || (TMR_STEP (base1) && TMR_STEP (base2)
2259 TMR_STEP (base2), 0)))
2260 && (TMR_INDEX (base1) == TMR_INDEX (base2)
2261 || (TMR_INDEX (base1) && TMR_INDEX (base2)
2263 TMR_INDEX (base2), 0)))
2264 && (TMR_INDEX2 (base1) == TMR_INDEX2 (base2)
2265 || (TMR_INDEX2 (base1) && TMR_INDEX2 (base2)
2267 TMR_INDEX2 (base2), 0))))))
2270 poly_offset_int moff2 = mem_ref_offset (base2) << LOG2_BITS_PER_UNIT;
2293 ptrtype2 = TREE_TYPE (TREE_OPERAND (base2, 1));
2307 || same_type_for_tbaa (TREE_TYPE (base2), TREE_TYPE (ptrtype2)) != 1)
2315 && (TREE_CODE (base2) != TARGET_MEM_REF
2316 || (!TMR_INDEX (base2) && !TMR_INDEX2 (base2)))
2332 int res = nonoverlapping_refs_since_match_p (base1, ref1, base2, ref2,
2357 tree base1, base2;
2383 base2 = ao_ref_base (ref2);
2395 || TREE_CODE (base2) == SSA_NAME
2396 || TREE_CODE (base2) == CONST_DECL
2397 || TREE_CODE (base2) == CONSTRUCTOR
2398 || TREE_CODE (base2) == ADDR_EXPR
2399 || CONSTANT_CLASS_P (base2))
2421 var2_p = DECL_P (base2);
2425 ref2ref, base2, offset2, max_size2,
2433 || TREE_CODE (base2) == FUNCTION_DECL
2434 || TREE_CODE (base2) == LABEL_DECL)
2441 tree rbase2 = base2;
2467 ind2_p = (TREE_CODE (base2) == MEM_REF
2468 || TREE_CODE (base2) == TARGET_MEM_REF);
2475 std::swap (base1, base2);
2494 if ((TREE_CODE (TREE_OPERAND (base2, 0)) == SSA_NAME
2495 && SSA_NAME_POINTS_TO_READONLY_MEMORY (TREE_OPERAND (base2, 0)))
2503 return indirect_ref_may_alias_decl_p (ref2ref, base2,
2517 ref2ref, base2,
3223 tree base2, poly_int64 offset2, poly_int64 size2,
3232 bool base2_obj_p = SSA_VAR_P (base2);
3237 tree obj = base1_obj_p ? base1 : base2;
3241 bool base2_memref_p = TREE_CODE (base2) == MEM_REF;
3244 tree memref = base1_memref_p ? base1 : base2;
4081 tree base2 = ao_ref_base (ref2);
4146 else if (!operand_equal_p (base1, base2,
4156 bool known2 = get_object_alignment_1 (base2, &align2, &bitpos2);
Indexes created Sat Feb 28 05:31:39 UTC 2026