Home
last modified time | relevance | path

Searched refs:datarefs (Results 1 – 25 of 44) sorted by relevance

12

/netbsd-src/external/gpl3/gcc.old/dist/gcc/
H A Dgimple-loop-interchange.cc937 free_data_refs_with_aux (vec<data_reference_p> datarefs) in free_data_refs_with_aux() argument
940 for (unsigned i = 0; datarefs.iterate (i, &dr); ++i) in free_data_refs_with_aux()
947 free_data_refs (datarefs); in free_data_refs_with_aux()
986 vec<data_reference_p> datarefs, in update_data_info() argument
993 for (unsigned i = 0; datarefs.iterate (i, &dr); ++i) in update_data_info()
1363 vec<data_reference_p> datarefs) in compute_access_strides() argument
1369 for (i = 0; datarefs.iterate (i, &dr); ++i) in compute_access_strides()
1381 for (i = 0; datarefs.iterate (i, &dr); ++i) in compute_access_strides()
1402 vec<data_reference_p> datarefs) in prune_access_strides_not_in_loop() argument
1409 for (unsigned i = 0; datarefs.iterate (i, &dr); ++i) in prune_access_strides_not_in_loop()
[all …]
H A Dgimple-loop-jam.c508 vec<data_reference_p> datarefs; in tree_loop_unroll_and_jam() local
516 datarefs.create (10); in tree_loop_unroll_and_jam()
518 &datarefs, &dependences)) in tree_loop_unroll_and_jam()
522 free_data_refs (datarefs); in tree_loop_unroll_and_jam()
526 if (!datarefs.length ()) in tree_loop_unroll_and_jam()
576 else if (removed * 100 / datarefs.length () in tree_loop_unroll_and_jam()
603 free_data_refs (datarefs); in tree_loop_unroll_and_jam()
H A Dtree-vectorizer.c482 : datarefs (vNULL), in vec_info_shared()
490 free_data_refs (datarefs); in ~vec_info_shared()
500 datarefs_copy.reserve_exact (datarefs.length ()); in save_datarefs()
501 for (unsigned i = 0; i < datarefs.length (); ++i) in save_datarefs()
502 datarefs_copy.quick_push (*datarefs[i]); in save_datarefs()
510 gcc_assert (datarefs.length () == datarefs_copy.length ()); in check_datarefs()
511 for (unsigned i = 0; i < datarefs.length (); ++i) in check_datarefs()
512 if (memcmp (&datarefs_copy[i], datarefs[i], sizeof (data_reference)) != 0) in check_datarefs()
H A Dtree-vect-data-refs.c872 FOR_EACH_VEC_ELT (vinfo->shared->datarefs, i, dr) in vect_record_base_alignments()
1167 vec<data_reference_p> datarefs = vinfo->shared->datarefs; in vect_verify_datarefs_alignment() local
1171 FOR_EACH_VEC_ELT (datarefs, i, dr) in vect_verify_datarefs_alignment()
1412 vec<data_reference_p> datarefs = LOOP_VINFO_DATAREFS (loop_vinfo); in vect_get_peeling_costs_all_drs() local
1416 FOR_EACH_VEC_ELT (datarefs, i, dr) in vect_get_peeling_costs_all_drs()
1540 vec<data_reference_p> datarefs = LOOP_VINFO_DATAREFS (loop_vinfo); in vect_peeling_supportable() local
1544 FOR_EACH_VEC_ELT (datarefs, i, dr) in vect_peeling_supportable()
1672 vec<data_reference_p> datarefs = LOOP_VINFO_DATAREFS (loop_vinfo); in vect_enhance_data_refs_alignment() local
1730 FOR_EACH_VEC_ELT (datarefs, i, dr) in vect_enhance_data_refs_alignment()
2143 FOR_EACH_VEC_ELT (datarefs, i, dr) in vect_enhance_data_refs_alignment()
[all …]
H A Dtree-loop-distribution.c169 vec<data_reference_p> datarefs; member
179 #define RDGV_DATAREFS(V) ((struct rdg_vertex *) ((V)->data))->datarefs
261 bitmap datarefs; member
828 partition->datarefs = BITMAP_ALLOC (NULL); in partition_alloc()
838 BITMAP_FREE (partition->datarefs); in partition_free()
887 bitmap_ior_into (dest->datarefs, partition->datarefs); in partition_merge_into()
1426 EXECUTE_IF_SET_IN_BITMAP (partition1->datarefs, 0, i, bi) in update_type_for_merge()
1431 EXECUTE_IF_SET_IN_BITMAP (partition2->datarefs, start, j, bj) in update_type_for_merge()
1474 bitmap_set_bit (partition->datarefs, idx); in build_rdg_partition_for_vertex()
1883 EXECUTE_IF_SET_IN_BITMAP (partition1->datarefs, 0, i, bi) in share_memory_accesses()
[all …]
H A Dtree-data-ref.c169 dump_data_references (FILE *file, vec<data_reference_p> datarefs) in dump_data_references() argument
174 FOR_EACH_VEC_ELT (datarefs, i, dr) in dump_data_references()
199 debug_data_references (vec<data_reference_p> datarefs) in debug_data_references() argument
201 dump_data_references (stderr, datarefs); in debug_data_references()
5383 compute_all_dependences (vec<data_reference_p> datarefs, in compute_all_dependences() argument
5392 if ((int) datarefs.length () in compute_all_dependences()
5404 FOR_EACH_VEC_ELT (datarefs, i, a) in compute_all_dependences()
5405 for (j = i + 1; datarefs.iterate (j, &b); j++) in compute_all_dependences()
5415 FOR_EACH_VEC_ELT (datarefs, i, a) in compute_all_dependences()
5609 vec<data_reference_p> *datarefs) in find_data_references_in_stmt() argument
[all …]
H A Dtree-predcom.c755 vec<data_reference_p> datarefs, in split_data_refs_to_components() argument
758 unsigned i, n = datarefs.length (); in split_data_refs_to_components()
772 FOR_EACH_VEC_ELT (datarefs, i, dr) in split_data_refs_to_components()
792 FOR_EACH_VEC_ELT (datarefs, i, dr) in split_data_refs_to_components()
891 FOR_EACH_VEC_ELT (datarefs, i, dr) in split_data_refs_to_components()
3213 vec<data_reference_p> datarefs; in tree_predictive_commoning_loop() local
3238 datarefs.create (10); in tree_predictive_commoning_loop()
3239 if (! compute_data_dependences_for_loop (loop, true, &loop_nest, &datarefs, in tree_predictive_commoning_loop()
3244 free_data_refs (datarefs); in tree_predictive_commoning_loop()
3252 components = split_data_refs_to_components (loop, datarefs, dependences); in tree_predictive_commoning_loop()
[all …]
H A Dtree-ssa-loop-prefetch.c1604 vec<data_reference_p> datarefs = vNULL; in determine_loop_nest_reuse() local
1671 datarefs.safe_push (dr); in determine_loop_nest_reuse()
1677 FOR_EACH_VEC_ELT (datarefs, i, dr) in determine_loop_nest_reuse()
1688 if (!compute_all_dependences (datarefs, &dependences, vloops, true)) in determine_loop_nest_reuse()
1758 free_data_refs (datarefs); in determine_loop_nest_reuse()
H A Dtree-vectorizer.h289 vec<data_reference_p> datarefs;
693 #define LOOP_VINFO_DATAREFS(L) (L)->shared->datarefs
772 #define BB_VINFO_DATAREFS(B) (B)->shared->datarefs
H A Dtree-vect-slp.c3252 vec<data_reference_p> datarefs, in vect_slp_bb_region() argument
3272 bool first_time_p = shared.datarefs.is_empty (); in vect_slp_bb_region()
3273 BB_VINFO_DATAREFS (bb_vinfo) = datarefs; in vect_slp_bb_region()
3382 vec<data_reference_p> datarefs = vNULL; in vect_slp_bb() local
3395 if (!vect_find_stmt_data_reference (NULL, stmt, &datarefs)) in vect_slp_bb()
3415 else if (vect_slp_bb_region (region_begin, region_end, datarefs, insns)) in vect_slp_bb()
H A Dtree-vect-loop.c1740 vec<data_reference_p> *datarefs, in vect_get_datarefs_in_loop() argument
1752 opt_result res = vect_find_stmt_data_reference (loop, stmt, datarefs); in vect_get_datarefs_in_loop()
1789 if (datarefs->length () in vect_get_datarefs_in_loop()
1807 vec<data_reference_p> datarefs = loop_vinfo->shared->datarefs; in vect_dissolve_slp_only_groups() local
1808 FOR_EACH_VEC_ELT (datarefs, i, dr) in vect_dissolve_slp_only_groups()
8649 vec<data_reference_p> datarefs = epilogue_vinfo->shared->datarefs; in update_epilogue_loop_vinfo() local
8650 FOR_EACH_VEC_ELT (datarefs, i, dr) in update_epilogue_loop_vinfo()
H A Dtree-parloops.c1122 vec<data_reference_p> datarefs; in loop_parallel_p() local
1138 datarefs.create (10); in loop_parallel_p()
1140 if (! compute_data_dependences_for_loop (loop, true, &loop_nest, &datarefs, in loop_parallel_p()
1166 free_data_refs (datarefs); in loop_parallel_p()
H A Dtree-vect-loop-manip.c1748 vec<data_reference_p> datarefs = LOOP_VINFO_DATAREFS (loop_vinfo); in vect_update_inits_of_drs() local
1760 FOR_EACH_VEC_ELT (datarefs, i, dr) in vect_update_inits_of_drs()
/netbsd-src/external/gpl3/gcc/dist/gcc/
H A Dgimple-loop-interchange.cc937 free_data_refs_with_aux (vec<data_reference_p> datarefs) in free_data_refs_with_aux() argument
940 for (unsigned i = 0; datarefs.iterate (i, &dr); ++i) in free_data_refs_with_aux()
947 free_data_refs (datarefs); in free_data_refs_with_aux()
986 vec<data_reference_p> datarefs, in update_data_info() argument
993 for (unsigned i = 0; datarefs.iterate (i, &dr); ++i) in update_data_info()
1374 vec<data_reference_p> datarefs) in compute_access_strides() argument
1381 for (i = 0; datarefs.iterate (i, &dr); ++i) in compute_access_strides()
1393 for (i = 0; datarefs.iterate (i, &dr); ++i) in compute_access_strides()
1414 vec<data_reference_p> datarefs) in prune_access_strides_not_in_loop() argument
1421 for (unsigned i = 0; datarefs.iterate (i, &dr); ++i) in prune_access_strides_not_in_loop()
[all …]
H A Dgimple-loop-jam.cc512 vec<data_reference_p> datarefs = vNULL; in tree_loop_unroll_and_jam() local
520 &datarefs, &dependences)) in tree_loop_unroll_and_jam()
524 free_data_refs (datarefs); in tree_loop_unroll_and_jam()
528 if (!datarefs.length ()) in tree_loop_unroll_and_jam()
578 else if (removed * 100 / datarefs.length () in tree_loop_unroll_and_jam()
608 free_data_refs (datarefs); in tree_loop_unroll_and_jam()
H A Dtree-vect-data-refs.cc979 for (data_reference *dr : vinfo->shared->datarefs) in vect_record_base_alignments()
1535 vec<data_reference_p> datarefs = LOOP_VINFO_DATAREFS (loop_vinfo); in vect_get_peeling_costs_all_drs() local
1542 for (data_reference *dr : datarefs) in vect_get_peeling_costs_all_drs()
1675 vec<data_reference_p> datarefs = LOOP_VINFO_DATAREFS (loop_vinfo); in vect_peeling_supportable() local
1683 for (data_reference *dr : datarefs) in vect_peeling_supportable()
1873 auto_vec<data_reference_p> datarefs in vect_enhance_data_refs_alignment() local
1875 datarefs.qsort (dr_align_group_sort_cmp); in vect_enhance_data_refs_alignment()
1879 auto_vec<unsigned> n_same_align_refs (datarefs.length ()); in vect_enhance_data_refs_alignment()
1880 n_same_align_refs.quick_grow_cleared (datarefs.length ()); in vect_enhance_data_refs_alignment()
1882 for (i0 = 0; i0 < datarefs.length (); ++i0) in vect_enhance_data_refs_alignment()
[all …]
H A Dtree-vectorizer.cc480 datarefs (vNULL), in vec_info_shared()
488 free_data_refs (datarefs); in ~vec_info_shared()
498 datarefs_copy.reserve_exact (datarefs.length ()); in save_datarefs()
499 for (unsigned i = 0; i < datarefs.length (); ++i) in save_datarefs()
500 datarefs_copy.quick_push (*datarefs[i]); in save_datarefs()
508 gcc_assert (datarefs.length () == datarefs_copy.length ()); in check_datarefs()
509 for (unsigned i = 0; i < datarefs.length (); ++i) in check_datarefs()
510 if (memcmp (&datarefs_copy[i], datarefs[i], in check_datarefs()
H A Dtree-data-ref.cc173 dump_data_references (FILE *file, vec<data_reference_p> datarefs) in dump_data_references() argument
175 for (data_reference *dr : datarefs) in dump_data_references()
200 debug_data_references (vec<data_reference_p> datarefs) in debug_data_references() argument
202 dump_data_references (stderr, datarefs); in debug_data_references()
5710 compute_all_dependences (const vec<data_reference_p> &datarefs, in compute_all_dependences() argument
5719 if ((int) datarefs.length () in compute_all_dependences()
5731 FOR_EACH_VEC_ELT (datarefs, i, a) in compute_all_dependences()
5732 for (j = i + 1; datarefs.iterate (j, &b); j++) in compute_all_dependences()
5742 FOR_EACH_VEC_ELT (datarefs, i, a) in compute_all_dependences()
5936 vec<data_reference_p> *datarefs) in find_data_references_in_stmt() argument
[all …]
H A Dtree-loop-distribution.cc173 vec<data_reference_p> datarefs; member
183 #define RDGV_DATAREFS(V) ((struct rdg_vertex *) ((V)->data))->datarefs
265 bitmap datarefs; member
838 partition->datarefs = BITMAP_ALLOC (NULL); in partition_alloc()
848 BITMAP_FREE (partition->datarefs); in partition_free()
897 bitmap_ior_into (dest->datarefs, partition->datarefs); in partition_merge_into()
1436 EXECUTE_IF_SET_IN_BITMAP (partition1->datarefs, 0, i, bi) in update_type_for_merge()
1441 EXECUTE_IF_SET_IN_BITMAP (partition2->datarefs, start, j, bj) in update_type_for_merge()
1484 bitmap_set_bit (partition->datarefs, idx); in build_rdg_partition_for_vertex()
1911 EXECUTE_IF_SET_IN_BITMAP (partition1->datarefs, 0, i, bi) in share_memory_accesses()
[all …]
H A Dtree-ssa-loop-prefetch.cc1603 vec<data_reference_p> datarefs = vNULL; in determine_loop_nest_reuse() local
1670 datarefs.safe_push (dr); in determine_loop_nest_reuse()
1676 FOR_EACH_VEC_ELT (datarefs, i, dr) in determine_loop_nest_reuse()
1687 if (!compute_all_dependences (datarefs, &dependences, vloops, true)) in determine_loop_nest_reuse()
1757 free_data_refs (datarefs); in determine_loop_nest_reuse()
H A Dtree-vectorizer.h404 vec<data_reference_p> datarefs;
890 #define LOOP_VINFO_DATAREFS(L) (L)->shared->datarefs
990 #define BB_VINFO_DATAREFS(B) (B)->shared->datarefs
H A Dtree-parloops.cc1122 vec<data_reference_p> datarefs; in loop_parallel_p() local
1138 datarefs.create (10); in loop_parallel_p()
1140 if (! compute_data_dependences_for_loop (loop, true, &loop_nest, &datarefs, in loop_parallel_p()
1166 free_data_refs (datarefs); in loop_parallel_p()
H A Dtree-vect-slp.cc5981 vect_slp_region (vec<basic_block> bbs, vec<data_reference_p> datarefs, in vect_slp_region() argument
6002 bool first_time_p = shared.datarefs.is_empty (); in vect_slp_region()
6003 BB_VINFO_DATAREFS (bb_vinfo) = datarefs; in vect_slp_region()
6173 vec<data_reference_p> datarefs = vNULL; in vect_slp_bbs() local
6193 if (!vect_find_stmt_data_reference (NULL, stmt, &datarefs, in vect_slp_bbs()
6201 return vect_slp_region (bbs, datarefs, &dataref_groups, insns, orig_loop); in vect_slp_bbs()
H A Dtree-vect-loop.cc1976 vec<data_reference_p> *datarefs, in vect_get_datarefs_in_loop() argument
1988 opt_result res = vect_find_stmt_data_reference (loop, stmt, datarefs, in vect_get_datarefs_in_loop()
2026 if (datarefs->length () in vect_get_datarefs_in_loop()
2044 vec<data_reference_p> datarefs = LOOP_VINFO_DATAREFS (loop_vinfo); in vect_dissolve_slp_only_groups() local
2045 FOR_EACH_VEC_ELT (datarefs, i, dr) in vect_dissolve_slp_only_groups()
9621 vec<data_reference_p> datarefs = LOOP_VINFO_DATAREFS (epilogue_vinfo); in update_epilogue_loop_vinfo() local
9622 FOR_EACH_VEC_ELT (datarefs, i, dr) in update_epilogue_loop_vinfo()
H A Dtree-vect-loop-manip.cc1827 vec<data_reference_p> datarefs = LOOP_VINFO_DATAREFS (loop_vinfo); in vect_update_inits_of_drs() local
1839 FOR_EACH_VEC_ELT (datarefs, i, dr) in vect_update_inits_of_drs()

12