Repository navigation
Expand file tree
/
Copy pathdyn_load.c
More file actions
1634 lines (1478 loc) · 48.4 KB
/
Copy pathdyn_load.c
File metadata and controls
1634 lines (1478 loc) · 48.4 KB
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
/*
* Copyright (c) 1991-1994 by Xerox Corporation. All rights reserved.
* Copyright (c) 1997 by Silicon Graphics. All rights reserved.
* Copyright (c) 2009-2025 Ivan Maidanski
*
* THIS MATERIAL IS PROVIDED AS IS, WITH ABSOLUTELY NO WARRANTY EXPRESSED
* OR IMPLIED. ANY USE IS AT YOUR OWN RISK.
*
* Permission is hereby granted to use or copy this program
* for any purpose, provided the above notices are retained on all copies.
* Permission to modify the code and to distribute modified code is granted,
* provided the above notices are retained, and a notice that the code was
* modified is included with the above copyright notice.
*/
#include "private/gc_priv.h"
/*
* This is incredibly OS specific code for tracking down data sections in
* dynamic libraries. There appears to be no way of doing this quickly
* without groveling through undocumented data structures. We would argue
* that this is a bug in the design of the `dlopen` interface. This code
* may break in future OS releases. If this matters to you, do not hesitate
* to let your vendor know...
*
* None of this is safe with `dlclose` and incremental collection.
* But, then not much of anything is safe in the presence of `dlclose`.
*/
/*
* BTL: avoid circular redefinition of `dlopen` if `SOLARIS` and `THREADS`
* are both defined.
*/
#undef GC_MUST_RESTORE_REDEFINED_DLOPEN
#if defined(GC_PTHREADS) && !defined(GC_NO_DLOPEN) \
&& !defined(GC_NO_THREAD_REDIRECTS) && !defined(GC_USE_LD_WRAP)
/*
* To support threads in Solaris, `gc.h` file interposes on `dlopen` by
* defining `dlopen` to be `GC_dlopen`. `GC_FirstDLOpenedLinkMap()` needs
* to use the real system `dlopen()`, thus we first undo `dlopen` definition
* by `gc.h` file and restore it at the end of the current file.
*/
# undef dlopen
# define GC_MUST_RESTORE_REDEFINED_DLOPEN
#endif /* !GC_NO_DLOPEN */
#if defined(SOLARISDL) && defined(THREADS) && !defined(SOLARIS) \
&& !defined(CPPCHECK)
# error Fix mutual exclusion with dlopen
#endif
/*
* A user-supplied routine (custom filter) that might be called to
* determine whether a DSO really needs to be scanned by the collector.
* Zero means no filter installed. May be unused on some platforms.
*/
/* FIXME: Add filter support for more platforms. */
STATIC MAY_THREAD_LOCAL GC_has_static_roots_func GC_has_static_roots = 0;
#ifdef ANY_MSWIN
/*
* We traverse the entire address space and register all segments that
* could possibly have been written to.
*/
STATIC void
GC_cond_add_roots(ptr_t base, ptr_t limit)
{
# ifdef THREADS
ptr_t curr_base = base;
ptr_t next_stack_lo, next_stack_hi;
# else
ptr_t stack_top;
# endif
GC_ASSERT(I_HOLD_LOCK());
if (base == limit)
return;
# ifdef THREADS
for (;;) {
GC_get_next_stack(curr_base, limit, &next_stack_lo, &next_stack_hi);
if (ADDR_GE(next_stack_lo, limit))
break;
if (ADDR_LT(curr_base, next_stack_lo))
GC_add_roots_inner(curr_base, next_stack_lo, TRUE);
curr_base = next_stack_hi;
}
if (ADDR_LT(curr_base, limit))
GC_add_roots_inner(curr_base, limit, TRUE);
# else
stack_top
= PTR_ALIGN_DOWN(GC_approx_sp(), GC_sysinfo.dwAllocationGranularity);
if (ADDR_LT(stack_top, limit) && ADDR_LT(base, GC_stackbottom)) {
/* Part of the stack; ignore it. */
return;
}
GC_add_roots_inner(base, limit, TRUE);
# endif
}
# ifdef DYNAMIC_LOADING
GC_INNER GC_bool
GC_register_main_static_data(void)
{
# if defined(CYGWIN) || defined(MSWINCE)
return FALSE;
# else
return GC_no_win32_dlls;
# endif
}
# define HAVE_REGISTER_MAIN_STATIC_DATA
# endif /* DYNAMIC_LOADING */
# ifdef DEBUG_VIRTUALQUERY
void
GC_dump_meminfo(MEMORY_BASIC_INFORMATION *buf)
{
GC_printf(
"BaseAddress= %p, AllocationBase= %p, RegionSize= 0x%lx\n"
"\tAllocationProtect= 0x%x, State= 0x%x, Protect= 0x%x, Type= 0x%x\n",
buf->BaseAddress, buf->AllocationBase, (unsigned long)buf->RegionSize,
buf->AllocationProtect, buf->State, buf->Protect, buf->Type);
}
# endif /* DEBUG_VIRTUALQUERY */
# if defined(CYGWIN) || defined(MSWINCE)
/* FIXME: Should we really need to scan `MEM_PRIVATE` sections? */
/*
* For now, we do not add `MEM_PRIVATE` sections to the data roots for
* WinCE because otherwise `SIGSEGV` fault sometimes happens to occur
* in `GC_mark_from()` (and, even if we use `WRAP_MARK_SOME`, WinCE
* prints a "Data Abort" message to the debugging console).
* To workaround that, use `-D GC_REGISTER_MEM_PRIVATE`.
*/
# define GC_wnt TRUE
# endif
GC_INNER void
GC_register_dynamic_libraries(void)
{
ptr_t p, base, limit;
GC_ASSERT(I_HOLD_LOCK());
# if defined(MSWIN32) && !defined(GC_WINNT)
if (GC_no_win32_dlls)
return;
# endif
p = (ptr_t)GC_sysinfo.lpMinimumApplicationAddress;
base = limit = p;
while (ADDR_LT(p, (ptr_t)GC_sysinfo.lpMaximumApplicationAddress)) {
MEMORY_BASIC_INFORMATION buf;
size_t result = VirtualQuery((LPVOID)p, &buf, sizeof(buf));
# ifdef MSWINCE
if (0 == result) {
if (ADDR(p) > GC_WORD_MAX - GC_sysinfo.dwAllocationGranularity) {
/* An overflow. */
break;
}
/* Page is free; advance to the next possible allocation base. */
p = PTR_ALIGN_UP(p + 1, GC_sysinfo.dwAllocationGranularity);
} else
# endif
/* else */ {
DWORD protect;
if (result != sizeof(buf))
ABORT("Weird VirtualQuery result");
if (ADDR(p) > GC_WORD_MAX - buf.RegionSize) {
/* An overflow. */
break;
}
protect = buf.Protect;
if (buf.State == MEM_COMMIT
&& (protect == PAGE_EXECUTE_READWRITE
|| protect == PAGE_EXECUTE_WRITECOPY || protect == PAGE_READWRITE
|| protect == PAGE_WRITECOPY)
&& (buf.Type == MEM_IMAGE
# ifdef GC_REGISTER_MEM_PRIVATE
|| (protect == PAGE_READWRITE && buf.Type == MEM_PRIVATE)
# else
/*
* There is some evidence that we cannot always ignore
* `MEM_PRIVATE` sections under Windows ME and predecessors.
* Hence we now also check for that case.
*/
|| (!GC_wnt && buf.Type == MEM_PRIVATE)
# endif
)
&& !GC_is_heap_base(buf.AllocationBase)) {
# ifdef DEBUG_VIRTUALQUERY
GC_dump_meminfo(&buf);
# endif
if (p != limit) {
GC_cond_add_roots(base, limit);
base = p;
}
limit = p + buf.RegionSize;
}
p += buf.RegionSize;
}
}
GC_cond_add_roots(base, limit);
}
#elif defined(DYNAMIC_LOADING) /* `&& !ANY_MSWIN` */
# if defined(DARWIN) && !defined(USE_DYLD_TO_BIND) \
&& !defined(NO_DYLD_BIND_FULLY_IMAGE)
# include <dlfcn.h>
# endif
# ifdef SOLARISDL
# include <dlfcn.h>
# include <sys/elf.h>
# endif
# if defined(NETBSD)
# include <dlfcn.h>
# include <machine/elf_machdep.h>
# include <sys/param.h>
# define ELFSIZE ARCH_ELFSIZE
# endif
# if defined(DGUX) || defined(HURD) || defined(NACL) || defined(SCO_ELF) \
|| defined(SERENITY) \
|| (defined(SOLARISDL) && !defined(USE_PROC_FOR_LIBRARIES)) \
|| ((defined(ANY_BSD) || defined(LINUX)) && defined(__ELF__))
/* Dynamic loading code for Linux, Solaris or similar OS running ELF. */
# define UNIX_GENERIC_DYNAMIC_LOADING
# include <stddef.h>
# if !defined(OPENBSD) && !defined(HOST_ANDROID)
/*
* OpenBSD does not have platform `elf.h` file; include `link.h` file below
* is sufficient. Exclude this on Android because platform `linker.h` file
* below includes its own variant.
*/
# include <elf.h>
# endif
# ifdef HOST_ANDROID
/*
* If you do not need the "dynamic loading" feature, you may build the
* collector with `-D IGNORE_DYNAMIC_LOADING`.
*/
# ifdef BIONIC_ELFDATA_REDEF_BUG
/*
* Workaround a problem in Bionic (as of Android 4.2) which has mismatching
* `ELF_DATA` definitions in platform `sys/exec_elf.h` and `asm/elf.h` files
* included from `linker.h` file (similar to `EM_ALPHA`).
*/
# include <asm/elf.h>
# include <linux/elf-em.h>
# undef ELF_DATA
# undef EM_ALPHA
# endif
# include <link.h>
# endif /* HOST_ANDROID */
# if ((defined(HOST_ANDROID) && !defined(GC_DONT_DEFINE_LINK_MAP) \
&& !(__ANDROID_API__ >= 21)) \
|| defined(SERENITY)) \
&& !defined(USE_PROC_FOR_LIBRARIES)
/*
* `link_map` and `r_debug` are defined in `link.h` file of NDK r10+.
* `bionic/linker/linker.h` file defines them too but the header itself
* is a C++ one starting from Android 4.3.
*/
struct link_map {
uintptr_t l_addr;
char *l_name;
uintptr_t l_ld;
struct link_map *l_next;
struct link_map *l_prev;
};
struct r_debug {
int32_t r_version;
struct link_map *r_map;
/* `void (*r_brk)(void);` */
/* `int32_t r_state;` */
/* `uintptr_t r_ldbase;` */
};
# define LINK_MAP_R_DEBUG_DEFINED
# endif /* __ANDROID_API__ >= 21 || SERENITY */
# ifndef HOST_ANDROID
/*
* Workaround missing `extern "C"` around `_DYNAMIC` symbol in platform
* `link.h` file of some Linux hosts.
*/
EXTERN_C_BEGIN
# include <link.h>
EXTERN_C_END
# endif
# endif /* DGUX || HURD || NACL || ... || (ANY_BSD || LINUX) && __ELF__ */
# if !(defined(CPPCHECK) || defined(UNIX_GENERIC_DYNAMIC_LOADING) \
|| defined(AIX) || defined(DARWIN) || defined(IRIX5) \
|| defined(HAIKU) || defined(HPUX) || defined(OSF1) \
|| (defined(OPENBSD) && defined(M68K)) || defined(SOLARISDL))
# error Finding data segments of dynamic libraries is unsupported on target
# endif
/*
* Newer versions of GNU/Linux define this macro. We define it similarly
* for all ELF systems that do not.
*/
# ifndef ElfW
# if defined(FREEBSD)
# if __ELF_WORD_SIZE == 32
# define ElfW(type) Elf32_##type
# else
# define ElfW(type) Elf64_##type
# endif
# elif defined(NETBSD) || defined(OPENBSD)
# if ELFSIZE == 32
# define ElfW(type) Elf32_##type
# elif ELFSIZE == 64
# define ElfW(type) Elf64_##type
# elif !defined(CPPCHECK)
# error Missing ELFSIZE define
# endif
# else
# if !defined(ELF_CLASS) || ELF_CLASS == ELFCLASS32
# define ElfW(type) Elf32_##type
# else
# define ElfW(type) Elf64_##type
# endif
# endif
# endif
# ifdef UNIX_GENERIC_DYNAMIC_LOADING
# ifdef USE_PROC_FOR_LIBRARIES
# include <fcntl.h>
# include <string.h>
# include <sys/stat.h>
# define MAPS_BUF_SIZE (32 * 1024)
/*
* Sort an array of `HeapSects` elements by `hs_start` value.
* Unfortunately, at least some versions of Linux, `qsort` end up calling
* `malloc` by way of `sysconf`, and hence cannot be used in the collector.
* Hence we roll our own. Should be reasonably fast if the array is
* already mostly sorted, as we expect it to be.
*/
static void
sort_heap_sects(struct HeapSect *base, size_t number_of_elements)
{
GC_signed_word n = (GC_signed_word)number_of_elements;
GC_signed_word nsorted = 1;
while (nsorted < n) {
GC_signed_word i;
while (nsorted < n
&& ADDR_LT(base[nsorted - 1].hs_start, base[nsorted].hs_start)) {
++nsorted;
}
if (nsorted == n)
break;
GC_ASSERT(ADDR_LT(base[nsorted].hs_start, base[nsorted - 1].hs_start));
for (i = nsorted - 1;
i >= 0 && ADDR_LT(base[i + 1].hs_start, base[i].hs_start); --i) {
struct HeapSect tmp = base[i];
base[i] = base[i + 1];
base[i + 1] = tmp;
}
GC_ASSERT(ADDR_LT(base[nsorted - 1].hs_start, base[nsorted].hs_start));
++nsorted;
}
}
# ifdef ADDRESS_SANITIZER
# include <ctype.h>
static GC_bool
is_asan_mapping(const char *path)
{
/*
* Note: this assumes `decorate_proc_maps` flag (set to true or 1) is
* passed to the Address Sanitizer runtime, see `__asan_default_options()`.
*/
int i;
/* Match start of `path` to "/dev/shm/<pid> [...] (deleted)\n". */
# define ASAN_MAPPING_PREFIX "/dev/shm/"
i = sizeof(ASAN_MAPPING_PREFIX) - 1;
if (strncmp(path, ASAN_MAPPING_PREFIX, i) != 0)
return FALSE;
while (isdigit(path[i]))
i++;
if (strncmp(path + i, " [", 2) != 0)
return FALSE;
i += 2;
while (isalpha(path[i]) || path[i] == ' ' || path[i] == ':')
i++;
# define ASAN_MAPPING_TAIL "] (deleted)\n"
return strncmp(path + i, ASAN_MAPPING_TAIL, sizeof(ASAN_MAPPING_TAIL) - 1)
== 0;
}
# endif
STATIC void
GC_register_map_entries(const char *maps)
{
const char *prot, *path;
ptr_t my_start, my_end;
ptr_t least_ha, greatest_ha;
unsigned maj_dev;
unsigned i;
GC_ASSERT(I_HOLD_LOCK());
sort_heap_sects(GC_our_memory, GC_n_memory);
least_ha = GC_our_memory[0].hs_start;
greatest_ha = GC_our_memory[GC_n_memory - 1].hs_start
+ GC_our_memory[GC_n_memory - 1].hs_bytes;
for (;;) {
maps
= GC_parse_map_entry(maps, &my_start, &my_end, &prot, &maj_dev, &path);
if (NULL == maps)
break;
if (prot[1] == 'w') {
/*
* This is a writable mapping. Add it to the root set unless
* it is already otherwise accounted for.
*/
# ifndef THREADS
if (ADDR_GE(GC_stackbottom, my_start)
&& ADDR_GE(my_end, GC_stackbottom)) {
/* Stack mapping; discard it. */
continue;
}
# endif
# if defined(E2K) && defined(__ptr64__)
/* TODO: Avoid hard-coded addresses. */
if (ADDR(my_start) == 0xc2fffffff000UL
&& ADDR(my_end) == 0xc30000000000UL && path[0] == '\n') {
/* Discard some special mapping. */
continue;
}
# endif
if (path[0] == '[' && strncmp(path + 1, "heap]", 5) != 0) {
/* Discard a pseudo-file path except for "[heap]". */
continue;
}
# ifdef ADDRESS_SANITIZER
if (is_asan_mapping(path)) {
/* Discard ASan-specific mapping. */
continue;
}
# endif
# ifdef THREADS
/*
* This may fail, since a thread may already be unregistered, but
* its thread stack may still be there. That can fail because the
* stack just appeared or may disappear while we are marking.
* Thus the marker is, and has to be prepared to recover from
* segmentation faults.
*/
if (GC_segment_is_thread_stack(my_start, my_end)) {
continue;
/*
* FIXME: NPTL squirrels away pointers in pieces of the stack
* segment that we do not scan. We work around this by treating
* anything allocated by `libpthread` as uncollectible, as we do
* in some other cases. A specifically identified problem is that
* thread stacks contain pointers to dynamic thread vectors, that
* may be reused due to thread caching. They may not be marked
* if the thread is still live. This specific instance should be
* addressed by `INCLUDE_LINUX_THREAD_DESCR`, but that does not
* quite seem to suffice. We currently trace entire thread stacks,
* if they are are currently cached but unused. This is very
* suboptimal for performance reasons.
*/
}
# endif
/* We no longer exclude the main data segment. */
if (ADDR_GE(least_ha, my_end) || ADDR_GE(my_start, greatest_ha)) {
/* The easy case; just trace the entire segment. */
GC_add_roots_inner(my_start, my_end, TRUE);
continue;
}
/* Add sections that do not belong to us. */
i = 0;
while (ADDR_LT(GC_our_memory[i].hs_start + GC_our_memory[i].hs_bytes,
my_start)) {
++i;
}
GC_ASSERT(i < GC_n_memory);
if (ADDR_GE(my_start, GC_our_memory[i].hs_start)) {
my_start = GC_our_memory[i].hs_start + GC_our_memory[i].hs_bytes;
++i;
}
for (; i < GC_n_memory && ADDR_LT(my_start, my_end)
&& ADDR_LT(GC_our_memory[i].hs_start, my_end);
++i) {
if (ADDR_LT(my_start, GC_our_memory[i].hs_start))
GC_add_roots_inner(my_start, GC_our_memory[i].hs_start, TRUE);
my_start = GC_our_memory[i].hs_start + GC_our_memory[i].hs_bytes;
}
if (ADDR_LT(my_start, my_end))
GC_add_roots_inner(my_start, my_end, TRUE);
} else if (prot[0] == '-' && prot[1] == '-' && prot[2] == '-') {
/*
* Even roots added statically might disappear partially
* (e.g. the roots added by `INCLUDE_LINUX_THREAD_DESCR`).
*/
GC_remove_roots_subregion(my_start, my_end);
}
}
}
GC_INNER void
GC_register_dynamic_libraries(void)
{
GC_register_map_entries(GC_get_maps());
}
GC_INNER GC_bool
GC_register_main_static_data(void)
{
/* We now take care of the main data segment ourselves. */
return FALSE;
}
# define HAVE_REGISTER_MAIN_STATIC_DATA
# else /* !USE_PROC_FOR_LIBRARIES */
# ifdef HOST_ANDROID
/* Android headers might have no such definition for some targets. */
EXTERN_C_BEGIN
extern int dl_iterate_phdr(int (*cb)(struct dl_phdr_info *, size_t, void *),
void *data);
EXTERN_C_END
# endif
# ifdef HAVE_DL_ITERATE_PHDR
# if defined(__DragonFly__) || defined(__FreeBSD_kernel__) \
|| (defined(FREEBSD) && __FreeBSD__ >= 7)
/*
* On the FreeBSD system, any target system at major version 7 shall have
* `dl_iterate_phdr`; therefore, we need not make it weak as below.
*/
# define DL_ITERATE_PHDR_STRONG
# else
/*
* We have the header files for a `glibc` that includes `dl_iterate_phdr`.
* It may still not be available in the library on the target system.
* Thus we also treat it as a weak symbol.
*/
EXTERN_C_BEGIN
# pragma weak dl_iterate_phdr
EXTERN_C_END
# endif
STATIC int
GC_register_dynlib_callback(struct dl_phdr_info *info, size_t size, void *ptr)
{
const ElfW(Phdr) * p;
ptr_t load_ptr, my_start, my_end;
int i;
GC_ASSERT(I_HOLD_LOCK());
/* Make sure `dl_phdr_info` structure is at least as big as we need. */
if (size
< offsetof(struct dl_phdr_info, dlpi_phnum) + sizeof(info->dlpi_phnum))
return 1; /*< stop */
load_ptr = (ptr_t)info->dlpi_addr;
p = info->dlpi_phdr;
for (i = 0; i < (int)info->dlpi_phnum; i++, p++) {
if (p->p_type == PT_LOAD) {
GC_has_static_roots_func callback = GC_has_static_roots;
if ((p->p_flags & PF_W) == 0)
continue;
# ifdef CHERI_PURECAP
my_start = load_ptr + p->p_vaddr;
# else
/*
* Prevent "applying nonzero offset to null pointer" compiler warning
* as `load_ptr` could be `NULL`.
*/
my_start = (ptr_t)((GC_uintptr_t)load_ptr + p->p_vaddr);
# endif
my_end = my_start + p->p_memsz;
# ifdef CHERI_PURECAP
my_start = PTR_ALIGN_UP(my_start, ALIGNMENT);
my_end = PTR_ALIGN_DOWN(my_end, ALIGNMENT);
if (!SPANNING_CAPABILITY(load_ptr, ADDR(my_start), ADDR(my_end)))
continue;
my_start = cheri_bounds_set(my_start, (word)(my_end - my_start));
# endif
if (callback != 0 && !callback(info->dlpi_name, my_start, p->p_memsz))
continue;
# ifdef PT_GNU_RELRO
# if CPP_PTRSZ >= 64 && !defined(CHERI_PURECAP)
/*
* TODO: `GC_push_all` eventually does the correct rounding to the
* next multiple of `ALIGNMENT`, so, most probably, we should remove
* the corresponding assertion check in `GC_add_roots_inner` along
* with this code line. `my_start` value may require aligning.
*/
my_start = PTR_ALIGN_DOWN(my_start, ALIGNMENT);
# endif
if (GC_n_load_segs >= MAX_LOAD_SEGS) {
if (!GC_load_segs_overflow_warned) {
WARN("Too many PT_LOAD segments; registering as roots directly...\n",
0);
GC_load_segs_overflow_warned = TRUE;
}
GC_add_roots_inner(my_start, my_end, TRUE);
} else {
GC_load_segs[GC_n_load_segs].start = my_start;
GC_load_segs[GC_n_load_segs].end = my_end;
GC_load_segs[GC_n_load_segs].start2 = NULL;
GC_load_segs[GC_n_load_segs].end2 = NULL;
++GC_n_load_segs;
}
# else
GC_add_roots_inner(my_start, my_end, TRUE);
# endif /* !PT_GNU_RELRO */
}
}
# ifdef PT_GNU_RELRO
p = info->dlpi_phdr;
for (i = 0; i < (int)info->dlpi_phnum; i++, p++) {
if (p->p_type == PT_GNU_RELRO) {
/*
* This entry is known to be constant and will eventually be
* remapped as read-only. However, the address range covered
* by this entry is typically a subset of a previously
* encountered `PT_LOAD` segment, so we need to exclude it.
*/
size_t j;
# ifdef CHERI_PURECAP
my_start = load_ptr + p->p_vaddr;
# else
my_start = (ptr_t)((GC_uintptr_t)load_ptr + p->p_vaddr);
# endif
my_end = my_start + p->p_memsz;
for (j = GC_n_load_segs; j > 0;) {
j--;
if (ADDR_INSIDE(my_start, GC_load_segs[j].start,
GC_load_segs[j].end)) {
if (GC_load_segs[j].start2 != NULL) {
WARN("More than one GNU_RELRO segment per load one\n", 0);
} else {
GC_ASSERT(ADDR_GE(PTR_ALIGN_UP(GC_load_segs[j].end, GC_page_size),
my_end));
/* Remove it from the existing load segment. */
GC_load_segs[j].end2 = GC_load_segs[j].end;
GC_load_segs[j].end = my_start;
GC_load_segs[j].start2 = my_end;
/*
* Note that `start2` may be greater than `end2` because of
* `p->p_memsz` value is multiple of page size.
*/
}
break;
}
if (0 == j && 0 == GC_has_static_roots)
WARN("Failed to find PT_GNU_RELRO segment inside PT_LOAD region\n",
0);
/*
* No warning reported in case of the callback is present because
* most likely the segment has been excluded.
*/
}
}
}
# endif /* PT_GNU_RELRO */
/* Signal that we were called. */
*(int *)ptr = 1;
return 0;
}
GC_INNER GC_bool
GC_register_main_static_data(void)
{
# if defined(DL_ITERATE_PHDR_STRONG) && !defined(CPPCHECK)
/*
* If `dl_iterate_phdr` is not a weak symbol, then do not test against
* zero (otherwise a compiler might issue a warning).
*/
return FALSE;
# else
return 0 == COVERT_DATAFLOW(ADDR(dl_iterate_phdr));
# endif
}
# define HAVE_REGISTER_MAIN_STATIC_DATA
/*
* Return `TRUE` if we succeed; return `FALSE` if `dl_iterate_phdr` was
* not there.
*/
STATIC GC_bool
GC_register_dynamic_libraries_dl_iterate_phdr(void)
{
int did_something;
GC_ASSERT(I_HOLD_LOCK());
if (GC_register_main_static_data())
return FALSE;
# ifdef PT_GNU_RELRO
GC_n_load_segs = 0;
GC_load_segs_overflow_warned = FALSE;
# endif
did_something = 0;
dl_iterate_phdr(GC_register_dynlib_callback, &did_something);
if (did_something) {
# ifdef PT_GNU_RELRO
size_t i;
for (i = 0; i < GC_n_load_segs; ++i) {
if (ADDR_LT(GC_load_segs[i].start, GC_load_segs[i].end))
GC_add_roots_inner(GC_load_segs[i].start, GC_load_segs[i].end, TRUE);
if (ADDR_LT(GC_load_segs[i].start2, GC_load_segs[i].end2))
GC_add_roots_inner(GC_load_segs[i].start2, GC_load_segs[i].end2, TRUE);
}
# endif
} else {
ptr_t datastart, dataend;
# ifdef DATASTART_USES_XGETDATASTART
static ptr_t datastart_cached = MAKE_CPTR(GC_WORD_MAX);
/* Evaluate `DATASTART` only once. */
if (ADDR(datastart_cached) == GC_WORD_MAX) {
datastart_cached = DATASTART;
}
datastart = datastart_cached;
# else
datastart = DATASTART;
# endif
# ifdef DATAEND_IS_FUNC
{
static ptr_t dataend_cached = NULL;
/* Evaluate `DATAEND` only once. */
if (NULL == dataend_cached) {
dataend_cached = DATAEND;
}
dataend = dataend_cached;
}
# else
dataend = DATAEND;
# endif
if (NULL == *(char *volatile *)&datastart || ADDR_LT(dataend, datastart))
ABORT_ARG2("Wrong DATASTART/END pair", ": %p .. %p", (void *)datastart,
(void *)dataend);
/*
* `dl_iterate_phdr` may forget the static data segment in
* statically linked executables.
*/
GC_add_roots_inner(datastart, dataend, TRUE);
# ifdef GC_HAVE_DATAREGION2
/* Subtract one to check also for `NULL` without a compiler warning. */
if (ADDR(DATASTART2) - 1U >= ADDR(DATAEND2)) {
ABORT_ARG2("Wrong DATASTART/END2 pair", ": %p .. %p", (void *)DATASTART2,
(void *)DATAEND2);
}
GC_add_roots_inner(DATASTART2, DATAEND2, TRUE);
# endif
}
return TRUE;
}
# else /* !HAVE_DL_ITERATE_PHDR */
# if defined(NETBSD) || defined(OPENBSD)
# include <sys/exec_elf.h>
/* For compatibility with 1.4.x. */
# ifndef DT_DEBUG
# define DT_DEBUG 21
# endif
# ifndef PT_LOAD
# define PT_LOAD 1
# endif
# ifndef PF_W
# define PF_W 2
# endif
# elif !defined(HOST_ANDROID)
# include <elf.h>
# endif
# ifndef HOST_ANDROID
# include <link.h>
# endif
# endif /* !HAVE_DL_ITERATE_PHDR */
EXTERN_C_BEGIN
# if defined(__GNUC__) && !defined(SOLARISDL)
# pragma weak _DYNAMIC
# endif
extern ElfW(Dyn) _DYNAMIC[];
EXTERN_C_END
/*
* This does not necessarily work in all cases, e.g. with preloaded
* dynamic libraries.
*/
STATIC struct link_map *
GC_FirstDLOpenedLinkMap(void)
{
static struct link_map *cachedResult = NULL;
# ifdef SUNOS53_SHARED_LIB
/*
* BTL: Avoid the Solaris 5.3 `ld.so` bug that `_DYNAMIC` is not being
* setup properly in dynamically linked library file. This means we
* have to use its value in the set of original object files loaded at
* the program startup.
*/
static ElfW(Dyn) *dynStructureAddr = NULL;
if (NULL == dynStructureAddr) {
void *startupSyms = dlopen(NULL, RTLD_LAZY);
dynStructureAddr = (ElfW(Dyn) *)dlsym(startupSyms, "_DYNAMIC");
/* Note: `dlclose()` is not called intentionally. */
if (NULL == dynStructureAddr) {
/* `_DYNAMIC` symbol is not resolved. */
return NULL;
}
}
# else
if (0 == COVERT_DATAFLOW(ADDR(_DYNAMIC))) {
/* `_DYNAMIC` symbol is not resolved. */
return NULL;
}
# endif
if (NULL == cachedResult) {
# if defined(NETBSD) && defined(RTLD_DI_LINKMAP)
struct link_map *lm = NULL;
if (!dlinfo(RTLD_SELF, RTLD_DI_LINKMAP, &lm) && lm != NULL) {
/*
* Now `lm` points `link_map` object of the collector.
* Since it might not be the first dynamically linked object,
* try to find it (object next to the main object).
*/
while (lm->l_prev != NULL) {
lm = lm->l_prev;
}
cachedResult = lm->l_next;
}
# else
ElfW(Dyn) * dp;
int tag;
for (dp = _DYNAMIC; (tag = dp->d_tag) != 0; dp++) {
if (tag == DT_DEBUG) {
const struct r_debug *rd
= CAST_THRU_UINTPTR(struct r_debug *, dp->d_un.d_ptr);
/* `d_ptr` could be `NULL` if libs are linked statically. */
if (rd != NULL) {
const struct link_map *lm = rd->r_map;
# if defined(CPPCHECK) && defined(LINK_MAP_R_DEBUG_DEFINED)
GC_noop1((word)rd->r_version);
# endif
if (lm != NULL) {
cachedResult = lm->l_next;
/* Might be `NULL`. */
}
}
break;
}
}
# endif
}
return cachedResult;
}
GC_INNER void
GC_register_dynamic_libraries(void)
{
struct link_map *lm;
GC_ASSERT(I_HOLD_LOCK());
# ifdef HAVE_DL_ITERATE_PHDR
if (GC_register_dynamic_libraries_dl_iterate_phdr()) {
return;
}
# endif
for (lm = GC_FirstDLOpenedLinkMap(); lm != NULL; lm = lm->l_next) {
const ElfW(Ehdr) * e;
const ElfW(Phdr) * p;
ptr_t load_ptr = (ptr_t)lm->l_addr;
size_t i;
# ifdef HOST_ANDROID
if (NULL == load_ptr)
continue;
# endif
e = (ElfW(Ehdr) *)load_ptr;
p = (ElfW(Phdr) *)(load_ptr + e->e_phoff);
# ifdef LINT2
/* Workaround tainted e->e_phnum usage as a loop boundary. */
GC_noop1_ptr((/* no const */ void *)&e->e_phnum);
# endif
for (i = 0; i < (size_t)e->e_phnum; i++, p++) {
ptr_t start;
switch (p->p_type) {
case PT_LOAD:
if ((p->p_flags & PF_W) == 0)
break;
start = load_ptr + p->p_vaddr;
GC_add_roots_inner(start, start + p->p_memsz, TRUE);
break;
default:
break;
}
}
# if defined(CPPCHECK) && defined(LINK_MAP_R_DEBUG_DEFINED)
GC_noop1_ptr(lm->l_name);
GC_noop1((word)lm->l_ld);
GC_noop1_ptr(lm->l_prev);
# endif
}
}
# endif /* !USE_PROC_FOR_LIBRARIES */
# endif /* UNIX_GENERIC_DYNAMIC_LOADING */
# if defined(USE_PROC_FOR_LIBRARIES) && !defined(LINUX) || defined(IRIX5)
# include <elf.h>
# include <errno.h>
# include <fcntl.h>
# include <sys/procfs.h>
# include <sys/stat.h>
/* This is included only for the following test. */
# include <signal.h>
# ifndef _sigargs
# define IRIX6
# endif
GC_INNER void
GC_register_dynamic_libraries(void)
{
/*
* We use `/proc` to track down all parts of the address space that
* are mapped by the process, and throw out regions we know we should
* not worry about. This may also work under other SVR4 variants.
*/
static int fd = -1;
static prmap_t *addr_map = NULL;
/* Number of records currently in `addr_map`. */
static int current_sz = 0;
char buf[6 + 20 + 1];
/* Required size of `addr_map`. */
int needed_sz = 0;
int i;
long flags;
ptr_t start;
ptr_t limit;
word heap_start = HEAP_START;
word heap_end = heap_start;
# ifdef SOLARISDL
# define MA_FETCHOP 0
# define MA_NOTCACHED 0
# define MA_PHYS 0
# endif
GC_ASSERT(I_HOLD_LOCK());
if (fd < 0) {
GC_snprintf_s_ld_s(buf, sizeof(buf), "/proc/", (long)getpid(), "");
fd = open(buf, O_RDONLY);
if (fd < 0) {
ABORT("/proc open failed");
}
}
if (ioctl(fd, PIOCNMAP, &needed_sz) < 0) {
ABORT_ARG2("/proc PIOCNMAP ioctl failed", ": fd= %d, errno= %d", fd,
errno);
}
if (needed_sz >= current_sz) {
GC_scratch_recycle_no_gww(addr_map, (size_t)current_sz * sizeof(prmap_t));
/* Expansion, plus room for record 0. */
current_sz = needed_sz * 2 + 1;
addr_map
= (prmap_t *)GC_scratch_alloc((size_t)current_sz * sizeof(prmap_t));
if (NULL == addr_map)
ABORT("Insufficient memory for address map");