Lines Matching defs:span
1400 cpumask_t span;
1409 span = sd->span;
1426 weight = cpus_weight(span);
1428 if (weight <= cpus_weight(tmp->span))
1443 * not idle and an idle cpu is available. The span of cpus to
1470 cpus_and(tmp, sd->span, p->cpus_allowed);
1544 if (cpu_isset(cpu, sd->span)) {
3043 cpu_isset(busiest_cpu, sd->span))
5689 cpumask_scnprintf(str, NR_CPUS, sd->span);
5702 printk(KERN_CONT "span %s\n", str);
5704 if (!cpu_isset(cpu, sd->span)) {
5705 printk(KERN_ERR "ERROR: domain->span does not contain "
5749 if (!cpus_equal(sd->span, groupmask))
5750 printk(KERN_ERR "ERROR: groups don't span domain->span\n");
5752 if (sd->parent && !cpus_subset(groupmask, sd->parent->span))
5753 printk(KERN_ERR "ERROR: parent span is not a superset "
5754 "of domain->span\n");
5784 if (cpus_weight(sd->span) == 1)
5815 if (!cpus_equal(sd->span, parent->span))
5888 * init_sched_build_groups takes the cpumask we wish to span, and a pointer
5894 * covered by the given span, and will set each group's ->cpumask correctly,
5898 init_sched_build_groups(cpumask_t span, const cpumask_t *cpu_map,
5906 for_each_cpu_mask(i, span) {
5917 for_each_cpu_mask(j, span) {
5980 * @size: number of nodes to include in this span
5982 * Given a node, construct a good cpumask for its sched_domain to span. It
5989 cpumask_t span, nodemask;
5992 cpus_clear(span);
5996 cpus_or(span, span, nodemask);
6003 cpus_or(span, span, nodemask);
6006 return span;
6264 sd->span = *cpu_map;
6273 sd->span = sched_domain_node_span(cpu_to_node(i));
6277 cpus_and(sd->span, sd->span, *cpu_map);
6283 sd->span = nodemask;
6293 sd->span = cpu_coregroup_map(i);
6294 cpus_and(sd->span, sd->span, *cpu_map);
6304 sd->span = cpu_sibling_map(i);
6305 cpus_and(sd->span, sd->span, *cpu_map);