-
Notifications
You must be signed in to change notification settings - Fork 0
/
Copy pathquickstack2.cc
1505 lines (1402 loc) · 41.6 KB
/
quickstack2.cc
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
// external libraries
// BFD requires that these are defined before inclusion
#define PACKAGE 1
#define PACKAGE_VERSION 1
// From binutils/include/demangle.h
#define DMGL_PARAMS (1 << 0) /* Include function args */
#define DMGL_ANSI (1 << 1) /* Include const, volatile, etc */
#define DMGL_VERBOSE (1 << 3) /* Include implementation details. */
#define DMGL_TYPES (1 << 4) /* Also try to demangle type encodings. */
#include <bfd.h> // bfd_get_symbol_info(), bfd_get_section_by_name()
#include <libelf.h> // Elf, elf_version()
// LIBC
#include <sys/mman.h> // mmap, PROT_READ, PROT_WRITE
#include <sys/ptrace.h> // ptrace()
#include <sys/user.h> // user_regs_struct
#include <sys/wait.h> // waitpid()
#include <sys/stat.h> // stat, stat()
#include <sys/time.h> // gettimeofday()
#include <unistd.h> // fork()
#include <dirent.h> // opendir(), readdir(), closedir()
#include <getopt.h> // no_argument, required_argument, getopt_long()
// C and C++
#include <stdarg.h>
#include <stdlib.h>
#include <stdio.h>
#include <string.h>
#include <algorithm>
#include <array>
#include <cassert>
#include <chrono>
#include <cstring>
#include <sstream>
#include <thread>
#include "quickstack2.h"
#if defined(__i386__)
#define STACK_IP eip
#define STACK_SP esp
#elif defined(__x86_64__)
#define STACK_IP rip
#define STACK_SP rsp
#else
#error "unsupported cpu arch"
#endif
#if !defined(__linux__)
#error "unsupported os"
#endif
// fixed parameters
const char* version = "0.10";
static const std::array<std::string, 12> basic_libs =
{{{"ld-"},
{"libaio."},
{"libc-"},
{"libm-"},
{"libdl-"},
{"libpthread-"},
{"librt-"},
{"libgcc_"},
{"libcrypt-"},
{"libnss_"},
{"libnsl_"},
{"libstdc++"}}};
constexpr std::size_t max_frame_size = 16384 * sizeof(long);
// run-time parameters
static const char* debug_dir = "/usr/lib/debug";
static int target_pid = 0;
static int debug_level = 0;
static int debug_print_time_level = 10;
static bool frame_check = false;
static int flush_log = 3;
static int timeout_seconds = 600;
static bool lock_all = false;
static int print_arg = 0;
static int single_line = 0;
static int thread_names = 0;
static int line_numbers = 0;
static int trace_multiple_procs = 0;
static bool basename_only = false;
static int max_ptrace_calls = 1000;
// global variables
static std::array<stopper_symbol, 3> stopper_symbols = {{
{"main", 0, 0}, {"start_thread", 0, 0}, {"do_sigwait", 0, 0}}};
static int* attach_started = nullptr;
static volatile sig_atomic_t shutdown_program = 0;
static const char* stack_out;
static FILE* stack_out_fp;
void set_shutdown(int) { shutdown_program = 1; }
void init_signals() {
int signals[] = {SIGHUP, SIGINT, SIGTERM};
for (uint i = 0; i < sizeof(signals) / sizeof(int); i++)
signal(signals[i], set_shutdown);
return;
}
void ignore_signals() {
int signals[] = {SIGHUP, SIGINT, SIGTERM};
for (uint i = 0; i < sizeof(signals) / sizeof(int); i++)
signal(signals[i], SIG_IGN);
return;
}
void print_log(int level, const char* format, ...) {
if (level < debug_print_time_level) {
timeval tv;
time_t tt;
tm *tm;
gettimeofday(&tv, 0);
tt = tv.tv_sec;
tm = localtime(&tt);
fprintf(stdout,
"%04d-%02d-%02d %02d:%02d:%02d %06ld: ",
tm->tm_year + 1900,
tm->tm_mon + 1,
tm->tm_mday,
tm->tm_hour,
tm->tm_min,
tm->tm_sec,
tv.tv_usec);
} else {
fprintf(stdout, " ");
}
va_list args;
va_start(args, format);
vfprintf(stdout, format, args);
va_end(args);
fprintf(stdout, "\n");
if (flush_log >= level)
fflush(stdout);
}
void print_stack(const char* format, ...) {
va_list args;
va_start(args, format);
if (stack_out_fp) {
vfprintf(stack_out_fp, format, args);
fflush(stack_out_fp);
} else {
vfprintf(stdout, format, args);
fflush(stdout);
}
va_end(args);
}
std::string dirname(const std::string& path) {
return path.substr(0, path.find_last_of('/'));
}
std::string basename(const std::string& path) {
return path.substr(path.find_last_of('/') + 1);
}
template<std::size_t N>
bool startwith(const char* s, char const (&literal)[N])
{
const std::size_t length = std::strlen(s);
return N <= length && std::memcmp(s, literal, N-1) == 0;
}
template<std::size_t N>
bool startwith(const std::string& s, char const (&literal)[N])
{
return N <= s.size() && std::memcmp(s.data(), literal, N-1) == 0;
}
bool startwith(const std::string& fullstring, const std::string& starting) {
if (fullstring.length() >= starting.length()) {
if (!fullstring.compare(0, starting.length(), starting))
return true;
} else {
return false;
}
return false;
}
bool endwith(const std::string& fullstring, const std::string& ending) {
if (fullstring.length() >= ending.length()) {
return (0 ==
fullstring.compare(fullstring.length() - ending.length(),
ending.length(),
ending));
} else {
return false;
}
return false;
}
int is_pid_stopped(int pid) {
FILE* status_file;
char buf[100];
int retval = 0;
snprintf(buf, sizeof(buf), "/proc/%d/status", (int)pid);
status_file = fopen(buf, "r");
if (status_file != NULL) {
int have_state = 0;
while (fgets(buf, sizeof(buf), status_file)) {
buf[strlen(buf) - 1] = '\0';
if (strncmp(buf, "State:", 6) == 0) {
have_state = 1;
break;
}
}
if (have_state && strstr(buf, "T") != NULL) {
DBG(9, "Process %d %s", pid, buf);
retval = 1;
}
fclose(status_file);
}
return retval;
}
bool match_debug_file(const std::string& name, const char* file) {
std::string ptr = file;
const std::string ending = ".debug";
if (name.empty() || ptr.empty())
return false;
if (!startwith(ptr, name))
return false;
if (name.length() == ptr.length())
return true;
ptr = ptr.substr(name.length());
if (!endwith(ptr, ending))
return false;
ptr = ptr.substr(0, ptr.length() - ending.length());
char* work = (char*)ptr.c_str();
while (*work) {
if ((*work >= 0 && *work <= 9) || *work == '.')
work++;
else
return false;
}
return true;
}
int get_user_regs(int pid, user_regs_struct& regs) {
int count = 100;
while (1) {
int e = ptrace(PTRACE_GETREGS, pid, 0, ®s);
if (e != 0) {
if (errno == ESRCH && count-- > 0) {
sched_yield();
continue;
}
perror("ptrace(PTRACE_GETREGS)");
return -1;
}
break;
}
return 0;
}
char* find_debug_file(const char* stripped_file) {
std::string path;
path = debug_dir;
path += stripped_file;
std::string dirname1 = dirname(path);
std::string name = basename(path);
std::string real_debug_file;
DIR* dp = opendir(dirname1.c_str());
if (dp) {
dirent* dent;
do {
dent = readdir(dp);
if (dent) {
if (dent->d_name[0] == '.') {
continue;
}
if (match_debug_file(name, dent->d_name)) {
real_debug_file = dirname1;
real_debug_file += "/";
real_debug_file += dent->d_name;
break;
}
}
} while (dent);
closedir(dp);
}
return strdup(real_debug_file.c_str());
}
void bfd_handle::free_syms_if() {
if (syms != NULL) {
free(syms);
syms = NULL;
}
}
void bfd_handle::free_st_if() {
if (st != NULL) {
delete st;
st = NULL;
}
}
bool bfd_handle::has_debug() const { return has_debug_symbols; }
int bfd_handle::get_file_line(ulong addr,
const char** file,
const char** function,
uint* lineno) const {
return bfd_find_nearest_line(
abfd, dbgsec, syms, addr - 1, file, function, lineno);
}
void bfd_handle::close_all() {
free_st_if();
free_syms_if();
close();
if (debug_file)
free(debug_file);
}
void bfd_handle::init(const char* file = nullptr) {
abfd = bfd_openr(file ? file : filename, NULL);
if (!abfd) {
fprintf(stderr, "Failed at bfd_openr! %s\n", file ? file : filename);
exit(1);
}
bfd_check_format(abfd, bfd_object);
assert((bfd_get_file_flags(abfd) & HAS_SYMS) != 0);
}
void bfd_handle::debug_init() {
close();
init(debug_file);
}
bfd* bfd_handle::get() { return abfd; }
void bfd_handle::close() {
if (abfd)
bfd_close(abfd);
abfd = NULL;
}
void load_stopper_symbols(symbol_table* sorted_st,
bool relative,
ulong addr_begin) {
stopper_symbol* matched_stopper = nullptr;
for (const symbol_ent &found_symbol : sorted_st->symbols) {
if (matched_stopper) {
matched_stopper->addr_end = found_symbol.addr;
if (relative) {
matched_stopper->addr_end += addr_begin;
}
matched_stopper = nullptr;
}
const std::size_t current_length = std::strlen(found_symbol.name);
for (stopper_symbol &symbol : stopper_symbols) {
if (symbol.name.size() == current_length &&
std::memcmp(symbol.name.data(), found_symbol.name, current_length - 1) == 0) {
symbol.addr_begin = found_symbol.addr;
if (relative) {
symbol.addr_begin += addr_begin;
}
matched_stopper = &symbol;
}
}
}
}
void bfd_handle::load_symbols(bool relative, ulong addr_begin) {
st = new symbol_table();
load_debug_section_if();
asection* const text_sec = bfd_get_section_by_name(abfd, ".text");
if (text_sec) {
st->text_vma = text_sec->vma;
st->text_size = text_sec->size;
}
symcnt = bfd_read_minisymbols(abfd, 0, (void**)&syms, &size);
if (!symcnt) {
free_syms_if();
symcnt = bfd_read_minisymbols(abfd, 1, (void**)&syms, &size);
dynamic = 1;
}
asymbol* store = bfd_make_empty_symbol(abfd);
assert(store);
bfd_byte* p = (bfd_byte*)syms;
bfd_byte* pend = p + symcnt * size;
for (; p < pend; p += size) {
asymbol* sym = bfd_minisymbol_to_symbol(abfd, dynamic, p, store);
if ((sym->flags & BSF_FUNCTION) == 0) {
continue;
}
symbol_info sinfo;
bfd_get_symbol_info(abfd, sym, &sinfo);
if (sinfo.type != 'T' && sinfo.type != 't' && sinfo.type != 'W' &&
sinfo.type != 'w') {
continue;
}
DBG(40, "%s %lx f=%x", sinfo.name, (long)sinfo.value, (int)sym->flags);
if (startwith(sinfo.name, "__tcf"))
continue;
if (startwith(sinfo.name, "__tz"))
continue;
st->symbols.emplace_back(sinfo.value, sinfo.name);
}
std::sort(st->symbols.begin(), st->symbols.end(), std::less<symbol_ent>());
load_stopper_symbols(st, relative, addr_begin);
}
void bfd_handle::load_debug_section_if() {
dbgsec = bfd_get_section_by_name(abfd, ".debug_info");
if (!dbgsec) {
debug_file = find_debug_file(filename);
if (debug_file && strlen(debug_file) > 0) {
DBG(3, "Reading debug file %s, original(%s) ..", debug_file, filename);
debug_init();
dbgsec = bfd_get_section_by_name(abfd, ".debug_info");
}
}
if (dbgsec) {
DBG(3, "has debug symbols on %s", debug_file ? debug_file : filename);
has_debug_symbols = true;
} else {
DBG(1, "No debug symbols found on %s", filename);
has_debug_symbols = false;
}
}
bool check_shlib(const std::string& fn) {
auto_fp fp(fopen(fn.c_str(), "r"));
if (fp == 0) {
return false;
}
elf_version(EV_CURRENT);
Elf* elf = elf_begin(fileno(fp), ELF_C_READ, nullptr);
if (elf == 0) {
return false;
}
ulong vaddr = 0;
#if defined(__i386__)
Elf32_Ehdr* const ehdr = elf32_getehdr(elf);
Elf32_Phdr* const phdr = elf32_getphdr(elf);
#else
Elf64_Ehdr* const ehdr = elf64_getehdr(elf);
Elf64_Phdr* const phdr = elf64_getphdr(elf);
#endif
const int num_phdr = ehdr->e_phnum;
for (int i = 0; i < num_phdr; ++i) {
#if defined(__i386__)
Elf32_Phdr* const p = phdr + i;
#else
Elf64_Phdr* const p = phdr + i;
#endif
if (p->p_type == PT_LOAD && (p->p_flags & 1) != 0) {
vaddr = p->p_vaddr;
break;
}
}
elf_end(elf);
return vaddr == 0;
}
bool file_exists(const char* filename) {
if (FILE* file = fopen(filename, "r")) {
fclose(file);
return true;
}
return false;
}
bool has_exec_permission(const char* filename) {
struct stat results;
stat(filename, &results);
if (results.st_mode & S_IXUSR)
return true;
return false;
}
void read_proc_map_ent(const std::string& line,
proc_info& pinfo,
symbol_table_map* stmap) {
bool delete_marked = false;
std::istringstream line_sin(line);
std::string tok;
std::array<std::string, 7> tokens;
std::size_t token_index = 0;
while (line_sin >> tok && token_index < tokens.size()) {
tokens[token_index] = std::move(tok);
++token_index;
}
if (token_index < 6) {
return;
} else if (token_index > 6 && startwith(tokens[6], "(deleted")) {
delete_marked = true;
}
const std::string& perms = tokens[1];
if (perms.size() == 5 && perms[3] != 'x') {
return;
}
ulong a0 = 0, a1 = 0;
sscanf(line.c_str(), "%lx-%lx", &a0, &a1);
proc_map_ent e;
e.addr_begin = a0;
e.addr_size = a1 - a0;
e.offset = std::stol(tokens[2], nullptr, 16);
e.path = std::move(tokens[5]);
if (e.path.empty()) {
return;
} else if (e.path == "[vdso]") {
e.is_vdso = true;
} else if (startwith(e.path, "[")) {
return;
} else {
if (delete_marked && !file_exists(e.path.c_str()))
return;
if (!has_exec_permission(e.path.c_str()))
return;
e.stbl = stmap->get(e.path.c_str());
e.relative = check_shlib(e.path);
if (!e.stbl) {
bfd_handle* bh = new bfd_handle(e.path.c_str());
bh->init();
bh->load_symbols(e.relative, e.addr_begin);
stmap->set(e.path.c_str(), bh->st);
e.stbl = bh->st;
e.stbl->bh = bh;
}
}
DBG(10,
"%s: relative=%d addr_begin=%016lx",
e.path.c_str(),
(int)e.relative,
e.addr_begin);
pinfo.maps.push_back(std::move(e));
}
void read_proc_maps(int pid, proc_info& pinfo, symbol_table_map* stmap) {
const std::string maps_file_path = "/proc/" + std::to_string(pid) + "/maps";
std::ifstream maps_file(maps_file_path);
if (!maps_file.is_open()) {
return;
}
std::string line;
while (std::getline(maps_file, line)) {
read_proc_map_ent(line, pinfo, stmap);
}
std::sort(pinfo.maps.begin(), pinfo.maps.end(), std::less<proc_map_ent>());
}
const symbol_ent* find_symbol(const symbol_table* st,
ulong addr,
bool& is_text_r,
ulong& pos_r,
ulong& offset_r) {
is_text_r = false;
pos_r = 0;
offset_r = 0;
const symbol_table::symbols_type& ss = st->symbols;
symbol_table::symbols_type::const_iterator j =
std::upper_bound(ss.begin(), ss.end(), symbol_ent(addr, nullptr));
if (j != ss.begin()) {
--j;
} else {
return 0;
}
if (j == ss.end()) {
return 0;
}
is_text_r =
(j->addr >= st->text_vma && j->addr < st->text_vma + st->text_size);
pos_r = j - ss.begin();
offset_r = addr - j->addr;
return &*j;
}
bool match_basic_lib(const std::string& path) {
for (const std::string &basic_lib : basic_libs) {
if (startwith(basename(path), basic_lib)) {
return true;
}
}
return false;
}
int pinfo_symbol_exists(const proc_info& pinfo, ulong addr) {
/* 0: not exists, 1: core library, 2: others */
int symbol_type = 0;
auto i = std::upper_bound(
pinfo.maps.begin(), pinfo.maps.end(), proc_map_ent(addr));
if (i != pinfo.maps.begin()) {
--i;
} else {
i = pinfo.maps.end();
}
if (i == pinfo.maps.end()) {
DBG(30, "%lx not found", addr);
} else if (addr >= i->addr_begin + i->addr_size) {
DBG(30,
"%lx out of range [%lx %lx]",
addr,
i->addr_begin,
i->addr_begin + i->addr_size);
} else if (!i->stbl || !i->stbl->bh) {
DBG(30, "%lx no symbol found", addr);
} else {
symbol_type = 2;
if (match_basic_lib(i->path)) {
symbol_type = 1;
DBG(10, "Matched basic libs %s", i->path.c_str());
}
}
return symbol_type;
}
const symbol_ent* pinfo_find_symbol(
const proc_info& pinfo,
const ulong addr,
ulong& offset_r,
ulong& maps_offset,
ulong& relative_addr,
const bool ignore_basic_libs = false) {
offset_r = 0;
auto i = std::upper_bound(
pinfo.maps.begin(), pinfo.maps.end(), proc_map_ent(addr));
if (i != pinfo.maps.begin()) {
--i;
} else {
i = pinfo.maps.end();
}
if (i == pinfo.maps.end()) {
DBG(30, "%lx not found", addr);
} else if (addr >= i->addr_begin + i->addr_size) {
DBG(30,
"%lx out of range [%lx %lx]",
addr,
i->addr_begin,
i->addr_begin + i->addr_size);
} else if (!i->stbl || !i->stbl->bh) {
DBG(30, "%lx no symbol found", addr);
if (i->is_vdso) {
offset_r = addr - i->addr_begin;
}
} else {
if (ignore_basic_libs) {
if (match_basic_lib(i->path)) {
DBG(10, "Matched basic libs2 %s", i->path.c_str());
return nullptr;
}
}
ulong a = addr;
if (i->relative) {
a -= i->addr_begin;
relative_addr = a;
}
ulong pos = 0;
ulong offset = 0;
bool is_text = false;
const symbol_ent* const e = find_symbol(i->stbl, a, is_text, pos, offset);
if (e != 0 && is_text) {
offset_r = offset;
maps_offset = i - pinfo.maps.begin();
return e;
}
}
return nullptr;
}
bool is_stopper_addr(ulong addr) {
for (const stopper_symbol &symbol : stopper_symbols) {
if (symbol.addr_begin < addr && symbol.addr_end > addr) {
return true;
}
}
return false;
}
int get_stack_trace(int pid,
proc_info& pinfo,
uint maxlen,
const user_regs_struct& regs,
std::vector<ulong>& vals_r) {
uint i = 0;
// candidate for the next stack address
ulong next_likely_sp = 0;
// address to start re-scanning if getting invalid addresses
ulong rollback_addr = 0;
bool matched_top_sp = false;
uint error_count = 0;
uint n_frames = 0;
uint n_scanned = 0;
bool top_addr_is_user_func = 0;
uint n_scanned_from_last_frame = 0;
bool sp_jumped = false;
ulong sp = regs.STACK_SP;
ulong top_addr = regs.STACK_IP;
ulong top_sp = sp;
// needs special care for second addr
ulong second_addr = 0;
DBG(10, "Top addr %016lx", top_addr);
DBG(10, "Top sp: %016lx", sp);
vals_r.push_back(top_addr);
n_frames++;
if (is_stopper_addr(top_addr)) {
DBG(3, "Matched stopper func.", 0);
return 0;
}
if (pinfo_symbol_exists(pinfo, top_addr) == 2) {
DBG(10, "Top addr is user func.", "");
top_addr_is_user_func = true;
}
for (i = 0; i < maxlen; ++i) {
ulong retaddr = 0;
retaddr = ptrace(PTRACE_PEEKDATA, pid, sp, 0);
if (errno != 0) {
DBG(3, "Got error %d on PTRACE_PEEKDATA", errno);
break;
}
n_scanned++;
n_scanned_from_last_frame++;
DBG(10, "SP %016lx", sp);
DBG(10, "Got addr %016lx", retaddr);
DBG(10, "Frame count %d", n_frames);
sp += sizeof(long);
if (next_likely_sp < sp) {
next_likely_sp = 0;
}
if (retaddr == 0) {
continue;
}
if (retaddr == top_sp) {
DBG(10,
"Addr matched top sp %016lx. "
"Dropping previously scanned blocks.",
retaddr);
matched_top_sp = true;
if (n_frames >= 2) {
vals_r.clear();
vals_r.push_back(top_addr);
n_scanned_from_last_frame = 0;
n_frames = 1;
sp_jumped = false;
}
}
if (pinfo.maps.empty()) {
continue;
}
int symbol_type = pinfo_symbol_exists(pinfo, retaddr);
DBG(10, "Got symbol type %d", symbol_type);
if (symbol_type) {
error_count = 0;
if (frame_check && symbol_type == 2 && n_scanned_from_last_frame >= 3 &&
((!matched_top_sp && n_scanned_from_last_frame >= 10) ||
n_frames >= 2 || top_addr_is_user_func) &&
!next_likely_sp) {
DBG(10, "Non target addr %016lx", retaddr);
} else {
if (next_likely_sp) {
DBG(10, "Jumping to next likely sp %016lx", next_likely_sp);
rollback_addr = sp - sizeof(long);
sp_jumped = true;
sp = next_likely_sp;
}
n_frames++;
n_scanned_from_last_frame = 0;
DBG(10, "Pushed addr %016lx", retaddr);
vals_r.push_back(retaddr);
next_likely_sp = 0;
if (n_frames == 2 && !second_addr) {
DBG(10, " This is second frame addr.");
second_addr = retaddr;
}
}
} else {
error_count++;
if (retaddr >= sp + sizeof(long) && retaddr < sp + max_frame_size) {
DBG(10, "retaddr is in sp range", "");
error_count = 0;
} else if (frame_check && error_count >= 2) {
next_likely_sp = 0;
if (rollback_addr && sp_jumped) {
DBG(10,
"Previous next likely sp was invalid."
"Scanning from %016lx",
rollback_addr);
sp = rollback_addr;
rollback_addr = 0;
// n_scanned= n_scanned - error_count;
error_count = 0;
sp_jumped = false;
if (!matched_top_sp || n_frames >= 2) {
vals_r.clear();
vals_r.push_back(top_addr);
n_scanned_from_last_frame = 0;
}
n_frames = 1;
continue;
}
}
}
if (is_stopper_addr(retaddr)) {
DBG(3, "Matched stopper func.", 0);
if (vals_r.size() == 2 && second_addr && second_addr != retaddr) {
DBG(10, "Putting second_addr.");
vals_r.pop_back();
vals_r.push_back(second_addr);
vals_r.push_back(retaddr);
}
break;
}
bool do_rollback = false;
if (retaddr >= sp + sizeof(long) && retaddr < sp + max_frame_size) {
if (next_likely_sp && n_frames <= 2) {
DBG(10,
"Finding Next Likely sp consecutive times. "
"Previously pushed addr was invalid");
do_rollback = true;
}
next_likely_sp = retaddr;
if (retaddr > sp + sizeof(long)) {
sp_jumped = true;
} else {
sp_jumped = false;
}
DBG(10, "Next Likely SP: %016lx", next_likely_sp);
}
if (sp_jumped && frame_check) {
if (n_scanned_from_last_frame >= 5 && n_frames >= 3) {
DBG(10,
"Scanned %d blocks from the last frame. This is invalid.",
n_scanned_from_last_frame);
do_rollback = true;
} else if (symbol_type == 1 && n_frames >= 3 &&
!is_stopper_addr(retaddr)) {
DBG(10,
"Matched core lib symbol type in the middle of stack frames. "
"This is invalid.");
do_rollback = true;
}
}
if (do_rollback) {
if (rollback_addr) {
DBG(10, "Scanning from %016lx", rollback_addr);
sp = rollback_addr;
rollback_addr = 0;
}
vals_r.clear();
vals_r.push_back(top_addr);
n_scanned_from_last_frame = 0;
n_frames = 1;
sp_jumped = false;
}
}
DBG(3, "Scanned %d blocks.", n_scanned);
return 0;
}
char* get_demangled_symbol(const char* symbol_name) {
uint arg = DMGL_ANSI;
if (print_arg) {
arg |= DMGL_PARAMS;
arg |= DMGL_TYPES;
}
char* demangled = cplus_demangle(symbol_name, arg);
if (!demangled) {
demangled = strdup(symbol_name);
}
return demangled;
}
void parse_stack_trace(const proc_info& pinfo,
const std::vector<ulong>& vals_sps,
size_t maxlen) {
char buf[128];
uint rank = 1;
std::string rstr;
for (size_t i = 0; i < std::min(vals_sps.size(), maxlen); ++i) {
std::stringstream out;
const char *file, *name;
uint lineno;
ulong addr = vals_sps[i];
ulong rel_addr = 0;
ulong offset = 0;
ulong maps_offset = 0;
char* demangled;
DBG(11, "addr: %016lx %ld %ld", addr, vals_sps.size(), maxlen);
bool ignore_basic_libs = true;
if (i == 0 || i == std::min(vals_sps.size(), maxlen) - 1) {
ignore_basic_libs = false;
}
const symbol_ent* e = pinfo_find_symbol(
pinfo, addr, offset, maps_offset, rel_addr, ignore_basic_libs);
if (e != 0) {
if (offset != 0) {
if (!single_line) {
snprintf(buf, sizeof(buf), "#%02d ", rank++);
out << buf;
snprintf(buf, sizeof(buf), "0x%016lx", addr);
out << buf;
out << " in ";
demangled = get_demangled_symbol(e->name);
out << demangled;
free(demangled);
if (!print_arg) {
out << " ()";
}
const proc_map_ent& proc_maps_ent = pinfo.maps[maps_offset];
const bfd_handle* bh = proc_maps_ent.stbl->bh;
if (bh->has_debug() && line_numbers) {
int ret;
ret = bh->get_file_line(
rel_addr ? rel_addr : addr, &file, &name, &lineno);
if (ret && file) {
if (basename_only) {
file = basename(file);
}
out << " from ";
out << file;
out << ":";
out << lineno;
out << "";
}
} else {
out << " from " << (basename_only ? basename(proc_maps_ent.path)
: proc_maps_ent.path);
}
print_stack("%s\n", out.str().c_str());
} else {
if (!rstr.empty()) {
rstr += ":";
}
demangled = get_demangled_symbol(e->name);
rstr += demangled;
free(demangled);
}
}
}
}
if (!rstr.empty()) {
print_stack("%s\n", rstr.c_str());
}
}
int ptrace_attach_proc(int pid) {
if (ptrace(PTRACE_ATTACH, pid, 0, 0) != 0) {
if (errno == ESRCH) {
DBG(11, "No such process: %d", pid);
return ESRCH;
} else {
perror("ptrace(PTRACE_ATTACH)");
return -1;
}
}
int st = 0;
const pid_t v = waitpid(pid, &st, __WALL | WUNTRACED);
if (v < 0) {
perror("waitpid");
return -1;
}
return 0;
}
int ptrace_detach_proc(int pid) {
if (ptrace(PTRACE_DETACH, pid, 0, 0) != 0) {
perror("ptrace(PTRACE_DETACH)");
return -1;
}
return 0;
}
int get_tgid(int target_pid) {
int tgid = -1;
const std::string status_file_path =
"/proc/" + std::to_string(target_pid) + "/status";
std::ifstream status_file(status_file_path);
if (!status_file.is_open()) {