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