Commit d1a951b8 authored by Kazuhiro Sera's avatar Kazuhiro Sera

Fix typos detected by github.com/client9/misspell

parent 55d81423
...@@ -128,7 +128,7 @@ static void paint_triangle(struct image *image, const struct triangle *tri) ...@@ -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; x1 = tri->coord[i1].x, y1 = tri->coord[i1].y;
x2 = tri->coord[i2].x, y2 = tri->coord[i2].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 (y1 == y2) {
if (x1 > x2) swap(&x1, &x2); if (x1 > x2) swap(&x1, &x2);
add_flat_triangle(image, x1, y1, x2, y2, x0, y0, add_flat_triangle(image, x1, y1, x2, y2, x0, y0,
......
...@@ -35,7 +35,7 @@ static bool is_reverse_sorted(const int arr[], unsigned int size) ...@@ -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) ...@@ -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_sorted(tmparr, TEST_SIZE));
ok1(!is_reverse_sorted(tmparr, TEST_SIZE)); ok1(!is_reverse_sorted(tmparr, TEST_SIZE));
asort(tmparr, TEST_SIZE, test_cmp, &multiplier); asort(tmparr, TEST_SIZE, test_cmp, &multiplier);
ok1(is_sorted(tmparr, TEST_SIZE)); ok1(is_sorted(tmparr, TEST_SIZE));
psuedo_random_array(tmparr, TEST_SIZE); pseudo_random_array(tmparr, TEST_SIZE);
multiplier = -1; multiplier = -1;
asort(tmparr, TEST_SIZE, test_cmp, &multiplier); asort(tmparr, TEST_SIZE, test_cmp, &multiplier);
ok1(is_reverse_sorted(tmparr, TEST_SIZE)); ok1(is_reverse_sorted(tmparr, TEST_SIZE));
......
...@@ -12,7 +12,7 @@ ...@@ -12,7 +12,7 @@
* @name: the name for this set of autodata * @name: the name for this set of autodata
* @type: the type this autodata points to * @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. * autodata functions in the file.
* *
* Example: * Example:
......
...@@ -15,7 +15,7 @@ ...@@ -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. * for no bits set.
*/ */
static inline int bitops_ffs32(uint32_t u) static inline int bitops_ffs32(uint32_t u)
...@@ -26,7 +26,7 @@ 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. * for no bits set.
*/ */
static inline int bitops_ffs64(uint64_t u) static inline int bitops_ffs64(uint64_t u)
...@@ -46,8 +46,8 @@ 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 * Returns 0 if most significant bit is set, 31 if only least
* signficant bit is set. * 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) ...@@ -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 * Returns 0 if most significant bit is set, 63 if only least
* signficant bit is set. * 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); ...@@ -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 * Returns 0 if least significant bit is set, 31 if only most
* signficant bit is set. * 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) ...@@ -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 * Returns 0 if least significant bit is set, 63 if only most
* signficant bit is set. * 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); ...@@ -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) ...@@ -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) ...@@ -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) ...@@ -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) ...@@ -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) ...@@ -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) ...@@ -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) ...@@ -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)
{ {
......
...@@ -17,7 +17,7 @@ ...@@ -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) static UNNEEDED void *coroutine_stack_base(struct coroutine_stack *stack)
{ {
#if HAVE_STACK_GROWS_UPWARDS #if HAVE_STACK_GROWS_UPWARDS
......
...@@ -33,7 +33,7 @@ int main(int argc, char *argv[]) ...@@ -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], block.h.u.u8[3], block.h.u.u8[4], block.h.u.u8[5],
(unsigned long long)time_to_nsec(diff)); (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)); memset(&block, 0, sizeof(block));
sha256(&block.h, &n, sizeof(n)); sha256(&block.h, &n, sizeof(n));
block.u8[sizeof(block.h)] = 0x80; block.u8[sizeof(block.h)] = 0x80;
......
...@@ -281,7 +281,7 @@ static uint32_t hashlittle( const void *key, size_t length, uint32_t *val2 ) ...@@ -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 * 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 * 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 * 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) ...@@ -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 * 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 * 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 * 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.
*/ */
......
...@@ -286,7 +286,7 @@ void *intmap_first_(const struct intmap *map, intmap_index_t *indexp); ...@@ -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 * uintmap_after - get the closest following index in an unsigned intmap
* @umap: the typed intmap to iterate through. * @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 * Returns NULL if the there is no entry > @indexp, otherwise
* populates *@indexp and returns the lowest entry > @indexp. * populates *@indexp and returns the lowest entry > @indexp.
...@@ -300,7 +300,7 @@ void *intmap_after_(const struct intmap *map, intmap_index_t *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 * sintmap_after - get the closest following index in a signed intmap
* @smap: the typed intmap to iterate through. * @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 * Returns NULL if the there is no entry > @indexp, otherwise
* populates *@indexp and returns the lowest entry > @indexp. * populates *@indexp and returns the lowest entry > @indexp.
......
...@@ -118,7 +118,7 @@ struct scsi_task *scsi_reportluns_cdb(int report_type, int alloc_len) ...@@ -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) ...@@ -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 static int scsi_readcapacity10_datain_getfullsize(struct scsi_task *task
UNUSED) UNUSED)
...@@ -268,7 +268,7 @@ struct scsi_task *scsi_cdb_inquiry(int evpd, int page_code, int alloc_len) ...@@ -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 ...@@ -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)
{ {
......
...@@ -708,7 +708,7 @@ static inline void list_prepend_list_(struct list_head *to, ...@@ -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. * list_for_each_off - iterate through a list of memory regions.
* @h: the list_head * @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. * @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 * 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, ...@@ -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 * list_for_each_rev_off - iterate through a list of memory regions backwards
* @h: the list_head * @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. * @off: offset(relative to @i) at which list node data resides.
* *
* See list_for_each_off for details * See list_for_each_off for details
...@@ -752,7 +752,7 @@ static inline void list_prepend_list_(struct list_head *to, ...@@ -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 * list_for_each_safe_off - iterate through a list of memory regions, maybe
* during deletion * during deletion
* @h: the list_head * @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 * @nxt: the structure containing the list_node
* @off: offset(relative to @i) at which list node data resides. * @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, ...@@ -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 * list_for_each_rev_safe_off - iterate backwards through a list of
* memory regions, maybe during deletion * memory regions, maybe during deletion
* @h: the list_head * @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 * @nxt: the structure containing the list_node
* @off: offset(relative to @i) at which list node data resides. * @off: offset(relative to @i) at which list node data resides.
* *
......
...@@ -448,7 +448,7 @@ delete_node(trbt_node_t *node) ...@@ -448,7 +448,7 @@ delete_node(trbt_node_t *node)
predecessor instead. predecessor instead.
The predecessor is guaranteed to have at most one child The predecessor is guaranteed to have at most one child
node since its right arm must be NULL 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) it in the tree)
*/ */
if (node->left != NULL && node->right != NULL) { if (node->left != NULL && node->right != NULL) {
......
...@@ -78,7 +78,7 @@ struct rfc822_msg *rfc822_start(const void *ctx, const char *p, size_t len); ...@@ -78,7 +78,7 @@ struct rfc822_msg *rfc822_start(const void *ctx, const char *p, size_t len);
* rfc822_free - free an rfc822 message * rfc822_free - free an rfc822 message
* @msg: message to free * @msg: message to free
* *
* Frees an rfc822_msg context, including all subsiduary data * Frees an rfc822_msg context, including all subsidiary data
* structures. * structures.
*/ */
void rfc822_free(struct rfc822_msg *msg); void rfc822_free(struct rfc822_msg *msg);
......
...@@ -5,7 +5,7 @@ ...@@ -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) * License: CC0 (Public domain)
* Author: Rusty Russell <rusty@rustcorp.com.au> * Author: Rusty Russell <rusty@rustcorp.com.au>
......
...@@ -7,7 +7,7 @@ ...@@ -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 * @slen: the length of @str
* @buf: the buffer to write the data into * @buf: the buffer to write the data into
* @bufsize: the length of @buf * @bufsize: the length of @buf
......
...@@ -51,7 +51,7 @@ ...@@ -51,7 +51,7 @@
* threshold. Two measurements are used as rejecting filters (i.e. a failure to * threshold. Two measurements are used as rejecting filters (i.e. a failure to
* exceed the threshold prevents further measurements being made): * 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 * 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 * invoking the O(m * n) behaviour of LCS at the cost of O(m + n) in the two
* strlen() invocations. * strlen() invocations.
......
...@@ -3,7 +3,7 @@ ...@@ -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 * 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(). * of the stack using tal_newframe and it is popped/freed using tal_free().
......
...@@ -9,7 +9,7 @@ ...@@ -9,7 +9,7 @@
* *
* Allocates and push a new tal context on top of the stack. * 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 * 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.
* *
......
...@@ -495,7 +495,7 @@ void *tal_steal_(const tal_t *new_parent, const tal_t *ctx) ...@@ -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; old_parent = ignore_destroying_bit(t->parent_child)->parent;
if (unlikely(!add_child(newpar, t))) { 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. */ * children property already. */
if (!add_child(old_parent, t)) if (!add_child(old_parent, t))
abort(); abort();
......
...@@ -621,7 +621,7 @@ static inline int talloc_unreference(const void *context, const void *ptr) ...@@ -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)
{ {
......
...@@ -285,7 +285,7 @@ diag("Expected return code 0, got return code %d", rcode); ...@@ -285,7 +285,7 @@ diag("Expected return code 0, got return code %d", rcode);
.Xc .Xc
.El .El
.Pp .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 exit code. This is calculated by
.Fn exit_status .Fn exit_status
so it is sufficient to always return from so it is sufficient to always return from
...@@ -303,7 +303,7 @@ directory in the source distribution contains numerous tests of ...@@ -303,7 +303,7 @@ directory in the source distribution contains numerous tests of
functionality, written using functionality, written using
.Nm . .Nm .
Examine them for examples of how to construct test suites. Examine them for examples of how to construct test suites.
.Sh COMPATABILITY .Sh COMPATIBILITY
.Nm .Nm
strives to be compatible with the Perl Test::More and Test::Harness strives to be compatible with the Perl Test::More and Test::Harness
modules. The test suite verifies that modules. The test suite verifies that
......
...@@ -42,7 +42,7 @@ struct timerel { ...@@ -42,7 +42,7 @@ struct timerel {
}; };
/** /**
* struct timeabs - an absolue time. * struct timeabs - an absolute time.
* @ts: the actual timespec value. * @ts: the actual timespec value.
* *
* For example, Midnight UTC January 1st, 1970: ts.tv_sec = 0, ts.tv_nsec = 0 * For example, Midnight UTC January 1st, 1970: ts.tv_sec = 0, ts.tv_nsec = 0
......
...@@ -6,7 +6,7 @@ ...@@ -6,7 +6,7 @@
* tlist - typesafe double linked list routines * tlist - typesafe double linked list routines
* *
* The list header contains routines for manipulating double linked lists; * 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. * a specific entry type.
* *
* Example: * Example:
......
...@@ -34,7 +34,7 @@ ...@@ -34,7 +34,7 @@
} }
/** /**
* TLIST_INIT - initalizer for an empty tlist * TLIST_INIT - initializer for an empty tlist
* @name: the name of the list. * @name: the name of the list.
* *
* Explicit initializer for an empty list. * Explicit initializer for an empty list.
......
...@@ -6,7 +6,7 @@ ...@@ -6,7 +6,7 @@
* tlist2 - typesafe double linked list routines, alternative form * tlist2 - typesafe double linked list routines, alternative form
* *
* The list header contains routines for manipulating double linked lists; * 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. * a specific entry type.
* *
* Compared to 'tlist', this: * Compared to 'tlist', this:
......
...@@ -31,7 +31,7 @@ ...@@ -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. * @name: the name of the list.
* *
* Explicit initializer for an empty list. * Explicit initializer for an empty list.
......
...@@ -131,7 +131,7 @@ int xstrAddSubs(xstring *x, ...); ...@@ -131,7 +131,7 @@ int xstrAddSubs(xstring *x, ...);
* @x: pointer to xstring * @x: pointer to xstring
* @src: string to append * @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, ...); ...@@ -141,7 +141,7 @@ int xstrAddSubs(xstring *x, ...);
* @x: pointer to xstring * @x: pointer to xstring
* @...: one or more strings followed by NULL * @...: 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, ...); ...@@ -152,7 +152,7 @@ int xstrAddSubs(xstring *x, ...);
* @sep: separator string * @sep: separator string
* @...: one or more strings followed by NULL * @...: 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, ...); ...@@ -163,7 +163,7 @@ int xstrAddSubs(xstring *x, ...);
* @x: pointer to xstring * @x: pointer to xstring
* @...: one or more pairs of string and length followed by NULL * @...: 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
*/ */
......
...@@ -92,7 +92,7 @@ const struct license_info licenses[] = { ...@@ -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). */ * files are compatible). */
#define O true #define O true
#define X false #define X false
...@@ -130,7 +130,7 @@ bool license_compatible[LICENSE_UNKNOWN+1][LICENSE_UNKNOWN] = { ...@@ -130,7 +130,7 @@ bool license_compatible[LICENSE_UNKNOWN+1][LICENSE_UNKNOWN] = {
#undef O #undef O
/* See GPLv2 and v2 (basically same wording) for interpreting versions: /* 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) enum license which_license(struct doc_section *d)
{ {
if (!d) if (!d)
......
Markdown is supported
0%
or
You are about to add 0 people to the discussion. Proceed with caution.
Finish editing this message first!
Please register or to comment