Function compress_top_operands

common/splice_script.c:1280–1345

}

static struct splice_script_error *compress_top_operands(const tal_t *ctx,
							 struct token ***tokens_inout)
{
	struct token **input = *tokens_inout;
	struct token **tokens = tal_arr(ctx, struct token *, tal_count(input));
	size_t n = 0;

	for (size_t i = 0; i < tal_count(input); i++) {
		switch(input[i]->type) {
		case TOK_CHAR:
			return new_error(ctx, INVALID_TOKEN, input[i],
					 "operands");
		case TOK_DELIMITER:
		case TOK_ARROW:
		case TOK_PIPE:
		case TOK_STR:
		case TOK_SATS:
		case TOK_PERCENT:
		case TOK_QUESTION:
		case TOK_WILDCARD:
		case TOK_PLUS:
		case TOK_MINUS:
		case TOK_FEE:
		case TOK_CHANID:
		case TOK_WALLET:
		case TOK_NODEID:
		case TOK_BTCADDR:
			tokens[n++] = tal_steal(tokens, input[i]);
			break;
		case TOK_ATSYM:
			if (!n || i + 1 >= tal_count(input))
				return new_error(ctx, INVALID_TOKEN, input[i],
						 "operands");
			input[i]->type = tokens[n-1]->type == TOK_FEE
						? TOK_FEERATE
						: TOK_LEASERATE;
			input[i]->right = tal_steal(input[i], input[i+1]);
			tokens[n-1]->right = tal_steal(tokens[n-1], input[i]);
			i++;
			break;
		case TOK_COLON:
			if (!n || i + 1 >= tal_count(input))
				return new_error(ctx, INVALID_TOKEN, input[i],
						 "operands");
			input[i]->type = TOK_CHANQUERY;
			input[i]->left = tal_steal(input[i], tokens[n-1]);
			input[i]->right = tal_steal(input[i], input[i+1]);
			tokens[n-1] = tal_steal(tokens, input[i]);
			i++;
			break;
		case TOK_CHANQUERY:
		case TOK_MULTI_CHANID:
		case TOK_FEERATE:
		case TOK_LEASERATE:
		case TOK_LEASEREQ:
		case TOK_SEGMENT:
			return new_error(ctx, INVALID_TOKEN, input[i],
					 "operands");