Coverage Report

Created: 2025-07-08 11:15

/src/binutils-gdb/bfd/cache.c
Line
Count
Source (jump to first uncovered line)
1
/* BFD library -- caching of file descriptors.
2
3
   Copyright (C) 1990-2025 Free Software Foundation, Inc.
4
5
   Hacked by Steve Chamberlain of Cygnus Support (steve@cygnus.com).
6
7
   This file is part of BFD, the Binary File Descriptor library.
8
9
   This program is free software; you can redistribute it and/or modify
10
   it under the terms of the GNU General Public License as published by
11
   the Free Software Foundation; either version 3 of the License, or
12
   (at your option) any later version.
13
14
   This program is distributed in the hope that it will be useful,
15
   but WITHOUT ANY WARRANTY; without even the implied warranty of
16
   MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
17
   GNU General Public License for more details.
18
19
   You should have received a copy of the GNU General Public License
20
   along with this program; if not, write to the Free Software
21
   Foundation, Inc., 51 Franklin Street - Fifth Floor, Boston,
22
   MA 02110-1301, USA.  */
23
24
/*
25
SECTION
26
  File caching
27
28
  The file caching mechanism is embedded within BFD and allows
29
  the application to open as many BFDs as it wants without
30
  regard to the underlying operating system's file descriptor
31
  limit (often as low as 20 open files).  The module in
32
  <<cache.c>> maintains a least recently used list of
33
  <<bfd_cache_max_open>> files, and exports the name
34
  <<bfd_cache_lookup>>, which runs around and makes sure that
35
  the required BFD is open. If not, then it chooses a file to
36
  close, closes it and opens the one wanted, returning its file
37
  handle.
38
39
SUBSECTION
40
  Caching functions
41
*/
42
43
#include "sysdep.h"
44
#include "bfd.h"
45
#include "libbfd.h"
46
#include "libiberty.h"
47
48
static FILE *_bfd_open_file_unlocked (bfd *abfd);
49
50
/* In some cases we can optimize cache operation when reopening files.
51
   For instance, a flush is entirely unnecessary if the file is already
52
   closed, so a flush would use CACHE_NO_OPEN.  Similarly, a seek using
53
   SEEK_SET or SEEK_END need not first seek to the current position.
54
   For stat we ignore seek errors, just in case the file has changed
55
   while we weren't looking.  If it has, then it's possible that the
56
   file is shorter and we don't want a seek error to prevent us doing
57
   the stat.  */
58
enum cache_flag {
59
  CACHE_NORMAL = 0,
60
  CACHE_NO_OPEN = 1,
61
  CACHE_NO_SEEK = 2,
62
  CACHE_NO_SEEK_ERROR = 4
63
};
64
65
/* The maximum number of files which the cache will keep open at
66
   one time.  When needed call bfd_cache_max_open to initialize.  */
67
68
static unsigned max_open_files = 0;
69
70
/* Set max_open_files, if not already set, to 12.5% of the allowed open
71
   file descriptors, but at least 10, and return the value.  */
