Coverage Report

Created: 2026-07-12 09:22

next uncovered line (L), next uncovered region (R), next uncovered branch (B)
/src/binutils-gdb/bfd/libbfd.c
Line
Count
Source
1
/* Assorted BFD support routines, only used internally.
2
   Copyright (C) 1990-2026 Free Software Foundation, Inc.
3
   Written by Cygnus Support.
4
5
   This file is part of BFD, the Binary File Descriptor library.
6
7
   This program is free software; you can redistribute it and/or modify
8
   it under the terms of the GNU General Public License as published by
9
   the Free Software Foundation; either version 3 of the License, or
10
   (at your option) any later version.
11
12
   This program is distributed in the hope that it will be useful,
13
   but WITHOUT ANY WARRANTY; without even the implied warranty of
14
   MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
15
   GNU General Public License for more details.
16
17
   You should have received a copy of the GNU General Public License
18
   along with this program; if not, write to the Free Software
19
   Foundation, Inc., 51 Franklin Street - Fifth Floor, Boston,
20
   MA 02110-1301, USA.  */
21
22
#include "sysdep.h"
23
#include "bfd.h"
24
#include "elf-bfd.h"
25
#include "libbfd.h"
26
#include "objalloc.h"
27
28
#ifndef HAVE_GETPAGESIZE
29
#define getpagesize() 2048
30
#endif
31
32
/*
33
SECTION
34
  Implementation details
35
36
SUBSECTION
37
  Internal functions
38
39
DESCRIPTION
40
  These routines are used within BFD.
41
  They are not intended for export, but are documented here for
42
  completeness.
43
*/
44
45
bool
46
_bfd_bool_bfd_false (bfd *abfd ATTRIBUTE_UNUSED)
47
0
{
48
0
  return false;
49
0
}
50
51
bool
52
_bfd_bool_bfd_asymbol_false (bfd *abfd ATTRIBUTE_UNUSED,
53
           asymbol *sym ATTRIBUTE_UNUSED)
54
49.7k
{
55
49.7k
  return false;
56
49.7k
}
57
58
/* A routine which is used in target vectors for unsupported
59
   operations.  */
60
61
bool
62
_bfd_bool_bfd_false_error (bfd *ignore ATTRIBUTE_UNUSED)
63
14.6k
{
64
14.6k
  bfd_set_error (bfd_error_invalid_operation);
65
14.6k
  return false;
66
14.6k
}
67
68
bool
69
_bfd_bool_bfd_link_false_error (bfd *abfd,
70
        struct bfd_link_info *info ATTRIBUTE_UNUSED)
71
0
{
72
0
  return _bfd_bool_bfd_false_error (abfd);
73
0
}
74
75
/* A routine which is used in target vectors for supported operations
76
   which do not actually do anything.  */
77
78
bool
79
_bfd_bool_bfd_true (bfd *ignore ATTRIBUTE_UNUSED)
80
7.85k
{
81
7.85k
  return true;
82
7.85k
}
83
84
bool
85
_bfd_bool_bfd_link_true (bfd *abfd ATTRIBUTE_UNUSED,
86
       struct bfd_link_info *info ATTRIBUTE_UNUSED)
87
0
{
88
0
  return true;
89
0
}
90
91
bool
92
_bfd_bool_bfd_bfd_true (bfd *ibfd ATTRIBUTE_UNUSED,
93
      bfd *obfd ATTRIBUTE_UNUSED)
94
3.90k
{
95
3.90k
  return true;
96
3.90k
}
97
98
bool
99
_bfd_bool_bfd_uint_true (bfd *abfd ATTRIBUTE_UNUSED,
100
       unsigned int flags ATTRIBUTE_UNUSED)
101
0
{
102
0
  return true;
103
0
}
104
105
bool
106
_bfd_bool_bfd_asection_bfd_asection_true (bfd *ibfd ATTRIBUTE_UNUSED,
107
            asection *isec ATTRIBUTE_UNUSED,
108
            bfd *obfd ATTRIBUTE_UNUSED,
109
            asection *osec ATTRIBUTE_UNUSED)
110
0
{
111
0
  return true;
112
0
}
113
114
bool
115
_bfd_bool_bfd_asymbol_bfd_asymbol_true (bfd *ibfd ATTRIBUTE_UNUSED,
116
          asymbol **isym ATTRIBUTE_UNUSED,
117
          bfd *obfd ATTRIBUTE_UNUSED,
118
          asymbol **osym ATTRIBUTE_UNUSED)
119
12.1k
{
120
12.1k
  return true;
121
12.1k
}
122
123
bool
124
_bfd_bool_bfd_ptr_true (bfd *abfd ATTRIBUTE_UNUSED,
125
      void *ptr ATTRIBUTE_UNUSED)
126
2.13k
{
127
2.13k
  return true;
128
2.13k
}
129
130
/* A routine which is used in target vectors for unsupported
131
   operations which return a pointer value.  */
132
133
void *
134
_bfd_ptr_bfd_null_error (bfd *ignore ATTRIBUTE_UNUSED)
135
4.10k
{
136
4.10k
  bfd_set_error (bfd_error_invalid_operation);
137
4.10k
  return NULL;
138
4.10k
}
139
140
int
141
_bfd_int_bfd_0 (bfd *ignore ATTRIBUTE_UNUSED)
142
0
{
143
0
  return 0;
144
0
}
145
146
unsigned int
147
_bfd_uint_bfd_0 (bfd *ignore ATTRIBUTE_UNUSED)
148
0
{
149
0
   return 0;
150
0
}
151
152
long
153
_bfd_long_bfd_0 (bfd *ignore ATTRIBUTE_UNUSED)
154
766
{
155
766
  return 0;
156
766
}
157
158
/* A routine which is used in target vectors for unsupported
159
   operations which return -1 on error.  */
160
161
long
162
_bfd_long_bfd_n1_error (bfd *ignore_abfd ATTRIBUTE_UNUSED)
163
14.8k
{
164
14.8k
  bfd_set_error (bfd_error_invalid_operation);
165
14.8k
  return -1;
166
14.8k
}
167
168
void
169
_bfd_void_bfd (bfd *ignore ATTRIBUTE_UNUSED)
170
9.73M
{
171
9.73M
}
172
173
void
174
_bfd_void_bfd_link (bfd *abfd ATTRIBUTE_UNUSED,
175
        struct bfd_link_info *info ATTRIBUTE_UNUSED)
176
0
{
177
0
}
178
179
void
180
_bfd_void_bfd_asection (bfd *abfd ATTRIBUTE_UNUSED,
181
      asection *sec ATTRIBUTE_UNUSED)
182
0
{
183
0
}
184
185
long
186
_bfd_norelocs_get_reloc_upper_bound (bfd *abfd ATTRIBUTE_UNUSED,
187
             asection *sec ATTRIBUTE_UNUSED)
188
886
{
189
886
  return sizeof (arelent *);
190
886
}
191
192
long
193
_bfd_norelocs_canonicalize_reloc (bfd *abfd ATTRIBUTE_UNUSED,
194
          asection *sec ATTRIBUTE_UNUSED,
195
          arelent **relptr,
196
          asymbol **symbols ATTRIBUTE_UNUSED)
197
886
{
198
886
  *relptr = NULL;
199
886
  return 0;
200
886
}
201
202
bool
203
_bfd_norelocs_finalize_section_relocs (bfd *abfd ATTRIBUTE_UNUSED,
204
               asection *sec ATTRIBUTE_UNUSED,
205
               arelent **relptr ATTRIBUTE_UNUSED,
206
               unsigned int count ATTRIBUTE_UNUSED)
