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