|
@@ -84,21 +84,21 @@ static cpumask_t cpu_singlethread_map __read_mostly;
|
|
static cpumask_t cpu_populated_map __read_mostly;
|
|
static cpumask_t cpu_populated_map __read_mostly;
|
|
|
|
|
|
/* If it's single threaded, it isn't in the list of workqueues. */
|
|
/* If it's single threaded, it isn't in the list of workqueues. */
|
|
-static inline int is_single_threaded(struct workqueue_struct *wq)
|
|
|
|
|
|
+static inline int is_wq_single_threaded(struct workqueue_struct *wq)
|
|
{
|
|
{
|
|
return wq->singlethread;
|
|
return wq->singlethread;
|
|
}
|
|
}
|
|
|
|
|
|
static const cpumask_t *wq_cpu_map(struct workqueue_struct *wq)
|
|
static const cpumask_t *wq_cpu_map(struct workqueue_struct *wq)
|
|
{
|
|
{
|
|
- return is_single_threaded(wq)
|
|
|
|
|
|
+ return is_wq_single_threaded(wq)
|
|
? &cpu_singlethread_map : &cpu_populated_map;
|
|
? &cpu_singlethread_map : &cpu_populated_map;
|
|
}
|
|
}
|
|
|
|
|
|
static
|
|
static
|
|
struct cpu_workqueue_struct *wq_per_cpu(struct workqueue_struct *wq, int cpu)
|
|
struct cpu_workqueue_struct *wq_per_cpu(struct workqueue_struct *wq, int cpu)
|
|
{
|
|
{
|
|
- if (unlikely(is_single_threaded(wq)))
|
|
|
|
|
|
+ if (unlikely(is_wq_single_threaded(wq)))
|
|
cpu = singlethread_cpu;
|
|
cpu = singlethread_cpu;
|
|
return per_cpu_ptr(wq->cpu_wq, cpu);
|
|
return per_cpu_ptr(wq->cpu_wq, cpu);
|
|
}
|
|
}
|
|
@@ -769,7 +769,7 @@ static int create_workqueue_thread(struct cpu_workqueue_struct *cwq, int cpu)
|
|
{
|
|
{
|
|
struct sched_param param = { .sched_priority = MAX_RT_PRIO-1 };
|
|
struct sched_param param = { .sched_priority = MAX_RT_PRIO-1 };
|
|
struct workqueue_struct *wq = cwq->wq;
|
|
struct workqueue_struct *wq = cwq->wq;
|
|
- const char *fmt = is_single_threaded(wq) ? "%s" : "%s/%d";
|
|
|
|
|
|
+ const char *fmt = is_wq_single_threaded(wq) ? "%s" : "%s/%d";
|
|
struct task_struct *p;
|
|
struct task_struct *p;
|
|
|
|
|
|
p = kthread_create(worker_thread, cwq, fmt, wq->name, cpu);
|
|
p = kthread_create(worker_thread, cwq, fmt, wq->name, cpu);
|