207
814
{
208
814
  return true;
209
814
}
210
211
bool
212
_bfd_nocore_core_file_matches_executable_p
213
  (bfd *ignore_core_bfd ATTRIBUTE_UNUSED,
214
   bfd *ignore_exec_bfd ATTRIBUTE_UNUSED)
215
0
{
216
0
  bfd_set_error (bfd_error_invalid_operation);
217
0
  return false;
218
0
}
219
220
/* Routine to handle core_file_failing_command entry point for targets
221
   without core file support.  */
222
223
char *
224
_bfd_nocore_core_file_failing_command (bfd *ignore_abfd ATTRIBUTE_UNUSED)
225
0
{
226
0
  bfd_set_error (bfd_error_invalid_operation);
227
0
  return NULL;
228
0
}
229
230
/* Routine to handle core_file_failing_signal entry point for targets
231
   without core file support.  */
232
233
int
234
_bfd_nocore_core_file_failing_signal (bfd *ignore_abfd ATTRIBUTE_UNUSED)
235
0
{
236
0
  bfd_set_error (bfd_error_invalid_operation);
237
0
  return 0;
238
0
}
239
240
/* Routine to handle the core_file_pid entry point for targets without
241
   core file support.  */
242
243
int
244
_bfd_nocore_core_file_pid (bfd *ignore_abfd ATTRIBUTE_UNUSED)
245
0
{
246
0
  bfd_set_error (bfd_error_invalid_operation);
247
0
  return 0;
248
0
}
249
250
bfd_cleanup
251
_bfd_dummy_target (bfd *ignore_abfd ATTRIBUTE_UNUSED)
252
3.55M
{
253
3.55M
  bfd_set_error (bfd_error_wrong_format);
254
3.55M
  return 0;
255
3.55M
}
256

257
/* Allocate memory using malloc.  */
258
259
#ifndef SSIZE_MAX
260
37.4M
#define SSIZE_MAX ((size_t) -1 >> 1)
261
#endif
262
263
/*
264
INTERNAL_FUNCTION
265
  bfd_malloc
266
267
SYNOPSIS
268
  void *bfd_malloc (bfd_size_type {*size*});
269
270
DESCRIPTION
271
  Returns a pointer to an allocated block of memory that is at least
272
  SIZE bytes long.  If SIZE is 0 then it will be treated as if it were
273
  1.  If SIZE is too big then NULL will be returned.
274
  
275
  Returns NULL upon error and sets bfd_error.
276
*/
277
void *
278
bfd_malloc (bfd_size_type size)
279
37.4M
{
280
37.4M
  void *ptr;
281
37.4M
  size_t sz = (size_t) size;
282
283
37.4M
  if (size != sz
284
      /* This is to pacify memory checkers like valgrind.  */
285
37.4M
      || sz > SSIZE_MAX)
286
29
    {
287
29
      bfd_set_error (bfd_error_no_memory);
288
29
      return NULL;
289
29
    }
290
291
37.4M
  ptr = malloc (sz ? sz : 1);
292
37.4M
  if (ptr == NULL)
293
0
    bfd_set_error (bfd_error_no_memory);
294
295
37.4M
  return ptr;
296
37.4M
}
297
298
/*
299
INTERNAL_FUNCTION
300
  bfd_realloc
301
302
SYNOPSIS
303
  void *bfd_realloc (void *{*mem*}, bfd_size_type {*size*});
304
305
DESCRIPTION
306
  Returns a pointer to an allocated block of memory that is at least
307
  SIZE bytes long.  If SIZE is 0 then it will be treated as if it were
308
  1.  If SIZE is too big then NULL will be returned.
309
  
310
  If MEM is not NULL then it must point to an allocated block of memory.
311
  If this block is large enough then MEM may be used as the return
312
  value for this function, but this is not guaranteed.
313
314
  If MEM is not returned then the first N bytes in the returned block
315
  will be identical to the first N bytes in region pointed to by MEM,
316
  where N is the lessor of SIZE and the length of the region of memory
317
  currently addressed by MEM.
318
319
  Returns NULL upon error and sets bfd_error.
320
*/
321
void *
322
bfd_realloc (void *ptr, bfd_size_type size)
323
22.7k
{
324
22.7k
  void *ret;
325
22.7k
  size_t sz = (size_t) size;
326
327
22.7k
  if (ptr == NULL)
328
9.24k
    return bfd_malloc (size);
329
330
13.5k
  if (size != sz
331
      /* This is to pacify memory checkers like valgrind.  */
332
13.5k
      || sz > SSIZE_MAX)
333
0
    {
334
0
      bfd_set_error (bfd_error_no_memory);
335
0
      return NULL;
336
0
    }
337
338
  /* The behaviour of realloc(0) is implementation defined,
339
     but for this function we always allocate memory.  */
340
13.5k
  ret = realloc (ptr, sz ? sz : 1);
341
342
13.5k
  if (ret == NULL)
343
0
    bfd_set_error (bfd_error_no_memory);
344
345
13.5k
  return ret;
346
13.5k
}
347
348
/*
349
INTERNAL_FUNCTION
350
  bfd_realloc_or_free
351
352
SYNOPSIS
353
  void *bfd_realloc_or_free (void *{*mem*}, bfd_size_type {*size*});
354
355
DESCRIPTION
356
  Returns a pointer to an allocated block of memory that is at least
357
  SIZE bytes long.  If SIZE is 0 then no memory will be allocated,
358
  MEM will be freed, and NULL will be returned.  This will not cause
359
  bfd_error to be set.
360
361
  If SIZE is too big then NULL will be returned and bfd_error will be
362
  set. 
363
  
364
  If MEM is not NULL then it must point to an allocated block of memory.
365
  If this block is large enough then MEM may be used as the return
366
  value for this function, but this is not guaranteed.
367
368
  If MEM is not returned then the first N bytes in the returned block
369
  will be identical to the first N bytes in region pointed to by MEM,
370
  where N is the lessor of SIZE and the length of the region of memory
371
  currently addressed by MEM.
372
*/
373
void *
374
bfd_realloc_or_free (void *ptr, bfd_size_type size)
375
3.94k
{
376
3.94k
  void *ret;
377
378
  /* The behaviour of realloc(0) is implementation defined, but
379
     for this function we treat it is always freeing the memory.  */
380
3.94k
  if (size == 0)
381
0
    {
382
0
      free (ptr);
383
0
      return NULL;
384
0
    }
385
      
386
3.94k
  ret = bfd_realloc (ptr, size);
387
3.94k
  if (ret == NULL)
388
0
    free (ptr);
389
390
3.94k
  return ret;
391
3.94k
}
392
393
/*
394
INTERNAL_FUNCTION
395
  bfd_zmalloc
396
397
SYNOPSIS
398
  void *bfd_zmalloc (bfd_size_type {*size*});
399
400
DESCRIPTION
401
  Returns a pointer to an allocated block of memory that is at least
402
  SIZE bytes long.  If SIZE is 0 then it will be treated as if it were
403
  1.  If SIZE is too big then NULL will be returned.
404
  
405
  Returns NULL upon error and sets bfd_error.
406
407
  If NULL is not returned then the allocated block of memory will
408
  have been cleared.
409
*/
410
void *
411
bfd_zmalloc (bfd_size_type size)
412
10.1M
{
413
10.1M
  void *ptr = bfd_malloc (size);
414
415
10.1M
  if (ptr != NULL)
416
10.1M
    memset (ptr, 0, size ? (size_t) size : 1);
417
418
10.1M
  return ptr;
419
10.1M
}
420
421
/*
422
FUNCTION
423
  bfd_alloc
424
425
SYNOPSIS
426
  void *bfd_alloc (bfd *abfd, bfd_size_type wanted);
427
428
DESCRIPTION
429
  Allocate a block of @var{wanted} bytes of memory attached to
430
  <<abfd>> and return a pointer to it.
431
*/
432
433
void *
434
bfd_alloc (bfd *abfd, bfd_size_type size)
435
137M
{
436
137M
  void *ret;
437
137M
  unsigned long ul_size = (unsigned long) size;
438
439
137M
  if (size != ul_size
440
      /* Note - although objalloc_alloc takes an unsigned long as its
441
   argument, internally the size is treated as a signed long.  This can
442
   lead to problems where, for example, a request to allocate -1 bytes
443
   can result in just 1 byte being allocated, rather than
444
   ((unsigned long) -1) bytes.  Also memory checkers will often
445
   complain about attempts to allocate a negative amount of memory.
446
   So to stop these problems we fail if the size is negative.  */
447
137M
      || ((signed long) ul_size) < 0)
448
0
    {
449
0
      bfd_set_error (bfd_error_no_memory);
450
0
      return NULL;
451
0
    }
452
453
137M
  ret = objalloc_alloc ((struct objalloc *) abfd->memory, ul_size);
454
137M
  if (ret == NULL)
455
0
    bfd_set_error (bfd_error_no_memory);
456
137M
  else
457
137M
    abfd->alloc_size += size;
458
137M
  return ret;
459
137M
}
460
461
/*
462
FUNCTION
463
  bfd_zalloc
464
465
SYNOPSIS
466
  void *bfd_zalloc (bfd *abfd, bfd_size_type wanted);
467
468
DESCRIPTION
469
  Allocate a block of @var{wanted} bytes of zeroed memory
470
  attached to <<abfd>> and return a pointer to it.
471
*/
472
473
void *
474
bfd_zalloc (bfd *abfd, bfd_size_type size)
475
26.0M
{
476
26.0M
  void *res;
477
478
26.0M
  res = bfd_alloc (abfd, size);
479
26.0M
  if (res)
480
26.0M
    memset (res, 0, (size_t) size);
481
26.0M
  return res;
482
26.0M
}
483
484
/*
485
FUNCTION
486
  bfd_release
487
488
SYNOPSIS
489
  void bfd_release (bfd *, void *);
490
491
DESCRIPTION
492
  Free a block allocated for a BFD.
493
  Note: Also frees all more recently allocated blocks!
494
*/
495
496
void
497
bfd_release (bfd *abfd, void *block)
498
92.2M
{
499
92.2M
  objalloc_free_block ((struct objalloc *) abfd->memory, block);
500
92.2M
}
501
502
/*
503
INTERNAL_FUNCTION
504
  bfd_write_bigendian_4byte_int
505
506
SYNOPSIS
507
  bool bfd_write_bigendian_4byte_int (bfd *, unsigned int);
508
509
DESCRIPTION
510
  Write a 4 byte integer @var{i} to the output BFD @var{abfd}, in big
511
  endian order regardless of what else is going on.  This is useful in
512
  archives.
513
514
*/
515
bool
516
bfd_write_bigendian_4byte_int (bfd *abfd, unsigned int i)
517
1.79k
{
518
1.79k
  bfd_byte buffer[4];
519
1.79k
  bfd_putb32 (i, buffer);
520
1.79k
  return bfd_write (buffer, 4, abfd) == 4;
521
1.79k
}
522
523

