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/string-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;
875 /* Each argument to a macro function is one of:
877 - A quoted string or other single literal token.
879 - An argument to the macro being expanded, e.g. !1 or a named argument.
883 - A function invocation.
885 Each function invocation yields a character sequence to be turned into a
886 sequence of tokens. The case where that character sequence is a single
887 quoted string is an important special case.
889 struct parse_macro_function_ctx
891 const struct macro_token *input;
893 int nesting_countdown;
894 const struct macro_expander *me;
895 const struct macro_expansion_stack *stack;
896 struct string_map *vars;
901 macro_expand (const struct macro_tokens *, int nesting_countdown,
902 const struct macro_expander *, struct string_map *vars,
903 const struct macro_expansion_stack *stack,
904 bool *expand, bool *break_,
905 struct macro_tokens *exp);
908 expand_macro_function (struct parse_macro_function_ctx *ctx,
909 struct string *output, size_t *input_consumed);
911 /* Returns true if the pair of tokens starting at offset OFS within MTS are !*,
914 is_bang_star (const struct macro_token *mts, size_t n, size_t ofs)
917 && mts[ofs].token.type == T_MACRO_ID
918 && ss_equals (mts[ofs].token.string, ss_cstr ("!"))
919 && mts[ofs + 1].token.type == T_ASTERISK);
923 parse_function_arg (struct parse_macro_function_ctx *ctx,
924 size_t i, struct string *farg)
926 const struct macro_token *tokens = ctx->input;
927 const struct token *token = &tokens[i].token;
928 if (token->type == T_MACRO_ID && ctx->me->macro)
930 const struct macro_param *param = macro_find_parameter_by_name (
931 ctx->me->macro, token->string);
934 size_t param_idx = param - ctx->me->macro->params;
935 const struct macro_tokens *marg = ctx->me->args[param_idx];
936 for (size_t i = 0; i < marg->n; i++)
939 ds_put_byte (farg, ' ');
940 ds_put_substring (farg, marg->mts[i].representation);
945 if (is_bang_star (ctx->input, ctx->n_input, i))
947 for (size_t i = 0; i < ctx->me->macro->n_params; i++)
949 if (!ctx->me->macro->params[i].positional)
952 const struct macro_tokens *marg = ctx->me->args[i];
953 for (size_t j = 0; j < marg->n; j++)
956 ds_put_byte (farg, ' ');
957 ds_put_substring (farg, marg->mts[j].representation);
965 const char *value = string_map_find__ (ctx->vars,
966 token->string.string,
967 token->string.length);
970 ds_put_cstr (farg, value);
975 struct parse_macro_function_ctx subctx = {
976 .input = &ctx->input[i],
977 .n_input = ctx->n_input - i,
978 .nesting_countdown = ctx->nesting_countdown,
982 .expand = ctx->expand,
984 size_t subinput_consumed;
985 if (expand_macro_function (&subctx, farg, &subinput_consumed))
986 return subinput_consumed;
989 ds_put_substring (farg, tokens[i].representation);
994 parse_macro_function (struct parse_macro_function_ctx *ctx,
995 struct string_array *args,
996 struct substring function,
997 int min_args, int max_args,
998 size_t *input_consumed)
1000 const struct macro_token *tokens = ctx->input;
1001 size_t n_tokens = ctx->n_input;
1004 || tokens[0].token.type != T_MACRO_ID
1005 || !ss_equals_case (tokens[0].token.string, function)) /* XXX abbrevs allowed */
1008 if (n_tokens < 2 || tokens[1].token.type != T_LPAREN)
1010 macro_error (ctx->stack, n_tokens > 1 ? &tokens[1] : NULL,
1011 _("`(' expected following %s."), function.string);
1015 string_array_init (args);
1017 for (size_t i = 2;; )
1020 goto unexpected_end;
1021 if (tokens[i].token.type == T_RPAREN)
1023 *input_consumed = i + 1;
1024 if (args->n < min_args || args->n > max_args)
1026 macro_error (ctx->stack, &tokens[i],
1027 _("Wrong number of arguments to macro function %s."),
1034 struct string s = DS_EMPTY_INITIALIZER;
1035 i += parse_function_arg (ctx, i, &s);
1039 goto unexpected_end;
1041 string_array_append_nocopy (args, ds_steal_cstr (&s));
1043 if (tokens[i].token.type == T_COMMA)
1045 else if (tokens[i].token.type != T_RPAREN)
1047 macro_error (ctx->stack, &tokens[i],
1048 _("`,' or `)' expected in call to macro function %s."),
1055 macro_error (ctx->stack, NULL, _("Missing `)' in call to macro function %s."),
1059 string_array_destroy (args);
1064 unquote_string (const char *s, enum segmenter_mode segmenter_mode,
1065 struct string *content)
1067 struct string_lexer slex;
1068 string_lexer_init (&slex, s, strlen (s), segmenter_mode, true);
1070 struct token token1;
1071 if (!string_lexer_next (&slex, &token1))
1074 if (token1.type != T_STRING)
1076 token_uninit (&token1);
1080 struct token token2;
1081 if (string_lexer_next (&slex, &token2))
1083 token_uninit (&token1);
1084 token_uninit (&token2);
1088 ds_put_substring (content, token1.string);
1089 token_uninit (&token1);
1094 unquote_string_in_place (const char *s, enum segmenter_mode segmenter_mode,
1097 ds_init_empty (tmp);
1098 return unquote_string (s, segmenter_mode, tmp) ? ds_cstr (tmp) : s;
1102 parse_integer (const char *s, int *np)
1107 long int n = strtol (s, &tail, 10);
1108 *np = n < INT_MIN ? INT_MIN : n > INT_MAX ? INT_MAX : n;
1109 tail += strspn (tail, CC_SPACES);
1110 return *tail == '\0' && errno != ERANGE && n == *np;
1114 expand_macro_function (struct parse_macro_function_ctx *ctx,
1115 struct string *output,
1116 size_t *input_consumed)
1118 struct string_array args;
1120 if (parse_macro_function (ctx, &args, ss_cstr ("!LENGTH"), 1, 1,
1122 ds_put_format (output, "%zu", strlen (args.strings[0]));
1123 else if (parse_macro_function (ctx, &args, ss_cstr ("!BLANKS"), 1, 1,
1127 if (!parse_integer (args.strings[0], &n))
1129 macro_error (ctx->stack, NULL,
1130 _("Argument to !BLANKS must be non-negative integer "
1131 "(not \"%s\")."), args.strings[0]);
1132 string_array_destroy (&args);
1136 ds_put_byte_multiple (output, ' ', n);
1138 else if (parse_macro_function (ctx, &args, ss_cstr ("!CONCAT"), 1, INT_MAX,
1141 for (size_t i = 0; i < args.n; i++)
1142 if (!unquote_string (args.strings[i], ctx->me->segmenter_mode, output))
1143 ds_put_cstr (output, args.strings[i]);
1145 else if (parse_macro_function (ctx, &args, ss_cstr ("!HEAD"), 1, 1,
1149 const char *s = unquote_string_in_place (args.strings[0],
1150 ctx->me->segmenter_mode, &tmp);
1152 struct macro_tokens mts = { .n = 0 };
1153 macro_tokens_from_string__ (&mts, ss_cstr (s), ctx->me->segmenter_mode,
1156 ds_put_substring (output, mts.mts[0].representation);
1157 macro_tokens_uninit (&mts);
1160 else if (parse_macro_function (ctx, &args, ss_cstr ("!INDEX"), 2, 2,
1163 const char *haystack = args.strings[0];
1164 const char *needle = strstr (haystack, args.strings[1]);
1165 ds_put_format (output, "%zu", needle ? needle - haystack + 1 : 0);
1167 else if (parse_macro_function (ctx, &args, ss_cstr ("!QUOTE"), 1, 1,
1170 if (unquote_string (args.strings[0], ctx->me->segmenter_mode, NULL))
1171 ds_put_cstr (output, args.strings[0]);
1174 ds_extend (output, strlen (args.strings[0]) + 2);
1175 ds_put_byte (output, '\'');
1176 for (const char *p = args.strings[0]; *p; p++)
1179 ds_put_byte (output, '\'');
1180 ds_put_byte (output, *p);
1182 ds_put_byte (output, '\'');
1185 else if (parse_macro_function (ctx, &args, ss_cstr ("!SUBSTR"), 2, 3,
1189 if (!parse_integer (args.strings[1], &start) || start < 1)
1191 macro_error (ctx->stack, NULL,
1192 _("Second argument of !SUBSTR must be "
1193 "positive integer (not \"%s\")."),
1195 string_array_destroy (&args);
1199 int count = INT_MAX;
1200 if (args.n > 2 && (!parse_integer (args.strings[2], &count) || count < 0))
1202 macro_error (ctx->stack, NULL,
1203 _("Third argument of !SUBSTR must be "
1204 "non-negative integer (not \"%s\")."),
1206 string_array_destroy (&args);
1210 struct substring s = ss_cstr (args.strings[0]);
1211 ds_put_substring (output, ss_substr (s, start - 1, count));
1213 else if (parse_macro_function (ctx, &args, ss_cstr ("!TAIL"), 1, 1,
1217 const char *s = unquote_string_in_place (args.strings[0],
1218 ctx->me->segmenter_mode, &tmp);
1220 struct macro_tokens mts = { .n = 0 };
1221 macro_tokens_from_string__ (&mts, ss_cstr (s), ctx->me->segmenter_mode,
1225 struct macro_tokens tail = { .mts = mts.mts + 1, .n = mts.n - 1 };
1226 macro_tokens_to_representation (&tail, output, NULL, NULL);
1228 macro_tokens_uninit (&mts);
1231 else if (parse_macro_function (ctx, &args, ss_cstr ("!UNQUOTE"), 1, 1,
1234 if (!unquote_string (args.strings[0], ctx->me->segmenter_mode, output))
1235 ds_put_cstr (output, args.strings[0]);
1237 else if (parse_macro_function (ctx, &args, ss_cstr ("!UPCASE"), 1, 1,
1241 const char *s = unquote_string_in_place (args.strings[0],
1242 ctx->me->segmenter_mode, &tmp);
1243 char *upper = utf8_to_upper (s);
1244 ds_put_cstr (output, upper);
1248 else if (parse_macro_function (ctx, &args, ss_cstr ("!EVAL"), 1, 1,
1251 struct macro_tokens mts = { .n = 0 };
1252 macro_tokens_from_string__ (&mts, ss_cstr (args.strings[0]),
1253 ctx->me->segmenter_mode, ctx->stack);
1254 struct macro_tokens exp = { .n = 0 };
1255 macro_expand (&mts, ctx->nesting_countdown - 1, ctx->me, ctx->vars,
1256 &(struct macro_expansion_stack) {
1259 }, ctx->expand, NULL, &exp);
1260 macro_tokens_to_representation (&exp, output, NULL, NULL);
1261 macro_tokens_uninit (&exp);
1262 macro_tokens_uninit (&mts);
1264 else if (ctx->n_input > 0
1265 && ctx->input[0].token.type == T_MACRO_ID
1266 && ss_equals_case (ctx->input[0].token.string, ss_cstr ("!NULL")))
1268 *input_consumed = 1;
1274 string_array_destroy (&args);
1280 int nesting_countdown;
1281 const struct macro_expander *me;
1282 const struct macro_expansion_stack *stack;
1283 struct string_map *vars;
1287 static char *macro_evaluate_or (const struct expr_context *ctx,
1288 const struct macro_token **tokens,
1289 const struct macro_token *end);
1292 macro_evaluate_literal (const struct expr_context *ctx,
1293 const struct macro_token **tokens,
1294 const struct macro_token *end)
1296 const struct macro_token *p = *tokens;
1299 if (p->token.type == T_LPAREN)
1302 char *value = macro_evaluate_or (ctx, &p, end);
1305 if (p >= end || p->token.type != T_RPAREN)
1308 macro_error (ctx->stack, p < end ? p : NULL,
1309 _("Expecting ')' in macro expression."));
1316 else if (p->token.type == T_RPAREN)
1318 macro_error (ctx->stack, p, _("Expecting literal or function invocation "
1319 "in macro expression."));
1323 struct parse_macro_function_ctx fctx = {
1326 .nesting_countdown = ctx->nesting_countdown,
1328 .stack = ctx->stack,
1330 .expand = ctx->expand,
1332 struct string function_output = DS_EMPTY_INITIALIZER;
1333 size_t function_consumed = parse_function_arg (&fctx, 0, &function_output);
1334 struct string unquoted = DS_EMPTY_INITIALIZER;
1335 if (unquote_string (ds_cstr (&function_output), ctx->me->segmenter_mode,
1338 ds_swap (&function_output, &unquoted);
1339 ds_destroy (&unquoted);
1341 *tokens = p + function_consumed;
1342 return ds_steal_cstr (&function_output);
1345 /* Returns true if MT is valid as a macro operator. Only operators written as
1346 symbols (e.g. <>) are usable in macro expressions, not operator written as
1347 letters (e.g. EQ). */
1349 is_macro_operator (const struct macro_token *mt)
1351 return (mt->representation.length > 0
1352 && !c_isalpha (mt->representation.string[0]));
1355 static enum token_type
1356 parse_relational_op (const struct macro_token *mt)
1358 switch (mt->token.type)
1368 return is_macro_operator (mt) ? mt->token.type : T_STOP;
1371 return (ss_equals_case (mt->token.string, ss_cstr ("!EQ")) ? T_EQ
1372 : ss_equals_case (mt->token.string, ss_cstr ("!NE")) ? T_NE
1373 : ss_equals_case (mt->token.string, ss_cstr ("!LT")) ? T_LT
1374 : ss_equals_case (mt->token.string, ss_cstr ("!GT")) ? T_GT
1375 : ss_equals_case (mt->token.string, ss_cstr ("!LE")) ? T_LE
1376 : ss_equals_case (mt->token.string, ss_cstr ("!GE")) ? T_GE
1385 macro_evaluate_relational (const struct expr_context *ctx,
1386 const struct macro_token **tokens,
1387 const struct macro_token *end)
1389 const struct macro_token *p = *tokens;
1390 char *lhs = macro_evaluate_literal (ctx, &p, end);
1394 enum token_type op = p >= end ? T_STOP : parse_relational_op (p);
1402 char *rhs = macro_evaluate_literal (ctx, &p, end);
1409 struct string lhs_tmp, rhs_tmp;
1410 int cmp = strcmp (unquote_string_in_place (lhs, ctx->me->segmenter_mode,
1412 unquote_string_in_place (rhs, ctx->me->segmenter_mode,
1414 ds_destroy (&lhs_tmp);
1415 ds_destroy (&rhs_tmp);
1420 bool b = (op == T_EQUALS || op == T_EQ ? !cmp
1422 : op == T_LT ? cmp < 0
1423 : op == T_GT ? cmp > 0
1424 : op == T_LE ? cmp <= 0
1425 : /* T_GE */ cmp >= 0);
1428 return xstrdup (b ? "1" : "0");
1432 macro_evaluate_not (const struct expr_context *ctx,
1433 const struct macro_token **tokens,
1434 const struct macro_token *end)
1436 const struct macro_token *p = *tokens;
1438 unsigned int negations = 0;
1440 && (ss_equals_case (p->representation, ss_cstr ("!NOT"))
1441 || ss_equals (p->representation, ss_cstr ("~"))))
1447 char *operand = macro_evaluate_relational (ctx, &p, end);
1448 if (!operand || !negations)
1454 bool b = strcmp (operand, "0") ^ (negations & 1);
1457 return xstrdup (b ? "1" : "0");
1461 macro_evaluate_and (const struct expr_context *ctx,
1462 const struct macro_token **tokens,
1463 const struct macro_token *end)
1465 const struct macro_token *p = *tokens;
1466 char *lhs = macro_evaluate_not (ctx, &p, end);
1471 && (ss_equals_case (p->representation, ss_cstr ("!AND"))
1472 || ss_equals (p->representation, ss_cstr ("&"))))
1475 char *rhs = macro_evaluate_not (ctx, &p, end);
1482 bool b = strcmp (lhs, "0") && strcmp (rhs, "0");
1485 lhs = xstrdup (b ? "1" : "0");
1492 macro_evaluate_or (const struct expr_context *ctx,
1493 const struct macro_token **tokens,
1494 const struct macro_token *end)
1496 const struct macro_token *p = *tokens;
1497 char *lhs = macro_evaluate_and (ctx, &p, end);
1502 && (ss_equals_case (p->representation, ss_cstr ("!OR"))
1503 || ss_equals (p->representation, ss_cstr ("|"))))
1506 char *rhs = macro_evaluate_and (ctx, &p, end);
1513 bool b = strcmp (lhs, "0") || strcmp (rhs, "0");
1516 lhs = xstrdup (b ? "1" : "0");
1523 macro_evaluate_expression (const struct macro_token **tokens, size_t n_tokens,
1524 int nesting_countdown,
1525 const struct macro_expander *me,
1526 const struct macro_expansion_stack *stack,
1527 struct string_map *vars, bool *expand)
1529 const struct expr_context ctx = {
1530 .nesting_countdown = nesting_countdown,
1536 return macro_evaluate_or (&ctx, tokens, *tokens + n_tokens);
1540 macro_evaluate_number (const struct macro_token **tokens, size_t n_tokens,
1541 int nesting_countdown,
1542 const struct macro_expander *me,
1543 const struct macro_expansion_stack *stack,
1544 struct string_map *vars,
1545 bool *expand, double *number)
1547 char *s = macro_evaluate_expression (tokens, n_tokens, nesting_countdown,
1548 me, stack, vars, expand);
1552 struct macro_tokens mts = { .n = 0 };
1553 macro_tokens_from_string__ (&mts, ss_cstr (s), me->segmenter_mode, stack);
1554 if (mts.n != 1 || !token_is_number (&mts.mts[0].token))
1556 macro_error (stack, mts.n > 0 ? &mts.mts[0] : NULL,
1557 _("Macro expression must evaluate to "
1558 "a number (not \"%s\")."), s);
1560 macro_tokens_uninit (&mts);
1564 *number = token_number (&mts.mts[0].token);
1566 macro_tokens_uninit (&mts);
1570 static const struct macro_token *
1571 find_ifend_clause (const struct macro_token *p, const struct macro_token *end)
1574 for (; p < end; p++)
1576 if (p->token.type != T_MACRO_ID)
1579 if (ss_equals_case (p->token.string, ss_cstr ("!IF")))
1581 else if (ss_equals_case (p->token.string, ss_cstr ("!IFEND")))
1587 else if (ss_equals_case (p->token.string, ss_cstr ("!ELSE")) && !nesting)
1594 macro_expand_if (const struct macro_token *tokens, size_t n_tokens,
1595 int nesting_countdown, const struct macro_expander *me,
1596 const struct macro_expansion_stack *stack,
1597 struct string_map *vars,
1598 bool *expand, bool *break_, struct macro_tokens *exp)
1600 const struct macro_token *p = tokens;
1601 const struct macro_token *end = tokens + n_tokens;
1603 if (p >= end || !ss_equals_case (p->token.string, ss_cstr ("!IF")))
1607 char *result = macro_evaluate_expression (&p, end - p, nesting_countdown,
1608 me, stack, vars, expand);
1611 bool b = strcmp (result, "0");
1615 || p->token.type != T_MACRO_ID
1616 || !ss_equals_case (p->token.string, ss_cstr ("!THEN")))
1618 macro_error (stack, p < end ? p : NULL,
1619 _("!THEN expected in macro !IF construct."));
1623 const struct macro_token *start_then = p + 1;
1624 const struct macro_token *end_then = find_ifend_clause (start_then, end);
1627 macro_error (stack, NULL,
1628 _("!ELSE or !IFEND expected in macro !IF construct."));
1632 const struct macro_token *start_else, *end_if;
1633 if (ss_equals_case (end_then->token.string, ss_cstr ("!ELSE")))
1635 start_else = end_then + 1;
1636 end_if = find_ifend_clause (start_else, end);
1638 || !ss_equals_case (end_if->token.string, ss_cstr ("!IFEND")))
1640 macro_error (stack, end_if ? end_if : NULL,
1641 _("!IFEND expected in macro !IF construct."));
1651 const struct macro_token *start;
1656 n = end_then - start_then;
1658 else if (start_else)
1661 n = end_if - start_else;
1671 struct macro_tokens mts = {
1672 .mts = CONST_CAST (struct macro_token *, start),
1675 macro_expand (&mts, nesting_countdown, me, vars,
1676 &(struct macro_expansion_stack) {
1680 expand, break_, exp);
1682 return (end_if + 1) - tokens;
1686 macro_parse_let (const struct macro_token *tokens, size_t n_tokens,
1687 int nesting_countdown, const struct macro_expander *me,
1688 const struct macro_expansion_stack *stack,
1689 struct string_map *vars, bool *expand)
1691 const struct macro_token *p = tokens;
1692 const struct macro_token *end = tokens + n_tokens;
1694 if (p >= end || !ss_equals_case (p->token.string, ss_cstr ("!LET")))
1698 if (p >= end || p->token.type != T_MACRO_ID)
1700 macro_error (stack, p < end ? p : NULL,
1701 _("Expected macro variable name following !LET."));
1704 const struct substring var_name = p->token.string;
1705 if (is_macro_keyword (var_name)
1706 || (me->macro && macro_find_parameter_by_name (me->macro, var_name)))
1708 macro_error (stack, p < end ? p : NULL,
1709 _("Cannot use argument name or macro keyword "
1710 "\"%.*s\" as !LET variable."),
1711 (int) var_name.length, var_name.string);
1716 if (p >= end || p->token.type != T_EQUALS)
1718 macro_error (stack, p < end ? p : NULL,
1719 _("Expected `=' following !LET."));
1724 char *value = macro_evaluate_expression (&p, end - p, nesting_countdown,
1725 me, stack, vars, expand);
1729 string_map_replace_nocopy (vars, ss_xstrdup (var_name), value);
1733 static const struct macro_token *
1734 find_doend (const struct macro_expansion_stack *stack,
1735 const struct macro_token *p, const struct macro_token *end)
1738 for (; p < end; p++)
1740 if (p->token.type != T_MACRO_ID)
1743 if (ss_equals_case (p->token.string, ss_cstr ("!DO")))
1745 else if (ss_equals_case (p->token.string, ss_cstr ("!DOEND")))
1752 macro_error (stack, NULL, _("Missing !DOEND."));
1757 macro_expand_do (const struct macro_token *tokens, size_t n_tokens,
1758 int nesting_countdown, const struct macro_expander *me,
1759 const struct macro_expansion_stack *stack,
1760 struct string_map *vars,
1761 bool *expand, struct macro_tokens *exp)
1763 const struct macro_token *p = tokens;
1764 const struct macro_token *end = tokens + n_tokens;
1766 if (p >= end || !ss_equals_case (p->token.string, ss_cstr ("!DO")))
1770 if (p >= end || p->token.type != T_MACRO_ID)
1772 macro_error (stack, p < end ? p : NULL,
1773 _("Expected macro variable name following !DO."));
1776 const struct substring var_name = p->token.string;
1777 if (is_macro_keyword (var_name)
1778 || (me->macro && macro_find_parameter_by_name (me->macro, var_name)))
1780 macro_error (stack, p, _("Cannot use argument name or macro "
1781 "keyword as !DO variable."));
1786 struct macro_expansion_stack next_stack = {
1787 .name = "!DO", .next = stack,
1789 int miterate = settings_get_miterate ();
1790 if (p < end && p->token.type == T_MACRO_ID
1791 && ss_equals_case (p->token.string, ss_cstr ("!IN")))
1794 char *list = macro_evaluate_expression (&p, end - p, nesting_countdown,
1795 me, &next_stack, vars,
1800 struct macro_tokens items = { .n = 0 };
1801 macro_tokens_from_string__ (&items, ss_cstr (list), me->segmenter_mode,
1805 const struct macro_token *do_end = find_doend (stack, p, end);
1808 macro_tokens_uninit (&items);
1812 const struct macro_tokens inner = {
1813 .mts = CONST_CAST (struct macro_token *, p),
1816 for (size_t i = 0; i < items.n; i++)
1820 macro_error (stack, NULL,
1821 _("!DO loop over list exceeded "
1822 "maximum number of iterations %d. "
1823 "(Use SET MITERATE to change the limit.)"),
1827 string_map_replace_nocopy (vars, ss_xstrdup (var_name),
1828 ss_xstrdup (items.mts[i].representation));
1830 bool break_ = false;
1831 macro_expand (&inner, nesting_countdown,
1832 me, vars, &next_stack, expand, &break_, exp);
1836 return do_end - tokens + 1;
1838 else if (p < end && p->token.type == T_EQUALS)
1842 if (!macro_evaluate_number (&p, end - p, nesting_countdown,
1843 me, &next_stack, vars, expand, &first))
1846 if (p >= end || p->token.type != T_MACRO_ID
1847 || !ss_equals_case (p->token.string, ss_cstr ("!TO")))
1849 macro_error (stack, p < end ? p : NULL,
1850 _("Expected !TO in numerical !DO loop."));
1856 if (!macro_evaluate_number (&p, end - p, nesting_countdown,
1857 me, &next_stack, vars, expand, &last))
1861 if (p < end && p->token.type == T_MACRO_ID
1862 && ss_equals_case (p->token.string, ss_cstr ("!BY")))
1865 if (!macro_evaluate_number (&p, end - p, nesting_countdown,
1866 me, &next_stack, vars, expand, &by))
1871 macro_error (stack, NULL, _("!BY value cannot be zero."));
1876 const struct macro_token *do_end = find_doend (stack, p, end);
1879 const struct macro_tokens inner = {
1880 .mts = CONST_CAST (struct macro_token *, p),
1884 if ((by > 0 && first <= last) || (by < 0 && first >= last))
1887 for (double index = first;
1888 by > 0 ? (index <= last) : (index >= last);
1893 macro_error (stack, NULL,
1894 _("Numerical !DO loop exceeded "
1895 "maximum number of iterations %d. "
1896 "(Use SET MITERATE to change the limit.)"),
1901 char index_s[DBL_BUFSIZE_BOUND];
1902 c_dtoastr (index_s, sizeof index_s, 0, 0, index);
1903 string_map_replace_nocopy (vars, ss_xstrdup (var_name),
1906 bool break_ = false;
1907 macro_expand (&inner, nesting_countdown,
1908 me, vars, &next_stack, expand, &break_, exp);
1914 return do_end - tokens + 1;
1918 macro_error (stack, p < end ? p : NULL,
1919 _("Expected `=' or !IN in !DO loop."));
1925 macro_expand (const struct macro_tokens *mts, int nesting_countdown,
1926 const struct macro_expander *me, struct string_map *vars,
1927 const struct macro_expansion_stack *stack,
1928 bool *expand, bool *break_, struct macro_tokens *exp)
1930 if (nesting_countdown <= 0)
1932 macro_error (stack, NULL, _("Maximum nesting level %d exceeded. "
1933 "(Use SET MNEST to change the limit.)"),
1934 settings_get_mnest ());
1935 for (size_t i = 0; i < mts->n; i++)
1936 macro_tokens_add (exp, &mts->mts[i]);
1940 struct string_map own_vars = STRING_MAP_INITIALIZER (own_vars);
1944 for (size_t i = 0; i < mts->n && (!break_ || !*break_); i++)
1946 const struct macro_token *mt = &mts->mts[i];
1947 const struct token *token = &mt->token;
1948 if (token->type == T_MACRO_ID && me->macro)
1950 const struct macro_param *param = macro_find_parameter_by_name (
1951 me->macro, token->string);
1954 const struct macro_tokens *arg = me->args[param - me->macro->params];
1955 if (*expand && param->expand_arg)
1957 struct macro_expander subme = {
1958 .macros = me->macros,
1961 .segmenter_mode = me->segmenter_mode,
1963 macro_expand (arg, nesting_countdown, &subme, NULL,
1964 &(struct macro_expansion_stack) {
1965 .name = param->name,
1967 }, expand, break_, exp);
1970 for (size_t i = 0; i < arg->n; i++)
1971 macro_tokens_add (exp, &arg->mts[i]);
1975 if (is_bang_star (mts->mts, mts->n, i))
1977 for (size_t j = 0; j < me->macro->n_params; j++)
1979 const struct macro_param *param = &me->macro->params[j];
1980 if (!param->positional)
1983 const struct macro_tokens *arg = me->args[j];
1984 if (*expand && param->expand_arg)
1986 struct macro_expander subme = {
1987 .macros = me->macros,
1990 .segmenter_mode = me->segmenter_mode,
1992 macro_expand (arg, nesting_countdown, &subme, NULL,
1993 &(struct macro_expansion_stack) {
1996 }, expand, break_, exp);
1999 for (size_t k = 0; k < arg->n; k++)
2000 macro_tokens_add (exp, &arg->mts[k]);
2006 size_t n = macro_expand_if (&mts->mts[i], mts->n - i,
2007 nesting_countdown, me, stack,
2008 vars, expand, break_, exp);
2016 if (token->type == T_MACRO_ID && vars)
2018 const char *value = string_map_find__ (vars, token->string.string,
2019 token->string.length);
2022 macro_tokens_from_string__ (exp, ss_cstr (value),
2023 me->segmenter_mode, stack);
2030 struct macro_call *submc;
2031 int retval = macro_call_create (me->macros, token, &submc);
2032 for (size_t j = 1; !retval; j++)
2034 const struct macro_token endcmd
2035 = { .token = { .type = T_ENDCMD } };
2036 retval = macro_call_add (
2037 submc, i + j < mts->n ? &mts->mts[i + j] : &endcmd);
2042 struct macro_expander subme = {
2043 .macros = submc->macros,
2044 .macro = submc->macro,
2045 .args = submc->args,
2046 .segmenter_mode = me->segmenter_mode,
2048 macro_expand (&submc->macro->body, nesting_countdown - 1,
2049 &subme, NULL, &(struct macro_expansion_stack) {
2050 .name = submc->macro->name,
2051 .file_name = submc->macro->file_name,
2052 .first_line = submc->macro->first_line,
2053 .last_line = submc->macro->last_line,
2055 }, expand, break_, exp);
2056 macro_call_destroy (submc);
2060 macro_call_destroy (submc);
2063 if (token->type != T_MACRO_ID)
2065 macro_tokens_add (exp, mt);
2069 if (ss_equals_case (token->string, ss_cstr ("!break")))
2072 macro_error (stack, mt, _("!BREAK outside !DO."));
2080 struct parse_macro_function_ctx ctx = {
2081 .input = &mts->mts[i],
2082 .n_input = mts->n - i,
2083 .nesting_countdown = nesting_countdown,
2089 struct string function_output = DS_EMPTY_INITIALIZER;
2090 size_t function_consumed;
2091 if (expand_macro_function (&ctx, &function_output, &function_consumed))
2093 i += function_consumed - 1;
2095 macro_tokens_from_string__ (exp, function_output.ss,
2096 me->segmenter_mode, stack);
2097 ds_destroy (&function_output);
2102 size_t n = macro_parse_let (&mts->mts[i], mts->n - i,
2104 me, stack, vars, expand);
2111 n = macro_expand_do (&mts->mts[i], mts->n - i, nesting_countdown, me,
2112 stack, vars, expand, exp);
2119 if (ss_equals_case (token->string, ss_cstr ("!onexpand")))
2121 else if (ss_equals_case (token->string, ss_cstr ("!offexpand")))
2124 macro_tokens_add (exp, mt);
2126 if (vars == &own_vars)
2127 string_map_destroy (&own_vars);
2131 macro_call_expand (struct macro_call *mc, enum segmenter_mode segmenter_mode,
2132 struct macro_tokens *exp)
2134 assert (mc->state == MC_FINISHED);
2136 struct macro_expander me = {
2137 .macros = mc->macros,
2140 .segmenter_mode = segmenter_mode,
2144 struct macro_expansion_stack stack = {
2145 .name = mc->macro->name,
2146 .file_name = mc->macro->file_name,
2147 .first_line = mc->macro->first_line,
2148 .last_line = mc->macro->last_line,
2150 macro_expand (&mc->macro->body, settings_get_mnest (),
2151 &me, NULL, &stack, &expand, NULL, exp);