archiver.c 16 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310311312313314315316317318319320321322323324325326327328329330331332333334335336337338339340341342343344345346347348349350351352353354355356357358359360361362363364365366367368369370371372373374375376377378379380381382383384385386387388389390391392393394395396397398399400401402403404405406407408409410411412413414415416417418419420421422423424425426427428429430431432433434435436437438439440441442443444445446447448449450451452453454455456457458459460461462463464465466467468469470471472473474475476477478479480481482483484485486487488489490491492493494495496497498499500501502503504505506507508509510511512513514515516517518519520521522523524525526527528529530531532533534535536537538539540541542543544545546547548549550551552553554555556557558559560561562563564565566567568569570571572573574575576577578579580581582583584585586587588589590591592593594595596597598599600601602603604605606607608609610611612613614615616617618619620621622623624625626627628629630631632633634635636637638639640641642643644645646647648649650651652653654655656657658659660661662663664665666667668669670671672673674675676677678679680681682683684685686687688689690691692693694695696697698699700701702703704705706707708709710711712713714715716717718719720721722723724725726727728729730731732733734735736737738739740741742743744745746747748749750751752753754755756757758759760761762763764765766767768769770
  1. /*
  2. * (c) copyright 1987 by the Vrije Universiteit, Amsterdam, The Netherlands.
  3. * See the copyright notice in the ACK home directory, in the file "Copyright".
  4. */
  5. /* ar - archiver Author: Michiel Huisjes */
  6. /* Made into arch/aal by Ceriel Jacobs
  7. */
  8. static char RcsId[] = "$Id$";
  9. /*
  10. * Usage: [arch|aal] [qdprtx][vlcu] archive [file] ...
  11. * v: verbose
  12. * x: extract
  13. * q: append
  14. * r: replace (append when not in archive)
  15. * d: delete
  16. * t: print contents of archive
  17. * p: print named files
  18. * l: temporaries in current directory instead of /tmp
  19. * c: don't give "create" message
  20. * u: replace only if dated later than member in archive
  21. #ifdef DISTRIBUTION
  22. * D: make distribution: use distr_time, uid=2, gid=2, mode=0644
  23. #endif
  24. */
  25. #include <stdlib.h>
  26. #include <stdio.h>
  27. #include <string.h>
  28. #include <sys/types.h>
  29. #include <sys/stat.h>
  30. #include <signal.h>
  31. #include <time.h>
  32. #include <arch.h>
  33. #include <ranlib.h>
  34. #include <unistd.h>
  35. #ifdef AAL
  36. #include <out.h>
  37. #define MAGIC_NUMBER AALMAG
  38. long offset;
  39. struct ranlib *tab;
  40. unsigned int tnum = 0;
  41. char *tstrtab;
  42. unsigned int tssiz = 0;
  43. unsigned int tabsz, strtabsz;
  44. #else
  45. #define MAGIC_NUMBER ARMAG
  46. #endif
  47. #define odd(nr) (nr & 01)
  48. #define even(nr) (odd(nr) ? nr + 1 : nr)
  49. typedef char BOOL;
  50. #define FALSE 0
  51. #define TRUE 1
  52. #define READ 0
  53. #define APPEND 2
  54. #define CREATE 1
  55. #define MEMBER struct ar_hdr
  56. #define NIL_PTR ((char *) 0)
  57. #define NIL_MEM ((MEMBER *) 0)
  58. #define NIL_LONG ((long *) 0)
  59. #define IO_SIZE (10 * 1024)
  60. #define equal(str1, str2) (!strncmp((str1), (str2), 14))
  61. #ifndef S_ISDIR
  62. #define S_ISDIR(m) (m & S_IFDIR) /* is a directory */
  63. #endif
  64. /* Use Posix names if old-fashioned names are not defined. */
  65. #ifndef S_IREAD
  66. #define S_IREAD S_IRUSR
  67. #endif
  68. #ifndef S_IWRITE
  69. #define S_IWRITE S_IWUSR
  70. #endif
  71. #ifndef S_IEXEC
  72. #define S_IEXEC S_IXUSR
  73. #endif
  74. BOOL verbose;
  75. BOOL app_fl;
  76. BOOL ex_fl;
  77. BOOL show_fl;
  78. BOOL pr_fl;
  79. BOOL u_fl;
  80. BOOL rep_fl;
  81. BOOL del_fl;
  82. BOOL nocr_fl;
  83. BOOL local_fl;
  84. #ifdef DISTRIBUTION
  85. BOOL distr_fl;
  86. long distr_time;
  87. #endif
  88. int ar_fd;
  89. char io_buffer[IO_SIZE];
  90. char *progname;
  91. char temp_buf[32];
  92. char *temp_arch = &temp_buf[0];
  93. /* Prototypings...*/
  94. void error(BOOL quit, char *str1, char *str2, char *str3, char *str4);
  95. void usage(void);
  96. char *basename(char *path);
  97. int open_archive(char *name, int mode);
  98. int main(int argc, char *argv[]);
  99. struct ar_hdr *get_member(void);
  100. void get(int argc, char *argv[]);
  101. void add(char *name, int fd, char *mess);
  102. void extract(struct ar_hdr *member);
  103. void copy_member(MEMBER *member, int from, int to, int extracting);
  104. char *get_mode(int mode);
  105. void wr_fatal(void);
  106. void rd_fatal(void);
  107. void mwrite(int fd, char *address, int bytes);
  108. void show(char *s, char *name);
  109. void write_symdef();
  110. void do_names(struct outhead *headp);
  111. void enter_name(struct outname *namep);
  112. void do_object(int f, long size);
  113. /*VARARGS2*/
  114. void error(BOOL quit, char *str1, char *str2, char *str3, char *str4)
  115. {
  116. char errbuf[256];
  117. sprint(errbuf, str1, str2, str3, str4);
  118. write(2, errbuf, strlen(errbuf));
  119. if (quit) {
  120. unlink(temp_arch);
  121. _exit(1);
  122. }
  123. }
  124. void usage()
  125. {
  126. error(TRUE, "usage: %s [qdprtxl][vlc] archive [file] ...\n",
  127. progname,
  128. NULL, NULL);
  129. }
  130. char *basename(char *path)
  131. {
  132. register char *ptr = path;
  133. register char *last = NIL_PTR;
  134. while (*ptr != '\0') {
  135. if (*ptr == '/')
  136. last = ptr;
  137. ptr++;
  138. }
  139. if (last == NIL_PTR)
  140. return path;
  141. if (*(last + 1) == '\0') {
  142. *last = '\0';
  143. return basename(path);
  144. }
  145. return last + 1;
  146. }
  147. int open_archive(char *name, int mode)
  148. {
  149. unsigned short magic = 0;
  150. int fd;
  151. if (mode == CREATE) {
  152. if ((fd = creat(name, 0666)) < 0)
  153. error(TRUE, "cannot creat %s\n", name, NULL, NULL);
  154. magic = MAGIC_NUMBER;
  155. wr_int2(fd, magic);
  156. return fd;
  157. }
  158. if ((fd = open(name, mode)) < 0) {
  159. if (mode == APPEND) {
  160. close(open_archive(name, CREATE));
  161. if (!nocr_fl) error(FALSE, "%s: creating %s\n", progname, name, NULL);
  162. return open_archive(name, APPEND);
  163. }
  164. error(TRUE, "cannot open %s\n", name, NULL, NULL);
  165. }
  166. lseek(fd, 0L, 0);
  167. magic = rd_unsigned2(fd);
  168. if (magic != AALMAG && magic != ARMAG)
  169. error(TRUE, "%s is not in ar format\n", name, NULL, NULL);
  170. return fd;
  171. }
  172. void catch(int sig)
  173. {
  174. unlink(temp_arch);
  175. _exit (2);
  176. }
  177. int main(int argc, char *argv[])
  178. {
  179. register char *ptr;
  180. int needs_arg = 0;
  181. progname = argv[0];
  182. if (argc < 3)
  183. usage();
  184. for (ptr = argv[1]; *ptr; ptr++) {
  185. switch (*ptr) {
  186. case 't' :
  187. show_fl = TRUE;
  188. break;
  189. case 'v' :
  190. verbose = TRUE;
  191. break;
  192. case 'x' :
  193. ex_fl = TRUE;
  194. break;
  195. case 'q' :
  196. needs_arg = 1;
  197. app_fl = TRUE;
  198. break;
  199. case 'c' :
  200. nocr_fl = TRUE;
  201. break;
  202. case 'u':
  203. u_fl = TRUE;
  204. break;
  205. case 'p' :
  206. needs_arg = 1;
  207. pr_fl = TRUE;
  208. break;
  209. case 'd' :
  210. needs_arg = 1;
  211. del_fl = TRUE;
  212. break;
  213. case 'r' :
  214. needs_arg = 1;
  215. rep_fl = TRUE;
  216. break;
  217. case 'l' :
  218. local_fl = TRUE;
  219. break;
  220. #ifdef DISTRIBUTION
  221. case 'D' :
  222. distr_fl = TRUE;
  223. break;
  224. #endif
  225. default :
  226. usage();
  227. }
  228. }
  229. if (needs_arg && argc <= 3)
  230. usage();
  231. #ifdef DISTRIBUTION
  232. if (distr_fl) {
  233. static struct stat statbuf;
  234. stat(progname, &statbuf);
  235. distr_time = statbuf.st_mtime;
  236. }
  237. #endif
  238. if (local_fl) strcpy(temp_arch, "ar.XXXXXX");
  239. else strcpy(temp_arch, "/tmp/ar.XXXXXX");
  240. if (app_fl + ex_fl + del_fl + rep_fl + show_fl + pr_fl != 1)
  241. usage();
  242. if (u_fl && ! rep_fl)
  243. usage();
  244. if (rep_fl || del_fl
  245. #ifdef AAL
  246. || app_fl
  247. #endif
  248. ) {
  249. mktemp(temp_arch);
  250. }
  251. #ifdef AAL
  252. tab = (struct ranlib *) malloc(512 * sizeof(struct ranlib));
  253. tstrtab = malloc(4096);
  254. if (!tab || !tstrtab) error(TRUE,"Out of core\n", NULL, NULL, NULL);
  255. tabsz = 512;
  256. strtabsz = 4096;
  257. #endif
  258. signal(SIGINT, catch);
  259. get(argc, argv);
  260. return 0;
  261. }
  262. MEMBER *get_member()
  263. {
  264. static MEMBER member;
  265. again:
  266. if (rd_arhdr(ar_fd, &member) == 0)
  267. return NIL_MEM;
  268. if (member.ar_size < 0) {
  269. error(TRUE, "archive has member with negative size\n", NULL, NULL, NULL);
  270. }
  271. if (equal(SYMDEF, member.ar_name)) {
  272. lseek(ar_fd, member.ar_size, 1);
  273. goto again;
  274. }
  275. return &member;
  276. }
  277. void get(int argc, char *argv[])
  278. {
  279. register MEMBER *member;
  280. int i = 0;
  281. int temp_fd, read_chars;
  282. ar_fd = open_archive(argv[2], (show_fl || pr_fl || ex_fl) ? READ : APPEND);
  283. if (rep_fl || del_fl
  284. #ifdef AAL
  285. || app_fl
  286. #endif
  287. )
  288. temp_fd = open_archive(temp_arch, CREATE);
  289. while ((member = get_member()) != NIL_MEM) {
  290. if (argc > 3) {
  291. for (i = 3; i < argc; i++) {
  292. if (equal(basename(argv[i]), member->ar_name))
  293. break;
  294. }
  295. if (i == argc || app_fl) {
  296. if (rep_fl || del_fl
  297. #ifdef AAL
  298. || app_fl
  299. #endif
  300. ) {
  301. #ifdef AAL
  302. if (i != argc) {
  303. print("%s: already in archive\n", argv[i]);
  304. argv[i] = "";
  305. }
  306. #endif
  307. wr_arhdr(temp_fd, member);
  308. copy_member(member, ar_fd, temp_fd, 0);
  309. }
  310. else {
  311. #ifndef AAL
  312. if (app_fl && i != argc) {
  313. print("%s: already in archive\n", argv[i]);
  314. argv[i] = "";
  315. }
  316. #endif
  317. lseek(ar_fd, even(member->ar_size),1);
  318. }
  319. continue;
  320. }
  321. }
  322. if (ex_fl || pr_fl)
  323. extract(member);
  324. else {
  325. if (rep_fl)
  326. add(argv[i], temp_fd, "r - %s\n");
  327. else if (show_fl) {
  328. char buf[sizeof(member->ar_name) + 2];
  329. register char *p = buf, *q = member->ar_name;
  330. while (q <= &member->ar_name[sizeof(member->ar_name)-1] && *q) {
  331. *p++ = *q++;
  332. }
  333. *p++ = '\n';
  334. *p = '\0';
  335. if (verbose) {
  336. char *mode = get_mode(member->ar_mode);
  337. char *date = ctime(&(member->ar_date));
  338. *(date + 16) = '\0';
  339. *(date + 24) = '\0';
  340. print("%s%3u/%u%7ld %s %s %s",
  341. mode,
  342. (unsigned) (member->ar_uid & 0377),
  343. (unsigned) (member->ar_gid & 0377),
  344. member->ar_size,
  345. date+4,
  346. date+20,
  347. buf);
  348. }
  349. else print(buf);
  350. }
  351. else if (del_fl)
  352. show("d - %s\n", member->ar_name);
  353. lseek(ar_fd, even(member->ar_size), 1);
  354. }
  355. argv[i] = "";
  356. }
  357. if (argc > 3) {
  358. for (i = 3; i < argc; i++)
  359. if (argv[i][0] != '\0') {
  360. #ifndef AAL
  361. if (app_fl)
  362. add(argv[i], ar_fd, "a - %s\n");
  363. else
  364. #endif
  365. if (rep_fl
  366. #ifdef AAL
  367. || app_fl
  368. #endif
  369. )
  370. add(argv[i], temp_fd, "a - %s\n");
  371. else {
  372. print("%s: not found\n", argv[i]);
  373. }
  374. }
  375. }
  376. if (rep_fl || del_fl
  377. #ifdef AAL
  378. || app_fl
  379. #endif
  380. ) {
  381. signal(SIGINT, SIG_IGN);
  382. close(ar_fd);
  383. close(temp_fd);
  384. ar_fd = open_archive(argv[2], CREATE);
  385. temp_fd = open_archive(temp_arch, APPEND);
  386. #ifdef AAL
  387. write_symdef();
  388. #endif
  389. while ((read_chars = read(temp_fd, io_buffer, IO_SIZE)) > 0)
  390. mwrite(ar_fd, io_buffer, read_chars);
  391. close(temp_fd);
  392. unlink(temp_arch);
  393. }
  394. close(ar_fd);
  395. }
  396. void add(char *name, int fd, char *mess)
  397. {
  398. static MEMBER member;
  399. register int read_chars;
  400. struct stat status;
  401. int src_fd;
  402. if (stat(name, &status) < 0) {
  403. error(FALSE, "cannot find %s\n", name, NULL, NULL);
  404. return;
  405. }
  406. else if (S_ISDIR(status.st_mode)) {
  407. error(FALSE, "%s is a directory (ignored)\n", name, NULL, NULL);
  408. return;
  409. }
  410. else if (u_fl && status.st_mtime <= member.ar_date) {
  411. wr_arhdr(fd, member);
  412. copy_member(&member, ar_fd, fd, 0);
  413. return;
  414. }
  415. else if ((src_fd = open(name, 0)) < 0) {
  416. error(FALSE, "cannot open %s\n", name, NULL, NULL);
  417. return;
  418. }
  419. strncpy (member.ar_name, basename (name), sizeof(member.ar_name));
  420. member.ar_uid = status.st_uid;
  421. member.ar_gid = status.st_gid;
  422. member.ar_mode = status.st_mode;
  423. member.ar_date = status.st_mtime;
  424. member.ar_size = status.st_size;
  425. #ifdef DISTRIBUTION
  426. if (distr_fl) {
  427. member.ar_uid = 2;
  428. member.ar_gid = 2;
  429. member.ar_mode = 0644;
  430. member.ar_date = distr_time;
  431. }
  432. #endif
  433. wr_arhdr(fd, &member);
  434. #ifdef AAL
  435. do_object(src_fd, member.ar_size);
  436. lseek(src_fd, 0L, 0);
  437. offset += AR_TOTAL + even(member.ar_size);
  438. #endif
  439. while (status.st_size > 0) {
  440. int x = IO_SIZE;
  441. read_chars = x;
  442. if (status.st_size < x) {
  443. x = status.st_size;
  444. read_chars = x;
  445. status.st_size = 0;
  446. x = even(x);
  447. }
  448. else status.st_size -= x;
  449. if (read(src_fd, io_buffer, read_chars) != read_chars) {
  450. error(FALSE,"%s seems to shrink\n", name, NULL, NULL);
  451. break;
  452. }
  453. mwrite(fd, io_buffer, x);
  454. }
  455. if (verbose)
  456. show(mess, member.ar_name);
  457. close(src_fd);
  458. }
  459. void extract(MEMBER *member)
  460. {
  461. int fd = 1;
  462. char buf[sizeof(member->ar_name) + 1];
  463. strncpy(buf, member->ar_name, sizeof(member->ar_name));
  464. buf[sizeof(member->ar_name)] = 0;
  465. if (pr_fl == FALSE && (fd = creat(buf, 0666)) < 0) {
  466. error(FALSE, "cannot create %s\n", buf, NULL, NULL);
  467. fd = -1;
  468. }
  469. if (verbose) {
  470. if (pr_fl == FALSE) show("x - %s\n", buf);
  471. else show("\n<%s>\n\n", buf);
  472. }
  473. copy_member(member, ar_fd, fd, 1);
  474. if (fd >= 0 && fd != 1)
  475. close(fd);
  476. if (pr_fl == FALSE) chmod(buf, member->ar_mode);
  477. }
  478. void copy_member(MEMBER *member, int from, int to, int extracting)
  479. {
  480. register int rest;
  481. long mem_size = member->ar_size;
  482. BOOL is_odd = odd(mem_size) ? TRUE : FALSE;
  483. #ifdef AAL
  484. if (! extracting) {
  485. long pos = lseek(from, 0L, 1);
  486. do_object(from, mem_size);
  487. offset += AR_TOTAL + even(mem_size);
  488. lseek(from, pos, 0);
  489. }
  490. #endif
  491. do {
  492. rest = mem_size > (long) IO_SIZE ? IO_SIZE : (int) mem_size;
  493. if (read(from, io_buffer, rest) != rest) {
  494. char buf[sizeof(member->ar_name) + 1];
  495. strncpy(buf, member->ar_name, sizeof(member->ar_name));
  496. buf[sizeof(member->ar_name)] = 0;
  497. error(TRUE, "read error on %s\n", buf, NULL, NULL);
  498. }
  499. if (to >= 0) mwrite(to, io_buffer, rest);
  500. mem_size -= (long) rest;
  501. } while (mem_size > 0L);
  502. if (is_odd) {
  503. lseek(from, 1L, 1);
  504. if (to >= 0 && ! extracting)
  505. lseek(to, 1L, 1);
  506. }
  507. }
  508. char *get_mode(int mode)
  509. {
  510. static char mode_buf[11];
  511. register int tmp = mode;
  512. int i;
  513. mode_buf[9] = ' ';
  514. for (i = 0; i < 3; i++) {
  515. mode_buf[i * 3] = (tmp & S_IREAD) ? 'r' : '-';
  516. mode_buf[i * 3 + 1] = (tmp & S_IWRITE) ? 'w' : '-';
  517. mode_buf[i * 3 + 2] = (tmp & S_IEXEC) ? 'x' : '-';
  518. tmp <<= 3;
  519. }
  520. if (mode & S_ISUID)
  521. mode_buf[2] = 's';
  522. if (mode & S_ISGID)
  523. mode_buf[5] = 's';
  524. return mode_buf;
  525. }
  526. void wr_fatal()
  527. {
  528. error(TRUE, "write error\n", NULL, NULL, NULL);
  529. }
  530. void rd_fatal()
  531. {
  532. error(TRUE, "read error\n", NULL, NULL, NULL);
  533. }
  534. void mwrite(int fd, char *address, int bytes)
  535. {
  536. if (write(fd, address, bytes) != bytes)
  537. error(TRUE, "write error\n", NULL, NULL, NULL);
  538. }
  539. void show(char *s, char *name)
  540. {
  541. MEMBER x;
  542. char buf[sizeof(x.ar_name)+1];
  543. register char *p = buf, *q = name;
  544. while (q <= &name[sizeof(x.ar_name)-1] && *q) *p++ = *q++;
  545. *p++ = '\0';
  546. print(s, buf);
  547. }
  548. #ifdef AAL
  549. /*
  550. * Write out the ranlib table: first 4 bytes telling how many ranlib structs
  551. * there are, followed by the ranlib structs,
  552. * then 4 bytes giving the size of the string table, followed by the string
  553. * table itself.
  554. */
  555. void write_symdef()
  556. {
  557. register struct ranlib *ran;
  558. register int i;
  559. register long delta;
  560. MEMBER arbuf;
  561. if (! tnum) return;
  562. if (odd(tssiz))
  563. tstrtab[tssiz++] = '\0';
  564. for (i = 0; i < sizeof(arbuf.ar_name); i++)
  565. arbuf.ar_name[i] = '\0';
  566. strcpy(arbuf.ar_name, SYMDEF);
  567. arbuf.ar_size = 4 + 2 * 4 * (long)tnum + 4 + (long)tssiz;
  568. time(&arbuf.ar_date);
  569. arbuf.ar_uid = getuid();
  570. arbuf.ar_gid = getgid();
  571. arbuf.ar_mode = 0444;
  572. #ifdef DISTRIBUTION
  573. if (distr_fl) {
  574. arbuf.ar_uid = 2;
  575. arbuf.ar_gid = 2;
  576. arbuf.ar_date = distr_time;
  577. }
  578. #endif
  579. wr_arhdr(ar_fd,&arbuf);
  580. wr_long(ar_fd, (long) tnum);
  581. /*
  582. * Account for the space occupied by the magic number
  583. * and the ranlib table.
  584. */
  585. delta = 2 + AR_TOTAL + arbuf.ar_size;
  586. for (ran = tab; ran < &tab[tnum]; ran++) {
  587. ran->ran_pos += delta;
  588. }
  589. wr_ranlib(ar_fd, tab, (long) tnum);
  590. wr_long(ar_fd, (long) tssiz);
  591. wr_bytes(ar_fd, tstrtab, (long) tssiz);
  592. }
  593. /*
  594. * Return whether the bytes in `buf' form a good object header.
  595. * The header is put in `headp'.
  596. */
  597. int is_outhead(struct outhead *headp)
  598. {
  599. return !BADMAGIC(*headp) && headp->oh_nname != 0;
  600. }
  601. void do_object(int f, long size)
  602. {
  603. struct outhead headbuf;
  604. if (size < SZ_HEAD) {
  605. /* It can't be an object file. */
  606. return;
  607. }
  608. /*
  609. * Read a header to see if it is an object file.
  610. */
  611. if (! rd_fdopen(f)) {
  612. rd_fatal();
  613. }
  614. rd_ohead(&headbuf);
  615. if (!is_outhead(&headbuf)) {
  616. return;
  617. }
  618. do_names(&headbuf);
  619. }
  620. /*
  621. * First skip the names and read in the string table, then seek back to the
  622. * name table and read and write the names one by one. Update the ranlib table
  623. * accordingly.
  624. */
  625. void do_names(struct outhead *headp)
  626. {
  627. register char *strings;
  628. register int nnames = headp->oh_nname;
  629. #define NNAMES 100
  630. struct outname namebuf[NNAMES];
  631. long xxx = OFF_CHAR(*headp);
  632. if ( headp->oh_nchar != (unsigned int)headp->oh_nchar ||
  633. (strings = malloc((unsigned int)headp->oh_nchar)) == (char *)0
  634. ) {
  635. error(TRUE, "string table too big\n", NULL, NULL, NULL);
  636. }
  637. rd_string(strings, headp->oh_nchar);
  638. while (nnames) {
  639. int i = nnames >= NNAMES ? NNAMES : nnames;
  640. register struct outname *p = namebuf;
  641. nnames -= i;
  642. rd_name(namebuf, i);
  643. while (i--) {
  644. long off = p->on_foff - xxx;
  645. if (p->on_foff == (long)0) {
  646. p++;
  647. continue; /* An unrecognizable name. */
  648. }
  649. p->on_mptr = strings + off;
  650. /*
  651. * Only enter names that are exported and are really
  652. * defined. Also enter common names. Note, that
  653. * this might cause problems when the name is really
  654. * defined in a later file, with a value != 0.
  655. * However, this problem also exists on the Unix
  656. * ranlib archives.
  657. */
  658. if ( (p->on_type & S_EXT) &&
  659. (p->on_type & S_TYP) != S_UND
  660. )
  661. enter_name(p);
  662. p++;
  663. }
  664. }
  665. free(strings);
  666. }
  667. void enter_name(struct outname *namep)
  668. {
  669. register char *cp;
  670. if (tnum >= tabsz) {
  671. tab = (struct ranlib *)
  672. realloc((char *) tab, (tabsz += 512) * sizeof(struct ranlib));
  673. if (! tab) error(TRUE, "Out of core\n", NULL, NULL, NULL);
  674. }
  675. tab[tnum].ran_off = tssiz;
  676. tab[tnum].ran_pos = offset;
  677. for (cp = namep->on_mptr;; cp++) {
  678. if (tssiz >= strtabsz) {
  679. tstrtab = realloc(tstrtab, (strtabsz += 4096));
  680. if (! tstrtab) error(TRUE, "string table overflow\n", NULL, NULL, NULL);
  681. }
  682. tstrtab[tssiz++] = *cp;
  683. if (!*cp) break;
  684. }
  685. tnum++;
  686. }
  687. #endif /* AAL */