524
/** The do-it-yourself (byte) sex-change kit */
525
526
/* The middle letter e.g. get<b>short indicates Big or Little endian
527
   target machine.  It doesn't matter what the byte order of the host
528
   machine is; these routines work for either.  */
529
530
/* FIXME: Should these take a count argument?
531
   Answer (gnu@cygnus.com):  No, but perhaps they should be inline
532
           functions in swap.h #ifdef __GNUC__.
533
           Gprof them later and find out.  */
534
535
/*
536
FUNCTION
537
  bfd_put_size
538
FUNCTION
539
  bfd_get_size
540
541
DESCRIPTION
542
  These macros as used for reading and writing raw data in
543
  sections; each access (except for bytes) is vectored through
544
  the target format of the BFD and mangled accordingly. The
545
  mangling performs any necessary endian translations and
546
  removes alignment restrictions.  Note that types accepted and
547
  returned by these macros are identical so they can be swapped
548
  around in macros---for example, @file{libaout.h} defines <<GET_WORD>>
549
  to either <<bfd_get_32>> or <<bfd_get_64>>.
550
551
  In the put routines, @var{val} must be a <<bfd_vma>>.  If we are on a
552
  system without prototypes, the caller is responsible for making
553
  sure that is true, with a cast if necessary.  We don't cast
554
  them in the macro definitions because that would prevent <<lint>>
555
  or <<gcc -Wall>> from detecting sins such as passing a pointer.
556
  To detect calling these with less than a <<bfd_vma>>, use
557
  <<gcc -Wconversion>> on a host with 64 bit <<bfd_vma>>'s.
558
559
.
560
.{* Byte swapping macros for user section data.  *}
561
.
562
.#define bfd_put_8(abfd, val, ptr) \
563
.  ((void) (*((bfd_byte *) (ptr)) = (val) & 0xff))
564
.#define bfd_put_signed_8 \
565
.  bfd_put_8
566
.#define bfd_get_8(abfd, ptr) \
567
.  ((bfd_vma) *(const bfd_byte *) (ptr) & 0xff)
568
.#define bfd_get_signed_8(abfd, ptr) \
569
.  ((((bfd_signed_vma) *(const bfd_byte *) (ptr) & 0xff) ^ 0x80) - 0x80)
570
.
571
.#define bfd_put_16(abfd, val, ptr) \
572
.  BFD_SEND (abfd, bfd_putx16, ((val),(ptr)))
573
.#define bfd_put_signed_16 \
574
.  bfd_put_16
575
.#define bfd_get_16(abfd, ptr) \
576
.  BFD_SEND (abfd, bfd_getx16, (ptr))
577
.#define bfd_get_signed_16(abfd, ptr) \
578
.  BFD_SEND (abfd, bfd_getx_signed_16, (ptr))
579
.
580
.#define bfd_put_24(abfd, val, ptr) \
581
.  do         \
582
.    if (bfd_big_endian (abfd))   \
583
.      bfd_putb24 ((val), (ptr)); \
584
.    else       \
585
.      bfd_putl24 ((val), (ptr)); \
586
.  while (0)
587
.
588
.bfd_vma bfd_getb24 (const void *p);
589
.bfd_vma bfd_getl24 (const void *p);
590
.
591
.#define bfd_get_24(abfd, ptr) \
592
.  (bfd_big_endian (abfd) ? bfd_getb24 (ptr) : bfd_getl24 (ptr))
593
.
594
.#define bfd_put_32(abfd, val, ptr) \
595
.  BFD_SEND (abfd, bfd_putx32, ((val),(ptr)))
596
.#define bfd_put_signed_32 \
597
.  bfd_put_32
598
.#define bfd_get_32(abfd, ptr) \
599
.  BFD_SEND (abfd, bfd_getx32, (ptr))
600
.#define bfd_get_signed_32(abfd, ptr) \
601
.  BFD_SEND (abfd, bfd_getx_signed_32, (ptr))
602
.
603
.#define bfd_put_64(abfd, val, ptr) \
604
.  BFD_SEND (abfd, bfd_putx64, ((val), (ptr)))
605
.#define bfd_put_signed_64 \
606
.  bfd_put_64
607
.#define bfd_get_64(abfd, ptr) \
608
.  BFD_SEND (abfd, bfd_getx64, (ptr))
609
.#define bfd_get_signed_64(abfd, ptr) \
610
.  BFD_SEND (abfd, bfd_getx_signed_64, (ptr))
611
.
612
.#define bfd_get(bits, abfd, ptr)     \
613
.  ((bits) == 8 ? bfd_get_8 (abfd, ptr)     \
614
.   : (bits) == 16 ? bfd_get_16 (abfd, ptr)   \
615
.   : (bits) == 32 ? bfd_get_32 (abfd, ptr)   \
616
.   : (bits) == 64 ? bfd_get_64 (abfd, ptr)   \
617
.   : (abort (), (bfd_vma) - 1))
618
.
619
.#define bfd_put(bits, abfd, val, ptr)      \
620
.  ((bits) == 8 ? bfd_put_8  (abfd, val, ptr)   \
621
.   : (bits) == 16 ? bfd_put_16 (abfd, val, ptr)  \
622
.   : (bits) == 32 ? bfd_put_32 (abfd, val, ptr)  \
623
.   : (bits) == 64 ? bfd_put_64 (abfd, val, ptr)  \
624
.   : (abort (), (void) 0))
625
.
626
*/
627
628
/*
629
FUNCTION
630
  bfd_h_put_size
631
  bfd_h_get_size
632
633
DESCRIPTION
634
  These macros have the same function as their <<bfd_get_x>>
635
  brethren, except that they are used for removing information
636
  for the header records of object files. Believe it or not,
637
  some object files keep their header records in big endian
638
  order and their data in little endian order.
639
.
640
.{* Byte swapping macros for file header data.  *}
641
.
642
.#define bfd_h_put_8(abfd, val, ptr) \
643
.  bfd_put_8 (abfd, val, ptr)
644
.#define bfd_h_put_signed_8(abfd, val, ptr) \
645
.  bfd_put_8 (abfd, val, ptr)
646
.#define bfd_h_get_8(abfd, ptr) \
647
.  bfd_get_8 (abfd, ptr)
648
.#define bfd_h_get_signed_8(abfd, ptr) \
649
.  bfd_get_signed_8 (abfd, ptr)
650
.
651
.#define bfd_h_put_16(abfd, val, ptr) \
652
.  BFD_SEND (abfd, bfd_h_putx16, (val, ptr))
653
.#define bfd_h_put_signed_16 \
654
.  bfd_h_put_16
655
.#define bfd_h_get_16(abfd, ptr) \
656
.  BFD_SEND (abfd, bfd_h_getx16, (ptr))
657
.#define bfd_h_get_signed_16(abfd, ptr) \
658
.  BFD_SEND (abfd, bfd_h_getx_signed_16, (ptr))
659
.
660
.#define bfd_h_put_32(abfd, val, ptr) \
661
.  BFD_SEND (abfd, bfd_h_putx32, (val, ptr))
662
.#define bfd_h_put_signed_32 \
663
.  bfd_h_put_32
664
.#define bfd_h_get_32(abfd, ptr) \
665
.  BFD_SEND (abfd, bfd_h_getx32, (ptr))
666
.#define bfd_h_get_signed_32(abfd, ptr) \
667
.  BFD_SEND (abfd, bfd_h_getx_signed_32, (ptr))
668
.
669
.#define bfd_h_put_64(abfd, val, ptr) \
670
.  BFD_SEND (abfd, bfd_h_putx64, (val, ptr))
671
.#define bfd_h_put_signed_64 \
672
.  bfd_h_put_64
673
.#define bfd_h_get_64(abfd, ptr) \
674
.  BFD_SEND (abfd, bfd_h_getx64, (ptr))
675
.#define bfd_h_get_signed_64(abfd, ptr) \
676
.  BFD_SEND (abfd, bfd_h_getx_signed_64, (ptr))
677
.
678
.{* Aliases for the above, which should eventually go away.  *}
679
.
680
.#define H_PUT_64  bfd_h_put_64
681
.#define H_PUT_32  bfd_h_put_32
682
.#define H_PUT_16  bfd_h_put_16
683
.#define H_PUT_8   bfd_h_put_8
684
.#define H_PUT_S64 bfd_h_put_signed_64
685
.#define H_PUT_S32 bfd_h_put_signed_32
686
.#define H_PUT_S16 bfd_h_put_signed_16
687
.#define H_PUT_S8  bfd_h_put_signed_8
688
.#define H_GET_64  bfd_h_get_64
689
.#define H_GET_32  bfd_h_get_32
690
.#define H_GET_16  bfd_h_get_16
691
.#define H_GET_8   bfd_h_get_8
692
.#define H_GET_S64 bfd_h_get_signed_64
693
.#define H_GET_S32 bfd_h_get_signed_32
694
.#define H_GET_S16 bfd_h_get_signed_16
695
.#define H_GET_S8  bfd_h_get_signed_8
696
.
697
.*/
698
699
/* Sign extension to bfd_signed_vma.  */
700
140k
#define COERCE16(x) (((bfd_vma) (x) ^ 0x8000) - 0x8000)
701
1.47M
#define COERCE32(x) (((bfd_vma) (x) ^ 0x80000000) - 0x80000000)
702
#define COERCE64(x) \
703
838k
  (((uint64_t) (x) ^ ((uint64_t) 1 << 63)) - ((uint64_t) 1 << 63))
