From 393e55f9e3efa81939f9a49ff71652c18b79eddb Mon Sep 17 00:00:00 2001
From: Ingo Molnar <mingo@elte.hu>
Date: Mon, 16 Jul 2007 09:46:31 +0200
Subject: [PATCH] --- yaml --- r: 60427 b: refs/heads/master c:
 5714d2de93fbb156c5e45fb101a2b4f0cae8fbb7 h: refs/heads/master i:   60425:
 8cb36358dd2cef7b3eec11ccc7073a82f3608531   60423:
 dda887e4094e8ff2feec9f443c6eb8014a2f0b81 v: v3

---
 [refs]               | 2 +-
 trunk/kernel/sched.c | 7 +++++++
 2 files changed, 8 insertions(+), 1 deletion(-)

diff --git a/[refs] b/[refs]
index f98444abdca5..cc591a794692 100644
--- a/[refs]
+++ b/[refs]
@@ -1,2 +1,2 @@
 ---
-refs/heads/master: f9153ee6c71cb9ab38de3b8ed66b1c3fa27c3f7d
+refs/heads/master: 5714d2de93fbb156c5e45fb101a2b4f0cae8fbb7
diff --git a/trunk/kernel/sched.c b/trunk/kernel/sched.c
index a7284bc79cdf..90d22b72cf81 100644
--- a/trunk/kernel/sched.c
+++ b/trunk/kernel/sched.c
@@ -748,6 +748,13 @@ static const int prio_to_weight[40] = {
 /*  10 */   110,    87,    70,    56,    45,    36,    29,    23,    18,    15,
 };
 
+/*
+ * Inverse (2^32/x) values of the prio_to_weight[] array, precalculated.
+ *
+ * In cases where the weight does not change often, we can use the
+ * precalculated inverse to speed up arithmetics by turning divisions
+ * into multiplications:
+ */
 static const u32 prio_to_wmult[40] = {
 	48356,   60446,   75558,   94446,  118058,  147573,
 	184467,  230589,  288233,  360285,  450347,