mm: fix pdflush thread creation upper bound
Fix a race on creating pdflush threads. Without the patch, it is possible to create more than MAX_PDFLUSH_THREADS threads, and this has been observed in practice on IO loaded SMP machines. The fix involves moving the lock around to protect the check against the thread count and correctly dealing with thread creation failure. This fix also _mostly_ repairs a race condition on how quickly the threads are created. The original intent was to create a pdflush thread (up to the max allowed) every second. Without this patch is is possible to create NCPUS pdflush threads concurrently. The 'mostly' caveat is because an assumption is made that thread creation will be successful. If we fail to create the thread, the miss is not considered fatal. (we will try again in 1 second) Signed-off-by: Peter W Morreale <pmorreale@novell.com> Reviewed-by: Rik van Riel <riel@redhat.com> Signed-off-by: Andrew Morton <akpm@linux-foundation.org> Signed-off-by: Linus Torvalds <torvalds@linux-foundation.org>
This commit is contained in:
parent
9133df726f
commit
a56ed66304
30
mm/pdflush.c
30
mm/pdflush.c
|
@ -98,7 +98,6 @@ static int __pdflush(struct pdflush_work *my_work)
|
||||||
INIT_LIST_HEAD(&my_work->list);
|
INIT_LIST_HEAD(&my_work->list);
|
||||||
|
|
||||||
spin_lock_irq(&pdflush_lock);
|
spin_lock_irq(&pdflush_lock);
|
||||||
nr_pdflush_threads++;
|
|
||||||
for ( ; ; ) {
|
for ( ; ; ) {
|
||||||
struct pdflush_work *pdf;
|
struct pdflush_work *pdf;
|
||||||
|
|
||||||
|
@ -126,20 +125,26 @@ static int __pdflush(struct pdflush_work *my_work)
|
||||||
|
|
||||||
(*my_work->fn)(my_work->arg0);
|
(*my_work->fn)(my_work->arg0);
|
||||||
|
|
||||||
|
spin_lock_irq(&pdflush_lock);
|
||||||
|
|
||||||
/*
|
/*
|
||||||
* Thread creation: For how long have there been zero
|
* Thread creation: For how long have there been zero
|
||||||
* available threads?
|
* available threads?
|
||||||
|
*
|
||||||
|
* To throttle creation, we reset last_empty_jifs.
|
||||||
*/
|
*/
|
||||||
if (time_after(jiffies, last_empty_jifs + 1 * HZ)) {
|
if (time_after(jiffies, last_empty_jifs + 1 * HZ)) {
|
||||||
/* unlocked list_empty() test is OK here */
|
|
||||||
if (list_empty(&pdflush_list)) {
|
if (list_empty(&pdflush_list)) {
|
||||||
/* unlocked test is OK here */
|
if (nr_pdflush_threads < MAX_PDFLUSH_THREADS) {
|
||||||
if (nr_pdflush_threads < MAX_PDFLUSH_THREADS)
|
last_empty_jifs = jiffies;
|
||||||
|
nr_pdflush_threads++;
|
||||||
|
spin_unlock_irq(&pdflush_lock);
|
||||||
start_one_pdflush_thread();
|
start_one_pdflush_thread();
|
||||||
|
spin_lock_irq(&pdflush_lock);
|
||||||
|
}
|
||||||
}
|
}
|
||||||
}
|
}
|
||||||
|
|
||||||
spin_lock_irq(&pdflush_lock);
|
|
||||||
my_work->fn = NULL;
|
my_work->fn = NULL;
|
||||||
|
|
||||||
/*
|
/*
|
||||||
|
@ -236,13 +241,26 @@ int pdflush_operation(void (*fn)(unsigned long), unsigned long arg0)
|
||||||
|
|
||||||
static void start_one_pdflush_thread(void)
|
static void start_one_pdflush_thread(void)
|
||||||
{
|
{
|
||||||
kthread_run(pdflush, NULL, "pdflush");
|
struct task_struct *k;
|
||||||
|
|
||||||
|
k = kthread_run(pdflush, NULL, "pdflush");
|
||||||
|
if (unlikely(IS_ERR(k))) {
|
||||||
|
spin_lock_irq(&pdflush_lock);
|
||||||
|
nr_pdflush_threads--;
|
||||||
|
spin_unlock_irq(&pdflush_lock);
|
||||||
|
}
|
||||||
}
|
}
|
||||||
|
|
||||||
static int __init pdflush_init(void)
|
static int __init pdflush_init(void)
|
||||||
{
|
{
|
||||||
int i;
|
int i;
|
||||||
|
|
||||||
|
/*
|
||||||
|
* Pre-set nr_pdflush_threads... If we fail to create,
|
||||||
|
* the count will be decremented.
|
||||||
|
*/
|
||||||
|
nr_pdflush_threads = MIN_PDFLUSH_THREADS;
|
||||||
|
|
||||||
for (i = 0; i < MIN_PDFLUSH_THREADS; i++)
|
for (i = 0; i < MIN_PDFLUSH_THREADS; i++)
|
||||||
start_one_pdflush_thread();
|
start_one_pdflush_thread();
|
||||||
return 0;
|
return 0;
|
||||||
|
|
Loading…
Reference in a new issue