704
705
/*
706
FUNCTION
707
  Byte swapping routines.
708
709
SYNOPSIS
710
  uint64_t bfd_getb64 (const void *);
711
  uint64_t bfd_getl64 (const void *);
712
  int64_t bfd_getb_signed_64 (const void *);
713
  int64_t bfd_getl_signed_64 (const void *);
714
  bfd_vma bfd_getb32 (const void *);
715
  bfd_vma bfd_getl32 (const void *);
716
  bfd_signed_vma bfd_getb_signed_32 (const void *);
717
  bfd_signed_vma bfd_getl_signed_32 (const void *);
718
  bfd_vma bfd_getb16 (const void *);
719
  bfd_vma bfd_getl16 (const void *);
720
  bfd_signed_vma bfd_getb_signed_16 (const void *);
721
  bfd_signed_vma bfd_getl_signed_16 (const void *);
722
  void bfd_putb64 (uint64_t, void *);
723
  void bfd_putl64 (uint64_t, void *);
724
  void bfd_putb32 (bfd_vma, void *);
725
  void bfd_putl32 (bfd_vma, void *);
726
  void bfd_putb24 (bfd_vma, void *);
727
  void bfd_putl24 (bfd_vma, void *);
728
  void bfd_putb16 (bfd_vma, void *);
729
  void bfd_putl16 (bfd_vma, void *);
730
  uint64_t bfd_get_bits (const void *, int, bool);
731
  void bfd_put_bits (uint64_t, void *, int, bool);
732
733
DESCRIPTION
734
  Read and write integers in a particular endian order.  getb
735
  and putb functions handle big-endian, getl and putl handle
736
  little-endian.  bfd_get_bits and bfd_put_bits specify
737
  big-endian by passing TRUE in the last parameter,
738
  little-endian by passing FALSE.
739
*/
740
741
bfd_vma
742
bfd_getb16 (const void *p)
743
20.2M
{
744
20.2M
  const bfd_byte *addr = (const bfd_byte *) p;
745
20.2M
  return (addr[0] << 8) | addr[1];
746
20.2M
}
747
748
bfd_vma
749
bfd_getl16 (const void *p)
750
63.7M
{
751
63.7M
  const bfd_byte *addr = (const bfd_byte *) p;
752
63.7M
  return (addr[1] << 8) | addr[0];
753
63.7M
}
754
755
bfd_signed_vma
756
bfd_getb_signed_16 (const void *p)
757
154
{
758
154
  const bfd_byte *addr = (const bfd_byte *) p;
759
154
  return COERCE16 ((addr[0] << 8) | addr[1]);
760
154
}
761
762
bfd_signed_vma
763
bfd_getl_signed_16 (const void *p)
764
139k
{
765
139k
  const bfd_byte *addr = (const bfd_byte *) p;
766
139k
  return COERCE16 ((addr[1] << 8) | addr[0]);
767
139k
}
768
769
void
770
bfd_putb16 (bfd_vma data, void *p)
771
16.4k
{
772
16.4k
  bfd_byte *addr = (bfd_byte *) p;
773
16.4k
  addr[0] = (data >> 8) & 0xff;
774
16.4k
  addr[1] = data & 0xff;
775
16.4k
}
776
777
void
778
bfd_putl16 (bfd_vma data, void *p)
779
99.9k
{
780
99.9k
  bfd_byte *addr = (bfd_byte *) p;
781
99.9k
  addr[0] = data & 0xff;
782
99.9k
  addr[1] = (data >> 8) & 0xff;
783
99.9k
}
784
785
void
786
bfd_putb24 (bfd_vma data, void *p)
787
0
{
788
0
  bfd_byte *addr = (bfd_byte *) p;
789
0
  addr[0] = (data >> 16) & 0xff;
790
0
  addr[1] = (data >> 8) & 0xff;
791
0
  addr[2] = data & 0xff;
792
0
}
793
794
void
795
bfd_putl24 (bfd_vma data, void *p)
796
1
{
797
1
  bfd_byte *addr = (bfd_byte *) p;
798
1
  addr[0] = data & 0xff;
799
1
  addr[1] = (data >> 8) & 0xff;
800
1
  addr[2] = (data >> 16) & 0xff;
801
1
}
802
803
bfd_vma
804
bfd_getb24 (const void *p)
805
0
{
806
0
  const bfd_byte *addr = (const bfd_byte *) p;
807
0
  uint32_t v;
808
809
0
  v =  (uint32_t) addr[0] << 16;
810
0
  v |= (uint32_t) addr[1] << 8;
811
0
  v |= (uint32_t) addr[2];
812
0
  return v;
813
0
}
814
815
bfd_vma
816
bfd_getl24 (const void *p)
817
1
{
818
1
  const bfd_byte *addr = (const bfd_byte *) p;
819
1
  uint32_t v;
820
821
1
  v = (uint32_t) addr[0];
822
1
  v |= (uint32_t) addr[1] << 8;
823
1
  v |= (uint32_t) addr[2] << 16;
824
1
  return v;
825
1
}
826
827
bfd_vma
828
bfd_getb32 (const void *p)
829
43.9M
{
830
43.9M
  const bfd_byte *addr = (const bfd_byte *) p;
831
43.9M
  uint32_t v;
832
833
43.9M
  v = (uint32_t) addr[0] << 24;
834
43.9M
  v |= (uint32_t) addr[1] << 16;
835
43.9M
  v |= (uint32_t) addr[2] << 8;
836
43.9M
  v |= (uint32_t) addr[3];
837
43.9M
  return v;
838
43.9M
}
839
840
bfd_vma
841
bfd_getl32 (const void *p)
842
79.5M
{
843
79.5M
  const bfd_byte *addr = (const bfd_byte *) p;
844
79.5M
  uint32_t v;
845
846
79.5M
  v = (uint32_t) addr[0];
847
79.5M
  v |= (uint32_t) addr[1] << 8;
848
79.5M
  v |= (uint32_t) addr[2] << 16;
849
79.5M
  v |= (uint32_t) addr[3] << 24;
850
79.5M
  return v;
851
79.5M
}
852
853
bfd_signed_vma
854
bfd_getb_signed_32 (const void *p)
855
255k
{
856
255k
  const bfd_byte *addr = (const bfd_byte *) p;
857
255k
  uint32_t v;
858
859
255k
  v = (uint32_t) addr[0] << 24;
860
255k
  v |= (uint32_t) addr[1] << 16;
861
255k
  v |= (uint32_t) addr[2] << 8;
862
255k
  v |= (uint32_t) addr[3];
863
255k
  return COERCE32 (v);
864
255k
}
865
866
bfd_signed_vma
867
bfd_getl_signed_32 (const void *p)
868
1.22M
{
869
1.22M
  const bfd_byte *addr = (const bfd_byte *) p;
870
1.22M
  uint32_t v;
871
872
1.22M
  v = (uint32_t) addr[0];
873
1.22M
  v |= (uint32_t) addr[1] << 8;
874
1.22M
  v |= (uint32_t) addr[2] << 16;
875
1.22M
  v |= (uint32_t) addr[3] << 24;
876
1.22M
  return COERCE32 (v);
877
1.22M
}
878
879
uint64_t
880
bfd_getb64 (const void *p)
881
1.06M
{
882
1.06M
  const bfd_byte *addr = (const bfd_byte *) p;
883
1.06M
  uint64_t v;
884
885
1.06M
  v  = addr[0]; v <<= 8;
886
1.06M
  v |= addr[1]; v <<= 8;
887
1.06M
  v |= addr[2]; v <<= 8;
888
1.06M
  v |= addr[3]; v <<= 8;
889
1.06M
  v |= addr[4]; v <<= 8;
890
1.06M
  v |= addr[5]; v <<= 8;
891
1.06M
  v |= addr[6]; v <<= 8;
892
1.06M
  v |= addr[7];
893
894
1.06M
  return v;
895
1.06M
}
896
897
uint64_t
898
bfd_getl64 (const void *p)
899
10.1M
{
900
10.1M
  const bfd_byte *addr = (const bfd_byte *) p;
901
10.1M
  uint64_t v;
902
903
10.1M
  v  = addr[7]; v <<= 8;
904
10.1M
  v |= addr[6]; v <<= 8;
905
10.1M
  v |= addr[5]; v <<= 8;
906
10.1M
  v |= addr[4]; v <<= 8;
907
10.1M
  v |= addr[3]; v <<= 8;
908
10.1M
  v |= addr[2]; v <<= 8;
909
10.1M
  v |= addr[1]; v <<= 8;
910
10.1M
  v |= addr[0];
911
912
10.1M
  return v;
913
10.1M
}
914
915
int64_t
916
bfd_getb_signed_64 (const void *p)
917
15.2k
{
918
15.2k
  const bfd_byte *addr = (const bfd_byte *) p;
919
15.2k
  uint64_t v;
920
921
15.2k
  v  = addr[0]; v <<= 8;
922
15.2k
  v |= addr[1]; v <<= 8;
923
15.2k
  v |= addr[2]; v <<= 8;
924
15.2k
  v |= addr[3]; v <<= 8;
925
15.2k
  v |= addr[4]; v <<= 8;
926
15.2k
  v |= addr[5]; v <<= 8;
927
15.2k
  v |= addr[6]; v <<= 8;
928
15.2k
  v |= addr[7];
929
930
15.2k
  return COERCE64 (v);
931
15.2k
}
932
933
int64_t
934
bfd_getl_signed_64 (const void *p)
935
823k
{
936
823k
  const bfd_byte *addr = (const bfd_byte *) p;
937
823k
  uint64_t v;
938
939
823k
  v  = addr[7]; v <<= 8;
940
823k
  v |= addr[6]; v <<= 8;
941
823k
  v |= addr[5]; v <<= 8;
942
823k
  v |= addr[4]; v <<= 8;
943
823k
  v |= addr[3]; v <<= 8;
944
823k
  v |= addr[2]; v <<= 8;
945
823k
  v |= addr[1]; v <<= 8;
946
823k
  v |= addr[0];
947
948
823k
  return COERCE64 (v);
949
823k
}
950
951
void
952
bfd_putb32 (bfd_vma data, void *p)
953
544k
{
954
544k
  bfd_byte *addr = (bfd_byte *) p;
955
544k
  addr[0] = (data >> 24) & 0xff;
956
544k
  addr[1] = (data >> 16) & 0xff;
957
544k
  addr[2] = (data >>  8) & 0xff;
958
544k
  addr[3] = data & 0xff;
959
544k
}
960
961
void
962
bfd_putl32 (bfd_vma data, void *p)
963
131k
{
964
131k
  bfd_byte *addr = (bfd_byte *) p;
965
131k
  addr[0] = data & 0xff;
966
131k
  addr[1] = (data >>  8) & 0xff;
967
131k
  addr[2] = (data >> 16) & 0xff;
968
131k
  addr[3] = (data >> 24) & 0xff;
969
131k
}
970
971
void
972
bfd_putb64 (uint64_t data, void *p)
973
9.21k
{
974
9.21k
  bfd_byte *addr = (bfd_byte *) p;
975
9.21k
  addr[0] = (data >> (7*8)) & 0xff;
976
9.21k
  addr[1] = (data >> (6*8)) & 0xff;
977
9.21k
  addr[2] = (data >> (5*8)) & 0xff;
978
9.21k
  addr[3] = (data >> (4*8)) & 0xff;
979
9.21k
  addr[4] = (data >> (3*8)) & 0xff;
980
9.21k
  addr[5] = (data >> (2*8)) & 0xff;
981
9.21k
  addr[6] = (data >> (1*8)) & 0xff;
982
9.21k
  addr[7] = (data >> (0*8)) & 0xff;
983
9.21k
}
984
985
void
986
bfd_putl64 (uint64_t data, void *p)
987
29.6k
{
988
29.6k
  bfd_byte *addr = (bfd_byte *) p;
989
29.6k
  addr[7] = (data >> (7*8)) & 0xff;
990
29.6k
  addr[6] = (data >> (6*8)) & 0xff;
991
29.6k
  addr[5] = (data >> (5*8)) & 0xff;
992
29.6k
  addr[4] = (data >> (4*8)) & 0xff;
993
29.6k
  addr[3] = (data >> (3*8)) & 0xff;
994
29.6k
  addr[2] = (data >> (2*8)) & 0xff;
995
29.6k
  addr[1] = (data >> (1*8)) & 0xff;
996
29.6k
  addr[0] = (data >> (0*8)) & 0xff;
997
29.6k
}
998
999
void
1000
bfd_put_bits (uint64_t data, void *p, int bits, bool big_p)
1001
61.0k
{
1002
61.0k
  bfd_byte *addr = (bfd_byte *) p;
1003
61.0k
  int i;
1004
61.0k
  int bytes;
1005
1006
61.0k
  if (bits % 8 != 0)
1007
0
    abort ();
1008
1009
61.0k
  bytes = bits / 8;
1010
282k
  for (i = 0; i < bytes; i++)
1011
221k
    {
1012
221k
      int addr_index = big_p ? bytes - i - 1 : i;
1013
1014
221k
      addr[addr_index] = data & 0xff;
1015
221k
      data >>= 8;
1016
221k
    }
1017
61.0k
}
1018
1019
uint64_t
1020
bfd_get_bits (const void *p, int bits, bool big_p)
1021
564M
{
1022
564M
  const bfd_byte *addr = (const bfd_byte *) p;
1023
564M
  uint64_t data;
1024
564M
  int i;
1025
564M
  int bytes;
1026
1027
564M
  if (bits % 8 != 0)
1028
0
    abort ();
1029
1030
564M
  data = 0;
1031
564M
  bytes = bits / 8;
1032
2.07G
  for (i = 0; i < bytes; i++)
1033
1.50G
    {
1034
1.50G
      int addr_index = big_p ? i : bytes - i - 1;
1035
1036
1.50G
      data = (data << 8) | addr[addr_index];
1037
1.50G
    }
1038
1039
564M
  return data;
1040
564M
}
1041

