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