forked from bminor/binutils-gdb
-
Notifications
You must be signed in to change notification settings - Fork 0
/
Copy pathpdb.c
5412 lines (4227 loc) · 123 KB
/
pdb.c
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
251
252
253
254
255
256
257
258
259
260
261
262
263
264
265
266
267
268
269
270
271
272
273
274
275
276
277
278
279
280
281
282
283
284
285
286
287
288
289
290
291
292
293
294
295
296
297
298
299
300
301
302
303
304
305
306
307
308
309
310
311
312
313
314
315
316
317
318
319
320
321
322
323
324
325
326
327
328
329
330
331
332
333
334
335
336
337
338
339
340
341
342
343
344
345
346
347
348
349
350
351
352
353
354
355
356
357
358
359
360
361
362
363
364
365
366
367
368
369
370
371
372
373
374
375
376
377
378
379
380
381
382
383
384
385
386
387
388
389
390
391
392
393
394
395
396
397
398
399
400
401
402
403
404
405
406
407
408
409
410
411
412
413
414
415
416
417
418
419
420
421
422
423
424
425
426
427
428
429
430
431
432
433
434
435
436
437
438
439
440
441
442
443
444
445
446
447
448
449
450
451
452
453
454
455
456
457
458
459
460
461
462
463
464
465
466
467
468
469
470
471
472
473
474
475
476
477
478
479
480
481
482
483
484
485
486
487
488
489
490
491
492
493
494
495
496
497
498
499
500
501
502
503
504
505
506
507
508
509
510
511
512
513
514
515
516
517
518
519
520
521
522
523
524
525
526
527
528
529
530
531
532
533
534
535
536
537
538
539
540
541
542
543
544
545
546
547
548
549
550
551
552
553
554
555
556
557
558
559
560
561
562
563
564
565
566
567
568
569
570
571
572
573
574
575
576
577
578
579
580
581
582
583
584
585
586
587
588
589
590
591
592
593
594
595
596
597
598
599
600
601
602
603
604
605
606
607
608
609
610
611
612
613
614
615
616
617
618
619
620
621
622
623
624
625
626
627
628
629
630
631
632
633
634
635
636
637
638
639
640
641
642
643
644
645
646
647
648
649
650
651
652
653
654
655
656
657
658
659
660
661
662
663
664
665
666
667
668
669
670
671
672
673
674
675
676
677
678
679
680
681
682
683
684
685
686
687
688
689
690
691
692
693
694
695
696
697
698
699
700
701
702
703
704
705
706
707
708
709
710
711
712
713
714
715
716
717
718
719
720
721
722
723
724
725
726
727
728
729
730
731
732
733
734
735
736
737
738
739
740
741
742
743
744
745
746
747
748
749
750
751
752
753
754
755
756
757
758
759
760
761
762
763
764
765
766
767
768
769
770
771
772
773
774
775
776
777
778
779
780
781
782
783
784
785
786
787
788
789
790
791
792
793
794
795
796
797
798
799
800
801
802
803
804
805
806
807
808
809
810
811
812
813
814
815
816
817
818
819
820
821
822
823
824
825
826
827
828
829
830
831
832
833
834
835
836
837
838
839
840
841
842
843
844
845
846
847
848
849
850
851
852
853
854
855
856
857
858
859
860
861
862
863
864
865
866
867
868
869
870
871
872
873
874
875
876
877
878
879
880
881
882
883
884
885
886
887
888
889
890
891
892
893
894
895
896
897
898
899
900
901
902
903
904
905
906
907
908
909
910
911
912
913
914
915
916
917
918
919
920
921
922
923
924
925
926
927
928
929
930
931
932
933
934
935
936
937
938
939
940
941
942
943
944
945
946
947
948
949
950
951
952
953
954
955
956
957
958
959
960
961
962
963
964
965
966
967
968
969
970
971
972
973
974
975
976
977
978
979
980
981
982
983
984
985
986
987
988
989
990
991
992
993
994
995
996
997
998
999
1000
/* Support for generating PDB CodeView debugging files.
Copyright (C) 2022-2025 Free Software Foundation, Inc.
This file is part of the GNU Binutils.
This program is free software; you can redistribute it and/or modify
it under the terms of the GNU General Public License as published by
the Free Software Foundation; either version 3 of the License, or
(at your option) any later version.
This program is distributed in the hope that it will be useful,
but WITHOUT ANY WARRANTY; without even the implied warranty of
MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
GNU General Public License for more details.
You should have received a copy of the GNU General Public License
along with this program; if not, write to the Free Software
Foundation, Inc., 51 Franklin Street - Fifth Floor, Boston,
MA 02110-1301, USA. */
#include "pdb.h"
#include "bfdlink.h"
#include "ld.h"
#include "ldmain.h"
#include "ldmisc.h"
#include "libbfd.h"
#include "libiberty.h"
#include "coff/i386.h"
#include "coff/external.h"
#include "coff/internal.h"
#include "coff/pe.h"
#include "libcoff.h"
#include <time.h>
struct public
{
struct public *next;
uint32_t offset;
uint32_t hash;
unsigned int index;
uint16_t section;
uint32_t address;
};
struct string
{
struct string *next;
uint32_t hash;
uint32_t offset;
uint32_t source_file_offset;
size_t len;
char s[];
};
struct string_table
{
struct string *strings_head;
struct string *strings_tail;
uint32_t strings_len;
htab_t hashmap;
};
struct mod_source_files
{
uint16_t files_count;
struct string **files;
};
struct source_files_info
{
uint16_t mod_count;
struct mod_source_files *mods;
};
struct type_entry
{
struct type_entry *next;
uint32_t index;
uint32_t cv_hash;
bool has_udt_src_line;
uint8_t data[];
};
struct types
{
htab_t hashmap;
uint32_t num_types;
struct type_entry *first;
struct type_entry *last;
};
struct global
{
struct global *next;
uint32_t offset;
uint32_t hash;
uint32_t refcount;
unsigned int index;
uint8_t data[];
};
struct globals
{
uint32_t num_entries;
struct global *first;
struct global *last;
htab_t hashmap;
};
struct in_sc
{
asection *s;
uint16_t sect_num;
uint16_t mod_index;
};
static const uint32_t crc_table[] =
{
0x00000000, 0x77073096, 0xee0e612c, 0x990951ba, 0x076dc419, 0x706af48f,
0xe963a535, 0x9e6495a3, 0x0edb8832, 0x79dcb8a4, 0xe0d5e91e, 0x97d2d988,
0x09b64c2b, 0x7eb17cbd, 0xe7b82d07, 0x90bf1d91, 0x1db71064, 0x6ab020f2,
0xf3b97148, 0x84be41de, 0x1adad47d, 0x6ddde4eb, 0xf4d4b551, 0x83d385c7,
0x136c9856, 0x646ba8c0, 0xfd62f97a, 0x8a65c9ec, 0x14015c4f, 0x63066cd9,
0xfa0f3d63, 0x8d080df5, 0x3b6e20c8, 0x4c69105e, 0xd56041e4, 0xa2677172,
0x3c03e4d1, 0x4b04d447, 0xd20d85fd, 0xa50ab56b, 0x35b5a8fa, 0x42b2986c,
0xdbbbc9d6, 0xacbcf940, 0x32d86ce3, 0x45df5c75, 0xdcd60dcf, 0xabd13d59,
0x26d930ac, 0x51de003a, 0xc8d75180, 0xbfd06116, 0x21b4f4b5, 0x56b3c423,
0xcfba9599, 0xb8bda50f, 0x2802b89e, 0x5f058808, 0xc60cd9b2, 0xb10be924,
0x2f6f7c87, 0x58684c11, 0xc1611dab, 0xb6662d3d, 0x76dc4190, 0x01db7106,
0x98d220bc, 0xefd5102a, 0x71b18589, 0x06b6b51f, 0x9fbfe4a5, 0xe8b8d433,
0x7807c9a2, 0x0f00f934, 0x9609a88e, 0xe10e9818, 0x7f6a0dbb, 0x086d3d2d,
0x91646c97, 0xe6635c01, 0x6b6b51f4, 0x1c6c6162, 0x856530d8, 0xf262004e,
0x6c0695ed, 0x1b01a57b, 0x8208f4c1, 0xf50fc457, 0x65b0d9c6, 0x12b7e950,
0x8bbeb8ea, 0xfcb9887c, 0x62dd1ddf, 0x15da2d49, 0x8cd37cf3, 0xfbd44c65,
0x4db26158, 0x3ab551ce, 0xa3bc0074, 0xd4bb30e2, 0x4adfa541, 0x3dd895d7,
0xa4d1c46d, 0xd3d6f4fb, 0x4369e96a, 0x346ed9fc, 0xad678846, 0xda60b8d0,
0x44042d73, 0x33031de5, 0xaa0a4c5f, 0xdd0d7cc9, 0x5005713c, 0x270241aa,
0xbe0b1010, 0xc90c2086, 0x5768b525, 0x206f85b3, 0xb966d409, 0xce61e49f,
0x5edef90e, 0x29d9c998, 0xb0d09822, 0xc7d7a8b4, 0x59b33d17, 0x2eb40d81,
0xb7bd5c3b, 0xc0ba6cad, 0xedb88320, 0x9abfb3b6, 0x03b6e20c, 0x74b1d29a,
0xead54739, 0x9dd277af, 0x04db2615, 0x73dc1683, 0xe3630b12, 0x94643b84,
0x0d6d6a3e, 0x7a6a5aa8, 0xe40ecf0b, 0x9309ff9d, 0x0a00ae27, 0x7d079eb1,
0xf00f9344, 0x8708a3d2, 0x1e01f268, 0x6906c2fe, 0xf762575d, 0x806567cb,
0x196c3671, 0x6e6b06e7, 0xfed41b76, 0x89d32be0, 0x10da7a5a, 0x67dd4acc,
0xf9b9df6f, 0x8ebeeff9, 0x17b7be43, 0x60b08ed5, 0xd6d6a3e8, 0xa1d1937e,
0x38d8c2c4, 0x4fdff252, 0xd1bb67f1, 0xa6bc5767, 0x3fb506dd, 0x48b2364b,
0xd80d2bda, 0xaf0a1b4c, 0x36034af6, 0x41047a60, 0xdf60efc3, 0xa867df55,
0x316e8eef, 0x4669be79, 0xcb61b38c, 0xbc66831a, 0x256fd2a0, 0x5268e236,
0xcc0c7795, 0xbb0b4703, 0x220216b9, 0x5505262f, 0xc5ba3bbe, 0xb2bd0b28,
0x2bb45a92, 0x5cb36a04, 0xc2d7ffa7, 0xb5d0cf31, 0x2cd99e8b, 0x5bdeae1d,
0x9b64c2b0, 0xec63f226, 0x756aa39c, 0x026d930a, 0x9c0906a9, 0xeb0e363f,
0x72076785, 0x05005713, 0x95bf4a82, 0xe2b87a14, 0x7bb12bae, 0x0cb61b38,
0x92d28e9b, 0xe5d5be0d, 0x7cdcefb7, 0x0bdbdf21, 0x86d3d2d4, 0xf1d4e242,
0x68ddb3f8, 0x1fda836e, 0x81be16cd, 0xf6b9265b, 0x6fb077e1, 0x18b74777,
0x88085ae6, 0xff0f6a70, 0x66063bca, 0x11010b5c, 0x8f659eff, 0xf862ae69,
0x616bffd3, 0x166ccf45, 0xa00ae278, 0xd70dd2ee, 0x4e048354, 0x3903b3c2,
0xa7672661, 0xd06016f7, 0x4969474d, 0x3e6e77db, 0xaed16a4a, 0xd9d65adc,
0x40df0b66, 0x37d83bf0, 0xa9bcae53, 0xdebb9ec5, 0x47b2cf7f, 0x30b5ffe9,
0xbdbdf21c, 0xcabac28a, 0x53b39330, 0x24b4a3a6, 0xbad03605, 0xcdd70693,
0x54de5729, 0x23d967bf, 0xb3667a2e, 0xc4614ab8, 0x5d681b02, 0x2a6f2b94,
0xb40bbe37, 0xc30c8ea1, 0x5a05df1b, 0x2d02ef8d
};
static bool remap_type (void *data, struct type_entry **map,
uint32_t type_num, uint32_t num_types);
/* Add a new stream to the PDB archive, and return its BFD. */
static bfd *
add_stream (bfd *pdb, const char *name, uint16_t *stream_num)
{
bfd *stream;
uint16_t num;
stream = bfd_create (name ? name : "", pdb);
if (!stream)
return NULL;
if (!bfd_make_writable (stream))
{
bfd_close (stream);
return NULL;
}
if (!pdb->archive_head)
{
bfd_set_archive_head (pdb, stream);
num = 0;
}
else
{
bfd *b = pdb->archive_head;
num = 1;
while (b->archive_next)
{
num++;
b = b->archive_next;
}
b->archive_next = stream;
}
if (stream_num)
*stream_num = num;
return stream;
}
/* Stream 0 ought to be a copy of the MSF directory from the last
time the PDB file was written. Because we don't do incremental
writes this isn't applicable to us, but we fill it with a dummy
value so as not to confuse radare. */
static bool
create_old_directory_stream (bfd *pdb)
{
bfd *stream;
char buf[sizeof (uint32_t)];
stream = add_stream (pdb, NULL, NULL);
if (!stream)
return false;
bfd_putl32 (0, buf);
return bfd_write (buf, sizeof (uint32_t), stream) == sizeof (uint32_t);
}
/* Calculate the hash of a given string. */
static uint32_t
calc_hash (const char *data, size_t len)
{
uint32_t hash = 0;
while (len >= 4)
{
hash ^= data[0];
hash ^= data[1] << 8;
hash ^= data[2] << 16;
hash ^= data[3] << 24;
data += 4;
len -= 4;
}
if (len >= 2)
{
hash ^= data[0];
hash ^= data[1] << 8;
data += 2;
len -= 2;
}
if (len != 0)
hash ^= *data;
hash |= 0x20202020;
hash ^= (hash >> 11);
return hash ^ (hash >> 16);
}
/* Stream 1 is the PDB info stream - see
https://llvm.org/docs/PDB/PdbStream.html. */
static bool
populate_info_stream (bfd *pdb, bfd *info_stream, const unsigned char *guid)
{
bool ret = false;
struct pdb_stream_70 h;
uint32_t num_entries, num_buckets;
uint32_t names_length, stream_num;
char int_buf[sizeof (uint32_t)];
struct hash_entry
{
uint32_t offset;
uint32_t value;
};
struct hash_entry **buckets = NULL;
/* Write header. */
bfd_putl32 (PDB_STREAM_VERSION_VC70, &h.version);
bfd_putl32 (time (NULL), &h.signature);
bfd_putl32 (1, &h.age);
bfd_putl32 (bfd_getb32 (guid), h.guid);
bfd_putl16 (bfd_getb16 (&guid[4]), &h.guid[4]);
bfd_putl16 (bfd_getb16 (&guid[6]), &h.guid[6]);
memcpy (&h.guid[8], &guid[8], 8);
if (bfd_write (&h, sizeof (h), info_stream) != sizeof (h))
return false;
/* Write hash list of named streams. This is a "rollover" hash, i.e.
if a bucket is filled an entry gets placed in the next free
slot. */
num_entries = 0;
for (bfd *b = pdb->archive_head; b; b = b->archive_next)
{
if (strcmp (b->filename, ""))
num_entries++;
}
num_buckets = num_entries * 2;
names_length = 0;
stream_num = 0;
if (num_buckets > 0)
{
buckets = xmalloc (sizeof (struct hash_entry *) * num_buckets);
memset (buckets, 0, sizeof (struct hash_entry *) * num_buckets);
for (bfd *b = pdb->archive_head; b; b = b->archive_next)
{
if (strcmp (b->filename, ""))
{
size_t len = strlen (b->filename);
uint32_t hash = (uint16_t) calc_hash (b->filename, len);
uint32_t bucket_num = hash % num_buckets;
while (buckets[bucket_num])
{
bucket_num++;
if (bucket_num == num_buckets)
bucket_num = 0;
}
buckets[bucket_num] = xmalloc (sizeof (struct hash_entry));
buckets[bucket_num]->offset = names_length;
buckets[bucket_num]->value = stream_num;
names_length += len + 1;
}
stream_num++;
}
}
/* Write the strings list - the hash keys are indexes into this. */
bfd_putl32 (names_length, int_buf);
if (bfd_write (int_buf, sizeof (uint32_t), info_stream) !=
sizeof (uint32_t))
goto end;
for (bfd *b = pdb->archive_head; b; b = b->archive_next)
{
if (!strcmp (b->filename, ""))
continue;
size_t len = strlen (b->filename) + 1;
if (bfd_write (b->filename, len, info_stream) != len)
goto end;
}
/* Write the number of entries and buckets. */
bfd_putl32 (num_entries, int_buf);
if (bfd_write (int_buf, sizeof (uint32_t), info_stream) !=
sizeof (uint32_t))
goto end;
bfd_putl32 (num_buckets, int_buf);
if (bfd_write (int_buf, sizeof (uint32_t), info_stream) !=
sizeof (uint32_t))
goto end;
/* Write the present bitmap. */
bfd_putl32 ((num_buckets + 31) / 32, int_buf);
if (bfd_write (int_buf, sizeof (uint32_t), info_stream) !=
sizeof (uint32_t))
goto end;
for (unsigned int i = 0; i < num_buckets; i += 32)
{
uint32_t v = 0;
for (unsigned int j = 0; j < 32; j++)
{
if (i + j >= num_buckets)
break;
if (buckets[i + j])
v |= 1 << j;
}
bfd_putl32 (v, int_buf);
if (bfd_write (int_buf, sizeof (uint32_t), info_stream) !=
sizeof (uint32_t))
goto end;
}
/* Write the (empty) deleted bitmap. */
bfd_putl32 (0, int_buf);
if (bfd_write (int_buf, sizeof (uint32_t), info_stream) !=
sizeof (uint32_t))
goto end;
/* Write the buckets. */
for (unsigned int i = 0; i < num_buckets; i++)
{
if (buckets[i])
{
bfd_putl32 (buckets[i]->offset, int_buf);
if (bfd_write (int_buf, sizeof (uint32_t), info_stream) !=
sizeof (uint32_t))
goto end;
bfd_putl32 (buckets[i]->value, int_buf);
if (bfd_write (int_buf, sizeof (uint32_t), info_stream) !=
sizeof (uint32_t))
goto end;
}
}
bfd_putl32 (0, int_buf);
if (bfd_write (int_buf, sizeof (uint32_t), info_stream) !=
sizeof (uint32_t))
goto end;
bfd_putl32 (PDB_STREAM_VERSION_VC140, int_buf);
if (bfd_write (int_buf, sizeof (uint32_t), info_stream) !=
sizeof (uint32_t))
goto end;
ret = true;
end:
for (unsigned int i = 0; i < num_buckets; i++)
{
if (buckets[i])
free (buckets[i]);
}
free (buckets);
return ret;
}
/* Calculate the CRC32 used for type hashes. */
static uint32_t
crc32 (const uint8_t *data, size_t len)
{
uint32_t crc = 0;
while (len > 0)
{
crc = (crc >> 8) ^ crc_table[(crc & 0xff) ^ *data];
data++;
len--;
}
return crc;
}
/* Stream 2 is the type information (TPI) stream, and stream 4 is
the ID information (IPI) stream. They differ only in which records
go in which stream. */
static bool
populate_type_stream (bfd *pdb, bfd *stream, struct types *types)
{
struct pdb_tpi_stream_header h;
struct type_entry *e;
uint32_t len = 0, index_offset_len, off;
struct bfd *hash_stream = NULL;
uint16_t hash_stream_index;
static const uint32_t index_skip = 0x2000;
e = types->first;
index_offset_len = 0;
while (e)
{
uint32_t old_len = len;
len += sizeof (uint16_t) + bfd_getl16 (e->data);
if (old_len == 0 || old_len / index_skip != len / index_skip)
index_offset_len += sizeof (uint32_t) * 2;
e = e->next;
}
/* Each type stream also has a stream which holds the hash value for each
type, along with a skip list to speed up searching. */
hash_stream = add_stream (pdb, "", &hash_stream_index);
if (!hash_stream)
return false;
bfd_putl32 (TPI_STREAM_VERSION_80, &h.version);
bfd_putl32 (sizeof (h), &h.header_size);
bfd_putl32 (TPI_FIRST_INDEX, &h.type_index_begin);
bfd_putl32 (TPI_FIRST_INDEX + types->num_types, &h.type_index_end);
bfd_putl32 (len, &h.type_record_bytes);
bfd_putl16 (hash_stream_index, &h.hash_stream_index);
bfd_putl16 (0xffff, &h.hash_aux_stream_index);
bfd_putl32 (sizeof (uint32_t), &h.hash_key_size);
bfd_putl32 (NUM_TPI_HASH_BUCKETS, &h.num_hash_buckets);
bfd_putl32 (0, &h.hash_value_buffer_offset);
bfd_putl32 (types->num_types * sizeof (uint32_t),
&h.hash_value_buffer_length);
bfd_putl32 (types->num_types * sizeof (uint32_t),
&h.index_offset_buffer_offset);
bfd_putl32 (index_offset_len, &h.index_offset_buffer_length);
bfd_putl32 ((types->num_types * sizeof (uint32_t)) + index_offset_len,
&h.hash_adj_buffer_offset);
bfd_putl32 (0, &h.hash_adj_buffer_length);
if (bfd_write (&h, sizeof (h), stream) != sizeof (h))
return false;
/* Write the type definitions into the main stream, and the hashes
into the hash stream. The hashes have already been calculated
in handle_type. */
e = types->first;
while (e)
{
uint8_t buf[sizeof (uint32_t)];
uint16_t size;
size = bfd_getl16 (e->data);
if (bfd_write (e->data, size + sizeof (uint16_t), stream)
!= size + sizeof (uint16_t))
return false;
bfd_putl32 (e->cv_hash % NUM_TPI_HASH_BUCKETS, buf);
if (bfd_write (buf, sizeof (uint32_t), hash_stream)
!= sizeof (uint32_t))
return false;
e = e->next;
}
/* Write the index offsets, i.e. the skip list, into the hash stream. We
copy MSVC here by writing a new entry for every 8192 bytes. */
e = types->first;
off = 0;
while (e)
{
uint32_t old_off = off;
uint16_t size = bfd_getl16 (e->data);
off += size + sizeof (uint16_t);
if (old_off == 0 || old_off / index_skip != len / index_skip)
{
uint8_t buf[sizeof (uint32_t)];
bfd_putl32 (TPI_FIRST_INDEX + e->index, buf);
if (bfd_write (buf, sizeof (uint32_t), hash_stream)
!= sizeof (uint32_t))
return false;
bfd_putl32 (old_off, buf);
if (bfd_write (buf, sizeof (uint32_t), hash_stream)
!= sizeof (uint32_t))
return false;
}
e = e->next;
}
return true;
}
/* Return the PE architecture number for the image. */
static uint16_t
get_arch_number (bfd *abfd)
{
switch (abfd->arch_info->arch)
{
case bfd_arch_i386:
if (abfd->arch_info->mach & bfd_mach_x86_64)
return IMAGE_FILE_MACHINE_AMD64;
else
return IMAGE_FILE_MACHINE_I386;
case bfd_arch_aarch64:
return IMAGE_FILE_MACHINE_ARM64;
default:
return 0;
}
}
/* Validate the DEBUG_S_FILECHKSMS entry within a module's .debug$S
section, and copy it to the module's symbol stream. */
static bool
copy_filechksms (uint8_t *data, uint32_t size, char *string_table,
struct string_table *strings, uint8_t *out,
struct mod_source_files *mod_source)
{
uint8_t *orig_data = data;
uint32_t orig_size = size;
uint16_t num_files = 0;
struct string **strptr;
bfd_putl32 (DEBUG_S_FILECHKSMS, out);
out += sizeof (uint32_t);
bfd_putl32 (size, out);
out += sizeof (uint32_t);
/* Calculate the number of files, and check for any overflows. */
while (size > 0)
{
struct file_checksum *fc = (struct file_checksum *) data;
uint8_t padding;
size_t len;
if (size < sizeof (struct file_checksum))
{
bfd_set_error (bfd_error_bad_value);
return false;
}
len = sizeof (struct file_checksum) + fc->checksum_length;
if (size < len)
{
bfd_set_error (bfd_error_bad_value);
return false;
}
data += len;
size -= len;
if (len % sizeof (uint32_t))
padding = sizeof (uint32_t) - (len % sizeof (uint32_t));
else
padding = 0;
if (size < padding)
{
bfd_set_error (bfd_error_bad_value);
return false;
}
num_files++;
data += padding;
size -= padding;
}
/* Add the files to mod_source, so that they'll appear in the source
info substream. */
strptr = NULL;
if (num_files > 0)
{
uint16_t new_count = num_files + mod_source->files_count;
mod_source->files = xrealloc (mod_source->files,
sizeof (struct string *) * new_count);
strptr = mod_source->files + mod_source->files_count;
mod_source->files_count += num_files;
}
/* Actually copy the data. */
data = orig_data;
size = orig_size;
while (size > 0)
{
struct file_checksum *fc = (struct file_checksum *) data;
uint32_t string_off;
uint8_t padding;
size_t len;
struct string *str = NULL;
string_off = bfd_getl32 (&fc->file_id);
len = sizeof (struct file_checksum) + fc->checksum_length;
if (len % sizeof (uint32_t))
padding = sizeof (uint32_t) - (len % sizeof (uint32_t));
else
padding = 0;
/* Remap the "file ID", i.e. the offset in the module's string table,
so it points to the right place in the main string table. */
if (string_table)
{
char *fn = string_table + string_off;
size_t fn_len = strlen (fn);
uint32_t hash = calc_hash (fn, fn_len);
void **slot;
slot = htab_find_slot_with_hash (strings->hashmap, fn, hash,
NO_INSERT);
if (slot)
str = (struct string *) *slot;
}
*strptr = str;
strptr++;
bfd_putl32 (str ? str->offset : 0, &fc->file_id);
memcpy (out, data, len + padding);
data += len + padding;
size -= len + padding;
out += len + padding;
}
return true;
}
/* Add a string to the strings table, if it's not already there. Returns its
offset within the string table. */
static uint32_t
add_string (char *str, size_t len, struct string_table *strings)
{
uint32_t hash = calc_hash (str, len);
struct string *s;
void **slot;
slot = htab_find_slot_with_hash (strings->hashmap, str, hash, INSERT);
if (!*slot)
{
*slot = xmalloc (offsetof (struct string, s) + len);
s = (struct string *) *slot;
s->next = NULL;
s->hash = hash;
s->offset = strings->strings_len;
s->source_file_offset = 0xffffffff;
s->len = len;
memcpy (s->s, str, len);
if (strings->strings_tail)
strings->strings_tail->next = s;
else
strings->strings_head = s;
strings->strings_tail = s;
strings->strings_len += len + 1;
}
else
{
s = (struct string *) *slot;
}
return s->offset;
}
/* Return the hash of an entry in the string table. */
static hashval_t
hash_string_table_entry (const void *p)
{
const struct string *s = (const struct string *) p;
return s->hash;
}
/* Compare an entry in the string table with a string. */
static int
eq_string_table_entry (const void *a, const void *b)
{
const struct string *s1 = (const struct string *) a;
const char *s2 = (const char *) b;
size_t s2_len = strlen (s2);
if (s2_len != s1->len)
return 0;
return memcmp (s1->s, s2, s2_len) == 0;
}
/* Parse the string table within the .debug$S section. */
static void
parse_string_table (bfd_byte *data, size_t size,
struct string_table *strings)
{
while (true)
{
size_t len = strnlen ((char *) data, size);
add_string ((char *) data, len, strings);
data += len + 1;
if (size <= len + 1)
break;
size -= len + 1;
}
}
/* Remap a type reference within a CodeView symbol. */
static bool
remap_symbol_type (void *data, struct type_entry **map, uint32_t num_types)
{
uint32_t type = bfd_getl32 (data);
/* Ignore builtin types (those with IDs below 0x1000). */
if (type < TPI_FIRST_INDEX)
return true;
if (type >= TPI_FIRST_INDEX + num_types)
{
einfo (_("%P: CodeView symbol references out of range type %v\n"),
type);
return false;
}
type = TPI_FIRST_INDEX + map[type - TPI_FIRST_INDEX]->index;
bfd_putl32 (type, data);
return true;
}
/* Add an entry into the globals stream. If it already exists, increase
the refcount. */
static bool
add_globals_ref (struct globals *glob, bfd *sym_rec_stream, const char *name,
size_t name_len, uint8_t *data, size_t len)
{
void **slot;
uint32_t hash;
struct global *g;
slot = htab_find_slot_with_hash (glob->hashmap, data,
iterative_hash (data, len, 0), INSERT);
if (*slot)
{
g = *slot;
g->refcount++;
return true;
}
*slot = xmalloc (offsetof (struct global, data) + len);
hash = calc_hash (name, name_len);
hash %= NUM_GLOBALS_HASH_BUCKETS;
g = *slot;
g->next = NULL;
g->offset = bfd_tell (sym_rec_stream);
g->hash = hash;
g->refcount = 1;
memcpy (g->data, data, len);
glob->num_entries++;
if (glob->last)
glob->last->next = g;
else
glob->first = g;
glob->last = g;
return bfd_write (data, len, sym_rec_stream) == len;
}
/* Find the end of the current scope within symbols data. */
static uint8_t *
find_end_of_scope (uint8_t *data, uint32_t size)
{
unsigned int scope_level = 1;
uint16_t len;
len = bfd_getl16 (data) + sizeof (uint16_t);
data += len;
size -= len;
while (true)
{
uint16_t type;
if (size < sizeof (uint32_t))
return NULL;
len = bfd_getl16 (data) + sizeof (uint16_t);
type = bfd_getl16 (data + sizeof (uint16_t));
if (size < len)
return NULL;
switch (type)
{
case S_GPROC32:
case S_LPROC32:
case S_BLOCK32:
case S_INLINESITE:
case S_THUNK32:
scope_level++;
break;
case S_END:
case S_PROC_ID_END:
case S_INLINESITE_END:
scope_level--;
if (scope_level == 0)
return data;
break;
}
data += len;
size -= len;
}
}
/* Return the size of an extended value parameter, as used in
LF_ENUMERATE etc. */
static unsigned int
extended_value_len (uint16_t type)
{
switch (type)
{
case LF_CHAR:
return 1;
case LF_SHORT:
case LF_USHORT:
return 2;
case LF_LONG:
case LF_ULONG:
return 4;
case LF_QUADWORD:
case LF_UQUADWORD:
return 8;
}
return 0;
}
/* Parse the symbols in a .debug$S section, and copy them to the module's
symbol stream. */
static bool
parse_symbols (uint8_t *data, uint32_t size, uint8_t **buf,
struct type_entry **map, uint32_t num_types,
bfd *sym_rec_stream, struct globals *glob, uint16_t mod_num)
{
uint8_t *orig_buf = *buf;
unsigned int scope_level = 0;
uint8_t *scope = NULL;
while (size >= sizeof (uint16_t))
{
uint16_t len, type;
len = bfd_getl16 (data) + sizeof (uint16_t);
if (len > size)
{
bfd_set_error (bfd_error_bad_value);
return false;
}
type = bfd_getl16 (data + sizeof (uint16_t));