1042
#ifdef USE_MMAP
1043
/* Allocate a page to track mmapped memory and return the page and
1044
   the first entry.  Return NULL if mmap fails.  */
1045
1046
static struct bfd_mmapped *
1047
bfd_allocate_mmapped_page (bfd *abfd, struct bfd_mmapped_entry **entry)
1048
2
{
1049
2
  struct bfd_mmapped * mmapped
1050
2
    = (struct bfd_mmapped *) mmap (NULL, _bfd_pagesize,
1051
2
           PROT_READ | PROT_WRITE,
1052
2
           MAP_PRIVATE | MAP_ANONYMOUS,
1053
2
           -1, 0);
1054
2
  if (mmapped == MAP_FAILED)
1055
0
    return NULL;
1056
1057
2
  mmapped->next = abfd->mmapped;
1058
2
  mmapped->max_entry
1059
2
    = ((_bfd_pagesize - offsetof (struct bfd_mmapped, entries))
1060
2
       / sizeof (struct bfd_mmapped_entry));
1061
2
  mmapped->next_entry = 1;
1062
2
  abfd->mmapped = mmapped;
1063
2
  *entry = mmapped->entries;
1064
2
  return mmapped;
1065
2
}
1066
1067
/* Mmap a memory region of RSIZE bytes at the current file offset.
1068
   Return mmap address and size in MAP_ADDR and MAP_SIZE.  Return NULL
1069
   on invalid input and MAP_FAILED for mmap failure.  */