72
static unsigned
73
bfd_cache_max_open (void)
74
144k
{
75
144k
  if (max_open_files == 0)
76
13
    {
77
13
      int max;
78
#if defined(__sun) && !defined(__sparcv9) && !defined(__x86_64__)
79
      /* PR ld/19260: 32-bit Solaris has very inelegant handling of the 255
80
   file descriptor limit.  The problem is that setrlimit(2) can raise
81
   RLIMIT_NOFILE to a value that is not supported by libc, resulting
82
   in "Too many open files" errors.  This can happen here even though
83
   max_open_files is set to rlim.rlim_cur / 8.  For example, if
84
   a parent process has set rlim.rlim_cur to 65536, then max_open_files
85
   will be computed as 8192.
86
87
   This check essentially reverts to the behavior from binutils 2.23.1
88
   for 32-bit Solaris only.  (It is hoped that the 32-bit libc
89
   limitation will be removed soon).  64-bit Solaris libc does not have
90
   this limitation.  */
91
      max = 16;
92
#else
93
13
#ifdef HAVE_GETRLIMIT
94
13
      struct rlimit rlim;
95
96
13
      if (getrlimit (RLIMIT_NOFILE, &rlim) == 0
97
13
    && rlim.rlim_cur != (rlim_t) RLIM_INFINITY)
98
13
  max = rlim.rlim_cur / 8;
99
0
      else
100
0
#endif
101
0
#ifdef _SC_OPEN_MAX
102
0
  max = sysconf (_SC_OPEN_MAX) / 8;
103
#else
104
  max = 10;
105
#endif
106
13
#endif /* not 32-bit Solaris */
107
108
13
      max_open_files = max < 10 ? 10 : max;
109
13
    }
110
111
144k
  return max_open_files;
112
144k
}
113
114
/* The number of BFD files we have open.  */
115
116
static unsigned open_files;
117
118
/* Zero, or a pointer to the topmost BFD on the chain.  This is
119
   used by the <<bfd_cache_lookup>> macro in @file{libbfd.h} to
120
   determine when it can avoid a function call.  */
121
122
static bfd *bfd_last_cache = NULL;
123
124
/* Insert a BFD into the cache.  */
125
126
static void
127
insert (bfd *abfd)
128
355k
{
129
355k
  if (bfd_last_cache == NULL)
130
332k
    {
131
332k
      abfd->lru_next = abfd;
132
332k
      abfd->lru_prev = abfd;
133
332k
    }
134
23.1k
  else
135
23.1k
    {
136
23.1k
      abfd->lru_next = bfd_last_cache;
137
23.1k
      abfd->lru_prev = bfd_last_cache->lru_prev;
138
23.1k
      abfd->lru_prev->lru_next = abfd;
139
23.1k
      abfd->lru_next->lru_prev = abfd;
140
23.1k
    }
141
355k
  bfd_last_cache = abfd;
142
355k
}
143
144
/* Remove a BFD from the cache.  */
145
146
static void
147
snip (bfd *abfd)
148
355k
{
149
355k
  abfd->lru_prev->lru_next = abfd->lru_next;
150
355k
  abfd->lru_next->lru_prev = abfd->lru_prev;
151
355k
  if (abfd == bfd_last_cache)
152
339k
    {
153
339k
      bfd_last_cache = abfd->lru_next;
154
339k
      if (abfd == bfd_last_cache)
155
332k
  bfd_last_cache = NULL;
156
339k
    }
157
355k
}
158
159
/* Close a BFD and remove it from the cache.  */
160
161
static bool
162
bfd_cache_delete (bfd *abfd)
163
140k
{
164
140k
  bool ret;
165
166
140k
  if (fclose ((FILE *) abfd->iostream) == 0)
167
140k
    ret = true;
168
0
  else
169
0
    {
170
0
      ret = false;
171
0
      bfd_set_error (bfd_error_system_call);
172
0
    }
173
174
140k
  snip (abfd);
175
176
140k
  abfd->iostream = NULL;
177
140k
  BFD_ASSERT (open_files > 0);
178
140k
  --open_files;
179
140k
  abfd->flags |= BFD_CLOSED_BY_CACHE;
180
181
140k
  return ret;
182
140k
}
183
184
/* We need to open a new file, and the cache is full.  Find the least
185
   recently used cacheable BFD and close it.  */
186
187
static bool
188
close_one (void)
189
0
{
190
0
  register bfd *to_kill;
191
192
0
  if (bfd_last_cache == NULL)
193
0
    to_kill = NULL;
194
0
  else
195
0
    {
196
0
      for (to_kill = bfd_last_cache->lru_prev;
197
0
     ! to_kill->cacheable;
198
0
     to_kill = to_kill->lru_prev)
199
0
  {
200
0
    if (to_kill == bfd_last_cache)
201
0
      {
202
0
        to_kill = NULL;
203
0
        break;
204
0
      }
205
0
  }
206
0
    }
207
208
0
  if (to_kill == NULL)
209
0
    {
210
      /* There are no open cacheable BFD's.  */
211
0
      return true;
212
0
    }
213
214
0
  to_kill->where = _bfd_real_ftell ((FILE *) to_kill->iostream);
215
216
0
  return bfd_cache_delete (to_kill);
217
0
}
218
219
/* Check to see if the required BFD is the same as the last one
220
   looked up. If so, then it can use the stream in the BFD with
221
   impunity, since it can't have changed since the last lookup;
222
   otherwise, it has to perform the complicated lookup function.  */
