diff --git a/[refs] b/[refs]
index f9b3676b7b8a..a312ac51d2b8 100644
--- a/[refs]
+++ b/[refs]
@@ -1,2 +1,2 @@
 ---
-refs/heads/master: 03b883840c630c7b571690577809754739ac773f
+refs/heads/master: 73486722b70a83bba17be722677519b0855abedf
diff --git a/trunk/kernel/sched.c b/trunk/kernel/sched.c
index 57ba7ea9b744..0014b03adaca 100644
--- a/trunk/kernel/sched.c
+++ b/trunk/kernel/sched.c
@@ -7035,6 +7035,7 @@ static int find_next_best_node(int node, nodemask_t *used_nodes)
 /**
  * sched_domain_node_span - get a cpumask for a node's sched_domain
  * @node: node whose cpumask we're constructing
+ * @span: resulting cpumask
  *
  * Given a node, construct a good cpumask for its sched_domain to span. It
  * should be one that prevents unnecessary balancing, but also spreads tasks