Function json_parse_input

common/json_parse_simple.c:540–585

}

bool json_parse_input(jsmn_parser *parser,
		      jsmntok_t **toks,
		      const char *input, int len,
		      bool *complete)
{
	int ret;

again:
	ret = jsmn_parse(parser, input, len, *toks, tal_count(*toks) - 1);
	if (ret == JSMN_ERROR_INVAL)
		return false;

	/* Check whether we read at least one full root element, i.e., root
	 * element has its end set. */
	if ((*toks)[0].type == JSMN_UNDEFINED || (*toks)[0].end == -1) {
		/* If it ran out of tokens, provide more. */
		if (ret == JSMN_ERROR_NOMEM) {
			tal_resize(toks, tal_count(*toks) * 2);
			goto again;
		}
		/* Otherwise, must be incomplete */
		*complete = false;
		return true;
	}

	/* If we read a partial element at the end of the stream we'll get a
	 * errro, but due to the previous check we know we read at
	 * least one full element, so count tokens that are part of this root
	 * element.  Bound the nesting depth here, before any recursive walk. */
	size_t datumlen;
	if (!bounded_datum_len(*toks, &datumlen))
		return false;
	ret = datumlen;

	if (!validate_jsmn_parse_output(input, *toks, *toks + ret))
		return false;

	/* Cut to length and return. */
	tal_resize(toks, ret + 1);
	/* Make sure last one is always referenceable. */
	(*toks)[ret].type = -1;
	(*toks)[ret].start = (*toks)[ret].end = (*toks)[ret].size = 0;

	*complete = true;
	return true;
}

jsmntok_t *json_parse_simple(const tal_t *ctx, const char *input, int len)
{