1070
1071
static void *
1072
bfd_mmap_local (bfd *abfd, size_t rsize, void **map_addr, size_t *map_size)
1073
1.91k
{
1074
  /* We mmap on the underlying file.  In an archive it might be nice
1075
     to limit RSIZE to the element size, but that can be fuzzed and
1076
     the offset returned by bfd_tell is relative to the start of the
1077
     element.  Therefore to reliably stop access beyond the end of a
1078
     file (and resulting bus errors) we must work with the underlying
1079
     file offset and size, and trust that callers will limit access to
1080
     within an archive element.  */
1081
2.84k
  while (abfd->my_archive != NULL
1082
924
   && !bfd_is_thin_archive (abfd->my_archive))
1083
924
    abfd = abfd->my_archive;
1084
1085
1.91k
  ufile_ptr filesize = bfd_get_size (abfd);
1086
1.91k
  ufile_ptr offset = bfd_tell (abfd);
1087
1.91k
  if (filesize < offset || filesize - offset < rsize)
1088
1.91k
    {
1089
1.91k
      bfd_set_error (bfd_error_file_truncated);
1090
1.91k
      return NULL;
1091
1.91k
    }
1092
1093
7
  void *mem;
1094
7
  mem = bfd_mmap (abfd, NULL, rsize, PROT_READ | PROT_WRITE, MAP_PRIVATE,
1095
7
      offset, map_addr, map_size);
1096
7
  return mem;
1097
1.91k
}
1098
1099
/* Mmap a memory region of RSIZE bytes at the current offset.
1100
   Return mmap address and size in MAP_ADDR and MAP_SIZE.  Return NULL
1101
   on invalid input.  */
1102
1103
void *
1104
_bfd_mmap_temporary (bfd *abfd, size_t rsize, void **map_addr,
1105
         size_t *map_size)
