Coverage Report

Created: 2026-07-25 10:20

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