LSSTApplications  18.0.0+106,18.0.0+50,19.0.0,19.0.0+1,19.0.0+10,19.0.0+11,19.0.0+13,19.0.0+17,19.0.0+2,19.0.0-1-g20d9b18+6,19.0.0-1-g425ff20,19.0.0-1-g5549ca4,19.0.0-1-g580fafe+6,19.0.0-1-g6fe20d0+1,19.0.0-1-g7011481+9,19.0.0-1-g8c57eb9+6,19.0.0-1-gb5175dc+11,19.0.0-1-gdc0e4a7+9,19.0.0-1-ge272bc4+6,19.0.0-1-ge3aa853,19.0.0-10-g448f008b,19.0.0-12-g6990b2c,19.0.0-2-g0d9f9cd+11,19.0.0-2-g3d9e4fb2+11,19.0.0-2-g5037de4,19.0.0-2-gb96a1c4+3,19.0.0-2-gd955cfd+15,19.0.0-3-g2d13df8,19.0.0-3-g6f3c7dc,19.0.0-4-g725f80e+11,19.0.0-4-ga671dab3b+1,19.0.0-4-gad373c5+3,19.0.0-5-ga2acb9c+2,19.0.0-5-gfe96e6c+2,w.2020.01
LSSTDataManagementBasePackage
Backtrace.cc
Go to the documentation of this file.
1 // -*- lsst-c++ -*-
2 
3 /*
4  * LSST Data Management System
5  * Copyright 2008-2017 AURA/LSST.
6  *
7  * This product includes software developed by the
8  * LSST Project (http://www.lsst.org/).
9  *
10  * This program is free software: you can redistribute it and/or modify
11  * it under the terms of the GNU General Public License as published by
12  * the Free Software Foundation, either version 3 of the License, or
13  * (at your option) any later version.
14  *
15  * This program is distributed in the hope that it will be useful,
16  * but WITHOUT ANY WARRANTY; without even the implied warranty of
17  * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
18  * GNU General Public License for more details.
19  *
20  * You should have received a copy of the LSST License Statement and
21  * the GNU General Public License along with this program. If not,
22  * see <https://www.lsstcorp.org/LegalNotices/>.
23  */
24 
25 #if defined(LSST_UTILS_BACKTRACE_ENABLE) && (defined(__clang__) || defined(__GNUC__))
26 
27 #include <cerrno>
28 #include <cstdio>
29 #include <cstdlib>
30 #include <csignal>
31 
32 #include <cxxabi.h>
33 #include <execinfo.h>
34 
35 #include <regex>
36 
37 #include "lsst/utils/Backtrace.h"
38 
39 namespace lsst {
40 namespace utils {
41 
42 namespace {
43 
45 static constexpr size_t MAX_FRAMES = 128;
47 static constexpr size_t NAME_SIZE_ESTIMATE = 1024;
48 
61 char *demangleAndPrint(char *input, char *buffer, size_t *bufferSize) noexcept {
62  int status = 1;
63 
64  try {
65  std::cmatch matches;
66  std::regex rgx(
67  "(.*[\\s|\\(])" // before
68  "(_\\w+)" // mangled name
69  "(.*\\+.*)" // after
70  );
71 
72  if (std::regex_match(input, matches, rgx)) {
73  buffer = abi::__cxa_demangle(matches.str(2).c_str(), buffer, bufferSize, &status);
74  fprintf(stderr, "%s%s%s\n", matches.str(1).c_str(), buffer, matches.str(3).c_str());
75  }
76  } catch(const std::regex_error &e) {
77  fprintf(stderr, "[demangleAndPrint] %s\n", e.what());
78  status = 1;
79  } catch(const std::runtime_error &e) {
80  fprintf(stderr, "[demangleAndPrint] %s\n", e.what());
81  status = 1;
82  } catch(const std::exception &e) {
83  fprintf(stderr, "[demangleAndPrint] %s\n", e.what());
84  status = 1;
85  } catch(...) {
86  fprintf(stderr, "[demangleAndPrint] unknown error occurred in demangling\n");
87  status = 1;
88  }
89 
90  if (status != 0) {
91  // no name found to demangle or name demangling failed
92  fprintf(stderr, "%s\n", input);
93  }
94  return buffer;
95 }
96 
104 void raiseWithDefaultHandler(int signum) noexcept {
105  signal(signum, SIG_DFL);
106  raise(signum);
107 }
108 
114 void signalHandler(int signum) noexcept {
115  fprintf(stderr, "Caught signal %d, backtrace follows:\n", signum);
116 
117  // retrieve current stack addresses
118  void *addressList[MAX_FRAMES + 1];
119  size_t addressLength = backtrace(addressList, MAX_FRAMES);
120  if (addressLength == 0) {
121  fprintf(stderr, " \n");
122  return;
123  }
124 
125  // translate the addresses into an array of strings
126  // that describe the addresses symbolically.
127  // return value symbolList is malloc'ed and must be free'd
128  char **symbolList = backtrace_symbols(addressList, addressLength);
129  if (symbolList == NULL) {
130  fprintf(stderr, "[backtrace_symbols] cannot dump trace, probably out of memory\n");
131  raiseWithDefaultHandler(signum);
132  }
133 
134  // allocate storage for demangled name
135  // this will be reallocated by abi::__cxa_demangle in demangleAndPrint
136  // if storage is insufficient, but if it is sufficient
137  // this reduces the number of allocations
138  size_t nameSize = NAME_SIZE_ESTIMATE;
139  char *name = (char *)malloc(nameSize * sizeof(char));
140  if (name == NULL) {
141  fprintf(stderr, "[malloc] cannot dump trace, probably out of memory\n");
142  raiseWithDefaultHandler(signum);
143  }
144 
145  for (size_t i = 0; i < addressLength; ++i) {
146  if (char *buffer = demangleAndPrint(symbolList[i], name, &nameSize)) {
147  // buffer may have been realloc'ed
148  name = buffer;
149  }
150  }
151 
152  free(name);
153  free(symbolList);
154  raiseWithDefaultHandler(signum);
155 }
156 
157 } // namespace
158 
159 Backtrace::Backtrace() noexcept : enabled(true) {
160  // Register abort handlers
161  signal(SIGABRT, signalHandler);
162  signal(SIGSEGV, signalHandler);
163  signal(SIGILL, signalHandler);
164  signal(SIGFPE, signalHandler);
165 }
166 
167 } // namespace utils
168 } // namespace lsst
169 
170 #else
171 
172 #include "lsst/utils/Backtrace.h"
173 
174 namespace lsst {
175 namespace utils {
176 
177 Backtrace::Backtrace() noexcept : enabled(false) {}
178 
179 } // namespace utils
180 } // namespace lsst
181 
182 #endif
T regex_match(T... args)
T free(T... args)
A base class for image defects.
T what(T... args)
T str(T... args)
T signal(T... args)
STL class.
T malloc(T... args)
T fprintf(T... args)