Home
last modified time | relevance | path

Searched refs:dr_a (Results 1 – 4 of 4) sorted by relevance

/dragonfly/contrib/gcc-8.0/gcc/
H A Dtree-vect-data-refs.c717 || (DR_IS_READ (dr_a) && ! gimple_vdef (stmt))) in vect_slp_analyze_node_dependences()
744 (dr_a, store_dr, vNULL); in vect_slp_analyze_node_dependences()
3355 || !poly_int_tree_p (DR_INIT (dr_a), &init_a) in vectorizable_with_step_bound_p()
3364 std::swap (dr_a, dr_b); in vectorizable_with_step_bound_p()
3435 struct data_reference *dr_a, *dr_b; in vect_prune_runtime_alias_test_list() local
3465 dr_a = DDR_A (ddr); in vect_prune_runtime_alias_test_list()
3494 && TREE_CODE (DR_STEP (dr_a)) != INTEGER_CST in vect_prune_runtime_alias_test_list()
3553 access_size_a = vect_vfa_access_size (dr_a); in vect_prune_runtime_alias_test_list()
3555 align_a = vect_vfa_align (dr_a); in vect_prune_runtime_alias_test_list()
3566 && TREE_CODE (DR_STEP (dr_a)) == INTEGER_CST in vect_prune_runtime_alias_test_list()
[all …]
H A Dtree-data-ref.c1623 const dr_with_seg_len& dr_a, in create_intersect_range_checks_index() argument
1626 if (integer_zerop (DR_STEP (dr_a.dr)) in create_intersect_range_checks_index()
1632 if (!poly_int_tree_p (dr_a.seg_len, &seg_len1) in create_intersect_range_checks_index()
1636 if (!tree_fits_shwi_p (DR_STEP (dr_a.dr))) in create_intersect_range_checks_index()
1645 gcc_assert (TREE_CODE (DR_STEP (dr_a.dr)) == INTEGER_CST); in create_intersect_range_checks_index()
1659 seg_len1 += dr_a.access_size; in create_intersect_range_checks_index()
1686 for (i = 0; i < DR_NUM_DIMENSIONS (dr_a.dr); i++) in create_intersect_range_checks_index()
1688 tree access1 = DR_ACCESS_FN (dr_a.dr, i); in create_intersect_range_checks_index()
1857 const dr_with_seg_len& dr_a, in create_intersect_range_checks() argument
1866 if (TREE_CODE (DR_STEP (dr_a.dr)) == INTEGER_CST in create_intersect_range_checks()
[all …]
H A Dtree-loop-distribution.c2410 struct data_reference *dr_a = DDR_A (ddr); in compute_alias_check_pairs() local
2413 int comp_res = data_ref_compare_tree (DR_BASE_ADDRESS (dr_a), in compute_alias_check_pairs()
2417 comp_res = data_ref_compare_tree (DR_OFFSET (dr_a), DR_OFFSET (dr_b)); in compute_alias_check_pairs()
2420 if (latch_dominated_by_data_ref (loop, dr_a)) in compute_alias_check_pairs()
2421 seg_length_a = data_ref_segment_size (dr_a, niters_plus_one); in compute_alias_check_pairs()
2423 seg_length_a = data_ref_segment_size (dr_a, niters); in compute_alias_check_pairs()
2431 = tree_to_uhwi (TYPE_SIZE_UNIT (TREE_TYPE (DR_REF (dr_a)))); in compute_alias_check_pairs()
2434 unsigned int align_a = TYPE_ALIGN_UNIT (TREE_TYPE (DR_REF (dr_a))); in compute_alias_check_pairs()
2438 (dr_with_seg_len (dr_a, seg_length_a, access_size_a, align_a), in compute_alias_check_pairs()
/dragonfly/contrib/gcc-4.7/gcc/
H A Dtree-vect-loop-manip.c2456 struct data_reference *dr_a, *dr_b; in vect_create_cond_for_alias_checks() local
2463 dr_a = DDR_A (ddr); in vect_create_cond_for_alias_checks()
2469 dr_a = STMT_VINFO_DATA_REF (vinfo_for_stmt (stmt_a)); in vect_create_cond_for_alias_checks()
2488 if (!operand_equal_p (DR_STEP (dr_a), DR_STEP (dr_b), 0)) in vect_create_cond_for_alias_checks()
2492 segment_length_a = vect_vfa_segment_size (dr_a, length_factor); in vect_create_cond_for_alias_checks()
2499 print_generic_expr (vect_dump, DR_REF (dr_a), TDF_SLIM); in vect_create_cond_for_alias_checks()
2506 if (tree_int_cst_compare (DR_STEP (dr_a), size_zero_node) < 0) in vect_create_cond_for_alias_checks()