1106
4.65k
{
1107
  /* Use mmap only if section size >= the minimum mmap section size.  */
1108
4.65k
  if (rsize >= _bfd_minimum_mmap_size)
1109
47
    {
1110
47
      void *result = bfd_mmap_local (abfd, rsize, map_addr, map_size);
1111
47
      if (result != MAP_FAILED)
1112
47
  return result;
1113
47
    }
1114
1115
4.61k
  void *mem = _bfd_malloc_and_read (abfd, rsize, rsize);
1116
  /* NB: Set *MAP_ADDR to MEM and *MAP_SIZE to 0 to indicate that
1117
     _bfd_malloc_and_read is called.  */
1118
4.61k
  *map_addr = mem;
1119
4.61k
  *map_size = 0;
1120
4.61k
  return mem;
1121
4.65k
}
1122
1123
/* Munmap RSIZE bytes at PTR.  */
1124
1125
void
1126
_bfd_munmap_temporary (void *ptr, size_t rsize)
1127
37.7k
{
1128
  /* NB: Since _bfd_munmap_temporary is called like free, PTR may be
1129
     NULL.  Otherwise, PTR and RSIZE must be valid.  If RSIZE is 0,
1130
     free is called.  */
1131
37.7k
  if (ptr == NULL)
1132
25.6k
    return;
1133
12.1k
  if (rsize != 0)
1134
0
    {
1135
0
      if (munmap (ptr, rsize) != 0)
1136
0
  abort ();
1137
0
    }
1138
12.1k
  else
1139
12.1k
    free (ptr);
1140
12.1k
}
1141
1142
/* Mmap a memory region of RSIZE bytes at the current offset.
1143
   Return NULL on invalid input or mmap failure.  */
1144
1145
void *
1146
_bfd_mmap_persistent (bfd *abfd, size_t rsize)
1147
56.1k
{
1148
  /* Use mmap only if section size >= the minimum mmap section size.  */
1149
56.1k
  if (rsize < _bfd_minimum_mmap_size)
1150
54.2k
    return _bfd_alloc_and_read (abfd, rsize, rsize);
1151
1152
1.87k
  void *mem, *map_addr;
1153
1.87k
  size_t map_size;
1154
1.87k
  mem = bfd_mmap_local (abfd, rsize, &map_addr, &map_size);
1155
1.87k
  if (mem == NULL)
1156
1.86k
    return mem;
1157
7
  if (mem == MAP_FAILED)
1158
0
    return _bfd_alloc_and_read (abfd, rsize, rsize);
1159
1160
7
  struct bfd_mmapped_entry *entry;
1161
7
  unsigned int next_entry;
1162
7
  struct bfd_mmapped *mmapped = abfd->mmapped;
1163
7
  if (mmapped != NULL
1164
5
      && (next_entry = mmapped->next_entry) < mmapped->max_entry)
1165
5
    {
1166
5
      entry = &mmapped->entries[next_entry];
1167
5
      mmapped->next_entry++;
1168
5
    }
1169
2
  else
1170
2
    {
1171
2
      mmapped = bfd_allocate_mmapped_page (abfd, &entry);
1172
2
      if (mmapped == NULL)
1173
0
  {
1174
0
    munmap (map_addr, map_size);
1175
0
    return NULL;
1176
0
  }
1177
2
    }
1178
1179
7
  entry->addr = map_addr;
1180
7
  entry->size = map_size;
1181
1182
7
  return mem;
1183
7
}
1184
#endif
1185
1186
/* Attempt to read *SIZE_P bytes from ABFD's iostream to *DATA_P.
1187
   Return true if the full the amount has been read.  If *DATA_P is
1188
   NULL, mmap should be used, return the memory address at the
1189
   current offset in *DATA_P as well as return mmap address and size
1190
   in *MMAP_BASE and *SIZE_P.  Otherwise, return NULL in *MMAP_BASE
1191
   and 0 in *SIZE_P.  If FINAL_LINK is true, this is called from
1192
   elf_link_read_relocs_from_section.  */
1193
1194
bool
1195
_bfd_mmap_read_temporary (void **data_p, size_t *size_p,
1196
        void **mmap_base, bfd *abfd,
1197
        bool final_link ATTRIBUTE_UNUSED)
1198
17.0k
{
1199
17.0k
  void *data = *data_p;
1200
17.0k
  size_t size = *size_p;
1201
1202
17.0k
#ifdef USE_MMAP
1203
  /* NB: When FINAL_LINK is true, the size of the preallocated buffer
1204
     is _bfd_minimum_mmap_size and use mmap if the data size >=
1205
     _bfd_minimum_mmap_size.  Otherwise, use mmap if ABFD isn't an IR
1206
     input or the data size >= _bfd_minimum_mmap_size.  */
1207
17.0k
  bool use_mmmap;
1208
17.0k
  bool mmap_size = size >= _bfd_minimum_mmap_size;
1209
17.0k
  if (final_link)
1210
0
    use_mmmap = mmap_size;
1211
17.0k
  else
1212
17.0k
    use_mmmap = (mmap_size
1213
4
     && data == NULL
1214
4
     && (abfd->flags & BFD_PLUGIN) == 0);
1215
17.0k
  if (use_mmmap)
1216
4
    {
1217
4
      void *mmaped = _bfd_mmap_temporary (abfd, size, mmap_base, size_p);
1218
4
      if (mmaped == NULL)
1219
4
  return false;
1220
0
      *data_p = mmaped;
1221
0
      return true;
1222
4
    }
1223
17.0k
#endif
1224
1225
17.0k
  if (data == NULL)
1226
7.69k
    {
1227
7.69k
      data = bfd_malloc (size);
1228
7.69k
      if (data == NULL)
1229
0
  return false;
1230
7.69k
      *data_p = data;
1231
      /* NB: _bfd_munmap_temporary will free *MMAP_BASE if *SIZE_P == 0.  */
1232
7.69k
      *mmap_base = data;
1233
7.69k
    }
1234
9.33k
  else
1235
9.33k
    *mmap_base = NULL;
1236
17.0k
  *size_p = 0;
1237
17.0k
  return bfd_read (data, size, abfd) == size;
1238
17.0k
}
1239
1240
/* Default implementation */
1241
1242
bool
1243
_bfd_generic_get_section_contents (bfd *abfd,
1244
           sec_ptr section,
1245
           void *location,
1246
           file_ptr offset,
1247
           bfd_size_type count)
