1 /* 2 * Copyright (C) 2012 The Android Open Source Project 3 * All rights reserved. 4 * 5 * Redistribution and use in source and binary forms, with or without 6 * modification, are permitted provided that the following conditions 7 * are met: 8 * * Redistributions of source code must retain the above copyright 9 * notice, this list of conditions and the following disclaimer. 10 * * Redistributions in binary form must reproduce the above copyright 11 * notice, this list of conditions and the following disclaimer in 12 * the documentation and/or other materials provided with the 13 * distribution. 14 * 15 * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS 16 * "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT 17 * LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS 18 * FOR A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE 19 * COPYRIGHT OWNER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, 20 * INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, 21 * BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS 22 * OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED 23 * AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, 24 * OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT 25 * OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF 26 * SUCH DAMAGE. 27 */ 28 29 #include <dlfcn.h> 30 #include <errno.h> 31 #include <inttypes.h> 32 #include <malloc.h> 33 #include <pthread.h> 34 #include <string.h> 35 #include <sys/types.h> 36 #include <unistd.h> 37 #include <unwind.h> 38 39 #include <demangle.h> 40 41 #include "backtrace.h" 42 #include "debug_log.h" 43 #include "MapData.h" 44 45 #if defined(__LP64__) 46 #define PAD_PTR "016" PRIxPTR 47 #else 48 #define PAD_PTR "08" PRIxPTR 49 #endif 50 51 typedef struct _Unwind_Context __unwind_context; 52 53 extern "C" char* __cxa_demangle(const char*, char*, size_t*, int*); 54 55 static MapData g_map_data; 56 static const MapEntry* g_current_code_map = nullptr; 57 58 static _Unwind_Reason_Code find_current_map(__unwind_context* context, void*) { 59 uintptr_t ip = _Unwind_GetIP(context); 60 61 if (ip == 0) { 62 return _URC_END_OF_STACK; 63 } 64 g_current_code_map = g_map_data.find(ip); 65 return _URC_END_OF_STACK; 66 } 67 68 void backtrace_startup() { 69 _Unwind_Backtrace(find_current_map, nullptr); 70 } 71 72 void backtrace_shutdown() { 73 } 74 75 struct stack_crawl_state_t { 76 uintptr_t* frames; 77 size_t frame_count; 78 size_t cur_frame = 0; 79 80 stack_crawl_state_t(uintptr_t* frames, size_t frame_count) 81 : frames(frames), frame_count(frame_count) {} 82 }; 83 84 static _Unwind_Reason_Code trace_function(__unwind_context* context, void* arg) { 85 stack_crawl_state_t* state = static_cast<stack_crawl_state_t*>(arg); 86 87 uintptr_t ip = _Unwind_GetIP(context); 88 89 // The instruction pointer is pointing at the instruction after the return 90 // call on all architectures. 91 // Modify the pc to point at the real function. 92 if (ip != 0) { 93 #if defined(__arm__) 94 // If the ip is suspiciously low, do nothing to avoid a segfault trying 95 // to access this memory. 96 if (ip >= 4096) { 97 // Check bits [15:11] of the first halfword assuming the instruction 98 // is 32 bits long. If the bits are any of these values, then our 99 // assumption was correct: 100 // b11101 101 // b11110 102 // b11111 103 // Otherwise, this is a 16 bit instruction. 104 uint16_t value = (*reinterpret_cast<uint16_t*>(ip - 2)) >> 11; 105 if (value == 0x1f || value == 0x1e || value == 0x1d) { 106 ip -= 4; 107 } else { 108 ip -= 2; 109 } 110 } 111 #elif defined(__aarch64__) 112 // All instructions are 4 bytes long, skip back one instruction. 113 ip -= 4; 114 #elif defined(__i386__) || defined(__x86_64__) 115 // It's difficult to decode exactly where the previous instruction is, 116 // so subtract 1 to estimate where the instruction lives. 117 ip--; 118 #endif 119 120 // Do not record the frames that fall in our own shared library. 121 if (g_current_code_map && (ip >= g_current_code_map->start) && ip < g_current_code_map->end) { 122 return _URC_NO_REASON; 123 } 124 } 125 126 state->frames[state->cur_frame++] = ip; 127 return (state->cur_frame >= state->frame_count) ? _URC_END_OF_STACK : _URC_NO_REASON; 128 } 129 130 size_t backtrace_get(uintptr_t* frames, size_t frame_count) { 131 stack_crawl_state_t state(frames, frame_count); 132 _Unwind_Backtrace(trace_function, &state); 133 return state.cur_frame; 134 } 135 136 std::string backtrace_string(const uintptr_t* frames, size_t frame_count) { 137 std::string str; 138 139 for (size_t frame_num = 0; frame_num < frame_count; frame_num++) { 140 uintptr_t offset = 0; 141 const char* symbol = nullptr; 142 143 Dl_info info; 144 if (dladdr(reinterpret_cast<void*>(frames[frame_num]), &info) != 0) { 145 offset = reinterpret_cast<uintptr_t>(info.dli_saddr); 146 symbol = info.dli_sname; 147 } else { 148 info.dli_fname = nullptr; 149 } 150 151 uintptr_t rel_pc = offset; 152 const MapEntry* entry = g_map_data.find(frames[frame_num], &rel_pc); 153 154 const char* soname = (entry != nullptr) ? entry->name.c_str() : info.dli_fname; 155 if (soname == nullptr) { 156 soname = "<unknown>"; 157 } 158 159 char offset_buf[128]; 160 if (entry != nullptr && entry->offset != 0) { 161 snprintf(offset_buf, sizeof(offset_buf), " (offset 0x%" PRIxPTR ")", entry->offset); 162 } else { 163 offset_buf[0] = '\0'; 164 } 165 166 char buf[1024]; 167 if (symbol != nullptr) { 168 async_safe_format_buffer( 169 buf, sizeof(buf), " #%02zd pc %" PAD_PTR " %s%s (%s+%" PRIuPTR ")\n", frame_num, 170 rel_pc, soname, offset_buf, demangle(symbol).c_str(), frames[frame_num] - offset); 171 } else { 172 async_safe_format_buffer( 173 buf, sizeof(buf), " #%02zd pc %" PAD_PTR " %s%s\n", frame_num, rel_pc, soname, 174 offset_buf); 175 } 176 str += buf; 177 } 178 179 return str; 180 } 181 182 void backtrace_log(const uintptr_t* frames, size_t frame_count) { 183 error_log_string(backtrace_string(frames, frame_count).c_str()); 184 } 185
