-
Notifications
You must be signed in to change notification settings - Fork 2
/
libmtrace.c
1259 lines (1025 loc) · 27.1 KB
/
libmtrace.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
/*
* Copyright (C) 2017 Sergey Senozhatsky
*
* 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 2 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 St, Fifth Floor, Boston, MA
* 02110-1301 USA
*/
#ifndef _GNU_SOURCE
#define _GNU_SOURCE
#endif
#include <dlfcn.h>
#include <stddef.h>
#include <stdio.h>
#include <stdlib.h>
#include <malloc.h>
#include <string.h>
#include <sys/types.h>
#include <sys/mman.h>
#include <unistd.h>
#include <sys/types.h>
#include <errno.h>
#include <fcntl.h>
#include <signal.h>
#include <pthread.h>
#include <limits.h>
#ifndef UNW_LOCAL_ONLY
#define UNW_LOCAL_ONLY
#endif
#include <libunwind.h>
#include "config.h"
#include <output.h>
#include <symbol_lookup.h>
#include <unwind_trace.h>
#include <options.h>
#include <maps_cache.h>
#include <event_names.h>
static struct options opts;
static int global_init_done;
static volatile __thread int __tf_depth;
static size_t __init_buffer_offset;
static char __init_buffer[INIT_BUF_SZ];
static int page_size = DEFAULT_PAGE_SIZE;
static int phys_page_size = DEFAULT_PAGE_SIZE;
static void * (*glibc_malloc)(size_t) = malloc;
static void * (*glibc_calloc)(size_t, size_t) = calloc;
static void * (*glibc_realloc)(void *, size_t) = realloc;
static void (*glibc_free)(void *) = free;
#ifdef HAVE_CFREE
static void (*glibc_cfree)(void *) = cfree;
#endif
static void * (*glibc_memalign)(size_t, size_t) = memalign;
#ifdef HAVE_VALLOC
static void * (*glibc_valloc)(size_t) = valloc;
#endif
#ifdef HAVE_PVALLOC
static void * (*glibc_pvalloc)(size_t) = pvalloc;
#endif
#ifdef HAVE_MEMMOVE
static void * (*glibc_memmove)(void *, const void *, size_t) = memmove;
#endif
#ifdef HAVE_MEMSET
static void * (*glibc_memset)(void *, int, size_t) = memset;
#endif
#ifdef HAVE_POSIX_MEMALIGN
static int (*glibc_posix_memalign)(void **, size_t, size_t) = posix_memalign;
#endif
#ifdef HAVE_ALIGNED_ALLOC
static void *(*glibc_aligned_alloc)(size_t, size_t) = aligned_alloc;
#endif
#ifndef __USE_FILE_OFFSET64
static void * (*glibc_mmap)(void *, size_t, int, int,
int, off_t) = mmap;
#else
static void * (*glibc_mmap)(void *, size_t, int, int,
int, off64_t) = mmap;
#endif
static int (*glibc_munmap)(void *, size_t) = munmap;
#ifdef HAVE_MMAP2
static void * (*glibc_mmap2)(void *, size_t, int, int,
int, off_t) = mmap2;
#endif
static int (*glibc_mlock)(const void *, size_t) = mlock;
static int (*glibc_munlock)(const void *, size_t) = munlock;
static int (*glibc_mlockall)(int) = mlockall;
static int (*glibc_munlockall)(void) = munlockall;
static char * (*glibc_getenv)(const char *) = getenv;
static int (*glibc_dlclose)(void *) = dlclose;
static void __init_mtrace(void);
#define TRACING_DISABLE() __tf_depth++;
#define TRACING_ENABLE() __tf_depth--;
static pthread_mutex_t lock = PTHREAD_MUTEX_INITIALIZER;
static unsigned long alloc_min_wmark = 0;
static unsigned long alloc_max_wmark = ULONG_MAX;
static unsigned long memparse(const char *mem)
{
char *end;
unsigned long ret = strtoul(mem, &end, 10);
switch (*end) {
case 'G':
case 'g':
ret <<= 10;
case 'M':
case 'm':
ret <<= 10;
case 'K':
case 'k':
ret <<= 10;
default:
break;
}
return ret;
}
/*
* We need to serialize events that update/change RSS in /proc/self/statm.
*
* only in OPTS_MEM_GROW_MODE mode, because otherwise we don't care about
* RSS value.
*/
static void lock_tracer()
{
if (!(opts.flags & OPTS_MEM_GROW_MODE))
return;
if (pthread_mutex_lock(&lock))
abort();
}
static void unlock_tracer()
{
if (!(opts.flags & OPTS_MEM_GROW_MODE))
return;
pthread_mutex_unlock(&lock);
}
#ifdef HAVE_ATOMIC_BACKTRACE
static __thread sigset_t old_sigset;
static __thread sigset_t new_sigset;
static void __block_all_signals(void)
{
sigfillset(&new_sigset);
if (sigprocmask(SIG_BLOCK, &new_sigset, &old_sigset) != 0) {
fprintf(stderr, "ERROR: unable to block signals\n");
abort();
}
}
static void __restore_all_signals(void)
{
if (sigprocmask(SIG_SETMASK, &old_sigset, NULL) != 0)
abort();
}
#else /* HAVE_ATOMIC_BACKTRACE */
static void __block_all_signals(void)
{
}
static void __restore_all_signals(void)
{
}
#endif /* HAVE_ATOMIC_BACKTRACE */
static const char *event_name(int type)
{
if (type >= EVENT_MAX)
return "ERROR";
if (opts.flags & OPTS_HUMAN_READABLE)
return event_names[type].human_name;
return event_names[type].compact_name;
}
static unsigned long get_memsize(void)
{
/*
/proc/[pid]/statm
Provides information about memory usage, measured in pages.
The columns are:
size (1) total program size
(same as VmSize in /proc/[pid]/status)
resident (2) resident set size
(same as VmRSS in /proc/[pid]/status)
shared (3) number of resident shared pages (i.e., backed by a file)
(same as RssFile+RssShmem in /proc/[pid]/status)
text (4) text (code)
lib (5) library (unused since Linux 2.6; always 0)
data (6) data + stack
dt (7) dirty pages (unused since Linux 2.6; always 0)
*/
/* VSZ RSS */
unsigned long mem[2] = {0, 0};
char buf[64];
int fd = open("/proc/self/statm", O_RDONLY);
if (fd < 0)
return 0;
memset(buf, 0x00, sizeof(buf));
if (read(fd, buf, sizeof(buf)) >= sizeof(mem))
sscanf(buf, "%lu %lu", &mem[0], &mem[1]);
close(fd);
/* return RSS. in page_size units */
return mem[1];
}
/*
https://sourceware.org/ml/libc-help/2009-06/msg00001.html
:You really cannot count upon the execution order of constructors across
:compilation units. All that is guaranteed is that within one compilation
:unit (one source file) the constructors will execute in order. When you
:are dealing with more than one compilation unit - all bets are off: all
:that is guaranteed is that all static constructors will be called before
:main is called, but in what order? No guarantees.
:
:As for the idea of "any ctor like function in a module will be called
:before any functions in the module are called" - how do you expect that
:could work? What if a file defines 2 ctor functions, the first of which
:calls a function within the file? How, then, can both ctor functions be
:called before the call of the normal function, when it is the first ctor
:that calls the function?
in practice this gives a really confusing behavior. for example:
Program terminated with signal SIGABRT, Aborted.
0xb2951878 in raise () from /lib/libc.so.6
0xb2952d3c in abort () from /lib/libc.so.6
0xb65a3a64 in mmap (__addr=<optimized out>, __len=<optimized out>,
__prot=<optimized out>, __flags=2, __fd=4, __offset=0) at libmtrace.c:445
0xb2722882 in buffer_create () from /lib/libtzplatform-config-2.0.so.2
0xb2723b6e in initialize () from /lib/libtzplatform-config-2.0.so.2
0xb2723ed0 in _context_getenv_tzplatform_ ()
from /lib/libtzplatform-config-2.0.so.2
0xae9a6060 in _GLOBAL__sub_I_TldExtractor.cpp ()
from /lib/libwbs_common.so.0
0xb67c571c in call_init.part () from /lib/ld-linux.so.3
so we have libmtrace.so loaded and glibc functions are getting redirected
through the libmtrace lib. however, libmtrace constructor is not called
yet. instead we have a constructor of other ELF that is being executed
before us, resulting in mmap() at some, when we still didn't have a
chance to init libmtrace.
*/
static void __init(void)
{
if (!global_init_done) {
__block_all_signals();
if (!__tf_depth) {
TRACING_DISABLE();
__init_mtrace();
TRACING_ENABLE();
}
__restore_all_signals();
}
}
static int event_start_frame(void)
{
volatile int start;
TRACING_DISABLE();
start = __tf_depth - 1;
if (start == 0) {
__block_all_signals();
output_event_pid();
output_event_timestamp();
}
return start == 0;
}
static int is_event_top_frame(void)
{
return __tf_depth == 1;
}
static int event_end_frame(void)
{
if (is_event_top_frame()) {
__restore_all_signals();
output_commit(&opts);
}
TRACING_ENABLE();
}
static int can_backtrace(size_t __size, int type)
{
if (opts.flags & OPTS_ALLOC_WMARK) {
if (type > MAX_STATS)
return 0;
return alloc_min_wmark <= __size &&
__size <= alloc_max_wmark;
}
if (opts.flags & OPTS_MEM_GROW_MODE) {
unsigned long __memsz;
unsigned long __old_memsz;
__memsz = get_memsize();
if (__memsz == 0)
return 0;
__old_memsz = opts.stats[type];
/* always update stats */
opts.stats[type] = __memsz;
if (type > MAX_STATS)
return 0;
if (type == STATS_MMAP_SZ || __memsz > __old_memsz) {
output("[m:%ld-%ld]\n",
__old_memsz * page_size,
__memsz * page_size);
return 1;
}
return 0;
}
if (opts.flags & OPTS_FULL_REPORT_MODE)
return 1;
if (opts.flags & OPTS_ALLOC_ONLY_MODE) {
if (type == STATS_MALLOC_SZ || type == STATS_MMAP_SZ)
return 1;
return 0;
}
if (opts.flags & OPTS_ALLOC_TOP_MODE) {
if (type > MAX_STATS)
return 0;
if (__size > opts.stats[type]) {
opts.stats[type] = __size;
return 1;
}
return 0;
}
return 0;
}
static void *__init_alloc(size_t __size, size_t __alignment)
{
size_t prev_offset = __init_buffer_offset;
__size = ALIGN(__size, __alignment);
__init_buffer_offset += __size;
if (__init_buffer_offset >= sizeof(__init_buffer)) {
fprintf(stderr, "ERROR: init buf size exhausted: "
"%zu requested, %zu available\n",
__init_buffer_offset, sizeof(__init_buffer));
abort();
}
return __init_buffer + prev_offset;
}
/*
* Force page-faults
*/
static void *__init_memset(void *__s, int __c, size_t __n)
{
volatile char *____s = __s;
volatile int i;
for (i = 0 ; i < __n; i++)
____s[i] = 0x00;
return (void *)____s;
}
static void __init_free(void *ptr)
{
/* do nothing here */
}
static void *forced_pgfault(void *__s, size_t __n)
{
if (!(opts.flags & OPTS_MEM_GROW_MODE))
return __s;
if (!__s)
return __s;
return __init_memset(__s, 0x00, __n);
}
/* Allocate SIZE bytes of memory. */
void *malloc(size_t __size)
{
void *ret;
__init();
if (!global_init_done)
return __init_alloc(__size, MIN_ALIGNMENT);
if (event_start_frame()) {
lock_tracer();
output("%s(%lu)", event_name(EVENT_MALLOC), __size);
}
ret = glibc_malloc(__size);
forced_pgfault(ret, __size);
if (is_event_top_frame()) {
int trace;
output("=0x%x\n", ret);
trace = can_backtrace(__size, STATS_MALLOC_SZ);
unlock_tracer();
if (trace)
unwind_trace(&opts);
}
event_end_frame();
return ret;
}
/* Allocate NMEMB elements of SIZE bytes each, all initialized to 0. */
void *calloc(size_t __nmemb, size_t __size)
{
void *ret;
__init();
if (!global_init_done)
return __init_alloc(__nmemb * __size, MIN_ALIGNMENT);
if (event_start_frame()) {
lock_tracer();
output("%s(%lu, %lu)",
event_name(EVENT_CALLOC),
__nmemb,
__size);
}
ret = glibc_calloc(__nmemb, __size);
forced_pgfault(ret, __nmemb * __size);
if (is_event_top_frame()) {
int trace;
output("=0x%x\n", ret);
trace = can_backtrace(__size * __nmemb, STATS_MALLOC_SZ);
unlock_tracer();
if (trace)
unwind_trace(&opts);
}
event_end_frame();
return ret;
}
/* Re-allocate the previously allocated block in __ptr, making the new
block SIZE bytes long. */
void *realloc(void *__ptr, size_t __size)
{
void *ret;
if (!global_init_done) {
__init_free(__ptr);
return __init_alloc(__size, MIN_ALIGNMENT);
}
if (event_start_frame()) {
lock_tracer();
output("%s(0x%x, %lu)",
event_name(EVENT_REALLOC),
__ptr,
__size);
}
ret = glibc_realloc(__ptr, __size);
if (is_event_top_frame()) {
int trace;
output("=0x%x\n", ret);
trace = can_backtrace(__size, STATS_MALLOC_SZ);
unlock_tracer();
if (trace)
unwind_trace(&opts);
}
event_end_frame();
return ret;
}
/* Free a block allocated by `malloc', `realloc' or `calloc'. */
void free(void *__ptr)
{
if (!global_init_done) {
__init_free(__ptr);
return;
}
if (event_start_frame()) {
lock_tracer();
output("%s(0x%x)\n", event_name(EVENT_FREE), __ptr);
}
glibc_free(__ptr);
if (is_event_top_frame()) {
int trace = can_backtrace(0, STATS_FREE);
unlock_tracer();
if (trace)
unwind_trace(&opts);
}
event_end_frame();
}
#ifdef HAVE_CFREE
/* Free a block allocated by `calloc'. */
void cfree(void *__ptr)
{
if (!global_init_done) {
__init_free(__ptr);
return;
}
if (event_start_frame()) {
lock_tracer();
output("%s(0x%x)\n", event_name(EVENT_CFREE), __ptr);
}
glibc_cfree(__ptr);
if (is_event_top_frame()) {
int trace = can_backtrace(0, STATS_FREE);
unlock_tracer();
if (trace)
unwind_trace(&opts);
}
event_end_frame();
}
#endif
/* Allocate SIZE bytes allocated to ALIGNMENT bytes. */
void *memalign(size_t __alignment, size_t __size)
{
void *ret;
__init();
if (!global_init_done)
return __init_alloc(__size, __alignment);
if (event_start_frame()) {
lock_tracer();
output("%s(%lu, %lu)", event_name(EVENT_MEMALIGN),
__alignment, __size);
}
ret = glibc_memalign(__alignment, __size);
forced_pgfault(ret, ALIGN(__size, __alignment));
if (is_event_top_frame()) {
int trace;
output("=0x%x\n", ret);
trace = can_backtrace(ALIGN(__size, __alignment),
STATS_MALLOC_SZ);
unlock_tracer();
if (trace)
unwind_trace(&opts);
}
event_end_frame();
return ret;
}
#ifdef HAVE_POSIX_MEMALIGN
int posix_memalign(void **__memptr, size_t __alignment, size_t __size)
{
int ret;
__init();
if (!global_init_done) {
*__memptr = __init_alloc(__size, __alignment);
return 0;
}
if (event_start_frame()) {
lock_tracer();
output("%s(%lu, %lu)", event_name(EVENT_POSIX_MEMALIGN),
__alignment, __size);
}
ret = glibc_posix_memalign(__memptr, __alignment, __size);
forced_pgfault(*__memptr, ALIGN(__size, __alignment));
if (is_event_top_frame()) {
int trace;
output("=0x%x\n", *__memptr);
trace = can_backtrace(ALIGN(__size, __alignment),
STATS_MALLOC_SZ);
unlock_tracer();
if (trace)
unwind_trace(&opts);
}
event_end_frame();
return ret;
}
#endif
#ifdef HAVE_ALIGNED_ALLOC
void *aligned_alloc(size_t __alignment, size_t __size)
{
void *ret;
__init();
if (!global_init_done)
return __init_alloc(__size, __alignment);
if (event_start_frame()) {
lock_tracer();
output("%s(%lu, %lu)", event_name(EVENT_ALIGNED_ALLOC),
__alignment, __size);
}
ret = glibc_aligned_alloc(__alignment, __size);
forced_pgfault(ret, ALIGN(__size, __alignment));
if (is_event_top_frame()) {
int trace;
output("=0x%x\n", ret);
trace = can_backtrace(ALIGN(__size, __alignment),
STATS_MALLOC_SZ);
unlock_tracer();
if (trace)
unwind_trace(&opts);
}
event_end_frame();
return ret;
}
#endif
#ifdef HAVE_VALLOC
/* Allocate SIZE bytes on a page boundary. */
void *valloc(size_t __size)
{
void *ret;
__init();
if (!global_init_done)
return __init_alloc(__size, page_size);
if (event_start_frame()) {
lock_tracer();
output("%s(%lu)", event_name(EVENT_VALLOC), __size);
}
ret = glibc_valloc(__size);
forced_pgfault(ret, ALIGN(__size, page_size));
if (is_event_top_frame()) {
int trace;
output("=0x%x\n", ret);
trace = can_backtrace(ALIGN(__size, page_size),
STATS_MALLOC_SZ);
unlock_tracer();
if (trace)
unwind_trace(&opts);
}
event_end_frame();
return ret;
}
#endif
#ifdef HAVE_PVALLOC
/* Equivalent to valloc(minimum-page-that-holds(n)), that is, round up
__size to nearest pagesize. */
void *pvalloc(size_t __size)
{
void *ret;
__init();
if (!global_init_done)
return __init_alloc(__size, phys_page_size);
if (event_start_frame()) {
lock_tracer();
output("%s(%lu)", event_name(EVENT_PVALLOC), __size);
}
ret = glibc_pvalloc(__size);
forced_pgfault(ret, ALIGN(__size, phys_page_size));
if (is_event_top_frame()) {
int trace;
output("=0x%x\n", ret);
trace = can_backtrace(ALIGN(__size, phys_page_size),
STATS_MALLOC_SZ);
unlock_tracer();
if (trace)
unwind_trace(&opts);
}
event_end_frame();
return ret;
}
#endif
#ifdef HAVE_MEMSET
/* Set N bytes of S to C. */
void *memset(void *__s, int __c, size_t __n)
{
void *ret;
/*
* We can't __init() here. Need to do memset() manually.
*/
if (!global_init_done)
return __init_memset(__s, __c, __n);
if (event_start_frame()) {
lock_tracer();
output("%s(0x%x, %d, %lu)",
event_name(EVENT_MEMSET),
__s,
__c,
__n);
}
ret = glibc_memset(__s, __c, __n);
if (is_event_top_frame()) {
int trace;
output("=0x%x\n", ret);
trace = can_backtrace(__n, STATS_MALLOC_SZ);
unlock_tracer();
if (trace)
unwind_trace(&opts);
}
event_end_frame();
return ret;
}
#endif
#ifdef HAVE_MEMMOVE
/* Copy N bytes of SRC to DEST, guaranteeing
correct behavior for overlapping strings. */
void *memmove(void *__dest, const void *__src, size_t __n)
{
void *ret;
__init();
if (event_start_frame()) {
output("%s(0x%x, 0x%x, %lu)",
event_name(EVENT_MEMMOVE),
__dest,
__src,
__n);
}
ret = glibc_memmove(__dest, __src, __n);
if (is_event_top_frame()) {
output("=0x%x\n", ret);
if (can_backtrace(0, STATS_AUX))
unwind_trace(&opts);
}
event_end_frame();
return ret;
}
#endif
/* Map addresses starting near ADDR and extending for LEN bytes. from
OFFSET into the file FD describes according to PROT and FLAGS. If ADDR
is nonzero, it is the desired mapping address. If the MAP_FIXED bit is
set in FLAGS, the mapping will be at ADDR exactly (which must be
page-aligned); otherwise the system chooses a convenient nearby address.
The return value is the actual mapping address chosen or MAP_FAILED
for errors (in which case `errno' is set). A successful `mmap' call
deallocates any previous mapping for the affected region. */
#ifndef __USE_FILE_OFFSET64
void *mmap(void *__addr, size_t __len, int __prot,
int __flags, int __fd, __off_t __offset)
{
void *ret;
__init();
if (!global_init_done)
abort();
if (event_start_frame()) {
lock_tracer();
output("%s(0x%x, %lu, %d, %d, %d, %lu)",
event_name(EVENT_MMAP),
__addr, __len, __prot, __flags,
__fd, __offset);
}
ret = glibc_mmap(__addr, __len, __prot, __flags, __fd, __offset);
if (__prot & PROT_EXEC)
maps_cache_deferred_flush();
if (is_event_top_frame()) {
int trace;
output("=0x%x\n", ret);
trace = can_backtrace(__len, STATS_MMAP_SZ);
unlock_tracer();
if (trace)
unwind_trace(&opts);
}
event_end_frame();
return ret;
}
#else
void *mmap(void *__addr, size_t __len, int __prot,
int __flags, int __fd, __off64_t __offset)
{
void *ret;
__init();
if (!global_init_done)
abort();
if (event_start_frame()) {
lock_tracer();
output("%s(0x%x, %lu, %d, %d, %d, %llu)",
event_name(EVENT_MMAP),
__addr, __len, __prot, __flags,
__fd, __offset);
}
ret = glibc_mmap(__addr, __len, __prot, __flags, __fd, __offset);
if (__prot & PROT_EXEC)
maps_cache_deferred_flush();
if (is_event_top_frame()) {
int trace;
output("=0x%x\n", ret);
trace = can_backtrace(__len, STATS_MMAP_SZ);
unlock_tracer();
if (trace)
unwind_trace(&opts);
}
event_end_frame();
return ret;
}
#endif
/* Deallocate any mapping for the region starting at ADDR and extending LEN
bytes. Returns 0 if successful, -1 for errors (and sets errno). */
int munmap(void *__addr, size_t __len)
{
int ret;
if (!global_init_done)
abort();
if (event_start_frame()) {
lock_tracer();
output("%s(0x%x, %lu)",
event_name(EVENT_MUNMAP),
__addr,
__len);
}
ret = glibc_munmap(__addr, __len);
if (is_event_top_frame()) {
int trace;
output("=%d\n", ret);
trace = can_backtrace(0, STATS_FREE);
unlock_tracer();
if (trace)
unwind_trace(&opts);
}
event_end_frame();
return ret;
}
#ifdef HAVE_MMAP2
void *mmap2(void *__addr, size_t __len, int __prot,
int __flags, int __fd, off_t __offset)
{
void *ret;
__init();
if (!global_init_done)
abort();
if (event_start_frame()) {
lock_tracer();
output("%s(0x%x, %lu, %d, %d, %d, %llu)",
event_name(EVENT_MMAP2),
__addr, __len, __prot, __flags,
__fd, __offset);
}
ret = glibc_mmap2(__addr, __len, __prot, __flags, __fd, __offset);
if (__prot & PROT_EXEC)
maps_cache_deferred_flush();
if (is_event_top_frame()) {
int trace;
output("=0x%x\n", ret);
trace = can_backtrace(__len, STATS_MMAP_SZ);
unlock_tracer();
if (trace)
unwind_trace(&opts);
}
event_end_frame();
return ret;
}
#endif
/* Guarantee all whole pages mapped by the range [ADDR,ADDR+LEN) to
be memory resident. */
int mlock(const void *__addr, size_t __len)
{
int ret;
__init();
if (!global_init_done)
abort();
if (event_start_frame()) {
output("%s(0x%x, %lu)",
event_name(EVENT_MLOCK),
__addr,
__len);
}
ret = glibc_mlock(__addr, __len);
if (is_event_top_frame()) {
output("=%d\n", ret);
if (can_backtrace(__len, STATS_MLOCK))
unwind_trace(&opts);
}
event_end_frame();
return ret;
}