Fix typos detected by github.com/client9/misspell

diff --git a/ccan/antithread/examples/arabella.c b/ccan/antithread/examples/arabella.c
index 47aca2ef20562c610b6311e43ff1dc31417b7f47..82643b591d16e7455d6383e6a03297ca8468d4a7 100644 (file)
--- a/ccan/antithread/examples/arabella.c
+++ b/ccan/antithread/examples/arabella.c
@@ -128,7 +128,7 @@ static void paint_triangle(struct image *image, const struct triangle *tri)
         x1 = tri->coord[i1].x, y1 = tri->coord[i1].y;
         x2 = tri->coord[i2].x, y2 = tri->coord[i2].y;
         
         x1 = tri->coord[i1].x, y1 = tri->coord[i1].y;
         x2 = tri->coord[i2].x, y2 = tri->coord[i2].y;
         

-        // test for easy cases, else split trinagle in two and render both halfs
+        // test for easy cases, else split triangle in two and render both halfs

         if (y1 == y2) {
                if (x1 > x2) swap(&x1, &x2);
                add_flat_triangle(image, x1, y1, x2, y2, x0, y0,
         if (y1 == y2) {
                if (x1 > x2) swap(&x1, &x2);
                add_flat_triangle(image, x1, y1, x2, y2, x0, y0,

diff --git a/ccan/asort/test/run.c b/ccan/asort/test/run.c
index 69bab9755fba43c34caa61960d3dcf2269e99810..e07fe283406a201d0a741ad4d56d31e5c875f295 100644 (file)
--- a/ccan/asort/test/run.c
+++ b/ccan/asort/test/run.c
@@ -35,7 +35,7 @@ static bool is_reverse_sorted(const int arr[], unsigned int size)
        return true;
 }
 
        return true;
 }
 

-static void psuedo_random_array(int arr[], unsigned int size)
+static void pseudo_random_array(int arr[], unsigned int size)

 {
        unsigned int i;
 
 {
        unsigned int i;
 


@@ -52,14 +52,14 @@ int main(void)
 
        plan_tests(4);
 
 
        plan_tests(4);
 

-       psuedo_random_array(tmparr, TEST_SIZE);
+       pseudo_random_array(tmparr, TEST_SIZE);

        ok1(!is_sorted(tmparr, TEST_SIZE));
        ok1(!is_reverse_sorted(tmparr, TEST_SIZE));
 
        asort(tmparr, TEST_SIZE, test_cmp, &multiplier);
        ok1(is_sorted(tmparr, TEST_SIZE));
 
        ok1(!is_sorted(tmparr, TEST_SIZE));
        ok1(!is_reverse_sorted(tmparr, TEST_SIZE));
 
        asort(tmparr, TEST_SIZE, test_cmp, &multiplier);
        ok1(is_sorted(tmparr, TEST_SIZE));
 

-       psuedo_random_array(tmparr, TEST_SIZE);
+       pseudo_random_array(tmparr, TEST_SIZE);

        multiplier = -1;
        asort(tmparr, TEST_SIZE, test_cmp, &multiplier);
        ok1(is_reverse_sorted(tmparr, TEST_SIZE));
        multiplier = -1;
        asort(tmparr, TEST_SIZE, test_cmp, &multiplier);
        ok1(is_reverse_sorted(tmparr, TEST_SIZE));

diff --git a/ccan/autodata/autodata.h b/ccan/autodata/autodata.h
index 3f0a71a3f66d4024585a7b846d4928a7938d49c7..1e513963f73f3209b2412782e38381fa5745ad59 100644 (file)
--- a/ccan/autodata/autodata.h
+++ b/ccan/autodata/autodata.h
@@ -12,7 +12,7 @@
  * @name: the name for this set of autodata
  * @type: the type this autodata points to
  *
  * @name: the name for this set of autodata
  * @type: the type this autodata points to
  *

- * This macro is usually placed in a header: it must preceed any
+ * This macro is usually placed in a header: it must precede any

  * autodata functions in the file.
  *
  * Example:
  * autodata functions in the file.
  *
  * Example:

diff --git a/ccan/bitops/bitops.h b/ccan/bitops/bitops.h
index 899b9150812fd8dd71ca97a7f10984ecab51f8ac..4e81f5716fb3c0d4cc0c8a5aad1746140da5bbeb 100644 (file)
--- a/ccan/bitops/bitops.h
+++ b/ccan/bitops/bitops.h
@@ -15,7 +15,7 @@
 /**
  * bitops_ffs32: find first set bit in a uint32_t
  *
 /**
  * bitops_ffs32: find first set bit in a uint32_t
  *

- * Returns 1 for least signficant bit, 32 for most significant bit, 0
+ * Returns 1 for least significant bit, 32 for most significant bit, 0

  * for no bits set.
  */
 static inline int bitops_ffs32(uint32_t u)
  * for no bits set.
  */
 static inline int bitops_ffs32(uint32_t u)


@@ -26,7 +26,7 @@ static inline int bitops_ffs32(uint32_t u)
 /**
  * bitops_ffs64: find lowest set bit in a uint64_t
  *
 /**
  * bitops_ffs64: find lowest set bit in a uint64_t
  *

- * Returns 1 for least signficant bit, 32 for most significant bit, 0
+ * Returns 1 for least significant bit, 32 for most significant bit, 0

  * for no bits set.
  */
 static inline int bitops_ffs64(uint64_t u)
  * for no bits set.
  */
 static inline int bitops_ffs64(uint64_t u)


@@ -46,8 +46,8 @@ int bitops_ffs64(uint64_t u);
 /**
  * bitops_clz32: count leading zeros in a uint32_t (must not be 0)
  *
 /**
  * bitops_clz32: count leading zeros in a uint32_t (must not be 0)
  *

- * Returns 0 if most signficant bit is set, 31 if only least
- * signficant bit is set.
+ * Returns 0 if most significant bit is set, 31 if only least
+ * significant bit is set.

  */
 static inline int bitops_clz32(uint32_t u)
 {
  */
 static inline int bitops_clz32(uint32_t u)
 {


@@ -58,8 +58,8 @@ static inline int bitops_clz32(uint32_t u)
 /**
  * bitops_clz64: count leading zeros in a uint64_t (must not be 0)
  *
 /**
  * bitops_clz64: count leading zeros in a uint64_t (must not be 0)
  *

- * Returns 0 if most signficant bit is set, 63 if only least
- * signficant bit is set.
+ * Returns 0 if most significant bit is set, 63 if only least
+ * significant bit is set.

  */
 static inline int bitops_clz64(uint64_t u)
 {
  */
 static inline int bitops_clz64(uint64_t u)
 {


@@ -79,8 +79,8 @@ int bitops_clz64(uint64_t u);
 /**
  * bitops_ctz32: count trailing zeros in a uint32_t (must not be 0)
  *
 /**
  * bitops_ctz32: count trailing zeros in a uint32_t (must not be 0)
  *

- * Returns 0 if least signficant bit is set, 31 if only most
- * signficant bit is set.
+ * Returns 0 if least significant bit is set, 31 if only most
+ * significant bit is set.

  */
 static inline int bitops_ctz32(uint32_t u)
 {
  */
 static inline int bitops_ctz32(uint32_t u)
 {


@@ -91,8 +91,8 @@ static inline int bitops_ctz32(uint32_t u)
 /**
  * bitops_ctz64: count trailing zeros in a uint64_t (must not be 0)
  *
 /**
  * bitops_ctz64: count trailing zeros in a uint64_t (must not be 0)
  *

- * Returns 0 if least signficant bit is set, 63 if only most
- * signficant bit is set.
+ * Returns 0 if least significant bit is set, 63 if only most
+ * significant bit is set.

  */
 static inline int bitops_ctz64(uint64_t u)
 {
  */
 static inline int bitops_ctz64(uint64_t u)
 {


@@ -111,7 +111,7 @@ int bitops_ctz64(uint64_t u);
 /**
  * bitops_ls32: find lowest set bit in a uint32_t (must not be zero)
  *
 /**
  * bitops_ls32: find lowest set bit in a uint32_t (must not be zero)
  *

- * Returns 0 for least signficant bit, 31 for most significant bit.
+ * Returns 0 for least significant bit, 31 for most significant bit.

  */
 static inline int bitops_ls32(uint32_t u)
 {
  */
 static inline int bitops_ls32(uint32_t u)
 {


@@ -122,7 +122,7 @@ static inline int bitops_ls32(uint32_t u)
 /**
  * bitops_ls64: find lowest set bit in a uint64_t (must not be zero)
  *
 /**
  * bitops_ls64: find lowest set bit in a uint64_t (must not be zero)
  *

- * Returns 0 for least signficant bit, 63 for most significant bit.
+ * Returns 0 for least significant bit, 63 for most significant bit.

  */
 static inline int bitops_ls64(uint64_t u)
 {
  */
 static inline int bitops_ls64(uint64_t u)
 {


@@ -133,7 +133,7 @@ static inline int bitops_ls64(uint64_t u)
 /**
  * bitops_hs32: find highest set bit in a uint32_t (must not be zero)
  *
 /**
  * bitops_hs32: find highest set bit in a uint32_t (must not be zero)
  *

- * Returns 0 for least signficant bit, 31 for most significant bit.
+ * Returns 0 for least significant bit, 31 for most significant bit.

  */
 static inline int bitops_hs32(uint32_t u)
 {
  */
 static inline int bitops_hs32(uint32_t u)
 {


@@ -144,7 +144,7 @@ static inline int bitops_hs32(uint32_t u)
 /**
  * bitops_hs64: find highest set bit in a uint64_t (must not be zero)
  *
 /**
  * bitops_hs64: find highest set bit in a uint64_t (must not be zero)
  *

- * Returns 0 for least signficant bit, 63 for most significant bit.
+ * Returns 0 for least significant bit, 63 for most significant bit.

  */
 static inline int bitops_hs64(uint64_t u)
 {
  */
 static inline int bitops_hs64(uint64_t u)
 {


@@ -155,7 +155,7 @@ static inline int bitops_hs64(uint64_t u)
 /**
  * bitops_lc32: find lowest clear bit in a uint32_t (must not be 0xFFFFFFFF)
  *
 /**
  * bitops_lc32: find lowest clear bit in a uint32_t (must not be 0xFFFFFFFF)
  *

- * Returns 0 for least signficant bit, 31 for most significant bit.
+ * Returns 0 for least significant bit, 31 for most significant bit.

  */
 static inline int bitops_lc32(uint32_t u)
 {
  */
 static inline int bitops_lc32(uint32_t u)
 {


@@ -165,7 +165,7 @@ static inline int bitops_lc32(uint32_t u)
 /**
  * bitops_lc64: find lowest clear bit in a uint64_t (must not be 0xFFFFFFFFFFFFFFFF)
  *
 /**
  * bitops_lc64: find lowest clear bit in a uint64_t (must not be 0xFFFFFFFFFFFFFFFF)
  *

- * Returns 0 for least signficant bit, 63 for most significant bit.
+ * Returns 0 for least significant bit, 63 for most significant bit.

  */
 static inline int bitops_lc64(uint64_t u)
 {
  */
 static inline int bitops_lc64(uint64_t u)
 {


@@ -175,7 +175,7 @@ static inline int bitops_lc64(uint64_t u)
 /**
  * bitops_hc32: find highest clear bit in a uint32_t (must not be 0xFFFFFFFF)
  *
 /**
  * bitops_hc32: find highest clear bit in a uint32_t (must not be 0xFFFFFFFF)
  *

- * Returns 0 for least signficant bit, 31 for most significant bit.
+ * Returns 0 for least significant bit, 31 for most significant bit.

  */
 static inline int bitops_hc32(uint32_t u)
 {
  */
 static inline int bitops_hc32(uint32_t u)
 {


@@ -185,7 +185,7 @@ static inline int bitops_hc32(uint32_t u)
 /**
  * bitops_hc64: find highest clear bit in a uint64_t (must not be 0xFFFFFFFFFFFFFFFF)
  *
 /**
  * bitops_hc64: find highest clear bit in a uint64_t (must not be 0xFFFFFFFFFFFFFFFF)
  *

- * Returns 0 for least signficant bit, 63 for most significant bit.
+ * Returns 0 for least significant bit, 63 for most significant bit.

  */
 static inline int bitops_hc64(uint64_t u)
 {
  */
 static inline int bitops_hc64(uint64_t u)
 {

diff --git a/ccan/coroutine/coroutine.c b/ccan/coroutine/coroutine.c
index f77b7790009037ab49f9ad308f6ddd79a277d5a6..82eb51b656618ea23cb7a6ebd0c077c436eeccad 100644 (file)
--- a/ccan/coroutine/coroutine.c
+++ b/ccan/coroutine/coroutine.c
@@ -17,7 +17,7 @@
  * Stack management
  */
 
  * Stack management
  */
 

-/* Returns lowest stack addres, regardless of growth direction */
+/* Returns lowest stack address, regardless of growth direction */

 static UNNEEDED void *coroutine_stack_base(struct coroutine_stack *stack)
 {
 #if HAVE_STACK_GROWS_UPWARDS
 static UNNEEDED void *coroutine_stack_base(struct coroutine_stack *stack)
 {
 #if HAVE_STACK_GROWS_UPWARDS

diff --git a/ccan/crypto/sha256/benchmarks/double-sha-bench.c b/ccan/crypto/sha256/benchmarks/double-sha-bench.c
index 09a9900e41d9c9dc218b77d01f89aafaa5869bef..4478b16379a0940854122cae18b408b846c2225f 100644 (file)
--- a/ccan/crypto/sha256/benchmarks/double-sha-bench.c
+++ b/ccan/crypto/sha256/benchmarks/double-sha-bench.c
@@ -33,7 +33,7 @@ int main(int argc, char *argv[])
               block.h.u.u8[3], block.h.u.u8[4], block.h.u.u8[5],
               (unsigned long long)time_to_nsec(diff));
 
               block.h.u.u8[3], block.h.u.u8[4], block.h.u.u8[5],
               (unsigned long long)time_to_nsec(diff));
 

-       /* Now, don't re-initalize every time; use Transform */
+       /* Now, don't re-initialize every time; use Transform */

        memset(&block, 0, sizeof(block));
        sha256(&block.h, &n, sizeof(n));
        block.u8[sizeof(block.h)] = 0x80;
        memset(&block, 0, sizeof(block));
        sha256(&block.h, &n, sizeof(n));
        block.u8[sizeof(block.h)] = 0x80;

diff --git a/ccan/hash/hash.c b/ccan/hash/hash.c
index 5ccc695505e76929cffccc7a4f5dbbde44e7f72d..88d88fcc74614fa4a86e3bb5038329c5a8d4c21a 100644 (file)
--- a/ccan/hash/hash.c
+++ b/ccan/hash/hash.c
@@ -281,7 +281,7 @@ static uint32_t hashlittle( const void *key, size_t length, uint32_t *val2 )
      * rest of the string.  Every machine with memory protection I've seen
      * does it on word boundaries, so is OK with this.  But VALGRIND will
      * still catch it and complain.  The masking trick does make the hash
      * rest of the string.  Every machine with memory protection I've seen
      * does it on word boundaries, so is OK with this.  But VALGRIND will
      * still catch it and complain.  The masking trick does make the hash

-     * noticably faster for short strings (like English words).
+     * noticeably faster for short strings (like English words).

      *
      * Not on my testing with gcc 4.5 on an intel i5 CPU, at least --RR.
      */
      *
      * Not on my testing with gcc 4.5 on an intel i5 CPU, at least --RR.
      */


@@ -458,7 +458,7 @@ static uint32_t hashbig( const void *key, size_t length, uint32_t *val2)
      * rest of the string.  Every machine with memory protection I've seen
      * does it on word boundaries, so is OK with this.  But VALGRIND will
      * still catch it and complain.  The masking trick does make the hash
      * rest of the string.  Every machine with memory protection I've seen
      * does it on word boundaries, so is OK with this.  But VALGRIND will
      * still catch it and complain.  The masking trick does make the hash

-     * noticably faster for short strings (like English words).
+     * noticeably faster for short strings (like English words).

      *
      * Not on my testing with gcc 4.5 on an intel i5 CPU, at least --RR.
      */
      *
      * Not on my testing with gcc 4.5 on an intel i5 CPU, at least --RR.
      */

diff --git a/ccan/intmap/intmap.h b/ccan/intmap/intmap.h
index 7724ea25534c017683fcdcb988736bc1240506a9..207b7c9d2b18f993fd3a2a7692f8146391e3f864 100644 (file)
--- a/ccan/intmap/intmap.h
+++ b/ccan/intmap/intmap.h
@@ -286,7 +286,7 @@ void *intmap_first_(const struct intmap *map, intmap_index_t *indexp);
 /**
  * uintmap_after - get the closest following index in an unsigned intmap
  * @umap: the typed intmap to iterate through.
 /**
  * uintmap_after - get the closest following index in an unsigned intmap
  * @umap: the typed intmap to iterate through.

- * @indexp: the preceeding index (may not exist)
+ * @indexp: the preceding index (may not exist)

  *
  * Returns NULL if the there is no entry > @indexp, otherwise
  * populates *@indexp and returns the lowest entry > @indexp.
  *
  * Returns NULL if the there is no entry > @indexp, otherwise
  * populates *@indexp and returns the lowest entry > @indexp.


@@ -300,7 +300,7 @@ void *intmap_after_(const struct intmap *map, intmap_index_t *indexp);
 /**
  * sintmap_after - get the closest following index in a signed intmap
  * @smap: the typed intmap to iterate through.
 /**
  * sintmap_after - get the closest following index in a signed intmap
  * @smap: the typed intmap to iterate through.

- * @indexp: the preceeding index (may not exist)
+ * @indexp: the preceding index (may not exist)

  *
  * Returns NULL if the there is no entry > @indexp, otherwise
  * populates *@indexp and returns the lowest entry > @indexp.
  *
  * Returns NULL if the there is no entry > @indexp, otherwise
  * populates *@indexp and returns the lowest entry > @indexp.

diff --git a/ccan/iscsi/scsi-lowlevel.c b/ccan/iscsi/scsi-lowlevel.c
index 7090401c0bffee9bc06e94042e5b4692a8a6f0b3..2c1b5d15b71e6a1abfcb5ee1b83dc87a89d9235c 100644 (file)
--- a/ccan/iscsi/scsi-lowlevel.c
+++ b/ccan/iscsi/scsi-lowlevel.c
@@ -118,7 +118,7 @@ struct scsi_task *scsi_reportluns_cdb(int report_type, int alloc_len)
 }
 
 /*
 }
 
 /*

- * parse the data in blob and calcualte the size of a full report luns datain structure
+ * parse the data in blob and calculate the size of a full report luns datain structure

  */
 static int scsi_reportluns_datain_getfullsize(struct scsi_task *task)
 {
  */
 static int scsi_reportluns_datain_getfullsize(struct scsi_task *task)
 {


@@ -198,7 +198,7 @@ struct scsi_task *scsi_cdb_readcapacity10(int lba, int pmi)
 }
 
 /*
 }
 
 /*

- * parse the data in blob and calcualte the size of a full readcapacity10 datain structure
+ * parse the data in blob and calculate the size of a full readcapacity10 datain structure

  */
 static int scsi_readcapacity10_datain_getfullsize(struct scsi_task *task
                                                  UNUSED)
  */
 static int scsi_readcapacity10_datain_getfullsize(struct scsi_task *task
                                                  UNUSED)


@@ -268,7 +268,7 @@ struct scsi_task *scsi_cdb_inquiry(int evpd, int page_code, int alloc_len)
 }
 
 /*
 }
 
 /*

- * parse the data in blob and calcualte the size of a full inquiry datain structure
+ * parse the data in blob and calculate the size of a full inquiry datain structure

  */
 static int scsi_inquiry_datain_getfullsize(struct scsi_task *task)
 {
  */
 static int scsi_inquiry_datain_getfullsize(struct scsi_task *task)
 {


@@ -412,7 +412,7 @@ struct scsi_task *scsi_cdb_modesense6(int dbd, enum scsi_modesense_page_control
 }
 
 /*
 }
 
 /*

- * parse the data in blob and calcualte the size of a full report luns datain structure
+ * parse the data in blob and calculate the size of a full report luns datain structure

  */
 static int scsi_modesense6_datain_getfullsize(struct scsi_task *task)
 {
  */
 static int scsi_modesense6_datain_getfullsize(struct scsi_task *task)
 {

diff --git a/ccan/list/list.h b/ccan/list/list.h
index a6b00385984c52ce9ab3a614e351437616f69b8e..a15321c59095ef78b043c898e6f4908c131a7256 100644 (file)
--- a/ccan/list/list.h
+++ b/ccan/list/list.h
@@ -708,7 +708,7 @@ static inline void list_prepend_list_(struct list_head *to,
 /**
  * list_for_each_off - iterate through a list of memory regions.
  * @h: the list_head
 /**
  * list_for_each_off - iterate through a list of memory regions.
  * @h: the list_head

- * @i: the pointer to a memory region wich contains list node data.
+ * @i: the pointer to a memory region which contains list node data.

  * @off: offset(relative to @i) at which list node data resides.
  *
  * This is a low-level wrapper to iterate @i over the entire list, used to
  * @off: offset(relative to @i) at which list node data resides.
  *
  * This is a low-level wrapper to iterate @i over the entire list, used to


@@ -740,7 +740,7 @@ static inline void list_prepend_list_(struct list_head *to,
 /**
  * list_for_each_rev_off - iterate through a list of memory regions backwards
  * @h: the list_head
 /**
  * list_for_each_rev_off - iterate through a list of memory regions backwards
  * @h: the list_head

- * @i: the pointer to a memory region wich contains list node data.
+ * @i: the pointer to a memory region which contains list node data.

  * @off: offset(relative to @i) at which list node data resides.
  *
  * See list_for_each_off for details
  * @off: offset(relative to @i) at which list node data resides.
  *
  * See list_for_each_off for details


@@ -752,7 +752,7 @@ static inline void list_prepend_list_(struct list_head *to,
  * list_for_each_safe_off - iterate through a list of memory regions, maybe
  * during deletion
  * @h: the list_head
  * list_for_each_safe_off - iterate through a list of memory regions, maybe
  * during deletion
  * @h: the list_head

- * @i: the pointer to a memory region wich contains list node data.
+ * @i: the pointer to a memory region which contains list node data.

  * @nxt: the structure containing the list_node
  * @off: offset(relative to @i) at which list node data resides.
  *
  * @nxt: the structure containing the list_node
  * @off: offset(relative to @i) at which list node data resides.
  *


@@ -771,7 +771,7 @@ static inline void list_prepend_list_(struct list_head *to,
  * list_for_each_rev_safe_off - iterate backwards through a list of
  * memory regions, maybe during deletion
  * @h: the list_head
  * list_for_each_rev_safe_off - iterate backwards through a list of
  * memory regions, maybe during deletion
  * @h: the list_head

- * @i: the pointer to a memory region wich contains list node data.
+ * @i: the pointer to a memory region which contains list node data.

  * @nxt: the structure containing the list_node
  * @off: offset(relative to @i) at which list node data resides.
  *
  * @nxt: the structure containing the list_node
  * @off: offset(relative to @i) at which list node data resides.
  *

diff --git a/ccan/rbtree/rbtree.c b/ccan/rbtree/rbtree.c
index 56fa3f155c7e87c1ee83c067c00cf4685bf798ee..8a59b76ba6fe5a07ef277ab295d91959a3be4d7c 100644 (file)
--- a/ccan/rbtree/rbtree.c
+++ b/ccan/rbtree/rbtree.c
@@ -448,7 +448,7 @@ delete_node(trbt_node_t *node)
           predecessor instead.
           The predecessor is guaranteed to have at most one child
           node since its right arm must be NULL
           predecessor instead.
           The predecessor is guaranteed to have at most one child
           node since its right arm must be NULL

-          (It must be NULL since we are its sucessor and we are above
+          (It must be NULL since we are its successor and we are above

            it in the tree)
         */
        if (node->left != NULL && node->right != NULL) {
            it in the tree)
         */
        if (node->left != NULL && node->right != NULL) {

diff --git a/ccan/rfc822/rfc822.h b/ccan/rfc822/rfc822.h
index e770115c5c6a03fb0e700542752e057ead80d76f..a4ac156522ebdfbffb3401b39ee8567f63ecaa51 100644 (file)
--- a/ccan/rfc822/rfc822.h
+++ b/ccan/rfc822/rfc822.h
@@ -78,7 +78,7 @@ struct rfc822_msg *rfc822_start(const void *ctx, const char *p, size_t len);
  * rfc822_free - free an rfc822 message
  * @msg: message to free
  *
  * rfc822_free - free an rfc822 message
  * @msg: message to free
  *

- * Frees an rfc822_msg context, including all subsiduary data
+ * Frees an rfc822_msg context, including all subsidiary data

  * structures.
  */
 void rfc822_free(struct rfc822_msg *msg);
  * structures.
  */
 void rfc822_free(struct rfc822_msg *msg);

diff --git a/ccan/str/hex/_info b/ccan/str/hex/_info
index 8d65490c71a0fe17e2b081d83ef2e549c08c86a1..d70a1425e845100e11996d2bf10c76b6f7f7d035 100644 (file)
--- a/ccan/str/hex/_info
+++ b/ccan/str/hex/_info
@@ -5,7 +5,7 @@
 /**
  * str/hex - hex-to-string conversions and vice-versa
  *
 /**
  * str/hex - hex-to-string conversions and vice-versa
  *

- * This code contains simple routines for hexidecimal strings.
+ * This code contains simple routines for hexadecimal strings.

  *
  * License: CC0 (Public domain)
  * Author: Rusty Russell <rusty@rustcorp.com.au>
  *
  * License: CC0 (Public domain)
  * Author: Rusty Russell <rusty@rustcorp.com.au>

diff --git a/ccan/str/hex/hex.h b/ccan/str/hex/hex.h
index 624a77b10c004096ea7e90f0a8ad13ce4df0565e..2b81704e9856651b5d43308a44a2f4ed8f2b6f74 100644 (file)
--- a/ccan/str/hex/hex.h
+++ b/ccan/str/hex/hex.h
@@ -7,7 +7,7 @@
 
 /**
  * hex_decode - Unpack a hex string.
 
 /**
  * hex_decode - Unpack a hex string.

- * @str: the hexidecimal string
+ * @str: the hexadecimal string

  * @slen: the length of @str
  * @buf: the buffer to write the data into
  * @bufsize: the length of @buf
  * @slen: the length of @str
  * @buf: the buffer to write the data into
  * @bufsize: the length of @buf

diff --git a/ccan/strgrp/_info b/ccan/strgrp/_info
index 2b88ea7b94eb34cb7ccec58d49e4179b6aacbeac..c5a8053d4ac430c3e78781c80aaf3f3d93fb6fdd 100644 (file)
--- a/ccan/strgrp/_info
+++ b/ccan/strgrp/_info
@@ -51,7 +51,7 @@
  * threshold. Two measurements are used as rejecting filters (i.e. a failure to
  * exceed the threshold prevents further measurements being made):
  *
  * threshold. Two measurements are used as rejecting filters (i.e. a failure to
  * exceed the threshold prevents further measurements being made):
  *

- * 4a. Comparsion of string lengths: String lengths must be within given bounds
+ * 4a. Comparison of string lengths: String lengths must be within given bounds

  * to satisfy the user-supplied similarity constraint. A negative result avoids
  * invoking the O(m * n) behaviour of LCS at the cost of O(m + n) in the two
  * strlen() invocations.
  * to satisfy the user-supplied similarity constraint. A negative result avoids
  * invoking the O(m * n) behaviour of LCS at the cost of O(m + n) in the two
  * strlen() invocations.

diff --git a/ccan/tal/stack/_info b/ccan/tal/stack/_info
index b7de3dd065e77528bc8f2f37079efbb7bc47720e..b3858159808ecaf5ee04b9fe38b39293768fafc1 100644 (file)
--- a/ccan/tal/stack/_info
+++ b/ccan/tal/stack/_info
@@ -3,7 +3,7 @@
 #include <string.h>
 
 /**
 #include <string.h>
 
 /**

- * tal/stack - stack of tal contextes (inspired by talloc_stack)
+ * tal/stack - stack of tal contexts (inspired by talloc_stack)

  *
  * Implement a stack of tal contexts. A new (empty) context is pushed on top
  * of the stack using tal_newframe and it is popped/freed using tal_free().
  *
  * Implement a stack of tal contexts. A new (empty) context is pushed on top
  * of the stack using tal_newframe and it is popped/freed using tal_free().

diff --git a/ccan/tal/stack/stack.h b/ccan/tal/stack/stack.h
index 24d909a8c6c1f7988fb91e1159437c682c51c500..0c7dfe2a8165cd9ec1606f34c27f35221b989009 100644 (file)
--- a/ccan/tal/stack/stack.h
+++ b/ccan/tal/stack/stack.h
@@ -9,7 +9,7 @@
  *
  * Allocates and push a new tal context on top of the stack.
  * The context must be freed using tal_free() which will also pop it
  *
  * Allocates and push a new tal context on top of the stack.
  * The context must be freed using tal_free() which will also pop it

- * off the stack, which will also free all its nested contextes, if any.
+ * off the stack, which will also free all its nested contexts, if any.

  *
  * NOTE: this function is not threadsafe.
  *
  *
  * NOTE: this function is not threadsafe.
  *

diff --git a/ccan/tal/tal.c b/ccan/tal/tal.c
index 3fac61129d1963654713c26d2495cf665a681f71..342cce34f03897b7568ae6080c293d52830660dd 100644 (file)
--- a/ccan/tal/tal.c
+++ b/ccan/tal/tal.c
@@ -495,7 +495,7 @@ void *tal_steal_(const tal_t *new_parent, const tal_t *ctx)
                old_parent = ignore_destroying_bit(t->parent_child)->parent;
 
                 if (unlikely(!add_child(newpar, t))) {
                old_parent = ignore_destroying_bit(t->parent_child)->parent;
 
                 if (unlikely(!add_child(newpar, t))) {

-                       /* We can always add to old parent, becuase it has a
+                       /* We can always add to old parent, because it has a

                         * children property already. */
                        if (!add_child(old_parent, t))
                                abort();
                         * children property already. */
                        if (!add_child(old_parent, t))
                                abort();

diff --git a/ccan/talloc/talloc.c b/ccan/talloc/talloc.c
index 3ada60fca562566aa2207f8ed73c8eae34f24652..d02eee772784a07a4afe84ec1270bc0da163f599 100644 (file)
--- a/ccan/talloc/talloc.c
+++ b/ccan/talloc/talloc.c
@@ -621,7 +621,7 @@ static inline int talloc_unreference(const void *context, const void *ptr)
 
 /*
   remove a specific parent context from a pointer. This is a more
 
 /*
   remove a specific parent context from a pointer. This is a more

-  controlled varient of talloc_free()
+  controlled variant of talloc_free()

 */
 int talloc_unlink(const void *context, void *ptr)
 {
 */
 int talloc_unlink(const void *context, void *ptr)
 {

diff --git a/ccan/tap/tap.3 b/ccan/tap/tap.3
index 0abab740d615b9a7ec218bb6d5fb7ba7c72994c7..6fc7c5c2b75577e77038cc18e3c55aa5b2d9eb45 100644 (file)
--- a/ccan/tap/tap.3
+++ b/ccan/tap/tap.3
@@ -285,7 +285,7 @@ diag("Expected return code 0, got return code %d", rcode);
 .Xc
 .El
 .Pp
 .Xc
 .El
 .Pp

-For maximum compatability your test program should return a particular
+For maximum compatibility your test program should return a particular

 exit code.  This is calculated by
 .Fn exit_status
 so it is sufficient to always return from
 exit code.  This is calculated by
 .Fn exit_status
 so it is sufficient to always return from


@@ -303,7 +303,7 @@ directory in the source distribution contains numerous tests of
 functionality, written using
 .Nm .
 Examine them for examples of how to construct test suites.
 functionality, written using
 .Nm .
 Examine them for examples of how to construct test suites.

-.Sh COMPATABILITY
+.Sh COMPATIBILITY

 .Nm
 strives to be compatible with the Perl Test::More and Test::Harness 
 modules.  The test suite verifies that
 .Nm
 strives to be compatible with the Perl Test::More and Test::Harness 
 modules.  The test suite verifies that

diff --git a/ccan/time/time.h b/ccan/time/time.h
index 6ab61a99c3a5108fc1a391b2549178c536cf60c9..2fc8161e74ebc3696c05ae2f1247987face8d35f 100644 (file)
--- a/ccan/time/time.h
+++ b/ccan/time/time.h
@@ -42,7 +42,7 @@ struct timerel {
 };
 
 /**
 };
 
 /**

- * struct timeabs - an absolue time.
+ * struct timeabs - an absolute time.

  * @ts: the actual timespec value.
  *
  * For example, Midnight UTC January 1st, 1970: ts.tv_sec = 0, ts.tv_nsec = 0
  * @ts: the actual timespec value.
  *
  * For example, Midnight UTC January 1st, 1970: ts.tv_sec = 0, ts.tv_nsec = 0

diff --git a/ccan/tlist/_info b/ccan/tlist/_info
index c3c116d2ead01bbead5865e3321034ea45f298b3..19fc4bd9fb3d731a6127d960b8df74c272569e9d 100644 (file)
--- a/ccan/tlist/_info
+++ b/ccan/tlist/_info
@@ -6,7 +6,7 @@
  * tlist - typesafe double linked list routines
  *
  * The list header contains routines for manipulating double linked lists;
  * tlist - typesafe double linked list routines
  *
  * The list header contains routines for manipulating double linked lists;

- * this extends it so you can create list head types which only accomodate
+ * this extends it so you can create list head types which only accommodate

  * a specific entry type.
  *
  * Example:
  * a specific entry type.
  *
  * Example:

diff --git a/ccan/tlist/tlist.h b/ccan/tlist/tlist.h
index 37882ee7bbdcc62f0eaa38097a3c9b66eacc05fa..83e66db8333874b15054b6d51e7063c0cc0b68d9 100644 (file)
--- a/ccan/tlist/tlist.h
+++ b/ccan/tlist/tlist.h
@@ -34,7 +34,7 @@
        }
 
 /**
        }
 
 /**

- * TLIST_INIT - initalizer for an empty tlist
+ * TLIST_INIT - initializer for an empty tlist

  * @name: the name of the list.
  *
  * Explicit initializer for an empty list.
  * @name: the name of the list.
  *
  * Explicit initializer for an empty list.

diff --git a/ccan/tlist2/_info b/ccan/tlist2/_info
index 3546beb05cd2b07808bc1af83972d383899539fb..fb01f2f093de1e5fe2a0485a7c1612b597e58b5b 100644 (file)
--- a/ccan/tlist2/_info
+++ b/ccan/tlist2/_info
@@ -6,7 +6,7 @@
  * tlist2 - typesafe double linked list routines, alternative form
  *
  * The list header contains routines for manipulating double linked lists;
  * tlist2 - typesafe double linked list routines, alternative form
  *
  * The list header contains routines for manipulating double linked lists;

- * this extends it so you can create list head types which only accomodate
+ * this extends it so you can create list head types which only accommodate

  * a specific entry type.
  *
  * Compared to 'tlist', this:
  * a specific entry type.
  *
  * Compared to 'tlist', this:

diff --git a/ccan/tlist2/tlist2.h b/ccan/tlist2/tlist2.h
index 82f20eca13a054f1c1400dc2294e250e701fe970..3d7d207dfb444603f44d3934059021b4abc81043 100644 (file)
--- a/ccan/tlist2/tlist2.h
+++ b/ccan/tlist2/tlist2.h
@@ -31,7 +31,7 @@
                TCON_CONTAINER(canary, etype, link))
 
 /**
                TCON_CONTAINER(canary, etype, link))
 
 /**

- * TLIST2_INIT - initalizer for an empty tlist
+ * TLIST2_INIT - initializer for an empty tlist

  * @name: the name of the list.
  *
  * Explicit initializer for an empty list.
  * @name: the name of the list.
  *
  * Explicit initializer for an empty list.

diff --git a/ccan/xstring/xstring.h b/ccan/xstring/xstring.h
index 4be6b448f03568a0968d3dc2c9148ad4be5f1771..450a9aef95cd511d8621b3d65c24ec6a4aff9ac8 100644 (file)
--- a/ccan/xstring/xstring.h
+++ b/ccan/xstring/xstring.h
@@ -131,7 +131,7 @@ int xstrAddSubs(xstring *x, ...);
  * @x: pointer to xstring
  * @src: string to append
  *
  * @x: pointer to xstring
  * @src: string to append
  *

- * Run xstrAdd. Reterminate at inital length if truncation occurs.
+ * Run xstrAdd. Reterminate at initial length if truncation occurs.

  *
  * Return: x->truncated
  */
  *
  * Return: x->truncated
  */


@@ -141,7 +141,7 @@ int xstrAddSubs(xstring *x, ...);
  * @x: pointer to xstring
  * @...: one or more strings followed by NULL
  *
  * @x: pointer to xstring
  * @...: one or more strings followed by NULL
  *

- * Run xstrCat. Reterminate at inital length if truncation occurs.
+ * Run xstrCat. Reterminate at initial length if truncation occurs.

  *
  * Return: x->truncated
  */
  *
  * Return: x->truncated
  */


@@ -152,7 +152,7 @@ int xstrAddSubs(xstring *x, ...);
  * @sep: separator string
  * @...: one or more strings followed by NULL
  *
  * @sep: separator string
  * @...: one or more strings followed by NULL
  *

- * Run xstrJoin. Reterminate at inital length if truncation occurs.
+ * Run xstrJoin. Reterminate at initial length if truncation occurs.

  *
  * Return: x->truncated
  */
  *
  * Return: x->truncated
  */


@@ -163,7 +163,7 @@ int xstrAddSubs(xstring *x, ...);
  * @x: pointer to xstring
  * @...: one or more pairs of string and length followed by NULL
  *
  * @x: pointer to xstring
  * @...: one or more pairs of string and length followed by NULL
  *

- * Run xstrAddSubs. Reterminate at inital length if truncation occurs.
+ * Run xstrAddSubs. Reterminate at initial length if truncation occurs.

  *
  * Return: x->truncated
  */
  *
  * Return: x->truncated
  */

diff --git a/tools/ccanlint/licenses.c b/tools/ccanlint/licenses.c
index ca8bc73d0d58e0be508ab6e5f4cc5352a0af1072..73651fcd657aaa01e460537232945c42d21f47f5 100644 (file)
--- a/tools/ccanlint/licenses.c
+++ b/tools/ccanlint/licenses.c
@@ -92,7 +92,7 @@ const struct license_info licenses[] = {
        },
 };
 
        },
 };
 

-/* License compatibilty chart (simplified: we don't test that licenses between
+/* License compatibility chart (simplified: we don't test that licenses between

  * files are compatible). */
 #define O true
 #define X false
  * files are compatible). */
 #define O true
 #define X false


@@ -130,7 +130,7 @@ bool license_compatible[LICENSE_UNKNOWN+1][LICENSE_UNKNOWN] = {
 #undef O
 
 /* See GPLv2 and v2 (basically same wording) for interpreting versions:
 #undef O
 
 /* See GPLv2 and v2 (basically same wording) for interpreting versions:

- * the "any later version" means the recepient can choose. */
+ * the "any later version" means the recipient can choose. */

 enum license which_license(struct doc_section *d)
 {
        if (!d)
 enum license which_license(struct doc_section *d)
 {
        if (!d)