Branch and cache miss speedups

[fio.git] / lib / axmap.c

diff --git a/lib/axmap.c b/lib/axmap.c
index c9f3a4f1a3b16bcaddfe07b43296e50b6da1bd4c..15cd635037a0bdfc565b26c1f2502180eae831af 100644 (file)
--- a/lib/axmap.c
+++ b/lib/axmap.c
@@ -5,7 +5,7 @@
  * nothing to do with anything remotely narcissistic.
  *
  * A set bit at layer N indicates a full word at layer N-1, and so forth. As
- * the bitmap becomes progressively more full, checking for existance
+ * the bitmap becomes progressively more full, checking for existence
  * becomes cheaper (since fewer layers are walked, making it a lot more
  * cache friendly) and locating the next free space likewise.
  *