223
224
#define bfd_cache_lookup(x, flag) \
225
1.74G
  ((x) == bfd_last_cache      \
226
1.74G
   ? (FILE *) (bfd_last_cache->iostream)  \
227
1.74G
   : bfd_cache_lookup_worker (x, flag))
228
229
/* A helper function that returns true if ABFD can possibly be cached
230
   -- that is, whether bfd_cache_lookup_worker will accept it.  */
231
232
static bool
233
possibly_cached (bfd *abfd)
234
1.73G
{
235
1.73G
  if ((abfd->flags & BFD_IN_MEMORY) != 0)
236
0
    return false;
237
1.73G
  if (abfd->my_archive != NULL
238
1.73G
      && !bfd_is_thin_archive (abfd->my_archive))
239
2.73M
    return false;
240
1.73G
  return true;
241
1.73G
}
242
243
/* Called when the macro <<bfd_cache_lookup>> fails to find a
244
   quick answer.  Find a file descriptor for @var{abfd}.  If
245
   necessary, it open it.  If there are already more than
246
   <<bfd_cache_max_open>> files open, it tries to close one first, to
247
   avoid running out of file descriptors.  It will return NULL
248
   if it is unable to (re)open the @var{abfd}.  */
249
250
static FILE *
251
bfd_cache_lookup_worker (bfd *abfd, enum cache_flag flag)
252
1.73G
{
253
1.73G
  if (!possibly_cached (abfd))
254
0
    abort ();
255
256
  /* If the BFD is being processed by bfd_check_format_matches, it
257
     must already be open and won't be on the list.  */
258
1.73G
  if (abfd->in_format_matches)
259
1.73G
    {
260
1.73G
      if (abfd->iostream == NULL)
261
0
  abort ();
262
1.73G
      return (FILE *) abfd->iostream;
263
1.73G
    }
264
265
12.8k
  if (abfd->iostream != NULL)
266
12.8k
    {
267
      /* Move the file to the start of the cache.  */
268
12.8k
      if (abfd != bfd_last_cache)
269
12.8k
  {
270
12.8k
    snip (abfd);
271
12.8k
    insert (abfd);
272
12.8k
  }
273
12.8k
      return (FILE *) abfd->iostream;
274
12.8k
    }
275
276
0
  if (flag & CACHE_NO_OPEN)
277
0
    return NULL;
278
279
0
  if (_bfd_open_file_unlocked (abfd) == NULL)
280
0
    ;
281
0
  else if (!(flag & CACHE_NO_SEEK)
282
0
     && _bfd_real_fseek ((FILE *) abfd->iostream,
283
0
             abfd->where, SEEK_SET) != 0
284
0
     && !(flag & CACHE_NO_SEEK_ERROR))
285
0
    bfd_set_error (bfd_error_system_call);
286
0
  else
287
0
    return (FILE *) abfd->iostream;
288
289
  /* xgettext:c-format */
290
0
  _bfd_error_handler (_("reopening %pB: %s"),
291
0
          abfd, bfd_errmsg (bfd_get_error ()));
292
0
  return NULL;
293
0
}
294
295
static file_ptr
296
cache_btell (struct bfd *abfd)
297
7.44M
{
298
7.44M
  if (!bfd_lock ())
299
0
    return -1;
300
7.44M
  FILE *f = bfd_cache_lookup (abfd, CACHE_NO_OPEN);
301
7.44M
  if (f == NULL)
302
0
    {
303
0
      if (!bfd_unlock ())
304
0
  return -1;
305
0
      return abfd->where;
306
0
    }
307
7.44M
  file_ptr result = _bfd_real_ftell (f);
308
7.44M
  if (!bfd_unlock ())
309
0
    return -1;
310
7.44M
  return result;
311
7.44M
}
312
313
static int
314
cache_bseek (struct bfd *abfd, file_ptr offset, int whence)
315
802M
{
316
802M
  if (!bfd_lock ())
317
0
    return -1;
318
802M
  FILE *f = bfd_cache_lookup (abfd, whence != SEEK_CUR ? CACHE_NO_SEEK : CACHE_NORMAL);
319
802M
  if (f == NULL)
320
0
    {
321
0
      bfd_unlock ();
322
0
      return -1;
323
0
    }
324
802M
  int result = _bfd_real_fseek (f, offset, whence);
325
802M
  if (!bfd_unlock ())
326
0
    return -1;
327
802M
  return result;
328
802M
}
329
330
/* Note that archive entries don't have streams; they share their parent's.
331
   This allows someone to play with the iostream behind BFD's back.
332
333
   Also, note that the origin pointer points to the beginning of a file's
334
   contents (0 for non-archive elements).  For archive entries this is the
335
   first octet in the file, NOT the beginning of the archive header.  */
