arch.c revision 1.92
1/* $NetBSD: arch.c,v 1.92 2020/08/23 16:58:02 rillig Exp $ */ 2 3/* 4 * Copyright (c) 1988, 1989, 1990, 1993 5 * The Regents of the University of California. All rights reserved. 6 * 7 * This code is derived from software contributed to Berkeley by 8 * Adam de Boor. 9 * 10 * Redistribution and use in source and binary forms, with or without 11 * modification, are permitted provided that the following conditions 12 * are met: 13 * 1. Redistributions of source code must retain the above copyright 14 * notice, this list of conditions and the following disclaimer. 15 * 2. Redistributions in binary form must reproduce the above copyright 16 * notice, this list of conditions and the following disclaimer in the 17 * documentation and/or other materials provided with the distribution. 18 * 3. Neither the name of the University nor the names of its contributors 19 * may be used to endorse or promote products derived from this software 20 * without specific prior written permission. 21 * 22 * THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND 23 * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE 24 * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE 25 * ARE DISCLAIMED. IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE 26 * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL 27 * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS 28 * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) 29 * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT 30 * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY 31 * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF 32 * SUCH DAMAGE. 33 */ 34 35/* 36 * Copyright (c) 1989 by Berkeley Softworks 37 * All rights reserved. 38 * 39 * This code is derived from software contributed to Berkeley by 40 * Adam de Boor. 41 * 42 * Redistribution and use in source and binary forms, with or without 43 * modification, are permitted provided that the following conditions 44 * are met: 45 * 1. Redistributions of source code must retain the above copyright 46 * notice, this list of conditions and the following disclaimer. 47 * 2. Redistributions in binary form must reproduce the above copyright 48 * notice, this list of conditions and the following disclaimer in the 49 * documentation and/or other materials provided with the distribution. 50 * 3. All advertising materials mentioning features or use of this software 51 * must display the following acknowledgement: 52 * This product includes software developed by the University of 53 * California, Berkeley and its contributors. 54 * 4. Neither the name of the University nor the names of its contributors 55 * may be used to endorse or promote products derived from this software 56 * without specific prior written permission. 57 * 58 * THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND 59 * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE 60 * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE 61 * ARE DISCLAIMED. IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE 62 * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL 63 * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS 64 * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) 65 * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT 66 * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY 67 * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF 68 * SUCH DAMAGE. 69 */ 70 71#ifndef MAKE_NATIVE 72static char rcsid[] = "$NetBSD: arch.c,v 1.92 2020/08/23 16:58:02 rillig Exp $"; 73#else 74#include <sys/cdefs.h> 75#ifndef lint 76#if 0 77static char sccsid[] = "@(#)arch.c 8.2 (Berkeley) 1/2/94"; 78#else 79__RCSID("$NetBSD: arch.c,v 1.92 2020/08/23 16:58:02 rillig Exp $"); 80#endif 81#endif /* not lint */ 82#endif 83 84/*- 85 * arch.c -- 86 * Functions to manipulate libraries, archives and their members. 87 * 88 * Once again, cacheing/hashing comes into play in the manipulation 89 * of archives. The first time an archive is referenced, all of its members' 90 * headers are read and hashed and the archive closed again. All hashed 91 * archives are kept on a list which is searched each time an archive member 92 * is referenced. 93 * 94 * The interface to this module is: 95 * Arch_ParseArchive Given an archive specification, return a list 96 * of GNode's, one for each member in the spec. 97 * FAILURE is returned if the specification is 98 * invalid for some reason. 99 * 100 * Arch_Touch Alter the modification time of the archive 101 * member described by the given node to be 102 * the current time. 103 * 104 * Arch_TouchLib Update the modification time of the library 105 * described by the given node. This is special 106 * because it also updates the modification time 107 * of the library's table of contents. 108 * 109 * Arch_MTime Find the modification time of a member of 110 * an archive *in the archive*. The time is also 111 * placed in the member's GNode. Returns the 112 * modification time. 113 * 114 * Arch_MemTime Find the modification time of a member of 115 * an archive. Called when the member doesn't 116 * already exist. Looks in the archive for the 117 * modification time. Returns the modification 118 * time. 119 * 120 * Arch_FindLib Search for a library along a path. The 121 * library name in the GNode should be in 122 * -l<name> format. 123 * 124 * Arch_LibOODate Special function to decide if a library node 125 * is out-of-date. 126 * 127 * Arch_Init Initialize this module. 128 * 129 * Arch_End Cleanup this module. 130 */ 131 132#include <sys/types.h> 133#include <sys/stat.h> 134#include <sys/time.h> 135#include <sys/param.h> 136 137#include <ar.h> 138#include <ctype.h> 139#include <stdio.h> 140#include <stdlib.h> 141#include <utime.h> 142 143#include "make.h" 144#include "hash.h" 145#include "dir.h" 146#include "config.h" 147 148#ifdef TARGET_MACHINE 149#undef MAKE_MACHINE 150#define MAKE_MACHINE TARGET_MACHINE 151#endif 152#ifdef TARGET_MACHINE_ARCH 153#undef MAKE_MACHINE_ARCH 154#define MAKE_MACHINE_ARCH TARGET_MACHINE_ARCH 155#endif 156 157static Lst archives; /* Lst of archives we've already examined */ 158 159typedef struct Arch { 160 char *name; /* Name of archive */ 161 Hash_Table members; /* All the members of the archive described 162 * by <name, struct ar_hdr *> key/value pairs */ 163 char *fnametab; /* Extended name table strings */ 164 size_t fnamesize; /* Size of the string table */ 165} Arch; 166 167static int ArchFindArchive(const void *, const void *); 168#ifdef CLEANUP 169static void ArchFree(void *); 170#endif 171static struct ar_hdr *ArchStatMember(const char *, const char *, Boolean); 172static FILE *ArchFindMember(const char *, const char *, 173 struct ar_hdr *, const char *); 174#if defined(__svr4__) || defined(__SVR4) || defined(__ELF__) 175#define SVR4ARCHIVES 176static int ArchSVR4Entry(Arch *, char *, size_t, FILE *); 177#endif 178 179#ifdef CLEANUP 180/*- 181 *----------------------------------------------------------------------- 182 * ArchFree -- 183 * Free memory used by an archive 184 * 185 * Results: 186 * None. 187 * 188 * Side Effects: 189 * None. 190 * 191 *----------------------------------------------------------------------- 192 */ 193static void 194ArchFree(void *ap) 195{ 196 Arch *a = (Arch *)ap; 197 Hash_Search search; 198 Hash_Entry *entry; 199 200 /* Free memory from hash entries */ 201 for (entry = Hash_EnumFirst(&a->members, &search); 202 entry != NULL; 203 entry = Hash_EnumNext(&search)) 204 free(Hash_GetValue(entry)); 205 206 free(a->name); 207 free(a->fnametab); 208 Hash_DeleteTable(&a->members); 209 free(a); 210} 211#endif 212 213 214 215/*- 216 *----------------------------------------------------------------------- 217 * Arch_ParseArchive -- 218 * Parse the archive specification in the given line and find/create 219 * the nodes for the specified archive members, placing their nodes 220 * on the given list. 221 * 222 * Input: 223 * linePtr Pointer to start of specification 224 * nodeLst Lst on which to place the nodes 225 * ctxt Context in which to expand variables 226 * 227 * Results: 228 * SUCCESS if it was a valid specification. The linePtr is updated 229 * to point to the first non-space after the archive spec. The 230 * nodes for the members are placed on the given list. 231 * 232 * Side Effects: 233 * Some nodes may be created. The given list is extended. 234 * 235 *----------------------------------------------------------------------- 236 */ 237ReturnStatus 238Arch_ParseArchive(char **linePtr, Lst nodeLst, GNode *ctxt) 239{ 240 char *cp; /* Pointer into line */ 241 GNode *gn; /* New node */ 242 char *libName; /* Library-part of specification */ 243 char *memName; /* Member-part of specification */ 244 char *nameBuf; /* temporary place for node name */ 245 char saveChar; /* Ending delimiter of member-name */ 246 Boolean subLibName; /* TRUE if libName should have/had 247 * variable substitution performed on it */ 248 249 libName = *linePtr; 250 251 subLibName = FALSE; 252 253 for (cp = libName; *cp != '(' && *cp != '\0'; cp++) { 254 if (*cp == '$') { 255 /* 256 * Variable spec, so call the Var module to parse the puppy 257 * so we can safely advance beyond it... 258 */ 259 int length; 260 void *freeIt; 261 const char *result; 262 263 result = Var_Parse(cp, ctxt, VARE_UNDEFERR|VARE_WANTRES, 264 &length, &freeIt); 265 free(freeIt); 266 267 if (result == var_Error) { 268 return FAILURE; 269 } else { 270 subLibName = TRUE; 271 } 272 273 cp += length-1; 274 } 275 } 276 277 *cp++ = '\0'; 278 if (subLibName) { 279 libName = Var_Subst(libName, ctxt, VARE_UNDEFERR|VARE_WANTRES); 280 } 281 282 283 for (;;) { 284 /* 285 * First skip to the start of the member's name, mark that 286 * place and skip to the end of it (either white-space or 287 * a close paren). 288 */ 289 Boolean doSubst = FALSE; /* TRUE if need to substitute in memName */ 290 291 while (*cp != '\0' && *cp != ')' && isspace ((unsigned char)*cp)) { 292 cp++; 293 } 294 memName = cp; 295 while (*cp != '\0' && *cp != ')' && !isspace ((unsigned char)*cp)) { 296 if (*cp == '$') { 297 /* 298 * Variable spec, so call the Var module to parse the puppy 299 * so we can safely advance beyond it... 300 */ 301 int length; 302 void *freeIt; 303 const char *result; 304 305 result = Var_Parse(cp, ctxt, VARE_UNDEFERR|VARE_WANTRES, 306 &length, &freeIt); 307 free(freeIt); 308 309 if (result == var_Error) { 310 return FAILURE; 311 } else { 312 doSubst = TRUE; 313 } 314 315 cp += length; 316 } else { 317 cp++; 318 } 319 } 320 321 /* 322 * If the specification ends without a closing parenthesis, 323 * chances are there's something wrong (like a missing backslash), 324 * so it's better to return failure than allow such things to happen 325 */ 326 if (*cp == '\0') { 327 printf("No closing parenthesis in archive specification\n"); 328 return FAILURE; 329 } 330 331 /* 332 * If we didn't move anywhere, we must be done 333 */ 334 if (cp == memName) { 335 break; 336 } 337 338 saveChar = *cp; 339 *cp = '\0'; 340 341 /* 342 * XXX: This should be taken care of intelligently by 343 * SuffExpandChildren, both for the archive and the member portions. 344 */ 345 /* 346 * If member contains variables, try and substitute for them. 347 * This will slow down archive specs with dynamic sources, of course, 348 * since we'll be (non-)substituting them three times, but them's 349 * the breaks -- we need to do this since SuffExpandChildren calls 350 * us, otherwise we could assume the thing would be taken care of 351 * later. 352 */ 353 if (doSubst) { 354 char *buf; 355 char *sacrifice; 356 char *oldMemName = memName; 357 358 memName = Var_Subst(memName, ctxt, VARE_UNDEFERR | VARE_WANTRES); 359 360 /* 361 * Now form an archive spec and recurse to deal with nested 362 * variables and multi-word variable values.... The results 363 * are just placed at the end of the nodeLst we're returning. 364 */ 365 buf = sacrifice = str_concat4(libName, "(", memName, ")"); 366 367 if (strchr(memName, '$') && strcmp(memName, oldMemName) == 0) { 368 /* 369 * Must contain dynamic sources, so we can't deal with it now. 370 * Just create an ARCHV node for the thing and let 371 * SuffExpandChildren handle it... 372 */ 373 gn = Targ_FindNode(buf, TARG_CREATE); 374 375 if (gn == NULL) { 376 free(buf); 377 return FAILURE; 378 } else { 379 gn->type |= OP_ARCHV; 380 Lst_AppendS(nodeLst, gn); 381 } 382 } else if (Arch_ParseArchive(&sacrifice, nodeLst, ctxt)!=SUCCESS) { 383 /* 384 * Error in nested call -- free buffer and return FAILURE 385 * ourselves. 386 */ 387 free(buf); 388 return FAILURE; 389 } 390 /* 391 * Free buffer and continue with our work. 392 */ 393 free(buf); 394 } else if (Dir_HasWildcards(memName)) { 395 Lst members = Lst_Init(); 396 size_t sz = MAXPATHLEN, nsz; 397 nameBuf = bmake_malloc(sz); 398 399 Dir_Expand(memName, dirSearchPath, members); 400 while (!Lst_IsEmpty(members)) { 401 char *member = Lst_DequeueS(members); 402 nsz = strlen(libName) + strlen(member) + 3; 403 if (sz > nsz) 404 nameBuf = bmake_realloc(nameBuf, sz = nsz * 2); 405 406 snprintf(nameBuf, sz, "%s(%s)", libName, member); 407 free(member); 408 gn = Targ_FindNode(nameBuf, TARG_CREATE); 409 if (gn == NULL) { 410 free(nameBuf); 411 return FAILURE; 412 } else { 413 /* 414 * We've found the node, but have to make sure the rest of 415 * the world knows it's an archive member, without having 416 * to constantly check for parentheses, so we type the 417 * thing with the OP_ARCHV bit before we place it on the 418 * end of the provided list. 419 */ 420 gn->type |= OP_ARCHV; 421 Lst_AppendS(nodeLst, gn); 422 } 423 } 424 Lst_Destroy(members, NULL); 425 free(nameBuf); 426 } else { 427 size_t sz = strlen(libName) + strlen(memName) + 3; 428 nameBuf = bmake_malloc(sz); 429 snprintf(nameBuf, sz, "%s(%s)", libName, memName); 430 gn = Targ_FindNode(nameBuf, TARG_CREATE); 431 free(nameBuf); 432 if (gn == NULL) { 433 return FAILURE; 434 } else { 435 /* 436 * We've found the node, but have to make sure the rest of the 437 * world knows it's an archive member, without having to 438 * constantly check for parentheses, so we type the thing with 439 * the OP_ARCHV bit before we place it on the end of the 440 * provided list. 441 */ 442 gn->type |= OP_ARCHV; 443 Lst_AppendS(nodeLst, gn); 444 } 445 } 446 if (doSubst) { 447 free(memName); 448 } 449 450 *cp = saveChar; 451 } 452 453 /* 454 * If substituted libName, free it now, since we need it no longer. 455 */ 456 if (subLibName) { 457 free(libName); 458 } 459 460 /* 461 * We promised the pointer would be set up at the next non-space, so 462 * we must advance cp there before setting *linePtr... (note that on 463 * entrance to the loop, cp is guaranteed to point at a ')') 464 */ 465 do { 466 cp++; 467 } while (*cp != '\0' && isspace ((unsigned char)*cp)); 468 469 *linePtr = cp; 470 return SUCCESS; 471} 472 473/*- 474 *----------------------------------------------------------------------- 475 * ArchFindArchive -- 476 * See if the given archive is the one we are looking for. Called 477 * From ArchStatMember and ArchFindMember via Lst_Find. 478 * 479 * Input: 480 * ar Current list element 481 * archName Name we want 482 * 483 * Results: 484 * 0 if it is, non-zero if it isn't. 485 * 486 * Side Effects: 487 * None. 488 * 489 *----------------------------------------------------------------------- 490 */ 491static int 492ArchFindArchive(const void *ar, const void *archName) 493{ 494 return strcmp(archName, ((const Arch *)ar)->name); 495} 496 497/*- 498 *----------------------------------------------------------------------- 499 * ArchStatMember -- 500 * Locate a member of an archive, given the path of the archive and 501 * the path of the desired member. 502 * 503 * Input: 504 * archive Path to the archive 505 * member Name of member. If it is a path, only the last 506 * component is used. 507 * hash TRUE if archive should be hashed if not already so. 508 * 509 * Results: 510 * A pointer to the current struct ar_hdr structure for the member. Note 511 * That no position is returned, so this is not useful for touching 512 * archive members. This is mostly because we have no assurances that 513 * The archive will remain constant after we read all the headers, so 514 * there's not much point in remembering the position... 515 * 516 * Side Effects: 517 * 518 *----------------------------------------------------------------------- 519 */ 520static struct ar_hdr * 521ArchStatMember(const char *archive, const char *member, Boolean hash) 522{ 523#define AR_MAX_NAME_LEN (sizeof(arh.ar_name)-1) 524 FILE * arch; /* Stream to archive */ 525 int size; /* Size of archive member */ 526 char magic[SARMAG]; 527 LstNode ln; /* Lst member containing archive descriptor */ 528 Arch *ar; /* Archive descriptor */ 529 Hash_Entry *he; /* Entry containing member's description */ 530 struct ar_hdr arh; /* archive-member header for reading archive */ 531 char memName[MAXPATHLEN+1]; 532 /* Current member name while hashing. */ 533 534 /* 535 * Because of space constraints and similar things, files are archived 536 * using their final path components, not the entire thing, so we need 537 * to point 'member' to the final component, if there is one, to make 538 * the comparisons easier... 539 */ 540 const char *base = strrchr(member, '/'); 541 if (base != NULL) { 542 member = base + 1; 543 } 544 545 ln = Lst_Find(archives, ArchFindArchive, archive); 546 if (ln != NULL) { 547 ar = Lst_DatumS(ln); 548 549 he = Hash_FindEntry(&ar->members, member); 550 551 if (he != NULL) { 552 return (struct ar_hdr *)Hash_GetValue(he); 553 } else { 554 /* Try truncated name */ 555 char copy[AR_MAX_NAME_LEN+1]; 556 size_t len = strlen(member); 557 558 if (len > AR_MAX_NAME_LEN) { 559 len = AR_MAX_NAME_LEN; 560 snprintf(copy, sizeof copy, "%s", member); 561 } 562 if ((he = Hash_FindEntry(&ar->members, copy)) != NULL) 563 return (struct ar_hdr *)Hash_GetValue(he); 564 return NULL; 565 } 566 } 567 568 if (!hash) { 569 /* 570 * Caller doesn't want the thing hashed, just use ArchFindMember 571 * to read the header for the member out and close down the stream 572 * again. Since the archive is not to be hashed, we assume there's 573 * no need to allocate extra room for the header we're returning, 574 * so just declare it static. 575 */ 576 static struct ar_hdr sarh; 577 578 arch = ArchFindMember(archive, member, &sarh, "r"); 579 580 if (arch == NULL) { 581 return NULL; 582 } else { 583 fclose(arch); 584 return &sarh; 585 } 586 } 587 588 /* 589 * We don't have this archive on the list yet, so we want to find out 590 * everything that's in it and cache it so we can get at it quickly. 591 */ 592 arch = fopen(archive, "r"); 593 if (arch == NULL) { 594 return NULL; 595 } 596 597 /* 598 * We use the ARMAG string to make sure this is an archive we 599 * can handle... 600 */ 601 if ((fread(magic, SARMAG, 1, arch) != 1) || 602 (strncmp(magic, ARMAG, SARMAG) != 0)) { 603 fclose(arch); 604 return NULL; 605 } 606 607 ar = bmake_malloc(sizeof(Arch)); 608 ar->name = bmake_strdup(archive); 609 ar->fnametab = NULL; 610 ar->fnamesize = 0; 611 Hash_InitTable(&ar->members, -1); 612 memName[AR_MAX_NAME_LEN] = '\0'; 613 614 while (fread((char *)&arh, sizeof(struct ar_hdr), 1, arch) == 1) { 615 if (strncmp( arh.ar_fmag, ARFMAG, sizeof(arh.ar_fmag)) != 0) { 616 /* 617 * The header is bogus, so the archive is bad 618 * and there's no way we can recover... 619 */ 620 goto badarch; 621 } else { 622 char *nameend; 623 624 /* 625 * We need to advance the stream's pointer to the start of the 626 * next header. Files are padded with newlines to an even-byte 627 * boundary, so we need to extract the size of the file from the 628 * 'size' field of the header and round it up during the seek. 629 */ 630 arh.ar_size[sizeof(arh.ar_size)-1] = '\0'; 631 size = (int)strtol(arh.ar_size, NULL, 10); 632 633 memcpy(memName, arh.ar_name, sizeof(arh.ar_name)); 634 nameend = memName + AR_MAX_NAME_LEN; 635 while (*nameend == ' ') { 636 nameend--; 637 } 638 nameend[1] = '\0'; 639 640#ifdef SVR4ARCHIVES 641 /* 642 * svr4 names are slash terminated. Also svr4 extended AR format. 643 */ 644 if (memName[0] == '/') { 645 /* 646 * svr4 magic mode; handle it 647 */ 648 switch (ArchSVR4Entry(ar, memName, size, arch)) { 649 case -1: /* Invalid data */ 650 goto badarch; 651 case 0: /* List of files entry */ 652 continue; 653 default: /* Got the entry */ 654 break; 655 } 656 } 657 else { 658 if (nameend[0] == '/') 659 nameend[0] = '\0'; 660 } 661#endif 662 663#ifdef AR_EFMT1 664 /* 665 * BSD 4.4 extended AR format: #1/<namelen>, with name as the 666 * first <namelen> bytes of the file 667 */ 668 if (strncmp(memName, AR_EFMT1, sizeof(AR_EFMT1) - 1) == 0 && 669 isdigit((unsigned char)memName[sizeof(AR_EFMT1) - 1])) { 670 671 unsigned int elen = atoi(&memName[sizeof(AR_EFMT1)-1]); 672 673 if (elen > MAXPATHLEN) 674 goto badarch; 675 if (fread(memName, elen, 1, arch) != 1) 676 goto badarch; 677 memName[elen] = '\0'; 678 if (fseek(arch, -elen, SEEK_CUR) != 0) 679 goto badarch; 680 if (DEBUG(ARCH) || DEBUG(MAKE)) { 681 fprintf(debug_file, "ArchStat: Extended format entry for %s\n", memName); 682 } 683 } 684#endif 685 686 he = Hash_CreateEntry(&ar->members, memName, NULL); 687 Hash_SetValue(he, bmake_malloc(sizeof(struct ar_hdr))); 688 memcpy(Hash_GetValue(he), &arh, sizeof(struct ar_hdr)); 689 } 690 if (fseek(arch, (size + 1) & ~1, SEEK_CUR) != 0) 691 goto badarch; 692 } 693 694 fclose(arch); 695 696 Lst_AppendS(archives, ar); 697 698 /* 699 * Now that the archive has been read and cached, we can look into 700 * the hash table to find the desired member's header. 701 */ 702 he = Hash_FindEntry(&ar->members, member); 703 704 if (he != NULL) { 705 return (struct ar_hdr *)Hash_GetValue(he); 706 } else { 707 return NULL; 708 } 709 710badarch: 711 fclose(arch); 712 Hash_DeleteTable(&ar->members); 713 free(ar->fnametab); 714 free(ar); 715 return NULL; 716} 717 718#ifdef SVR4ARCHIVES 719/*- 720 *----------------------------------------------------------------------- 721 * ArchSVR4Entry -- 722 * Parse an SVR4 style entry that begins with a slash. 723 * If it is "//", then load the table of filenames 724 * If it is "/<offset>", then try to substitute the long file name 725 * from offset of a table previously read. 726 * 727 * Results: 728 * -1: Bad data in archive 729 * 0: A table was loaded from the file 730 * 1: Name was successfully substituted from table 731 * 2: Name was not successfully substituted from table 732 * 733 * Side Effects: 734 * If a table is read, the file pointer is moved to the next archive 735 * member 736 * 737 *----------------------------------------------------------------------- 738 */ 739static int 740ArchSVR4Entry(Arch *ar, char *name, size_t size, FILE *arch) 741{ 742#define ARLONGNAMES1 "//" 743#define ARLONGNAMES2 "/ARFILENAMES" 744 size_t entry; 745 char *ptr, *eptr; 746 747 if (strncmp(name, ARLONGNAMES1, sizeof(ARLONGNAMES1) - 1) == 0 || 748 strncmp(name, ARLONGNAMES2, sizeof(ARLONGNAMES2) - 1) == 0) { 749 750 if (ar->fnametab != NULL) { 751 if (DEBUG(ARCH)) { 752 fprintf(debug_file, "Attempted to redefine an SVR4 name table\n"); 753 } 754 return -1; 755 } 756 757 /* 758 * This is a table of archive names, so we build one for 759 * ourselves 760 */ 761 ar->fnametab = bmake_malloc(size); 762 ar->fnamesize = size; 763 764 if (fread(ar->fnametab, size, 1, arch) != 1) { 765 if (DEBUG(ARCH)) { 766 fprintf(debug_file, "Reading an SVR4 name table failed\n"); 767 } 768 return -1; 769 } 770 eptr = ar->fnametab + size; 771 for (entry = 0, ptr = ar->fnametab; ptr < eptr; ptr++) 772 switch (*ptr) { 773 case '/': 774 entry++; 775 *ptr = '\0'; 776 break; 777 778 case '\n': 779 break; 780 781 default: 782 break; 783 } 784 if (DEBUG(ARCH)) { 785 fprintf(debug_file, "Found svr4 archive name table with %lu entries\n", 786 (unsigned long)entry); 787 } 788 return 0; 789 } 790 791 if (name[1] == ' ' || name[1] == '\0') 792 return 2; 793 794 entry = (size_t)strtol(&name[1], &eptr, 0); 795 if ((*eptr != ' ' && *eptr != '\0') || eptr == &name[1]) { 796 if (DEBUG(ARCH)) { 797 fprintf(debug_file, "Could not parse SVR4 name %s\n", name); 798 } 799 return 2; 800 } 801 if (entry >= ar->fnamesize) { 802 if (DEBUG(ARCH)) { 803 fprintf(debug_file, "SVR4 entry offset %s is greater than %lu\n", 804 name, (unsigned long)ar->fnamesize); 805 } 806 return 2; 807 } 808 809 if (DEBUG(ARCH)) { 810 fprintf(debug_file, "Replaced %s with %s\n", name, &ar->fnametab[entry]); 811 } 812 813 snprintf(name, MAXPATHLEN + 1, "%s", &ar->fnametab[entry]); 814 return 1; 815} 816#endif 817 818 819/*- 820 *----------------------------------------------------------------------- 821 * ArchFindMember -- 822 * Locate a member of an archive, given the path of the archive and 823 * the path of the desired member. If the archive is to be modified, 824 * the mode should be "r+", if not, it should be "r". 825 * 826 * Input: 827 * archive Path to the archive 828 * member Name of member. If it is a path, only the last 829 * component is used. 830 * arhPtr Pointer to header structure to be filled in 831 * mode The mode for opening the stream 832 * 833 * Results: 834 * An FILE *, opened for reading and writing, positioned at the 835 * start of the member's struct ar_hdr, or NULL if the member was 836 * nonexistent. The current struct ar_hdr for member. 837 * 838 * Side Effects: 839 * The passed struct ar_hdr structure is filled in. 840 * 841 *----------------------------------------------------------------------- 842 */ 843static FILE * 844ArchFindMember(const char *archive, const char *member, struct ar_hdr *arhPtr, 845 const char *mode) 846{ 847 FILE * arch; /* Stream to archive */ 848 int size; /* Size of archive member */ 849 char magic[SARMAG]; 850 size_t len, tlen; 851 const char * base; 852 853 arch = fopen(archive, mode); 854 if (arch == NULL) { 855 return NULL; 856 } 857 858 /* 859 * We use the ARMAG string to make sure this is an archive we 860 * can handle... 861 */ 862 if ((fread(magic, SARMAG, 1, arch) != 1) || 863 (strncmp(magic, ARMAG, SARMAG) != 0)) { 864 fclose(arch); 865 return NULL; 866 } 867 868 /* 869 * Because of space constraints and similar things, files are archived 870 * using their final path components, not the entire thing, so we need 871 * to point 'member' to the final component, if there is one, to make 872 * the comparisons easier... 873 */ 874 base = strrchr(member, '/'); 875 if (base != NULL) { 876 member = base + 1; 877 } 878 len = tlen = strlen(member); 879 if (len > sizeof(arhPtr->ar_name)) { 880 tlen = sizeof(arhPtr->ar_name); 881 } 882 883 while (fread((char *)arhPtr, sizeof(struct ar_hdr), 1, arch) == 1) { 884 if (strncmp(arhPtr->ar_fmag, ARFMAG, sizeof(arhPtr->ar_fmag) ) != 0) { 885 /* 886 * The header is bogus, so the archive is bad 887 * and there's no way we can recover... 888 */ 889 fclose(arch); 890 return NULL; 891 } else if (strncmp(member, arhPtr->ar_name, tlen) == 0) { 892 /* 893 * If the member's name doesn't take up the entire 'name' field, 894 * we have to be careful of matching prefixes. Names are space- 895 * padded to the right, so if the character in 'name' at the end 896 * of the matched string is anything but a space, this isn't the 897 * member we sought. 898 */ 899 if (tlen != sizeof(arhPtr->ar_name) && arhPtr->ar_name[tlen] != ' '){ 900 goto skip; 901 } else { 902 /* 903 * To make life easier, we reposition the file at the start 904 * of the header we just read before we return the stream. 905 * In a more general situation, it might be better to leave 906 * the file at the actual member, rather than its header, but 907 * not here... 908 */ 909 if (fseek(arch, -sizeof(struct ar_hdr), SEEK_CUR) != 0) { 910 fclose(arch); 911 return NULL; 912 } 913 return arch; 914 } 915 } else 916#ifdef AR_EFMT1 917 /* 918 * BSD 4.4 extended AR format: #1/<namelen>, with name as the 919 * first <namelen> bytes of the file 920 */ 921 if (strncmp(arhPtr->ar_name, AR_EFMT1, 922 sizeof(AR_EFMT1) - 1) == 0 && 923 isdigit((unsigned char)arhPtr->ar_name[sizeof(AR_EFMT1) - 1])) { 924 925 unsigned int elen = atoi(&arhPtr->ar_name[sizeof(AR_EFMT1)-1]); 926 char ename[MAXPATHLEN + 1]; 927 928 if (elen > MAXPATHLEN) { 929 fclose(arch); 930 return NULL; 931 } 932 if (fread(ename, elen, 1, arch) != 1) { 933 fclose(arch); 934 return NULL; 935 } 936 ename[elen] = '\0'; 937 if (DEBUG(ARCH) || DEBUG(MAKE)) { 938 fprintf(debug_file, "ArchFind: Extended format entry for %s\n", ename); 939 } 940 if (strncmp(ename, member, len) == 0) { 941 /* Found as extended name */ 942 if (fseek(arch, -sizeof(struct ar_hdr) - elen, 943 SEEK_CUR) != 0) { 944 fclose(arch); 945 return NULL; 946 } 947 return arch; 948 } 949 if (fseek(arch, -elen, SEEK_CUR) != 0) { 950 fclose(arch); 951 return NULL; 952 } 953 goto skip; 954 } else 955#endif 956 { 957skip: 958 /* 959 * This isn't the member we're after, so we need to advance the 960 * stream's pointer to the start of the next header. Files are 961 * padded with newlines to an even-byte boundary, so we need to 962 * extract the size of the file from the 'size' field of the 963 * header and round it up during the seek. 964 */ 965 arhPtr->ar_size[sizeof(arhPtr->ar_size)-1] = '\0'; 966 size = (int)strtol(arhPtr->ar_size, NULL, 10); 967 if (fseek(arch, (size + 1) & ~1, SEEK_CUR) != 0) { 968 fclose(arch); 969 return NULL; 970 } 971 } 972 } 973 974 /* 975 * We've looked everywhere, but the member is not to be found. Close the 976 * archive and return NULL -- an error. 977 */ 978 fclose(arch); 979 return NULL; 980} 981 982/*- 983 *----------------------------------------------------------------------- 984 * Arch_Touch -- 985 * Touch a member of an archive. 986 * 987 * Input: 988 * gn Node of member to touch 989 * 990 * Results: 991 * The 'time' field of the member's header is updated. 992 * 993 * Side Effects: 994 * The modification time of the entire archive is also changed. 995 * For a library, this could necessitate the re-ranlib'ing of the 996 * whole thing. 997 * 998 *----------------------------------------------------------------------- 999 */ 1000void 1001Arch_Touch(GNode *gn) 1002{ 1003 FILE * arch; /* Stream open to archive, positioned properly */ 1004 struct ar_hdr arh; /* Current header describing member */ 1005 char *p1, *p2; 1006 1007 arch = ArchFindMember(Var_Value(ARCHIVE, gn, &p1), 1008 Var_Value(MEMBER, gn, &p2), 1009 &arh, "r+"); 1010 1011 bmake_free(p1); 1012 bmake_free(p2); 1013 1014 snprintf(arh.ar_date, sizeof(arh.ar_date), "%-12ld", (long) now); 1015 1016 if (arch != NULL) { 1017 (void)fwrite((char *)&arh, sizeof(struct ar_hdr), 1, arch); 1018 fclose(arch); 1019 } 1020} 1021 1022/*- 1023 *----------------------------------------------------------------------- 1024 * Arch_TouchLib -- 1025 * Given a node which represents a library, touch the thing, making 1026 * sure that the table of contents also is touched. 1027 * 1028 * Input: 1029 * gn The node of the library to touch 1030 * 1031 * Results: 1032 * None. 1033 * 1034 * Side Effects: 1035 * Both the modification time of the library and of the RANLIBMAG 1036 * member are set to 'now'. 1037 * 1038 *----------------------------------------------------------------------- 1039 */ 1040void 1041Arch_TouchLib(GNode *gn) 1042{ 1043#ifdef RANLIBMAG 1044 FILE * arch; /* Stream open to archive */ 1045 struct ar_hdr arh; /* Header describing table of contents */ 1046 struct utimbuf times; /* Times for utime() call */ 1047 1048 arch = ArchFindMember(gn->path, RANLIBMAG, &arh, "r+"); 1049 snprintf(arh.ar_date, sizeof(arh.ar_date), "%-12ld", (long) now); 1050 1051 if (arch != NULL) { 1052 (void)fwrite((char *)&arh, sizeof(struct ar_hdr), 1, arch); 1053 fclose(arch); 1054 1055 times.actime = times.modtime = now; 1056 utime(gn->path, ×); 1057 } 1058#else 1059 (void)gn; 1060#endif 1061} 1062 1063/*- 1064 *----------------------------------------------------------------------- 1065 * Arch_MTime -- 1066 * Return the modification time of a member of an archive. 1067 * 1068 * Input: 1069 * gn Node describing archive member 1070 * 1071 * Results: 1072 * The modification time(seconds). 1073 * 1074 * Side Effects: 1075 * The mtime field of the given node is filled in with the value 1076 * returned by the function. 1077 * 1078 *----------------------------------------------------------------------- 1079 */ 1080time_t 1081Arch_MTime(GNode *gn) 1082{ 1083 struct ar_hdr *arhPtr; /* Header of desired member */ 1084 time_t modTime; /* Modification time as an integer */ 1085 char *p1, *p2; 1086 1087 arhPtr = ArchStatMember(Var_Value(ARCHIVE, gn, &p1), 1088 Var_Value(MEMBER, gn, &p2), 1089 TRUE); 1090 1091 bmake_free(p1); 1092 bmake_free(p2); 1093 1094 if (arhPtr != NULL) { 1095 modTime = (time_t)strtol(arhPtr->ar_date, NULL, 10); 1096 } else { 1097 modTime = 0; 1098 } 1099 1100 gn->mtime = modTime; 1101 return modTime; 1102} 1103 1104/*- 1105 *----------------------------------------------------------------------- 1106 * Arch_MemMTime -- 1107 * Given a non-existent archive member's node, get its modification 1108 * time from its archived form, if it exists. 1109 * 1110 * Results: 1111 * The modification time. 1112 * 1113 * Side Effects: 1114 * The mtime field is filled in. 1115 * 1116 *----------------------------------------------------------------------- 1117 */ 1118time_t 1119Arch_MemMTime(GNode *gn) 1120{ 1121 LstNode ln; 1122 GNode *pgn; 1123 char *nameStart, 1124 *nameEnd; 1125 1126 Lst_OpenS(gn->parents); 1127 while ((ln = Lst_NextS(gn->parents)) != NULL) { 1128 pgn = Lst_DatumS(ln); 1129 1130 if (pgn->type & OP_ARCHV) { 1131 /* 1132 * If the parent is an archive specification and is being made 1133 * and its member's name matches the name of the node we were 1134 * given, record the modification time of the parent in the 1135 * child. We keep searching its parents in case some other 1136 * parent requires this child to exist... 1137 */ 1138 nameStart = strchr(pgn->name, '(') + 1; 1139 nameEnd = strchr(nameStart, ')'); 1140 1141 if ((pgn->flags & REMAKE) && 1142 strncmp(nameStart, gn->name, nameEnd - nameStart) == 0) { 1143 gn->mtime = Arch_MTime(pgn); 1144 } 1145 } else if (pgn->flags & REMAKE) { 1146 /* 1147 * Something which isn't a library depends on the existence of 1148 * this target, so it needs to exist. 1149 */ 1150 gn->mtime = 0; 1151 break; 1152 } 1153 } 1154 1155 Lst_CloseS(gn->parents); 1156 1157 return gn->mtime; 1158} 1159 1160/*- 1161 *----------------------------------------------------------------------- 1162 * Arch_FindLib -- 1163 * Search for a library along the given search path. 1164 * 1165 * Input: 1166 * gn Node of library to find 1167 * path Search path 1168 * 1169 * Results: 1170 * None. 1171 * 1172 * Side Effects: 1173 * The node's 'path' field is set to the found path (including the 1174 * actual file name, not -l...). If the system can handle the -L 1175 * flag when linking (or we cannot find the library), we assume that 1176 * the user has placed the .LIBRARIES variable in the final linking 1177 * command (or the linker will know where to find it) and set the 1178 * TARGET variable for this node to be the node's name. Otherwise, 1179 * we set the TARGET variable to be the full path of the library, 1180 * as returned by Dir_FindFile. 1181 * 1182 *----------------------------------------------------------------------- 1183 */ 1184void 1185Arch_FindLib(GNode *gn, Lst path) 1186{ 1187 char *libName; /* file name for archive */ 1188 size_t sz = strlen(gn->name) + 6 - 2; 1189 1190 libName = bmake_malloc(sz); 1191 snprintf(libName, sz, "lib%s.a", &gn->name[2]); 1192 1193 gn->path = Dir_FindFile(libName, path); 1194 1195 free(libName); 1196 1197#ifdef LIBRARIES 1198 Var_Set(TARGET, gn->name, gn); 1199#else 1200 Var_Set(TARGET, gn->path == NULL ? gn->name : gn->path, gn); 1201#endif /* LIBRARIES */ 1202} 1203 1204/*- 1205 *----------------------------------------------------------------------- 1206 * Arch_LibOODate -- 1207 * Decide if a node with the OP_LIB attribute is out-of-date. Called 1208 * from Make_OODate to make its life easier. 1209 * 1210 * There are several ways for a library to be out-of-date that are 1211 * not available to ordinary files. In addition, there are ways 1212 * that are open to regular files that are not available to 1213 * libraries. A library that is only used as a source is never 1214 * considered out-of-date by itself. This does not preclude the 1215 * library's modification time from making its parent be out-of-date. 1216 * A library will be considered out-of-date for any of these reasons, 1217 * given that it is a target on a dependency line somewhere: 1218 * Its modification time is less than that of one of its 1219 * sources (gn->mtime < gn->cmgn->mtime). 1220 * Its modification time is greater than the time at which the 1221 * make began (i.e. it's been modified in the course 1222 * of the make, probably by archiving). 1223 * The modification time of one of its sources is greater than 1224 * the one of its RANLIBMAG member (i.e. its table of contents 1225 * is out-of-date). We don't compare of the archive time 1226 * vs. TOC time because they can be too close. In my 1227 * opinion we should not bother with the TOC at all since 1228 * this is used by 'ar' rules that affect the data contents 1229 * of the archive, not by ranlib rules, which affect the 1230 * TOC. 1231 * 1232 * Input: 1233 * gn The library's graph node 1234 * 1235 * Results: 1236 * TRUE if the library is out-of-date. FALSE otherwise. 1237 * 1238 * Side Effects: 1239 * The library will be hashed if it hasn't been already. 1240 * 1241 *----------------------------------------------------------------------- 1242 */ 1243Boolean 1244Arch_LibOODate(GNode *gn) 1245{ 1246 Boolean oodate; 1247 1248 if (gn->type & OP_PHONY) { 1249 oodate = TRUE; 1250 } else if (OP_NOP(gn->type) && Lst_IsEmpty(gn->children)) { 1251 oodate = FALSE; 1252 } else if ((!Lst_IsEmpty(gn->children) && gn->cmgn == NULL) || 1253 (gn->mtime > now) || 1254 (gn->cmgn != NULL && gn->mtime < gn->cmgn->mtime)) { 1255 oodate = TRUE; 1256 } else { 1257#ifdef RANLIBMAG 1258 struct ar_hdr *arhPtr; /* Header for __.SYMDEF */ 1259 int modTimeTOC; /* The table-of-contents's mod time */ 1260 1261 arhPtr = ArchStatMember(gn->path, RANLIBMAG, FALSE); 1262 1263 if (arhPtr != NULL) { 1264 modTimeTOC = (int)strtol(arhPtr->ar_date, NULL, 10); 1265 1266 if (DEBUG(ARCH) || DEBUG(MAKE)) { 1267 fprintf(debug_file, "%s modified %s...", RANLIBMAG, Targ_FmtTime(modTimeTOC)); 1268 } 1269 oodate = (gn->cmgn == NULL || gn->cmgn->mtime > modTimeTOC); 1270 } else { 1271 /* 1272 * A library w/o a table of contents is out-of-date 1273 */ 1274 if (DEBUG(ARCH) || DEBUG(MAKE)) { 1275 fprintf(debug_file, "No t.o.c...."); 1276 } 1277 oodate = TRUE; 1278 } 1279#else 1280 oodate = FALSE; 1281#endif 1282 } 1283 return oodate; 1284} 1285 1286/*- 1287 *----------------------------------------------------------------------- 1288 * Arch_Init -- 1289 * Initialize things for this module. 1290 * 1291 * Results: 1292 * None. 1293 * 1294 * Side Effects: 1295 * The 'archives' list is initialized. 1296 * 1297 *----------------------------------------------------------------------- 1298 */ 1299void 1300Arch_Init(void) 1301{ 1302 archives = Lst_Init(); 1303} 1304 1305 1306 1307/*- 1308 *----------------------------------------------------------------------- 1309 * Arch_End -- 1310 * Cleanup things for this module. 1311 * 1312 * Results: 1313 * None. 1314 * 1315 * Side Effects: 1316 * The 'archives' list is freed 1317 * 1318 *----------------------------------------------------------------------- 1319 */ 1320void 1321Arch_End(void) 1322{ 1323#ifdef CLEANUP 1324 Lst_Destroy(archives, ArchFree); 1325#endif 1326} 1327 1328/*- 1329 *----------------------------------------------------------------------- 1330 * Arch_IsLib -- 1331 * Check if the node is a library 1332 * 1333 * Results: 1334 * True or False. 1335 * 1336 * Side Effects: 1337 * None. 1338 * 1339 *----------------------------------------------------------------------- 1340 */ 1341int 1342Arch_IsLib(GNode *gn) 1343{ 1344 static const char armag[] = "!<arch>\n"; 1345 char buf[sizeof(armag)-1]; 1346 int fd; 1347 1348 if ((fd = open(gn->path, O_RDONLY)) == -1) 1349 return FALSE; 1350 1351 if (read(fd, buf, sizeof(buf)) != sizeof(buf)) { 1352 (void)close(fd); 1353 return FALSE; 1354 } 1355 1356 (void)close(fd); 1357 1358 return memcmp(buf, armag, sizeof(buf)) == 0; 1359} 1360