archiver.c 16 KB

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