Home
last modified time | relevance | path

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

123

/dports/science/libefp/libefp-1.5.0/src/
H A Dxr.c284 vec_t dr_a = { in lmo_lmo_xr_grad() local
295 dvib.x -= tmp * dr_a.x; in lmo_lmo_xr_grad()
296 dvib.y -= tmp * dr_a.y; in lmo_lmo_xr_grad()
297 dvib.z -= tmp * dr_a.z; in lmo_lmo_xr_grad()
310 vec_t dr_a = { in lmo_lmo_xr_grad() local
336 vec_t dr_a = { in lmo_lmo_xr_grad() local
362 vec_t dr_a = { in lmo_lmo_xr_grad() local
466 vec_t dr_a = { in lmo_lmo_xr_energy() local
479 vec_t dr_a = { in lmo_lmo_xr_energy() local
491 vec_t dr_a = { in lmo_lmo_xr_energy() local
[all …]
/dports/science/nwchem/nwchem-7b21660b82ebd85ef659f6fba7e1e73433b0bd0a/src/nwdft/xc/
H A Dxc_util.F689 integer r_a,r_b,dr_a,dr_b
694 dr_a=1
706 dr_a=1
716 C rho(1,r_a), delrho(1,1,dr_a),
753 integer r_a,r_b,dr_a,dr_b
758 dr_a=1
770 dr_a=1
781 C rho(1,r_a), delrho(1,1,dr_a),
782 t tau(1,dr_a),
783 & amat(1,a_a), cmat(1,c_a), mmat(1,dr_a),
/dports/lang/gcc12-devel/gcc-12-20211205/gcc/
H A Dtree-data-ref.c2007 || !tree_fits_uhwi_p (DR_STEP (dr_a.dr))) in create_ifn_alias_checks()
2011 tree addr_a = DR_BASE_ADDRESS (dr_a.dr); in create_ifn_alias_checks()
2024 full_length = seg_len + dr_a.access_size; in create_ifn_alias_checks()
2090 || integer_zerop (DR_STEP (dr_a.dr)) in create_intersect_range_checks_index()
2096 if (!poly_int_tree_p (dr_a.seg_len, &seg_len1) in create_intersect_range_checks_index()
2100 if (!tree_fits_shwi_p (DR_STEP (dr_a.dr))) in create_intersect_range_checks_index()
2144 tree access1 = DR_ACCESS_FN (dr_a.dr, i); in create_intersect_range_checks_index()
2169 tree access1 = DR_ACCESS_FN (dr_a.dr, found); in create_intersect_range_checks_index()
2349 tree step = DR_STEP (dr_a.dr); in create_waw_or_war_checks()
2443 DR_OFFSET (dr_a.dr)); in create_waw_or_war_checks()
[all …]
/dports/lang/gcc11-devel/gcc-11-20211009/gcc/
H A Dtree-data-ref.c2016 || !tree_fits_uhwi_p (DR_STEP (dr_a.dr))) in create_ifn_alias_checks()
2020 tree addr_a = DR_BASE_ADDRESS (dr_a.dr); in create_ifn_alias_checks()
2033 full_length = seg_len + dr_a.access_size; in create_ifn_alias_checks()
2099 || integer_zerop (DR_STEP (dr_a.dr)) in create_intersect_range_checks_index()
2105 if (!poly_int_tree_p (dr_a.seg_len, &seg_len1) in create_intersect_range_checks_index()
2109 if (!tree_fits_shwi_p (DR_STEP (dr_a.dr))) in create_intersect_range_checks_index()
2153 tree access1 = DR_ACCESS_FN (dr_a.dr, i); in create_intersect_range_checks_index()
2178 tree access1 = DR_ACCESS_FN (dr_a.dr, found); in create_intersect_range_checks_index()
2358 tree step = DR_STEP (dr_a.dr); in create_waw_or_war_checks()
2452 DR_OFFSET (dr_a.dr)); in create_waw_or_war_checks()
[all …]
/dports/misc/cxx_atomics_pic/gcc-11.2.0/gcc/
H A Dtree-data-ref.c2016 || !tree_fits_uhwi_p (DR_STEP (dr_a.dr))) in create_ifn_alias_checks()
2020 tree addr_a = DR_BASE_ADDRESS (dr_a.dr); in create_ifn_alias_checks()
2033 full_length = seg_len + dr_a.access_size; in create_ifn_alias_checks()
2099 || integer_zerop (DR_STEP (dr_a.dr)) in create_intersect_range_checks_index()
2105 if (!poly_int_tree_p (dr_a.seg_len, &seg_len1) in create_intersect_range_checks_index()
2109 if (!tree_fits_shwi_p (DR_STEP (dr_a.dr))) in create_intersect_range_checks_index()
2153 tree access1 = DR_ACCESS_FN (dr_a.dr, i); in create_intersect_range_checks_index()
2178 tree access1 = DR_ACCESS_FN (dr_a.dr, found); in create_intersect_range_checks_index()
2358 tree step = DR_STEP (dr_a.dr); in create_waw_or_war_checks()
2452 DR_OFFSET (dr_a.dr)); in create_waw_or_war_checks()
[all …]
/dports/lang/gcc11/gcc-11.2.0/gcc/
H A Dtree-data-ref.c2016 || !tree_fits_uhwi_p (DR_STEP (dr_a.dr))) in create_ifn_alias_checks()
2020 tree addr_a = DR_BASE_ADDRESS (dr_a.dr); in create_ifn_alias_checks()
2033 full_length = seg_len + dr_a.access_size; in create_ifn_alias_checks()
2099 || integer_zerop (DR_STEP (dr_a.dr)) in create_intersect_range_checks_index()
2105 if (!poly_int_tree_p (dr_a.seg_len, &seg_len1) in create_intersect_range_checks_index()
2109 if (!tree_fits_shwi_p (DR_STEP (dr_a.dr))) in create_intersect_range_checks_index()
2153 tree access1 = DR_ACCESS_FN (dr_a.dr, i); in create_intersect_range_checks_index()
2178 tree access1 = DR_ACCESS_FN (dr_a.dr, found); in create_intersect_range_checks_index()
2358 tree step = DR_STEP (dr_a.dr); in create_waw_or_war_checks()
2452 DR_OFFSET (dr_a.dr)); in create_waw_or_war_checks()
[all …]
/dports/lang/gcc10-devel/gcc-10-20211008/gcc/
H A Dtree-data-ref.c1760 || !tree_fits_uhwi_p (DR_STEP (dr_a.dr)))
1764 tree addr_a = DR_BASE_ADDRESS (dr_a.dr);
1777 full_length = seg_len + dr_a.access_size;
1843 || integer_zerop (DR_STEP (dr_a.dr))
1849 if (!poly_int_tree_p (dr_a.seg_len, &seg_len1)
1853 if (!tree_fits_shwi_p (DR_STEP (dr_a.dr)))
1897 tree access1 = DR_ACCESS_FN (dr_a.dr, i);
1922 tree access1 = DR_ACCESS_FN (dr_a.dr, found);
2102 tree step = DR_STEP (dr_a.dr);
2196 DR_OFFSET (dr_a.dr));
[all …]
/dports/lang/gcc10/gcc-10.3.0/gcc/
H A Dtree-data-ref.c1741 const dr_with_seg_len& dr_a = alias_pair.first; in create_ifn_alias_checks() local
1760 || !tree_fits_uhwi_p (DR_STEP (dr_a.dr))) in create_ifn_alias_checks()
1764 tree addr_a = DR_BASE_ADDRESS (dr_a.dr); in create_ifn_alias_checks()
1777 full_length = seg_len + dr_a.access_size; in create_ifn_alias_checks()
1843 || integer_zerop (DR_STEP (dr_a.dr)) in create_intersect_range_checks_index()
1849 if (!poly_int_tree_p (dr_a.seg_len, &seg_len1) in create_intersect_range_checks_index()
1853 if (!tree_fits_shwi_p (DR_STEP (dr_a.dr))) in create_intersect_range_checks_index()
1897 tree access1 = DR_ACCESS_FN (dr_a.dr, i); in create_intersect_range_checks_index()
2091 tree step = DR_STEP (dr_a.dr); in create_waw_or_war_checks()
2185 DR_OFFSET (dr_a.dr)); in create_waw_or_war_checks()
[all …]
/dports/devel/avr-gcc/gcc-10.2.0/gcc/
H A Dtree-data-ref.c1741 const dr_with_seg_len& dr_a = alias_pair.first; in create_ifn_alias_checks() local
1760 || !tree_fits_uhwi_p (DR_STEP (dr_a.dr))) in create_ifn_alias_checks()
1764 tree addr_a = DR_BASE_ADDRESS (dr_a.dr); in create_ifn_alias_checks()
1777 full_length = seg_len + dr_a.access_size; in create_ifn_alias_checks()
1843 || integer_zerop (DR_STEP (dr_a.dr)) in create_intersect_range_checks_index()
1849 if (!poly_int_tree_p (dr_a.seg_len, &seg_len1) in create_intersect_range_checks_index()
1853 if (!tree_fits_shwi_p (DR_STEP (dr_a.dr))) in create_intersect_range_checks_index()
1897 tree access1 = DR_ACCESS_FN (dr_a.dr, i); in create_intersect_range_checks_index()
2091 tree step = DR_STEP (dr_a.dr); in create_waw_or_war_checks()
2185 DR_OFFSET (dr_a.dr)); in create_waw_or_war_checks()
[all …]
/dports/lang/gcc8/gcc-8.5.0/gcc/
H A Dtree-vect-data-refs.c752 || (DR_IS_READ (dr_a) && ! gimple_vdef (stmt))) in vect_slp_analyze_node_dependences()
779 (dr_a, store_dr, vNULL); in vect_slp_analyze_node_dependences()
3390 || !poly_int_tree_p (DR_INIT (dr_a), &init_a) in vectorizable_with_step_bound_p()
3399 std::swap (dr_a, dr_b); in vectorizable_with_step_bound_p()
3470 struct data_reference *dr_a, *dr_b; in vect_prune_runtime_alias_test_list() local
3500 dr_a = DDR_A (ddr); in vect_prune_runtime_alias_test_list()
3529 && TREE_CODE (DR_STEP (dr_a)) != INTEGER_CST in vect_prune_runtime_alias_test_list()
3588 access_size_a = vect_vfa_access_size (dr_a); in vect_prune_runtime_alias_test_list()
3590 align_a = vect_vfa_align (dr_a); in vect_prune_runtime_alias_test_list()
3601 && 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 …]
/dports/devel/riscv64-none-elf-gcc/gcc-8.4.0/gcc/
H A Dtree-vect-data-refs.c752 || (DR_IS_READ (dr_a) && ! gimple_vdef (stmt))) in vect_slp_analyze_node_dependences()
779 (dr_a, store_dr, vNULL); in vect_slp_analyze_node_dependences()
3390 || !poly_int_tree_p (DR_INIT (dr_a), &init_a) in vectorizable_with_step_bound_p()
3399 std::swap (dr_a, dr_b); in vectorizable_with_step_bound_p()
3470 struct data_reference *dr_a, *dr_b; in vect_prune_runtime_alias_test_list() local
3500 dr_a = DDR_A (ddr); in vect_prune_runtime_alias_test_list()
3529 && TREE_CODE (DR_STEP (dr_a)) != INTEGER_CST in vect_prune_runtime_alias_test_list()
3588 access_size_a = vect_vfa_access_size (dr_a); in vect_prune_runtime_alias_test_list()
3590 align_a = vect_vfa_align (dr_a); in vect_prune_runtime_alias_test_list()
3601 && 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 …]
/dports/devel/arm-none-eabi-gcc/gcc-8.4.0/gcc/
H A Dtree-vect-data-refs.c752 || (DR_IS_READ (dr_a) && ! gimple_vdef (stmt))) in vect_slp_analyze_node_dependences()
779 (dr_a, store_dr, vNULL); in vect_slp_analyze_node_dependences()
3390 || !poly_int_tree_p (DR_INIT (dr_a), &init_a) in vectorizable_with_step_bound_p()
3399 std::swap (dr_a, dr_b); in vectorizable_with_step_bound_p()
3470 struct data_reference *dr_a, *dr_b; in vect_prune_runtime_alias_test_list() local
3500 dr_a = DDR_A (ddr); in vect_prune_runtime_alias_test_list()
3529 && TREE_CODE (DR_STEP (dr_a)) != INTEGER_CST in vect_prune_runtime_alias_test_list()
3588 access_size_a = vect_vfa_access_size (dr_a); in vect_prune_runtime_alias_test_list()
3590 align_a = vect_vfa_align (dr_a); in vect_prune_runtime_alias_test_list()
3601 && 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 …]
/dports/devel/riscv32-unknown-elf-gcc/gcc-8.4.0/gcc/
H A Dtree-vect-data-refs.c752 || (DR_IS_READ (dr_a) && ! gimple_vdef (stmt))) in vect_slp_analyze_node_dependences()
779 (dr_a, store_dr, vNULL); in vect_slp_analyze_node_dependences()
3390 || !poly_int_tree_p (DR_INIT (dr_a), &init_a) in vectorizable_with_step_bound_p()
3399 std::swap (dr_a, dr_b); in vectorizable_with_step_bound_p()
3470 struct data_reference *dr_a, *dr_b; in vect_prune_runtime_alias_test_list() local
3500 dr_a = DDR_A (ddr); in vect_prune_runtime_alias_test_list()
3529 && TREE_CODE (DR_STEP (dr_a)) != INTEGER_CST in vect_prune_runtime_alias_test_list()
3588 access_size_a = vect_vfa_access_size (dr_a); in vect_prune_runtime_alias_test_list()
3590 align_a = vect_vfa_align (dr_a); in vect_prune_runtime_alias_test_list()
3601 && 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 …]
/dports/devel/aarch64-none-elf-gcc/gcc-8.4.0/gcc/
H A Dtree-vect-data-refs.c752 || (DR_IS_READ (dr_a) && ! gimple_vdef (stmt))) in vect_slp_analyze_node_dependences()
779 (dr_a, store_dr, vNULL); in vect_slp_analyze_node_dependences()
3390 || !poly_int_tree_p (DR_INIT (dr_a), &init_a) in vectorizable_with_step_bound_p()
3399 std::swap (dr_a, dr_b); in vectorizable_with_step_bound_p()
3470 struct data_reference *dr_a, *dr_b; in vect_prune_runtime_alias_test_list() local
3500 dr_a = DDR_A (ddr); in vect_prune_runtime_alias_test_list()
3529 && TREE_CODE (DR_STEP (dr_a)) != INTEGER_CST in vect_prune_runtime_alias_test_list()
3588 access_size_a = vect_vfa_access_size (dr_a); in vect_prune_runtime_alias_test_list()
3590 align_a = vect_vfa_align (dr_a); in vect_prune_runtime_alias_test_list()
3601 && 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 …]
/dports/devel/riscv64-gcc/gcc-8.3.0/gcc/
H A Dtree-vect-data-refs.c683 || (DR_IS_READ (dr_a) && ! gimple_vdef (stmt))) in vect_slp_analyze_node_dependences()
710 (dr_a, store_dr, vNULL); in vect_slp_analyze_node_dependences()
3321 || !poly_int_tree_p (DR_INIT (dr_a), &init_a) in vectorizable_with_step_bound_p()
3330 std::swap (dr_a, dr_b); in vectorizable_with_step_bound_p()
3401 struct data_reference *dr_a, *dr_b; in vect_prune_runtime_alias_test_list() local
3431 dr_a = DDR_A (ddr); in vect_prune_runtime_alias_test_list()
3460 && TREE_CODE (DR_STEP (dr_a)) != INTEGER_CST in vect_prune_runtime_alias_test_list()
3519 access_size_a = vect_vfa_access_size (dr_a); in vect_prune_runtime_alias_test_list()
3521 align_a = vect_vfa_align (dr_a); in vect_prune_runtime_alias_test_list()
3532 && 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 …]
/dports/lang/gcc9-devel/gcc-9-20211007/gcc/
H A Dtree-data-ref.c1644 const dr_with_seg_len& dr_a, in create_intersect_range_checks_index() argument
1647 if (integer_zerop (DR_STEP (dr_a.dr)) in create_intersect_range_checks_index()
1653 if (!poly_int_tree_p (dr_a.seg_len, &seg_len1) in create_intersect_range_checks_index()
1657 if (!tree_fits_shwi_p (DR_STEP (dr_a.dr))) in create_intersect_range_checks_index()
1680 seg_len1 += dr_a.access_size; in create_intersect_range_checks_index()
1707 for (i = 0; i < DR_NUM_DIMENSIONS (dr_a.dr); i++) in create_intersect_range_checks_index()
1709 tree access1 = DR_ACCESS_FN (dr_a.dr, i); in create_intersect_range_checks_index()
1878 const dr_with_seg_len& dr_a, in create_intersect_range_checks() argument
1887 if (TREE_CODE (DR_STEP (dr_a.dr)) == INTEGER_CST in create_intersect_range_checks()
1915 min_align = MIN (dr_a.align, dr_b.align); in create_intersect_range_checks()
[all …]
/dports/lang/gcc9/gcc-9.4.0/gcc/
H A Dtree-data-ref.c1644 const dr_with_seg_len& dr_a, in create_intersect_range_checks_index() argument
1647 if (integer_zerop (DR_STEP (dr_a.dr)) in create_intersect_range_checks_index()
1653 if (!poly_int_tree_p (dr_a.seg_len, &seg_len1) in create_intersect_range_checks_index()
1657 if (!tree_fits_shwi_p (DR_STEP (dr_a.dr))) in create_intersect_range_checks_index()
1680 seg_len1 += dr_a.access_size; in create_intersect_range_checks_index()
1707 for (i = 0; i < DR_NUM_DIMENSIONS (dr_a.dr); i++) in create_intersect_range_checks_index()
1709 tree access1 = DR_ACCESS_FN (dr_a.dr, i); in create_intersect_range_checks_index()
1878 const dr_with_seg_len& dr_a, in create_intersect_range_checks() argument
1887 if (TREE_CODE (DR_STEP (dr_a.dr)) == INTEGER_CST in create_intersect_range_checks()
1915 min_align = MIN (dr_a.align, dr_b.align); in create_intersect_range_checks()
[all …]
/dports/lang/gcc9-aux/gcc-9.1.0/gcc/
H A Dtree-data-ref.c1629 const dr_with_seg_len& dr_a, in create_intersect_range_checks_index() argument
1632 if (integer_zerop (DR_STEP (dr_a.dr)) in create_intersect_range_checks_index()
1638 if (!poly_int_tree_p (dr_a.seg_len, &seg_len1) in create_intersect_range_checks_index()
1642 if (!tree_fits_shwi_p (DR_STEP (dr_a.dr))) in create_intersect_range_checks_index()
1665 seg_len1 += dr_a.access_size; in create_intersect_range_checks_index()
1692 for (i = 0; i < DR_NUM_DIMENSIONS (dr_a.dr); i++) in create_intersect_range_checks_index()
1694 tree access1 = DR_ACCESS_FN (dr_a.dr, i); in create_intersect_range_checks_index()
1863 const dr_with_seg_len& dr_a, in create_intersect_range_checks() argument
1872 if (TREE_CODE (DR_STEP (dr_a.dr)) == INTEGER_CST in create_intersect_range_checks()
1900 min_align = MIN (dr_a.align, dr_b.align); in create_intersect_range_checks()
[all …]
/dports/lang/gcc48/gcc-4.8.5/gcc/
H A Dtree-vect-loop-manip.c2311 struct data_reference *dr_a, *dr_b; in vect_create_cond_for_alias_checks() local
2318 dr_a = DDR_A (ddr); in vect_create_cond_for_alias_checks()
2324 dr_a = STMT_VINFO_DATA_REF (vinfo_for_stmt (stmt_a)); in vect_create_cond_for_alias_checks()
2343 if (!operand_equal_p (DR_STEP (dr_a), DR_STEP (dr_b), 0)) in vect_create_cond_for_alias_checks()
2347 segment_length_a = vect_vfa_segment_size (dr_a, length_factor); in vect_create_cond_for_alias_checks()
2354 dump_generic_expr (MSG_OPTIMIZED_LOCATIONS, TDF_SLIM, DR_REF (dr_a)); in vect_create_cond_for_alias_checks()
2361 if (tree_int_cst_compare (DR_STEP (dr_a), size_zero_node) < 0) in vect_create_cond_for_alias_checks()

123