1248
1.09M
{
1249
1.09M
  bfd_size_type sz;
1250
1.09M
  if (count == 0)
1251
0
    return true;
1252
1253
1.09M
  if (section->compress_status != COMPRESS_SECTION_NONE)
1254
0
    {
1255
0
      _bfd_error_handler
1256
  /* xgettext:c-format */
1257
0
  (_("%pB: unable to get decompressed section %pA"),
1258
0
   abfd, section);
1259
0
      bfd_set_error (bfd_error_invalid_operation);
1260
0
      return false;
1261
0
    }
1262
1263
1.09M
#ifdef USE_MMAP
1264
1.09M
  if (section->mmapped_p
1265
2
      && (section->contents != NULL || location != NULL))
1266
2
    {
1267
2
      _bfd_error_handler
1268
  /* xgettext:c-format */
1269
2
  (_("%pB: mapped section %pA has non-NULL buffer"),
1270
2
   abfd, section);
1271
2
      bfd_set_error (bfd_error_invalid_operation);
1272
2
      return false;
1273
2
    }
1274
1.09M
#endif
1275
1276
1.09M
  sz = bfd_get_section_limit_octets (abfd, section);
1277
1.09M
  if (offset + count < count
1278
1.09M
      || offset + count > sz
1279
1.09M
      || (abfd->my_archive != NULL
1280
64.7k
    && !bfd_is_thin_archive (abfd->my_archive)
1281
64.7k
    && ((ufile_ptr) section->filepos + offset + count
1282
64.7k
        > arelt_size (abfd))))
1283
19.5k
    {
1284
19.5k
      bfd_set_error (bfd_error_invalid_operation);
1285
19.5k
      return false;
1286
19.5k
    }
1287
1288
1.07M
  if (bfd_seek (abfd, section->filepos + offset, SEEK_SET) != 0)
1289
41.4k
    return false;
1290
1291
1.03M
#ifdef USE_MMAP
1292
1.03M
  if (section->mmapped_p)
1293
0
    {
1294
0
      if (location != 0
1295
0
    || bfd_get_flavour (abfd) != bfd_target_elf_flavour)
1296
0
  abort ();
1297
1298
0
      location = bfd_mmap_local (abfd, count,
1299
0
         &elf_section_data (section)->contents_addr,
1300
0
         &elf_section_data (section)->contents_size);
1301
1302
0
      if (location == NULL)
1303
0
  return false;
1304
1305
      /* Check for iovec not supporting mmap.  */
1306
0
      if (location != MAP_FAILED)
1307
0
  {
1308
0
    section->contents = location;
1309
0
    return true;
1310
0
  }
1311
1312
      /* Malloc the buffer and call bfd_read.  */
1313
0
      location = (bfd_byte *) bfd_malloc (count);
1314
0
      if (location == NULL)
1315
0
  {
1316
0
    if (bfd_get_error () == bfd_error_no_memory)
1317
0
      _bfd_error_handler
1318
        /* xgettext:c-format */
1319
0
        (_("error: %pB(%pA) is too large (%#" PRIx64 " bytes)"),
1320
0
         abfd, section, (uint64_t) count);
1321
0
    return false;
1322
0
  }
1323
0
      section->contents = location;
1324
0
    }
1325
1.03M
#endif
1326
1327
1.03M
  if (bfd_read (location, count, abfd) != count)
1328
587k
    return false;
1329
1330
446k
  return true;
1331
1.03M
}
1332
1333
/* This generic function can only be used in implementations where creating
1334
   NEW sections is disallowed.  It is useful in patching existing sections
1335
   in read-write files, though.  See other set_section_contents functions
1336
   to see why it doesn't work for new sections.  */
1337
bool
1338
_bfd_generic_set_section_contents (bfd *abfd,
1339
           sec_ptr section,
1340
           const void *location,
1341
           file_ptr offset,
1342
           bfd_size_type count)
1343
1.23k
{
1344
1.23k
  if (count == 0)
1345
0
    return true;
1346
1347
1.23k
  if (bfd_seek (abfd, section->filepos + offset, SEEK_SET) != 0
1348
1.23k
      || bfd_write (location, count, abfd) != count)
1349
3
    return false;
1350
1351
1.23k
  return true;
1352
1.23k
}
1353
1354
/*
1355
INTERNAL_FUNCTION
1356
  bfd_log2
1357
1358
SYNOPSIS
1359
  unsigned int bfd_log2 (bfd_vma x);
1360
1361
DESCRIPTION
1362
  Return the log base 2 of the value supplied, rounded up.  E.g., an
1363
  @var{x} of 1025 returns 11.  A @var{x} of 0 returns 0.
1364
*/
1365
1366
unsigned int
1367
bfd_log2 (bfd_vma x)
1368
1.54M
{
1369
1.54M
  unsigned int result = 0;
1370
1371
1.54M
  if (x <= 1)
1372
452k
    return result;
1373
1.09M
  --x;
1374
1.09M
  do
1375
21.6M
    ++result;
1376
21.6M
  while ((x >>= 1) != 0);
1377
1.09M
  return result;
1378
1.54M
}
1379
1380
bool
1381
bfd_generic_is_local_label_name (bfd *abfd, const char *name)
1382
0
{
1383
0
  char locals_prefix = (bfd_get_symbol_leading_char (abfd) == '_') ? 'L' : '.';
1384
1385
0
  return name[0] == locals_prefix;
1386
0
}
1387
1388
/* Read in a LEB128 encoded value from ABFD starting at *PTR.
1389
   If SIGN is true, return a signed LEB128 value.
1390
   *PTR is incremented by the number of bytes read.
1391
   No bytes will be read at address END or beyond.  */
1392
1393
bfd_vma
1394
_bfd_safe_read_leb128 (bfd *abfd ATTRIBUTE_UNUSED,
1395
           bfd_byte **ptr,
1396
           bool sign,
1397
           const bfd_byte * const end)
1398
761k
{
1399
761k
  bfd_vma result = 0;
1400
761k
  unsigned int shift = 0;
1401
761k
  bfd_byte byte = 0;
1402
761k
  bfd_byte *data = *ptr;
1403
1404
896k
  while (data < end)
1405
892k
    {
1406
892k
      byte = bfd_get_8 (abfd, data);
1407
892k
      data++;
1408
892k
      if (shift < 8 * sizeof (result))
1409
855k
  {
1410
855k
    result |= ((bfd_vma) (byte & 0x7f)) << shift;
1411
855k
    shift += 7;
1412
855k
  }
1413
892k
      if ((byte & 0x80) == 0)
1414
757k
  break;
1415
892k
    }
1416
1417
761k
  *ptr = data;
1418
1419
761k
  if (sign && (shift < 8 * sizeof (result)) && (byte & 0x40))
1420
6.39k
    result |= -((bfd_vma) 1 << shift);
1421
1422
761k
  return result;
1423
761k
}
1424
1425
/* Write VAL in uleb128 format to P.
1426
   END indicates the last byte of allocated space for the uleb128 value to fit
1427
   in.
1428
   Return a pointer to the byte following the last byte that was written, or
1429
   NULL if the uleb128 value does not fit in the allocated space between P and
1430
   END.  */
1431
bfd_byte *
1432
_bfd_write_unsigned_leb128 (bfd_byte *p, bfd_byte *end, bfd_vma val)
1433
0
{
1434
0
  bfd_byte c;
1435
0
  do
1436
0
    {
1437
0
      if (p > end)
1438
0
  return NULL;
1439
0
      c = val & 0x7f;
1440
0
      val >>= 7;
1441
0
      if (val)
1442
0
  c |= 0x80;
1443
0
      *(p++) = c;
1444
0
    }
1445
0
  while (val);
1446
0
  return p;
1447
0
}
1448
1449
bool
1450
_bfd_generic_bfd_copy_private_section_data (bfd *ibfd ATTRIBUTE_UNUSED,
1451
              asection *isec ATTRIBUTE_UNUSED,
1452
              bfd *obfd ATTRIBUTE_UNUSED,
1453
              asection *osec ATTRIBUTE_UNUSED,
1454
              struct bfd_link_info *link_info ATTRIBUTE_UNUSED)
1455
6.14k
{
1456
6.14k
  return true;
1457
6.14k
}
1458
1459
#ifdef HAVE_MMAP
1460
uintptr_t _bfd_pagesize;
1461
uintptr_t _bfd_pagesize_m1;
1462
uintptr_t _bfd_minimum_mmap_size;
1463
1464
__attribute__ ((unused, constructor))
1465
static void
1466
bfd_init_pagesize (void)
1467
52
{
1468
52
  _bfd_pagesize = getpagesize ();
1469
52
  if (_bfd_pagesize == 0)
1470
0
    abort ();
1471
52
  _bfd_pagesize_m1 = _bfd_pagesize - 1;
1472
  /* The minimum section size to use mmap.  */
1473
52
  _bfd_minimum_mmap_size = _bfd_pagesize * 4;
1474
52
}
1475
#endif