874 	struct sched_domain *sibling;  in build_balance_mask()  local
880 		sibling = *per_cpu_ptr(sdd->sd, i);  in build_balance_mask()
887 		if (!sibling->child)  in build_balance_mask()
891 		if (!cpumask_equal(sg_span, sched_domain_span(sibling->child)))  in build_balance_mask()
957 find_descended_sibling(struct sched_domain *sd, struct sched_domain *sibling)  in find_descended_sibling()  argument
963 	while (sibling->child &&  in find_descended_sibling()
964 	       !cpumask_subset(sched_domain_span(sibling->child),  in find_descended_sibling()
966 		sibling = sibling->child;  in find_descended_sibling()
973 	while (sibling->child &&  in find_descended_sibling()
974 	       cpumask_equal(sched_domain_span(sibling->child),  in find_descended_sibling()
975 			     sched_domain_span(sibling)))  in find_descended_sibling()
976 		sibling = sibling->child;  in find_descended_sibling()
978 	return sibling;  in find_descended_sibling()
988 	struct sched_domain *sibling;  in build_overlap_sched_groups()  local
999 		sibling = *per_cpu_ptr(sdd->sd, i);  in build_overlap_sched_groups()
1007 		 * iteration early and our sibling sd spans will be empty.  in build_overlap_sched_groups()
1011 		if (!cpumask_test_cpu(i, sched_domain_span(sibling)))  in build_overlap_sched_groups()
1015 		 * Usually we build sched_group by sibling's child sched_domain  in build_overlap_sched_groups()
1017 		 * to build sched_group by sibling's proper descendant's child  in build_overlap_sched_groups()
1018 		 * domain because sibling's child sched_domain will span out of  in build_overlap_sched_groups()
1045 		if (sibling->child &&  in build_overlap_sched_groups()
1046 		    !cpumask_subset(sched_domain_span(sibling->child), span))  in build_overlap_sched_groups()
1047 			sibling = find_descended_sibling(sd, sibling);  in build_overlap_sched_groups()
1049 		sg = build_group_from_child_sched_domain(sibling, cpu);  in build_overlap_sched_groups()
1056 		init_overlap_sched_group(sibling, sg);  in build_overlap_sched_groups()