tdb: spelling fixes

diff --git a/ccan/tdb/freelist.c b/ccan/tdb/freelist.c
index 8113b54951cf83324a086deb24521a5bb2c572f8..c7d908edfdd36de58c3dce7d0218df14d164d779 100644 (file)
--- a/ccan/tdb/freelist.c
+++ b/ccan/tdb/freelist.c
@@ -98,7 +98,7 @@ static int update_tailer(struct tdb_context *tdb, tdb_off_t offset,
 }
 
 /* Add an element into the freelist. Merge adjacent records if
 }
 
 /* Add an element into the freelist. Merge adjacent records if

-   neccessary. */
+   necessary. */

 int tdb_free(struct tdb_context *tdb, tdb_off_t offset, struct tdb_record *rec)
 {
        /* Allocation and tailer lock */
 int tdb_free(struct tdb_context *tdb, tdb_off_t offset, struct tdb_record *rec)
 {
        /* Allocation and tailer lock */

diff --git a/ccan/tdb/tdb.c b/ccan/tdb/tdb.c
index ede0027564099aa44bf501ce1097f030d66dd0c2..7317a3aa521554c898d12a5e5b8f57c7dafea36f 100644 (file)
--- a/ccan/tdb/tdb.c
+++ b/ccan/tdb/tdb.c
@@ -213,7 +213,7 @@ TDB_DATA tdb_fetch(struct tdb_context *tdb, TDB_DATA key)
  * function. The parsing function is executed under the chain read lock, so it
  * should be fast and should not block on other syscalls.
  *
  * function. The parsing function is executed under the chain read lock, so it
  * should be fast and should not block on other syscalls.
  *

- * DONT CALL OTHER TDB CALLS FROM THE PARSER, THIS MIGHT LEAD TO SEGFAULTS.
+ * DON'T CALL OTHER TDB CALLS FROM THE PARSER, THIS MIGHT LEAD TO SEGFAULTS.

  *
  * For mmapped tdb's that do not have a transaction open it points the parsing
  * function directly at the mmap area, it avoids the malloc/memcpy in this
  *
  * For mmapped tdb's that do not have a transaction open it points the parsing
  * function directly at the mmap area, it avoids the malloc/memcpy in this

diff --git a/ccan/tdb/traverse.c b/ccan/tdb/traverse.c
index d329ef4da4030c095e530b0d7b05b344c2256305..c605c8e6a3b5b02344a662d492ad31f3497043cf 100644 (file)
--- a/ccan/tdb/traverse.c
+++ b/ccan/tdb/traverse.c
@@ -39,7 +39,7 @@ static tdb_off_t tdb_next_lock(struct tdb_context *tdb, struct tdb_traverse_lock
        /* Lock each chain from the start one. */
        for (; tlock->hash < tdb->header.hash_size; tlock->hash++) {
                if (!tlock->off && tlock->hash != 0) {
        /* Lock each chain from the start one. */
        for (; tlock->hash < tdb->header.hash_size; tlock->hash++) {
                if (!tlock->off && tlock->hash != 0) {

-                       /* this is an optimisation for the common case where
+                       /* this is an optimization for the common case where

                           the hash chain is empty, which is particularly
                           common for the use of tdb with ldb, where large
                           hashes are used. In that case we spend most of our
                           the hash chain is empty, which is particularly
                           common for the use of tdb with ldb, where large
                           hashes are used. In that case we spend most of our


@@ -53,7 +53,7 @@ static tdb_off_t tdb_next_lock(struct tdb_context *tdb, struct tdb_traverse_lock
                           lock, so instead we get the lock and re-fetch the
                           value below.
                           
                           lock, so instead we get the lock and re-fetch the
                           value below.
                           

-                          Notice that not doing this optimisation on the
+                          Notice that not doing this optimization on the

                           first hash chain is critical. We must guarantee
                           that we have done at least one fcntl lock at the
                           start of a search to guarantee that memory is
                           first hash chain is critical. We must guarantee
                           that we have done at least one fcntl lock at the
                           start of a search to guarantee that memory is