1 /* PSPP - a program for statistical analysis.
2 Copyright (C) 2021 Free Software Foundation, Inc.
4 This program is free software: you can redistribute it and/or modify
5 it under the terms of the GNU General Public License as published by
6 the Free Software Foundation, either version 3 of the License, or
7 (at your option) any later version.
9 This program is distributed in the hope that it will be useful,
10 but WITHOUT ANY WARRANTY; without even the implied warranty of
11 MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
12 GNU General Public License for more details.
14 You should have received a copy of the GNU General Public License
15 along with this program. If not, see <http://www.gnu.org/licenses/>. */
19 #include "language/lexer/macro.h"
25 #include "data/settings.h"
26 #include "language/lexer/lexer.h"
27 #include "language/lexer/segment.h"
28 #include "language/lexer/scan.h"
29 #include "libpspp/assertion.h"
30 #include "libpspp/cast.h"
31 #include "libpspp/i18n.h"
32 #include "libpspp/message.h"
33 #include "libpspp/str.h"
34 #include "libpspp/string-array.h"
35 #include "libpspp/stringi-map.h"
36 #include "libpspp/stringi-set.h"
38 #include "gl/c-ctype.h"
39 #include "gl/ftoastr.h"
42 #define _(msgid) gettext (msgid)
44 /* An entry in the stack of macros and macro directives being expanded. The
45 stack is maintained as a linked list. Entries are not dynamically allocated
46 but on the program stack. */
47 struct macro_expansion_stack
49 /* Points to an outer stack entry, or NULL if this is the outermost. */
50 const struct macro_expansion_stack *next;
52 /* A macro name or !IF, !DO, etc. */
55 /* Location of the macro definition, if available. */
56 const char *file_name;
61 /* Reports an error during macro expansion. STACK is the stack for reporting
62 the location of the error, MT is the optional token at which the error was
63 detected, and FORMAT along with the varargs is the message to report. */
64 static void PRINTF_FORMAT (3, 4)
65 macro_error (const struct macro_expansion_stack *stack,
66 const struct macro_token *mt,
67 const char *format, ...)
69 struct msg_stack **ms = NULL;
70 size_t allocated_ms = 0;
73 for (const struct macro_expansion_stack *p = stack; p; p = p->next)
75 if (n_ms >= allocated_ms)
76 ms = x2nrealloc (ms, &allocated_ms, sizeof *ms);
78 /* TRANSLATORS: These strings are used for explaining the context of an
79 error. The "While expanding" message appears first, followed by zero
80 or more of the "inside expansion" messages. `innermost',
81 `next_inner`, etc., are names of macros, and `foobar' is a piece of
84 foo.sps:12: At `foobar' in the expansion of 'innermost',
85 foo.sps:23: inside the expansion of 'next_inner',
86 foo.sps:34: inside the expansion of 'next_inner2',
87 foo.sps:45: inside the expansion of 'outermost',
88 foo.sps:76: This is the actual error message. */
92 if (mt && mt->representation.length)
95 str_ellipsize (mt->representation, syntax, sizeof syntax);
96 description = xasprintf (_("At `%s' in the expansion of `%s',"),
100 description = xasprintf (_("In the expansion of `%s',"), p->name);
103 description = xasprintf (_("inside the expansion of `%s',"), p->name);
105 ms[n_ms] = xmalloc (sizeof *ms[n_ms]);
106 *ms[n_ms] = (struct msg_stack) {
108 .file_name = xstrdup_if_nonnull (p->file_name),
109 .first_line = p->first_line,
110 .last_line = p->last_line,
112 .description = description,
118 va_start (args, format);
119 char *s = xvasprintf (format, args);
122 struct msg *m = xmalloc (sizeof *m);
124 .category = MSG_C_SYNTAX,
125 .severity = MSG_S_ERROR,
134 macro_token_copy (struct macro_token *dst, const struct macro_token *src)
136 token_copy (&dst->token, &src->token);
137 ss_alloc_substring (&dst->representation, src->representation);
141 macro_token_uninit (struct macro_token *mt)
143 token_uninit (&mt->token);
144 ss_dealloc (&mt->representation);
148 macro_token_to_representation (struct macro_token *mt, struct string *s)
150 ds_put_substring (s, mt->representation);
153 is_macro_keyword (struct substring s)
155 static struct stringi_set keywords = STRINGI_SET_INITIALIZER (keywords);
156 if (stringi_set_is_empty (&keywords))
158 static const char *kws[] = {
179 for (size_t i = 0; i < sizeof kws / sizeof *kws; i++)
180 stringi_set_insert (&keywords, kws[i]);
183 ss_ltrim (&s, ss_cstr ("!"));
184 return stringi_set_contains_len (&keywords, s.string, s.length);
188 macro_tokens_copy (struct macro_tokens *dst, const struct macro_tokens *src)
190 *dst = (struct macro_tokens) {
191 .mts = xmalloc (src->n * sizeof *dst->mts),
195 for (size_t i = 0; i < src->n; i++)
196 macro_token_copy (&dst->mts[i], &src->mts[i]);
200 macro_tokens_uninit (struct macro_tokens *mts)
202 for (size_t i = 0; i < mts->n; i++)
203 macro_token_uninit (&mts->mts[i]);
208 macro_tokens_add_uninit (struct macro_tokens *mts)
210 if (mts->n >= mts->allocated)
211 mts->mts = x2nrealloc (mts->mts, &mts->allocated, sizeof *mts->mts);
212 return &mts->mts[mts->n++];
216 macro_tokens_add (struct macro_tokens *mts, const struct macro_token *mt)
218 macro_token_copy (macro_tokens_add_uninit (mts), mt);
221 /* Tokenizes SRC according to MODE and appends the tokens to MTS. Uses STACK,
222 if nonull, for error reporting. */
224 macro_tokens_from_string__ (struct macro_tokens *mts, const struct substring src,
225 enum segmenter_mode mode,
226 const struct macro_expansion_stack *stack)
230 struct segmenter segmenter;
231 struct substring body;
234 struct state state = {
235 .segmenter = segmenter_init (mode, true),
238 struct state saved = state;
240 while (state.body.length > 0)
242 struct macro_token mt = {
243 .token = { .type = T_STOP },
244 .representation = { .string = state.body.string },
246 struct token *token = &mt.token;
248 struct scanner scanner;
249 scanner_init (&scanner, token);
253 enum segment_type type;
254 int seg_len = segmenter_push (&state.segmenter, state.body.string,
255 state.body.length, true, &type);
256 assert (seg_len >= 0);
258 struct substring segment = ss_head (state.body, seg_len);
259 ss_advance (&state.body, seg_len);
261 enum scan_result result = scanner_push (&scanner, type, segment, token);
262 if (result == SCAN_SAVE)
264 else if (result == SCAN_BACK)
269 else if (result == SCAN_DONE)
273 /* We have a token in 'token'. */
274 mt.representation.length = state.body.string - mt.representation.string;
275 if (is_scan_type (token->type))
277 if (token->type != SCAN_SKIP)
279 char *s = scan_token_to_error (token);
282 mt.token.type = T_STRING;
283 macro_error (stack, &mt, "%s", s);
291 macro_tokens_add (mts, &mt);
292 token_uninit (token);
296 /* Tokenizes SRC according to MODE and appends the tokens to MTS. */
298 macro_tokens_from_string (struct macro_tokens *mts, const struct substring src,
299 enum segmenter_mode mode)
301 macro_tokens_from_string__ (mts, src, mode, NULL);
305 macro_tokens_print (const struct macro_tokens *mts, FILE *stream)
307 for (size_t i = 0; i < mts->n; i++)
308 token_print (&mts->mts[i].token, stream);
313 TC_ENDCMD, /* No space before or after (new-line after). */
314 TC_BINOP, /* Space on both sides. */
315 TC_COMMA, /* Space afterward. */
316 TC_ID, /* Don't need spaces except sequentially. */
317 TC_PUNCT, /* Don't need spaces except sequentially. */
321 needs_space (enum token_class prev, enum token_class next)
323 /* Don't need a space before or after the end of a command.
324 (A new-line is needed afterward as a special case.) */
325 if (prev == TC_ENDCMD || next == TC_ENDCMD)
328 /* Binary operators always have a space on both sides. */
329 if (prev == TC_BINOP || next == TC_BINOP)
332 /* A comma always has a space afterward. */
333 if (prev == TC_COMMA)
336 /* Otherwise, PREV is TC_ID or TC_PUNCT, which only need a space if there are
337 two or them in a row. */
341 static enum token_class
342 classify_token (enum token_type type)
394 /* Appends a syntax representation of the tokens in MTS to S. If OFS and LEN
395 are nonnull, sets OFS[i] to the offset within S of the start of token 'i' in
396 MTS and LEN[i] to its length. OFS[i] + LEN[i] is not necessarily OFS[i + 1]
397 because some tokens are separated by white space. */
399 macro_tokens_to_representation (struct macro_tokens *mts, struct string *s,
400 size_t *ofs, size_t *len)
402 assert ((ofs != NULL) == (len != NULL));
407 for (size_t i = 0; i < mts->n; i++)
411 enum token_type prev = mts->mts[i - 1].token.type;
412 enum token_type next = mts->mts[i].token.type;
414 if (prev == T_ENDCMD)
415 ds_put_byte (s, '\n');
418 enum token_class pc = classify_token (prev);
419 enum token_class nc = classify_token (next);
420 if (needs_space (pc, nc))
421 ds_put_byte (s, ' ');
426 ofs[i] = s->ss.length;
427 macro_token_to_representation (&mts->mts[i], s);
429 len[i] = s->ss.length - ofs[i];
434 macro_destroy (struct macro *m)
441 for (size_t i = 0; i < m->n_params; i++)
443 struct macro_param *p = &m->params[i];
446 macro_tokens_uninit (&p->def);
454 token_uninit (&p->charend);
458 token_uninit (&p->enclose[0]);
459 token_uninit (&p->enclose[1]);
467 macro_tokens_uninit (&m->body);
472 macro_set_create (void)
474 struct macro_set *set = xmalloc (sizeof *set);
475 *set = (struct macro_set) {
476 .macros = HMAP_INITIALIZER (set->macros),
482 macro_set_destroy (struct macro_set *set)
487 struct macro *macro, *next;
488 HMAP_FOR_EACH_SAFE (macro, next, struct macro, hmap_node, &set->macros)
490 hmap_delete (&set->macros, ¯o->hmap_node);
491 macro_destroy (macro);
493 hmap_destroy (&set->macros);
498 hash_macro_name (const char *name)
500 return utf8_hash_case_string (name, 0);
503 static struct macro *
504 macro_set_find__ (struct macro_set *set, const char *name)
506 if (macro_set_is_empty (set))
510 HMAP_FOR_EACH_WITH_HASH (macro, struct macro, hmap_node,
511 hash_macro_name (name), &set->macros)
512 if (!utf8_strcasecmp (macro->name, name))
519 macro_set_find (const struct macro_set *set, const char *name)
521 return macro_set_find__ (CONST_CAST (struct macro_set *, set), name);
524 /* Adds M to SET. M replaces any existing macro with the same name. Takes
527 macro_set_add (struct macro_set *set, struct macro *m)
529 struct macro *victim = macro_set_find__ (set, m->name);
532 hmap_delete (&set->macros, &victim->hmap_node);
533 macro_destroy (victim);
536 hmap_insert (&set->macros, &m->hmap_node, hash_macro_name (m->name));
539 /* Macro call parsing.. */
546 /* Accumulating tokens in mc->params toward the end of any type of
550 /* Expecting the opening delimiter of an ARG_ENCLOSE argument. */
553 /* Expecting a keyword for a keyword argument. */
556 /* Expecting an equal sign for a keyword argument. */
559 /* Macro fully parsed and ready for expansion. */
563 /* Parsing macro calls. This is a FSM driven by macro_call_create() and
564 macro_call_add() to identify the macro being called and obtain its
565 arguments. 'state' identifies the FSM state. */
568 const struct macro_set *macros;
569 const struct macro *macro;
570 struct macro_tokens **args;
574 const struct macro_param *param; /* Parameter currently being parsed. */
577 /* Completes macro expansion by initializing arguments that weren't supplied to
580 mc_finished (struct macro_call *mc)
582 mc->state = MC_FINISHED;
583 for (size_t i = 0; i < mc->macro->n_params; i++)
585 mc->args[i] = &mc->macro->params[i].def;
590 mc_next_arg (struct macro_call *mc)
594 assert (!mc->macro->n_params);
595 return mc_finished (mc);
597 else if (mc->param->positional)
600 if (mc->param >= &mc->macro->params[mc->macro->n_params])
601 return mc_finished (mc);
604 mc->state = (!mc->param->positional ? MC_KEYWORD
605 : mc->param->arg_type == ARG_ENCLOSE ? MC_ENCLOSE
612 for (size_t i = 0; i < mc->macro->n_params; i++)
615 mc->state = MC_KEYWORD;
618 return mc_finished (mc);
623 mc_error (struct macro_call *mc)
625 mc->state = MC_ERROR;
630 mc_add_arg (struct macro_call *mc, const struct macro_token *mt)
632 const struct macro_param *p = mc->param;
634 const struct token *token = &mt->token;
635 if ((token->type == T_ENDCMD || token->type == T_STOP)
636 && p->arg_type != ARG_CMDEND)
638 msg (SE, _("Unexpected end of command reading argument %s "
639 "to macro %s."), mc->param->name, mc->macro->name);
641 return mc_error (mc);
646 struct macro_tokens **argp = &mc->args[p - mc->macro->params];
648 *argp = xzalloc (sizeof **argp);
649 struct macro_tokens *arg = *argp;
650 if (p->arg_type == ARG_N_TOKENS)
652 macro_tokens_add (arg, mt);
653 if (arg->n >= p->n_tokens)
654 return mc_next_arg (mc);
657 else if (p->arg_type == ARG_CMDEND)
659 if (token->type == T_ENDCMD || token->type == T_STOP)
660 return mc_next_arg (mc);
661 macro_tokens_add (arg, mt);
666 const struct token *end
667 = p->arg_type == ARG_CHAREND ? &p->charend : &p->enclose[1];
668 if (token_equal (token, end))
669 return mc_next_arg (mc);
670 macro_tokens_add (arg, mt);
676 mc_expected (struct macro_call *mc, const struct macro_token *actual,
677 const struct token *expected)
679 const struct substring actual_s
680 = (actual->representation.length ? actual->representation
681 : ss_cstr (_("<end of input>")));
682 char *expected_s = token_to_string (expected);
683 msg (SE, _("Found `%.*s' while expecting `%s' reading argument %s "
685 (int) actual_s.length, actual_s.string, expected_s,
686 mc->param->name, mc->macro->name);
689 return mc_error (mc);
693 mc_enclose (struct macro_call *mc, const struct macro_token *mt)
695 const struct token *token = &mt->token;
698 if (token_equal (&mc->param->enclose[0], token))
704 return mc_expected (mc, mt, &mc->param->enclose[0]);
707 static const struct macro_param *
708 macro_find_parameter_by_name (const struct macro *m, struct substring name)
710 ss_ltrim (&name, ss_cstr ("!"));
712 for (size_t i = 0; i < m->n_params; i++)
714 const struct macro_param *p = &m->params[i];
715 struct substring p_name = ss_cstr (p->name + 1);
716 if (!utf8_strncasecmp (p_name.string, p_name.length,
717 name.string, name.length))
724 mc_keyword (struct macro_call *mc, const struct macro_token *mt)
726 const struct token *token = &mt->token;
727 if (token->type != T_ID)
728 return mc_finished (mc);
730 const struct macro_param *p = macro_find_parameter_by_name (mc->macro,
734 size_t arg_index = p - mc->macro->params;
736 if (mc->args[arg_index])
739 _("Argument %s multiply specified in call to macro %s."),
740 p->name, mc->macro->name);
741 return mc_error (mc);
745 mc->state = MC_EQUALS;
749 return mc_finished (mc);
753 mc_equals (struct macro_call *mc, const struct macro_token *mt)
755 const struct token *token = &mt->token;
758 if (token->type == T_EQUALS)
764 return mc_expected (mc, mt, &(struct token) { .type = T_EQUALS });
767 /* If TOKEN is the first token of a call to a macro in MACROS, create a new
768 macro expander, initializes *MCP to it. Returns 0 if more tokens are needed
769 and should be added via macro_call_add() or 1 if the caller should next call
770 macro_call_get_expansion().
772 If TOKEN is not the first token of a macro call, returns -1 and sets *MCP to
775 macro_call_create (const struct macro_set *macros,
776 const struct token *token,
777 struct macro_call **mcp)
779 const struct macro *macro = (token->type == T_ID || token->type == T_MACRO_ID
780 ? macro_set_find (macros, token->string.string)
788 struct macro_call *mc = xmalloc (sizeof *mc);
789 *mc = (struct macro_call) {
793 .state = (!macro->n_params ? MC_FINISHED
794 : !macro->params[0].positional ? MC_KEYWORD
795 : macro->params[0].arg_type == ARG_ENCLOSE ? MC_ENCLOSE
797 .args = macro->n_params ? xcalloc (macro->n_params, sizeof *mc->args) : NULL,
798 .param = macro->params,
802 return mc->state == MC_FINISHED ? 1 : 0;
806 macro_call_destroy (struct macro_call *mc)
811 for (size_t i = 0; i < mc->macro->n_params; i++)
813 struct macro_tokens *a = mc->args[i];
814 if (a && a != &mc->macro->params[i].def)
816 macro_tokens_uninit (a);
824 /* Adds TOKEN to the collection of tokens in MC that potentially need to be
827 Returns -1 if the tokens added do not actually invoke a macro. The caller
828 should consume the first token without expanding it. (Later tokens might
829 invoke a macro so it's best to feed the second token into a new expander.)
831 Returns 0 if the macro expander needs more tokens, for macro arguments or to
832 decide whether this is actually a macro invocation. The caller should call
833 macro_call_add() again with the next token.
835 Returns a positive number to indicate that the returned number of tokens
836 invoke a macro. The number returned might be less than the number of tokens
837 added because it can take a few tokens of lookahead to determine whether the
838 macro invocation is finished. The caller should call
839 macro_call_get_expansion() to obtain the expansion. */
841 macro_call_add (struct macro_call *mc, const struct macro_token *mt)
849 return mc_add_arg (mc, mt);
852 return mc_enclose (mc, mt);
855 return mc_keyword (mc, mt);
858 return mc_equals (mc, mt);
865 /* Macro expansion. */
867 struct macro_expander
869 const struct macro_set *macros;
870 const struct macro *macro;
871 struct macro_tokens **args;
872 enum segmenter_mode segmenter_mode;
873 struct stringi_map *vars;
876 int nesting_countdown;
879 /* Each argument to a macro function is one of:
881 - A quoted string or other single literal token.
883 - An argument to the macro being expanded, e.g. !1 or a named argument.
887 - A function invocation.
889 Each function invocation yields a character sequence to be turned into a
890 sequence of tokens. The case where that character sequence is a single
891 quoted string is an important special case.
893 struct parse_macro_function_ctx
895 const struct macro_token *input;
897 const struct macro_expander *me;
898 const struct macro_expansion_stack *stack;
902 macro_expand (const struct macro_tokens *, const struct macro_expander *,
903 const struct macro_expansion_stack *,
904 struct macro_tokens *);
907 expand_macro_function (struct parse_macro_function_ctx *ctx,
908 struct string *output, size_t *input_consumed);
910 /* Returns true if the pair of tokens starting at offset OFS within MTS are !*,
913 is_bang_star (const struct macro_token *mts, size_t n, size_t ofs)
916 && mts[ofs].token.type == T_MACRO_ID
917 && ss_equals (mts[ofs].token.string, ss_cstr ("!"))
918 && mts[ofs + 1].token.type == T_ASTERISK);
922 parse_function_arg (struct parse_macro_function_ctx *ctx,
923 size_t i, struct string *farg)
925 const struct macro_token *tokens = ctx->input;
926 const struct token *token = &tokens[i].token;
927 if (token->type == T_MACRO_ID && ctx->me->macro)
929 const struct macro_param *param = macro_find_parameter_by_name (
930 ctx->me->macro, token->string);
933 size_t param_idx = param - ctx->me->macro->params;
934 const struct macro_tokens *marg = ctx->me->args[param_idx];
935 for (size_t i = 0; i < marg->n; i++)
938 ds_put_byte (farg, ' ');
939 ds_put_substring (farg, marg->mts[i].representation);
944 if (is_bang_star (ctx->input, ctx->n_input, i))
946 for (size_t i = 0; i < ctx->me->macro->n_params; i++)
948 if (!ctx->me->macro->params[i].positional)
951 const struct macro_tokens *marg = ctx->me->args[i];
952 for (size_t j = 0; j < marg->n; j++)
955 ds_put_byte (farg, ' ');
956 ds_put_substring (farg, marg->mts[j].representation);
962 const char *value = stringi_map_find__ (ctx->me->vars,
963 token->string.string,
964 token->string.length);
967 ds_put_cstr (farg, value);
971 struct parse_macro_function_ctx subctx = {
972 .input = &ctx->input[i],
973 .n_input = ctx->n_input - i,
977 size_t subinput_consumed;
978 if (expand_macro_function (&subctx, farg, &subinput_consumed))
979 return subinput_consumed;
982 ds_put_substring (farg, tokens[i].representation);
987 parse_macro_function (struct parse_macro_function_ctx *ctx,
988 struct string_array *args,
989 struct substring function,
990 int min_args, int max_args,
991 size_t *input_consumed)
993 const struct macro_token *tokens = ctx->input;
994 size_t n_tokens = ctx->n_input;
997 || tokens[0].token.type != T_MACRO_ID
998 || !ss_equals_case (tokens[0].token.string, function)) /* XXX abbrevs allowed */
1001 if (n_tokens < 2 || tokens[1].token.type != T_LPAREN)
1003 macro_error (ctx->stack, n_tokens > 1 ? &tokens[1] : NULL,
1004 _("`(' expected following %s."), function.string);
1008 string_array_init (args);
1010 for (size_t i = 2;; )
1013 goto unexpected_end;
1014 if (tokens[i].token.type == T_RPAREN)
1016 *input_consumed = i + 1;
1017 if (args->n < min_args || args->n > max_args)
1019 macro_error (ctx->stack, &tokens[i],
1020 _("Wrong number of arguments to macro function %s."),
1027 struct string s = DS_EMPTY_INITIALIZER;
1028 i += parse_function_arg (ctx, i, &s);
1032 goto unexpected_end;
1034 string_array_append_nocopy (args, ds_steal_cstr (&s));
1036 if (tokens[i].token.type == T_COMMA)
1038 else if (tokens[i].token.type != T_RPAREN)
1040 macro_error (ctx->stack, &tokens[i],
1041 _("`,' or `)' expected in call to macro function %s."),
1048 macro_error (ctx->stack, NULL, _("Missing `)' in call to macro function %s."),
1052 string_array_destroy (args);
1057 unquote_string (const char *s, enum segmenter_mode segmenter_mode,
1058 struct string *content)
1060 struct string_lexer slex;
1061 string_lexer_init (&slex, s, strlen (s), segmenter_mode, true);
1063 struct token token1;
1064 if (!string_lexer_next (&slex, &token1))
1067 if (token1.type != T_STRING)
1069 token_uninit (&token1);
1073 struct token token2;
1074 if (string_lexer_next (&slex, &token2))
1076 token_uninit (&token1);
1077 token_uninit (&token2);
1081 ds_put_substring (content, token1.string);
1082 token_uninit (&token1);
1087 unquote_string_in_place (const char *s, enum segmenter_mode segmenter_mode,
1090 ds_init_empty (tmp);
1091 return unquote_string (s, segmenter_mode, tmp) ? ds_cstr (tmp) : s;
1095 parse_integer (const char *s, int *np)
1100 long int n = strtol (s, &tail, 10);
1101 *np = n < INT_MIN ? INT_MIN : n > INT_MAX ? INT_MAX : n;
1102 tail += strspn (tail, CC_SPACES);
1103 return *tail == '\0' && errno != ERANGE && n == *np;
1107 expand_macro_function (struct parse_macro_function_ctx *ctx,
1108 struct string *output,
1109 size_t *input_consumed)
1111 struct string_array args;
1113 if (parse_macro_function (ctx, &args, ss_cstr ("!LENGTH"), 1, 1,
1115 ds_put_format (output, "%zu", strlen (args.strings[0]));
1116 else if (parse_macro_function (ctx, &args, ss_cstr ("!BLANKS"), 1, 1,
1120 if (!parse_integer (args.strings[0], &n))
1122 macro_error (ctx->stack, NULL,
1123 _("Argument to !BLANKS must be non-negative integer "
1124 "(not \"%s\")."), args.strings[0]);
1125 string_array_destroy (&args);
1129 ds_put_byte_multiple (output, ' ', n);
1131 else if (parse_macro_function (ctx, &args, ss_cstr ("!CONCAT"), 1, INT_MAX,
1134 for (size_t i = 0; i < args.n; i++)
1135 if (!unquote_string (args.strings[i], ctx->me->segmenter_mode, output))
1136 ds_put_cstr (output, args.strings[i]);
1138 else if (parse_macro_function (ctx, &args, ss_cstr ("!HEAD"), 1, 1,
1142 const char *s = unquote_string_in_place (args.strings[0],
1143 ctx->me->segmenter_mode, &tmp);
1145 struct macro_tokens mts = { .n = 0 };
1146 macro_tokens_from_string__ (&mts, ss_cstr (s), ctx->me->segmenter_mode,
1149 ds_put_substring (output, mts.mts[0].representation);
1150 macro_tokens_uninit (&mts);
1153 else if (parse_macro_function (ctx, &args, ss_cstr ("!INDEX"), 2, 2,
1156 const char *haystack = args.strings[0];
1157 const char *needle = strstr (haystack, args.strings[1]);
1158 ds_put_format (output, "%zu", needle ? needle - haystack + 1 : 0);
1160 else if (parse_macro_function (ctx, &args, ss_cstr ("!QUOTE"), 1, 1,
1163 if (unquote_string (args.strings[0], ctx->me->segmenter_mode, NULL))
1164 ds_put_cstr (output, args.strings[0]);
1167 ds_extend (output, strlen (args.strings[0]) + 2);
1168 ds_put_byte (output, '\'');
1169 for (const char *p = args.strings[0]; *p; p++)
1172 ds_put_byte (output, '\'');
1173 ds_put_byte (output, *p);
1175 ds_put_byte (output, '\'');
1178 else if (parse_macro_function (ctx, &args, ss_cstr ("!SUBSTR"), 2, 3,
1182 if (!parse_integer (args.strings[1], &start) || start < 1)
1184 macro_error (ctx->stack, NULL,
1185 _("Second argument of !SUBSTR must be "
1186 "positive integer (not \"%s\")."),
1188 string_array_destroy (&args);
1192 int count = INT_MAX;
1193 if (args.n > 2 && (!parse_integer (args.strings[2], &count) || count < 0))
1195 macro_error (ctx->stack, NULL,
1196 _("Third argument of !SUBSTR must be "
1197 "non-negative integer (not \"%s\")."),
1199 string_array_destroy (&args);
1203 struct substring s = ss_cstr (args.strings[0]);
1204 ds_put_substring (output, ss_substr (s, start - 1, count));
1206 else if (parse_macro_function (ctx, &args, ss_cstr ("!TAIL"), 1, 1,
1210 const char *s = unquote_string_in_place (args.strings[0],
1211 ctx->me->segmenter_mode, &tmp);
1213 struct macro_tokens mts = { .n = 0 };
1214 macro_tokens_from_string__ (&mts, ss_cstr (s), ctx->me->segmenter_mode,
1218 struct macro_tokens tail = { .mts = mts.mts + 1, .n = mts.n - 1 };
1219 macro_tokens_to_representation (&tail, output, NULL, NULL);
1221 macro_tokens_uninit (&mts);
1224 else if (parse_macro_function (ctx, &args, ss_cstr ("!UNQUOTE"), 1, 1,
1227 if (!unquote_string (args.strings[0], ctx->me->segmenter_mode, output))
1228 ds_put_cstr (output, args.strings[0]);
1230 else if (parse_macro_function (ctx, &args, ss_cstr ("!UPCASE"), 1, 1,
1234 const char *s = unquote_string_in_place (args.strings[0],
1235 ctx->me->segmenter_mode, &tmp);
1236 char *upper = utf8_to_upper (s);
1237 ds_put_cstr (output, upper);
1241 else if (parse_macro_function (ctx, &args, ss_cstr ("!EVAL"), 1, 1,
1244 struct macro_tokens mts = { .n = 0 };
1245 macro_tokens_from_string__ (&mts, ss_cstr (args.strings[0]),
1246 ctx->me->segmenter_mode, ctx->stack);
1247 struct macro_tokens exp = { .n = 0 };
1248 struct macro_expander subme = *ctx->me;
1249 subme.break_ = NULL;
1250 macro_expand (&mts, &subme,
1251 &(struct macro_expansion_stack) {
1255 macro_tokens_to_representation (&exp, output, NULL, NULL);
1256 macro_tokens_uninit (&exp);
1257 macro_tokens_uninit (&mts);
1259 else if (ctx->n_input > 0
1260 && ctx->input[0].token.type == T_MACRO_ID
1261 && ss_equals_case (ctx->input[0].token.string, ss_cstr ("!NULL")))
1263 *input_consumed = 1;
1269 string_array_destroy (&args);
1273 static char *macro_evaluate_or (const struct macro_expander *me,
1274 const struct macro_expansion_stack *stack,
1275 const struct macro_token **tokens,
1276 const struct macro_token *end);
1279 macro_evaluate_literal (const struct macro_expander *me,
1280 const struct macro_expansion_stack *stack,
1281 const struct macro_token **tokens,
1282 const struct macro_token *end)
1284 const struct macro_token *p = *tokens;
1287 if (p->token.type == T_LPAREN)
1290 char *value = macro_evaluate_or (me, stack, &p, end);
1293 if (p >= end || p->token.type != T_RPAREN)
1296 macro_error (stack, p < end ? p : NULL,
1297 _("Expecting ')' in macro expression."));
1304 else if (p->token.type == T_RPAREN)
1306 macro_error (stack, p, _("Expecting literal or function invocation "
1307 "in macro expression."));
1311 struct parse_macro_function_ctx fctx = {
1317 struct string function_output = DS_EMPTY_INITIALIZER;
1318 size_t function_consumed = parse_function_arg (&fctx, 0, &function_output);
1319 struct string unquoted = DS_EMPTY_INITIALIZER;
1320 if (unquote_string (ds_cstr (&function_output), me->segmenter_mode,
1323 ds_swap (&function_output, &unquoted);
1324 ds_destroy (&unquoted);
1326 *tokens = p + function_consumed;
1327 return ds_steal_cstr (&function_output);
1330 /* Returns true if MT is valid as a macro operator. Only operators written as
1331 symbols (e.g. <>) are usable in macro expressions, not operator written as
1332 letters (e.g. EQ). */
1334 is_macro_operator (const struct macro_token *mt)
1336 return (mt->representation.length > 0
1337 && !c_isalpha (mt->representation.string[0]));
1340 static enum token_type
1341 parse_relational_op (const struct macro_token *mt)
1343 switch (mt->token.type)
1353 return is_macro_operator (mt) ? mt->token.type : T_STOP;
1356 return (ss_equals_case (mt->token.string, ss_cstr ("!EQ")) ? T_EQ
1357 : ss_equals_case (mt->token.string, ss_cstr ("!NE")) ? T_NE
1358 : ss_equals_case (mt->token.string, ss_cstr ("!LT")) ? T_LT
1359 : ss_equals_case (mt->token.string, ss_cstr ("!GT")) ? T_GT
1360 : ss_equals_case (mt->token.string, ss_cstr ("!LE")) ? T_LE
1361 : ss_equals_case (mt->token.string, ss_cstr ("!GE")) ? T_GE
1370 macro_evaluate_relational (const struct macro_expander *me,
1371 const struct macro_expansion_stack *stack,
1372 const struct macro_token **tokens,
1373 const struct macro_token *end)
1375 const struct macro_token *p = *tokens;
1376 char *lhs = macro_evaluate_literal (me, stack, &p, end);
1380 enum token_type op = p >= end ? T_STOP : parse_relational_op (p);
1388 char *rhs = macro_evaluate_literal (me, stack, &p, end);
1395 struct string lhs_tmp, rhs_tmp;
1396 int cmp = strcmp (unquote_string_in_place (lhs, me->segmenter_mode,
1398 unquote_string_in_place (rhs, me->segmenter_mode,
1400 ds_destroy (&lhs_tmp);
1401 ds_destroy (&rhs_tmp);
1406 bool b = (op == T_EQUALS || op == T_EQ ? !cmp
1408 : op == T_LT ? cmp < 0
1409 : op == T_GT ? cmp > 0
1410 : op == T_LE ? cmp <= 0
1411 : /* T_GE */ cmp >= 0);
1414 return xstrdup (b ? "1" : "0");
1418 macro_evaluate_not (const struct macro_expander *me,
1419 const struct macro_expansion_stack *stack,
1420 const struct macro_token **tokens,
1421 const struct macro_token *end)
1423 const struct macro_token *p = *tokens;
1425 unsigned int negations = 0;
1427 && (ss_equals_case (p->representation, ss_cstr ("!NOT"))
1428 || ss_equals (p->representation, ss_cstr ("~"))))
1434 char *operand = macro_evaluate_relational (me, stack, &p, end);
1435 if (!operand || !negations)
1441 bool b = strcmp (operand, "0") ^ (negations & 1);
1444 return xstrdup (b ? "1" : "0");
1448 macro_evaluate_and (const struct macro_expander *me,
1449 const struct macro_expansion_stack *stack,
1450 const struct macro_token **tokens,
1451 const struct macro_token *end)
1453 const struct macro_token *p = *tokens;
1454 char *lhs = macro_evaluate_not (me, stack, &p, end);
1459 && (ss_equals_case (p->representation, ss_cstr ("!AND"))
1460 || ss_equals (p->representation, ss_cstr ("&"))))
1463 char *rhs = macro_evaluate_not (me, stack, &p, end);
1470 bool b = strcmp (lhs, "0") && strcmp (rhs, "0");
1473 lhs = xstrdup (b ? "1" : "0");
1480 macro_evaluate_or (const struct macro_expander *me,
1481 const struct macro_expansion_stack *stack,
1482 const struct macro_token **tokens,
1483 const struct macro_token *end)
1485 const struct macro_token *p = *tokens;
1486 char *lhs = macro_evaluate_and (me, stack, &p, end);
1491 && (ss_equals_case (p->representation, ss_cstr ("!OR"))
1492 || ss_equals (p->representation, ss_cstr ("|"))))
1495 char *rhs = macro_evaluate_and (me, stack, &p, end);
1502 bool b = strcmp (lhs, "0") || strcmp (rhs, "0");
1505 lhs = xstrdup (b ? "1" : "0");
1512 macro_evaluate_expression (const struct macro_token **tokens, size_t n_tokens,
1513 const struct macro_expander *me,
1514 const struct macro_expansion_stack *stack)
1516 return macro_evaluate_or (me, stack, tokens, *tokens + n_tokens);
1520 macro_evaluate_number (const struct macro_token **tokens, size_t n_tokens,
1521 const struct macro_expander *me,
1522 const struct macro_expansion_stack *stack,
1525 char *s = macro_evaluate_expression (tokens, n_tokens, me, stack);
1529 struct macro_tokens mts = { .n = 0 };
1530 macro_tokens_from_string__ (&mts, ss_cstr (s), me->segmenter_mode, stack);
1531 if (mts.n != 1 || !token_is_number (&mts.mts[0].token))
1533 macro_error (stack, mts.n > 0 ? &mts.mts[0] : NULL,
1534 _("Macro expression must evaluate to "
1535 "a number (not \"%s\")."), s);
1537 macro_tokens_uninit (&mts);
1541 *number = token_number (&mts.mts[0].token);
1543 macro_tokens_uninit (&mts);
1547 static const struct macro_token *
1548 find_ifend_clause (const struct macro_token *p, const struct macro_token *end)
1551 for (; p < end; p++)
1553 if (p->token.type != T_MACRO_ID)
1556 if (ss_equals_case (p->token.string, ss_cstr ("!IF")))
1558 else if (ss_equals_case (p->token.string, ss_cstr ("!IFEND")))
1564 else if (ss_equals_case (p->token.string, ss_cstr ("!ELSE")) && !nesting)
1571 macro_expand_if (const struct macro_token *tokens, size_t n_tokens,
1572 const struct macro_expander *me,
1573 const struct macro_expansion_stack *stack,
1574 struct macro_tokens *exp)
1576 const struct macro_token *p = tokens;
1577 const struct macro_token *end = tokens + n_tokens;
1579 if (p >= end || !ss_equals_case (p->token.string, ss_cstr ("!IF")))
1583 char *result = macro_evaluate_expression (&p, end - p, me, stack);
1586 bool b = strcmp (result, "0");
1590 || p->token.type != T_MACRO_ID
1591 || !ss_equals_case (p->token.string, ss_cstr ("!THEN")))
1593 macro_error (stack, p < end ? p : NULL,
1594 _("!THEN expected in macro !IF construct."));
1598 const struct macro_token *start_then = p + 1;
1599 const struct macro_token *end_then = find_ifend_clause (start_then, end);
1602 macro_error (stack, NULL,
1603 _("!ELSE or !IFEND expected in macro !IF construct."));
1607 const struct macro_token *start_else, *end_if;
1608 if (ss_equals_case (end_then->token.string, ss_cstr ("!ELSE")))
1610 start_else = end_then + 1;
1611 end_if = find_ifend_clause (start_else, end);
1613 || !ss_equals_case (end_if->token.string, ss_cstr ("!IFEND")))
1615 macro_error (stack, end_if ? end_if : NULL,
1616 _("!IFEND expected in macro !IF construct."));
1626 const struct macro_token *start;
1631 n = end_then - start_then;
1633 else if (start_else)
1636 n = end_if - start_else;
1646 struct macro_tokens mts = {
1647 .mts = CONST_CAST (struct macro_token *, start),
1650 macro_expand (&mts, me, &(struct macro_expansion_stack) {
1656 return (end_if + 1) - tokens;
1660 macro_parse_let (const struct macro_token *tokens, size_t n_tokens,
1661 const struct macro_expander *me,
1662 const struct macro_expansion_stack *stack)
1664 const struct macro_token *p = tokens;
1665 const struct macro_token *end = tokens + n_tokens;
1667 if (p >= end || !ss_equals_case (p->token.string, ss_cstr ("!LET")))
1671 if (p >= end || p->token.type != T_MACRO_ID)
1673 macro_error (stack, p < end ? p : NULL,
1674 _("Expected macro variable name following !LET."));
1677 const struct substring var_name = p->token.string;
1678 if (is_macro_keyword (var_name)
1679 || (me->macro && macro_find_parameter_by_name (me->macro, var_name)))
1681 macro_error (stack, p < end ? p : NULL,
1682 _("Cannot use argument name or macro keyword "
1683 "\"%.*s\" as !LET variable."),
1684 (int) var_name.length, var_name.string);
1689 if (p >= end || p->token.type != T_EQUALS)
1691 macro_error (stack, p < end ? p : NULL,
1692 _("Expected `=' following !LET."));
1697 char *value = macro_evaluate_expression (&p, end - p, me, stack);
1701 stringi_map_replace_nocopy (me->vars, ss_xstrdup (var_name), value);
1705 static const struct macro_token *
1706 find_doend (const struct macro_expansion_stack *stack,
1707 const struct macro_token *p, const struct macro_token *end)
1710 for (; p < end; p++)
1712 if (p->token.type != T_MACRO_ID)
1715 if (ss_equals_case (p->token.string, ss_cstr ("!DO")))
1717 else if (ss_equals_case (p->token.string, ss_cstr ("!DOEND")))
1724 macro_error (stack, NULL, _("Missing !DOEND."));
1729 macro_expand_do (const struct macro_token *tokens, size_t n_tokens,
1730 const struct macro_expander *me,
1731 const struct macro_expansion_stack *stack,
1732 struct macro_tokens *exp)
1734 const struct macro_token *p = tokens;
1735 const struct macro_token *end = tokens + n_tokens;
1737 if (p >= end || !ss_equals_case (p->token.string, ss_cstr ("!DO")))
1741 if (p >= end || p->token.type != T_MACRO_ID)
1743 macro_error (stack, p < end ? p : NULL,
1744 _("Expected macro variable name following !DO."));
1747 const struct substring var_name = p->token.string;
1748 if (is_macro_keyword (var_name)
1749 || (me->macro && macro_find_parameter_by_name (me->macro, var_name)))
1751 macro_error (stack, p, _("Cannot use argument name or macro "
1752 "keyword as !DO variable."));
1757 struct macro_expansion_stack next_stack = {
1758 .name = "!DO", .next = stack,
1760 int miterate = settings_get_miterate ();
1761 if (p < end && p->token.type == T_MACRO_ID
1762 && ss_equals_case (p->token.string, ss_cstr ("!IN")))
1765 char *list = macro_evaluate_expression (&p, end - p, me, &next_stack);
1769 struct macro_tokens items = { .n = 0 };
1770 macro_tokens_from_string__ (&items, ss_cstr (list), me->segmenter_mode,
1774 const struct macro_token *do_end = find_doend (stack, p, end);
1777 macro_tokens_uninit (&items);
1781 const struct macro_tokens inner = {
1782 .mts = CONST_CAST (struct macro_token *, p),
1786 bool break_ = false;
1787 struct macro_expander subme = *me;
1788 subme.break_ = &break_;
1790 for (size_t i = 0; i < items.n && !break_; i++)
1794 macro_error (stack, NULL,
1795 _("!DO loop over list exceeded "
1796 "maximum number of iterations %d. "
1797 "(Use SET MITERATE to change the limit.)"),
1801 stringi_map_replace_nocopy (me->vars, ss_xstrdup (var_name),
1802 ss_xstrdup (items.mts[i].representation));
1804 macro_expand (&inner, &subme, &next_stack, exp);
1806 return do_end - tokens + 1;
1808 else if (p < end && p->token.type == T_EQUALS)
1812 if (!macro_evaluate_number (&p, end - p, me, &next_stack, &first))
1815 if (p >= end || p->token.type != T_MACRO_ID
1816 || !ss_equals_case (p->token.string, ss_cstr ("!TO")))
1818 macro_error (stack, p < end ? p : NULL,
1819 _("Expected !TO in numerical !DO loop."));
1825 if (!macro_evaluate_number (&p, end - p, me, &next_stack, &last))
1829 if (p < end && p->token.type == T_MACRO_ID
1830 && ss_equals_case (p->token.string, ss_cstr ("!BY")))
1833 if (!macro_evaluate_number (&p, end - p, me, &next_stack, &by))
1838 macro_error (stack, NULL, _("!BY value cannot be zero."));
1843 const struct macro_token *do_end = find_doend (stack, p, end);
1846 const struct macro_tokens inner = {
1847 .mts = CONST_CAST (struct macro_token *, p),
1851 bool break_ = false;
1852 struct macro_expander subme = *me;
1853 subme.break_ = &break_;
1855 if ((by > 0 && first <= last) || (by < 0 && first >= last))
1858 for (double index = first;
1859 by > 0 ? (index <= last) : (index >= last) && !break_;
1864 macro_error (stack, NULL,
1865 _("Numerical !DO loop exceeded "
1866 "maximum number of iterations %d. "
1867 "(Use SET MITERATE to change the limit.)"),
1872 char index_s[DBL_BUFSIZE_BOUND];
1873 c_dtoastr (index_s, sizeof index_s, 0, 0, index);
1874 stringi_map_replace_nocopy (me->vars, ss_xstrdup (var_name),
1877 macro_expand (&inner, &subme, &next_stack, exp);
1881 return do_end - tokens + 1;
1885 macro_error (stack, p < end ? p : NULL,
1886 _("Expected `=' or !IN in !DO loop."));
1892 macro_expand (const struct macro_tokens *mts,
1893 const struct macro_expander *me,
1894 const struct macro_expansion_stack *stack,
1895 struct macro_tokens *exp)
1897 if (me->nesting_countdown <= 0)
1899 macro_error (stack, NULL, _("Maximum nesting level %d exceeded. "
1900 "(Use SET MNEST to change the limit.)"),
1901 settings_get_mnest ());
1902 for (size_t i = 0; i < mts->n; i++)
1903 macro_tokens_add (exp, &mts->mts[i]);
1907 for (size_t i = 0; i < mts->n && (!me->break_ || !*me->break_); i++)
1909 const struct macro_token *mt = &mts->mts[i];
1910 const struct token *token = &mt->token;
1911 if (token->type == T_MACRO_ID && me->macro)
1913 const struct macro_param *param = macro_find_parameter_by_name (
1914 me->macro, token->string);
1917 const struct macro_tokens *arg
1918 = me->args[param - me->macro->params];
1919 if (*me->expand && param->expand_arg)
1921 struct stringi_map vars = STRINGI_MAP_INITIALIZER (vars);
1922 struct macro_expander subme = {
1923 .macros = me->macros,
1926 .segmenter_mode = me->segmenter_mode,
1927 .expand = me->expand,
1930 .nesting_countdown = me->nesting_countdown,
1932 macro_expand (arg, &subme, &(struct macro_expansion_stack) {
1933 .name = param->name,
1936 stringi_map_destroy (&vars);
1939 for (size_t i = 0; i < arg->n; i++)
1940 macro_tokens_add (exp, &arg->mts[i]);
1944 if (is_bang_star (mts->mts, mts->n, i))
1946 for (size_t j = 0; j < me->macro->n_params; j++)
1948 const struct macro_param *param = &me->macro->params[j];
1949 if (!param->positional)
1952 const struct macro_tokens *arg = me->args[j];
1953 if (*me->expand && param->expand_arg)
1955 struct stringi_map vars = STRINGI_MAP_INITIALIZER (vars);
1956 struct macro_expander subme = {
1957 .macros = me->macros,
1960 .segmenter_mode = me->segmenter_mode,
1961 .expand = me->expand,
1964 .nesting_countdown = me->nesting_countdown,
1966 macro_expand (arg, &subme,
1967 &(struct macro_expansion_stack) {
1971 stringi_map_destroy (&vars);
1974 for (size_t k = 0; k < arg->n; k++)
1975 macro_tokens_add (exp, &arg->mts[k]);
1981 size_t n = macro_expand_if (&mts->mts[i], mts->n - i, me, stack,
1990 if (token->type == T_MACRO_ID)
1992 const char *value = stringi_map_find__ (me->vars,
1993 token->string.string,
1994 token->string.length);
1997 macro_tokens_from_string__ (exp, ss_cstr (value),
1998 me->segmenter_mode, stack);
2005 struct macro_call *submc;
2006 int retval = macro_call_create (me->macros, token, &submc);
2007 for (size_t j = 1; !retval; j++)
2009 const struct macro_token endcmd
2010 = { .token = { .type = T_ENDCMD } };
2011 retval = macro_call_add (
2012 submc, i + j < mts->n ? &mts->mts[i + j] : &endcmd);
2017 struct stringi_map vars = STRINGI_MAP_INITIALIZER (vars);
2018 struct macro_expander subme = {
2019 .macros = submc->macros,
2020 .macro = submc->macro,
2021 .args = submc->args,
2022 .segmenter_mode = me->segmenter_mode,
2023 .expand = me->expand,
2026 .nesting_countdown = me->nesting_countdown - 1,
2028 macro_expand (&submc->macro->body, &subme,
2029 &(struct macro_expansion_stack) {
2030 .name = submc->macro->name,
2031 .file_name = submc->macro->file_name,
2032 .first_line = submc->macro->first_line,
2033 .last_line = submc->macro->last_line,
2036 macro_call_destroy (submc);
2037 stringi_map_destroy (&vars);
2041 macro_call_destroy (submc);
2044 if (token->type != T_MACRO_ID)
2046 macro_tokens_add (exp, mt);
2050 if (ss_equals_case (token->string, ss_cstr ("!break")))
2053 macro_error (stack, mt, _("!BREAK outside !DO."));
2061 struct parse_macro_function_ctx ctx = {
2062 .input = &mts->mts[i],
2063 .n_input = mts->n - i,
2067 struct string function_output = DS_EMPTY_INITIALIZER;
2068 size_t function_consumed;
2069 if (expand_macro_function (&ctx, &function_output, &function_consumed))
2071 i += function_consumed - 1;
2073 macro_tokens_from_string__ (exp, function_output.ss,
2074 me->segmenter_mode, stack);
2075 ds_destroy (&function_output);
2080 size_t n = macro_parse_let (&mts->mts[i], mts->n - i, me, stack);
2087 n = macro_expand_do (&mts->mts[i], mts->n - i, me, stack, exp);
2094 if (ss_equals_case (token->string, ss_cstr ("!onexpand")))
2096 else if (ss_equals_case (token->string, ss_cstr ("!offexpand")))
2097 *me->expand = false;
2099 macro_tokens_add (exp, mt);
2104 macro_call_expand (struct macro_call *mc, enum segmenter_mode segmenter_mode,
2105 struct macro_tokens *exp)
2107 assert (mc->state == MC_FINISHED);
2110 struct stringi_map vars = STRINGI_MAP_INITIALIZER (vars);
2111 struct macro_expander me = {
2112 .macros = mc->macros,
2115 .segmenter_mode = segmenter_mode,
2119 .nesting_countdown = settings_get_mnest (),
2122 struct macro_expansion_stack stack = {
2123 .name = mc->macro->name,
2124 .file_name = mc->macro->file_name,
2125 .first_line = mc->macro->first_line,
2126 .last_line = mc->macro->last_line,
2128 macro_expand (&mc->macro->body, &me, &stack, exp);
2130 stringi_map_destroy (&vars);