summaryrefslogtreecommitdiff
path: root/kernel-lib
diff options
context:
space:
mode:
Diffstat (limited to 'kernel-lib')
-rw-r--r--kernel-lib/raid56.c2
-rw-r--r--kernel-lib/rbtree.h2
2 files changed, 2 insertions, 2 deletions
diff --git a/kernel-lib/raid56.c b/kernel-lib/raid56.c
index e3a9339e..cd5ee818 100644
--- a/kernel-lib/raid56.c
+++ b/kernel-lib/raid56.c
@@ -330,7 +330,7 @@ int raid56_recov(int nr_devs, size_t stripe_len, u64 profile, int dest1,
return 0;
}
- /* Regerneate data from P */
+ /* Regenerate data from P */
return raid5_gen_result(nr_devs - 1, stripe_len, dest1, data);
}
diff --git a/kernel-lib/rbtree.h b/kernel-lib/rbtree.h
index 47b662a3..6d689075 100644
--- a/kernel-lib/rbtree.h
+++ b/kernel-lib/rbtree.h
@@ -19,7 +19,7 @@
linux/include/linux/rbtree.h
To use rbtrees you'll have to implement your own insert and search cores.
- This will avoid us to use callbacks and to drop drammatically performances.
+ This will avoid us to use callbacks and to drop dramatically performances.
I know it's not the cleaner way, but in C (not in C++) to get
performances and genericity...