1 /* Builtin function expansion for GNU Make.
2 Copyright (C) 1988, 1989, 1990, 1991, 1992, 1993, 1994, 1995, 1996, 1997,
3 1998, 1999, 2000, 2001, 2002, 2003, 2004, 2005, 2006, 2007 Free Software
5 This file is part of GNU Make.
7 GNU Make is free software; you can redistribute it and/or modify it under the
8 terms of the GNU General Public License as published by the Free Software
9 Foundation; either version 3 of the License, or (at your option) any later
12 GNU Make is distributed in the hope that it will be useful, but WITHOUT ANY
13 WARRANTY; without even the implied warranty of MERCHANTABILITY or FITNESS FOR
14 A PARTICULAR PURPOSE. See the GNU General Public License for more details.
16 You should have received a copy of the GNU General Public License along with
17 this program. If not, see <http://www.gnu.org/licenses/>. */
32 struct function_table_entry
36 unsigned char minimum_args
;
37 unsigned char maximum_args
;
39 char *(*func_ptr
) (char *output
, char **argv
, const char *fname
);
43 function_table_entry_hash_1 (const void *keyv
)
45 const struct function_table_entry
*key
= keyv
;
46 return_STRING_N_HASH_1 (key
->name
, key
->len
);
50 function_table_entry_hash_2 (const void *keyv
)
52 const struct function_table_entry
*key
= keyv
;
53 return_STRING_N_HASH_2 (key
->name
, key
->len
);
57 function_table_entry_hash_cmp (const void *xv
, const void *yv
)
59 const struct function_table_entry
*x
= xv
;
60 const struct function_table_entry
*y
= yv
;
61 int result
= x
->len
- y
->len
;
64 return_STRING_N_COMPARE (x
->name
, y
->name
, x
->len
);
67 static struct hash_table function_table
;
70 /* Store into VARIABLE_BUFFER at O the result of scanning TEXT and replacing
71 each occurrence of SUBST with REPLACE. TEXT is null-terminated. SLEN is
72 the length of SUBST and RLEN is the length of REPLACE. If BY_WORD is
73 nonzero, substitutions are done only on matches which are complete
74 whitespace-delimited words. */
77 subst_expand (char *o
, const char *text
, const char *subst
, const char *replace
,
78 unsigned int slen
, unsigned int rlen
, int by_word
)
83 if (slen
== 0 && !by_word
)
85 /* The first occurrence of "" in any string is its end. */
86 o
= variable_buffer_output (o
, t
, strlen (t
));
88 o
= variable_buffer_output (o
, replace
, rlen
);
94 if (by_word
&& slen
== 0)
95 /* When matching by words, the empty string should match
96 the end of each word, rather than the end of the whole text. */
97 p
= end_of_token (next_token (t
));
100 p
= strstr (t
, subst
);
103 /* No more matches. Output everything left on the end. */
104 o
= variable_buffer_output (o
, t
, strlen (t
));
109 /* Output everything before this occurrence of the string to replace. */
111 o
= variable_buffer_output (o
, t
, p
- t
);
113 /* If we're substituting only by fully matched words,
114 or only at the ends of words, check that this case qualifies. */
116 && ((p
> text
&& !isblank ((unsigned char)p
[-1]))
117 || (p
[slen
] != '\0' && !isblank ((unsigned char)p
[slen
]))))
118 /* Struck out. Output the rest of the string that is
119 no longer to be replaced. */
120 o
= variable_buffer_output (o
, subst
, slen
);
122 /* Output the replacement string. */
123 o
= variable_buffer_output (o
, replace
, rlen
);
125 /* Advance T past the string to be replaced. */
127 } while (*t
!= '\0');
133 /* Store into VARIABLE_BUFFER at O the result of scanning TEXT
134 and replacing strings matching PATTERN with REPLACE.
135 If PATTERN_PERCENT is not nil, PATTERN has already been
136 run through find_percent, and PATTERN_PERCENT is the result.
137 If REPLACE_PERCENT is not nil, REPLACE has already been
138 run through find_percent, and REPLACE_PERCENT is the result.
139 Note that we expect PATTERN_PERCENT and REPLACE_PERCENT to point to the
140 character _AFTER_ the %, not to the % itself.
144 patsubst_expand_pat (char *o
, const char *text
,
145 const char *pattern
, const char *replace
,
146 const char *pattern_percent
, const char *replace_percent
)
148 unsigned int pattern_prepercent_len
, pattern_postpercent_len
;
149 unsigned int replace_prepercent_len
, replace_postpercent_len
;
154 /* Record the length of REPLACE before and after the % so we don't have to
155 compute these lengths more than once. */
158 replace_prepercent_len
= replace_percent
- replace
- 1;
159 replace_postpercent_len
= strlen (replace_percent
);
163 replace_prepercent_len
= strlen (replace
);
164 replace_postpercent_len
= 0;
167 if (!pattern_percent
)
168 /* With no % in the pattern, this is just a simple substitution. */
169 return subst_expand (o
, text
, pattern
, replace
,
170 strlen (pattern
), strlen (replace
), 1);
172 /* Record the length of PATTERN before and after the %
173 so we don't have to compute it more than once. */
174 pattern_prepercent_len
= pattern_percent
- pattern
- 1;
175 pattern_postpercent_len
= strlen (pattern_percent
);
177 while ((t
= find_next_token (&text
, &len
)) != 0)
181 /* Is it big enough to match? */
182 if (len
< pattern_prepercent_len
+ pattern_postpercent_len
)
185 /* Does the prefix match? */
186 if (!fail
&& pattern_prepercent_len
> 0
188 || t
[pattern_prepercent_len
- 1] != pattern_percent
[-2]
189 || !strneq (t
+ 1, pattern
+ 1, pattern_prepercent_len
- 1)))
192 /* Does the suffix match? */
193 if (!fail
&& pattern_postpercent_len
> 0
194 && (t
[len
- 1] != pattern_percent
[pattern_postpercent_len
- 1]
195 || t
[len
- pattern_postpercent_len
] != *pattern_percent
196 || !strneq (&t
[len
- pattern_postpercent_len
],
197 pattern_percent
, pattern_postpercent_len
- 1)))
201 /* It didn't match. Output the string. */
202 o
= variable_buffer_output (o
, t
, len
);
205 /* It matched. Output the replacement. */
207 /* Output the part of the replacement before the %. */
208 o
= variable_buffer_output (o
, replace
, replace_prepercent_len
);
210 if (replace_percent
!= 0)
212 /* Output the part of the matched string that
213 matched the % in the pattern. */
214 o
= variable_buffer_output (o
, t
+ pattern_prepercent_len
,
215 len
- (pattern_prepercent_len
216 + pattern_postpercent_len
));
217 /* Output the part of the replacement after the %. */
218 o
= variable_buffer_output (o
, replace_percent
,
219 replace_postpercent_len
);
223 /* Output a space, but not if the replacement is "". */
224 if (fail
|| replace_prepercent_len
> 0
225 || (replace_percent
!= 0 && len
+ replace_postpercent_len
> 0))
227 o
= variable_buffer_output (o
, " ", 1);
232 /* Kill the last space. */
238 /* Store into VARIABLE_BUFFER at O the result of scanning TEXT
239 and replacing strings matching PATTERN with REPLACE.
240 If PATTERN_PERCENT is not nil, PATTERN has already been
241 run through find_percent, and PATTERN_PERCENT is the result.
242 If REPLACE_PERCENT is not nil, REPLACE has already been
243 run through find_percent, and REPLACE_PERCENT is the result.
244 Note that we expect PATTERN_PERCENT and REPLACE_PERCENT to point to the
245 character _AFTER_ the %, not to the % itself.
249 patsubst_expand (char *o
, const char *text
, char *pattern
, char *replace
)
251 const char *pattern_percent
= find_percent (pattern
);
252 const char *replace_percent
= find_percent (replace
);
254 /* If there's a percent in the pattern or replacement skip it. */
260 return patsubst_expand_pat (o
, text
, pattern
, replace
,
261 pattern_percent
, replace_percent
);
265 /* Look up a function by name. */
267 static const struct function_table_entry
*
268 lookup_function (const char *s
)
272 while (*e
&& ( (*e
>= 'a' && *e
<= 'z') || *e
== '-'))
274 if (*e
== '\0' || isblank ((unsigned char) *e
))
276 struct function_table_entry function_table_entry_key
;
277 function_table_entry_key
.name
= s
;
278 function_table_entry_key
.len
= e
- s
;
280 return hash_find_item (&function_table
, &function_table_entry_key
);
286 /* Return 1 if PATTERN matches STR, 0 if not. */
289 pattern_matches (const char *pattern
, const char *percent
, const char *str
)
291 unsigned int sfxlen
, strlength
;
295 unsigned int len
= strlen (pattern
) + 1;
296 char *new_chars
= alloca (len
);
297 memcpy (new_chars
, pattern
, len
);
298 percent
= find_percent (new_chars
);
300 return streq (new_chars
, str
);
304 sfxlen
= strlen (percent
+ 1);
305 strlength
= strlen (str
);
307 if (strlength
< (percent
- pattern
) + sfxlen
308 || !strneq (pattern
, str
, percent
- pattern
))
311 return !strcmp (percent
+ 1, str
+ (strlength
- sfxlen
));
315 /* Find the next comma or ENDPAREN (counting nested STARTPAREN and
316 ENDPARENtheses), starting at PTR before END. Return a pointer to
319 If no next argument is found, return NULL.
323 find_next_argument (char startparen
, char endparen
,
324 const char *ptr
, const char *end
)
328 for (; ptr
< end
; ++ptr
)
329 if (*ptr
== startparen
)
332 else if (*ptr
== endparen
)
339 else if (*ptr
== ',' && !count
)
342 /* We didn't find anything. */
347 /* Glob-expand LINE. The returned pointer is
348 only good until the next call to string_glob. */
351 string_glob (char *line
)
353 static char *result
= 0;
354 static unsigned int length
;
355 struct nameseq
*chain
;
358 chain
= multi_glob (parse_file_seq
359 (&line
, '\0', sizeof (struct nameseq
),
360 /* We do not want parse_file_seq to strip `./'s.
361 That would break examples like:
362 $(patsubst ./%.c,obj/%.o,$(wildcard ./?*.c)). */
364 sizeof (struct nameseq
), 1);
369 result
= xmalloc (100);
375 struct nameseq
*next
= chain
->next
;
376 unsigned int len
= strlen (chain
->name
);
378 if (idx
+ len
+ 1 > length
)
380 length
+= (len
+ 1) * 2;
381 result
= xrealloc (result
, length
);
383 memcpy (&result
[idx
], chain
->name
, len
);
391 /* Kill the last space and terminate the string. */
395 result
[idx
- 1] = '\0';
405 func_patsubst (char *o
, char **argv
, const char *funcname UNUSED
)
407 o
= patsubst_expand (o
, argv
[2], argv
[0], argv
[1]);
413 func_join (char *o
, char **argv
, const char *funcname UNUSED
)
417 /* Write each word of the first argument directly followed
418 by the corresponding word of the second argument.
419 If the two arguments have a different number of words,
420 the excess words are just output separated by blanks. */
423 const char *list1_iterator
= argv
[0];
424 const char *list2_iterator
= argv
[1];
427 unsigned int len1
, len2
;
429 tp
= find_next_token (&list1_iterator
, &len1
);
431 o
= variable_buffer_output (o
, tp
, len1
);
433 pp
= find_next_token (&list2_iterator
, &len2
);
435 o
= variable_buffer_output (o
, pp
, len2
);
437 if (tp
!= 0 || pp
!= 0)
439 o
= variable_buffer_output (o
, " ", 1);
443 while (tp
!= 0 || pp
!= 0);
445 /* Kill the last blank. */
453 func_origin (char *o
, char **argv
, const char *funcname UNUSED
)
455 /* Expand the argument. */
456 struct variable
*v
= lookup_variable (argv
[0], strlen (argv
[0]));
458 o
= variable_buffer_output (o
, "undefined", 9);
467 o
= variable_buffer_output (o
, "default", 7);
470 o
= variable_buffer_output (o
, "environment", 11);
473 o
= variable_buffer_output (o
, "file", 4);
476 o
= variable_buffer_output (o
, "environment override", 20);
479 o
= variable_buffer_output (o
, "command line", 12);
482 o
= variable_buffer_output (o
, "override", 8);
485 o
= variable_buffer_output (o
, "automatic", 9);
493 func_flavor (char *o
, char **argv
, const char *funcname UNUSED
)
495 struct variable
*v
= lookup_variable (argv
[0], strlen (argv
[0]));
498 o
= variable_buffer_output (o
, "undefined", 9);
501 o
= variable_buffer_output (o
, "recursive", 9);
503 o
= variable_buffer_output (o
, "simple", 6);
509 # define IS_PATHSEP(c) ((c) == ']')
511 # ifdef HAVE_DOS_PATHS
512 # define IS_PATHSEP(c) ((c) == '/' || (c) == '\\')
514 # define IS_PATHSEP(c) ((c) == '/')
520 func_notdir_suffix (char *o
, char **argv
, const char *funcname
)
522 /* Expand the argument. */
523 const char *list_iterator
= argv
[0];
528 int is_suffix
= streq (funcname
, "suffix");
529 int is_notdir
= !is_suffix
;
530 while ((p2
= find_next_token (&list_iterator
, &len
)) != 0)
532 const char *p
= p2
+ len
;
535 while (p
>= p2
&& (!is_suffix
|| *p
!= '.'))
548 o
= variable_buffer_output (o
, p
, len
- (p
- p2
));
550 #ifdef HAVE_DOS_PATHS
551 /* Handle the case of "d:foo/bar". */
552 else if (streq (funcname
, "notdir") && p2
[0] && p2
[1] == ':')
555 o
= variable_buffer_output (o
, p
, len
- (p
- p2
));
559 o
= variable_buffer_output (o
, p2
, len
);
561 if (is_notdir
|| p
>= p2
)
563 o
= variable_buffer_output (o
, " ", 1);
569 /* Kill last space. */
577 func_basename_dir (char *o
, char **argv
, const char *funcname
)
579 /* Expand the argument. */
580 const char *p3
= argv
[0];
585 int is_basename
= streq (funcname
, "basename");
586 int is_dir
= !is_basename
;
588 while ((p2
= find_next_token (&p3
, &len
)) != 0)
590 const char *p
= p2
+ len
;
591 while (p
>= p2
&& (!is_basename
|| *p
!= '.'))
598 if (p
>= p2
&& (is_dir
))
599 o
= variable_buffer_output (o
, p2
, ++p
- p2
);
600 else if (p
>= p2
&& (*p
== '.'))
601 o
= variable_buffer_output (o
, p2
, p
- p2
);
602 #ifdef HAVE_DOS_PATHS
603 /* Handle the "d:foobar" case */
604 else if (p2
[0] && p2
[1] == ':' && is_dir
)
605 o
= variable_buffer_output (o
, p2
, 2);
609 o
= variable_buffer_output (o
, "[]", 2);
612 o
= variable_buffer_output (o
, "./", 2);
614 ; /* Just a nop... */
618 /* The entire name is the basename. */
619 o
= variable_buffer_output (o
, p2
, len
);
621 o
= variable_buffer_output (o
, " ", 1);
626 /* Kill last space. */
633 func_addsuffix_addprefix (char *o
, char **argv
, const char *funcname
)
635 int fixlen
= strlen (argv
[0]);
636 const char *list_iterator
= argv
[1];
637 int is_addprefix
= streq (funcname
, "addprefix");
638 int is_addsuffix
= !is_addprefix
;
644 while ((p
= find_next_token (&list_iterator
, &len
)) != 0)
647 o
= variable_buffer_output (o
, argv
[0], fixlen
);
648 o
= variable_buffer_output (o
, p
, len
);
650 o
= variable_buffer_output (o
, argv
[0], fixlen
);
651 o
= variable_buffer_output (o
, " ", 1);
656 /* Kill last space. */
663 func_subst (char *o
, char **argv
, const char *funcname UNUSED
)
665 o
= subst_expand (o
, argv
[2], argv
[0], argv
[1], strlen (argv
[0]),
666 strlen (argv
[1]), 0);
673 func_firstword (char *o
, char **argv
, const char *funcname UNUSED
)
676 const char *words
= argv
[0]; /* Use a temp variable for find_next_token */
677 const char *p
= find_next_token (&words
, &i
);
680 o
= variable_buffer_output (o
, p
, i
);
686 func_lastword (char *o
, char **argv
, const char *funcname UNUSED
)
689 const char *words
= argv
[0]; /* Use a temp variable for find_next_token */
690 const char *p
= NULL
;
693 while ((t
= find_next_token (&words
, &i
)))
697 o
= variable_buffer_output (o
, p
, i
);
703 func_words (char *o
, char **argv
, const char *funcname UNUSED
)
706 const char *word_iterator
= argv
[0];
709 while (find_next_token (&word_iterator
, (unsigned int *) 0) != 0)
712 sprintf (buf
, "%d", i
);
713 o
= variable_buffer_output (o
, buf
, strlen (buf
));
718 /* Set begpp to point to the first non-whitespace character of the string,
719 * and endpp to point to the last non-whitespace character of the string.
720 * If the string is empty or contains nothing but whitespace, endpp will be
724 strip_whitespace (const char **begpp
, const char **endpp
)
726 while (*begpp
<= *endpp
&& isspace ((unsigned char)**begpp
))
728 while (*endpp
>= *begpp
&& isspace ((unsigned char)**endpp
))
730 return (char *)*begpp
;
734 check_numeric (const char *s
, const char *msg
)
736 const char *end
= s
+ strlen (s
) - 1;
738 strip_whitespace (&s
, &end
);
740 for (; s
<= end
; ++s
)
741 if (!ISDIGIT (*s
)) /* ISDIGIT only evals its arg once: see make.h. */
744 if (s
<= end
|| end
- beg
< 0)
745 fatal (*expanding_var
, "%s: '%s'", msg
, beg
);
751 func_word (char *o
, char **argv
, const char *funcname UNUSED
)
757 /* Check the first argument. */
758 check_numeric (argv
[0], _("non-numeric first argument to `word' function"));
762 fatal (*expanding_var
,
763 _("first argument to `word' function must be greater than 0"));
766 while ((p
= find_next_token (&end_p
, 0)) != 0)
771 o
= variable_buffer_output (o
, p
, end_p
- p
);
777 func_wordlist (char *o
, char **argv
, const char *funcname UNUSED
)
781 /* Check the arguments. */
782 check_numeric (argv
[0],
783 _("non-numeric first argument to `wordlist' function"));
784 check_numeric (argv
[1],
785 _("non-numeric second argument to `wordlist' function"));
787 start
= atoi (argv
[0]);
789 fatal (*expanding_var
,
790 "invalid first argument to `wordlist' function: `%d'", start
);
792 count
= atoi (argv
[1]) - start
+ 1;
797 const char *end_p
= argv
[2];
799 /* Find the beginning of the "start"th word. */
800 while (((p
= find_next_token (&end_p
, 0)) != 0) && --start
)
805 /* Find the end of the "count"th word from start. */
806 while (--count
&& (find_next_token (&end_p
, 0) != 0))
809 /* Return the stuff in the middle. */
810 o
= variable_buffer_output (o
, p
, end_p
- p
);
818 func_findstring (char *o
, char **argv
, const char *funcname UNUSED
)
820 /* Find the first occurrence of the first string in the second. */
821 if (strstr (argv
[1], argv
[0]) != 0)
822 o
= variable_buffer_output (o
, argv
[0], strlen (argv
[0]));
828 func_foreach (char *o
, char **argv
, const char *funcname UNUSED
)
830 /* expand only the first two. */
831 char *varname
= expand_argument (argv
[0], NULL
);
832 char *list
= expand_argument (argv
[1], NULL
);
833 const char *body
= argv
[2];
836 const char *list_iterator
= list
;
839 struct variable
*var
;
841 push_new_variable_scope ();
842 var
= define_variable (varname
, strlen (varname
), "", o_automatic
, 0);
844 /* loop through LIST, put the value in VAR and expand BODY */
845 while ((p
= find_next_token (&list_iterator
, &len
)) != 0)
850 var
->value
= xstrndup (p
, len
);
852 result
= allocated_variable_expand (body
);
854 o
= variable_buffer_output (o
, result
, strlen (result
));
855 o
= variable_buffer_output (o
, " ", 1);
861 /* Kill the last space. */
864 pop_variable_scope ();
874 struct a_word
*chain
;
881 a_word_hash_1 (const void *key
)
883 return_STRING_HASH_1 (((struct a_word
const *) key
)->str
);
887 a_word_hash_2 (const void *key
)
889 return_STRING_HASH_2 (((struct a_word
const *) key
)->str
);
893 a_word_hash_cmp (const void *x
, const void *y
)
895 int result
= ((struct a_word
const *) x
)->length
- ((struct a_word
const *) y
)->length
;
898 return_STRING_COMPARE (((struct a_word
const *) x
)->str
,
899 ((struct a_word
const *) y
)->str
);
904 struct a_pattern
*next
;
912 func_filter_filterout (char *o
, char **argv
, const char *funcname
)
914 struct a_word
*wordhead
;
915 struct a_word
**wordtail
;
917 struct a_pattern
*pathead
;
918 struct a_pattern
**pattail
;
919 struct a_pattern
*pp
;
921 struct hash_table a_word_table
;
922 int is_filter
= streq (funcname
, "filter");
923 const char *pat_iterator
= argv
[0];
924 const char *word_iterator
= argv
[1];
931 /* Chop ARGV[0] up into patterns to match against the words. */
934 while ((p
= find_next_token (&pat_iterator
, &len
)) != 0)
936 struct a_pattern
*pat
= alloca (sizeof (struct a_pattern
));
939 pattail
= &pat
->next
;
941 if (*pat_iterator
!= '\0')
946 pat
->save_c
= p
[len
];
948 pat
->percent
= find_percent (p
);
949 if (pat
->percent
== 0)
954 /* Chop ARGV[1] up into words to match against the patterns. */
956 wordtail
= &wordhead
;
957 while ((p
= find_next_token (&word_iterator
, &len
)) != 0)
959 struct a_word
*word
= alloca (sizeof (struct a_word
));
962 wordtail
= &word
->next
;
964 if (*word_iterator
!= '\0')
976 /* Only use a hash table if arg list lengths justifies the cost. */
977 hashing
= (literals
>= 2 && (literals
* words
) >= 10);
980 hash_init (&a_word_table
, words
, a_word_hash_1
, a_word_hash_2
,
982 for (wp
= wordhead
; wp
!= 0; wp
= wp
->next
)
984 struct a_word
*owp
= hash_insert (&a_word_table
, wp
);
994 /* Run each pattern through the words, killing words. */
995 for (pp
= pathead
; pp
!= 0; pp
= pp
->next
)
998 for (wp
= wordhead
; wp
!= 0; wp
= wp
->next
)
999 wp
->matched
|= pattern_matches (pp
->str
, pp
->percent
, wp
->str
);
1002 struct a_word a_word_key
;
1003 a_word_key
.str
= pp
->str
;
1004 a_word_key
.length
= pp
->length
;
1005 wp
= hash_find_item (&a_word_table
, &a_word_key
);
1013 for (wp
= wordhead
; wp
!= 0; wp
= wp
->next
)
1014 wp
->matched
|= (wp
->length
== pp
->length
1015 && strneq (pp
->str
, wp
->str
, wp
->length
));
1018 /* Output the words that matched (or didn't, for filter-out). */
1019 for (wp
= wordhead
; wp
!= 0; wp
= wp
->next
)
1020 if (is_filter
? wp
->matched
: !wp
->matched
)
1022 o
= variable_buffer_output (o
, wp
->str
, strlen (wp
->str
));
1023 o
= variable_buffer_output (o
, " ", 1);
1028 /* Kill the last space. */
1032 for (pp
= pathead
; pp
!= 0; pp
= pp
->next
)
1033 pp
->str
[pp
->length
] = pp
->save_c
;
1036 hash_free (&a_word_table
, 0);
1043 func_strip (char *o
, char **argv
, const char *funcname UNUSED
)
1045 const char *p
= argv
[0];
1051 const char *word_start
;
1053 while (isspace ((unsigned char)*p
))
1056 for (i
=0; *p
!= '\0' && !isspace ((unsigned char)*p
); ++p
, ++i
)
1060 o
= variable_buffer_output (o
, word_start
, i
);
1061 o
= variable_buffer_output (o
, " ", 1);
1066 /* Kill the last space. */
1073 Print a warning or fatal message.
1076 func_error (char *o
, char **argv
, const char *funcname
)
1082 /* The arguments will be broken on commas. Rather than create yet
1083 another special case where function arguments aren't broken up,
1084 just create a format string that puts them back together. */
1085 for (len
=0, argvp
=argv
; *argvp
!= 0; ++argvp
)
1086 len
+= strlen (*argvp
) + 2;
1088 p
= msg
= alloca (len
+ 1);
1090 for (argvp
=argv
; argvp
[1] != 0; ++argvp
)
1093 p
+= strlen (*argvp
);
1099 switch (*funcname
) {
1101 fatal (reading_file
, "%s", msg
);
1104 error (reading_file
, "%s", msg
);
1108 printf ("%s\n", msg
);
1113 fatal (*expanding_var
, "Internal error: func_error: '%s'", funcname
);
1116 /* The warning function expands to the empty string. */
1122 chop argv[0] into words, and sort them.
1125 func_sort (char *o
, char **argv
, const char *funcname UNUSED
)
1134 /* Find the maximum number of words we'll have. */
1141 if (! isspace ((unsigned char)c
))
1146 while (isspace ((unsigned char)*t
))
1150 words
= xmalloc (wordi
* sizeof (char *));
1152 /* Now assign pointers to each string in the array. */
1155 while ((p
= find_next_token (&t
, &len
)) != 0)
1164 /* Now sort the list of words. */
1165 qsort (words
, wordi
, sizeof (char *), alpha_compare
);
1167 /* Now write the sorted list, uniquified. */
1168 for (i
= 0; i
< wordi
; ++i
)
1170 len
= strlen (words
[i
]);
1171 if (i
== wordi
- 1 || strlen (words
[i
+ 1]) != len
1172 || strcmp (words
[i
], words
[i
+ 1]))
1174 o
= variable_buffer_output (o
, words
[i
], len
);
1175 o
= variable_buffer_output (o
, " ", 1);
1179 /* Kill the last space. */
1189 $(if condition,true-part[,false-part])
1191 CONDITION is false iff it evaluates to an empty string. White
1192 space before and after condition are stripped before evaluation.
1194 If CONDITION is true, then TRUE-PART is evaluated, otherwise FALSE-PART is
1195 evaluated (if it exists). Because only one of the two PARTs is evaluated,
1196 you can use $(if ...) to create side-effects (with $(shell ...), for
1201 func_if (char *o
, char **argv
, const char *funcname UNUSED
)
1203 const char *begp
= argv
[0];
1204 const char *endp
= begp
+ strlen (argv
[0]) - 1;
1207 /* Find the result of the condition: if we have a value, and it's not
1208 empty, the condition is true. If we don't have a value, or it's the
1209 empty string, then it's false. */
1211 strip_whitespace (&begp
, &endp
);
1215 char *expansion
= expand_argument (begp
, endp
+1);
1217 result
= strlen (expansion
);
1221 /* If the result is true (1) we want to eval the first argument, and if
1222 it's false (0) we want to eval the second. If the argument doesn't
1223 exist we do nothing, otherwise expand it and add to the buffer. */
1225 argv
+= 1 + !result
;
1229 char *expansion
= expand_argument (*argv
, NULL
);
1231 o
= variable_buffer_output (o
, expansion
, strlen (expansion
));
1240 $(or condition1[,condition2[,condition3[...]]])
1242 A CONDITION is false iff it evaluates to an empty string. White
1243 space before and after CONDITION are stripped before evaluation.
1245 CONDITION1 is evaluated. If it's true, then this is the result of
1246 expansion. If it's false, CONDITION2 is evaluated, and so on. If none of
1247 the conditions are true, the expansion is the empty string.
1249 Once a CONDITION is true no further conditions are evaluated
1254 func_or (char *o
, char **argv
, const char *funcname UNUSED
)
1256 for ( ; *argv
; ++argv
)
1258 const char *begp
= *argv
;
1259 const char *endp
= begp
+ strlen (*argv
) - 1;
1263 /* Find the result of the condition: if it's false keep going. */
1265 strip_whitespace (&begp
, &endp
);
1270 expansion
= expand_argument (begp
, endp
+1);
1271 result
= strlen (expansion
);
1273 /* If the result is false keep going. */
1280 /* It's true! Keep this result and return. */
1281 o
= variable_buffer_output (o
, expansion
, result
);
1290 $(and condition1[,condition2[,condition3[...]]])
1292 A CONDITION is false iff it evaluates to an empty string. White
1293 space before and after CONDITION are stripped before evaluation.
1295 CONDITION1 is evaluated. If it's false, then this is the result of
1296 expansion. If it's true, CONDITION2 is evaluated, and so on. If all of
1297 the conditions are true, the expansion is the result of the last condition.
1299 Once a CONDITION is false no further conditions are evaluated
1304 func_and (char *o
, char **argv
, const char *funcname UNUSED
)
1311 const char *begp
= *argv
;
1312 const char *endp
= begp
+ strlen (*argv
) - 1;
1314 /* An empty condition is always false. */
1315 strip_whitespace (&begp
, &endp
);
1319 expansion
= expand_argument (begp
, endp
+1);
1320 result
= strlen (expansion
);
1322 /* If the result is false, stop here: we're done. */
1326 /* Otherwise the result is true. If this is the last one, keep this
1327 result and quit. Otherwise go on to the next one! */
1333 o
= variable_buffer_output (o
, expansion
, result
);
1344 func_wildcard (char *o
, char **argv
, const char *funcname UNUSED
)
1347 o
= wildcard_expansion (argv
[0], o
);
1349 char *p
= string_glob (argv
[0]);
1350 o
= variable_buffer_output (o
, p
, strlen (p
));
1356 $(eval <makefile string>)
1358 Always resolves to the empty string.
1360 Treat the arguments as a segment of makefile, and parse them.
1364 func_eval (char *o
, char **argv
, const char *funcname UNUSED
)
1369 /* Eval the buffer. Pop the current variable buffer setting so that the
1370 eval'd code can use its own without conflicting. */
1372 install_variable_buffer (&buf
, &len
);
1374 eval_buffer (argv
[0]);
1376 restore_variable_buffer (buf
, len
);
1383 func_value (char *o
, char **argv
, const char *funcname UNUSED
)
1385 /* Look up the variable. */
1386 struct variable
*v
= lookup_variable (argv
[0], strlen (argv
[0]));
1388 /* Copy its value into the output buffer without expanding it. */
1390 o
= variable_buffer_output (o
, v
->value
, strlen(v
->value
));
1396 \r is replaced on UNIX as well. Is this desirable?
1399 fold_newlines (char *buffer
, unsigned int *length
)
1403 char *last_nonnl
= buffer
-1;
1405 for (; *src
!= '\0'; ++src
)
1407 if (src
[0] == '\r' && src
[1] == '\n')
1419 *(++last_nonnl
) = '\0';
1420 *length
= last_nonnl
- buffer
;
1425 int shell_function_pid
= 0, shell_function_completed
;
1431 #include <windows.h>
1433 #include "sub_proc.h"
1437 windows32_openpipe (int *pipedes
, int *pid_p
, char **command_argv
, char **envp
)
1439 SECURITY_ATTRIBUTES saAttr
;
1447 saAttr
.nLength
= sizeof (SECURITY_ATTRIBUTES
);
1448 saAttr
.bInheritHandle
= TRUE
;
1449 saAttr
.lpSecurityDescriptor
= NULL
;
1451 if (DuplicateHandle (GetCurrentProcess(),
1452 GetStdHandle(STD_INPUT_HANDLE
),
1453 GetCurrentProcess(),
1457 DUPLICATE_SAME_ACCESS
) == FALSE
) {
1458 fatal (NILF
, _("windows32_openpipe(): DuplicateHandle(In) failed (e=%ld)\n"),
1462 if (DuplicateHandle(GetCurrentProcess(),
1463 GetStdHandle(STD_ERROR_HANDLE
),
1464 GetCurrentProcess(),
1468 DUPLICATE_SAME_ACCESS
) == FALSE
) {
1469 fatal (NILF
, _("windows32_open_pipe(): DuplicateHandle(Err) failed (e=%ld)\n"),
1473 if (!CreatePipe(&hChildOutRd
, &hChildOutWr
, &saAttr
, 0))
1474 fatal (NILF
, _("CreatePipe() failed (e=%ld)\n"), GetLastError());
1476 hProcess
= process_init_fd(hIn
, hChildOutWr
, hErr
);
1479 fatal (NILF
, _("windows32_openpipe(): process_init_fd() failed\n"));
1481 /* make sure that CreateProcess() has Path it needs */
1482 sync_Path_environment();
1484 if (!process_begin(hProcess
, command_argv
, envp
, command_argv
[0], NULL
)) {
1485 /* register process for wait */
1486 process_register(hProcess
);
1488 /* set the pid for returning to caller */
1489 *pid_p
= (int) hProcess
;
1491 /* set up to read data from child */
1492 pipedes
[0] = _open_osfhandle((long) hChildOutRd
, O_RDONLY
);
1494 /* this will be closed almost right away */
1495 pipedes
[1] = _open_osfhandle((long) hChildOutWr
, O_APPEND
);
1497 /* reap/cleanup the failed process */
1498 process_cleanup(hProcess
);
1500 /* close handles which were duplicated, they weren't used */
1504 /* close pipe handles, they won't be used */
1505 CloseHandle(hChildOutRd
);
1506 CloseHandle(hChildOutWr
);
1508 /* set status for return */
1509 pipedes
[0] = pipedes
[1] = -1;
1518 msdos_openpipe (int* pipedes
, int *pidp
, char *text
)
1521 /* MSDOS can't fork, but it has `popen'. */
1522 struct variable
*sh
= lookup_variable ("SHELL", 5);
1524 extern int dos_command_running
, dos_status
;
1526 /* Make sure not to bother processing an empty line. */
1527 while (isblank ((unsigned char)*text
))
1534 char buf
[PATH_MAX
+ 7];
1535 /* This makes sure $SHELL value is used by $(shell), even
1536 though the target environment is not passed to it. */
1537 sprintf (buf
, "SHELL=%s", sh
->value
);
1543 dos_command_running
= 1;
1545 /* If dos_status becomes non-zero, it means the child process
1546 was interrupted by a signal, like SIGINT or SIGQUIT. See
1547 fatal_error_signal in commands.c. */
1548 fpipe
= popen (text
, "rt");
1549 dos_command_running
= 0;
1550 if (!fpipe
|| dos_status
)
1556 else if (errno
== 0)
1558 shell_function_completed
= -1;
1562 pipedes
[0] = fileno (fpipe
);
1563 *pidp
= 42; /* Yes, the Meaning of Life, the Universe, and Everything! */
1565 shell_function_completed
= 1;
1572 Do shell spawning, with the naughty bits for different OSes.
1577 /* VMS can't do $(shell ...) */
1578 #define func_shell 0
1583 func_shell (char *o
, char **argv
, const char *funcname UNUSED
)
1585 char *batch_filename
= NULL
;
1590 char **command_argv
;
1591 const char *error_prefix
;
1597 /* Construct the argument list. */
1598 command_argv
= construct_command_argv (argv
[0], NULL
, NULL
, 0,
1600 if (command_argv
== 0)
1604 /* Using a target environment for `shell' loses in cases like:
1605 export var = $(shell echo foobie)
1606 because target_environment hits a loop trying to expand $(var)
1607 to put it in the environment. This is even more confusing when
1608 var was not explicitly exported, but just appeared in the
1609 calling environment.
1611 See Savannah bug #10593.
1613 envp = target_environment (NILF);
1618 /* For error messages. */
1619 if (reading_file
&& reading_file
->filenm
)
1621 char *p
= alloca (strlen (reading_file
->filenm
)+11+4);
1622 sprintf (p
, "%s:%lu: ", reading_file
->filenm
, reading_file
->lineno
);
1628 #if defined(__MSDOS__)
1629 fpipe
= msdos_openpipe (pipedes
, &pid
, argv
[0]);
1632 perror_with_name (error_prefix
, "pipe");
1635 #elif defined(WINDOWS32)
1636 windows32_openpipe (pipedes
, &pid
, command_argv
, envp
);
1639 /* open of the pipe failed, mark as failed execution */
1640 shell_function_completed
= -1;
1646 if (pipe (pipedes
) < 0)
1648 perror_with_name (error_prefix
, "pipe");
1653 /* close some handles that are unnecessary for the child process */
1654 CLOSE_ON_EXEC(pipedes
[1]);
1655 CLOSE_ON_EXEC(pipedes
[0]);
1656 /* Never use fork()/exec() here! Use spawn() instead in exec_command() */
1657 pid
= child_execute_job (0, pipedes
[1], command_argv
, envp
);
1659 perror_with_name (error_prefix
, "spawn");
1660 # else /* ! __EMX__ */
1663 perror_with_name (error_prefix
, "fork");
1665 child_execute_job (0, pipedes
[1], command_argv
, envp
);
1670 /* We are the parent. */
1672 unsigned int maxlen
, i
;
1675 /* Record the PID for reap_children. */
1676 shell_function_pid
= pid
;
1678 shell_function_completed
= 0;
1680 /* Free the storage only the child needed. */
1681 free (command_argv
[0]);
1682 free (command_argv
);
1684 /* Close the write side of the pipe. We test for -1, since
1685 pipedes[1] is -1 on MS-Windows, and some versions of MS
1686 libraries barf when `close' is called with -1. */
1687 if (pipedes
[1] >= 0)
1691 /* Set up and read from the pipe. */
1694 buffer
= xmalloc (maxlen
+ 1);
1696 /* Read from the pipe until it gets EOF. */
1697 for (i
= 0; ; i
+= cc
)
1702 buffer
= xrealloc (buffer
, maxlen
+ 1);
1705 EINTRLOOP (cc
, read (pipedes
[0], &buffer
[i
], maxlen
- i
));
1711 /* Close the read side of the pipe. */
1714 (void) pclose (fpipe
);
1716 (void) close (pipedes
[0]);
1719 /* Loop until child_handler or reap_children() sets
1720 shell_function_completed to the status of our child shell. */
1721 while (shell_function_completed
== 0)
1722 reap_children (1, 0);
1724 if (batch_filename
) {
1725 DB (DB_VERBOSE
, (_("Cleaning up temporary batch file %s\n"),
1727 remove (batch_filename
);
1728 free (batch_filename
);
1730 shell_function_pid
= 0;
1732 /* The child_handler function will set shell_function_completed
1733 to 1 when the child dies normally, or to -1 if it
1734 dies with status 127, which is most likely an exec fail. */
1736 if (shell_function_completed
== -1)
1738 /* This likely means that the execvp failed, so we should just
1739 write the error message in the pipe from the child. */
1740 fputs (buffer
, stderr
);
1745 /* The child finished normally. Replace all newlines in its output
1746 with spaces, and put that in the variable output buffer. */
1747 fold_newlines (buffer
, &i
);
1748 o
= variable_buffer_output (o
, buffer
, i
);
1759 /* Do the Amiga version of func_shell. */
1762 func_shell (char *o
, char **argv
, const char *funcname
)
1764 /* Amiga can't fork nor spawn, but I can start a program with
1765 redirection of my choice. However, this means that we
1766 don't have an opportunity to reopen stdout to trap it. Thus,
1767 we save our own stdout onto a new descriptor and dup a temp
1768 file's descriptor onto our stdout temporarily. After we
1769 spawn the shell program, we dup our own stdout back to the
1770 stdout descriptor. The buffer reading is the same as above,
1771 except that we're now reading from a file. */
1773 #include <dos/dos.h>
1774 #include <proto/dos.h>
1777 char tmp_output
[FILENAME_MAX
];
1778 unsigned int maxlen
= 200, i
;
1780 char * buffer
, * ptr
;
1783 char* batch_filename
= NULL
;
1785 /* Construct the argument list. */
1786 command_argv
= construct_command_argv (argv
[0], NULL
, NULL
, 0,
1788 if (command_argv
== 0)
1791 /* Note the mktemp() is a security hole, but this only runs on Amiga.
1792 Ideally we would use main.c:open_tmpfile(), but this uses a special
1793 Open(), not fopen(), and I'm not familiar enough with the code to mess
1795 strcpy (tmp_output
, "t:MakeshXXXXXXXX");
1796 mktemp (tmp_output
);
1797 child_stdout
= Open (tmp_output
, MODE_NEWFILE
);
1799 for (aptr
=command_argv
; *aptr
; aptr
++)
1800 len
+= strlen (*aptr
) + 1;
1802 buffer
= xmalloc (len
+ 1);
1805 for (aptr
=command_argv
; *aptr
; aptr
++)
1807 strcpy (ptr
, *aptr
);
1808 ptr
+= strlen (ptr
) + 1;
1815 Execute (buffer
, NULL
, child_stdout
);
1818 Close (child_stdout
);
1820 child_stdout
= Open (tmp_output
, MODE_OLDFILE
);
1822 buffer
= xmalloc (maxlen
);
1829 buffer
= xrealloc (buffer
, maxlen
+ 1);
1832 cc
= Read (child_stdout
, &buffer
[i
], maxlen
- i
);
1837 Close (child_stdout
);
1839 fold_newlines (buffer
, &i
);
1840 o
= variable_buffer_output (o
, buffer
, i
);
1850 equality. Return is string-boolean, ie, the empty string is false.
1853 func_eq (char *o
, char **argv
, char *funcname
)
1855 int result
= ! strcmp (argv
[0], argv
[1]);
1856 o
= variable_buffer_output (o
, result
? "1" : "", result
);
1862 string-boolean not operator.
1865 func_not (char *o
, char **argv
, char *funcname
)
1867 const char *s
= argv
[0];
1869 while (isspace ((unsigned char)*s
))
1872 o
= variable_buffer_output (o
, result
? "1" : "", result
);
1878 #ifdef HAVE_DOS_PATHS
1879 #define IS_ABSOLUTE(n) (n[0] && n[1] == ':')
1882 #define IS_ABSOLUTE(n) (n[0] == '/')
1886 /* Return the absolute name of file NAME which does not contain any `.',
1887 `..' components nor any repeated path separators ('/'). */
1890 abspath (const char *name
, char *apath
)
1893 const char *start
, *end
, *apath_limit
;
1894 unsigned long root_len
= ROOT_LEN
;
1896 if (name
[0] == '\0' || apath
== NULL
)
1899 apath_limit
= apath
+ GET_PATH_MAX
;
1901 if (!IS_ABSOLUTE(name
))
1903 /* It is unlikely we would make it until here but just to make sure. */
1904 if (!starting_directory
)
1907 strcpy (apath
, starting_directory
);
1909 #ifdef HAVE_DOS_PATHS
1910 if (IS_PATHSEP(name
[0]))
1912 /* We have /foo, an absolute file name except for the drive
1913 letter. Assume the missing drive letter is the current
1914 drive, which we can get if we remove from starting_directory
1915 everything past the root directory. */
1916 apath
[root_len
] = '\0';
1920 dest
= strchr (apath
, '\0');
1924 strncpy (apath
, name
, root_len
);
1925 apath
[root_len
] = '\0';
1926 dest
= apath
+ root_len
;
1927 /* Get past the root, since we already copied it. */
1929 #ifdef HAVE_DOS_PATHS
1930 if (!IS_PATHSEP(apath
[2]))
1932 /* Convert d:foo into d:./foo and increase root_len. */
1937 /* strncpy above copied one character too many. */
1941 apath
[2] = '/'; /* make sure it's a forward slash */
1945 for (start
= end
= name
; *start
!= '\0'; start
= end
)
1949 /* Skip sequence of multiple path-separators. */
1950 while (IS_PATHSEP(*start
))
1953 /* Find end of path component. */
1954 for (end
= start
; *end
!= '\0' && !IS_PATHSEP(*end
); ++end
)
1961 else if (len
== 1 && start
[0] == '.')
1963 else if (len
== 2 && start
[0] == '.' && start
[1] == '.')
1965 /* Back up to previous component, ignore if at root already. */
1966 if (dest
> apath
+ root_len
)
1967 for (--dest
; !IS_PATHSEP(dest
[-1]); --dest
);
1971 if (!IS_PATHSEP(dest
[-1]))
1974 if (dest
+ len
>= apath_limit
)
1977 dest
= memcpy (dest
, start
, len
);
1983 /* Unless it is root strip trailing separator. */
1984 if (dest
> apath
+ root_len
&& IS_PATHSEP(dest
[-1]))
1994 func_realpath (char *o
, char **argv
, const char *funcname UNUSED
)
1996 /* Expand the argument. */
1997 const char *p
= argv
[0];
1998 const char *path
= 0;
2000 unsigned int len
= 0;
2001 #ifndef HAVE_REALPATH
2007 while ((path
= find_next_token (&p
, &len
)) != 0)
2009 if (len
< GET_PATH_MAX
)
2011 strncpy (in
, path
, len
);
2015 #ifdef HAVE_REALPATH
2018 abspath (in
, out
) && stat (out
, &st
) == 0
2022 o
= variable_buffer_output (o
, out
, strlen (out
));
2023 o
= variable_buffer_output (o
, " ", 1);
2029 /* Kill last space. */
2037 func_abspath (char *o
, char **argv
, const char *funcname UNUSED
)
2039 /* Expand the argument. */
2040 const char *p
= argv
[0];
2041 const char *path
= 0;
2043 unsigned int len
= 0;
2047 while ((path
= find_next_token (&p
, &len
)) != 0)
2049 if (len
< GET_PATH_MAX
)
2051 strncpy (in
, path
, len
);
2054 if (abspath (in
, out
))
2056 o
= variable_buffer_output (o
, out
, strlen (out
));
2057 o
= variable_buffer_output (o
, " ", 1);
2063 /* Kill last space. */
2070 /* Lookup table for builtin functions.
2072 This doesn't have to be sorted; we use a straight lookup. We might gain
2073 some efficiency by moving most often used functions to the start of the
2076 If MAXIMUM_ARGS is 0, that means there is no maximum and all
2077 comma-separated values are treated as arguments.
2079 EXPAND_ARGS means that all arguments should be expanded before invocation.
2080 Functions that do namespace tricks (foreach) don't automatically expand. */
2082 static char *func_call (char *o
, char **argv
, const char *funcname
);
2085 static struct function_table_entry function_table_init
[] =
2087 /* Name/size */ /* MIN MAX EXP? Function */
2088 { STRING_SIZE_TUPLE("abspath"), 0, 1, 1, func_abspath
},
2089 { STRING_SIZE_TUPLE("addprefix"), 2, 2, 1, func_addsuffix_addprefix
},
2090 { STRING_SIZE_TUPLE("addsuffix"), 2, 2, 1, func_addsuffix_addprefix
},
2091 { STRING_SIZE_TUPLE("basename"), 0, 1, 1, func_basename_dir
},
2092 { STRING_SIZE_TUPLE("dir"), 0, 1, 1, func_basename_dir
},
2093 { STRING_SIZE_TUPLE("notdir"), 0, 1, 1, func_notdir_suffix
},
2094 { STRING_SIZE_TUPLE("subst"), 3, 3, 1, func_subst
},
2095 { STRING_SIZE_TUPLE("suffix"), 0, 1, 1, func_notdir_suffix
},
2096 { STRING_SIZE_TUPLE("filter"), 2, 2, 1, func_filter_filterout
},
2097 { STRING_SIZE_TUPLE("filter-out"), 2, 2, 1, func_filter_filterout
},
2098 { STRING_SIZE_TUPLE("findstring"), 2, 2, 1, func_findstring
},
2099 { STRING_SIZE_TUPLE("firstword"), 0, 1, 1, func_firstword
},
2100 { STRING_SIZE_TUPLE("flavor"), 0, 1, 1, func_flavor
},
2101 { STRING_SIZE_TUPLE("join"), 2, 2, 1, func_join
},
2102 { STRING_SIZE_TUPLE("lastword"), 0, 1, 1, func_lastword
},
2103 { STRING_SIZE_TUPLE("patsubst"), 3, 3, 1, func_patsubst
},
2104 { STRING_SIZE_TUPLE("realpath"), 0, 1, 1, func_realpath
},
2105 { STRING_SIZE_TUPLE("shell"), 0, 1, 1, func_shell
},
2106 { STRING_SIZE_TUPLE("sort"), 0, 1, 1, func_sort
},
2107 { STRING_SIZE_TUPLE("strip"), 0, 1, 1, func_strip
},
2108 { STRING_SIZE_TUPLE("wildcard"), 0, 1, 1, func_wildcard
},
2109 { STRING_SIZE_TUPLE("word"), 2, 2, 1, func_word
},
2110 { STRING_SIZE_TUPLE("wordlist"), 3, 3, 1, func_wordlist
},
2111 { STRING_SIZE_TUPLE("words"), 0, 1, 1, func_words
},
2112 { STRING_SIZE_TUPLE("origin"), 0, 1, 1, func_origin
},
2113 { STRING_SIZE_TUPLE("foreach"), 3, 3, 0, func_foreach
},
2114 { STRING_SIZE_TUPLE("call"), 1, 0, 1, func_call
},
2115 { STRING_SIZE_TUPLE("info"), 0, 1, 1, func_error
},
2116 { STRING_SIZE_TUPLE("error"), 0, 1, 1, func_error
},
2117 { STRING_SIZE_TUPLE("warning"), 0, 1, 1, func_error
},
2118 { STRING_SIZE_TUPLE("if"), 2, 3, 0, func_if
},
2119 { STRING_SIZE_TUPLE("or"), 1, 0, 0, func_or
},
2120 { STRING_SIZE_TUPLE("and"), 1, 0, 0, func_and
},
2121 { STRING_SIZE_TUPLE("value"), 0, 1, 1, func_value
},
2122 { STRING_SIZE_TUPLE("eval"), 0, 1, 1, func_eval
},
2124 { STRING_SIZE_TUPLE("eq"), 2, 2, 1, func_eq
},
2125 { STRING_SIZE_TUPLE("not"), 0, 1, 1, func_not
},
2129 #define FUNCTION_TABLE_ENTRIES (sizeof (function_table_init) / sizeof (struct function_table_entry))
2132 /* These must come after the definition of function_table. */
2135 expand_builtin_function (char *o
, int argc
, char **argv
,
2136 const struct function_table_entry
*entry_p
)
2138 if (argc
< (int)entry_p
->minimum_args
)
2139 fatal (*expanding_var
,
2140 _("insufficient number of arguments (%d) to function `%s'"),
2141 argc
, entry_p
->name
);
2143 /* I suppose technically some function could do something with no
2144 arguments, but so far none do, so just test it for all functions here
2145 rather than in each one. We can change it later if necessary. */
2150 if (!entry_p
->func_ptr
)
2151 fatal (*expanding_var
,
2152 _("unimplemented on this platform: function `%s'"), entry_p
->name
);
2154 return entry_p
->func_ptr (o
, argv
, entry_p
->name
);
2157 /* Check for a function invocation in *STRINGP. *STRINGP points at the
2158 opening ( or { and is not null-terminated. If a function invocation
2159 is found, expand it into the buffer at *OP, updating *OP, incrementing
2160 *STRINGP past the reference and returning nonzero. If not, return zero. */
2163 handle_function (char **op
, const char **stringp
)
2165 const struct function_table_entry
*entry_p
;
2166 char openparen
= (*stringp
)[0];
2167 char closeparen
= openparen
== '(' ? ')' : '}';
2172 char **argv
, **argvp
;
2177 entry_p
= lookup_function (beg
);
2182 /* We found a builtin function. Find the beginning of its arguments (skip
2183 whitespace after the name). */
2185 beg
= next_token (beg
+ entry_p
->len
);
2187 /* Find the end of the function invocation, counting nested use of
2188 whichever kind of parens we use. Since we're looking, count commas
2189 to get a rough estimate of how many arguments we might have. The
2190 count might be high, but it'll never be low. */
2192 for (nargs
=1, end
=beg
; *end
!= '\0'; ++end
)
2195 else if (*end
== openparen
)
2197 else if (*end
== closeparen
&& --count
< 0)
2201 fatal (*expanding_var
,
2202 _("unterminated call to function `%s': missing `%c'"),
2203 entry_p
->name
, closeparen
);
2207 /* Get some memory to store the arg pointers. */
2208 argvp
= argv
= alloca (sizeof (char *) * (nargs
+ 2));
2210 /* Chop the string into arguments, then a nul. As soon as we hit
2211 MAXIMUM_ARGS (if it's >0) assume the rest of the string is part of the
2214 If we're expanding, store pointers to the expansion of each one. If
2215 not, make a duplicate of the string and point into that, nul-terminating
2218 if (entry_p
->expand_args
)
2221 for (p
=beg
, nargs
=0; p
<= end
; ++argvp
)
2227 if (nargs
== entry_p
->maximum_args
2228 || (! (next
= find_next_argument (openparen
, closeparen
, p
, end
))))
2231 *argvp
= expand_argument (p
, next
);
2237 int len
= end
- beg
;
2240 abeg
= xmalloc (len
+1);
2241 memcpy (abeg
, beg
, len
);
2245 for (p
=abeg
, nargs
=0; p
<= aend
; ++argvp
)
2251 if (nargs
== entry_p
->maximum_args
2252 || (! (next
= find_next_argument (openparen
, closeparen
, p
, aend
))))
2262 /* Finally! Run the function... */
2263 *op
= expand_builtin_function (*op
, nargs
, argv
, entry_p
);
2266 if (entry_p
->expand_args
)
2267 for (argvp
=argv
; *argvp
!= 0; ++argvp
)
2276 /* User-defined functions. Expand the first argument as either a builtin
2277 function or a make variable, in the context of the rest of the arguments
2278 assigned to $1, $2, ... $N. $0 is the name of the function. */
2281 func_call (char *o
, char **argv
, const char *funcname UNUSED
)
2283 static int max_args
= 0;
2290 const struct function_table_entry
*entry_p
;
2293 /* There is no way to define a variable with a space in the name, so strip
2294 leading and trailing whitespace as a favor to the user. */
2296 while (*fname
!= '\0' && isspace ((unsigned char)*fname
))
2299 cp
= fname
+ strlen (fname
) - 1;
2300 while (cp
> fname
&& isspace ((unsigned char)*cp
))
2304 /* Calling nothing is a no-op */
2308 /* Are we invoking a builtin function? */
2310 entry_p
= lookup_function (fname
);
2313 /* How many arguments do we have? */
2314 for (i
=0; argv
[i
+1]; ++i
)
2316 return expand_builtin_function (o
, i
, argv
+1, entry_p
);
2319 /* Not a builtin, so the first argument is the name of a variable to be
2320 expanded and interpreted as a function. Find it. */
2321 flen
= strlen (fname
);
2323 v
= lookup_variable (fname
, flen
);
2326 warn_undefined (fname
, flen
);
2328 if (v
== 0 || *v
->value
== '\0')
2331 body
= alloca (flen
+ 4);
2334 memcpy (body
+ 2, fname
, flen
);
2336 body
[flen
+3] = '\0';
2338 /* Set up arguments $(1) .. $(N). $(0) is the function name. */
2340 push_new_variable_scope ();
2342 for (i
=0; *argv
; ++i
, ++argv
)
2346 sprintf (num
, "%d", i
);
2347 define_variable (num
, strlen (num
), *argv
, o_automatic
, 0);
2350 /* If the number of arguments we have is < max_args, it means we're inside
2351 a recursive invocation of $(call ...). Fill in the remaining arguments
2352 in the new scope with the empty value, to hide them from this
2355 for (; i
< max_args
; ++i
)
2359 sprintf (num
, "%d", i
);
2360 define_variable (num
, strlen (num
), "", o_automatic
, 0);
2363 /* Expand the body in the context of the arguments, adding the result to
2364 the variable buffer. */
2366 v
->exp_count
= EXP_COUNT_MAX
;
2368 saved_args
= max_args
;
2370 o
= variable_expand_string (o
, body
, flen
+3);
2371 max_args
= saved_args
;
2375 pop_variable_scope ();
2377 return o
+ strlen (o
);
2381 hash_init_function_table (void)
2383 hash_init (&function_table
, FUNCTION_TABLE_ENTRIES
* 2,
2384 function_table_entry_hash_1
, function_table_entry_hash_2
,
2385 function_table_entry_hash_cmp
);
2386 hash_load (&function_table
, function_table_init
,
2387 FUNCTION_TABLE_ENTRIES
, sizeof (struct function_table_entry
));