336
337
static file_ptr
338
cache_bread_1 (FILE *f, void *buf, file_ptr nbytes)
339
878M
{
340
878M
  file_ptr nread;
341
342
#if defined (__VAX) && defined (VMS)
343
  /* Apparently fread on Vax VMS does not keep the record length
344
     information.  */
345
  nread = read (fileno (f), buf, nbytes);
346
  /* Set bfd_error if we did not read as much data as we expected.  If
347
     the read failed due to an error set the bfd_error_system_call,
348
     else set bfd_error_file_truncated.  */
349
  if (nread == (file_ptr)-1)
350
    {
351
      bfd_set_error (bfd_error_system_call);
352
      return nread;
353
    }
354
#else
355
878M
  nread = fread (buf, 1, nbytes, f);
356
  /* Set bfd_error if we did not read as much data as we expected.  If
357
     the read failed due to an error set the bfd_error_system_call,
358
     else set bfd_error_file_truncated.  */
359
878M
  if (nread < nbytes && ferror (f))
360
238k
    {
361
238k
      bfd_set_error (bfd_error_system_call);
362
238k
      return nread;
363
238k
    }
364
878M
#endif
365
878M
  if (nread < nbytes)
366
    /* This may or may not be an error, but in case the calling code
367
       bails out because of it, set the right error code.  */
368
71.4M
    bfd_set_error (bfd_error_file_truncated);
369
878M
  return nread;
370
878M
}
371
372
static file_ptr
373
cache_bread (struct bfd *abfd, void *buf, file_ptr nbytes)
374
879M
{
375
879M
  if (!bfd_lock ())
376
0
    return -1;
377
879M
  file_ptr nread = 0;
378
879M
  FILE *f;
379
380
879M
  f = bfd_cache_lookup (abfd, CACHE_NORMAL);
381
879M
  if (f == NULL)
382
0
    {
383
0
      bfd_unlock ();
384
0
      return -1;
385
0
    }
386
387
  /* Some filesystems are unable to handle reads that are too large
388
     (for instance, NetApp shares with oplocks turned off).  To avoid
389
     hitting this limitation, we read the buffer in chunks of 8MB max.  */
390
1.68G
  while (nread < nbytes)
391
878M
    {
392
878M
      const file_ptr max_chunk_size = 0x800000;
393
878M
      file_ptr chunk_size = nbytes - nread;
394
878M
      file_ptr chunk_nread;
395
396
878M
      if (chunk_size > max_chunk_size)
397
94
  chunk_size = max_chunk_size;
398
399
878M
      chunk_nread = cache_bread_1 (f, (char *) buf + nread, chunk_size);
400
401
      /* Update the nread count.
402
403
   We just have to be careful of the case when cache_bread_1 returns
404
   a negative count:  If this is our first read, then set nread to
405
   that negative count in order to return that negative value to the
406
   caller.  Otherwise, don't add it to our total count, or we would
407
   end up returning a smaller number of bytes read than we actually
408
   did.  */
409
878M
      if (nread == 0 || chunk_nread > 0)
410
878M
  nread += chunk_nread;
411
412
878M
      if (chunk_nread < chunk_size)
413
71.6M
  break;
414
878M
    }
415
416
879M
  if (!bfd_unlock ())
417
0
    return -1;
418
879M
  return nread;
419
879M
}
420
421
static file_ptr
422
cache_bwrite (struct bfd *abfd, const void *from, file_ptr nbytes)
423
102k
{
424
102k
  if (!bfd_lock ())
425
0
    return -1;
426
102k
  file_ptr nwrite;
427
102k
  FILE *f = bfd_cache_lookup (abfd, CACHE_NORMAL);
428
429
102k
  if (f == NULL)
430
0
    {
431
0
      if (!bfd_unlock ())
432
0
  return -1;
433
0
      return 0;
434
0
    }
435
102k
  nwrite = fwrite (from, 1, nbytes, f);
436
102k
  if (nwrite < nbytes && ferror (f))
437
0
    {
438
0
      bfd_set_error (bfd_error_system_call);
439
0
      bfd_unlock ();
440
0
      return -1;
441
0
    }
442
102k
  if (!bfd_unlock ())
443
0
    return -1;
444
102k
  return nwrite;
445
102k
}
446
447
static int
448
cache_bclose (struct bfd *abfd)
449
2.80M
{
450
  /* No locking needed here, it's handled by the callee.  */
451
2.80M
  return bfd_cache_close (abfd) - 1;
452
2.80M
}
453
454
static int
455
cache_bflush (struct bfd *abfd)
456
2.95k
{
457
2.95k
  if (!bfd_lock ())
458
0
    return -1;
459
2.95k
  int sts;
460
2.95k
  FILE *f = bfd_cache_lookup (abfd, CACHE_NO_OPEN);
461
462
2.95k
  if (f == NULL)
463
0
    {
464
0
      if (!bfd_unlock ())
465
0
  return -1;
466
0
      return 0;
467
0
    }
468
2.95k
  sts = fflush (f);
469
2.95k
  if (sts < 0)
470
0
    bfd_set_error (bfd_error_system_call);
471
2.95k
  if (!bfd_unlock ())
472
0
    return -1;
473
2.95k
  return sts;
474
2.95k
}
475
476
static int
477
cache_bstat (struct bfd *abfd, struct stat *sb)
478
56.4M
{
479
56.4M
  if (!bfd_lock ())
480
0
    return -1;
481
56.4M
  int sts;
482
56.4M
  FILE *f = bfd_cache_lookup (abfd, CACHE_NO_SEEK_ERROR);
483
484
56.4M
  if (f == NULL)
485
0
    {
486
0
      bfd_unlock ();
487
0
      return -1;
488
0
    }
489
56.4M
  sts = fstat (fileno (f), sb);
490
56.4M
  if (sts < 0)
491
0
    bfd_set_error (bfd_error_system_call);
492
56.4M
  if (!bfd_unlock ())
493
0
    return -1;
494
56.4M
  return sts;
495
56.4M
}
496
497
static void *
498
cache_bmmap (struct bfd *abfd ATTRIBUTE_UNUSED,
499
       void *addr ATTRIBUTE_UNUSED,
500
       size_t len ATTRIBUTE_UNUSED,
501
       int prot ATTRIBUTE_UNUSED,
502
       int flags ATTRIBUTE_UNUSED,
503
       file_ptr offset ATTRIBUTE_UNUSED,
504
       void **map_addr ATTRIBUTE_UNUSED,
505
       size_t *map_len ATTRIBUTE_UNUSED)
