Commit 38dd0df7 authored by Poul-Henning Kamp's avatar Poul-Henning Kamp

Minor NO-OP polish.

parent 0b8e5ed2
...@@ -389,7 +389,7 @@ http_Teardown(struct http *hp) ...@@ -389,7 +389,7 @@ http_Teardown(struct http *hp)
*/ */
void void
HTTP_Dup(struct http *to, const struct http * const fm) HTTP_Dup(struct http *to, const struct http * fm)
{ {
assert(fm->nhd <= to->shd); assert(fm->nhd <= to->shd);
......
...@@ -533,7 +533,7 @@ name##_VRBT_INSERT_COLOR(struct name *head, \ ...@@ -533,7 +533,7 @@ name##_VRBT_INSERT_COLOR(struct name *head, \
/* \ /* \
* Initially, elm is a leaf. Either its parent was previously \ * Initially, elm is a leaf. Either its parent was previously \
* a leaf, with two black null children, or an interior node \ * a leaf, with two black null children, or an interior node \
* with a black non-null child and a red null child. The \ * with a black non-null child and a red null child. The \
* balance criterion "the rank of any leaf is 1" precludes the \ * balance criterion "the rank of any leaf is 1" precludes the \
* possibility of two red null children for the initial parent. \ * possibility of two red null children for the initial parent. \
* So the first loop iteration cannot lead to accessing an \ * So the first loop iteration cannot lead to accessing an \
...@@ -694,12 +694,12 @@ name##_VRBT_REMOVE_COLOR(struct name *head, \ ...@@ -694,12 +694,12 @@ name##_VRBT_REMOVE_COLOR(struct name *head, \
* par par \ * par par \
* ╱ ╲ ╱ ╲ \ * ╱ ╲ ╱ ╲ \
* ╱ sib elm ╲ \ * ╱ sib elm ╲ \
* ╱ / ╲ elm* \ * ╱ / ╲ elm* \
* elm elm* ╲ ╱ ╲ \ * elm elm* ╲ ╱ ╲ \
* ╱ ╲ ╲ ╱ ╲ \ * ╱ ╲ ╲ ╱ ╲ \
* ╱ ╲ z ╱ ╲ \ * ╱ ╲ z ╱ ╲ \
* x y x sib \ * x y x sib \
* ╱ ╲ \ * ╱ ╲ \
* ╱ z \ * ╱ z \
* y \ * y \
*/ \ */ \
......
...@@ -88,8 +88,7 @@ VCLI_WriteResult(int fd, unsigned status, const char *result) ...@@ -88,8 +88,7 @@ VCLI_WriteResult(int fd, unsigned status, const char *result)
len = strlen(result); len = strlen(result);
i = snprintf(res, sizeof res, i = snprintf(res, sizeof res, "%-3d %-8zd\n", status, len);
"%-3d %-8zd\n", status, len);
assert(i == CLI_LINE0_LEN); assert(i == CLI_LINE0_LEN);
assert(strtoul(res + 3, NULL, 10) == len); assert(strtoul(res + 3, NULL, 10) == len);
......
...@@ -356,6 +356,10 @@ vjsn_number(struct vjsn *js) ...@@ -356,6 +356,10 @@ vjsn_number(struct vjsn *js)
while (*js->ptr >= '0' && *js->ptr <= '9') while (*js->ptr >= '0' && *js->ptr <= '9')
js->ptr++; js->ptr++;
} }
/*
* The terminating NUL is supplied by the caller, once they
* have decided if they like what occupies that spot.
*/
return (jsv); return (jsv);
} }
......
...@@ -255,7 +255,8 @@ VSA_Malloc(const void *s, unsigned sal) ...@@ -255,7 +255,8 @@ VSA_Malloc(const void *s, unsigned sal)
return (VSA_Build(NULL, s, sal)); return (VSA_Build(NULL, s, sal));
} }
/* 'd' SHALL point to vsa_suckaddr_len aligned bytes of storage /*
* 'd' SHALL point to vsa_suckaddr_len aligned bytes of storage
* *
* fam: address family * fam: address family
* a / al : address and length * a / al : address and length
...@@ -466,4 +467,3 @@ VSA_free(const struct suckaddr **vsap) ...@@ -466,4 +467,3 @@ VSA_free(const struct suckaddr **vsap)
TAKE_OBJ_NOTNULL(vsa, vsap, SUCKADDR_MAGIC); TAKE_OBJ_NOTNULL(vsa, vsap, SUCKADDR_MAGIC);
free(TRUST_ME(vsa)); free(TRUST_ME(vsa));
} }
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