* [PATCH] make schedule_on_each_cpu() look like on_each_cpu()
@ 2007-07-26 11:08 Peter Zijlstra
2007-07-26 18:27 ` Oleg Nesterov
0 siblings, 1 reply; 4+ messages in thread
From: Peter Zijlstra @ 2007-07-26 11:08 UTC (permalink / raw)
To: Andrew Morton, Oleg Nesterov, Ingo Molnar; +Cc: linux-kernel
It always bothered me a bit that on_each_cpu() and
schedule_on_each_cpu() had wildly different interfaces.
Rectify this and convert the sole in-kernel user to the new interface.
Signed-off-by: Peter Zijlstra <a.p.zijlstra@chello.nl>
Acked-by: Ingo Molnar <mingo@elte.hu>
---
include/linux/workqueue.h | 2 -
kernel/workqueue.c | 63 ++++++++++++++++++++++++++++++++++++++--------
mm/swap.c | 4 +-
3 files changed, 56 insertions(+), 13 deletions(-)
Index: linux-2.6/include/linux/workqueue.h
===================================================================
--- linux-2.6.orig/include/linux/workqueue.h
+++ linux-2.6/include/linux/workqueue.h
@@ -141,7 +141,7 @@ extern int FASTCALL(schedule_delayed_wor
unsigned long delay));
extern int schedule_delayed_work_on(int cpu, struct delayed_work *work,
unsigned long delay);
-extern int schedule_on_each_cpu(work_func_t func);
+extern int schedule_on_each_cpu(void (*func)(void *info), void *info, int retry, int wait);
extern int current_is_keventd(void);
extern int keventd_up(void);
Index: linux-2.6/kernel/workqueue.c
===================================================================
--- linux-2.6.orig/kernel/workqueue.c
+++ linux-2.6/kernel/workqueue.c
@@ -561,9 +561,28 @@ int schedule_delayed_work_on(int cpu,
}
EXPORT_SYMBOL(schedule_delayed_work_on);
+struct schedule_on_each_cpu_work {
+ struct work_struct work;
+ void (*func)(void *info);
+ void *info;
+};
+
+static void schedule_on_each_cpu_func(struct work_struct *work)
+{
+ struct schedule_on_each_cpu_work *w;
+
+ w = container_of(work, typeof(*w), work);
+ w->func(w->info);
+
+ kfree(w);
+}
+
/**
* schedule_on_each_cpu - call a function on each online CPU from keventd
* @func: the function to call
+ * @info: data to pass to function
+ * @retry: ignored
+ * @wait: wait for completion
*
* Returns zero on success.
* Returns -ve errno on failure.
@@ -572,27 +591,51 @@ EXPORT_SYMBOL(schedule_delayed_work_on);
*
* schedule_on_each_cpu() is very slow.
*/
-int schedule_on_each_cpu(work_func_t func)
+int schedule_on_each_cpu(void (*func)(void *info), void *info, int retry, int wait)
{
int cpu;
- struct work_struct *works;
+ struct schedule_on_each_cpu_work **works;
+ int err = 0;
- works = alloc_percpu(struct work_struct);
+ works = kzalloc(sizeof(void *)*nr_cpu_ids, GFP_KERNEL);
if (!works)
return -ENOMEM;
+ for_each_possible_cpu(cpu) {
+ works[cpu] = kmalloc_node(sizeof(struct schedule_on_each_cpu_work),
+ GFP_KERNEL, cpu_to_node(cpu));
+ if (!works[cpu]) {
+ err = -ENOMEM;
+ goto out;
+ }
+ }
+
preempt_disable(); /* CPU hotplug */
for_each_online_cpu(cpu) {
- struct work_struct *work = per_cpu_ptr(works, cpu);
+ struct schedule_on_each_cpu_work *work;
+
+ work = works[cpu];
+ works[cpu] = NULL;
- INIT_WORK(work, func);
- set_bit(WORK_STRUCT_PENDING, work_data_bits(work));
- __queue_work(per_cpu_ptr(keventd_wq->cpu_wq, cpu), work);
+ work->func = func;
+ work->info = info;
+ INIT_WORK(&work->work, schedule_on_each_cpu_func);
+ set_bit(WORK_STRUCT_PENDING, work_data_bits(&work->work));
+ __queue_work(per_cpu_ptr(keventd_wq->cpu_wq, cpu), &work->work);
}
preempt_enable();
- flush_workqueue(keventd_wq);
- free_percpu(works);
- return 0;
+
+out:
+ for_each_possible_cpu(cpu) {
+ if (works[cpu])
+ kfree(works[cpu]);
+ }
+ kfree(works);
+
+ if (!err && wait)
+ flush_workqueue(keventd_wq);
+
+ return err;
}
void flush_scheduled_work(void)
Index: linux-2.6/mm/swap.c
===================================================================
--- linux-2.6.orig/mm/swap.c
+++ linux-2.6/mm/swap.c
@@ -216,7 +216,7 @@ void lru_add_drain(void)
}
#ifdef CONFIG_NUMA
-static void lru_add_drain_per_cpu(struct work_struct *dummy)
+static void lru_add_drain_per_cpu(void *info)
{
lru_add_drain();
}
@@ -226,7 +226,7 @@ static void lru_add_drain_per_cpu(struct
*/
int lru_add_drain_all(void)
{
- return schedule_on_each_cpu(lru_add_drain_per_cpu);
+ return schedule_on_each_cpu(lru_add_drain_per_cpu, NULL, 0, 1);
}
#else
^ permalink raw reply [flat|nested] 4+ messages in thread
* Re: [PATCH] make schedule_on_each_cpu() look like on_each_cpu()
2007-07-26 11:08 [PATCH] make schedule_on_each_cpu() look like on_each_cpu() Peter Zijlstra
@ 2007-07-26 18:27 ` Oleg Nesterov
2007-07-26 18:30 ` Oleg Nesterov
2007-07-26 18:41 ` Peter Zijlstra
0 siblings, 2 replies; 4+ messages in thread
From: Oleg Nesterov @ 2007-07-26 18:27 UTC (permalink / raw)
To: Peter Zijlstra; +Cc: Andrew Morton, Ingo Molnar, linux-kernel
On 07/26, Peter Zijlstra wrote:
>
> -int schedule_on_each_cpu(work_func_t func)
> +int schedule_on_each_cpu(void (*func)(void *info), void *info, int retry, int wait)
> {
> int cpu;
> - struct work_struct *works;
> + struct schedule_on_each_cpu_work **works;
> + int err = 0;
>
> - works = alloc_percpu(struct work_struct);
> + works = kzalloc(sizeof(void *)*nr_cpu_ids, GFP_KERNEL);
Not a comment, but a question: why do we need nr_cpu_ids at all?
num_possible_cpus() looks more "correct" if cpu_possible_map has
holes (not sure this can happen in practice).
Another off-topic question: shouldn't we kill the unused "retry"
parameter of on_each_cpu() instead of mirroring it here?
> +out:
> + for_each_possible_cpu(cpu) {
> + if (works[cpu])
> + kfree(works[cpu]);
> + }
Small nit, kfree(NULL) is OK.
Oleg.
^ permalink raw reply [flat|nested] 4+ messages in thread
* Re: [PATCH] make schedule_on_each_cpu() look like on_each_cpu()
2007-07-26 18:27 ` Oleg Nesterov
@ 2007-07-26 18:30 ` Oleg Nesterov
2007-07-26 18:41 ` Peter Zijlstra
1 sibling, 0 replies; 4+ messages in thread
From: Oleg Nesterov @ 2007-07-26 18:30 UTC (permalink / raw)
To: Peter Zijlstra; +Cc: Andrew Morton, Ingo Molnar, linux-kernel
On 07/26, Oleg Nesterov wrote:
>
> On 07/26, Peter Zijlstra wrote:
> >
> > -int schedule_on_each_cpu(work_func_t func)
> > +int schedule_on_each_cpu(void (*func)(void *info), void *info, int retry, int wait)
> > {
> > int cpu;
> > - struct work_struct *works;
> > + struct schedule_on_each_cpu_work **works;
> > + int err = 0;
> >
> > - works = alloc_percpu(struct work_struct);
> > + works = kzalloc(sizeof(void *)*nr_cpu_ids, GFP_KERNEL);
>
> Not a comment, but a question: why do we need nr_cpu_ids at all?
> num_possible_cpus() looks more "correct" if cpu_possible_map has
> holes (not sure this can happen in practice).
OOPS, I am stupid, please ignore. Of course, we need the highest CPU
number, not num_possible_cpus().
Oleg.
^ permalink raw reply [flat|nested] 4+ messages in thread
* Re: [PATCH] make schedule_on_each_cpu() look like on_each_cpu()
2007-07-26 18:27 ` Oleg Nesterov
2007-07-26 18:30 ` Oleg Nesterov
@ 2007-07-26 18:41 ` Peter Zijlstra
1 sibling, 0 replies; 4+ messages in thread
From: Peter Zijlstra @ 2007-07-26 18:41 UTC (permalink / raw)
To: Oleg Nesterov; +Cc: Andrew Morton, Ingo Molnar, linux-kernel
On Thu, 2007-07-26 at 22:27 +0400, Oleg Nesterov wrote:
> On 07/26, Peter Zijlstra wrote:
> >
> > -int schedule_on_each_cpu(work_func_t func)
> > +int schedule_on_each_cpu(void (*func)(void *info), void *info, int retry, int wait)
> Another off-topic question: shouldn't we kill the unused "retry"
> parameter of on_each_cpu() instead of mirroring it here?
I'm fine with doing so, but that will be a somewhat larger patch. If you
(and perhaps Andrew?) think that is preferable I'll prepare such a
patch.
> > +out:
> > + for_each_possible_cpu(cpu) {
> > + if (works[cpu])
> > + kfree(works[cpu]);
> > + }
>
> Small nit, kfree(NULL) is OK.
Habbits die hard :-/
^ permalink raw reply [flat|nested] 4+ messages in thread
end of thread, other threads:[~2007-07-26 18:42 UTC | newest]
Thread overview: 4+ messages (download: mbox.gz follow: Atom feed
-- links below jump to the message on this page --
2007-07-26 11:08 [PATCH] make schedule_on_each_cpu() look like on_each_cpu() Peter Zijlstra
2007-07-26 18:27 ` Oleg Nesterov
2007-07-26 18:30 ` Oleg Nesterov
2007-07-26 18:41 ` Peter Zijlstra
This is a public inbox, see mirroring instructions
for how to clone and mirror all data and code used for this inbox