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
|
/*
* Copyright (c) 2013, Ford Motor Company
* All rights reserved.
*
* Redistribution and use in source and binary forms, with or without
* modification, are permitted provided that the following conditions are met:
*
* Redistributions of source code must retain the above copyright notice, this
* list of conditions and the following disclaimer.
*
* Redistributions in binary form must reproduce the above copyright notice,
* this list of conditions and the following
* disclaimer in the documentation and/or other materials provided with the
* distribution.
*
* Neither the name of the Ford Motor Company nor the names of its contributors
* may be used to endorse or promote products derived from this software
* without specific prior written permission.
*
* THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS"
* AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
* IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
* ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT HOLDER OR CONTRIBUTORS BE
* LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR
* CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF
* SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS
* INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN
* CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE)
* ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE
* POSSIBILITY OF SUCH DAMAGE.
*/
#include "utils/back_trace.h"
#include <algorithm>
#include <sstream>
#include <vector>
//#include <cxxabi.h>
//#include <execinfo.h>
#include "utils/macro.h"
using std::ostream;
using std::string;
using std::vector;
using threads::Thread;
namespace utils {
//namespace {
//string demangle(const char* symbol) {
// char temp[2048];
// if (1 == sscanf(symbol, "%*[^(]%*[^_]%2047[^)+]", temp)) {
// size_t size;
// int32_t status;
// char* demangled = abi::__cxa_demangle(temp, NULL, &size, &status);
// if (demangled != NULL) {
// string result(demangled);
// free(demangled);
// return result;
// }
// }
// return symbol;
//}
//} // namespace
Backtrace::Backtrace(int32_t count, int32_t skip_top)
: thread_id_(threads::Thread::CurrentId()) {
int32_t skip = skip_top + 1; // Skip this constructor
vector<void*> full_trace(count + skip);
// int32_t captured = backtrace(&full_trace.front(), count + skip);
// int32_t first_call = std::min(captured, skip);
// int32_t last_call = std::min(first_call + count, captured);
// backtrace_.assign(full_trace.begin() + first_call,
// full_trace.begin() + last_call);
}
Backtrace::~Backtrace() {}
vector<string> Backtrace::CallStack() const {
vector<string> callstack;
// callstack.reserve(backtrace_.size());
// char** mangled = backtrace_symbols(&backtrace_.front(), backtrace_.size());
// for (size_t i = 0; i != backtrace_.size(); ++i) {
// callstack.push_back(demangle(mangled[i]));
// }
// free(mangled);
return callstack;
}
threads::PlatformThreadHandle Backtrace::ThreadId() const {
return thread_id_;
}
ostream& operator<<(ostream& os, const Backtrace& bt) {
const vector<string> symbols = bt.CallStack();
os << "Stack trace (" << bt.ThreadId() << ")\n";
if (symbols.empty()) {
os << "Not available" << std::endl;
} else
for (size_t i = 0; i < symbols.size(); ++i) {
os << symbols[i] << std::endl;
}
return os;
}
} // namespace utils
|
