var.c revision 1.394
1 /* $NetBSD: var.c,v 1.394 2020/08/02 10:01:50 rillig Exp $ */ 2 3 /* 4 * Copyright (c) 1988, 1989, 1990, 1993 5 * The Regents of the University of California. All rights reserved. 6 * 7 * This code is derived from software contributed to Berkeley by 8 * Adam de Boor. 9 * 10 * Redistribution and use in source and binary forms, with or without 11 * modification, are permitted provided that the following conditions 12 * are met: 13 * 1. Redistributions of source code must retain the above copyright 14 * notice, this list of conditions and the following disclaimer. 15 * 2. Redistributions in binary form must reproduce the above copyright 16 * notice, this list of conditions and the following disclaimer in the 17 * documentation and/or other materials provided with the distribution. 18 * 3. Neither the name of the University nor the names of its contributors 19 * may be used to endorse or promote products derived from this software 20 * without specific prior written permission. 21 * 22 * THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND 23 * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE 24 * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE 25 * ARE DISCLAIMED. IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE 26 * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL 27 * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS 28 * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) 29 * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT 30 * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY 31 * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF 32 * SUCH DAMAGE. 33 */ 34 35 /* 36 * Copyright (c) 1989 by Berkeley Softworks 37 * All rights reserved. 38 * 39 * This code is derived from software contributed to Berkeley by 40 * Adam de Boor. 41 * 42 * Redistribution and use in source and binary forms, with or without 43 * modification, are permitted provided that the following conditions 44 * are met: 45 * 1. Redistributions of source code must retain the above copyright 46 * notice, this list of conditions and the following disclaimer. 47 * 2. Redistributions in binary form must reproduce the above copyright 48 * notice, this list of conditions and the following disclaimer in the 49 * documentation and/or other materials provided with the distribution. 50 * 3. All advertising materials mentioning features or use of this software 51 * must display the following acknowledgement: 52 * This product includes software developed by the University of 53 * California, Berkeley and its contributors. 54 * 4. Neither the name of the University nor the names of its contributors 55 * may be used to endorse or promote products derived from this software 56 * without specific prior written permission. 57 * 58 * THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND 59 * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE 60 * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE 61 * ARE DISCLAIMED. IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE 62 * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL 63 * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS 64 * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) 65 * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT 66 * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY 67 * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF 68 * SUCH DAMAGE. 69 */ 70 71 #ifndef MAKE_NATIVE 72 static char rcsid[] = "$NetBSD: var.c,v 1.394 2020/08/02 10:01:50 rillig Exp $"; 73 #else 74 #include <sys/cdefs.h> 75 #ifndef lint 76 #if 0 77 static char sccsid[] = "@(#)var.c 8.3 (Berkeley) 3/19/94"; 78 #else 79 __RCSID("$NetBSD: var.c,v 1.394 2020/08/02 10:01:50 rillig Exp $"); 80 #endif 81 #endif /* not lint */ 82 #endif 83 84 /*- 85 * var.c -- 86 * Variable-handling functions 87 * 88 * Interface: 89 * Var_Set Set the value of a variable in the given 90 * context. The variable is created if it doesn't 91 * yet exist. 92 * 93 * Var_Append Append more characters to an existing variable 94 * in the given context. The variable needn't 95 * exist already -- it will be created if it doesn't. 96 * A space is placed between the old value and the 97 * new one. 98 * 99 * Var_Exists See if a variable exists. 100 * 101 * Var_Value Return the unexpanded value of a variable in a 102 * context or NULL if the variable is undefined. 103 * 104 * Var_Subst Substitute either a single variable or all 105 * variables in a string, using the given context. 106 * 107 * Var_Parse Parse a variable expansion from a string and 108 * return the result and the number of characters 109 * consumed. 110 * 111 * Var_Delete Delete a variable in a context. 112 * 113 * Var_Init Initialize this module. 114 * 115 * Debugging: 116 * Var_Dump Print out all variables defined in the given 117 * context. 118 * 119 * XXX: There's a lot of duplication in these functions. 120 */ 121 122 #include <sys/stat.h> 123 #ifndef NO_REGEX 124 #include <sys/types.h> 125 #include <regex.h> 126 #endif 127 #include <assert.h> 128 #include <ctype.h> 129 #include <inttypes.h> 130 #include <limits.h> 131 #include <stdlib.h> 132 #include <time.h> 133 134 #include "make.h" 135 #include "buf.h" 136 #include "dir.h" 137 #include "job.h" 138 #include "metachar.h" 139 140 #define VAR_DEBUG(fmt, ...) \ 141 if (!DEBUG(VAR)) \ 142 (void) 0; \ 143 else \ 144 fprintf(debug_file, fmt, __VA_ARGS__) 145 146 /* 147 * This lets us tell if we have replaced the original environ 148 * (which we cannot free). 149 */ 150 char **savedEnv = NULL; 151 152 /* 153 * This is a harmless return value for Var_Parse that can be used by Var_Subst 154 * to determine if there was an error in parsing -- easier than returning 155 * a flag, as things outside this module don't give a hoot. 156 */ 157 char var_Error[] = ""; 158 159 /* 160 * Similar to var_Error, but returned when the 'VARE_UNDEFERR' flag for 161 * Var_Parse is not set. Why not just use a constant? Well, GCC likes 162 * to condense identical string instances... 163 */ 164 static char varNoError[] = ""; 165 166 /* 167 * Traditionally we consume $$ during := like any other expansion. 168 * Other make's do not. 169 * This knob allows controlling the behavior. 170 * FALSE to consume $$ during := assignment. 171 * TRUE to preserve $$ during := assignment. 172 */ 173 #define SAVE_DOLLARS ".MAKE.SAVE_DOLLARS" 174 static Boolean save_dollars = TRUE; 175 176 /* 177 * Internally, variables are contained in four different contexts. 178 * 1) the environment. They cannot be changed. If an environment 179 * variable is appended to, the result is placed in the global 180 * context. 181 * 2) the global context. Variables set in the Makefile are located in 182 * the global context. 183 * 3) the command-line context. All variables set on the command line 184 * are placed in this context. They are UNALTERABLE once placed here. 185 * 4) the local context. Each target has associated with it a context 186 * list. On this list are located the structures describing such 187 * local variables as $(@) and $(*) 188 * The four contexts are searched in the reverse order from which they are 189 * listed (but see checkEnvFirst). 190 */ 191 GNode *VAR_INTERNAL; /* variables from make itself */ 192 GNode *VAR_GLOBAL; /* variables from the makefile */ 193 GNode *VAR_CMD; /* variables defined on the command-line */ 194 195 typedef enum { 196 FIND_CMD = 0x01, /* look in VAR_CMD when searching */ 197 FIND_GLOBAL = 0x02, /* look in VAR_GLOBAL as well */ 198 FIND_ENV = 0x04 /* look in the environment also */ 199 } VarFindFlags; 200 201 typedef enum { 202 VAR_IN_USE = 0x01, /* Variable's value is currently being used 203 * by Var_Parse or Var_Subst. 204 * Used to avoid endless recursion */ 205 VAR_FROM_ENV = 0x02, /* Variable comes from the environment */ 206 VAR_JUNK = 0x04, /* Variable is a junk variable that 207 * should be destroyed when done with 208 * it. Used by Var_Parse for undefined, 209 * modified variables */ 210 VAR_KEEP = 0x08, /* Variable is VAR_JUNK, but we found 211 * a use for it in some modifier and 212 * the value is therefore valid */ 213 VAR_EXPORTED = 0x10, /* Variable is exported */ 214 VAR_REEXPORT = 0x20, /* Indicate if var needs re-export. 215 * This would be true if it contains $'s */ 216 VAR_FROM_CMD = 0x40 /* Variable came from command line */ 217 } Var_Flags; 218 219 typedef struct Var { 220 char *name; /* the variable's name */ 221 Buffer val; /* its value */ 222 Var_Flags flags; /* miscellaneous status flags */ 223 } Var; 224 225 /* 226 * Exporting vars is expensive so skip it if we can 227 */ 228 typedef enum { 229 VAR_EXPORTED_NONE, 230 VAR_EXPORTED_YES, 231 VAR_EXPORTED_ALL 232 } VarExportedMode; 233 static VarExportedMode var_exportedVars = VAR_EXPORTED_NONE; 234 235 typedef enum { 236 /* 237 * We pass this to Var_Export when doing the initial export 238 * or after updating an exported var. 239 */ 240 VAR_EXPORT_PARENT = 0x01, 241 /* 242 * We pass this to Var_Export1 to tell it to leave the value alone. 243 */ 244 VAR_EXPORT_LITERAL = 0x02 245 } VarExportFlags; 246 247 /* Flags for pattern matching in the :S and :C modifiers */ 248 typedef enum { 249 VARP_SUB_GLOBAL = 0x01, /* Apply substitution globally */ 250 VARP_SUB_ONE = 0x02, /* Apply substitution to one word */ 251 VARP_SUB_MATCHED = 0x04, /* There was a match */ 252 VARP_ANCHOR_START = 0x08, /* Match at start of word */ 253 VARP_ANCHOR_END = 0x10 /* Match at end of word */ 254 } VarPatternFlags; 255 256 typedef enum { 257 VAR_NO_EXPORT = 0x01 /* do not export */ 258 } VarSet_Flags; 259 260 #define BROPEN '{' 261 #define BRCLOSE '}' 262 #define PROPEN '(' 263 #define PRCLOSE ')' 264 265 /*- 266 *----------------------------------------------------------------------- 267 * VarFind -- 268 * Find the given variable in the given context and any other contexts 269 * indicated. 270 * 271 * Input: 272 * name name to find 273 * ctxt context in which to find it 274 * flags FIND_GLOBAL look in VAR_GLOBAL as well 275 * FIND_CMD look in VAR_CMD as well 276 * FIND_ENV look in the environment as well 277 * 278 * Results: 279 * A pointer to the structure describing the desired variable or 280 * NULL if the variable does not exist. 281 * 282 * Side Effects: 283 * None 284 *----------------------------------------------------------------------- 285 */ 286 static Var * 287 VarFind(const char *name, GNode *ctxt, VarFindFlags flags) 288 { 289 /* 290 * If the variable name begins with a '.', it could very well be one of 291 * the local ones. We check the name against all the local variables 292 * and substitute the short version in for 'name' if it matches one of 293 * them. 294 */ 295 if (*name == '.' && isupper((unsigned char) name[1])) { 296 switch (name[1]) { 297 case 'A': 298 if (strcmp(name, ".ALLSRC") == 0) 299 name = ALLSRC; 300 if (strcmp(name, ".ARCHIVE") == 0) 301 name = ARCHIVE; 302 break; 303 case 'I': 304 if (strcmp(name, ".IMPSRC") == 0) 305 name = IMPSRC; 306 break; 307 case 'M': 308 if (strcmp(name, ".MEMBER") == 0) 309 name = MEMBER; 310 break; 311 case 'O': 312 if (strcmp(name, ".OODATE") == 0) 313 name = OODATE; 314 break; 315 case 'P': 316 if (strcmp(name, ".PREFIX") == 0) 317 name = PREFIX; 318 break; 319 case 'T': 320 if (strcmp(name, ".TARGET") == 0) 321 name = TARGET; 322 break; 323 } 324 } 325 326 #ifdef notyet 327 /* for compatibility with gmake */ 328 if (name[0] == '^' && name[1] == '\0') 329 name = ALLSRC; 330 #endif 331 332 /* 333 * First look for the variable in the given context. If it's not there, 334 * look for it in VAR_CMD, VAR_GLOBAL and the environment, in that order, 335 * depending on the FIND_* flags in 'flags' 336 */ 337 Hash_Entry *var = Hash_FindEntry(&ctxt->context, name); 338 339 if (var == NULL && (flags & FIND_CMD) && ctxt != VAR_CMD) { 340 var = Hash_FindEntry(&VAR_CMD->context, name); 341 } 342 if (!checkEnvFirst && var == NULL && (flags & FIND_GLOBAL) && 343 ctxt != VAR_GLOBAL) 344 { 345 var = Hash_FindEntry(&VAR_GLOBAL->context, name); 346 if (var == NULL && ctxt != VAR_INTERNAL) { 347 /* VAR_INTERNAL is subordinate to VAR_GLOBAL */ 348 var = Hash_FindEntry(&VAR_INTERNAL->context, name); 349 } 350 } 351 if (var == NULL && (flags & FIND_ENV)) { 352 char *env; 353 354 if ((env = getenv(name)) != NULL) { 355 Var *v = bmake_malloc(sizeof(Var)); 356 v->name = bmake_strdup(name); 357 358 size_t len = strlen(env); 359 Buf_InitZ(&v->val, len + 1); 360 Buf_AddBytesZ(&v->val, env, len); 361 362 v->flags = VAR_FROM_ENV; 363 return v; 364 } else if (checkEnvFirst && (flags & FIND_GLOBAL) && 365 ctxt != VAR_GLOBAL) 366 { 367 var = Hash_FindEntry(&VAR_GLOBAL->context, name); 368 if (var == NULL && ctxt != VAR_INTERNAL) { 369 var = Hash_FindEntry(&VAR_INTERNAL->context, name); 370 } 371 if (var == NULL) { 372 return NULL; 373 } else { 374 return (Var *)Hash_GetValue(var); 375 } 376 } else { 377 return NULL; 378 } 379 } else if (var == NULL) { 380 return NULL; 381 } else { 382 return (Var *)Hash_GetValue(var); 383 } 384 } 385 386 /*- 387 *----------------------------------------------------------------------- 388 * VarFreeEnv -- 389 * If the variable is an environment variable, free it 390 * 391 * Input: 392 * v the variable 393 * destroy true if the value buffer should be destroyed. 394 * 395 * Results: 396 * 1 if it is an environment variable 0 ow. 397 * 398 * Side Effects: 399 * The variable is free'ed if it is an environent variable. 400 *----------------------------------------------------------------------- 401 */ 402 static Boolean 403 VarFreeEnv(Var *v, Boolean destroy) 404 { 405 if (!(v->flags & VAR_FROM_ENV)) 406 return FALSE; 407 free(v->name); 408 Buf_Destroy(&v->val, destroy); 409 free(v); 410 return TRUE; 411 } 412 413 /*- 414 *----------------------------------------------------------------------- 415 * VarAdd -- 416 * Add a new variable of name name and value val to the given context 417 * 418 * Input: 419 * name name of variable to add 420 * val value to set it to 421 * ctxt context in which to set it 422 * 423 * Side Effects: 424 * The new variable is placed at the front of the given context 425 * The name and val arguments are duplicated so they may 426 * safely be freed. 427 *----------------------------------------------------------------------- 428 */ 429 static void 430 VarAdd(const char *name, const char *val, GNode *ctxt) 431 { 432 Var *v = bmake_malloc(sizeof(Var)); 433 434 size_t len = val != NULL ? strlen(val) : 0; 435 Buf_InitZ(&v->val, len + 1); 436 Buf_AddBytesZ(&v->val, val, len); 437 438 v->flags = 0; 439 440 Hash_Entry *h = Hash_CreateEntry(&ctxt->context, name, NULL); 441 Hash_SetValue(h, v); 442 v->name = h->name; 443 if (DEBUG(VAR) && !(ctxt->flags & INTERNAL)) { 444 fprintf(debug_file, "%s:%s = %s\n", ctxt->name, name, val); 445 } 446 } 447 448 /*- 449 *----------------------------------------------------------------------- 450 * Var_Delete -- 451 * Remove a variable from a context. 452 * 453 * Side Effects: 454 * The Var structure is removed and freed. 455 * 456 *----------------------------------------------------------------------- 457 */ 458 void 459 Var_Delete(const char *name, GNode *ctxt) 460 { 461 Hash_Entry *ln; 462 char *cp; 463 464 if (strchr(name, '$') != NULL) { 465 cp = Var_Subst(name, VAR_GLOBAL, VARE_WANTRES); 466 } else { 467 cp = UNCONST(name); 468 } 469 ln = Hash_FindEntry(&ctxt->context, cp); 470 if (DEBUG(VAR)) { 471 fprintf(debug_file, "%s:delete %s%s\n", 472 ctxt->name, cp, ln ? "" : " (not found)"); 473 } 474 if (cp != name) 475 free(cp); 476 if (ln != NULL) { 477 Var *v = (Var *)Hash_GetValue(ln); 478 if (v->flags & VAR_EXPORTED) 479 unsetenv(v->name); 480 if (strcmp(MAKE_EXPORTED, v->name) == 0) 481 var_exportedVars = VAR_EXPORTED_NONE; 482 if (v->name != ln->name) 483 free(v->name); 484 Hash_DeleteEntry(&ctxt->context, ln); 485 Buf_Destroy(&v->val, TRUE); 486 free(v); 487 } 488 } 489 490 491 /* 492 * Export a var. 493 * We ignore make internal variables (those which start with '.') 494 * Also we jump through some hoops to avoid calling setenv 495 * more than necessary since it can leak. 496 * We only manipulate flags of vars if 'parent' is set. 497 */ 498 static int 499 Var_Export1(const char *name, VarExportFlags flags) 500 { 501 char tmp[BUFSIZ]; 502 Var *v; 503 char *val = NULL; 504 int n; 505 VarExportFlags parent = flags & VAR_EXPORT_PARENT; 506 507 if (*name == '.') 508 return 0; /* skip internals */ 509 if (!name[1]) { 510 /* 511 * A single char. 512 * If it is one of the vars that should only appear in 513 * local context, skip it, else we can get Var_Subst 514 * into a loop. 515 */ 516 switch (name[0]) { 517 case '@': 518 case '%': 519 case '*': 520 case '!': 521 return 0; 522 } 523 } 524 v = VarFind(name, VAR_GLOBAL, 0); 525 if (v == NULL) 526 return 0; 527 if (!parent && (v->flags & VAR_EXPORTED) && !(v->flags & VAR_REEXPORT)) 528 return 0; /* nothing to do */ 529 val = Buf_GetAllZ(&v->val, NULL); 530 if (!(flags & VAR_EXPORT_LITERAL) && strchr(val, '$')) { 531 if (parent) { 532 /* 533 * Flag this as something we need to re-export. 534 * No point actually exporting it now though, 535 * the child can do it at the last minute. 536 */ 537 v->flags |= VAR_EXPORTED | VAR_REEXPORT; 538 return 1; 539 } 540 if (v->flags & VAR_IN_USE) { 541 /* 542 * We recursed while exporting in a child. 543 * This isn't going to end well, just skip it. 544 */ 545 return 0; 546 } 547 n = snprintf(tmp, sizeof(tmp), "${%s}", name); 548 if (n < (int)sizeof(tmp)) { 549 val = Var_Subst(tmp, VAR_GLOBAL, VARE_WANTRES); 550 setenv(name, val, 1); 551 free(val); 552 } 553 } else { 554 if (parent) 555 v->flags &= ~VAR_REEXPORT; /* once will do */ 556 if (parent || !(v->flags & VAR_EXPORTED)) 557 setenv(name, val, 1); 558 } 559 /* 560 * This is so Var_Set knows to call Var_Export again... 561 */ 562 if (parent) { 563 v->flags |= VAR_EXPORTED; 564 } 565 return 1; 566 } 567 568 static void 569 Var_ExportVars_callback(void *entry, void *unused MAKE_ATTR_UNUSED) 570 { 571 Var *var = entry; 572 Var_Export1(var->name, 0); 573 } 574 575 /* 576 * This gets called from our children. 577 */ 578 void 579 Var_ExportVars(void) 580 { 581 char tmp[BUFSIZ]; 582 char *val; 583 584 /* 585 * Several make's support this sort of mechanism for tracking 586 * recursion - but each uses a different name. 587 * We allow the makefiles to update MAKELEVEL and ensure 588 * children see a correctly incremented value. 589 */ 590 snprintf(tmp, sizeof(tmp), "%d", makelevel + 1); 591 setenv(MAKE_LEVEL_ENV, tmp, 1); 592 593 if (VAR_EXPORTED_NONE == var_exportedVars) 594 return; 595 596 if (VAR_EXPORTED_ALL == var_exportedVars) { 597 /* Ouch! This is crazy... */ 598 Hash_ForEach(&VAR_GLOBAL->context, Var_ExportVars_callback, NULL); 599 return; 600 } 601 602 val = Var_Subst("${" MAKE_EXPORTED ":O:u}", VAR_GLOBAL, VARE_WANTRES); 603 if (*val) { 604 char **av; 605 char *as; 606 int ac; 607 int i; 608 609 av = brk_string(val, &ac, FALSE, &as); 610 for (i = 0; i < ac; i++) 611 Var_Export1(av[i], 0); 612 free(as); 613 free(av); 614 } 615 free(val); 616 } 617 618 /* 619 * This is called when .export is seen or 620 * .MAKE.EXPORTED is modified. 621 * It is also called when any exported var is modified. 622 */ 623 void 624 Var_Export(char *str, int isExport) 625 { 626 char **av; 627 char *as; 628 VarExportFlags flags; 629 int ac; 630 int i; 631 632 if (isExport && (!str || !str[0])) { 633 var_exportedVars = VAR_EXPORTED_ALL; /* use with caution! */ 634 return; 635 } 636 637 flags = 0; 638 if (strncmp(str, "-env", 4) == 0) { 639 str += 4; 640 } else if (strncmp(str, "-literal", 8) == 0) { 641 str += 8; 642 flags |= VAR_EXPORT_LITERAL; 643 } else { 644 flags |= VAR_EXPORT_PARENT; 645 } 646 647 char *val = Var_Subst(str, VAR_GLOBAL, VARE_WANTRES); 648 if (*val) { 649 av = brk_string(val, &ac, FALSE, &as); 650 for (i = 0; i < ac; i++) { 651 const char *name = av[i]; 652 if (!name[1]) { 653 /* 654 * A single char. 655 * If it is one of the vars that should only appear in 656 * local context, skip it, else we can get Var_Subst 657 * into a loop. 658 */ 659 switch (name[0]) { 660 case '@': 661 case '%': 662 case '*': 663 case '!': 664 continue; 665 } 666 } 667 if (Var_Export1(name, flags)) { 668 if (VAR_EXPORTED_ALL != var_exportedVars) 669 var_exportedVars = VAR_EXPORTED_YES; 670 if (isExport && (flags & VAR_EXPORT_PARENT)) { 671 Var_Append(MAKE_EXPORTED, name, VAR_GLOBAL); 672 } 673 } 674 } 675 free(as); 676 free(av); 677 } 678 free(val); 679 } 680 681 682 extern char **environ; 683 684 /* 685 * This is called when .unexport[-env] is seen. 686 * 687 * str must have the form "unexport[-env] varname...". 688 */ 689 void 690 Var_UnExport(char *str) 691 { 692 char tmp[BUFSIZ]; 693 char *vlist; 694 char *cp; 695 Boolean unexport_env; 696 int n; 697 698 vlist = NULL; 699 700 str += strlen("unexport"); 701 unexport_env = strncmp(str, "-env", 4) == 0; 702 if (unexport_env) { 703 char **newenv; 704 705 cp = getenv(MAKE_LEVEL_ENV); /* we should preserve this */ 706 if (environ == savedEnv) { 707 /* we have been here before! */ 708 newenv = bmake_realloc(environ, 2 * sizeof(char *)); 709 } else { 710 if (savedEnv) { 711 free(savedEnv); 712 savedEnv = NULL; 713 } 714 newenv = bmake_malloc(2 * sizeof(char *)); 715 } 716 if (!newenv) 717 return; 718 /* Note: we cannot safely free() the original environ. */ 719 environ = savedEnv = newenv; 720 newenv[0] = NULL; 721 newenv[1] = NULL; 722 if (cp && *cp) 723 setenv(MAKE_LEVEL_ENV, cp, 1); 724 } else { 725 for (; *str != '\n' && isspace((unsigned char) *str); str++) 726 continue; 727 if (str[0] && str[0] != '\n') { 728 vlist = str; 729 } 730 } 731 732 if (!vlist) { 733 /* Using .MAKE.EXPORTED */ 734 vlist = Var_Subst("${" MAKE_EXPORTED ":O:u}", VAR_GLOBAL, 735 VARE_WANTRES); 736 } 737 if (vlist) { 738 Var *v; 739 char **av; 740 char *as; 741 int ac; 742 int i; 743 744 av = brk_string(vlist, &ac, FALSE, &as); 745 for (i = 0; i < ac; i++) { 746 v = VarFind(av[i], VAR_GLOBAL, 0); 747 if (!v) 748 continue; 749 if (!unexport_env && 750 (v->flags & (VAR_EXPORTED | VAR_REEXPORT)) == VAR_EXPORTED) 751 unsetenv(v->name); 752 v->flags &= ~(VAR_EXPORTED | VAR_REEXPORT); 753 /* 754 * If we are unexporting a list, 755 * remove each one from .MAKE.EXPORTED. 756 * If we are removing them all, 757 * just delete .MAKE.EXPORTED below. 758 */ 759 if (vlist == str) { 760 n = snprintf(tmp, sizeof(tmp), 761 "${" MAKE_EXPORTED ":N%s}", v->name); 762 if (n < (int)sizeof(tmp)) { 763 cp = Var_Subst(tmp, VAR_GLOBAL, VARE_WANTRES); 764 Var_Set(MAKE_EXPORTED, cp, VAR_GLOBAL); 765 free(cp); 766 } 767 } 768 } 769 free(as); 770 free(av); 771 if (vlist != str) { 772 Var_Delete(MAKE_EXPORTED, VAR_GLOBAL); 773 free(vlist); 774 } 775 } 776 } 777 778 static void 779 Var_Set_with_flags(const char *name, const char *val, GNode *ctxt, 780 VarSet_Flags flags) 781 { 782 Var *v; 783 char *name_freeIt = NULL; 784 785 /* 786 * We only look for a variable in the given context since anything set 787 * here will override anything in a lower context, so there's not much 788 * point in searching them all just to save a bit of memory... 789 */ 790 if (strchr(name, '$') != NULL) { 791 const char *unexpanded_name = name; 792 name = name_freeIt = Var_Subst(name, ctxt, VARE_WANTRES); 793 if (name[0] == '\0') { 794 if (DEBUG(VAR)) { 795 fprintf(debug_file, "Var_Set(\"%s\", \"%s\", ...) " 796 "name expands to empty string - ignored\n", 797 unexpanded_name, val); 798 } 799 free(name_freeIt); 800 return; 801 } 802 } 803 if (ctxt == VAR_GLOBAL) { 804 v = VarFind(name, VAR_CMD, 0); 805 if (v != NULL) { 806 if (v->flags & VAR_FROM_CMD) { 807 if (DEBUG(VAR)) { 808 fprintf(debug_file, "%s:%s = %s ignored!\n", ctxt->name, name, val); 809 } 810 goto out; 811 } 812 VarFreeEnv(v, TRUE); 813 } 814 } 815 v = VarFind(name, ctxt, 0); 816 if (v == NULL) { 817 if (ctxt == VAR_CMD && !(flags & VAR_NO_EXPORT)) { 818 /* 819 * This var would normally prevent the same name being added 820 * to VAR_GLOBAL, so delete it from there if needed. 821 * Otherwise -V name may show the wrong value. 822 */ 823 Var_Delete(name, VAR_GLOBAL); 824 } 825 VarAdd(name, val, ctxt); 826 } else { 827 Buf_Empty(&v->val); 828 if (val) 829 Buf_AddStr(&v->val, val); 830 831 if (DEBUG(VAR)) { 832 fprintf(debug_file, "%s:%s = %s\n", ctxt->name, name, val); 833 } 834 if (v->flags & VAR_EXPORTED) { 835 Var_Export1(name, VAR_EXPORT_PARENT); 836 } 837 } 838 /* 839 * Any variables given on the command line are automatically exported 840 * to the environment (as per POSIX standard) 841 */ 842 if (ctxt == VAR_CMD && !(flags & VAR_NO_EXPORT)) { 843 if (v == NULL) { 844 /* we just added it */ 845 v = VarFind(name, ctxt, 0); 846 } 847 if (v != NULL) 848 v->flags |= VAR_FROM_CMD; 849 /* 850 * If requested, don't export these in the environment 851 * individually. We still put them in MAKEOVERRIDES so 852 * that the command-line settings continue to override 853 * Makefile settings. 854 */ 855 if (varNoExportEnv != TRUE) 856 setenv(name, val ? val : "", 1); 857 858 Var_Append(MAKEOVERRIDES, name, VAR_GLOBAL); 859 } 860 if (name[0] == '.' && strcmp(name, SAVE_DOLLARS) == 0) 861 save_dollars = s2Boolean(val, save_dollars); 862 863 out: 864 free(name_freeIt); 865 if (v != NULL) 866 VarFreeEnv(v, TRUE); 867 } 868 869 /*- 870 *----------------------------------------------------------------------- 871 * Var_Set -- 872 * Set the variable name to the value val in the given context. 873 * 874 * Input: 875 * name name of variable to set 876 * val value to give to the variable 877 * ctxt context in which to set it 878 * 879 * Side Effects: 880 * If the variable doesn't yet exist, a new record is created for it. 881 * Else the old value is freed and the new one stuck in its place 882 * 883 * Notes: 884 * The variable is searched for only in its context before being 885 * created in that context. I.e. if the context is VAR_GLOBAL, 886 * only VAR_GLOBAL->context is searched. Likewise if it is VAR_CMD, only 887 * VAR_CMD->context is searched. This is done to avoid the literally 888 * thousands of unnecessary strcmp's that used to be done to 889 * set, say, $(@) or $(<). 890 * If the context is VAR_GLOBAL though, we check if the variable 891 * was set in VAR_CMD from the command line and skip it if so. 892 *----------------------------------------------------------------------- 893 */ 894 void 895 Var_Set(const char *name, const char *val, GNode *ctxt) 896 { 897 Var_Set_with_flags(name, val, ctxt, 0); 898 } 899 900 /*- 901 *----------------------------------------------------------------------- 902 * Var_Append -- 903 * The variable of the given name has the given value appended to it in 904 * the given context. 905 * 906 * Input: 907 * name name of variable to modify 908 * val String to append to it 909 * ctxt Context in which this should occur 910 * 911 * Side Effects: 912 * If the variable doesn't exist, it is created. Else the strings 913 * are concatenated (with a space in between). 914 * 915 * Notes: 916 * Only if the variable is being sought in the global context is the 917 * environment searched. 918 * XXX: Knows its calling circumstances in that if called with ctxt 919 * an actual target, it will only search that context since only 920 * a local variable could be being appended to. This is actually 921 * a big win and must be tolerated. 922 *----------------------------------------------------------------------- 923 */ 924 void 925 Var_Append(const char *name, const char *val, GNode *ctxt) 926 { 927 Var *v; 928 Hash_Entry *h; 929 char *expanded_name = NULL; 930 931 if (strchr(name, '$') != NULL) { 932 expanded_name = Var_Subst(name, ctxt, VARE_WANTRES); 933 if (expanded_name[0] == '\0') { 934 if (DEBUG(VAR)) { 935 fprintf(debug_file, "Var_Append(\"%s\", \"%s\", ...) " 936 "name expands to empty string - ignored\n", 937 name, val); 938 } 939 free(expanded_name); 940 return; 941 } 942 name = expanded_name; 943 } 944 945 v = VarFind(name, ctxt, ctxt == VAR_GLOBAL ? (FIND_CMD | FIND_ENV) : 0); 946 947 if (v == NULL) { 948 Var_Set(name, val, ctxt); 949 } else if (ctxt == VAR_CMD || !(v->flags & VAR_FROM_CMD)) { 950 Buf_AddByte(&v->val, ' '); 951 Buf_AddStr(&v->val, val); 952 953 if (DEBUG(VAR)) { 954 fprintf(debug_file, "%s:%s = %s\n", ctxt->name, name, 955 Buf_GetAllZ(&v->val, NULL)); 956 } 957 958 if (v->flags & VAR_FROM_ENV) { 959 /* 960 * If the original variable came from the environment, we 961 * have to install it in the global context (we could place 962 * it in the environment, but then we should provide a way to 963 * export other variables...) 964 */ 965 v->flags &= ~VAR_FROM_ENV; 966 h = Hash_CreateEntry(&ctxt->context, name, NULL); 967 Hash_SetValue(h, v); 968 } 969 } 970 free(expanded_name); 971 } 972 973 /*- 974 *----------------------------------------------------------------------- 975 * Var_Exists -- 976 * See if the given variable exists. 977 * 978 * Input: 979 * name Variable to find 980 * ctxt Context in which to start search 981 * 982 * Results: 983 * TRUE if it does, FALSE if it doesn't 984 * 985 * Side Effects: 986 * None. 987 * 988 *----------------------------------------------------------------------- 989 */ 990 Boolean 991 Var_Exists(const char *name, GNode *ctxt) 992 { 993 char *name_freeIt = NULL; 994 if (strchr(name, '$') != NULL) 995 name = name_freeIt = Var_Subst(name, ctxt, VARE_WANTRES); 996 997 Var *v = VarFind(name, ctxt, FIND_CMD | FIND_GLOBAL | FIND_ENV); 998 free(name_freeIt); 999 if (v == NULL) 1000 return FALSE; 1001 1002 (void)VarFreeEnv(v, TRUE); 1003 return TRUE; 1004 } 1005 1006 /*- 1007 *----------------------------------------------------------------------- 1008 * Var_Value -- 1009 * Return the unexpanded value of the given variable in the given 1010 * context, or the usual contexts. 1011 * 1012 * Input: 1013 * name name to find 1014 * ctxt context in which to search for it 1015 * 1016 * Results: 1017 * The value if the variable exists, NULL if it doesn't. 1018 * If the returned value is not NULL, the caller must free *freeIt 1019 * as soon as the returned value is no longer needed. 1020 *----------------------------------------------------------------------- 1021 */ 1022 const char * 1023 Var_Value(const char *name, GNode *ctxt, char **freeIt) 1024 { 1025 Var *v = VarFind(name, ctxt, FIND_ENV | FIND_GLOBAL | FIND_CMD); 1026 *freeIt = NULL; 1027 if (v == NULL) 1028 return NULL; 1029 1030 char *p = Buf_GetAllZ(&v->val, NULL); 1031 if (VarFreeEnv(v, FALSE)) 1032 *freeIt = p; 1033 return p; 1034 } 1035 1036 1037 /* SepBuf is a string being built from "words", interleaved with separators. */ 1038 typedef struct { 1039 Buffer buf; 1040 Boolean needSep; 1041 char sep; 1042 } SepBuf; 1043 1044 static void 1045 SepBuf_Init(SepBuf *buf, char sep) 1046 { 1047 Buf_InitZ(&buf->buf, 32 /* bytes */); 1048 buf->needSep = FALSE; 1049 buf->sep = sep; 1050 } 1051 1052 static void 1053 SepBuf_Sep(SepBuf *buf) 1054 { 1055 buf->needSep = TRUE; 1056 } 1057 1058 static void 1059 SepBuf_AddBytes(SepBuf *buf, const char *mem, size_t mem_size) 1060 { 1061 if (mem_size == 0) 1062 return; 1063 if (buf->needSep && buf->sep != '\0') { 1064 Buf_AddByte(&buf->buf, buf->sep); 1065 buf->needSep = FALSE; 1066 } 1067 Buf_AddBytesZ(&buf->buf, mem, mem_size); 1068 } 1069 1070 static void 1071 SepBuf_AddBytesBetween(SepBuf *buf, const char *start, const char *end) 1072 { 1073 SepBuf_AddBytes(buf, start, (size_t)(end - start)); 1074 } 1075 1076 static void 1077 SepBuf_AddStr(SepBuf *buf, const char *str) 1078 { 1079 SepBuf_AddBytes(buf, str, strlen(str)); 1080 } 1081 1082 static char * 1083 SepBuf_Destroy(SepBuf *buf, Boolean free_buf) 1084 { 1085 return Buf_Destroy(&buf->buf, free_buf); 1086 } 1087 1088 1089 /* This callback for ModifyWords gets a single word from an expression and 1090 * typically adds a modification of this word to the buffer. It may also do 1091 * nothing or add several words. */ 1092 typedef void (*ModifyWordsCallback)(const char *word, SepBuf *buf, void *data); 1093 1094 1095 /* Callback for ModifyWords to implement the :H modifier. 1096 * Add the dirname of the given word to the buffer. */ 1097 static void 1098 ModifyWord_Head(const char *word, SepBuf *buf, void *dummy MAKE_ATTR_UNUSED) 1099 { 1100 const char *slash = strrchr(word, '/'); 1101 if (slash != NULL) 1102 SepBuf_AddBytesBetween(buf, word, slash); 1103 else 1104 SepBuf_AddStr(buf, "."); 1105 } 1106 1107 /* Callback for ModifyWords to implement the :T modifier. 1108 * Add the basename of the given word to the buffer. */ 1109 static void 1110 ModifyWord_Tail(const char *word, SepBuf *buf, void *dummy MAKE_ATTR_UNUSED) 1111 { 1112 const char *slash = strrchr(word, '/'); 1113 const char *base = slash != NULL ? slash + 1 : word; 1114 SepBuf_AddStr(buf, base); 1115 } 1116 1117 /* Callback for ModifyWords to implement the :E modifier. 1118 * Add the filename suffix of the given word to the buffer, if it exists. */ 1119 static void 1120 ModifyWord_Suffix(const char *word, SepBuf *buf, void *dummy MAKE_ATTR_UNUSED) 1121 { 1122 const char *dot = strrchr(word, '.'); 1123 if (dot != NULL) 1124 SepBuf_AddStr(buf, dot + 1); 1125 } 1126 1127 /* Callback for ModifyWords to implement the :R modifier. 1128 * Add the basename of the given word to the buffer. */ 1129 static void 1130 ModifyWord_Root(const char *word, SepBuf *buf, void *dummy MAKE_ATTR_UNUSED) 1131 { 1132 const char *dot = strrchr(word, '.'); 1133 size_t len = dot != NULL ? (size_t)(dot - word) : strlen(word); 1134 SepBuf_AddBytes(buf, word, len); 1135 } 1136 1137 /* Callback for ModifyWords to implement the :M modifier. 1138 * Place the word in the buffer if it matches the given pattern. */ 1139 static void 1140 ModifyWord_Match(const char *word, SepBuf *buf, void *data) 1141 { 1142 const char *pattern = data; 1143 if (DEBUG(VAR)) 1144 fprintf(debug_file, "VarMatch [%s] [%s]\n", word, pattern); 1145 if (Str_Match(word, pattern)) 1146 SepBuf_AddStr(buf, word); 1147 } 1148 1149 /* Callback for ModifyWords to implement the :N modifier. 1150 * Place the word in the buffer if it doesn't match the given pattern. */ 1151 static void 1152 ModifyWord_NoMatch(const char *word, SepBuf *buf, void *data) 1153 { 1154 const char *pattern = data; 1155 if (!Str_Match(word, pattern)) 1156 SepBuf_AddStr(buf, word); 1157 } 1158 1159 #ifdef SYSVVARSUB 1160 /*- 1161 *----------------------------------------------------------------------- 1162 * Str_SYSVMatch -- 1163 * Check word against pattern for a match (% is wild), 1164 * 1165 * Input: 1166 * word Word to examine 1167 * pattern Pattern to examine against 1168 * 1169 * Results: 1170 * Returns the start of the match, or NULL. 1171 * *match_len returns the length of the match, if any. 1172 * *hasPercent returns whether the pattern contains a percent. 1173 *----------------------------------------------------------------------- 1174 */ 1175 static const char * 1176 Str_SYSVMatch(const char *word, const char *pattern, size_t *match_len, 1177 Boolean *hasPercent) 1178 { 1179 const char *p = pattern; 1180 const char *w = word; 1181 1182 *hasPercent = FALSE; 1183 if (*p == '\0') { /* ${VAR:=suffix} */ 1184 *match_len = strlen(w); /* Null pattern is the whole string */ 1185 return w; 1186 } 1187 1188 const char *percent = strchr(p, '%'); 1189 if (percent != NULL) { /* ${VAR:...%...=...} */ 1190 *hasPercent = TRUE; 1191 if (*w == '\0') 1192 return NULL; /* empty word does not match pattern */ 1193 1194 /* check that the prefix matches */ 1195 for (; p != percent && *w != '\0' && *w == *p; w++, p++) 1196 continue; 1197 if (p != percent) 1198 return NULL; /* No match */ 1199 1200 p++; /* Skip the percent */ 1201 if (*p == '\0') { 1202 /* No more pattern, return the rest of the string */ 1203 *match_len = strlen(w); 1204 return w; 1205 } 1206 } 1207 1208 /* Test whether the tail matches */ 1209 size_t w_len = strlen(w); 1210 size_t p_len = strlen(p); 1211 if (w_len < p_len) 1212 return NULL; 1213 1214 const char *w_tail = w + w_len - p_len; 1215 if (memcmp(p, w_tail, p_len) != 0) 1216 return NULL; 1217 1218 *match_len = w_tail - w; 1219 return w; 1220 } 1221 1222 typedef struct { 1223 GNode *ctx; 1224 const char *lhs; 1225 const char *rhs; 1226 } ModifyWord_SYSVSubstArgs; 1227 1228 /* Callback for ModifyWords to implement the :%.from=%.to modifier. */ 1229 static void 1230 ModifyWord_SYSVSubst(const char *word, SepBuf *buf, void *data) 1231 { 1232 const ModifyWord_SYSVSubstArgs *args = data; 1233 1234 size_t match_len; 1235 Boolean lhsPercent; 1236 const char *match = Str_SYSVMatch(word, args->lhs, &match_len, &lhsPercent); 1237 if (match == NULL) { 1238 SepBuf_AddStr(buf, word); 1239 return; 1240 } 1241 1242 /* Append rhs to the buffer, substituting the first '%' with the 1243 * match, but only if the lhs had a '%' as well. */ 1244 1245 char *rhs_expanded = Var_Subst(args->rhs, args->ctx, VARE_WANTRES); 1246 1247 const char *rhs = rhs_expanded; 1248 const char *percent = strchr(rhs, '%'); 1249 1250 if (percent != NULL && lhsPercent) { 1251 /* Copy the prefix of the replacement pattern */ 1252 SepBuf_AddBytesBetween(buf, rhs, percent); 1253 rhs = percent + 1; 1254 } 1255 if (percent != NULL || !lhsPercent) 1256 SepBuf_AddBytes(buf, match, match_len); 1257 1258 /* Append the suffix of the replacement pattern */ 1259 SepBuf_AddStr(buf, rhs); 1260 1261 free(rhs_expanded); 1262 } 1263 #endif 1264 1265 1266 typedef struct { 1267 const char *lhs; 1268 size_t lhsLen; 1269 const char *rhs; 1270 size_t rhsLen; 1271 VarPatternFlags pflags; 1272 } ModifyWord_SubstArgs; 1273 1274 /* Callback for ModifyWords to implement the :S,from,to, modifier. 1275 * Perform a string substitution on the given word. */ 1276 static void 1277 ModifyWord_Subst(const char *word, SepBuf *buf, void *data) 1278 { 1279 size_t wordLen = strlen(word); 1280 ModifyWord_SubstArgs *args = data; 1281 const VarPatternFlags pflags = args->pflags; 1282 1283 if ((pflags & VARP_SUB_ONE) && (pflags & VARP_SUB_MATCHED)) 1284 goto nosub; 1285 1286 if (args->pflags & VARP_ANCHOR_START) { 1287 if (wordLen < args->lhsLen || 1288 memcmp(word, args->lhs, args->lhsLen) != 0) 1289 goto nosub; 1290 1291 if (args->pflags & VARP_ANCHOR_END) { 1292 if (wordLen != args->lhsLen) 1293 goto nosub; 1294 1295 SepBuf_AddBytes(buf, args->rhs, args->rhsLen); 1296 args->pflags |= VARP_SUB_MATCHED; 1297 } else { 1298 SepBuf_AddBytes(buf, args->rhs, args->rhsLen); 1299 SepBuf_AddBytes(buf, word + args->lhsLen, wordLen - args->lhsLen); 1300 args->pflags |= VARP_SUB_MATCHED; 1301 } 1302 return; 1303 } 1304 1305 if (args->pflags & VARP_ANCHOR_END) { 1306 if (wordLen < args->lhsLen) 1307 goto nosub; 1308 1309 const char *start = word + (wordLen - args->lhsLen); 1310 if (memcmp(start, args->lhs, args->lhsLen) != 0) 1311 goto nosub; 1312 1313 SepBuf_AddBytesBetween(buf, word, start); 1314 SepBuf_AddBytes(buf, args->rhs, args->rhsLen); 1315 args->pflags |= VARP_SUB_MATCHED; 1316 return; 1317 } 1318 1319 /* unanchored */ 1320 const char *match; 1321 while ((match = Str_FindSubstring(word, args->lhs)) != NULL) { 1322 SepBuf_AddBytesBetween(buf, word, match); 1323 SepBuf_AddBytes(buf, args->rhs, args->rhsLen); 1324 args->pflags |= VARP_SUB_MATCHED; 1325 wordLen -= (match - word) + args->lhsLen; 1326 word += (match - word) + args->lhsLen; 1327 if (wordLen == 0 || !(args->pflags & VARP_SUB_GLOBAL)) 1328 break; 1329 } 1330 nosub: 1331 SepBuf_AddBytes(buf, word, wordLen); 1332 } 1333 1334 #ifndef NO_REGEX 1335 /*- 1336 *----------------------------------------------------------------------- 1337 * VarREError -- 1338 * Print the error caused by a regcomp or regexec call. 1339 * 1340 * Side Effects: 1341 * An error gets printed. 1342 * 1343 *----------------------------------------------------------------------- 1344 */ 1345 static void 1346 VarREError(int reerr, regex_t *pat, const char *str) 1347 { 1348 char *errbuf; 1349 int errlen; 1350 1351 errlen = regerror(reerr, pat, 0, 0); 1352 errbuf = bmake_malloc(errlen); 1353 regerror(reerr, pat, errbuf, errlen); 1354 Error("%s: %s", str, errbuf); 1355 free(errbuf); 1356 } 1357 1358 typedef struct { 1359 regex_t re; 1360 int nsub; 1361 char *replace; 1362 VarPatternFlags pflags; 1363 } ModifyWord_SubstRegexArgs; 1364 1365 /* Callback for ModifyWords to implement the :C/from/to/ modifier. 1366 * Perform a regex substitution on the given word. */ 1367 static void 1368 ModifyWord_SubstRegex(const char *word, SepBuf *buf, void *data) 1369 { 1370 ModifyWord_SubstRegexArgs *args = data; 1371 int xrv; 1372 const char *wp = word; 1373 char *rp; 1374 int flags = 0; 1375 regmatch_t m[10]; 1376 1377 if ((args->pflags & VARP_SUB_ONE) && (args->pflags & VARP_SUB_MATCHED)) 1378 goto nosub; 1379 1380 tryagain: 1381 xrv = regexec(&args->re, wp, args->nsub, m, flags); 1382 1383 switch (xrv) { 1384 case 0: 1385 args->pflags |= VARP_SUB_MATCHED; 1386 SepBuf_AddBytes(buf, wp, m[0].rm_so); 1387 1388 for (rp = args->replace; *rp; rp++) { 1389 if (*rp == '\\' && (rp[1] == '&' || rp[1] == '\\')) { 1390 SepBuf_AddBytes(buf, rp + 1, 1); 1391 rp++; 1392 } else if (*rp == '&' || 1393 (*rp == '\\' && isdigit((unsigned char)rp[1]))) { 1394 int n; 1395 char errstr[3]; 1396 1397 if (*rp == '&') { 1398 n = 0; 1399 errstr[0] = '&'; 1400 errstr[1] = '\0'; 1401 } else { 1402 n = rp[1] - '0'; 1403 errstr[0] = '\\'; 1404 errstr[1] = rp[1]; 1405 errstr[2] = '\0'; 1406 rp++; 1407 } 1408 1409 if (n >= args->nsub) { 1410 Error("No subexpression %s", errstr); 1411 } else if (m[n].rm_so == -1 && m[n].rm_eo == -1) { 1412 Error("No match for subexpression %s", errstr); 1413 } else { 1414 SepBuf_AddBytesBetween(buf, wp + m[n].rm_so, 1415 wp + m[n].rm_eo); 1416 } 1417 1418 } else { 1419 SepBuf_AddBytes(buf, rp, 1); 1420 } 1421 } 1422 wp += m[0].rm_eo; 1423 if (args->pflags & VARP_SUB_GLOBAL) { 1424 flags |= REG_NOTBOL; 1425 if (m[0].rm_so == 0 && m[0].rm_eo == 0) { 1426 SepBuf_AddBytes(buf, wp, 1); 1427 wp++; 1428 } 1429 if (*wp) 1430 goto tryagain; 1431 } 1432 if (*wp) { 1433 SepBuf_AddStr(buf, wp); 1434 } 1435 break; 1436 default: 1437 VarREError(xrv, &args->re, "Unexpected regex error"); 1438 /* fall through */ 1439 case REG_NOMATCH: 1440 nosub: 1441 SepBuf_AddStr(buf, wp); 1442 break; 1443 } 1444 } 1445 #endif 1446 1447 1448 typedef struct { 1449 GNode *ctx; 1450 char *tvar; /* name of temporary variable */ 1451 char *str; /* string to expand */ 1452 VarEvalFlags eflags; 1453 } ModifyWord_LoopArgs; 1454 1455 /* Callback for ModifyWords to implement the :@var (at) ...@ modifier of ODE make. */ 1456 static void 1457 ModifyWord_Loop(const char *word, SepBuf *buf, void *data) 1458 { 1459 if (word[0] == '\0') 1460 return; 1461 1462 const ModifyWord_LoopArgs *args = data; 1463 Var_Set_with_flags(args->tvar, word, args->ctx, VAR_NO_EXPORT); 1464 char *s = Var_Subst(args->str, args->ctx, args->eflags); 1465 if (DEBUG(VAR)) { 1466 fprintf(debug_file, 1467 "ModifyWord_Loop: in \"%s\", replace \"%s\" with \"%s\" " 1468 "to \"%s\"\n", 1469 word, args->tvar, args->str, s ? s : "(null)"); 1470 } 1471 1472 if (s != NULL && s[0] != '\0') { 1473 if (s[0] == '\n' || (buf->buf.count > 0 && 1474 buf->buf.buffer[buf->buf.count - 1] == '\n')) 1475 buf->needSep = FALSE; 1476 SepBuf_AddStr(buf, s); 1477 } 1478 free(s); 1479 } 1480 1481 1482 /*- 1483 * Implements the :[first..last] modifier. 1484 * This is a special case of ModifyWords since we want to be able 1485 * to scan the list backwards if first > last. 1486 */ 1487 static char * 1488 VarSelectWords(Byte sep, Boolean oneBigWord, const char *str, int first, 1489 int last) 1490 { 1491 SepBuf buf; 1492 char **av; /* word list */ 1493 char *as; /* word list memory */ 1494 int ac, i; 1495 int start, end, step; 1496 1497 SepBuf_Init(&buf, sep); 1498 1499 if (oneBigWord) { 1500 /* fake what brk_string() would do if there were only one word */ 1501 ac = 1; 1502 av = bmake_malloc((ac + 1) * sizeof(char *)); 1503 as = bmake_strdup(str); 1504 av[0] = as; 1505 av[1] = NULL; 1506 } else { 1507 av = brk_string(str, &ac, FALSE, &as); 1508 } 1509 1510 /* 1511 * Now sanitize seldata. 1512 * If seldata->start or seldata->end are negative, convert them to 1513 * the positive equivalents (-1 gets converted to argc, -2 gets 1514 * converted to (argc-1), etc.). 1515 */ 1516 if (first < 0) 1517 first += ac + 1; 1518 if (last < 0) 1519 last += ac + 1; 1520 1521 /* 1522 * We avoid scanning more of the list than we need to. 1523 */ 1524 if (first > last) { 1525 start = MIN(ac, first) - 1; 1526 end = MAX(0, last - 1); 1527 step = -1; 1528 } else { 1529 start = MAX(0, first - 1); 1530 end = MIN(ac, last); 1531 step = 1; 1532 } 1533 1534 for (i = start; (step < 0) == (i >= end); i += step) { 1535 SepBuf_AddStr(&buf, av[i]); 1536 SepBuf_Sep(&buf); 1537 } 1538 1539 free(as); 1540 free(av); 1541 1542 return SepBuf_Destroy(&buf, FALSE); 1543 } 1544 1545 1546 /* Callback for ModifyWords to implement the :tA modifier. 1547 * Replace each word with the result of realpath() if successful. */ 1548 static void 1549 ModifyWord_Realpath(const char *word, SepBuf *buf, void *data MAKE_ATTR_UNUSED) 1550 { 1551 struct stat st; 1552 char rbuf[MAXPATHLEN]; 1553 1554 const char *rp = cached_realpath(word, rbuf); 1555 if (rp != NULL && *rp == '/' && stat(rp, &st) == 0) 1556 word = rp; 1557 1558 SepBuf_AddStr(buf, word); 1559 } 1560 1561 /*- 1562 *----------------------------------------------------------------------- 1563 * Modify each of the words of the passed string using the given function. 1564 * 1565 * Input: 1566 * str String whose words should be modified 1567 * modifyWord Function that modifies a single word 1568 * data Custom data for modifyWord 1569 * 1570 * Results: 1571 * A string of all the words modified appropriately. 1572 *----------------------------------------------------------------------- 1573 */ 1574 static char * 1575 ModifyWords(GNode *ctx, Byte sep, Boolean oneBigWord, 1576 const char *str, ModifyWordsCallback modifyWord, void *data) 1577 { 1578 if (oneBigWord) { 1579 SepBuf result; 1580 SepBuf_Init(&result, sep); 1581 modifyWord(str, &result, data); 1582 return SepBuf_Destroy(&result, FALSE); 1583 } 1584 1585 SepBuf result; 1586 char **av; /* word list */ 1587 char *as; /* word list memory */ 1588 int ac, i; 1589 1590 SepBuf_Init(&result, sep); 1591 1592 av = brk_string(str, &ac, FALSE, &as); 1593 1594 if (DEBUG(VAR)) { 1595 fprintf(debug_file, "ModifyWords: split \"%s\" into %d words\n", 1596 str, ac); 1597 } 1598 1599 for (i = 0; i < ac; i++) { 1600 modifyWord(av[i], &result, data); 1601 if (result.buf.count > 0) 1602 SepBuf_Sep(&result); 1603 } 1604 1605 free(as); 1606 free(av); 1607 1608 return SepBuf_Destroy(&result, FALSE); 1609 } 1610 1611 1612 static int 1613 VarWordCompare(const void *a, const void *b) 1614 { 1615 int r = strcmp(*(const char * const *)a, *(const char * const *)b); 1616 return r; 1617 } 1618 1619 static int 1620 VarWordCompareReverse(const void *a, const void *b) 1621 { 1622 int r = strcmp(*(const char * const *)b, *(const char * const *)a); 1623 return r; 1624 } 1625 1626 /*- 1627 *----------------------------------------------------------------------- 1628 * VarOrder -- 1629 * Order the words in the string. 1630 * 1631 * Input: 1632 * str String whose words should be sorted. 1633 * otype How to order: s - sort, r - reverse, x - random. 1634 * 1635 * Results: 1636 * A string containing the words ordered. 1637 * 1638 * Side Effects: 1639 * None. 1640 * 1641 *----------------------------------------------------------------------- 1642 */ 1643 static char * 1644 VarOrder(const char *str, const char otype) 1645 { 1646 Buffer buf; /* Buffer for the new string */ 1647 char **av; /* word list */ 1648 char *as; /* word list memory */ 1649 int ac, i; 1650 1651 Buf_InitZ(&buf, 0); 1652 1653 av = brk_string(str, &ac, FALSE, &as); 1654 1655 if (ac > 0) { 1656 switch (otype) { 1657 case 'r': /* reverse sort alphabetically */ 1658 qsort(av, ac, sizeof(char *), VarWordCompareReverse); 1659 break; 1660 case 's': /* sort alphabetically */ 1661 qsort(av, ac, sizeof(char *), VarWordCompare); 1662 break; 1663 case 'x': /* randomize */ 1664 /* 1665 * We will use [ac..2] range for mod factors. This will produce 1666 * random numbers in [(ac-1)..0] interval, and minimal 1667 * reasonable value for mod factor is 2 (the mod 1 will produce 1668 * 0 with probability 1). 1669 */ 1670 for (i = ac - 1; i > 0; i--) { 1671 int rndidx = random() % (i + 1); 1672 char *t = av[i]; 1673 av[i] = av[rndidx]; 1674 av[rndidx] = t; 1675 } 1676 } 1677 } 1678 1679 for (i = 0; i < ac; i++) { 1680 if (i != 0) 1681 Buf_AddByte(&buf, ' '); 1682 Buf_AddStr(&buf, av[i]); 1683 } 1684 1685 free(as); 1686 free(av); 1687 1688 return Buf_Destroy(&buf, FALSE); 1689 } 1690 1691 1692 /* Remove adjacent duplicate words. */ 1693 static char * 1694 VarUniq(const char *str) 1695 { 1696 Buffer buf; /* Buffer for new string */ 1697 char **av; /* List of words to affect */ 1698 char *as; /* Word list memory */ 1699 int ac, i, j; 1700 1701 Buf_InitZ(&buf, 0); 1702 av = brk_string(str, &ac, FALSE, &as); 1703 1704 if (ac > 1) { 1705 for (j = 0, i = 1; i < ac; i++) 1706 if (strcmp(av[i], av[j]) != 0 && (++j != i)) 1707 av[j] = av[i]; 1708 ac = j + 1; 1709 } 1710 1711 for (i = 0; i < ac; i++) { 1712 if (i != 0) 1713 Buf_AddByte(&buf, ' '); 1714 Buf_AddStr(&buf, av[i]); 1715 } 1716 1717 free(as); 1718 free(av); 1719 1720 return Buf_Destroy(&buf, FALSE); 1721 } 1722 1723 1724 /*- 1725 * Parse a text part of a modifier such as the "from" and "to" in :S/from/to/ 1726 * or the :@ modifier, until the next unescaped delimiter. The delimiter, as 1727 * well as the backslash or the dollar, can be escaped with a backslash. 1728 * 1729 * Return the parsed (and possibly expanded) string, or NULL if no delimiter 1730 * was found. 1731 */ 1732 static char * 1733 ParseModifierPart( 1734 const char **pp, /* The parsing position, updated upon return */ 1735 int delim, /* Parsing stops at this delimiter */ 1736 VarEvalFlags eflags, /* Flags for evaluating nested variables; 1737 * if VARE_WANTRES is not set, the text is 1738 * only parsed */ 1739 GNode *ctxt, /* For looking up nested variables */ 1740 size_t *out_length, /* Optionally stores the length of the returned 1741 * string, just to save another strlen call. */ 1742 VarPatternFlags *out_pflags,/* For the first part of the :S modifier, 1743 * sets the VARP_ANCHOR_END flag if the last 1744 * character of the pattern is a $. */ 1745 ModifyWord_SubstArgs *subst /* For the second part of the :S modifier, 1746 * allow ampersands to be escaped and replace 1747 * unescaped ampersands with subst->lhs. */ 1748 ) { 1749 char *rstr; 1750 Buffer buf; 1751 VarEvalFlags errnum = eflags & VARE_UNDEFERR; 1752 1753 Buf_InitZ(&buf, 0); 1754 1755 /* 1756 * Skim through until the matching delimiter is found; 1757 * pick up variable substitutions on the way. Also allow 1758 * backslashes to quote the delimiter, $, and \, but don't 1759 * touch other backslashes. 1760 */ 1761 const char *p = *pp; 1762 while (*p != '\0' && *p != delim) { 1763 Boolean is_escaped = p[0] == '\\' && ( 1764 p[1] == delim || p[1] == '\\' || p[1] == '$' || 1765 (p[1] == '&' && subst != NULL)); 1766 if (is_escaped) { 1767 Buf_AddByte(&buf, p[1]); 1768 p += 2; 1769 continue; 1770 } 1771 1772 if (*p != '$') { /* Unescaped, simple text */ 1773 if (subst != NULL && *p == '&') 1774 Buf_AddBytesZ(&buf, subst->lhs, subst->lhsLen); 1775 else 1776 Buf_AddByte(&buf, *p); 1777 p++; 1778 continue; 1779 } 1780 1781 if (p[1] == delim) { /* Unescaped $ at end of pattern */ 1782 if (out_pflags != NULL) 1783 *out_pflags |= VARP_ANCHOR_END; 1784 else 1785 Buf_AddByte(&buf, *p); 1786 p++; 1787 continue; 1788 } 1789 1790 if (eflags & VARE_WANTRES) { /* Nested variable, evaluated */ 1791 const char *cp2; 1792 int len; 1793 void *freeIt; 1794 1795 cp2 = Var_Parse(p, ctxt, errnum | (eflags & VARE_WANTRES), 1796 &len, &freeIt); 1797 Buf_AddStr(&buf, cp2); 1798 free(freeIt); 1799 p += len; 1800 continue; 1801 } 1802 1803 const char *varstart = p; /* Nested variable, only parsed */ 1804 if (p[1] == PROPEN || p[1] == BROPEN) { 1805 /* 1806 * Find the end of this variable reference 1807 * and suck it in without further ado. 1808 * It will be interpreted later. 1809 */ 1810 int have = p[1]; 1811 int want = have == PROPEN ? PRCLOSE : BRCLOSE; 1812 int depth = 1; 1813 1814 for (p += 2; *p != '\0' && depth > 0; ++p) { 1815 if (p[-1] != '\\') { 1816 if (*p == have) 1817 ++depth; 1818 if (*p == want) 1819 --depth; 1820 } 1821 } 1822 Buf_AddBytesBetween(&buf, varstart, p); 1823 } else { 1824 Buf_AddByte(&buf, *varstart); 1825 p++; 1826 } 1827 } 1828 1829 if (*p != delim) { 1830 *pp = p; 1831 return NULL; 1832 } 1833 1834 *pp = ++p; 1835 if (out_length != NULL) 1836 *out_length = Buf_Size(&buf); 1837 rstr = Buf_Destroy(&buf, FALSE); 1838 if (DEBUG(VAR)) 1839 fprintf(debug_file, "Modifier part: \"%s\"\n", rstr); 1840 return rstr; 1841 } 1842 1843 /*- 1844 *----------------------------------------------------------------------- 1845 * VarQuote -- 1846 * Quote shell meta-characters and space characters in the string 1847 * if quoteDollar is set, also quote and double any '$' characters. 1848 * 1849 * Results: 1850 * The quoted string 1851 * 1852 * Side Effects: 1853 * None. 1854 * 1855 *----------------------------------------------------------------------- 1856 */ 1857 static char * 1858 VarQuote(char *str, Boolean quoteDollar) 1859 { 1860 Buffer buf; 1861 Buf_InitZ(&buf, 0); 1862 1863 for (; *str != '\0'; str++) { 1864 if (*str == '\n') { 1865 const char *newline = Shell_GetNewline(); 1866 if (newline == NULL) 1867 newline = "\\\n"; 1868 Buf_AddStr(&buf, newline); 1869 continue; 1870 } 1871 if (isspace((unsigned char)*str) || ismeta((unsigned char)*str)) 1872 Buf_AddByte(&buf, '\\'); 1873 Buf_AddByte(&buf, *str); 1874 if (quoteDollar && *str == '$') 1875 Buf_AddStr(&buf, "\\$"); 1876 } 1877 1878 str = Buf_Destroy(&buf, FALSE); 1879 if (DEBUG(VAR)) 1880 fprintf(debug_file, "QuoteMeta: [%s]\n", str); 1881 return str; 1882 } 1883 1884 /*- 1885 *----------------------------------------------------------------------- 1886 * VarHash -- 1887 * Hash the string using the MurmurHash3 algorithm. 1888 * Output is computed using 32bit Little Endian arithmetic. 1889 * 1890 * Input: 1891 * str String to modify 1892 * 1893 * Results: 1894 * Hash value of str, encoded as 8 hex digits. 1895 * 1896 * Side Effects: 1897 * None. 1898 * 1899 *----------------------------------------------------------------------- 1900 */ 1901 static char * 1902 VarHash(const char *str) 1903 { 1904 static const char hexdigits[16] = "0123456789abcdef"; 1905 Buffer buf; 1906 size_t len, len2; 1907 const unsigned char *ustr = (const unsigned char *)str; 1908 uint32_t h, k, c1, c2; 1909 1910 h = 0x971e137bU; 1911 c1 = 0x95543787U; 1912 c2 = 0x2ad7eb25U; 1913 len2 = strlen(str); 1914 1915 for (len = len2; len; ) { 1916 k = 0; 1917 switch (len) { 1918 default: 1919 k = ((uint32_t)ustr[3] << 24) | 1920 ((uint32_t)ustr[2] << 16) | 1921 ((uint32_t)ustr[1] << 8) | 1922 (uint32_t)ustr[0]; 1923 len -= 4; 1924 ustr += 4; 1925 break; 1926 case 3: 1927 k |= (uint32_t)ustr[2] << 16; 1928 /* FALLTHROUGH */ 1929 case 2: 1930 k |= (uint32_t)ustr[1] << 8; 1931 /* FALLTHROUGH */ 1932 case 1: 1933 k |= (uint32_t)ustr[0]; 1934 len = 0; 1935 } 1936 c1 = c1 * 5 + 0x7b7d159cU; 1937 c2 = c2 * 5 + 0x6bce6396U; 1938 k *= c1; 1939 k = (k << 11) ^ (k >> 21); 1940 k *= c2; 1941 h = (h << 13) ^ (h >> 19); 1942 h = h * 5 + 0x52dce729U; 1943 h ^= k; 1944 } 1945 h ^= len2; 1946 h *= 0x85ebca6b; 1947 h ^= h >> 13; 1948 h *= 0xc2b2ae35; 1949 h ^= h >> 16; 1950 1951 Buf_InitZ(&buf, 0); 1952 for (len = 0; len < 8; ++len) { 1953 Buf_AddByte(&buf, hexdigits[h & 15]); 1954 h >>= 4; 1955 } 1956 1957 return Buf_Destroy(&buf, FALSE); 1958 } 1959 1960 static char * 1961 VarStrftime(const char *fmt, int zulu, time_t utc) 1962 { 1963 char buf[BUFSIZ]; 1964 1965 if (!utc) 1966 time(&utc); 1967 if (!*fmt) 1968 fmt = "%c"; 1969 strftime(buf, sizeof(buf), fmt, zulu ? gmtime(&utc) : localtime(&utc)); 1970 1971 buf[sizeof(buf) - 1] = '\0'; 1972 return bmake_strdup(buf); 1973 } 1974 1975 /* The ApplyModifier functions all work in the same way. 1976 * They parse the modifier (often until the next colon) and store the 1977 * updated position for the parser into st->next 1978 * (except when returning AMR_UNKNOWN). 1979 * They take the st->val and generate st->newVal from it. 1980 * On failure, many of them update st->missing_delim. 1981 */ 1982 typedef struct { 1983 const int startc; /* '\0' or '{' or '(' */ 1984 const int endc; 1985 Var * const v; 1986 GNode * const ctxt; 1987 const VarEvalFlags eflags; 1988 1989 char *val; /* The value of the expression before the 1990 * modifier is applied */ 1991 char *newVal; /* The new value after applying the modifier 1992 * to the expression */ 1993 const char *next; /* The position where parsing continues 1994 * after the current modifier. */ 1995 char missing_delim; /* For error reporting */ 1996 1997 Byte sep; /* Word separator in expansions */ 1998 Boolean oneBigWord; /* TRUE if we will treat the variable as a 1999 * single big word, even if it contains 2000 * embedded spaces (as opposed to the 2001 * usual behaviour of treating it as 2002 * several space-separated words). */ 2003 2004 } ApplyModifiersState; 2005 2006 typedef enum { 2007 AMR_OK, /* Continue parsing */ 2008 AMR_UNKNOWN, /* Not a match, try others as well */ 2009 AMR_BAD, /* Error out with message */ 2010 AMR_CLEANUP /* Error out with "missing delimiter", 2011 * if st->missing_delim is set. */ 2012 } ApplyModifierResult; 2013 2014 /* we now have some modifiers with long names */ 2015 static Boolean 2016 ModMatch(const char *mod, const char *modname, char endc) 2017 { 2018 size_t n = strlen(modname); 2019 return strncmp(mod, modname, n) == 0 && 2020 (mod[n] == endc || mod[n] == ':'); 2021 } 2022 2023 static inline Boolean 2024 ModMatchEq(const char *mod, const char *modname, char endc) 2025 { 2026 size_t n = strlen(modname); 2027 return strncmp(mod, modname, n) == 0 && 2028 (mod[n] == endc || mod[n] == ':' || mod[n] == '='); 2029 } 2030 2031 /* :@var (at) ...${var}...@ */ 2032 static ApplyModifierResult 2033 ApplyModifier_Loop(const char *mod, ApplyModifiersState *st) { 2034 ModifyWord_LoopArgs args; 2035 2036 args.ctx = st->ctxt; 2037 st->next = mod + 1; 2038 char delim = '@'; 2039 args.tvar = ParseModifierPart(&st->next, delim, st->eflags & ~VARE_WANTRES, 2040 st->ctxt, NULL, NULL, NULL); 2041 if (args.tvar == NULL) { 2042 st->missing_delim = delim; 2043 return AMR_CLEANUP; 2044 } 2045 2046 args.str = ParseModifierPart(&st->next, delim, st->eflags & ~VARE_WANTRES, 2047 st->ctxt, NULL, NULL, NULL); 2048 if (args.str == NULL) { 2049 st->missing_delim = delim; 2050 return AMR_CLEANUP; 2051 } 2052 2053 args.eflags = st->eflags & (VARE_UNDEFERR | VARE_WANTRES); 2054 int prev_sep = st->sep; 2055 st->sep = ' '; /* XXX: this is inconsistent */ 2056 st->newVal = ModifyWords(st->ctxt, st->sep, st->oneBigWord, st->val, 2057 ModifyWord_Loop, &args); 2058 st->sep = prev_sep; 2059 Var_Delete(args.tvar, st->ctxt); 2060 free(args.tvar); 2061 free(args.str); 2062 return AMR_OK; 2063 } 2064 2065 /* :Ddefined or :Uundefined */ 2066 static ApplyModifierResult 2067 ApplyModifier_Defined(const char *mod, ApplyModifiersState *st) 2068 { 2069 Buffer buf; /* Buffer for patterns */ 2070 VarEvalFlags neflags; 2071 2072 if (st->eflags & VARE_WANTRES) { 2073 Boolean wantres; 2074 if (*mod == 'U') 2075 wantres = (st->v->flags & VAR_JUNK) != 0; 2076 else 2077 wantres = (st->v->flags & VAR_JUNK) == 0; 2078 neflags = st->eflags & ~VARE_WANTRES; 2079 if (wantres) 2080 neflags |= VARE_WANTRES; 2081 } else 2082 neflags = st->eflags; 2083 2084 /* 2085 * Pass through mod looking for 1) escaped delimiters, 2086 * '$'s and backslashes (place the escaped character in 2087 * uninterpreted) and 2) unescaped $'s that aren't before 2088 * the delimiter (expand the variable substitution). 2089 * The result is left in the Buffer buf. 2090 */ 2091 Buf_InitZ(&buf, 0); 2092 const char *p = mod + 1; 2093 while (*p != st->endc && *p != ':' && *p != '\0') { 2094 if (*p == '\\' && 2095 (p[1] == ':' || p[1] == '$' || p[1] == st->endc || p[1] == '\\')) { 2096 Buf_AddByte(&buf, p[1]); 2097 p += 2; 2098 } else if (*p == '$') { 2099 /* 2100 * If unescaped dollar sign, assume it's a 2101 * variable substitution and recurse. 2102 */ 2103 const char *cp2; 2104 int len; 2105 void *freeIt; 2106 2107 cp2 = Var_Parse(p, st->ctxt, neflags, &len, &freeIt); 2108 Buf_AddStr(&buf, cp2); 2109 free(freeIt); 2110 p += len; 2111 } else { 2112 Buf_AddByte(&buf, *p); 2113 p++; 2114 } 2115 } 2116 2117 st->next = p; 2118 2119 if (st->v->flags & VAR_JUNK) 2120 st->v->flags |= VAR_KEEP; 2121 if (neflags & VARE_WANTRES) { 2122 st->newVal = Buf_Destroy(&buf, FALSE); 2123 } else { 2124 st->newVal = st->val; 2125 Buf_Destroy(&buf, TRUE); 2126 } 2127 return AMR_OK; 2128 } 2129 2130 /* :gmtime */ 2131 static ApplyModifierResult 2132 ApplyModifier_Gmtime(const char *mod, ApplyModifiersState *st) 2133 { 2134 if (!ModMatchEq(mod, "gmtime", st->endc)) 2135 return AMR_UNKNOWN; 2136 2137 time_t utc; 2138 if (mod[6] == '=') { 2139 char *ep; 2140 utc = strtoul(mod + 7, &ep, 10); 2141 st->next = ep; 2142 } else { 2143 utc = 0; 2144 st->next = mod + 6; 2145 } 2146 st->newVal = VarStrftime(st->val, 1, utc); 2147 return AMR_OK; 2148 } 2149 2150 /* :localtime */ 2151 static Boolean 2152 ApplyModifier_Localtime(const char *mod, ApplyModifiersState *st) 2153 { 2154 if (!ModMatchEq(mod, "localtime", st->endc)) 2155 return AMR_UNKNOWN; 2156 2157 time_t utc; 2158 if (mod[9] == '=') { 2159 char *ep; 2160 utc = strtoul(mod + 10, &ep, 10); 2161 st->next = ep; 2162 } else { 2163 utc = 0; 2164 st->next = mod + 9; 2165 } 2166 st->newVal = VarStrftime(st->val, 0, utc); 2167 return AMR_OK; 2168 } 2169 2170 /* :hash */ 2171 static ApplyModifierResult 2172 ApplyModifier_Hash(const char *mod, ApplyModifiersState *st) 2173 { 2174 if (!ModMatch(mod, "hash", st->endc)) 2175 return AMR_UNKNOWN; 2176 2177 st->newVal = VarHash(st->val); 2178 st->next = mod + 4; 2179 return AMR_OK; 2180 } 2181 2182 /* :P */ 2183 static ApplyModifierResult 2184 ApplyModifier_Path(const char *mod, ApplyModifiersState *st) 2185 { 2186 if (st->v->flags & VAR_JUNK) 2187 st->v->flags |= VAR_KEEP; 2188 GNode *gn = Targ_FindNode(st->v->name, TARG_NOCREATE); 2189 if (gn == NULL || gn->type & OP_NOPATH) { 2190 st->newVal = NULL; 2191 } else if (gn->path) { 2192 st->newVal = bmake_strdup(gn->path); 2193 } else { 2194 st->newVal = Dir_FindFile(st->v->name, Suff_FindPath(gn)); 2195 } 2196 if (!st->newVal) 2197 st->newVal = bmake_strdup(st->v->name); 2198 st->next = mod + 1; 2199 return AMR_OK; 2200 } 2201 2202 /* :!cmd! */ 2203 static ApplyModifierResult 2204 ApplyModifier_Exclam(const char *mod, ApplyModifiersState *st) 2205 { 2206 st->next = mod + 1; 2207 char delim = '!'; 2208 char *cmd = ParseModifierPart(&st->next, delim, st->eflags, st->ctxt, 2209 NULL, NULL, NULL); 2210 if (cmd == NULL) { 2211 st->missing_delim = delim; 2212 return AMR_CLEANUP; 2213 } 2214 2215 const char *emsg = NULL; 2216 if (st->eflags & VARE_WANTRES) 2217 st->newVal = Cmd_Exec(cmd, &emsg); 2218 else 2219 st->newVal = varNoError; 2220 free(cmd); 2221 2222 if (emsg) 2223 Error(emsg, st->val); /* XXX: why still return AMR_OK? */ 2224 2225 if (st->v->flags & VAR_JUNK) 2226 st->v->flags |= VAR_KEEP; 2227 return AMR_OK; 2228 } 2229 2230 /* The :range modifier generates an integer sequence as long as the words. 2231 * The :range=7 modifier generates an integer sequence from 1 to 7. */ 2232 static ApplyModifierResult 2233 ApplyModifier_Range(const char *mod, ApplyModifiersState *st) 2234 { 2235 if (!ModMatchEq(mod, "range", st->endc)) 2236 return AMR_UNKNOWN; 2237 2238 int n; 2239 if (mod[5] == '=') { 2240 char *ep; 2241 n = strtoul(mod + 6, &ep, 10); 2242 st->next = ep; 2243 } else { 2244 n = 0; 2245 st->next = mod + 5; 2246 } 2247 2248 if (n == 0) { 2249 char *as; 2250 char **av = brk_string(st->val, &n, FALSE, &as); 2251 free(as); 2252 free(av); 2253 } 2254 2255 Buffer buf; 2256 Buf_InitZ(&buf, 0); 2257 2258 int i; 2259 for (i = 0; i < n; i++) { 2260 if (i != 0) 2261 Buf_AddByte(&buf, ' '); 2262 Buf_AddInt(&buf, 1 + i); 2263 } 2264 2265 st->newVal = Buf_Destroy(&buf, FALSE); 2266 return AMR_OK; 2267 } 2268 2269 /* :Mpattern or :Npattern */ 2270 static ApplyModifierResult 2271 ApplyModifier_Match(const char *mod, ApplyModifiersState *st) 2272 { 2273 Boolean copy = FALSE; /* pattern should be, or has been, copied */ 2274 Boolean needSubst = FALSE; 2275 /* 2276 * In the loop below, ignore ':' unless we are at (or back to) the 2277 * original brace level. 2278 * XXX This will likely not work right if $() and ${} are intermixed. 2279 */ 2280 int nest = 0; 2281 const char *p; 2282 for (p = mod + 1; *p != '\0' && !(*p == ':' && nest == 0); p++) { 2283 if (*p == '\\' && 2284 (p[1] == ':' || p[1] == st->endc || p[1] == st->startc)) { 2285 if (!needSubst) 2286 copy = TRUE; 2287 p++; 2288 continue; 2289 } 2290 if (*p == '$') 2291 needSubst = TRUE; 2292 if (*p == '(' || *p == '{') 2293 ++nest; 2294 if (*p == ')' || *p == '}') { 2295 --nest; 2296 if (nest < 0) 2297 break; 2298 } 2299 } 2300 st->next = p; 2301 const char *endpat = st->next; 2302 2303 char *pattern; 2304 if (copy) { 2305 /* Compress the \:'s out of the pattern. */ 2306 pattern = bmake_malloc(endpat - (mod + 1) + 1); 2307 char *dst = pattern; 2308 const char *src = mod + 1; 2309 for (; src < endpat; src++, dst++) { 2310 if (src[0] == '\\' && src + 1 < endpat && 2311 /* XXX: st->startc is missing here; see above */ 2312 (src[1] == ':' || src[1] == st->endc)) 2313 src++; 2314 *dst = *src; 2315 } 2316 *dst = '\0'; 2317 endpat = dst; 2318 } else { 2319 /* 2320 * Either Var_Subst or ModifyWords will need a 2321 * nul-terminated string soon, so construct one now. 2322 */ 2323 pattern = bmake_strndup(mod + 1, endpat - (mod + 1)); 2324 } 2325 2326 if (needSubst) { 2327 /* pattern contains embedded '$', so use Var_Subst to expand it. */ 2328 char *old_pattern = pattern; 2329 pattern = Var_Subst(pattern, st->ctxt, st->eflags); 2330 free(old_pattern); 2331 } 2332 2333 if (DEBUG(VAR)) 2334 fprintf(debug_file, "Pattern[%s] for [%s] is [%s]\n", 2335 st->v->name, st->val, pattern); 2336 2337 ModifyWordsCallback callback = mod[0] == 'M' 2338 ? ModifyWord_Match : ModifyWord_NoMatch; 2339 st->newVal = ModifyWords(st->ctxt, st->sep, st->oneBigWord, st->val, 2340 callback, pattern); 2341 free(pattern); 2342 return AMR_OK; 2343 } 2344 2345 /* :S,from,to, */ 2346 static ApplyModifierResult 2347 ApplyModifier_Subst(const char * const mod, ApplyModifiersState *st) 2348 { 2349 char delim = mod[1]; 2350 if (delim == '\0') { 2351 Error("Missing delimiter for :S modifier"); 2352 st->next = mod + 1; 2353 return AMR_CLEANUP; 2354 } 2355 2356 st->next = mod + 2; 2357 2358 ModifyWord_SubstArgs args; 2359 args.pflags = 0; 2360 2361 /* 2362 * If pattern begins with '^', it is anchored to the 2363 * start of the word -- skip over it and flag pattern. 2364 */ 2365 if (*st->next == '^') { 2366 args.pflags |= VARP_ANCHOR_START; 2367 st->next++; 2368 } 2369 2370 char *lhs = ParseModifierPart(&st->next, delim, st->eflags, st->ctxt, 2371 &args.lhsLen, &args.pflags, NULL); 2372 if (lhs == NULL) { 2373 st->missing_delim = delim; 2374 return AMR_CLEANUP; 2375 } 2376 args.lhs = lhs; 2377 2378 char *rhs = ParseModifierPart(&st->next, delim, st->eflags, st->ctxt, 2379 &args.rhsLen, NULL, &args); 2380 if (rhs == NULL) { 2381 st->missing_delim = delim; 2382 return AMR_CLEANUP; 2383 } 2384 args.rhs = rhs; 2385 2386 Boolean oneBigWord = st->oneBigWord; 2387 for (;; st->next++) { 2388 switch (*st->next) { 2389 case 'g': 2390 args.pflags |= VARP_SUB_GLOBAL; 2391 continue; 2392 case '1': 2393 args.pflags |= VARP_SUB_ONE; 2394 continue; 2395 case 'W': 2396 oneBigWord = TRUE; 2397 continue; 2398 } 2399 break; 2400 } 2401 2402 st->newVal = ModifyWords(st->ctxt, st->sep, oneBigWord, st->val, 2403 ModifyWord_Subst, &args); 2404 2405 free(lhs); 2406 free(rhs); 2407 return AMR_OK; 2408 } 2409 2410 #ifndef NO_REGEX 2411 2412 /* :C,from,to, */ 2413 static ApplyModifierResult 2414 ApplyModifier_Regex(const char *mod, ApplyModifiersState *st) 2415 { 2416 char delim = mod[1]; 2417 if (delim == '\0') { 2418 Error("Missing delimiter for :C modifier"); 2419 st->next = mod + 1; 2420 return AMR_CLEANUP; 2421 } 2422 2423 st->next = mod + 2; 2424 2425 char *re = ParseModifierPart(&st->next, delim, st->eflags, st->ctxt, 2426 NULL, NULL, NULL); 2427 if (re == NULL) { 2428 st->missing_delim = delim; 2429 return AMR_CLEANUP; 2430 } 2431 2432 ModifyWord_SubstRegexArgs args; 2433 args.replace = ParseModifierPart(&st->next, delim, st->eflags, st->ctxt, 2434 NULL, NULL, NULL); 2435 if (args.replace == NULL) { 2436 free(re); 2437 st->missing_delim = delim; 2438 return AMR_CLEANUP; 2439 } 2440 2441 args.pflags = 0; 2442 Boolean oneBigWord = st->oneBigWord; 2443 for (;; st->next++) { 2444 switch (*st->next) { 2445 case 'g': 2446 args.pflags |= VARP_SUB_GLOBAL; 2447 continue; 2448 case '1': 2449 args.pflags |= VARP_SUB_ONE; 2450 continue; 2451 case 'W': 2452 oneBigWord = TRUE; 2453 continue; 2454 } 2455 break; 2456 } 2457 2458 int error = regcomp(&args.re, re, REG_EXTENDED); 2459 free(re); 2460 if (error) { 2461 VarREError(error, &args.re, "Regex compilation error"); 2462 free(args.replace); 2463 return AMR_CLEANUP; 2464 } 2465 2466 args.nsub = args.re.re_nsub + 1; 2467 if (args.nsub < 1) 2468 args.nsub = 1; 2469 if (args.nsub > 10) 2470 args.nsub = 10; 2471 st->newVal = ModifyWords(st->ctxt, st->sep, oneBigWord, st->val, 2472 ModifyWord_SubstRegex, &args); 2473 regfree(&args.re); 2474 free(args.replace); 2475 return AMR_OK; 2476 } 2477 #endif 2478 2479 static void 2480 ModifyWord_Copy(const char *word, SepBuf *buf, void *data MAKE_ATTR_UNUSED) 2481 { 2482 SepBuf_AddStr(buf, word); 2483 } 2484 2485 /* :ts<separator> */ 2486 static ApplyModifierResult 2487 ApplyModifier_ToSep(const char *sep, ApplyModifiersState *st) 2488 { 2489 if (sep[0] != st->endc && (sep[1] == st->endc || sep[1] == ':')) { 2490 /* ":ts<any><endc>" or ":ts<any>:" */ 2491 st->sep = sep[0]; 2492 st->next = sep + 1; 2493 } else if (sep[0] == st->endc || sep[0] == ':') { 2494 /* ":ts<endc>" or ":ts:" */ 2495 st->sep = '\0'; /* no separator */ 2496 st->next = sep; 2497 } else if (sep[0] == '\\') { 2498 const char *xp = sep + 1; 2499 int base = 8; /* assume octal */ 2500 2501 switch (sep[1]) { 2502 case 'n': 2503 st->sep = '\n'; 2504 st->next = sep + 2; 2505 break; 2506 case 't': 2507 st->sep = '\t'; 2508 st->next = sep + 2; 2509 break; 2510 case 'x': 2511 base = 16; 2512 xp++; 2513 goto get_numeric; 2514 case '0': 2515 base = 0; 2516 goto get_numeric; 2517 default: 2518 if (!isdigit((unsigned char)sep[1])) 2519 return AMR_BAD; /* ":ts<backslash><unrecognised>". */ 2520 2521 char *end; 2522 get_numeric: 2523 st->sep = strtoul(sep + 1 + (sep[1] == 'x'), &end, base); 2524 if (*end != ':' && *end != st->endc) 2525 return AMR_BAD; 2526 st->next = end; 2527 break; 2528 } 2529 } else { 2530 return AMR_BAD; /* Found ":ts<unrecognised><unrecognised>". */ 2531 } 2532 2533 st->newVal = ModifyWords(st->ctxt, st->sep, st->oneBigWord, st->val, 2534 ModifyWord_Copy, NULL); 2535 return AMR_OK; 2536 } 2537 2538 /* :tA, :tu, :tl, :ts<separator>, etc. */ 2539 static ApplyModifierResult 2540 ApplyModifier_To(const char *mod, ApplyModifiersState *st) 2541 { 2542 assert(mod[0] == 't'); 2543 2544 st->next = mod + 1; /* make sure it is set */ 2545 if (mod[1] == st->endc || mod[1] == ':' || mod[1] == '\0') 2546 return AMR_BAD; /* Found ":t<endc>" or ":t:". */ 2547 2548 if (mod[1] == 's') 2549 return ApplyModifier_ToSep(mod + 2, st); 2550 2551 if (mod[2] != st->endc && mod[2] != ':') 2552 return AMR_BAD; /* Found ":t<unrecognised><unrecognised>". */ 2553 2554 /* Check for two-character options: ":tu", ":tl" */ 2555 if (mod[1] == 'A') { /* absolute path */ 2556 st->newVal = ModifyWords(st->ctxt, st->sep, st->oneBigWord, st->val, 2557 ModifyWord_Realpath, NULL); 2558 st->next = mod + 2; 2559 } else if (mod[1] == 'u') { 2560 size_t len = strlen(st->val); 2561 st->newVal = bmake_malloc(len + 1); 2562 size_t i; 2563 for (i = 0; i < len + 1; i++) 2564 st->newVal[i] = toupper((unsigned char)st->val[i]); 2565 st->next = mod + 2; 2566 } else if (mod[1] == 'l') { 2567 size_t len = strlen(st->val); 2568 st->newVal = bmake_malloc(len + 1); 2569 size_t i; 2570 for (i = 0; i < len + 1; i++) 2571 st->newVal[i] = tolower((unsigned char)st->val[i]); 2572 st->next = mod + 2; 2573 } else if (mod[1] == 'W' || mod[1] == 'w') { 2574 st->oneBigWord = mod[1] == 'W'; 2575 st->newVal = st->val; 2576 st->next = mod + 2; 2577 } else { 2578 /* Found ":t<unrecognised>:" or ":t<unrecognised><endc>". */ 2579 return AMR_BAD; 2580 } 2581 return AMR_OK; 2582 } 2583 2584 /* :[#], :[1], etc. */ 2585 static ApplyModifierResult 2586 ApplyModifier_Words(const char *mod, ApplyModifiersState *st) 2587 { 2588 st->next = mod + 1; /* point to char after '[' */ 2589 char delim = ']'; /* look for closing ']' */ 2590 char *estr = ParseModifierPart(&st->next, delim, st->eflags, st->ctxt, 2591 NULL, NULL, NULL); 2592 if (estr == NULL) { 2593 st->missing_delim = delim; 2594 return AMR_CLEANUP; 2595 } 2596 2597 /* now st->next points just after the closing ']' */ 2598 if (st->next[0] != ':' && st->next[0] != st->endc) 2599 goto bad_modifier; /* Found junk after ']' */ 2600 2601 if (estr[0] == '\0') 2602 goto bad_modifier; /* empty square brackets in ":[]". */ 2603 2604 if (estr[0] == '#' && estr[1] == '\0') { /* Found ":[#]" */ 2605 if (st->oneBigWord) { 2606 st->newVal = bmake_strdup("1"); 2607 } else { 2608 /* XXX: brk_string() is a rather expensive 2609 * way of counting words. */ 2610 char *as; 2611 int ac; 2612 char **av = brk_string(st->val, &ac, FALSE, &as); 2613 free(as); 2614 free(av); 2615 2616 Buffer buf; 2617 Buf_InitZ(&buf, 4); /* 3 digits + '\0' */ 2618 Buf_AddInt(&buf, ac); 2619 st->newVal = Buf_Destroy(&buf, FALSE); 2620 } 2621 goto ok; 2622 } 2623 2624 if (estr[0] == '*' && estr[1] == '\0') { 2625 /* Found ":[*]" */ 2626 st->oneBigWord = TRUE; 2627 st->newVal = st->val; 2628 goto ok; 2629 } 2630 2631 if (estr[0] == '@' && estr[1] == '\0') { 2632 /* Found ":[@]" */ 2633 st->oneBigWord = FALSE; 2634 st->newVal = st->val; 2635 goto ok; 2636 } 2637 2638 /* 2639 * We expect estr to contain a single integer for :[N], or two integers 2640 * separated by ".." for :[start..end]. 2641 */ 2642 char *ep; 2643 int first = strtol(estr, &ep, 0); 2644 int last; 2645 if (ep == estr) /* Found junk instead of a number */ 2646 goto bad_modifier; 2647 2648 if (ep[0] == '\0') { /* Found only one integer in :[N] */ 2649 last = first; 2650 } else if (ep[0] == '.' && ep[1] == '.' && ep[2] != '\0') { 2651 /* Expecting another integer after ".." */ 2652 ep += 2; 2653 last = strtol(ep, &ep, 0); 2654 if (ep[0] != '\0') /* Found junk after ".." */ 2655 goto bad_modifier; 2656 } else 2657 goto bad_modifier; /* Found junk instead of ".." */ 2658 2659 /* 2660 * Now seldata is properly filled in, but we still have to check for 0 as 2661 * a special case. 2662 */ 2663 if (first == 0 && last == 0) { 2664 /* ":[0]" or perhaps ":[0..0]" */ 2665 st->oneBigWord = TRUE; 2666 st->newVal = st->val; 2667 goto ok; 2668 } 2669 2670 /* ":[0..N]" or ":[N..0]" */ 2671 if (first == 0 || last == 0) 2672 goto bad_modifier; 2673 2674 /* Normal case: select the words described by seldata. */ 2675 st->newVal = VarSelectWords(st->sep, st->oneBigWord, st->val, first, last); 2676 2677 ok: 2678 free(estr); 2679 return AMR_OK; 2680 2681 bad_modifier: 2682 free(estr); 2683 return AMR_BAD; 2684 } 2685 2686 /* :O or :Or or :Ox */ 2687 static ApplyModifierResult 2688 ApplyModifier_Order(const char *mod, ApplyModifiersState *st) 2689 { 2690 char otype; 2691 2692 st->next = mod + 1; /* skip to the rest in any case */ 2693 if (mod[1] == st->endc || mod[1] == ':') { 2694 otype = 's'; 2695 } else if ((mod[1] == 'r' || mod[1] == 'x') && 2696 (mod[2] == st->endc || mod[2] == ':')) { 2697 otype = mod[1]; 2698 st->next = mod + 2; 2699 } else { 2700 return AMR_BAD; 2701 } 2702 st->newVal = VarOrder(st->val, otype); 2703 return AMR_OK; 2704 } 2705 2706 /* :? then : else */ 2707 static ApplyModifierResult 2708 ApplyModifier_IfElse(const char *mod, ApplyModifiersState *st) 2709 { 2710 Boolean value = FALSE; 2711 VarEvalFlags then_eflags = st->eflags & ~VARE_WANTRES; 2712 VarEvalFlags else_eflags = st->eflags & ~VARE_WANTRES; 2713 2714 int cond_rc = COND_PARSE; /* anything other than COND_INVALID */ 2715 if (st->eflags & VARE_WANTRES) { 2716 cond_rc = Cond_EvalExpression(NULL, st->v->name, &value, 0, FALSE); 2717 if (cond_rc != COND_INVALID && value) 2718 then_eflags |= VARE_WANTRES; 2719 if (cond_rc != COND_INVALID && !value) 2720 else_eflags |= VARE_WANTRES; 2721 } 2722 2723 st->next = mod + 1; 2724 char delim = ':'; 2725 char *then_expr = ParseModifierPart(&st->next, delim, then_eflags, st->ctxt, 2726 NULL, NULL, NULL); 2727 if (then_expr == NULL) { 2728 st->missing_delim = delim; 2729 return AMR_CLEANUP; 2730 } 2731 2732 delim = st->endc; /* BRCLOSE or PRCLOSE */ 2733 char *else_expr = ParseModifierPart(&st->next, delim, else_eflags, st->ctxt, 2734 NULL, NULL, NULL); 2735 if (else_expr == NULL) { 2736 st->missing_delim = delim; 2737 return AMR_CLEANUP; 2738 } 2739 2740 st->next--; 2741 if (cond_rc == COND_INVALID) { 2742 Error("Bad conditional expression `%s' in %s?%s:%s", 2743 st->v->name, st->v->name, then_expr, else_expr); 2744 return AMR_CLEANUP; 2745 } 2746 2747 if (value) { 2748 st->newVal = then_expr; 2749 free(else_expr); 2750 } else { 2751 st->newVal = else_expr; 2752 free(then_expr); 2753 } 2754 if (st->v->flags & VAR_JUNK) 2755 st->v->flags |= VAR_KEEP; 2756 return AMR_OK; 2757 } 2758 2759 /* 2760 * The ::= modifiers actually assign a value to the variable. 2761 * Their main purpose is in supporting modifiers of .for loop 2762 * iterators and other obscure uses. They always expand to 2763 * nothing. In a target rule that would otherwise expand to an 2764 * empty line they can be preceded with @: to keep make happy. 2765 * Eg. 2766 * 2767 * foo: .USE 2768 * .for i in ${.TARGET} ${.TARGET:R}.gz 2769 * @: ${t::=$i} 2770 * @echo blah ${t:T} 2771 * .endfor 2772 * 2773 * ::=<str> Assigns <str> as the new value of variable. 2774 * ::?=<str> Assigns <str> as value of variable if 2775 * it was not already set. 2776 * ::+=<str> Appends <str> to variable. 2777 * ::!=<cmd> Assigns output of <cmd> as the new value of 2778 * variable. 2779 */ 2780 static ApplyModifierResult 2781 ApplyModifier_Assign(const char *mod, ApplyModifiersState *st) 2782 { 2783 const char *op = mod + 1; 2784 if (!(op[0] == '=' || 2785 (op[1] == '=' && 2786 (op[0] == '!' || op[0] == '+' || op[0] == '?')))) 2787 return AMR_UNKNOWN; /* "::<unrecognised>" */ 2788 2789 GNode *v_ctxt; /* context where v belongs */ 2790 2791 if (st->v->name[0] == 0) { 2792 st->next = mod + 1; 2793 return AMR_BAD; 2794 } 2795 2796 v_ctxt = st->ctxt; 2797 char *sv_name = NULL; 2798 if (st->v->flags & VAR_JUNK) { 2799 /* 2800 * We need to bmake_strdup() it in case ParseModifierPart() recurses. 2801 */ 2802 sv_name = st->v->name; 2803 st->v->name = bmake_strdup(st->v->name); 2804 } else if (st->ctxt != VAR_GLOBAL) { 2805 Var *gv = VarFind(st->v->name, st->ctxt, 0); 2806 if (gv == NULL) 2807 v_ctxt = VAR_GLOBAL; 2808 else 2809 VarFreeEnv(gv, TRUE); 2810 } 2811 2812 switch (op[0]) { 2813 case '+': 2814 case '?': 2815 case '!': 2816 st->next = mod + 3; 2817 break; 2818 default: 2819 st->next = mod + 2; 2820 break; 2821 } 2822 2823 char delim = st->startc == PROPEN ? PRCLOSE : BRCLOSE; 2824 char *val = ParseModifierPart(&st->next, delim, st->eflags, st->ctxt, 2825 NULL, NULL, NULL); 2826 if (st->v->flags & VAR_JUNK) { 2827 /* restore original name */ 2828 free(st->v->name); 2829 st->v->name = sv_name; 2830 } 2831 if (val == NULL) { 2832 st->missing_delim = delim; 2833 return AMR_CLEANUP; 2834 } 2835 2836 st->next--; 2837 2838 if (st->eflags & VARE_WANTRES) { 2839 switch (op[0]) { 2840 case '+': 2841 Var_Append(st->v->name, val, v_ctxt); 2842 break; 2843 case '!': { 2844 const char *emsg; 2845 st->newVal = Cmd_Exec(val, &emsg); 2846 if (emsg) 2847 Error(emsg, st->val); 2848 else 2849 Var_Set(st->v->name, st->newVal, v_ctxt); 2850 free(st->newVal); 2851 break; 2852 } 2853 case '?': 2854 if (!(st->v->flags & VAR_JUNK)) 2855 break; 2856 /* FALLTHROUGH */ 2857 default: 2858 Var_Set(st->v->name, val, v_ctxt); 2859 break; 2860 } 2861 } 2862 free(val); 2863 st->newVal = varNoError; 2864 return AMR_OK; 2865 } 2866 2867 /* remember current value */ 2868 static ApplyModifierResult 2869 ApplyModifier_Remember(const char *mod, ApplyModifiersState *st) 2870 { 2871 if (!ModMatchEq(mod, "_", st->endc)) 2872 return AMR_UNKNOWN; 2873 2874 if (mod[1] == '=') { 2875 size_t n = strcspn(mod + 2, ":)}"); 2876 char *name = bmake_strndup(mod + 2, n); 2877 Var_Set(name, st->val, st->ctxt); 2878 free(name); 2879 st->next = mod + 2 + n; 2880 } else { 2881 Var_Set("_", st->val, st->ctxt); 2882 st->next = mod + 1; 2883 } 2884 st->newVal = st->val; 2885 return AMR_OK; 2886 } 2887 2888 #ifdef SYSVVARSUB 2889 /* :from=to */ 2890 static ApplyModifierResult 2891 ApplyModifier_SysV(const char *mod, ApplyModifiersState *st) 2892 { 2893 Boolean eqFound = FALSE; 2894 2895 /* 2896 * First we make a pass through the string trying 2897 * to verify it is a SYSV-make-style translation: 2898 * it must be: <string1>=<string2>) 2899 */ 2900 st->next = mod; 2901 int nest = 1; 2902 while (*st->next != '\0' && nest > 0) { 2903 if (*st->next == '=') { 2904 eqFound = TRUE; 2905 /* continue looking for st->endc */ 2906 } else if (*st->next == st->endc) 2907 nest--; 2908 else if (*st->next == st->startc) 2909 nest++; 2910 if (nest > 0) 2911 st->next++; 2912 } 2913 if (*st->next != st->endc || !eqFound) 2914 return AMR_UNKNOWN; 2915 2916 char delim = '='; 2917 st->next = mod; 2918 char *lhs = ParseModifierPart(&st->next, delim, st->eflags, st->ctxt, 2919 NULL, NULL, NULL); 2920 if (lhs == NULL) { 2921 st->missing_delim = delim; 2922 return AMR_CLEANUP; 2923 } 2924 2925 delim = st->endc; 2926 char *rhs = ParseModifierPart(&st->next, delim, st->eflags, st->ctxt, 2927 NULL, NULL, NULL); 2928 if (rhs == NULL) { 2929 st->missing_delim = delim; 2930 return AMR_CLEANUP; 2931 } 2932 2933 /* 2934 * SYSV modifications happen through the whole 2935 * string. Note the pattern is anchored at the end. 2936 */ 2937 st->next--; 2938 if (lhs[0] == '\0' && *st->val == '\0') { 2939 st->newVal = st->val; /* special case */ 2940 } else { 2941 ModifyWord_SYSVSubstArgs args = { st->ctxt, lhs, rhs }; 2942 st->newVal = ModifyWords(st->ctxt, st->sep, st->oneBigWord, st->val, 2943 ModifyWord_SYSVSubst, &args); 2944 } 2945 free(lhs); 2946 free(rhs); 2947 return AMR_OK; 2948 } 2949 #endif 2950 2951 /* 2952 * Now we need to apply any modifiers the user wants applied. 2953 * These are: 2954 * :M<pattern> words which match the given <pattern>. 2955 * <pattern> is of the standard file 2956 * wildcarding form. 2957 * :N<pattern> words which do not match the given <pattern>. 2958 * :S<d><pat1><d><pat2><d>[1gW] 2959 * Substitute <pat2> for <pat1> in the value 2960 * :C<d><pat1><d><pat2><d>[1gW] 2961 * Substitute <pat2> for regex <pat1> in the value 2962 * :H Substitute the head of each word 2963 * :T Substitute the tail of each word 2964 * :E Substitute the extension (minus '.') of 2965 * each word 2966 * :R Substitute the root of each word 2967 * (pathname minus the suffix). 2968 * :O ("Order") Alphabeticaly sort words in variable. 2969 * :Ox ("intermiX") Randomize words in variable. 2970 * :u ("uniq") Remove adjacent duplicate words. 2971 * :tu Converts the variable contents to uppercase. 2972 * :tl Converts the variable contents to lowercase. 2973 * :ts[c] Sets varSpace - the char used to 2974 * separate words to 'c'. If 'c' is 2975 * omitted then no separation is used. 2976 * :tW Treat the variable contents as a single 2977 * word, even if it contains spaces. 2978 * (Mnemonic: one big 'W'ord.) 2979 * :tw Treat the variable contents as multiple 2980 * space-separated words. 2981 * (Mnemonic: many small 'w'ords.) 2982 * :[index] Select a single word from the value. 2983 * :[start..end] Select multiple words from the value. 2984 * :[*] or :[0] Select the entire value, as a single 2985 * word. Equivalent to :tW. 2986 * :[@] Select the entire value, as multiple 2987 * words. Undoes the effect of :[*]. 2988 * Equivalent to :tw. 2989 * :[#] Returns the number of words in the value. 2990 * 2991 * :?<true-value>:<false-value> 2992 * If the variable evaluates to true, return 2993 * true-value, else return false-value. 2994 * :lhs=rhs Similar to :S, but the rhs goes to the end of 2995 * the invocation, including any ':'. 2996 * :sh Treat the current value as a command 2997 * to be run, new value is its output. 2998 * The following added so we can handle ODE makefiles. 2999 * :@<tmpvar>@<newval>@ 3000 * Assign a temporary global variable <tmpvar> 3001 * to the current value of each word in turn 3002 * and replace each word with the result of 3003 * evaluating <newval> 3004 * :D<newval> Use <newval> as value if variable defined 3005 * :U<newval> Use <newval> as value if variable undefined 3006 * :L Use the name of the variable as the value. 3007 * :P Use the path of the node that has the same 3008 * name as the variable as the value. This 3009 * basically includes an implied :L so that 3010 * the common method of refering to the path 3011 * of your dependent 'x' in a rule is to use 3012 * the form '${x:P}'. 3013 * :!<cmd>! Run cmd much the same as :sh runs the 3014 * current value of the variable. 3015 * Assignment operators (see ApplyModifier_Assign). 3016 */ 3017 static char * 3018 ApplyModifiers( 3019 const char **pp, /* the parsing position, updated upon return */ 3020 char *val, /* the current value of the variable */ 3021 int const startc, /* '(' or '{' or '\0' */ 3022 int const endc, /* ')' or '}' or '\0' */ 3023 Var * const v, /* the variable may have its flags changed */ 3024 GNode * const ctxt, /* for looking up and modifying variables */ 3025 VarEvalFlags const eflags, 3026 void ** const freePtr /* free this after using the return value */ 3027 ) { 3028 assert(startc == '(' || startc == '{' || startc == '\0'); 3029 assert(endc == ')' || endc == '}' || startc == '\0'); 3030 3031 ApplyModifiersState st = { 3032 startc, endc, v, ctxt, eflags, 3033 val, NULL, NULL, '\0', ' ', FALSE 3034 }; 3035 3036 const char *p = *pp; 3037 while (*p != '\0' && *p != endc) { 3038 3039 if (*p == '$') { 3040 /* 3041 * We may have some complex modifiers in a variable. 3042 */ 3043 void *freeIt; 3044 const char *rval; 3045 int rlen; 3046 int c; 3047 3048 rval = Var_Parse(p, st.ctxt, st.eflags, &rlen, &freeIt); 3049 3050 /* 3051 * If we have not parsed up to st.endc or ':', 3052 * we are not interested. 3053 */ 3054 if (rval != NULL && *rval && 3055 (c = p[rlen]) != '\0' && c != ':' && c != st.endc) { 3056 free(freeIt); 3057 goto apply_mods; 3058 } 3059 3060 if (DEBUG(VAR)) { 3061 fprintf(debug_file, "Got '%s' from '%.*s'%.*s\n", 3062 rval, rlen, p, rlen, p + rlen); 3063 } 3064 3065 p += rlen; 3066 3067 if (rval != NULL && *rval) { 3068 const char *rval_pp = rval; 3069 st.val = ApplyModifiers(&rval_pp, st.val, 0, 0, v, 3070 ctxt, eflags, freePtr); 3071 if (st.val == var_Error 3072 || (st.val == varNoError && !(st.eflags & VARE_UNDEFERR)) 3073 || *rval_pp != '\0') { 3074 free(freeIt); 3075 goto out; /* error already reported */ 3076 } 3077 } 3078 free(freeIt); 3079 if (*p == ':') 3080 p++; 3081 else if (*p == '\0' && endc != '\0') { 3082 Error("Unclosed variable specification after complex " 3083 "modifier (expecting '%c') for %s", st.endc, st.v->name); 3084 goto out; 3085 } 3086 continue; 3087 } 3088 apply_mods: 3089 if (DEBUG(VAR)) { 3090 fprintf(debug_file, "Applying[%s] :%c to \"%s\"\n", st.v->name, 3091 *p, st.val); 3092 } 3093 st.newVal = var_Error; /* default value, in case of errors */ 3094 st.next = NULL; /* fail fast if an ApplyModifier forgets to set this */ 3095 ApplyModifierResult res = AMR_BAD; /* just a safe fallback */ 3096 char modifier = *p; 3097 switch (modifier) { 3098 case ':': 3099 res = ApplyModifier_Assign(p, &st); 3100 break; 3101 case '@': 3102 res = ApplyModifier_Loop(p, &st); 3103 break; 3104 case '_': 3105 res = ApplyModifier_Remember(p, &st); 3106 break; 3107 case 'D': 3108 case 'U': 3109 res = ApplyModifier_Defined(p, &st); 3110 break; 3111 case 'L': 3112 if (st.v->flags & VAR_JUNK) 3113 st.v->flags |= VAR_KEEP; 3114 st.newVal = bmake_strdup(st.v->name); 3115 st.next = p + 1; 3116 res = AMR_OK; 3117 break; 3118 case 'P': 3119 res = ApplyModifier_Path(p, &st); 3120 break; 3121 case '!': 3122 res = ApplyModifier_Exclam(p, &st); 3123 break; 3124 case '[': 3125 res = ApplyModifier_Words(p, &st); 3126 break; 3127 case 'g': 3128 res = ApplyModifier_Gmtime(p, &st); 3129 break; 3130 case 'h': 3131 res = ApplyModifier_Hash(p, &st); 3132 break; 3133 case 'l': 3134 res = ApplyModifier_Localtime(p, &st); 3135 break; 3136 case 't': 3137 res = ApplyModifier_To(p, &st); 3138 break; 3139 case 'N': 3140 case 'M': 3141 res = ApplyModifier_Match(p, &st); 3142 break; 3143 case 'S': 3144 res = ApplyModifier_Subst(p, &st); 3145 break; 3146 case '?': 3147 res = ApplyModifier_IfElse(p, &st); 3148 break; 3149 #ifndef NO_REGEX 3150 case 'C': 3151 res = ApplyModifier_Regex(p, &st); 3152 break; 3153 #endif 3154 case 'q': 3155 case 'Q': 3156 if (p[1] == st.endc || p[1] == ':') { 3157 st.newVal = VarQuote(st.val, modifier == 'q'); 3158 st.next = p + 1; 3159 res = AMR_OK; 3160 } else 3161 res = AMR_UNKNOWN; 3162 break; 3163 case 'T': 3164 if (p[1] == st.endc || p[1] == ':') { 3165 st.newVal = ModifyWords(st.ctxt, st.sep, st.oneBigWord, 3166 st.val, ModifyWord_Tail, NULL); 3167 st.next = p + 1; 3168 res = AMR_OK; 3169 } else 3170 res = AMR_UNKNOWN; 3171 break; 3172 case 'H': 3173 if (p[1] == st.endc || p[1] == ':') { 3174 st.newVal = ModifyWords(st.ctxt, st.sep, st.oneBigWord, 3175 st.val, ModifyWord_Head, NULL); 3176 st.next = p + 1; 3177 res = AMR_OK; 3178 } else 3179 res = AMR_UNKNOWN; 3180 break; 3181 case 'E': 3182 if (p[1] == st.endc || p[1] == ':') { 3183 st.newVal = ModifyWords(st.ctxt, st.sep, st.oneBigWord, 3184 st.val, ModifyWord_Suffix, NULL); 3185 st.next = p + 1; 3186 res = AMR_OK; 3187 } else 3188 res = AMR_UNKNOWN; 3189 break; 3190 case 'R': 3191 if (p[1] == st.endc || p[1] == ':') { 3192 st.newVal = ModifyWords(st.ctxt, st.sep, st.oneBigWord, 3193 st.val, ModifyWord_Root, NULL); 3194 st.next = p + 1; 3195 res = AMR_OK; 3196 } else 3197 res = AMR_UNKNOWN; 3198 break; 3199 case 'r': 3200 res = ApplyModifier_Range(p, &st); 3201 break; 3202 case 'O': 3203 res = ApplyModifier_Order(p, &st); 3204 break; 3205 case 'u': 3206 if (p[1] == st.endc || p[1] == ':') { 3207 st.newVal = VarUniq(st.val); 3208 st.next = p + 1; 3209 res = AMR_OK; 3210 } else 3211 res = AMR_UNKNOWN; 3212 break; 3213 #ifdef SUNSHCMD 3214 case 's': 3215 if (p[1] == 'h' && (p[2] == st.endc || p[2] == ':')) { 3216 const char *emsg; 3217 if (st.eflags & VARE_WANTRES) { 3218 st.newVal = Cmd_Exec(st.val, &emsg); 3219 if (emsg) 3220 Error(emsg, st.val); 3221 } else 3222 st.newVal = varNoError; 3223 st.next = p + 2; 3224 res = AMR_OK; 3225 } else 3226 res = AMR_UNKNOWN; 3227 break; 3228 #endif 3229 default: 3230 res = AMR_UNKNOWN; 3231 } 3232 3233 #ifdef SYSVVARSUB 3234 if (res == AMR_UNKNOWN) 3235 res = ApplyModifier_SysV(p, &st); 3236 #endif 3237 3238 if (res == AMR_UNKNOWN) { 3239 Error("Unknown modifier '%c'", *p); 3240 st.next = p + 1; 3241 while (*st.next != ':' && *st.next != st.endc && *st.next != '\0') 3242 st.next++; 3243 st.newVal = var_Error; 3244 } 3245 if (res == AMR_CLEANUP) 3246 goto cleanup; 3247 if (res == AMR_BAD) 3248 goto bad_modifier; 3249 3250 if (DEBUG(VAR)) { 3251 fprintf(debug_file, "Result[%s] of :%c is \"%s\"\n", 3252 st.v->name, modifier, st.newVal); 3253 } 3254 3255 if (st.newVal != st.val) { 3256 if (*freePtr) { 3257 free(st.val); 3258 *freePtr = NULL; 3259 } 3260 st.val = st.newVal; 3261 if (st.val != var_Error && st.val != varNoError) { 3262 *freePtr = st.val; 3263 } 3264 } 3265 if (*st.next == '\0' && st.endc != '\0') { 3266 Error("Unclosed variable specification (expecting '%c') " 3267 "for \"%s\" (value \"%s\") modifier %c", 3268 st.endc, st.v->name, st.val, modifier); 3269 } else if (*st.next == ':') { 3270 st.next++; 3271 } 3272 p = st.next; 3273 } 3274 out: 3275 *pp = p; 3276 return st.val; 3277 3278 bad_modifier: 3279 Error("Bad modifier `:%.*s' for %s", 3280 (int)strcspn(p, ":)}"), p, st.v->name); 3281 3282 cleanup: 3283 *pp = st.next; 3284 if (st.missing_delim != '\0') 3285 Error("Unclosed substitution for %s (%c missing)", 3286 st.v->name, st.missing_delim); 3287 free(*freePtr); 3288 *freePtr = NULL; 3289 return var_Error; 3290 } 3291 3292 static Boolean 3293 VarIsDynamic(GNode *ctxt, const char *varname, size_t namelen) 3294 { 3295 if ((namelen == 1 || 3296 (namelen == 2 && (varname[1] == 'F' || varname[1] == 'D'))) && 3297 (ctxt == VAR_CMD || ctxt == VAR_GLOBAL)) 3298 { 3299 /* 3300 * If substituting a local variable in a non-local context, 3301 * assume it's for dynamic source stuff. We have to handle 3302 * this specially and return the longhand for the variable 3303 * with the dollar sign escaped so it makes it back to the 3304 * caller. Only four of the local variables are treated 3305 * specially as they are the only four that will be set 3306 * when dynamic sources are expanded. 3307 */ 3308 switch (varname[0]) { 3309 case '@': 3310 case '%': 3311 case '*': 3312 case '!': 3313 return TRUE; 3314 } 3315 return FALSE; 3316 } 3317 3318 if ((namelen == 7 || namelen == 8) && varname[0] == '.' && 3319 isupper((unsigned char) varname[1]) && 3320 (ctxt == VAR_CMD || ctxt == VAR_GLOBAL)) 3321 { 3322 return strcmp(varname, ".TARGET") == 0 || 3323 strcmp(varname, ".ARCHIVE") == 0 || 3324 strcmp(varname, ".PREFIX") == 0 || 3325 strcmp(varname, ".MEMBER") == 0; 3326 } 3327 3328 return FALSE; 3329 } 3330 3331 /*- 3332 *----------------------------------------------------------------------- 3333 * Var_Parse -- 3334 * Given the start of a variable invocation (such as $v, $(VAR), 3335 * ${VAR:Mpattern}), extract the variable name, possibly some 3336 * modifiers and find its value by applying the modifiers to the 3337 * original value. 3338 * 3339 * Input: 3340 * str The string to parse 3341 * ctxt The context for the variable 3342 * flags VARE_UNDEFERR if undefineds are an error 3343 * VARE_WANTRES if we actually want the result 3344 * VARE_ASSIGN if we are in a := assignment 3345 * lengthPtr OUT: The length of the specification 3346 * freePtr OUT: Non-NULL if caller should free *freePtr 3347 * 3348 * Results: 3349 * The (possibly-modified) value of the variable or var_Error if the 3350 * specification is invalid. The length of the specification is 3351 * placed in *lengthPtr (for invalid specifications, this is just 3352 * 2...?). 3353 * If *freePtr is non-NULL then it's a pointer that the caller 3354 * should pass to free() to free memory used by the result. 3355 * 3356 * Side Effects: 3357 * None. 3358 * 3359 *----------------------------------------------------------------------- 3360 */ 3361 /* coverity[+alloc : arg-*4] */ 3362 const char * 3363 Var_Parse(const char * const str, GNode *ctxt, VarEvalFlags eflags, 3364 int *lengthPtr, void **freePtr) 3365 { 3366 const char *tstr; /* Pointer into str */ 3367 Var *v; /* Variable in invocation */ 3368 Boolean haveModifier; /* TRUE if have modifiers for the variable */ 3369 char endc; /* Ending character when variable in parens 3370 * or braces */ 3371 char startc; /* Starting character when variable in parens 3372 * or braces */ 3373 char *nstr; /* New string, used during expansion */ 3374 Boolean dynamic; /* TRUE if the variable is local and we're 3375 * expanding it in a non-local context. This 3376 * is done to support dynamic sources. The 3377 * result is just the invocation, unaltered */ 3378 const char *extramodifiers; /* extra modifiers to apply first */ 3379 3380 *freePtr = NULL; 3381 extramodifiers = NULL; 3382 dynamic = FALSE; 3383 3384 startc = str[1]; 3385 if (startc != PROPEN && startc != BROPEN) { 3386 /* 3387 * If it's not bounded by braces of some sort, life is much simpler. 3388 * We just need to check for the first character and return the 3389 * value if it exists. 3390 */ 3391 3392 /* Error out some really stupid names */ 3393 if (startc == '\0' || strchr(")}:$", startc)) { 3394 *lengthPtr = 1; 3395 return var_Error; 3396 } 3397 char name[] = { startc, '\0' }; 3398 3399 v = VarFind(name, ctxt, FIND_ENV | FIND_GLOBAL | FIND_CMD); 3400 if (v == NULL) { 3401 *lengthPtr = 2; 3402 3403 if (ctxt == VAR_CMD || ctxt == VAR_GLOBAL) { 3404 /* 3405 * If substituting a local variable in a non-local context, 3406 * assume it's for dynamic source stuff. We have to handle 3407 * this specially and return the longhand for the variable 3408 * with the dollar sign escaped so it makes it back to the 3409 * caller. Only four of the local variables are treated 3410 * specially as they are the only four that will be set 3411 * when dynamic sources are expanded. 3412 */ 3413 switch (str[1]) { 3414 case '@': 3415 return "$(.TARGET)"; 3416 case '%': 3417 return "$(.MEMBER)"; 3418 case '*': 3419 return "$(.PREFIX)"; 3420 case '!': 3421 return "$(.ARCHIVE)"; 3422 } 3423 } 3424 return (eflags & VARE_UNDEFERR) ? var_Error : varNoError; 3425 } else { 3426 haveModifier = FALSE; 3427 tstr = str + 1; 3428 endc = str[1]; 3429 } 3430 } else { 3431 endc = startc == PROPEN ? PRCLOSE : BRCLOSE; 3432 3433 Buffer namebuf; /* Holds the variable name */ 3434 Buf_InitZ(&namebuf, 0); 3435 3436 /* 3437 * Skip to the end character or a colon, whichever comes first. 3438 */ 3439 int depth = 1; 3440 for (tstr = str + 2; *tstr != '\0'; tstr++) { 3441 /* Track depth so we can spot parse errors. */ 3442 if (*tstr == startc) 3443 depth++; 3444 if (*tstr == endc) { 3445 if (--depth == 0) 3446 break; 3447 } 3448 if (depth == 1 && *tstr == ':') 3449 break; 3450 /* A variable inside a variable, expand. */ 3451 if (*tstr == '$') { 3452 int rlen; 3453 void *freeIt; 3454 const char *rval = Var_Parse(tstr, ctxt, eflags, &rlen, &freeIt); 3455 if (rval != NULL) 3456 Buf_AddStr(&namebuf, rval); 3457 free(freeIt); 3458 tstr += rlen - 1; 3459 } else 3460 Buf_AddByte(&namebuf, *tstr); 3461 } 3462 if (*tstr == ':') { 3463 haveModifier = TRUE; 3464 } else if (*tstr == endc) { 3465 haveModifier = FALSE; 3466 } else { 3467 Parse_Error(PARSE_FATAL, "Unclosed variable \"%s\"", 3468 Buf_GetAllZ(&namebuf, NULL)); 3469 /* 3470 * If we never did find the end character, return NULL 3471 * right now, setting the length to be the distance to 3472 * the end of the string, since that's what make does. 3473 */ 3474 *lengthPtr = tstr - str; 3475 Buf_Destroy(&namebuf, TRUE); 3476 return var_Error; 3477 } 3478 3479 size_t namelen; 3480 char *varname = Buf_GetAllZ(&namebuf, &namelen); 3481 3482 /* 3483 * At this point, varname points into newly allocated memory from 3484 * namebuf, containing only the name of the variable. 3485 * 3486 * start and tstr point into the const string that was pointed 3487 * to by the original value of the str parameter. start points 3488 * to the '$' at the beginning of the string, while tstr points 3489 * to the char just after the end of the variable name -- this 3490 * will be '\0', ':', PRCLOSE, or BRCLOSE. 3491 */ 3492 3493 v = VarFind(varname, ctxt, FIND_ENV | FIND_GLOBAL | FIND_CMD); 3494 /* 3495 * Check also for bogus D and F forms of local variables since we're 3496 * in a local context and the name is the right length. 3497 */ 3498 if (v == NULL && ctxt != VAR_CMD && ctxt != VAR_GLOBAL && 3499 namelen == 2 && (varname[1] == 'F' || varname[1] == 'D') && 3500 strchr("@%?*!<>", varname[0]) != NULL) { 3501 /* 3502 * Well, it's local -- go look for it. 3503 */ 3504 char name[] = {varname[0], '\0' }; 3505 v = VarFind(name, ctxt, 0); 3506 3507 if (v != NULL) { 3508 if (varname[1] == 'D') { 3509 extramodifiers = "H:"; 3510 } else { /* F */ 3511 extramodifiers = "T:"; 3512 } 3513 } 3514 } 3515 3516 if (v == NULL) { 3517 dynamic = VarIsDynamic(ctxt, varname, namelen); 3518 3519 if (!haveModifier) { 3520 /* 3521 * No modifiers -- have specification length so we can return 3522 * now. 3523 */ 3524 *lengthPtr = tstr - str + 1; 3525 if (dynamic) { 3526 char *pstr = bmake_strndup(str, *lengthPtr); 3527 *freePtr = pstr; 3528 Buf_Destroy(&namebuf, TRUE); 3529 return pstr; 3530 } else { 3531 Buf_Destroy(&namebuf, TRUE); 3532 return (eflags & VARE_UNDEFERR) ? var_Error : varNoError; 3533 } 3534 } else { 3535 /* 3536 * Still need to get to the end of the variable specification, 3537 * so kludge up a Var structure for the modifications 3538 */ 3539 v = bmake_malloc(sizeof(Var)); 3540 v->name = varname; 3541 Buf_InitZ(&v->val, 1); 3542 v->flags = VAR_JUNK; 3543 Buf_Destroy(&namebuf, FALSE); 3544 } 3545 } else 3546 Buf_Destroy(&namebuf, TRUE); 3547 } 3548 3549 if (v->flags & VAR_IN_USE) { 3550 Fatal("Variable %s is recursive.", v->name); 3551 /*NOTREACHED*/ 3552 } else { 3553 v->flags |= VAR_IN_USE; 3554 } 3555 /* 3556 * Before doing any modification, we have to make sure the value 3557 * has been fully expanded. If it looks like recursion might be 3558 * necessary (there's a dollar sign somewhere in the variable's value) 3559 * we just call Var_Subst to do any other substitutions that are 3560 * necessary. Note that the value returned by Var_Subst will have 3561 * been dynamically-allocated, so it will need freeing when we 3562 * return. 3563 */ 3564 nstr = Buf_GetAllZ(&v->val, NULL); 3565 if (strchr(nstr, '$') != NULL && (eflags & VARE_WANTRES) != 0) { 3566 nstr = Var_Subst(nstr, ctxt, eflags); 3567 *freePtr = nstr; 3568 } 3569 3570 v->flags &= ~VAR_IN_USE; 3571 3572 if (nstr != NULL && (haveModifier || extramodifiers != NULL)) { 3573 void *extraFree; 3574 3575 extraFree = NULL; 3576 if (extramodifiers != NULL) { 3577 const char *em = extramodifiers; 3578 nstr = ApplyModifiers(&em, nstr, '(', ')', 3579 v, ctxt, eflags, &extraFree); 3580 } 3581 3582 if (haveModifier) { 3583 /* Skip initial colon. */ 3584 tstr++; 3585 3586 nstr = ApplyModifiers(&tstr, nstr, startc, endc, 3587 v, ctxt, eflags, freePtr); 3588 free(extraFree); 3589 } else { 3590 *freePtr = extraFree; 3591 } 3592 } 3593 *lengthPtr = tstr - str + (*tstr ? 1 : 0); 3594 3595 if (v->flags & VAR_FROM_ENV) { 3596 Boolean destroy = nstr != Buf_GetAllZ(&v->val, NULL); 3597 if (!destroy) { 3598 /* 3599 * Returning the value unmodified, so tell the caller to free 3600 * the thing. 3601 */ 3602 *freePtr = nstr; 3603 } 3604 (void)VarFreeEnv(v, destroy); 3605 } else if (v->flags & VAR_JUNK) { 3606 /* 3607 * Perform any free'ing needed and set *freePtr to NULL so the caller 3608 * doesn't try to free a static pointer. 3609 * If VAR_KEEP is also set then we want to keep str(?) as is. 3610 */ 3611 if (!(v->flags & VAR_KEEP)) { 3612 if (*freePtr != NULL) { 3613 free(*freePtr); 3614 *freePtr = NULL; 3615 } 3616 if (dynamic) { 3617 nstr = bmake_strndup(str, *lengthPtr); 3618 *freePtr = nstr; 3619 } else { 3620 nstr = (eflags & VARE_UNDEFERR) ? var_Error : varNoError; 3621 } 3622 } 3623 if (nstr != Buf_GetAllZ(&v->val, NULL)) 3624 Buf_Destroy(&v->val, TRUE); 3625 free(v->name); 3626 free(v); 3627 } 3628 return nstr; 3629 } 3630 3631 /*- 3632 *----------------------------------------------------------------------- 3633 * Var_Subst -- 3634 * Substitute for all variables in the given string in the given context. 3635 * If eflags & VARE_UNDEFERR, Parse_Error will be called when an undefined 3636 * variable is encountered. 3637 * 3638 * Input: 3639 * var Named variable || NULL for all 3640 * str the string which to substitute 3641 * ctxt the context wherein to find variables 3642 * eflags VARE_UNDEFERR if undefineds are an error 3643 * VARE_WANTRES if we actually want the result 3644 * VARE_ASSIGN if we are in a := assignment 3645 * 3646 * Results: 3647 * The resulting string. 3648 * 3649 * Side Effects: 3650 * None. 3651 *----------------------------------------------------------------------- 3652 */ 3653 char * 3654 Var_Subst(const char *str, GNode *ctxt, VarEvalFlags eflags) 3655 { 3656 Buffer buf; /* Buffer for forming things */ 3657 const char *val; /* Value to substitute for a variable */ 3658 int length; /* Length of the variable invocation */ 3659 Boolean trailingBslash; /* variable ends in \ */ 3660 void *freeIt = NULL; /* Set if it should be freed */ 3661 static Boolean errorReported; /* Set true if an error has already 3662 * been reported to prevent a plethora 3663 * of messages when recursing */ 3664 3665 Buf_InitZ(&buf, 0); 3666 errorReported = FALSE; 3667 trailingBslash = FALSE; 3668 3669 while (*str) { 3670 if (*str == '\n' && trailingBslash) 3671 Buf_AddByte(&buf, ' '); 3672 if (*str == '$' && str[1] == '$') { 3673 /* 3674 * A dollar sign may be escaped with another dollar sign. 3675 * In such a case, we skip over the escape character and store the 3676 * dollar sign into the buffer directly. 3677 */ 3678 if (save_dollars && (eflags & VARE_ASSIGN)) 3679 Buf_AddByte(&buf, '$'); 3680 Buf_AddByte(&buf, '$'); 3681 str += 2; 3682 } else if (*str != '$') { 3683 /* 3684 * Skip as many characters as possible -- either to the end of 3685 * the string or to the next dollar sign (variable invocation). 3686 */ 3687 const char *cp; 3688 3689 for (cp = str++; *str != '$' && *str != '\0'; str++) 3690 continue; 3691 Buf_AddBytesBetween(&buf, cp, str); 3692 } else { 3693 val = Var_Parse(str, ctxt, eflags, &length, &freeIt); 3694 3695 /* 3696 * When we come down here, val should either point to the 3697 * value of this variable, suitably modified, or be NULL. 3698 * Length should be the total length of the potential 3699 * variable invocation (from $ to end character...) 3700 */ 3701 if (val == var_Error || val == varNoError) { 3702 /* 3703 * If performing old-time variable substitution, skip over 3704 * the variable and continue with the substitution. Otherwise, 3705 * store the dollar sign and advance str so we continue with 3706 * the string... 3707 */ 3708 if (oldVars) { 3709 str += length; 3710 } else if ((eflags & VARE_UNDEFERR) || val == var_Error) { 3711 /* 3712 * If variable is undefined, complain and skip the 3713 * variable. The complaint will stop us from doing anything 3714 * when the file is parsed. 3715 */ 3716 if (!errorReported) { 3717 Parse_Error(PARSE_FATAL, "Undefined variable \"%.*s\"", 3718 length, str); 3719 } 3720 str += length; 3721 errorReported = TRUE; 3722 } else { 3723 Buf_AddByte(&buf, *str); 3724 str += 1; 3725 } 3726 } else { 3727 /* 3728 * We've now got a variable structure to store in. But first, 3729 * advance the string pointer. 3730 */ 3731 str += length; 3732 3733 /* 3734 * Copy all the characters from the variable value straight 3735 * into the new string. 3736 */ 3737 size_t val_len = strlen(val); 3738 Buf_AddBytesZ(&buf, val, val_len); 3739 trailingBslash = val_len > 0 && val[val_len - 1] == '\\'; 3740 } 3741 free(freeIt); 3742 freeIt = NULL; 3743 } 3744 } 3745 3746 return Buf_DestroyCompact(&buf); 3747 } 3748 3749 /* Initialize the module. */ 3750 void 3751 Var_Init(void) 3752 { 3753 VAR_INTERNAL = Targ_NewGN("Internal"); 3754 VAR_GLOBAL = Targ_NewGN("Global"); 3755 VAR_CMD = Targ_NewGN("Command"); 3756 } 3757 3758 3759 void 3760 Var_End(void) 3761 { 3762 Var_Stats(); 3763 } 3764 3765 void 3766 Var_Stats(void) 3767 { 3768 Hash_DebugStats(&VAR_GLOBAL->context, "VAR_GLOBAL"); 3769 } 3770 3771 3772 /****************** PRINT DEBUGGING INFO *****************/ 3773 static void 3774 VarPrintVar(void *vp, void *data MAKE_ATTR_UNUSED) 3775 { 3776 Var *v = (Var *)vp; 3777 fprintf(debug_file, "%-16s = %s\n", v->name, Buf_GetAllZ(&v->val, NULL)); 3778 } 3779 3780 /*- 3781 *----------------------------------------------------------------------- 3782 * Var_Dump -- 3783 * print all variables in a context 3784 *----------------------------------------------------------------------- 3785 */ 3786 void 3787 Var_Dump(GNode *ctxt) 3788 { 3789 Hash_ForEach(&ctxt->context, VarPrintVar, NULL); 3790 } 3791
Indexes created Thu Sep 25 16:09:42 GMT 2025