Commit 3af968e0 authored by Linus Torvalds's avatar Linus Torvalds
Browse files

async: Fix lack of boot-time console due to insufficient synchronization

Our async work synchronization was broken by "async: make sure
independent async domains can't accidentally entangle" (commit
d5a877e8), because it would report
the wrong lowest active async ID when there was both running and
pending async work.

This caused things like no being able to read the root filesystem,
resulting in missing console devices and inability to run 'init',
causing a boot-time panic.

This fixes it by properly returning the lowest pending async ID: if
there is any running async work, that will have a lower ID than any
pending work, and we should _not_ look at the pending work list.

There were alternative patches from Jaswinder and James, but this one
also cleans up the code by removing the pointless 'ret' variable and
the unnecesary testing for an empty list around 'for_each_entry()' (if
the list is empty, the for_each_entry() thing just won't execute).


Reported-and-tested-by: default avatarChris Clayton <>
Cc: Jaswinder Singh Rajput <>
Cc: James Bottomley <>
Cc: Arjan van de Ven <>
Signed-off-by: default avatarLinus Torvalds <>
parent 46056be7
......@@ -92,23 +92,18 @@ extern int initcall_debug;
static async_cookie_t __lowest_in_progress(struct list_head *running)
struct async_entry *entry;
async_cookie_t ret = next_cookie; /* begin with "infinity" value */
if (!list_empty(running)) {
entry = list_first_entry(running,
struct async_entry, list);
ret = entry->cookie;
return entry->cookie;
if (!list_empty(&async_pending)) {
list_for_each_entry(entry, &async_pending, list)
if (entry->running == running) {
ret = entry->cookie;
list_for_each_entry(entry, &async_pending, list)
if (entry->running == running)
return entry->cookie;
return ret;
return next_cookie; /* "infinity" value */
static async_cookie_t lowest_in_progress(struct list_head *running)
Supports Markdown
0% or .
You are about to add 0 people to the discussion. Proceed with caution.
Finish editing this message first!
Please register or to comment