1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
251
252
253
254
255
256
257
258
259
260
261
262
263
264
265
266
267
268
269
270
271
272
273
274
275
276
277
278
279
280
281
282
283
284
285
286
287
288
289
290
291
292
293
294
295
296
297
298
299
300
301
302
303
304
305
306
307
308
309
310
311
312
313
314
315
316
317
318
319
320
321
322
323
324
325
326
327
328
329
330
331
332
333
334
335
336
337
338
339
340
341
342
343
344
345
346
347
348
349
350
351
352
353
354
355
356
357
358
359
360
361
362
363
364
365
366
367
368
369
370
371
372
373
374
375
376
377
378
379
380
381
382
383
384
385
386
387
388
389
390
391
392
393
394
395
396
397
398
399
400
401
402
403
404
405
406
407
408
409
410
411
412
413
414
415
416
417
418
419
420
421
422
423
424
425
426
427
428
429
430
431
432
433
434
435
436
437
438
439
440
441
442
443
444
445
446
447
448
449
450
451
452
453
454
455
456
457
458
459
460
461
462
463
464
465
466
467
468
469
470
471
472
473
474
475
476
477
478
479
480
481
482
483
484
485
486
487
488
489
490
491
492
493
494
495
496
497
498
499
500
501
502
503
504
505
506
507
508
509
510
511
512
513
514
515
516
517
518
519
520
521
522
523
524
525
526
527
528
529
530
531
532
533
534
535
536
537
538
539
540
541
542
543
544
545
546
547
548
549
550
551
552
553
554
555
556
557
558
559
560
561
562
563
564
565
566
567
568
569
570
571
572
573
574
575
576
577
578
579
580
581
582
583
584
585
586
587
588
589
590
591
592
593
594
595
596
597
598
599
600
601
602
603
604
605
606
607
608
609
610
611
612
613
614
615
616
617
618
619
620
621
622
623
624
625
626
627
628
629
630
631
632
633
634
635
636
637
638
639
640
641
642
643
644
645
646
647
648
649
650
651
652
653
654
655
656
657
658
659
660
661
662
663
664
665
666
667
668
669
670
671
672
673
674
675
676
677
678
679
680
681
682
683
684
685
686
687
688
689
690
691
692
693
694
695
696
697
698
699
700
701
702
703
704
705
706
707
708
709
710
711
712
713
714
715
716
717
718
719
720
721
722
723
724
725
726
727
728
729
730
731
732
733
734
735
736
737
738
739
740
741
742
743
744
745
746
747
748
749
750
751
752
753
754
755
756
757
758
759
760
761
762
763
764
765
766
767
768
769
770
771
772
773
774
775
776
777
778
779
780
781
782
783
784
785
786
787
788
789
790
791
792
793
794
795
796
797
798
799
800
801
802
803
804
805
806
807
808
809
810
811
812
813
814
815
816
817
818
819
820
821
822
823
824
825
826
827
828
829
830
831
832
833
834
835
836
837
838
839
840
841
842
843
844
845
846
847
848
849
850
851
852
853
854
855
856
857
858
859
860
861
862
863
864
865
866
867
868
869
870
871
872
873
874
875
876
877
878
879
880
881
882
883
884
885
886
887
888
889
890
891
892
893
894
895
896
897
898
899
900
901
902
903
904
905
906
907
908
909
910
911
912
913
914
915
916
917
918
919
920
921
922
923
924
925
926
927
928
929
930
931
932
933
934
935
936
937
938
939
940
941
942
943
944
945
946
947
948
949
950
951
952
953
954
955
956
957
958
959
960
961
962
963
964
965
966
967
968
969
970
971
972
973
974
975
976
977
978
979
980
981
982
983
984
985
986
987
988
989
990
991
992
993
994
995
996
997
998
999
1000
1001
1002
1003
1004
1005
1006
1007
1008
1009
1010
1011
1012
1013
1014
1015
1016
1017
1018
1019
1020
1021
1022
1023
1024
1025
1026
1027
1028
1029
1030
1031
1032
1033
1034
1035
1036
1037
1038
1039
1040
1041
1042
1043
1044
1045
1046
1047
1048
1049
1050
1051
1052
1053
1054
1055
1056
1057
1058
1059
1060
1061
1062
1063
1064
1065
1066
1067
1068
1069
1070
1071
1072
1073
1074
1075
1076
1077
1078
1079
1080
1081
1082
1083
1084
1085
1086
1087
|
/* $OpenPackages$ */
/* $OpenBSD: arch.c,v 1.46 2001/05/29 12:53:38 espie Exp $ */
/* $NetBSD: arch.c,v 1.17 1996/11/06 17:58:59 christos Exp $ */
/*
* Copyright (c) 1999,2000 Marc Espie.
*
* Extensive code changes for the OpenBSD project.
*
* Redistribution and use in source and binary forms, with or without
* modification, are permitted provided that the following conditions
* are met:
* 1. Redistributions of source code must retain the above copyright
* notice, this list of conditions and the following disclaimer.
* 2. Redistributions in binary form must reproduce the above copyright
* notice, this list of conditions and the following disclaimer in the
* documentation and/or other materials provided with the distribution.
*
* THIS SOFTWARE IS PROVIDED BY THE OPENBSD PROJECT AND CONTRIBUTORS
* ``AS IS'' AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT
* LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR
* A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE OPENBSD
* PROJECT OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL,
* SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT
* LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE,
* DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY
* THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT
* (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE
* OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
*/
/*
* Copyright (c) 1988, 1989, 1990, 1993
* The Regents of the University of California. All rights reserved.
* Copyright (c) 1989 by Berkeley Softworks
* All rights reserved.
*
* This code is derived from software contributed to Berkeley by
* Adam de Boor.
*
* Redistribution and use in source and binary forms, with or without
* modification, are permitted provided that the following conditions
* are met:
* 1. Redistributions of source code must retain the above copyright
* notice, this list of conditions and the following disclaimer.
* 2. Redistributions in binary form must reproduce the above copyright
* notice, this list of conditions and the following disclaimer in the
* documentation and/or other materials provided with the distribution.
* 3. All advertising materials mentioning features or use of this software
* must display the following acknowledgement:
* This product includes software developed by the University of
* California, Berkeley and its contributors.
* 4. Neither the name of the University nor the names of its contributors
* may be used to endorse or promote products derived from this software
* without specific prior written permission.
*
* THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND
* ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
* IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
* ARE DISCLAIMED. IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE
* FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
* DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
* OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
* HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
* LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
* OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
* SUCH DAMAGE.
*/
/*
* Once again, cacheing/hashing comes into play in the manipulation
* of archives. The first time an archive is referenced, all of its members'
* headers are read and hashed and the archive closed again. All hashed
* archives are kept in a hash (archives) which is searched each time
* an archive member is referenced.
*
*/
#include <sys/param.h>
#include <sys/types.h>
#include <ar.h>
#include <assert.h>
#include <ctype.h>
#include <fcntl.h>
#include <limits.h>
#include <stddef.h>
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#include <unistd.h>
#include "ohash.h"
#include "config.h"
#include "defines.h"
#include "dir.h"
#include "arch.h"
#include "var.h"
#include "targ.h"
#include "memory.h"
#include "gnode.h"
#include "timestamp.h"
#include "lst.h"
#ifdef TARGET_MACHINE
#undef MACHINE
#define MACHINE TARGET_MACHINE
#endif
#ifdef TARGET_MACHINE_ARCH
#undef MACHINE_ARCH
#define MACHINE_ARCH TARGET_MACHINE_ARCH
#endif
static struct ohash archives; /* Archives we've already examined. */
typedef struct Arch_ {
struct ohash members; /* All the members of this archive, as
* struct arch_member entries. */
char name[1]; /* Archive name. */
} Arch;
/* Used to get to ar's field sizes. */
static struct ar_hdr *dummy;
#define AR_NAME_SIZE (sizeof(dummy->ar_name))
#define AR_DATE_SIZE (sizeof(dummy->ar_date))
/* Each archive member is tied to an arch_member structure,
* suitable for hashing. */
struct arch_member {
TIMESTAMP mtime; /* Member modification date. */
char date[AR_DATE_SIZE+1];
/* Same, before conversion to numeric value. */
char name[1]; /* Member name. */
};
static struct ohash_info members_info = {
offsetof(struct arch_member, name), NULL,
hash_alloc, hash_free, element_alloc
};
static struct ohash_info arch_info = {
offsetof(Arch, name), NULL, hash_alloc, hash_free, element_alloc
};
static struct arch_member *new_arch_member(struct ar_hdr *, const char *);
static TIMESTAMP mtime_of_member(struct arch_member *);
static long field2long(const char *, size_t);
static Arch *read_archive(const char *, const char *);
#ifdef CLEANUP
static void ArchFree(Arch *);
#endif
static TIMESTAMP ArchMTimeMember(const char *, const char *, bool);
static FILE *ArchFindMember(const char *, const char *, struct ar_hdr *, const char *);
static void ArchTouch(const char *, const char *);
#if defined(__svr4__) || defined(__SVR4) || \
(defined(__OpenBSD__) && defined(__mips__)) || \
(defined(__OpenBSD__) && defined(__powerpc))
#define SVR4ARCHIVES
#endif
#ifdef SVR4ARCHIVES
struct SVR4namelist {
char *fnametab; /* Extended name table strings */
size_t fnamesize; /* Size of the string table */
};
static const char *svr4list = "Archive list";
static char *ArchSVR4Entry(struct SVR4namelist *, char *, size_t, FILE *);
#endif
static struct arch_member *
new_arch_member(hdr, name)
struct ar_hdr *hdr;
const char *name;
{
const char *end = NULL;
struct arch_member *n;
n = ohash_create_entry(&members_info, name, &end);
/* XXX ar entries are NOT null terminated. */
memcpy(n->date, &(hdr->ar_date), AR_DATE_SIZE);
n->date[AR_DATE_SIZE] = '\0';
/* Don't compute mtime before it is needed. */
ts_set_out_of_date(n->mtime);
return n;
}
static TIMESTAMP
mtime_of_member(m)
struct arch_member *m;
{
if (is_out_of_date(m->mtime))
ts_set_from_time_t((time_t) strtol(m->date, NULL, 10), m->mtime);
return m->mtime;
}
#ifdef CLEANUP
/*-
*-----------------------------------------------------------------------
* ArchFree --
* Free memory used by an archive
*-----------------------------------------------------------------------
*/
static void
ArchFree(a)
Arch *a;
{
struct arch_member *mem;
unsigned int i;
/* Free memory from hash entries */
for (mem = ohash_first(&a->members, &i); mem != NULL;
mem = ohash_next(&a->members, &i))
free(mem);
ohash_delete(&a->members);
free(a);
}
#endif
/* Side-effects: Some nodes may be created. */
bool
Arch_ParseArchive(linePtr, nodeLst, ctxt)
char **linePtr; /* Pointer to start of specification */
Lst nodeLst; /* Lst on which to place the nodes */
SymTable *ctxt; /* Context in which to expand variables */
{
char *cp; /* Pointer into line */
GNode *gn; /* New node */
char *libName; /* Library-part of specification */
char *memName; /* Member-part of specification */
char nameBuf[MAKE_BSIZE]; /* temporary place for node name */
char saveChar; /* Ending delimiter of member-name */
bool subLibName; /* true if libName should have/had
* variable substitution performed on it */
libName = *linePtr;
subLibName = false;
for (cp = libName; *cp != '(' && *cp != '\0';) {
if (*cp == '$') {
bool ok;
cp += Var_ParseSkip(cp, ctxt, &ok);
if (ok == false)
return false;
subLibName = true;
} else
cp++;
}
*cp++ = '\0';
if (subLibName)
libName = Var_Subst(libName, ctxt, true);
for (;;) {
/* First skip to the start of the member's name, mark that
* place and skip to the end of it (either white-space or
* a close paren). */
bool doSubst = false; /* true if need to substitute in memName */
while (*cp != '\0' && *cp != ')' && isspace(*cp))
cp++;
memName = cp;
while (*cp != '\0' && *cp != ')' && !isspace(*cp)) {
if (*cp == '$') {
bool ok;
cp += Var_ParseSkip(cp, ctxt, &ok);
if (ok == false)
return false;
doSubst = true;
} else
cp++;
}
/* If the specification ends without a closing parenthesis,
* chances are there's something wrong (like a missing backslash),
* so it's better to return failure than allow such things to
* happen. */
if (*cp == '\0') {
printf("No closing parenthesis in archive specification\n");
return false;
}
/* If we didn't move anywhere, we must be done. */
if (cp == memName)
break;
saveChar = *cp;
*cp = '\0';
/* XXX: This should be taken care of intelligently by
* SuffExpandChildren, both for the archive and the member portions. */
/* If member contains variables, try and substitute for them.
* This will slow down archive specs with dynamic sources, of course,
* since we'll be (non-)substituting them three times, but them's
* the breaks -- we need to do this since SuffExpandChildren calls
* us, otherwise we could assume the thing would be taken care of
* later. */
if (doSubst) {
char *buf;
char *sacrifice;
char *oldMemName = memName;
memName = Var_Subst(memName, ctxt, true);
/* Now form an archive spec and recurse to deal with nested
* variables and multi-word variable values.... The results
* are just placed at the end of the nodeLst we're returning. */
buf = sacrifice = emalloc(strlen(memName)+strlen(libName)+3);
sprintf(buf, "%s(%s)", libName, memName);
if (strchr(memName, '$') && strcmp(memName, oldMemName) == 0) {
/* Must contain dynamic sources, so we can't deal with it now.
* Just create an ARCHV node for the thing and let
* SuffExpandChildren handle it... */
gn = Targ_FindNode(buf, TARG_CREATE);
if (gn == NULL) {
free(buf);
return false;
} else {
gn->type |= OP_ARCHV;
Lst_AtEnd(nodeLst, gn);
}
} else if (!Arch_ParseArchive(&sacrifice, nodeLst, ctxt)) {
/* Error in nested call -- free buffer and return false
* ourselves. */
free(buf);
return false;
}
/* Free buffer and continue with our work. */
free(buf);
} else if (Dir_HasWildcards(memName)) {
LIST members;
char *member;
Lst_Init(&members);
Dir_Expand(memName, dirSearchPath, &members);
while ((member = (char *)Lst_DeQueue(&members)) != NULL) {
snprintf(nameBuf, MAKE_BSIZE, "%s(%s)", libName, member);
free(member);
gn = Targ_FindNode(nameBuf, TARG_CREATE);
/* We've found the node, but have to make sure the rest of
* the world knows it's an archive member, without having
* to constantly check for parentheses, so we type the
* thing with the OP_ARCHV bit before we place it on the
* end of the provided list. */
gn->type |= OP_ARCHV;
Lst_AtEnd(nodeLst, gn);
}
} else {
snprintf(nameBuf, MAKE_BSIZE, "%s(%s)", libName, memName);
gn = Targ_FindNode(nameBuf, TARG_CREATE);
/* We've found the node, but have to make sure the rest of the
* world knows it's an archive member, without having to
* constantly check for parentheses, so we type the thing with
* the OP_ARCHV bit before we place it on the end of the
* provided list. */
gn->type |= OP_ARCHV;
Lst_AtEnd(nodeLst, gn);
}
if (doSubst)
free(memName);
*cp = saveChar;
}
/* If substituted libName, free it now, since we need it no longer. */
if (subLibName)
free(libName);
/* We promised the pointer would be set up at the next non-space, so
* we must advance cp there before setting *linePtr... (note that on
* entrance to the loop, cp is guaranteed to point at a ')') */
do {
cp++;
} while (*cp != '\0' && isspace(*cp));
*linePtr = cp;
return true;
}
/* Helper function: ar fields are not null terminated. */
static long
field2long(field, len)
const char *field;
size_t len;
{
static char enough[32];
assert(len < sizeof(enough));
memcpy(enough, field, len);
enough[len] = '\0';
return strtol(enough, NULL, 10);
}
static Arch *
read_archive(archive, end)
const char *archive;
const char *end;
{
FILE * arch; /* Stream to archive */
char magic[SARMAG];
Arch *ar;
#ifdef SVR4ARCHIVES
struct SVR4namelist list;
list.fnametab = NULL;
#endif
/* When we encounter an archive for the first time, we read its
* whole contents, to place it in the cache. */
arch = fopen(archive, "r");
if (arch == NULL)
return NULL;
/* Make sure this is an archive we can handle. */
if ((fread(magic, SARMAG, 1, arch) != 1) ||
(strncmp(magic, ARMAG, SARMAG) != 0)) {
fclose(arch);
return NULL;
}
ar = ohash_create_entry(&arch_info, archive, &end);
ohash_init(&ar->members, 8, &members_info);
for (;;) {
size_t n;
struct ar_hdr arh; /* Archive-member header for reading archive */
off_t size; /* Size of archive member */
char buffer[MAXPATHLEN+1];
char *memName;
/* Current member name while hashing. */
char *cp; /* Useful character pointer */
memName = buffer;
n = fread(&arh, 1, sizeof(struct ar_hdr), arch);
/* Whole archive read ok. */
if (n == 0 && feof(arch)) {
#ifdef SVR4ARCHIVES
efree(list.fnametab);
#endif
fclose(arch);
return ar;
}
if (n < sizeof(struct ar_hdr))
break;
if (memcmp(arh.ar_fmag, ARFMAG, sizeof(arh.ar_fmag)) != 0) {
/* The header is bogus. */
break;
} else {
/* We need to advance the stream's pointer to the start of the
* next header. Records are padded with newlines to an even-byte
* boundary, so we need to extract the size of the record and
* round it up during the seek. */
size = (off_t) field2long(arh.ar_size, sizeof(arh.ar_size));
(void)memcpy(memName, arh.ar_name, AR_NAME_SIZE);
/* Find real end of name (strip extranous ' ') */
for (cp = memName + AR_NAME_SIZE - 1; *cp == ' ';)
cp--;
cp[1] = '\0';
#ifdef SVR4ARCHIVES
/* SVR4 names are slash terminated. Also svr4 extended AR format.
*/
if (memName[0] == '/') {
/* SVR4 magic mode. */
memName = ArchSVR4Entry(&list, memName, size, arch);
if (memName == NULL) /* Invalid data */
break;
else if (memName == svr4list) /* List of files entry */
continue;
/* Got the entry. */
/* XXX this assumes further processing, such as AR_EFMT1,
* also applies to SVR4ARCHIVES. */
}
else {
if (cp[0] == '/')
cp[0] = '\0';
}
#endif
#ifdef AR_EFMT1
/* BSD 4.4 extended AR format: #1/<namelen>, with name as the
* first <namelen> bytes of the file. */
if (memcmp(memName, AR_EFMT1, sizeof(AR_EFMT1) - 1) == 0 &&
isdigit(memName[sizeof(AR_EFMT1) - 1])) {
int elen = atoi(memName + sizeof(AR_EFMT1)-1);
if (elen <= 0 || elen > MAXPATHLEN)
break;
memName = buffer;
if (fread(memName, elen, 1, arch) != 1)
break;
memName[elen] = '\0';
if (fseek(arch, -elen, SEEK_CUR) != 0)
break;
if (DEBUG(ARCH) || DEBUG(MAKE))
printf("ArchStat: Extended format entry for %s\n", memName);
}
#endif
ohash_insert(&ar->members,
ohash_qlookup(&ar->members, memName),
new_arch_member(&arh, memName));
}
if (fseek(arch, (size + 1) & ~1, SEEK_CUR) != 0)
break;
}
fclose(arch);
ohash_delete(&ar->members);
#ifdef SVR4ARCHIVES
efree(list.fnametab);
#endif
free(ar);
return NULL;
}
/*-
*-----------------------------------------------------------------------
* ArchMTimeMember --
* Find the modification time of an archive's member, given the
* path to the archive and the path to the desired member.
*
* Results:
* The archive member's modification time, or OUT_OF_DATE if member
* was not found (convenient, so that missing members are always
* out of date).
*
* Side Effects:
* Cache the whole archive contents if hash is true.
*-----------------------------------------------------------------------
*/
static TIMESTAMP
ArchMTimeMember(archive, member, hash)
const char *archive; /* Path to the archive */
const char *member; /* Name of member. If it is a path, only the
* last component is used. */
bool hash; /* true if archive should be hashed if not
* already so. */
{
FILE * arch; /* Stream to archive */
Arch *ar; /* Archive descriptor */
unsigned int slot; /* Place of archive in the archives hash */
const char *end = NULL;
const char *cp;
TIMESTAMP result;
ts_set_out_of_date(result);
/* Because of space constraints and similar things, files are archived
* using their final path components, not the entire thing, so we need
* to point 'member' to the final component, if there is one, to make
* the comparisons easier... */
cp = strrchr(member, '/');
if (cp != NULL)
member = cp + 1;
/* Try to find archive in cache. */
slot = ohash_qlookupi(&archives, archive, &end);
ar = ohash_find(&archives, slot);
/* If not found, get it now. */
if (ar == NULL) {
if (!hash) {
/* Quick path: no need to hash the whole archive, just use
* ArchFindMember to get the member's header and close the stream
* again. */
struct ar_hdr sarh;
arch = ArchFindMember(archive, member, &sarh, "r");
if (arch != NULL) {
fclose(arch);
ts_set_from_time_t( (time_t)strtol(sarh.ar_date, NULL, 10), result);
}
return result;
}
ar = read_archive(archive, end);
if (ar != NULL)
ohash_insert(&archives, slot, ar);
}
/* If archive was found, get entry we seek. */
if (ar != NULL) {
struct arch_member *he;
end = NULL;
he = ohash_find(&ar->members, ohash_qlookupi(&ar->members, member, &end));
if (he != NULL)
return mtime_of_member(he);
else {
if (end - member > AR_NAME_SIZE) {
/* Try truncated name. */
end = member + AR_NAME_SIZE;
he = ohash_find(&ar->members,
ohash_qlookupi(&ar->members, member, &end));
if (he != NULL)
return mtime_of_member(he);
}
}
}
return result;
}
#ifdef SVR4ARCHIVES
/*-
*-----------------------------------------------------------------------
* ArchSVR4Entry --
* Parse an SVR4 style entry that begins with a slash.
* If it is "//", then load the table of filenames
* If it is "/<offset>", then try to substitute the long file name
* from offset of a table previously read.
*
* Results:
* svr4list: just read a list of names
* NULL: error occured
* extended name
*
* Side-effect:
* For a list of names, store the list in l.
*-----------------------------------------------------------------------
*/
static char *
ArchSVR4Entry(l, name, size, arch)
struct SVR4namelist *l;
char *name;
size_t size;
FILE *arch;
{
#define ARLONGNAMES1 "/"
#define ARLONGNAMES2 "ARFILENAMES"
size_t entry;
char *ptr, *eptr;
assert(name[0] == '/');
name++;
/* First comes a table of archive names, to be used by subsequent calls. */
if (memcmp(name, ARLONGNAMES1, sizeof(ARLONGNAMES1) - 1) == 0 ||
memcmp(name, ARLONGNAMES2, sizeof(ARLONGNAMES2) - 1) == 0) {
if (l->fnametab != NULL) {
if (DEBUG(ARCH))
printf("Attempted to redefine an SVR4 name table\n");
return NULL;
}
l->fnametab = emalloc(size);
l->fnamesize = size;
if (fread(l->fnametab, size, 1, arch) != 1) {
if (DEBUG(ARCH))
printf("Reading an SVR4 name table failed\n");
return NULL;
}
eptr = l->fnametab + size;
for (entry = 0, ptr = l->fnametab; ptr < eptr; ptr++)
switch (*ptr) {
case '/':
entry++;
*ptr = '\0';
break;
case '\n':
break;
default:
break;
}
if (DEBUG(ARCH))
printf("Found svr4 archive name table with %lu entries\n",
(u_long)entry);
return (char *)svr4list;
}
/* Then the names themselves are given as offsets in this table. */
if (*name == ' ' || *name == '\0')
return NULL;
entry = (size_t) strtol(name, &eptr, 0);
if ((*eptr != ' ' && *eptr != '\0') || eptr == name) {
if (DEBUG(ARCH))
printf("Could not parse SVR4 name /%s\n", name);
return NULL;
}
if (entry >= l->fnamesize) {
if (DEBUG(ARCH))
printf("SVR4 entry offset /%s is greater than %lu\n",
name, (u_long)l->fnamesize);
return NULL;
}
if (DEBUG(ARCH))
printf("Replaced /%s with %s\n", name, l->fnametab + entry);
return l->fnametab + entry;
}
#endif
/*-
*-----------------------------------------------------------------------
* ArchFindMember --
* Locate a member of an archive, given the path of the archive and
* the path of the desired member. If the archive is to be modified,
* the mode should be "r+", if not, it should be "r".
*
* Results:
* A FILE *, opened for reading and writing, positioned right after
* the member's header, or NULL if the member was nonexistent.
*
* Side Effects:
* Fill the struct ar_hdr pointed by arhPtr.
*-----------------------------------------------------------------------
*/
static FILE *
ArchFindMember(archive, member, arhPtr, mode)
const char *archive; /* Path to the archive */
const char *member; /* Name of member. If it is a path, only the
* last component is used. */
struct ar_hdr *arhPtr; /* Pointer to header structure to be filled in */
const char *mode; /* The mode for opening the stream */
{
FILE * arch; /* Stream to archive */
char *cp; /* Useful character pointer */
char magic[SARMAG];
size_t len;
#ifdef SVR4ARCHIVES
struct SVR4namelist list;
list.fnametab = NULL;
#endif
arch = fopen(archive, mode);
if (arch == NULL)
return NULL;
/* Make sure this is an archive we can handle. */
if (fread(magic, SARMAG, 1, arch) != 1 ||
strncmp(magic, ARMAG, SARMAG) != 0) {
fclose(arch);
return NULL;
}
/* Because of space constraints and similar things, files are archived
* using their final path components, not the entire thing, so we need
* to point 'member' to the final component, if there is one, to make
* the comparisons easier... */
cp = strrchr(member, '/');
if (cp != NULL)
member = cp + 1;
len = strlen(member);
if (len >= AR_NAME_SIZE)
len = AR_NAME_SIZE;
/* Error handling is simpler than for read_archive, since we just
* look for a given member. */
while (fread(arhPtr, sizeof(struct ar_hdr), 1, arch) == 1) {
off_t size; /* Size of archive member */
char *memName;
if (memcmp(arhPtr->ar_fmag, ARFMAG, sizeof(arhPtr->ar_fmag) ) != 0)
/* The header is bogus, so the archive is bad. */
break;
memName = arhPtr->ar_name;
if (memcmp(member, memName, len) == 0) {
/* If the member's name doesn't take up the entire 'name' field,
* we have to be careful of matching prefixes. Names are space-
* padded to the right, so if the character in 'name' at the end
* of the matched string is anything but a space, this isn't the
* member we sought. */
#ifdef SVR4ARCHIVES
if (len < sizeof(arhPtr->ar_name) && memName[len] == '/')
len++;
#endif
if (len == sizeof(arhPtr->ar_name) ||
memName[len] == ' ') {
#ifdef SVR4ARCHIVES
efree(list.fnametab);
#endif
return arch;
}
}
size = (off_t) field2long(arhPtr->ar_size, sizeof(arhPtr->ar_size));
#ifdef SVR4ARCHIVES
/* svr4 names are slash terminated. Also svr4 extended AR format.
*/
if (memName[0] == '/') {
/* svr4 magic mode. */
memName = ArchSVR4Entry(&list, arhPtr->ar_name, size, arch);
if (memName == NULL) /* Invalid data */
break;
else if (memName == svr4list) /* List of files entry */
continue;
/* Got the entry. */
if (strcmp(memName, member) == 0) {
efree(list.fnametab);
return arch;
}
}
#endif
#ifdef AR_EFMT1
/* BSD 4.4 extended AR format: #1/<namelen>, with name as the
* first <namelen> bytes of the file. */
if (memcmp(memName, AR_EFMT1, sizeof(AR_EFMT1) - 1) == 0 &&
isdigit(memName[sizeof(AR_EFMT1) - 1])) {
char ename[MAXPATHLEN+1];
int elen = atoi(memName + sizeof(AR_EFMT1)-1);
if (elen <= 0 || elen > MAXPATHLEN)
break;
if (fread(ename, elen, 1, arch) != 1)
break;
if (fseek(arch, -elen, SEEK_CUR) != 0)
break;
ename[elen] = '\0';
if (DEBUG(ARCH) || DEBUG(MAKE))
printf("ArchFind: Extended format entry for %s\n", ename);
/* Found as extended name. */
if (strcmp(ename, member) == 0) {
#ifdef SVR4ARCHIVES
efree(list.fnametab);
#endif
return arch;
}
}
#endif
/* This isn't the member we're after, so we need to advance the
* stream's pointer to the start of the next header. */
if (fseek(arch, (size + 1) & ~1, SEEK_CUR) != 0)
break;
}
/* We did not find the member, or we ran into an error while reading
* the archive. */
#ifdef SVRARCHIVES
efree(list.fnametab);
#endif
fclose(arch);
return NULL;
}
static void
ArchTouch(archive, member)
const char *archive; /* Path to the archive */
const char *member; /* Name of member. */
{
FILE *arch;
struct ar_hdr arh;
arch = ArchFindMember(archive, member, &arh, "r+");
if (arch != NULL) {
snprintf(arh.ar_date, sizeof(arh.ar_date), "%-12ld", (long)
timestamp2time_t(now));
if (fseek(arch, -sizeof(struct ar_hdr), SEEK_CUR) == 0)
(void)fwrite(&arh, sizeof(struct ar_hdr), 1, arch);
fclose(arch);
}
}
/*
* Side Effects:
* The modification time of the entire archive is also changed.
* For a library, this could necessitate the re-ranlib'ing of the
* whole thing.
*/
void
Arch_Touch(gn)
GNode *gn; /* Node of member to touch */
{
ArchTouch(Varq_Value(ARCHIVE_INDEX, gn), Varq_Value(MEMBER_INDEX, gn));
}
void
Arch_TouchLib(gn)
GNode *gn; /* The node of the library to touch */
{
#ifdef RANLIBMAG
if (gn->path != NULL) {
ArchTouch(gn->path, RANLIBMAG);
set_times(gn->path);
}
#endif
}
TIMESTAMP
Arch_MTime(gn)
GNode *gn; /* Node describing archive member */
{
gn->mtime = ArchMTimeMember(Varq_Value(ARCHIVE_INDEX, gn),
Varq_Value(MEMBER_INDEX, gn),
true);
return gn->mtime;
}
TIMESTAMP
Arch_MemMTime(gn)
GNode *gn;
{
LstNode ln;
for (ln = Lst_First(&gn->parents); ln != NULL; ln = Lst_Adv(ln)) {
GNode *pgn;
char *nameStart,
*nameEnd;
pgn = (GNode *)Lst_Datum(ln);
if (pgn->type & OP_ARCHV) {
/* If the parent is an archive specification and is being made
* and its member's name matches the name of the node we were
* given, record the modification time of the parent in the
* child. We keep searching its parents in case some other
* parent requires this child to exist... */
if ((nameStart = strchr(pgn->name, '(') ) != NULL) {
nameStart++;
nameEnd = strchr(nameStart, ')');
} else
nameEnd = NULL;
if (pgn->make && nameEnd != NULL &&
strncmp(nameStart, gn->name, nameEnd - nameStart) == 0 &&
gn->name[nameEnd-nameStart] == '\0')
gn->mtime = Arch_MTime(pgn);
} else if (pgn->make) {
/* Something which isn't a library depends on the existence of
* this target, so it needs to exist. */
ts_set_out_of_date(gn->mtime);
break;
}
}
return gn->mtime;
}
/* If the system can handle the -L flag when linking (or we cannot find
* the library), we assume that the user has placed the .LIBRARIES variable
* in the final linking command (or the linker will know where to find it)
* and set the TARGET variable for this node to be the node's name. Otherwise,
* we set the TARGET variable to be the full path of the library,
* as returned by Dir_FindFile.
*/
void
Arch_FindLib(gn, path)
GNode *gn; /* Node of library to find */
Lst path; /* Search path */
{
char *libName; /* file name for archive */
libName = emalloc(strlen(gn->name) + 6 - 2);
sprintf(libName, "lib%s.a", &gn->name[2]);
gn->path = Dir_FindFile(libName, path);
free(libName);
#ifdef LIBRARIES
Varq_Set(TARGET_INDEX, gn->name, gn);
#else
Varq_Set(TARGET_INDEX, gn->path == NULL ? gn->name : gn->path, gn);
#endif /* LIBRARIES */
}
/*-
*-----------------------------------------------------------------------
* Arch_LibOODate --
* Decide if a node with the OP_LIB attribute is out-of-date. Called
* from Make_OODate to make its life easier.
*
* There are several ways for a library to be out-of-date that are
* not available to ordinary files. In addition, there are ways
* that are open to regular files that are not available to
* libraries. A library that is only used as a source is never
* considered out-of-date by itself. This does not preclude the
* library's modification time from making its parent be out-of-date.
* A library will be considered out-of-date for any of these reasons,
* given that it is a target on a dependency line somewhere:
* Its modification time is less than that of one of its
* sources (gn->mtime < gn->cmtime).
* Its modification time is greater than the time at which the
* make began (i.e. it's been modified in the course
* of the make, probably by archiving).
* The modification time of one of its sources is greater than
* the one of its RANLIBMAG member (i.e. its table of contents
* is out-of-date). We don't compare of the archive time
* vs. TOC time because they can be too close. In my
* opinion we should not bother with the TOC at all since
* this is used by 'ar' rules that affect the data contents
* of the archive, not by ranlib rules, which affect the
* TOC.
*
* Results:
* true if the library is out-of-date. false otherwise.
*
* Side Effects:
* The library will be hashed if it hasn't been already.
*-----------------------------------------------------------------------
*/
bool
Arch_LibOODate(gn)
GNode *gn; /* The library's graph node */
{
TIMESTAMP modTimeTOC; /* mod time of __.SYMDEF */
if (OP_NOP(gn->type) && Lst_IsEmpty(&gn->children))
return false;
if (is_strictly_before(now, gn->mtime) || is_strictly_before(gn->mtime, gn->cmtime) ||
is_out_of_date(gn->mtime))
return true;
#ifdef RANLIBMAG
/* non existent libraries are always out-of-date. */
if (gn->path == NULL)
return true;
modTimeTOC = ArchMTimeMember(gn->path, RANLIBMAG, false);
if (!is_out_of_date(modTimeTOC)) {
if (DEBUG(ARCH) || DEBUG(MAKE))
printf("%s modified %s...", RANLIBMAG, Targ_FmtTime(modTimeTOC));
return is_strictly_before(modTimeTOC, gn->cmtime);
}
/* A library w/o a table of contents is out-of-date. */
if (DEBUG(ARCH) || DEBUG(MAKE))
printf("No t.o.c....");
return true;
#else
return false;
#endif
}
void
Arch_Init()
{
ohash_init(&archives, 4, &arch_info);
}
#ifdef CLEANUP
void
Arch_End()
{
Arch *e;
unsigned int i;
for (e = ohash_first(&archives, &i); e != NULL;
e = ohash_next(&archives, &i))
ArchFree(e);
ohash_delete(&archives);
}
#endif
bool
Arch_IsLib(gn)
GNode *gn;
{
char buf[SARMAG];
int fd;
if (gn->path == NULL || (fd = open(gn->path, O_RDONLY)) == -1)
return false;
if (read(fd, buf, SARMAG) != SARMAG) {
(void)close(fd);
return false;
}
(void)close(fd);
return memcmp(buf, ARMAG, SARMAG) == 0;
}
|