Lines Matching refs:addr_a
2025 tree addr_a = DR_BASE_ADDRESS (dr_a.dr);
2035 if (!internal_check_ptrs_fn_supported_p (ifn, TREE_TYPE (addr_a),
2039 if (!internal_check_ptrs_fn_supported_p (ifn, TREE_TYPE (addr_a),
2045 addr_a = fold_build_pointer_plus (addr_a, DR_OFFSET (dr_a.dr));
2046 addr_a = fold_build_pointer_plus (addr_a, DR_INIT (dr_a.dr));
2053 4, addr_a, addr_b,
2083 |<- ADDR_A ->| |<- ADDR_B ->|
2422 access of DR_A. In other words, we need to move addr_a along by
2425 addr_a' = addr_a + step
2433 [addr_a' + low_offset_a, addr_a' + high_offset_a + last_chunk_a]
2442 addr_a' + low_offset_a <= addr_b + last_chunk_b
2443 && addr_b <= addr_a' + high_offset_a + last_chunk_a
2447 0 <= addr_b + last_chunk_b - addr_a' - low_offset_a <= limit
2456 tree addr_a = fold_build_pointer_plus (DR_BASE_ADDRESS (dr_a.dr),
2458 addr_a = fold_build_pointer_plus (addr_a, DR_INIT (dr_a.dr));
2464 /* Advance ADDR_A by one iteration and adjust the length to compensate. */
2465 addr_a = fold_build_pointer_plus (addr_a, step);
2481 /* The amount added to addr_b - addr_a'. */
2491 fold_convert (sizetype, addr_a));
2976 tree addr_a = DR_BASE_OBJECT (a);
2996 if ((TREE_CODE (addr_a) == MEM_REF || TREE_CODE (addr_a) == TARGET_MEM_REF)
3001 || MR_DEPENDENCE_CLIQUE (addr_a) == 1
3002 || MR_DEPENDENCE_CLIQUE (addr_a) == loop_nest->owned_clique)
3003 && MR_DEPENDENCE_CLIQUE (addr_a) == MR_DEPENDENCE_CLIQUE (addr_b)
3004 && MR_DEPENDENCE_BASE (addr_a) != MR_DEPENDENCE_BASE (addr_b))
3011 if (TREE_CODE (addr_a) == MEM_REF
3013 || TREE_CODE (TREE_OPERAND (addr_a, 0)) == SSA_NAME))
3022 return ptr_derefs_may_alias_p (TREE_OPERAND (addr_a, 0),
3025 return ptr_derefs_may_alias_p (TREE_OPERAND (addr_a, 0),
3038 if (TREE_CODE (addr_a) == MEM_REF)
3039 return ptr_derefs_may_alias_p (TREE_OPERAND (addr_a, 0),
3042 return ptr_derefs_may_alias_p (build_fold_addr_expr (addr_a),
3049 return refs_output_dependent_p (addr_a, addr_b);
3051 return refs_anti_dependent_p (addr_a, addr_b);
3052 return refs_may_alias_p (addr_a, addr_b);