Lines Matching refs:n_source
207 int n_source; member
449 dep->n_source = n; in isl_flow_alloc()
498 for (i = 0; i < deps->n_source; ++i) { in isl_flow_foreach()
531 for (i = 0; i < deps->n_source; ++i) in isl_flow_free()
1384 for (j = 0; j < res->n_source; ++j) { in isl_access_info_compute_flow()
2551 for (i = 0; i < flow->n_source; ++i) { in compute_flow()
2746 int n_source; member
2766 if (data->n_sink == 0 || data->n_source == 0) in isl_compute_flow_schedule_data_align_params()
2774 for (i = 0; i < data->n_source; ++i) in isl_compute_flow_schedule_data_align_params()
2782 for (i = 0; i < data->n_source; ++i) in isl_compute_flow_schedule_data_align_params()
2806 for (i = 0; i < data->n_source; ++i) { in isl_compute_flow_schedule_data_clear()
2846 data->n_source += n = isl_union_map_n_map(umap); in count_sink_source()
2853 data->n_source += n = isl_union_map_n_map(umap); in count_sink_source()
2875 access = data->source + data->n_source++; in extract_sink_source()
3027 for (i = 0; i < data->n_source; ++i) { in add_matching_sources()
3085 &before_node, data->n_source); in compute_single_flow()
3101 for (i = 0; i < flow->n_source; ++i) { in compute_single_flow()
3151 data.n_source = 0; in compute_flow_schedule()
3156 n = data.n_sink + data.n_source; in compute_flow_schedule()
3163 data.n_source = 0; in compute_flow_schedule()