64 int isl_sched_node_scc_exactly(struct isl_sched_node *node, int scc)  in isl_sched_node_scc_exactly()  argument
66 	return node->scc == scc;  in isl_sched_node_scc_exactly()
69 static int node_scc_at_most(struct isl_sched_node *node, int scc)  in node_scc_at_most()  argument
71 	return node->scc <= scc;  in node_scc_at_most()
74 static int node_scc_at_least(struct isl_sched_node *node, int scc)  in node_scc_at_least()  argument
76 	return node->scc >= scc;  in node_scc_at_least()
1460 	graph->scc = 0;  in isl_sched_graph_detect_ccs()
1465 			graph->node[g->order[i]].scc = graph->scc;  in isl_sched_graph_detect_ccs()
1470 		graph->scc++;  in isl_sched_graph_detect_ccs()
1504 	return graph->node[*i1].scc - graph->node[*i2].scc;  in cmp_scc()
2839 		if (graph->edge[i].src->scc == graph->edge[i].dst->scc)  in check_conflict()
2845 		graph->src_scc = graph->edge[i].src->scc;  in check_conflict()
2846 		graph->dst_scc = graph->edge[i].dst->scc;  in check_conflict()
3442 	struct isl_sched_graph *graph, int scc)  in isl_sched_graph_extract_scc()  argument
3445 					&isl_sched_node_scc_exactly, scc);  in isl_sched_graph_extract_scc()
3457 	filters = isl_union_set_list_alloc(ctx, graph->scc);  in isl_sched_graph_extract_sccs()
3458 	for (i = 0; i < graph->scc; ++i) {  in isl_sched_graph_extract_sccs()
3705 int isl_sched_edge_scc_exactly(struct isl_sched_edge *edge, int scc)  in isl_sched_edge_scc_exactly()  argument
3707 	return edge->src->scc == scc && edge->dst->scc == scc;  in isl_sched_edge_scc_exactly()
3710 static int edge_dst_scc_at_most(struct isl_sched_edge *edge, int scc)  in edge_dst_scc_at_most()  argument
3712 	return edge->dst->scc <= scc;  in edge_dst_scc_at_most()
3715 static int edge_src_scc_at_least(struct isl_sched_edge *edge, int scc)  in edge_src_scc_at_least()  argument
3717 	return edge->src->scc >= scc;  in edge_src_scc_at_least()
5197 		if (graph->scc > 1)  in carry()
5206 	} else if (trivial && graph->scc > 1) {  in carry()
5305 	if (graph->scc < graph->n) {  in sort_statements()
5614 		if (graph->scc > 1)  in isl_schedule_node_compute_finish_band()
5777 	if (graph->scc <= 1 || isl_options_get_schedule_whole_component(ctx))  in compute_schedule_wcc()
5812 	if (graph->weak && graph->scc == graph->n) {  in compute_component_schedule()
5826 	for (component = 0; component < graph->scc; ++component) {  in compute_component_schedule()
5865 	if (graph->scc > 1)  in compute_schedule()