cache.c 16 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310311312313314315316317318319320321322323324325326327328329330331332333334335336337338339340341342343344345346347348349350351352353354355356357358359360361362363364365366367368369370371372373374375376377378379380381382383384385386387388389390391392393394395396397398399400401402403404405406407408409410411412413414415416417418419420421422423424425426427428429430431432433434435436437438439440441442443444445446447448449450451452453454455456457458459460461462463464465466467468469470471472473474475476477478479480481482483484485486487488489490491492493494495496497498499500501502503504505506507508509510511512513514515516517518519520521522523524525526527528529530531532533534535536537538539540541542543544545546547548549550551552553554555556557558559560561562563564565566567568569570571572573574575576577578579580581582583584585586587588589590591592593594595596597598599600601602603604605606607608609610611612613614615616617618619620621622623624625626627628629630631632633634635636637638639640641642643644645
  1. /* BFD library -- caching of file descriptors.
  2. Copyright (C) 1990-2015 Free Software Foundation, Inc.
  3. Hacked by Steve Chamberlain of Cygnus Support (steve@cygnus.com).
  4. This file is part of BFD, the Binary File Descriptor library.
  5. This program is free software; you can redistribute it and/or modify
  6. it under the terms of the GNU General Public License as published by
  7. the Free Software Foundation; either version 3 of the License, or
  8. (at your option) any later version.
  9. This program is distributed in the hope that it will be useful,
  10. but WITHOUT ANY WARRANTY; without even the implied warranty of
  11. MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
  12. GNU General Public License for more details.
  13. You should have received a copy of the GNU General Public License
  14. along with this program; if not, write to the Free Software
  15. Foundation, Inc., 51 Franklin Street - Fifth Floor, Boston,
  16. MA 02110-1301, USA. */
  17. /*
  18. SECTION
  19. File caching
  20. The file caching mechanism is embedded within BFD and allows
  21. the application to open as many BFDs as it wants without
  22. regard to the underlying operating system's file descriptor
  23. limit (often as low as 20 open files). The module in
  24. <<cache.c>> maintains a least recently used list of
  25. <<bfd_cache_max_open>> files, and exports the name
  26. <<bfd_cache_lookup>>, which runs around and makes sure that
  27. the required BFD is open. If not, then it chooses a file to
  28. close, closes it and opens the one wanted, returning its file
  29. handle.
  30. SUBSECTION
  31. Caching functions
  32. */
  33. #include "sysdep.h"
  34. #include "bfd.h"
  35. #include "libbfd.h"
  36. #include "libiberty.h"
  37. #include "bfd_stdint.h"
  38. #ifdef HAVE_MMAP
  39. #include <sys/mman.h>
  40. #endif
  41. /* In some cases we can optimize cache operation when reopening files.
  42. For instance, a flush is entirely unnecessary if the file is already
  43. closed, so a flush would use CACHE_NO_OPEN. Similarly, a seek using
  44. SEEK_SET or SEEK_END need not first seek to the current position.
  45. For stat we ignore seek errors, just in case the file has changed
  46. while we weren't looking. If it has, then it's possible that the
  47. file is shorter and we don't want a seek error to prevent us doing
  48. the stat. */
  49. enum cache_flag {
  50. CACHE_NORMAL = 0,
  51. CACHE_NO_OPEN = 1,
  52. CACHE_NO_SEEK = 2,
  53. CACHE_NO_SEEK_ERROR = 4
  54. };
  55. /* The maximum number of files which the cache will keep open at
  56. one time. When needed call bfd_cache_max_open to initialize. */
  57. static int max_open_files = 0;
  58. /* Set max_open_files, if not already set, to 12.5% of the allowed open
  59. file descriptors, but at least 10, and return the value. */
  60. static int
  61. bfd_cache_max_open (void)
  62. {
  63. if (max_open_files == 0)
  64. {
  65. int max;
  66. #ifdef HAVE_GETRLIMIT
  67. struct rlimit rlim;
  68. if (getrlimit (RLIMIT_NOFILE, &rlim) == 0
  69. && rlim.rlim_cur != (rlim_t) RLIM_INFINITY)
  70. max = rlim.rlim_cur / 8;
  71. else
  72. #endif /* HAVE_GETRLIMIT */
  73. #ifdef _SC_OPEN_MAX
  74. max = sysconf (_SC_OPEN_MAX) / 8;
  75. #else
  76. max = 10;
  77. #endif /* _SC_OPEN_MAX */
  78. max_open_files = max < 10 ? 10 : max;
  79. }
  80. return max_open_files;
  81. }
  82. /* The number of BFD files we have open. */
  83. static int open_files;
  84. /* Zero, or a pointer to the topmost BFD on the chain. This is
  85. used by the <<bfd_cache_lookup>> macro in @file{libbfd.h} to
  86. determine when it can avoid a function call. */
  87. static bfd *bfd_last_cache = NULL;
  88. /* Insert a BFD into the cache. */
  89. static void
  90. insert (bfd *abfd)
  91. {
  92. if (bfd_last_cache == NULL)
  93. {
  94. abfd->lru_next = abfd;
  95. abfd->lru_prev = abfd;
  96. }
  97. else
  98. {
  99. abfd->lru_next = bfd_last_cache;
  100. abfd->lru_prev = bfd_last_cache->lru_prev;
  101. abfd->lru_prev->lru_next = abfd;
  102. abfd->lru_next->lru_prev = abfd;
  103. }
  104. bfd_last_cache = abfd;
  105. }
  106. /* Remove a BFD from the cache. */
  107. static void
  108. snip (bfd *abfd)
  109. {
  110. abfd->lru_prev->lru_next = abfd->lru_next;
  111. abfd->lru_next->lru_prev = abfd->lru_prev;
  112. if (abfd == bfd_last_cache)
  113. {
  114. bfd_last_cache = abfd->lru_next;
  115. if (abfd == bfd_last_cache)
  116. bfd_last_cache = NULL;
  117. }
  118. }
  119. /* Close a BFD and remove it from the cache. */
  120. static bfd_boolean
  121. bfd_cache_delete (bfd *abfd)
  122. {
  123. bfd_boolean ret;
  124. if (fclose ((FILE *) abfd->iostream) == 0)
  125. ret = TRUE;
  126. else
  127. {
  128. ret = FALSE;
  129. bfd_set_error (bfd_error_system_call);
  130. }
  131. snip (abfd);
  132. abfd->iostream = NULL;
  133. --open_files;
  134. return ret;
  135. }
  136. /* We need to open a new file, and the cache is full. Find the least
  137. recently used cacheable BFD and close it. */
  138. static bfd_boolean
  139. close_one (void)
  140. {
  141. register bfd *to_kill;
  142. if (bfd_last_cache == NULL)
  143. to_kill = NULL;
  144. else
  145. {
  146. for (to_kill = bfd_last_cache->lru_prev;
  147. ! to_kill->cacheable;
  148. to_kill = to_kill->lru_prev)
  149. {
  150. if (to_kill == bfd_last_cache)
  151. {
  152. to_kill = NULL;
  153. break;
  154. }
  155. }
  156. }
  157. if (to_kill == NULL)
  158. {
  159. /* There are no open cacheable BFD's. */
  160. return TRUE;
  161. }
  162. to_kill->where = real_ftell ((FILE *) to_kill->iostream);
  163. return bfd_cache_delete (to_kill);
  164. }
  165. /* Check to see if the required BFD is the same as the last one
  166. looked up. If so, then it can use the stream in the BFD with
  167. impunity, since it can't have changed since the last lookup;
  168. otherwise, it has to perform the complicated lookup function. */
  169. #define bfd_cache_lookup(x, flag) \
  170. ((x) == bfd_last_cache \
  171. ? (FILE *) (bfd_last_cache->iostream) \
  172. : bfd_cache_lookup_worker (x, flag))
  173. /* Called when the macro <<bfd_cache_lookup>> fails to find a
  174. quick answer. Find a file descriptor for @var{abfd}. If
  175. necessary, it open it. If there are already more than
  176. <<bfd_cache_max_open>> files open, it tries to close one first, to
  177. avoid running out of file descriptors. It will return NULL
  178. if it is unable to (re)open the @var{abfd}. */
  179. static FILE *
  180. bfd_cache_lookup_worker (bfd *abfd, enum cache_flag flag)
  181. {
  182. bfd *orig_bfd = abfd;
  183. if ((abfd->flags & BFD_IN_MEMORY) != 0)
  184. abort ();
  185. while (abfd->my_archive)
  186. abfd = abfd->my_archive;
  187. if (abfd->iostream != NULL)
  188. {
  189. /* Move the file to the start of the cache. */
  190. if (abfd != bfd_last_cache)
  191. {
  192. snip (abfd);
  193. insert (abfd);
  194. }
  195. return (FILE *) abfd->iostream;
  196. }
  197. if (flag & CACHE_NO_OPEN)
  198. return NULL;
  199. if (bfd_open_file (abfd) == NULL)
  200. ;
  201. else if (!(flag & CACHE_NO_SEEK)
  202. && real_fseek ((FILE *) abfd->iostream, abfd->where, SEEK_SET) != 0
  203. && !(flag & CACHE_NO_SEEK_ERROR))
  204. bfd_set_error (bfd_error_system_call);
  205. else
  206. return (FILE *) abfd->iostream;
  207. (*_bfd_error_handler) (_("reopening %B: %s\n"),
  208. orig_bfd, bfd_errmsg (bfd_get_error ()));
  209. return NULL;
  210. }
  211. static file_ptr
  212. cache_btell (struct bfd *abfd)
  213. {
  214. FILE *f = bfd_cache_lookup (abfd, CACHE_NO_OPEN);
  215. if (f == NULL)
  216. return abfd->where;
  217. return real_ftell (f);
  218. }
  219. static int
  220. cache_bseek (struct bfd *abfd, file_ptr offset, int whence)
  221. {
  222. FILE *f = bfd_cache_lookup (abfd, whence != SEEK_CUR ? CACHE_NO_SEEK : CACHE_NORMAL);
  223. if (f == NULL)
  224. return -1;
  225. return real_fseek (f, offset, whence);
  226. }
  227. /* Note that archive entries don't have streams; they share their parent's.
  228. This allows someone to play with the iostream behind BFD's back.
  229. Also, note that the origin pointer points to the beginning of a file's
  230. contents (0 for non-archive elements). For archive entries this is the
  231. first octet in the file, NOT the beginning of the archive header. */
  232. static file_ptr
  233. cache_bread_1 (struct bfd *abfd, void *buf, file_ptr nbytes)
  234. {
  235. FILE *f;
  236. file_ptr nread;
  237. /* FIXME - this looks like an optimization, but it's really to cover
  238. up for a feature of some OSs (not solaris - sigh) that
  239. ld/pe-dll.c takes advantage of (apparently) when it creates BFDs
  240. internally and tries to link against them. BFD seems to be smart
  241. enough to realize there are no symbol records in the "file" that
  242. doesn't exist but attempts to read them anyway. On Solaris,
  243. attempting to read zero bytes from a NULL file results in a core
  244. dump, but on other platforms it just returns zero bytes read.
  245. This makes it to something reasonable. - DJ */
  246. if (nbytes == 0)
  247. return 0;
  248. f = bfd_cache_lookup (abfd, CACHE_NORMAL);
  249. if (f == NULL)
  250. return 0;
  251. #if defined (__VAX) && defined (VMS)
  252. /* Apparently fread on Vax VMS does not keep the record length
  253. information. */
  254. nread = read (fileno (f), buf, nbytes);
  255. /* Set bfd_error if we did not read as much data as we expected. If
  256. the read failed due to an error set the bfd_error_system_call,
  257. else set bfd_error_file_truncated. */
  258. if (nread == (file_ptr)-1)
  259. {
  260. bfd_set_error (bfd_error_system_call);
  261. return nread;
  262. }
  263. #else
  264. nread = fread (buf, 1, nbytes, f);
  265. /* Set bfd_error if we did not read as much data as we expected. If
  266. the read failed due to an error set the bfd_error_system_call,
  267. else set bfd_error_file_truncated. */
  268. if (nread < nbytes && ferror (f))
  269. {
  270. bfd_set_error (bfd_error_system_call);
  271. return nread;
  272. }
  273. #endif
  274. if (nread < nbytes)
  275. /* This may or may not be an error, but in case the calling code
  276. bails out because of it, set the right error code. */
  277. bfd_set_error (bfd_error_file_truncated);
  278. return nread;
  279. }
  280. static file_ptr
  281. cache_bread (struct bfd *abfd, void *buf, file_ptr nbytes)
  282. {
  283. file_ptr nread = 0;
  284. /* Some filesystems are unable to handle reads that are too large
  285. (for instance, NetApp shares with oplocks turned off). To avoid
  286. hitting this limitation, we read the buffer in chunks of 8MB max. */
  287. while (nread < nbytes)
  288. {
  289. const file_ptr max_chunk_size = 0x800000;
  290. file_ptr chunk_size = nbytes - nread;
  291. file_ptr chunk_nread;
  292. if (chunk_size > max_chunk_size)
  293. chunk_size = max_chunk_size;
  294. chunk_nread = cache_bread_1 (abfd, (char *) buf + nread, chunk_size);
  295. /* Update the nread count.
  296. We just have to be careful of the case when cache_bread_1 returns
  297. a negative count: If this is our first read, then set nread to
  298. that negative count in order to return that negative value to the
  299. caller. Otherwise, don't add it to our total count, or we would
  300. end up returning a smaller number of bytes read than we actually
  301. did. */
  302. if (nread == 0 || chunk_nread > 0)
  303. nread += chunk_nread;
  304. if (chunk_nread < chunk_size)
  305. break;
  306. }
  307. return nread;
  308. }
  309. static file_ptr
  310. cache_bwrite (struct bfd *abfd, const void *where, file_ptr nbytes)
  311. {
  312. file_ptr nwrite;
  313. FILE *f = bfd_cache_lookup (abfd, CACHE_NORMAL);
  314. if (f == NULL)
  315. return 0;
  316. nwrite = fwrite (where, 1, nbytes, f);
  317. if (nwrite < nbytes && ferror (f))
  318. {
  319. bfd_set_error (bfd_error_system_call);
  320. return -1;
  321. }
  322. return nwrite;
  323. }
  324. static int
  325. cache_bclose (struct bfd *abfd)
  326. {
  327. return bfd_cache_close (abfd) - 1;
  328. }
  329. static int
  330. cache_bflush (struct bfd *abfd)
  331. {
  332. int sts;
  333. FILE *f = bfd_cache_lookup (abfd, CACHE_NO_OPEN);
  334. if (f == NULL)
  335. return 0;
  336. sts = fflush (f);
  337. if (sts < 0)
  338. bfd_set_error (bfd_error_system_call);
  339. return sts;
  340. }
  341. static int
  342. cache_bstat (struct bfd *abfd, struct stat *sb)
  343. {
  344. int sts;
  345. FILE *f = bfd_cache_lookup (abfd, CACHE_NO_SEEK_ERROR);
  346. if (f == NULL)
  347. return -1;
  348. sts = fstat (fileno (f), sb);
  349. if (sts < 0)
  350. bfd_set_error (bfd_error_system_call);
  351. return sts;
  352. }
  353. static void *
  354. cache_bmmap (struct bfd *abfd ATTRIBUTE_UNUSED,
  355. void *addr ATTRIBUTE_UNUSED,
  356. bfd_size_type len ATTRIBUTE_UNUSED,
  357. int prot ATTRIBUTE_UNUSED,
  358. int flags ATTRIBUTE_UNUSED,
  359. file_ptr offset ATTRIBUTE_UNUSED,
  360. void **map_addr ATTRIBUTE_UNUSED,
  361. bfd_size_type *map_len ATTRIBUTE_UNUSED)
  362. {
  363. void *ret = (void *) -1;
  364. if ((abfd->flags & BFD_IN_MEMORY) != 0)
  365. abort ();
  366. #ifdef HAVE_MMAP
  367. else
  368. {
  369. static uintptr_t pagesize_m1;
  370. FILE *f;
  371. file_ptr pg_offset;
  372. bfd_size_type pg_len;
  373. f = bfd_cache_lookup (abfd, CACHE_NO_SEEK_ERROR);
  374. if (f == NULL)
  375. return ret;
  376. if (pagesize_m1 == 0)
  377. pagesize_m1 = getpagesize () - 1;
  378. /* Handle archive members. */
  379. if (abfd->my_archive != NULL)
  380. offset += abfd->origin;
  381. /* Align. */
  382. pg_offset = offset & ~pagesize_m1;
  383. pg_len = (len + (offset - pg_offset) + pagesize_m1) & ~pagesize_m1;
  384. ret = mmap (addr, pg_len, prot, flags, fileno (f), pg_offset);
  385. if (ret == (void *) -1)
  386. bfd_set_error (bfd_error_system_call);
  387. else
  388. {
  389. *map_addr = ret;
  390. *map_len = pg_len;
  391. ret = (char *) ret + (offset & pagesize_m1);
  392. }
  393. }
  394. #endif
  395. return ret;
  396. }
  397. static const struct bfd_iovec cache_iovec =
  398. {
  399. &cache_bread, &cache_bwrite, &cache_btell, &cache_bseek,
  400. &cache_bclose, &cache_bflush, &cache_bstat, &cache_bmmap
  401. };
  402. /*
  403. INTERNAL_FUNCTION
  404. bfd_cache_init
  405. SYNOPSIS
  406. bfd_boolean bfd_cache_init (bfd *abfd);
  407. DESCRIPTION
  408. Add a newly opened BFD to the cache.
  409. */
  410. bfd_boolean
  411. bfd_cache_init (bfd *abfd)
  412. {
  413. BFD_ASSERT (abfd->iostream != NULL);
  414. if (open_files >= bfd_cache_max_open ())
  415. {
  416. if (! close_one ())
  417. return FALSE;
  418. }
  419. abfd->iovec = &cache_iovec;
  420. insert (abfd);
  421. ++open_files;
  422. return TRUE;
  423. }
  424. /*
  425. INTERNAL_FUNCTION
  426. bfd_cache_close
  427. SYNOPSIS
  428. bfd_boolean bfd_cache_close (bfd *abfd);
  429. DESCRIPTION
  430. Remove the BFD @var{abfd} from the cache. If the attached file is open,
  431. then close it too.
  432. RETURNS
  433. <<FALSE>> is returned if closing the file fails, <<TRUE>> is
  434. returned if all is well.
  435. */
  436. bfd_boolean
  437. bfd_cache_close (bfd *abfd)
  438. {
  439. if (abfd->iovec != &cache_iovec)
  440. return TRUE;
  441. if (abfd->iostream == NULL)
  442. /* Previously closed. */
  443. return TRUE;
  444. return bfd_cache_delete (abfd);
  445. }
  446. /*
  447. FUNCTION
  448. bfd_cache_close_all
  449. SYNOPSIS
  450. bfd_boolean bfd_cache_close_all (void);
  451. DESCRIPTION
  452. Remove all BFDs from the cache. If the attached file is open,
  453. then close it too.
  454. RETURNS
  455. <<FALSE>> is returned if closing one of the file fails, <<TRUE>> is
  456. returned if all is well.
  457. */
  458. bfd_boolean
  459. bfd_cache_close_all ()
  460. {
  461. bfd_boolean ret = TRUE;
  462. while (bfd_last_cache != NULL)
  463. ret &= bfd_cache_close (bfd_last_cache);
  464. return ret;
  465. }
  466. /*
  467. INTERNAL_FUNCTION
  468. bfd_open_file
  469. SYNOPSIS
  470. FILE* bfd_open_file (bfd *abfd);
  471. DESCRIPTION
  472. Call the OS to open a file for @var{abfd}. Return the <<FILE *>>
  473. (possibly <<NULL>>) that results from this operation. Set up the
  474. BFD so that future accesses know the file is open. If the <<FILE *>>
  475. returned is <<NULL>>, then it won't have been put in the
  476. cache, so it won't have to be removed from it.
  477. */
  478. FILE *
  479. bfd_open_file (bfd *abfd)
  480. {
  481. abfd->cacheable = TRUE; /* Allow it to be closed later. */
  482. if (open_files >= bfd_cache_max_open ())
  483. {
  484. if (! close_one ())
  485. return NULL;
  486. }
  487. switch (abfd->direction)
  488. {
  489. case read_direction:
  490. case no_direction:
  491. abfd->iostream = real_fopen (abfd->filename, FOPEN_RB);
  492. break;
  493. case both_direction:
  494. case write_direction:
  495. if (abfd->opened_once)
  496. {
  497. abfd->iostream = real_fopen (abfd->filename, FOPEN_RUB);
  498. if (abfd->iostream == NULL)
  499. abfd->iostream = real_fopen (abfd->filename, FOPEN_WUB);
  500. }
  501. else
  502. {
  503. /* Create the file.
  504. Some operating systems won't let us overwrite a running
  505. binary. For them, we want to unlink the file first.
  506. However, gcc 2.95 will create temporary files using
  507. O_EXCL and tight permissions to prevent other users from
  508. substituting other .o files during the compilation. gcc
  509. will then tell the assembler to use the newly created
  510. file as an output file. If we unlink the file here, we
  511. open a brief window when another user could still
  512. substitute a file.
  513. So we unlink the output file if and only if it has
  514. non-zero size. */
  515. #ifndef __MSDOS__
  516. /* Don't do this for MSDOS: it doesn't care about overwriting
  517. a running binary, but if this file is already open by
  518. another BFD, we will be in deep trouble if we delete an
  519. open file. In fact, objdump does just that if invoked with
  520. the --info option. */
  521. struct stat s;
  522. if (stat (abfd->filename, &s) == 0 && s.st_size != 0)
  523. unlink_if_ordinary (abfd->filename);
  524. #endif
  525. abfd->iostream = real_fopen (abfd->filename, FOPEN_WUB);
  526. abfd->opened_once = TRUE;
  527. }
  528. break;
  529. }
  530. if (abfd->iostream == NULL)
  531. bfd_set_error (bfd_error_system_call);
  532. else
  533. {
  534. if (! bfd_cache_init (abfd))
  535. return NULL;
  536. }
  537. return (FILE *) abfd->iostream;
  538. }