506
6.46k
{
507
6.46k
  void *ret = MAP_FAILED;
508
509
6.46k
  if (!bfd_lock ())
510
0
    return ret;
511
6.46k
  if ((abfd->flags & BFD_IN_MEMORY) != 0)
512
0
    abort ();
513
6.46k
#ifdef HAVE_MMAP
514
6.46k
  else
515
6.46k
    {
516
6.46k
      uintptr_t pagesize_m1 = _bfd_pagesize_m1;
517
6.46k
      FILE *f;
518
6.46k
      file_ptr pg_offset;
519
6.46k
      size_t pg_len;
520
521
6.46k
      f = bfd_cache_lookup (abfd, CACHE_NO_SEEK_ERROR);
522
6.46k
      if (f == NULL)
523
0
  {
524
0
    bfd_unlock ();
525
0
    return ret;
526
0
  }
527
528
      /* Align.  */
529
6.46k
      pg_offset = offset & ~pagesize_m1;
530
6.46k
      pg_len = (len + (offset - pg_offset) + pagesize_m1) & ~pagesize_m1;
531
532
6.46k
      ret = mmap (addr, pg_len, prot, flags, fileno (f), pg_offset);
533
6.46k
      if (ret == MAP_FAILED)
534
0
  bfd_set_error (bfd_error_system_call);
535
6.46k
      else
536
6.46k
  {
537
6.46k
    *map_addr = ret;
538
6.46k
    *map_len = pg_len;
539
6.46k
    ret = (char *) ret + (offset & pagesize_m1);
540
6.46k
  }
541
6.46k
    }
542
6.46k
#endif
543
544
6.46k
  if (!bfd_unlock ())
545
0
    return MAP_FAILED;
546
6.46k
  return ret;
547
6.46k
}
548
549
static const struct bfd_iovec cache_iovec =
550
{
551
  &cache_bread, &cache_bwrite, &cache_btell, &cache_bseek,
552
  &cache_bclose, &cache_bflush, &cache_bstat, &cache_bmmap
553
};
554
555
static bool
556
_bfd_cache_init_unlocked (bfd *abfd)
557
140k
{
558
140k
  BFD_ASSERT (abfd->iostream != NULL);
559
140k
  if (open_files >= bfd_cache_max_open ())
560
0
    {
561
0
      if (! close_one ())
562
0
  return false;
563
0
    }
564
140k
  abfd->iovec = &cache_iovec;
565
140k
  insert (abfd);
566
140k
  abfd->flags &= ~BFD_CLOSED_BY_CACHE;
567
140k
  ++open_files;
568
140k
  return true;
569
140k
}
570
571
/*
572
INTERNAL_FUNCTION
573
  bfd_cache_init
574
575
SYNOPSIS
576
  bool bfd_cache_init (bfd *abfd);
577
578
DESCRIPTION
579
  Add a newly opened BFD to the cache.
580
*/
581
582
bool
583
bfd_cache_init (bfd *abfd)
584
136k
{
585
136k
  if (!bfd_lock ())
586
0
    return false;
587
136k
  bool result = _bfd_cache_init_unlocked (abfd);
588
136k
  if (!bfd_unlock ())
589
0
    return false;
590
136k
  return result;
591
136k
}
592
593
static bool
594
_bfd_cache_close_unlocked (bfd *abfd)
595
2.97M
{
596
  /* Don't remove this test.  bfd_reinit depends on it.  */
597
2.97M
  if (abfd->iovec != &cache_iovec)
598
55.5k
    return true;
599
600
2.92M
  if (abfd->iostream == NULL)
601
    /* Previously closed.  */
602
2.78M
    return true;
603
604
  /* Note: no locking needed in this function, as it is handled by
605
     bfd_cache_delete.  */
606
140k
  return bfd_cache_delete (abfd);
607
2.92M
}
608
609
/*
610
FUNCTION
611
  bfd_cache_close
612
613
SYNOPSIS
614
  bool bfd_cache_close (bfd *abfd);
615
616
DESCRIPTION
617
  Remove the BFD @var{abfd} from the cache. If the attached file is open,
618
  then close it too.
619
620
  <<FALSE>> is returned if closing the file fails, <<TRUE>> is
621
  returned if all is well.
622
*/
623
624
bool
625
bfd_cache_close (bfd *abfd)
626
2.97M
{
627
2.97M
  if (!bfd_lock ())
628
0
    return false;
629
2.97M
  bool result = _bfd_cache_close_unlocked (abfd);
630
2.97M
  if (!bfd_unlock ())
631
0
    return false;
632
2.97M
  return result;
633
2.97M
}
634
635
/*
636
FUNCTION
637
  bfd_cache_close_all
638
639
SYNOPSIS
640
  bool bfd_cache_close_all (void);
641
642
DESCRIPTION
643
  Remove all BFDs from the cache. If the attached file is open,
644
  then close it too.  Note - despite its name this function will
645
  close a BFD even if it is not marked as being cacheable, ie
646
  even if bfd_get_cacheable() returns false.
647
648
  <<FALSE>> is returned if closing one of the file fails, <<TRUE>> is
649
  returned if all is well.
650
*/
651
652
bool
653
bfd_cache_close_all (void)
654
0
{
655
0
  bool ret = true;
656
657
0
  if (!bfd_lock ())
658
0
    return false;
659
0
  while (bfd_last_cache != NULL)
660
0
    {
661
0
      bfd *prev_bfd_last_cache = bfd_last_cache;
662
663
0
      ret &= _bfd_cache_close_unlocked (bfd_last_cache);
664
665
      /* Stop a potential infinite loop should bfd_cache_close()
666
   not update bfd_last_cache.  */
667
0
      if (bfd_last_cache == prev_bfd_last_cache)
668
0
  break;
669
0
    }
670
671
0
  if (!bfd_unlock ())
672
0
    return false;
673
0
  return ret;
674
0
}
675
676
/*
677
INTERNAL_FUNCTION
678
  bfd_cache_set_uncloseable
679
680
SYNOPSIS
681
  bool bfd_cache_set_uncloseable (bfd *abfd, bool value, bool *old);
682
683
DESCRIPTION
684
  Internal function to mark ABFD as either closeable or not.
685
  This is used by bfd_check_format_matches to avoid races
686
  where bfd_cache_close_all is called in another thread.
687
  VALUE is true to mark the BFD as temporarily uncloseable
688
  by the cache; false to mark it as closeable once again.
689
  OLD, if non-NULL, is set to the previous value of the flag.
690
  Returns false on error, true on success.
691
*/
692
693
bool
694
bfd_cache_set_uncloseable (bfd *abfd, bool value, bool *old)
695
5.86M
{
696
5.86M
  bool result = true;
697
698
5.86M
  if (!bfd_lock ())
699
0
    return false;
700
5.86M
  if (old != NULL)
701
2.93M
    *old = abfd->in_format_matches;
702
703
  /* Only perform any action when the state changes,and only when this
704
     BFD is actually using the cache.  */
705
5.86M
  if (value != abfd->in_format_matches
706
5.86M
      && abfd->iovec == &cache_iovec
707
5.86M
      && possibly_cached (abfd))
708
404k
    {
709
404k
      if (value)
710
202k
  {
711
    /* Marking as uncloseable for the first time.  Ensure the
712
       file is open, and remove from the cache list.  */
713
202k
    FILE *f = bfd_cache_lookup (abfd, CACHE_NORMAL);
714
202k
    if (f == NULL)
715
0
      result = false;
716
202k
    else
717
202k
      snip (abfd);
718
202k
  }
719
202k
      else
720
202k
  {
721
    /* Mark as closeable again.  */
722
202k
    insert (abfd);
723
202k
  }
724
725
404k
      abfd->in_format_matches = value;
726
404k
    }
727
728
5.86M
  if (!bfd_unlock ())
729
0
    return false;
730
5.86M
  return result;
731
5.86M
}
732
733
/*
734
FUNCTION
735
  bfd_cache_size
736
737
SYNOPSIS
738
  unsigned bfd_cache_size (void);
739
740
DESCRIPTION
741
  Return the number of open files in the cache.
742
*/
743
744
unsigned
745
bfd_cache_size (void)
746
0
{
747
0
  return open_files;
748
0
}
749
750
static FILE *
751
_bfd_open_file_unlocked (bfd *abfd)
752
3.79k
{
753
3.79k
  abfd->cacheable = true; /* Allow it to be closed later.  */
754
755
3.79k
  if (open_files >= bfd_cache_max_open ())
756
0
    {
757
0
      if (! close_one ())
758
0
  return NULL;
759
0
    }
760
761
3.79k
  switch (abfd->direction)
762
3.79k
    {
763
242
    case read_direction:
764
242
    case no_direction:
765
242
      abfd->iostream = _bfd_real_fopen (bfd_get_filename (abfd), FOPEN_RB);
766
242
      break;
767
0
    case both_direction:
768
3.55k
    case write_direction:
769
3.55k
      if (abfd->opened_once)
770
0
  {
771
0
    abfd->iostream = _bfd_real_fopen (bfd_get_filename (abfd),
772
0
              FOPEN_RUB);
773
0
    if (abfd->iostream == NULL)
774
0
      abfd->iostream = _bfd_real_fopen (bfd_get_filename (abfd),
775
0
                FOPEN_WUB);
776
0
  }
777
3.55k
      else
778
3.55k
  {
779
    /* Create the file.
780
781
       Some operating systems won't let us overwrite a running
782
       binary.  For them, we want to unlink the file first.
783
784
       However, gcc 2.95 will create temporary files using
785
       O_EXCL and tight permissions to prevent other users from
786
       substituting other .o files during the compilation.  gcc
787
       will then tell the assembler to use the newly created
788
       file as an output file.  If we unlink the file here, we
789
       open a brief window when another user could still
790
       substitute a file.
791
792
       So we unlink the output file if and only if it has
793
       non-zero size.  */
794
3.55k
#ifndef __MSDOS__
795
    /* Don't do this for MSDOS: it doesn't care about overwriting
796
       a running binary, but if this file is already open by
797
       another BFD, we will be in deep trouble if we delete an
798
       open file.  In fact, objdump does just that if invoked with
799
       the --info option.  */
800
3.55k
    struct stat s;
801
802
3.55k
    if (stat (bfd_get_filename (abfd), &s) == 0 && s.st_size != 0)
803
199
      unlink_if_ordinary (bfd_get_filename (abfd));
804
3.55k
#endif
805
3.55k
    abfd->iostream = _bfd_real_fopen (bfd_get_filename (abfd),
806
3.55k
              FOPEN_WUB);
807
3.55k
    abfd->opened_once = true;
808
3.55k
  }
809
3.55k
      break;
810
3.79k
    }
811
812
3.79k
  if (abfd->iostream == NULL)
813
159
    bfd_set_error (bfd_error_system_call);
814
3.63k
  else
815
3.63k
    {
816
3.63k
      if (! _bfd_cache_init_unlocked (abfd))
817
0
  return NULL;
818
3.63k
    }
819
820
3.79k
  return (FILE *) abfd->iostream;
821
3.79k
}
822
823
/*
824
INTERNAL_FUNCTION
825
  bfd_open_file
826
827
SYNOPSIS
828
  FILE* bfd_open_file (bfd *abfd);
829
830
DESCRIPTION
831
  Call the OS to open a file for @var{abfd}.  Return the <<FILE *>>
832
  (possibly <<NULL>>) that results from this operation.  Set up the
833
  BFD so that future accesses know the file is open. If the <<FILE *>>
834
  returned is <<NULL>>, then it won't have been put in the
835
  cache, so it won't have to be removed from it.
836
*/
837
838
FILE *
839
bfd_open_file (bfd *abfd)
840
3.79k
{
841
3.79k
  if (!bfd_lock ())
842
0
    return NULL;
843
3.79k
  FILE *result = _bfd_open_file_unlocked (abfd);
844
3.79k
  if (!bfd_unlock ())
845
0
    return NULL;
846
3.79k
  return result;
847
3.79k
}