Fixups for warnings on Windows (esp 64bit).
[make.git] / function.c
blobd2482b53b5da9dc77ba3acd88e1568dc6a401387
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, 2008, 2009 Free
4 Software Foundation, Inc.
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
10 version.
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/>. */
19 #include "make.h"
20 #include "filedef.h"
21 #include "variable.h"
22 #include "dep.h"
23 #include "job.h"
24 #include "commands.h"
25 #include "debug.h"
27 #ifdef _AMIGA
28 #include "amiga.h"
29 #endif
32 struct function_table_entry
34 const char *name;
35 unsigned char len;
36 unsigned char minimum_args;
37 unsigned char maximum_args;
38 char expand_args;
39 char *(*func_ptr) (char *output, char **argv, const char *fname);
42 static unsigned long
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);
49 static unsigned long
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);
56 static int
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;
62 if (result)
63 return result;
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. */
76 char *
77 subst_expand (char *o, const char *text, const char *subst, const char *replace,
78 unsigned int slen, unsigned int rlen, int by_word)
80 const char *t = text;
81 const char *p;
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));
87 if (rlen > 0)
88 o = variable_buffer_output (o, replace, rlen);
89 return o;
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));
98 else
100 p = strstr (t, subst);
101 if (p == 0)
103 /* No more matches. Output everything left on the end. */
104 o = variable_buffer_output (o, t, strlen (t));
105 return o;
109 /* Output everything before this occurrence of the string to replace. */
110 if (p > t)
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. */
115 if (by_word
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);
121 else if (rlen > 0)
122 /* Output the replacement string. */
123 o = variable_buffer_output (o, replace, rlen);
125 /* Advance T past the string to be replaced. */
126 t = p + slen;
127 } while (*t != '\0');
129 return o;
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.
143 char *
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;
150 const char *t;
151 unsigned int len;
152 int doneany = 0;
154 /* Record the length of REPLACE before and after the % so we don't have to
155 compute these lengths more than once. */
156 if (replace_percent)
158 replace_prepercent_len = replace_percent - replace - 1;
159 replace_postpercent_len = strlen (replace_percent);
161 else
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)
179 int fail = 0;
181 /* Is it big enough to match? */
182 if (len < pattern_prepercent_len + pattern_postpercent_len)
183 fail = 1;
185 /* Does the prefix match? */
186 if (!fail && pattern_prepercent_len > 0
187 && (*t != *pattern
188 || t[pattern_prepercent_len - 1] != pattern_percent[-2]
189 || !strneq (t + 1, pattern + 1, pattern_prepercent_len - 1)))
190 fail = 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)))
198 fail = 1;
200 if (fail)
201 /* It didn't match. Output the string. */
202 o = variable_buffer_output (o, t, len);
203 else
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);
228 doneany = 1;
231 if (doneany)
232 /* Kill the last space. */
233 --o;
235 return o;
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.
248 char *
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. */
255 if (replace_percent)
256 ++replace_percent;
257 if (pattern_percent)
258 ++pattern_percent;
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)
270 const char *e = s;
272 while (*e && ( (*e >= 'a' && *e <= 'z') || *e == '-'))
273 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);
282 return 0;
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;
293 if (percent == 0)
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);
299 if (percent == 0)
300 return streq (new_chars, str);
301 pattern = new_chars;
304 sfxlen = strlen (percent + 1);
305 strlength = strlen (str);
307 if (strlength < (percent - pattern) + sfxlen
308 || !strneq (pattern, str, percent - pattern))
309 return 0;
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
317 next character.
319 If no next argument is found, return NULL.
322 static char *
323 find_next_argument (char startparen, char endparen,
324 const char *ptr, const char *end)
326 int count = 0;
328 for (; ptr < end; ++ptr)
329 if (*ptr == startparen)
330 ++count;
332 else if (*ptr == endparen)
334 --count;
335 if (count < 0)
336 return NULL;
339 else if (*ptr == ',' && !count)
340 return (char *)ptr;
342 /* We didn't find anything. */
343 return NULL;
347 /* Glob-expand LINE. The returned pointer is
348 only good until the next call to string_glob. */
350 static char *
351 string_glob (char *line)
353 static char *result = 0;
354 static unsigned int length;
355 struct nameseq *chain;
356 unsigned int idx;
358 chain = PARSE_FILE_SEQ (&line, struct nameseq, '\0', NULL,
359 /* We do not want parse_file_seq to strip `./'s.
360 That would break examples like:
361 $(patsubst ./%.c,obj/%.o,$(wildcard ./?*.c)). */
362 PARSEFS_NOSTRIP|PARSEFS_NOCACHE|PARSEFS_EXISTS);
364 if (result == 0)
366 length = 100;
367 result = xmalloc (100);
370 idx = 0;
371 while (chain != 0)
373 struct nameseq *next = chain->next;
374 unsigned int len = strlen (chain->name);
376 if (idx + len + 1 > length)
378 length += (len + 1) * 2;
379 result = xrealloc (result, length);
381 memcpy (&result[idx], chain->name, len);
382 idx += len;
383 result[idx++] = ' ';
385 /* Because we used PARSEFS_NOCACHE above, we have to free() NAME. */
386 free ((char *)chain->name);
387 free (chain);
388 chain = next;
391 /* Kill the last space and terminate the string. */
392 if (idx == 0)
393 result[0] = '\0';
394 else
395 result[idx - 1] = '\0';
397 return result;
401 Builtin functions
404 static char *
405 func_patsubst (char *o, char **argv, const char *funcname UNUSED)
407 o = patsubst_expand (o, argv[2], argv[0], argv[1]);
408 return o;
412 static char *
413 func_join (char *o, char **argv, const char *funcname UNUSED)
415 int doneany = 0;
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. */
421 const char *tp;
422 const char *pp;
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);
430 if (tp != 0)
431 o = variable_buffer_output (o, tp, len1);
433 pp = find_next_token (&list2_iterator, &len2);
434 if (pp != 0)
435 o = variable_buffer_output (o, pp, len2);
437 if (tp != 0 || pp != 0)
439 o = variable_buffer_output (o, " ", 1);
440 doneany = 1;
443 while (tp != 0 || pp != 0);
444 if (doneany)
445 /* Kill the last blank. */
446 --o;
448 return o;
452 static char *
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]));
457 if (v == 0)
458 o = variable_buffer_output (o, "undefined", 9);
459 else
460 switch (v->origin)
462 default:
463 case o_invalid:
464 abort ();
465 break;
466 case o_default:
467 o = variable_buffer_output (o, "default", 7);
468 break;
469 case o_env:
470 o = variable_buffer_output (o, "environment", 11);
471 break;
472 case o_file:
473 o = variable_buffer_output (o, "file", 4);
474 break;
475 case o_env_override:
476 o = variable_buffer_output (o, "environment override", 20);
477 break;
478 case o_command:
479 o = variable_buffer_output (o, "command line", 12);
480 break;
481 case o_override:
482 o = variable_buffer_output (o, "override", 8);
483 break;
484 case o_automatic:
485 o = variable_buffer_output (o, "automatic", 9);
486 break;
489 return o;
492 static char *
493 func_flavor (char *o, char **argv, const char *funcname UNUSED)
495 struct variable *v = lookup_variable (argv[0], strlen (argv[0]));
497 if (v == 0)
498 o = variable_buffer_output (o, "undefined", 9);
499 else
500 if (v->recursive)
501 o = variable_buffer_output (o, "recursive", 9);
502 else
503 o = variable_buffer_output (o, "simple", 6);
505 return o;
508 #ifdef VMS
509 # define IS_PATHSEP(c) ((c) == ']')
510 #else
511 # ifdef HAVE_DOS_PATHS
512 # define IS_PATHSEP(c) ((c) == '/' || (c) == '\\')
513 # else
514 # define IS_PATHSEP(c) ((c) == '/')
515 # endif
516 #endif
519 static char *
520 func_notdir_suffix (char *o, char **argv, const char *funcname)
522 /* Expand the argument. */
523 const char *list_iterator = argv[0];
524 const char *p2;
525 int doneany =0;
526 unsigned int len=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 != '.'))
537 if (IS_PATHSEP (*p))
538 break;
539 --p;
542 if (p >= p2)
544 if (is_notdir)
545 ++p;
546 else if (*p != '.')
547 continue;
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] == ':')
554 p = p2 + 2;
555 o = variable_buffer_output (o, p, len - (p - p2));
557 #endif
558 else if (is_notdir)
559 o = variable_buffer_output (o, p2, len);
561 if (is_notdir || p >= p2)
563 o = variable_buffer_output (o, " ", 1);
564 doneany = 1;
568 if (doneany)
569 /* Kill last space. */
570 --o;
572 return o;
576 static char *
577 func_basename_dir (char *o, char **argv, const char *funcname)
579 /* Expand the argument. */
580 const char *p3 = argv[0];
581 const char *p2;
582 int doneany=0;
583 unsigned int len=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 != '.'))
593 if (IS_PATHSEP (*p))
594 break;
595 --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);
606 #endif
607 else if (is_dir)
608 #ifdef VMS
609 o = variable_buffer_output (o, "[]", 2);
610 #else
611 #ifndef _AMIGA
612 o = variable_buffer_output (o, "./", 2);
613 #else
614 ; /* Just a nop... */
615 #endif /* AMIGA */
616 #endif /* !VMS */
617 else
618 /* The entire name is the basename. */
619 o = variable_buffer_output (o, p2, len);
621 o = variable_buffer_output (o, " ", 1);
622 doneany = 1;
625 if (doneany)
626 /* Kill last space. */
627 --o;
629 return o;
632 static char *
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;
640 int doneany = 0;
641 const char *p;
642 unsigned int len;
644 while ((p = find_next_token (&list_iterator, &len)) != 0)
646 if (is_addprefix)
647 o = variable_buffer_output (o, argv[0], fixlen);
648 o = variable_buffer_output (o, p, len);
649 if (is_addsuffix)
650 o = variable_buffer_output (o, argv[0], fixlen);
651 o = variable_buffer_output (o, " ", 1);
652 doneany = 1;
655 if (doneany)
656 /* Kill last space. */
657 --o;
659 return o;
662 static char *
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);
668 return o;
672 static char *
673 func_firstword (char *o, char **argv, const char *funcname UNUSED)
675 unsigned int i;
676 const char *words = argv[0]; /* Use a temp variable for find_next_token */
677 const char *p = find_next_token (&words, &i);
679 if (p != 0)
680 o = variable_buffer_output (o, p, i);
682 return o;
685 static char *
686 func_lastword (char *o, char **argv, const char *funcname UNUSED)
688 unsigned int i;
689 const char *words = argv[0]; /* Use a temp variable for find_next_token */
690 const char *p = NULL;
691 const char *t;
693 while ((t = find_next_token (&words, &i)))
694 p = t;
696 if (p != 0)
697 o = variable_buffer_output (o, p, i);
699 return o;
702 static char *
703 func_words (char *o, char **argv, const char *funcname UNUSED)
705 int i = 0;
706 const char *word_iterator = argv[0];
707 char buf[20];
709 while (find_next_token (&word_iterator, (unsigned int *) 0) != 0)
710 ++i;
712 sprintf (buf, "%d", i);
713 o = variable_buffer_output (o, buf, strlen (buf));
715 return o;
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
721 * begpp-1.
723 char *
724 strip_whitespace (const char **begpp, const char **endpp)
726 while (*begpp <= *endpp && isspace ((unsigned char)**begpp))
727 (*begpp) ++;
728 while (*endpp >= *begpp && isspace ((unsigned char)**endpp))
729 (*endpp) --;
730 return (char *)*begpp;
733 static void
734 check_numeric (const char *s, const char *msg)
736 const char *end = s + strlen (s) - 1;
737 const char *beg = s;
738 strip_whitespace (&s, &end);
740 for (; s <= end; ++s)
741 if (!ISDIGIT (*s)) /* ISDIGIT only evals its arg once: see make.h. */
742 break;
744 if (s <= end || end - beg < 0)
745 fatal (*expanding_var, "%s: '%s'", msg, beg);
750 static char *
751 func_word (char *o, char **argv, const char *funcname UNUSED)
753 const char *end_p;
754 const char *p;
755 int i;
757 /* Check the first argument. */
758 check_numeric (argv[0], _("non-numeric first argument to `word' function"));
759 i = atoi (argv[0]);
761 if (i == 0)
762 fatal (*expanding_var,
763 _("first argument to `word' function must be greater than 0"));
765 end_p = argv[1];
766 while ((p = find_next_token (&end_p, 0)) != 0)
767 if (--i == 0)
768 break;
770 if (i == 0)
771 o = variable_buffer_output (o, p, end_p - p);
773 return o;
776 static char *
777 func_wordlist (char *o, char **argv, const char *funcname UNUSED)
779 int start, count;
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]);
788 if (start < 1)
789 fatal (*expanding_var,
790 "invalid first argument to `wordlist' function: `%d'", start);
792 count = atoi (argv[1]) - start + 1;
794 if (count > 0)
796 const char *p;
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)
803 if (p)
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);
814 return o;
817 static char *
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]));
824 return o;
827 static char *
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];
835 int doneany = 0;
836 const char *list_iterator = list;
837 const char *p;
838 unsigned int len;
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)
847 char *result = 0;
849 free (var->value);
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);
856 doneany = 1;
857 free (result);
860 if (doneany)
861 /* Kill the last space. */
862 --o;
864 pop_variable_scope ();
865 free (varname);
866 free (list);
868 return o;
871 struct a_word
873 struct a_word *next;
874 struct a_word *chain;
875 char *str;
876 int length;
877 int matched;
880 static unsigned long
881 a_word_hash_1 (const void *key)
883 return_STRING_HASH_1 (((struct a_word const *) key)->str);
886 static unsigned long
887 a_word_hash_2 (const void *key)
889 return_STRING_HASH_2 (((struct a_word const *) key)->str);
892 static int
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;
896 if (result)
897 return result;
898 return_STRING_COMPARE (((struct a_word const *) x)->str,
899 ((struct a_word const *) y)->str);
902 struct a_pattern
904 struct a_pattern *next;
905 char *str;
906 char *percent;
907 int length;
908 int save_c;
911 static char *
912 func_filter_filterout (char *o, char **argv, const char *funcname)
914 struct a_word *wordhead;
915 struct a_word **wordtail;
916 struct a_word *wp;
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];
925 int literals = 0;
926 int words = 0;
927 int hashing = 0;
928 char *p;
929 unsigned int len;
931 /* Chop ARGV[0] up into patterns to match against the words. */
933 pattail = &pathead;
934 while ((p = find_next_token (&pat_iterator, &len)) != 0)
936 struct a_pattern *pat = alloca (sizeof (struct a_pattern));
938 *pattail = pat;
939 pattail = &pat->next;
941 if (*pat_iterator != '\0')
942 ++pat_iterator;
944 pat->str = p;
945 pat->length = len;
946 pat->save_c = p[len];
947 p[len] = '\0';
948 pat->percent = find_percent (p);
949 if (pat->percent == 0)
950 literals++;
952 *pattail = 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));
961 *wordtail = word;
962 wordtail = &word->next;
964 if (*word_iterator != '\0')
965 ++word_iterator;
967 p[len] = '\0';
968 word->str = p;
969 word->length = len;
970 word->matched = 0;
971 word->chain = 0;
972 words++;
974 *wordtail = 0;
976 /* Only use a hash table if arg list lengths justifies the cost. */
977 hashing = (literals >= 2 && (literals * words) >= 10);
978 if (hashing)
980 hash_init (&a_word_table, words, a_word_hash_1, a_word_hash_2,
981 a_word_hash_cmp);
982 for (wp = wordhead; wp != 0; wp = wp->next)
984 struct a_word *owp = hash_insert (&a_word_table, wp);
985 if (owp)
986 wp->chain = owp;
990 if (words)
992 int doneany = 0;
994 /* Run each pattern through the words, killing words. */
995 for (pp = pathead; pp != 0; pp = pp->next)
997 if (pp->percent)
998 for (wp = wordhead; wp != 0; wp = wp->next)
999 wp->matched |= pattern_matches (pp->str, pp->percent, wp->str);
1000 else if (hashing)
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);
1006 while (wp)
1008 wp->matched |= 1;
1009 wp = wp->chain;
1012 else
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);
1024 doneany = 1;
1027 if (doneany)
1028 /* Kill the last space. */
1029 --o;
1032 for (pp = pathead; pp != 0; pp = pp->next)
1033 pp->str[pp->length] = pp->save_c;
1035 if (hashing)
1036 hash_free (&a_word_table, 0);
1038 return o;
1042 static char *
1043 func_strip (char *o, char **argv, const char *funcname UNUSED)
1045 const char *p = argv[0];
1046 int doneany = 0;
1048 while (*p != '\0')
1050 int i=0;
1051 const char *word_start;
1053 while (isspace ((unsigned char)*p))
1054 ++p;
1055 word_start = p;
1056 for (i=0; *p != '\0' && !isspace ((unsigned char)*p); ++p, ++i)
1058 if (!i)
1059 break;
1060 o = variable_buffer_output (o, word_start, i);
1061 o = variable_buffer_output (o, " ", 1);
1062 doneany = 1;
1065 if (doneany)
1066 /* Kill the last space. */
1067 --o;
1069 return o;
1073 Print a warning or fatal message.
1075 static char *
1076 func_error (char *o, char **argv, const char *funcname)
1078 char **argvp;
1079 char *msg, *p;
1080 int len;
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)
1092 strcpy (p, *argvp);
1093 p += strlen (*argvp);
1094 *(p++) = ',';
1095 *(p++) = ' ';
1097 strcpy (p, *argvp);
1099 switch (*funcname) {
1100 case 'e':
1101 fatal (reading_file, "%s", msg);
1103 case 'w':
1104 error (reading_file, "%s", msg);
1105 break;
1107 case 'i':
1108 printf ("%s\n", msg);
1109 fflush(stdout);
1110 break;
1112 default:
1113 fatal (*expanding_var, "Internal error: func_error: '%s'", funcname);
1116 /* The warning function expands to the empty string. */
1117 return o;
1122 chop argv[0] into words, and sort them.
1124 static char *
1125 func_sort (char *o, char **argv, const char *funcname UNUSED)
1127 const char *t;
1128 char **words;
1129 int wordi;
1130 char *p;
1131 unsigned int len;
1132 int i;
1134 /* Find the maximum number of words we'll have. */
1135 t = argv[0];
1136 wordi = 1;
1137 while (*t != '\0')
1139 char c = *(t++);
1141 if (! isspace ((unsigned char)c))
1142 continue;
1144 ++wordi;
1146 while (isspace ((unsigned char)*t))
1147 ++t;
1150 words = xmalloc (wordi * sizeof (char *));
1152 /* Now assign pointers to each string in the array. */
1153 t = argv[0];
1154 wordi = 0;
1155 while ((p = find_next_token (&t, &len)) != 0)
1157 ++t;
1158 p[len] = '\0';
1159 words[wordi++] = p;
1162 if (wordi)
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. */
1180 --o;
1183 free (words);
1185 return o;
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
1197 example).
1200 static char *
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;
1205 int result = 0;
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);
1213 if (begp <= endp)
1215 char *expansion = expand_argument (begp, endp+1);
1217 result = strlen (expansion);
1218 free (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;
1227 if (*argv)
1229 char *expansion = expand_argument (*argv, NULL);
1231 o = variable_buffer_output (o, expansion, strlen (expansion));
1233 free (expansion);
1236 return o;
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
1250 (short-circuiting).
1253 static char *
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;
1260 char *expansion;
1261 int result = 0;
1263 /* Find the result of the condition: if it's false keep going. */
1265 strip_whitespace (&begp, &endp);
1267 if (begp > endp)
1268 continue;
1270 expansion = expand_argument (begp, endp+1);
1271 result = strlen (expansion);
1273 /* If the result is false keep going. */
1274 if (!result)
1276 free (expansion);
1277 continue;
1280 /* It's true! Keep this result and return. */
1281 o = variable_buffer_output (o, expansion, result);
1282 free (expansion);
1283 break;
1286 return o;
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
1300 (short-circuiting).
1303 static char *
1304 func_and (char *o, char **argv, const char *funcname UNUSED)
1306 char *expansion;
1307 int result;
1309 while (1)
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);
1316 if (begp > endp)
1317 return o;
1319 expansion = expand_argument (begp, endp+1);
1320 result = strlen (expansion);
1322 /* If the result is false, stop here: we're done. */
1323 if (!result)
1324 break;
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! */
1329 if (*(++argv))
1330 free (expansion);
1331 else
1333 o = variable_buffer_output (o, expansion, result);
1334 break;
1338 free (expansion);
1340 return o;
1343 static char *
1344 func_wildcard (char *o, char **argv, const char *funcname UNUSED)
1346 #ifdef _AMIGA
1347 o = wildcard_expansion (argv[0], o);
1348 #else
1349 char *p = string_glob (argv[0]);
1350 o = variable_buffer_output (o, p, strlen (p));
1351 #endif
1352 return o;
1356 $(eval <makefile string>)
1358 Always resolves to the empty string.
1360 Treat the arguments as a segment of makefile, and parse them.
1363 static char *
1364 func_eval (char *o, char **argv, const char *funcname UNUSED)
1366 char *buf;
1367 unsigned int len;
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);
1378 return o;
1382 static char *
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. */
1389 if (v)
1390 o = variable_buffer_output (o, v->value, strlen(v->value));
1392 return o;
1396 \r is replaced on UNIX as well. Is this desirable?
1398 static void
1399 fold_newlines (char *buffer, unsigned int *length)
1401 char *dst = buffer;
1402 char *src = buffer;
1403 char *last_nonnl = buffer -1;
1404 src[*length] = 0;
1405 for (; *src != '\0'; ++src)
1407 if (src[0] == '\r' && src[1] == '\n')
1408 continue;
1409 if (*src == '\n')
1411 *dst++ = ' ';
1413 else
1415 last_nonnl = dst;
1416 *dst++ = *src;
1419 *(++last_nonnl) = '\0';
1420 *length = last_nonnl - buffer;
1425 int shell_function_pid = 0, shell_function_completed;
1428 #ifdef WINDOWS32
1429 /*untested*/
1431 #include <windows.h>
1432 #include <io.h>
1433 #include "sub_proc.h"
1436 void
1437 windows32_openpipe (int *pipedes, int *pid_p, char **command_argv, char **envp)
1439 SECURITY_ATTRIBUTES saAttr;
1440 HANDLE hIn;
1441 HANDLE hErr;
1442 HANDLE hChildOutRd;
1443 HANDLE hChildOutWr;
1444 HANDLE hProcess;
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(),
1454 &hIn,
1456 TRUE,
1457 DUPLICATE_SAME_ACCESS) == FALSE) {
1458 fatal (NILF, _("windows32_openpipe(): DuplicateHandle(In) failed (e=%ld)\n"),
1459 GetLastError());
1462 if (DuplicateHandle(GetCurrentProcess(),
1463 GetStdHandle(STD_ERROR_HANDLE),
1464 GetCurrentProcess(),
1465 &hErr,
1467 TRUE,
1468 DUPLICATE_SAME_ACCESS) == FALSE) {
1469 fatal (NILF, _("windows32_open_pipe(): DuplicateHandle(Err) failed (e=%ld)\n"),
1470 GetLastError());
1473 if (!CreatePipe(&hChildOutRd, &hChildOutWr, &saAttr, 0))
1474 fatal (NILF, _("CreatePipe() failed (e=%ld)\n"), GetLastError());
1476 hProcess = process_init_fd(hIn, hChildOutWr, hErr);
1478 if (!hProcess)
1479 fatal (NILF, _("windows32_openpipe(): process_init_fd() failed\n"));
1481 /* make sure that CreateProcess() has Path it needs */
1482 sync_Path_environment();
1483 /* `sync_Path_environment' may realloc `environ', so take note of
1484 the new value. */
1485 envp = environ;
1487 if (!process_begin(hProcess, command_argv, envp, command_argv[0], NULL)) {
1488 /* register process for wait */
1489 process_register(hProcess);
1491 /* set the pid for returning to caller */
1492 *pid_p = (int) hProcess;
1494 /* set up to read data from child */
1495 pipedes[0] = _open_osfhandle((long) hChildOutRd, O_RDONLY);
1497 /* this will be closed almost right away */
1498 pipedes[1] = _open_osfhandle((long) hChildOutWr, O_APPEND);
1499 } else {
1500 /* reap/cleanup the failed process */
1501 process_cleanup(hProcess);
1503 /* close handles which were duplicated, they weren't used */
1504 CloseHandle(hIn);
1505 CloseHandle(hErr);
1507 /* close pipe handles, they won't be used */
1508 CloseHandle(hChildOutRd);
1509 CloseHandle(hChildOutWr);
1511 /* set status for return */
1512 pipedes[0] = pipedes[1] = -1;
1513 *pid_p = -1;
1516 #endif
1519 #ifdef __MSDOS__
1520 FILE *
1521 msdos_openpipe (int* pipedes, int *pidp, char *text)
1523 FILE *fpipe=0;
1524 /* MSDOS can't fork, but it has `popen'. */
1525 struct variable *sh = lookup_variable ("SHELL", 5);
1526 int e;
1527 extern int dos_command_running, dos_status;
1529 /* Make sure not to bother processing an empty line. */
1530 while (isblank ((unsigned char)*text))
1531 ++text;
1532 if (*text == '\0')
1533 return 0;
1535 if (sh)
1537 char buf[PATH_MAX + 7];
1538 /* This makes sure $SHELL value is used by $(shell), even
1539 though the target environment is not passed to it. */
1540 sprintf (buf, "SHELL=%s", sh->value);
1541 putenv (buf);
1544 e = errno;
1545 errno = 0;
1546 dos_command_running = 1;
1547 dos_status = 0;
1548 /* If dos_status becomes non-zero, it means the child process
1549 was interrupted by a signal, like SIGINT or SIGQUIT. See
1550 fatal_error_signal in commands.c. */
1551 fpipe = popen (text, "rt");
1552 dos_command_running = 0;
1553 if (!fpipe || dos_status)
1555 pipedes[0] = -1;
1556 *pidp = -1;
1557 if (dos_status)
1558 errno = EINTR;
1559 else if (errno == 0)
1560 errno = ENOMEM;
1561 shell_function_completed = -1;
1563 else
1565 pipedes[0] = fileno (fpipe);
1566 *pidp = 42; /* Yes, the Meaning of Life, the Universe, and Everything! */
1567 errno = e;
1568 shell_function_completed = 1;
1570 return fpipe;
1572 #endif
1575 Do shell spawning, with the naughty bits for different OSes.
1578 #ifdef VMS
1580 /* VMS can't do $(shell ...) */
1581 #define func_shell 0
1583 #else
1584 #ifndef _AMIGA
1585 static char *
1586 func_shell (char *o, char **argv, const char *funcname UNUSED)
1588 char *batch_filename = NULL;
1590 #ifdef __MSDOS__
1591 FILE *fpipe;
1592 #endif
1593 char **command_argv;
1594 const char *error_prefix;
1595 char **envp;
1596 int pipedes[2];
1597 int pid;
1599 #ifndef __MSDOS__
1600 /* Construct the argument list. */
1601 command_argv = construct_command_argv (argv[0], NULL, NULL, 0,
1602 &batch_filename);
1603 if (command_argv == 0)
1604 return o;
1605 #endif
1607 /* Using a target environment for `shell' loses in cases like:
1608 export var = $(shell echo foobie)
1609 because target_environment hits a loop trying to expand $(var)
1610 to put it in the environment. This is even more confusing when
1611 var was not explicitly exported, but just appeared in the
1612 calling environment.
1614 See Savannah bug #10593.
1616 envp = target_environment (NILF);
1619 envp = environ;
1621 /* For error messages. */
1622 if (reading_file && reading_file->filenm)
1624 char *p = alloca (strlen (reading_file->filenm)+11+4);
1625 sprintf (p, "%s:%lu: ", reading_file->filenm, reading_file->lineno);
1626 error_prefix = p;
1628 else
1629 error_prefix = "";
1631 #if defined(__MSDOS__)
1632 fpipe = msdos_openpipe (pipedes, &pid, argv[0]);
1633 if (pipedes[0] < 0)
1635 perror_with_name (error_prefix, "pipe");
1636 return o;
1638 #elif defined(WINDOWS32)
1639 windows32_openpipe (pipedes, &pid, command_argv, envp);
1640 if (pipedes[0] < 0)
1642 /* open of the pipe failed, mark as failed execution */
1643 shell_function_completed = -1;
1645 return o;
1647 else
1648 #else
1649 if (pipe (pipedes) < 0)
1651 perror_with_name (error_prefix, "pipe");
1652 return o;
1655 # ifdef __EMX__
1656 /* close some handles that are unnecessary for the child process */
1657 CLOSE_ON_EXEC(pipedes[1]);
1658 CLOSE_ON_EXEC(pipedes[0]);
1659 /* Never use fork()/exec() here! Use spawn() instead in exec_command() */
1660 pid = child_execute_job (0, pipedes[1], command_argv, envp);
1661 if (pid < 0)
1662 perror_with_name (error_prefix, "spawn");
1663 # else /* ! __EMX__ */
1664 pid = vfork ();
1665 if (pid < 0)
1666 perror_with_name (error_prefix, "fork");
1667 else if (pid == 0)
1668 child_execute_job (0, pipedes[1], command_argv, envp);
1669 else
1670 # endif
1671 #endif
1673 /* We are the parent. */
1674 char *buffer;
1675 unsigned int maxlen, i;
1676 int cc;
1678 /* Record the PID for reap_children. */
1679 shell_function_pid = pid;
1680 #ifndef __MSDOS__
1681 shell_function_completed = 0;
1683 /* Free the storage only the child needed. */
1684 free (command_argv[0]);
1685 free (command_argv);
1687 /* Close the write side of the pipe. We test for -1, since
1688 pipedes[1] is -1 on MS-Windows, and some versions of MS
1689 libraries barf when `close' is called with -1. */
1690 if (pipedes[1] >= 0)
1691 close (pipedes[1]);
1692 #endif
1694 /* Set up and read from the pipe. */
1696 maxlen = 200;
1697 buffer = xmalloc (maxlen + 1);
1699 /* Read from the pipe until it gets EOF. */
1700 for (i = 0; ; i += cc)
1702 if (i == maxlen)
1704 maxlen += 512;
1705 buffer = xrealloc (buffer, maxlen + 1);
1708 EINTRLOOP (cc, read (pipedes[0], &buffer[i], maxlen - i));
1709 if (cc <= 0)
1710 break;
1712 buffer[i] = '\0';
1714 /* Close the read side of the pipe. */
1715 #ifdef __MSDOS__
1716 if (fpipe)
1717 (void) pclose (fpipe);
1718 #else
1719 (void) close (pipedes[0]);
1720 #endif
1722 /* Loop until child_handler or reap_children() sets
1723 shell_function_completed to the status of our child shell. */
1724 while (shell_function_completed == 0)
1725 reap_children (1, 0);
1727 if (batch_filename) {
1728 DB (DB_VERBOSE, (_("Cleaning up temporary batch file %s\n"),
1729 batch_filename));
1730 remove (batch_filename);
1731 free (batch_filename);
1733 shell_function_pid = 0;
1735 /* The child_handler function will set shell_function_completed
1736 to 1 when the child dies normally, or to -1 if it
1737 dies with status 127, which is most likely an exec fail. */
1739 if (shell_function_completed == -1)
1741 /* This likely means that the execvp failed, so we should just
1742 write the error message in the pipe from the child. */
1743 fputs (buffer, stderr);
1744 fflush (stderr);
1746 else
1748 /* The child finished normally. Replace all newlines in its output
1749 with spaces, and put that in the variable output buffer. */
1750 fold_newlines (buffer, &i);
1751 o = variable_buffer_output (o, buffer, i);
1754 free (buffer);
1757 return o;
1760 #else /* _AMIGA */
1762 /* Do the Amiga version of func_shell. */
1764 static char *
1765 func_shell (char *o, char **argv, const char *funcname)
1767 /* Amiga can't fork nor spawn, but I can start a program with
1768 redirection of my choice. However, this means that we
1769 don't have an opportunity to reopen stdout to trap it. Thus,
1770 we save our own stdout onto a new descriptor and dup a temp
1771 file's descriptor onto our stdout temporarily. After we
1772 spawn the shell program, we dup our own stdout back to the
1773 stdout descriptor. The buffer reading is the same as above,
1774 except that we're now reading from a file. */
1776 #include <dos/dos.h>
1777 #include <proto/dos.h>
1779 BPTR child_stdout;
1780 char tmp_output[FILENAME_MAX];
1781 unsigned int maxlen = 200, i;
1782 int cc;
1783 char * buffer, * ptr;
1784 char ** aptr;
1785 int len = 0;
1786 char* batch_filename = NULL;
1788 /* Construct the argument list. */
1789 command_argv = construct_command_argv (argv[0], NULL, NULL, 0,
1790 &batch_filename);
1791 if (command_argv == 0)
1792 return o;
1794 /* Note the mktemp() is a security hole, but this only runs on Amiga.
1795 Ideally we would use main.c:open_tmpfile(), but this uses a special
1796 Open(), not fopen(), and I'm not familiar enough with the code to mess
1797 with it. */
1798 strcpy (tmp_output, "t:MakeshXXXXXXXX");
1799 mktemp (tmp_output);
1800 child_stdout = Open (tmp_output, MODE_NEWFILE);
1802 for (aptr=command_argv; *aptr; aptr++)
1803 len += strlen (*aptr) + 1;
1805 buffer = xmalloc (len + 1);
1806 ptr = buffer;
1808 for (aptr=command_argv; *aptr; aptr++)
1810 strcpy (ptr, *aptr);
1811 ptr += strlen (ptr) + 1;
1812 *ptr ++ = ' ';
1813 *ptr = 0;
1816 ptr[-1] = '\n';
1818 Execute (buffer, NULL, child_stdout);
1819 free (buffer);
1821 Close (child_stdout);
1823 child_stdout = Open (tmp_output, MODE_OLDFILE);
1825 buffer = xmalloc (maxlen);
1826 i = 0;
1829 if (i == maxlen)
1831 maxlen += 512;
1832 buffer = xrealloc (buffer, maxlen + 1);
1835 cc = Read (child_stdout, &buffer[i], maxlen - i);
1836 if (cc > 0)
1837 i += cc;
1838 } while (cc > 0);
1840 Close (child_stdout);
1842 fold_newlines (buffer, &i);
1843 o = variable_buffer_output (o, buffer, i);
1844 free (buffer);
1845 return o;
1847 #endif /* _AMIGA */
1848 #endif /* !VMS */
1850 #ifdef EXPERIMENTAL
1853 equality. Return is string-boolean, ie, the empty string is false.
1855 static char *
1856 func_eq (char *o, char **argv, char *funcname)
1858 int result = ! strcmp (argv[0], argv[1]);
1859 o = variable_buffer_output (o, result ? "1" : "", result);
1860 return o;
1865 string-boolean not operator.
1867 static char *
1868 func_not (char *o, char **argv, char *funcname)
1870 const char *s = argv[0];
1871 int result = 0;
1872 while (isspace ((unsigned char)*s))
1873 s++;
1874 result = ! (*s);
1875 o = variable_buffer_output (o, result ? "1" : "", result);
1876 return o;
1878 #endif
1881 #ifdef HAVE_DOS_PATHS
1882 #define IS_ABSOLUTE(n) (n[0] && n[1] == ':')
1883 #define ROOT_LEN 3
1884 #else
1885 #define IS_ABSOLUTE(n) (n[0] == '/')
1886 #define ROOT_LEN 1
1887 #endif
1889 /* Return the absolute name of file NAME which does not contain any `.',
1890 `..' components nor any repeated path separators ('/'). */
1892 static char *
1893 abspath (const char *name, char *apath)
1895 char *dest;
1896 const char *start, *end, *apath_limit;
1897 unsigned long root_len = ROOT_LEN;
1899 if (name[0] == '\0' || apath == NULL)
1900 return NULL;
1902 apath_limit = apath + GET_PATH_MAX;
1904 if (!IS_ABSOLUTE(name))
1906 /* It is unlikely we would make it until here but just to make sure. */
1907 if (!starting_directory)
1908 return NULL;
1910 strcpy (apath, starting_directory);
1912 #ifdef HAVE_DOS_PATHS
1913 if (IS_PATHSEP(name[0]))
1915 /* We have /foo, an absolute file name except for the drive
1916 letter. Assume the missing drive letter is the current
1917 drive, which we can get if we remove from starting_directory
1918 everything past the root directory. */
1919 apath[root_len] = '\0';
1921 #endif
1923 dest = strchr (apath, '\0');
1925 else
1927 strncpy (apath, name, root_len);
1928 apath[root_len] = '\0';
1929 dest = apath + root_len;
1930 /* Get past the root, since we already copied it. */
1931 name += root_len;
1932 #ifdef HAVE_DOS_PATHS
1933 if (!IS_PATHSEP(apath[2]))
1935 /* Convert d:foo into d:./foo and increase root_len. */
1936 apath[2] = '.';
1937 apath[3] = '/';
1938 dest++;
1939 root_len++;
1940 /* strncpy above copied one character too many. */
1941 name--;
1943 else
1944 apath[2] = '/'; /* make sure it's a forward slash */
1945 #endif
1948 for (start = end = name; *start != '\0'; start = end)
1950 unsigned long len;
1952 /* Skip sequence of multiple path-separators. */
1953 while (IS_PATHSEP(*start))
1954 ++start;
1956 /* Find end of path component. */
1957 for (end = start; *end != '\0' && !IS_PATHSEP(*end); ++end)
1960 len = end - start;
1962 if (len == 0)
1963 break;
1964 else if (len == 1 && start[0] == '.')
1965 /* nothing */;
1966 else if (len == 2 && start[0] == '.' && start[1] == '.')
1968 /* Back up to previous component, ignore if at root already. */
1969 if (dest > apath + root_len)
1970 for (--dest; !IS_PATHSEP(dest[-1]); --dest);
1972 else
1974 if (!IS_PATHSEP(dest[-1]))
1975 *dest++ = '/';
1977 if (dest + len >= apath_limit)
1978 return NULL;
1980 dest = memcpy (dest, start, len);
1981 dest += len;
1982 *dest = '\0';
1986 /* Unless it is root strip trailing separator. */
1987 if (dest > apath + root_len && IS_PATHSEP(dest[-1]))
1988 --dest;
1990 *dest = '\0';
1992 return apath;
1996 static char *
1997 func_realpath (char *o, char **argv, const char *funcname UNUSED)
1999 /* Expand the argument. */
2000 const char *p = argv[0];
2001 const char *path = 0;
2002 int doneany = 0;
2003 unsigned int len = 0;
2004 #ifndef HAVE_REALPATH
2005 struct stat st;
2006 #endif
2007 PATH_VAR (in);
2008 PATH_VAR (out);
2010 while ((path = find_next_token (&p, &len)) != 0)
2012 if (len < GET_PATH_MAX)
2014 strncpy (in, path, len);
2015 in[len] = '\0';
2017 if (
2018 #ifdef HAVE_REALPATH
2019 realpath (in, out)
2020 #else
2021 abspath (in, out) && stat (out, &st) == 0
2022 #endif
2025 o = variable_buffer_output (o, out, strlen (out));
2026 o = variable_buffer_output (o, " ", 1);
2027 doneany = 1;
2032 /* Kill last space. */
2033 if (doneany)
2034 --o;
2036 return o;
2039 static char *
2040 func_abspath (char *o, char **argv, const char *funcname UNUSED)
2042 /* Expand the argument. */
2043 const char *p = argv[0];
2044 const char *path = 0;
2045 int doneany = 0;
2046 unsigned int len = 0;
2047 PATH_VAR (in);
2048 PATH_VAR (out);
2050 while ((path = find_next_token (&p, &len)) != 0)
2052 if (len < GET_PATH_MAX)
2054 strncpy (in, path, len);
2055 in[len] = '\0';
2057 if (abspath (in, out))
2059 o = variable_buffer_output (o, out, strlen (out));
2060 o = variable_buffer_output (o, " ", 1);
2061 doneany = 1;
2066 /* Kill last space. */
2067 if (doneany)
2068 --o;
2070 return o;
2073 /* Lookup table for builtin functions.
2075 This doesn't have to be sorted; we use a straight lookup. We might gain
2076 some efficiency by moving most often used functions to the start of the
2077 table.
2079 If MAXIMUM_ARGS is 0, that means there is no maximum and all
2080 comma-separated values are treated as arguments.
2082 EXPAND_ARGS means that all arguments should be expanded before invocation.
2083 Functions that do namespace tricks (foreach) don't automatically expand. */
2085 static char *func_call (char *o, char **argv, const char *funcname);
2088 static struct function_table_entry function_table_init[] =
2090 /* Name/size */ /* MIN MAX EXP? Function */
2091 { STRING_SIZE_TUPLE("abspath"), 0, 1, 1, func_abspath},
2092 { STRING_SIZE_TUPLE("addprefix"), 2, 2, 1, func_addsuffix_addprefix},
2093 { STRING_SIZE_TUPLE("addsuffix"), 2, 2, 1, func_addsuffix_addprefix},
2094 { STRING_SIZE_TUPLE("basename"), 0, 1, 1, func_basename_dir},
2095 { STRING_SIZE_TUPLE("dir"), 0, 1, 1, func_basename_dir},
2096 { STRING_SIZE_TUPLE("notdir"), 0, 1, 1, func_notdir_suffix},
2097 { STRING_SIZE_TUPLE("subst"), 3, 3, 1, func_subst},
2098 { STRING_SIZE_TUPLE("suffix"), 0, 1, 1, func_notdir_suffix},
2099 { STRING_SIZE_TUPLE("filter"), 2, 2, 1, func_filter_filterout},
2100 { STRING_SIZE_TUPLE("filter-out"), 2, 2, 1, func_filter_filterout},
2101 { STRING_SIZE_TUPLE("findstring"), 2, 2, 1, func_findstring},
2102 { STRING_SIZE_TUPLE("firstword"), 0, 1, 1, func_firstword},
2103 { STRING_SIZE_TUPLE("flavor"), 0, 1, 1, func_flavor},
2104 { STRING_SIZE_TUPLE("join"), 2, 2, 1, func_join},
2105 { STRING_SIZE_TUPLE("lastword"), 0, 1, 1, func_lastword},
2106 { STRING_SIZE_TUPLE("patsubst"), 3, 3, 1, func_patsubst},
2107 { STRING_SIZE_TUPLE("realpath"), 0, 1, 1, func_realpath},
2108 { STRING_SIZE_TUPLE("shell"), 0, 1, 1, func_shell},
2109 { STRING_SIZE_TUPLE("sort"), 0, 1, 1, func_sort},
2110 { STRING_SIZE_TUPLE("strip"), 0, 1, 1, func_strip},
2111 { STRING_SIZE_TUPLE("wildcard"), 0, 1, 1, func_wildcard},
2112 { STRING_SIZE_TUPLE("word"), 2, 2, 1, func_word},
2113 { STRING_SIZE_TUPLE("wordlist"), 3, 3, 1, func_wordlist},
2114 { STRING_SIZE_TUPLE("words"), 0, 1, 1, func_words},
2115 { STRING_SIZE_TUPLE("origin"), 0, 1, 1, func_origin},
2116 { STRING_SIZE_TUPLE("foreach"), 3, 3, 0, func_foreach},
2117 { STRING_SIZE_TUPLE("call"), 1, 0, 1, func_call},
2118 { STRING_SIZE_TUPLE("info"), 0, 1, 1, func_error},
2119 { STRING_SIZE_TUPLE("error"), 0, 1, 1, func_error},
2120 { STRING_SIZE_TUPLE("warning"), 0, 1, 1, func_error},
2121 { STRING_SIZE_TUPLE("if"), 2, 3, 0, func_if},
2122 { STRING_SIZE_TUPLE("or"), 1, 0, 0, func_or},
2123 { STRING_SIZE_TUPLE("and"), 1, 0, 0, func_and},
2124 { STRING_SIZE_TUPLE("value"), 0, 1, 1, func_value},
2125 { STRING_SIZE_TUPLE("eval"), 0, 1, 1, func_eval},
2126 #ifdef EXPERIMENTAL
2127 { STRING_SIZE_TUPLE("eq"), 2, 2, 1, func_eq},
2128 { STRING_SIZE_TUPLE("not"), 0, 1, 1, func_not},
2129 #endif
2132 #define FUNCTION_TABLE_ENTRIES (sizeof (function_table_init) / sizeof (struct function_table_entry))
2135 /* These must come after the definition of function_table. */
2137 static char *
2138 expand_builtin_function (char *o, int argc, char **argv,
2139 const struct function_table_entry *entry_p)
2141 if (argc < (int)entry_p->minimum_args)
2142 fatal (*expanding_var,
2143 _("insufficient number of arguments (%d) to function `%s'"),
2144 argc, entry_p->name);
2146 /* I suppose technically some function could do something with no
2147 arguments, but so far none do, so just test it for all functions here
2148 rather than in each one. We can change it later if necessary. */
2150 if (!argc)
2151 return o;
2153 if (!entry_p->func_ptr)
2154 fatal (*expanding_var,
2155 _("unimplemented on this platform: function `%s'"), entry_p->name);
2157 return entry_p->func_ptr (o, argv, entry_p->name);
2160 /* Check for a function invocation in *STRINGP. *STRINGP points at the
2161 opening ( or { and is not null-terminated. If a function invocation
2162 is found, expand it into the buffer at *OP, updating *OP, incrementing
2163 *STRINGP past the reference and returning nonzero. If not, return zero. */
2166 handle_function (char **op, const char **stringp)
2168 const struct function_table_entry *entry_p;
2169 char openparen = (*stringp)[0];
2170 char closeparen = openparen == '(' ? ')' : '}';
2171 const char *beg;
2172 const char *end;
2173 int count = 0;
2174 char *abeg = NULL;
2175 char **argv, **argvp;
2176 int nargs;
2178 beg = *stringp + 1;
2180 entry_p = lookup_function (beg);
2182 if (!entry_p)
2183 return 0;
2185 /* We found a builtin function. Find the beginning of its arguments (skip
2186 whitespace after the name). */
2188 beg = next_token (beg + entry_p->len);
2190 /* Find the end of the function invocation, counting nested use of
2191 whichever kind of parens we use. Since we're looking, count commas
2192 to get a rough estimate of how many arguments we might have. The
2193 count might be high, but it'll never be low. */
2195 for (nargs=1, end=beg; *end != '\0'; ++end)
2196 if (*end == ',')
2197 ++nargs;
2198 else if (*end == openparen)
2199 ++count;
2200 else if (*end == closeparen && --count < 0)
2201 break;
2203 if (count >= 0)
2204 fatal (*expanding_var,
2205 _("unterminated call to function `%s': missing `%c'"),
2206 entry_p->name, closeparen);
2208 *stringp = end;
2210 /* Get some memory to store the arg pointers. */
2211 argvp = argv = alloca (sizeof (char *) * (nargs + 2));
2213 /* Chop the string into arguments, then a nul. As soon as we hit
2214 MAXIMUM_ARGS (if it's >0) assume the rest of the string is part of the
2215 last argument.
2217 If we're expanding, store pointers to the expansion of each one. If
2218 not, make a duplicate of the string and point into that, nul-terminating
2219 each argument. */
2221 if (entry_p->expand_args)
2223 const char *p;
2224 for (p=beg, nargs=0; p <= end; ++argvp)
2226 const char *next;
2228 ++nargs;
2230 if (nargs == entry_p->maximum_args
2231 || (! (next = find_next_argument (openparen, closeparen, p, end))))
2232 next = end;
2234 *argvp = expand_argument (p, next);
2235 p = next + 1;
2238 else
2240 int len = end - beg;
2241 char *p, *aend;
2243 abeg = xmalloc (len+1);
2244 memcpy (abeg, beg, len);
2245 abeg[len] = '\0';
2246 aend = abeg + len;
2248 for (p=abeg, nargs=0; p <= aend; ++argvp)
2250 char *next;
2252 ++nargs;
2254 if (nargs == entry_p->maximum_args
2255 || (! (next = find_next_argument (openparen, closeparen, p, aend))))
2256 next = aend;
2258 *argvp = p;
2259 *next = '\0';
2260 p = next + 1;
2263 *argvp = NULL;
2265 /* Finally! Run the function... */
2266 *op = expand_builtin_function (*op, nargs, argv, entry_p);
2268 /* Free memory. */
2269 if (entry_p->expand_args)
2270 for (argvp=argv; *argvp != 0; ++argvp)
2271 free (*argvp);
2272 if (abeg)
2273 free (abeg);
2275 return 1;
2279 /* User-defined functions. Expand the first argument as either a builtin
2280 function or a make variable, in the context of the rest of the arguments
2281 assigned to $1, $2, ... $N. $0 is the name of the function. */
2283 static char *
2284 func_call (char *o, char **argv, const char *funcname UNUSED)
2286 static int max_args = 0;
2287 char *fname;
2288 char *cp;
2289 char *body;
2290 int flen;
2291 int i;
2292 int saved_args;
2293 const struct function_table_entry *entry_p;
2294 struct variable *v;
2296 /* There is no way to define a variable with a space in the name, so strip
2297 leading and trailing whitespace as a favor to the user. */
2298 fname = argv[0];
2299 while (*fname != '\0' && isspace ((unsigned char)*fname))
2300 ++fname;
2302 cp = fname + strlen (fname) - 1;
2303 while (cp > fname && isspace ((unsigned char)*cp))
2304 --cp;
2305 cp[1] = '\0';
2307 /* Calling nothing is a no-op */
2308 if (*fname == '\0')
2309 return o;
2311 /* Are we invoking a builtin function? */
2313 entry_p = lookup_function (fname);
2314 if (entry_p)
2316 /* How many arguments do we have? */
2317 for (i=0; argv[i+1]; ++i)
2319 return expand_builtin_function (o, i, argv+1, entry_p);
2322 /* Not a builtin, so the first argument is the name of a variable to be
2323 expanded and interpreted as a function. Find it. */
2324 flen = strlen (fname);
2326 v = lookup_variable (fname, flen);
2328 if (v == 0)
2329 warn_undefined (fname, flen);
2331 if (v == 0 || *v->value == '\0')
2332 return o;
2334 body = alloca (flen + 4);
2335 body[0] = '$';
2336 body[1] = '(';
2337 memcpy (body + 2, fname, flen);
2338 body[flen+2] = ')';
2339 body[flen+3] = '\0';
2341 /* Set up arguments $(1) .. $(N). $(0) is the function name. */
2343 push_new_variable_scope ();
2345 for (i=0; *argv; ++i, ++argv)
2347 char num[11];
2349 sprintf (num, "%d", i);
2350 define_variable (num, strlen (num), *argv, o_automatic, 0);
2353 /* If the number of arguments we have is < max_args, it means we're inside
2354 a recursive invocation of $(call ...). Fill in the remaining arguments
2355 in the new scope with the empty value, to hide them from this
2356 invocation. */
2358 for (; i < max_args; ++i)
2360 char num[11];
2362 sprintf (num, "%d", i);
2363 define_variable (num, strlen (num), "", o_automatic, 0);
2366 /* Expand the body in the context of the arguments, adding the result to
2367 the variable buffer. */
2369 v->exp_count = EXP_COUNT_MAX;
2371 saved_args = max_args;
2372 max_args = i;
2373 o = variable_expand_string (o, body, flen+3);
2374 max_args = saved_args;
2376 v->exp_count = 0;
2378 pop_variable_scope ();
2380 return o + strlen (o);
2383 void
2384 hash_init_function_table (void)
2386 hash_init (&function_table, FUNCTION_TABLE_ENTRIES * 2,
2387 function_table_entry_hash_1, function_table_entry_hash_2,
2388 function_table_entry_hash_cmp);
2389 hash_load (&function_table, function_table_init,
2390 FUNCTION_TABLE_ENTRIES, sizeof (struct function_table_entry));