Fix typos detected by codespell

ccan/aga/aga.h

@@ -68,7 +68,7 @@
  *   callback itself.  If the latter, it MUST have been initialized
  *   with aga_node_init() before the edge callback returns.
  *
- * - If a node is contructed by the edge callback, any subsequent
+ * - If a node is constructed by the edge callback, any subsequent
  *   reference to that node by the edge callback for *any* node and
  *   index MUST use the same pointer.
  *
@@ -107,7 +107,7 @@
  * - After an error is encountered aga_error() will return a non-zero
  *   value.  Negative values are reserved for errors reported by the
  *   user supplied edge callback.  Positive values are reserved for
- *   errors detected interally by aga.
+ *   errors detected internally by aga.
  *
  * - Errors are cleared on aga_finish().
  */
@@ -245,7 +245,7 @@ enum aga_error {
  *
  * Returns 0 if the graph is not in an error state, negative values
  * for error states reported by one of the edge callbacks and
- * postitive values for errors detected by aga itself.
+ * positive values for errors detected by aga itself.
  */
 int aga_error(const struct aga_graph *g);
 

ccan/alignof/_info

@@ -11,7 +11,7 @@
  * alignment may cause performance loss or even program failure (eg. a
  * bus signal).
  *
- * There are times which it's useful to be able to programatically
+ * There are times which it's useful to be able to programmatically
  * access these requirements, such as for dynamic allocators.
  *
  * Example:

ccan/antithread/antithread.c

@@ -152,7 +152,7 @@ static void talloc_unlock(void)
 /* We add 16MB to size.  This compensates for address randomization. */
 #define PADDING (16 * 1024 * 1024)
 
-/* Create a new sharable pool. */
+/* Create a new shareable pool. */
 struct at_pool *at_pool(unsigned long size)
 {
 	int fd;

ccan/antithread/antithread.h

@@ -8,7 +8,7 @@ struct athread;
 
 /* Operations for the parent. */
 
-/* Create a new sharable pool. */
+/* Create a new shareable pool. */
 struct at_pool *at_pool(unsigned long size);
 
 /* Talloc off this to allocate from within the pool. */

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;
 
-        // test for easy cases, else split triangle in two and render both halfs
+        // test for easy cases, else split triangle in two and render both halves
         if (y1 == y2) {
  		if (x1 > x2) swap(&x1, &x2);
 		add_flat_triangle(image, x1, y1, x2, y2, x0, y0,

ccan/argcheck/argcheck.h

@@ -171,7 +171,7 @@ argcheck_log_(const char *file, int line, const char *func,
 
 /*
 
-   below is the actual implemenation. do not use it directly, use the macros
+   below is the actual implementation. do not use it directly, use the macros
    above instead
 
  */

ccan/autodata/_info

@@ -9,7 +9,7 @@
  * together at runtime to form tables.  This is often used in place of
  * having a central registration function or table.
  *
- * Note that this technique does not work in general for shared libaries,
+ * Note that this technique does not work in general for shared libraries,
  * only for code compiled into a binary.
  *
  * License: BSD-MIT

ccan/bdelta/bdelta.c

@@ -381,7 +381,7 @@ static BDELTAcode build_triangle(
 	 *
 	 *  * Every V array is preserved per iteration of the outer loop.
 	 *    This is necessary so we can determine the actual patch, not just
-	 *    the length of the shortest edit string.  See the coment above
+	 *    the length of the shortest edit string.  See the comment above
 	 *    the definition of Triangle for an in-depth explanation.
 	 *
 	 *  * Array items are stored consecutively so as to not waste space.

ccan/check_type/_info

@@ -11,7 +11,7 @@
  * a precise type isn't used.
  *
  * On compilers which don't support typeof() these routines are less effective,
- * since they have to use sizeof() which can only distiguish between types of
+ * since they have to use sizeof() which can only distinguish between types of
  * different size.
  *
  * License: CC0 (Public domain)

ccan/coroutine/coroutine.h

@@ -173,7 +173,7 @@ coroutine_stack_from_metadata(void *metadata, size_t metasize)
  * @stack: coroutine stack
  *
  * Returns the size of the coroutine stack @stack.  This does not
- * include the overhead of struct coroutine_stack or metdata.
+ * include the overhead of struct coroutine_stack or metadata.
  */
 size_t coroutine_stack_size(const struct coroutine_stack *stack);
 

ccan/cpuid/cpuid.h

@@ -59,7 +59,7 @@
  * 	Extended L2 Cache features.
  *
  * %CPUID_ADV_POWER_MGT_INFO:
- * 	Advaned power management information.
+ * 	Advanced power management information.
  *
  * %CPUID_VIRT_PHYS_ADDR_SIZES:
  * 	Virtual and physical address sizes.

ccan/crc32c/crc32c.c

@@ -407,11 +407,11 @@ static uint32_t crc32c_sw_big(uint32_t crc, void const *buf, size_t len) {
 }
 
 /* Table-driven software CRC-32C.  This is about 15 times slower than using the
-   hardware instructions.  Determine the endianess of the processor and proceed
-   accordingly.  Ideally the endianess will be determined at compile time, in
-   which case the unused functions and tables for the other endianess will be
+   hardware instructions.  Determine the endianness of the processor and proceed
+   accordingly.  Ideally the endianness will be determined at compile time, in
+   which case the unused functions and tables for the other endianness will be
    removed by the optimizer.  If not, then the proper routines and tables will
-   be used, even if the endianess is changed mid-stream.  (Yes, there are
+   be used, even if the endianness is changed mid-stream.  (Yes, there are
    processors that permit that -- go figure.) */
 static uint32_t crc32c_sw(uint32_t crc, void const *buf, size_t len) {
     static int const little = 1;

ccan/crypto/hmac_sha256/_info

@@ -16,7 +16,7 @@
  *	#include <stdio.h>
  *	#include <string.h>
  *
- *	// Simple demonstration: idential strings will have the same hash, but
+ *	// Simple demonstration: identical strings will have the same hash, but
  *	// two different strings will not.
  *	int main(int argc, char *argv[])
  *	{

ccan/crypto/ripemd160/_info

@@ -17,7 +17,7 @@
  *	#include <stdio.h>
  *	#include <string.h>
  *
- *	// Simple demonstration: idential strings will have the same hash, but
+ *	// Simple demonstration: identical strings will have the same hash, but
  *	// two different strings will not.
  *	int main(int argc, char *argv[])
  *	{

ccan/crypto/ripemd160/ripemd160.h

@@ -82,7 +82,7 @@ void ripemd160_init(struct ripemd160_ctx *ctx);
 /**
  * RIPEMD160_INIT - initializer for an RIPEMD160 context.
  *
- * This can be used to staticly initialize an RIPEMD160 context (instead
+ * This can be used to statically initialize an RIPEMD160 context (instead
  * of ripemd160_init()).
  *
  * Example:

ccan/crypto/sha256/_info

@@ -17,7 +17,7 @@
  *	#include <stdio.h>
  *	#include <string.h>
  *
- *	// Simple demonstration: idential strings will have the same hash, but
+ *	// Simple demonstration: identical strings will have the same hash, but
  *	// two different strings will not.
  *	int main(int argc, char *argv[])
  *	{

ccan/crypto/sha256/benchmarks/sha256_avx2_rorx8.asm

@@ -125,7 +125,7 @@ _IDX_LIMIT_SIZE	equ 8
 _RSP_SIZE	equ 8
 
 ;; KTMSG must overlap TMSG such that the second 3/4 of KTMSG overlaps the
-;; first 3/4 of TMSG. (We onl need 16 words of TMSG at any time.)
+;; first 3/4 of TMSG. (We only need 16 words of TMSG at any time.)
 _KTMSG		equ              _EXTRA_SIZE
 _TMSG		equ _KTMSG     + _KTMSG_SIZE
 _XMM_SAVE	equ _TMSG      + _TMSG_SIZE

ccan/crypto/siphash24/siphash24.h

@@ -80,7 +80,7 @@ void siphash24_init(struct siphash24_ctx *ctx, const struct siphash_seed *seed);
  * SIPHASH24_INIT - initializer for an SIPHASH24 context.
  * @seed1, @seed2: two 64-bit words for seed.
  *
- * This can be used to staticly initialize an SIPHASH24 context (instead
+ * This can be used to statically initialize an SIPHASH24 context (instead
  * of siphash24_init()).
  *
  * Example:

ccan/crypto/siphash24/test/run.c

@@ -98,7 +98,7 @@ int main(void)
 	/* This is how many tests you plan to run */
 	plan_tests(1 + MAXLEN * 2);
 
-	/* Initialzed an manually created should give same results. */
+	/* Initialized and manually created should give same results. */
 	for (i = 0; i < sizeof(seed.u.u8); i++)
 		seed.u.u8[i] = i;
 	siphash24_init(&ctx2, &seed);

ccan/dgraph/dgraph.c

@@ -126,7 +126,7 @@ static bool dgraph_check_node(struct dgraph_node *n, void *info_)
 					continue;
 				if (info->abortstr) {
 					fprintf(stderr,
-						"%s: node %p %s edge doesnt"
+						"%s: node %p %s edge doesn't"
 						" point back to %p\n",
 						info->abortstr, e->n[!dir],
 						!dir == DGRAPH_FROM

ccan/dgraph/dgraph.h

@@ -11,7 +11,7 @@ enum dgraph_dir {
 	DGRAPH_TO
 };
 
-/* strust tlist_dgraph_edge: a list of edges */
+/* struct tlist_dgraph_edge: a list of edges */
 TLIST_TYPE(dgraph_edge, struct dgraph_edge);
 
 /**

ccan/graphql/test/run.c

@@ -3105,7 +3105,7 @@ int main(void)
 	RUN2(check_string_value, "\"te\\tst\"",              "te\tst"     ); // Check escape sequence.
 	RUN2(check_string_value, "\"te\\vst\"",              NULL         ); // Invalid escape sequence.
 	RUN2(check_string_value, "\"te\\033st\"",            NULL         ); // Invalid escape sequence.
-	// Note: Unicode excape sequence is tested below.
+	// Note: Unicode escape sequence is tested below.
 
 	// This block string and this string should result in identical tokens.
 	sprintf(source, "\

ccan/hash/hash.h

@@ -35,7 +35,7 @@
  *	#include <stdio.h>
  *	#include <string.h>
  *
- *	// Simple demonstration: idential strings will have the same hash, but
+ *	// Simple demonstration: identical strings will have the same hash, but
  *	// two different strings will probably not.
  *	int main(int argc, char *argv[])
  *	{
@@ -164,7 +164,7 @@ static inline uint32_t hash_string(const char *string)
  *	#include <stdio.h>
  *	#include <string.h>
  *
- *	// Simple demonstration: idential strings will have the same hash, but
+ *	// Simple demonstration: identical strings will have the same hash, but
  *	// two different strings will probably not.
  *	int main(int argc, char *argv[])
  *	{

ccan/idtree/_info

@@ -18,7 +18,7 @@
  *	#include <stdlib.h>
  *	#include <stdio.h>
  *
- *	// Silly example which puts args in the idtree and retreives them
+ *	// Silly example which puts args in the idtree and retrieves them
  *	int main(int argc, char *argv[])
  *	{
  *		struct idtree *idtree = idtree_new(NULL);

ccan/io/benchmarks/run-loop.c

@@ -78,7 +78,7 @@ int main(void)
 		last_read = fds[0];
 	}
 
-	/* Last one completes the cirle. */
+	/* Last one completes the circle. */
 	i = 0;
 	buf[i].iters = 0;
 	sprintf(buf[i].buf, "%i-%i", i, i);

ccan/io/test/run-10-many.c

@@ -92,7 +92,7 @@ int main(void)
 	if (!ok1(i == NUM))
 		exit(exit_status());
 
-	/* Last one completes the cirle. */
+	/* Last one completes the circle. */
 	i = 0;
 	sprintf(buf[i].buf, "%i-%i", i, i);
 	buf[i].reader = io_new_conn(NULL, last_read, setup_reader, &buf[i]);

ccan/isaac/_info

@@ -73,7 +73,7 @@
  * It is the fastest 32-bit generator among all of those that pass the
  * statistical tests in the recent survey
  * http://www.iro.umontreal.ca/~simardr/testu01/tu01.html, with the exception
- * of Marsa-LFIB4, and it is quite competitive on 64-bit archtectures.
+ * of Marsa-LFIB4, and it is quite competitive on 64-bit architectures.
  *
  * Unlike Marsa-LFIB4 (and all other LFib generators), there are no linear
  * dependencies between successive values, and unlike many generators found in

ccan/iscsi/iscsi.h

@@ -227,7 +227,7 @@ int iscsi_nop_out_async(struct iscsi_context *iscsi, iscsi_command_cb cb, unsign
  * The content of command_data depends on the status type.
  *
  * status :
- *   ISCSI_STATUS_GOOD the scsi command completed successfullt on the target.
+ *   ISCSI_STATUS_GOOD the scsi command completed successfully on the target.
  *   If this scsi command returns DATA-IN, that data is stored in an scsi_task structure
  *   returned in the command_data parameter. This buffer will be automatically freed once the callback
  *   returns.

ccan/iscsi/login.c

@@ -280,7 +280,7 @@ int iscsi_process_logout_reply(struct iscsi_context *iscsi, struct iscsi_pdu *pd
 int iscsi_set_session_type(struct iscsi_context *iscsi, enum iscsi_session_type session_type)
 {
 	if (iscsi == NULL) {
-		printf("Trying to set sesssion type on NULL context\n");
+		printf("Trying to set session type on NULL context\n");
 		return -1;
 	}
 	if (iscsi->is_loggedin) {

ccan/iscsi/pdu.c

@@ -168,7 +168,7 @@ int iscsi_process_pdu(struct iscsi_context *iscsi, const unsigned char *hdr, int
 	itt = ntohl(*(uint32_t *)&hdr[16]);
 
 	if (ahslen != 0) {
-		printf("cant handle expanded headers yet\n");
+		printf("can't handle expanded headers yet\n");
 		return -1;
 	}
 

ccan/iscsi/scsi-command.c

@@ -58,7 +58,7 @@ static void iscsi_scsi_response_cb(struct iscsi_context *iscsi, int status, void
 		scsi_cbdata->callback(iscsi, ISCSI_STATUS_GOOD, task, scsi_cbdata->private_data);
 		return;
 	default:
-		printf("Cant handle  scsi status %d yet\n", status);
+		printf("Can't handle  scsi status %d yet\n", status);
 		scsi_cbdata->callback(iscsi, ISCSI_STATUS_ERROR, task, scsi_cbdata->private_data);
 	}
 }

ccan/iscsi/tools/iscsiclient.c

@@ -83,7 +83,7 @@ void read10_cb(struct iscsi_context *iscsi, int status, void *command_data, void
 	}
 	printf("...\n");
 
-	printf("Finished,   wont try to write data since that will likely destroy your LUN :-(\n");
+	printf("Finished,   won't try to write data since that will likely destroy your LUN :-(\n");
 	printf("Send NOP-OUT\n");
 	if (iscsi_nop_out_async(iscsi, nop_out_cb, "Ping!", 6, private_data) != 0) {
 		printf("failed to send nop-out\n");

ccan/jmap/jmap.h

@@ -364,7 +364,7 @@ struct jmap {
  * @map: map from jmap_new
  * @p: the pointer to a pointer to the value
  *
- * @p is a pointer to the (successful) value retuned from one of the
+ * @p is a pointer to the (successful) value returned from one of the
  * jmap_*val functions (listed below).  After this, it will be invalid.
  *
  * Unless NDEBUG is defined, this will actually alter the value of p

ccan/lbalance/_info

@@ -14,7 +14,7 @@
  *
  * Example:
  *	// Run 1000 of the given commandline at best-known parallel rate.
- *	// See tools/lbalance.c for a sligtly more serious example.
+ *	// See tools/lbalance.c for a slightly more serious example.
  *	#include <ccan/lbalance/lbalance.h>
  *      #include <sys/types.h>
  *      #include <sys/time.h>

ccan/list/list.h

@@ -712,7 +712,7 @@ static inline void list_prepend_list_(struct list_head *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
- * implement all oher, more high-level, for-each constructs. It's a for loop,
+ * implement all other, more high-level, for-each constructs. It's a for loop,
  * so you can break and continue as normal.
  *
  * WARNING! Being the low-level macro that it is, this wrapper doesn't know

ccan/lstack/lstack.h

@@ -10,7 +10,7 @@
 
 /**
  * struct lstack_link - a stack link
- * @down: immedately lower entry in the stack, or NULL if this is the bottom.
+ * @down: immediately lower entry in the stack, or NULL if this is the bottom.
  *
  * This is used as an entry in a stack.
  *

ccan/nfs/libnfs-raw.h

@@ -57,7 +57,7 @@ typedef void (*rpc_cb)(struct rpc_context *rpc, int status, void *data, void *pr
  * RPC_STATUS_SUCCESS : The tcp connection was successfully established.
  *                      data is NULL.
  * RPC_STATUS_ERROR   : The connection failed to establish.
- *                      data is the erro string.
+ *                      data is the error string.
  * RPC_STATUS_CANCEL  : The connection attempt was aborted before it could complete.
  *                    : data is NULL.
  */

ccan/nfs/libnfs.c

@@ -440,7 +440,7 @@ static void nfs_mount_1_cb(struct rpc_context *rpc, int status, void *command_da
 }
 
 /*
- * Async call for mounting an nfs share and geting the root filehandle
+ * Async call for mounting an nfs share and getting the root filehandle
  */
 int nfs_mount_async(struct nfs_context *nfs, const char *server, const char *export, nfs_cb cb, void *private_data)
 {
@@ -554,7 +554,7 @@ static int nfs_lookuppath_async(struct nfs_context *nfs, const char *path, nfs_c
 	struct nfs_cb_data *data;
 
 	if (path[0] != '/') {
-		rpc_set_error(nfs->rpc, "Pathname is not absulute %s", path);
+		rpc_set_error(nfs->rpc, "Pathname is not absolute %s", path);
 		return -1;
 	}
 

ccan/nfs/pdu.c

@@ -120,7 +120,7 @@ int rpc_get_pdu_size(char *buf)
 	size = ntohl(*(uint32_t *)buf);
 
 	if ((size & 0x80000000) == 0) {
-		printf("cant handle oncrpc fragments\n");
+		printf("can't handle oncrpc fragments\n");
 		return -1;
 	}