summaryrefslogtreecommitdiff
path: root/kernel-lib/rbtree.h
diff options
context:
space:
mode:
authorJosh Soref <jsoref@users.noreply.github.com>2018-11-26 18:01:42 +0100
committerDavid Sterba <dsterba@suse.com>2018-11-26 18:24:48 +0100
commitb1d39a42a4efd640df365447aadb719eadf7fa49 (patch)
tree3aca0a0ec02ee8971701e5c68da257ffd74fbb6c /kernel-lib/rbtree.h
parent584749488a71149ee038c71e1d48dd3d04d009d4 (diff)
btrfs-progs: fix typos in comments
Generated by https://github.com/jsoref/spelling Issue: #154 Author: Josh Soref <jsoref@users.noreply.github.com> Signed-off-by: David Sterba <dsterba@suse.com>
Diffstat (limited to 'kernel-lib/rbtree.h')
-rw-r--r--kernel-lib/rbtree.h2
1 files changed, 1 insertions, 1 deletions
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...